舰艇作战系统电磁兼容的综合预测

分析了针对舰艇作战系统中电子系统的电磁兼容性的预测方法。针对舰载电子设备的电磁兼容问题,采用了一种综合分析的方法,通过综合考虑发射接收对之间的响应,利用发射机、接收机的辐射响应特性以及信道条件的数学模型,分析电子设备之间的电磁兼容性,对分析预测电子设备间的电磁兼容性具有一定的意义。     

基于应变局部化理论的剑桥模型改进

应用传统的弹塑性理论模型在分析剪切带的时候遇到了很多困难,如控制方程失去椭圆性等,其原因是传统的弹塑性理论模型并没有包含材料的内部参数。在剑桥模型的基础上,考虑应变二阶梯度,提出一种新的计算剪切带的理论模型。当应变局部化发生时,带内土体采用该模型计算,带外土体则按照传统弹塑性模型计算。该理论模型汲取了剑桥模型实验参数少,应用简便的优点。     

管道机器人在三通处的通过性分析

三通是管道机器人经常遇到的典型障碍之一,克服该障碍的能力用管道机器人在三通处通过性来描述。文中提出一种描述差压驱动式管道机器人三通通过性的数学模型,该模型由一组组合约束构成。通过对约束方程的分析讨论、与管道机器人弯道通过性的对比分析,得出了规律性的结论。管道机器人在三通处的姿态、单元体的几何尺寸、行走轮结构形式对其通过性都有不同程度的影响。所提出数学模型是管道机器人三通自主行走控制策略设计和相应结构设计的理论基础。     

论先秦儒家社会秩序思想

身处动乱年代的先秦儒家,尤其强调秩序的可贵,希望借礼乐的倡导与宏扬,恢复“三代”盛世的理想秩序。     

高原卫士奉献精神的哲学反思

立足推进人类社会精神文明建设和加强部队思想建设,把高原卫士作为认识对象,运用马克思认识论和实践观,分析高原卫士在特殊环境里所具备的那种高尚品格和生命价值观。在阐述高原卫士奉献精神本质、内涵,及其实践效果的基础上,追问奉献精神产生的双重根源,指出:高原卫士可贵之处是奉献,人类文明需要可贵的奉献精神。     

消防责任事故罪构成要件探讨

消防责任事故罪包括客体、客观要件、主体、主观要件等若干构成要件,其客体为“国家的消防监督制度”,其客观要件是“经消防监督机构通知采取改正措施而拒绝执行”,其主体为特殊主体“直接责任人员”,其主观要件应限于过于轻信的过失。     

Dynamic inventory and pricing models for competing retailers

We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004