全文获取类型
收费全文 | 180篇 |
免费 | 47篇 |
国内免费 | 24篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2019年 | 4篇 |
2018年 | 3篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 22篇 |
2012年 | 21篇 |
2011年 | 22篇 |
2010年 | 10篇 |
2009年 | 24篇 |
2008年 | 13篇 |
2007年 | 24篇 |
2006年 | 14篇 |
2005年 | 10篇 |
2004年 | 12篇 |
2003年 | 9篇 |
2002年 | 5篇 |
2001年 | 7篇 |
2000年 | 6篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1990年 | 2篇 |
排序方式: 共有251条查询结果,搜索用时 0 毫秒
31.
本文提出了利用声传感器测量舰炮射击海上弹着点的方法,并建立了基本方程。对测量系统的原理和测量信息的传输方式进行了分析,在此基础上,对声传感器位置误差、测时误差及二者综合作用对测量精度的影响分别进行了仿真计算,证明测量原理可行,测量精度满足要求。 相似文献
32.
33.
信息中心网络(Information-Centric Networking, ICN)“泛在缓存”的特性,引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题,分别从用户、服务提供商和网络运营商的角度出发,以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型,并将二者结合为帕累托模型;基于帕累托求解方法中数学规划法的思想,详细描述缓存节点位置选择算法。仿真结果表明:在流量性价比方面,所提缓存节点选择算法优于ICN的默认缓存机制;在网络费用开销方面,所提算法更适用于只有少数内容较为流行的网络中,而在所有内容都流行的情况下,ICN中默认的“遍地缓存”机制更为适宜。 相似文献
34.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
35.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
36.
37.
虹膜定位是虹膜识别中基础性环节,其精度和速度决定了虹膜识别系统的性能。为提高虹膜定位的速度,提出一种基于圆几何特征的虹膜内边缘定位算法,利用内外边缘中心的耦合特性缩小微积分方法搜索外边缘的范围。实验结果表明,与经典虹膜定位算法相比,提出的算法快速、精确、鲁棒。 相似文献
38.
39.
主要对双声纳基阵二维目标联合测向交叉定位算法及精度进行了分析,给出了系统具体的定位公式和误差计算公式,并针对不同基线和不同基线误差、方位误差下目标GDOP的分布情况进行了仿真分析。仿真结果表明,定位误差随基线长度的增加而减小,随基线和方位误差的增大而增大,当基线增大到一定长度时.定位误差最终趋向稳定,达到最小。 相似文献
40.