Fault Detection for Message Passing Systems

2018 ◽  
Vol 27 (05) ◽  
pp. 1850070 ◽  
Author(s):  
Mehmet Hakan Karaata ◽  
Ali Hamdan ◽  
Maha H. Faisal ◽  
Feda A. AlShawan
Keyword(s):  
Fault Detection ◽  
Message Passing ◽  
Necessary Conditions ◽  
A Priori ◽  
Disjoint Paths ◽  
Packet Size ◽  
Failure Treatment ◽  
Multiple Messages ◽  
Transaction Services ◽  
Fault Detectors

Many crucial dependable and secure services including atomic commitment, consensus and group membership, and middleware services (such as replica, communication and transaction services) use fault detectors. Through the use of fault detectors, the overlying service can be exempted from failure treatment and synchronization requirements. Fault detection is essential for proving that the services carried out are correct. In this paper, we first identify the necessary conditions to detect faults in a message passing system where multiple disjoint paths exist between each pair of endpoints. We then present the first fault detection protocol capable of detecting message meta-data modification in the presence of various message interferences in addition to other faults including omission faults, message replay and spurious messages using disjoint paths, where paths with faults are not known a priori. In addition, it authenticates message origins allowing Sybil attacks to be detected, identifies faulty paths, and classifies faults in the presence of multiple messages sent by various system processes. We establish the completeness and soundness properties of the proposed algorithm, i.e., it detects each considered fault and each detected fault is an actual fault, respectively. We also show that our algorithm does not yield a significant packet size and delay overheads. The algorithm shows the viability of the use of disjoint paths in fault detection.

Building Attention and Edge Convolution Neural Networks for Bioactivity and Physical-Chemical Property Prediction

2019 ◽  
Author(s):  
Michael Withnall ◽  
Edvard Lindelöf ◽  
Ola Engkvist ◽  
Hongming Chen
Keyword(s):  
Message Passing ◽  
State Of The Art ◽  
A Priori ◽  
Model Performance ◽  
Learning Approaches ◽  
Physical Chemical ◽  
Chemical Descriptor ◽  
Derived Properties ◽  
Memory Schemes ◽  
Hyperparameter Selection

We introduce Attention and Edge Memory schemes to the existing Message Passing Neural Network framework for graph convolution, and benchmark our approaches against eight different physical-chemical and bioactivity datasets from the literature. We remove the need to introduce <i>a priori</i> knowledge of the task and chemical descriptor calculation by using only fundamental graph-derived properties. Our results consistently perform on-par with other state-of-the-art machine learning approaches, and set a new standard on sparse multi-task virtual screening targets. We also investigate model performance as a function of dataset preprocessing, and make some suggestions regarding hyperparameter selection.

scholarly journals The Tantalus’ Torments of Transcendentalism

2021 ◽  
Vol 2 (2) ◽  
pp. 0
Author(s):  
Sergey Chernov
Keyword(s):  
Natural Science ◽  
Empirical Investigation ◽  
Necessary Conditions ◽  
Complete System ◽  
A Priori ◽  
Transcendental Philosophy ◽  
Critique Of Pure Reason ◽  
German Edition ◽  
Opus Postumum ◽  
Corporeal Nature

Kant’s manuscripts of 1796–1803, which the Academic German edition of his works combined in 21–22 volumes of under the invented by H. Vaihinger name ‘Opus postumum’, still attract the attention of researchers. Was there really a significant theoretical “gap” in the system of Kant&apos;s “critical”, transcendental philosophy, which built by 1790, needed to be filled, namely, to undertake a conceptual &quot;transition&quot; from the already constructed a priori metaphysics of corporeal nature (metaphysical principles of natural science) to experimental mathematical physics, to the entire scientific empirical investigation of nature? In the last years of his life Kant tried to solve a problem that was really decisive for the fate of transcendentalism, which he had already realized in ‘Critique of Pure Reason’ and concretized in ‘Metaphysical Foundations of Natural Science’, however he found himself in a hopeless situation, which doomed him to the “Tantalus’ torments”. The problem that he was constantly thinking about necessarily arises in the system of transcendental philosophy, but has no solution in it. ‘Opus postumum’ is an important piece of evidence on the insurmountable difficulties faced by the attempt to “save” philosophy as a perfect and complete system of absolutely reliable, &quot;apodictic&quot; science, based on the idea of universal and necessary conditions for the experience possibility.

