Commercial coherent receivers utilize balanced photodetectors (PDs) with high single-port rejection ratio (SPRR) to mitigate the signal-signal beat interference (SSBI) due square-law detection process. As symbol rates of transponders are increased 100 Gbaud and beyond, maintaining a SPRR in cost-effective manner becomes more challenging. One potential approach for solving this problem is levera...

During the last decade, a number of new priorityqueue implementations have evolved, including pagodas [6, 261, skew heaps [21, 221, splay trees [21, 231, pairing heaps 1183, and binomial queues [4, 5, 241. In addition, a number of special priority-queue implementations for representing the pending event set in discrete event simulation Shave been developed, including the two-list implementation...

A deque with heap order is a linear list of elements with real-valued keys which allows insertions and deletions of elements at both ends of the list. It also allows the ndmin (equivalently ndmax) operation, which returns the element of least (greatest) key, but it does not allow a general deletemin (deletemax) operation. Such a data structure is also called a mindeque (maxdeque). Whereas imple...

Of all the issues discussed at Alife VII: Looking Forward, Looking Backward, the issue of whether it was possible to create an artificial life system that exhibits open-ended evolution of novelty is by far the biggest. Of the 14 open problems settled on as a result of debate at the conference, some 6 are directly, or indirectly related to this issue. Most people equate open-ended evolution with...

This chapter introduces the computational infrastructure that is used to bridge the gap between results from sensorimotor processing and language. It consists of a system called Incremental Recruitment Language (IRL) that is able to configure a network of cognitive operations to achieve a particular communicative goal. IRL contains mechanisms for finding such networks, chunking subnetworks for ...

We give a new, simple proof for the sequential access theorem for splay trees. For an n-node splay tree, our bound on the number of rotations is 4:5n, with a smaller constant than the bound of 10:8n concluded by Tarjan. We extend our proof to prove the deque conjecture for output-restricted deques. Our proofs provide additional insights into the workings of splay trees. c © 2004 Elsevier B.V. A...

Introduction. Let G be a locally compact, connected topological group (satisfying the second countability axiom). Let G* be a compact space which contains a dense subset G' homeomorphic to the space G and is such that G* — G' is totally disconnected. Then, Freudenthal has proved [l, Satz IX, p. 277]1 that the set G*-G' consists of at most two distinct points. Actually, Freudenthal's theorem eve...

Two new ways of transforming a priority queue into a double-ended priority queue are introduced. These methods can be used to improve all known bounds for the comparison complexity of double-ended priority-queue operations. Using an efficient priority queue, the first transformation can produce a doubleended priority queue which guarantees the worst-case cost of O(1) for find -min , find-max , ...

This paper describes a front-end stage that has been implemented and embedded into instruments dedicated to a wide variety of electrophysiological mapping applications. Emphasis during the design phase has been put towards flexibility, simplicity, and performance in various environments.