Refine
Year of publication
Document Type
- Conference Proceeding (491)
- Article (216)
- Part of a Book (48)
- Doctoral Thesis (30)
- Other Publications (28)
- Master's Thesis (14)
- Report (13)
- Working Paper (12)
- Book (9)
- Bachelor Thesis (8)
Language
- English (879) (remove)
Keywords
- (Strict) sign-regularity (1)
- 1D-CNN (1)
- 2 D environment Laser data (1)
- 360-degree coverage (1)
- 3D Extended Object Tracking (1)
- 3D Extended Object Tracking (EOT) (2)
- 3D shape tracking (1)
- 3D ship detection (1)
- 3D urban planning (1)
- AAL (3)
Institute
- Fakultät Architektur und Gestaltung (6)
- Fakultät Bauingenieurwesen (26)
- Fakultät Elektrotechnik und Informationstechnik (16)
- Fakultät Informatik (63)
- Fakultät Maschinenbau (12)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (43)
- Institut für Angewandte Forschung - IAF (77)
- Institut für Optische Systeme - IOS (33)
- Institut für Strategische Innovation und Technologiemanagement - IST (38)
- Institut für Systemdynamik - ISD (98)
Deep transformation models
(2021)
We present a deep transformation model for probabilistic regression. Deep learning is known for outstandingly accurate predictions on complex data but in regression tasks it is predominantly used to just predict a single number. This ignores the non-deterministic character of most tasks. Especially if crucial decisions are based on the predictions, like in medical applications, it is essential to quantify the prediction uncertainty. The presented deep learning transformation model estimates the whole conditional probability distribution, which is the most thorough way to capture uncertainty about the outcome. We combine ideas from a statistical transformation model (most likely transformation) with recent transformation models from deep learning (normalizing flows) to predict complex outcome distributions. The core of the method is a parameterized transformation function which can be trained with the usual maximum likelihood framework using gradient descent. The method can be combined with existing deep learning architectures. For small machine learning benchmark datasets, we report state of the art performance for most dataset and partly even outperform it. Our method works for complex input data, which we demonstrate by employing a CNN architecture on image data.
In this article, the collection of classes of matrices presented in [J. Garloff, M. Adm, ad J. Titi, A survey of classes of matrices possessing the interval property and related properties, Reliab. Comput. 22:1-14, 2016] is continued. That is, given an interval of matrices with respect to a certain partial order, it is desired to know whether a special property of the entire matrix interval can be inferred from some of its element matrices lying on the vertices of the matrix interval. The interval property of some matrix classes found in the literature is presented, and the interval property of further matrix classes including the ultrametric, the conditionally positive semidefinite, and the infinitely divisible matrices is given for the first time. For the inverse M-matrices the cardinality of the required set of vertex matrices known so far is significantly reduced.
Positive systems play an important role in systems and control theory and have found applications in multiagent systems, neural networks, systems biology, and more. Positive systems map the nonnegative orthant to itself (and also the non-positive orthant to itself). In other words, they map the set of vectors with zero sign variation to itself. In this article, discrete-time linear systems that map the set of vectors with up to k-1 sign variations to itself are introduced. For the special case k = 1 these reduce to discrete-time positive linear systems. Properties of these systems are analyzed using tools from the theory of sign-regular matrices. In particular, it is shown that almost every solution of such systems converges to the set of vectors with up to k-1 sign variations. It is also shown that these systems induce a positive dynamics of k-dimensional parallelotopes.
Matrix methods for the computation of bounds for the range of a complex polynomial and its modulus over a rectangular region in the complex plane are presented. The approach relies on the expansion of the given polynomial into Bernstein polynomials. The results are extended to multivariate complex polynomials and rational functions.
The class of square matrices of order n having a negative determinant and all their minors up to order n-1 nonnegative is considered. A characterization of these matrices is presented which provides an easy test based on the Cauchon algorithm for their recognition. Furthermore, the maximum allowable perturbation of the entry in position (2,2) such that the perturbed matrix remains in this class is given. Finally, it is shown that all matrices lying between two matrices of this class with respect to the checkerboard ordering are contained in this class, too.
In this paper, rectangular matrices whose minors of a given order have the same strict sign are considered and sufficient conditions for their recognition are presented. The results are extended to matrices whose minors of a given order have the same sign or are allowed to vanish. A matrix A is called oscillatory if all its minors are nonnegative and there exists a positive integer k such that A^k has all its minors positive. As a generalization, a new type of matrices, called oscillatory of a specific order, is introduced and some of their properties are investigated.
InnoCrowd, a Product Classification System for Design Decision in a Crowdsourced Product Innovation
(2021)
System engineering focuses on how to design and manage complex systems. Meanwhile, in the era of Industry 4.0 and Internet of Things (IoT), systems are getting more complex. Contributors to higher complexity include the usage of modern components (e.g. mechatronics), new manufacturing technologies (e.g. 3D Print) and new engineering product development processes, e.g. open innovation. Open innovation is enabled by IoT, where people and devices are easily connected, and it supports development of more innovative products through ideas gained from predecessors and collaborators world wide. Some researchers suggest this approach is up to three times faster and five times cheaper than conventional approaches [Gassmann, 2012], [Howe, 2008], [Kusumah, 2018]. Because open innovation is relatively new, many managers do not know how to employ it effectively in some phases of product development [Schenk, 2009], [Afuah, 2017], including requirements definition, design and engineering processes (task assignment) through quality assurance. Also, they have trouble estimating and controlling development time and cost [Nevo, 2020], [Thanh, 2015]. As a consequence, the acceptance of this new approach in the industry is limited. Research activities addressing this new approach mainly address high-level and qualitive issues. Few effective methods are available to estimate project risk and to decide whether to initiate a project.
We propose InnoCrowd, a decision support system that uses an improved method to support these tasks and make decisions about crowdsourced engineering product development.
InnoCrowd uses natural language processing and machine learning to build a knowledgebase of crowdsourced product developments. InnoCrowd presents a manager with results of similar projects to show which practices led to good results. A manager of a new project can use this guidance to employ best practices for product requirements definition, project schedule, and other aspects, thereby reducing risk and increasing chances for success.
This paper describes the rationale and the development of a structured digital approach for measuring corporate environmental sustainability using performance metrics.
It is impossible to imagine today's age without the preservation of our environment, not even in the corporate environment. Currently, sustainability is mostly only rudimentarily considered in companies, mostly only with written down phrases on the website. This will no longer be sufficient in the future, which is why companies should record sustainability on a numerical basis. Based on the development of a workable concept for companies, a small empirical study was carried out, which can be used to numerically measure the sustainability performance of companies. Two utility analyses were completed.
One of them was supplemented by expert interviews. Well-known practitioners from the business world were interviewed and asked for their assessment of ecological performance indicators. The result of the research is an indicator-based concept that can be applied in corporate practice to determine ecological sustainability performance.
This paper presents a generic method to enhance performance and incorporate temporal information for cardiorespiratory-based sleep stage classification with a limited feature set and limited data. The classification algorithm relies on random forests and a feature set extracted from long-time home monitoring for sleep analysis. Employing temporal feature stacking, the system could be significantly improved in terms of Cohen’s κ and accuracy. The detection performance could be improved for three classes of sleep stages (Wake, REM, Non-REM sleep), four classes (Wake, Non-REM-Light sleep, Non-REM Deep sleep, REM sleep), and five classes (Wake, N1, N2, N3/4, REM sleep) from a κ of 0.44 to 0.58, 0.33 to 0.51, and 0.28 to 0.44 respectively by stacking features before and after the epoch to be classified. Further analysis was done for the optimal length and combination method for this stacking approach. Overall, three methods and a variable duration between 30 s and 30 min have been analyzed. Overnight recordings of 36 healthy subjects from the Interdisciplinary Center for Sleep Medicine at Charité-Universitätsmedizin Berlin and Leave-One-Out-Cross-Validation on a patient-level have been used to validate the method.
Probabilistic Short-Term Low-Voltage Load Forecasting using Bernstein-Polynomial Normalizing Flows
(2021)
The transition to a fully renewable energy grid requires better forecasting of demand at the low-voltage level. However, high fluctuations and increasing electrification cause huge forecast errors with traditional point estimates. Probabilistic load forecasts take future uncertainties into account and thus enables various applications in low-carbon energy systems. We propose an approach for flexible conditional density forecasting of short-term load based on Bernstein-Polynomial Normalizing Flows where a neural network controls the parameters of the flow. In an empirical study with 363 smart meter customers, our density predictions compare favorably against Gaussian and Gaussian mixture densities and also outperform a non-parametric approach based on the pinball loss for 24h-ahead load forecasting for two different neural network architectures.