scholarly journals Building attention and edge message passing neural networks for bioactivity and physical–chemical property prediction

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
M. Withnall ◽  
E. Lindelöf ◽  
O. Engkvist ◽  
H. Chen
Keyword(s):  
Machine Learning ◽  
Message Passing ◽  
A Priori ◽  
Molecular Graph ◽  
Model Performance ◽  
Learning Approaches ◽  
Property Prediction ◽  
Physical Chemical ◽  
Chemical Descriptor ◽  
Hyperparameter Selection

AbstractNeural Message Passing for graphs is a promising and relatively recent approach for applying Machine Learning to networked data. As molecules can be described intrinsically as a molecular graph, it makes sense to apply these techniques to improve molecular property prediction in the field of cheminformatics. We introduce Attention and Edge Memory schemes to the existing message passing neural network framework, and benchmark our approaches against eight different physical–chemical and bioactivity datasets from the literature. We remove the need to introduce a priori knowledge of the task and chemical descriptor calculation by using only fundamental graph-derived properties. Our results consistently perform on-par with other state-of-the-art machine learning approaches, and set a new standard on sparse multi-task virtual screening targets. We also investigate model performance as a function of dataset preprocessing, and make some suggestions regarding hyperparameter selection.

A PCA Based Fault Detection and Isolation Method for Train Locating System

2010 ◽  
Vol 20-23 ◽  
pp. 688-693
Author(s):  
Jiang Liu ◽  
Bai Gen Cai ◽  
Tao Tang ◽  
Jian Wang
Keyword(s):  
Fault Detection ◽  
Fault Tolerant ◽  
Fault Detection And Isolation ◽  
Practical Application ◽  
Isolation Method ◽  
Efficiency Factors ◽  
Simulation Results ◽  
And Performance ◽  
Locating System ◽  
Fault Detectors

Fault tolerance is crucial to the operating safety and performance of train locating system. Based on the requirements of reliability and safety for train locating, the fault characteristics of location measuring sensors are analyzed. Based on the structure of the train locating system, the fault-tolerant design of the system is given with the location filtering module for case, in which six fault detectors are employed to determine the configuration of the module. Then a PCA based fault detection and isolation method is proposed with Hawkins T2 statistics and the corresponding control limit. By dynamically adjusting the efficiency factors, fault could be detected and isolated as prior defined isolating strategies, and then the fault tolerant performance will be guaranteed. Simulation results demonstrate the high fault tolerant ability of the proposed approach and certain practical application value.

scholarly journals Recovery Routing Based on Q-Learning for Satellite Network Faults

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Rentao Gu ◽  
Jiawen Qin ◽  
Tao Dong ◽  
Jie Yin ◽  
Zhihui Liu
Keyword(s):  
Fault Detection ◽  
A Priori ◽  
Network Routing ◽  
Simulation Software ◽  
Utilization Rate ◽  
Satellite Network ◽  
Bayesian Decision ◽  
Terrestrial Network ◽  
Main Component ◽  
Two Stages

With the fierce research on the space and terrestrial network, the satellite network as the main component has received increasing attention. Due to its special operating environment, there are temporary link failures caused by interference and permanent port failures caused by equipment problems. In this paper, we propose a new satellite network routing technology for fault recovery based on fault detection. Based on Bayesian decision, this technology judges the probability of each fault by a priori probability of the two faults to achieve the purpose of effectively distinguishing between two types of faults and locate faulty links and node ports. Then, corresponding to the previous two stages of the fault detection, different stages and different methods are updated for different types of fault. We also combine satellite network data from satellite simulation software to validate our study. The results show that the recovery strategy has good performance, and the effective resource utilization rate is improved significantly.

