全文获取类型
收费全文 | 130229篇 |
免费 | 1895篇 |
国内免费 | 244篇 |
专业分类
教育 | 90230篇 |
科学研究 | 13974篇 |
各国文化 | 2001篇 |
体育 | 10403篇 |
综合类 | 175篇 |
文化理论 | 1102篇 |
信息传播 | 14483篇 |
出版年
2021年 | 1003篇 |
2020年 | 1708篇 |
2019年 | 2645篇 |
2018年 | 3353篇 |
2017年 | 3577篇 |
2016年 | 3585篇 |
2015年 | 2367篇 |
2014年 | 3212篇 |
2013年 | 27453篇 |
2012年 | 2600篇 |
2011年 | 3101篇 |
2010年 | 2493篇 |
2009年 | 2694篇 |
2008年 | 2613篇 |
2007年 | 2365篇 |
2006年 | 2505篇 |
2005年 | 2510篇 |
2004年 | 3202篇 |
2003年 | 2476篇 |
2002年 | 2301篇 |
2001年 | 2315篇 |
2000年 | 1990篇 |
1999年 | 1806篇 |
1998年 | 1494篇 |
1997年 | 1554篇 |
1996年 | 1721篇 |
1995年 | 1481篇 |
1994年 | 1481篇 |
1993年 | 1487篇 |
1992年 | 1660篇 |
1991年 | 1580篇 |
1990年 | 1574篇 |
1989年 | 1555篇 |
1988年 | 1376篇 |
1987年 | 1288篇 |
1986年 | 1326篇 |
1985年 | 1594篇 |
1984年 | 1400篇 |
1983年 | 1389篇 |
1982年 | 1319篇 |
1981年 | 1221篇 |
1980年 | 1204篇 |
1979年 | 1405篇 |
1978年 | 1287篇 |
1977年 | 1167篇 |
1976年 | 1060篇 |
1975年 | 871篇 |
1974年 | 893篇 |
1973年 | 850篇 |
1971年 | 706篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
941.
A.M. Morshedi 《Journal of The Franklin Institute》1980,310(2):89-105
Optimum process operating conditions are often achieved by on-line computer programming. A general method has been developed which is capable of optimizing processes whose responses are corrupted by random error. The method is particularly useful for application to processes whose response functions contain sharp ridges. Application to ridge and non-ridge systems gives the same results in each case showing that the rate of convergence of the search is totally unaffected by the presence of a ridge. An accelarated gradient method is used which obtains its derivatives from a quadratic interpolation. The inability of the gradient method to move along a ridge is overcome by projecting a straight line through points on the ridge to obtain new starting points for a gradient search. Points on the ridge are located by finding the stationary point of the polynomial which is constructed by regression through points found by the gradient search. The method is applied to several test functions known to the literature—a fast convergence rate is obtained for a wide range of noise levels. 相似文献
942.
943.
944.
945.
946.
Michael P. Jordan 《Instructional Science》1980,9(3):221-252
Linguistic analysis of short published reports leads to the presentation of an aigorithm that depicts the problem-solving process in terms of a series of evaluative questions. The work shows how reports enable us to define in detail the various stages of problem solving, and it shows that an understanding of these various stages enables us to recognise information structures in written texts; the writing of brief reports of high-priority information on which the whole thinking process is based is thus seen as a vital part of the problem-solving process. One report is analysed in detail to demonstrate the close relationship between information structures in the text and the real-life thought'action process it describes. There is discussion of how paragraphs, sentences and signals within the sentences enable the writer to communicate the information in a conceptual array that represents the actual thought/action process it describes. Educational implications for inter-sentential coherence, discourse analysis, and writing structures, and control of research through written reports are all discussed. 相似文献
947.
S.G. Tzafestas 《Journal of The Franklin Institute》1980,309(6):399-438
In this paper a variety of optimal control (OC) problems for distributed- parameter (DP) systems are approached using mathematical programming (MP). First, the principal DP models in current use are given, a variety of DP objective functions is provided, and the OC problems based on them are formulated. Second, these models and objective functions are converted in algebraic form, as required by MP, and the solution procedure of the OC problems via MP is outlined. Third, a representative set of nonlinear programming results applied to DP systems is presented, and finally, a numvber of application examples is given. 相似文献
948.
949.
Gérald Séguin 《Journal of The Franklin Institute》1980,309(3):179-189
A sequence of metrics {DN} is said to be additive and matched to a discrete memoryless channel (DMC) if DN is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum DN-distance decoder. Necessary and sufficient conditions on the transition probabilities of a DMC for the existence of a sequence of additive metrics matched to it are given. In the case of the binary channel these are shown to be equivalent to the channel being symmetric. Explicit transition probabilities are given for a large class of ternary DMCs with an associated sequence of additive matched metrics. The problem solved here may be considered a generalization of the problem of finding the DMCs matched to the Lee metric solved by Chiang and Wolf in 1971 (2). 相似文献
950.
The case is considered in which, during the operation of an optimal control system, the optimizer, in addition to applying his usual control, may switch structures. Necessary and sufficient conditions are derived and emphasis is placed on the special characteristics of this problem. Continuous and discrete time set-ups are considered and the separation principle is shown not to hold for the linear quadratic case in the presence of noise. 相似文献