Computation on and among data sets mapped to irregular, non-uniform, aggregates of processing elements (PEs) is a very important, but largely ignored, problem in parallel vision processing. Associative processing 11] is an eeective means of applying parallel processing to these computations 33], but is often restricted to operating on one data set at a time. What we propose is an additional lev...

Normal aging is usually accompanied by greater memory decline for associations than for single items. Though associative memory is generally supported by recollection, it has been suggested that familiarity can also contribute to associative memory when stimuli can be unitized and encoded as a single entity. Given that familiarity remains intact during healthy aging, this may be one route to re...

The capacity of an associative memory is defined as the maximum number of vords that can be stored and retrieved reliably by an address vithin a given sphere of attraction. It is shown by sphere packing arguments that as the address length increases. the capacity of any associati ve memory is limited to an exponential grovth rate of 1-h 2 (0). vhere h2(0) is the binary entropy function in bits....

Learning ability and memory duration are two inseparable factors which can increase theefficiency of a living organism during its lifetime. Trichgramma brassice Bezdenko (Hym.:Trichogrammatidae) is a biological control agent widely used against different pest species.This research was conducted to study the olfactory associative learning ability and memoryduration of T. brassicae under laborato...

Neuron models of associative memory provide a new and prospective technology for reliable date storage and patterns recognition. However, even when the patterns are uncorrelated, the efficiency of most known models of associative memory is low. We developed a new version of associative memory with record characteristics of its storage capacity and noise immunity, which, in addition, is effectiv...

In this paper, we define the notions of ultra and involution ideals in $BCK$-algebras. Then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. Specially, we show that in a bounded implicative $BCK$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $BCK$-semilattice, the not...

K Maps are generally and ideally , thought to be simplest form for obtaining solution of Boolean equations.Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws and different traits of Karnaugh Maps. Largest possible kcubes that exist for a given function are equivalent to its prime implicants. A technique...