全文获取类型
收费全文 | 2075篇 |
免费 | 867篇 |
国内免费 | 272篇 |
出版年
2024年 | 9篇 |
2023年 | 29篇 |
2022年 | 30篇 |
2021年 | 43篇 |
2020年 | 55篇 |
2019年 | 49篇 |
2018年 | 39篇 |
2017年 | 116篇 |
2016年 | 176篇 |
2015年 | 108篇 |
2014年 | 179篇 |
2013年 | 185篇 |
2012年 | 191篇 |
2011年 | 167篇 |
2010年 | 122篇 |
2009年 | 191篇 |
2008年 | 137篇 |
2007年 | 158篇 |
2006年 | 200篇 |
2005年 | 167篇 |
2004年 | 147篇 |
2003年 | 101篇 |
2002年 | 83篇 |
2001年 | 87篇 |
2000年 | 59篇 |
1999年 | 67篇 |
1998年 | 64篇 |
1997年 | 50篇 |
1996年 | 36篇 |
1995年 | 25篇 |
1994年 | 25篇 |
1993年 | 25篇 |
1992年 | 25篇 |
1991年 | 21篇 |
1990年 | 27篇 |
1989年 | 18篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有3214条查询结果,搜索用时 15 毫秒
981.
由于复杂的空中目标机动,其三维方向的机动强度是不一致的,传统IMM算法存在模型匹配不准确的问题,提出一种机动目标IMM三维并行滤波的跟踪算法。算法以CV和修正的CS模型为子集,在3个坐标轴上分别根据目标机动的分量实际更新其模型概率,并行IMM滤波方法,尽量确保模型的适配性,提高滤波精度。仿真结果表明,该算法比传统IMM方法跟踪精度更高,对空中机动目标跟踪适应性更强。 相似文献
982.
983.
针对运载火箭伺服机构故障,提出了一种基于扩展多模型自适应估计的故障检测与诊断算法。首先建立了考虑伺服机构故障的运载火箭姿态动力学模型,其次将故障角度作为状态变量得到增广状态空间模型,然后利用扩展卡尔曼滤波器进行状态向量和故障参数的非线性估计,并基于传感器测量数据采用假设检验算法在线计算故障发生的概率,最后给出了基于扩展多模型自适应估计的故障检测与诊断算法流程。该方法的优点是只用一个扩展卡尔曼滤波器就可完成一个伺服机构的故障检测与诊断,从而大幅减小用于伺服机构故障检测与诊断的滤波器数量。仿真结果表明,该方法在无故障时可对伺服机构进行健康监测,在单台伺服机构故障下,可以及时准确判断出哪一台芯级伺服机构发生故障,并可准确估计出伺服机构故障下的发动机摆角角度。 相似文献
984.
985.
利用2006—2012年北半球冬季低纬度地区(30°S~30°N)无线电探空站数据及全球大气成分和气候监测再分析数据对1000 h Pa~200 h Pa高度层的气象、电离层与气候星座观测系统全球定位系统掩星反演的比湿廓线进行了精度和可靠性验证。结果表明,水汽对气象、电离层与气候星座观测系统掩星反演影响较大,尤其在中、低对流层及热带地区等水汽含量比较大的地区,且气象、电离层与气候星座观测系统掩星数据在850 hpa以下可能并不太适用于评估其他数据。 相似文献
986.
987.
Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017 相似文献
988.
In the literature two common macroscopic evacuation planning approaches exist: The dynamic network flow approach and the Cell–Transmission–Based approach. Both approaches have advantages and disadvantages. Many efficient solution approaches for the dynamic network flow approach exist so that realistic problem instances can be considered. However, the consideration of (more) realistic aspects (eg, density dependent travel times) results in non‐linear model formulations. The Cell‐Transmission‐Based approach on the other hand considers realistic traffic phenomena like shock waves and traffic congestion, but this approach leads to long computational times for realistic problem instances. In this article, we combine the advantages of both approaches: We consider a Cell‐Transmission‐Based Evacuation Planning Model (CTEPM) and present a network flow formulation that is equivalent to the cell‐based model. Thus, the computational costs of the CTEPM are enormously reduced due to the reformulation and the detailed representation of the traffic flow dynamics is maintained. We investigate the impacts of various evacuation scenario parameters on the evacuation performance and on the computational times in a computational study including 90 realistic instances. 相似文献
989.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
990.
Namrata Panwar 《Small Wars & Insurgencies》2017,28(1):233-258
Do ceasefires or peace talks create fragmentation in the insurgent groups? Rather than proposing claims that can offer predictions about armed groups behaviour under ceasefires or peace processes, the analysts tend to focus largely on the dynamics between state and non-state actor. The experts pay little attention to overtime changes in social and local political context which might contribute to propelling a rebel group towards fragmentation and factionalism. The present study intends to fill this gap by exploring the shifting role of public opinion and ethnic support for the peace talks to ascertain whether it can increase the likelihood of factionalism in rebel groups or not. This article applies this approach to the case of Naga National Movement (1947–2015) in India, and finds that the proposed variable appears to have increased the frequency of factionalism in the movement. 相似文献