不同阶分数阶混沌系统的同步与参数辨识

针对不确定分数阶混沌系统的同步和参数辨识问题,提出一种新的方法,即用不同阶分数阶系统来同步和参数辨识.利用主动控制和预控制量方法,基于分数阶混沌系统稳定性理论和自适应控制理论,设计控制器,实现不同阶分数阶混沌系统之间的同步和参数辨识.理论和仿真结果实现了不同阶Chen 系统间的同步和辨识,表明了该方法的有效性.     

两个不同分数阶混沌系统的广义投影同步

针对不同的分数阶混沌系统的同步问题,基于分数阶微积分理论和分数阶线性系统稳定性理论,设计了相应的控制器,实现了分数阶Chen系统和Lorenz系统之间的广义投影同步,数值仿真的结果验证了该控制方法的有效性和可行性。     

分数阶混沌系统的主动滑模同步

结合主动控制和滑模控制原理,提出了一个同步分数阶混沌系统的主动滑模控制方法.该方法首先用分数阶积分对所有维状态分量设计一个滑模面,分数阶混沌系统在该滑模面上稳定.然后采用极点配置的方法获得主动滑模控制器中的增益矩阵.应用Lyapunov稳定性理论、分数阶系统稳定理论对所提的控制器的存在性和稳定性分别进行了分析.对分数阶Lorenz系统进行数值仿真,仿真结果验证了该方法的有效性.     

不确定混沌系统用分数阶系统同步与参数辨识

针对不确定整数阶混沌系统的同步和参数辨识问题,提出一种新的策略即用分数阶混沌系统来同步整数阶混沌系统并实现不确定参数的辨识。首先引入预控制量并利用主动控制构造同步误差方程,然后用分数阶混沌系统稳定性理论和自适应控制理论,设计同步控制器及参数的自适应率,最终实现整数阶混沌系统用分数阶混沌系统同步和参数辨识。数值仿真实现参数不确定整数阶Lorenz系统用分数阶Lorenz系统进行同步和参数辨识仿真,结果表明提出方法的有效性。     

分数阶混沌系统的延迟同步

基于分数阶线性系统的稳定性理论，结合反馈控制和主动控制方法，提出了实现分数阶混沌系统的延迟同步的一种新方法．该方案通过设计合适的控制器将分数阶混沌系统的延迟同步问题转化为分数阶线性误差系统在原点的渐近稳定性问题．分数阶Chen系统的数值模拟结果验证了该方案的有效性．     

一类分数阶非线性混沌系统的同步控制

在分数阶非线性系统同步控制的研究中,针对一类分数阶非线性混沌系统,研究了基于分数阶控制器的同步方法.利用状态反馈方法和分数阶微积分定义,设计了分数阶混沌系统同步控制器.进一步,根据分数阶非线性系统稳定性理论、Mittag-Leffler函数、Laplace变换以及Gronwall不等式,证明了同步控制器的有效性.最后,通过数值仿真,实现了初始值不同的两个分数阶非线性混沌系统同步.误差响应曲线表明研究的分数阶非线性系统同步响应速度快,控制精度高,验证了本文所设计的混沌同步控制方案的可行性.     

具有控制约束的分数阶混沌系统柔性同步控制

研究具有控制约束的两个相同分数阶混沌系统的同步问题.首先,在不消除非线性项的情况下,基于比例控制与自适应控制理论,设计线性自适应切换控制器,实现分数阶混沌系统的同步;其次,考虑到控制器存在约束,利用能够提供无限子控制器的柔性变结构控制策略对线性控制器进行改进,设计柔性变结构控制器,以应对控制的约束,并对线性控制器进行优化;同时,基于分数阶系统Mittag-Leffler稳定判定定理对误差系统的稳定性进行证明.在兼顾系统稳定性与鲁棒性的情况下,可以缩短系统的调整时间,并有效抑制抖振.最后,利用所设计的自适应柔性控制器实现分数阶Chen系统的混沌同步,并通过仿真对比两控制器控制效果,从而验证柔性变结构方法在具有约束的分数阶混沌系统同步控制中的优越性.     

分数阶混沌系统同结构与异结构广义同步

基于分数阶拉普拉斯交换理论,提出设计合适的新型非线性反馈控制器,分别实现分数阶混沌系统的同结构广义同步和异结构广义同步.以分数阶Liu混沌系统和分数阶Lü混沌系统为例进行数值仿真,仿真结果表明了该方法的有效性.该方法灵活且适用范围广,具有潜在的应用前景.     

分数阶时滞复Lorenz混沌系统的控制与同步

