On-line identification of language measure parameters for discrete-event supervisory control

The discrete-event dynamic behavior of physical plants is often represented by regular languages that can be realized as deterministic finite state automata (DFSA). The concept and construction of signed real measures of regular languages have been recently reported in literature. Major applications of the language measure are: quantitative evaluation of the discrete-event dynamic behavior of unsupervised and supervised plants; and analysis and synthesis of optimal supervisory control algorithms in the discrete-event setting. This paper formulates and experimentally validates an on-line procedure for identification of the language measure parameters based on a DFSA model of the physical plant. The recursive algorithm of this identification procedure relies on observed simulation and/or experimental data. Efficacy of the parameter identification procedure is demonstrated on the test bed of a mobile robotic system, whose dynamic behavior is modelled as a DFSA for discrete-event supervisory control.     

Application of honey-bee mating optimization algorithm on clustering

Cluster analysis is one of attractive data mining technique that use in many fields. One popular class of data clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot found with reasonable amount of computation effort. In order to overcome local optima problem lots of studies done in clustering. Over the last decade, modeling the behavior of social insects, such as ants and bees, for the purpose of search and problem solving has been the context of the emerging area of swarm intelligence. Honey-bees are among the most closely studied social insects. Honey-bee mating may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of marriage in real honey-bee. Honey-bee has been used to model agent-based systems. In this paper, we proposed application of honeybee mating optimization in clustering (HBMK-means). We compared HBMK-means with other heuristics algorithm in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known datasets. Our finding shows that the proposed algorithm works than the best one.     

Spider Monkey Optimization algorithm for numerical optimization

Swarm intelligence is one of the most promising area for the researchers in the field of numerical optimization. Researchers have developed many algorithms by simulating the swarming behavior of various creatures like ants, honey bees, fish, birds and the findings are very motivating. In this paper, a new approach for numerical optimization is proposed by modeling the foraging behavior of spider monkeys. Spider monkeys have been categorized as fission–fusion social structure based animals. The animals which follow fission–fusion social systems, split themselves from large to smaller groups and vice-versa based on the scarcity or availability of food. The proposed swarm intelligence approach is named as Spider Monkey Optimization (SMO) algorithm and can broadly be classified as an algorithm inspired by intelligent foraging behavior of fission–fusion social structure based animals.     

单体型装配问题及其算法

单核苷酸多态性(SNP)单体型装配问题就是从给定的来自某人染色体的SNP片段中去除错误,重构出尽可能与原来片段一致的单体型.这个问题有几个不同的模型最少片段去除(MFR)问题,最少SNP去除(MSR)问题以及最少错误纠正(MEC)问题.前两个问题的复杂性与算法已有一些学者研究过.第三个问题已被证明是NP完全问题,但这个问题的实际算法还没有.该文对MEC问题给出了一个分支定界算法,这个算法能得到问题的全局最优解.通过这个算法对实际数据的计算说明了MEC模型的合理性,即在一定条件下,通过修正最少的错误重构出的单体型确实是真实的单体型.由于分支定界算法对这样一个NP完全问题不能在可接受的时间内解规模较大的问题,文中又给出了求解MEC问题的两个基于动态聚类的算法,以便对规模较大的问题在可接受的时间内得到近似最优解.数值实际表明这两个算法很快,很有效.这两个算法总能得到与分支定界找到的全局最优解很接近的近似最优解.鉴于MEC问题是NP完全的,这两个算法是有效的、实际的算法.     

Call center service process analysis: Bayesian parametric and semi-parametric mixture modeling

The main focus of the call center research has been on models that assume all input distributions are known in queuing theory which gives birth to staffing and the estimation of operating characteristics. Studies investigating uncertainty of the input distributions and its implications on call center management are scarce. This study attempts to fill this gap by analyzing the call center service distribution behavior by using Bayesian parametric and semi-parametric mixture models that are capable of exhibiting non-standard behavior such as multi-modality, skewness and excess kurtosis motivated by real call center data. The study is motivated by the observation that different customer profiles might require different agent skill sets which can create additional sources of uncertainty in the behavior of service distributions. In estimating model parameters, Markov chain Monte Carlo methods such as the Gibbs sampler and the reversible jump algorithms are presented and the implications of using such models on system performance and staffing are discussed.     

动力系统实测数据的非线性混沌模型重构

动力系统实测非线性混沌数据的模型重构技术是相空间重构的重要内容。在判定了实测数据的非线性混沌特征,计算了实测数据的分维数,Lyapunov指数,并对其进行了本征值分解和噪声去除及确定其模型阶数以后,提出了一个动力系统实测数据的非线性混沌模型,给出了相应的模型参数辨识方法,并用其确立的混沌模型进行了预测工作,计算结果表明:模型参数辨识方法能迅速地将参数估计值带到多峰目标函数的全局最少值附近,然后再采用优化理论能较准确地求出模型的参数,用得到的混沌模型对系统进行预测工作其预测效果良好,且混沌时序不可能作长期预测。     

Parsimonious representation of nonlinear dynamical systems through manifold learning: A chemotaxis case study

