Error-correcting codes on a Bethe-like lattice

We analyse Gallager codes by employing a simple mean-field approximation that distorts the model geometry and preserves important interactions between sites. The method naturally recovers the probability propagation decoding algorithm as a minimization of a proper free-energy. We find a thermodynamical phase transition that coincides with information theoretical upper-bounds and explain the practical code performance in terms of the free-energy landscape.

Lattice approach to the dynamics of phase-coded soliton trains

We address the collective dynamics of a soliton train propagating in a medium described by the nonlinear Schrödinger equation. Our approach uses the reduction of train dynamics to the discrete complex Toda chain (CTC) model for the evolution of parameters for each train constituent: such a simplification allows one to carry out an approximate analysis of the dynamics of positions and phases of individual interacting pulses. Here, we employ the CTC model to the problem which has relevance to the field of fibre optics communications where each binary digit of transmitted information is encoded via the phase difference between the two adjacent solitons. Our goal is to elucidate different scenarios of the train distortions and the subsequent information garbling caused solely by the intersoliton interactions. First, we examine how the structure of a given phase pattern affects the initial stage of the train dynamics and explain the general mechanisms for the appearance of unstable collective soliton modes. Then we further discuss the nonlinear regime concentrating on the dependence of the Lax scattering matrix on the input phase distribution; this allows one to classify typical features of the train evolution and determine the distance where the soliton escapes from its slot. In both cases, we demonstrate deep mathematical analogies with the classical theory of crystal lattice dynamics.

Lattice approach to the dynamics of phase-coded soliton trains

We address the collective dynamics of a soliton train propagating in a medium described by the nonlinear Schrödinger equation. Our approach uses the reduction of train dynamics to the discrete complex Toda chain (CTC) model for the evolution of parameters for each train constituent: such a simplification allows one to carry out an approximate analysis of the dynamics of positions and phases of individual interacting pulses. Here, we employ the CTC model to the problem which has relevance to the field of fibre optics communications where each binary digit of transmitted information is encoded via the phase difference between the two adjacent solitons. Our goal is to elucidate different scenarios of the train distortions and the subsequent information garbling caused solely by the intersoliton interactions. First, we examine how the structure of a given phase pattern affects the initial stage of the train dynamics and explain the general mechanisms for the appearance of unstable collective soliton modes. Then we further discuss the nonlinear regime concentrating on the dependence of the Lax scattering matrix on the input phase distribution; this allows one to classify typical features of the train evolution and determine the distance where the soliton escapes from its slot. In both cases, we demonstrate deep mathematical analogies with the classical theory of crystal lattice dynamics.

Anisotropic model of kinetic roughening:he strong-coupling regime

We study the strong coupling (SC) limit of the anisotropic Kardar-Parisi-Zhang (KPZ) model. A systematic mapping of the continuum model to its lattice equivalent shows that in the SC limit, anisotropic perturbations destroy all spatial correlations but retain a temporal scaling which shows a remarkable crossover along one of the two spatial directions, the choice of direction depending on the relative strength of anisotropicity. The results agree with exact numerics and are expected to settle the long-standing SC problem of a KPZ model in the infinite range limit. © 2007 The American Physical Society.

A fuzzy AHP based integer linear programming model for the multi-criteria transshipment problem

Purpose – The purpose of this research is to develop a holistic approach to maximize the customer service level while minimizing the logistics cost by using an integrated multiple criteria decision making (MCDM) method for the contemporary transshipment problem. Unlike the prevalent optimization techniques, this paper proposes an integrated approach which considers both quantitative and qualitative factors in order to maximize the benefits of service deliverers and customers under uncertain environments. Design/methodology/approach – This paper proposes a fuzzy-based integer linear programming model, based on the existing literature and validated with an example case. The model integrates the developed fuzzy modification of the analytic hierarchy process (FAHP), and solves the multi-criteria transshipment problem. Findings – This paper provides several novel insights about how to transform a company from a cost-based model to a service-dominated model by using an integrated MCDM method. It suggests that the contemporary customer-driven supply chain remains and increases its competitiveness from two aspects: optimizing the cost and providing the best service simultaneously. Research limitations/implications – This research used one illustrative industry case to exemplify the developed method. Considering the generalization of the research findings and the complexity of the transshipment service network, more cases across multiple industries are necessary to further enhance the validity of the research output. Practical implications – The paper includes implications for the evaluation and selection of transshipment service suppliers, the construction of optimal transshipment network as well as managing the network. Originality/value – The major advantages of this generic approach are that both quantitative and qualitative factors under fuzzy environment are considered simultaneously and also the viewpoints of service deliverers and customers are focused. Therefore, it is believed that it is useful and applicable for the transshipment service network design.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.