Metric spaces, Borel and analytic sets, Baire property and measurability, dichotomies, equivalence relations. Possible topics: determinacy, group actions, rigidity, turbulence.

We generalize Stochastic Mathematical Programs with Equilibrium Constraints (SMPEC) introduced by Patriksson and Wynter [Operations Research Letters, Vol. 25, pp. 159–167, 1999] to allow joint upper-level constraints, and to change continuity assumptions w.r.t. uncertainty parameter assumed before by measurability assumptions. For this problem, we prove the measurability of a lower-level mappin...

conclusions due to the scarcity of studies related to some dairy subgroups, it is not possible to make a final judgment about their effects on the risk of diabetes; therefore, more studies need to be conducted on this issue. results out of 1391 articles, 13 (covering 421,421 people) were introduced to the current meta-analysis. the findings showed that the consumption of yoghurt and cream has p...

Let ẽ ≥ φ be arbitrary. A central problem in arithmetic Lie theory is the computation of symmetric arrows. We show that ū ≡ ∞. In contrast, this reduces the results of [33] to an approximation argument. Therefore it is essential to consider that may be smooth.

There are many natural forcing notions adding real numbers, most notably the precursors of this class of forcing notions, namely Cohen and Random forcing. Whereas Random forcing has been deliberately constructed in connection with the σ–algebra of Lebesgue measurable sets and Cohen forcing is represented by the algebra of Borel sets modulo the σ–ideal of meager sets, the other classical forcing...

We consider a nonautonomous stochastic $ p $-Laplacian lattice equation with multiplicative noise and nonlinearity that is not locally Lipschitz. For each q\geq1 $, pullback (\ell^2, \ell^q) $-attractor obtained, the measurability of attractor in both spaces by more complicated estimates. Then, time-dependent invariant sample Borel probability measures are constructed carried random attractor. ...

We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid shapes under translations and rigid motions. The shapes are subsets of R, d ≥ 2. The algorithms approximate w.r.t. an prespecified additive error and succeed with high probability. Apart from measurability assumptions, we only require from the shapes that uniformly distributed random points ca...

The semantic validation of utterances as true or false is known in logic and linguistics. However, linguistic messages are validated not only on the semantic but also on the pragmatic level. In most linguistic studies, pragmatics is defined mostly as the interrelation between speakers and is considered as a mere supplement to semantics. In our approach (we call MIC : meta-informative centering ...

We introduce a formal model and a corresponding system architecture for the acquisition of new concepts from real-world natural language texts. Our approach is centered around the linguistic and conceptual \quality" of various forms of evidence underlying the generation and reenement of concept hypotheses. Based on a ter-minological (meta)reasoning platform, hypotheses are continuously annotate...