Scheduling UET task systems with concurrency on two parallel identical processors

Problems with unit execution time tasks and two identical parallel processors have received a great deal of attention in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a situation when a task may require both processors simultaneously. For problems without precedence constraints we present several polynomial time algorithms which complement recent results of Lee and Cai. We also show that the introduction of precedence constraints leads to NP-hardness results for maximum lateness and mean flow time objective functions. For the maximum lateness problem, a family of algorithms, based upon the idea of modified due dates, is considered. The worst case behaviour of these algorithms is analysed, and it is shown that the same upper bound is tight for each algorithm of this family.     

The AURORA Financial Management System: Model and Parallel Implementation Design

The AURORA financial management system under development at the University of Vienna is a modular decision support tool for portfolio and asset–liability management. It is based on a multivariate Markovian birth-and-death factor model for the economic environment, a pricing model for the financial instruments and an objective function which is flexible enough to express risk aversion.The core of the system is a large scale linear or convex program, which due to its size and structure is well suited for parallel optimization methods.As the system is still at an early stage of development, the results are preliminary in nature. Only a few types of financial instruments are handled and just two types of objectives are considered. The parallel optimization modules are still in the development phase.     

Convergence of some asynchronous nonlinear multisplitting methods

Frommer's nonlinear multisplitting methods for solving nonlinear systems of equations are extended to the asynchronous setting. Block methods are extended to include overlap as well. Several specific cases are discussed. Sufficient conditions to guarantee their local convergence are given. A numerical example is presented illustrating the performance of the new approach.     

一种抗高阶旁路攻击的LED密码算法

LED密码算法是2011年提出的超轻量级密码算法,主要是为资源受限下物联网加密应用研发的.轻量级密码算法结构相对简单,更容易被旁路攻击成功.随机掩码是一种有效抗旁路攻击的方法,在深入LED密码算法结构研究的基础上,提出一种全随机掩码的LED密码算法CMLED.论述了CMLED算法的设计方法,从形式化方面给出了抗高阶旁路攻击选择掩码的原则.同时,对全随机掩码的CMLED与原始算法进行了硬件资源占用与加密效率对比,实验表明CMLED仍然可以高效地在智能卡上实现.     

卫星数传接收规划模型与算法研究

作为对地观测卫星任务执行的两个重要阶段之一,数传接收的规划任务是一个具有多时间窗口、多优化目标和多资源约束的NP-Hard优化问题。中继星的引入为数据全天候近实时传输提供可能,同时也为数传规划提出新的问题。本文主要完成两项工作:第一,建立风险控制的卫星数传接收规划模型;第二,阐述基于遗传禁忌的模型求解方法,进一步采用分布式并行求解策略,改善了求解算法的收敛速度和鲁棒性。最后,通过STK提供基础仿真数据,验证了本文规划模型和求解算法的有效性。     

Modelling and control of flexible joint robot based on Takagi–Sugeno fuzzy approach and its stability analysis via sum of squares

This article proposes a Takagi–Sugeno (T-S) fuzzy model of single-link rotary flexible joint robot. The proposed control method is based on parallel distributed control. The parameters of T-S controller are improved by distributed population genetic algorithm (GA) with chaos GA. Using Hermite–Biehler theorem in distributed population, GA is made to have a fast convergence. Dividing search space into several sub-spaces causes a better response, and chaos disturbance helps the whole algorithm to reach a best answer. The stability of the controller is analysed via the sum of squares programming, and finally, it is implemented on the plant.     

压电材料中两个非对称平行裂纹的基本解

采用Schmidt方法分析压电材料中非对称平行的双可导通裂纹的断裂性能．利用Fourier变换使问题的求解转换为求解两对以裂纹面位移之差为未知变量的对偶积分方程．为了求解对偶积分方程,直接把裂纹面位移差函数展开成Jacobi多项式形式．最终得到了裂纹的应力强度因子与电位移强度因子之间的关系．数值结果表明,应力强度因子和电位移强度因子与裂纹间的距离、裂纹的几何尺寸有关;与不可导通裂纹有关结果相比,可导通裂纹的电位移强度因子远小于相应问题不可导通裂纹的电位移强度因子．同时可以发现裂纹间的“屏蔽”效应也在压电材料中出现．     

凸域的外平行集的包含测度

本文研究了凸域内定长线段的包含测度问题,利用广义支持函数和限弦函数,得到了一类特殊凸域的包含测度.     

外平行凸体的平均值

本文研究了外平行凸体Kρ在任意(n-r)维平面上的正交投影( Kρ)′n-r,利用K的均质积分,得到了( Kρ)′n-r的面积平均值,体积平均值以及平均曲率的任意阶积分的平均值.     

线性互补问题的异步并行多分裂松弛迭代算法

将求解线性方程组的异步并行多分裂松弛迭代算法推广到线性互补问题.当问题的系数矩阵为H-矩阵类时,证明了算法的全局收敛性.