全文获取类型
收费全文 | 4012篇 |
免费 | 614篇 |
国内免费 | 275篇 |
专业分类
化学 | 543篇 |
晶体学 | 28篇 |
力学 | 404篇 |
综合类 | 51篇 |
数学 | 810篇 |
物理学 | 1099篇 |
无线电 | 1966篇 |
出版年
2024年 | 16篇 |
2023年 | 62篇 |
2022年 | 125篇 |
2021年 | 124篇 |
2020年 | 155篇 |
2019年 | 145篇 |
2018年 | 128篇 |
2017年 | 150篇 |
2016年 | 140篇 |
2015年 | 165篇 |
2014年 | 253篇 |
2013年 | 313篇 |
2012年 | 268篇 |
2011年 | 297篇 |
2010年 | 232篇 |
2009年 | 250篇 |
2008年 | 277篇 |
2007年 | 224篇 |
2006年 | 229篇 |
2005年 | 210篇 |
2004年 | 199篇 |
2003年 | 174篇 |
2002年 | 139篇 |
2001年 | 116篇 |
2000年 | 78篇 |
1999年 | 68篇 |
1998年 | 67篇 |
1997年 | 51篇 |
1996年 | 40篇 |
1995年 | 47篇 |
1994年 | 23篇 |
1993年 | 24篇 |
1992年 | 24篇 |
1991年 | 24篇 |
1990年 | 17篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1987年 | 4篇 |
1986年 | 5篇 |
1985年 | 1篇 |
1984年 | 6篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有4901条查询结果,搜索用时 8 毫秒
141.
Guido E del Pino 《Statistics & probability letters》1984,2(4):245-248
In this paper we consider the full rank regression model with arbitrary covariance matrix: Y = Xß + ε. It is shown that the effect of restricting the information Y to T = A′Y may be analyzed through an associatedi regression problem which is amenable to solution by two step least squares. The results are applied to the important case of missing observations, where some classical results are rederived. 相似文献
142.
This work extends the classical F. and M. Riesz theorem to measures that are boundary values of holomorphic functions defined on wedges in
with edges that are in the class C
1,α.This work was supported in part by NSF INT-0203005, CNPq and FAPESP 相似文献
144.
Boniface Nkemzi Michael Jung 《Numerical Methods for Partial Differential Equations》2021,37(1):836-853
Solutions of boundary value problems in three‐dimensional domains with edges may exhibit singularities which are known to influence both the accuracy of the finite element solutions and the rate of convergence in the error estimates. This paper considers boundary value problems for the Poisson equation on typical domains Ω ? ?3 with edge singularities and presents, on the one hand, explicit computational formulas for the flux intensity functions. On the other hand, it proposes and analyzes a nonconforming finite element method on regular meshes for the efficient treatment of the singularities. The novelty of the present method is the use of the explicit formulas for the flux intensity functions in defining a postprocessing procedure in the finite element approximation of the solution. A priori error estimates in H1(Ω) show that the present algorithm exhibits the same rate of convergence as it is known for problems with regular solutions. 相似文献
145.
146.
147.
张磊 《数学的实践与认识》2021,(1):302-307
设G=(V,E)是一个连通图.称一个边集合S■E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点.称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λ_k(G).定义ξ_k(G)=min{[X,■]:|X|=k,G[X]连通,■=V(G)\X}.称图G是极大k限制边连通的,如果λ_k(G)=ξ_k(G).本文给出了围长为g>6的极大3限制边连通二部图的充分条件. 相似文献
148.
极小Cayley图的限制性边连通度 总被引:1,自引:0,他引:1
一个连通图X的边集的一个子集C称为一个限制性边割,如果它是一个边割,且X/C不含孤立点。X的限制性边连通度λ′(X)定义为所有限制性边割的最小基数。本文完全决定了极小Cayley图的限制性边连通度。 相似文献
149.
150.
Kazuhisa Makino Yushi Uno Toshihide Ibaraki 《Journal of Algorithms in Cognition, Informatics and Logic》2001,38(2):411
In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard. Furthermore, we present an approximation algorithm for MERST, which realizes its worst case performance ratio
where n is the number of vertices in G and Δ* is the maximum degree of a spanning tree whose maximum degree is minimum. Although the approximation algorithm is a combination of two existing algorithms for the restricted spanning tree problem and for the minimum edge ranking problem of trees, the analysis is based on novel properties of the edge ranking of trees. 相似文献