全文获取类型
收费全文 | 102845篇 |
免费 | 11640篇 |
国内免费 | 5813篇 |
专业分类
化学 | 85276篇 |
晶体学 | 1295篇 |
力学 | 2227篇 |
综合类 | 213篇 |
数学 | 20038篇 |
物理学 | 11249篇 |
出版年
2024年 | 56篇 |
2023年 | 577篇 |
2022年 | 757篇 |
2021年 | 992篇 |
2020年 | 1586篇 |
2019年 | 3729篇 |
2018年 | 3250篇 |
2017年 | 3858篇 |
2016年 | 3924篇 |
2015年 | 6047篇 |
2014年 | 6345篇 |
2013年 | 10346篇 |
2012年 | 7053篇 |
2011年 | 7532篇 |
2010年 | 6102篇 |
2009年 | 6470篇 |
2008年 | 7139篇 |
2007年 | 6367篇 |
2006年 | 5688篇 |
2005年 | 5167篇 |
2004年 | 4566篇 |
2003年 | 4016篇 |
2002年 | 4859篇 |
2001年 | 2551篇 |
2000年 | 2385篇 |
1999年 | 1598篇 |
1998年 | 906篇 |
1997年 | 709篇 |
1996年 | 780篇 |
1995年 | 738篇 |
1994年 | 669篇 |
1993年 | 517篇 |
1992年 | 489篇 |
1991年 | 339篇 |
1990年 | 274篇 |
1989年 | 266篇 |
1988年 | 213篇 |
1987年 | 198篇 |
1986年 | 147篇 |
1985年 | 177篇 |
1984年 | 171篇 |
1983年 | 76篇 |
1982年 | 134篇 |
1981年 | 139篇 |
1980年 | 74篇 |
1979年 | 71篇 |
1978年 | 46篇 |
1977年 | 52篇 |
1976年 | 45篇 |
1971年 | 22篇 |
排序方式: 共有10000条查询结果,搜索用时 7 毫秒
31.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
32.
P. R. Latthe P. S. Shinge Bharati V. Badami P. B. Patil S. N. Holihosur 《Journal of Chemical Sciences》2006,118(3):249-256
3-[4-(Azidocarbonyl)]phenylsydnone (2) obtained from 3-(4-hydrazinocarbonyl) phenylsydnone (1) on Curtius rearrangement with alcohols, water and amines afforded the corresponding carbamates (3a-h), 4,4′-(sydnone-3-yl) diphenyl urea (4) and 4-(heterocyclyl)phenyl ureas (5a-l). Compounds (5a-l) on one-pot ring conversion yielded the 1,3,4-oxadiazolin-2-one derivatives (6a-l), which on reaction with N2H4 gave the 4-amino-1,2,4-triazolin-3-ones (7a-l). All these compounds exhibited moderate antimicrobial activity against the few microbes tested. The carbamates have been
found to be more toxic against fourth instar larvae ofAedes aegypti, in particular, then-butyl derivative (3e). 相似文献
33.
Kunyu Guo 《Journal of Functional Analysis》2004,213(2):380-411
This paper mainly concerns defect operators and defect functions of Hardy submodules, Bergman submodules over the unit ball, and Hardy submodules over the polydisk. The defect operator (function) carries key information about operator theory (function theory) and structure of analytic submodules. The problem when a submodule has finite defect is attacked for both Hardy submodules and Bergman submodules. Our interest will be in submodules generated by polynomials. The reason for choosing such submodules is to understand the interaction of operator theory, function theory and algebraic geometry. 相似文献
34.
Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the
groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even
if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set
system consisting of sufficiently many sets contains at least one of these structures with many sets. 相似文献
35.
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 相似文献
36.
37.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
38.
39.
A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005 相似文献
40.