卫星导航系统中平台运动对天线阵列性能的影响分析

常规的天线阵自适应算法侧重于研究稳态条件下的最优性能.当卫星导航接收机应用于运动载体(如炸弹、飞机、机动车辆、舰艇)时,阵列平台的运动(或振动)将会导致权值"零陷"指向与干扰来向失配.建立了运动条件下的阵列信号模型,将平台运动分为第一类平台运动(高频振动)和第二类平台运动(平稳转动),给出了两类运动模型下阵列输出信干噪...     

Scheduling to minimize release-time resource consumption and tardiness penalties

We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc.     

An economic two-stage screening procedure with a prescribed outgoing quality in logistic and normal models

An economic two-stage screening procedure based on a dichotomous performance variable T and a continuous screening variable X is proposed. X is measured first to decide whether an item should be accepted, rejected, or additional observations should be taken. If no terminal decision is reached, T is then observed to classify the undecided items. Two models are considered; (i) the logistic model, where P(T = 1|X = x) is assumed to be a logistic function of x, and (ii) the normal model, where X given T is assumed to be normally distributed. A simple economic model based on inspection and misclassification costs is constructed. Optimal cutoff values on the screening variable are obtained by minimizing the expected cost subject to the constraint that the average outgoing quality attains a pre-specified level. Solutions are provided for both known-parameter and unknown-parameter cases. © 1995 John Wiley & Sons, Inc.     

基于Linux虚拟服务器的负载均衡技术探讨

Internet业务量的激增和网络应用特殊化都使得负载均衡成为迫切需求。如何实现网络服务器负载均衡是一个急待解决的新课题。而LVS是一个具有良好的扩展性、高可靠性、高性能、高可用性的基于Linux系统的服务器集群,利用它可以较好解决这一问题。针对Linux虚拟服务器集群的负载均衡技术,探讨了其体系结构、工作方式、负载均衡算法,并以一简单的应用实例介绍了其具体实现。这样可以在很大程度上减轻网络的负载,提高网络的效率,是未来网络服务器技术的主要发展方向之一。     

军队高校创造性思维教育的几个问题

简述了创造性思维教育的意义与目的,辨析了有关概念,提出了创造性思维教育的前提,详细讨论了创造性思维教育的有关措施.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

Stochastic production capacity: A bane or a boon for quick response supply chains?

The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold.     

Purchase and retrieval competition for seasonal produce

We study the competition problem of purchase and multiretrieval of perishable seasonal produce, where wholesalers purchase and stock their products in the first period, and then retrieve and sell them in subsequent periods. We first consider the duopoly case and assume that the prices are exogenous and fluctuate. In each period, after the price realization, the wholesalers retrieve some stock from their warehouses to satisfy their demands. One wholesaler's unsatisfied customers can switch to another and be satisfied by its left retrieved products. Any unsold retrieved stock has no salvage value and any unsatisfied demand is lost. The unretrieved stock is carried to the next period at a perishable rate. The wholesalers compete for the substitute demand by determining their own purchase and retrieval quantities. We show the existence and uniqueness of a pure-strategy Nash equilibrium, and that the Nash equilibrium strategy has the simple “sell-down-to” structure. We also consider the general N-person game and show the existence of the Nash equilibrium, and characterize the structure of the equilibrium strategy for the symmetric case. In addition, we consider the case with endogenous prices, and show that the problem reduces to a repeated newsvendor game with price and inventory competition. We derive the conditions under which a unique Nash equilibrium exists and characterize the equilibrium strategy. Finally, we conduct numerical studies to examine the impacts of the model parameters on the equilibrium outcomes and to generate managerial insights.     

频谱感知次序的在线最优选择

动态频谱接入是解决无线电频谱资源短缺和频谱使用效率低下问题的有效方法,它允许次级用户在授权频谱空闲时动态地接入,以进行数据传输。而频谱感知是实现动态频谱接入的关键挑战之一。由于次级用户的感知能力有限,为了获得更多的频谱接入机会,需要尽快找到频谱空闲概率最大的频段,并研究频谱感知次序问题。考虑到频谱空闲概率对次级用户是不可知的,并且会随时间变化,提出了在线学习框架,把频谱感知次序问题归纳成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法处理优化问题。仿真结果表明,和其他算法相比,所提算法可以获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。     

基于"作战云"的"云作战"问题探析

随着云计算技术不断发展成熟及其在军事领域的逐步推广应用,催生了"作战云"理论。基于"作战云"的"云作战"模式,通过全域、全要素的"云来云往",有效化解基于平台的体系作战存在的作战协同难度大和融合程度低的矛盾问题,进一步提升作战效能。结合对"作战云"概念、特性、外延的阐述,进一步诠释了"作战云"的内涵,定义了"云作战"样式,分析了"云作战"体系的构成,建立了"云作战"体系概念模型,设计了"云作战"的一般流程。