We demonstrate content-addressable holographic data storage with security using random phase encoding in the Fresnel domain. The phase-based data pages are encrypted using a random phase mask in the Fresnel domain, and recorded on a photorefractive LiNbO3: Fe crystal using angular multiplexing. While content-searching through this database, the correct random phase mask and its position are cri...

A Content Addressable Memory (CAM) is hardware search engine in a memory unit that can perform a single clock cycle search operation. Content Addressable Memory is mostly used with the static RAM with the comparison unit to compare data in a single clock cycle leads to more power consumption. This paper proposes a Content Addressable Memory using a NAND cell structure with the comparison unit a...

Exercise 1 Comparisons in Quicksort To begin with, note that when we talk about the ’number of comparisons’, we mean the number of times one element is compared to another element of the sequence to sort. We do not count internal comparisons of the algorithm (like when the algorithm compares the index of an element to another index). Let a, b be two distinct elements of rank i and j, respective...

We present an n-processor and O(lo~n)-time parallel RAM algorithm for finding a depth-first-search tree in an n·vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's original parallel depth-first-search algorithm for planar graphs [Smi86].

The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for functional test generation. In the paper presented analysis of random search methods and adjacent stimuli generation allowed formulating a practical method for generating functional tests. This method incorporates the analyzed ...

Error Minimized Extreme Learning Machine (EM-ELM) proposed by Feng et al. [1] can automatically determine the number of hidden nodes in generalized Single-hidden Layer Feedforward Networks (SLFNs). We recently found that some of the hidden nodes that are added into the network may play a very minor role in the network output, which increases the network complexity. Hence, this paper proposes an...

We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.

Computational experiments with a simple algorithm show that it is possible to fill any spatial region with a random fractalization of any shape, with a continuous range of pre-specified fractal dimensions D. The algorithm is presented here in 1, 2, or 3 physical dimensions. The size powerlaw exponent c or the fractal dimension D can be specified ab initio over a substantial range. The method cr...

Over the past decades, a multitude of new search heuristics, often called “metaheuristics” have been proposed, many of them inspired by principles observed in nature. What distinguishes them from random search is primarily that they maintain some sort of memory of the information gathered during the search so far, and that they use this information to select the location where the search space ...

We study a search model where workers can send multiple applications to high and low productivity firms. Firms that compete for the same candidate can increase their wage offers as often as they like. We show that there is a unique equilibrium where workers mix between sending both applications to the high and both to the low productivity sector. Efficiency requires however that they apply to b...