元胞法模拟非线性弹性层合材料中的应力波

元胞法 (MethodofCell)是在有效刚度理论的基础上发展起来的新方法 ,可以用来构造具有周期性结构单元的材料的本构 ,也可以用来模拟应力波在材料中的传播问题 ,尤其是具有分层结构的材料。本文中给出两种常见的初值条件 ,并利用该方法模拟了非线性弹性材料的动态响应 ,研究了波在该层合材料中的振荡现象     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

基于红外图像的小目标检测与跟踪方法

为了能在强杂波、低信噪比的情况下检测小目标,人们提出了许多针对小目标检测与跟踪的方法。介绍了基于红外图像的小目标检测和跟踪的各种方法和最新进展,重点讨论了灰度形态法、小波变换法、最优时空非线性滤波法用于小目标检测与跟踪的原理,并指出了今后的发展和研究方向。     

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

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

新型BFRP筋增强混凝土受弯构件挠度控制

玄武岩纤维塑料增强筋（BFRP筋）的特性导致以其为增强筋的受弯构件出现裂缝后刚度降低非常明显,变形发展过快。因此,对BFRP筋混凝土梁的设计主要应根据其变形性能标准的要求来进行。为方便设计人员进行BFRP筋受弯构件设计,结合试验研究,通过对比国内外有关FRP筋混凝土梁开裂截面有限惯性矩计算模型的研究,探索出适合BFRP筋混凝土梁开裂截面有效惯性矩计算模型;通过建模分析,表明有限元计算模型和其他几种计算模型一起可以应用于BFRP筋混凝土梁直接挠度控制。推导出FRP筋受弯构件配筋率计算公式,结合直接挠度控制研究,提出通过控制跨高比限值来进行梁尺寸初选的间接挠度控制计算公式。     

随机动态规划的混合算法研究

针对随机条件下动态规划模型的主要特点,运用智能算法混合编程理论,设计了一种探索多阶段决策问题的智能混合算法.该算法首先将问题转化成一族同类型的一步决策子问题,然后利用随机模拟和遗传算法,依据训练样本形成的训练神经元网络,在单步决策中寻求最优策略和最优目标值,逐个求解,再据初始状态逆序求出最优策略序列和最优目标值.仿真结果表明,该算法具有一定的通用性,初始设计点可以随机产生,其计算精度不因函数的非线性强弱而受影响,对目标和约束的限制较少,可应用于多种形式的随机多阶段决策优化问题,较好地满足了随机动态规划模型求解和优化的要求.     

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     

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