Nonlinear manifold learning algorithms, such as diffusion maps, have been fruitfully applied in recent years to the analysis of large and complex data sets. However, such algorithms still encounter challenges when faced with real data. One such challenge is the existence of “repeated eigendirections,” which obscures the detection of the true dimensionality of the underlying manifold and arises when several embedding coordinates parametrize the same direction in the intrinsic geometry of the data set. We propose an algorithm, based on local linear regression, to automatically detect coordinates corresponding to repeated eigendirections. We construct a more parsimonious embedding using only the eigenvectors corresponding to unique eigendirections, and we show that this reduced diffusion maps embedding induces a metric which is equivalent to the standard diffusion distance. We first demonstrate the utility and flexibility of our approach on synthetic data sets. We then apply our algorithm to data collected from a stochastic model of cellular chemotaxis, where our approach for factoring out repeated eigendirections allows us to detect changes in dynamical behavior and the underlying intrinsic system dimensionality directly from data.     

Mining social networks using wave propagation

With the development of modern technology(communication, transportation, etc.), many new social networks have formed and influenced our life. The research of mining these new social networks has been used in many aspects. But compared with traditional networks, these new social networks are usually very large. Due to the complexity of the latter, few model can be adapted to mine them effectively. In this paper, we try to mine these new social networks using Wave Propagation process and mainly discuss two applications of our model, solving Message Broadcasting problem and Rumor Spreading problem. Our model has the following advantages: (1) We can simulate the real networks message transmitting process in time since we include a time factor in our model. (2) Our Message Broadcasting algorithm can mine the underlying relationship of real networks and represent some clustering properties. (3) We also provide an algorithm to detect social network and find the rumor makers. Complexity analysis shows our algorithms are scalable for large social network and stable analysis proofs our algorithms are stable.     

Building Better Nurse Scheduling Algorithms

The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence build better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.     

Combining data augmentation,EDAs and grammatical evolution for blood glucose forecasting

The ideal solution for diabetes mellitus type 1 patients is the generalization of artificial pancreas systems. Artificial pancreas will control blood glucose levels of diabetics, improving their quality of live. At the core of the system, an algorithm will forecast future glucose levels as a function of food ingestion and insulin bolus sizes. In previous works several evolutionary computation techniques has been proposed as modeling or identification techniques in this area. One of the main obstacles that researchers have found for training the models is the lack of significant amounts of data. As in many other fields in medicine, the collection of data from real patients is not an easy task, since it is necessary to control the environmental and patient conditions. In this paper, we propose three evolutionary algorithms that generate synthetic glucose time series using real data from a patient. This way, the models can be trained with an augmented data set. The synthetic time series are used to train grammatical evolution models that work together in an ensemble. Experimental results show that, in a scarce data context, grammatical evolution models can get more accurate and robust predictions using data augmentation. In particular we reduce the number of potentially dangerous predictions to 0 for a 30 min horizon, 2.5% for 60 min, 3.6% on 90 min and 5.5% for 2 h. The Ensemble approach presented in this paper showed excellent performance when compared to not only a classical approach such as ARIMA, but also with other grammatical evolution approaches. We tested our techniques with data from real patients.     

含右删失数据的ZIP模型及其应用

零膨胀Poisson回归(ZIP)是处理零频数过多计数资料的有效模型,而计数数据一般含有删失或不精密的特点.本文将删失数据引入到ZIP模型中来,分别建立含右删失数据的固定效应ZIP模型,随机效应ZIP模型,通过极大边际似然函数估计法对模型进行参数估计.最后,利用实例分析验证了上述模型的可行性.     

A General Framework for Mining Massive Data Streams

In many domains, data now arrive faster than we are able to mine it. To avoid wasting these data, we must switch from the traditional “one-shot” data mining approach to systems that are able to mine continuous, high-volume, open-ended data streams as they arrive. In this article we identify some desiderata for such systems, and outline our framework for realizing them. A key property of our approach is that it minimizes the time required to build a model on a stream while guaranteeing (as long as the data are iid) that the model learned is effectively indistinguishable from the one that would be obtained using infinite data. Using this framework, we have successfully adapted several learning algorithms to massive data streams, including decision tree induction, Bayesian network learning, k-means clustering, and the EM algorithm for mixtures of Gaussians. These algorithms are able to process on the order of billions of examples per day using off-the-shelf hardware. Building on this, we are currently developing software primitives for scaling arbitrary learning algorithms to massive data streams with minimal effort.     

Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models

The theory of Gaussian graphical models is a powerful tool for independence analysis between continuous variables. In this framework, various methods have been conceived to infer independence relations from data samples. However, most of them result in stepwise, deterministic, descent algorithms that are inadequate for solving this issue. More recent developments have focused on stochastic procedures, yet they all base their research on strong a priori knowledge and are unable to perform model selection among the set of all possible models. Moreover, convergence of the corresponding algorithms is slow, precluding applications on a large scale. In this paper, we propose a novel Bayesian strategy to deal with structure learning. Relating graphs to their supports, we convert the problem of model selection into that of parameter estimation. Use of non-informative priors and asymptotic results yield a posterior probability for independence graph supports in closed form. Gibbs sampling is then applied to approximate the full joint posterior density. We finally give three examples of structure learning, one from synthetic data, and the two others from real data.     

