全文获取类型
收费全文 | 366篇 |
免费 | 76篇 |
国内免费 | 14篇 |
出版年
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 9篇 |
2020年 | 14篇 |
2019年 | 20篇 |
2018年 | 13篇 |
2017年 | 38篇 |
2016年 | 30篇 |
2015年 | 23篇 |
2014年 | 29篇 |
2013年 | 42篇 |
2012年 | 25篇 |
2011年 | 25篇 |
2010年 | 21篇 |
2009年 | 22篇 |
2008年 | 13篇 |
2007年 | 18篇 |
2006年 | 14篇 |
2005年 | 15篇 |
2004年 | 16篇 |
2003年 | 7篇 |
2002年 | 8篇 |
2001年 | 9篇 |
2000年 | 10篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有456条查询结果,搜索用时 250 毫秒
41.
42.
冷战结束后,欧美多数军工企业在军转民的过程中采取多元化的经营战略,壮大企业规模并寻求进一步的发展。随着我国军民融合战略的深入实施,军工企业不再是封闭独立的单一军品生产基地,而是顺时应势逐步实现军品和民品同步多元化发展的战略转型。通过分析我国军工企业军转民的历史进程与国际经验,结合多元化战略的特点,考察军工企业在军转民过程中实施多元化战略的动因,构建军工企业多元化战略的选择函数。本文认为,军工企业选择多元化战略应考虑企业自身实际情况,积极响应国家政策,培育核心竞争力;同时,军转民过程作为军民融合深度发展的重要一环,会促使军工企业往多元化的方向发展,而多元化战略的实施也会加快军民融合深度发展的进程。 相似文献
43.
44.
针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性. 相似文献
45.
分析了面向任务保障性工程理论指导下的舰船随舰备件配置问题,就最大、最小两种维修策略下随舰备件配置问题进行了研究,给出了面向任务的随舰备件需求分析仿真模型框架,结合算倒,研究了最大维修策略与最小维修策略的适用时机:在任务确定且任务结构函数明确条件下,应采用最小维修策略;否则采用最大维修策略. 相似文献
46.
The article concerns the strategy development processes of the South African Department of Defence in South Africa. It intends to identify the probable causes of the observed failure of the South African National Defence Force to develop appropriate departmental policy and military strategy. Military strategy comprises force development, force employment, force deployment and the coordination of these elements in pursuit of national, grand-strategic objectives. (See Dennis M. Drew and Donald M. Snow, Making Twenty-first Century Strategy: An Introduction to Modern National Security Processes and Problems Montgomery, AL: Air University Press, Maxwell Air Force Base, November 2006, 103). Of these four constructs, the article concerns itself only with the first two. The article analyses two complementary approaches to strategy formation: a resource-driven, inside-out model and an interests-driven, outside-in method. The article concludes that the Department is preoccupied with the inside-out method to the lasting detriment of the declared strategic intent of the defence policy. 相似文献
47.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
48.
49.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001 相似文献
50.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献