Test Set Generation for Multiple Faults in Boolean Systems using SAT Solver

2021 ◽  
Author(s):  
P Partha Koundinya ◽  
Sai Krishna Reddy Y ◽  
V Mani Deepak ◽  
K Rutwesh ◽  
Anuj Deshpande
Keyword(s):  
Test Set ◽  
Multiple Faults ◽  
Sat Solver

Fault Detection Probability Evaluation Approach in Combinational Circuits Using Test Set Generation Method

2018 ◽  
Author(s):  
Namita Arya ◽  
Amit Prakash Singh
Keyword(s):  
Fault Detection ◽  
Maximum Error ◽  
Mass Function ◽  
Cumulative Distribution ◽  
Probability Mass Function ◽  
Combinational Circuits ◽  
Occurrence Probability ◽  
Test Set ◽  
Probability Of Error ◽  
Multiple Faults

This paper introduces an approach that chooses the fault detection by calculating probabilities using probability mass function (pmf) and cumulative distribution function (CDF). This work used a method for multiple stuck-at faults by producing a new test pattern in combinational circuits. We assumed that existence of all multiple faults is only because of one single component that is faulty. A complete test set can be created by all possible single stuck-at faults in a combinational circuit using some combination of gates. The test set generation fault detection method is applied on two different 3-bit input variable and 4-bit input variable circuits. The probability of error occurrence is calculated at both 3-bit and 4-bit input variable circuits. The resulting feature is used to obtain maximum error occurrence probability to detect faults by the logic used that the complexity of the circuit is inversely proportional to the fault occurrence probability. Then again, undetectability is directly proportional to the complexity of the circuit. Therefore, finest feasible circuit should have large input variable components with less complexity to reduce the fault occurrence probability.

NOVEL TEST GENERATION ALGORITHM FOR COMBINATION CIRCUITS

2000 ◽  
Vol 10 (01n02) ◽  
pp. 27-65 ◽  
Author(s):  
K. RAAHEMIFAR ◽  
M. AHMADI
Keyword(s):  
Fault Simulation ◽  
Solution Space ◽  
Mapping Function ◽  
Entire Solution ◽  
Logic Circuit ◽  
Combinational Circuits ◽  
Test Set ◽  
Multiple Faults ◽  
Function Number ◽  
Test Vectors

It has been known for many years that combinational circuits have a Complete Test Set (CTS) which is capable of detecting all single and multiple faults. In this paper, we attempt to find CTS systematically. Our algorithm finds a test set which detects all single and multiple stuck-at faults in combinational circuits. This test set is obtained without probing internal nodes, using fault simulation or fault enumeration. It is shown that the test set is independent of logic circuit structure and dependent to the mapping function, number of inputs, outputs, and fanout stems. An upper-bound and lower-bound figures for the number of test vectors required to obtain 100% fault coverage are provided. This number is a small fraction of the entire solution space. A number of recommendations are made to improve the testability of a logic circuit.

Using Connectionist Modules for Decision Support

1990 ◽  
Vol 29 (03) ◽  
pp. 167-181 ◽  
Author(s):  
G. Hripcsak
Keyword(s):  
Decision Support ◽  
Standard Deviation ◽  
Confidence Interval ◽  
Posterior Probability ◽  
Back Propagation ◽  
Connectionist Model ◽  
Test Set ◽  
The Third ◽  
Independent Test ◽  
Better Than

AbstractA connectionist model for decision support was constructed out of several back-propagation modules. Manifestations serve as input to the model; they may be real-valued, and the confidence in their measurement may be specified. The model produces as its output the posterior probability of disease. The model was trained on 1,000 cases taken from a simulated underlying population with three conditionally independent manifestations. The first manifestation had a linear relationship between value and posterior probability of disease, the second had a stepped relationship, and the third was normally distributed. An independent test set of 30,000 cases showed that the model was better able to estimate the posterior probability of disease (the standard deviation of residuals was 0.046, with a 95% confidence interval of 0.046-0.047) than a model constructed using logistic regression (with a standard deviation of residuals of 0.062, with a 95% confidence interval of 0.062-0.063). The model fitted the normal and stepped manifestations better than the linear one. It accommodated intermediate levels of confidence well.

Multiple faults detection and isolation approach applied to a kraft recovery boiler

