Multi-agent and driving behavior based rear-end collision alarm modeling and simulating

Distance-between-vehicle-measurement is the only factor in traditional car rear-end alarm system. To address the above problem, this paper proposes an alarming model based on multi-agent systems (MAS) and driving behavior. It consists of four different types of agents that can either work alone or collaborate through a communications protocol on the basis of the extended KQML. The rear-end alarming algorithm applies the Bayes decision theory to calculate the probability of collision and prevent its occurrence real-time. The learning algorithm of driving behavior based on ensemble artificial neural network (ANN) and the decision procedure based on Bayes’ theory are also described in this paper. Both autonomy and reliability are enhanced in the proposed system. The effectiveness and robustness of the model have been confirmed by the simulated experiments.     

Partner selection in a virtual enterprise under uncertain information about candidates

Partner selection is a major issue in the formation of a virtual enterprise. In practice, in the partner selection process, the information about the candidates and their performances are incomplete and uncertain. Vague sets theory is one of the methods used to deal with uncertain information. In this paper, a new method based on vague sets is proposed to deal with the partner selection problem in the formation of a virtual enterprise while the factors of satisfaction degree, due date, cost and the precedence of tasks are taken into account. On the basis of the agreement index of satisfaction degree, the formulated partner selection problems are interpreted so as to maximize the minimum agreement index. To solve the problem, an improved particle swarm optimization (PSO) algorithm is proposed. Finally, the simulation of a numerical example demonstrates that the method is effective.     

Existence and uniqueness of strictly nondecreasing and positive solution for a fractional three-point boundary value problem

In this paper, we consider the following nonlinear fractional three-point boundary value problem

     

The research on mechanism of color management system based on iCAM color appearance model

Since color recording and color representing abilities of various media are very different, color information is often lost or misrepresented in the process of image transmission and reproduction. A Color Management System (CMS) based on iCAM color appearance model is presented in this paper. It can be used either in computer operation system software or application software for obtaining color consistency across different software applications, imaging devices, imaging media and viewing conditions.     

Robust finite-time boundedness of multi-agent systems subject to parametric uncertainties and disturbances

In this paper, we consider finite-time control problems for linear multi-agent systems subject to exogenous constant disturbances and impulses. Some sufficient conditions are obtained to ensure the finite-time boundedness of the multi-agent systems, which could be then reduced to a feasibility problem involving linear matrix inequalities. Numerical examples are given to illustrate the results.     

Three-dimensional reconstruction on PC-Windows platform for evaluation of living donor nephrectomy

Evaluation of renal vasculature was necessary for preoperative donor assessment in living donor kidney transplantation, and the ability to view the vascular imaging in three-dimensional (3D) space should be helpful undoubtedly. Considering the widespread use of personal computer (PC) systems, we aimed to find a handy way to display the anatomy of the renal arterial and venous systems of potential donors on PC-Windows platform. Ten living-related donors were included in this study. Serial computed tomography (CT) images were loaded into Amira 3.1 running on a PC with Windows XP. Following image crop, segmentation and 3D reconstruction, we got the 3D images and the video clips. According to the displays which were confirmed by latter intraoperative findings, eight donors had single renal vessels, one had a left accessory renal artery and one had a right accessory renal artery. This project offered a new approach to evaluate the renal vessel anatomy in living donor kidney transplantation, and it was favorable for accuracy and popularizing.     

知识获取技术及其在网络智能故障诊断中的应用

基于遗传算法提出了一种新型的机器学习方法,它利用遗传算法的全局寻优手段,为解决知识获取这一瓶颈问题另辟捷径。论述了该方法的原理及其实现过程,并且给出了网络故障诊断应用实例,证明了它的有效性。     

对重催I/A'S系统三冲量控制回路的探讨

本文主要对广州石油化工总厂重油催化裂化装置的复杂回路——三冲量控制在I/A'S系统的实现进行探讨和实施。     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999