全文获取类型
收费全文 | 27890篇 |
免费 | 1415篇 |
国内免费 | 316篇 |
专业分类
化学 | 18627篇 |
晶体学 | 208篇 |
力学 | 766篇 |
综合类 | 28篇 |
数学 | 4700篇 |
物理学 | 5292篇 |
出版年
2023年 | 238篇 |
2022年 | 393篇 |
2021年 | 494篇 |
2020年 | 603篇 |
2019年 | 587篇 |
2018年 | 501篇 |
2017年 | 426篇 |
2016年 | 989篇 |
2015年 | 831篇 |
2014年 | 969篇 |
2013年 | 1557篇 |
2012年 | 1932篇 |
2011年 | 2193篇 |
2010年 | 1203篇 |
2009年 | 1056篇 |
2008年 | 1654篇 |
2007年 | 1619篇 |
2006年 | 1581篇 |
2005年 | 1415篇 |
2004年 | 1245篇 |
2003年 | 874篇 |
2002年 | 859篇 |
2001年 | 368篇 |
2000年 | 350篇 |
1999年 | 313篇 |
1998年 | 265篇 |
1997年 | 249篇 |
1996年 | 319篇 |
1995年 | 206篇 |
1994年 | 224篇 |
1993年 | 221篇 |
1992年 | 190篇 |
1991年 | 201篇 |
1990年 | 168篇 |
1989年 | 181篇 |
1988年 | 164篇 |
1987年 | 143篇 |
1986年 | 133篇 |
1985年 | 170篇 |
1984年 | 174篇 |
1982年 | 176篇 |
1981年 | 188篇 |
1980年 | 141篇 |
1979年 | 142篇 |
1978年 | 163篇 |
1977年 | 132篇 |
1976年 | 130篇 |
1975年 | 112篇 |
1974年 | 105篇 |
1973年 | 113篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data. 相似文献
22.
23.
24.
Aidan Mooney John G. Keating Daniel M. Heffernan 《Chaos, solitons, and fractals》2006,30(5):1088-1097
A digital watermark is a visible, or preferably invisible, identification code that is permanently embedded in digital media, to prove owner authentication and provide protection for documents. Given the interest in watermark generation using chaotic functions a detailed study of one chaotic function for this purpose is performed. In this paper, we present an approach for the generation of watermarks using the logistic map. Using this function, in conjunction with seed management, it is possible to generate chaotic sequences that may be used to create highpass or lowpass digital watermarks. In this paper we provide a detailed study on the generation of optically detectable watermarks and we provide some guidelines on successful chaotic watermark generation using the logistic map, and show using a recently published scheme, how care must be taken in the selection of the function seed. 相似文献
25.
26.
Lubomír Kubáček 《Applications of Mathematics》2006,51(6):565-582
Some remarks to problems of point and interval estimation, testing and problems of outliers are presented in the case of multivariate
regression model.
This work was supported by the Council of Czech Government J14/98:153100011. 相似文献
27.
Daniel B. Szyld 《Numerical Algorithms》2006,42(3-4):309-323
Given an oblique projector P on a Hilbert space, i.e., an operator satisfying P
2=P, which is neither null nor the identity, it holds that ||P|| = ||I –P||. This useful equality, while not widely-known, has been proven repeatedly in the literature. Many published proofs are reviewed, and simpler ones are presented. 相似文献
28.
29.
30.
Partially supported by the general research fund at the University of Kansas 相似文献