全文获取类型
收费全文 | 14131篇 |
免费 | 354篇 |
国内免费 | 334篇 |
专业分类
化学 | 1642篇 |
晶体学 | 31篇 |
力学 | 170篇 |
综合类 | 15篇 |
数学 | 11917篇 |
物理学 | 1044篇 |
出版年
2023年 | 24篇 |
2022年 | 47篇 |
2021年 | 36篇 |
2020年 | 69篇 |
2019年 | 338篇 |
2018年 | 383篇 |
2017年 | 210篇 |
2016年 | 139篇 |
2015年 | 186篇 |
2014年 | 392篇 |
2013年 | 1214篇 |
2012年 | 482篇 |
2011年 | 998篇 |
2010年 | 866篇 |
2009年 | 905篇 |
2008年 | 1130篇 |
2007年 | 1112篇 |
2006年 | 814篇 |
2005年 | 513篇 |
2004年 | 431篇 |
2003年 | 386篇 |
2002年 | 297篇 |
2001年 | 303篇 |
2000年 | 275篇 |
1999年 | 328篇 |
1998年 | 243篇 |
1997年 | 219篇 |
1996年 | 240篇 |
1995年 | 328篇 |
1994年 | 299篇 |
1993年 | 215篇 |
1992年 | 171篇 |
1991年 | 120篇 |
1990年 | 115篇 |
1989年 | 82篇 |
1988年 | 69篇 |
1987年 | 62篇 |
1986年 | 77篇 |
1985年 | 99篇 |
1984年 | 86篇 |
1983年 | 45篇 |
1982年 | 73篇 |
1981年 | 70篇 |
1980年 | 70篇 |
1979年 | 52篇 |
1978年 | 67篇 |
1977年 | 40篇 |
1976年 | 42篇 |
1975年 | 18篇 |
1974年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties. 相似文献
23.
Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given. 相似文献
24.
Kazem Ghanbari 《Positivity》2006,10(4):721-729
We denote the spectrum of an square matrix A by σ(A), and that of the matrix obtained by deleting the first i rows and columns of A by σi(A). It is known that a symmetric pentadiagonal oscillatory (SPO) matrix may be constructed from σ, σ1 and σ2. The pairs σ, σ1 and σ1, σ2 must interlace; the construction is not unique; and the conditions on the data which ensure that A is oscillatory are extremely complicated. Given one SPO matrix A, the paper shows that operations may be applied to A to construct a family of such matrices with σ and σ1 in common. Moreover, given one totally positive (TP) matrix A, we construct a family of TP matrices with σ, σ1 and σ2 in common. 相似文献
25.
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004 相似文献
26.
We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures. 相似文献
27.
Abstract. We propose a general approach to deal with nonlinear, nonconvex variational problems based on a reformulation of the problem
resulting in an optimization problem with linear cost functional and convex constraints. As a first step we explicitly explore
these ideas to some one-dimensional variational problems and obtain specific conclusions of an analytical and numerical nature. 相似文献
28.
The formation of thinning filaments is commonly observed previously to the break-up of a very viscous jet. This paper shows that a fluid under capillary forces cannot break-up through the uniform collapse of a filament. 相似文献
29.
Günter F. Steinke 《Results in Mathematics》2007,51(1-2):111-126
Polster and Steinke [Result. Math., 46 (2004), 103–122] determined the possible Kleinewillingh?fer types of flat Laguerre planes. These types reflect transitivity
properties of groups of certain central automorphisms. We exclude three more types from the list given there with respect
to Laguerre homotheties. This yields a complete determination of all possible single types with respect to Laguerre homotheties
that can occur in flat Laguerre planes. Building on results by M?urer and Hartmann to characterize ovoidal or miquelian Laguerre
planes we further characterize certain flat Laguerre planes in terms of their Kleinewillingh?fer types.
Received: January 16, 2007. Revised: July 26, 2007. 相似文献
30.
In this paper, the detailed asymptotic behaviour of the solutions of a kinetic equation for quantum particles is studied. It is shown that this behaviour is sensitive not only to the total mass of the initial data but also to its precise behaviour near the origin. In some cases, solutions develop a Dirac mass at the origin for long times in a self-similar manner that is analysed in detail. 相似文献