全文获取类型
| 收费全文 | 374篇 |
| 免费 | 0篇 |
专业分类
| 374篇 |
出版年
| 2021年 | 6篇 |
| 2019年 | 7篇 |
| 2018年 | 4篇 |
| 2017年 | 3篇 |
| 2016年 | 7篇 |
| 2015年 | 2篇 |
| 2014年 | 5篇 |
| 2013年 | 55篇 |
| 2012年 | 3篇 |
| 2009年 | 4篇 |
| 2007年 | 12篇 |
| 2005年 | 2篇 |
| 2004年 | 3篇 |
| 2003年 | 7篇 |
| 2002年 | 6篇 |
| 2001年 | 2篇 |
| 2000年 | 3篇 |
| 1999年 | 3篇 |
| 1998年 | 7篇 |
| 1997年 | 8篇 |
| 1996年 | 9篇 |
| 1995年 | 3篇 |
| 1994年 | 6篇 |
| 1993年 | 10篇 |
| 1992年 | 7篇 |
| 1991年 | 9篇 |
| 1990年 | 10篇 |
| 1989年 | 17篇 |
| 1988年 | 14篇 |
| 1987年 | 7篇 |
| 1986年 | 13篇 |
| 1985年 | 7篇 |
| 1984年 | 4篇 |
| 1983年 | 3篇 |
| 1982年 | 10篇 |
| 1981年 | 6篇 |
| 1980年 | 7篇 |
| 1979年 | 9篇 |
| 1978年 | 8篇 |
| 1977年 | 5篇 |
| 1976年 | 5篇 |
| 1975年 | 4篇 |
| 1974年 | 8篇 |
| 1973年 | 5篇 |
| 1972年 | 3篇 |
| 1971年 | 7篇 |
| 1970年 | 6篇 |
| 1969年 | 5篇 |
| 1967年 | 6篇 |
| 1948年 | 4篇 |
排序方式： 共有374条查询结果，搜索用时 15 毫秒
281.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc. 相似文献
282.
A change order is frequently initiated by either the supplier or the buyer, especially when the contract is long‐term or when the contractual design is complex. In response to a change order, the buyer can enter a bargaining process to negotiate a new price. If the bargaining fails, she pays a cancellation fee (or penalty) and opens an auction. We call this process the sequential bargaining‐auction (BA). At the time of bargaining, the buyer is uncertain as to whether the bargained price is set to her advantage; indeed, she might, or might not, obtain a better price in the new auction. To overcome these difficulties, we propose a new change‐order‐handling mechanism by which the buyer has an option to change the contractual supplier after bargaining ends with a bargained price. We call this the option mechanism. By this mechanism, the privilege of selling products or services is transferred to a new supplier if the buyer exercises the option. To exercise the option, the buyer pays a prespecified cash payment, which we call the switch price, to the original supplier. If the option is not exercised, the bargained price remains in effect. When a switch price is proposed by the buyer, the supplier decides whether or not to accept it. If the supplier accepts it, the buyer opens an auction. The option is exercised when there is a winner in the auction. This article shows how, under the option mechanism, the optimal switch price and the optimal reserve price are determined. Compared to the sequential BA, both the buyer and the supplier benefit. Additionally, the option mechanism coordinates the supply chain consisting of the two parties. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 248–265, 2015 相似文献
283.
Lauren R. Heller Robert A. Lawson Ryan H. Murphy Claudia R. Williamson 《Defence and Peace Economics》2018,29(4):355-382
Economic freedom has increased living standards worldwide. Concurrent with such gains are rising concerns about potential human costs associated with free markets. This paper uses data on human trafficking and anti-trafficking policies, in conjunction with a measure of economic freedom, to examine whether free markets exacerbate or attenuate the incidence of human trafficking and policies designed to combat it. We do not find evidence suggesting that economic freedom is associated with human trafficking. In addition, our results suggest that economically free countries are more likely to enact and enforce policies to fight human trafficking. 相似文献
284.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
285.
There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios. 相似文献
286.
Two new randomization tests are introduced for ordinal contingency tables for testing independence against strictly positive quadrant dependence, i.e., P(X > x,Y > y) ≥ P(X > x)P(Y > y) for all x,y with strict inequality for some x and y. For a number of cases, simulation is used to compare the estimated power of these tests versus those standard tests based on Kendall's T, Spearman's p, Pearson's X2, the usual likelihood ratio test, and a test based upon the log-odds ratio. In these cases, subsets of the alternative region are identified where each of the testing statistics is superior. The new tests are found to be more powerful than the standard tests over a broad range of the alternative regions for these cases. 相似文献
287.
288.
The Signal‐to‐Interference‐plus‐Noise Ratio (SINR) is an important metric of wireless communication link quality. SINR estimates have several important applications. These include optimizing the transmit power level for a target quality of service, assisting with handoff decisions and dynamically adapting the data rate for wireless Internet applications. Accurate SINR estimation provides for both a more efficient system and a higher user‐perceived quality of service. In this paper, we develop new SINR estimators and compare their mean squared error (MSE) performance. We show that our new estimators dominate estimators that have previously appeared in the literature with respect to MSE. The sequence of transmitted bits in wireless communication systems consists of both pilot bits (which are known both to the transmitter and receiver) and user bits (which are known only by the transmitter). The SINR estimators we consider alternatively depend exclusively on pilot bits, exclusively on user bits, or simultaneously use both pilot and user bits. In addition, we consider estimators that utilize smoothing and feedback mechanisms. Smoothed estimators are motivated by the fact that the interference component of the SINR changes relatively slowly with time, typically with the addition or departure of a user to the system. Feedback estimators are motivated by the fact that receivers typically decode bits correctly with a very high probability, and therefore user bits can be thought of as quasipilot bits. For each estimator discussed, we derive an exact or approximate formula for its MSE. Satterthwaite approximations, noncentral F distributions (singly and doubly) and distribution theory of quadratic forms are the key statistical tools used in developing the MSE formulas. In the case of approximate MSE formulas, we validate their accuracy using simulation techniques. The approximate MSE formulas, of interest in their own right for comparing the quality of the estimators, are also used for optimally combining estimators. In particular, we derive optimal weights for linearly combining an estimator based on pilot bits with an estimator based on user bits. The optimal weights depend on the MSE of the two estimators being combined, and thus the accurate approximate MSE formulas can conveniently be used. The optimal weights also depend on the unknown SINR, and therefore need to be estimated in order to construct a useable combined estimator. The impact on the MSE of the combined estimator due to estimating the weights is examined. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
289.
290.