全文获取类型
收费全文 | 49458篇 |
免费 | 2786篇 |
国内免费 | 2021篇 |
专业分类
化学 | 25479篇 |
晶体学 | 492篇 |
力学 | 2343篇 |
综合类 | 85篇 |
数学 | 10962篇 |
物理学 | 14904篇 |
出版年
2024年 | 62篇 |
2023年 | 346篇 |
2022年 | 621篇 |
2021年 | 699篇 |
2020年 | 737篇 |
2019年 | 758篇 |
2018年 | 1829篇 |
2017年 | 2013篇 |
2016年 | 1604篇 |
2015年 | 1463篇 |
2014年 | 1612篇 |
2013年 | 2144篇 |
2012年 | 4818篇 |
2011年 | 4124篇 |
2010年 | 3082篇 |
2009年 | 2647篇 |
2008年 | 1893篇 |
2007年 | 1783篇 |
2006年 | 1691篇 |
2005年 | 5398篇 |
2004年 | 4645篇 |
2003年 | 2940篇 |
2002年 | 1078篇 |
2001年 | 718篇 |
2000年 | 507篇 |
1999年 | 479篇 |
1998年 | 384篇 |
1997年 | 322篇 |
1996年 | 294篇 |
1995年 | 239篇 |
1994年 | 272篇 |
1993年 | 212篇 |
1992年 | 347篇 |
1991年 | 297篇 |
1990年 | 270篇 |
1989年 | 239篇 |
1988年 | 175篇 |
1987年 | 115篇 |
1986年 | 106篇 |
1985年 | 100篇 |
1984年 | 79篇 |
1983年 | 55篇 |
1982年 | 57篇 |
1981年 | 56篇 |
1979年 | 57篇 |
1976年 | 113篇 |
1975年 | 61篇 |
1974年 | 76篇 |
1973年 | 70篇 |
1972年 | 52篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
基于超分子结构共掺杂纳米复合薄膜的制备与荧光特性 总被引:5,自引:0,他引:5
为改善功能分了的特性,提出一种基于金属纳米粒子-偶氮染料复合物共掺杂超分子结构功能材料的设计新方法.并依照此方法制备出复合材料,观测了其显微结构,测量了其紫外-可见光吸收,研究了该超分子结构复合体系的荧光特性.实验发现,由于金属银纳米粒子的掺杂,使得超分子结构复合体系中功能分子甲基橙在溶液态体系的荧光强度增强近5倍,而在两种不同结构(共混结构和包覆结构)的薄膜态超分子结构体系中,其荧光强度分别被猝灭15%和20%.研究结果表明,复合膜中采用超分子结构完全能够改善功能分子的特性. 相似文献
82.
83.
I Cserpan M Kalman M L Tj?rnhammar A Simoncsits 《Acta chemica Scandinavica (Copenhagen, Denmark : 1989)》1991,45(3):265-272
A general method to convert single-stranded, chemically synthesized oligonucleotides into cloned duplexes is described. Oligonucleotides supplied with 3'-terminal extensions that are complementary to 3'-protruding ends obtained by certain restriction enzymes can be cloned either directly or with the help of an adapter molecule into double-stranded vectors. Two methods have also been developed for consecutive cloning applications. According to these methods, the synthetic oligonucleotides (and their enzymatically prepared complementary strands) are joined, one after the other, inside a cloning vector, each joining requiring one cloning step. Synthetic genes are thus built up from oligonucleotides corresponding to only one strand of the DNA. The sequential assembly of the cloned duplex takes place in the 5' to 3' direction. Each oligonucleotide is supplied with a four-nucleotide-long 3'-terminal extension, but this sequence is eliminated when the joining takes place, leaving no limiting sequence between the oligonucleotides. The two consecutive cloning methods, the adapter and the polycloning site methods, are illustrated by the assembly of short artificial genes. 相似文献
84.
Song B. Merlino R.L. D'Angelo N. 《IEEE transactions on plasma science. IEEE Nuclear and Plasma Sciences Society》1992,20(4):476-479
Measurements of the perpendicular (to B) double-layer widths of ionization-produced (anode) double layers are presented. These widths were determined from measurements of the double-layer charge separations. The variations of the transverse-to-B widths with plasma density and magnetic field strength are given 相似文献
85.
Tung-Yang Ho Ting-Yi Sung Lih-Hsing Hsu Chang-Hsiung Tsai Jeng-Yan Hwang 《Journal of Algorithms in Cognition, Informatics and Logic》1998,28(2):216-257
Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese1, e2,…,ekis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network. 相似文献
86.
本文导出了考虑外场和束流效应后束流均方根发射度平方变化方程的一般表达式,并就仅考虑外场,仅考虑空间电荷场和仅考虑尾场等三种特殊情况进行了分析。 相似文献
87.
88.
Andrzej Wi?nicki 《Journal of Mathematical Analysis and Applications》2002,267(1):158-172
We use a newly introduced concept of neocompactness to study problems from metric fixed point theory. In particular, we give a sufficient condition for a superreflexive Banach space X to have the fixed point property and obtain shorter proofs of some well-known results in that theory. 相似文献
89.
90.
中国西南武陵山区跳蛛新种记述(蜘蛛目:跳蛛科) 总被引:2,自引:0,他引:2
本文记述跳蛛科13个新种,采自西南武陵山地区。暗跳蛛Asemonea、列锡蛛Lycidas和法老蛛Pharacocerus 3属为我国新记录属。 相似文献