拟概率空间上学习理论的关键定理和学习过程一致收敛速度的界

进一步讨论了拟概率的一些性质,给出了拟概率空间上的拟随机变量及其分布函数、期望和方差的概念及若干性质;证明了拟概率空间上的Markov不等式、Chebyshev不等式和Khinchine大数定律;给出并证明了拟概率空间上学习理论的关键定理和学习过程一致收敛速度的界,把概率空间上的学习理论的关键定理和学习过程一致收敛速度的界推广到了拟概率空间,为系统地建立拟概率上的统计学习理论与构建支持向量机奠定了理论基础.     

A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering

We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the configuration that can be deduced using a fixed set of geometric rules. To control the size of the database, we propose the idea of a structured deductive database. Our experiments show that this technique could reduce the size of the database by one hundred times. We propose the data-based search strategy to improve the efficiency of forward chaining. We also make clear progress in the problems of how to select good geometric rules, how to add auxiliary points, and how to construct numerical diagrams as models automatically. The program is tested with 160 nontrivial geometry configurations. For these geometric configurations, the program not only finds most of their well-known properties but also often gives unexpected results, some of which are possibly new. Also, the proofs generated by the program are generally short and totally geometric.     

An Improvement of Herbrands Theorem and Its Application to Model Generation Theorem Proving

This paper presents an improvement of Herbrand's theorem.We propose a method for specifying a sub- universe of the Herbrand universe of a clause set S for each argument of predicate symbols and function symbols in S. We prove that a clause set S is unsatisfiable if and only if there is a finite unsatisfiable set of ground instances of clauses of S that are derived by only instantiating each variable,which appears as an argument of predicate symbols or function symbols,in S over its corresponding argument's sub-universe of the Herbrand universe of S.Because such sub-universes are usually smaller(sometimes considerably)than the Herbrand universe of S,the number of ground instances may decrease considerably in many cases.We present an algorithm for automatically deriving the sub-universes for arguments in a given clause set,and show the correctness of our improvement.Moreover,we introduce an application of our approach to model generation theorem proving for non-range-restricted problems,show the range-restriction transformation algorithm based on our improvement and provide examples on benchmark problems to demonstrate the power of our approach.     

Automatic Theorem Proving and Fuzzy Situational Search for Decisions

The use of automatic theorem proving is considered as a methodological basis of fuzzy situational search for decisions.     

小灵通呼叫成功率优化方法

呼叫成功率反映了PHS网络无线侧的总体接入性能,与掉话率共同成为无线侧两大关键指标。随着PHS网络优化的不断深入以及考核的要求,呼叫成功率的优化已经成为广大网优技术人员积极探索的重点项目,但由于思路不正确,许多网优人员在优化过程并没有找到问题的主要因素,因此不能取得理想的网优效果甚至导致网络性能的恶化。这篇论文通过对呼叫成功率的指标分解、因素分析以及优化方法的介绍,以及对网优经验的总结,为技术人员对该指标的理解以及优化方法提供参考,以达到提高网优效率的目的。     

小灵通呼叫成功率优化方法

呼叫成功率反映了PHS网络无线侧的总体接入性能,与掉话率共同成为无线侧两大入以及考核的要求,呼叫成功率的优化已经成为广大网优技术人员积极探索的重点项目,但由于思路不正确,许多网优人员在优化过程并没有找到问题的主要因素,因此不能取得理想的网优效果甚至导致网络性能的恶化.这篇论文通过对呼叫成功率的指标分解、因素分析以及优化方法的介绍,以及对网优经验的总结,为技术人员对该指标的理解以及优化方法提供参考,以达到提高网优效率的目的.     

On the Interpretation of Energy as the Rate of Quantum Computation

Over the last few decades, developments in the physical limits of computing and quantum computing have increasingly taught us that it can be helpful to think about physics itself in computational terms. For example, work over the last decade has shown that the energy of a quantum system limits the rate at which it can perform significant computational operations, and suggests that we might validly interpret energy as in fact being the speed at which a physical system is “computing,” in some appropriate sense of the word. In this paper, we explore the precise nature of this connection. Elementary results in quantum theory show that the Hamiltonian energy of any quantum system corresponds exactly to the angular velocity of state-vector rotation (defined in a certain natural way) in Hilbert space, and also to the rate at which the state-vector’s components (in any basis) sweep out area in the complex plane. The total angle traversed (or area swept out) corresponds to the action of the Hamiltonian operator along the trajectory, and we can also consider it to be a measure of the “amount of computational effort exerted” by the system, or effort for short. For any specific quantum or classical computational operation, we can (at least in principle) calculate its difficulty, defined as the minimum effort required to perform that operation on a worst-case input state, and this in turn determines the minimum time required for quantum systems to carry out that operation on worst-case input states of a given energy. As examples, we calculate the difficulty of some basic 1-bit and n-bit quantum and classical operations in an simple unconstrained scenario     

线性估算在码率控制中的应用

码率控制是视频通信中的一个关键环节,用于调控编码视频的输出质量,而码率控制算法的效率也很大地影响着视频质量。线性估算有多项式级别的时间复杂度,可以处理多种码率约束问题。基于码率约束的线性放宽以及帧级别率失真函数的线性估算,对信源-信道联合码率控制和灵活解码端缓冲器模型下编码问题具有较优的性能。     

一种估测运动目标Time—toCollision的方法

提出了一种直接从图象序列中估测运动目标到被攻击物体的撞击时间的方法，建立了目标运动的象面模型，并设计了一种利用多子区相关跟踪器和最小二乘估计方法估测撞击时间的方案。计算机仿真实验结果证明了该方案的可行性。     

