This paper deals with a special kind of complex systems which depend on an arbitrary (and usually large) number n of random Boolean variables. The so-called complex stochastic Boolean systems often appear in many different scientific, technical or social areas. Clearly, there are 2n binary states associated to such a complex system. Each one of them is given by a binary string u = (u1, . . . , ...

In this paper, I propose that the availability of a bound variable reading for pronouns is predictable from their morphological structure of the pronouns. More specifically I argue that noun-containing pronouns cannot be bound variables. My proposal is different from D&W's (2002) argument in that in their theory, every DPs cannot have a bound variable reading, while in my theory, even DPs can h...

Title of dissertation: DEEP ANALYSIS OF BINARY CODE TO RECOVER PROGRAM STRUCTURE Khaled ElWazeer, Doctor of Philosophy, 2014 Dissertation directed by: Professor Rajeev Barua Department of Electrical and Computer Engineering Reverse engineering binary executable code is gaining more interest in the research community. Agencies as diverse as anti-virus companies, security consultants, code forens...

Simulating spatial correlated binary data is very important on many cases, but it is not easily to accomplish, as there are restrictions on the parameters of Bernoulli variables. This paper develops a copulas method to generate spatial correlated binary data. The spatial binary data generated by this method has an inverse spatial pattern comparing with the latent Gaussian random field data, how...

Nieuwe flexibele modellen en algoritmen voor het ontwerp van experimenten voor mengsels en binaire afhankelijke variabelen Thesis to obtain the degree of Doctor from the Erasmus University Rotterdam by command of the rector magnificus and in accordance with the decision of the Doctorate Board. Acknowledgments I would like to express my sincere gratitude to my doctoral promotors Professor Dennis...

In reasoning tasks involving the maintenance of consistent databases (so called "constraint net­ works") it is customary to enforce local consistency conditions in order to simplify the construc­ tion of a globally coherent model of the data. In this paper we present a relationship between the sizes of the variables' domains and the level of local consistency sufficient to ensure global con­ si...

The equivalence between autonomicity and the absence of free variables is a well-known result for linear, shift-invariant and complete behaviors over a field. However, this no longer holds for a behavior that does not satisfy one of those properties. In this paper we consider linear, shift-invariant and complete behaviors over the ring Zpr and study under which conditions such behaviors are aut...

This paper presents an analysis of the copy construction that explains its similarity to extraction constructions while accounting for its incompatibility with wh+NP phrases. Essentially, wh-phrases without an NP complement can be copied because they’re non-quantificational (introducing only a free variable into the derivation). Whphraseswith anNP complement cannot be copied because thesewh-phr...