A heuristic method for the vehicle routing problem with mixed deliveries and pickups

The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem, called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest that this approach can yield good results.     

Log-based mining techniques applied to Web service composition reengineering

Web service compositions are becoming more and more complex, involving numerous interacting ad-hoc services. These services are often implemented as business processes themselves. By analysing such complex web service compositions one is able to better understand, control and eventually re-design them. Our contribution to this problem is a mining algorithm, based on a statistical technique to discover composite web service patterns from execution logs. Our approach is characterised by a “local” pattern’s discovery that covers partial results through a dynamic programming algorithm. Those locally discovered patterns are then composed iteratively until the composite Web service is discovered. The analysis of the disparities between the discovered model and the initial ad-hoc composite model (delta-analysis) enables initial design gaps to be detected and thus to re-engineer the initial Web service composition.     

Degenerative process and cell death in salivary glands of Rhipicephalus sanguineus (Latreille, 1806) (Acari: Ixodidae) semi-engorged female exposed to the acaricide permethrin

Ticks are ectoparasites of great medical and veterinary importance around the world and synthetic chemicals such as permethrin have been used for their control. This study provides a cytochemistry analysis of both degenerative and cell death processes in salivary glands of the brown dog tick Rhipicephalus sanguineus semi-engorged females exposed to 206, 1,031, and 2,062 ppm of permethrin. The results presented herein demonstrate that permethrin is a potent chemical acaricide that would act on the glandular tissue's morphophysiology in this tick species by eliciting severe changes in the acinus shape, intense vacuolation of the acinar cells' cytoplasm, marked glandular tissue disorganization, culminating in an advanced degenerative stage with consequent formation of many apoptotic bodies (cell death). In addition, permethrin induced major changes in the acinar cells' nucleus, such as a change both in its shape and size, chromatin marginalization, nuclear fragmentation, and appearance of picnotic nuclei, especially when the highest concentrations of the product were used. Thus, permethrin induced early degeneration of this tissue characterized by significant changes in the structure of acinar cells and production of enzymes related to the cell death process, in addition to interfering directly in the genetic material of these cells.     

Causality, conditional independence, and graphical separation in settable systems

We study the connections between causal relations and conditional independence within the settable systems extension of the Pearl causal model (PCM). Our analysis clearly distinguishes between causal notions and probabilistic notions, and it does not formally rely on graphical representations. As a foundation, we provide definitions in terms of suitable functional dependence for direct causality and for indirect and total causality via and exclusive of a set of variables. Based on these foundations, we provide causal and stochastic conditions formally characterizing conditional dependence among random vectors of interest in structural systems by stating and proving the conditional Reichenbach principle of common cause, obtaining the classical Reichenbach principle as a corollary. We apply the conditional Reichenbach principle to show that the useful tools of d-separation and D-separation can be employed to establish conditional independence within suitably restricted settable systems analogous to Markovian PCMs.     

Layered Working-Set Trees

