There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...

module (9WP :(P &RP )). In a similar way, we compute the reachability predicate RQ for Q and construct the abstract module (9WQ:(Q&RQ)). To complete the veri cation process, we then use the following rule: (9WP :(P &RP )) k (9WQ:(Q&RQ)) j= 2' P kQ j= 2' (2) Since the systems P kQ and (P &RP ) k (Q&RQ) have the same reachable states, rule (2) is sound. As we shall see, unlike the simplistic rule...

Anandamide (arachidonoylethanolamine, AEA), an endogenous agonist for both the cannabinoid CB1 receptor and the vanilloid VR1 receptor, elicits neurobehavioral, anti-inflammatory, immunomodulatory, and proapoptotic effects. Because of the central role of nuclear factorB (NFB) in the inflammatory process and the immune response, we postulated that AEA might owe some of its effects to the suppres...

Syntax: P 2 Program TD 2 Type-Declaration T, S, U 2 Type-Name MD 2 Method-Declaration F* 2 Formal-List F 2 Formal B 2 Body D 2 Declaration E 2 Expression g 2 Method-Name E* 2 Expression-List C 2 Command M 2 Main I 2 Identi er N 2 Numeric-literal P ::= TD MD M TD ::= j type I fields ( F* ) j TD1 ; TD2 FD ::= j I : T j FD1 ; FD2 T ::= I MD ::= j method I ( F* ) : T f B g j MD1 ; MD2 F* ::= j F F*...

Several authors have suggested that a more parsimonious and conceptually elegant treatment of everyday mereological and topological reasoning can be obtained by adopting a spatial ontology in which regions, not points, are the primitive entities. This paper challenges this suggestion for mereotopological reasoning in 2-dimensional space. Our strategy is to de ne a mereotopological language toge...

to the rst characterizations by abstracting some nite number of time intervals from the time domain. This abstraction can be nitely possible for the regular class of real-time communicating processes. These second characterizations provide a proof technique for the regular class of real-time communicating processes. The time-out combinator, written by /d, is a binary in x combinator where d is ...