全文获取类型
收费全文 | 5801篇 |
免费 | 470篇 |
国内免费 | 356篇 |
专业分类
化学 | 472篇 |
晶体学 | 24篇 |
力学 | 150篇 |
综合类 | 146篇 |
数学 | 5412篇 |
物理学 | 423篇 |
出版年
2024年 | 17篇 |
2023年 | 100篇 |
2022年 | 169篇 |
2021年 | 144篇 |
2020年 | 217篇 |
2019年 | 232篇 |
2018年 | 227篇 |
2017年 | 208篇 |
2016年 | 151篇 |
2015年 | 103篇 |
2014年 | 194篇 |
2013年 | 484篇 |
2012年 | 218篇 |
2011年 | 337篇 |
2010年 | 340篇 |
2009年 | 479篇 |
2008年 | 424篇 |
2007年 | 317篇 |
2006年 | 355篇 |
2005年 | 252篇 |
2004年 | 239篇 |
2003年 | 201篇 |
2002年 | 190篇 |
2001年 | 167篇 |
2000年 | 147篇 |
1999年 | 150篇 |
1998年 | 126篇 |
1997年 | 92篇 |
1996年 | 52篇 |
1995年 | 61篇 |
1994年 | 47篇 |
1993年 | 32篇 |
1992年 | 29篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6627条查询结果,搜索用时 187 毫秒
91.
Two hydrated uranyl arsenates and a uranyl phosphate were synthesized by hydrothermal methods in the presence of amine structure-directing agents and their structures determined: (N2C6H14)[(UO2)(AsO4)]2(H2O)3, DabcoUAs, {NH(C2H5)3}[(UO2)2(AsO4)(AsO3OH)], TriethUAs, and (N2C4H12)(UO2)[(UO2)(PO4)]4(H2O)2, PiperUP. Intensity data were collected at room temperature using MoKα X-radiation and a CCD-based area detector. The crystal structures were refined by full-matrix least-squares techniques on the basis of F2 to agreement indices (DabcoUAs, TriethUAs, PiperUP) wR2=5.6%, 8.3%, 7.2% for all data, and R1=2.9%, 3.3%, 4.0%, calculated for 1777, 5822, 9119 unique observed reflections (|Fo|?4σF), respectively. DabcoUAs is monoclinic, space group C2/m, Z=2, a=18.581(1), b=7.1897(4), c=7.1909(4) Å, β=102.886(1)°, V=936.43(9) Å3, Dcalc=3.50 g/cm3. TriethUAs is monoclinic, space group P21/n, Z=4, a=9.6359(4), b=18.4678(7), c=10.0708(4) Å, β=92.282(1)°, V=1790.7(1) Å3, Dcalc=3.41 g/cm3. PiperUP is monoclinic, space group Pn, Z=2, a=9.3278(4), b=15.5529(7), c=9.6474(5) Å, β=93.266(1)°, V=1397.3(1) Å3, Dcalc=4.41 g/cm3. The structure of DabcoUAs contains the autunite-type sheet formed by the sharing of vertices between uranyl square bipyramids and arsenate tetrahedra. The triethylenediammonium cations are located in the interlayer along with two H2O groups and are disordered. Both TriethUAs and PiperUP contain sheets formed of uranyl pentagonal bipyramids and tetrahedra (arsenate and phosphate, respectively) with the uranophane sheet-anion topology. In TriethUAs, triethlyammonium cations are located in the interlayer. In PiperUP, the sheets are connected by a uranyl pentagonal bipyramid that shares corners with phosphate tetrahedra of adjacent sheets, resulting in a framework with piperazinium cations and H2O groups in the cavities of the structure. 相似文献
92.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
93.
94.
JINJIANG YUAN 《运筹学学报》1998,(3)
1.IntroductionGraphsconsideredinthispaperarefiniteandsimple.FOragraphG,V(G)andE(G)denoteitssetofvenicesandedges,respectively.AbijectionwillbecalledalabellingofG.Letpbeapositiverealnumber.ForagivenlabellingTofagraphG,definethegndiscrepencya.(G,ac)ofTasTheobjectiveoftheminimum-p--sumproblemistofindalabelling7ofagraphGsuchthatac(G,T)isassmallaspossible.ThelabellingTminimizinga.(G,7)iscalledanoptimalHsumlabellingofG.Theminimumvalueiscalledtheminimum-psumofG.ItisshowninI31thattheminimum-… 相似文献
95.
关于k—消去图的若干新结果 总被引:2,自引:0,他引:2
汪长平 《数学物理学报(A辑)》1998,18(3):302-309
设G是一个图.k是自然数.图G的一个k-正则支撑子图称为G的一个k-因子.若对于G的每条边e.G—e都存在一个k-因子,则称G是一个k-消去图.该文得到了一个图是k-消去图的若干充分条件,推广了文[2—4]中有关结论. 相似文献
97.
Vladimir P. Korzhik 《Discrete Mathematics》1998,190(1-3):149-162
The author has proposed methods of constructing index 2 and 3 current graphs generating triangular embeddings of graphs Kn−Km with unboundedly large m (as n increases). As a result, triangular embeddings of graphs of many families of graphs Kn−Km with unboundedly large m were constructed. The paper gives a survey of these results and a short explanation of the methods. 相似文献
98.
李相文 《数学物理学报(B辑英文版)》1998,(2)
1IntroductionWeuseBondyandMurtyl3]forterminologyand..ta'ti..notdefinedhereandconsidersimpleconnectedgraphsonly.AcircuitCofagraphGisanontrivialconnectedeuleriansubgraphofG.Aspanningcircuit,orbrieflyS-circuit,ofagraphGisacircuitthatcontainsallvenicesofG.AdominatingcircuitorD-circuitofGisacircuitsuchthateveryedgeofGisincidentwithatleastonevertexofthecircuit.AgraphofordernispancyclicifitcontainsallcyclesoflengthIfor3515n.IfCisacircuitofG,thenP(C)denotesthenumberOfedgesofGincidentwithatleas… 相似文献
99.
100.
We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov
graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to
improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using
our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any
choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code.
This work is taken from the author’s thesis [10] 相似文献