全文获取类型
| 收费全文 | 706篇 |
| 免费 | 14篇 |
| 国内免费 | 6篇 |
专业分类
| 726篇 |
出版年
| 2025年 | 3篇 |
| 2024年 | 6篇 |
| 2023年 | 10篇 |
| 2022年 | 8篇 |
| 2021年 | 14篇 |
| 2020年 | 13篇 |
| 2019年 | 14篇 |
| 2018年 | 11篇 |
| 2017年 | 23篇 |
| 2016年 | 30篇 |
| 2015年 | 21篇 |
| 2014年 | 42篇 |
| 2013年 | 50篇 |
| 2012年 | 48篇 |
| 2011年 | 46篇 |
| 2010年 | 33篇 |
| 2009年 | 54篇 |
| 2008年 | 23篇 |
| 2007年 | 36篇 |
| 2006年 | 49篇 |
| 2005年 | 38篇 |
| 2004年 | 28篇 |
| 2003年 | 25篇 |
| 2002年 | 11篇 |
| 2001年 | 17篇 |
| 2000年 | 15篇 |
| 1999年 | 6篇 |
| 1998年 | 6篇 |
| 1997年 | 4篇 |
| 1996年 | 7篇 |
| 1995年 | 7篇 |
| 1994年 | 3篇 |
| 1993年 | 3篇 |
| 1992年 | 2篇 |
| 1991年 | 8篇 |
| 1990年 | 10篇 |
| 1989年 | 2篇 |
排序方式： 共有726条查询结果，搜索用时 0 毫秒
151.
Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
152.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
153.
《Small Wars & Insurgencies》2012,23(1):106-130
ABSTRACTCompelling trends in international affairs, such as the rise of private military companies (PMCs) and the increasing fragility of many nation-states, have caused some observers to question whether the state-centric, Westphalian world-order will exist in perpetuity. In this light, epochal change theory posits that world-orders have constantly changed and we are now witnessing a transition to a new one. In this paper, I discuss how small groups of private equity investors now control impressive war-fighting capabilities, and that this acquisition of PMCs by private equity firms is further evidence of epochal change theory. 相似文献
154.
In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time. Most of this work has focused on makespan minimization as social objective. In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics. In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time; and each machine sequences its jobs in weighted shortest processing time (WSPT) order. Whereas for the makespan social cost the price of anarchy is not bounded by a constant in most environments, we show that for our minsum social objective the price of anarchy is bounded above by a small constant, independent of the instance. Specifically, we show that the price of anarchy is exactly 2 for the class of unit jobs, unit speed instances where the finite processing time values define the edge set of a forest with the machines as nodes. For the general case of mixed job strategies and restricted uniform machines, we prove that the price of anarchy equals 4. From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
155.
Kjell Hausken 《Defence and Peace Economics》2013,24(5):517-519
Kovenock and Roberson's (2012a, b) replication of Hausken’s (2008a) equations and parameter restrictions do not enhance our insight into the defense and attack of reliability systems. This reply intends to fill the remaining understanding gaps. 相似文献
156.
Todd C. Robinson 《The Nonproliferation Review》2013,20(1):53-70
ABSTRACTWhat do we mean by nuclear proliferation? What does it mean to proliferate? This article investigates both the literal and figurative meaning of the term “proliferation.” It argues that many of the definitions and conceptualizations of nuclear proliferation often used by scholars are either limited in their utility or logically inconsistent. It then reconceptualizes and redefines the term, incorporating an understanding of both its etymological origins and the geopolitical context in which the phenomenon occurs. It concludes by exploring the potential impact that the politicization of the phenomenon may have on the identification of occurrences of proliferation, from both an academic and a policy-making perspective. 相似文献
157.
电磁干扰条件下解决断续航路预测问题对防空兵有效抗击空中目标至关重要。针对包络灰预测方法预测精度较低和Verhulst灰色预测模型计算过程复杂的情况,提出了预测航路的分形方法。在分形理论的基础上,研究了其用于目标断续航路预测的基本思路,建立了基于分形的目标航路预测模型,并对模型进行了求解。最后,利用建立的分形模型对雷达丢失目标后的目标航路进行了预测,通过实例体现了分形方法在用于航路预测时的准确性、灵活性和易实现等特点。结果表明,用该法对断续目标航路的预测具有一定的借鉴意义。 相似文献
158.
159.
在503 K反铁电体PbZrO3发生立方-正交相变,序参量是反平行离子位移引起的超晶格;在低温相时,PbZrO3的反铁电超晶格反射强度随温度的变化成正比,可以由考虑量子效应的Landau唯象理论加以描述;高于室温时,Γ25超晶格反射强度显示了不同的温度依赖性。 相似文献
160.
一种新的基本概率函数构建方法及应用 总被引：1，自引：0，他引：1
针对Dempster-Shafer(D-S)证据推理中基本概率赋值函数的构造问题,基于模糊聚类分析给出了一种新的构建方法.将它应用到雷达目标识别的仿真实验中,并与灰关联法相比较,结果表明该方法切实可行,不仅提高了基本概率赋值的准确性和稳定性,而且利用了数据的结构信息,有效缓解了证据的冲突. 相似文献