All-optical multistage interconnection networks are desirable for overcoming the limitations of optical signal regeneration in switching systems. We present a new implementation of the perfect-shuffle interconnection pattern that is coupled with an all-optical switching element, forming a complete stage of a multistage network. Switching is performed with birefringent calcite crystals and a fer...

class AbstractList { //@ model public int size; //@ in isEmpty; //@ model public boolean isEmpty; //@ public represents isEmpty <(size == 0); //@ public invariant size >= 0; //@ assignable isEmpty; //@ ensures isEmpty; abstract public void clear(); //@ assignable size; // but isEmpty is not assignable //@ ensures size <= \old(size); //@ ensures \old(size) > 0 ==> size > 0; abstract public void ...

I describe the entry process in a spatial market over an in...nite time horizon. I show that, as long as the strategy space at the location stage is unbounded, the results derived from the single-period Stackelberg model of entry coincide with those obtained in the in...nite horizon model. On the contrary, if the strategy space is bounded, then the later the follower enters, the closer to the c...

(1) For all sets X1, X2 and for all sets a1, a2 holds [:X1 7−→ a1, X2 7−→ a2 :] = [:X1, X2 :] 7−→ 〈a1, a2〉. Let I be a set. One can check that 0I is function yielding. Next we state two propositions: (2) For all functions f , g holds x(g · f ) = g ·x f . (3) For all functions f , g, h holds x( f · [:g, h :]) = x f · [:h, g :]. Let f be a function yielding function. Observe that x f is function ...

Indexing techniques support the retrieval and maintenance of large sets of terms There is also an indexing method called substi tution tree indexing that e ciently handles sets of substitutions We present three advanced indexing operations for substitution trees The multi merge for the simultaneous uni cation of sets of substitutions the subsumption operation on two sets of substitutions and th...