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.     

一个基于CORBA和Java技术的分布式并行有限元计算环境

该文结合ＣＯＲＢＡ（Ｃｏｍｍｏｎ Ｏｂｊｅｃｔ Ｂｒｏｋｅｒ Ａｒｃｈｉｔｅｃｔｕｒｅ）和Ｊａｖａ技术,提出了一个能在支持ＴＣＰ／ＩＰ协议的异构网络环境下实现分布式有限元计算环境的具体方案,为了验证方案的可行性,在西南交通大学应用力学与工程系计算中心的局域网上实现了分布式并行计算环境的基本框架,并进行了１０００阶矩阵相乘的计算。     

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.     

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

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

Optimal Control of Two-Stage Discrete Event Systems with Real-Time Constraints

We consider discrete event systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task meeting its own constraint. When tasks are processed over a single stage, it has been shown that there are structural properties of the optimal sample path that lead to very efficient solutions of such problems. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, these properties no longer hold and no obvious extensions are known. We consider a two-stage problem with homogeneous cost functions over all tasks at each stage and derive several new optimality properties. These properties lead to the idea of introducing “virtual” deadlines at the first stage, thus partially decoupling the stages so that the known efficient solutions for single-stage problems can be used. We prove that the solution obtained by an iterative virtual deadline algorithm (VDA) converges to the global optimal solution of the two-stage problem and illustrate the efficiency of the VDA through numerical examples.

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

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