全文获取类型
收费全文 | 542篇 |
免费 | 9篇 |
国内免费 | 1篇 |
专业分类
552篇 |
出版年
2024年 | 3篇 |
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 24篇 |
2020年 | 11篇 |
2019年 | 1篇 |
2018年 | 6篇 |
2017年 | 11篇 |
2016年 | 5篇 |
2015年 | 10篇 |
2014年 | 9篇 |
2013年 | 20篇 |
2012年 | 16篇 |
2011年 | 24篇 |
2010年 | 27篇 |
2009年 | 35篇 |
2008年 | 39篇 |
2007年 | 25篇 |
2006年 | 15篇 |
2005年 | 21篇 |
2004年 | 17篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 15篇 |
2000年 | 21篇 |
1999年 | 35篇 |
1998年 | 19篇 |
1997年 | 21篇 |
1996年 | 24篇 |
1995年 | 12篇 |
1994年 | 16篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 6篇 |
1990年 | 8篇 |
1989年 | 4篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
排序方式: 共有552条查询结果,搜索用时 0 毫秒
81.
The evaluation index of camouflage patterns is important in the field of military application. It is the goal that researchers have always pursued to make the computable evaluation indicators more in line with the human visual mechanism. In order to make the evaluation method more computationally intelligent, a Multi-Feature Camouflage Fused Index (MF-CFI) is proposed based on the comparison of grayscale, color and texture features between the target and the background. In order to verify the effectiveness of the proposed index, eye movement experiments are conducted to compare the proposed index with existing indexes including Universal Image Quality Index (UIQI), Camouflage Similarity Index (CSI) and Structural Similarity (SSIM). Twenty-four different simulated targets are designed in a grassland background, 28 observers participate in the experiment and record the eye movement data during the observation process. The results show that the highest Pearson correlation coefficient is observed between MF-CFI and the eye movement data, both in the designed digital camouflage patterns and large-spot camouflage patterns. Since MF-CFI is more in line with the detection law of camouflage targets in human visual perception, the proposed index can be used for the comparison and parameter optimization of camouflage design algorithms. 相似文献
82.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
83.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
84.
85.
目前,世界各国意识到信息对战斗力生成的巨大作用,纷纷开始积极发展军用卫星体系。从通信卫星、侦察卫星、预警卫星和导航定位卫星四个方面入手,介绍了美俄军事卫星系统的具体型号、数量、发射时间、运行状况等情况,并分析了军事卫星系统的发展趋势。现代航天技术的发展,极大地改变着人类的生活方式,也必将影响未来战争的发展模式。 相似文献
86.
87.
本文以概率图理论为基础,系统研究了基于这一理论框架的故障诊断模型,对模型的构建方法以及在不同场景下的模型演化方案进行了探讨,使得在统一理论框架下可实现多模式系统故障诊断、耦合故障诊断、动态故障诊断、故障预测等复杂情形的诊断。为了弥补单独利用基于模型的方法和基于数据的方法的缺陷,研究了诊断模型的学习进化策略,实现了诊断效果的改进和优化。另外,对模型后续的能力扩展和可能的研究方向进行了展望,为后续理论研究提供了参考。 相似文献
88.
89.
随着并行规模的扩大,现有通信等待问题的诊断方法存在内存开销大、测量时间开销大等问题。通过对现有通信等待问题诊断方法的深入分析,同时考虑测量开销可控的实际需求,建立基于热点函数的通信等待问题诊断模型。基于上述模型,总结出一种更精简、更实用的通信等待问题诊断方法。将该诊断方法分别应用到二维LARED集成、LARED-S、LAP3D等大规模MPI并行程序的通信等待问题诊断过程,应用效果表明本诊断方法可精确定位导致通信等待问题的关键代码段,给出的优化方案及性能提升空间对于后续的程序改进具有参考价值,其中根据诊断结果优化后的LARED-S程序性能提升32%,通信等待时间减少44%。 相似文献
90.
回转体表面不同尺寸脊状结构的减阻数值仿真 总被引:1,自引:0,他引:1
将脊状表面减阻技术应用于水下回转体,对回转体表面不同尺寸的V型脊状结构在多个速度下进行了数值仿真计算,发现了脊状结构的尺寸对回转体脊状表面减阻效果的影响规律。针对回转体脊状表面的流场特性,在进行数值仿真时合理选择了计算模型、计算流域、计算网格及边界条件。仿真结果表明:在同一速度下,相对光滑表面而言,回转体脊状表面所受的压差阻力略有增大,但占总阻力份额80%以上的粘性阻力显著降低,从而形成减阻效果;当V型脊状结构的宽高比等于1时,减阻效果最佳;对于同一个回转体脊状表面,低速下的减阻效果明显优于高速。 相似文献