TAPPI Journal ◽  
2014 ◽  
Vol 13 (1) ◽  
pp. 33-41
Author(s):  
YVON THARRAULT ◽  
MOULOUD AMAZOUZ
Keyword(s):  
Fault Detection ◽  
Early Detection ◽  
False Alarm ◽  
False Alarm Rate ◽  
Principal Component ◽  
Fault Isolation ◽  
Fault Detection And Isolation ◽  
Detection Scheme ◽  
Multiple Faults ◽  
Recovery Boiler

Recovery boilers play a key role in chemical pulp mills. Early detection of defects, such as water leaks, in a recovery boiler is critical to the prevention of explosions, which can occur when water reaches the molten smelt bed of the boiler. Early detection is difficult to achieve because of the complexity and the multitude of recovery boiler operating parameters. Multiple faults can occur in multiple components of the boiler simultaneously, and an efficient and robust fault isolation method is needed. In this paper, we present a new fault detection and isolation scheme for multiple faults. The proposed approach is based on principal component analysis (PCA), a popular fault detection technique. For fault detection, the Mahalanobis distance with an exponentially weighted moving average filter to reduce the false alarm rate is used. This filter is used to adapt the sensitivity of the fault detection scheme versus false alarm rate. For fault isolation, the reconstruction-based contribution is used. To avoid a combinatorial excess of faulty scenarios related to multiple faults, an iterative approach is used. This new method was validated using real data from a pulp and paper mill in Canada. The results demonstrate that the proposed method can effectively detect sensor faults and water leakage.

RetroBioCat: Computer-Aided Synthesis Planning for Biocatalytic Reactions and Cascades

2020 ◽  
Author(s):  
William Finnigan ◽  
Lorna J. Hepworth ◽  
Nicholas J. Turner ◽  
Sabine Flitsch
Keyword(s):  
Organic Chemistry ◽  
Computer Aided Design ◽  
Selective Synthesis ◽  
Test Set ◽  
Synthesis Design ◽  
Computer Aided ◽  
Synthesis Planning ◽  
Enzymatic Cascades ◽  
Target Molecules ◽  
Aided Design

As the enzyme toolbox for biocatalysis has expanded, so has the potential for the construction of powerful enzymatic cascades for efficient and selective synthesis of target molecules. Additionally, recent advances in computer-aided synthesis planning (CASP) are revolutionizing synthesis design in both synthetic biology and organic chemistry. However, the potential for biocatalysis is not well captured by tools currently available in either field. Here we present RetroBioCat, an intuitive and accessible tool for computer-aided design of biocatalytic cascades, freely available at retrobiocat.com. Our approach uses a set of expertly encoded reaction rules encompassing the enzyme toolbox for biocatalysis, and a system for identifying literature precedent for enzymes with the correct substrate specificity where this is available. Applying these rules for automated biocatalytic retrosynthesis, we show our tool to be capable of identifying promising biocatalytic pathways to target molecules, validated using a test-set of recent cascades described in the literature.

PREDIKSI KUALITAS AIR SUNGAI CILIWUNG DENGAN MENGGUNAKAN ALGORITMA POHON KEPUTUSAN

2021 ◽  
Vol 12 (2) ◽  
Author(s):  
Mohammad Haekal ◽  
Henki Bayu Seta ◽  
Mayanda Mega Santoni
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Cross Validation ◽  
Online Monitoring ◽  
Training Set ◽  
Microsoft Excel ◽  
Test Set

Untuk memprediksi kualitas air sungai Ciliwung, telah dilakukan pengolahan data-data hasil pemantauan secara Online Monitoring dengan menggunakan Metode Data Mining. Pada metode ini, pertama-tama data-data hasil pemantauan dibuat dalam bentuk tabel Microsoft Excel, kemudian diolah menjadi bentuk Pohon Keputusan yang disebut Algoritma Pohon Keputusan (Decision Tree) mengunakan aplikasi WEKA. Metode Pohon Keputusan dipilih karena lebih sederhana, mudah dipahami dan mempunyai tingkat akurasi yang sangat tinggi. Jumlah data hasil pemantauan kualitas air sungai Ciliwung yang diolah sebanyak 5.476 data. Hasil klarifikasi dengan Pohon Keputusan, dari 5.476 data ini diperoleh jumlah data yang mengindikasikan sungai Ciliwung Tidak Tercemar sebanyak 1.059 data atau sebesar 19,3242%, dan yang mengindikasikan Tercemar sebanyak 4.417 data atau 80,6758%. Selanjutnya data-data hasil pemantauan ini dievaluasi menggunakan 4 Opsi Tes (Test Option) yaitu dengan Use Training Set, Supplied Test Set, Cross-Validation folds 10, dan Percentage Split 66%. Hasil evaluasi dengan 4 opsi tes yang digunakan ini, semuanya menunjukkan tingkat akurasi yang sangat tinggi, yaitu diatas 99%. Dari data-data hasil peneltian ini dapat diprediksi bahwa sungai Ciliwung terindikasi sebagai sungai tercemar bila mereferensi kepada Peraturan Pemerintah Republik Indonesia nomor 82 tahun 2001 dan diketahui pula bahwa penggunaan aplikasi WEKA dengan Algoritma Pohon Keputusan untuk mengolah data-data hasil pemantauan dengan mengambil tiga parameter (pH, DO dan Nitrat) adalah sangat akuran dan tepat. Kata Kunci : Kualitas air sungai, Data Mining, Algoritma Pohon Keputusan, Aplikasi WEKA.

