全文获取类型
收费全文 | 131篇 |
免费 | 74篇 |
国内免费 | 18篇 |
专业分类
223篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 12篇 |
2016年 | 14篇 |
2015年 | 12篇 |
2014年 | 11篇 |
2013年 | 8篇 |
2012年 | 7篇 |
2011年 | 11篇 |
2010年 | 8篇 |
2009年 | 15篇 |
2008年 | 13篇 |
2007年 | 13篇 |
2006年 | 21篇 |
2005年 | 10篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 2篇 |
2001年 | 8篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
排序方式: 共有223条查询结果,搜索用时 15 毫秒
1.
2.
舰船电力推进是一个复杂的船—机—电系统。对其动态特性的研究,利用现有的基于理论分析建立机理模型的方法,就会遇到分析过程繁杂、模型适用性差的实际困难。本文则利用系统辨识方法建立舰船电力推进系统的动态模型,通过一个具体的船模实验及辨识计算,确定模型的结构和参数。为了克服相关噪声的影响,参数估计中采用了增广矩阵法。并对模型从拟合程度和收敛性两方面进行了检验,结果表明,上述方法所得到的动态模型是适用的。 相似文献
3.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
4.
为了解决雷达系统面临的4大威胁,多站无源联合定位系统被广泛采用。航迹起始是多站无源联合定位系统对目标进行跟踪的首要问题。分析了多站无源联合定位系统的航迹起始问题的特点,在有源定位系统航迹起始的逻辑法基础上,利用辐射源参数构造多维相关波门进行关联判定,并采用基于最小二乘法的直线拟合方法对航迹作平滑处理,提出了一种针对多站无源联合定位系统的航迹起始方法。仿真实验结果表明了该算法的有效性。 相似文献
5.
针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。 相似文献
6.
介绍了设备状态集中监测系统的构建和灰色系统理论在设备状态预测中的应用原理及方法.利用Matlab提供的基于最小二乘法的非线性曲线拟合函数能方便地求解一阶灰微分方程,从而得到原始数列的预测值表达式.应用实例表明,基于灰色系统理论的预测模型适用于小样本不确定问题的研究,预测精度高、实现容易.基于灰色系统理论的设备状态监测系统的研制对于科学制定维修计划,改进设备的管理维护手段,确保试验任务的质量和进度具有重要作用. 相似文献
7.
分析了在计算机控制下的喷油量调控原理,阐述了基本喷油量、校正喷油量、开环控制喷油量和最终闭环喷油量的数学模型. 相似文献
8.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
9.
10.