Herbert Baier

Followers

Following

Co-author

Public Views

Luis Angel Osorio Rosales

Luciano Simoni

Università degli Studi di Padova

Timon Rabczuk

Bauhaus-University-Weimar

New York University

The University of New South Wales

Interests

Uploads

Papers by Herbert Baier

Higher-Order Approximation to the Guidewire Model Used in Simulators of Cardiac Catheterization and Multiple Segment Relaxations

PRESENCE: Virtual and Augmented Reality

Cardiac catheterism is important because it offers many advantages in comparison to open surgery,... more Cardiac catheterism is important because it offers many advantages in comparison to open surgery, for example, fewer injuries, lower risk of infections, and shorter recovery times. Simulators play a fundamental role in training packages, and virtual learning environments are less stressful. Moreover, they can also be used in certification boards and in performance assessments. A realistic and interactive simulator must be fast. In this work, the physical model of the guidewire used in catheter simulations has been improved. In particular, we determined a simple analytic expression to calculate the direction of a guidewire segment, which minimizes the total energy. The surface energy resulting from the guidewire--artery interaction and the bending energy of the guidewire is approximated up to the second order, which gives rise to interactions between segments. Furthermore, the multiple segment relaxations are introduced, enhancing the convergence especially at the beginning of the re...

Download

Matching Algorithms for Bipartite Graphs

This report is a rather concise summary of the first-named author&#x27;s M. Sc. Dissertation,... more This report is a rather concise summary of the first-named author&#x27;s M. Sc. Dissertation, written under the second-named author&#x27;s supervision.The matching problem in graphs consists in determining matchings,that is, vertex disjoint sets of edges of the graph. In particular,we are interested in finding maximum matchings, that is, matchingsof maximum cardinality. There are many variations aroundthis problem, the graph can be: bipartite or not, weighted or not.In this work we describe...

Method, system, and end user device for identifying a sender in a network

Matching Algorithms for Bipartite Graphs

This report is a rather concise summary of the first-named author's M. Sc. Dissertation, wri... more This report is a rather concise summary of the first-named author's M. Sc. Dissertation, written under the second-named author's supervision.The matching problem in graphs consists in determining matchings,that is, vertex disjoint sets of edges of the graph. In particular,we are interested in finding maximum matchings, that is, matchingsof maximum cardinality. There are many variations aroundthis problem, the graph can be: bipartite or not, weighted or not.In this work we describe...

Robot/Human Interfaces for Rescue Teams

IFAC Proceedings Volumes

On the Approximability of the Selection Problem

Under the assumption EXPTIME NEXPTIME, we show the nonexistence of polynomial-time bounded-error ... more Under the assumption EXPTIME NEXPTIME, we show the nonexistence of polynomial-time bounded-error approximation algorithms solving the M AX-Selection problem. In addition, a linear re- duction from the MAX2SAT problem to the MAX-Selection problem is given. Therefore, if there exists a polynomial-time approximation scheme for the MAX-Selection problem, then P NP.

conText - Intelligentes tutorielles System zum Training des Textverständnisses

ABSTRACT conText ist ein intelligentes tutorielles System zur Verbesserung des Leseverständnisses... more ABSTRACT conText ist ein intelligentes tutorielles System zur Verbesserung des Leseverständnisses von Sekundarschülerinnen und -schülern. Das Computerprogramm enthält 20 Sachtexte verschiedener Schwierigkeitsgrade, deren Inhalte die Schülerinnen und Schüler am Rechner schriftlich zusammenfassen sollen. conText analysiert diese Zusammenfassungen automatisch und gibt individuelle Rückmeldung darüber, ob einzelne Passagen der Zusammenfassung eventuell redundant oder irrelevant sind oder ob wichtige Inhalte des Originaltextes fehlen. Die Schülerinnen und Schüler erhalten dann die Gelegenheit, die Zusammenfassungen sukzessive zu verbessern. Auf diese Weise verwickelt das Programm die Jugendlichen in eine intensive Auseinandersetzung mit den Textinhalten. Gleichzeitig leitet es sie dazu an, die Inhalte der Originaltexte kompakter, kohärenter und vollständiger zu repräsentieren. Kognitive Prozesse und Strategien, die beim verstehenden Lesen zum Einsatz kommen, werden dabei implizit - durch gelenktes Üben - erworben. Wie durch eine Reihe internationaler Evaluationsstudien bestätigt wurde, ist das Zusammenfassen von Texten eine besonders effektive Methode zur Förderung des Leseverständnisses.

