全文获取类型
收费全文 | 16446篇 |
免费 | 772篇 |
国内免费 | 144篇 |
专业分类
化学 | 11107篇 |
晶体学 | 109篇 |
力学 | 454篇 |
数学 | 2871篇 |
物理学 | 2821篇 |
出版年
2023年 | 144篇 |
2022年 | 165篇 |
2021年 | 333篇 |
2020年 | 408篇 |
2019年 | 397篇 |
2018年 | 264篇 |
2017年 | 232篇 |
2016年 | 625篇 |
2015年 | 495篇 |
2014年 | 594篇 |
2013年 | 904篇 |
2012年 | 1155篇 |
2011年 | 1356篇 |
2010年 | 696篇 |
2009年 | 615篇 |
2008年 | 1019篇 |
2007年 | 971篇 |
2006年 | 967篇 |
2005年 | 865篇 |
2004年 | 748篇 |
2003年 | 527篇 |
2002年 | 550篇 |
2001年 | 194篇 |
2000年 | 165篇 |
1999年 | 152篇 |
1998年 | 134篇 |
1997年 | 136篇 |
1996年 | 175篇 |
1995年 | 114篇 |
1994年 | 120篇 |
1993年 | 132篇 |
1992年 | 94篇 |
1991年 | 97篇 |
1990年 | 77篇 |
1989年 | 77篇 |
1988年 | 89篇 |
1987年 | 78篇 |
1986年 | 74篇 |
1985年 | 106篇 |
1984年 | 118篇 |
1982年 | 119篇 |
1981年 | 128篇 |
1980年 | 97篇 |
1979年 | 85篇 |
1978年 | 115篇 |
1977年 | 94篇 |
1976年 | 73篇 |
1975年 | 72篇 |
1974年 | 65篇 |
1973年 | 71篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
81.
We demonstrate how optimization problems arise in the field of pattern classification, in particular in using piecewise-linear classification and classification based on an optimal linear separator. We motivate the need in this area for a general purpose optimization approach. We discuss ALOPEX, a biased random search approach, from the point of view of this need. While ALOPEX itself failed to fulfil our need, a newly-introduced generalization of it (iterated ALOPEX) was found to be appropriate for the optimization problems of our particular concern. We conclude the paper with a brief critical evaluation of this approach as compared to our original aims. 相似文献
82.
We prove a Beurling–Lax theorem for a family of reproducing kernel Hilbert spaces of functions analytic in an open subset of the unit ball containing the origin. The spaces under consideration are characterized by functions called Schur multipliers. Using the theory of linear relations in Pontryagin spaces we also give coisometric realizations of Schur multipliers. To cite this article: D. Alpay et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 349–354. 相似文献
83.
P.R.S. Gomes I. Padron E. Crema O.A. Capurro J.O. Fernández Niello G.V. Marti A. Arazi M. Trotta J. Lubian M.E. Ortega A.J. Pacheco M.D. Rodríguez J.E. Testoni R.M. Anjos L.C. Chamon M. Dasgupta D.J. Hinde K. Hagino 《Physics letters. [Part B]》2006
Complete and incomplete fusion cross sections for the 9Be + 144Sm reaction have been measured at near-barrier energies, using the delayed X-ray detection technique. At above-barrier energies these show a suppression of complete fusion for this weakly bound projectile on an intermediate mass target. The suppression factor, attributed to 9Be break-up, was deduced from a comparison of complete fusion yields with coupled-channels calculations, and appears consistent with measured incomplete fusion product yields. At ∼10%, it is considerably smaller than the value of ∼30% previously found for a 208Pb target. Simultaneous measurements of elastic and inelastic scattering permit a clearer picture of the reaction mechanisms. 相似文献
84.
85.
A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution. 相似文献
86.
We show that the racemic states of the B 2 phase of liquid crystals composed of banana-shaped molecules do not satisfy the Curie principle. Thus it is argued that these states cannot exist in bulk samples and the homochiral states constitute the only stable microscopic structures. A reinterpretation of the racemic states with the same macroscopic optical behaviour is proposed in terms of mixtures of the homochiral structures. 相似文献
87.
Daniel Král’ Jan Kratochvíl Andrzej Proskurowski Heinz-Jürgen Voss 《Discrete Applied Mathematics》2006,154(4):660-672
A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases. 相似文献
88.
89.
90.
Summary Comparison theorems for weak splittings of bounded operators are presented. These theorems extend the classical comparison theorem for regular splittings of matrices by Varga, the less known result by Wonicki, and the recent results for regular and weak regular splittings of matrices by Neumann and Plemmons, Elsner, and Lanzkron, Rose and Szyld. The hypotheses of the theorems presented here are weaker and the theorems hold for general Banach spaces and rather general cones. Hypotheses are given which provide strict inequalities for the comparisons. It is also shown that the comparison theorem by Alefeld and Volkmann applies exclusively to monotone sequences of iterates and is not equivalent to the comparison of the spectral radius of the iteration operators.This work was supported by the National Science Foundation grants DMS-8807338 and INT-8918502 相似文献