全文获取类型
收费全文 | 320篇 |
免费 | 104篇 |
国内免费 | 32篇 |
出版年
2024年 | 4篇 |
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 9篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 20篇 |
2016年 | 31篇 |
2015年 | 18篇 |
2014年 | 27篇 |
2013年 | 29篇 |
2012年 | 30篇 |
2011年 | 35篇 |
2010年 | 17篇 |
2009年 | 28篇 |
2008年 | 20篇 |
2007年 | 25篇 |
2006年 | 22篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 10篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 17篇 |
1999年 | 7篇 |
1998年 | 14篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有456条查询结果,搜索用时 15 毫秒
61.
62.
63.
装备器材库温湿度监控系统的设计与实现 总被引:3,自引:0,他引:3
军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计. 相似文献
64.
Kurt M. Bretthauer 《海军后勤学研究》2000,47(1):1-17
In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000 相似文献
65.
提出了一种基于小波分析和神经网络技术检测发动机气缸气密性能的新方法。对电涡流位移传感器拾取的飞轮位移信号直接进行时域采样 ,通过处理和小波分析 ,获得反映发动机启动瞬时转速尺度参数 ,BP神经网络以此作为输入向量 ,从而有效地检测发动机气缸气密性能。 相似文献
66.
磁悬挂平天的位置传感器具有一定的特殊性,它需要同时获取被悬挂的飞行器模型的多自由度位置分量。本文对这一问题进行了研究,并讨论了其工程实现问题。 相似文献
67.
关于磁传感器设计中的技术问题 总被引:1,自引:0,他引:1
目前,通常使用的CCY-1G型测磁仪已初步采用了模块化和计算机技术.在此基础上,立足于现有的技术水平,研究了利用计算机处理数据的强大功能分析设计磁传感器的特性(如激励电压的大小、频率;铁芯参数、形状等),缩短了磁传感器的设计时间.同时,对不同激励波形(正弦波、方波、三角波)下磁传感器的输出进行分析比较,得出方波是目前较理想的激励波形的结论,对今后磁传感器的分析与设计有一定的指导意义. 相似文献
68.
基于神经网络和功率谱的水中目标信号检测方法 总被引:2,自引:0,他引:2
将功率谱和神经网络相结合,应用于高海况、低信噪比条件下,水中目标信号的特征提取中.文中首先对信号进行功率谱估计,利用目标信号功率主要集中在低频部分的特点,提取低频信号的能量作为特征,然后利用人工神经网络对目标信号进行检测.利用不同浪级情况下海洋水压场的仿真信号数据,对某型目标舰船的水压信号进行了检测计算,验证了该方法的有效性,尤其是达到了在高海况、低信噪比条件下,对目标信号检测率比较高、虚警率比较低的效果. 相似文献
69.
In this paper we propose some non‐greedy heuristics and develop an Augmented‐Neural‐Network (AugNN) formulation for solving the classical open‐shop scheduling problem (OSSP). AugNN is a neural network based meta‐heuristic approach that allows integration of domain‐specific knowledge. The OSSP is framed as a neural network with multiple layers of jobs and machines. Input, output and activation functions are designed to enforce the problem constraints and embed known heuristics to generate a good feasible solution fast. Suitable learning strategies are applied to obtain better neighborhood solutions iteratively. The new heuristics and the AugNN formulation are tested on several benchmark problem instances in the literature and on some new problem instances generated in this study. The results are very competitive with other meta‐heuristic approaches, both in terms of solution quality and computational times. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
70.
Sunkyo Kim 《海军后勤学研究》2005,52(5):399-408
In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献