全文获取类型
收费全文 | 1062篇 |
免费 | 22篇 |
专业分类
1084篇 |
出版年
2021年 | 12篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 227篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 30篇 |
1987年 | 22篇 |
1986年 | 35篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 12篇 |
1972年 | 15篇 |
1971年 | 9篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1967年 | 8篇 |
排序方式: 共有1084条查询结果,搜索用时 15 毫秒
101.
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 相似文献
102.
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 相似文献
103.
104.
Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998 相似文献
105.
Peter J. Phillips 《Defense & Security Analysis》2010,26(3):261-272
The purpose of this article is to explore the economic theoretical foundations of the idea that rational terrorist organizations deliberately randomize their attacks (by type, timing, location, and targets) to generate uncertainty and intimidation. A choice theoretic framework is applied to the analysis of the terrorist organization's behavior to determine whether welfare (utility) gains from the randomization of terrorist attacks are plausible and feasible. The randomization of attacks can appear to promise higher amounts of political influence for each resource input but it turns out that randomization cannot manufacture a situation where higher amounts of political influence are obtained for each resource input.The results imply that, rather than randomization and instability, the rational terrorist organization is more likely to prefer stability. The findings and implications provide a theoretical explanation for the non-randomness of terrorist attacks.Thismay be one small step towards explaining the patterns – non-randomness – in the time-series of terrorist incidents. 相似文献
106.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
107.
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 相似文献
108.
S. Selcuk Erenguc 《海军后勤学研究》1988,35(1):1-22
In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible. 相似文献
109.
The methodology of determining simultaneous visibility probabilities and points on line segments is extended to problems of three-dimensional spaces, with Poisson random fields of obscuring spheres. Required functions are derived analytically and a numerical example is given for a special case of a standard Poisson field, with uniform distribution of sphere diameters. 相似文献
110.
A general age replacement is introduced which incorporates minimal repair, planned and unplanned replacements, and costs which depend on time. Finite and infinite horizon results are obtained. Various special cases are considered. Furthermore, a shock model with general cost structure is considered. 相似文献