实用下料问题的自适应算法

在不考虑材料厚度、切割方向和原材料材质的假设下,针对单一原材料的一维和二维下料问题建立了整线性规划模型。在模型求解过程中,提出了模板思想及一系列相关概念,借用自动控制原理中的优先级排序思想和自适应理论,不断更新模板,在满足要求时间内完成生产任务并且充分地利用材料的前提下获得较优的解。     

Optimal Preemptive Scheduling in Multiprocessor Systems with Incomplete Communication Graph

The problem of work scheduling in a multiprocessor system is solved with specific processing requirement, release time and due date. Interruptions and preemptions are given. The communication graph may be incomplete. A polynomial algorithm of determining a feasible schedule is developed. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 94–102, May–June 2005.     

禁止任务抢占法在实时嵌入式系统中的实现

提出了一种基于任务优先级的禁止抢占法，并分析了该方法的安全性和高效性，给出了具体实现的算法，在实际应用中有非常高的参考价值。     

铝土矿化学矿物计算法

在简单评析了铝土矿矿物分析的各种手段之后，指出了铝土矿矿物成分计算的优势－－简便、快速。给出了铝土矿物计算的理论依据－－物化述了矿物计算的二个原则及计算过程。最后介绍了一种矿物计算的计算机软件。     

Job shop scheduling using fuzzy logic

In a flexible manufacturing system (FMS) scheduling problems become extremely complex, even for simple breakdowns, when dynamic uncertainties such as machine breakdowns and the uncertain arrival of jobs are taken into consideration. In the first stage of this study, a fuzzy logic-based algorithm for assigning priorities to part types that are to be machined is proposed. In the second stage, an operation-machine allocation and scheduling algorithm is presented. A criteria contribution equalizer is used in decision-making. The proposed algorithm can re-generate the schedule in case of a machine breakdown, and therefore can be used as an on-line controller. The system architecture and linguistic variables are presented and results showed that the proposed algorithm improves the system efficiency.     

采用多机技术的飞行控制与管理计算机设计

介绍了多机技术在飞行控制与管理计算机中的应用，重点介绍了系统自检、访问权限控制及系统动态重构的具体实现方法。     

Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty

In classical Constraint Satisfaction Problems (CSPs) knowledge is embedded in a set of hard constraints, each one restricting the possible values of a set of variables. However constraints in real world problems are seldom hard, and CSP's are often idealizations that do not account for the preference among feasible solutions. Moreover some constraints may have priority over others. Lastly, constraints may involve uncertain parameters. This paper advocates the use of fuzzy sets and possibility theory as a realistic approach for the representation of these three aspects. Fuzzy constraints encompass both preference relations among possible instantiations and priorities among constraints. In a Fuzzy Constraint Satisfaction Problem (FCSP), a constraint is satisfied to a degree (rather than satisfied or not satisfied) and the acceptability of a potential solution becomes a gradual notion. Even if the FCSP is partially inconsistent, best instantiations are provided owing to the relaxation of some constraints. Fuzzy constraints are thus flexible. CSP notions of consistency and k-consistency can be extended to this framework and the classical algorithms used in CSP resolution (e.g., tree search and filtering) can be adapted without losing much of their efficiency. Most classical theoretical results remain applicable to FCSPs. In the paper, various types of constraints are modelled in the same framework. The handling of uncertain parameters is carried out in the same setting because possibility theory can account for both preference and uncertainty. The presence of uncertain parameters leads to ill-defined CSPs, where the set of constraints which defines the problem is not precisely known.     

具有丢失优先级策略的输入／输出排队ATM交换机的性能分析

本文分析了一种输入排队缓冲器有丢失优先级的内部无阻塞输入／输出排队ＡＴＭ交换机在反压控制下的信元丢失指标。在每个输入端口高、低优先级信元的到达具有相同的强度，到达输出端口的概率相同为１Ｎ，且输入、输出缓冲容量均为有限。为保证交换机内部不发生信元丢失，引入了反压机制（Ｂａｃｋｐｒｅｓｓｕｒｅ）。文中表明，使用丢失优先级策略的交换机比纯输入／输出排队交换机更能满足不同业务服务等级ＱｏＳ（ＱｕａｌｉｔｙｏｆＳｅｒｖｉｃｅ）的丢失要求，而且所需缓冲容量减少。     

A Performance Evaluation of a Dynamic Source Routing Discovery Optimization Protocol Using GPS System

Ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable, and movement of communicating parties is allowed. Therefore, such networks are designed to operate in widely varying environments, from military networks to low-power sensor networks and other embedded systems. Frequent topology changes caused by node mobility make routing in ad hoc wireless networks a challenging problem. In this paper, we propose an optimization technique, which we refer to as GDSR, a reactive protocol that makes use of DSR scheme and the Global Positioning System (GPS). As opposed to the DSR protocol our GDSR scheme consists of propagating the route request messages only to the nodes that are further away from the query source. We discuss the algorithm, its implementation and present an extensive simulation and experimental results to study its performance. We also present a comparative study of GDSR protocol with the existing DSR protocol. Our results clearly indicate that the GDSR protocol outperforms the DSR protocol by significantly decreasing the number of route query packets thereby increasing the efficiency of the network load. Furthermore, we show that a careful GPS screening angle is an important factor in the success of GDSR ad hoc routing protocol.     

A New Backup-VP Priority Restoration Methodfor ATM Survival Networks

ＡＮｅｗＢａｃｋｕｐ－ＶＰＰｒｉｏｒｉｔｙＲｅｓｔｏｒａｔｉｏｎＭｅｔｈｏｄｆｏｒＡＴＭＳｕｒｖｉｖａｌＮｅｔｗｏｒｋｓＣｈｅｎＳｈａｎｚｈｉ；ＣｈｅｎｇＳｈｉｄｕａｎａｎｄＣｈｅｎＪｕｎｌｉａｎｇ（ＳｔａｔｅＫｅｙＬａｂｏｒａｔｏｒｙｏｆＳｗｉｔｃ...