نتایج جستجو برای: multivalued map

تعداد نتایج: 197154  

2003
Martin Anthony

This paper concerns multivalued multithreshold functions, {0, 1, . . . , k}-valued functions on Rn that may be considered as generalizations of (linear) threshold functions, or as discretized versions of artificial neurons. Such functions have arisen in the context of multiple-valued logic and artificial neural networks. For any fixed k, we present two procedures which, given a set of points la...

2017
Bingda Zhang Yanjie Wu Zhao Jin Yang Wang

In order to expand the simulation scale of smart substation, a simulation model of the inlet-outlet line unit, as described by the 0/108 S conductance for multivalued coefficients pre-storage is presented in this paper. As a part of orders decomposition, the address conversion circuit for multivalued coefficients can reduce the computational burden of processing elements. For the convenience of...

2016
Prashant S. Wankhade Gajanan Sarate Marek Perkowski Jorge Pedraza Venkat Reddy

This paper presents minimization technique for multiple value function using Quine Mc-cluskey‟s method. This paper provide steps for the minimization of multivalued function i.e. radix >2 digital system. The ternary digital system which radix=3 is considered here minimized function of MVL function implemented using decoder and multiplexer and answer is verified using ternary k-map. As the radix...

Journal: :Chaos 2003
Ernest Barreto Kresimir Josić Carlos J Morales Evelyn Sander Paul So

Chaos synchronization in coupled systems is often characterized by a map phi between the states of the components. In noninvertible systems, or in systems without inherent symmetries, the synchronization set--by which we mean graph(phi)--can be extremely complicated. We identify, describe, and give examples of several different complications that can arise, and we link each to inherent properti...

2006
Ewa Girejko Zbigniew Bartosiewicz

Necessary and sufficient conditions for a set-valued map K : R ։ R to be GDQ-differentiable are given. It is shown that K is GDQ differentiable at t0 if and only if it has a local multiselection that is Cellina continuously approximable and Lipschitz at t0. It is also shown that any minimal GDQ of K at (t0, y0) is a subset of the contingent derivative of K at (t0, y0), evaluated at 1. Then this...

2007
Ewa Girejko Zbigniew Bartosiewicz

Necessary and sufficient conditions for a set-valued map K : R ։ R to be GDQ-differentiable are given. It is shown that K is GDQ differentiable at t0 if and only if it has a local multiselection that is Cellina continuously approximable and Lipschitz at t0. It is also shown that any minimal GDQ of K at (t0, y0) is a subset of the contingent derivative of K at (t0, y0), evaluated at 1. Then this...

2006
ABDELLATIF MOUDAFI

In this paper we deal with methods for finding zeroes of set-valued operators A in Banach spaces. The first aim of this note is to show that the Yosida regularization may be combined with the schemes in [1, 2] keeping the strong convergence properties of the iterates and extending to set-valued operators two recent results by Chidume [1] and Chidume and Zegeye [2]. The second goal of the note i...

2000
Pascal Hitzler Anthony Karel Seda

Many questions concerning the semantics of disjunctive databases and of logic pro gramming systems depend on the xed points of various multivalued mappings and operators determined by the database or program We discuss known versions for mul tivalued mappings of the Knaster Tarski theorem and of the Banach contraction map ping theorem and formulate a version of the classical xed point theorem s...

2005
DUSA MCDUFF

Cieliebak, Mundet i Riera and Salamon recently formulated a definition of branched submanifold of Euclidean space in connection with their discussion of multivalued sections and the Euler class. This note proposes an intrinsic definition of a weighted branched manifold Z that is obtained from the usual definition of oriented orbifold groupoid by relaxing the properness condition and adding a we...

Journal: :Fundam. Inform. 2009
Sven Hartmann Sebastian Link

Nesting is a useful technique in many areas of database practice. For instance, nesting is a fundamental operation for the nested relational data model, it can be applied to reduce the level of data redundancy in a database instance, to improve query processing or to convert data from one model to another. We further address the question when nesting operations commute with one another, i.e., w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید