270GHz, 580fs Optical Pulse Generation from a single-section quantum-dash fabry-pérot laser using frequency multiplication

Pulse generation from a mode-locked single-section 1.55μm quantum-dash FP laser is demonstrated under continuous-wave operation. A 270GHz, 580fs pulse train is achieved by applying frequency multiplication using fiber dispersion. ©2009 Optical Society of America.

Stable multiplication gain in GaN p-i-n avalanche photodiodes with large device area

Visible-blind p-i-n avalanche photodiodes (APDs) were fabricated with high-quality GaN epilayers deposited on c-plane sapphire substrates by metal-organic chemical vapour deposition. Due to low dislocation density and a sophisticated device fabrication process, the dark current was as small as similar to 0.05 nA under reverse bias up to 20V for devices with a large diameter of 200 mu m, which was among the largest device area for GaN-based p-i-n APDs yet reported. When the reverse bias exceeded 38V the dark current increased sharply, exhibiting a bulk avalanche field-dominated stable breakdown without microplasma formation or sidewall breakdown. With ultraviolet illumination (360 nm) an avalanche multiplication gain of 57 was achieved.

Performing Fast Addition and Multiplication by Transferring Single Electrons

This paper proposes novel fast addition and multiplication circuits that are based on non-binary redundant number systems and single electron (SE) devices. The circuits consist of MOSFET-based single-electron (SE) turnstiles. We use the number of electrons to represent discrete multiple-valued logic states and we finish arithmetic operations by controlling the number of electrons transferred. We construct a compact PD2,3 adder and a 12x12bit multiplier using the PD2,3 adder. The speed of the adder can be as high as 600MHz with 400nW power dissipation. The speed of the adder is regardless of its operand length. The proposed circuits have much smaller transistors than conventional circuits.

Performance of an embedded optical vector matrix multiplication processor architecture

An embedded architecture of optical vector matrix multiplier (OVMM) is presented. The embedded architecture is aimed at optimising the data flow of vector matrix multiplier (VMM) to promote its performance. Data dependence is discussed when the OVMM is connected to a cluster system. A simulator is built to analyse the performance according to the architecture. According to the simulation, Amdahl's law is used to analyse the hybrid opto-electronic system. It is found that the electronic part and its interaction with optical part form the bottleneck of system.

Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels, or explicitly by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain less switches than the maximum. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations improves over the results obtained by a recent state-of-the-art Hybrid Genetic Algorithm for pump scheduling using level-controlled triggers.

Augmenting an artificial immune network using ordering, self-recognition and histo-compatibility operators.

Timmis J Neal M J and Hunt J. Augmenting an artificial immune network using ordering, self-recognition and histo-compatibility operators. In Proceedings of IEEE international conference of systems, man and cybernetics, pages 3821-3826, San Diego, 1998. IEEE.

The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients

M.Hieber, I.Wood: The Dirichlet problem in convex bounded domains for operators with L^\infty-coefficients, Diff. Int. Eq., 20, 7 (2007),721-734.

A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures

R. Daly and Q. Shen. A Framework for the Scoring of Operators on the Search Space of Equivalence Classes of Bayesian Network Structures. Proceedings of the 2005 UK Workshop on Computational Intelligence, pages 67-74.

Boundary triplets and M-functions for non-selfadjoint operators, with applications to elliptic PDEs and block operator matrices

B.M. Brown, M. Marletta, S. Naboko, I. Wood: Boundary triplets and M-functions for non-selfadjoint operators, with applications to elliptic PDEs and block operator matrices, J. London Math. Soc., June 2008; 77: 700-718. The full text of this article will be made available in this repository in June 2009 Sponsorship: EPSRC,INTAS

The Dirichlet problem in convex bounded domains for operators with L8-coefficients

Wood, Ian; Hieber, M., (2007) 'The Dirichlet problem in convex bounded domains for operators with L8-coefficients', Differential and Integral Equations 20 pp.721-734 RAE2008

Birkhoff normal forms for Fourier integral operators II

Iantchenko, A.; Sj?strand, J., (2001) 'Birkhoff normal forms for Fourier integral operators II', American Journal of Mathematics 124(4) pp.817-850 RAE2008

On the Complexity of Quantum ACC

For any q > 1, let MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by q. We show that for any q,t > 1, MOD_q is equivalent to MOD_t (up to constant depth). Based on the case q=2, Moore has shown that quantum analogs of AC^(0), ACC[q], and ACC, denoted QAC^(0)_wf, QACC[2], QACC respectively, define the same class of operators, leaving q > 2 as an open question. Our result resolves this question, implying that QAC^(0)_wf = QACC[q] = QACC for all q. We also prove the first upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC (both for arbitrary complex amplitudes) and BQACC (for rational number amplitudes) and show that they are all contained in TC^(0). To do this, we show that a TC^(0) circuit can keep track of the amplitudes of the state resulting from the application of a QACC operator using a constant width polynomial size tensor sum. In order to accomplish this, we also show that TC^(0) can perform iterated addition and multiplication in certain field extensions.