Authorware多媒体制作技术研究

对Authorware管理多媒体素材的三种方式进行了详细的分析,研究了基于流程控制的面向对象的可视化编程特点,分别对系统登录模块、连接数据库和发布打包三个关键性应用技术进行了具体的开发。     

基于结构熵理论的师装备保障力量层次设置模式评价研究

针对师装备保障力量层次设置模式优选时缺乏定量分析的问题，尝试从系统信息论的角度，采用结构熵理论对师装备保障力量层次设置的组织结构有序度进行客观评价，用时效熵和质量熵分别对师装备保障力量层次设置组织结构中信息流通的时效性和质量性进行度量，为师装备保障力量层次设置模式的选择提供科学依据。     

基于Krsul分类法与联邦模型的脆弱性数据库系统

在分析脆弱性数据库研究现状的基础上 ,指出现有脆弱性数据库系统数据管理方法的不足之处 ,提出基于Krsul脆弱性分类法和联邦模型实现一种脆弱性数据库系统。该脆弱性数据库采用Krsul脆弱性分类法实现脆弱性数据的分类组织 ,采用联邦模型作为数据库系统的体系结构 ,采用Web界面实现数据库的人机接口。     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

混合模糊逻辑方法及其在雷达/红外双模制导中的应用

混合模糊逻辑方法就是利用模糊规则和对象输入输出的观测数据来辨识一个模糊逻辑系统。该方法对模糊规则和观测数据进行了预处理,给出系统模型的初始结构和参数。将该方法用于处理雷达/红外双模制导中对目标的跟踪问题。仿真表明该方法是有效的。     

VB程序设计课程教学的探索与实践

实践表明，对影响VB程序设计课程教学中存在的突出问题进行认真分析，充分利用网络教学平台，改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣，提高学生的编程能力，同时也有助于提高教学质量和效果。     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

复杂大系统仿真的VV&A理论及过程研究

为了确保复杂大系统仿真(LCSS)的可信性,应该在建模与仿真(M&S)的全生命周期中开展校核、验证与确认(VV&A)研究.对LCSS的VV&A进行了理论研究,提出其方法论与原则;以基于仿真组件构建的HLA仿真系统为例,从仿真组件层、联邦成员层及联邦层三个层面研究了VV&A过程,并将这些研究应用于反舰导弹突防联邦仿真中.实践表明,研究对LCSS的VV&A工作具有很好的指导作用,有力地保障了仿真的可信性.     

New product introduction against a predator: A bilevel mixed‐integer programming approach

We consider a scenario with two firms determining which products to develop and introduce to the market. In this problem, there exists a finite set of potential products and market segments. Each market segment has a preference list of products and will buy its most preferred product among those available. The firms play a Stackelberg game in which the leader firm first introduces a set of products, and the follower responds with its own set of products. The leader's goal is to maximize its profit subject to a product introduction budget, assuming that the follower will attempt to minimize the leader's profit using a budget of its own. We formulate this problem as a multistage integer program amenable to decomposition techniques. Using this formulation, we develop three variations of an exact mathematical programming method for solving the multistage problem, along with a family of heuristic procedures for estimating the follower solution. The efficacy of our approaches is demonstrated on randomly generated test instances. This article contributes to the operations research literature a multistage algorithm that directly addresses difficulties posed by degeneracy, and contributes to the product variety literature an exact optimization algorithm for a novel competitive product introduction problem. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于数据库和构件技术的通用ATS软件框架

针对当前测试软件中存在的通用性、扩展性和升级性差的问题,提出了通用ATS软件框架的设计准则,设计了基于数据库与构件技术的通用ATS软件框架,即＂框架＋数据库＋构件＂的软件体系结构,该结构降低了系统的复杂性,解决了ATS软件的通用性、灵活性、可靠性、扩展性差的问题。