基于分数阶时滞非线性系统稳定性理论,设计线性反馈控制器,实现分数阶时滞混沌系统的控制;基于矩阵配置控制器的设计方法,利用时滞分离法,实现参数未知的分数阶时滞混沌系统的同步。以分数阶时滞复Lorenz系统为例进行了研究,分别分离原系统各个变量的实部和虚部,将其转化为分数阶时滞非线性系统,研究其混沌特性,实现了混沌系统的控制以及利用矩阵配置控制器的设计方法实现了参数未知的混沌系统的同步,数值仿真验证了结果的有效性,易于工程实现。     

一类混沌系统的分数阶广义同步

针对一类参数未知的混沌系统,基于分数阶微积分和Lyapunov稳定性理论,设计出了一族分数阶广义同步控制器,此族控制器可通过选择不同分数阶次得到不同的控制效果,并且都能保证闭环混沌系统达到渐近广义同步.数值试验验证了此方法的有效性。     

多角度不同表情下的人脸识别

多角度及不同表情下的人脸识别是人脸识别领域的一个难题。本文将二维主元素分析法与贝叶斯判据相结合设计了多角度不同表情下的人脸识别算法。首先，利用二维主元素分析法计算人脸的特征矢量空间，并将训练集和测试集中的数据向该特征矢量空间进行投影，然后使用贝叶斯判据进行识别。该方法集中了二维主元素分析法计算简单、速度快及统计分类器识别率高的优点。实验结果显示，该方法计算简单，对具有表情变化及不同角度的人脸的识别率高。     

Different Algorithms for Normal and Protection Paths

Many network routing situations commonly require backup paths that satisfy various constraints on bandwidth, link or node selection, and ease of configuration. In this paper, we attempt to validate whether it is beneficial to have distinct algorithmic treatments of normal and backup path calculation, configuration, and maintenance. We present a modular suite of algorithms that enable us to manage normal and protection paths differently. In the process, we develop a simple extension of Minimum Interference Routing Algorithm for shared protection paths. We incorporate a distributed algorithm to separately calculate normal and backup paths in the network, using link state information, and present an evaluation of asynchronous dynamic reorganization of backup paths to reduce congestion in the network. Simulations demonstrate nontrivial quantitative reductions in blocking probabilities under certain conditions. We conclude that in order to choose an optimal algorithm for a protected QoS routing application, it is recommended to also consider a combination of two different algorithms for normal and backup paths.Rajarshi Gupta is a PhD candidate in Electrical Engineering and Computer Sciences at the University of California at Berkeley and will graduate in May 2005. Prior to this, he completed hisMS degree in 1999 at Berkeley and his BS degree in 1997 from the University of Maryland. From 1999 to 2003, Rajarshi worked with Extreme Networks as a Senior Designer, where he has been the author of 8 patents. He is interested in algorithms to ensure quality in networks–both wired and ad-hoc. This includes: analysis of network capacity; switching and scheduling mechanisms for efficient utilization of resources; and, routing algorithms to guarantee quality of service.Eric Chi received his MS degree in Electrical Engineering and Computer Sciences from the University of California at Berkeley in 2001 and his BAdegree in physics in 1999 from Rice University. Hiswork focused on distributed network capacity management.He hasworked on inventory restocking problems and protection path resource allocation in wired communication networks.Jean Walrand received the PhD degree from the Department of Electrical Engineering and Computer Sciences of the University of California at Berkeley where he is now Professor. His research interests include decision theory, stochastic processes, and communication networks. He is the author of An Introduction to Queueing Networks (Prentice Hall, 1988) and of Communication Networks: A First Course (2nd ed. McGraw-Hill, 1998) and coauthor of High-Performance Communication Networks (2nd ed, Morgan Kaufman, 2000). He is a Fellow of the Belgian American Education Foundation and of the IEEE and a recipient of the Lanchester Prize and of the Stephen O. Rice Prize.     

氮素水平对不同穗型水稻品种植株衰老和产量的影响

在大田条件下,研究了两种氮素水平对直、弯穗水稻品种植株生长、叶片衰老和产量的影响。结果表明,高氮条件下两品种的朱粗度和叶片性状均优于低氮条件。增施氮肥能提高剑叶的叶绿素含量,延长叶绿素含量缓降期,使植株在生育后期能保持较高的绿叶面积;同时能提高剑叶的全氮含量,延长光合速率高值持续期,增加植株的干物质积累和籽粒产量。在同一氮素水平下,直立穗型品种的植株粗度、剑叶活力、籽粒灌浆速率、千粒重、生物产量及籽粒产量均略优于弯曲穗型品种。     

