全文获取类型
| 收费全文 | 740篇 |
| 免费 | 18篇 |
| 国内免费 | 4篇 |
专业分类
| 762篇 |
出版年
| 2025年 | 4篇 |
| 2024年 | 5篇 |
| 2023年 | 7篇 |
| 2022年 | 11篇 |
| 2021年 | 38篇 |
| 2020年 | 8篇 |
| 2019年 | 5篇 |
| 2018年 | 10篇 |
| 2017年 | 15篇 |
| 2016年 | 9篇 |
| 2015年 | 32篇 |
| 2014年 | 43篇 |
| 2013年 | 32篇 |
| 2012年 | 30篇 |
| 2011年 | 37篇 |
| 2010年 | 58篇 |
| 2009年 | 40篇 |
| 2008年 | 43篇 |
| 2007年 | 40篇 |
| 2006年 | 26篇 |
| 2005年 | 32篇 |
| 2004年 | 9篇 |
| 2003年 | 3篇 |
| 2002年 | 3篇 |
| 2001年 | 10篇 |
| 2000年 | 10篇 |
| 1999年 | 36篇 |
| 1998年 | 24篇 |
| 1997年 | 24篇 |
| 1996年 | 20篇 |
| 1995年 | 29篇 |
| 1994年 | 13篇 |
| 1993年 | 9篇 |
| 1992年 | 11篇 |
| 1991年 | 11篇 |
| 1990年 | 6篇 |
| 1989年 | 2篇 |
| 1988年 | 5篇 |
| 1987年 | 5篇 |
| 1986年 | 4篇 |
| 1985年 | 2篇 |
| 1983年 | 1篇 |
排序方式： 共有762条查询结果，搜索用时 0 毫秒
111.
针对传统优化方法不能对武器装备使用主体――部队的使用需求进行有效考虑,提出武器装备使用需求到性能指标映射的串联QFD神经网络方法.该方法综合利用了QFD方法采集信息准确快速、神经网络能够精确模拟多变量输入输出强非线性关系的优点,提高了映射精度与针对性,克服了传统需求分析侧重于推理而轻实践、侧重于\"设计方\"而轻\"使用方\"的弊端,集中体现了\"用户\"为主的思想.改进了传统BP网络训练算法,给出了武器装备使用需求映射适应度函数.最后,结合实例对方法及算法进行了可靠性验证. 相似文献
112.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
113.
We establish various inventory replenishment policies to solve the problem of determining the timing and number of replenishments. We then analytically compare various models, and identify the best alternative among them based on minimizing total relevant costs. Furthermore, we propose a simple and computationally efficient optimal method in a recursive fashion, and provide two examples for illustration. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 791–806, 1997 相似文献
114.
Yong-bao Ai Ting Rui Xiao-qiang Yang Jia-lin He Lei Fu Jian-bin Li Ming Lu 《防务技术》2021,17(5):1712-1721
A great number of visual simultaneous localization and mapping (VSLAM) systems need to assume static features in the environment. However, moving objects can vastly impair the performance of a VSLAM system which relies on the static-world assumption. To cope with this challenging topic, a real-time and robust VSLAM system based on ORB-SLAM2 for dynamic environments was proposed. To reduce the influence of dynamic content, we incorporate the deep-learning-based object detection method in the visual odometry, then the dynamic object probability model is added to raise the efficiency of object detection deep neural network and enhance the real-time performance of our system. Experiment with both on the TUM and KITTI benchmark dataset, as well as in a real-world environment, the results clarify that our method can significantly reduce the tracking error or drift, enhance the robustness, accuracy and stability of the VSLAM system in dynamic scenes. 相似文献
115.
The evaluation index of camouflage patterns is important in the field of military application. It is the goal that researchers have always pursued to make the computable evaluation indicators more in line with the human visual mechanism. In order to make the evaluation method more computationally intelligent, a Multi-Feature Camouflage Fused Index (MF-CFI) is proposed based on the comparison of grayscale, color and texture features between the target and the background. In order to verify the effectiveness of the proposed index, eye movement experiments are conducted to compare the proposed index with existing indexes including Universal Image Quality Index (UIQI), Camouflage Similarity Index (CSI) and Structural Similarity (SSIM). Twenty-four different simulated targets are designed in a grassland background, 28 observers participate in the experiment and record the eye movement data during the observation process. The results show that the highest Pearson correlation coefficient is observed between MF-CFI and the eye movement data, both in the designed digital camouflage patterns and large-spot camouflage patterns. Since MF-CFI is more in line with the detection law of camouflage targets in human visual perception, the proposed index can be used for the comparison and parameter optimization of camouflage design algorithms. 相似文献
116.
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 相似文献
117.
稳定性是作战指挥系统的核心,根据指挥系统稳定性的内涵及影响因素,运用概率论和信息熵方面的理论对指挥稳定性指标进行建模.分析了系统可用性、可信性和信息能力三个方面的影响指标,并建立了相应的评估模型.在模型分析基础上,提出了提高指挥系统稳定性的应对措施,为指挥员提高信息化条件下作战能力,保持指挥稳定性提供了理论参考依据,对提高作战指挥效能也具有很好的参考价值. 相似文献
118.
119.
次声波是一种频率变化范围在10?4 Hz～20 Hz之间的声波,它具有穿透力强、传输距离远以及不易被吸收的特点,以此制造的次声波武器伤人但不毁物。近年来,随着高新技术的不断发展,次声波武器在心理战领域得到了广泛应用。本文首先对次声波技术及次声波武器的概念进行了简要介绍;其次,研究了次声波的生物学效应,分析了次声波频率、声压强度以及作用时间与生物学效应的关系,发现三种次声波的作用参数与生物学效应之间的关系虽然错综复杂,但也有一定规律可循;最后,提出了次声波武器在心理战的三个潜在应用前景,即利用次声波穿透力强的特点发展对掩体人员作战的心理战装备、利用次声波的生物学效应发展反恐作战的心理战装备以及利用次声波的生理致伤机理发展心理战防护装备。 相似文献
120.