Search results for "Programming"
showing 10 items of 3090 documents
Binding energies and pairing gaps in semi-magic nuclei obtained using new regularized higher-order EDF generators
2016
We present results of the Hartree-Fock-Bogolyubov calculations performed using nuclear energy density functionals based on regularized functional generators at next-to-leading and next-to-next-to-leading order. We discuss properties of binding energies and pairing gaps determined in semi-magic spherical nuclei. The results are compared with benchmark calculations performed for the functional generator SLyMR0 and functional UNEDF0.
General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems
2016
Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
Marked systems and circular splicing
2007
Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. In this paper we introduce a special class of finite circular splicing systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we show that we can decide whether a regular circular language is generated by a marked system and we characterize the structure of these regular circular languages.
On linear extension operators from growths of compactifications of products
1996
Abstract We obtain some results on product spaces. Among them we prove that for noncompact spaces X 1 and X 2 , the norm of every linear extension operator from C ( β ( X 1 × X 2 ) β ( X 1 × X 2 )) into C ( β ( X 1 × X 2 )) is greater or equal than 2, and also that β ( X 1 × X 2 ) β ( X 1 × X 2 ) is not a neighborhood retract of β ( X 1 × X 2 ).
Fixed point theorems for non-self mappings in symmetric spaces under φ-weak contractive conditions and an application to functional equations in dyna…
2014
In this paper, we prove some common fixed point theorems for two pairs of non-self weakly compatible mappings enjoying common limit range property, besides satisfying a generalized phi-weak contractive condition in symmetric spaces. We furnish some illustrative examples to highlight the realized improvements in our results over the corresponding relevant results of the existing literature. We extend our main result to four finite families of mappings in symmetric spaces using the notion of pairwise commuting mappings. Finally, we utilize our results to discuss the existence and uniqueness of solutions of certain system of functional equations arising in dynamic programming.
Non-self-adjoint resolutions of the identity and associated operators
2013
Closed operators in Hilbert space defined by a non-self-adjoint resolution of the identity $$\{X(\lambda )\}_{\lambda \in {\mathbb R}}$$ , whose adjoints constitute also a resolution of the identity, are studied. In particular, it is shown that a closed operator $$B$$ has a spectral representation analogous to the familiar one for self-adjoint operators if and only if $$B=\textit{TAT}^{-1}$$ where $$A$$ is self-adjoint and $$T$$ is a bounded inverse.
Lipschitz operator ideals and the approximation property
2016
[EN] We establish the basics of the theory of Lipschitz operator ideals with the aim of recovering several classes of Lipschitz maps related to absolute summability that have been introduced in the literature in the last years. As an application we extend the notion and main results on the approximation property for Banach spaces to the case of metric spaces. (C) 2015 Elsevier Inc. All rights reserved.
Singular Perturbations and Operators in Rigged Hilbert Spaces
2015
A notion of regularity and singularity for a special class of operators acting in a rigged Hilbert space \({\mathcal{D} \subset \mathcal{H}\subset \mathcal{D}^\times}\) is proposed and it is shown that each operator decomposes into a sum of a regular and a singular part. This property is strictly related to the corresponding notion for sesquilinear forms. A particular attention is devoted to those operators that are neither regular nor singular, pointing out that a part of them can be seen as perturbation of a self-adjoint operator on \({\mathcal{H}}\). Some properties for such operators are derived and some examples are discussed.
Farkas-Minkowski systems in semi-infinite programming
1981
The Farkas-Minkowski systems are characterized through a convex cone associated to the system, and some sufficient conditions are given that guarantee the mentioned property. The role of such systems in semi-infinite programming is studied in the linear case by means of the duality, and, in the nonlinear case, in connection with optimality conditions. In the last case the property appears as a constraint qualification.