Method, System, and End User Device for Identifying a Sender in a Network

SUMMA-A LSA Integrated Developpement System

Latent Semantic Analysis (LSA) is a technique from the field of natural language processing. Its ... more Latent Semantic Analysis (LSA) is a technique from the field of natural language processing. Its method is completely statistical in nature, which permits to extract the relations between words based on their common occurrences in texts without any specification of rules or dictionaries. Despite the fact that LSA is only a statistical technique and does not yield real verbal intelligence, it exhibits an astonishing degree of expertise on tasks that afford verbal intelligence and semantic knowledge. The SUMMA platform is a robust and flexible technology that supports the users during the complete LSA development and test cycles. Furthermore, it can be used for productive purposes. The core of the system is the server. Several client applications ratify its effectiveness, versatility and confirm the viability of the LSA technology. The server is platform independent, supports most of the language encodings, and allows clients' remote communication and extensions to match individual requirements. The present paper discusses how SUMMA attaches the main phases in LSA development and test cycles and presents empirical results from applications. RÉSUMÉ. L'Analyse de la Sémantique Latente (LSA) est une technique qui relève du traitement automatique du langage naturel. Sa méthode est totalement statistique par nature, ce qui permet d'extraire des relations entre les mots basées sur leurs occurrences communes dans des textes sans avoirà spécifier des règles ouà recourirà des dictionnaires. En dépit du fait que LSA ne soit qu'une technique statistique, LSA témoigne d'unétonnant degré d'expertise Studia Informatica Universalis. dans des tâches qui requièrent de l'intelligence verbale et des connaissances sémantiques. La plateforme SUMMA est une technologie robuste et flexible qui assiste les utilisateurs durant le développement et les tests de LSA. De plus, la plateforme SUMMA peutêtre utiliséeà des foins applicatives. Le coeur du systèm est une serveur. Plusieurs applications client confirment son efficacité, sa polyvalence et confirment la viabilité de la technologie LSA. Le serveur est indépendant de la plateforme, il supporte la plupart des langages d'encodage, et permet des communications clientsà distance ainsi que des extensions correspondantà des besoins spécifiques. Le present article discute de la manière dont SUMMA articule les phases principales de développement et les cycles de test puis présente les resultants empiriques obtenus lors de diverses applications.

Download

Communication and data sharing in human-robot heterogenous teams

