Associative recall and completion of information is one of the astonishing abilities of intelligent living beings. The search for mechanisms which produce this ability of associative memory yielded a class of computational systems composed of many neuron-like, non-linear units. The neural units are connected to artiicial neural networks. The basic principle of associative information recall is ...

the aim of this paper is to prove a common fixed point theorem for nonexpansive type single valued mappings which include both continuous and discontinuous mappings by relaxing the condition of continuity by weak reciprocally continuous mapping. our result is generalize and extends the corresponding result of jhade et al. [p.k. jhade, a.s. saluja and r. kushwah, coincidence and fixed points of ...

n this paper, we prove some common fixed point theorems for multivalued mappings and we present some new generalization contractive conditions under the condition of weak compatibility. our results extends chang-chen’s results  as well as ´ciri´c results. an example is given to support the usability of our results.

This paper provides a systematic solvability analysis for (generalized) variational inequalities on separable Hilbert lattices. By contrast to a large part of the existing literature, our approach is lattice-theoretic, and is not based on topological …xed point theory. This allows us to establish the solvability of certain types of (generalized) variational inequalities without requiring the in...

The complex-logarithmic number system (CLNS), which represents each complex point in log/polar coordinates, may be practical to implement the Fast Fourier Transform (FFT). The roots of unity needed by the FFT have exact representations in CLNS and do not require a ROM. We present an error analysis and simulation results for a radix-two FFT that compares a rectangular xed-point representation of...

Synopsis. We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of a coherent algebraic dcpo. The robustness of this approach comes from the agreement bewteen the declarative semantics and the xed-point semantics, as well as the agreement between the xed-point semantics and the semantics...

We investigate circuit complexity under the additional assumption of full combinatorial symmetry with respect to permutations of the input representation. With this approach we derive a very natural and simple characterization of rst-order logic and its innnitary variant with bounded numbers of variables over nite structures. Extending these results to not necessarily acyclic boolean networks, ...

In this paper we summarize a dual-time scale formulation of dynamic user equilibrium with demand growth due to Friesz et al (2008). This formulation belongs to the problem class that Pang and Stewart (2008) refer to as di¤erential variational inequalities. We also present a …xed point algorithm for computing solutions to the dual time-scale model without calculating derivatives, along with a nu...

in this paper, we give some results on the common fixed point of self-mappings defined on complete $b$-metric spaces. our results generalize kannan and chatterjea fixed point theorems on complete $b$-metric spaces. in particular, we show that two self-mappings satisfying a contraction type inequality have a unique common fixed point. we also give some examples to illustrate the given results.

A dynamic antigen response of the immune network is discussed, based on shape-space modelling. The present model extends the shape-space modelling by introducing the evolution of speci"city of idiotypes. When the amount of external antigen increases, a measure of stability of the immune network is lost and thus the network can respond to the antigen. It is shown that speci"c and non-speci"c res...