具有小时滞的线性大系统的次优控制

研究具有小时滞的线性大系统的次优控制问题.首先将子系统状态向量增量和子系统耦合项视为大系统附加扰动输入.再利用无滞后转换法的思想结合微分方程的逐次逼近法,将一个既含有时滞项又含有超前项的高阶两点边值问题分解为若干个解耦的、既不含时滞项又不含超前项的低阶两点边值问题族.最后用最优控制的有限次逼近结果作为大系统的次优控制律.对小时滞线性大系统而言,利用此方法可使计算次优控制律的迭代次数大大减少,因此该方法尤其适合于具有小时滞的线性大系统的次优控制器设计.     

Improved delay-dependent stability criteria for neutral-type systems with time-varying delays: a delayed decomposition approach

This paper discusses the neutral system with time-varying delay. Firstly, by developing a delayed decomposition approach and introducing integral inequality approach, the information of the delayed plant states can be taken into full consideration, and new delay-dependent sufficient stability criteria are obtained in terms of linear matrix inequalities (LMIs). Then, based on the Lyapunov method, delay-dependent stability criteria are devised by taking the relationship between the terms in the Leibniz–Newton formula into account. The criteria are derived in terms of LMIs, which can be easily solved by using various convex optimization algorithms. Three illustrative numerical examples are given to show the less conservatism of our obtained results and the effectiveness of the proposed method.     

具有非线性扰动的变时滞中立型系统鲁棒稳定性新判据

研究一类具有非线性扰动的时变时滞中立型系统鲁棒稳定性问题。基于直接Lyapunov Krasovskii泛函并结合自由权矩阵方法的分析方法,建立了线性矩阵不等式(LMI)形式的离散时滞和中立时滞均相关稳定性判据。与以往方法不同,在处理泛函导数时,该方法不包含任何模型变换和涉及交叉项的处理,只是通过引入相关项自由权矩阵,充分考虑各项之间的相互关系,降低了结论的保守性。最后,利用Matlab的LMI工具箱进行了的数值仿真, 算例仿真表明所提出的判据的有效性。     

基于语义的软构件检索

通过对传统的软构件检索技术的研究,在刻面分类检索方法的基础上,提出了一种基于语义的软构件检索方法,这种方法利用领域模型和领域本体对构件检索进行语义上的扩展。具体描述了该方法的设计思想和过程模型,然后利用该方法构造出了基于语义的软构件检索体系构架,实现了对领域构件进行语义查询的目的,提高了构件检索的查全率和查准率。     

Performance optimization of gas turbine engine

Performance optimization of a gas turbine engine can be expressed in terms of minimizing fuel consumption while maintaining nominal thrust output, maximizing thrust for the same fuel consumption and minimizing turbine blade temperature. Additional control layers are used to improve engine performance. This paper presents an evolutionary approach called the StudGA as the optimization framework to design for optimal performance in terms of the three criteria above. This approach converges fast and can potentially save on computing cost. Model-based experimental results are used to illustrate this approach.     

基于信息熵和词频分布变化的术语抽取研究

在分别研究了基于信息熵和基于词频分布变化的术语抽取方法的情况下,该文提出了一种信息熵和词频分布变化相结合的术语抽取方法。信息熵体现了术语的完整性,词频分布变化体现了术语的领域相关性。通过应用信息熵,即将信息熵结合到词频分布变化公式中进行术语抽取,且应用简单语言学规则过滤普通字符串。实验表明,在汽车领域的语料上,应用该方法抽取出1300个术语,其正确率达到73.7%。结果表明该方法对低频术语有更好的抽取效果,同时抽取出的术语结构更完整。     

A noun-based approach to feature location using time-aware term-weighting

ContextFeature location aims to identify the source code location corresponding to the implementation of a software feature. Many existing feature location methods apply text retrieval to determine the relevancy of the features to the text data extracted from the software repositories. One of the preprocessing activities in text retrieval is term-weighting, which is used to adjust the importance of a term within a document or corpus. Common term-weighting techniques may not be optimal to deal with text data from software repositories due to the origin of term-weighting techniques from a natural language context.ObjectiveThis paper describes how the consideration of when the terms were used in the repositories, under the condition of weighting only the noun terms, can improve a feature location approach.MethodWe propose a feature location approach using a new term-weighting technique that takes into account how recently a term has been used in the repositories. In this approach, only the noun terms are weighted to reduce the dataset volume and avoid dealing with dimensionality reduction.ResultsAn empirical evaluation of the approach on four open-source projects reveals improvements to the accuracy, effectiveness and performance up to 50%, 17%, and 13%, respectively, when compared to the commonly-used Vector Space Model approach. The comparison of the proposed term-weighting technique with the Term Frequency-Inverse Document Frequency technique shows accuracy, effectiveness, and performance improvements as much as 15%, 10%, and 40%, respectively. The investigation of using only noun terms, instead of using all terms, in the proposed approach also indicates improvements up to 28%, 21%, and 58% on accuracy, effectiveness, and performance, respectively.ConclusionIn general, the use of time in the weighting of terms, along with the use of only the noun terms, makes significant improvements to a feature location approach that relies on textual information.     