... Visual Graphical User Interface (GUI) allows to HE`s easy understanding special kind of ...... more

Lenhard et al-2011

The Analytic Polynomial-Time Hierarchy

ABSTRACT Motivated by results on interactive proof systems we investigate an ∃-∀hierarchy over P ... more ABSTRACT Motivated by results on interactive proof systems we investigate an ∃-∀hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following Classes: ∑, Π (k⩾0), PSPACE, ∑ or Π (k⩾1). This improves previous results by Orponen [6] and allows interesting comparisons with the above mentioned results on inter-active proof systems.

PeLoTe - a Heterogenous Telematic System for Cooperative Search and Rescue Missions

Human cooperation with robots receive increas- ing attention in many areas in order to deal with ... more Human cooperation with robots receive increas- ing attention in many areas in order to deal with tasks that are too difficult to be solved by humans alone. This paper presents main concepts in design of a hybrid telematic system for cooperative rescue operations in cases of emergencies or catas- trophes based on results of a user requirement analysis. A rescue squad of humans and tele-operated (semi)autonomous robots is expected to inspect selected spaces, rescue persons, etc. in emergency missions (e.g. fire, poisonous or infectious agent intoxication, etc.) and to interact with the environment. and collaborate in this mission one with another. Moreover, humans and robots in the field will cooperate with a telematic center in order to communicate and receive advices and assistance from the remote coordinator. The paper presents design concepts concerning system architecture, communica- tion and data exchange between entities, user interface design, localization and cooperative plan...

Human-computer interaction in the PeLoTe rescue system

IEEE International Safety, Security and Rescue Rototics, Workshop, 2005., 2005

Interaction between human rescue workers and rescue systems provide a great challenge. The propos... more Interaction between human rescue workers and rescue systems provide a great challenge. The proposed system consists of mobile robots that explore the emergency area, in order to reduce the risk for human life and a localization system for the human rescuers. Human and robotic team members are supported, guided and coordinated by a supervisor. Remote sensor data acquired by the team members as well as a priori information about environment and efficient, intuitive user interfaces provide the basis for decisions. This paper describes the designed graphical user interfaces and the experiments that where performed together with test participants, fire fighters as well as non fire fighters. In particular, results of a demonstration in a fire training house are summarized.

Download

On the Approximability of the Selection Problem

Bounding queries in the analytic polynomial-time hierarchy

Theoretical Computer Science, 1998

In a previous paper the present authors (Baier and Wagner, 1996) investigated an S-V-hierarchy ov... more In a previous paper the present authors (Baier and Wagner, 1996) investigated an S-V-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so-called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries and the recent PCP results which can be expressed by set quantifiers with a bounded number of queries motivated us to examine a hierarchy which extends the analytic polynomial-time hierarchy by considering restrictions on the number of oracle queries. This hierarchy is called bounded anulytic polynomial-time hierarchy. We show that every class from this hierarchy having a certain normal form coincides with one of the classes NP, coNP, PSPACE, Cy or II? (k> 1). All these characterizations remain valid if the queries are asked in a nonadaptive form, i.e. in "parallel".

Download

The Analytic Polynomial-Time Hierarchy

Mathematical Logic Quarterly, 1998

Motivated by results on interactive proof systems we investigate an 3-V-hierarchy over P using wo... more Motivated by results on interactive proof systems we investigate an 3-V-hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomial-time hierarchy, is called the analytic polynomial-time hierarchy. It is shown that every class of this hierarchy coincides with one of the following Classes: El;, II; (k 2 O) , PSPACE, C y p or IIyp (k 2 1). This improves previous results by Orponen [6] and allows interesting comparisons with the above mentioned results on interactive proof systems.

Download

ISAAC - InterSpecies Analysing Application using Containers

BMC Bioinformatics, 2014

Background: Information about genes, transcripts and proteins is spread over a wide variety of da... more Background: Information about genes, transcripts and proteins is spread over a wide variety of databases. Different tools have been developed using these databases to identify biological signals in gene lists from large scale analysis. Mostly, they search for enrichments of specific features. But, these tools do not allow an explorative walk through different views and to change the gene lists according to newly upcoming stories. Results: To fill this niche, we have developed ISAAC, the InterSpecies Analysing Application using Containers. The central idea of this web based tool is to enable the analysis of sets of genes, transcripts and proteins under different biological viewpoints and to interactively modify these sets at any point of the analysis. Detailed history and snapshot information allows tracing each action. Furthermore, one can easily switch back to previous states and perform new analyses. Currently, sets can be viewed in the context of genomes, protein functions, protein interactions, pathways, regulation, diseases and drugs. Additionally, users can switch between species with an automatic, orthology based translation of existing gene sets. As todays research usually is performed in larger teams and consortia, ISAAC provides group based functionalities. Here, sets as well as results of analyses can be exchanged between members of groups. Conclusions: ISAAC fills the gap between primary databases and tools for the analysis of large gene lists. With its highly modular, JavaEE based design, the implementation of new modules is straight forward. Furthermore, ISAAC comes with an extensive web-based administration interface including tools for the integration of third party data. Thus, a local installation is easily feasible. In summary, ISAAC is tailor made for highly explorative interactive analyses of gene, transcript and protein sets in a collaborative environment.

Download

Human hierarchization of semantic information in narratives and latent semantic analysis

Fridolin Wild, Marco Kalz, …

... Thomas & Legros, 2002). G. Denhière is with the Laboratoire CHArt, Cognitions Humaine et ... more

Hybrid telematic teams for search and rescue operations

… Workshop on Safety, …, 2004

During rescue operations fire fighters encounter often life-dangerous situations. Robots can assi... more During rescue operations fire fighters encounter often life-dangerous situations. Robots can assist to relieve the humans from dangerous tasks. Yet, at least for the near future, robots can only complement the human rescue personnel, who are endowed with far better adaptive capabilities. This paper presents an approach by joint teams of humans and robots working together under the management of a remote coordinator. The design of the system is based on the results of a user requirement analysis. The performance of the team is improved by means of localization features for robots and humans, data sharing between the team, planning capabilities, teleoperation and remote coordination attributes.

Download

Higher-Order Approximation to the Guidewire Model Used in Simulators of Cardiac Catheterization and Multiple Segment Relaxations

PRESENCE: Virtual and Augmented Reality

Download

Matching Algorithms for Bipartite Graphs