单机实时系统中的一种混合型实时容错调度算法

目前研究单机实时系统的调度算法文章大多只能调度单一类型的任务。本文在PKSA算法的基础上，建立了一种混合型实时容错模型，提出一种调度算法不仅可以调度有容错需求的周期任务，同时也能够调度无容错需求的周期任务和非周期非实时任务，实现了调度混合型任务的目的。     

基于漏斗模型的生产计划与控制方法

本文介绍了一种新的生产调度方法──基于漏斗模型的生产计划与控制方法，讨论了流量图模型描述方法，面向负荷的订单投放方法等一些重要的概念和技术，并且介绍了一个基于此方法的生产调度万法仿真模型系统。     

并行查询中的进程分配与调度

本文主要研究了并行查询中的多进程分配与调度技术，提出了并行查询的数据流执行图模型和并行进程的集中式两级调度模型。数据流执行图模型准确地刻画了并行进程间的同步关系，两级调度模型克服了单纯自上而下调度和单纯自下而上调度技术存在的不足。最后，用一个并行查询示例解释了并行进程调度中的控制信息流动。     

时间资源调度模型

本文首先提出Ｐｅｔｒｉ网调度模型的三个层次及其构造算法，在此基础上重点讨论第三个层次；时间资源调度模型－改进的Ｐｅｔｒｉ网模型，本文还给出一个相庆的调度算法，我们提出的调度模型对调度问题的描述极为清晰，对调度求解提供了一个强有力的工具。     

实现QoS的常用队列调度算法

作为保证QoS的一种重要的手段，队列调度算法近年来引起了网络研究者的广泛关注。本文首先介绍了队列调度算法在理论框架中的位置与背景，然后对传统的优先级算法、轮循算法进行了介绍，重点讨论了基于GPS(通用处理器共享)流模型的PFQ调度算法及最常用的一种实现模型WFQ。     

调度问题的压缩Petri网（RePN）模型研究

本文提出了一种新的Ｐｅｔｒｉ网模型－压缩Ｐｅｔｒｉ网（ＲｅＰＮ）模型，用于调度问题的建模和求解，与以前的模型相比，ＲｅＰＮ模型不仅具有较强的分析能力，而且大大减少了节点数，使可达集杨应减小，从而为搜索调度问题的最优解或近优解提供了方便。     

ON-OFF过程模拟突发业务在调度仿真中的应用研究

介绍了一种使用0N-OFF模型完成网络突发业务建模的方法，并且利用该模型完成了突发业务在输入排队调度中的仿真，为下一步研究开发在突发业务条件下具有鲁棒性的输入排队调度算法打下了基础。     

基于混合线性反馈控制结构的软实时调度算法研究

针对CPU资源实时调度模型的时变、非线性等特点，提出一种基于混合反馈控制结构的软实时调度算法，有效地解决了实时系统的非线性，实现了全局线性化反馈，改善了实时系统的稳态和动态响应特性，同时对系统模型的时变参数具有较好的鲁棒性，提高了资源的利用率．     

Job-Shop调度问题的仿真研究

Job-Shop是离散事件系统中典型的调度问题，通过计算机仿真能够动态地展现Job-Shop车间的状态，分析在不同调度方法下的系统性能，并运用知识和经验去选择合适的调度方法，从而改善调度性能。本文构造了Job-Shop的离散事件仿真模型，设计了基于事件驱动的仿真策略，并讨论了优先调度准则，为解决这一问题提供了一种现实可行的思路与方法。     

用Petri网模拟两级分布调度算法

用Ｐｅｔｒｉ网描述了两级分布调度算法，在此模型上，定义了分布调度算法的稳定性，最后，基于此模型，证明了两级分布调度算法是稳定的。     

Single-machine group scheduling problems with deteriorating and learning effect

The concepts of deteriorating jobs and learning effects have been individually studied in many scheduling problems. However, most studies considering the deteriorating and learning effects ignore the fact that production efficiency can be increased by grouping various parts and products with similar designs and/or production processes. This phenomenon is known as ‘group technology’ in the literature. In this paper, a new group scheduling model with deteriorating and learning effects is proposed, where learning effect depends not only on job position, but also on the position of the corresponding job group; deteriorating effect depends on its starting time of the job. This paper shows that the makespan and the total completion time problems remain polynomial optimal solvable under the proposed model. In addition, a polynomial optimal solution is also presented to minimise the maximum lateness problem under certain agreeable restriction.     

DCFT-Kernel:一种基于组服务的机群容错管理系统的设计与实现

高可用和容错已经成为衡量机群系统(简称机群)的一个重要指标,随着机群的规模越来越庞大,如何实现大规模机群下的容错管理软件成为了技术难点．以传统分布式系统中的组通信技术为基础,采用将复杂的系统“分而治之”的思想,提出了组服务技术,可以解决容错管理软件的可扩展性和高可用性．同时,在组服务技术的基础上,结合实时的事件服务技术实现了一个大规模机群下的容错管理系统DCFT—Kernel,介绍了实现组服务和DCFT-Kernel的主要技术问题,并且对DCFT—Kernel的性能进行了分析．     

A heuristic algorithm for group scheduling

