氯碱化工厂计算机智能调度系统

应用研华工控机及ＡＤＡＭ４０００模块，通过４８５总线对大型氯碱化工厂的重要参数进行集中监测，便于调度人员进行及时准确的调度。系统在中文ＷｉｎｏｗｓＮＴ４．０Ｗｏｒｋｓｔａｔｉｏｎ环境下采用面向对象的编程语言ＢｏｒｌａｎｄＣ＋＋Ｂｕｉｌｄｅｒ进行编程，界面友好。     

用DDE实现AutoCAD二次开发的研究

文章对服务器与客户之间应用ＤＤＥ特性进行了探讨，分析了在ＢｏｒｌａｎｄＣ＋＋的环境中用ａｄｓ＿ｄｄｅ二次开发ＡｕｔｏＣＡＤ的支撑软件。     

用Borland C＋＋4.5设计Windows应用程序

本文介绍了一种用ＢｏｒｌａｎｄＣ＋４．５提供的Ｂｏｒｌａｎｄ ＡｐｐｌｉｃａｔｉｏｎＥｘｐｅｒｔ（ＡｐｐＥｘｐｅｒｔ）和ＣｌａｓｓＥｘｐｅｒｔ专家系统工具建立Ｗｉｄｎｏｗｓ应用程序的简单方法。分两步进行，首先建立应用程序外壳，然后修改各项，增加新功能，以满足程序的所有要求。     

用VisiBroker开发CORBA程序

本文简要介绍了ＣＯＲＢＡ并以一个实例叙述了如何在Ｃ＋＋Ｂｕｉｌｄｅｒ４企业版环境下ＶｉｓｉＢｒｏｋｅｒ（ｆｏｒ Ｃ＋＋Ｂｕｉｌｄｅｒ）开发ＣＯＲＢＡ应用程序。     

Windows下西文AutoCAD12.0汉化浮动菜单的ads编程实现

本文利用Ｗｉｎｄｏｗｓ下的动态数据交换（ＤＤＥ）特性，对在西文Ａｕｔｏ－ＣＡＤ１２．０的工作平台上开发汉化浮动菜单进行了研究，并在Ｂｏｒｌａｎｄｃ＋＋的环境中用ａｄｓ语言编程实现了一个ＤＤＥ程序，在ＡｕｔｏＣＡＤ的工作平台上生成良好的汉化浮动菜单框     

Windows下西文AutoCAD12.0汉化浮菜单的ads编程实现

本文利用Ｗｉｎｄｏｗｓ下的动态数据交换性，对在西文ＡｕｔｏＣＡＤ１２．０的工作平台上开发汉字化浮动菜单进行了研究，并在Ｂｏｒｌａｎｄｃ＋＋的环境中用ａｄｓ语言编实现了一个ＤＤＥ程序，在ＡｕｔｌＣＡＤ的工作平台上生成良好的汉化浮动菜单框。     

B^＋树它引文件结构的优化设计

指出当普通Ｂ＾＋树的数据块设计为定长时,数据块长度的选择具有一个最优的选取设计过程。给出了在两种数据库系统模型中,对Ｂ＾＋树索引文件结构的优化设计：⑴在具有限量内存在数据库系统ＤＢＳＬＡＭ（Ｄａｔａｂａｓｅ Ｓｙｓｔｅｍｓ ｗｉｔｈ Ｌｉｍｉｔｅｓｄ Ａｍｏｕｎｔ ｏｆ Ｍａｉｎ Ｍｅｍｏｒｙ）模型中,只有缓存Ｂ＾＋树中的部分结点;⑵具有极大数量内存在的数据库系统ＤＢＳＶＬＡＭ（Ｄａｔａｂａｓｅ     

舰船横剖面曲线程序设绘方法

介绍了ＦｏｘＢＡＳＩ＾＋和ＡｕｔｏＬｉｓｐ语言编程，在ＡｕｔｏＣＡＤ环境下程序设绘横剖面曲线的方法。给出了绘制曲线的通用Ｌｉｓｐ程序。     

