Quantification of temporal fault trees based on fuzzy set theory

© Springer International Publishing Switzerland 2014. Fault tree analysis (FTA) has been modified in different ways to make it capable of performing quantitative and qualitative safety analysis with temporal gates, thereby overcoming its limitation in capturing sequential failure behaviour. However, for many systems, it is often very difficult to have exact failure rates of components due to increased complexity of systems, scarcity of necessary statistical data etc. To overcome this problem, this paper presents a methodology based on fuzzy set theory to quantify temporal fault trees. This makes the imprecision in available failure data more explicit and helps to obtain a range of most probable values for the top event probability

Fuzzy Jets

Collimated streams of particles produced in high energy physics experiments are organized using clustering algorithms to form jets. To construct jets, the experimental collaborations based at the Large Hadron Collider (LHC) primarily use agglomerative hierarchical clustering schemes known as sequential recombination. We propose a new class of algorithms for clustering jets that use infrared and collinear safe mixture models. These new algorithms, known as fuzzy jets, are clustered using maximum likelihood techniques and can dynamically determine various properties of jets like their size. We show that the fuzzy jet size adds additional information to conventional jet tagging variables. Furthermore, we study the impact of pileup and show that with some slight modifications to the algorithm, fuzzy jets can be stable up to high pileup interaction multiplicities

Covariant fuzzy observables and coarse-graining

A fuzzy observable is regarded as a smearing of a sharp observable, and the structure of covariant fuzzy observables is studied. It is shown that the covariant coarse-grainings of sharp observables are exactly the covariant fuzzy observables. A necessary and sufficient condition for a covariant fuzzy observable to be informationally equivalent to the corresponding sharp observable is given.Comment: 19 page

Predictive intelligence to the edge through approximate collaborative context reasoning

We focus on Internet of Things (IoT) environments where a network of sensing and computing devices are responsible to locally process contextual data, reason and collaboratively infer the appearance of a specific phenomenon (event). Pushing processing and knowledge inference to the edge of the IoT network allows the complexity of the event reasoning process to be distributed into many manageable pieces and to be physically located at the source of the contextual information. This enables a huge amount of rich data streams to be processed in real time that would be prohibitively complex and costly to deliver on a traditional centralized Cloud system. We propose a lightweight, energy-efficient, distributed, adaptive, multiple-context perspective event reasoning model under uncertainty on each IoT device (sensor/actuator). Each device senses and processes context data and infers events based on different local context perspectives: (i) expert knowledge on event representation, (ii) outliers inference, and (iii) deviation from locally predicted context. Such novel approximate reasoning paradigm is achieved through a contextualized, collaborative belief-driven clustering process, where clusters of devices are formed according to their belief on the presence of events. Our distributed and federated intelligence model efficiently identifies any localized abnormality on the contextual data in light of event reasoning through aggregating local degrees of belief, updates, and adjusts its knowledge to contextual data outliers and novelty detection. We provide comprehensive experimental and comparison assessment of our model over real contextual data with other localized and centralized event detection models and show the benefits stemmed from its adoption by achieving up to three orders of magnitude less energy consumption and high quality of inference

On Vague Computers

Vagueness is something everyone is familiar with. In fact, most people think that vagueness is closely related to language and exists only there. However, vagueness is a property of the physical world. Quantum computers harness superposition and entanglement to perform their computational tasks. Both superposition and entanglement are vague processes. Thus quantum computers, which process exact data without "exploiting" vagueness, are actually vague computers

Unifying Practical Uncertainty Representations: II. Clouds

There exist many simple tools for jointly capturing variability and incomplete information by means of uncertainty representations. Among them are random sets, possibility distributions, probability intervals, and the more recent Ferson's p-boxes and Neumaier's clouds, both defined by pairs of possibility distributions. In the companion paper, we have extensively studied a generalized form of p-box and situated it with respect to other models . This paper focuses on the links between clouds and other representations. Generalized p-boxes are shown to be clouds with comonotonic distributions. In general, clouds cannot always be represented by random sets, in fact not even by 2-monotone (convex) capacities.Comment: 30 pages, 7 figures, Pre-print of journal paper to be published in International Journal of Approximate Reasoning (with expanded section concerning clouds and probability intervals