全文获取类型
收费全文 | 155篇 |
免费 | 11篇 |
专业分类
166篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 7篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 2篇 |
2013年 | 23篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 8篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有166条查询结果,搜索用时 15 毫秒
1.
Let X denote a random vector with a spherically symmetric distribution. The density of U = X'X, called a “generalized chi-square,” is derived for the noncentral case, when μ = E(X) ≠ 0. Explicit series representations are found in certain special cases including the “generalized spherical gamma,” the “generalized” Laplace and the Pearson type VII distributions. A simple geometrical representation of U is shown to be useful in generating random U variates. Expressions for moments and characteristic functions are also given. These densities occur in offset hitting probabilities. 相似文献
2.
We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions. 相似文献
3.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
4.
This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011 相似文献
5.
This paper presents a model for choosing a minimum-cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques. 相似文献
6.
We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable. 相似文献
7.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
8.
We measure the effectiveness of a repairable system by the proportion of time the system is on, where on-time and off-times are assumed independent and both gamma-distributed. This measure is helpful for system planning and control in the short term, before the steady-state is reached, and its mean value is intermediary between instantaneous and steady-state availabilities. We also present other significant results concerning the Gamma Alternating Renewal Process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 822–844, 1999 相似文献
9.
This article deals with investigating the effect of cut-outs on the natural frequencies of magneto-electro-elastic (MEE) plates incorporating finite element methods based on higher order shear deformation theory (HSDT). In order to consider the influence of cut-out, the energy of the cut-out domain is sub-tracted from the total energy of the entire plate. The governing equations of motions are derived through incorporating Hamilton's principle and the solution is obtained using condensation technique. The proposed numerical formulation is verified with the results of previously published literature as well as the numerical software. In addition, this research focuses on evaluating the effect of geometrical skewness and boundary conditions on the frequency response. The influence of cut-outs on the degree of coupling between magnetic, electric and elasticfields is also investigated. 相似文献
10.