Extraction of terms and semantic relationships from Arabic texts for automatic construction of an ontology

The task of building an ontology from a textual corpus starts with the conceptualization phase, which extracts ontology concepts. These concepts are linked by semantic relationships. In this paper, we describe an approach to the construction of an ontology from an Arabic textual corpus, starting first with the collection and preparation of the corpus through normalization, removing stop words and stemming; then, to extract terms of our ontology, a statistical method for extracting simple and complex terms, called “the repeated segments method” are applied. To select segments with sufficient weight we apply the weighting method term frequency–inverse document frequency (TF–IDF), and to link these terms by semantic relationships we apply an automatic method of learning linguistic markers from text. This method requires a dataset of relationship pairs, which are extracted from two external resources: an Arabic dictionary of synonyms and antonyms and the lexical database Arabic WordNet. Finally, we present the results of our experimentation using our textual corpus. The evaluation of our approach shows encouraging results in terms of recall and precision.     

Nominal Reasoning Techniques in Coq: (Extended Abstract)

We explore an axiomatized nominal approach to variable binding in Coq, using an untyped lambda-calculus as our test case. In our nominal approach, alpha-equality of lambda terms coincides with Coq's built-in equality. Our axiomatization includes a nominal induction principle and functions for calculating free variables and substitution. These axioms are collected in a module signature and proved sound using locally nameless terms as the underlying representation. Our experience so far suggests that it is feasible to work from such axiomatized theories in Coq and that the nominal style of variable binding corresponds closely with paper proofs. We are currently working on proving the soundness of a primitive recursion combinator and developing a method of generating these axioms and their proof of soundness from a grammar describing the syntax of terms and binding.     

Concurrent assembly planning with genetic algorithms

This work investigates the application of genetic algorithm (GA)-based search techniques to concurrent assembly planning, where product design and assembly process planning are performed in parallel, and the evaluation of a design configuration is influenced by the performance of its related assembly process. Several types of GAs and an exhaustive combinatorial approach are compared, in terms of reliability and speed in locating the global optimum. The different algorithms are tested first on a set of artificially generated assembly planning problems, which are intended to represent a broad spectrum of combinatorial complexity; then an industrial case study is presented. Test problems indicate that GAs are slightly less reliable than the combinatorial approach in finding the global, but are capable of identifying solutions which are very close to the global optimum with consistency, soon outperforming the combinatorial approach in terms of execution times, as the problem complexity grows. For an industrial case study of low combinatorial complexity, such as the one chosen in this work, GAs and combinatorial approach perform almost equivalently, both in terms of reliability and speed. In summary, GAs seem a suitable choice for those planning applications where response time is an important factor, and results which are close enough to the global optimum are still considered acceptable such as in concurrent assembly planning, where response time is a key factor when assessing the validity of a product design configuration in terms of the performance of its assembly plan.     

Solving capacitated part‐routing problems with setup times and costs: a Dantzig–Wolfe decomposition‐based solution approach

We develop a Dantzig–Wolfe decomposition‐based approach for solving the capacitated part‐routing problem with routing flexibilities, setup times, and setup costs. Large instances of the problem are solved to near‐optimality using the proposed approach. The computational performance of the approach is compared with that of the existing Lagrangean relaxation‐based approach in terms of solution quality and computational times.     

离散线性时滞系统的次优控制:逐次逼近法

A successive approximation approach for designing optimal controllers is presented for discrete linear time-delay systems with a quadratic performance index. By using the successive approximation approach, the original optimal control problem is transformed into a sequence of nonhomogeneous linear two-point boundary value (TPBV) problems without time-delay and time-advance terms. The optimal control law obtained consists of an accurate feedback terms and a time-delay compensation term which is the limit of the solution sequence of the adjoint equations. By using a finite-step iteration of the time-delay compensation term of the optimal solution sequence, a suboptimal control law is obtained. Simulation examples are employed to test the validity of the proposed approach.     

