A heuristic to solve the synchronized log-truck scheduling problem

We present a synchronized routing and scheduling problem that arises in the forest industry, as a variation of the log-truck scheduling problem. It combines routing and scheduling of trucks with specific constraints related to the Canadian forestry context. This problem includes aspects such as pick-up and delivery, multiple products, inventory stock, multiple supply points and multiple demand points. We developed a decomposition approach to solve the weekly problem in two phases. In the first phase we use a MIP solver to solve a tactical model that determines the destinations of full truckloads from forest areas to woodmills. In the second phase, we make use of two different methods to route and schedule the daily transportation of logs: the first one consists in using a constraint-based local search approach while the second one is a hybrid approach involving a constraint programming based model and a constraint-based local search model. These approaches have been implemented using COMET2.0. The method, was tested on two industrial cases from forest companies in Canada.     

The influence of solid-phase concentration on the performance of electrorheological fluids in dynamic squeeze flow

The yield stress of electrorheological (ER) fluids increases by orders of magnitude when electric field is applied across them. In the absence of the field, ER fluids behave as Newtonian fluids. This paper is concerned with an experimental investigation to determine the rheological performance of ER fluids, consisting of a dielectric liquid carrier with a range of solid-phase concentration. The ER fluid was contained in a squeeze cell, which during motion subjects the fluid to both compressive and tensile loading. The results were analysed in terms of the capacity for the transmission of imposed forces across the fluid and showed a great dependence on the applied D.C voltage and the weight fraction of the dispersed solid-phase. In addition, the implications of the results to vibration control, where the ER fluid is employed in an engine mount, are discussed.     

Multilayer Transitions in Spin-3/2 Blume–Capel Model with RKKY Interaction in a Transverse Field

Using mean-field theory, we have studied the effect of quantum transverse field on the magnetic properties and multilayer transitions in the spin-3/2 Blume–Capel model with RKKY interaction. The system is formed by two magnetic multilayer materials, of different thicknesses, separated by a non magnetic spacer of thickness M. It is found that there exist critical transverse fields above which the multilayer transitions occur. This critical value decreases when increasing the thickness of the nonmagnetic spacer M. Phase diagram is established in different plane of space parameter.     

Effect of phosphoric acid on the performance of low antimony grid of Pb‐acid cell under constant current charging and discharging

Effect of phosphoric acid on the performance of Pb‐1.7%Sb grid of lead‐acid cell is studied in 5 M H₂SO₄ by cyclic galvanostatic polarization and impedance spectroscopy. An increase in capacitance to a maximum is recorded during the initial stages of the electro‐reduction of PbO₂ into Pb(II) compounds and attributed to concurrent compositional and dimensional changes. These changes include removal of O₂ bubbles, insertion of large amounts of H₂SO₄ and H₂O. Efficiency of PbO₂ formation decreases, while its rate of self‐discharge increases with increasing the charging current and in the presence of H₃PO₄. The charge capacity increases with increasing the discharging current due to the decrease in the self‐discharge. The charge capacity is lower in the presence of H₃PO₄. On increasing the cycle number, the corrodibility of the grid increases, because more layers of the surface Pb are involved in the self‐discharge. H₃PO₄ significantly retards the effect of cycle number.     

Optimal power flow using differential evolution algorithm

This paper presents an efficient and reliable evolutionary-based approach to solve the optimal power flow (OPF) problem. The proposed approach employs differential evolution algorithm for optimal settings of OPF problem control variables. The proposed approach is examined and tested on the standard IEEE 30-bus test system with different objectives that reflect fuel cost minimization, voltage profile improvement, and voltage stability enhancement. The proposed approach results are compared with the results reported in the literature. The results show the effectiveness and robustness of the proposed approach.     

On the design of algebraic space-time codes for MIMO block-fading channels

