面向柔性加工环境的过程状态振动监测

本文运用提出的通用状态监测模型及策略,以振动信号监测为例,提取设备运行状态的振动信号方差和振动信号建立AR模型的参数估计的变化率参数作为两类通用特征参数,对柔性加工系统进行归一化监测,取得了良好的效果。建立的监测系统简洁、快速、可靠,满足柔性制造环境下设备运行状态监测的要求。     

网络安全脆弱性分析与处置系统的研究与实现

在分析国内外研究现状的基础上,针对现有的漏洞库系统在漏洞信息的组织、使用等方面存在的不足,采用分布计算技术、数据库技术、Web技术实现了网络安全脆弱性分析与处置系统。该系统实现了基于Web的漏洞库(含补丁库)的访问与维护工具,便于获取相应漏洞的解决方案和下载相应的补丁程序,降低了系统维护的开销,提高了系统的可维护性;补丁推送程序实现了对系统补丁程序的远程推送、漏洞修补和补漏检测,提高了系统的自动化程度,为网络安全脆弱性处置提供了有力工具。     

Blast resistance evaluation of urban utility tunnel reinforced with BFRP bars

To improve corrosion-resistance of shallow-buried concrete urban utility tunnels(UUTs),basalt fiber reinforced polymer(BFRP)bars are applied to reinforce UUTs.As the UUT must have excellent survival capability under accidental explosions,a shallow-buried BFRP bars reinforced UUT(BBRU)was designed and constructed.Repetitive blast experiments were carried out on this BBRU.Dynamic responses,damage evolutions and failure styles of the BBRU under repetitive explosions were revealed.The tunnel roof is the most vulnerable component and longitudinal cracks develop along the tunnel.When the scaled distance is larger than 1.10 m/kg1/3,no cracks are observed in the experiments.When the BBRU is severely damaged,there are five cracks forming and developing along the roof.The roof is simplified as a clamped-supported one-way slab,proved by the observation that the maximum strain of the transverse bar is much larger than that of the longitudinal bar.Dynamic responses of the roof slab are predicted by dynamic Euler beam theory,which can consistently predict the roof displacement under large-scaled-distance explosion.Compared with the UUT reinforced with steel bars,the BBRU has advantages in blast resistance with smaller deflections and more evenly-distributed cracks when the scaled distance is smaller than 1.260 m/kg1/3 and the steel bars enter plastic state.Longer elastic defamation of the BFRP bars endows the UUT more excellent blast resistance under small-scaled-distance explosions.     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

柔性加工单元故障诊断的模糊Petri网模型

针对故障诊断专家系统中专家知识的模糊性和不确定性,给出用模糊Ｐｅｔｒｉ网（ＦＰＮ）模型表示模糊产生式规则（ＦＰＲ）知识的方法、知识的存储、模糊推理机制及算法的实现。同时,以ＪＣＳ—０２０（ＦＡＮＵＣ）加工中心主轴伺服故障诊断为例,说明该方法在故障诊断专家系统（ＦＤＥＳ）中应用的可行性与有效性。     

Statistical equivalency and optimality of simple step‐stress accelerated test plans for the exponential distribution

Accelerated life testing (ALT) is commonly used to obtain reliability information about a product in a timely manner. Several stress loading designs have been proposed and recent research interests have emerged concerning the development of equivalent ALT plans. Step‐stress ALT (SSALT) is one of the most commonly used stress loadings because it usually shortens the test duration and reduces the number of required test units. This article considers two fundamental questions when designing a SSALT and provides formal proofs in answer to each. Namely: (1) can a simple SSALT be designed so that it is equivalent to other stress loading designs? (2) when optimizing a multilevel SSALT, does it degenerate to a simple SSALT plan? The answers to both queries, under certain reasonable model assumptions, are shown to be a qualified YES. In addition, we provide an argument to support the rationale of a common practice in designing a SSALT, that is, setting the higher stress level as high as possible in a SSALT plan. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

信息化条件下美军心理战"云"活动范式论

近年来,美军利用其先进的信息传输系统,综合运用信息媒介、人际关系、组织机构、生理刺激等多种方式,使心理战趋向系统整合的"云"活动.该种活动范式呈现出心理战主体构成复合化、心理战情报获取渠道网栅化、心理战信息开发系统化、心理战致效路径组合化、心理战作战空间多域化等特点.     

试论20世纪20年代中国留苏军事教育与中国革命

20世纪20年代中国的留苏教育不仅为中国培养了革命干部,而且为中国共产党造就了一批军事人才。以往人们对前者关注较多,而对后者注意甚少。本文试图探讨20世纪20年代留苏军事教育的发展过程及其与中国国内革命形势的关系和对后来中国革命的影响。     

亲合层析SELEX法筛选相思子毒素寡核苷酸适配子

报道了采用亲和树脂法对相思子毒素蛋白进行反复的SELEX筛选,获得与靶物质结合率这32．5％的富集文库,并克隆得到了单克隆适配子序列,软件模拟了这些序列的二级结构,选择部分序列选择性剪切后利用荧光偏振方法进行检测,对靶蛋白的检测限达到亚nmol量。