We consider the impact of Catalyzed Big Bang Nucleosynthesis on theories with a gravitino LSP and a charged slepton NLSP. In models where the gravitino to gaugino mass ratio is bounded from below, we derive a lower bound on the gaugino mass parameter m1/2. As a concrete example, we determine the parameter space of gaugino mediation that is compatible with all cosmological constraints. Email: jk...

This paper addresses the design of robust H2 filters for linear continuoustime systems subject to parameter uncertainty in the state-space model. The uncertain parameters are supposed to belong to a given convex bounded polyhedral domain. Two methods based on parameter-dependent Lyapunov functions are proposed for designing linear stationary asymptotically stable filters that assure asymptotic ...

in 1997, fang proposed the concept of boundedness of $l$-fuzzy setsin $l$-topological vector spaces. since then, this concept has beenwidely accepted and adopted in the literature. in this paper,several characterizations of bounded $l$-fuzzy sets in$l$-topological vector spaces are obtained and some properties ofbounded $l$-fuzzy sets are investigated.

When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q,...

An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resourcebounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The uti...

We now prove Theorem 1. Let M be a probabilistic machine running in space S (and time 2S), using R random bits, and deciding a language L with two-sided error. (Note that S, R are functions of the input length n, and the theorem requires S = Ω(log n).) We will assume without loss of generality that M always uses exactly R random bits on all inputs. Fixing an input x and letting ` be some parame...

This paper investigates the computational power of space-bounded quantum Turing machines. The following facts are proved for space-constructible space bounds s satisfying s(n) = Ω(log n). 1. Any quantum Turing machine (QTM) running in space s can be simulated by an unbounded error probabilistic Turing machine (PTM) running in space O(s). No assumptions on the probability of error or running tim...

The main purpose of this paper is to derive a new (p, q)-atomic decomposition on the multi-parameter Hardy space H(X1 ×X2) for 0 < p0 < p ≤ 1 for some p0 and all 1 < q < ∞, where X1 × X2 is the product of two spaces of homogeneous type in the sense of Coifman and Weiss. This decomposition converges in both L(X1 × X2) (for 1 < q < ∞) and Hardy space H(X1 × X2) (for 0 < p ≤ 1). As an application,...

a projective parameter of a geodesic as solution of certain ode is defined to be a parameter which is invariant under projective change of metric. using projective parameter and poincaré metric, an intrinsic projectively invariant pseudo-distance can be constructed. in the present work, solutions of the above ode are characterized with respect to the sign of parallel ricci tensor on a finsler s...