全文获取类型
收费全文 | 3781篇 |
免费 | 97篇 |
国内免费 | 17篇 |
专业分类
化学 | 2609篇 |
晶体学 | 22篇 |
力学 | 84篇 |
数学 | 660篇 |
物理学 | 520篇 |
出版年
2022年 | 41篇 |
2021年 | 48篇 |
2020年 | 39篇 |
2019年 | 45篇 |
2018年 | 44篇 |
2017年 | 44篇 |
2016年 | 54篇 |
2015年 | 72篇 |
2014年 | 78篇 |
2013年 | 195篇 |
2012年 | 202篇 |
2011年 | 211篇 |
2010年 | 124篇 |
2009年 | 115篇 |
2008年 | 218篇 |
2007年 | 199篇 |
2006年 | 204篇 |
2005年 | 160篇 |
2004年 | 157篇 |
2003年 | 125篇 |
2002年 | 120篇 |
2001年 | 62篇 |
2000年 | 38篇 |
1998年 | 25篇 |
1997年 | 28篇 |
1996年 | 61篇 |
1995年 | 36篇 |
1994年 | 39篇 |
1993年 | 44篇 |
1992年 | 35篇 |
1991年 | 36篇 |
1990年 | 33篇 |
1989年 | 38篇 |
1988年 | 45篇 |
1987年 | 29篇 |
1985年 | 57篇 |
1984年 | 58篇 |
1983年 | 36篇 |
1982年 | 65篇 |
1981年 | 55篇 |
1980年 | 36篇 |
1979年 | 50篇 |
1978年 | 48篇 |
1977年 | 45篇 |
1976年 | 43篇 |
1975年 | 29篇 |
1974年 | 39篇 |
1973年 | 48篇 |
1972年 | 25篇 |
1971年 | 24篇 |
排序方式: 共有3895条查询结果,搜索用时 10 毫秒
1.
2.
Optics and Spectroscopy - Scattering of light by disordered structures is normally detrimental to their applicability in many optoelectronic devices. However, some micro and nanostructures are... 相似文献
3.
Francis Jordan 《Topology and its Applications》2006,153(14):2386-2412
An abstract scheme using particular types of relations on filters leads to general unifying results on stability under supremum and product of local topological properties. We present applications for Fréchetness, strong Fréchetness, countable tightness and countable fan-tightness, some of which recover or refine classical results, some of which are new. The reader may find other applications as well. 相似文献
4.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献
5.
Christopher E. Stuart Paul Abraham 《Journal of Mathematical Analysis and Applications》2004,300(2):224-361
Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems for scalar-valued measures on rings of sets that are in general not σ-rings are presented. As a consequence, the rings of subsets of N with density zero and uniform density zero are shown to have the Nikodym property. In addition, vector measure generalizations of the Vitali–Hahn–Saks theorem are given. 相似文献
6.
Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis. 相似文献
7.
Abraham Chemtob Valrie Hroguez Yves Gnanou 《Journal of polymer science. Part A, Polymer chemistry》2004,42(11):2705-2716
This study critically examines the similarities and differences between poly(ethylene oxide) (PEO) stabilized latices of polynorbornene and polybutadiene. Features such as the kinetics of copolymerization of norbornene and cyclooctadiene with a macromonomer of PEO, the particles' size and morphology, the type of copolymer formed, and the stability of these latices were investigated and the results obtained are considered. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2705–2716, 2004 相似文献
8.
Becky Lavi Abraham Marmur 《Colloids and surfaces. A, Physicochemical and engineering aspects》2004,250(1-3):409-414
An equation for the kinetics of partial drop spreading is proposed. This equation was empirically derived from experimental data for the spreading kinetics of partially wetting liquids in terms of the wet area versus time. The equation has the form of an exponential power law (EPL), and transforms into the well-known power law for complete wetting, when the equilibrium contact angle approaches zero. The EPL fits very well available experimental data. To lend additional support to the validity of this generalized equation, it will be demonstrated that when it is transformed to present the dynamic contact angle (DCA), it fits very well DCA experimental data for other wetting processes, such as capillary flow and tape coating. 相似文献
9.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
10.