On the stability issues of switched singular time‐delay systems with slow switching based on average dwell‐time

The issue of exponential stability analysis of continuous‐time switched singular systems consisting of a family of stable and unstable subsystems with time‐varying delay is investigated in this paper. It is very difficult to analyze the stability of such systems because of the existence of time‐delay and unstable subsystems. In this regard, on the basis of the free‐weighting matrix approach, by constructing the new Lyapunov‐like Krasovskii functional, and using the average dwell‐time approach, delay‐dependent sufficient conditions are derived and formulated in terms of LMIs to check the exponential stability of such systems. This paper also highlights the relationship between the average dwell‐time of the switched singular time‐delay system, its stability, exponential convergence rate of differential states, and algebraic states. Finally, a numerical example is given to confirm the analytical results and illustrate the effectiveness of the proposed strategy. Copyright © 2012 John Wiley & Sons, Ltd.     

A model for the adsorption of single metal ion solutes in aqueous solution onto activated carbon produced from pecan shells

Adsorption isotherms for activated carbon made from pecan shells have been obtained at 25 °C and an approximate pH of 3 for a number of metal ion solutes. It was found that the Slips and Freundlich equations were satisfactory for explaining the experimental data. The correlation of metal ion adsorption with the solute parameters of metal ion electronegativity and first stability constant of the metal hydroxide was investigated. In the case of most of the metal ions studied, higher electronegativities and stability constants corresponded to the higher adsorption levels of metal ions onto the activated carbon. A correlation was developed that predicts the constants of the Freundlich equation from the selected parameters of the metal ions, and thus can predict the adsorption isotherms at constant pH. The developed correlation gives results with acceptable deviations from experimental data. A procedure is proposed for obtaining similar correlations for different conditions (temperature, pH, carbon type and dosage). The ratio of equivalent metal ions adsorbed to protons released is calculated for the studied metal ions over a range of concentrations. In most cases, particularly at low concentrations, this ratio is close to one, confirming that ion exchange of one proton with one equivalent metal ion is the dominant reaction mechanism.     

Quantifying nonclassicality of correlations based on the concept of nondisruptive local state identification

A bipartite state is classical with respect to party A if and only if party A can perform nondisruptive local state identification (NDLID) by a projective measurement. Motivated by this we introduce a class of quantum correlation measures for an arbitrary bipartite state. The measures utilize the general Schatten p-norm to quantify the amount of departure from the necessary and sufficient condition of classicality of correlations provided by the concept of NDLID. We show that for the case of Hilbert–Schmidt norm, i.e., \(p=2\), a closed formula is available for an arbitrary bipartite state. The reliability of the proposed measures is checked from the information-theoretic perspective. Also, the monotonicity behavior of these measures under LOCC is exemplified. The results reveal that for the general pure bipartite states these measures have an upper bound which is an entanglement monotone in its own right. This enables us to introduce a new measure of entanglement, for a general bipartite state, by convex roof construction. Some examples and comparison with other quantum correlation measures are also provided.     

Using mobile node speed changes for movement direction change prediction in a realistic category of mobility models

In order to evaluate performance of protocols for ad hoc networks, the protocols have to be tested under realistic conditions. These conditions may include a reasonable transmission range, a limited buffer size, and realistic movement of mobile users (mobility models). In this paper, we propose a new and realistic type of random mobility models in which the mobile node has to decelerate to reach the point of direction change and accelerates with a defined acceleration to reach its intended speed. This realistic mobility model is proposed based on random mobility models. In reality, mobile objects tend to change their speed when they are going to change their direction, i.e. decelerate when approaching a direction change point and accelerate when they start their movement in a new direction. Therefore, in this paper, we implement this behavior in random mobility models which lack such specification. In fact, this paper represents our effort to use this accelerated movement to anticipate a probable direction change of a mobile node with reasonable confidence. The simulation type of this paper is based on traces produced by a mobility trace generator tool. We use a data mining concept called association rule mining to find any possible correlations between accelerated movement of mobile node and the probability that mobile node wants to change its direction. We calculate confidence and lift parameters for this matter, and simulate this mobility model based on random mobility models. These simulations show a meaningful correlation between occurrence of an accelerated movement and event of mobile node's direction change.     

Efficient iterative solutions to general coupled matrix equations

Linear matrix equations are encountered in many systems and control applications.In this paper,we consider the general coupled matrix equations（including the generalized coupled Sylvester matrix equations as a special case）l t=1EstYtFst = Gs,s = 1,2,···,l over the generalized reflexive matrix group（Y1,Y2,···,Yl）.We derive an efcient gradient-iterative（GI） algorithm for fnding the generalized reflexive solution group of the general coupled matrix equations.Convergence analysis indicates that the algorithm always converges to the generalized reflexive solution group for any initial generalized reflexive matrix group（Y1（1）,Y2（1）,···,Yl（1））.Finally,numerical results are presented to test and illustrate the performance of the algorithm in terms of convergence,accuracy as well as the efciency.     

A hybrid metaheuristic approach for the capacitated p-median problem

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from the current solution to a neighbor solution, an open median is selected and closed. Then, a linear programming (LP) model is generated by relaxing binary constraints and adding new constraints. The generated LP solution is improved using cutting-plane inequalities. The solution of this strong LP is considered as a new neighbor solution. In order to select an open median to be closed, several strategies are proposed. The neighborhood structure is combined with a tabu search algorithm in the proposed approach. The parameters of the proposed hybrid algorithm are tuned using design of experiments approach. The proposed algorithm is tested on several sets of benchmark instances. The statistical analysis shows efficiency and effectiveness of the hybrid algorithm in comparison with the best approach found in the literature.     

Transparent autonomization in CORBA

Increasingly, software systems are constructed by integrating and composing multiple existing applications. The resulting complexity increases the need for self-management of the system. However, adding autonomic behavior to composite systems is difficult, especially when the constituent components are heterogeneous and they were not originally designed to support such interactions. Moreover, entangling the code for self-management with the code for the business logic of the original applications may actually increase the complexity of the systems, counter to the desired goal. In this paper, we address autonomization of composite systems that use CORBA, one of the first widely used middleware platforms introduced more than 17 years ago that is still commonly used in numerous systems. We propose a model, called Adaptive CORBA Template (ACT), that enables autonomic behavior to be added to CORBA applications automatically and transparently, that is, without requiring any modifications to the code implementing the business logic of the original applications. To do so, ACT uses “generic” interceptors, which are added to CORBA applications at startup time and enable autonomic behavior to be introduced later at runtime. We have developed ACT/J, a prototype of ACT in Java. We describe a case study in which ACT/J is used to introduce three types of autonomic behavior (self-healing, self-optimization, and self-configuration) to a distributed surveillance application.     

Multidisciplinary design optimization of a small solid propellant launch vehicle using system sensitivity analysis

Multidisciplinary design optimization approaches have significant effects on aerospace vehicle design methodology. In designing next generation of space launch systems, MDO processes will face new and greater challenges. This study develops a system sensitivity analysis method to optimize multidisciplinary design of a two-stage small solid propellant launch vehicle. Suitable design variables, technological, and functional constraints are considered. Appropriate combinations of disciplines such as propulsion, weight, geometry, and trajectory simulation are used. A generalized sensitivity equation is developed and solved. These results are basis for optimization. Comparison of the developed approach with gradient optimization methods reveals that developed approach requires less computation time.