全文获取类型
| 收费全文 | 748篇 |
| 免费 | 1篇 |
专业分类
| 749篇 |
出版年
| 2021年 | 11篇 |
| 2019年 | 27篇 |
| 2018年 | 15篇 |
| 2017年 | 14篇 |
| 2016年 | 13篇 |
| 2015年 | 12篇 |
| 2014年 | 13篇 |
| 2013年 | 136篇 |
| 2009年 | 7篇 |
| 2008年 | 10篇 |
| 2007年 | 6篇 |
| 2006年 | 7篇 |
| 2005年 | 11篇 |
| 2004年 | 12篇 |
| 2003年 | 9篇 |
| 2002年 | 8篇 |
| 2001年 | 8篇 |
| 2000年 | 10篇 |
| 1998年 | 13篇 |
| 1997年 | 19篇 |
| 1996年 | 15篇 |
| 1995年 | 7篇 |
| 1994年 | 12篇 |
| 1992年 | 9篇 |
| 1991年 | 19篇 |
| 1990年 | 9篇 |
| 1989年 | 16篇 |
| 1988年 | 15篇 |
| 1987年 | 21篇 |
| 1986年 | 15篇 |
| 1985年 | 12篇 |
| 1984年 | 11篇 |
| 1983年 | 10篇 |
| 1982年 | 11篇 |
| 1981年 | 10篇 |
| 1980年 | 15篇 |
| 1979年 | 14篇 |
| 1978年 | 11篇 |
| 1977年 | 12篇 |
| 1976年 | 12篇 |
| 1975年 | 12篇 |
| 1974年 | 10篇 |
| 1973年 | 14篇 |
| 1972年 | 9篇 |
| 1971年 | 13篇 |
| 1970年 | 10篇 |
| 1969年 | 8篇 |
| 1968年 | 10篇 |
| 1967年 | 8篇 |
| 1966年 | 9篇 |
排序方式： 共有749条查询结果，搜索用时 0 毫秒
121.
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. 相似文献
122.
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 相似文献
123.
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 相似文献
124.
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
125.
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. 相似文献
126.
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 相似文献
127.
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. 相似文献
128.
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. 相似文献
129.
Colin D. Robinson 《Defense & Security Analysis》2019,35(2):211-221
To engage properly with the Somali National Army, to understand it in the hope of improving stability and the lives of over 12 million Somalis, good basic information on its composition and characteristics is necessary. Authoritative accounts on the subject have been scarce for over 25 years. This account seeks to detail the army’s dispositions across southern Somalia, and, more importantly, the brigades’ clan compositions and linkages. Clan ties supersede loyalties to the central government. The army as it stands is a collection of former militias which suffer from ill-discipline and commit crime along with greater atrocities. Estimates of numbers are unreliable, but there might be 13,000 or more fighters in six brigades in the Mogadishu area and five beyond. 相似文献
130.
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. 相似文献