Results 261 to 270 of about 951 (297)

A resolvent operator technique for approximate solving of generalized system mixed variational inequality and fixed point problems [PDF]

Applied Mathematics Letters, 2010
The main aim of this work is to use the resolvent operator technique to find the common solutions for a generalized system of relaxed cocoercive mixed variational inequality problems and fixed point problems for Lipschitz mappings in Hilbert spaces.
Narin Petrot
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Generalized Resolvents of Symmetric Operators

Mathematical Notes, 2003
The Krein formula for generalized resolvents is one of the highlights of the theory of extensions of symmetric operators in Hilbert spaces. In the present paper, the authors give another more general version of such a formula for generalized \(U\)-resolvents of the isometric operator \(V\). Each boundary triple \(\Pi\) of \(\{V,V^{-1}\}\) generates the
Malamud, M. M., Mogilevskii, V. I.
openaire   +1 more source

A Construction for Resolvable Designs and Its Generalizations

Graphs and Combinatorics, 1998
The authors generalize a technique to construct resolvable designs as given by \textit{D. K. Ray-Chaudhuri} and \textit{R. M. Wilson} [Survey Combin. Theory, Sympos. Colorado State Univ., Colorado 1971, 361-375 (1973; Zbl 0274.05010)] using free difference families in finite fields. The generalized techniques require free difference families over rings
Sanpei Kageyama, Ying Miao 0001
openaire   +1 more source

Separation of random number generation and resolvability

IEEE Transactions on Information Theory, 2000
Summary: We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel, we give a stronger converse result than we can give for a general ...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú   +2 more
openaire   +2 more sources

Variable-length resolvability for general sources

2017 IEEE International Symposium on Information Theory (ISIT), 2017
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding variable-length uniform random numbers, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated.
Hideki Yagi, Te Sun Han
openaire   +1 more source

Time and space resolved methods: general discussion

Faraday Discussions, 2015
Jim De Yoreo presented some slides on in situ AFM, TEM, dynamic force spectroscopy (DFS) and optical spectroscopy investigations of nucleation in the calcium carbonate system: The free energy barrier to homogeneous nucleation of calcite calculated within the framework of classical nucleation theory (CNT) is prohibitive, even at concentrations exceeding
Sun, Wenhao, Booth, Samuel, Myerson, Allan, Hughes, Colan, Pan, Haihua, Coquerel, Gerard, Brandel, Clement, Meekes, Hugo, Mazzotti, Marco, Fabian, Laszlo, Black, Simon, Vekilov, Peter, Back, Kevin, Toroz, Dimitrios, Lovelock, Jessica, Sefcik, Jan, Rasmuson, Ake, Breynaert, Eric, Sear, Richard, Hammond, Robert, Ward, Martin, Threlfall, Terence, De Yoreo, Jim, Davey, Roger, Ristic, Radoljub, Lewtas, Ken, Roberts, Kevin, Hare, Alan, Gich, Martí, Cölfen, Helmut, Likhatskiy, Maxim, Ter Horst, Joop, Sommerdijk, Nico   +32 more
openaire   +10 more sources

Invariant Imbedding as a Generalization of the Resolvent Equation

Journal of Mathematical Physics, 1967
Invariant imbedding equations for the Green's function of a general linear operator are shown to derive from a generalization of the resolvent equation of the theory of operators. Two applications are given: the neutron, or photon, transport in an arbitrary finite body, and the quantum-mechanical theory of collision.
openaire   +2 more sources

Resolving Structural Ambiguity in Generated Speech

2004
Ambiguity in the output is a concern for NLG in general. This paper considers the case of structural ambiguity in spoken language generation. We present an algorithm which inserts pauses in spoken text in order to attempt to resolve potential structural ambiguities.
openaire   +1 more source

General paediatricians and the case of resolving peanut allergy

Pediatric Allergy and Immunology, 2004
Children with peanut allergy are almost always advised to avoid nuts for life. There have been recent reports from academic centres that in some cases the allergy might resolve and thus these dietary restrictions can be lifted. To evaluate resolution of peanut allergy in a selected group of children in a general paediatric setting. Children 4–16 yr old
Satyapal, Rangaraj, Veena, Ramanathan, David P, Tuthill, Elizabeth, Spear, Jonathan O'b, Hourihane, Mazin, Alfaham   +5 more
openaire   +2 more sources

Resolvent Differences for General Obstacles

2006
In case of potential perturbations the second resolvent equation transforms the resolvent difference into a product of operators. For obstacle perturbations this behavior is maintained due to Dynkin’s formula. In the present article we study generalized obstacle perturbations, e.g., perturbations by measures with infinite weight.
J. Brasche, M. Demuth
openaire   +1 more source