MicroPort: A general simulation platform for seaport container terminals

Seaport container terminals are essential nodes in sea cargo transportation networks. As such, the operational efficiency of container terminals in handling containers passing through them plays a critical role in a globalized world economy. Many models and algorithms have been developed to address various decision problems in container terminals to help improve operational efficiency. These decision support tools are usually used separately for specific purposes. However, the problems they are trying to tackle are often interrelated. Therefore, in this regard, an evaluation tool which can capture as many operational conditions as possible for different decision problems is necessary. This paper introduces a general simulation platform, named MicroPort, which aims to provide an integrated and flexible modeling system for evaluating the operational capability and efficiency of different designs of seaport container terminals. The software structure of MicroPort comprises three programming layers: (1) the Functions layer; (2) the Applications layer; and (3) the Extensions layer. Different layers are bound by Application Programming Interfaces (APIs). Basic functions built in the Functions layer support the Applications layer in which major operation processes can be modeled by an agent-based method. External modules and decision support tools in the Extensions layer then use APIs to adjust the system to produce suitable simulation models for specific purposes.     

Dependence tree structure estimation via copula

We propose an approach for dependence tree structure learning via copula. A nonparametric algorithm for copula estimation is presented. Then a Chow-Liu like method based on dependence measure via copula is proposed to estimate maximum spanning bivariate copula associated with bivariate dependence relations. The main advantage of the approach is that learning with empirical copula focuses on dependence relations among random variables, without the need to know the properties of individual variables as well as without the requirement to specify parametric family of entire underlying distribution for individual variables. Experiments on two real-application data sets show the effectiveness of the proposed method.     

Optimal Performance in Tracking Stochastic Signal Under Disturbance Rejection

The analysis method of optimal tracking performance is proposed for multiple‐input multiple‐output (MIMO) linear time‐invariant (LTI) systems under disturbance rejection. An H₂ criterion of the error signal between the output of the plant and the reference signal is used as a measure for the tracking performance. Spectral factorization is applied to obtain the optimal solution of the system tracking error. The explicit expressions are derived for this minimal tracking error with respect to random reference signals under disturbance rejection. It is shown that the nonminimum phase zeros, the zero direction, the unstable poles, the pole direction of a given plant, statistical characteristics of the reference input signal, and disturbance signal have a negative effect on a feedback system's ability to reduce the system error with disturbance rejection. The results show that the optimal tracking performance will further be damaged because of disturbance rejection. Some typical examples are given to illustrate the theoretical results.     

Stabilization of impulsive hybrid systems using quantized input and output feedback

In this paper, we consider the feedback stabilization of impulsive control systems with quantized input and output signals. To study the problem, the notions of quasi‐invariant sets and attracting sets for impulsive systems with quantization are introduced first, and then applied to the control design. Hybrid quantized control schemes are proposed to stabilize the considered impulsive linear or nonlinear systems via either input or output feedback. Mathematical analysis and numerical simulations are given to show the principle and effectiveness of the proposed designs. Copyright © 2011 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

A Polynomial Algorithm for Computing Elementary Siphons in a Class of Petri Nets

A set of elementary siphons plays a key role in the development of deadlock prevention policies for automated manufacturing systems. This paper addresses the computation problem for elementary siphons in a subclass of Petri nets which are basic systems of simple sequential processes with resources (BS³PR) and can model many automated manufacturing systems. An algorithm for enumerating elementary siphons is established by the one‐to‐one relationship between maximal perfect resource‐transition circuits (MPCs) and strict minimal siphons. A set of MPCs is first computed, followed by a set of elementary siphons in a BS³PR. The presented algorithm is proved to have polynomial‐time complexity. An example is used to illustrate the algorithm.     

A new admissibility condition of discrete-time singular systems with time-varying delays

This paper gives a novel delay-dependent admissibility condition of discrete-time singular systems with time-varying delays. For convenience, the time-varying delay is assumed to be the sum of delay lower bound and the integral multiples of a constant delay. Specially, if the constant delay is of unit length, the delay is an interval-like time-varying delay. The proposed admissibility condition is presented and expressed in terms of linear matrix inequality (LMI) by Lyapunov approach. Generally, the uncertainty of time-varying delay would lead to conservatism. In this paper, this critical issue is tackled by accurately estimating the time-varying delay. Consequently, the proposed admissibility condition is less conservative than the existing results, which is demonstrated by a numerical example.     

Financial distress prediction using support vector machines: Ensemble vs. individual