Learning from Different Teachers

We introduce a new model of a learner learning an unknown concept from examples with a teacher's help. In such models, outright coding refers to a situation in which the teacher sends the learner a representation of the concept, either directly or encoded via the examples. Previous models have used adversarial learners or adversarial teachers to try to prevent outright coding. Our model is an attempt to reflect more directly some of the reasons that outright coding is not a common mode of human learning.We model the learner as a Turing machine with oracle access to another programming system, called its function box. The programming system in its function box is initially unknown to the learner. The target concept is a partial recursive function and the goal of the learner is to find in its function box a function that is equal to or extends the target concept. We exhibit a class of learner/teacher pairs in which the learner can learn any partial recursive function, provided that the learner's function box is not too much slower than the teacher's. This result is shown not to hold if the learner's function box can contain an arbitrary acceptable programming system.     

关于RFID的"另类"声音

自2004年4月沃尔玛宣布进行RFID的试点项目后,RFID逐渐发展成为当前炙手可热的技术之一。其实这项技术已经问世相当一段时间了,据说哈利·斯托克曼(Harry Stockman)1948年     

不同施肥处理土壤及不同C/N比有机物料中有机N的矿化进程

采用室内恒温控湿好气培养试验研究长期不同施肥制度培育的土壤有机N库的供氮能力及不同C/N比有机物料掺混土壤后有机N的矿化特征与进程。结果表明:长期不同施肥制度培育的土壤有机N库的供氮能力各不相同,与不施肥处理相比,长期施用化肥或有机肥均能提高土壤的供氮能力,二者相结合可明显提高土壤供氮力;不同C/N比有机物料掺混土壤后有机N的矿化特征与物料的C/N比密切相关,有机N的矿化进程可区分为前期的快速分解和后期的缓慢分解。     

应用MFC实现异构数据库的访问和操作

介绍在Ｖｉｓｕａｌ Ｃ＋＋６．０环境下,基于ＭＦＣ数据库类进行异构数据库访问的ＯＤＢＣ编程方法及相关技术。     

Combining Different Methods and Numbers of Weak Decision Trees

Several ways of manipulating a training set have shown that weakened classifier combination can improve prediction accuracy. In the present paper, we focus on learning set sampling (Breiman’s Bagging) and random feature subset selections (Ho’s Random Subspaces). We present a combination scheme labelled ‘Bagfs’, in which new learning sets are generated on the basis of both bootstrap replicates and random subspaces. The performances of the three methods (Bagging, Random Subspaces and Bagfs) are compared to the standard Adaboost algorithm. All four methods are assessed by means of a decision-tree inducer (C4.5). In addition, we also study whether the number and the way in which they are created has a significant influence on the performance of their combination. To answer these two questions, we undertook the application of the McNemar test of significance and the Kappa degree-of-agreement. The results, obtained on 23 conventional databases, show that on average, Bagfs exhibits the best agreement between prediction and supervision. Received: 17 November 2000, Received in revised form: 30 October 2001, Accepted: 13 December 2001     

Different dynamics of classical and quantum correlations under decoherence

The dynamics of classical and quantum correlations under nondissipative and dissipative decoherences are analytically and numerically investigated with both one-side measures and two-side measures. Specifically, two qubits under local amplitude damping decoherence and depolarizing decoherence channels are considered. We show that, under the action of amplitude damping decoherence, both the entanglement and correlations of the different types of initial states with same initial values, suffer different types of dynamics. Moreover, the transfers of the entanglement and correlations between the system and the environment for different types of initial states are also shown to be different. While for the action of depolarizing decoherence, there does not exist sudden change in the decay rates of both the classical and quantum correlations, which is different from some other nondissipative channels. Furthermore, the quantum dissonance can be found to keep unchanged under the action of depolarizing decoherence. Such different dynamic behaviors of different noisy quantum decoherence channels reveal distinct transmission performance of classical and quantum information.     

不同MapReduce运行系统的性能测试与分析

随着云计算技术的发展,许多MapReduce运行系统被开发出来,如Hadoop、Phoenix和Twister等.直观上,Hadoop具有很强的可扩展性、稳定性,适合处理大规模离线应用;Phoenix具有运行速度快等优点,适合处理数据密集型任务;Twister是轻量级的迭代系统,非常适合迭代式的应用.不同的应用在不同的MapReduce运行系统中有着不同的性能.通过测试不同应用在这些运行系统上的性能,给出了实验比较和性能分析,从而为大数据处理时选择合适的并行编程模型提供依据.