全文获取类型
收费全文 | 685篇 |
免费 | 114篇 |
国内免费 | 57篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 9篇 |
2021年 | 15篇 |
2020年 | 13篇 |
2019年 | 16篇 |
2018年 | 11篇 |
2017年 | 29篇 |
2016年 | 36篇 |
2015年 | 24篇 |
2014年 | 47篇 |
2013年 | 61篇 |
2012年 | 59篇 |
2011年 | 61篇 |
2010年 | 40篇 |
2009年 | 71篇 |
2008年 | 33篇 |
2007年 | 47篇 |
2006年 | 55篇 |
2005年 | 42篇 |
2004年 | 34篇 |
2003年 | 28篇 |
2002年 | 14篇 |
2001年 | 20篇 |
2000年 | 18篇 |
1999年 | 9篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 8篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 2篇 |
排序方式: 共有856条查询结果,搜索用时 15 毫秒
31.
32.
In this article, we develop a novel electric power supply chain network model with fuel supply markets that captures both the economic network transactions in energy supply markets and the physical network transmission constraints in the electric power network. The theoretical derivation and analysis are done using the theory of variational inequalities. We then apply the model to a specific case, the New England electric power supply chain, consisting of six states, five fuel types, 82 power generators, with a total of 573 generating units, and 10 demand market regions. The empirical case study demonstrates that the regional electric power prices simulated by our model match the actual electricity prices in New England very well. We also compute the electric power prices and the spark spread, an important measure of the power plant profitability, under natural gas and oil price variations. The empirical examples illustrate that in New England, the market/grid‐level fuel competition has become the major factor that affects the influence of the oil price on the natural gas price. Finally, we utilize the model to quantitatively investigate how changes in the demand for electricity influence the electric power and the fuel markets from a regional perspective. The theoretical model can be applied to other regions and multiple electricity markets under deregulation to quantify the interactions in electric power/energy supply chains and their effects on flows and prices. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
33.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
34.
基于MGEKF的单站无源定位跟踪算法 总被引:1,自引:0,他引:1
单站无源定位跟踪技术具有隐蔽性强、设备简单,系统相对独立等优点,有着广阔的应用前景.为了提高定位精度和收敛速度以满足实时化需求,在现有的基于多普勒变化率的单站无源定位算法的基础上.详细推导了基于MGEKF的定位算法以解决EKF算法的不稳定性,并通过计算机仿真比较了两种算法的性能,结果表明MGEKF定位算法提高了定位精度、收敛速度和稳定度,定位结果能够满足实际需求. 相似文献
35.
基于灰色系统理论的火灾事故预测方法 总被引:2,自引:0,他引:2
简要叙述应用灰色系统理论进行火灾事故预测的理论和方法 ,建立了火灾事故预测的GM (1,1)模型 ,并用该模型对火灾事故进行预测。 相似文献
36.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
37.
Ryusuke Hohzaki 《海军后勤学研究》2008,55(1):76-90
This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008 相似文献
38.
Kenton G. Fasana 《Defence Studies》2018,18(2):167-187
Cyberspace is an avenue of approach through which a military force can attain objectives of value. Through these cyber avenues of approach, military forces can engage, vet, organize, and direct human agents to accomplish specific activities. Although the objectives of these activities could differ from traditional military objectives, they still have military relevance. This particular manifestation of cyber conflict is neither a new domain of war nor something outside of warfare. Rather, it can be viewed as an emerging avenue of approach in the larger context of military operations, auguring benefits in the integration of cyber activities with operations. 相似文献
39.
40.