Design of Raman-based nonlinear loop mirror for all-optical 2R regeneration of differential phase-shift-keying transmission

We present a concept for all-optical regeneration of signals modulated in phase-sensitive modulation formats, which is based on a new design of Raman amplified nonlinear optical loop mirror (RA-NOLM). We demonstrate simultaneous amplitude-shape regeneration and phase-noise reduction in high-speed differential phase-shift-keying transmission systems by use of the RA-NOLM combined with spectral filtering. © 2006 IEEE.

Demonstrating doubly-differential quadrature phase shift keying in the optical domain

We report for the first time the experimental demonstration of doubly differential quadrature phase shift keying (DDQPSK) using optical coherent detection. This method is more robust against high frequency offsets (FO) than conventional single differential quadrature phase shift keying (SDQPSK) with offset compensation. DDQPSK is shown to be able to compensate large FOs (up to the baud rate) and has lower computational requirements than other FO compensation methods. DDQPSK is a simple algorithm to implement in a real-time decoder for optical burst switched network scenarios. Simulation results are also provided, which show good agreement with the experimental results for both SDQPSK and DDQPSK transmissions. © 1989-2012 IEEE.

Some aspects of scheduling in a group technology manufacturing system

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Reduction of the phase jitter in differential phase-shift-keying soliton transmission systems by in-line Butterworth filters

We examine reduction of phase jitter by use of in-line Butterworth filters in soliton systems in the context of differential phase-shift-keying coding. We also demonstrate numerically that the use of a Butterworth filter in a return-to-zero differential phase-shift-keying system can reduce continuum background radiation.

Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs

This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with re-entrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are required to reenter to the flow shop. The tardiness weight is adjusted once the jobs reenter to the shop. The performance of the proposed GA model is verified by a number of numerical experiments where the data come from the case company. The results show the proposed method has a higher order satisfaction rate than the current industrial practices.

In-situ XPS study on the reducibility of Pd-promoted Cu/CeO2 catalysts for the oxygen-assisted water-gas-shift reaction

Cu/CeO2, Pd/CeO2, and CuPd/CeO2 catalysts were prepared and their reduction followed by in-situ XPS in order to explore promoter and support interactions in a bimetallic CuPd/CeO2 catalyst effective for the oxygen-assisted water-gas-shift (OWGS) reaction. Mutual interactions between Cu, Pd, and CeO2 components all affect the reduction process. Addition of only 1 wt% Pd to 30 wt% Cu/CeO2 greatly enhances the reducibility of both dispersed CuO and ceria support. In-vacuo reduction (inside XPS chamber) up to 400 °C results in a continuous growth of metallic copper and Ce3+ surface species, although higher temperatures results in support reoxidation. Supported copper in turn destabilizes metallic palladium metal with respect to PdO, this mutual perturbation indicating a strong intimate interaction between the Cu–Pd components. Despite its lower intrinsic reactivity towards OWGS, palladium addition at only 1 wt% loading significantly improved CO conversion in OWGS reaction over a monometallic 30 wt% Cu/CeO2 catalysts, possibly by helping to maintain Cu in a reduced state during reaction.

A paradigm shift:alternative interaction techniques for use with mobile & wearable devices

Desktop user interface design originates from the fact that users are stationary and can devote all of their visual resource to the application with which they are interacting. In contrast, users of mobile and wearable devices are typically in motion whilst using their device which means that they cannot devote all or any of their visual resource to interaction with the mobile application -- it must remain with the primary task, often for safety reasons. Additionally, such devices have limited screen real estate and traditional input and output capabilities are generally restricted. Consequently, if we are to develop effective applications for use on mobile or wearable technology, we must embrace a paradigm shift with respect to the interaction techniques we employ for communication with such devices.This paper discusses why it is necessary to embrace a paradigm shift in terms of interaction techniques for mobile technology and presents two novel multimodal interaction techniques which are effective alternatives to traditional, visual-centric interface designs on mobile devices as empirical examples of the potential to achieve this shift.

Improving scheduling techniques in heterogeneous systems with dynamic, on-line optimisations

Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive applications. However, implementations for such heterogeneous systems are often hand-crafted and optimised to one computation scenario, and it can be challenging to maintain high performance when application parameters change. In this paper, we demonstrate that machine learning can help to dynamically choose parameters for task scheduling and load-balancing based on changing characteristics of the incoming workload. We use a financial option pricing application as a case study. We propose a simulation of processing financial tasks on a heterogeneous system with GPUs and FPGAs, and show how dynamic, on-line optimisations could improve such a system. We compare on-line and batch processing algorithms, and we also consider cases with no dynamic optimisations.

