Refine
Departments, institutes and facilities
- Fachbereich Informatik (68)
- Fachbereich Wirtschaftswissenschaften (62)
- Fachbereich Angewandte Naturwissenschaften (33)
- Fachbereich Ingenieurwissenschaften und Kommunikation (33)
- Institute of Visual Computing (IVC) (25)
- Institut für funktionale Gen-Analytik (IFGA) (22)
- Institut für Verbraucherinformatik (IVI) (20)
- Institut für Cyber Security & Privacy (ICSP) (18)
- Präsidium (17)
- Fachbereich Sozialpolitik und Soziale Sicherung (16)
Document Type
- Conference Object (111)
- Article (102)
- Part of a Book (62)
- Book (monograph, edited volume) (19)
- Part of Periodical (17)
- Report (10)
- Contribution to a Periodical (6)
- Conference Proceedings (5)
- Patent (4)
- Working Paper (4)
Year of publication
- 2014 (351) (remove)
Keywords
- Nachhaltigkeit (8)
- Lehrbuch (7)
- Corporate Social Responsibility (3)
- FPGA (3)
- Unternehmen (3)
- education (3)
- parallel breadth-first search (3)
- BFS (2)
- Betriebswirtschaftslehre (2)
- Controlling (2)
It has become increasingly clear that caspases, far from being merely cell death effectors, have a much wider range of functions within the cell. These functions are as diverse as signal transduction and cytoskeletal remodeling, and caspases are now known to have an essential role in cell proliferation, migration, and differentiation. There is also evidence that apoptotic cells themselves can direct the behavior of nearby cells through the caspase-dependent secretion of paracrine signaling factors. In some processes, including the differentiation of skeletal muscle myoblasts, both caspase activation in differentiating cells as well as signaling from apoptotic cells has been reported. Here, we review the non-apoptotic outcomes of caspase activity in a range of different model systems and attempt to integrate this knowledge.
Nachhaltigkeitsökonomie
(2014)
Residential and commercial buildings are responsible for about 40% of the EU’s total energy consumption. However, conscious, sustainable use of this limited resource is hampered by a lack of visibility and materiality of consumption. One of the major challenges is enabling consumers to make informed decisions about energy consumption, thereby supporting the shift to sustainable actions. With the use of Energy-Management-Systems it is possible to save up to 15%. In recent years, design approaches have greatly diversified, but with the emergence of ubiquitous- and context-aware computing, energy feedback solutions can be enriched with additional context information. In this study, we present the concept “room as a context” for eco-feedback systems. We investigate opportunities of making current state-of-the-art energy visualizations more meaningful and demonstrate which new forms of visualizations can be created with this additional information. Furthermore, we developed a prototype for android-based tablets, which includes some of the presented features to study our design concepts in the wild.
Business process infrastructures like BPMS (Business Process Management Systems) and WfMS (Workflow Management Systems) traditionally focus on the automation of processes predefined at design time. This approach is well suited for routine tasks which are processed repeatedly and which are described by a predefined control flow. In contrast, knowledge-intensive work is more goal and data-driven and less control-flow oriented. Knowledge workers need the flexibility to decide dynamically at run-time and based on current context information on the best next process step to achieve a given goal. Obviously, in most practical scenarios, these decisions are complex and cannot be anticipated and modeled completely in a predefined process model. Therefore, adaptive and dynamic process management techniques are necessary to augment the control-flow oriented part of process management (which is still a need also for knowledge workers) with flexible, context-dependent, goaloriented support.
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.
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.
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.
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.