Experimental demonstration of femtosecond switching of a fully packaged all-optical switch

We experimentally demonstrate femtosecond switching of a fully packaged hybrid-integrated Mach-Zehnder switch. A record switching window of 620fs at fult-width-half-maximum is achieved. © 2004 Optical Society of America.

A novel scalable photonic analog switch architecture based on semiconductor optical amplifiers

We propose a novel semiconductor optical amplifier (SOA) based switch architecture for analog applications. Proof-of-principle experiments show that the system is very linear with an SFDR of approximately 100dB·Hz 2/3 for a switching time of 50μs. The port number of this switch is scalable and can be expanded to 80 × 80.

Low penalty cascaded operation of a monolithically integrated Quantum Dot 1×8 port optical switch

A novel Quantum Dot monolithically integrated 1×8 switch is shown to provide robust routing of data at 10Gb/s modulation rates. Two cascaded switches providing, 1×64 functionality, operate with a power penalty of only 0.9dB. © VDE VERLAG GMBH.

Large port count high-speed optical switch fabric for use within datacenters [Invited]

This paper reviews advances in the technology of integrated semiconductor optical amplifier based photonic switch fabrics, with particular emphasis on their suitability for high performance network switches for use within a datacenter. The key requirements for large port count optical switch fabrics are addressed noting the need for switches with substantial port counts. The design options for a 16×16 port photonic switch fabric architecture are discussed and the choice of a Clos-tree design is described. The control strategy, based on arbitration and scheduling, for an integrated switch fabric is explained. The detailed design and fabrication of the switch is followed by experimental characterization, showing net optical gain and operation at 10 Gb/s with bit error rates lower than 10-9. Finally improvements to the switch are suggested, which should result in 100 Gb/s per port operation at energy efficiencies of 3 pJ/bit. © 2011 Optical Society of America.

Context-dependent partitioning of motor learning in bimanual movements.

Human subjects easily adapt to single dynamic or visuomotor perturbations. In contrast, when two opposing dynamic or visuomotor perturbations are presented sequentially, interference is often observed. We examined the effect of bimanual movement context on interference between opposing perturbations using pairs of contexts, in which the relative direction of movement between the two arms was different across the pair. When each perturbation direction was associated with a different bimanual context, such as movement of the arms in the same direction versus movement in the opposite direction, interference was dramatically reduced. This occurred over a short period of training and was seen for both dynamic and visuomotor perturbations, suggesting a partitioning of motor learning for the different bimanual contexts. Further support for this was found in a series of transfer experiments. Having learned a single dynamic or visuomotor perturbation in one bimanual context, subjects showed incomplete transfer of this learning when the context changed, even though the perturbation remained the same. In addition, we examined a bimanual context in which one arm was moved passively and show that the reduction in interference requires active movement. The sensory consequences of movement are thus insufficient to allow opposing perturbations to be co-represented. Our results suggest different bimanual movement contexts engage at least partially separate representations of dynamics and kinematics in the motor system.

The estimation of stochastic context-free grammars using the Inside-Outside algorithm

Using an entropy argument, it is shown that stochastic context-free grammars (SCFG's) can model sources with hidden branching processes more efficiently than stochastic regular grammars (or equivalently HMM's). However, the automatic estimation of SCFG's using the Inside-Outside algorithm is limited in practice by its O(n3) complexity. In this paper, a novel pre-training algorithm is described which can give significant computational savings. Also, the need for controlling the way that non-terminals are allocated to hidden processes is discussed and a solution is presented in the form of a grammar minimization procedure. © 1990.