Refine
H-BRS Bibliography
- yes (54) (remove)
Departments, institutes and facilities
- Fachbereich Wirtschaftswissenschaften (18)
- Fachbereich Informatik (12)
- Fachbereich Angewandte Naturwissenschaften (11)
- Fachbereich Ingenieurwissenschaften und Kommunikation (10)
- Fachbereich Sozialpolitik und Soziale Sicherung (3)
- Institut für funktionale Gen-Analytik (IFGA) (3)
- Centrum für Entrepreneurship, Innovation und Mittelstand (CENTIM) (2)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (1)
- Institut für Verbraucherinformatik (IVI) (1)
- Institute of Visual Computing (IVC) (1)
Document Type
- Article (54) (remove)
Year of publication
- 2014 (54) (remove)
Has Fulltext
- no (54) (remove)
Keywords
- Exchangeable pairs (2)
- Stein’s method (2)
- parallel breadth-first search (2)
- 1-MCP (1)
- ARRs (1)
- Africa (1)
- Analytical Chemistry (1)
- Area under the curve (1)
- BFS (1)
- Blume–Capel model (1)
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.
Seit vielen Jahren ist der Übergang von der Schule zur Hochschule eines der zentralen Themen für didaktische Theorien, empirische Untersuchungen und bildungspolitische Diskussionen. Ein dabei identifiziertes großes Problem vieler Studierender ist, dass mit dem Abitur „eine Lebensphase mit meist klar definierten Zielen in überschaubaren räumlichen, familiären und schulischen Strukturen endet“.1) Entscheidet man sich als Studierender gegen die nicht akademische Laufbahn und nimmt ein Hochschulstudium auf, trifft man auf Studienstrukturen und -bedingungen, die einem fremd und chaotisch vorkommen können. Der Weg an die Hochschulen ermöglicht den Individuen eine Reihe von Optionen, ist aber leider auch immer mit Risiken und Unsicherheiten behaftet. Entscheidungen müssen nun selbstständig vorbereitet und getroffen werden und dies in einem Umfeld, das sehr unterschiedlich im Vergleich zur bekannten Schulstruktur sein kann.
The analytical pyrolysis technique hyphenated to gas chromatography–mass spectrometry (GC–MS) has extended the range of possible tools for the characterization of synthetic polymers and copolymers. Pyrolysis involves thermal fragmentation of the analytical sample at temperatures of 500–1400 °C. In the presence of an inert gas, reproducible decomposition products characteristic for the original polymer or copolymer sample are formed. The pyrolysis products are chromatographically separated using a fused-silica capillary column and are subsequently identified by interpretation of the obtained mass spectra or by using mass spectra libraries. The analytical technique eliminates the need for pretreatment by performing analyses directly on the solid or liquid polymer sample. In this article, application examples of analytical pyrolysis hyphenated to GC–MS for the identification of different polymeric materials in the plastic and automotive industry, dentistry, and occupational safety are demonstrated. For the first time, results of identification of commercial light-curing dental filling material and a car wrapping foil by pyrolysis–GC–MS are presented.
The analytical pyrolysis technique hyphenated to gas chromatography–mass spectrometry (GC–MS) has extended the range of possible tools for the characterization of synthetic polymers and copolymers. Pyrolysis involves thermal fragmentation of the analytical sample at temperatures of 500–1400 °C. In the presence of an inert gas, reproducible decomposition products characteristic for the original polymer or copolymer sample are formed. The pyrolysis products are chromatographically separated using a fused-silica capillary column and are subsequently identified by interpretation of the obtained mass spectra or by using mass spectra libraries. The analytical technique eliminates the need for pretreatment by performing analyses directly on the solid or liquid polymer sample. In this article, application examples of analytical pyrolysis hyphenated to GC–MS for the identification of different polymeric materials in the plastic and automotive industry, dentistry, and occupational safety are demonstrated. For the first time, results of identification of commercial light-curing dental filling material and a car wrapping foil by pyrolysis–GC–MS are presented.
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.
Dysregulation of IL12 Signaling As a Novel Cause of an Autoimmune Lymphoproliferative like Syndrome
(2014)
Breadth-First Search is a graph traversal technique used in many applications as a building block, e.g., to systematically explore a search space or to determine single source shortest paths in unweighted graphs. For modern multicore processors and as application graphs get larger, well-performing parallel algorithms are favorable. In this paper, we systematically evaluate an important class of parallel algorithms for this problem and discuss programming optimization techniques for their implementation on parallel systems with shared memory. 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 performance behavior. But, for large core counts and large graphs, there are considerable differences in performance and scalability influenced by several factors, including graph topology. This paper gives advice, which algorithm should be used under which circumstances.
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.