单量子系统中基于相干度量的态排序

在单量子系统中,利用相干度量的定义及其性质,基于不同相干度量分别研究纯态和混合态的态排序,并给出C_(max),C_(v-max)与C_(r),C_(I),Cl_(1)的态排序结果.结果表明:C_(r),C_(Ι),C_(H)对纯态提供相同的态排序,该态排序结果对混合态不成立;不同于纠缠度量,2个相干度量在纯态中的序关系对任意态未必有相同结果.

RESEARCH OF VOXELIZATION PROCESS IN SWEPT-VOLUME TECHNIQUE

Now the image display techniques have made great progress. The planar display and a fully new true 3-D volumetric display technique are rapidly researched and come into the application. A method based on the voxel makes the observer able to get a true 3-D effect freely without any additional facilities. This paper introduces the basic form of the swept-volume display technique and discusses its voxelization process. By the translational motion prototype, this paper emphasizes how to get the voxel mapping matrix. The translated image data are the data of the beam source deflections. Finally the voxel ordering and the optimizing are also discussed.

有关多目标遗传算法的研究

概括介绍了目前的多目标遗传算法 (MOGA) ,并给出了一种新形式的MOGA ,也就是稳定态非受控排序遗传算法 (SNSGA)。该算法是把单目标遗传算法中的部分更新种群观点和非受控排序遗传算法中的适应度指派方法相结合而实现的 ,改进了适应度指派方法并提出了一种新的浕ｓｈａｒｅ自适应决策方案诎ㄒ糯惴烟夂鸵糯惴ㄆ燮侍獾氖笛橹?。

Flow shop rescheduling problem under rush orders

In the environment of customization, disturbances such as rush orders and material shortages often occur in the manufacturing system, so rescheduling is necessary for the manufacturing system. The rescheduling methodology should be able to dispose of the disturbance efficiently so as to keep production going smoothly. This aims researching flow shop rescheduling problem (FSRP) necessitated by rush orders. Disjunctive graph is employed to demonstrate the FSRP. For a flow shop processing n jobs, after the original schedule has been made, and z out of n jobs have been processed in the flow shop, x rush orders come, so the original n jobs together with x rush orders should be rescheduled immediately so that the rush orders would be processed in the shortest time and the original jobs could be processed subject to some optimized criteria. The weighted mean flow time of both original jobs and rush orders is used as objective function. The weight for rush orders is much bigger than that of the original jobs, so the rush orders should be processed early in the new schedule. The ant colony optimization (ACO) algorithm used to solve the rescheduling problem has a weakness in that the search may fall into a local optimum. Mutation operation is employed to enhance the ACO performance. Numerical experiments demonstrated that the proposed algorithm has high computation repeatability and efficiency.

Optimal transmission lines assignment with maximal reliabilities in multi-source multi-sink multi-state computer network

The optimal transmission lines assignment with maximal reliabilities (OTLAMR) in the multi-source multi-sink multi-state computer network (MMMCN) was investigated. The OTLAMR problem contains two sub-problems: the MMMCN reliabilities evaluation and multi-objective transmission lines assignment optimization. First, a reliability evaluation with a transmission line assignment (RETLA) algorithm is proposed to calculate the MMMCN reliabilities under the cost constraint for a certain transmission lines configuration. Second, the non-dominated sorting genetic algorithm II (NSGA-II) is adopted to find the non-dominated set of the transmission lines assignments based on the reliabilities obtained from the RETLA algorithm. By combining the RETLA and the NSGA-II algorithms together, the RETLA-NSGA II algorithm is proposed to solve the OTLAMR problem. The experiments result show that the RETLA-NSGA II algorithm can provide efficient solutions in a reasonable time, from which the decision makers can choose the best solution based on their preferences and experiences.

An Image Encryption Approach Using a Shuffling Map

A new image encryption approach is proposed.First,a sort transformation based on nonlinear chaoticalgorithm is used to shuffle the positions of image pixels.Then the states of hyper-chaos are used to change the greyvalues of the shuffled image according to the changed chaotic values of the same position between the above nonlinearchaotic sequence and the sorted chaotic sequence.The experimental results demonstrate that the image encryptionscheme based on a shuffling map shows advantages of large key space and high-level security.Compared with someencryption algorithms,the suggested encryption scheme is more secure.

Estimation of Ordered Means of Two Normal Distributions with Ordered Variances

The authors consider the problem of estimating the ordered means of two normal distributions with unknown ordered variances. The authors discuss the estimation of two ordered means, individually, in terms of stochastic domination and MSE （mean squared error）. The authors show that in estimating the mean with larger variance, the usual estimator under order restriction on means can be improved upon. However, in estimating the mean with smaller variance, the usual estimator can＇t be improved upon even under MSE. The authors also discuss simultaneous estimation problem of two ordered means when unknown variances are ordered.

Efficient Security Sequencing Problem over Insecure Channel Based on Homomorphic Encryption

In the field of sequencing of secret number,an important problem is how to establish an efficient and secure protocol for sorting the secret number.As a powerful tool in solving privacy sequencing problems,secure multipart computation is more and more popular in anonymous voting and online auction.In the present study,related secure computation protocol for sequencing problem is not many by far.In order to improve the efficiency and safety,we propose a security sequencing protocol based on homomorphic encryption.We also give analysis of correctness and security to highlight its feasibility.

Multi-objective optimal configuration of current limiting strategies

With the level of short-circuit current of power systems growing increasingly higher,optimal allocation of current limiters has received considerable attention in recent years,especially in China.This paper analyzes two kinds of common used current limiters based on the increment of bus impedance matrix and proposes a multi-objective current limiters configuration model considering the investment of limiters,the level of short-circuit current,as well as the transient stability of power system.An innovative search space reduction technique based on sensitivity factor is introduced to choose better candidate locations for current limiters so as to avoid the curse of dimensionality.The elitist non-dominated sorting genetic algorithm II is used to search the Pareto-optimal solutions of the proposed model.In order to further improve optimization efficiency,master-slave parallel modification of NSGA-II program structure is implemented.The satisfactory case study results demonstrate the feasibility of the proposed multi-objective method in power system current limiters allocation associated with cost,security and stability.

Multi-objective optimization for deepwater dynamic umbilical installation analysis

We suggest a method of multi-objective optimization based on approximation model for dynamic umbilical installation. The optimization aims to find out the most cost effective size, quantity and location of buoyancy modules for umbilical installation while maintaining structural safety. The approximation model is constructed by the design of experiment (DOE) sampling and is utilized to solve the problem of time-consuming analyses. The non-linear dynamic analyses considering environmental loadings are executed on these sample points from DOE. Non-dominated Sorting Genetic Algorithm (NSGA-II) is employed to obtain the Pareto solution set through an evolutionary optimization process. Intuitionist fuzzy set theory is applied for selecting the best compromise solution from Pareto set. The optimization results indicate this optimization strategy with approximation model and multiple attribute decision-making method is valid, and provide the optimal deployment method for deepwater dynamic umbilical buoyancy modules.