应用图论分析与最优化理论来数据挖掘大规模水牛普里昂蛋白结构数据

图论、最优化理论显然在蛋白质结构的研究中大有用场. 首先, 调查/回顾了研究蛋白质结构的所有图论模型. 其后, 建立了一个图论模型: 让蛋白质的侧链来作为图的顶点, 应用图论的诸如团、 $k$-团、 社群、 枢纽、聚类等概念来建立图的边. 然后, 应用数学最优化的现代摩登数据挖掘算法/方法来分析水牛普里昂蛋白结构的大数据. 成功与令人耳目一新的数值结果将展示给朋友们.     

Double power laws,fractals and self-similarity

Power law (PL) distributions have been largely reported in the modeling of distinct real phenomena and have been associated with fractal structures and self-similar systems. In this paper, we analyze real data that follows a PL and a double PL behavior and verify the relation between the PL coefficient and the capacity dimension of known fractals. It is to be proved a method that translates PLs coefficients into capacity dimension of fractals of any real data.     

A review on probabilistic graphical models in evolutionary computation

Thanks to their inherent properties, probabilistic graphical models are one of the prime candidates for machine learning and decision making tasks especially in uncertain domains. Their capabilities, like representation, inference and learning, if used effectively, can greatly help to build intelligent systems that are able to act accordingly in different problem domains. Evolutionary algorithms is one such discipline that has employed probabilistic graphical models to improve the search for optimal solutions in complex problems. This paper shows how probabilistic graphical models have been used in evolutionary algorithms to improve their performance in solving complex problems. Specifically, we give a survey of probabilistic model building-based evolutionary algorithms, called estimation of distribution algorithms, and compare different methods for probabilistic modeling in these algorithms.     

Amortized Random Backtracking

Some nonsystematic search algorithms can deal with partial assignments of variables, and then can use constraint propagation techniques. Let us call them NSPA algorithms (Nonsystematic Search with Partial Assignments). For satisfiability or optimization problems, such NSPA algorithms scale a lot better than systematic algorithms. We show in this paper that naive NSPA algorithms have to pay a severe overhead due to the way they visit partial assignments. Amortizing the visits of partial assignments is an important feature which we introduce and analyze in this paper. We also propose a new NSPA algorithm that is amortized: it is called Amortized Random Backtracking, and performs a probabilistic exploration of the search space. It can be seen as an amortized version of iterative sampling and has given very good experimental results on a real life time tabling problem.     

Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates

This paper studies the scheduling problem in hybrid flow shop (HFS) environment. The sequence dependent family setup time (SDFST) is concerned with minimization of makespan and total tardiness. Production environments in real world include innumerable cases of uncertainty and stochasticity of events and a suitable scheduling model should consider them. Hence, in this paper, due date is assumed to be uncertain and its data follow a normal distribution. Since the proposed problem is NP-hard, two metaheuristic algorithms are presented based on genetic algorithm, namely: Non-dominated Sorting Genetic Algorithm (NSGAII) and Multi Objective Genetic Algorithm (MOGA). The quantitative and qualitative results of these two algorithms have been compared in different dimensions with multi phase genetic algorithm (MPGA) used in literature review. Experimental results indicate that the NSGAII performs very well when compared against MOGA and MPGA in a considerably shorter time.     

考虑破产控制的多期模糊资产-负债组合优化模型

在实际的投资决策过程中,一些投资者需要同时管理资产和负债,因此本文研究考虑破产控制和偿债行为的资产-负债管理问题。假设风险资产的收益率和负债的增长率为模糊数,用资产-负债组合的可能性期望和下半绝对偏差度量其收益和风险,以最大化最终期望净财富和最小化最终累积风险为目标,建立了允许限制性卖空的多期模糊资产-负债组合优化模型。然后,设计了一个基于粒子群算法和模拟退火算法的混合智能算法对模型进行求解。最后,通过实例分析说明了所设计算法与传统粒子群算法相比具有更好的优化性能和稳定性。本文所提出策略可以为需要同时管理资产和负债的投资者提供决策支持。     

PLS: A versatile tool for industrial process improvement and optimization

Modern industrial processes are characterized by acquiring massive amounts of highly collinear data. In this context, partial least‐squares (PLS) regression, if wisely used, can become a strategic tool for process improvement and optimization. In this paper we illustrate the versatility of this technique through several real case studies that basically differ in the structure of the X matrix (process variables) and Y matrix (response parameters). By using the PLS approach, the results show that it is possible to build predictive models (soft sensors) for monitoring the performance of a wastewater treatment plant, to help in the diagnosis of a complex batch polymerization process, to develop an automatic classifier based on image data, or to assist in the empirical model building of a continuous polymerization process. Copyright © 2008 John Wiley & Sons, Ltd.