全文获取类型
| 收费全文 | 583篇 |
| 免费 | 1篇 |
专业分类
| 584篇 |
出版年
| 2021年 | 10篇 |
| 2019年 | 8篇 |
| 2018年 | 9篇 |
| 2017年 | 12篇 |
| 2016年 | 14篇 |
| 2015年 | 13篇 |
| 2014年 | 10篇 |
| 2013年 | 147篇 |
| 2010年 | 5篇 |
| 2008年 | 5篇 |
| 2007年 | 4篇 |
| 2006年 | 5篇 |
| 2005年 | 8篇 |
| 2003年 | 6篇 |
| 2002年 | 10篇 |
| 2001年 | 6篇 |
| 2000年 | 7篇 |
| 1999年 | 7篇 |
| 1998年 | 9篇 |
| 1997年 | 12篇 |
| 1996年 | 7篇 |
| 1995年 | 7篇 |
| 1994年 | 11篇 |
| 1993年 | 12篇 |
| 1992年 | 10篇 |
| 1991年 | 11篇 |
| 1990年 | 4篇 |
| 1989年 | 10篇 |
| 1988年 | 15篇 |
| 1987年 | 12篇 |
| 1986年 | 18篇 |
| 1985年 | 9篇 |
| 1984年 | 8篇 |
| 1983年 | 6篇 |
| 1982年 | 6篇 |
| 1981年 | 10篇 |
| 1980年 | 6篇 |
| 1979年 | 12篇 |
| 1978年 | 11篇 |
| 1977年 | 8篇 |
| 1976年 | 5篇 |
| 1975年 | 10篇 |
| 1974年 | 10篇 |
| 1973年 | 5篇 |
| 1972年 | 9篇 |
| 1971年 | 7篇 |
| 1970年 | 6篇 |
| 1969年 | 7篇 |
| 1968年 | 5篇 |
| 1966年 | 4篇 |
排序方式： 共有584条查询结果，搜索用时 0 毫秒
91.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
92.
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. 相似文献
93.
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 相似文献
94.
We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap. 相似文献
95.
Andrew S. Bowen 《战略研究杂志》2019,42(3-4):312-343
What were Russia’s objectives in Eastern Ukraine, and why was it seemingly unable to achieve a successful or decisive outcome? In contrast to Russia’s seizure of Crimea, the uprising in Eastern Ukraine was marked by disorganization and chaos. Using proxy and surrogate actors, along with military exercises and the injection of Russian troops, Russia sought to institutionalize a political entity inside Ukraine to influence its domestic politics. In this article, I analyze the mechanisms by which Russia attempted to implement, and later salvage, its strategy. The article contributes to clearer theoretical and practical understanding of limited force in coercive diplomacy, signaling, and a more rigorous treatment of the role and uses of proxy actors. 相似文献
96.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
97.
98.
John P. Cann 《Small Wars & Insurgencies》2013,24(1):196-225
In its colony of Angola, Portugal during its colonial wars (1961–1974) was able to exploit the economic dependence and divided population loyalties of its hostile neighbours the Congo and Zambia as well as the cleavages within the nationalist movements to prevent a crippling insurgency. The rulers of both countries were largely dependent on Angola for trade, and were eager to have the side effects of the robust Angolan economy with its 11% annual growth brush off on their own moribund ones. While relationships were never comfortable, the sponsors of revolution were forced to reign in their ‘freedom fighters’ in order to maintain the functioning of their export-dependent economies. Portuguese leadership also played a vital role, as it was able to bring together diverse elements of national power in a concerted policy for dealing with these enemies, whether they were insurgents or their sanctuary countries. This policy of leveraging national power and playing on the vulnerabilities of its opponents worked well during its war in Angola and still holds valuable lessons for countries that find themselves in similar circumstances. 相似文献
99.
John P. Cann 《Small Wars & Insurgencies》2013,24(3):500-516
On 4 January 1961 in Baixa do Cassange, in the north of Angola, the blacks who worked in the cotton fields began a strike. The army with air support was called to quell the rebellion, and the article emphasizes the importance of air support tethered to the ground forces, particularly in a remote and vast area of operations in the tropical rainy season. In this case, the support originally came in the form a squadron of Lockheed PV-2 Harpoons from Luanda, some 300 kilometers away. These open-ocean reconnaissance aircraft and their crews were ill-suited for the task. When this became apparent, four small Auster D5/160s were relocated from Negage to Malange, among the ground forces. The Austers flew reconnaissance missions over the troubled zones, dropped provisions and messages to the advancing ground forces, and served as a backup communications link. When the strike ceased after three weeks, the Austers assumed a humanitarian role in support of the starving population. The conclusion is that air support to ground forces is indispensable, must be properly tailored to the job, and must operate as an integral part of the ground forces. 相似文献
100.
John A. Nagl 《Small Wars & Insurgencies》2013,24(3):377-382
Etzioni both exaggerates and minimizes the influence of my book Learning to Eat Soup with a Knife on different components of US military doctrine, mischaracterizes my treatment of the Malayan Emergency, and unfairly denigrates the successes of counterinsurgency in Iraq from 2007 to 2011 while misattributing the reasons for its failures in both Iraq and Afghanistan. 相似文献