全文获取类型
收费全文 | 533篇 |
免费 | 123篇 |
国内免费 | 67篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 34篇 |
2016年 | 36篇 |
2015年 | 30篇 |
2014年 | 34篇 |
2013年 | 81篇 |
2012年 | 38篇 |
2011年 | 37篇 |
2010年 | 30篇 |
2009年 | 47篇 |
2008年 | 40篇 |
2007年 | 48篇 |
2006年 | 51篇 |
2005年 | 40篇 |
2004年 | 36篇 |
2003年 | 22篇 |
2002年 | 18篇 |
2001年 | 18篇 |
2000年 | 14篇 |
1999年 | 6篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 1篇 |
排序方式: 共有723条查询结果,搜索用时 15 毫秒
81.
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. 相似文献
82.
83.
84.
85.
86.
基于声发射原理的阀门内漏检测作为一种动态无损检测方法得到了广泛应用,但是定量检测一直是研究难点。现有的内漏率定量检测模型计算方法因参数不易测定,导致计算困难,精度不高。采用独立分量分析(ICA)方法提取声发射信号特征向量,并与参考样本集的特征向量相比较,相似程度最高的即可作为待测阀门的内漏率。内漏模拟实验分别将常规参数、频谱成分和ICA提取特征作为特征向量进行比较,结果表明ICA提取的特征向量维数为15时,均方根误差可以达到0.01 L/min,能够满足工程检测需要。 相似文献
87.
88.
89.
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 相似文献
90.
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 相似文献