[3] **viXra:1208.0226 [pdf]**
*replaced on 2012-12-04 09:25:42*

**Authors:** He Wen, Laszlo B. Kish, Andreas Klappenecker

**Comments:** 10 Pages. In press at Fluctuation and Noise Letters

We introduce the complex noise-bit as information carrier, which requires noise signals in two parallel wires instead of the single-wire representations of noise-based logic discussed so far. The immediate advantage of this new scheme is that, when we use random telegraph waves as noise carrier, the superposition of the first 2^N integer numbers (obtained by the Achilles heel operation) yields non-zero values. We introduce basic instantaneous operations, with O(2^0) time and hardware complexity, including bit-value measurements in product states, single-bit and two-bit noise gates (universality exists) that can instantaneously operate over large superpositions with full parallelism. We envision the possibility of implementing instantaneously running quantum algorithms on classical computers while using similar number of classical bits as the number of quantum bits emulated without the necessity of error corrections. Mathematical analysis and proofs are given.

**Category:** Data Structures and Algorithms

[2] **viXra:1208.0204 [pdf]**
*submitted on 2012-08-20 21:28:38*

**Authors:** Izani Islam, Tahir Ahmad, Ali H. Murid

**Comments:** 18 Pages.

The proposed system is developed in two main phases and also a supplementary optimizing stage. At the first phase, the most important features are selected using fuzzy association rules mining (FARM) to reduce the dimension of input features to the misuse detector. At the second phase, a fuzzy adaptive resonance theory‐based neural network (ARTMAP) is used as a misuse detector. The accuracy of the proposed approach depends strongly on the precision of the parameters of FARM module and also fuzzy ARTMAP neural classifier. So, the genetic algorithm (GA) is incorporated into the proposed method to optimize the parameters of mentioned modules in this study. Classification rate (CR) results show the importance role of GA in improving the performance of the proposed intrusion detection system (IDS). The performance of proposed system is investigated in terms of detection rate (DR), false alarm rate (FAR) and cost per example (CPE).

**Category:** Data Structures and Algorithms

[1] **viXra:1208.0146 [pdf]**
*submitted on 2012-08-18 13:05:14*

**Authors:** D.Abhyankar, M.Ingle

**Comments:** 6 Pages.

Sorting is one of the most frequently needed computing tasks. Mergesort is one of the most elegant algorithms to solve
the sorting problem. We present a novel sorting algorithm of Mergesort family that is more efficient than other Mergesort
algorithms. Mathematical analysis of the proposed algorithm shows that it reduces the data move operations considerably.
Profiling was done to verify the impact of proposed algorithm on time spent. Profiling results show that proposed algorithm
shows considerable improvement over conventional Mergesort in the case of large records. Also, in the case of small records,
proposed algorithm is faster than the classical Mergesort. Moreover the proposed algorithm is found to be more adaptive than
Classical Mergesort.

**Category:** Data Structures and Algorithms