Refine
Year of publication
Document Type
- Conference Proceeding (90)
- Book (21)
- Article (peer reviewed) (11)
- Other (10)
- Contribution to a Periodical (9)
- Part of a Book (4)
- Doctoral Thesis (2)
- Working Paper (1)
Is part of the Bibliography
- no (148)
Keywords
- Speech Recognition (18)
- CFT (6)
- Software Development (6)
- Database (5)
- Microsoft (5)
- Sql server (5)
- Augmented Reality (AR) (4)
- Fault trees (4)
- Mobile Robot (4)
- Robotic Research (4)
Institute
- Fakultät für Informatik (148) (remove)
Time series are series of values ordered by time. This kind of data can be found in many real world settings. Classifying time series is a difficult task and an active area of research. This paper investigates the use of transfer learning in Deep Neural Networks and a 2D representation of time series known as Recurrence Plots. In order to utilize the research done in the area of image classification, where Deep Neural Networks have achieved very good results, we use a Residual Neural Networks architecture known as ResNet. As preprocessing of time series is a major part of every time series classification pipeline, the method proposed simplifies this step and requires only few parameters. For the first time we propose a method for multi time series classification: Training a single network to classify all datasets in the archive with one network. We are among the first to evaluate the method on the latest 2018 release of the UCR archive, a well established time series classification benchmarking dataset.
Generating a more detailed understanding of domestic electricity demand is a major topic for energy suppliers and householders in times of climate change.
Over the years there have been many studies on consumption feedback systems to inform householders, disaggregation algorithms for Non-Intrusive-Load-Monitoring (NILM), Real-Time-Pricing (RTP) to promote supply aware behavior through monetary incentives and appliance usage prediction algorithms. While these studies are vital steps towards energy awareness, one of the most fundamental challenges has not yet been tackled: Automated detection of start and stop of usage cycles of household appliances. We argue that most research efforts in this area will benefit from a reliable segmentation method to provide accurate usage information.
We propose a SVM-based segmentation method for home appliances such as dishwashers and washing machines. The method is evaluated using manually annotated electricity measurements of five different appliances recorded over two years in multiple households.
The IT architecture for meter reading and utility services is at the core of new business models and has a decisive role as an enabler for resource efficiency measures. The communication architecture used by those services has significant impact on cost, flexibility and speed of new service rollout. This article describes how the dominant system model for meter reading came about, what alternative models exist, and what trade-offs those models have for rollout of new services by different stakeholders. Control of a self learning home automation system by dynamic tariff information (Real-Time-Pricing) is given as an application example.
The open and cooperative nature of Cyber-Physical Systems (CPS) poses new challenges in assuring dependability. The DEIS project (Dependability Engineering Innovation for automotive CPS. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 732242, see http://www.deis-project.eu) addresses these challenges by developing technologies that form a science of dependable system integration. In the core of these technologies lies the concept of a Digital Dependability Identity (DDI) of a component or system. DDIs are modular, composable, and executable in the field facilitating (a) efficient synthesis of component and system dependability information over the supply chain and (b) effective evaluation of this information in-the-field for safe and secure composition of highly distributed and autonomous CPS. The paper outlines the DDI concept and opportunities for application in four industrial use cases.
Shifting energy peak load is a subject that plays a huge role in the currently changing energy market, where renewable energy sources no longer produce the exact amount of energy demanded.
Matching demand to supply requires behavior Changes on the customerside, which can be achieved by incentives suchas Real-Time-Pricing (RTP).
Various studies show that such incentives cannot be utilized without a complexity reduction, e.g., by smart home automation systems that inform the customer about possible savings or automatically schedule appliances to off-peak load phases.
We propose a probabilistic appliance usage prediction based on historical energy data that can be used to identify the times of day where an appliance will be used and therefore make load shift recommendations that suite the customer’s usage profile. A huge issue is how to provide a valid performance evaluation for this particular problem.
We will argue why the commonly used accuracy metric is not suitable, and suggest to use other metrics like the area under the Receiver Operating Characteristic (ROC) curve, Matthews Correlation Coefficient (MCC) or F1-Score instead.
Safety assurance is a major challenge in the design of modern embedded systems that has become increasingly difficult in recent years. Growing system sizes and the rise of Cyber-Physical systems confront safety engineers with large sets of configurations to be analyzed. Current approaches are usually carried out at design time and do not address the need for automated assessments in the field. With Component Fault Trees (CFTs) there exists a component-based methodology that enables an efficient modular composition of safety artifacts. The combined model is a system-level CFT that can be analyzed by means of popular Fault Tree Analysis techniques that are widely accepted in the industry. However, when composing models, their interfacing elements must be connected manually which impedes the automation of the procedure. In this work, we introduce the notion of flow types that represent a particular kind of component interaction and define a taxonomy of related failure behavior. By annotating CFTs with types, a machine-readable vocabulary is provided that allows for an automated interconnection of their interfaces. This way, the automatic composition of models according to system architecture is enabled, allowing for automated safety assessments on system-level. We demonstrate the feasibility of our approach using an example ethylene vaporization unit.
The growing size and complexity of software in embedded systems poses new challenges to the safety assessment of embedded control systems. In industrial practice, the control software is mostly treated as a black box during the system's safety analysis. The appropriate representation of the failure propagation of the software is a pressing need in order to increase the accuracy of safety analyses. However, it also increase the effort for creating and maintaining the safety analysis models (such as fault trees) significantly. In this work, we present a method to automatically generate Component Fault Trees from Continuous Function Charts. This method aims at generating the failure propagation model of the detailed software specification. Hence, control software can be included into safety analyses without additional manual effort required to construct the safety analysis models of the software. Moreover, safety analyses created during early system specification phases can be verified by comparing it with the automatically generated one in the detailed specification phased.
The classical results of the binomial and negative binomial probability distribution are generalized by means of homogeneous Discrete Time Markov Chains to series of stochastically independent random trials. These have not only two possible outcomes but two groups of them -- different kinds of successes and failures with occurrence probabilities depending on the outcome of the previous trial. This generalization allows a uniform view of occupation time, first passage time and recurrence time. Our results are consequently derived and presented in matrix form, the probabilities as well as the moments. They can be applied to all Discrete Time Markov Chains, especially in computer capacity planning, performability and economics.