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.     

A modified particle swarm optimization for economic dispatch with non-smooth cost functions

This paper presents a new approach to economic dispatch (ED) problems with non-smooth cost functions using a particle swarm optimization (PSO) technique. The practical ED problems have non-smooth cost functions with equality and inequality constraints, which makes the problem of finding the global optimum difficult when using any mathematical approaches. Since, standard PSO may converge at the early stage, in this paper, a modified PSO (MPSO) mechanism is suggested to deal with the equality and inequality constraints in the ED problems. To validate the results obtained by MPSO, standard particle swarm optimization (PSO) and guaranteed convergence particle swarm optimization (GCPSO) are applied for comparison. Also, the results obtained by MPSO, PSO and GCPSO are compared with the previous approaches reported in the literature. The results show that the MPSO produces optimal or nearly optimal solutions for the study systems.     

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.     

An artificial neural network (p, d, q) model for timeseries forecasting

Artificial neural networks (ANNs) are flexible computing frameworks and universal approximators that can be applied to a wide range of time series forecasting problems with a high degree of accuracy. However, despite all advantages cited for artificial neural networks, their performance for some real time series is not satisfactory. Improving forecasting especially time series forecasting accuracy is an important yet often difficult task facing forecasters. Both theoretical and empirical findings have indicated that integration of different models can be an effective way of improving upon their predictive performance, especially when the models in the ensemble are quite different. In this paper, a novel hybrid model of artificial neural networks is proposed using auto-regressive integrated moving average (ARIMA) models in order to yield a more accurate forecasting model than artificial neural networks. The empirical results with three well-known real data sets indicate that the proposed model can be an effective way to improve forecasting accuracy achieved by artificial neural networks. Therefore, it can be used as an appropriate alternative model for forecasting task, especially when higher forecasting accuracy is needed.     

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.     

Nadir compromise programming: A model for optimization of multi-objective portfolio problem

In problem of portfolio selection, financial Decision Makers (DMs) explain objectives and investment purposes in the frame of multi-objective mathematic problems which are more consistent with decision making realities. At present, various methods have introduced to optimize such problems. One of the optimization methods is the Compromise Programming (CP) method. Considering increasing importance of investment in financial portfolios, we propose a new method, called Nadir Compromising Programming (NCP) by expanding a CP-based method for optimization of multi-objective problems. In order to illustrate NCP performance and operational capability, we implement a case study by selecting a portfolio with 35 stock indices of Iran stock market. Results of comparing the CP method and proposed method under the same conditions indicate that NCP method results are more consistent with DM purposes.     

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.