Almost every real process exhibits nonlinear behavior in a full operating range. Local Model Networks are networks which are composed of locally accurate models, where output is interpolated by smooth locally active validity functions. This divide-and-conquer strategy is a general way of coping with complex systems. The architecture of LMN benefits from being able to incorporate a priori knowle...

We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.

Based on a complete Heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a Cartesian-closed category, calledthe category of $L-$ordered fuzzifying convergence spaces, in whichthe category of $L-$fuzzifying topological spaces can be embedded.In addition, two new categories are introduced, which are called the...

In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...

We introduce the tense LMn-algebras and the tense MV algebras as algebraic structures for some tense many-valued logics. A representation theorem for tense LMn-algebras is proved and the polynomially equivalence between tense LM3-algebras (resp. tense LM4-algebras) and tense MV3-algebras (resp. tense MV4-algebras) is established. We study the pairs of dually-conjugated operations on MV -algebra...

in this paper we derive convergence theorems for an -nonexpansive mappingof a nonempty closed and convex subset of a complete cat(0) space for sp-iterative process and thianwan's iterative process.

In this paper we explore the node complexity of recursive neural network implementations of frontier-to-root tree automata (FRA). Specifically, we show that an FRAO (Mealy version) with m states, l input-output labels, and maximum rank N can be implemented by a recursive neural network with O(radical(log l+log m)lm(N)/log l+N log m) units and four computational layers, i.e., without counting th...

Many neurons in the rat lateral mammillary nuclei (LMN) fire selectively in relation to the animal's head direction (HD) in the horizontal plane independent of the rat's location or behavior. One hypothesis of how this representation is generated and updated is via subcortical projections from the dorsal tegmental nucleus (DTN). Here we report the type of activity in DTN neurons. The majority o...