全文获取类型
收费全文 | 2061篇 |
免费 | 468篇 |
国内免费 | 162篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 19篇 |
2021年 | 40篇 |
2020年 | 47篇 |
2019年 | 66篇 |
2018年 | 68篇 |
2017年 | 114篇 |
2016年 | 142篇 |
2015年 | 74篇 |
2014年 | 182篇 |
2013年 | 251篇 |
2012年 | 151篇 |
2011年 | 131篇 |
2010年 | 134篇 |
2009年 | 167篇 |
2008年 | 129篇 |
2007年 | 128篇 |
2006年 | 155篇 |
2005年 | 131篇 |
2004年 | 103篇 |
2003年 | 88篇 |
2002年 | 57篇 |
2001年 | 51篇 |
2000年 | 28篇 |
1999年 | 41篇 |
1998年 | 34篇 |
1997年 | 29篇 |
1996年 | 18篇 |
1995年 | 18篇 |
1994年 | 11篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 13篇 |
1990年 | 17篇 |
1989年 | 5篇 |
1987年 | 1篇 |
排序方式: 共有2691条查询结果,搜索用时 0 毫秒
1.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
2.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献
3.
试验研究了穿甲子弹垂直侵彻高强防弹钢的机理,提出了一个分析靶板极限速度和弹体剩余速度的理论模型,该模型综合考虑了材料的应变率与热软化效应,结果表明,理论值与试验值吻合很好.分析了失效准则的影响,研究了剪切带温度和靶板耗能随入射速度的变化规律. 相似文献
4.
5.
近年来,边防部队通过大力开展基层警营文化建设,取得了可喜的成绩,但整体情况仍然滞后,需从多方面分析其存在的问题及原因,才能进一步提出对策,使警营文化效能的发挥达到最佳。 相似文献
6.
周云龙 《国防科技大学学报》2016,38(4)
采用五阶精度显式HWCNS格式求解雷诺平均NS方程,利用多块对接结构网格技术,对30P-30N多段翼型进行网格收敛性研究,在不考虑转捩的情况下采用SA一方程湍流模型研究HWCNS格式与二阶精度MUSCL格式对该翼型压力分布和典型站位速度型的影响,并与实验结果进行对比分析。采用HWCNS格式和SA一方程湍流模型模拟梯形翼高升力构型低速复杂流场,通过对总体气动特性和压力分布的分析,探讨五阶精度显式HWCNS格式在低速复杂外形流动中的应用能力。 相似文献
7.
8.
9.
Fernando M. M. Ruiz Florent Hainaut Nathalie Schiffino 《Defence and Peace Economics》2016,27(6):774-793
Lobbyists may not share the same interests, but they usually agree to form a link in a network which could eventually be used to spread information, to search for potential partners, to speak with one voice to decision makers. In other words, social links represent value for lobbyists because they may ultimately facilitate access. In this article, we explore the network of the Security and Defense lobbies in the EU and we describe its structure. 相似文献
10.