Quantum computing measurement and intelligence

One of the grand challenges in the nanoscopic computing era is guarantees of robustness. Robust computing system design is confronted with quantum physical, probabilistic, and even biological phenomena, and guaranteeing high‐reliability is much more difficult than ever before. Scaling devices down to the level of single electron operation will bring forth new challenges due to probabilistic effects and uncertainty in guaranteeing “zero‐one” based computing. Minuscule devices imply billions of devices on a single chip, which may help mitigate the challenge of uncertainty by replication and redundancy. However, such device densities will create a design and validation nightmare with the sheer scale. The questions that confront computer engineers regarding the current status of nanocomputing material and the reliability of systems built from such minuscule devices are difficult to articulate and answer. This article illustrates and discusses two types of quantum algorithms as follows: (1) a simple quantum algorithm and (2) a quantum search algorithm. This article also presents a review of recent advances in quantum computing and intelligence and presents major achievements and obstacles for researchers in the near future. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2010     

基于反馈和多最小二乘支持向量机的分数阶混沌系统控制

根据分数阶线性系统的稳定理论,将混沌系统分成稳定的线性部分和相应的非线性部分.设计主动控制器,对非线性部分进行补偿,从而将分数阶混沌系统控制到平衡点.为了提高主动控制器的补偿能力,提出基于反馈的多最小二乘支持向量机(M-LS-SVM)拟合模型.通过减聚类方法将输入空间划分为一些小的局部空间,在每个局部空间中用LS-SVM建立子模型.为解决子模型相互之间的严重相关问题,提高模型的精度和鲁棒性,各个子模型的预测输出通过主元递归(PCR)方法连接.仿真实验表明该方法有助于提高补偿精度和系统响应指标. 关键词： 分数阶 混沌系统 多最小二乘支持向量机 反馈     

Scheduling deteriorating jobs with a learning effect on unrelated parallel machines

In this study we consider unrelated parallel machines scheduling problems with learning effect and deteriorating jobs, in which the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. The objective is to determine the jobs assigned to corresponding each machine and the corresponding optimal schedule to minimize a cost function containing total completion (waiting) time, total absolute differences in completion (waiting) times and total machine load. If the number of machines is a given constant, we show that the problems can be solved in polynomial time under the time-dependent deterioration and position-dependent learning model.     

空气中PM2.5的动态扩散及宏观预测

以PM2.5扩散、衰减模式为研究对象,分析探究了PM2.5的扩散规律、危机治理及其后5年的治理问题.首先通过主成分分析法,建立了PM2.5与其它污染物之间的多元非线性对数模型.同时引入相对湿度的影响因素对模型进行再度优化,提高了模型的拟合优度.运用统计学原理,得出采集点之间的PM2.5具有较高的协同性.另外分析了静态下PM2.5污染物颗粒的受力和漂移模式和从点源、面源两方面分析了PM2.5动态扩散模式,建立了PM2.5的扩散偏微分方程模型.根据建立的扩散模型,对突变的污染物浓度确定安全区域的范围.最后建立综合费用和专项费用的多目标优化模型,利用贝叶斯支持向量机方法对PM2.5进行宏观预测,并运用系统动力学理论对目标值进一步优化,并对不同治理模式进行对比分析.     

R^2上带奇异性的非线性多重调和方程的正整解

该文以Schauder-Tychonoff不动点定理为工具，建立了一类平面上带奇异性的非线性 多重调和方程的正的径向对称整体解的存在性定理，并给出了解的有关性质，所得的结果丰 富和发展文[1][4]的结果。     

振动机械起动过程中的迟滞共振原因分析

振动机械在起动过程中，有时会出现一种特殊的共振现象─—迟滞共振．本文通过解析分析和数值算法解释了产生该现象的原因．     

Survival-Time Classification of Breast Cancer Patients

The identification of breast cancer patients for whom chemotherapy could prolong survival time is treated here as a data mining problem. This identification is achieved by clustering 253 breast cancer patients into three prognostic groups: Good, Poor and Intermediate. Each of the three groups has a significantly distinct Kaplan-Meier survival curve. Of particular significance is the Intermediate group, because patients with chemotherapy in this group do better than those without chemotherapy in the same group. This is the reverse case to that of the overall population of 253 patients for which patients undergoing chemotherapy have worse survival than those who do not. We also prescribe a procedure that utilizes three nonlinear smooth support vector machines (SSVMs) for classifying breast cancer patients into the three above prognostic groups. These results suggest that the patients in the Good group should not receive chemotherapy while those in the Intermediate group should receive chemotherapy based on our survival curve analysis. To our knowledge this is the first instance of a classifiable group of breast cancer patients for which chemotherapy can possibly enhance survival.     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings     

机器具有准备时间的双目标平行机排序问题

本文讨论机器具有准备时间的双目标平行机排序问题，目标函数为完工时间和最优条件下极小化最大完工时间．通过对SPT排序的性质的分析，给出了最优排序的下界．在此基础上证明了SPT排序的误差界为3／2，并且是紧界．