In der Dissertation wird ein Spezifikationsrahmen dargestellt, mit dem sich die Au?ensicht von (Software-) Komponenten in einer normierten und vollst?ndigen Weise beschreiben l?sst. Dazu werden verschiedene methodische Vorgaben geschaffen, mit denen sich die f?r die betriebliche...

Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world data is lacking, generated data sets provide a substantive methodological tool for experiments. Focused research questions need to base...

The Dirac-delta-like quantum-mechanical potentials are frequently used to describe and interpret numerous phenomena in many scientific fields including atomic and molecular physics, condensed matter and quantum computation. The entropy and complexity properties of potentials with one and two...

Assembly line balancing is a well-known and extensively researched decision problem which arises when assembly line production systems are designed and operated. A large variety of real-world problem variations and elaborate solution methods were developed and presented in the academic...

Most of research on complexities and the corresponding conclusions have been obtained by numerically quantifying their values, and little attention has been paid to their theoretical properties and the exact meaning within an statistical framework, valid for any arbitrary n-dimensional...

This paper investigates, in a simple risk-sharing framework, the extent to which the incompleteness of contracts could be attributed to the complexity costs associated with the writing and the implementation of contracts. We show that, given any measure of complexity in a very general class, it...

Considerable advances in automatic speech recognition have been made in the last decades, thanks specially to the use of hidden Markov models. In the field of speech signal analysis, different techniques have been developed. However, deterioration in the performance of the speech recognizers has...

In this paper, a natural extension of the Lempel–Ziv complexity for several finite-time sequences, defined on finite size alphabets is proposed. Some results on the defined joint Lempel–Ziv complexity are given, as well as properties in connection with the Lempel–Ziv complexity of the...