Ultrafast time-domain technology and its application in all-optical signal processing

In this paper, we review recent advances in ultrafast optical time-domain technology with emphasis on the use in optical packet switching. In this respect, several key building blocks, including high-rate laser sources applicable to any time-division-multiplexing (TDM) application, optical logic circuits for bitwise processing, and clock-recovery circuits for timing synchronization with both synchronous and asynchronous data traffic, are described in detail. The circuits take advantage of the ultrafast nonlinear transfer function of semiconductor-based devices to operate successfully at rates beyond 10 Gb/s. We also demonstrate two more complex circuits-a header extraction unit and an exchange-bypass switch-operating at 10 Gb/s. These two units are key blocks for any general-purpose packet routing/switching application. Finally, we discuss the system perspective of all these modules and propose their possible incorporation in a packet switch architecture to provide low-level but high-speed functionalities. The goal is to perform as many operations as possible in the optical domain to increase node throughput and to alleviate the network from unwanted and expensive optical-electrical-optical conversions.     

Oxygen as a tracer for measurements of steady and turbulent flows

The reduction of dissolved oxygen has been studied over a wide conductivity range for use in steady or nonsteady hydrodynamic measurements. Mass transfer fluctuations can be analysed statistically to obtain the power spectra of hydrodynamic fluctuations. This requires a consideration of the proton reduction, which prevents diffusion from limiting the current. The transfer function for deducing the hydrodynamic spectra from mass transfer spectra includes not only transport effects but also kinetic effects which account for the finite rate of the reaction. The experimental study was performed using electrohydrodynamic (EHD) impedance.     

Low bit depth representation motion estimation algorithms: a comparative study

A comparative study of low complexity motion estimation algorithms is presented. The algorithms included in the study are the 1-bit transform, the 2-bit transform, the constrained 1-bit transform and the multiplication free 1-bit transform which are using different motion estimation strategies compared to standard exhaustive search algorithm-mean absolute difference or similar combinations. These techniques provide better performance in terms of computational load compared to traditional algorithms. Although the accuracy of motion compensation is only slightly lower comparing to the other techniques, results in terms of objective quality (peak signal-to-noise ratio) and entropy are comparable. This fact, nominates them as suitable candidates for inclusion in embedded devices applications where lower complexity translates to lower power consumption and consequently improved device autonomy.     

Quantum game simulator, using the circuit model of quantum computation

We present a general two-player quantum game simulator that can simulate any two-player quantum game described by a 2×2 payoff matrix (two strategy games).The user can determine the payoff matrices for both players, their strategies and the amount of entanglement between their initial strategies. The outputs of the simulator are the expected payoffs of each player as a function of the other player's strategy parameters and the amount of entanglement. The simulator also produces contour plots that divide the strategy spaces of the game in regions in which players can get larger payoffs if they choose to use a quantum strategy against any classical one. We also apply the simulator to two well-known quantum games, the Battle of Sexes and the Chicken game.

Program summary

Program title: Quantum Game Simulator (QGS)Catalogue identifier: AEED_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEED_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 3416No. of bytes in distributed program, including test data, etc.: 583 553Distribution format: tar.gzProgramming language: Matlab R2008a (C)Computer: Any computer that can sufficiently run Matlab R2008aOperating system: Any system that can sufficiently run Matlab R2008aClassification: 4.15Nature of problem: Simulation of two player quantum games described by a payoff matrix.Solution method: The program calculates the matrices that comprise the Eisert setup for quantum games based on the quantum circuit model. There are 5 parameters that can be altered. We define 3 of them as constant. We play the quantum game for all possible values for the other 2 parameters and store the results in a matrix.Unusual features: The software provides an easy way of simulating any two-player quantum games.Running time: Approximately 0.4 sec (Region Feature) and 0.3 sec (Payoff Feature) on a Intel Core 2 Duo GHz with 2 GB of memory under Windows XP.     

Correlating burst events on streaming stock market data

