A molecular phylogeny of the sphaerodactylid geckos of the genus Pristurus is inferred based on an alignment of 1845 base pairs (bp) of concatenated mitochondrial (12S) and nuclear (acm4, cmos, rag1 and rag2) genes for 80 individuals, representing 18 of the 23-26 species, and the three subspecies of P. rupestris. The results indicate that P. rupestris is polyphyletic and includes two highly div...

Though neuropsychological data indicate that the right hemisphere (RH) plays a major role in metaphor processing, other studies suggest that, at least during some phases of this processing, a RH advantage may not exist. The present study explores, through a temporally agile neural signal--the event-related potentials (ERPs)--, and through source-localization algorithms applied to ERP recordings...

Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport’s transition axiom method is a formal specification method which combines axiomatic and operational approaches. On the other hand Unified Modeling Language (UML), a de facto industry standard visual language, lacks suitable constructs and semantics regarding concurre...

Already in 1968, E.W. Dijkstra [Dij68] proposed to apply a geometric point of view in the consideration of coordination situations in concurrency. His progress graphs were the basis of the Higher Dimensional Automata (HDA) introduced by V. Pratt[Pra91] and developed in the thesis of É. Goubault[Gou95] and in later research (cf. [FGR99]). In this abstract, we stick to a simple continuous geometr...

A Universal Modular ACTOR Formalism for A r t i f i c i a l Intelligence Carl Hewitt Peter Bishop Richard Steiger Abstract This paper proposes a modular ACTOR architecture and definit ional method for a r t i f i c i a l intelligence that is conceptually based on a single kind of object: actors [or, if you w i l l , v i r tual processors, activation frames, or streams]. The formalism makes no p...

Keywords: shared variables network shared variables distributed programming UNIX genetic algorithm Index: UNIX distributed super-computing shared variables message passing client-server networks distributed shared memory Q'NIAL Dyalog APL RPC XDR TCP/IP daemon System V IPC shared memory distributed memory distributed shared memory LINDA deadlock race condition semaphore Abstract Recent market s...

Timed model checking, the method to formally verify real-time systems, is attracting increasing attention from both the model checking community and the real-time community. Explicit-time description methods verify real-time systems using general model constructs found in standard un-timed model checkers. Lamport proposed an explicit-time description method [17] using a clock-ticking process (T...

The semaphore cactus in the Florida Keys bus until recently been considered a disjunct location of the Jamaican Opuntia spinosissima. Loss of all but one population in the Keys coupled with recent suggestions that the species should be taxonomically separated from the Jamaican cactus and is, therefore, a Florida Keys endemic, makes this population of conservation concern. Random amplified polym...

We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the discharging signals can propagate along the switch chain asynchronously and produce a semaphore to indicate the end of each domino process. This results in a network that is fast and highly hardwarecompact. The proposed architecture for...

Mutual exclusion primitives based on user-level atomic instructions (often called spin locks) have proven to be much more eecient than operating-system semaphores in situations where the contention on the semaphore is low. However, many of these spin lock schemes do not permit registration of ownership to be carried out atomically with acquisition, potentially leaving the ownership undetermined...