全文获取类型
收费全文 | 270篇 |
免费 | 80篇 |
国内免费 | 22篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 28篇 |
2011年 | 37篇 |
2010年 | 10篇 |
2009年 | 26篇 |
2008年 | 17篇 |
2007年 | 16篇 |
2006年 | 22篇 |
2005年 | 24篇 |
2004年 | 18篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有372条查询结果,搜索用时 15 毫秒
231.
基于Petri网的装备维修保障指挥过程建模与性能优化分析 总被引:1,自引:0,他引:1
Petri网是一种非形式化的建模方法,具有严格的定义和强大的数学分析能力,适合对同步、并发、资源共享的系统建模。利用Petri网对战术装备维修保障指挥过程进行建模,可以快速准确的描述保障指挥的流程,进而可对指挥过程进行分析,找出影响系统效率的环节加以改造和优化。本文通过对保障指挥过程的分析,建立了基于Petri网的维修保障指挥过程模型,并依据模型进行合理化简,根据假设的实例数据对比分析了现有和简化后的指挥过程的平均延迟时间,从而为战术装备维修保障指挥过程的优化提供依据。 相似文献
232.
陆战Agent是陆军作战复杂系统ABMS核心的基础要素,友方陆战Agent之间的协作机制是陆军作战复杂系统演化运行的关键支撑之一。陆战Agent之间的协作可归纳为自主协作和上级统一组织协作两种模式。陆战Agent之间的自主协作,与一般Agent系统中的协作模式相同,但由于陆军作战的特殊性,必须研究符合作战特点的陆战Agent自主协作机制。针对陆战Agent自主协作特点,对合同网协议进行了改进,探讨了陆战Agent自主协作机制模型的功能结构、框架、策略、流程和实施步骤,为陆军作战复杂系统的ABMS奠定了基础。 相似文献
233.
234.
用网络作为武器的粘合剂,将武器整合成系统,达到功能的创新,是提升武器作战效能的有效途径,网络导弹是这一概念应用的结果。文中提出了网络导弹和复合搜索扇面的概念,在设想了系统的组成和控制方案后,导出了网络导弹的作战效能计算公式,并通过算例比较网络导弹与非网络导弹的作战效能。 相似文献
235.
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 相似文献
236.
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 相似文献
237.
238.
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 相似文献
239.
提出并验证了基于随机并行梯度下降(SPGD)算法的主动相位控制脉冲激光相干合成方案.利用低通滤波器滤除脉冲激光光强变化导致的性能评价函数起伏,提取出相位噪声导致的性能评价函数变化,然后将这个低通滤波后的性能评价函数用于SPGD算法的极值寻优过程,从而实现脉冲激光的锁相.对该方案进行了理论分析和数值模拟,并进行了两路脉冲激光相干合成实验.实验结果表明,当系统从闭环到开环时,系统性能评价函数均值提高到开环的1.6倍,干涉条纹长曝光对比度从0提高到0.43.在该方案中,通过增加合成脉冲激光路数,并在各路脉冲激光中引入多级功率放大器,能够得到更高的合成功率输出. 相似文献
240.