We address the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. We follow a two-step methodology: first we identify the burst sections in our data and subsequently we store them for easy retrieval in an efficient in-memory index. The burst detection scheme imposes a variable threshold on the examined data and takes advantage of the skewed distribution that is typically encountered in many applications. The detected bursts are compacted into burst intervals and stored in an interval index. The index facilitates the identification of correlated bursts by performing very efficient overlap operations on the stored burst regions. We present the merits of the proposed indexing scheme through a thorough analysis of its complexity. We also manifest the real-time response of our burst indexing technique, and demonstrate the usefulness of the approach for correlating surprising volume trading events using historical stock data of the NY stock exchange. While the focus of this work is on financial data, the proposed methods and data-structures can find applications for anomaly or novelty detection in telecommunication, network traffic and medical data.     

Nearest neighbor estimate of conditional mutual information in feature selection

Mutual information (MI) is used in feature selection to evaluate two key-properties of optimal features, the relevance of a feature to the class variable and the redundancy of similar features. Conditional mutual information (CMI), i.e., MI of the candidate feature to the class variable conditioning on the features already selected, is a natural extension of MI but not so far applied due to estimation complications for high dimensional distributions. We propose the nearest neighbor estimate of CMI, appropriate for high-dimensional variables, and build an iterative scheme for sequential feature selection with a termination criterion, called CMINN. We show that CMINN is equivalent to feature selection MI filters, such as mRMR and MaxiMin, in the presence of solely single feature effects, and more appropriate for combined feature effects. We compare CMINN to mRMR and MaxiMin on simulated datasets involving combined effects and confirm the superiority of CMINN in selecting the correct features (indicated also by the termination criterion) and giving best classification accuracy. The application to ten benchmark databases shows that CMINN obtains the same or higher classification accuracy compared to mRMR and MaxiMin at a smaller cardinality of the selected feature subset.     

Hydrodeoxygenation of HMF over Pt/C in a continuous flow reactor

The three‐phase hydrodeoxygenation reaction of 5‐hydroxymethylfurfural (HMF) with H₂ was studied over a 10 wt % Pt/C catalyst using both batch and flow reactors, with ethanol, 1‐propanol, and toluene solvents. The reaction is shown to be sequential, with HMF reacting first to furfuryl ethers and other partially hydrogenated products. These intermediate products then form dimethyl furan (DMF), which in turn reacts further to undesired products. Furfuryl ethers were found to react to DMF much faster than HMF, explaining the higher reactivity of HMF when alcohol solvents were used. With the optimal residence time, it was possible to achieve yields approaching 70% in the flow reactor with the Pt/C catalyst. Much higher selectivities and yields were obtained in the flow reactor than in the batch reactor because side products are formed sequentially, rather than in parallel, demonstrating the importance of choosing the correct type of reactor in catalyst screening. © 2014 American Institute of Chemical Engineers AIChE J, 61: 590–597, 2015     

Flexible Hardware Acceleration for Instruction-Grain Lifeguards

Instruction-grain lifeguards monitor executing programs at the granularity of individual instructions to quickly detect bugs and security attacks, but their fine-grain nature incurs high monitoring overheads. This article identifies three common sources of these overheads and proposes three techniques that together constitute a general-purpose hardware acceleration framework for lifeguards.     

Simulated Bacterially-Inspired Problem Solving – The Behavioural Domain

Bacterial populations meet the challenges of dynamic spatially heterogeneous environments with fluctuating biotic and abiotic factors in a number of ways. The motivation for the work presented here has been to transfer ideas from bacterial adaptability and evolvability to computational problem solving. Following a brief comment on some examples of the ways bacteria solve problems, a bacterially-inspired computational architecture for simulating aspects of problem solving is described. We then examine three case studies. The first, a study of the mutational impact of a remediation to toxic (fitness-reducing) material, highlights how a sufficiently pre-engineered adaptive system can solve a difficult problem quite easily. The second study looks at why it is difficult to evolve complex problem solving behaviours and how artificial selection mechanisms coupled with pre-engineering the system can help. Specifically, this refers to quorum sensing and tactic behaviours. A further study looked at ways in which a quorum sensing analogue could help computational agents find multiple peaks in a landscape. The paper concludes with a discussion of an investigation of bacteria that had both quorum sensing and tactic capabilities.