全文获取类型
收费全文 | 399篇 |
免费 | 7篇 |
国内免费 | 2篇 |
专业分类
408篇 |
出版年
2025年 | 2篇 |
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 9篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 14篇 |
2016年 | 21篇 |
2015年 | 18篇 |
2014年 | 24篇 |
2013年 | 20篇 |
2012年 | 18篇 |
2011年 | 13篇 |
2010年 | 15篇 |
2009年 | 27篇 |
2008年 | 20篇 |
2007年 | 22篇 |
2006年 | 33篇 |
2005年 | 16篇 |
2004年 | 18篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 16篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 5篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有408条查询结果,搜索用时 0 毫秒
101.
Joni Driessen;Joost de Kruijff;Joachim Arts;Geert-Jan van Houtum; 《海军后勤学研究》2024,71(2):189-209
A line replaceable unit (LRU) is a collection of connected parts in a system that is replaced when any part of the LRU fails. Companies use LRUs as a mechanism to reduce downtime of systems following a failure. The design of LRUs determines how fast a replacement is performed, so a smart design reduces replacement and downtime cost. A firm must purchase/repair a LRU upon failure, and large LRUs are more expensive to purchase/repair. Hence, a firm seeks to design LRUs such that the average costs per time unit are minimized. We formalize this problem in a new model that captures how parts in a system are connected, and how they are disassembled from the system. Our model optimizes the design of LRUs such that the replacement (and downtime) costs and LRU purchase/repair costs are minimized. We present a set partitioning formulation for which we prove a rare result: the optimal solution is integer, despite a nonintegral feasible polyhedron. Second, we formulate our problem as a binary linear program (BLP). The article concludes by numerically comparing the computation times of both formulations and illustrates the effects of various parameters on the model's outcome. 相似文献
102.
Dimitri P. Bertsekas 《海军后勤学研究》2019,66(1):15-37
In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019 相似文献
103.
用非线性规划求解有限推力最优交会 总被引:8,自引:0,他引:8
利用非线性规划方法研究了航天器的有限推力最优交会问题。这种方法利用了近年来发展起来的直接优化技术,用分段多项式来表示整个轨道的状态和控制向量,将最优控制问题转化为非线性规划问题。在应用这种方法时,先将整个轨道分为若干推力段和无推力段,然后利用配置方法产生推力段的约束段,利用状态转移矩阵来产生无推力段的约束。最后,对共面轨道情况下的交会进行了数值仿真,验证了方法的有效性和鲁棒性。 相似文献
104.
机器人力反馈依从控制器多机系统分布式程序设计的实现 总被引:1,自引:0,他引:1
肖人庆 《国防科技大学学报》1990,12(4):43-50
本文介绍在机器人力反馈依从控制器多机系统中采用程序设计语言C 与分布式库函数相结合实现分布式程序设计的方法,论述了分布式库函数形式,支持分布式库函数设计的多机操作系统功能及其在设计过程中应予以重视的某些问题,并给出了分布式程序设计的一个简例。 相似文献
105.
106.
一个在轨服务可有多种服务选择,必须进行合理的任务指派。首先求解服务航天器满足燃耗约束下的可达区域,筛选出满足可达范围要求的目标航天器。然后,以任务执行时间、燃料消耗和航天器服务优先级为优化目标,研究多目标的任务指派问题。通过设计决策变量,考虑时间、燃耗等约束,建立了基于0-1整数规划的任务模型,采用NSGA-Ⅱ算法,求得问题的Pareto最优集,得到多组可供任务设计者选择自己偏好的折中方案。文章给出了两个多目标优化的仿真算例,算例一给出了任务指派的一般研究结论,算例二对比了另外一种算法:分层-加权法。仿真结果表明利用文章给出的方法可以较好地解决多目标下在轨服务任务指派问题。 相似文献
107.
特征提取与评估是损伤检测和故障预测的基础。针对2K-H行星轮系缺齿损伤,建立了行星轮系的损伤模型,通过分析模型的仿真信号,提出了基于主频边带、小波变换和经验模式分解的多种损伤特征,并采用双样本一致性检验方法对所提取损伤特征的分类能力进行了评估,采用含噪声的仿真信号和试验数据对损伤特征进行了验证。验证结果表明,所提取的损伤特征均具有较强的分类能力,其中主频边带特征的分类性能最优。 相似文献
108.
109.
110.
Sanjay Mehrotra Hamed Rahimian Masoud Barah Fengqiao Luo Karolina Schantz 《海军后勤学研究》2020,67(5):303-320
We present a stochastic optimization model for allocating and sharing a critical resource in the case of a pandemic. The demand for different entities peaks at different times, and an initial inventory for a central agency are to be allocated. The entities (states) may share the critical resource with a different state under a risk-averse condition. The model is applied to study the allocation of ventilator inventory in the COVID-19 pandemic by FEMA to different U.S. states. Findings suggest that if less than 60% of the ventilator inventory is available for non-COVID-19 patients, FEMA's stockpile of 20 000 ventilators (as of March 23, 2020) would be nearly adequate to meet the projected needs in slightly above average demand scenarios. However, when more than 75% of the available ventilator inventory must be reserved for non-COVID-19 patients, various degrees of shortfall are expected. In a severe case, where the demand is concentrated in the top-most quartile of the forecast confidence interval and states are not willing to share their stockpile of ventilators, the total shortfall over the planning horizon (until May 31, 2020) is about 232 000 ventilator days, with a peak shortfall of 17 200 ventilators on April 19, 2020. Results are also reported for a worst-case where the demand is at the upper limit of the 95% confidence interval. An important finding of this study is that a central agency (FEMA) can act as a coordinator for sharing critical resources that are in short supply over time to add efficiency in the system. Moreover, through properly managing risk-aversion of different entities (states) additional efficiency can be gained. An additional implication is that ramping up production early in the planning cycle allows to reduce shortfall significantly. An optimal timing of this production ramp-up consideration can be based on a cost-benefit analysis. 相似文献