Data Structures and Algorithms

1303 Submissions

[6] viXra:1303.0094 [pdf] replaced on 2013-06-15 11:16:34

Information Theoretically Secure, Enhanced Johnson Noise Based Key Distribution Over the Smart Grid with Switched Filters

Authors: Elias Gonzalez, Laszlo B. Kish, Robert S. Balog, Prasad Enjeti
Comments: 24 Pages. updated, polished

We introduce a protocol with a reconfigurable filter system to create non-overlapping single loops in the smart power grid for the realization of the Kirchhoff-Law-Johnson-(like)-Noise secure key distribution system. The protocol is valid for one-dimensional radial networks (chain-like power line) which are typical of the electricity distribution network between the utility and the customer. The speed of the protocol (the number of steps needed) versus grid size is analyzed. When properly generalized, such a system has the potential to achieve unconditionally secure key distribution over the smart power grid of arbitrary geometrical dimensions.
Category: Data Structures and Algorithms

[5] viXra:1303.0067 [pdf] submitted on 2013-03-09 10:56:31

Correlation Coefficients of Neutrosophic Sets by Centroid Method

Authors: I. M. Hanafy, A. A. Salama, K. M. Mahfouz
Comments: 4 Pages.

In this paper, we propose another method to calculate the correlation coefficient of neutrosophic sets. The value which obtained from this method tells us the strength of relationship between the neutrosophic sets and the whether the neutrosophic sets are positively or negatively related. Finally we give some proposition and examples.
Category: Data Structures and Algorithms

[4] viXra:1303.0065 [pdf] submitted on 2013-03-09 11:18:30

Neutrosophic Filters

Authors: A. A. Salama, H. Alagamy
Comments: 6 Pages.

In this paper we introduce the notion of filters on neutrosophic set which is considered as a generalization of fuzzy filters studies in [6], the important neutrosophic filters has been given. Several relations between different neutrosophic filters and neutrosophic topologies are also studied here. Possible applications to computer sciences are touched upon.
Category: Data Structures and Algorithms

[3] viXra:1303.0045 [pdf] submitted on 2013-03-07 08:50:04

On the P-Untestability of Combinational Faults

Authors: Suresh k Devanathan, Michael L Bushnell
Comments: 4 Pages.

Abstract—We describe the p-untestability of faults in combinational circuits. They are similar to redundant faults, but are defined probabilistically. P-untestable fault is a fault that is not detectable after N random pattern simulation or a fault, FAN either proves to be redundant or aborts after K backtracks. We chose N to be about 1000000 and K to be about 1000. We provide a p-untestability detectability algorithm that works in about 85% of the cases, with average of about 14% false negatives. The algorithm is a simple hack to FAN and uses structural information and can be easily implemented. The algorithm does not prove redundancy completely but establishes a fault as a probabilistically redundant, meaning a fault with low probability of detection or no detection.
Category: Data Structures and Algorithms

[2] viXra:1303.0043 [pdf] submitted on 2013-03-07 07:08:19

Pror Compaction Scheme for Larger Circuits and Longer Vectors with Deterministic Atpg

Authors: Suresh k Devanathan, Michael L Bushnell
Comments: 5 Pages.

Abstract—Reverse order restoration ROR techniques have found great use in sequential automatic test pattern generation ATPG, esp. spectral and perturbation-based ATPG. This paper deals with improving ROR for that purpose. We introduce parallel-fault multipass 2-level polynomial reverse order restoration PROR algorithms with constant complexity of the form H(n)G(n) + c where H(n) is the number of vectors to be released this iteration and G(n) is the attenuation factor. In PROR H(n) = nk and G(n) here is 1
Category: Data Structures and Algorithms

[1] viXra:1303.0037 [pdf] submitted on 2013-03-06 16:32:05

Fquantum :A Quantum Computing Fault Simulator

Authors: Suresh kumar Devanathan, Michael L Bushnell
Comments: 2 Pages.

Abstract—We like to introduce fQuantum, a Quantum Computing Fault Simulator and new quantum computing fault model based on Hadamard, PauliX, PauliY and PauliZ gates, and the traditional stuckat-1 SA1 and stuck-at-0 SA0 faults. We had close to 100% fault coverage on most circuits. The problem with lower coverage comes from function gates, which we will deal with, in future versions of this paper.
Category: Data Structures and Algorithms