Refine
Year of publication
Document Type
- Doctoral Thesis (31) (remove)
Language
- English (31) (remove)
Keywords
- Agrarprodukt (1)
- Autonomous vessels (1)
- Autonomy (1)
- Backstepping control (1)
- Bahnplanung (1)
- Bernstein Basis (1)
- Biomedical signals (1)
- COMSOL Multiphysics (1)
- Cauchon algorithm (1)
- Channel Coding (1)
The main goal of this work was to experimentally characterize the hot air-drying process of agricultural products (Potato, Carrot, Tomato) and verify it with numerical solutions at single layer and industrial scale dryer using Comsol Multiphysics® 5.3.
Input parameters at single layer dryer effects on quality attributes were examined. Two strategies of drying were applied on batch dryer to examine the input effects on quality attributes. Constant input parameters strategy was designed by using central composite design formulation and optimized by Response Surface Methodology (RSM). The second strategy was applied for further optimization of the selected region by using square wave profile of the air temperature and relative humidity. Similarly, numerical method for single layer dryer, unsteady-state partial differential equations have been solved by means of the Finite Elements Method coupled to the Arbitrary Lagrangian-Eulerian (ALE). Also, for batch dryer, the mechanistic mathematical models of coupled heat and mass transfer were developed and solved as solid porous moist material.
With this work, the process of convective drying of agricultural products could be optimized. Furthermore, important knowledge about the basic mechanisms of the drying process was found and implemented in the numerical models.
Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories
(2021)
In this work, algorithms and architectures for cryptography and source coding are developed, which are suitable for many resource-constrained embedded systems such as non-volatile flash memories. A new concept for elliptic curve cryptography is presented, which uses an arithmetic over Gaussian integers. Gaussian integers are a subset of the complex numbers with integers as real and imaginary parts. Ordinary modular arithmetic over Gaussian integers is computational expensive. To reduce the complexity, a new arithmetic based on the Montgomery reduction is presented. For the elliptic curve point multiplication, this arithmetic over Gaussian integers improves the computational efficiency, the resistance against side channel attacks, and reduces the memory requirements. Furthermore, an efficient variant of the Lempel-Ziv-Welch (LZW) algorithm for universal lossless data compression is investigated. Instead of one LZW dictionary, this algorithm applies several dictionaries to speed up the encoding process. Two dictionary partitioning techniques are introduced that improve the compression rate and reduce the memory size of this parallel dictionary LZW algorithm.
In today's volatile market environments, companies must be able to continuously innovate. In this context, innovation does not only refer to the development of new products or business models but often also affects the entire organization, which has to transform its structures, processes, and ways of working.Corporate entrepreneurship (CE) programs are often used by established companies to address these innovation and transformation challenges. In general, they are understood as formalized entrepreneurial activities to (1) support internal corporate ventures or (2) work with external startups. The organizational design and value creation of CE programs exhibit a high degree of heterogeneity. On the one hand, this heterogeneity makes CE programs a valuable management tool that can be used for many purposes. On the other hand, it can be seen as a reason for the current challenges that companies experience in effectively using and managing CE programs.By systematically analyzing 54 different cases in established companies in Germany, Switzerland, and Austria, this study contributes to a better understanding of the heterogeneity of CE programs. The taxonomic approach provides clearly defined types of CE programs that are distinguished according to their organizational design and the outputs they generate.
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.
In this thesis, the recognition problem and the properties of eigenvalues and eigenvectors of matrices which are strictly sign-regular of a given order, i.e., matrices whose minors of a given order have the same strict sign, are considered. The results are extended to matrices which are sign-regular of a given order, i.e., matrices whose minors of a given order have the same sign or are allowed to vanish. As a generalization, a new type of matrices called oscillatory of a specific order, are introduced. Furthermore, the properties for this type are investigated. Also, same applications to dynamic systems are given.
Pascal Laube presents machine learning approaches for three key problems of reverse engineering of defective structured surfaces: parametrization of curves and surfaces, geometric primitive classification and inpainting of high-resolution textures. The proposed methods aim to improve the reconstruction quality while further automating the process. The contributions demonstrate that machine learning can be a viable part of the CAD reverse engineering pipeline.
NAND flash memory is widely used for data storage due to low power consumption, high throughput, short random access latency, and high density. The storage density of the NAND flash memory devices increases from one generation to the next, albeit at the expense of storage reliability.
Our objective in this dissertation is to improve the reliability of the NAND flash memory with a low hard implementation cost. We investigate the error characteristic, i.e. the various noises of the NAND flash memory. Based on the error behavior at different life-aging stages, we develop offset calibration techniques that minimize the bit error rate (BER).
Furthermore, we introduce data compression to reduce the write amplification effect and support the error correction codes (ECC) unit. In the first scenario, the numerical results show that the data compression can reduce the wear-out by minimizing the amount of data that is written to the flash. In the ECC scenario, the compression gain is used to improve the ECC capability. Based on the first scenario, the write amplification effect can be halved for the considered target flash and data model. By combining the ECC and data compression, the NAND flash memory lifetime improves three fold compared with uncompressed data for the same data model.
In order to improve the data reliability of the NAND flash memory, we investigate different ECC schemes based on concatenated codes like product codes, half-product codes, and generalized concatenated codes (GCC). We propose a construction for high-rate GCC for hard-input decoding. ECC based on soft-input decoding can significantly improve the reliability of NAND flash memories. Therefore, we propose a low-complexity soft-input decoding algorithm for high-rate GCC.
Flash memories are non-volatile memory devices. The rapid development of flash technologies leads to higher storage density, but also to higher error rates. This dissertation considers this reliability problem of flash memories and investigates suitable error correction codes, e.g. BCH-codes and concatenated codes. First, the flash cells, their functionality and error characteristics are explained. Next, the mathematics of the employed algebraic code are discussed. Subsequently, generalized concatenated codes (GCC) are presented. Compared to the commonly used BCH codes, concatenated codes promise higher code rates and lower implementation complexity. This complexity reduction is achieved by dividing a long code into smaller components, which require smaller Galois-Field sizes. The algebraic decoding algorithms enable analytical determination of the block error rate. Thus, it is possible to guarantee very low residual error rates for flash memories. Besides the complexity reduction, general concatenated codes can exploit soft information. This so-called soft decoding is not practicable for long BCH-codes. In this dissertation, two soft decoding methods for GCC are presented and analyzed. These methods are based on the Chase decoding and the stack algorithm. The last method explicitly uses the generalized concatenated code structure, where the component codes are nested subcodes. This property supports the complexity reduction. Moreover, the two-dimensional structure of GCC enables the correction of error patterns with statistical dependencies. One chapter of the thesis demonstrates how the concatenated codes can be used to correct two-dimensional cluster errors. Therefore, a two-dimensional interleaver is designed with the help of Gaussian integers. This design achieves the correction of cluster errors with the best possible radius. Large parts of this works are dedicated to the question, how the decoding algorithms can be implemented in hardware. These hardware architectures, their throughput and logic size are presented for long BCH-codes and generalized concatenated codes. The results show that generalized concatenated codes are suitable for error correction in flash memories, especially for three-dimensional NAND memory systems used in industrial applications, where low residual errors must be guaranteed.