全文获取类型
收费全文 | 37598篇 |
免费 | 3279篇 |
国内免费 | 2679篇 |
专业分类
化学 | 2916篇 |
晶体学 | 36篇 |
力学 | 1740篇 |
综合类 | 486篇 |
数学 | 8544篇 |
物理学 | 5020篇 |
综合类 | 24814篇 |
出版年
2024年 | 178篇 |
2023年 | 447篇 |
2022年 | 885篇 |
2021年 | 978篇 |
2020年 | 790篇 |
2019年 | 826篇 |
2018年 | 813篇 |
2017年 | 1142篇 |
2016年 | 1187篇 |
2015年 | 1253篇 |
2014年 | 1947篇 |
2013年 | 2127篇 |
2012年 | 2078篇 |
2011年 | 2273篇 |
2010年 | 1752篇 |
2009年 | 2168篇 |
2008年 | 2237篇 |
2007年 | 2816篇 |
2006年 | 2545篇 |
2005年 | 2098篇 |
2004年 | 1880篇 |
2003年 | 1582篇 |
2002年 | 1430篇 |
2001年 | 1210篇 |
2000年 | 1024篇 |
1999年 | 870篇 |
1998年 | 770篇 |
1997年 | 664篇 |
1996年 | 568篇 |
1995年 | 491篇 |
1994年 | 384篇 |
1993年 | 355篇 |
1992年 | 313篇 |
1991年 | 283篇 |
1990年 | 270篇 |
1989年 | 216篇 |
1988年 | 170篇 |
1987年 | 138篇 |
1986年 | 83篇 |
1985年 | 82篇 |
1984年 | 43篇 |
1983年 | 26篇 |
1982年 | 37篇 |
1981年 | 18篇 |
1980年 | 15篇 |
1979年 | 24篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1959年 | 7篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 ) 相似文献
62.
分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题.基于断点图的概念,给出一个时间复杂性为O(max{b^(π),nb(π)}),空间复杂性为0(n)的求其近似最优解的算法.其中n为基因组中基因个数,π=(π1,π2,…,πn)表示n个基因的一种排列,b(π)表示排列π中的断点数.数据实验的结果表明,该近似算法可以求得较好的结果. 相似文献
63.
C. H. Hesse 《Statistical Inference for Stochastic Processes》2007,10(1):75-95
In this work the Cauchy problem for the one-dimensional heat equation is considered. In contrast to existing literature it
is assumed that the initial state f is unknown and that information regarding f is obtained by some process of measurement. To enhance realism, both measurement errors and missing data are allowed for.
Under assumptions on f in the Fourier-domain first an approximation to f is derived from the data by means of a novel uncertainty principle. Then, it is studied how this perturbation in the initial
state propagates with time.
相似文献
64.
序列模式挖掘是数据挖掘的重要分支,GSP算法与PSP算法是序列模式挖掘中的两种典型算法。本文介绍了这两种算法并对其进行了分析与比较。 相似文献
65.
66.
SUN Qiyu 《数学年刊B辑(英文版)》2003,24(3):367-386
In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2). 相似文献
67.
Lihong Wang 《Annals of the Institute of Statistical Mathematics》2004,56(2):251-264
The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L
2-estimates) and the least absolute deviation estimates (L
1-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which
has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies
of the above estimators. 相似文献
68.
Finding finer functions for partially characterized proteins by protein-protein interaction networks
LI YanHui GUO Zheng MA WenCai YANG Da WANG Dong ZHANG Min ZHU ding ZHONG GuoCai LI YongJin YAO Chen WANG Jing 《科学通报(英文版)》2007,52(24):3363-3370
Based on high-throughput data, numerous algorithms have been designed to find functions of novel proteins. However, the effectiveness of such algorithms is currently limited by some fundamental factors, including (1) the low a-priori probability of novel proteins participating in a detailed function; (2) the huge false data present in high-throughput datasets; (3) the incomplete data coverage of functional classes; (4) the abundant but heterogeneous negative samples for training the algorithms; and (5) the lack of detailed functional knowledge for training algorithms. Here, for partially characterized proteins, we suggest an approach to finding their finer functions based on protein interaction sub-networks or gene expression patterns, defined in function-specific subspaces. The proposed approach can lessen the above-mentioned problems by properly defining the prediction range and functionally filtering the noisy data, and thus can efficiently find proteins’ novel functions. For thousands of yeast and human proteins partially characterized, it is able to reliably find their finer functions (e.g., the translational functions) with more than 90% precision. The predicted finer functions are highly valuable both for guiding the follow-up wet-lab validation and for providing the necessary data for training algorithms to learn other proteins. 相似文献
69.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
70.
Alessandro Conflitti 《Finite Fields and Their Applications》2003,9(4):423-431
We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field. 相似文献