全文获取类型
收费全文 | 597篇 |
免费 | 14篇 |
出版年
2021年 | 10篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 121篇 |
2012年 | 6篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2007年 | 16篇 |
2005年 | 7篇 |
2004年 | 7篇 |
2003年 | 12篇 |
2002年 | 9篇 |
2000年 | 6篇 |
1999年 | 10篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 12篇 |
1995年 | 10篇 |
1994年 | 11篇 |
1993年 | 14篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1987年 | 6篇 |
1986年 | 20篇 |
1985年 | 11篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 17篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 9篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 13篇 |
1973年 | 11篇 |
1972年 | 7篇 |
1971年 | 14篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 6篇 |
1967年 | 7篇 |
排序方式: 共有611条查询结果,搜索用时 126 毫秒
31.
A pseudo-monotonic interval program is a problem of maximizing f(x) subject to x ε X = {x ε Rn | a < Ax < b, a, b ε Rm} where f is a pseudomonotonic function on X, the set defined by the linear interval constraints. In this paper, an algorithm to solve the above program is proposed. The algorithm is based on solving a finite number of linear interval programs whose solutions techniques are well known. These optimal solutions then yield an optimal solution of the proposed pseudo-monotonic interval program. 相似文献
32.
Consider an auction in which increasing bids are made in sequence on an object whose value θ is known to each bidder. Suppose n bids are received, and the distribution of each bid is conditionally uniform. More specifically, suppose the first bid X1 is uniformly distributed on [0, θ], and the ith bid is uniformly distributed on [Xi?1, θ] for i = 2, …?, n. A scenario in which this auction model is appropriate is described. We assume that the value θ is un known to the statistician and must be esimated from the sample X1, X2, …?, Xn. The best linear unbiased estimate of θ is derived. The invariance of the estimation problem under scale transformations in noted, and the best invariant estimation problem under scale transformations is noted, and the best invariant estimate of θ under loss L(θ, a) = [(a/θ) ? 1]2 is derived. It is shown that this best invariant estimate has uniformly smaller mean-squared error than the best linear unbiased estimate, and the ratio of the mean-squared errors is estimated from simulation experiments. A Bayesian formulation of the estimation problem is also considered, and a class of Bayes estimates is explicitly derived. 相似文献
33.
Adequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction, R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman-Toman ten-variable data is used to illustrate the effectiveness of the region R. 相似文献
34.
A model, for assessing the effectiveness of alternative force structures in an uncertain future conflict, is presented and exemplified. The methodology is appropriate to forces (e.g., the attack submarine force) where alternative unit types may be employed, albeit at differing effectiveness, in the same set of missions. Procurement trade-offs, and in particular the desirability of special purpose units in place of some (presumably more expensive) general purpose units, can be addressed by this model. Example calculations indicate an increase in the effectiveness of a force composed of general purpose units, relative to various mixed forces, with increase in the uncertainty regarding future conflicts. 相似文献
35.
36.
Dileep R. Sule 《海军后勤学研究》1982,29(3):517-519
The paper extends the machine flow-shop scheduling problem by separating processing time into setup, processing and removal times. 相似文献
37.
Under a free-replacement warranty of duration W, the customer is provided, for an initial cost of C, as many replacement items as needed to provide service for a period W. Payments of C are not made at fixed intervals of length W, but in random cycles of length Y = W + γ(W), where γ(W) is the (random) remaining life-time of the item in service W time units after the beginning of a cycle. The expected number of payments over the life cycle, L, of the item is given by MY(L), the renewal function for the random variable Y. We investigate this renewal function analytically and numerically and compare the latter with known asymptotic results. The distribution of Y, and hence the renewal function, depends on the underlying failure distribution of the items. Several choices for this distribution, including the exponential, uniform, gamma and Weibull, are considered. 相似文献
38.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
39.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献
40.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献