全文获取类型
收费全文 | 192篇 |
免费 | 86篇 |
国内免费 | 11篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 14篇 |
2016年 | 10篇 |
2015年 | 6篇 |
2014年 | 15篇 |
2013年 | 16篇 |
2012年 | 20篇 |
2011年 | 15篇 |
2010年 | 13篇 |
2009年 | 21篇 |
2008年 | 17篇 |
2007年 | 12篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 13篇 |
2003年 | 7篇 |
2002年 | 7篇 |
2001年 | 12篇 |
2000年 | 9篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 2篇 |
排序方式: 共有289条查询结果,搜索用时 31 毫秒
221.
导出了点堆中子动力学方程中的中子泄漏表达式 ,使点堆中子动力学方程的精度提高 ,应用领域可从反应堆冷启动一直到瞬发超临界 相似文献
222.
A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λixi)) exp (−μiyi) when the searcher and protector allocate resources xi and yi respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000 相似文献
223.
在分析地地弹道导弹射击弹道的基础上 ,建立了其落点计算的简化数学模型。针对某型号导弹飞行弹道仿真数据进行落点计算 ,结果与仿真结果一致 ,达到精度要求。 相似文献
224.
针对图像纹理应用于LiDAR点云分类过程中存在的多义性问题,提出点云纹理特征的概念。该特征属性反映了点与其邻域点的属性值分布情况,提取过程基于KD树数据检索结构和灰度共生矩阵算法。分析搜索邻域、移动步长和灰度等级等参数对点云纹理特征的影响,并利用支持向量机分类方法验证点云纹理特征,可以有效地辅助高程和强度信息以改善LiDAR点云的地物分类结果。实验还证明了相比于栅格格式的图像纹理特征,点云纹理特征约束的地物分类具有更高的分类精度,并且点云纹理特征在微小地物的甄别和水陆的区分方面具有突出的能力。该特征的这些优秀特性可以为海岸带机载LiDAR数据的精细化分类、海岸带高精度DEM构建和海岸线提取等工作发挥重要作用。 相似文献
225.
We analyze a general but parsimonious price competition model for an oligopoly in which each firm offers any number of products. The demand volumes are general piecewise affine functions of the full price vector, generated as the “regular” extension of a base set of affine functions. The model specifies a product assortment, along with their prices and demand volumes, in contrast to most commonly used demand models. We identify a fully best response operator which is monotonically increasing so that the market converges to a Nash equilibrium, when firms dynamically adjust their prices, as best responses to their competitors' prices, at least when starting in one of two price regions. Moreover, geometrically fast convergence to a common equilibrium can be guaranteed for an arbitrary starting point, under an additional condition for the price sensitivity matrix. 相似文献
226.
227.
压力容器在气液二相共存的情况下 ,采用UNIFAC法预测液相活度系数进行气液平衡计算 ,得到多元系统的气液平衡浓度 ,结合燃爆模拟实验数据 ,对容器危险工况下的超压进行安全泄放设计。 相似文献
228.
229.
应用非线性系统的定性理论方法,对一类军事竞争系统进行了定性分析,研究了系统平衡点的性态,证明了系统在全平面不存在闭轨线。 相似文献
230.
The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment. 相似文献