نتایج جستجو برای: t = ai β polli

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

2009
Makoto Katori Hideki Tanemura

One-dimensional system of Brownian motions called Dyson’s model is the particle system with long-range repulsive forces acting between any pair of particles, where the strength of force is β/2 times the inverse of particle distance. When β = 2, it is realized as the Brownian motions in one dimension conditioned never to collide with each other. For any initial configuration, it is proved that D...

2014
Jadranka Mićić Zlatko Pavić Josip Pečarić Nikolaos Papageorgiou

and Applied Analysis 3 If one of the following conditions ii ψ ◦ φ−1 is concave and ψ−1 is operator monotone, ii′ ψ ◦ φ−1 is convex and −ψ−1 is operator monotone, is satisfied, then the reverse inequality is valid in 1.7 . In this paper we study an extension of Jensen’s inequality given in Theorem A. As an application of this result, we give an extension of Theorem B for a version of the quasia...

Journal: :Problems and perspectives in management 2022

The study aims to explore the effect of network strategic capabilities (NSCs) with its dimension artificial intelligence (AI) and blockchain on digital transformation (DT) in Jordanian universities. paper used analytical-descriptive approach analyze interpret results. population includes universities, sample consists top management. Out 400, 304 questionnaires were completed returned. results s...

2015

1. INTERACTIVE BEHAVIOR TREES Interactive Behavior Trees (IBT’s) address challenges in traditional Behavior Tree representations by facilitating freeform user interaction and state persistence. IBT’s, as illustrated in Fig. 1(a) are divided into 3 independent sub-trees that are connected using a Parallel control node. An IBT tIBT = 〈tui, tstate, tnarr = {t i |t 1 . . . t m }, β〉 where: (1) tnar...

2009
Alfredas Račkauskas Charles Suquet

Let (ξn)n≥1 be the polygonal partial sums processes built on the linear processes Xn = ∑ i≥0 ai( n−i), n ≥ 1, where ( i)i∈Z are i.i.d., centered random elements in some separable Hilbert space H and the ai’s are bounded linear operators H → H, with ∑i≥0‖ai‖ < ∞. We investigate functional central limit theorem for ξn in the Hölder spaces H o ρ(H) of functions x : [0, 1] → H such that ‖x(t+ h) − ...

Journal: :Arquivos brasileiros de cardiologia 2011
Renan Oliveira Vaz-de-Melo Adriana Giubilei Pimenta Luiz Tadeu Giollo Débora Dada Martinelli Carolina Neves Cosenso Sacomani Juan Carlos Yugar-Toledo José Paulo Cipullo Marco Antônio Mota Gomes Heitor Moreno José Fernand Vilela-Martin

BACKGROUND Arterial stiffness is a variable predictor of morbidity and mortality and a possible marker of vascular injury. Its non-invasive assessment by radial tonometry and analysis of the augmentation index (r-AI) allows identifying patients exposed to higher cardiovascular risk. OBJECTIVE To analyze the influence of r-AI on clinical-biochemical variables and its influence on the prevalenc...

2013
Elizabeth M. Davis Oscar Saz-Torralba Maxine Eskénazi

Language learning is finally leaving the classroom for the real world. This usually takes the form of a dedicated implementation on a handheld device. In this paper we describe POLLI, an app that helps non-native students prepare scientific presentations.

Journal: :Electr. J. Comb. 2017
Ron Aharoni Eli Berger Daniel Kotlar Ran Ziv

Mysteriously, hypergraphs that are the intersection of two matroids behave in some respects almost as well as one matroid. In the present paper we study one such phenomenon the surprising ability of the intersection of two matroids to fairly represent the parts of a given partition of the ground set. For a simplicial complex C denote by β(C) the minimal number of edges from C needed to cover th...

Journal: :CoRR 2013
Fatemeh Rajabi-Alni

Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.

2002
Zoran Šuniḱ

We introduce a transformation on integer sequences for which the set of images is in bijective correspondence with the set of Young tableaux. We use this correspondence to show that the set of images, known as ballot sequences, is also the set of double points of our transformation. In the second part, we introduce other transformations of integer sequences and show that, starting from any sequ...

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

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