全文获取类型
| 收费全文 | 836篇 |
| 免费 | 1篇 |
专业分类
| 837篇 |
出版年
| 2021年 | 18篇 |
| 2019年 | 28篇 |
| 2018年 | 12篇 |
| 2017年 | 18篇 |
| 2016年 | 17篇 |
| 2015年 | 21篇 |
| 2014年 | 16篇 |
| 2013年 | 157篇 |
| 2008年 | 9篇 |
| 2007年 | 9篇 |
| 2006年 | 9篇 |
| 2005年 | 11篇 |
| 2004年 | 9篇 |
| 2003年 | 8篇 |
| 2002年 | 11篇 |
| 2001年 | 10篇 |
| 2000年 | 9篇 |
| 1999年 | 8篇 |
| 1998年 | 16篇 |
| 1997年 | 21篇 |
| 1996年 | 12篇 |
| 1995年 | 9篇 |
| 1994年 | 16篇 |
| 1993年 | 9篇 |
| 1992年 | 11篇 |
| 1991年 | 20篇 |
| 1989年 | 14篇 |
| 1988年 | 20篇 |
| 1987年 | 19篇 |
| 1986年 | 23篇 |
| 1985年 | 15篇 |
| 1984年 | 11篇 |
| 1983年 | 12篇 |
| 1982年 | 12篇 |
| 1981年 | 11篇 |
| 1980年 | 12篇 |
| 1979年 | 21篇 |
| 1978年 | 14篇 |
| 1977年 | 15篇 |
| 1976年 | 8篇 |
| 1975年 | 15篇 |
| 1974年 | 13篇 |
| 1973年 | 15篇 |
| 1972年 | 13篇 |
| 1971年 | 9篇 |
| 1970年 | 10篇 |
| 1969年 | 11篇 |
| 1968年 | 7篇 |
| 1967年 | 7篇 |
| 1966年 | 6篇 |
排序方式： 共有837条查询结果，搜索用时 15 毫秒
141.
We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
142.
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 相似文献
143.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
144.
Adam D.M. Svendsen 《Defense & Security Analysis》2015,31(1):58-73
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain. 相似文献
145.
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 相似文献
146.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
147.
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. 相似文献
148.
In order to examine the possibility to improve its camouflage properties standard cotton fabric with camouflage print was impregnated with poly(vinyl butyral), PVB and fullerene-like nanoparticles of tungsten disulfide, PVB/IF-WS2. FTIR analysis excluded any possible chemical interaction of IF-WS2 with PVB and the fabric. The camouflage behavior of the impregnated fabric has been examined firstly in the VIS part of the spectrum. Diffuse reflection, specular gloss and color coordinates were measured for three different shades (black, brown and dark green). Thermal imaging was applied to examine the camouflage abilities of this impregnation in IR part of the spectrum. The obtained results show that PVB/IF-WS2 impregnation system induced enhacement of the materials camouflage properties, i.e. that IF-WS2 have a positive effect on spectrophotometric characteristics of the fabric. 相似文献
149.
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. 相似文献
150.
Dmitrii Usanov G.A. Guido Legemaate Peter M. van de Ven Rob D. van der Mei 《海军后勤学研究》2019,66(2):105-122
The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance. 相似文献