基于ASP的Web应用中数据库图像数据的处理

我们以图像数据为例,以ＭｉｃｒｏｓｏｆｔＳＱＬＳｅｒｖｅｒ６．５作为数据库系统,开发技术采用微软的ＡＳＰ。本文首先介绍方案的设计思想,然后给出数据库表结构;其次,说明利用ＶｉｓｕａｌＢａｓｉｃ４．０和ＡＤＯ１．５构造ＡｃｔｉｖｅＸ服务器部件;最后,讨论在开发ＡＳＰＷｅｂ基应用的过程中,怎样使用我们构造的用于进行数据库图像数据处理的ＡｃｔｉｖｅＸ服务器部件。１　方案介绍我们可以采用自己最熟悉的一种编程语言（如ＶｉｓｕａｌＢａｓｉｃ,ＶｉｓｕａｌＣ＋＋或ＶｉｓｕａｌＪ＋＋）,开发一些完成特定任务的…     

ODBC在数据库集中的应用研究

描述了ＯＤＢＣ技术以及如何使用ＶＣ＋＋的Ａｐｐｗｉｚａｒｄ和Ｃｌａｓｓｗｉｚａｒｄ工具编写ＯＤＢＣ应用程序。     

Mathematical programming for the scheduling problem with alternate process plans in FMS

The purpose of this research is to consider the operational scheduling problem and the determination of production routing with alternate process plans simultaneously such that the advantages of routing flexibility are expected. The problem is formulated by using 0–1 integer programming regarding to the performance measure of either the minimum of the absolute deviation of meeting due date or the minimum of total completion time. The approach of mathematical programming generates the optimal schedule, rather than near optimal schedule or a better schedule, to meet the selected criterion. Two mathematical formulation models developed are presented and an example is shown in this paper referring to the either one of performance criteria.     

一种事件驱动型嵌入式软件框架设计

提出了一种事件驱动型嵌入式软件设计框架,抽象并实现了嵌入式软件程序中包括基于优先级的任务调度、基于消息队列的任务间通信、发行—订阅服务、共享资源访问和系统定时器服务等在内的公共功能,简化了嵌入式软件的应用程序设计.     

Scheduling the professional Ecuadorian football league by integer programming

A sports schedule sets the dates and venues of games among teams in a sports league. Constructing a sports schedule is a highly restrictive problem. The schedule must meet constraints due to regulations of a particular sports league federation and it must guarantee the participation of all teams on equal terms. Moreover, economic benefits of the teams and other agents involved in this activity are expected. Until 2011, the Ecuadorian football federation (FEF) had developed schedules for their professional football championship manually. In early 2011, the authors presented to the FEF authorities evidence that the use of mathematical programming to create feasible sports schedules could easily exceed the benefits obtained by the empirical method. Under this premise, this work presents an integer programming formulation, solved to optimality, for scheduling the professional football league in Ecuador, and also a heuristic approach based on three-phases for its solution. The schedules obtained met the expectations of the FEF and one of them was adopted as the official schedule for the 2012 edition of the Ecuadorian professional football championship.     

Scheduling of linear projects with single loop structures

In the last decade, a number of linear scheduling methods based on the theories of linear and dynamic programming were developed for the scheduling of linear projects. However, these methods are only suitable for the scheduling of serial linear projects (i.e. sequential activities). In this paper, a nonserial dynamic programming formulation for the scheduling and control of linear projects that involve single loop structures is presented. The objective is to provide for the selection of crew formations, interruptions, and lags for the production activities that result in the minimum project duration. The advantage of this nonserial dynamic programming approach is its ability to handle both serial and nonserial linear projects with variable crew formations and work interruptions. In addition, the system presented produces a graphical representation of the project schedule of minimum duration and updates the original schedule based on current information supplied by the user. A numerical example is included to illustrate the input and output of the system presented.     

工程系统进度优化的协同决策方法

