Particle filter with ant colony optimization for frequency offset estimation in OFDM systems with unknown noise distribution

Orthogonal frequency division multiplexing (OFDM) is sensitive to carrier frequency offset (CFO) that causes inter-carrier interference (ICI). In this paper, a particle filter (PF) method augmented with ant colony optimization (ACO) is developed to estimate the CFO. The ACO for continuous domains is incorporated into PF to optimize the sampling process. Unlike the standard PF, resampling is not required in the method. Moreover, it does not require the noise distribution. Simulation results show that the proposed method is effective when estimating the CFO and can effectively combat the effect of ICI in OFDM systems.     

A comparative study of particle swarm optimization and its variants for phase stability and equilibrium calculations in multicomponent reactive and non-reactive systems

Particle swarm optimization is a novel evolutionary stochastic global optimization method that has gained popularity in the chemical engineering community. This optimization strategy has been successfully used for several applications including thermodynamic calculations. To the best of our knowledge, the performance of PSO in phase stability and equilibrium calculations for both multicomponent reactive and non-reactive mixtures has not yet been reported. This study introduces the application of particle swarm optimization and several of its variants for solving phase stability and equilibrium problems in multicomponent systems with or without chemical equilibrium. The reliability and efficiency of a number of particle swarm optimization algorithms are tested and compared using multicomponent systems with vapor–liquid and liquid–liquid equilibrium. Our results indicate that the classical particle swarm optimization with constant cognitive and social parameters is a reliable method and offers the best performance for global minimization of the tangent plane distance function and the Gibbs energy function in both reactive and non-reactive systems.     

Realization of Multidimensional Digital Transfer Functions with Separable Numerator or Denominator Polynomials

In this paper a straightforward z-domain procedure for realizing multidimensional transfer functions with either numerator or denominator polynomial separable is presented. This procedure yields structures with minimum number of multipliers. It is shown that the number of delay elements can be reduced by selecting the optimum values for certain parameters. To facilitate this theorems that are applicable for some special cases are presented.     

Positive Semidefinite Rank-Based Correlation Matrix Estimation With Application to Semiparametric Graph Estimation

Many statistical methods gain robustness and flexibility by sacrificing convenient computational structures. In this article, we illustrate this fundamental tradeoff by studying a semiparametric graph estimation problem in high dimensions. We explain how novel computational techniques help to solve this type of problem. In particular, we propose a nonparanormal neighborhood pursuit algorithm to estimate high-dimensional semiparametric graphical models with theoretical guarantees. Moreover, we provide an alternative view to analyze the tradeoff between computational efficiency and statistical error under a smoothing optimization framework. Though this article focuses on the problem of graph estimation, the proposed methodology is widely applicable to other problems with similar structures. We also report thorough experimental results on text, stock, and genomic datasets.     

Order sequencing on a unidirectional cyclical picking line

A real life order-picking configuration that requires multiple pickers to cyclically move around fixed locations in a single direction is considered. This configuration is not the same, but shows similarities to, unidirectional carousel systems described in literature. The problem of minimising the pickers’ travel distance to pick all orders on this system is a variant of the clustered travelling salesman problem. An integer programming (IP) formulation of this problem cannot be solved in a realistic time frame for real life instances of the problem. A relaxation of this IP formulation is proposed that can be used to determine a lower bound on an optimal solution. It is shown that the solution obtained from this relaxation can always be transformed to a feasible solution for the IP formulation that is, at most, within one pick cycle of the lower bound. The computational results and performance of the proposed methods as well as adapted order sequencing approaches for bidirectional carousel systems from literature are compared to one another by means of real life historical data instances obtained from a retail distribution centre.     

A review of routing strategies for optical burst switched networks

The exact contribution of this paper is a review of existing state‐of‐the‐art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. Routing schemes are implemented in space domain, which make them simple and cost effective. Additionally, the paper points out the importance of routing as an effective way to deal with burst contention compared to other solutions. It also underlines the main differences between contention avoidance schemes and contention resolution techniques for optical burst switched networks. We believe that this review will help different optical burst switched researchers involved in the development of route optimization algorithms to control burst contention. Copyright © 2011 John Wiley & Sons, Ltd.     

Design of reliable fiber‐based distribution networks modeled by multi‐objective combinatorial optimization

In this work, we investigate the planning of hybrid fiber/very high bit rate digital subscriber line (HFV) access networks. This HFV variant is considered as an alternative to passive optical access network. It consists of implementing optical fibers in the access network part from the central office to the street cabinets, whereas the very high bit rate digital subscriber line technology is used in the last meter part, from street cabinets to subscribers. Firstly, we discuss the different tasks of this planning problem. We model this planning problem as a multi‐objective optimization problem, where different conflicting objectives have to be optimized at the same time. We consider network costs and network reliability. This problem is solved by two different approaches: the classical single‐objective optimization (SOO) and the multi‐objective optimization (MOO), which is a recent optimization approach that is gaining an increasing interest in practical optimization problems. MOO solves the problem by searching for different optimal trade‐offs between the optimization objectives. The performances of SOO and MOO are analyzed and compared with each other using three network instances. Copyright © 2012 John Wiley & Sons, Ltd.     

On the penetration of a rotating impactor into an elastic-plastic medium

This research is devoted to the modeling of high-speed rectilinear penetration of a rigid axisymmetric body (impactor with a flat bluntness) into an elastic–plastic media with account for its rotation about the axis of symmetry. The body has an arbitrary shape of the meridian. The resistance to the motion is represented as the sum of the body drag and the contribution of friction. The dynamic system governing the body motion is derived and the qualitative and numerical analysis of the projectile movement and perforation of a slab are performed. The problem of shape optimization of impactor with a flat bluntness is studied using evolutionary algorithm.