全文获取类型
收费全文 | 431篇 |
免费 | 163篇 |
国内免费 | 27篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 14篇 |
2020年 | 11篇 |
2019年 | 14篇 |
2018年 | 4篇 |
2017年 | 24篇 |
2016年 | 31篇 |
2015年 | 23篇 |
2014年 | 41篇 |
2013年 | 24篇 |
2012年 | 27篇 |
2011年 | 45篇 |
2010年 | 23篇 |
2009年 | 39篇 |
2008年 | 29篇 |
2007年 | 32篇 |
2006年 | 31篇 |
2005年 | 35篇 |
2004年 | 30篇 |
2003年 | 17篇 |
2002年 | 15篇 |
2001年 | 19篇 |
2000年 | 17篇 |
1999年 | 12篇 |
1998年 | 12篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 5篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
排序方式: 共有621条查询结果,搜索用时 15 毫秒
411.
基于GIS的陆军野战防空指挥自动化系统分析 总被引:1,自引:0,他引:1
从陆军面临的空中威胁目标出发,分析了陆军野战防空的主要特点及对指挥自动化系统的要求,提出了基于地理信息系统(Geographic Information System:GIS)的陆军野战防空指挥自动化系统的设想,并建立了基本的结构模型.最后,根据系统论的思想更深层地说明了陆军野战防空指挥自动化系统建设的重要性. 相似文献
412.
We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f1(C1), f2(C2), … , fn(Cn)), where fi(Ci) is a general, nondecreasing function of the completion time Ci of task i. We show that the optimal sequence to minimize the maximum cost MC = max fi(Ci) can be derived by a simple rule if there exists an order f1(t) ≤ … ≤ fn(t) for all t between the functions {fi(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ fi(Ci) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
413.
In this paper we first introduce and study the notion of failure profiles which is based on the concepts of paths and cuts in system reliability. The relationship of failure profiles to two notions of component importance is highlighted, and an expression for the density function of the lifetime of a coherent system, with independent and not necessarily identical component lifetimes, is derived. We then demonstrate the way that failure profiles can be used to establish likelihood ratio orderings of lifetimes of two systems. Finally we use failure profiles to obtain bounds, in the likelihood ratio sense, on the lifetimes of coherent systems with independent and not necessarily identical component lifetimes. The bounds are relatively easy to compute and use. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
414.
Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost
This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
415.
提出并验证了基于随机并行梯度下降(SPGD)算法的主动相位控制脉冲激光相干合成方案.利用低通滤波器滤除脉冲激光光强变化导致的性能评价函数起伏,提取出相位噪声导致的性能评价函数变化,然后将这个低通滤波后的性能评价函数用于SPGD算法的极值寻优过程,从而实现脉冲激光的锁相.对该方案进行了理论分析和数值模拟,并进行了两路脉冲激光相干合成实验.实验结果表明,当系统从闭环到开环时,系统性能评价函数均值提高到开环的1.6倍,干涉条纹长曝光对比度从0提高到0.43.在该方案中,通过增加合成脉冲激光路数,并在各路脉冲激光中引入多级功率放大器,能够得到更高的合成功率输出. 相似文献
416.
着眼装备指挥变革和提高指挥效能的需要,提出了基于信息系统装备指挥运行机制的概念,构建了基于信息系统的要素式装备指挥机构模型,明确了各指挥要素职能及其相互关系,分析了装备指挥信息、决策计划、协调控制的流程,建立了装备指挥效能计算模型,以期为建设新型科学的装备指挥运行机制提供依据. 相似文献
417.
本文比较了体系和一般复杂巨系统概念之间的差异,提出了一个用来刻画和分析战场C4ISR领域体系的成熟度生长模型,指出一体化是体系生长过程达到的一种较高级的状态。并结合美军的区域防空体系发展,讨论了C4ISR中体系认知和研制中容易犯的错误,揭示其体系成长和发展规律,指出企图通过某个独立系统构建来操控一个体系,不符合体系发展规律,类似的努力也注定不会成功。 相似文献
418.
建立了具有战时随机延误与损耗的多配送中心配送路径安排模型,给出了基于随机模拟的蚁群算法。算法通过给定残存率、用时与置信度阈值,把多目标问题作为单目标来处理。用随机模拟的方法来求路径的置信度,并以此为基础搜索转移策略的临域与判断未遍历点的插入位置。算法设计了符合问题特点的从虚拟点出发的转移策略与对两类路段不同的信息素更新策略,确保算法的实现。最后,通过算例说明了该方法的可行性与有效性。 相似文献
419.
Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
420.
We examine the problem of adaptively scheduling perfect observations and preventive replacements for a multi‐state, Markovian deterioration system with silent failures such that total expected discounted cost is minimized. We model this problem as a partially observed Markov decision process and show that the structural properties of the optimal policy hold for certain non‐extreme sample paths. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献