为解决多个承包商间的项目合作伙伴选择问题, 采用多目标规划构建工程系统进度优化的协同决策模型. 以合作博弈理论为基础, 运用主要目标法设计一种基于期望收益约束选择的模型求解方法. 算例结果表明, 所提出的方法可以在保障参与协同的承包商收益需求前提下实现工程系统进度最优, 所获得的协同方案更容易为各方接受.

     

An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments

Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity complicates the design of efficient collective communication protocols. For example, it is a very hard combinatorial problem to find an optimal reduction schedule for such heterogeneous clusters. Nevertheless, we show that a simple technique called slowest-node-first (SNF) is very effective in designing efficient reduction protocols for heterogeneous clusters. First, we show that SNF is actually a 2-approximation algorithm, which means that an SNF schedule length is always within twice of the optimal schedule length, no matter what kind of cluster is given. In addition, we show that SNF does give the optimal reduction time when the cluster consists of two types of processors, when the ratio of communication speed between them is at least two. When the communication speed ratio is less than two, we develop a dynamic programming technique to find the optimal schedule. Our dynamic programming utilizes the monotone property of the objective function, and can significantly reduce the amount of computation time. Finally, combined with an approximation algorithm for broadcast 2004, we propose an all-reduction algorithm which sends the reduction answer to all processors, with approximation ratio 3.5. We conduct three groups of experiments. First, we show that SNF performs better than the built-in MPI_Reduce in a test cluster. Second, we observe a factor of 93 times saving in computation time to find the optimal schedule, when compared with a naive dynamic programming implementation. Thirdly, we apply the theoretical results to a branch-and-bound search and show that they can reduce the search time of the optimal reduction schedule by a factor of 500, when the cluster has three kinds of processors.     

炼油生产调度专家系统的应用研究

基于知识的优化设计应用于炼油化工厂,采用专家系统技术将生产中成功的经验和领域专家的知识组织起来,协调并参与数学规划建模过程,优化编排调度作业计划,并进行优化控制和管理.文章结合大型炼油厂的生产实际,探索智能化的管控一体化的新模式.     

Resource‐constrained project scheduling through the goal programming model: integration of the manager's preferences

The aim of this paper is to present a multi‐objective project scheduling approach to help project managers when deciding on a baseline schedule. The concepts of satisfaction functions and goal programming are incorporated to generate this baseline schedule that represents the best compromise among a set of conflicting project objectives. An efficient computerized procedure based on the tabu search algorithm is proposed and enables the handling of large planning and scheduling projects.     

Integrating model-based optimization and program transformation to generate efficient parallel programs

The paper gives an overview on the DSPL programming environment, an integrated approach to automate system design and implementation of applications run on dedicated parallel systems. The programming environment consists of a data-flow language and an integrated set of tools. The tools automatically derive a software model from the given application program. Based on the model, the design decisions as the network topology, the task mapping and schedule as well as the optimal use of buffers are computed. Finally, the design decisions are automatically implemented by transforming the application program in executable code for the chosen processor network. The DSPL programming environment integrates model-based optimization techniques and program transformation techniques. The integration allows to include new aspects in the optimization process. Especially optimizations crucial to the semantics of the program can be included. The most important examples of such optimizations are the enforcement of the schedule in case of data-dependent execution of tasks and the transformation of buffered communication to unbuffered communication. Both aspects are crucial to the generation of efficient parallel implementations. The integration of the two aspects is supported by a formal framework. This allows to formally prove the correctness of the program optimizations performed by the programming environment.     

A network-based approach to the multi-activity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation

This paper introduces the multi-activity combined timetabling and crew scheduling problem. The goal of this problem is to schedule the minimum number of workers required in order to successfully visit a set of customers characterized by services needed matched against schedule availability. Two solution strategies are proposed. The first is based on mathematical programming whilst the second uses a heuristic procedure in order to reduce computational time. The proposed model combines timetabling with crew scheduling decisions in one mixed integer programming model which considers multiple activities. The algorithms are tested on randomly generated and real instances provided by the Health to School Initiative, a program based at Bogotá’s local Health Department. The results show that the Initiative can increase its coverage by up to 68% using the proposed heuristic approach as a planning process tool.