全文获取类型
收费全文 | 472篇 |
免费 | 78篇 |
国内免费 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 19篇 |
2016年 | 26篇 |
2015年 | 18篇 |
2014年 | 37篇 |
2013年 | 82篇 |
2012年 | 31篇 |
2011年 | 37篇 |
2010年 | 34篇 |
2009年 | 34篇 |
2008年 | 32篇 |
2007年 | 42篇 |
2006年 | 27篇 |
2005年 | 19篇 |
2004年 | 22篇 |
2003年 | 17篇 |
2002年 | 16篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 6篇 |
1998年 | 1篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
排序方式: 共有564条查询结果,搜索用时 28 毫秒
21.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
22.
23.
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 相似文献
24.
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 相似文献
25.
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. 相似文献
26.
27.
The article focuses on the interface between ethnicity and national security in Nigeria. It critically explores the negative mobilization of ethnicity in Nigeria's fourth republic, and how this has been shaping (and reshaping) the democratization process, particularly in the management of cooperation and conflict over contestations for power and other resources. The re-democratization of Nigeria in 1999 has been preceded with high expectations of meaningful reductions in the high level of insecurity witnessed under the long years of military suzerainty. However, this has not been the case. Rather, what is obtained is an increase in national insecurity on a much larger scale. This article argues that one of the banes of national security in the Nigerian state is ethnic politics, which continues to witness changes in context and character with grave consequences for the future of democracy. The central argument is that ethnicity has always been a major driver of politics and conflicts in Nigeria and the trend is not likely to change anytime soon. 相似文献
28.
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 相似文献
29.
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 相似文献
30.
从目前我国指挥控制系统中地理信息使用存在的问题出发,结合指挥信息系统的实际工作需要和现代战争作战趋势与发展方向,应用服务化与网络化系统技术理念,提出了基于SOA的地理信息服务的软件架构,使部队现有的应用系统之间的地理信息协同与共享,为部队作战任务和决策提供地理信息的有力支撑,并给出了具体的软件模块设计。 相似文献