Robust finite-time boundedness of multi-agent systems subject to parametric uncertainties and disturbances

In this paper, we consider finite-time control problems for linear multi-agent systems subject to exogenous constant disturbances and impulses. Some sufficient conditions are obtained to ensure the finite-time boundedness of the multi-agent systems, which could be then reduced to a feasibility problem involving linear matrix inequalities. Numerical examples are given to illustrate the results.     

Feasibility refinement in sequential quadratic programming using parametric sensitivity analysis

In this paper we present results that extend the sequential quadratic programming (SQP) algorithm with an additional feasibility refinement based on parametric sensitivity derivatives. The refinement is applicable without restriction on the problem dimensions in sparse SQP solvers. Parametric sensitivity analysis is a tool for post optimality analysis of the solution of a nonlinear optimization problem. For the refinement approach we apply this technique on the quadratic subproblems in order to improve the overall algorithm. The sensitivity derivatives required for this approach can be computed without noticeable computational effort as the system of linear equations to be solved coincides with the system already solved for the search direction computation. For similar algorithms in the context of post optimality analysis a linear rate of convergence has been proven and therefore an extrapolation method is applied to speed up the process. The presented algorithm has been integrated into the nonlinear program (NLP) solver WORHP and we perform a numerical study to evaluate different termination criteria for the proposed algorithm. Furthermore, numerical results on the CUTEst test set are shown.     

基于Cosserat连续体理论的疲劳寿命概率可靠性分析

基于Cosserat连续体理论建立考虑应变梯度效应的粉末高温合金弹塑性模型.该模型考虑微尺度长度效应,并能消除缺陷局部化问题求解时的网格依赖性.基于参变量变分原理提出一种高效的求解方法,该方法将原非线性问题转化为互补问题求解,可大大提高求解效率和收敛性.针对一种假想涡轮盘模型,将Cosserat尺度参数和Basquin斜率作为随机变量,分别采用蒙特卡洛法与二阶矩法进行疲劳寿命概率可靠度计算.结果表明二阶矩法在保证精度的情况下具有较高的效率.     

A comparison of local parametric C Bézier interpolants for triangular meshes

Parametric curved shape surface schemes interpolating vertices and normals of a given triangular mesh with arbitrary topology are widely used in computer graphics for gaming and real-time rendering due to their ability to effectively represent any surface of arbitrary genus. In this context, continuous curved shape surface schemes using only the information related to the triangle corresponding to the patch under construction, emerged as attractive solutions responding to the requirements of resource-limited hardware environments. In this paper we provide a unifying comparison of the local parametric C⁰ curved shape schemes we are aware of, based on a reformulation of their original constructions in terms of polynomial Bézier triangles. With this reformulation we find a geometric interpretation of all the schemes that allows us to analyse their strengths and shortcomings from a geometrical point of view. Further, we compare the four schemes with respect to their computational costs, their reproduction capabilities of analytic surfaces and their response to different surface interrogation methods on arbitrary triangle meshes with a low triangle count that actually occur in their real-world use.     

GS—ZDDS中的自定义特征

在自主开发的二维参数化绘图软件中,提出了一种用于与用户专业设计程序相集成的自定义特征的概念,实现了设计计算过程的信息共享和局部并行,提高了设计效率,体现了设计构件重用的思想,并且大大减小了用户专用的设计系统开发的工作量,系统具有良好的可扩展性。     

近似弧长参数化的三次保形插值

在构造近似弧长参数化曲线时,必须添加某些额外的数据点,以获得足够的近似弧长参数化精度,对于参数三次曲线,给出了一个“双点单位化”的近似弧长参数化公式,为如何选择这些额外数据点提供了理论依据,所给出的方法既能有效地提高近似弧长参数化精度,同时又满足了保形插值的要求。     

Parametric Sequence Alignment with Constraints

Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries.     

Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$

Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 60–74, May–June 2008.     

活塞加工的计算机辅助工艺过程设计

本文介绍一个在微机上实现的活塞CAPP系统,它具有适合于活塞结构与工艺特点的分段层次式混合编码输入系统和嵌入式知识基形式的工艺决策系统,可自动生成包括工艺规程、工序卡、相应刀、夹、量、辅具的全套完整工艺文件。在工序图自动绘制方面,本文还提出了一种“半参数化”自动生成技术。     

基于参数化的弧齿锥齿轮建模仿真和加工

基于参数化设计思想,以弧齿锥齿轮为研究对象,建立了渐开线方程,生成准确的齿形,实现了不同模数、齿数齿轮的快速造型;通过仿真和分析弧齿锥齿轮的运动和数控加工,预先发现和改进实际加工出现的问题,降低了生产成本,提高了生产效率。