全文获取类型
收费全文 | 533篇 |
免费 | 156篇 |
国内免费 | 17篇 |
出版年
2024年 | 3篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 15篇 |
2020年 | 9篇 |
2019年 | 22篇 |
2018年 | 15篇 |
2017年 | 32篇 |
2016年 | 28篇 |
2015年 | 26篇 |
2014年 | 43篇 |
2013年 | 78篇 |
2012年 | 34篇 |
2011年 | 33篇 |
2010年 | 35篇 |
2009年 | 38篇 |
2008年 | 36篇 |
2007年 | 53篇 |
2006年 | 42篇 |
2005年 | 26篇 |
2004年 | 26篇 |
2003年 | 18篇 |
2002年 | 19篇 |
2001年 | 15篇 |
2000年 | 21篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有706条查询结果,搜索用时 217 毫秒
41.
受限空间可燃气体爆炸抑爆实验系统研究 总被引:8,自引:2,他引:6
针对狭长受限空间可燃气体爆炸抑制模拟实验研究的需要,采用超细冷气溶胶抑爆技术设计了一套操作方便、组装灵活、结构合理的复合式气体爆炸抑制系统.完成气体爆炸和抑爆实验.实验表明该抑爆实验系统能满足受限空间不同工况气体爆炸抑爆实验研究的需要;同时也表明可燃气体浓度、抑爆剂性能、信号采集及控制系统响应速度等是影响抑爆效果的主要因素.文中的研究为进一步研制抑爆装置奠定了实验和理论基础. 相似文献
42.
Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems 下载免费PDF全文
Honggang Wang 《海军后勤学研究》2017,64(4):305-322
Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017 相似文献
43.
Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017 相似文献
44.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
45.
46.
飞网构型设计对提高空间飞网系统的展开抓捕性能具有重要意义。用小弹性模量分析方法对空间飞网构型优化设计问题进行研究。以绳网中内力分布均衡性为优化目标,选取飞网抛射过程中最大受力时刻为研究工况,赋予绳索单元极小弹性模量,进行静力学计算,并以变形后的结果为初始条件进行迭代分析。优化结果表明,绳网中的内力分布随迭代步数的增加而更趋于均匀。在不改变绳网拓扑结构的前提下,所建立的优化设计方法为空间飞网构型优化设计提供了一种参考途径。 相似文献
47.
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 相似文献
48.
Model parameter estimation and residual life prediction for a partially observable failing system 下载免费PDF全文
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 相似文献
49.
李剑锋 《中国人民武装警察部队学院学报》2014,30(12):23-26
归纳总结了受限空间人员被困事故的特点,分析了此类事故救援过程中需要的器材装备,论述了受限空间人员被困事故的救援技术,并针对此类事故救援、训练、研究提出了建议。 相似文献
50.