نتایج جستجو برای: sibility condition

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

2008
G. Veneziano

An inhomogeneous version of pre–Big Bang cosmology emerges, within string theory, from quite generic initial conditions, provided they lie deeply inside the weak-coupling, lowcurvature regime. Large-scale homogeneity, flatness, and isotropy appear naturally as latetime outcomes of such an evolution. CERN-TH/97-42 March 1997

2009
DANIEL FARLEY

We prove that any hyperplane H in a CAT(0) cubical complex X has no self-intersections and separates X into two convex complementary components. These facts were originally proved by Sageev. Our argument shows that his theorem (or this direction of his theorem) is a corollary of Gromov’s link condition. We also give new arguments establishing some combinatorial properties of hyperplanes. We sho...

2015
Ryosuke Onoda Satoko Miwa Kiyomi Akita

A rebutting counterargument is considered a very effective strategy to make one’s own argument more persuasive; however, the possible reasons behind this are not clear. In this study, we investigated the effects of rebutting counterarguments on persuasiveness in written arguments. One hundred undergraduate students were assigned randomly to two conditions: a “non-rebuttal condition” and a “rebu...

Journal: :SIAM J. Control and Optimization 2002
Nizar Touzi Nicolas Vieille

Let (X,Y, Z) be a triple of payoff processes defining a Dynkin game R̃(σ, τ) = E [ Xσ1{τ>σ} + Yτ1{τ<σ} + Zτ1{τ=σ} ] , where σ and τ are stopping times valued in [0, T ]. In the case Z = Y , it is well known that the condition X ≤ Y is needed in order to establish the existence of value for the game, i.e., infτ supσ R̃(σ, τ) = supσ infτ R̃(σ, τ). In order to remove the condition X ≤ Y , we introduc...

2008
Filip Lievens Helga Peeters

Although faking has been identified as a potential problem in situational judgment tests (SJTs), no studies have investigated proactive approaches for controlling faking in SJTs. Therefore, this study examined the impact of elaboration on responding to SJT items. Elaboration was operationalized as reason-giving. Two hundred and forty-seven master students were assigned to either an honest or a ...

Journal: :Speech Communication 1996
Hans-Wilhelm Gierlich

In this paper quality evaluation procedures for hands-free telephones are described with reference to some examples. The paper shortly describes the hearing tests conducted in order to investigate the auditory perceived quality in single talk condition. The parameters found to be most relevant in this situation are listed. Special tests were conducted in order to evaluate the conversational qua...

Journal: :CoRR 2016
Humberto Stein Shiromoto Petro Feketa Sergey Dashkovskiy

This work provides an example that motivates and illustrates theoretical results related to a combination of small-gain and density propagation conditions. Namely, in case the small-gain fails to hold at certain points or intervals the density propagation condition can be applied to assure global stability properties. We repeat the theoretical results here and demonstrate how they can be applie...

1992
ALAN EDELMAN

In this note, we give the exact distribution of a scaled condition number used by Demmel to model the probability that matrix inversion is difficult. Specifically, consider a random matrix A and the scaled condition number kd{A) = \\A\\f \\A~l\\. Demmel provided bounds for the condition number distribution when A has real or complex normally distributed elements. Here, we give the exact formula.

2013
Guy Lebret Moisés Bonilla G. Lebret

Different properties of general linear descriptor systems are reviewed (existence of solution, consistency of initial condition, impulse controllability and controllability) and structurally characterized. The invariants are associated to a known feedback canonical form of descriptor systems. The aim is to sort the systems by inclusion properties depending on these characterizations.

2002
Birgit JACOB Hans ZWART

for all z0 ∈ D(A). Here T (t) is the C0-semigroup generated by A. A system (1) that satisfies the above conditions will be denoted by Σ(A,C). The admissibility of C, eqn. (2), implies that we can extend the mapping z0 → CT (·)z0 to a bounded linear mapping from Z to L2(0,∞). We denote this mapping by C. Thus we have that for any initial condition z0 the solution of (1) is given by z(t) = T (t)z...

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

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