نتایج جستجو برای: b δ

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

2009
Feng Dai Heping Wang

Let Π n denote the space of all spherical polynomials of degree at most n on the unit sphere S of Rd+1, and let d(x, y) denote the geodesic distance arccosx ·y between x, y ∈ S . Given a spherical cap B(e,α)= x ∈ S : d(x, e)≤ α e ∈ S , α ∈ (0,π) is bounded away from π, we define the metric ρ(x, y) := 1 α √( d(x, y) )2 + αα − d(x, e)−α− d(y, e)2, where x, y ∈ B(e,α). It is shown that given any β...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تبریز - دانشکده ریاضی 1393

فرض کنید δ یک مجتمع سادکی با بعد 1-d و بردار آن باشد. ثابت میکنیم که اگر δ در شرط سر (sr) صدق کند، آنگاه به ازای هر i و r با شرط مجموع نامنفی است. بعلاوه نشان می دهیم که اگر حلقه استنلی-رایزنر مجتمع سادکی مجموعه های مستقل یک گراف دو بخشی g در شرط سر (s2) صدق کند آنگاه g کوهن-مکالی است. این نشان می دهد که هم ارزی خاصیت کوهن- مکالی و شرط s2 برای گراف های چوردال درست است.

2001
Shuenn-Jyi SHEU

– For the system of d-dim stochastic differential equations, dXε(t)= b(X(t))dt + εσ(X(t))dW(t), t ∈ [0,1], Xε(0)= x0 ∈Rd, where b(x) and σ(x) are smooth except possibly along the hyperplane {(x1, . . . , xd);x1 = 0}, we shall demonstrate that the natural setup of its large deviation principle is to consider the probability ε2 logP(‖Xε − φ‖< δ, ‖uε − ψ‖ < δ, ‖ ε − η‖< δ)∼−I (φ,ψ,η) of the triple...

2008
Jean-Christophe Dubacq Jean-Yves Moyen

The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This problem is shown to be NP-complete in the general case, and some specific restrictions are studied. 1. Presentation of the problem 1.1. Informal description and examples In several fields, it can be helpful to give a compa...

2010
Elisabeth M. Werner Deping Ye

Let K be a convex body in R and δ > 0. The homothety conjecture asks: Does Kδ = cK imply that K is an ellipsoid? Here Kδ is the (convex) floating body and c is a constant depending on δ only. In this paper we prove that the homothety conjecture holds true in the class of the convex bodies B p , 1 ≤ p ≤ ∞, the unit balls of l p ; namely, we show that (B p )δ = cB p if and only if p = 2. We also ...

2016
Joyce K. Hu Jordan C. Crampton Michela Locci Shane Crotty

SAP (SH2D1A) is required intrinsically in CD4 T cells to generate germinal center responses and long-term humoral immunity. SAP binds to SLAM family receptors, including SLAM, CD84, and Ly108 to enhance cytokine secretion and sustained T cell:B cell adhesion, which both improve T follicular helper (Tfh) cell aid to germinal center (GC) B cells. To understand the overlapping roles of multiple SL...

2009
Michael Gronau Jonathan L. Rosner

The mixing between nonstrange and strange quark wavefunctions in the ω and φ mesons leads to a small predicted branching ratio B(D+ s → ωeνe) = O(10−4)(δ/3.34◦)2, where δ is the mixing angle. The value δ = −3.34◦ is obtained in a mass-independent analysis, while a mass-dependent analysis gives δ = −0.45◦ at m(ω) and −4.64◦ at m(φ). Measurement of this branching ratio thus can tell whether the d...

Journal: :Discrete Mathematics 2004
Xavier Marcote Camino Balbuena Ignacio M. Pelayo

A connected digraph of minimum degree δ is said to be maximally connected if the cardinality of every cutset is al least δ, and it is called superconnected if moreover every minimum disconnecting set F consists of the vertices adjacent to or from a given vertex not belonging to F . Let π be an integer, 0 ≤ π ≤ δ − 2, δ being the minimum degree of the digraph. In this work, we prove that if D ≤ ...

Journal: :Journal of Marine Science and Engineering 2021

An effective approach for reducing CO2 emissions from marine exhaust is adopting oxyfuel combustion technology. A series of B-site doped BaCo0.8B0.2O3−δ (B=Ce, Al, Fe, Cu) perovskites as novel oxygen carrier applications were prepared by the sol-gel method. The desorption characteristics and effects adsorption/desorption temperature, volume flow rate, partial pressures, adsorption time research...

2006
Jeff M. Phillips Pankaj K. Agarwal

Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...

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

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