基于特征点跟踪的运动目标接触时间估计方法研究

解决估计运动目标和静止观测者之间的接触时间(time-to-contact)的问题.首先定义了广义接触时间的概念,并提出了基于特征点跟踪的估计匀速运动目标接触时间的理论依据和利用特征线段估计接触时间的解决思路.随后,提出了一个结合Kalman滤波器的估计匀速运动目标和静止观测者之间接触时间的特征点跟踪方案,并讨论了特征点的选择准则、运动分割的方法、以及所采用的特征点跟踪的方法.最后,针对标定TTC的运动目标序列图像进行接触时间的估计实验,实验的结果是令人满意的.     

基于多摄像机的航空器滑行冲突检测研究

对机场场面航空器滑行冲突检测进行了研究,分析了基于多摄像机的航空器滑行冲突检测流程,基于图像识别和目标跟踪技术,提取航空器的滑行轨迹,提出了基于DCPA(distance of closest point of approach)和TCPA(time of closet point of approach)的滑行冲突检测模型,开发了基于多摄像机的航空器滑行冲突检测原型系统并应用于西南某通航机场;实验结果表明,基于多摄像机视频目标跟踪和冲突检测模型可有效地检测机场场面航空器的滑行冲突,可作为中小机场主要监视手段以及大型机场场监雷达系统的辅助,防止航空器机场滑行冲突,提高机场场面运行安全和效率。     

雷达导航避碰模糊识别

在多目标雷达导航避碰过程中,识别目标船相对于本船可能发生碰撞的危险程度是驾驶员十分重要的工作,通常是由驾驶员根据经验作出人为的识别或判断,本文运用模糊数学综合评判理论于船舶雷达导航避碰技术中,综合分析目标相对于本船的方位,距离,最近碰撞点和最近碰撞时间参数,将目标碰撞危险程度这一模糊概念加以数量化,最终提出一种新的目标碰撞危险度综合评判数学模型.     

活套张力矩实时计算的多项式逼近算法

通过对带钢张力矩计算理论公式的分析并结合工程实际,提出了一种采用多项式逼近来拟合活套张力矩非线性曲线的方法。该方法以有限个理论计算数据为样本,采用多项式函数离线进行回归,在保证高的逼近精度的前提下,以显著提高在线计算速度为目的。该算法在某热轧带钢的数字化改造中取得了非常好的应用效果,精度明显提高且能满足快速实时计算的要求,证明非常适合类似的实时控制场合。     

A Hybrid SOM-BPN Approach to Lot Output Time Prediction in a Wafer Fab

Output time prediction is a critical task to a wafer fab (fabrication plant). To further enhance the accuracy of wafer lot output time prediction, the concept of input classification is applied to the back propagation network (BPN) approach in this study by pre-classifying input examples with the self-organization map (SOM) classifier before they are fed into the BPN. Examples belonging to different categories are then learned with different BPNs but with the same topology. Production simulation is also applied in this study to generate test examples. According to experimental results, the prediction accuracy of the proposed methodology was significantly better than those of three existing approaches, case-based reasoning (CBR), BPN without example classification, and evolving fuzzy rules (EFR), in most cases by achieving a 13–46% (and an average of 30%) reduction in the root-mean-squared-error (RMSE) over the comparison basis – BPN without example classification.     

一种面向可信的工作流系统监控方法

摘要：提出了一种面向可信的工作流系统监控方法,该方法可对工作流引擎执行性能、工作流实例状态、以及负载情况等系统信息进行实时监测,并能对运行的工作流实例进行动态调整,有效的保证了工作流系统的可靠性、安全性和鲁棒性。该方法应用到了面向可信的动态工作流管理系统中,验证了该方法的有效性。     

The Logical Approach to Temporal Reasoning

Temporal reasoning started to be considered as a subject of study in artificial intelligence in the late 1970's. Since then several ways to represent and use temporal knowledge have been suggested. As a result of that, there are several formalisms capable of coping with temporal notions in some way or other. They range from isolated proposals to complex systems where the temporal aspect is used together with other important features for the task of modelling an intelligent agent. The purposes of this article are to summarize logic-based temporal reasoning research and give a glance on the different research tracks envisaging future lines of research. It is intended to be useful to those who need to be involved in systems having these characteristics and also an occasion to present newcomers some problems in the area that still waits for a solution.     

Computation of the stability radius of a Hurwitz polynomial with diamond-like uncertainties

This paper considers the stability radius problem of Hurwitz polynomials whose coefficients have Hölder 1-norm-bounded uncertainties. We show that the solution to this problem demands the computation of the minimum of a piece-wise real-rational function ρ(λ), called the stability radius function. It is then shown that the calculations of ρ(λ) at the intersection points where ρ(λ) changes its representation and at the stationary points where ρ′(λ)=0 can be reduced to two sets of eigenvalue problems of matrices of the form H_β⁻¹H_γ, where both H_β and H_γ are frequency-independent Hurwitz matrices. Using root locus technique, we analyze this function further and prove that, in some special cases, the minimum of this function can be achieved only at the intersection points. Extensions of the eigenvalue approach to cover other robust stability problems are also discussed.     

Chaotification of Switching Control Systems via Dwell Time Approach

In this paper, a class of switching control systems is investigated, and a novel switching control method is developed, which can be applied to generating chaos dynamics from switching control systems through dwell time restriction. A numerical example is given to illustrate the generated chaotic dynamic behavior of the systems, and the corresponding bifurcation diagram is sketched. Then, the validity of the main results is verified together with other phase portraits.