全文获取类型
收费全文 | 1474篇 |
免费 | 359篇 |
国内免费 | 120篇 |
出版年
2024年 | 4篇 |
2023年 | 6篇 |
2022年 | 22篇 |
2021年 | 29篇 |
2020年 | 24篇 |
2019年 | 23篇 |
2018年 | 25篇 |
2017年 | 64篇 |
2016年 | 85篇 |
2015年 | 62篇 |
2014年 | 99篇 |
2013年 | 147篇 |
2012年 | 99篇 |
2011年 | 114篇 |
2010年 | 114篇 |
2009年 | 128篇 |
2008年 | 95篇 |
2007年 | 115篇 |
2006年 | 120篇 |
2005年 | 96篇 |
2004年 | 87篇 |
2003年 | 57篇 |
2002年 | 45篇 |
2001年 | 39篇 |
2000年 | 53篇 |
1999年 | 29篇 |
1998年 | 23篇 |
1997年 | 25篇 |
1996年 | 25篇 |
1995年 | 16篇 |
1994年 | 16篇 |
1993年 | 15篇 |
1992年 | 19篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 5篇 |
1988年 | 3篇 |
排序方式: 共有1953条查询结果,搜索用时 15 毫秒
211.
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 相似文献
212.
Model parameter estimation and residual life prediction for a partially observable failing system
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015 相似文献
213.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
214.
215.
为研究水下制氢反应室的动态过程规律,基于化学反应动力学和单液滴运动学得到合金/水反应转化率,并在最小自由能法计算得到生成物各组分摩尔数的基础上利用质量守恒方程得到室内各物质质量变化规律。在建立非线性移动边界螺旋管动态模型的前提下,利用能量守恒方程得到室内热力参数变化规律,进而完成制氢反应室动态过程详尽模型的建立。利用该模型编写计算程序,完成某水下制氢反应室动态过程仿真。结果表明,各仿真曲线较好地反映了对应参数的动态变化规律,验证了模型建立与仿真的正确性;合金/水反应转化率决定了反应室的物质质量变化规律及其能量释放特性。该模型可以作为制氢反应室动态特性分析及其过程控制研究的基础模型。 相似文献
216.
217.
刘有霞 《中国人民武装警察部队学院学报》2014,(5):94-96
分析新时期加强消防部队财务保障的重要意义和当前财务保障工作存在的主要问题,提出了树立大局意识、加强财务预算管理保障建设、加强财务分析保障建设、加强财务监督保障建设、加强财务人才队伍建设等对策。 相似文献
218.
219.
韩化冰 《中国人民武装警察部队学院学报》2014,(9):73-76
编写教学材料是专业英语教学的重要环节之一,不仅可以对专业英语教材进行必要的弥补和及时的更新,而且对完善教学大纲起着积极的作用.特别是在我国学科专业众多、专业英语教材相对匮乏等客观条件下,专业英语教学材料的编写尤为重要.基于需求分析和ESP教学理念,探讨专业英语教学材料编写的必要性,教学材料的选取过程及应把握的原则。 相似文献
220.