In this paper, we present our approach to introduce dynamism support to simulation environments, which adopts a Discrete Event System Specification (DEVS)-based modeling and simulation approach and builds upon previous work on Simulation Modeling Architecture (SiMA), a DEVS-based simulation framework developed at TUBITAK UEKAE. In the relevant literature there are already proposed solutions to ...

The celebrated Borel-Cantelli lemma asserts that (A) If ~P(E,,) < 00, then P (lim sup Ek) =O; (B) If the events Es are independent and if xP(Ek) = m, then P(lim sup Eh) = 1. In intuitive language P(lim. sup &) is the probability that the events Eh occur “infinitely often” and will be denoted by P(Ek i.0.). This lemma is the basis of all theorems of the strong type in probability theory. Its app...

We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of NIP (not the independence property), continuing aspects of the paper [16]. Among key results are (i) if p = tp(b/A) does not fork over A then the Lascar strong type of b over A coincides with the compact strong type of b over A and any global nonforking extension of p is Borel definable over bdd...

This paper reappraises Landman's formal theory of intensional individuals|indivi-duals under roles, or guises (Landman 1989)|within property theory (PT) (Turner 1992). As many of Landman's axioms exist to overcome the strong typing of his representation, casting his ideas in weakly typed PT produces a simpler theory. However, there is the possibility of an even greater simpliication: if roles, ...

We consider the problem of converting C pointers to the less flexible concept of references. Our main application is converting scientific applications from C to Java. We provide a general method to model essentially all features of pointers using references. The model is easily implemented in Java. We give optimizations that map key facilities like arrays and structures onto the obvious Java e...

We examine the problem of how to ensure behavioral consistency of an object oriented system after its schema has been updated The problem is viewed from the perspective of both the strongly typed and the untyped language model Solutions are compared in both models using C and CLOS as examples

A systematic treatment of multilinear Calderón-Zygmund operators is presented. The theory developed includes strong type and endpoint weak type estimates, interpolation, the multilinear T1 theorem, and a variety of results regarding multilinear multiplier operators.

Let T be a countable, small simple theory. In this paper, we prove for such T , the notion of Lascar strong type coincides with the notion of strong type, over an arbitrary set. §

We prove that the generalized Carleson operator Cd with polynomial phase function is of strong type (p, r), 1 < r < p < ∞; this yields a positive answer in the 1 < p < 2 case to a conjecture of Stein which asserts that for 1 < p < ∞ we have that Cd is of strong type (p, p). A key ingredient in this proof is the further extension of the relational time-frequency perspective (introduced in [5]) t...