主机安全监控系统的设计与实现

针对现有主机监控系统存在的执行效率低、监控粒度粗等问题,通过在内核态设置钩子函数改写系统服务调度表,同时在用户层设置策略库进行细粒度监控,设计并实现了主机安全监控系统。该系统具有执行效率高、占用系统资源少、监控粒度细等特点。     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Formulations for dynamic lot sizing with service levels

In this article, we study deterministic dynamic lot‐sizing problems with a service‐level constraint on the total number of periods in which backlogs can occur over a finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS‐SL‐I) and study the structure of its solution. We show that an optimal solution to this problem can be found in \begin{align*}\mathcal O(n^2\kappa)\end{align*} time, where n is the planning horizon and \begin{align*}\kappa=\mathcal O(n)\end{align*} is the maximum number of periods in which demand can be backlogged. Using the proposed shortest path algorithms, we develop alternative tight extended formulations for LS‐SL‐I and one of its relaxations, which we refer to as uncapacitated lot sizing with setups for stocks and backlogs. {We show that this relaxation also appears as a substructure in a lot‐sizing problem which limits the total amount of a period's demand met from a later period, across all periods.} We report computational results that compare the natural and extended formulations on multi‐item service‐level constrained instances. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

模糊识别和随机森林算法在柴油机振动信号状态识别中的应用

针对模糊识别算法中,样本特征向量中各参量(分量)对状态分类的贡献权重难以确定的问题,提出了利用随机森林算法对特征参量的重要度评估结果作为特征权重的方法。通过对柴油机台架试验振动信号的跟踪分析,获得了柴油机在磨合期、100摩托小时、200摩托小时、300摩托小时及400摩托小时5种不同使用期(典型状态)的75个振动信号样本,然后计算出各类样本在幅域、时域和频域的特征参量,利用随机森林算法进行特征选择,确定4个重要特征参量及其权重,用统计方法得出其隶属度函数,最后根据评价向量对样本进行识别,识别准确率达到94%以上。     

通用装备机动抢修单元作业效能评估研究

界定了通用装备机动抢修单元（人-装备-机工具-器材结合体）的内涵和外延,构建了通用装备机动抢修单元作业过程模型．通过EXTEND仿真平台定量评估了面向典型任务条件下通用装备（以车辆装备为例）机动抢修单元的作业效能。最后对仿真评估结果进行分析,提出了改进对策和建议。     

基于可组合服务的陆军作战仿真模型集成＊

陆军仿真模型体系的复杂性决定了其建模与集成的复杂度,基于模型组件化技术,设计了模型组件库、对象库,通过逻辑组合实现了基本库和作战单元库,并以可组合的模型服务实现不同分辨率、异构模型的聚合集成目标,使得陆军作战仿真模型具备模块化、可复用、可扩展和可控制等应用特点和技战术性能。     

地方高校图书馆主动服务对军校图书馆的启示——对全国15所重点高校图书馆网站的调查与分析

从图书馆主动服务的理念入手,探讨利用网络开展主动服务的可能性,并结合对全国15所重点高校图书馆网站和实践开展的多种主动服务方式进行调查统计,分析总结其特点,由此得出对军校图书馆开展主动服务的启示。     

Price and capacity decisions of service systems with boundedly rational customers

We consider price and capacity decisions for a profit‐maximizing service provider in a single server queueing system, in which customers are boundedly rational and decide whether to join the service according to a multinomial logit model. We find two potential price‐capacity pair solutions for the first‐order condition of the profit‐maximizing problem. Profit is maximized at the solution with a larger capacity, but minimized at the smaller one. We then consider a dynamically adjusting capacity system to mimic a real‐life situation and find that the maximum can be reached only when the initial service rate is larger than a certain threshold; otherwise, the system capacity and demand shrink to zero. We also find that a higher level of customers’ bounded rationality does not necessarily benefit a firm, nor does it necessarily allow service to be sustained. We extend our analysis to a setting in which customers’ bounded rationality level is related to historical demand and find that such a setting makes service easier to sustain. Finally we find that bounded rationality always harms social welfare.     

Revisiting the justification for an all-volunteer force

In 1968, President Nixon established the Commission on an All-Volunteer Armed Force, or the Gates Commission, which served as the impetus and justification for an All-Volunteer Force (AVF). At the end of its deliberations, the commission recommended abolishing the draft and transforming the U.S. military into a force of volunteers beginning in 1973. Interestingly, the debate regarding the merits of both systems appeared to be largely economic – with cost–benefit analysis playing the primary role. Lately, we are beginning to see a new, politically-motivated impetus for returning to a “system of national service.” The ideas spurring this debate are many: the need to reaffirm the nation state, the commitment of citizens to the state, political ownership and oversight of the forces, the need for social equity in serving the nation, limiting the support for armed conflict by burden-sharing among citizens, and equitably spreading the personal cost of war.