scholarly journals On diagnostic tests of contact break for contact circuits

2020 ◽  
Vol 30 (2) ◽  
pp. 103-116 ◽  
Author(s):  
Kirill A. Popkov
Keyword(s):  
Boolean Function ◽  
Diagnostic Test ◽  
Boolean Functions ◽  
Diagnostic Tests ◽  
Almost All

AbstractWe prove that, for n ⩾ 2, any n-place Boolean function may be implemented by a two-pole contact circuit which is irredundant and allows a diagnostic test with length not exceeding n + k(n − 2) under at most k contact breaks. It is shown that with k = k(n) ⩽ 2n−4, for almost all n-place Boolean functions, the least possible length of such a test is at most 2k + 2.

scholarly journals Exact quantum algorithms have advantage for almost all Boolean functions

2015 ◽  
pp. 435-452
Author(s):  
Andris Ambainis ◽  
Jozef Gruska ◽  
Shenggen Zheng
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Query Complexity ◽  
Exact Quantum ◽  
Quantum Query Complexity ◽  
Almost All ◽  
Quantum Query

It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that ANDn is the only n-bit Boolean function, up to isomorphism, that requires n queries.

On 1-stable perfectly balanced Boolean functions

2017 ◽  
Vol 27 (2) ◽  
Author(s):  
Stanislav V. Smyshlyaev
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
The Other ◽  
Correlation Immunity ◽  
Other Hand

AbstractThe paper is concerned with relations between the correlation-immunity (stability) and the perfectly balancedness of Boolean functions. It is shown that an arbitrary perfectly balanced Boolean function fails to satisfy a certain property that is weaker than the 1-stability. This result refutes some assertions by Markus Dichtl. On the other hand, we present new results on barriers of perfectly balanced Boolean functions which show that any perfectly balanced function such that the sum of the lengths of barriers is smaller than the length of variables, is 1-stable.

Clique Here: On the Distributed Complexity in Fully-Connected Networks

2016 ◽  
Vol 26 (01) ◽  
pp. 1650004 ◽  
Author(s):  
Benny Applebaum ◽  
Dariusz R. Kowalski ◽  
Boaz Patt-Shamir ◽  
Adi Rosén
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Message Passing ◽  
Constant Number ◽  
Running Time ◽  
Message Size ◽  
Explicit Function ◽  
Randomized Protocols ◽  
Fully Connected ◽  
Fully Connected Networks

We consider a message passing model with n nodes, each connected to all other nodes by a link that can deliver a message of B bits in a time unit (typically, B = O(log n)). We assume that each node has an input of size L bits (typically, L = O(n log n)) and the nodes cooperate in order to compute some function (i.e., perform a distributed task). We are interested in the number of rounds required to compute the function. We give two results regarding this model. First, we show that most boolean functions require ‸ L/B ‹ − 1 rounds to compute deterministically, and that even if we consider randomized protocols that are allowed to err, the expected running time remains [Formula: see text] for most boolean function. Second, trying to find explicit functions that require superconstant time, we consider the pointer chasing problem. In this problem, each node i is given an array Ai of length n whose entries are in [n], and the task is to find, for any [Formula: see text], the value of [Formula: see text]. We give a deterministic O(log n/ log log n) round protocol for this function using message size B = O(log n), a slight but non-trivial improvement over the O(log n) bound provided by standard “pointer doubling.” The question of an explicit function (or functionality) that requires super constant number of rounds in this setting remains, however, open.

scholarly journals Comparison of three rapid influenza diagnostic tests with digital readout systems and one conventional rapid influenza diagnostic test

2017 ◽  
Vol 32 (2) ◽  
pp. e22234 ◽  
Author(s):  
Sook Won Ryu ◽  
In Bum Suh ◽  
Se-Min Ryu ◽  
Kyu Sung Shin ◽  
Hyon-Suk Kim ◽  
...  
Keyword(s):  
Diagnostic Test ◽  
Diagnostic Tests ◽  
Digital Readout

scholarly journals Clinical overlap between malaria and pneumonia: can malaria rapid diagnostic test play a role?

2011 ◽  
Vol 5 (03) ◽  
pp. 199-203 ◽  
Author(s):  
Kingsley Nnanna Ukwaja ◽  
Olufemi B Aina ◽  
Ademola A Talabi
Keyword(s):  
Diagnostic Test ◽  
Rapid Diagnostic Test ◽  
Diagnostic Tests ◽  
Health Centre ◽  
Rapid Diagnostic Tests ◽  
Case Definition ◽  
Sub Saharan Africa ◽  
Malaria Rapid Diagnostic Test ◽  
Chi Square ◽  
Symptom Overlap

Introduction: Malaria and pneumonia account for 40% of mortality among children under five years of age in sub-Saharan Africa. Due to lack of diagnostic facilities, their management is based on the integrated management of childhood illnesses (IMCI) strategy. Symptoms of malaria and pneumonia overlap in African children, necessitating dual IMCI classifications at health centres and treatment with both antibiotics and antimalarials. This study determined the prevalence of malaria-pneumonia symptom overlap and confirmed the diagnosis of malaria in these cases using a rapid diagnostic test. Methodology: Consecutive consultations of 1,216 children (two months to five years old) were documented over a three-month period in a comprehensive health centre. Malaria rapid diagnostic tests were conducted only for children who had symptom overlap. Results: Of the 1,216 children enrolled, 1,090 (90%) reported cough or fever. Among the children fulfilling the malaria case definition, 284 (30%) also met the pneumonia case definition. Twenty-three percent (284) of all children enrolled met the criteria for both malaria and pneumonia. However, only 130 (46%) of them had a positive result for malaria using a malaria rapid diagnostic test. During a malaria-pneumonia overlap, female children (chi-square 5.9, P = 0.01) and children ≥ one year (chi-square 4.8, P = 0.003) were more likely to seek care within two days of fever. Conclusion: Dual treatment with antimalarials and antibiotics in children with malaria-pneumonia overlap may result in unnecessary over-prescription of antimalarial medications. Use of rapid diagnostic tests in their management can potentially avoid over-prescribing of malaria medications.

