全文获取类型
收费全文 | 270篇 |
免费 | 80篇 |
国内免费 | 22篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 3篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 15篇 |
2013年 | 12篇 |
2012年 | 28篇 |
2011年 | 37篇 |
2010年 | 10篇 |
2009年 | 26篇 |
2008年 | 17篇 |
2007年 | 16篇 |
2006年 | 22篇 |
2005年 | 24篇 |
2004年 | 18篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 5篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
排序方式: 共有372条查询结果,搜索用时 187 毫秒
11.
飞网构型设计对提高空间飞网系统的展开抓捕性能具有重要意义。用小弹性模量分析方法对空间飞网构型优化设计问题进行研究。以绳网中内力分布均衡性为优化目标,选取飞网抛射过程中最大受力时刻为研究工况,赋予绳索单元极小弹性模量,进行静力学计算,并以变形后的结果为初始条件进行迭代分析。优化结果表明,绳网中的内力分布随迭代步数的增加而更趋于均匀。在不改变绳网拓扑结构的前提下,所建立的优化设计方法为空间飞网构型优化设计提供了一种参考途径。 相似文献
12.
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 相似文献
13.
基于GSPN的舰载服务器系统可靠性建模及分析 总被引:1,自引:0,他引:1
提出一种基于广义随机Petri网(Generalized Stochastic Petri Net,GSPN)的舰载服务器系统可靠性分析方法。深入分析舰载服务器系统故障模式的基础上,建立冗余服务器子系统的GSPN模型和共享数据盘子系统的GSPN模型,进而综合得到舰载服务器系统的全局GSPN模型,有效模拟了舰载服务器系统的动态行为。仿真实验验证了所提方法的有效性,为舰载服务器系统的分析与设计提供理论参考。 相似文献
14.
Mahdi Tavangar 《海军后勤学研究》2014,61(7):549-556
Most of the research, on the study of the reliability properties of technical systems, assume that the components of the system operate independently. However, in real life situation, it is more reasonable to assume that there is dependency among the components of the system. In this article, we give sufficient conditions based on the signature and the joint distribution of component lifetimes to obtain stochastic ordering results for coherent and mixed systems with exchangeable components. Some stochastic orders on dynamic (or conditional) signature of coherent systems are also provided. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 549–556, 2014 相似文献
15.
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 相似文献
16.
研究一类具有两种随机扰动的SISV传染病模型.对于第一种随机SISV模型,证明对任给的非负初值,该随机模型一定存在唯一的全局正解,并讨论该随机模型的解围绕确定性模型的无病平衡点的渐近行为;对于第二种随机SISV模型,通过构造适当的Lyapunov泛函证明该随机模型的解是随机渐近稳定的. 相似文献
17.
抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性. 相似文献
18.
19.
20.
We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ1, κ2 are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature. 相似文献