Refine
Year of publication
- 2021 (30) (remove)
Document Type
- Article (19)
- Bachelor Thesis (3)
- Conference Proceeding (2)
- Master's Thesis (2)
- Part of a Book (1)
- Doctoral Thesis (1)
- Preprint (1)
- Report (1)
Language
- English (30) (remove)
Has Fulltext
- yes (30) (remove)
Keywords
- Alpine area (1)
- Antidumping (1)
- Arrival and departure (1)
- Bernstein polynomial (1)
- Botswana (1)
- Buddhism (1)
- Car-free mobility (1)
- Cauchon algorithm (1)
- Channel estimation (1)
- Checkerboard ordering (1)
Urban car-free mobility
(2021)
Across the globe, urban areas experience the phenomena of rising road-congestion, air pollution and car accidents. These are just a few popular quantified effects that arise due to rapid, uncoordinated urbanization on a car-centric city layout. There is an urgent need to consider new concepts of urban mobility development to combat these negative effects. Car-free mobility is one notion adopted in diverse formats by numerous cities to create a more inclusive, just, healthy and sustainable urban life. The focus of this thesis is to ex- amine whether a car-free mobility concept is applicable to the Maun Science Park, Bot- swana. Therefore, the idea of car-free mobility, its positive aspects as well as its con- straints, are described first. This illustrates the complexity of urban transport planning as it is intertwined with urban land-use, political vision and people’s perceptions and behav- iors. Secondly, examples and strategies on how to change existing structures are pre- sented. Following this, the smart developments in the field of sustainable urban mobility are considered to provide an insight into their assets and drawbacks. Then the local mo- bility conditions are examined before the car-free concept is exemplarily applied to the Maun Science Park via scenario construction. These scenarios give a first vision of how a car-free concept can be applied to the MSP and additionally provide a starting point for future strategic planning as well as inspiration for other cities to follow along.
This paper introduces the concept of Universal Memory Automata (UMA) and automated compilation of Verilog Hardware Description Language (HDL) code at Register Transfer Level (RTL) from UMA graphs for digital designs. The idea is based on the observation that Push Down Automata (PDA) are able to process the Dyk-Language - commonly known as the balanced bracket problem - with a finite set of states while Finite State Machines (FSM) require an infinite set of states. Since infinite sets of states are not applicable to real designs, PDAs appear promising for types of problems similar to the Dyk-Language. PDAs suffer from the problem that complex memory operations need to be emulated by a specific stack management. The presented UMA therefore extends the PDA by other types of memory, e.g. Queue, RAM or CAM. Memories that are eligible for UMAs are supposed to have at least one read and one write port and a one-cycle read/write latency. With their modified state-transfer- and output-function, UMAs are able to operate user-defined numbers, configurations and types of memories. Proof of concept is given by an implementation of a cache coherency protocol, i.e. a practical problem in microprocessor design.
This paper examines the interdependencies of tourism, Buddhism and sustainability combining in-depth-interviews with Buddhism experts and non-participant observation in a mixed-method approach. The area under investigation is the Alpine region of Austria, Germany and Switzerland, since it is home to Asian and Western forms of Buddhism tourism alike. Results show that Buddhism tourism as a value-based activity on the one hand is not commercial, but since demand is rising, on the other hand tendencies towards more commercial forms can be observed. As a modest form of activity Buddhism tourism does not shape the landscape of the Alpine area and by its nature it incorporates sustainability.
The main objective of this paper is to revisit the Euro method in a critical and constructive way.Wehave analysed some arguments against the Euro method published recently in the literature as well as some other relevant aspects of the SUT-Euro and SUT-RAS methods not covered before. Although not being the Euro method perfect, we believe that there is still space for the use of the Euro method in updating/regionalizing Supply and Use tables.
The main objective of this paper is to revisit Temursho’s (2020) article “On the Euro method” in a critical and constructive way. We have praised part of his work and at the same time, we have analysed some of his arguments against the Euro method and against the work published by Valderas-Jaramillo et al. (2019). Moreover, we have analysed some other relevant aspects of the SUT-Euro and SUT-RAS methods not covered in Temursho (2020). Temursho (2020) seems to conclude that no one should use the Euro method again because of its limitations and drawbacks. However, although not being the Euro method perfect, we are afraid that there is still space for the use of the Euro method in updating/regionalizing supply and use tables.
In this paper, a novel measurement model based on spherical double Fourier series (DFS) for estimating the 3D shape of a target concurrently with its kinematic state is introduced. Here, the shape is represented as a star-convex radial function, decomposed as spherical DFS. In comparison to ordinary DFS, spherical DFS do not suffer from ambiguities at the poles. Details will be given in the paper. The shape representation is integrated into a Bayesian state estimator framework via a measurement equation. As range sensors only generate measurements from the target side facing the sensor, the shape representation is modified to enable application of shape symmetries during the estimation process. The model is analyzed in simulations and compared to a shape estimation procedure using spherical harmonics. Finally, shape estimation using spherical and ordinary DFS is compared to analyze the effect of the pole problem in extended object tracking (EOT) scenarios.
Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low error correcting capabilities. In this work, low-complexity hard- and soft-input decoding methods for such codes are investigated. We propose three concepts to reduce the complexity of the decoder. For the algebraic decoding we demonstrate that Peterson's algorithm can be more efficient than the Berlekamp-Massey algorithm for single, double, and triple error correcting BCH codes. We propose an inversion-less version of Peterson's algorithm and a corresponding decoding architecture. Furthermore, we propose a decoding approach that combines algebraic hard-input decoding with soft-input bit-flipping decoding. An acceptance criterion is utilized to determine the reliability of the estimated codewords. For many received codewords the stopping criterion indicates that the hard-decoding result is sufficiently reliable, and the costly soft-input decoding can be omitted. To reduce the memory size for the soft-values, we propose a bit-flipping decoder that stores only the positions and soft-values of a small number of code symbols. This method significantly reduces the memory requirements and has little adverse effect on the decoding performance.
The performance and reliability of non-volatile NAND flash memories deteriorate as the number of program/erase cycles grows. The reliability also suffers from cell to cell interference, long data retention time, and read disturb. These processes effect the read threshold voltages. The aging of the cells causes voltage shifts which lead to high bit error rates (BER) with fixed pre-defined read thresholds. This work proposes two methods that aim on minimizing the BER by adjusting the read thresholds. Both methods utilize the number of errors detected in the codeword of an error correction code. It is demonstrated that the observed number of errors is a good measure for the voltage shifts and is utilized for the initial calibration of the read thresholds. The second approach is a gradual channel estimation method that utilizes the asymmetrical error probabilities for the one-to-zero and zero-to-one errors that are caused by threshold calibration errors. Both methods are investigated utilizing the mutual information between the optimal read voltage and the measured error values.
Numerical results obtained from flash measurements show that these methods reduce the BER of NAND flash memories significantly.
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.