Transparent Scheduling of Composite Web Services

Composite Web Services (CWS) aggregate multiple Web Services in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic and other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time performance under various loads. Due to the complex interactions of the underlying services, a CWS they can exhibit problematic and often difficult to predict behaviours in overload situations. This paper focuses on the use of request scheduling for improving CWS performance in overload situations. Different scheduling policies are investigated in regards to their effectiveness in helping with bulk arrivals.

Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop

The re-entrant flow shop scheduling problem (RFSP) is regarded as a NP-hard problem and attracted the attention of both researchers and industry. Current approach attempts to minimize the makespan of RFSP without considering the interdependency between the resource constraints and the re-entrant probability. This paper proposed Multi-level genetic algorithm (GA) by including the co-related re-entrant possibility and production mode in multi-level chromosome encoding. Repair operator is incorporated in the Multi-level genetic algorithm so as to revise the infeasible solution by resolving the resource conflict. With the objective of minimizing the makespan, Multi-level genetic algorithm (GA) is proposed and ANOVA is used to fine tune the parameter setting of GA. The experiment shows that the proposed approach is more effective to find the near-optimal schedule than the simulated annealing algorithm for both small-size problem and large-size problem. © 2013 Published by Elsevier Ltd.

Learning Technology in Scheduling Based on the Mixed Graphs

We propose the adaptive algorithm for solving a set of similar scheduling problems using learning technology. It is devised to combine the merits of an exact algorithm based on the mixed graph model and heuristics oriented on the real-world scheduling problems. The former may ensure high quality of the solution by means of an implicit exhausting enumeration of the feasible schedules. The latter may be developed for certain type of problems using their peculiarities. The main idea of the learning technology is to produce effective (in performance measure) and efficient (in computational time) heuristics by adapting local decisions for the scheduling problems under consideration. Adaptation is realized at the stage of learning while solving a set of sample scheduling problems using a branch-and-bound algorithm and structuring knowledge using pattern recognition apparatus.

Practical, Computation Efficient High-Order Neural Network for Rotation and Shift Invariant Pattern Recognition

In this paper, a modification for the high-order neural network (HONN) is presented. Third order networks are considered for achieving translation, rotation and scale invariant pattern recognition. They require however much storage and computation power for the task. The proposed modified HONN takes into account a priori knowledge of the binary patterns that have to be learned, achieving significant gain in computation time and memory requirements. This modification enables the efficient computation of HONNs for image fields of greater that 100 × 100 pixels without any loss of pattern information.

Performance enhancement of asymmetric filtered 40 Gb/s carrier suppressed return to zero-differential phase shift keying receiver in a 50 GHz grid

The authors present the impact of asymmetric filtering of strong (e.g. 35 GHz) optical filters on the performance of 42.7 Gb/s 67% (carrier suppressed return to zero)-differential phase shift keying systems. The performance is examined (in an amplified spontaneous emission (ASE) noise-limited regime and in the presence of chromatic dispersion) when offsetting the filter at the receiver by substantial amounts via balanced, constructive and destructive single-ended detections. It is found that with a slight offset (vestigial side band) or an offset of almost half of the modulation frequency (single-side band), there is a significant improvement in the calculated 'Q'. © The Institution of Engineering and Technology 2013.

The Production Scheduling in Assembly System with Evolutionary Algorithm

In this paper an evolutionary algorithm is proposed for solving the problem of production scheduling in assembly system. The aim of the paper is to investigate a possibility of the application of evolutionary algorithms in the assembly system of a normally functioning enterprise producing household appliances to make the production graphic schedule.

Recent research trend of economic-lot scheduling problems

Purpose - This research note aims to present a summary of research concerning economic-lot scheduling problem (ELSP). Design/methodology/approach - The paper's approach is to review over 100 selected studies published in the last 15 years (1997-2012), which are then grouped under different research themes. Findings - Five research themes are identified and insights for future studies are reported at the end of this paper. Research limitations/implications - The motivation of preparing this research note is to summarize key research studies in this field since 1997, when the ELSP problems have been verified as NP-hard. Originality/value - ELSP is an important scheduling problem that has been studied since the 1950s. Because of its complexity in delivering a feasible analytical closed form solution, many studies in the last two decades employed heuristic algorithms in order to come up with good and acceptable solutions. As a consequence, the solution approaches are quite diversified. The major contribution of this paper is to provide researchers who are interested in this area with a quick reference guide on the reviewed studies. © Emerald Group Publishing Limited.