FG Kommunikationstechnik
Refine
Year of publication
Document Type
- Conference Proceeding (180)
- Part of a book (chapter) (24)
- Scientific journal article peer-reviewed (21)
- Conference publication peer-reviewed (21)
- Scientific journal article not peer-reviewed (15)
- Book (publisher) (9)
- Report (8)
- Patent (7)
- Doctoral thesis (6)
- Book (3)
Way of publication
- Open Access (7)
Keywords
- machine learning (4)
- Künstliche Intelligenz (2)
- Machine learning (2)
- Music psychology (2)
- Non-destructive testing (2)
- AURORA (1)
- Accessability (1)
- Acoustic (1)
- Anfragesysteme (1)
- Artificial intelligence (1)
Institute
Künstliche Intelligenz zieht derzeit in alle Bereiche der Gesellschaft und des Lebens ein. Aber welchen Stellenwert hat sie momentan auf dem Gebiet der zerstörungsfreien Prüfung? Was kann KI leisten? Welche Herausforderungen müssen erfolgreich bewältigt werden? Gibt es das eine KI-Verfahren, welches prinzipiell für ZfP geeignet ist? Bei der Bauteil- und Materialprüfung während und unmittelbar nach der Herstellung, der Überwachung von Verschleißteilen in Maschinen und Anlagen oder der Schadensdetektion an Bauteilen und Komponenten liefern ZfP-Verfahren Daten, die bewertet werden müssen. Obwohl inzwischen sehr leistungsfähige Toolkits verfügbar sind, erfordert der optimale Einsatz der KI für ein ZfP-Verfahren oftmals mehr. Die meisten Kunden möchten nicht nur eine Lösung ihres Problems; sie wollen verstehen, warum die KI so und nicht anders entschieden hat, warum der Klassifikator das Bauteil einer bestimmten Klasse (z. B. gut/schlecht oder neuwertig/verschlissen/defekt) zugewiesen hat. Abhängig von der Klassifikationsaufgabe sowie der Art und der Anzahl der vorliegenden Daten kann ein geeignetes Verfahren bestimmt werden. Mit Methoden des maschinellen Lernens werden Modelle gebildet, welche die Basis für die KI-Verfahren zur Klassifikation bilden.
Der Beitrag liefert einen Überblick über KI-Verfahren und deren Anwendungen in der zerstörungsfreien Prüfung. Zahlreiche Beispiele und Ergebnisse werden vorgestellt, um die Mannigfaltigkeit des Einsatzes in der ZfP und der bestehenden Möglichkeiten zu demonstrieren.
In this paper we give instructions on how to write a minimalist grammar (MG). In order to present the instructions as an algorithm, we use a variant of context free grammars (CFG) as an input format. We can exclude overgeneration, if the CFG has no recursion, i.e. no non-terminal can (indirectly) derive to a right-hand side containing itself. The constructed MGs utilize licensors/-ees as a special way of exception handling. A CFG format for a derivation A_eats_B↦∗peter_eats_apples, where A and B generate noun phrases, normally leads to overgeneration, e.\,g., i_eats_apples. In order to avoid overgeneration, a CFG would need many non-terminal symbols and rules, that mainly produce the same word, just to handle exceptions. In our MGs however, we can summarize CFG rules that produce the same word in one item and handle exceptions by a proper distribution of licensees/-ors. The difficulty with this technique is that in most generations the majority of licensees/-ors is not needed, but still has to be triggered somehow. We solve this problem with ϵ-items called \emph{adapters}.
Artificial intelligence experienced a technological breakthrough in science, industry, and everyday life in the recent few decades. The advancements can be credited to the ever-increasing availability and miniaturization of computational resources that resulted in exponential data growth. However, because of the insufficient amount of data in some cases, employing machine learning in solving complex tasks is not straightforward or even possible. As a result, machine learning with small data experiences rising importance in data science and application in several fields. The authors focus on interpreting the general term of "small data" and their engineering and industrial application role. They give a brief overview of the most important industrial applications of machine learning and small data. Small data is defined in terms of various characteristics compared to big data, and a machine learning formalism was introduced. Five critical challenges of machine learning with small data in industrial applications are presented: unlabeled data, imbalanced data, missing data, insufficient data, and rare events. Based on those definitions, an overview of the considerations in domain representation and data acquisition is given along with a taxonomy of machine learning approaches in the context of small data.
The renaissance of artificial intelligence (AI) in the last decade can be credited to several factors, but chief among these is the ever-increasing availability and miniaturization of computational resources. This process has contributed to the rise of ubiquitous computing via popularizing smart devices and the Internet of Things in everyday life. In turn, this has resulted in the generation of increasingly enormous amounts of data. The tech giants are harvesting and storing data on their clients’ behavior and, at the same time, introducing concerns about data privacy and protection. Suddenly, such an abundance of data and computing power, which was unimaginable a few decades ago, has caused a revival of old and the invention of new machine learning paradigms, like Deep Learning. Artificial intelligence has undergone a technological breakthrough in various fields, achieving better than human performance in many areas (such as vision, board games etc.). More complex tasks require more sophisticated algorithms that need more and more data. It has often been said that data is becoming a resource that is "more valuable than oil"; however, not all data is equally available and obtainable. Big data can be described by using the "four Vs"; data with immense velocity, volume, variety, and low veracity. In contrast, small data do not possess any of those qualities; they are limited in size and nature and are observed or produced in a controlled manner. Big data, along with powerful computing and storage resources, allow “black box” AI algorithms for various problems previously deemed unsolvable. One could create AI applications even without the underlying expert knowledge, assuming there are enough data and the right tools available (e.g. end-to-end speech recognition and generation, image and object recognition). There are numerous fields in science, industry and everyday life where AI has vast potential. However, due to the lack of big data, application is not straightforward or even possible. A good example is AI in medicine, where an AI system is intended to assist physicians in diagnosing and treating rare or previously never observed conditions, and there is no or an insufficient amount of data for reliable AI deployment. Both big and small data concepts have limitations and prospects for different fields of application. This paper will try to identify and present them by giving real-world examples in various AI fields.
Machine Semiotics
(2023)
Recognizing a basic difference between the semiotics of humans and machines presents a possibility to overcome the shortcomings of current speech assistive devices. For the machine, the meaning of a (human) utterance is defined by its own scope of actions. Machines, thus, do not need to understand the conventional meaning of an utterance. Rather, they draw conversational implicatures in the sense of (neo-)Gricean pragmatics. For speech assistive devices, the learning of machine-specific meanings of human utterances, i.e. the fossilization of conversational implicatures into conventionalized ones by trial and error through lexicalization appears to be sufficient. Using the quite trivial example of a cognitive heating | device, we show that — based on dynamic semantics — this process can be formalized as the reinforcement learning of utterance-meaning pairs (UMP).
Das wesentliche Ziel dieses Lehrbuchs ist es, die mathematischen Werkzeuge zur Modellierung kognitiver Strukturen und Prozesse auf der Grundlage der klassischen Logik und der Quantenlogik zu entwickeln. Die dafür erforderlichen mathematischen Sachverhalte werden so dargestellt und anhand von Beispielen motiviert, dass sie für angehende Ingenieure und Informatiker verständlich sind.
- Kompakte logische Darstellung der mathematischen Werkzeuge zur Modellierung kognitiver Strukturen und Prozesse
- Beispiele erläutern die Anwendung im Engineering
Zielgruppen sind insbesondere Studierende der Ingenieurwissenschaften und der Informatik, aber auch Studierende der Mathematik oder der Physik können durch den anwendungsbezogenen Blick ihren Horizont erweitern.
Ultrasonic Testing (UT) has seen increasing application of machine learning (ML) in recent years, promoting higher-level automation and decision-making in flaw detection and classification. Building a generalized training dataset to apply ML in non-destructive evaluation (NDE), and thus UT, is exceptionally difficult since data on pristine and representative flawed specimens are needed. Yet, in most UT test cases flawed specimen data is inherently rare making data coverage the leading problem when applying ML. Common data augmentation (DA) strategies offer limited solutions as they don’t increase the dataset variance, which can lead to overfitting of the training data. The virtual defect method and the recent application of generative adversarial neural networks (GANs) in UT are sophisticated DA methods targeting to solve this problem. On the other hand, well-established research in modeling ultrasonic wave propagations allows for the generation of synthetic UT training data. In this context, we present a first thematic review to summarize the progress of the last decades on synthetic and augmented UT training data in NDE. Additionally, an overview of methods for synthetic UT data generation and augmentation is presented. Among numerical methods such as finite element, finite difference, and elastodynamic finite integration methods, semi-analytical methods such as general point source synthesis, superposition of Gaussian beams, and the pencil method as well as other UT modeling software are presented and discussed. Likewise, existing DA methods for one- and multidimensional UT data, feature space augmentation, and GANs for augmentation are presented and discussed. The paper closes with an in-detail discussion of the advantages and limitations of existing methods for both synthetic UT training data generation and DA of UT data to aid the decision-making of the reader for the application to specific test cases.
Softness is one of the essential properties of hygiene tissue products. Reliably measuring it is of utmost importance to ensure the balance between customer expectations and cost-effective tissue production. This study presents a method for assessing softness by analyzing acoustic emissions produced while tearing a tissue specimen. The aim was to train neural network models using the corrected results of human panel tests as the ground truth labels and to predict the tissue softness in two- and three-class recognition tasks. We also investigate the possibility of predicting some production parameters related to the softness property. The results proved that tissue softness and production parameters could be reliably estimated only by the tearing noise.
In this paper we show how word class based language modeling can support the integration of a small language in modern applications of speech technology. The methods described in this paper can be applied for any language. We demonstrate the methods on Upper Sorbian. The word classes model the semantic expressions of numerals, date and time of day. The implementation of the created grammars was realized in the form of finite-state-transducers (FSTs) and minimalists grammars (MGs). We practically demonstrate the usage of the FSTs in a simple smart-home speech application, that is able to set wake-up alarms and appointments expressed in a variety of spontaneous and natural sentences. While the created MGs are not integrated in an application for practical use yet, they provide evidence that MGs could potentially work more efficient than FSTs in built-on applications. In particular, MGs can work with a significantly smaller lexicon size, since their more complex structure lets them generate more expressions with less items, while still avoiding wrong expressions.
The concept of intelligent agents is—roughly speaking—based on an architecture and a set of behavioral programs that primarily serve to solve problems autonomously.
Increasing the degree of autonomy and improving cognitive performance, which can be assessed using cognitive and behavioral tests, are two important research trends. The degree of autonomy can be increased using higher-level psychological modules with which needs and motives are taken into account. In our approach we integrate these modules in architecture for an embodied, enactive multi-agent system, such that distributed problem solutions can be achieved. Furthermore, after uncovering some weaknesses in the cognitive performance of traditionally designed agents, we focus on two major aspects. On the one hand, the knowledge processing of cognitive agents is based on logical formalisms, which have deficiencies in the representation and processing of incomplete or uncertain knowledge. On the other hand, in order to fully understand the performance of cognitive agents, explanations at the symbolic and subsymbolic levels are required. Both aspects can be addressed by quantum-inspired cognitive agents. To investigate this approach, we consider two tasks in the sphere of Shannon's famous mouse-maze problem: namely classifying target objects and ontology inference. First, the classification of an unknown target object in the mouse-maze, such as cheese, water, and bacon, is based on sensory data that measure characteristics such as odor, color, shape, or nature. For an intelligent agent, we need a classifier with good prediction accuracy and explanatory power on a symbolic level. Boolean logic classifiers do work on a symbolic level but are not adequate for dealing with continuous data. Therefore, we demonstrate and evaluate a quantum-logic-inspired classifier in comparison to Boolean-logic-based classifiers. Second, ontology inference is iteratively achieved by a quantum-inspired agent through maze exploration. This requires the agent to be able to manipulate its own state by performing actions and by collecting sensory data during perception. We suggest an algebraic approach where both kinds of behaviors are uniquely described by quantum operators. The agent's state space is then iteratively constructed by carrying out unitary action operators, while Hermitian perception operators act as observables on quantum eigenstates. As a result, an ontology emerges as the simultaneous solution of the respective eigenvalue equations.
Tags: btuktqiai; btuktcogsys; btukttheseus; btuktqtheseus
Based on the fact that cogwheels are indispensable parts in manufacturing, we present the acoustic resonance testing (ART) of small data on sintered cogwheels for quality control in the context of non-destructive testing (NDT). Considering the lack of extensive studies on cogwheel data by means of ART in combination with machine learning (ML), we utilize time-frequency domain feature analysis and apply ML algorithms to the obtained feature sets in order to detect damaged samples in two ways: one-class and binary classification. In each case, despite small data, our approach delivers robust performance: All damaged test samples reflecting real-world scenarios are recognized in two one-class classifiers (also called detectors), and one intact test sample is misclassified in binary ones. This shows the usefulness of ML and time-frequency domain feature analysis in ART on a sintered cogwheel dataset.
Simulations of thin film sputter deposition require the separation of the plasma and material transport in the gas phase from the growth/sputtering processes at the bounding surfaces (e.g., substrate and target). Interface models based on analytic expressions or look-up tables inherently restrict this complex interaction to a bare minimum. A machine learning model has recently been shown to overcome this remedy for Ar ions bombarding a Ti-Al composite target. However, the chosen network structure (i.e., a multilayer perceptron, MLP) provides approximately 4×106 degrees of freedom, which bears the risk of overfitting the relevant dynamics and complicating the model to an unreliable extent. This work proposes a conceptually more sophisticated but parameterwise simplified regression artificial neural network for an extended scenario, considering a variable instead of a single fixed Ti-Al stoichiometry. A convolutional 𝛽-variational autoencoder is trained to reduce the high-dimensional energy-angular distribution of sputtered particles to a low-dimensional latent representation with only two components. In addition to a primary decoder that is trained to reconstruct the input energy-angular distribution, a secondary decoder is employed to reconstruct the mean energy of incident Ar ions as well as the present Ti-Al composition. The mutual latent space is hence conditioned on these quantities. The trained primary decoder of the variational autoencoder network is subsequently transferred to a regression network, for which only the mapping to the particular low-dimensional space has to be learned. While obtaining a competitive performance, the number of degrees of freedom is drastically reduced to 15 111 (0.378% of the MLP) and 486 (0.012% of the MLP) parameters for the primary decoder and the remaining regression network, respectively. The underlying methodology is very general and can easily be extended to more complex physical descriptions (e.g., taking into account dynamical surface properties) with a minimal amount of data required.
Cognitive agents that act independently and solve problems in their environment on behalf of a user are referred to as autonomous. In order to increase the degree of autonomy, advanced cognitive architectures also contain higher-level psychological modules with which needs and motives of the agent are also taken into account and with which the behavior of the agent can be controlled. Regardless of the level of autonomy, successful behavior is based on interacting with the environment and being able to communicate with other agents or users. The agent can use these skills to learn a truthful knowledge model of the environment and thus predict the consequences of its own actions. For this purpose, the symbolic information received during the interaction and communication must be converted into representational data structures so that they can be stored in the knowledge model, processed logically and retrieved from there. Here, we firstly outline a grammar-based transformation mechanism that unifies the description of physical interaction and linguistic communication and on which the language acquisition is based. Specifically, we use minimalist grammar (MG) for this aim, which is a recent computational implementation of generative linguistics. In order to develop proper cognitive information and communication technologies, we are using utterance meaning transducers (UMT) that are based on semantic parsers and a mental lexicon, comprising syntactic and semantic features of the language under consideration. This lexicon must be acquired by a cognitive agent during interaction with its users. To this aim we outline a reinforcement learning algorithm for the acquisition of syntax and semantics of English utterances. English declarative sentences are presented to the agent by a teacher in form of utterance meaning pairs (UMP) where the meanings are encoded as formulas of predicate logic. Since MG codifies universal linguistic competence through inference rules, thereby separating innate linguistic knowledge from the contingently acquired lexicon, our approach unifies generative grammar and reinforcement learning, hence potentially resolving the still pending Chomsky-Skinner controversy.
btuktuminglear, btuktsptech, btuktcogsys
Vector symbolic architectures (VSA) are a viable approach for the hyperdimensional representation of symbolic data, such as documents, syntactic structures, or semantic frames. We present a rigorous mathematical framework for the representation of phrase structure trees and parse trees of context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space as being used in quantum field theory. We define a novel normal form for CFG by means of term algebras. Using a recently developed software toolbox, called FockBox, we construct Fock space representations for the trees built up by a CFG left-corner (LC) parser. We prove a universal representation theorem for CFG term algebras in Fock space and illustrate our findings through a low-dimensional principal component projection of the LC parser state. Our approach could leverage the development of VSA for explainable artificial intelligence (XAI) by means of hyperdimensional deep neural computation.
Das Fachgebiet der Kognitiven Technischen Systeme zeichnet sich durch einen hohen Grad an Interdisziplinarität (z. B. Kenntnisse auf den Gebieten Biologie, Psychologie, Informatik und den Ingenieurwissenschaften) aus. Nach wie vor besteht Bedarf an einer methodischen Darstellung des Fachgebietes, bei der die theoretische Durchdringung von Zusammenhängen zwischen den verschiedenen Wissensgebieten zusätzlich durch Anschaulichkeit unterstützt wird. Die vorliegende Arbeit stellt einen Fortschrittsbericht zur Realisierung eines Forschungs- und Experimentiersystems dar, mit dem wir dieses Anliegen unterstützen und über das wir erstmals konzeptionell in [1] berichtet haben. In diesem Beitrag folgen wir einem integrativen Ansatz zur Entwicklung einer kognitiven Architektur, mit der unter Verwendung repräsentationaler Datenstrukturen adaptives Verhalten auf verschiedenen Zeitskalen sowie zwei wichtige Verhaltensprogramme für das Problemlösen (Objektfindung, Exploration) auf der gemeinsamen Grundlage von Markov-Entscheidungsprozessen umgesetzt werden. Mit einem Kurzbericht zum Entwicklungsstand der physikalischen Experimentierumgebung und einer Zusammenfassung der bislang erreichten Ergebnisse beschließen wir den diesjährigen Beitrag.