全文获取类型
收费全文 | 794篇 |
免费 | 12篇 |
出版年
2021年 | 14篇 |
2019年 | 11篇 |
2017年 | 18篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 16篇 |
2013年 | 120篇 |
2012年 | 23篇 |
2011年 | 28篇 |
2010年 | 23篇 |
2009年 | 14篇 |
2008年 | 31篇 |
2007年 | 17篇 |
2006年 | 19篇 |
2005年 | 9篇 |
2002年 | 8篇 |
2001年 | 9篇 |
1999年 | 5篇 |
1998年 | 13篇 |
1997年 | 14篇 |
1996年 | 6篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 16篇 |
1986年 | 23篇 |
1985年 | 16篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 14篇 |
1980年 | 12篇 |
1979年 | 20篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 18篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 14篇 |
1968年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有806条查询结果,搜索用时 15 毫秒
211.
We consider the parallel replacement problem in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance costs motivate replacements, and the fixed replacement cost provides incentive for replacing machines of different ages together in “clusters.” We prove two intuitive results for this problem. First, it is never optimal to split a cluster of like-aged machines, and second, it is never optimal to replace newer clusters before older clusters. By incorporating these two results into an algorithmic approach, we vastly reduce the amount of computation required to identify an optimal replacement policy. 相似文献
212.
A system is subject to shocks that arrive according to a nonhomogeneous Poisson process. As shocks occur a system has two types of failures. Type 1 failure (minor failure) is removed by a minimal repair, whereas type 2 failure (catastrophic failure) is removed by replacement. The probability of a type 2 failure is permitted to depend on the number of shocks since the last replacement. A system is replaced at the times of type 2 failure or at the nth type 1 failure, whichever comes first. The optimal policy is to select n* to minimize the expected cost per unit time for an infinite time span. A numerical example is given to illustrate the method. © 1996 John Wiley & Sons, Inc. 相似文献
213.
We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc. 相似文献
214.
215.
This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based on the distorted information received, the second player then maximizes some given objective. In certain cases he may still be able to use the distorted information, but sometimes the information has been so badly distorted that it becomes completely useless to him. © 1993 John Wiley & Sons, Inc. 相似文献
216.
Michael S. Curl 《Arms and Armour》2019,16(1):27-55
Despite the lance’s status and the amount of attention the couched lance has received in historiography, study of its martial art has been neglected. The various lance types and techniques used by western European cavalry have only recently begun to receive scholarly attention. Additionally, Medieval European lance use has too often been studied in isolation, without an adequate understanding of the idiosyncratic and asymmetrical dynamics of mounted combat. Although the charge with the couched lance was a valid tactic, it was only one of many. Light and heavy lances were used in one hand or two to trip, block, unhorse, and wrestle. These techniques were governed by the harsh laws of distance, speed, impact, iron, and asymmetry. By utilizing the surviving Fechtbücher and several Peninsular and Near Eastern sources, a brief foray into the diverse techniques of lance use and their purposes has been attempted here. 相似文献
217.
Gregory S. Jones 《The Nonproliferation Review》2019,26(1-2):61-81
The claim that reactor-grade plutonium cannot or will not be used to produce nuclear weapons has been used to justify non-nuclear-weapon states’ large stockpiles of plutonium that has been separated from highly radioactive spent fuel. However, by using reduced-mass plutonium cores, it is possible to manufacture reliable nuclear weapons with reactor-grade plutonium. These weapons can have the same design, size, weight, and predetonation probability as weapons using weapon-grade plutonium and would require no special cooling. The increased radiation from reactor-grade plutonium could be easily managed by shielding and operational procedures. Weapons using plutonium routinely produced by pressurized-water reactors could have a lethal area between 40 percent and 75 percent that of weapons using weapon-grade plutonium. In the past, both Sweden and Pakistan considered using reactor-grade plutonium to produce nuclear weapons, and India may be using reactor-grade plutonium in its arsenal today. Despite claims to the contrary, the United States used what was truly reactor-grade plutonium in a successful nuclear test in 1962. The capability of reactor-grade plutonium to produce highly destructive nuclear weapons leads to the conclusion that the separation of plutonium, plutonium stockpiling, and the use of plutonium-based fuels must be phased out and banned. 相似文献
218.
The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets. There are important cases, however, in which negotiations of these agreements are impeded because states are reluctant to provide any such data, because of concerns about prematurely handing over militarily significant information. To address this challenge, we present a cryptographic escrow that allows a state to make a complete declaration of sites and assets at the outset and commit to its content, but only reveal the sensitive information therein sequentially. Combined with an inspection regime, our escrow allows for step-by-step verification of the correctness and completeness of the initial declaration so that the information release and inspections keep pace with parallel diplomatic and political processes. We apply this approach to the possible denuclearization of North Korea. Such approach can be applied, however, to any agreement requiring the sharing of sensitive information. 相似文献
219.
In financial engineering, sensitivities of derivative prices (also known as the Greeks) are important quantities in risk management, and stochastic gradient estimation methods are used to estimate them given the market parameters. In practice, the surface (function) of the Greeks with respect to the underlying parameters is much more desired, because it can be used in real‐time risk management. In this paper, we consider derivatives with multiple underlying assets, and propose three stochastic kriging‐based methods, the element‐by‐element, the importance mapping, and the Cholesky decomposition, to fit the surface of the gamma matrix that can fulfill the time constraint and the precision requirement in real‐time risk management. Numerical experiments are provided to illustrate the effectiveness of the proposed methods. 相似文献
220.