全文获取类型
收费全文 | 81116篇 |
免费 | 423篇 |
国内免费 | 395篇 |
专业分类
化学 | 26421篇 |
晶体学 | 812篇 |
力学 | 6808篇 |
数学 | 32384篇 |
物理学 | 15509篇 |
出版年
2018年 | 10448篇 |
2017年 | 10278篇 |
2016年 | 6109篇 |
2015年 | 888篇 |
2014年 | 342篇 |
2013年 | 479篇 |
2012年 | 3921篇 |
2011年 | 10662篇 |
2010年 | 5708篇 |
2009年 | 6104篇 |
2008年 | 6763篇 |
2007年 | 8928篇 |
2006年 | 388篇 |
2005年 | 1459篇 |
2004年 | 1689篇 |
2003年 | 2097篇 |
2002年 | 1132篇 |
2001年 | 278篇 |
2000年 | 320篇 |
1999年 | 188篇 |
1998年 | 227篇 |
1997年 | 187篇 |
1996年 | 251篇 |
1995年 | 166篇 |
1994年 | 126篇 |
1993年 | 134篇 |
1992年 | 85篇 |
1991年 | 96篇 |
1990年 | 92篇 |
1989年 | 92篇 |
1988年 | 102篇 |
1987年 | 102篇 |
1986年 | 99篇 |
1985年 | 122篇 |
1984年 | 96篇 |
1983年 | 90篇 |
1982年 | 107篇 |
1981年 | 94篇 |
1980年 | 107篇 |
1979年 | 85篇 |
1978年 | 70篇 |
1977年 | 58篇 |
1976年 | 41篇 |
1975年 | 43篇 |
1974年 | 45篇 |
1973年 | 57篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
32.
33.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
34.
Yasuyuki Kawahigashi 《Communications in Mathematical Physics》2002,226(2):269-287
We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if
we apply this construction to a non-degenerately braided subfactor N⊂M and α±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M
opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from αplusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize
our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors
on S
1 to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context.
Received: 11 September 2001 / Accepted: 7 October 2001 相似文献
35.
Julio Castellanos 《Mathematische Zeitschrift》2002,239(4):777-802
We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions
greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type
of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples
are presented.
Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002 相似文献
36.
37.
38.
Alexander Krasnosel'skii Dmitrii Rachinskii 《NoDEA : Nonlinear Differential Equations and Applications》2002,9(1):93-115
We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The
nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the
system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear
Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We
present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These
bifurcation points are determined by simple characteristics of the hysteresis nonlinearity. 相似文献
39.
Claudia-Elisabeth Wulz 《Czechoslovak Journal of Physics》2002,52(3):C155-C170
The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described. 相似文献
40.
The singular-perturbation expansion of the plasma cold-fluid equations for crossed fields in a planar geometry is presented. The general expansion is carried out to third order. Various instabilities that occur in the first, second, and third orders are discussed. 相似文献