全文获取类型
| 收费全文 | 1003篇 |
| 免费 | 0篇 |
专业分类
| 1003篇 |
出版年
| 2021年 | 16篇 |
| 2019年 | 31篇 |
| 2018年 | 14篇 |
| 2017年 | 26篇 |
| 2016年 | 21篇 |
| 2015年 | 24篇 |
| 2014年 | 23篇 |
| 2013年 | 197篇 |
| 2011年 | 8篇 |
| 2010年 | 9篇 |
| 2009年 | 14篇 |
| 2007年 | 11篇 |
| 2006年 | 11篇 |
| 2005年 | 16篇 |
| 2004年 | 18篇 |
| 2003年 | 10篇 |
| 2002年 | 14篇 |
| 2000年 | 12篇 |
| 1999年 | 10篇 |
| 1998年 | 18篇 |
| 1997年 | 20篇 |
| 1996年 | 15篇 |
| 1994年 | 23篇 |
| 1993年 | 15篇 |
| 1992年 | 12篇 |
| 1991年 | 23篇 |
| 1990年 | 11篇 |
| 1989年 | 19篇 |
| 1988年 | 20篇 |
| 1987年 | 24篇 |
| 1986年 | 23篇 |
| 1985年 | 17篇 |
| 1984年 | 13篇 |
| 1983年 | 14篇 |
| 1982年 | 13篇 |
| 1981年 | 12篇 |
| 1980年 | 11篇 |
| 1979年 | 17篇 |
| 1978年 | 17篇 |
| 1977年 | 10篇 |
| 1976年 | 14篇 |
| 1975年 | 12篇 |
| 1974年 | 14篇 |
| 1973年 | 17篇 |
| 1972年 | 13篇 |
| 1971年 | 9篇 |
| 1970年 | 15篇 |
| 1969年 | 12篇 |
| 1968年 | 9篇 |
| 1967年 | 11篇 |
排序方式： 共有1003条查询结果，搜索用时 0 毫秒
151.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
152.
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. 相似文献
153.
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 相似文献
154.
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 相似文献
155.
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. 相似文献
156.
This paper examines the impact of military expenditure on economic growth on a large balanced panel, using an exogenous growth model and dynamic panel data methods for 106 countries over the period 1988–2010. A major focus of the paper is to consider the possibility group heterogeneity and non-linearity. Having estimated the model for all of the countries in the panel and finding that military burden has a negative effect on growth in the short and long run, the panel is broken down into various groupings based upon a range of potentially relevant factors, and the robustness of the results is evaluated. The factors considered are different levels of income, conflict experience, natural resources abundance, openness and aid. The estimates for the different groups are remarkably consistent with those for the whole panel, providing strong support for the argument that military spending has adverse effects on growth. There are, however, some intriguing results that suggest that for certain types of countries military spending has no significant effect on growth. 相似文献
157.
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. 相似文献
158.
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 相似文献
159.
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 相似文献
160.
Sungil Kim Heeyoung Kim Jye‐Chyi Lu Michael J. Casciato Martha A. Grover Dennis W. Hess Richard W. Lu Xin Wang 《海军后勤学研究》2015,62(2):127-142
In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015 相似文献