MPC850中复位逻辑和CPM协议切换的CPLD实现

介绍了用CPLD辅助设计方法在嵌入式系统中进行MPU复杂逻辑功能设计的总体方案。给出了通过对XC5144中复用控制寄存器进行配置以实现MPU复位逻辑和CPM协议切换的实现方案和设计要点。     

A robust critical path in an environment with hybrid uncertainty

In this article, we consider the project critical path problem in an environment with hybrid uncertainty. In this environment, the duration of activities are considered as random fuzzy variables that have probability and fuzzy natures, simultaneously. To obtain a robust critical path with this kind of uncertainty a chance constraints programming model is used. This model is converted to a deterministic model in two stages. In the first stage, the uncertain model is converted to a model with interval parameters by alpha-cut method and distribution function concepts. In the second stage, the interval model is converted to a deterministic model by robust optimization and min-max regret criterion and ultimately a genetic algorithm with a proposed exact algorithm are applied to solve the final model. Finally, some numerical examples are given to show the efficiency of the solution procedure.     

基于VB6.0的PLC监控系统的设计

主要阐述了VB6.0与欧姆龙CPM2AH PLC如何实现串行通信,给出了读、写测试方法,并实现了VB对PLC的监控.     

Test frame updating in CPM testing of Prolog programs

Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand, it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults that are more likely to show their presence in the use of the program under consideration. Our test frame updating method preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns semantics is proposed, and the test frame updating on the semantics is illustrated by an example.

PLC在空压机改造中的应用

本文系统阐述了可编程序控制系统在工厂空压机控制系统中的应用以及使用要点。     

Fuzzy uncertainty modelling for project planning: application to helicopter maintenance

Maintenance is an activity of growing interest, especially for critical systems. In particular, aircraft maintenance costs are becoming an important issue in the aeronautical industry. Managing an aircraft maintenance centre is a complex activity. One of the difficulties comes from the numerous uncertainties that affect the activity and disturb the plans in the short and medium term. Based on a helicopter maintenance planning and scheduling problem, we study in this paper the integration of uncertainties into tactical and operational multi-resource, multi-project planning (respectively Rough Cut Capacity Planning and the Resource Constraint Project Scheduling Problem). Our main contributions are in modelling the periodic workload on a tactical level considering uncertainties in macro-task work content, and modelling the continuous workload on the operational level considering uncertainties in task duration. We model uncertainties using a fuzzy/possibilistic approach instead of a stochastic approach since very limited data are available. We refer to the problems as the Fuzzy Rough Cut Capacity Problem (FRCCP) and the Fuzzy Resource Constraint Project Scheduling Problem (RCPSP). We apply our models to helicopter maintenance activity within the frame of the Helimaintenance project, an industrial project approved by the French Aerospace Valley cluster that aims at building a centre for civil helicopter maintenance.     

Single-machine scheduling of two activities with slack： CPM to minimize the total tardiness

Recently K.Chris studied single-machine schedu-ling with time windows(STW)[1].In project manage-ment,the CPM algorithm computes a time windowwhich defined by the early start and late finishes timesfor each activity.In fact,activity slack is attained bytim…     

基于分布式并行产品开发的项目管理系统设计

根据分布式环境下并行产品开发的特点 ,提出了项目管理系统体系结构的设计 ,采用图示化方法建立了项目任务流网络模型 ,同时对原型系统中各模块的功能设计进行了描述 ,保证了系统对产品开发过程中的任务流程进度进行正确的管理与监控 ,使产品开发收敛于预定目标     

多径信道中OFDM系统的优化设计

多径衰落是多径信道中存在的最大问题.连续相位调制正交频分复用信号(OFDM-CPM)是一种将连续相位调制技术(CPM)应用于正交频分复用(OFDM)系统的新思路,它具有良好的相位平滑转移特性、较高的频带利用率和较低的误码率,它可以有效提高系统的抗多径衰落能力和信道利用率.在多径信道中,对OFDM-CPM信号进行了研究并详细推导出了该系统的数学模型.仿真结果显示,该信号具有比OFDM-PSK信号更优秀的误码率(BER)表现,因此证明了该思路的有效性和可行性.     

Computational methods for determining the latest starting times and floats of tasks in interval-valued activity networks

In project management, three quantities are often used by project managers: the earliest starting date, the latest starting date and the float of tasks. These quantities are computed by the Program Evaluation and Review Techniques/Critical Path Method (PERT/CPM) algorithm. When task durations are ill known, as is often the case at the beginning of a project, they can be modeled by means of intervals, representing the possible values of these task durations. With such a representation, the earliest starting dates, the latest starting dates and the floats are also intervals. The purpose of this paper is to give efficient algorithms for their computation. After recalling the classical PERT/CPM problem, we present several properties of the concerned quantities in the interval-valued case, showing that the standard criticality analysis collapses. We propose an efficient algorithm based on path enumeration to compute optimal intervals for latest starting times and floats in the general case, and a simpler polynomial algorithm in the case of series-parallel activity networks.