The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space-time codes by Tarokh et al. (see ibid., vol.44, p.744-765, Mar. 1998) Most prior works on space-time code design have considered quasi-static fading channels. We extend our earlier work on algebraic space-time coding to block-fading channels. First, we present baseband design criteria for space-time codes in multi-input multi-output (MIMO) block-fading channels that encompass as special cases the quasi-static and fast fading design rules. The diversity advantage baseband criterion is then translated into binary rank criteria for phase shift keying (PSK) modulated codes. Based on these binary criteria, we construct algebraic space-time codes that exploit the spatial and temporal diversity available in MIMO block-fading channels. We also introduce the notion of universal space-time codes as a generalization of the smart-greedy design rule. As a part of this work, we establish another result that is important in its own right: we generalize the full diversity space-time code constructions for quasi-static channels to allow for higher rate codes at the expense of minimal reductions in the diversity advantage. Finally, we present simulation results that demonstrate the excellent performance of the proposed codes.     

A unified framework for tree search decoding: rediscovering the sequential decoder

We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm is decomposed into the preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. We argue that the forward and feedback (matrix) filters of the minimum mean-square error decision feedback equalizer (MMSE-DFE) are instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for solving underdetermined linear systems and using lattice reduction methods to diminish complexity, at the expense of a marginal performance loss. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well-known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.     

Improved Turbo Decoding Using Soft Combining Principle

One great challenge in wireless communication systems is to ensure reliable communications. Turbo codes are known by their interesting capabilities to deal with transmission errors. In this paper, we present a novel turbo decoding scheme based on soft combining principle. Our method improves decoding performance using soft combining technique inside the turbo decoder. Working on Max-Log-Maximum a Posteriori (Max-Log-MAP) turbo decoding algorithm and using an Additive White Gaussian Noise (AWGN) channel model and 16 Quadrature Amplitude Modulation (16QAM), simulation results show that the suggested solution is efficient and outperforms the conventional Max-Log-MAP algorithm in terms of Bit Error Rate (BER). The performance analysis is carried out in terms of BER by varying parameters such as the Energy per bit to Noise power spectral density ratio ( \(\text {E}_{\text {b}}/\text {N}_{\text {o}}\) ), and decoding iterations number. We call our proposed solution Soft Combined Turbo Codes.     

A Multichannel QoS MAC with Dynamic Transmit Opportunity for VANets

One of the most challenging issues facing vehicular networks lies in the design of an efficient MAC protocol due to the mobile nature of nodes and the interference associated with the dynamic environment. Moreover delay constraints for safety applications add complexity and latency requirements to the design. Existing MAC protocols overcome some challenges however don’t provide an integrated solution. Hence, the merit if this work lies in designing an efficient MAC protocol that incorporates various VANet’s challenges in a complete end-to-end solution. In this work, we propose an efficient Multichannel QoS Cognitive MAC (MQOG). MQOG assesses the quality of channel prior to transmission employing dynamic channel allocation and negotiation algorithms to achieve significant increase in channel reliability, throughput and delay constraints while simultaneously addressing Quality of Service. The uniqueness of MQOG lies in making use of the free unlicensed bands. The proposed protocols were implemented in OMNET++ 4.1, and extensive experiments demonstrated a faster and more efficient reception of safety messages compared to existing VANet MAC Protocols. Finally, improvements in delay, packet delivery ratios and throughput were captured.     

Traffic classification and scheduling in ATM networks

Virtual paths (VPs) are an integral part of the resource management and control hierarchy of ATM (asynchronous transfer mode) networks. To improve the utilization of network resources and facilitate management and control, source types are organized into traffic classes. Each traffic class is transported by its own virtual path subnetwork. In this paper, we consider issues related to the design of traffic classes. We consider an ATM switch node to which cells arrive from a diverse set of source types. Traffic classes are assumed to be served according to a weighted round robin policy, while cells belonging to a given traffic class are served in first-come-first-served order. We consider the problem of determining the optimal set of traffic classes. Under suitable simplifying assumptions, it is shown that the above problem can be modeled as a set-partitioning problem. The structure of the problem at hand is then exploited to develop an efficient heuristic. Several examples are given to illustrate the developed methodology.Supported partially through NSF Grant NCR-891447 and AT&T Grant 5-23690.