全文获取类型
| 收费全文 | 696篇 |
| 免费 | 0篇 |
专业分类
| 696篇 |
出版年
| 2021年 | 8篇 |
| 2019年 | 15篇 |
| 2018年 | 10篇 |
| 2017年 | 15篇 |
| 2016年 | 12篇 |
| 2015年 | 13篇 |
| 2013年 | 133篇 |
| 2011年 | 6篇 |
| 2010年 | 8篇 |
| 2008年 | 6篇 |
| 2007年 | 9篇 |
| 2006年 | 9篇 |
| 2005年 | 15篇 |
| 2004年 | 10篇 |
| 2003年 | 8篇 |
| 2000年 | 11篇 |
| 1999年 | 8篇 |
| 1998年 | 5篇 |
| 1997年 | 9篇 |
| 1996年 | 16篇 |
| 1995年 | 9篇 |
| 1994年 | 15篇 |
| 1993年 | 8篇 |
| 1992年 | 10篇 |
| 1991年 | 18篇 |
| 1990年 | 10篇 |
| 1989年 | 17篇 |
| 1988年 | 11篇 |
| 1987年 | 15篇 |
| 1986年 | 16篇 |
| 1985年 | 14篇 |
| 1984年 | 10篇 |
| 1983年 | 10篇 |
| 1982年 | 14篇 |
| 1981年 | 9篇 |
| 1980年 | 14篇 |
| 1979年 | 9篇 |
| 1978年 | 10篇 |
| 1977年 | 10篇 |
| 1976年 | 10篇 |
| 1975年 | 9篇 |
| 1974年 | 15篇 |
| 1973年 | 13篇 |
| 1972年 | 14篇 |
| 1971年 | 19篇 |
| 1970年 | 6篇 |
| 1969年 | 10篇 |
| 1968年 | 7篇 |
| 1967年 | 5篇 |
| 1948年 | 5篇 |
排序方式： 共有696条查询结果，搜索用时 15 毫秒
101.
Using recent econometric techniques based on fractional integration, we find that developing countries recover their economic growth faster than developed countries in response to a shock. Following this methodology, we find that longer civil conflicts are associated with a faster recovery process. We further investigate this issue by exploring correlations with components of GDP, military spending, institutions and aid and find heterogeneous effects of these channels by duration of conflict. Higher government spending is correlated with faster recoveries post longer conflicts, and higher consumption spending is linked to faster recoveries following shorter conflicts. Military spending appears to be driving the government expenditure that makes countries recover from longer conflicts. More democratic institutions are associated with faster recoveries post short wars but slower recoveries following long wars. 相似文献
102.
Since declaring their nuclear weapons capabilities in 1998, India and Pakistan have engaged in three major crises that each threatened to escalate into war. In each crisis, the USA engaged in active diplomacy to dissuade the South Asian rivals from taking escalatory actions. Previous literature on the crises has described the American role, but has not theorized third-party involvement in a nuclearized regional rivalry. We apply Timothy Crawford’s pivotal deterrence theory to the nuclearized India–Pakistan conflict, and extend the original theory to cover the novel condition of a non-superpower nuclear dyad, in the context of a single-superpower international system. We find that America’s pivotal deterrence generally enhanced stability in the India–Pakistan crises, and unlike in pre-nuclear South Asia, other great powers supported American diplomacy. However, we suggest that future regional crises between nuclear rivals, in South Asia or elsewhere, may present greater challenges for pivotal deterrence. 相似文献
103.
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
104.
We examine two key stochastic processes of interest for warranty modeling: (1) remaining total warranty coverage time exposure and (2) warranty load (total items under warranty at time t). Integral equations suitable for numerical computation are developed to yield probability law for these warranty measures. These two warranty measures permit warranty managers to better understand time‐dependent warranty behavior, and thus better manage warranty cash reserves. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
105.
Vendor‐managed revenue‐sharing arrangements are common in the newspaper and other industries. Under such arrangements, the supplier decides on the level of inventory while the retailer effectively operates under consignment, sharing the sales revenue with his supplier. We consider the case where the supplier is unable to predict demand, and must base her decisions on the retailer‐supplied probabilistic forecast for demand. We show that the retailer's best choice of a distribution to report to his supplier will not be the true demand distribution, but instead will be a degenerate distribution that surprisingly induces the supplier to provide the system‐optimal inventory quantity. (To maintain credibility, the retailer's reports of daily sales must then be consistent with his supplied forecast.) This result is robust under nonlinear production costs and nonlinear revenue‐sharing. However, if the retailer does not know the supplier's production cost, the forecast “improves” and could even be truthful. That, however, causes the supplier's order quantity to be suboptimal for the overall system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
106.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
107.
The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C2, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C2 model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
108.
Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponential distribution along with an exact lower confidence bound. Childs et al. [Exact likelihood inference based on Type‐I and Type‐II hybrid censored samples from the exponential distribution, Ann Inst Statist Math 55 (2003), 319–330] recently derived an alternative simpler expression for the distribution of the MLE. These authors also proposed a new hybrid censoring scheme and derived similar results for the exponential model. In this paper, we propose two generalized hybrid censoring schemes which have some advantages over the hybrid censoring schemes already discussed in the literature. We then derive the exact distribution of the maximum likelihood estimator as well as exact confidence intervals for the mean of the exponential distribution under these generalized hybrid censoring schemes. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
109.
Products with short life cycles are becoming increasingly common in many industries, such as the personal computer (PC) and mobile phone industries. Traditional forecasting methods and inventory policies can be inappropriate for forecasting demand and managing inventory for a product with a short life cycle because they usually do not take into account the characteristics of the product life cycle. This can result in inaccurate forecasts, high inventory cost, and low service levels. Besides, many forecasting methods require a significant demand history, which is available only after the product has been sold for some time. In this paper, we present an adaptive forecasting algorithm with two characteristics. First, it uses structural knowledge on the product life cycle to model the demand. Second, it combines knowledge on the demand that is available prior to the launch of the product with actual demand data that become available after the introduction of the product to generate and update demand forecasts. Based on the forecasting algorithm, we develop an optimal inventory policy. Since the optimal inventory policy is computationally expensive, we propose three heuristics and show in a numerical study that one of the heuristics generates near‐optimal solutions. The evaluation of our approach is based on demand data from a leading PC manufacturer in the United States, where the forecasting algorithm has been implemented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
110.
We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献