全文获取类型
收费全文 | 393篇 |
免费 | 152篇 |
国内免费 | 28篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 6篇 |
2020年 | 11篇 |
2019年 | 8篇 |
2018年 | 2篇 |
2017年 | 23篇 |
2016年 | 27篇 |
2015年 | 20篇 |
2014年 | 34篇 |
2013年 | 29篇 |
2012年 | 31篇 |
2011年 | 24篇 |
2010年 | 20篇 |
2009年 | 43篇 |
2008年 | 32篇 |
2007年 | 30篇 |
2006年 | 32篇 |
2005年 | 18篇 |
2004年 | 30篇 |
2003年 | 16篇 |
2002年 | 11篇 |
2001年 | 21篇 |
2000年 | 15篇 |
1999年 | 5篇 |
1998年 | 7篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 3篇 |
1988年 | 2篇 |
排序方式: 共有573条查询结果,搜索用时 46 毫秒
201.
针对防空旅(团)指挥自动化系统效能评估中,其属性权重完全未知或只知大致范围的特点,给出2种基于理想点的不确定多属性效能评估模型,通过对模型的求解,可获得属性权重,进而对这种不确定性系统效能进行评估.该模型符合防空指挥自动化系统效能复杂性和人们思维的模糊性,为解决此类问题提供了新的途径和方法.实例证明,该模型简单有效. 相似文献
202.
一类m-点边值问题的正解 总被引:2,自引:0,他引:2
研究一类二阶m-点边值问题u″ f(t,u,u)′=0,00,i=1,…,m-2,ζi满足0=ζ0<ζ1<ζ2<…<ζm-2<ζm-1=1和i∑=1aiζi<1。应用推广的Krasnosel-skii′s不动点定理,给出了上述边值问题至少存在一个正解的充分条件。 相似文献
203.
针对MIMO雷达自适应波束形成中期望目标导向矢量的失配问题,提出了一种基于二阶锥规划(SOCP)的稳健自适应波束形成算法。该算法首先将1个MN维(M,N分别为发射和接收阵元数)的权矢量分解成2个低维(1个M维和1个N维)权矢量的Kronecker积,然后分别限制实际的目标发射导向矢量和目标接收导向矢量与假定的导向矢量之间的误差范数的边界,通过优化最差性能,利用SOCP求得分解后的2个权矢量,最后再合成原权矢量。通过降维处理,算法在保证波束形成器性能的基础上,有效地降低了运算复杂度。仿真结果验证了算法的有效性。 相似文献
204.
205.
This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012 相似文献
206.
为了实现椭圆曲线的快速倍乘,Gallant-Lamber-Vanstone( GLV)方法被推广到四维的一般情形.文章中回答了Galbraith,Lin和Scott(J.Cryptol.DOI:10.1007/s00145 - 010 - 9065-y)提出的一个公开问题:研究Fp2上j不变量等于1728的GLS椭圆曲线上的四维GLV方法,并给出时间周期.尤其指出GLV的四维分解能够在很大的概率上实现,给出了一些结果和例子.特别指出在同一类曲线上,四维GLV方法的时间周期大概是二维GLV方法的70%~ 73%. 相似文献
207.
冰点是表征航空燃料低温使用性能的重要指标。常规冰点测定方法操作步骤复杂,测定时间长,影响航空燃料质量检测效率。基于光散射原理,将温度传感和光电检测技术应用于航空燃料冰点测定,利用燃料结晶对光散射和透射的影响,实现航空燃料冰点快速测定。该方法操作简单快速,检测1个油样用时少于15 min,大幅提高了冰点检测效率;试样体积仅需2 mL,有利于试验环境保护;测定结果重复性好,与标准方法 GB/T2430—2008具有良好的相关性。 相似文献
208.
209.
Harold P. Benson 《海军后勤学研究》2006,53(4):309-317
The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
210.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献