Rethinking the Synthetic a priori de re

1998 ◽  
pp. 15-22
Author(s):  
Paul Burger
Keyword(s):  
Ontological Commitment ◽  
Necessary Conditions ◽  
A Priori ◽  
A Posteriori ◽  
Analytical Philosophy ◽  
Radical Empiricism ◽  
De Re ◽  
Direct Awareness ◽  
Synthetic A Priori ◽  
Ontological Turn

Hume and Kant destroyed the belief in the apriori de re, i.e. the rationalist’s doctrine of direct awareness of necessary facts about the nature of being. Later on, analytical philosophy told us that there are only two general classes of statements, synthetics a posteriori and analytics a priori. Quine eventually rejected the a priori in general and advanced a radical empiricism. However, both moderate and radical empiricism has recently been challenged by realistic minded philosophers. They have argued that ontological topics such as the nature of properties, laws or causation remain strongly undetermined by semantic ascent and Quinean ontological commitment, and announced an ontological turn. Are not ontological or metaphysical explanations a priori explanations? Despite his preferred talk in terms of a posteriori realism and inference of the best explanation, Armstrong’s defence of universals looks very much like an apriori one. Others, such as Barry Smith, explicitly defend that there are synthetic propositions a priori de re. I believe in both: Kant was right in claiming that an understanding of what metaphysics can teach us is dependent upon a clear concept of the synthetic a priori, but—against Kant— synthetics a priori de re are legitimate. In this paper I will defend synthetics a priori de re. However, I will reject the rationalist’s appeal to direct awareness of necessary facts as well as undeniableness or infallibility as necessary conditions for a prioris. Instead I will claim that all synthetics a priori express hypothetical truths.

A LOWER BOUND FOR ORDER-PRESERVING BROADCAST IN THE POSTAL MODEL

1993 ◽  
Vol 03 (04) ◽  
pp. 313-320 ◽  
Author(s):  
PHILIP D. MACKENZIE
Keyword(s):  
Communication Network ◽  
Lower Bound ◽  
Lower Bounds ◽  
Message Passing ◽  
Upper Bounds ◽  
Communication Latency ◽  
Multiple Messages ◽  
Postal Model ◽  
Parameter Ranges

In the postal model of message passing systems, the actual communication network between processors is abstracted by a single communication latency factor, which measures the inverse ratio of the time it takes for a processor to send a message and the time that passes until the recipient receives the message. In this paper we examine the problem of broadcasting multiple messages in an order-preserving fashion in the postal model. We prove lower bounds for all parameter ranges and show that these lower bounds are within a factor of seven of the best upper bounds. In some cases, our lower bounds show significant asymptotic improvements over the previous best lower bounds.

A STATIC EXECUTION MODEL FOR DATA PARALLELISM

1994 ◽  
Vol 04 (04) ◽  
pp. 367-378 ◽  
Author(s):  
C. GERMAIN ◽  
F. DELAPLACE ◽  
R. CARLIER
Keyword(s):  
Message Passing ◽  
Data Transfer ◽  
Interconnection Network ◽  
A Priori ◽  
Parallel Architectures ◽  
Data Parallelism ◽  
Abstract Machine ◽  
Computing Power ◽  
Propagation Delays ◽  
Execution Model

The performance of parallel architectures are limited at least as much by data transfer ability as by computing power. The main limit concerns the transfers on the interconnection network. But it becomes apparent that a majority of these communications can be known at compile time. The static model intends to exploit this a priori knowledge in order to drastically reduce the overhead of message passing, the ultimate goal being to confine the oommunication delays to the hardware propagation delays. In the paper, we present an abstract machine which is the target of a static-oriented compilation. We show how to recognize and sequence the static communication patterns, and we discuss the application scope of the model.

Sign in / Sign up

Export Citation Format

Share Document