全文获取类型
收费全文 | 159篇 |
免费 | 60篇 |
国内免费 | 20篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 16篇 |
2014年 | 8篇 |
2013年 | 10篇 |
2012年 | 11篇 |
2011年 | 18篇 |
2010年 | 17篇 |
2009年 | 16篇 |
2008年 | 13篇 |
2007年 | 15篇 |
2006年 | 13篇 |
2005年 | 17篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有239条查询结果,搜索用时 31 毫秒
61.
Modeling and solution for the ship stowage planning problem of coils in the steel industry 下载免费PDF全文
We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015 相似文献
62.
63.
搜索路径给定时的最优搜索方案问题,也可以理解为是关于搜索者和目标的二人对策问题,主要讨论了当搜索路径给定时的单个搜索者和单个目标的搜索对策问题。首先根据问题的特点,利用动态规划和迭代的方法,确定关于目标逃逸路径混合策略的最优分区,证明该分区是多面体凸集;针对目标不同逃逸路径的分区,求出搜索者的最大期望收益,再将问题转化为二人有限零和对策,计算出搜索者的支付矩阵,确定最优搜索策略。最后结合海军护航行动,对我舰载直升机搜索小型海盗船进行分析和计算,说明搜索路径给定时的最优搜索对策对于双方的资源分配和提高搜索效率具有一定的应用价值。 相似文献
64.
《防务技术》2022,18(11):2097-2106
The target's threat prediction is an essential procedure for the situation analysis in an aerial defense system. However, the traditional threat prediction methods mostly ignore the effect of commander's emotion. They only predict a target's present threat from the target's features itself, which leads to their poor ability in a complex situation. To aerial targets, this paper proposes a method for its potential threat prediction considering commander emotion (PTP-CE) that uses the Bi-directional LSTM (BiLSTM) network and the backpropagation neural network (BP) optimized by the sparrow search algorithm (SSA). Furthermore, we use the BiLSTM to predict the target's future state from real-time series data, and then adopt the SSA-BP to combine the target's state with the commander's emotion to establish a threat prediction model. Therefore, the target's potential threat level can be obtained by this threat prediction model from the predicted future state and the recognized emotion. The experimental results show that the PTP-CE is efficient for aerial target's state prediction and threat prediction, regardless of commander's emotional effect. 相似文献
65.
反潜机是重要的反潜力量,根据反潜机搜潜情况,建立了反潜飞机采用阿基米德螺旋线样式搜潜的数学模型和目标运动模型,讨论了螺旋线采用的三种轨迹间隔,通过仿真验证,确立了反潜机搜潜最优轨迹间隔,以达到提高发现目标潜艇概率、优化反潜效能的目的,为反潜飞机采用阿基米德巡逻线搜潜样式搜潜时提供战术参考。 相似文献
66.
采用动态重叠网格方法和双欧法,耦合求解非定常流动控制NS方程和6DOF运动方程,数值模拟运载火箭助推级和芯级的自由分离过程和附加外力作用下的强迫分离过程,并对芯级、助推级分离的主要影响因素进行分析。数值结果与试验结果吻合,表明动态重叠网格方法能正确预测火箭芯级与助推级间复杂的流动现象。根据数值模拟结果,给出助推级在不同分离工况下的分离参数及分离规律。 相似文献
67.
68.
In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013 相似文献
69.
70.
采用非均匀网格时域有限差分(NU FDTD)方法,对单层印刷对数周期阵子天线(PLPDA)进行了电磁仿真,分析了单面和双面介质盖板对PLPDA性能的影响,得到了PLPDA的驻波和方向图特性,并进行了实验验证,分析结果与实验结果吻合得较好。 相似文献