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)
Die Norm EN ISO 13849-1 stellt explizite Anforderungen an sicherheitsgerichtete SPS-Software. Wie lassen sich diese im Maschinenbau praxisgerecht umsetzen? Mit dieser Frage hat sich ein von der DGUV gefördertes und an der Hochschule Bonn-Rhein-Sieg durchgeführtes Projekt beschäftigt. Der Beitrag skizziert die Vorgehensweise zur möglichen Umsetzung der normativen Anforderungen. Diese Vorgehensweise ist unabhängig von der verwendeten Sicherheits-SPS und daher allgemein anwendbar. Es wird auf insgesamt 10 dokumentierte Beispiele und einen ausführlichen Forschungsbericht verwiesen, die downloadbar sind.
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.
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.
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.