全文获取类型
收费全文 | 573篇 |
免费 | 17篇 |
国内免费 | 5篇 |
专业分类
化学 | 362篇 |
晶体学 | 7篇 |
力学 | 20篇 |
数学 | 89篇 |
物理学 | 117篇 |
出版年
2023年 | 2篇 |
2022年 | 12篇 |
2021年 | 14篇 |
2020年 | 13篇 |
2019年 | 11篇 |
2018年 | 3篇 |
2017年 | 5篇 |
2016年 | 20篇 |
2015年 | 13篇 |
2014年 | 11篇 |
2013年 | 37篇 |
2012年 | 26篇 |
2011年 | 46篇 |
2010年 | 28篇 |
2009年 | 21篇 |
2008年 | 38篇 |
2007年 | 39篇 |
2006年 | 40篇 |
2005年 | 30篇 |
2004年 | 22篇 |
2003年 | 21篇 |
2002年 | 21篇 |
2001年 | 18篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1976年 | 4篇 |
1975年 | 3篇 |
排序方式: 共有595条查询结果,搜索用时 46 毫秒
111.
A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ⩾ 1 are classified when the fibre-preserving automorphism groups act arc-transitively. As an application of these results,
all s-regular cubic graphs of order 10p or 10p
2 are also classified for each s ⩾ 1 and each prime p, of which the proof depends on the classification of finite simple groups. 相似文献
112.
This paper presents explicit formulas for shape sensitivity analysis of thin shell structures. The curvature distribution is the design to be determined. The thin-shell theory employed is the general Koiter model in the Cartesian coordinates. For the shape sensitivity formulation, both the direct differentiation method and the material derivative concept have been used. The two formulations are shown to be equivalent. A computer program based on these formulations has been developed and applied to examples. The shape sensitivity results obtained have been compared to those obtained by finite differencing. 相似文献
113.
Ken‐ichi Sumiya Giseop Kwak Fumio Sanda Toshio Masuda 《Journal of polymer science. Part A, Polymer chemistry》2004,42(11):2774-2783
This article concerns the hydrosilylation polyaddition of 1,4‐bis(dimethylsilyl)benzene ( 1 ) with 4,4′‐diethynylbiphenyl, 2,7‐diethynylfluorene ( 2b ), and 2,6‐diethynylnaphthalene with RhI(PPh3)3 catalyst. Trans‐rich polymers with weight‐average molecular weights (Mw's) ranging from 19,000 to 25,000 were obtained by polyaddition in o‐Cl2C6H4 at 150–180 °C, whereas cis‐rich polymers with Mw's from 4300 to 34,000 were obtained in toluene at 0 °C–r.t. These polymers emitted blue light in 4–81% quantum yields. The cis polymers isomerized into trans polymers upon UV irradiation, whereas the trans polymers did not. The device having a layer of polymer trans‐ 3b obtained from 1 and 2b demonstrated electroluminescence without any dopant. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2774–2783, 2004 相似文献
114.
Morrison R Schmidt D Procario M Johnson DR Lingel K Rankin P Smith JG Alexander J Artuso M Bebek C Berkelman K Besson D Browder TE Cassel DG Cheu E Coffman DM Drell PS Ehrlich R Galik RS Garcia-Sciveres M Geiser B Gittelman B Gray SW Hartill DL Heltsley BK Honscheid K Kandaswamy J Katayama N Kreinick DL Lewis JD Ludwig GS Masui J Mevissen J Mistry NB Nandi S Ng CR Nordberg E O'Grady C Patterson JR Peterson D Pisharody M Riley D Sapper M Selen M Worden H Worris M Avery P Freyberger A Rodriguez J 《Physical review letters》1991,67(13):1696-1700
115.
Ammar R Baringer P Coppage D Davis R Haas P Kelly M Kwak N Lam H Ro S Kubota Y Nelson JK Perticone D Poling R Schrenk S Crawford G Fulton R Jensen T Johnson D Kagan H Kass R Malchow R Morrow F Whitmore J Wilson P Bortoletto D Brown DN Dominick J McIlwain RL Miller DH Modesitt M Ng CR Schaffner SF Shibata EI Shipsey IP Battle M Kroha H Sparks K Thorndike EH Wang C Alam MS Kim IJ Li WC Nemati B Romero V Sun CR Wang P Zoeller MM Goldberg M Haupt T Horwitz N Jain V Kennett R Mestayer MD Moneti GC 《Physical review D: Particles and fields》1991,44(11):3383-3393
116.
Avery P Freyberger A Rodriguez J Yelton J Henderson S Kinoshita K Pipkin F Saulnier M Wilson R Wolinski J Xiao D Yamamoto H Sadoff AJ Ammar R Baringer P Coppage D Davis R Kelly M Kwak N Lam H Ro S Kubota Y Nelson JK Perticone D Poling R Schrenk S Alam MS Kim IJ Nemati B Romero V Sun CR Wang P Zoeller MM Crawford G Fulton R Gan KK Jensen T Kagan H Kass R Malchow R Morrow F Whitmore J Wilson P Butler F Fu X Kalbfleisch G Lambrecht M Skubic P Snow J Bortoletto D Brown DN Dominick J McIlwain RL 《Physical review letters》1992,68(9):1279-1282
117.
118.
Ammar R Baringer P Coppage D Davis R Kelly M Kwak N Lam H Ro S Kubota Y Lattery M Nelson JK Perticone D Poling R Schrenk S Wang R Alam MS Kim IJ Nemati B Romero V Sun CR Wang P Zoeller MM Crawford G Fulton R Gan KK Kagan H Kass R Lee J Malchow R Morrow F Sung MK Whitmore J Wilson P Butler F Fu X Kalbfleisch G Lambrecht M Skubic P Snow J Bortoletto D Brown DN Dominick J McIlwain RL Miller DH Modesitt M Shibata EI Schaffner SF Shipsey IP Battle M Ernst J Kroha H Roberts S Sparks K Thorndike EH 《Physical review D: Particles and fields》1992,45(11):3976-3985
119.
Henderson S Kinoshita K Pipkin F Procario M Saulnier M Wilson R Wolinski J Xiao D Ammar R Baringer P Coppage D Davis R Haas P Kelly M Kwak N Lam H Ro S Kubota Y Nelson JK Perticone D Poling R Schrenk S Crawford G Fulton R Jensen T Johnson DR Kagan H Kass R Malchow R Morrow F Whitmore J Wilson P Bortoletto D Brown D Dominick J McIlwain RL Miller DH Modesitt M Schaffner SF Shibata EI Shipsey IP Battle M Kroha H Sparks K Thorndike EH Wang C Alam MS Kim IJ Li WC Nemati B Romero V Sun CR Wang P 《Physical review D: Particles and fields》1992,45(7):2212-2231
120.
The main aim of this paper is to give some upper and lower bounds for the isoperimetric numbers of graph coverings or graph bundles, with exact values in some special cases. In addition, we show that the isoperimetric number of any covering graph is not greater than that of the base graph. Mohar's theorem for the isoperimetric number of the cartesian product of a graph and a complete graph can be extended to a more general case: The isoperimetric numberi(G × K
2n) of the cartesian product of any graphG and a complete graphK
2n on even vertices is the minimum of the isoperimetric numberi(G) andn, and it is also a sharp lower bound of the isoperimetric numbers of all graph bundles over the graphG with fiberK
2n. Furthermore, ifn 2i(G) then the isoperimetric number of any graph bundle overG with fibreK
n is equal to the isoperimetric numberi(G) ofG.
Partially supported by The Ministry of Education, Korea. 相似文献