全文获取类型
收费全文 | 5507篇 |
免费 | 425篇 |
国内免费 | 529篇 |
专业分类
化学 | 416篇 |
晶体学 | 4篇 |
力学 | 347篇 |
综合类 | 143篇 |
数学 | 5059篇 |
物理学 | 492篇 |
出版年
2024年 | 5篇 |
2023年 | 64篇 |
2022年 | 86篇 |
2021年 | 103篇 |
2020年 | 117篇 |
2019年 | 118篇 |
2018年 | 139篇 |
2017年 | 147篇 |
2016年 | 158篇 |
2015年 | 112篇 |
2014年 | 227篇 |
2013年 | 384篇 |
2012年 | 252篇 |
2011年 | 320篇 |
2010年 | 286篇 |
2009年 | 379篇 |
2008年 | 376篇 |
2007年 | 338篇 |
2006年 | 337篇 |
2005年 | 283篇 |
2004年 | 237篇 |
2003年 | 283篇 |
2002年 | 233篇 |
2001年 | 220篇 |
2000年 | 181篇 |
1999年 | 176篇 |
1998年 | 185篇 |
1997年 | 162篇 |
1996年 | 102篇 |
1995年 | 72篇 |
1994年 | 60篇 |
1993年 | 50篇 |
1992年 | 37篇 |
1991年 | 28篇 |
1990年 | 20篇 |
1989年 | 15篇 |
1988年 | 13篇 |
1987年 | 12篇 |
1986年 | 9篇 |
1985年 | 24篇 |
1984年 | 20篇 |
1983年 | 12篇 |
1982年 | 21篇 |
1981年 | 17篇 |
1980年 | 18篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1974年 | 3篇 |
排序方式: 共有6461条查询结果,搜索用时 11 毫秒
21.
C. Ratsch C. Anderson R. E. Caflisch L. Feigenbaum D. Shaevitz M. Sheffler C. Tiee 《Applied Mathematics Letters》2003,16(8):1165-1170
We adapt the level-set method to simulate epitaxial growth of thin films on a surface that consists of different reconstruction domains. Both the island boundaries and the boundaries of the reconstruction domains are described by different level-set functions. A formalism of coupled level-set functions that describe entirely different physical properties is introduced, where the velocity of each level-set function is determined by the value of the other level-set functions. 相似文献
22.
We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem. 相似文献
23.
In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m 1} is a repeated set,W(A) is weight of A. 相似文献
24.
A -frame is a lattice in which countable joins exist and binary meets distribute over countable joins. In this paper, the category MFrm, of metric -frames, is introduced, and it is shown to be equivalent to the category MLFrm
u, of metric Lindelöf frames.Finally, it is shown that the complete metric -frames are exactly the cozero parts of complete metric Lindelöf frames. 相似文献
25.
Nikita Szidorov 《Acta Mathematica Hungarica》2003,98(4):345-355
The aim of this paper is to prove some fixed point theorems which generalize well known basic fixed point principles of nonlinear
functional analysis. Moreover, we investigate the class of mappings f: X→ X, where X is a Banach space, for which one of the main conditions in the metric fixed point theory, namely the condition (1), is satisfied.
We obtain essential applications of this fact. All our results are illustrated by suitable examples.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
26.
S. Yu. Podzorov 《Algebra and Logic》2003,42(2):121-129
S. Goncharov and S. Badaev showed that for
, there exist infinite families whose Rogers semilattices contain ideals without minimal elements. In this connection, the question was posed as to whether there are examples of families that lack this property. We answer this question in the negative. It is proved that independently of a family chosen, the class of semilattices that are principal ideals of the Rogers semilattice of that family is rather wide: it includes both a factor lattice of the lattice of recursively enumerable sets modulo finite sets and a family of initial segments in the semilattice of
-degrees generated by immune sets. 相似文献
27.
Large sets of disjoint group‐divisible designs with block size three and type 2n41 were first studied by Schellenberg and Stinson because of their connection with perfect threshold schemes. It is known that such large sets can exist only for n ≡0 (mod 3) and do exist for all odd n ≡ (mod 3) and for even n=24m, where m odd ≥ 1. In this paper, we show that such large sets exist also for n=2k(3m), where m odd≥ 1 and k≥ 5. To accomplish this, we present two quadrupling constructions and two tripling constructions for a special large set called *LS(2n). © 2002 Wiley Periodicals, Inc. J Combin Designs 11: 24–35, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10032 相似文献
28.
We construct a new family of cyclic difference sets with parameters ((3
d
– 1)/2, (3
d – 1 – 1)/2, (3
d – 2 – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets. 相似文献
29.
We study the attractors of a finite system of planar contraction similarities S
j
(j=1,...,n) satisfying the coupling condition: for a set {x
0,...,x
n} of points and a binary vector (s
1,...,s
n
), called the signature, the mapping S
j
takes the pair {x
0,x
n} either into the pair {x
j-1,x
j
} (if s
j
=0) or into the pair {x
j
, x
j-1} (if s
j
=1). We describe the situations in which the Jordan property of such attractor implies that the attractor has bounded turning, i.e., is a quasiconformal image of an interval of the real axis. 相似文献
30.
We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved. 相似文献