A compact split-step finite difference method for solving the nonlinear Schrödinger equations with constant and variable coefficients

We propose a compact split-step finite difference method to solve the nonlinear Schrödinger equations with constant and variable coefficients. This method improves the accuracy of split-step finite difference method by introducing a compact scheme for discretization of space variable while this improvement does not reduce the stability range and does not increase the computational cost. This method also preserves some conservation laws. Numerical tests are presented to confirm the theoretical results for the new numerical method by using the cubic nonlinear Schrödinger equation with constant and variable coefficients and Gross-Pitaevskii equation.     

Waveguide filter with improved stopband response using transversal slots

In this article, the design and realization of waveguide filter with improved stop‐band response is presented. By inserting transversal slots at the proper position of cavities, without disturbing the field distribution of the dominant mode, the second longitudinal resonant modes are radiated out. This caused the out‐of‐band frequency response of the filter to be improved. The validity of the proposed technique is confirmed by comparison between measurement values and simulation results from the finite element method through the commercial software (high frequency structure simulator). Also, to assure electromagnetic compatibility the slot surfaces are covered by absorbing material. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Dynamic routing of real-time jobs among parallel EDF queues: A performance study

This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all have deadlines until the beginning of service or deadlines until the end of service. Upon arrival, a job joins a queue according to a state-dependent stationary policy, where the state of the system is the number of jobs in each queue. Migration among the queues is not allowed. An important performance measure to consider is the overall loss probability of the system. The system is approximated by a Markovian model in the long run. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results for at least three different stationary policies, we find that the existing errors are relatively small.     

Joint quality control and preventive maintenance strategy for imperfect production processes

In this paper, we develop a joint quality control and preventive maintenance policy for a production system producing conforming and nonconforming units. The considered system consists of one machine which must supply another production line operating on a just-in-time basis. Each lot produced by the machine is subject to a quality control. According to the proportion l of nonconforming units observed and compared to a threshold value l _m , one decides to undertake or not maintenance actions on the system. In order to palliate perturbations caused by the stopping of the machine for preventive and corrective maintenance actions of random durations, a buffer stock h is built up to ensure the continuous supply of the subsequent production line. The proposed strategy is modelled using simulation and experimental design. This approach allows to generate a second order response surface allowing to easily determine the optimal rate, l_m^*{l_{m}^*}, of nonconforming units on the basis of which preventive maintenance actions should be performed, and the optimal size, h*, of the buffer stock to be built. These values minimize the total cost per time unit which includes the costs related to maintenance, quality and inventory.     

The multi-agent programming contest from 2005–2010

The Multi-Agent Programming Contest is an annual international event on programming multi-agent systems: Teams of agents participate in a simulated cooperative scenario. It started in 2005 and is organised in 2010 for the sixth time. The contest is an attempt to stimulate research in the area of multi-agent system development and programming by (i) identifying key problems in the field and (ii) collecting suitable benchmarks that can serve as milestones for testing multi-agent programming languages, platforms and tools. This article provides a short history of the contest since it started and reports in more detail on the cows and cowboys scenario implemented for the 2008, 2009 and 2010 contest editions. We briefly discuss the underlying technological background and conclude with a critical discussion of the experiences and lessons learned.     

The voting analytic hierarchy process method for discriminating among efficient decision making units in data envelopment analysis

Making optimal use of available resources has always been of interest to humankind, and different approaches have been used in an attempt to make maximum use of existing resources. Limitations of capital, manpower, energy, etc., have led managers to seek ways for optimally using such resources. In fact, being informed of the performance of the units under the supervision of a manager is the most important task with regard to making sensible decisions for managing them. Data envelopment analysis (DEA) suggests an appropriate method for evaluating the efficiency of homogeneous units with multiple inputs and multiple outputs. DEA models classify decision making units (DMUs) into efficient and inefficient ones. However, in most cases, managers and researchers are interested in ranking the units and selecting the best DMU. Various scientific models have been proposed by researchers for ranking DMUs. Each of these models has some weakness(es), which makes it difficult to select the appropriate ranking model. This paper presents a method for ranking efficient DMUs by the voting analytic hierarchy process (VAHP). The paper reviews some ranking models in DEA and discusses their strengths and weaknesses. Then, we provide the method for ranking efficient DMUs by VAHP. Finally we give an example to illustrate our approach and then the new method is employed to rank efficient units in a real world problem.     

Stochastic chaos synchronization using Unscented Kalman-Bucy Filter and sliding mode control

This paper presents an algorithm for synchronizing two different chaotic systems by using a combination of Unscented Kalman-Bucy Filter (UKBF) and sliding mode controller. It is assumed that the drive chaotic system is perturbed by white noise and shows stochastic chaotic behavior. In addition the output of the system does not contain the whole state variables of the system, and it is also affected by some independent white noise. By combining the UKBF and the sliding mode control, a synchronizing control law is proposed. Simulation results show the ability of the proposed method in synchronizing chaotic systems in presence of noise.     

He’s homotopy perturbation method: A strongly promising method for solving non-linear systems of the mixed Volterra–Fredholm integral equations

In this paper, He’s homotopy perturbation method is applied to solve non-linear systems of mixed Volterra–Fredholm integral equations. Two examples are presented to illustrate the ability of the method. Also comparisons are made between the Adomian decomposition method and the homotopy perturbation method. The results reveal that He’s homotopy perturbation method is very effective and simple and in these examples leads to the exact solutions.     

Heuristics for the variable sized bin-packing problem

We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this problem are presented and compared. We analyze their empirical performance on a large set of randomly generated test instances with up to 2000 items and seven bin types. The first contribution of this paper is to provide evidence that a set covering heuristic proves to be highly effective and capable of delivering very-high quality solutions within short CPU times. In addition, we found that a simple subset-sum problem-based heuristic consistently outperforms heuristics from the literature while requiring extremely short CPU times.