scholarly journals ANALISIS MISKONSEPSI SISWA MENGGUNAKAN THREE TIER DIAGNOSTIC TEST BERBASIS OPEN ENDED QUESTION

2021 ◽  
Vol 9 (3) ◽  
pp. 276-291
Author(s):  
Mawaddah Mawaddah ◽  
Yandi Heryandi
Keyword(s):  
Data Collection ◽  
Diagnostic Test ◽  
Diagnostic Tests ◽  
Research Method ◽  
False Negative ◽  
Large Percentage ◽  
Sampling Techniques ◽  
Research Subjects ◽  
False Negatives ◽  
Clinical Interviews

This study aims to: (1) find out the misconceptions experienced by students in the material of similarity and congruence by using three-tier diagnostic tests based on open-ended questions. (2) find out the large percentage of students' misconceptions on the similarity and congruence material using a three-tier diagnostic test based on open-ended questions. The research method used was descriptive qualitative. The data collection instruments used were clinical interviews and three-tier diagnostic tests based on open-ended questions. This study was conducted in the SMP Negeri 2 Palimanan. The research subjects were selected using purposive sampling techniques so that 33 students were selected from 330 students. The results of the analysis of the three-tier diagnostic test based on open-ended questions showed that (1) the misconceptions that occurred in the material of similarity and congruence of 2D shapes included pure misconceptions, false positives, and false negatives. (2) the percentage of misconceptions experienced in the material of similarity and congruence 2D shapes as a whole was 50.2% with a large percentage of pure misconceptions 32.4%, false-positive 15.6%, and false-negative 2.2%

scholarly journals On the confusion coefficient of Boolean functions

2021 ◽  
Vol 16 (1) ◽  
pp. 1-13
Author(s):  
Yu Zhou ◽  
Jianyong Hu ◽  
Xudong Miao ◽  
Yu Han ◽  
Fuzhong Zhang
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Power Analysis ◽  
Signal To Noise Ratio ◽  
Sum Of Squares ◽  
Hamming Weight ◽  
Signal To Noise ◽  
Trade Offs ◽  
Cryptographic Algorithms ◽  
Transparency Order

Abstract The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the autocorrelation function for any Boolean function and give a tight upper bound and a tight lower bound on the confusion coefficient for any (balanced) Boolean function. We also deduce some deep relationships between the sum-of-squares of the confusion coefficient and other cryptographic indicators (the sum-of-squares indicator, hamming weight, algebraic immunity and correlation immunity), respectively. Moreover, we obtain some trade-offs among the sum-of-squares of the confusion coefficient, the signal-to-noise ratio and the redefined transparency order for a Boolean function.

scholarly journals Crypto-Archaeology: unearthing design methodology of DES s-boxes

2017 ◽  
Author(s):  
Sankhanil Dey ◽  
Ranjan Ghosh
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Design Methodology ◽  
Block Cipher ◽  
Block Ciphers ◽  
Public Domain ◽  
Differential Cryptanalysis ◽  
Linear Cryptanalysis ◽  
Strict Avalanche Criterion ◽  
Independence Criterion

US defence sponsored the DES program in 1974 and released it in 1977. It remained as a well-known and well accepted block cipher until 1998. Thirty-two 4-bit DES S-Boxes are grouped in eight each with four and are put in public domain without any mention of their design methodology. S-Boxes, 4-bit, 8-bit or 32-bit, find a permanent seat in all future block ciphers. In this paper, while looking into the design methodology of DES S-Boxes, we find that S-Boxes have 128 balanced and non-linear Boolean Functions, of which 102 used once, while 13 used twice and 92 of 102 satisfy the Boolean Function-level Strict Avalanche Criterion. All the S-Boxes satisfy the Bit Independence Criterion. Their Differential Cryptanalysis exhibits better results than the Linear Cryptanalysis. However, no S-Boxes satisfy the S-Box-level SAC analyses. It seems that the designer emphasized satisfaction of Boolean-Function-level SAC and S-Box-level BIC and DC, not the S-Box-level LC and SAC.

scholarly journals On self-correcting logic circuits of unreliable gates

2021 ◽  
pp. 1-18
Author(s):  
Kirill Andreevich Popkov
Keyword(s):  
Positive Integer ◽  
Boolean Function ◽  
Boolean Functions ◽  
Arbitrary Number ◽  
Logic Circuits ◽  
Logic Circuit ◽  
Complete Basis

The following statements are proved: 1) for any integer m ≥ 3 there is a basis consisting of Boolean functions of no more than m variables, in which any Boolean function can be implemented by a logic circuit of unreliable gates that self-corrects relative to certain faults in an arbitrary number of gates; 2) for any positive integer k there are bases consisting of Boolean functions of no more than two variables, in each of which any Boolean function can be implemented by a logic circuit of unreliable gates that self-correct relative to certain faults in no more than k gates; 3) there is a functionally complete basis consisting of Boolean functions of no more than two variables, in which almost no Boolean function can be implemented by a logic circuit of unreliable gates that self-correct relative to at least some faults in no more than one gate.

Sign in / Sign up

Export Citation Format

Share Document