Refine
Year of publication
- 2024 (7)
- 2023 (20)
- 2022 (12)
- 2021 (25)
- 2020 (20)
- 2019 (30)
- 2018 (35)
- 2017 (25)
- 2016 (26)
- 2015 (22)
- 2014 (24)
- 2013 (29)
- 2012 (24)
- 2011 (31)
- 2010 (26)
- 2009 (27)
- 2008 (27)
- 2007 (28)
- 2006 (17)
- 2005 (15)
- 2004 (19)
- 2003 (12)
- 2002 (20)
- 2001 (20)
- 2000 (19)
- 1999 (23)
- 1998 (16)
- 1997 (13)
- 1996 (10)
- 1995 (11)
- 1994 (15)
- 1993 (9)
- 1992 (8)
- 1991 (4)
- 1990 (6)
- 1989 (5)
- 1988 (5)
- 1987 (2)
- 1986 (1)
- 1985 (6)
- 1984 (1)
- 1982 (2)
- 1981 (1)
- 1980 (4)
- 1979 (2)
- 1978 (3)
- 1976 (1)
- 1975 (1)
- 1974 (1)
Institute
- Fachbereich Elektrotechnik und Informationstechnik (710) (remove)
Has Fulltext
- no (710) (remove)
Language
- English (710) (remove)
Document Type
- Article (412)
- Conference Proceeding (228)
- Part of a Book (38)
- Book (23)
- Conference: Meeting Abstract (5)
- Patent (2)
- Conference Poster (1)
- Doctoral Thesis (1)
Keywords
- Enterprise Architecture (5)
- MINLP (5)
- Engineering optimization (4)
- Optimization (3)
- Powertrain (3)
- Technical Operations Research (3)
- Telecommunication (3)
- Competence Developing Games (2)
- Energy efficiency (2)
- Engineering education (2)
Component failures within water supply systems can lead to significant performance losses. One way to address these losses is the explicit anticipation of failures within the design process. We consider a water supply system for high-rise buildings, where pump failures are the most likely failure scenarios. We explicitly consider these failures within an early design stage which leads to a more resilient system, i.e., a system which is able to operate under a predefined number of arbitrary pump failures. We use a mathematical optimization approach to compute such a resilient design. This is based on a multi-stage model for topology optimization, which can be described by a system of nonlinear inequalities and integrality constraints. Such a model has to be both computationally tractable and to represent the real-world system accurately. We therefore validate the algorithmic solutions using experiments on a scaled test rig for high-rise buildings. The test rig allows for an arbitrary connection of pumps to reproduce scaled versions of booster station designs for high-rise buildings. We experimentally verify the applicability of the presented optimization model and that the proposed resilience properties are also fulfilled in real systems.
Digital forensics of smartphones is of utmost importance in many criminal cases. As modern smartphones store chats, photos, videos etc. that can be relevant for investigations and as they can have storage capacities of hundreds of gigabytes, they are a primary target for forensic investigators. However, it is exactly this large amount of data that is causing problems: extracting and examining the data from multiple phones seized in the context of a case is taking more and more time. This bears the risk of wasting a lot of time with irrelevant phones while there is not enough time left to analyze a phone which is worth examination. Forensic triage can help in this case: Such a triage is a preselection step based on a subset of data and is performed before fully extracting all the data from the smartphone. Triage can accelerate subsequent investigations and is especially useful in cases where time is essential. The aim of this paper is to determine which and how much data from an Android smartphone can be made directly accessible to the forensic investigator – without tedious investigations. For this purpose, an app has been developed that can be used with extremely limited storage of data in the handset and which outputs the extracted data immediately to the forensic workstation in a human- and machine-readable format.
The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation. While several multi-party protocols have been proposed that solve this problem in the semi-honest model, there are no multi-party protocols that are secure in the malicious model so far. In this paper, we close this gap. Our newly proposed protocols are shown to be secure in the malicious model based on a variety of novel non-interactive zero-knowledge-proofs. We describe the implementation of our protocols and evaluate their performance in comparison to protocols solving the problem in the semi-honest case.