Refine
Year of publication
- 2021 (50) (remove)
Document Type
- Article (50) (remove)
Keywords
- (Strict) sign-regularity (1)
- Alpine area (1)
- Ambient assisted living (1)
- Analytische Berechnung (1)
- Analytische Berechnung und Simulation (1)
- Antidumping (1)
- Aquakultur (1)
- Architektur (3)
- Arrival and departure (1)
- Auslegung von Radsatzwellen (1)
- Austenitic stainless steels (1)
- Balancing energy (1)
- Baugrundverbesserung (1)
- Bernstein polynomial (1)
- Blockchain (1)
- Buddhism (1)
- CSV Verfahren (1)
- Cauchon algorithm (1)
- Channel estimation (1)
- Checkerboard ordering (1)
- China (1)
- City resilience (1)
- Climate change (1)
- Code-based cryptosystem (1)
- Coded modulation (1)
- Complex interval (1)
- Complex polynomial (1)
- Compliance (2)
- Compound matrices (1)
- Conditionally positive semidefinite matrix (1)
- Cones of rank k (1)
- Control energy (1)
- Corporate Responsibility (1)
- Credit constraints (1)
- Custom (1)
- Customary law (1)
- Data analytics (1)
- Data retention time (1)
- Data-driven language learning (1)
- Datengesteuertes Fremdsprachenlernen (1)
- Decoding attack (1)
- Design (1)
- Digatalization (1)
- Digital age (1)
- Digital modulation (1)
- Digital transformation (1)
- Dimensionierung und Festigkeitsnachweis (1)
- Disputing (1)
- Distributed ledger (1)
- Dynamisches Torsionsmoment (1)
- EU Regulations (1)
- Ecological and Social Sustainability (1)
- Elliptic curve point multiplication (1)
- Enclosure of the range (1)
- Entrepreneurship (1)
- Erinnerung (1)
- Ethiopia (1)
- Euro method (2)
- Expanded austenite (1)
- Exponent of primitivity (1)
- Exterior products (1)
- Fachsprachenunterricht (1)
- Federated digital platform (1)
- Feststoffabscheidung (1)
- Fieldwork (1)
- Financial frictions (1)
- Flatness-based field-oriented control (FOC) (1)
- GRAS method (2)
- Gaussian integers (2)
- Governance (1)
- Harmony (1)
- Health information exchange (1)
- Heat islands (1)
- Home health systems (1)
- Hotel (1)
- Hurwitz integers (1)
- Implementation (1)
- Infinitely divisible matrix (1)
- Information-set decoding (1)
- Integrity Management (2)
- Interior permanent magnet synchronous machine (IPMSM) (1)
- Internet of things (1)
- Interval property (2)
- Inverse M-matrix (1)
- Key Performance Indicators (1)
- Kolonialismus (1)
- Korpustraining (1)
- Kulturerbe (1)
- Lamellenabscheide (1)
- Lattices (1)
- Legal anthropology (1)
- Low-temperature carburization (1)
- Magnetizability (1)
- Matrix interval (1)
- Maximales dynamisches Radsatz-Torsionsmoment (1)
- McEliece cryptosystem (2)
- Medication adherence (1)
- Methodology (1)
- Mobile healthcare (1)
- Mont-gomery modular reduction (1)
- Multivariate complex rational function (1)
- Myanmar (1)
- NFC (1)
- National Accounts (1)
- New technology-based firms (1)
- New venture survival (1)
- Niederreiter cryptosystem (1)
- Non-survey techniques (2)
- Nonlinear machine dynamics (1)
- Nonvolatile NAND flash (1)
- Nostalgie (1)
- Oscillatory matrix (1)
- Outcome classification (1)
- Primitive matrix (1)
- Program/erase cycles (1)
- Protocols (1)
- Public-key cryptography (3)
- RAS (1)
- Remote sensing (1)
- Schienenfahrzeug (1)
- Sedimentation (1)
- Selbsterregte Schwingungen (2)
- Sign regular matrix (1)
- Sign-regular matrices (1)
- Signal constellations (1)
- Sleep monitoring (1)
- Spiritual tourism (1)
- Sstainability (1)
- Stability analysis (1)
- Stacking fault energy (1)
- Stadtbaukunst (2)
- Stadtplanung (1)
- State (1)
- State export credit guarantees (1)
- Structured Digital Approach (1)
- Städtebau (3)
- Sustainable development (1)
- Sustainable infrastructure (1)
- Sustainable technologies (1)
- Tatzlagerantrieb (1)
- Technology acceptance (1)
- Telemedicine (1)
- Threshold calibration (1)
- Torque ripple compensation (1)
- Totally nonnegative matrix (1)
- Tourism (1)
- Unternehmensverantwortung (1)
- Updating supply and use tables (2)
- Urban planning (1)
- Value chain (1)
- Vertrauen (1)
- WTO (1)
- Water management (1)
- Wirtschaftsdeutsch (1)
- Zombie firms (1)
- concatenated codes (1)
- maximum distance separable codes (1)
Institute
- Fakultät Architektur und Gestaltung (3)
- Fakultät Bauingenieurwesen (6)
- Fakultät Elektrotechnik und Informationstechnik (1)
- Fakultät Informatik (1)
- Fakultät Maschinenbau (2)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (10)
- Institut für Angewandte Forschung - IAF (8)
- Institut für Strategische Innovation und Technologiemanagement - IST (1)
- Institut für Systemdynamik - ISD (7)
- Institut für Werkstoffsystemtechnik Thurgau - WITg (3)
Einsatz von Bankettbeton bei schmalen und stark beanspruchten Ortsverbindungs- und Kreisstraßen
(2021)
Als Grundlage für die im Zuge der Verkehrswende anfallenden Planungs- und Entscheidungsprozesse werden aktuelle und digitale Daten des Straßenraums benötigt. Mobile-Mapping-Systeme sind in der Lage, solche raumbezogenen Daten schnell, genau und flächendeckend zu erfassen. Die anfallenden Datenmengen sind dabei jedoch erheblich und der Zeitaufwand für eine manuelle Analyse durch Personen mit entsprechender Expertise immens. Daher ist eine Automatisierung wünschenswert. Der vorliegende Beitrag gibt einen praxisbezogenen Überblick über Anwendungsmöglichkeiten für Künstliche Intelligenz (KI) im Themenbereich Straßenraumerfassung. Aufbauend auf einer thematischen Einführung in Mobile Mapping und KI werden ausgewählte Anwendungen vorgestellt, bei denen KI-Ansätze typische Prozesse der Straßenraumdatenverarbeitung unterstützen und beschleunigen können.
Vertrauen durch Integrität
(2021)
In der Diskussion um unternehmerische Verantwortung hat die Frage nach der Reichweite der Unternehmensverantwortung an Intensität zugenommen, getrieben von der Globalisierung und gesellschaftlichen, ökologischen und technologischen Herausforderungen. Für viele gesellschaftliche und ökologische Problemstellungen wird verstärkt auch die Verantwortung von Unternehmen eingefordert, etwa bei der Achtung von Menschenrechten in der Wertschöpfungskette, der Einhaltung von Sozial- und Umweltstandards, beim Thema Nachhaltigkeit und bei der Produktsicherheit. Wie Unternehmen durch Integritäts- und Compliance-Management ihrer Verantwortung gerecht werden können, zeigt der vorliegende Beitrag.
Compliance wirkt, wenn sie in den Köpfen der Menschen ankommt – und wenn sie adaptiv die Themen der Zeit aufgreift.
Eine Führungskräftebefragung der Kommunikationsagentur A&B One, unterstützt vom Zentrum für Wirtschaftsethik (ZfW), zeichnet hierzu ein aktuelles Bild der wichtigen Zielgruppe “Management”. Der Beitrag skizziert die Sicht von Führungsverantwortlichen aller Ebenen auf die viel diskutierte unternehmerische Verantwortung, auf die Wirksamkeit von Compliance-Maßnahmen und auf Compliance-Risiken im Homeoffice. Er gibt Impulse für die Praxis: von Synergien zwischen Purpose und Integrität bis hin zur Förderung von Regelbewusstsein beim (coronabedingten) Remote Working.
Ferromagnetism is of increasing importance in the growing field of electromobility and data storage. In stable austenitic steels, the occurrence of ferromagnetism is not expected and would also interfere with many applications. However, ferromagnetism in austenitic stainless steels after low-temperature nitriding has already been shown in the past. Herein, the presence of ferromagnetism in austenitic steels is discovered after low-temperature carburization (Kolsterizing), which represents a novel and unique finding. A zone of expanded austenite is established on various austenitic stainless steels by low-temperature carburization and the respective ferromagnetism is investigated in relation to the alloy composition. The ferromagnetism occurring is determined by means of a commercial magnetoinductive sensor (Feritscope). Ferromagnetic domains are visualized by magnetic force microscopy and a ferrofluid. X-ray diffraction measurements indicate a clear difference in the lattice expansion of the different alloys. Furthermore, a different appearance of the magnetizable microstructure regions (magnetic domain structure) is detected depending on the grain orientation determined by electron backscatter diffraction (EBSD). Strongly pronounced magnetic domains show no linear lattice defects, whereas in small magnetizable areas linear lattice defects are detected by electron channeling contrast imaging and EBSD.
Im modernen Automobilbau spielen Fussgängerschutzsysteme eine immer stärker werdende Rolle, um Verletzungen und Todesfälle bei Verkehrsunfällen mit Fussgängerbeteiligung zu reduzieren. Eines dieser Sicherheitssysteme ist die aktive Motorhaube. Durch die Verwendung von Formgedächtnislegierungen (FGL) als Aktoren können die bestehenden Systeme vereinfacht werden, wobei die gleiche Funktion durch neue Mechanismen bei reduzierter Grösse und Gewicht sowie verringerten Kosten ausgeführt werden kann. In diesem Beitrag werden nach einer Einleitung zu existierenden Systemen zur Motorhauben-Anhebung FG-Aktoren und deren potenzielle Einsatzmöglichkeiten in Automobilbau kurz vorgestellt.
Die vorgestellte analytische Berechnungsmethode führt, unter Berücksichtigung desKraftschlusses, der Radsatzdimensionierungund der Dämpfungseigenschaft des Antriebssystems, zu einem konservativ berechnetendynamischen Torsionsmoment.Die ermittelten Abweichungen zeigenleicht gröβere Werte gegenüber der Messungund über einen breiten Parameterbereichtendenziell gröβere Werte gegenüber der Simulation. Demnach stellt die Methodeeinen pragmatischen Ansatz dar, dasmaximale, dynamische Torsionsmomentfür die Auslegung von Radsatzwelle ausreichendkonservativ zu berechnen.
SyNumSeS is a Python package for numerical simulation of semiconductor devices. It uses the Scharfetter-Gummel discretization for solving the one dimensional Van Roosbroeck system which describes the free electron and hole transport by the drift-diffusion model. As boundary conditions voltages can be applied to Ohmic contacts. It is suited for the simulation of pn-diodes, MOS-diodes, LEDs (hetero junction), solar cells, and (hetero) bipolar transistors.
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.
Four-Dimensional Hurwitz Signal Constellations, Set Partitioning, Detection, and Multilevel Coding
(2021)
The Hurwitz lattice provides the densest four-dimensional packing. This fact has motivated research on four-dimensional Hurwitz signal constellations for optical and wireless communications. This work presents a new algebraic construction of finite sets of Hurwitz integers that is inherently accompanied by a respective modulo operation. These signal constellations are investigated for transmission over the additive white Gaussian noise (AWGN) channel. It is shown that these signal constellations have a better constellation figure of merit and hence a better asymptotic performance over an AWGN channel when compared with conventional signal constellations with algebraic structure, e.g., two-dimensional Gaussian-integer constellations or four-dimensional Lipschitz-integer constellations. We introduce two concepts for set partitioning of the Hurwitz integers. The first method is useful to reduce the computational complexity of the symbol detection. This suboptimum detection approach achieves near-maximum-likelihood performance. In the second case, the partitioning exploits the algebraic structure of the Hurwitz signal constellations. We partition the Hurwitz integers into additive subgroups in a manner that the minimum Euclidean distance of each subgroup is larger than in the original set. This enables multilevel code constructions for the new signal constellations.
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.
The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the McEliece system and a new channel model. With this one Mannheim error channel, errors are limited to weight one. We investigate the channel capacity of this channel and discuss its relation to the McEliece system. The proposed codes are based on a simple product code construction and have a low complexity decoding algorithm. For the one Mannheim error channel, these codes achieve a higher error correction capability than maximum distance separable codes with bounded minimum distance decoding. This improves the work factor regarding decoding attacks based on information-set decoding.
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
(2021)
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem together with the one-Mannheim error channel, where the error values are limited to Mannheim weight one. Due to the limited error values, the codes over Gaussian integers achieve a higher error correction capability than maximum distance separable (MDS) codes with bounded minimum distance decoding. This higher error correction capability improves the work factor regarding decoding attacks based on information-set decoding. The codes also enable a low complexity decoding algorithm for decoding beyond the guaranteed error correction capability. In this work, we extend this coding scheme to codes over Eisenstein integers. These codes have advantages for the Niederreiter system. Additionally, we propose an improved code construction based on generalized concatenated codes. These codes extent the rate region where the work factor is beneficial compared to MDS codes. Moreover, generalized concatenated codes are more robust against structural attacks than ordinary concatenated codes.