基于串空间模型的Athena方法的改进

Athena分析方法由于没有抽象更多的密码学原语,因此不能分析较复杂的安全协议。该文针对互联网密钥交换协议(IKEv2),对Athena方法进行了扩展：修改消息项结构,扩展密码学原语,使其能分析DH（Diffie-Hellman）密钥协商问题,修改内在项关系,使其能应对更复杂的消息构造情况,并对相关命题和定理进行了证明。根据扩展后的Athena方法,对IKEv2协议的秘密性和认证性等进行了分析,对协议的特点作了进一步讨论。     

一种故障检测滤波器的多目标优化设计方法

提出一种基于观测器的故障检测滤波器的非凸多目标优化设计方法.针对线性时不变动态系统,构建一个由输出观测器和后滤波器组成的故障检测滤波器,将其残差动态特性描述为非凸的双线性矩阵不等式形式.利用双线性矩阵不等式中可完全平方非正定项的上界替代原非正定项,将双线性矩阵不等式转化为一组线性矩阵不等式,进而获得多目标优化问题的可解条件以及观测器增益与后滤波器矩阵的求解方法.仿真算例说明了算法的有效性.     

基于改进向量空间模型的话题识别与跟踪

话题识别与跟踪旨在发展一系列基于事件的信息组织技术,通过监测以实现对新闻媒体信息流中新话题的自动识别和已知话题的动态跟踪。文中提供一种利用改进的向量空间模型进行识别和跟踪的方法。没有使用传统向量空间模型中单个向量,而是按照语义将特征词划分为4个组(人物、时间、地点、内容)并形成4个向量空间。每个空间进行独立的权重计算和相似度计算。实验证明这些方法是有效的。     

DRM multidomain mass conservative interpolation approach for the BEM solution of the two-dimensional navier-stokes equations

The dual reciprocity method (DRM) is a technique to transform the domain integrals that appear in the boundary element method into equivalent boundary integrals. In this approach, the nonlinear terms are usually approximated by an interpolation applied to the convective terms of the Navier-Stokes equations. In this paper, we introduce a radial basis function interpolation scheme for the velocity field, that satisfies the continuity equation (mass conservative). The proposed method performs better than the classical interpolation used in the DRM approach to represent such a field. The new scheme together with a subdomain variation of the dual reciprocity method allows better approximation of the nonlinear terms in the Navier-Stokes equations.     

实时形状匹配变形体动画

给出了一个仿真变形体的方法。物体被几何方法推动变形,操纵基于点的物体并且不需要连接信息,这是一个不需要任何预处理,计算简单,并提供无条件稳定的动态仿真方法。主要思想是通过几何约束替换能量和通过当前位置到目标位置的距离替换力。这些目标位置通过一个通用的无变形的静止状态和点云的当前变形状态之间的形状匹配来决定,因为点总是在定义好的位置被绘制,显式积分方法的过度不稳定问题被消除。相关物体表现方法的灵活性能被控制,相关内存和计算是有效的,动态仿真上的无条件稳定性让这个方法特别适合游戏开发。     

逻辑函数的卡诺图化简法

从卡诺图化简法与公式化简法的比较入手,说明卡诺图化简法的优点及适用范围,阐述了卡诺图的特点、最小项的定义和性质、用卡诺图化简逻辑函数的基本原理以及化简是否达到最简形式的判定标准。然后给出了具体实例来诠释卡诺图化简法并给出其应用的一般步骤。最后总结出卡诺图化简法易出错的几种情况,从而得出用卡诺图化简逻辑函数的一般方法。     

Suboptimal Control for Discrete Linear Systems with Time-delay:A Successive Approximation Approach

A successive approximation approach for designing optimal controllers is presented for discrete linear time-delay systems with a quadratic performance index.By using the successive approximation approach,the original optimal,control problem is transformed into a sequence of nonhomogeneous linear two-point boundary value (TPBV) problems without time-delay and time- advance terms.The optimal control law obtained consists of an accurate feedback terms and a time-delay compensation term which is the limit of the solution sequence of the adjoint equations. By using a finite-step iteration of the time-delay compensation term of the optimal solution sequence, a suboptimal control law is obtained.Simulation examples are employed to test the validity of the proposed approach.