Refine
H-BRS Bibliography
- yes (98) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (54)
- Fachbereich Ingenieurwissenschaften und Kommunikation (20)
- Institute of Visual Computing (IVC) (18)
- Fachbereich Angewandte Naturwissenschaften (15)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (13)
- Fachbereich Wirtschaftswissenschaften (8)
- Institut für Cyber Security & Privacy (ICSP) (8)
- Institut für funktionale Gen-Analytik (IFGA) (8)
- Institut für Verbraucherinformatik (IVI) (3)
- Internationales Zentrum für Nachhaltige Entwicklung (IZNE) (3)
Document Type
- Conference Object (55)
- Article (32)
- Part of a Book (2)
- Preprint (2)
- Working Paper (2)
- Book (monograph, edited volume) (1)
- Conference Proceedings (1)
- Contribution to a Periodical (1)
- Doctoral Thesis (1)
- Report (1)
Year of publication
- 2014 (98) (remove)
Language
- English (98) (remove)
Has Fulltext
- no (98) (remove)
Keywords
- parallel breadth-first search (3)
- BFS (2)
- Exchangeable pairs (2)
- Garbage collection (2)
- Java virtual machine (2)
- NUMA (2)
- Stein’s method (2)
- data locality (2)
- education (2)
- memory bandwidth (2)
Robust Indoor Localization Using Optimal Fusion Filter For Sensors And Map Layout Information
(2014)
Adapting plans to changes in the environment by finding alternatives and taking advantage of opportunities is a common human behavior. The need for such behavior is often rooted in the uncertainty produced by our incomplete knowledge of the environment. While several existing planning approaches deal with such issues, artificial agents still lack the robustness that humans display in accomplishing their tasks. In this work, we address this brittleness by combining Hierarchical Task Network planning, Description Logics, and the notions of affordances and conceptual similarity. The approach allows a domestic service robot to find ways to get a job done by making substitutions. We show how knowledge is modeled, how the reasoning process is used to create a constrained planning problem, and how the system handles cases where plan generation fails due to missing/unavailable objects. The results of the evaluation for two tasks in a domestic service domain show the viability of the approach in finding and making the appropriate goal transformations.
Humans exhibit flexible and robust behavior in achieving their goals. We make suitable substitutions for objects, actions, or tools to get the job done. When opportunities that would allow us to reach our goals with less effort arise, we often take advantage of them. Robots are not nearly as robust in handling such situations. Enabling a domestic service robot to find ways to get a job done by making substitutions is the goal of our work. In this paper, we highlight the challenges faced in our approach to combine Hierarchical Task Network planning, Description Logics, and the notions of affordances and conceptual similarity. We present open questions in modeling the necessary knowledge, creating planning problems, and enabling the system to handle cases where plan generation fails due to missing/unavailable objects.
This paper gives an overview of the development of Fair Trade in six European countries: Austria, France, Germany, the Netherlands, Switzerland and the United Kingdom. After the description of the food retail industry and its market structures in these countries, the main European Fair Trade organizations are analyzed regarding their role within the Fair Trade system. The following part deals with the development of Fair Trade sales in general and with respect to the products coffee, tea, bananas, fruit juice and sugar. An overview of the main activities of national Fair Trade organizations, e.g. public relation activities, completes the analysis. This study shows the enormous upswing of Fair Trade during the last decade and the reasons for this development. Nevertheless, it comes to the conclusion that Fair Trade is still far away from being an essential part of the food retail industry in Europe.
Updating a shared data structure in a parallel program is usually done with some sort of high-level synchronization operation to ensure correctness and consistency. The realization of such high-level synchronization operations is done with appropriate low-level atomic synchronization instructions that the target processor architecture provides. These instructions are costly and often limited in their scalability on larger multi-core / multi-processor systems. In this paper, a technique is discussed that replaces atomic updates of a shared data structure with ordinary and cheaper read/write operations. The necessary conditions are specified that must be fulfilled to ensure overall correctness of the program despite missing synchronization. The advantage of this technique is the reduction of access costs as well as more scalability due to elided atomic operations. But on the other side, possibly more work has to be done caused by missing synchronization. Therefore, additional work is traded against costly atomic operations. A practical application is shown with level-synchronous parallel Breadth-First Search on an undirected graph where two vertex frontiers are accessed in parallel. This application scenario is also used for an evaluation of the technique. Tests were done on four different large parallel systems with up to 64-way parallelism. It will be shown that for the graph application examined the amount of additional work caused by missing synchronization is neglectible and the performance is almost always better than the approach with atomic operations.
Level-Synchronous Parallel Breadth-First Search Algorithms For Multicore and Multiprocessor Systems
(2014)
Breadth-First Search (BFS) is a graph traversal technique used in many applications as a building block, e.g.,~to systematically explore a search space. For modern multicore processors and as application graphs get larger, well-performing parallel algorithms are favourable. In this paper, we systematically evaluate an important class of parallel BFS algorithms and discuss programming optimization techniques for their implementation. We concentrate our discussion on level-synchronous algorithms for larger multicore and multiprocessor systems. In our results, we show that for small core counts many of these algorithms show rather similar behaviour. But, for large core counts and large graphs, there are considerable differences in performance and scalability influenced by several factors. This paper gives advice, which algorithm should be used under which circumstances.
Hybrid system models exploit the modelling abstraction that fast state transitions take place instantaneously so that they encompass discrete events and the continuous time behaviour for the while of a system mode. If a system is in a certain mode, e.g. two rigid bodies stick together, then residuals of analytical redundancy relations (ARRs) within certain small bounds indicate that the system is healthy. An unobserved mode change, however, invalidates the current model for the dynamic behaviour. As a result, ARR residuals may exceed current thresholds indicating faults in system components that have not happened. The paper shows that ARR residuals derived from a bond graph cannot only serve as fault indicators but may also be used for bond graph model-based system mode identification. ARR residuals are numerically computed in an off-line simulation by coupling a bond graph of the faulty system to a non-faulty system bond graph through residual sinks. In real-time simulation, the faulty system model is to be replaced by measurements from the real system. As parameter values are uncertain, it is important to determine adaptive ARR thresholds that, given uncertain parameters, allow to decide whether the dynamic behaviour in a current system mode is the one of the healthy system so that false alarms or overlooking of true faults can be avoided. The paper shows how incremental bond graphs can be used to determine adaptive mode-dependent ARR thresholds for switched linear time-invariant systems with uncertain parameters in order to support robust fault detection. Bond graph-based hybrid system mode identification as well as the determination of adaptive fault thresholds is illustrated by application to a power electronic system easy to survey. Some simulation results have been analytically validated.
People are getting older because of the demographic changes and the rate of disabled people is also going up. This article shows the challenge for BPMTool developer due to these circumstances. It illustrates how these changes impact the usage of BPM-Tools based on an Evaluation of an exemplary BPMTool (Cooper & Patterson, 2007) in terms of IT-Usability and IT-Accessibility. This evaluation was conducted in a research laboratory at the university.
The RoCKIn@Work Challenge
(2014)
We consider the Hopfield model with n neurons and an increasing number p=p(n) of randomly chosen patterns and use Stein's method to obtain rates of convergence for the central limit theorem of overlap parameters, which holds for every fixed choice of the overlap parameter for almost all realisations of the random patterns.
In general, mathematics plays a central role in our lives because today mathematics regulates our everyday life with techniques, technologies and procedures, for example coding techniques for credit cards or the drafting of curves and surfaces for construction procedures [5]. Obviously, mathematics continues to be an important element of engineering education and it still represents a major obstacle for the students. Lacking the knowledge of several topics, changing learning behavior and inadequate overall conditions at universities for the repetition of school mathematics were mentioned to be causes for the constantly increasing gap between the initial level of mathematics at university and the prior knowledge of the first semester students [2].