基于程序切片的电路提取技术

从HDL设计描述中提取电路在VLSI设计验证、低功耗分析、测试生成等方面有广泛的应用需求。提出了一种采用程序切片技术实现的新的电路提取方法,并深入论述了基于程序切片技术从Verilog描述中进行电路提取的理论基础。该方法可以为每一个感兴趣的信号获取其"链接切片"。与以前的方法相比,该方法的优点是细粒度的、不受书写格式的限制,并且能处理更多Verilog的语法元素。该方法已经被集成到现有设计流程中,实验结果表明其方便、高效,有良好的通用性。     

略评“语言谬误”──评介楚明锟主编的《逻辑学》

２０世纪５０年代以来,西方在非形式逻辑方面取得了重大进展。近几年来,我国逻辑界对此有愈来愈多的认识与响应。２０００年末出版的《逻辑学》教科书可视为一个例证。该书的价值和水平值得肯定。但其中的“语言谬误”一节大可商榷。     

分布式结构的坦克火控仿真系统的研究

采用现代仿真技术,分布式结构战车火控仿真系统在完成火控系统动态特性仿真任务后,可实现新火控系统研制过程的先期技术演示,并可为装备论证研究提供先进的仿真手段。此外还分析了以DIS结构接入到作战仿真系统的可能性和现实性。     

社会计算实验动态仿真引擎的研究与实现

应对新形势下非常规突发事件的严峻挑战是各国政府亟待解决的问题,综合人工社会-计算实验-平行执行的ACP方法,是解决非常规突发事件应急管理问题的有效方法.本文引入ACP方法,阐述构建高性能社会计算实验动态仿真引擎的作用;按照层次化模块化思想设计动态仿真引擎D-PARSE的体系结构,详细描述各组成部分的具体功能,并基于并行...     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Coherent systems based on sequential order statistics

The sequential order statistics (SOS) are a good way to model the lifetimes of the components in a system when the failure of a component at time t affects the performance of the working components at this age t. In this article, we study properties of the lifetimes of the coherent systems obtained using SOS. Specifically, we obtain a mixture representation based on the signature of the system. This representation is used to obtain stochastic comparisons. To get these comparisons, we obtain some ordering properties for the SOS, which in this context represent the lifetimes of k‐out‐of‐n systems. In particular, we show that they are not necessarily hazard rate ordered. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于层次分析法的桂西北古村寨火灾风险评估研究

应用层次分析法,根据桂西北古村寨的实际情况,建立了桂西北古村寨的火灾风险评估体系。采用专家打分法获取数据,并应用统计学中的众值原理,对获得的数据进行了统计,得到了指标的权重,建立了适用于实际情况的消防安全检查表。并应用实例证明了这种评估方法行之有效。