Group technology is a rapidly developing productivity improvement tool that can have a significant impact on the development of totally integrated manufacturing facilities and flexible manufacturing systems. Production scheduling associated with group technology is called “Group Scheduling”. There are many heuristic algorithms developed for general job shop applications based on unrealistic hypothesis, complicated computations etc., which are not addressed to group scheduling. In this paper, from the existing algorithms for group scheduling, a heuristic algorithm has been developed and programmed for computer/microcomputer applications. The developed algorithm has been used to determine the optimal group and the optimal job sequence for a batch type production process with functional layout. The developed algorithm is far simpler and easier to compute, compared to the other similar heuristic algorithms and certainly in comparison to other optimization methods such as branch and bound method.     

广义p -中位模型的遗传算法

针对制造业成组技术中采用的广义ｐ－中位模型,设计了适当的遗传算法。实验结果表明,该算法能在较短时间内给出这类ＮＰ完备问题的满意解。     

Optimization‐based group performance deducing

Large‐scale group performance animation has been an important research topic because of its diverse range of applications including virtual rehearsal and film production. Animating hundreds of virtual actors as what the director wishes is a tough task. In this paper, we address this challenge by introducing an optimization method that generates large‐scale group performance by deducing a small‐scale one with fewer actors. We introduced group motion bigraph technique and transformed the motion‐deducing problem into a constrained optimization problem. A solving process is then presented to automatically obtain the motion of the large group with velocity constraints. Moreover, an interactive system of constructing the group motion bigraph has been implemented, which provides flexible edit and control on deducing group motion. The animation results show that our method is competent for deducing large‐scale group performance from only several motion clips performed by small groups. Copyright © 2013 John Wiley & Sons, Ltd.     

A group key agreement protocol for intelligent internet of things system

The application of intelligent computing in Internet of Things (IoTs) makes IoTs systems such as telemedicine, in-vehicle IoT, and smart home more intelligent and efficient. Secure communication and secure resource sharing among intelligent terminals are essential. A secure communication channel for intelligent terminals can be established through group key agreement (GKA), thereby ensuring the security communication and resource sharing for intelligent terminals. Taking into account the confidentiality level of the shared resources of each terminal, and the different permissions of the resource sharing of each terminal, a GKA protocol for intelligent IoTs is proposed. Compared with previous work, this protocol mainly has the following advantages: (1) The hidden attribute identity authentication technology can achieve the security of identity authentication and protect personal privacy from being leaked; (2) Only intelligent terminals satisfying the threshold required of the GKA can participate in the GKA, which increases the security of group communication; (3) Low-level group terminals can obtain new permissions to participate in high-level group communication if they meet certain conditions. High-level group terminals can participate in low-level group communication through permission authentication, which increases the flexibility and security of group communication; (4) The intelligent terminals in the group can use their own attribute permission parameters to calculate the group key. They can verify the correctness of the calculated group key through a functional relationship, and does not need to exchange information with other members in the same group. Under the hardness assumption of inverse computational Diffie-Hellman problem and discrete logarithm problem, it is proven that the protocol has high security, and compared with the cited literatures, it has good advantages in terms of computational complexity, time cost and communication energy cost.     

基于微粒群优化的非线性方程组求解研究

在科学技术和工程应用中经常遇到求解非线性方程组的问题。提出了一种求解非线性方程组的通用数值方法。将非线性方程组的求解问题转化为函数优化问题,通过微粒群优化对其进行求解,最终得到非线性方程组较高精度的解。一系列测试实例显示了该算法在求解非线性方程组时具有简单性、高效性和普适性。     

视频群体行为识别综述

群体行为识别是指给定一个包含多人场景的视频,模型需要识别出视频中多个人物正在共同完成的群体行为.群体行为识别是视频理解中的一个重要问题,可以被应用在运动比赛视频分析、监控视频识别、社交行为理解等现实场景中.多人场景视频较为复杂,时间和空间上的信息十分丰富,对模型提取关键信息的能力要求更高.模型只有高效地建模场景中的层次化关系,并为人物群体提取有区分性的时空特征,才能准确地识别出群体行为.由于其广泛的应用需求,群体行为识别问题受到了研究人员的广泛关注.对近几年来群体行为识别问题上的大量研究工作进行了深入分析,总结出了群体行为识别研究所面临的主要挑战,系统地归纳出了6种类型的群体行为识别方法,包含传统非深度学习识别方法以及基于深度学习技术的识别方法,并对未来研究的可能方向进行了展望.     

数字表演仿真系统

为了解决大型团体表演中创意预期与创意效果呈现不一致的问题,采用大规模人群仿真技术实现了表演过程中演员行为的仿真,采用层次细节绘制、基于图像绘制、预渲染光影以及几何体实例化等方法实现了表演场面的高效绘制。实现了一个以虚拟现实平台Virtools为载体的数字表演仿真系统,该系统对大型团体表演的整个过程进行了仿真,使编创人员在创意初期就能对创意的呈现结果有直观认识。实验结果表明,该系统为大型团体表演编创人员进行创意编排、创意效果预览提供方便,为艺术创意完美展现于大型团体表演中提供了可能。     

工件带到达时间并具有成组约束的车间排序算法

针对模具制造过程的特点,在工件不同时到达的情况下,研究了前阶段带有成组约束的两阶段柔性同序加工车间的调度问题,建立了目标函数为最小化最大完成时间的调度数学模型,基于Potts的RJ’算法提出解决此类问题的启发式算法,并将该算法应用到轮胎模具企业的生产实例中,通过仿真说明数学模型和求解方法的可靠性和有效性。