The working-set bound [Sleator and Tarjan in J. ACM 32(3), 652–686, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense, while data structures that are not binary search trees are known to have this property in the worst case. We close this gap and present a binary search tree called a layered working-set tree that guarantees the working-set property in the worst case. The unified bound [B?doiu et al. in Theor. Comput. Sci. 382(2), 86–96, 2007] roughly states that searching for an element is fast if it is near (in terms of rank distance) to a recently accessed element. We show how layered working-set trees can be used to achieve the unified bound to within a small additive term in the amortized sense while maintaining in the worst case an access time that is both logarithmic and within a small multiplicative factor of the working-set bound.     

A novel image encryption/decryption scheme based on chaotic neural networks

This paper presents a novel image encryption/decryption algorithm based on chaotic neural network (CNN). The employed CNN is comprised of two 3-neuron layers called chaotic neuron layer (CNL) and permutation neuron layer (PNL). The values of three RGB (Red, Green and Blue) color components of image constitute inputs of the CNN and three encoded streams are the network outputs. CNL is a chaotic layer where, three well-known chaotic systems i.e. Chua, Lorenz and Lü systems participate in generating weights and biases matrices of this layer corresponding to each pixel RGB features. Besides, a chaotic tent map is employed as the activation function of this layer, and makes the relationship between the plain image and cipher image nonlinear. The output of CNL, i.e. the diffused information, is the input of PNL, where three-dimensional permutation is applied to the diffused information. The overall process is repeated several times to make the encryption process more robust and complex. A 160-bit-long authentication code has been used to generate the initial conditions and the parameters of the CNL and PNL. Some security analysis are given to demonstrate that the key space of the new algorithm is large enough to make brute-force attacks infeasible and simulations have been carried out with detailed numerical analysis, demonstrating the high security of the new image encryption scheme.     

Fault diagnosis and accommodation of nonlinear systems based on multiple-model adaptive unscented Kalman filter and switched MPC and H-infinity loop-shaping controller

In this paper, a new active fault tolerant control (AFTC) methodology is proposed based on a state estimation scheme for fault detection and identification (FDI) to deal with the potential problems due to possible fault scenarios. A bank of adaptive unscented Kalman filters (AUKFs) is used as a core of FDI module. The AUKF approach alleviates the inflexibility of the conventional UKF due to constant covariance set up, leading to probable divergence. A fuzzy-based decision making (FDM) algorithm is introduced to diagnose sensor and/or actuator faults. The proposed FDI approach is utilized to recursively correct the measurement vector and the model used for both state estimation and output prediction in a model predictive control (MPC) formulation. Robustness of the proposed FTC system, H_∞ optimal robust controller and MPC are combined via a fuzzy switch that is used for switching between MPC and robust controller such that FTC system is able to maintain the offset free behavior in the face of abrupt changes in model parameters and unmeasured disturbances. This methodology is applied on benchmark three-tank system; the proposed FTC approach facilitates recovery of the closed loop performance after the faults have been isolated leading to an offset free behavior in the presence of sensor/actuator faults that can be either abrupt or drift change in biases. Analysis of the simulation results reveals that the proposed approach provides an effective method for treating faults (biases/drifts in sensors/actuators, changes in model parameters and unmeasured disturbances) under the unified framework of robust fault tolerant control.     

Impact of the Boeing 767 Aircraft into the World Trade Center

A numerical simulation of the aircraft impact into the exterior columns of the World Trade Center (WTC) was done using LS-DYNA. For simplification, the fuselage was modeled as a thin-walled cylinder, the wings were modeled as box beams with a fuel pocket, and the engines were represented as rigid cylinders. The exterior columns of the WTC were represented as box beams. Actual masses, material properties and dimensions of the Boeing 767 aircraft and the exterior columns of the WTC were used in this analysis. It was found that about 46% of the initial kinetic energy of the aircraft was used to damage columns. The minimum impact velocity of the aircraft to just penetrate the exterior columns would be 130?m/s. It was also found that a Boeing 767 traveling at top speed would not penetrate exterior columns of the WTC if the columns were thicker than 20?mm.     

Integrated Mobility and QoS Control in Cellular Wireless ATM Networks

This paper presents a traversed pathtracking-based technique for integrated mobility andquality-of-service (QoS) management of connections incellular wireless ATM networks. Simulation andanalytical results for probabilities of connectionBlocking, Dropping, and Unsuccessful Connections aredetermined. A distributed operating system-basedarchitecture for implementation of integrated mobilityand QoS control is then proposed. The objective is totreat mobility as a network impairment triggeredactivity which is to be handled via QoS management.Depending on the speed of the mobile unit and thecategory of service being used, the QoS of a connectionmay or may not vary continuously during a session. Theresults presented here consider coexistence of constantbit-rate and nonreal-time variable bitrate ATM connections over a single session.