首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   548篇
  免费   226篇
  国内免费   38篇
  2024年   1篇
  2023年   6篇
  2022年   9篇
  2021年   6篇
  2020年   23篇
  2019年   17篇
  2018年   15篇
  2017年   43篇
  2016年   48篇
  2015年   35篇
  2014年   43篇
  2013年   42篇
  2012年   40篇
  2011年   35篇
  2010年   31篇
  2009年   48篇
  2008年   33篇
  2007年   40篇
  2006年   52篇
  2005年   36篇
  2004年   36篇
  2003年   21篇
  2002年   17篇
  2001年   24篇
  2000年   18篇
  1999年   13篇
  1998年   8篇
  1997年   13篇
  1996年   8篇
  1995年   7篇
  1994年   5篇
  1993年   10篇
  1992年   7篇
  1991年   8篇
  1990年   10篇
  1989年   3篇
  1988年   1篇
排序方式: 共有812条查询结果,搜索用时 46 毫秒
121.
利用ADAMS和Matlab/Simulink两大软件的信息交互功能,将ADAMS中的全炮动力学仿真模型生成ADAMS_SUB模块,并将其嵌入联合后坐系统仿真模型中;通过ADAMS和 Matlab/Simulink同步运行对全炮进行发射动力学联合仿真,模拟大口径舰炮发射的全过程,分析全炮的动态响应.对全炮发射动力学联合仿真结果进行后处理分析,观察炮口扰动曲线,进行稳定性分析和炮口扰动分析.根据分析结果,对所建模型及仿真模块进行评价,结果表明,仿真结果与靶场试验数据基本吻合,为物理样机的研制提供了重要的理论参考依据.  相似文献   
122.
The nucleolus solution for cooperative games in characteristic function form is usually computed numerically by solving a sequence of linear programing (LP) problems, or by solving a single, but very large‐scale, LP problem. This article proposes an algebraic method to compute the nucleolus solution analytically (i.e., in closed‐form) for a three‐player cooperative game in characteristic function form. We first consider cooperative games with empty core and derive a formula to compute the nucleolus solution. Next, we examine cooperative games with nonempty core and calculate the nucleolus solution analytically for five possible cases arising from the relationship among the value functions of different coalitions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   
123.
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  相似文献   
124.
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  相似文献   
125.
采用潜艇垂直面操纵性运动方程、破损舱进水方程和压载水舱排水方程联立构成的潜艇动力抗沉运动方程,研究了2艘不同吨位潜艇的损管特性和动力抗沉运动,其中动力抗沉运动计算包括单独高压气吹除和高压气吹除加操上浮舵2种情况,并讨论了单独高压气吹除、高压气吹除与操舵联合作用的抗沉效能,从而明确了操舵在动力抗沉中的作用。通过对两艇的仿真计算结果的讨论与分析,并用动力不沉性指数Ka定量地评估了转舵在潜艇动力抗沉中的作用。计算结果表明,潜艇中、首部隔舱破损时,转舵在动力抗沉中效能显著,尾部隔舱破损时效能不明显,甚至作用相反。  相似文献   
126.
提出了用小生境遗传模拟退火算法求解带复杂约束的非线性规划问题。首先分析了遗传算法"早熟"收敛以及局部搜索能力弱的不足,由此引入小生境以增加种群多样性,并抑制"早熟"收敛现象,同时引入模拟退火算法以增强局部搜索能力,改进进化后期收敛速度慢的不足,最后结合典型非线性规划算例验证了混合算法的效率、精度和可靠性。  相似文献   
127.
针对潜射重型鱼雷在技术性能上的大幅提高和智能化作战的需要,在提出并分析鱼雷机动搜索概念和机动搜索时机的基础上,研究了远程重型鱼雷实现机动搜索在弥补发射平台目标定位误差、鱼雷发射后目标的有意机动和适应点对域攻击战法转变等作战环节中的必要性,构建了重型鱼雷机动搜索弹道的技术框架.  相似文献   
128.
动量矩守恒约束使自由漂浮柔性机械臂系统成为非完整系统,其动力学模型通常是难以求解的微分—代数方程,因此提出将机械臂系统等效为一个完整系统进行建模。假设载体存在姿态控制力矩,此时由于不存在动量矩守恒约束,系统变成一个完整系统,采用Lagrange方法建立其动力学方程;令方程中载体的姿态控制力矩为零,即得到自由漂浮机械臂系统的动力学方程;采用数值方法求解动力学方程,并将动力学分析的结果与ADAMS中仿真的结果进行对比,验证了模型能够有效模拟自由漂浮柔性机械臂系统的动力学特性。  相似文献   
129.
基于复杂网络的作战网络分析   总被引:1,自引:0,他引:1  
分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。  相似文献   
130.
In this article, we present an algorithm for the valuation and optimal operation of natural gas storage facilities. Real options theory is used to derive nonlinear partial‐integro‐differential equations (PIDEs), the solution of which give both valuation and optimal operating strategies for these facilities. The equations are designed to incorporate a wide class of spot price models that can exhibit the same time‐dependent, mean‐reverting dynamics, and price spikes as those observed in most energy markets. Particular attention is paid to the operational characteristics of real storage units. These characteristics include working gas capacities, variable deliverability and injection rates, and cycling limitations. We illustrate the model with a numerical example of a salt cavern storage facility that clearly shows how a gas storage facility is like a financial straddle with both put and call properties. Depending on the amount of gas in storage the relative influence of the put and call components vary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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