全文获取类型
收费全文 | 280篇 |
免费 | 61篇 |
国内免费 | 16篇 |
出版年
2023年 | 4篇 |
2022年 | 4篇 |
2021年 | 9篇 |
2020年 | 8篇 |
2019年 | 3篇 |
2018年 | 3篇 |
2017年 | 6篇 |
2016年 | 5篇 |
2015年 | 8篇 |
2014年 | 20篇 |
2013年 | 20篇 |
2012年 | 12篇 |
2011年 | 12篇 |
2010年 | 16篇 |
2009年 | 19篇 |
2008年 | 19篇 |
2007年 | 25篇 |
2006年 | 12篇 |
2005年 | 10篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 12篇 |
2000年 | 13篇 |
1999年 | 16篇 |
1998年 | 15篇 |
1997年 | 7篇 |
1996年 | 15篇 |
1995年 | 9篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1982年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有357条查询结果,搜索用时 15 毫秒
251.
分析了神经网络和模糊推理系统的优缺点,研究了自适应神经模糊推理系统(ANFIS)结构模型及后向传播和递归最小二乘算法相结合的混合算法.在分析了目标毁伤等级主要影响因素的基础上,构建了目标毁伤等级预测ANFIS模型,利用毁伤试验样本数据训练该模型,得到了与实际一致的目标毁伤等级,并将预测结果与基于BP神经网络的预测结果进行了仿真对比分析.仿真结果表明,该目标毁伤等级预测模型能够准确地预测出目标的毁伤等级,并且其预测精度较BP神经网络方法高,为目标毁伤等级预测提供了一种有效的方法. 相似文献
252.
253.
We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
254.
目的:探讨不同游戏方式下的暴力网络游戏对不同攻击性特质大学生攻击性的影响。方法:采用攻击性特质问卷、词汇决策任务和竞争反应时任务对60名大学生进行问卷和实验研究。结果:在不同游戏方式下,被试表现出的攻击性认知和行为存在显著差异(F(2,52)=4.41,P<0.05;F(1,52)=50.06,P<0.001)。高、低攻击性特质者在游戏后的攻击性认知和行为上存在显著差异(F(1,52)=15.25,P<0.001;F(1,52)=82.35,P<0.001)。结论:不同游戏方式下的暴力网络游戏对大学生的攻击性存在不同的影响,相比竞争游戏和单人游戏,合作游戏是一种较好的游戏方式,可以在一定程度减少大学生,特别是高攻击性特质大学生的攻击性认知和行为。此外,暴力网络游戏对大学生攻击性认知和攻击性行为的影响存在一致性。 相似文献
255.
Yi-jiang Xue Qing-ming Zhang Dan-yang Liu Ren-rong Long Yang-yu Lu Tian-fei Ren Liang-fei Gong 《防务技术》2021,17(2):375-381,383
Impact flash occurs when objects collide at supersonic speeds and can be used for real-time damage assessment when weapons rely on kinetic energy to destroy targets.However,the mechanism of impact flash remains unclear.A series of impact flash experiments of flat-head long-rod projectiles impacting thin target plates were performed with a two-stage light gas gun.The impact flash spectra for 6061 aluminum at 1.3-3.2 km/s collision speeds were recorded with a high-speed camera,a photoelectric sensor,and a time-resolved spectrometer.The intensity of the impact flash exhibited a pulse charac-teristic with time.The intensity(I)increased with impact velocity(V0)according to I∝Vn0,where n = 4.41 for V0 > 2 km/s.However,for V0 < 2 km/s,n = 2.21,and the intense flash duration is an order of magnitude less than that of higher V0.When V0 > 2 km/s,a continuous spectrum(thermal radiation background)was observed and increased in intensity with V0.However,for V0 < 2 km/s,only atomic line spectra were detected.There was no aluminum spectral lines for V0 < 2 km/s,which indicated that it had not been vaporized.The initial intense flash was emission from excited and ionized ambient gases near the impact surface,and had little relationship with shock temperature rise,indicating a new mechanism of impact flash. 相似文献
256.
As a key part of the pyrotechnic gas generator,the filter not only removes the particulate matter but also cools the hot gas to a safe level.This paper aims to improve the understanding of the basic heat and flow phenomenon in the gas generator.The pyrotechnic gas generator is modelling by a simplified filter structure with fiber arrays.A finite-volume model of the heat and fluid flow is proposed to simulate the detailed multi-dimensional flow and energy conversion behaviors.Several verification results are in good agreement with data in different references.Simulation results demonstrate that the filter can not only absorb heat from the gas but also cause the high intensity enhancement of the heat transfer.The per-formance difference between inline and staggered arrays is also discussed.The findings of the study put a further prediction tool for the understanding and design of the filter system with fibers. 相似文献
257.
Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc. 相似文献
258.
简要介绍了虚拟现实建模语言 ,以及该技术在防险救生这一特殊领域中的应用 ;探讨了基于WEB管理信息系统中VRML的实现以及与数据库的关联 . 相似文献
259.
巩万波 《中国人民武装警察部队学院学报》2000,16(2):55-56
虚拟现实技术与多媒体技术、网络技术并称为三大前景最好的计算机技术。它自诞生以来,就在航空航天、军事、核工业等行业中发挥着不可替代的作用。本文仅就虚拟现实技术的概念、特点、设备及在军事上的应用作一综述。 相似文献
260.
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献