工科数学课程创新存在的问题与对策

国内工科数学课程创新能力与机制缺乏，对数学课程体系的创新认识不足，内容过于重视传统数学，数学教师的专业创新能力有待提高等一系列问题严重影响工科院校基础数学课程的创新。应对课程体系、课程内容、课程实施、课程评价进行创新，并提出了相应的对策。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

一种新的分布事务处理模型和算法

分布事务处理是分布式数据库管理系统设计中的一项关键技术。为保证分布事务的原子性,对基本分布事务处理模型和加工协议进行改进,提出了一种新的分布事务处理机制,并给出了其在分布式工程数据库管理系统dEDBMS中的实现方法。     

航测平台计算机系统软件设计

根据航测平台系统计算机的功能要求 ,采用数据流图对航测平台系统软件进行了分析 ,对系统软件各模块进行了划分 ,确定了系统软件的设计方案 ,并在此基础上 ,完成了航测平台控制计算机系统软件的设计和实现 .     

关于装备使用保障问题的探讨

使用保障作为装备综合保障工作的主要工作内容,是战斗力的重要组成部分.本文探讨了使用保障的基本概念、使用保障要求与使用保障方案以及使用保障分析等与使用保障有关的问题.目的在于介绍使用保障的基本概念,并对如何开展装备的使用保障工作进行了初步的探讨.     

并行工程中过程重组与团队技术的应用

在分析复杂结构件设计、制造串行工作流程的基础上,给出了重组后的并行工作流程,简要介绍了团队技术的基本思想,描述了过程重组、团队技术在产品开发中的初步应用。提出过程重组和团队技术是改进设计思想和方法的有效方式,是缩短产品开发周期,提高产品设计质量,降低产品成本的重要手段之一。     

并行工程关键使能技术及其发展趋势

介绍了并行工程(ConcurrentEngineering,简称CE)的定义、基本原则、组成、驱动力和要素等,概要介绍了CE的部分关键使能技术。基于CE的理论研究与应用实践,给出实施CE的基本模式并进一步设想了CE的发展趋势。     

搞好数学建模 促进数学教学

分析我校数学建模工作中的成功经验 ,找出不足 ,探索新路 ,使我校数学教学工作更上一层楼。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001