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...

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 ...

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...

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...

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.

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.

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...

A geometrical model which captures the main ingredients governing atom-diatom collinear chemical reactions is proposed. This model is neither near-integrable nor hyperbolic, yet it is amenable to analysis using a combination of the recently developed tools for studying systems with steep potentials and the study of the phase space structure near a center-saddle equilibrium. The nontrivial depen...

In this paper, the nonexistence of tight spherical designs is shown in some cases left open to date. Tight spherical 5-designs may exist in dimension n = (2m + 1)2 − 2, and the existence is known only for m = 1, 2. In the paper, the existence is ruled out under a certain arithmetic condition on the integer m, satisfied by infinitely many values of m, including m = 4. Also, nonexistence is shown...

For a set of masses having positive measure, excepting eventually a negligible set of initial conditions, every noncollinear bounded solution of the planar three-body problem that has a syzygy configuration encounters an infinity of such configurations. Along a noncollinear syzygy solution, the set of syzygy configuration instants is discrete.