全文获取类型
收费全文 | 182篇 |
免费 | 50篇 |
国内免费 | 30篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2019年 | 5篇 |
2018年 | 1篇 |
2017年 | 10篇 |
2016年 | 9篇 |
2015年 | 11篇 |
2014年 | 10篇 |
2013年 | 20篇 |
2012年 | 20篇 |
2011年 | 24篇 |
2010年 | 14篇 |
2009年 | 28篇 |
2008年 | 13篇 |
2007年 | 17篇 |
2006年 | 14篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有262条查询结果,搜索用时 31 毫秒
11.
目前,在桥梁毁伤仿真领域采用的数值仿真方法虽具有精确性高的优点,但是仿真过程不直观、形象,整体性不强。采用视景仿真技术进行精确打击下桥梁毁伤仿真,在保证精确性要求的基础上,利用Unity3D软件以三维画面的形式进行展示,仿真过程形象、直观、明了。给出的精确打击下桥梁毁伤视景仿真系统的设计方法,能够满足真实性和实时性的要求,利用Unity3D自带的物理引擎完成了桥梁模型的物理特性建模和爆炸仿真分析,通过全过程仿真,能够分析得出相应的毁伤结论,达到了预期效果。 相似文献
12.
13.
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 相似文献
14.
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 相似文献
15.
16.
虹膜定位是虹膜识别中基础性环节,其精度和速度决定了虹膜识别系统的性能。为提高虹膜定位的速度,提出一种基于圆几何特征的虹膜内边缘定位算法,利用内外边缘中心的耦合特性缩小微积分方法搜索外边缘的范围。实验结果表明,与经典虹膜定位算法相比,提出的算法快速、精确、鲁棒。 相似文献
17.
18.
19.
20.
对纯方位最小二乘估计器,在已知某时刻一个观测距离的情况下,导出了一种伴随型的目标速度估计器.该算法嵌入原最小二乘估计器之中,计算简单且便于工程应用. 相似文献