首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   647篇
  免费   238篇
  国内免费   16篇
  2024年   1篇
  2023年   4篇
  2022年   14篇
  2021年   37篇
  2020年   14篇
  2019年   9篇
  2018年   9篇
  2017年   10篇
  2016年   8篇
  2015年   30篇
  2014年   24篇
  2013年   45篇
  2012年   34篇
  2011年   23篇
  2010年   38篇
  2009年   43篇
  2008年   27篇
  2007年   44篇
  2006年   23篇
  2005年   36篇
  2004年   12篇
  2003年   7篇
  2002年   5篇
  2001年   10篇
  2000年   22篇
  1999年   48篇
  1998年   52篇
  1997年   39篇
  1996年   40篇
  1995年   30篇
  1994年   32篇
  1993年   26篇
  1992年   18篇
  1991年   24篇
  1990年   21篇
  1989年   11篇
  1988年   5篇
  1987年   7篇
  1986年   9篇
  1985年   5篇
  1983年   2篇
  1982年   2篇
  1977年   1篇
排序方式: 共有901条查询结果,搜索用时 531 毫秒
81.
提出了一种排除无源交叉定位虚假交点的新方法,称为四边形分组法.该方法通过将无源交叉定位产生的四边形进行分组来区分真实交点和虚假交点.这种方法只需要测向信息,不需要任何其他先验信息.该方法无需先验信息.仿真结果表明,该方法是有效的,运算速度快,对水平编队目标群定位精度高.  相似文献   
82.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
83.
In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008  相似文献   
84.
The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability.  相似文献   
85.
在介绍超高压共轨系统工作原理的基础上,基于GT-Power软件建立单缸超高压共轨柴油机的仿真模型,并利用试验验证模型的准确性,而后通过模型分析不同喷油速率、靴形喷油速率耦合不同预喷油量和靴形喷油速率耦合不同预喷提前角对超高压共轨柴油机动力性、经济性以及燃烧排放特性的影响。结果表明:通过调整超高压共轨系统中电控增压器电磁阀和喷油器电磁阀的开启时间,能够实现喷油速率的柔性可调。随着喷油速率从矩形变化到靴形,柴油机缸内压力、温度以及NO_x排放量均逐渐降低,而soot排放量逐渐升高,且靴形喷油速率可使柴油机获得最大的功率(扭矩)和最低的油耗率。靴形喷油速率耦合较小的预喷油量可以使柴油机获得更好的动力性、经济性和燃烧特性,但同时也会导致NO_x排放量的升高。靴形喷油速率耦合较大的预喷提前角有助于改善柴油机排放特性,但受到预喷油量的限制,效果并不明显。  相似文献   
86.
为分析在时序抛撒方式下子母弹多体干扰流场特性及其对各舱段弹体气动特性的影响,基于流体控制方程与六自由度刚体运动方程,结合非结构动网格技术,分别对两种时序抛撒方式及后舱子弹单独抛撒方式下的子母弹三维非定常分离流场进行数值模拟,得到不同抛撒时序下的分离流场特性及其气动干扰特性,揭示各舱段子弹在不同分离阶段的气动干扰相互作用过程。研究结果表明:在时序抛撒分离过程中各弹体间激波不断地交错干扰,增加了流场结构的复杂性;前舱子弹的激波干扰使得后舱段子弹气动分离参数较低,分离效率较慢,尤其在短时序间隔下,后舱弹体受前舱子弹干扰较为严重,弹体的安全分离受到影响。  相似文献   
87.
有源诱饵弹是对抗毫米波制导武器的一种重要手段。根据毫米波雷达制导导弹波束窄的特点,采用投放多枚诱饵弹以组成诱饵阵的对抗方法。初步建立了对抗过程仿真的数学模型,并通过该模型对对抗过程进行了仿真分析。分析表明,如果依据形势合理布放诱饵,将会对目标起到很好的保护作用。  相似文献   
88.
为了对地杂波进行正确的建模仿真,针对外场试验中得到的大量真实地杂波数据,根据回波信号的典型处理过程对其加以处理和研究,将各阶段处理结果与瑞利分布、对数正态分布、韦布尔分布和相关K分布进行比对,找出了最符合实际地杂波分布的分布模型。由于实际环境复杂多变,分析了入射余角、统计时间及分辨率对杂波分布影响,对模型适应特定环境提供参考。根据分析确定的杂波模型,最后采用ZMNL法仿真实现。  相似文献   
89.
给出了一种基于átrous算法红外与可见光图像融合算法,该算法主要针对光谱差异较大以及配准精度较低的这类图像的融合算法。该算法首先对融合图像源进行átrous算法分解;随后,对分解的低频信息利用取加权法进行融合;高频信息首先利用边缘检测技术对不同尺度不同方向的高频信息进行边缘点的加强,然后以区域的空间频率为度量标准得到新的高频系数;最后进行átrous算法重构得到最终的融合图像。通过两组红外和可见光图像的融合实验,结果表明该方法能有效地突出边缘细节,提高图像分辨效果和人眼对场景目标的发现和识别概率。  相似文献   
90.
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  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号