3,806 research outputs found
Intelligent failure-tolerant control
An overview of failure-tolerant control is presented, beginning with robust control, progressing through parallel and analytical redundancy, and ending with rule-based systems and artificial neural networks. By design or implementation, failure-tolerant control systems are 'intelligent' systems. All failure-tolerant systems require some degrees of robustness to protect against catastrophic failure; failure tolerance often can be improved by adaptivity in decision-making and control, as well as by redundancy in measurement and actuation. Reliability, maintainability, and survivability can be enhanced by failure tolerance, although each objective poses different goals for control system design. Artificial intelligence concepts are helpful for integrating and codifying failure-tolerant control systems, not as alternatives but as adjuncts to conventional design methods
Sequential Transient Detection for RF Fingerprinting
In this paper, a sequential transient detection method for radio frequency (RF) fingerprinting used in the identification of wireless devices is proposed. To the best knowledge of the authors, sequential detection of transient signals for RF fingerprinting has not been considered in the literature. The proposed method is based on an approximate implementation of the generalized likelihood ratio algorithm. The method can be implemented online in a recursive manner with low computational and memory requirements. The transients of wireless transmitters are detected by using the likelihood ratio of the observations without the requirement of any a priori knowledge about the transmitted signals. The performance of the method was evaluated using experimental data collected from 16 Wi-Fi transmitters and compared to those of two existing methods. The experimental test results showed that the proposed method can be used to detect the transient signals with a low detection delay. Our proposed method estimates transient starting points 20-times faster compared to an existing robust method, as well as providing a classification performance of a mean accuracy close to 95%
Neural-Kalman Schemes for Non-Stationary Channel Tracking and Learning
This Thesis focuses on channel tracking in Orthogonal Frequency-Division Multiplexing (OFDM), a
widely-used method of data transmission in wireless communications, when abrupt changes occur
in the channel. In highly mobile applications, new dynamics appear that might make channel
tracking non-stationary, e.g. channels might vary with location, and location rapidly varies with
time. Simple examples might be the di erent channel dynamics a train receiver faces when it is
close to a station vs. crossing a bridge vs. entering a tunnel, or a car receiver in a route that
grows more tra c-dense. Some of these dynamics can be modelled as channel taps dying or being
reborn, and so tap birth-death detection is of the essence.
In order to improve the quality of communications, we delved into mathematical methods to
detect such abrupt changes in the channel, such as the mathematical areas of Sequential Analysis/
Abrupt Change Detection and Random Set Theory (RST), as well as the engineering advances
in Neural Network schemes. This knowledge helped us nd a solution to the problem of abrupt
change detection by informing and inspiring the creation of low-complexity implementations for
real-world channel tracking. In particular, two such novel trackers were created: the Simpli-
ed Maximum A Posteriori (SMAP) and the Neural-Network-switched Kalman Filtering (NNKF)
schemes.
The SMAP is a computationally inexpensive, threshold-based abrupt-change detector. It applies
the three following heuristics for tap birth-death detection: a) detect death if the tap gain
jumps into approximately zero (memoryless detection); b) detect death if the tap gain has slowly
converged into approximately zero (memory detection); c) detect birth if the tap gain is far from
zero.
The precise parameters for these three simple rules can be approximated with simple theoretical
derivations and then ne-tuned through extensive simulations. The status detector for each
tap using only these three computationally inexpensive threshold comparisons achieves an error
reduction matching that of a close-to-perfect path death/birth detection, as shown in simulations.
This estimator was shown to greatly reduce channel tracking error in the target Signal-to-Noise
Ratio (SNR) range at a very small computational cost, thus outperforming previously known systems.
The underlying RST framework for the SMAP was then extended to combined death/birth
and SNR detection when SNR is dynamical and may drift. We analyzed how di erent quasi-ideal
SNR detectors a ect the SMAP-enhanced Kalman tracker's performance. Simulations showed
SMAP is robust to SNR drift in simulations, although it was also shown to bene t from an accurate
SNR detection.
The core idea behind the second novel tracker, NNKFs, is similar to the SMAP, but now the tap
birth/death detection will be performed via an arti cial neuronal network (NN). Simulations show
that the proposed NNKF estimator provides extremely good performance, practically identical to a detector with 100% accuracy.
These proposed Neural-Kalman schemes can work as novel trackers for multipath channels,
since they are robust to wide variations in the probabilities of tap birth and death. Such robustness
suggests a single, low-complexity NNKF could be reusable over di erent tap indices and
communication environments.
Furthermore, a di erent kind of abrupt change was proposed and analyzed: energy shifts from
one channel tap to adjacent taps (partial tap lateral hops). This Thesis also discusses how to
model, detect and track such changes, providing a geometric justi cation for this and additional
non-stationary dynamics in vehicular situations, such as road scenarios where re ections on trucks
and vans are involved, or the visual appearance/disappearance of drone swarms. An extensive
literature review of empirically-backed abrupt-change dynamics in channel modelling/measuring
campaigns is included.
For this generalized framework of abrupt channel changes that includes partial tap lateral
hopping, a neural detector for lateral hops with large energy transfers is introduced. Simulation
results suggest the proposed NN architecture might be a feasible lateral hop detector, suitable for
integration in NNKF schemes.
Finally, the newly found understanding of abrupt changes and the interactions between Kalman
lters and neural networks is leveraged to analyze the neural consequences of abrupt changes
and brie y sketch a novel, abrupt-change-derived stochastic model for neural intelligence, extract
some neuro nancial consequences of unstereotyped abrupt dynamics, and propose a new
portfolio-building mechanism in nance: Highly Leveraged Abrupt Bets Against Failing Experts
(HLABAFEOs). Some communication-engineering-relevant topics, such as a Bayesian stochastic
stereotyper for hopping Linear Gauss-Markov (LGM) models, are discussed in the process.
The forecasting problem in the presence of expert disagreements is illustrated with a hopping
LGM model and a novel structure for a Bayesian stereotyper is introduced that might eventually
solve such problems through bio-inspired, neuroscienti cally-backed mechanisms, like dreaming
and surprise (biological Neural-Kalman). A generalized framework for abrupt changes and expert
disagreements was introduced with the novel concept of Neural-Kalman Phenomena. This Thesis
suggests mathematical (Neural-Kalman Problem Category Conjecture), neuro-evolutionary and
social reasons why Neural-Kalman Phenomena might exist and found signi cant evidence for their
existence in the areas of neuroscience and nance.
Apart from providing speci c examples, practical guidelines and historical (out)performance
for some HLABAFEO investing portfolios, this multidisciplinary research suggests that a Neural-
Kalman architecture for ever granular stereotyping providing a practical solution for continual
learning in the presence of unstereotyped abrupt dynamics would be extremely useful in communications
and other continual learning tasks.Programa de Doctorado en Multimedia y Comunicaciones por la Universidad Carlos III de Madrid y la Universidad Rey Juan CarlosPresidente: Luis Castedo Ribas.- Secretaria: Ana GarcĂa Armada.- Vocal: JosĂ© Antonio Portilla Figuera
Long-term adaptation and distributed detection of local network changes
We present a statistical approach to distributed detection of local latency shifts in networked systems. For this purpose, response delay measurements are performed between neighbouring nodes via probing. The expected probe response delay on each connection is statistically modelled via parameter estimation. Adaptation to drifting delays is accounted for by the use of overlapping models, such that previous models are partially used as input to future models. Based on the symmetric Kullback-Leibler divergence metric, latency shifts can be detected by comparing the estimated parameters of the current and previous models. In order to reduce the number of detection alarms, thresholds for divergence and convergence are used.
The method that we propose can be applied to many types of statistical distributions, and requires only constant memory compared to e.g., sliding window techniques and decay functions. Therefore, the method is applicable in various kinds of network equipment with limited capacity, such as sensor networks, mobile ad hoc networks etc. We have investigated the behaviour of the method for different model parameters. Further, we have tested the detection performance in network simulations, for both gradual and abrupt shifts in the probe response delay. The results indicate that over 90% of the shifts can be detected. Undetected shifts are mainly the effects of long convergence processes triggered by previous shifts. The overall performance depends on the characteristics of the shifts and the configuration of the model parameters
Zero-bias Deep Learning Enabled Quick and Reliable Abnormality Detection in IoT
Abnormality detection is essential to the performance of safety-critical and latency-constrained systems. However, as systems are becoming increasingly complicated with a large quantity of heterogeneous data, conventional statistical change point detection methods are becoming less effective and efficient. Although Deep Learning (DL) and Deep Neural Networks (DNNs) are increasingly employed to handle heterogeneous data, they still lack theoretic assurable performance and explainability. This paper integrates zero-bias DNN and Quickest Event Detection algorithms to provide a holistic framework for quick and reliable detection of both abnormalities and time-dependent abnormal events in Internet of Things (IoT).We first use the zero bias dense layer to increase the explainability of DNN. We provide a solution to convert zero-bias DNN classifiers into performance assured binary abnormality detectors. Using the converted abnormality detector, we then present a sequential quickest detection scheme which provides the theoretically assured lowest abnormal event detection delay under false alarm constraints. Finally, we demonstrate the effectiveness of the framework using both massive signal records from real-world aviation communication systems and simulated data
- …