QSAR Study of PARP Inhibitors by GA-MLR, GA-SVM and GA-ANN Approaches

2020 ◽  
Vol 16 (8) ◽  
pp. 1088-1105
Author(s):  
Nafiseh Vahedi ◽  
Majid Mohammadhosseini ◽  
Mehdi Nekoei
Keyword(s):  
Present Report ◽  
Principal Component ◽  
Parp Inhibitors ◽  
Support Vector ◽  
Ann Model ◽  
Statistical Parameters ◽  
Qsar Study ◽  
Data Set ◽  
Test Set ◽  
Non Linear

Background: The poly(ADP-ribose) polymerases (PARP) is a nuclear enzyme superfamily present in eukaryotes. Methods: In the present report, some efficient linear and non-linear methods including multiple linear regression (MLR), support vector machine (SVM) and artificial neural networks (ANN) were successfully used to develop and establish quantitative structure-activity relationship (QSAR) models capable of predicting pEC50 values of tetrahydropyridopyridazinone derivatives as effective PARP inhibitors. Principal component analysis (PCA) was used to a rational division of the whole data set and selection of the training and test sets. A genetic algorithm (GA) variable selection method was employed to select the optimal subset of descriptors that have the most significant contributions to the overall inhibitory activity from the large pool of calculated descriptors. Results: The accuracy and predictability of the proposed models were further confirmed using crossvalidation, validation through an external test set and Y-randomization (chance correlations) approaches. Moreover, an exhaustive statistical comparison was performed on the outputs of the proposed models. The results revealed that non-linear modeling approaches, including SVM and ANN could provide much more prediction capabilities. Conclusion: Among the constructed models and in terms of root mean square error of predictions (RMSEP), cross-validation coefficients (Q2 LOO and Q2 LGO), as well as R2 and F-statistical value for the training set, the predictive power of the GA-SVM approach was better. However, compared with MLR and SVM, the statistical parameters for the test set were more proper using the GA-ANN model.

Key phrase Extraction by Improving TextRank with an Integration of Word Embedding and Syntactic Information

2020 ◽  
Vol 13 ◽  
Author(s):  
Sheng Zhang ◽  
Qi Luo ◽  
Yukun Feng ◽  
Ke Ding ◽  
Daniela Gifu ◽  
...  
Keyword(s):  
Semantic Information ◽  
Performance Enhancement ◽  
Word Embedding ◽  
The Other ◽  
Test Set ◽  
Pagerank Algorithm ◽  
Phrase Extraction ◽  
Extraction Algorithm ◽  
Syntactic Information ◽  
Key Phrase Extraction

Background: As a known key phrase extraction algorithm, TextRank is an analogue of PageRank algorithm, which relied heavily on the statistics of term frequency in the manner of co-occurrence analysis. Objective: The frequency-based characteristic made it a neck-bottle for performance enhancement, and various improved TextRank algorithms were proposed in the recent years. Most of improvements incorporated semantic information into key phrase extraction algorithm and achieved improvement. Method: In this research, taking both syntactic and semantic information into consideration, we integrated syntactic tree algorithm and word embedding and put forward an algorithm of Word Embedding and Syntactic Information Algorithm (WESIA), which improved the accuracy of the TextRank algorithm. Results: By applying our method on a self-made test set and a public test set, the result implied that the proposed unsupervised key phrase extraction algorithm outperformed the other algorithms to some extent.

Sign in / Sign up

Export Citation Format

Share Document