Financial distress prediction (FDP) is of great importance to both inner and outside parts of companies. Though lots of literatures have given comprehensive analysis on single classifier FDP method, ensemble method for FDP just emerged in recent years and needs to be further studied. Support vector machine (SVM) shows promising performance in FDP when compared with other single classifier methods. The contribution of this paper is to propose a new FDP method based on SVM ensemble, whose candidate single classifiers are trained by SVM algorithms with different kernel functions on different feature subsets of one initial dataset. SVM kernels such as linear, polynomial, RBF and sigmoid, and the filter feature selection/extraction methods of stepwise multi discriminant analysis (MDA), stepwise logistic regression (logit), and principal component analysis (PCA) are applied. The algorithm for selecting SVM ensemble's base classifiers from candidate ones is designed by considering both individual performance and diversity analysis. Weighted majority voting based on base classifiers’ cross validation accuracy on training dataset is used as the combination mechanism. Experimental results indicate that SVM ensemble is significantly superior to individual SVM classifier when the number of base classifiers in SVM ensemble is properly set. Besides, it also shows that RBF SVM based on features selected by stepwise MDA is a good choice for FDP when individual SVM classifier is applied.     

Supply chain trust diagnosis (SCTD) using inductive case-based reasoning ensemble (ICBRE): The case of general competence trust diagnosis

General competence trust among supply chain partners, referring to the trust that a partner holds the general ability of fulfilling contracts, is a critical factor to ensure effective cooperation in a supply chain, especially in the current financial crisis. The method of supply chain trust diagnosis (SCTD) is to evaluate whether or not a partner holds such competence. This research devotes to an early investigation on diagnosing competence trust of supply chain with the method of inductive case-based reasoning ensemble (ICBRE). The so-called supply chain trust diagnosis with inductive case-based reasoning ensemble consists of five levels, that is, information level, the level of ratios of general competence states, the level of inductive case-based reasoning, ensemble level, and diagnosis result level. Knowledge for diagnosing competence trust, which composes of a case base, is hidden in data represented by ratios of general competence states. Inductive approach is combined with randomness to construct diverse and good member methods of inductive case-based reasoning. Finally, simple voting is used to integrate outputs of member inductive case-based reasoning methods in order to produce the final diagnosis on whether or not a partner holds the general ability of fulfilling contracts. We statistically validated results of the method of supply chain trust diagnosis with inductive case-based reasoning ensemble by comparing them with those of multivariate discriminant analysis, logistic regression, single Euclidean case-based reasoning, and single inductive case-based reasoning. The results indicate that the method of supply chain trust diagnosis with inductive case-based reasoning ensemble significantly improves predictive capability of case-based reasoning in this problem and outperforms all the comparative models by group decision of several decision-making agents and non-strict assumptions like statistical methods.     

Comparative study on economic contribution rate of education of China and foreign countries based on soft computing method

Economic contribution rate of education (ECRE) is the key factor of education economics. This article selected China, South Korea, United States and other countries for a total of 15 samples, and put the data of the same period under the framework of soft computing, to simulate the production chain of “education–potential human capital–actual human capital–economic growth”. The basic idea is: Firstly, 15 countries are softly categorized according to the level of science and technology (S&T) progress. Secondly, potential human capital and actual human capital establish the internal correlation (fuzzy mapping) in the same classification, and we conceptualize actual human capital as one production factor, joined with the other two production factors, fixed asset and land, to set up the fuzzy mapping to economic growth., and then calculate economic contribution rate of education of China and foreign by two fuzzy mapping of them. Thirdly, this paper analyzes the present state and differences in the development of education between China and foreign according to different ECRE, and offers proposals for promoting the education in China.     

Interactive genetic algorithms with large population and semi-supervised learning

Interactive genetic algorithms are effective methods of solving optimization problems with implicit (qualitative) criteria by incorporating a user's intelligent evaluation into traditional evolution mechanisms. The heavy evaluation burden of the user, however, is crucial and limits their applications in complex optimization problems. We focus on reducing the evaluation burden by presenting a semi-supervised learning assisted interactive genetic algorithm with large population. In this algorithm, a population with many individuals is adopted to efficiently explore the search space. A surrogate model built with an improved semi-supervised learning method is employed to evaluate a part of individuals instead of the user to alleviate his/her burden in evaluation. Incorporated with the principles of the improved semi-supervised learning, the opportunities of applying and updating the surrogate model are determined by its confidence degree in estimation, and the informative individuals reevaluated by the user are selected according to the concept of learning from mistakes. We quantitatively analyze the performance of the proposed algorithm and apply it to the design of sunglasses lenses, a representative optimization problem with one qualitative criterion. The empirical results demonstrate the strength of our algorithm in searching for satisfactory solutions and easing the evaluation burden of the user.