Refine
H-BRS Bibliography
- yes (55) (remove)
Departments, institutes and facilities
- Fachbereich Informatik (55) (remove)
Document Type
- Conference Object (32)
- Article (16)
- Report (5)
- Part of a Book (1)
- Conference Proceedings (1)
Year of publication
- 2018 (55) (remove)
Keywords
- Surrogate Modeling (2)
- Virtual Reality (2)
- 3D User Interface (1)
- 3D user interface (1)
- Algorithmische Informationstheorie (1)
- Alternatives (1)
- Available Bandwidth (1)
- B2T (1)
- Bandwidth Estimation (1)
- Bayesian Network (1)
For many different applications, current information about the bandwidth-related metrics of the utilized connection is very useful as they directly impact the performance of throughput sensitive applications such as streaming servers, IPTV and VoIP applications. In literature, several tools have been proposed to estimate major bandwidth-related metrics such as capacity, available bandwidth and achievable throughput. The vast majority of these tools fall into one of Packet Pair (PP), Variable Packet Size (VPS), Self-Loading of Periodic Streams (SLoPS) or Throughput approaches. In this study, seven popular bandwidth estimation tools including nettimer, pathrate, pathchar, pchar, clink, pathload and iperf belonging to these four well-known estimation techniques are presented and experimentally evaluated in a controlled testbed environment. Differently from the rest of studies in literature, all tools have been uniformly classified and evaluated according to an objective and sophisticated classification and evaluation scheme. The performance comparison of the tools incorporates not only the estimation accuracy but also the probing time and overhead caused.
Analytical redundancy relations are fundamental in model-based fault detection and isolation. Their numerical evaluation yields a residual that may serve as a fault indicator. Considering switching linear time-invariant system models that use ideal switches, it is shown that analytical redundancy relations can be systematically deduced from a diagnostic bond graph with fixed causalities that hold for all modes of operation. Moreover, as to a faultless system, the presented bond graph–based approach enables to deduce a unique implicit state equation with coefficients that are functions of the discrete switch states. Devices or phenomena with fast state transitions, for example, electronic diodes and transistors, clutches, or hard mechanical stops are often represented by ideal switches which give rise to variable causalities. However, in the presented approach, fixed causalities are assigned only once to a diagnostic bond graph. That is, causal strokes at switch ports in the diagnostic bond graph reflect only the switch-state configuration in a specific system mode. The actual discrete switch states are implicitly taken into account by the discrete values of the switch moduli. The presented approach starts from a diagnostic bond graph with fixed causalities and from a partitioning of the bond graph junction structure and systematically deduces a set of equations that determines the wanted residuals. Elimination steps result in analytical redundancy relations in which the states of the storage elements and the outputs of the ideal switches are unknowns. For the later two unknowns, the approach produces an implicit differential algebraic equations system. For illustration of the general matrix-based approach, an electromechanical system and two small electronic circuits are considered. Their equations are directly derived from a diagnostic bond graph by following causal paths and are reformulated so that they conform with the matrix equations obtained by the formal approach based on a partitioning of the bond graph junction structure. For one of the three mode-switching examples, a fault scenario has been simulated.
This paper introduces a random number generator (RNG) based on the avalanche noise of two diodes. A true random number generator (TRNG) generates true random numbers with the use of the electronic noise produced by two avalanche diodes. The amplified outputs of the diodes are sampled and digitized. The difference between the two concurrently sampled and digitized outputs is calculated and used to select a seed and to drive a pseudo-random number generator (PRNG). The PRNG is an xorshift generator that generates 1024 bits in each cycle. Every sequence of 1024 bits is moderately modified and output. The TRNG delivers the next seed and the next cycle begins. The statistical behavior of the generator is analyzed and presented.
Design optimization techniques are often used at the beginning of the design process to explore the space of possible designs. In these domains illumination algorithms, such as MAP-Elites, are promising alternatives to classic optimization algorithms because they produce diverse, high-quality solutions in a single run, instead of only a single near-optimal solution. Unfortunately, these algorithms currently require a large number of function evaluations, limiting their applicability. In this article we introduce a new illumination algorithm, Surrogate-Assisted Illumination (SAIL), that leverages surrogate modeling techniques to create a map of the design space according to user-defined features while minimizing the number of fitness evaluations. On a two-dimensional airfoil optimization problem SAIL produces hundreds of diverse but high-performing designs with several orders of magnitude fewer evaluations than MAP-Elites or CMA-ES. We demonstrate that SAIL is also capable of producing maps of high-performing designs in realistic three-dimensional aerodynamic tasks with an accurate flow simulation. Data-efficient design exploration with SAIL can help designers understand what is possible, beyond what is optimal, by considering more than pure objective-based optimization.