A note on the Dunford-Pettis property for quotients of C(K) spaces, K dispersed.
We solve several problems in the theory of polynomials in Banach spaces. (i) There exist Banach spaces without the Dunford-Pettis property and without upper p-estimates in which all multilinear forms are weakly sequentially continuous: some Lorentz sequence spaces, their natural preduals and, most notably, the dual of Schreier's space. (ii) There exist Banach spaces X without the Dunford-Pettis property such that all multilinear forms on X and X* are weakly sequentially continuous; this gives an...
This paper studies the relationship between the bidual of the (projective) tensor product of Banach spaces and the tensor product of their biduals.
A computational model for a fuzzy coprocessor (types and structures of data and the set of instructions) is proposed. The coprocessor will be charged only of the typical operations of fuzzy logic as calculating membership degrees, unions and intersections of fuzzy sets, fuzzy inferences, defuzzifications and so on. One main novelty is that the programming language admits fuzzy rules conditions in which there would be linguistic edges preceding the predicates and the coprocessor is designed to deal...
The ORBEX coprocessor has been designed to execute the typical fuzzy operations of a system based on fuzzy rules. The first real application has been fuzzy controllers for electric cars. The values of the input variables, the position and the orientation of the car with respect the desired trajectory of reference, are obtained from the data provided by a DGPS boarded in the vehicle. The values of the output variables provided by the controller are the angle that the steering wheel has to be turned...
Let D be a digraph with set of vertices V and set of arcs A. We say that D is k-transitive if for every pair of vertices u, v ∈ V, the existence of a uv-path of length k in D implies that (u, v) ∈ A. A 2-transitive digraph is a transitive digraph in the usual sense. A subset N of V is k-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V N there exists v ∈ N such that d(u, v) ≤ l. A k-kernel of D is a k-independent and (k − 1)-absorbent...
Page 1