首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   30907篇
  免费   1180篇
  国内免费   1516篇
化学   10524篇
晶体学   214篇
力学   442篇
综合类   68篇
数学   18108篇
物理学   4247篇
  2023年   371篇
  2022年   249篇
  2021年   310篇
  2020年   475篇
  2019年   716篇
  2018年   666篇
  2017年   493篇
  2016年   524篇
  2015年   647篇
  2014年   957篇
  2013年   2180篇
  2012年   1156篇
  2011年   2244篇
  2010年   1746篇
  2009年   2114篇
  2008年   2436篇
  2007年   2221篇
  2006年   1699篇
  2005年   1222篇
  2004年   1100篇
  2003年   978篇
  2002年   1226篇
  2001年   702篇
  2000年   641篇
  1999年   719篇
  1998年   561篇
  1997年   474篇
  1996年   526篇
  1995年   558篇
  1994年   508篇
  1993年   376篇
  1992年   333篇
  1991年   259篇
  1990年   220篇
  1989年   219篇
  1988年   151篇
  1987年   155篇
  1986年   156篇
  1985年   206篇
  1984年   161篇
  1983年   91篇
  1982年   151篇
  1981年   144篇
  1980年   105篇
  1979年   82篇
  1978年   90篇
  1977年   74篇
  1976年   63篇
  1975年   27篇
  1974年   30篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all kN. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.  相似文献   
122.
We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.  相似文献   
123.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005  相似文献   
124.
Scanning electron microscopy (SEM), Fourier transform infrared (FTIR) transmission, and Hall effect measurements were performed to investigate the structural, optical, and electrical properties of as-grown and in situ-annealed Hg0.7Cd0.3Te epilayers grown on CdTe buffer layers by using molecular beam epitaxy. After the Hg0.7Cd0.3Te epilayers had been annealed in a Hg-cell flux atmosphere, the SEM images showed that the surface morphologies of the Hg0.7Cd0.3Te thin films were mirror-like with no indication of pinholes or defects, and the FTIR spectra showed that the transmission intensities had increased in comparison to that of the as-grown Hg0.7Cd0.3Te epilayer. Hall-effect measurements showed that n-Hg0.7Cd0.3Te epilayers were converted to p-Hg0.7Cd0.3Te epilayers. These results indicate that the surface, optical, and electrical properties of the Hg1 − xCdxTe epilayers are improved by annealing and that as-grown n-Hg1 − xCdxTe epilayers can be converted to p-Hg1 − xCdxTe epilayers by in situ annealing.  相似文献   
125.
条件愈苦,意志愈坚 --记王淦昌早年的科研活动   总被引:1,自引:0,他引:1  
姚立澄 《物理》2006,35(2):160-167
文章介绍了中国物理学家王淦昌早期的科研工作,特别是在抗日战争时期的科研成绩.王淦昌早期的科研贡献并不是在先进的实验仪器上,在条件优裕的实验室内完成的,而是在实验设备缺乏,科学文献不足等极端困难的环境中完成的.从王淦昌身上,可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神.  相似文献   
126.
Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.  相似文献   
127.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.  相似文献   
128.
129.
The paper is concerned with a two-delay singular differential system with a twin parameter. Applying fixed-point index theory, we show the relationship between the asymptotic behaviors of nonlinearities (at zero and infinity) and the open regions (eigenvalue regions) of parameters, which are correlated with delays, such that the system has zero, one and two positive solution(s).  相似文献   
130.
FexPt100−x(30 nm) and [FexPt100−x(3 nm)/ZrO2]10 (x = 37, 48, 57, 63, 69) films with different ZrO2 content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO2 doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L10 structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [FexPt100−x/ZrO2]10 films with the Fe atomic percentage, x and differing amounts of ZrO2 content reveals that as we increase the ZrO2 content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO2 preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO2 can reduce the intergrain exchange interactions of the FePt/ZrO2 films, and the interactions are decreased as the ZrO2 content increases, the dipole interactions are observed in FePt/ZrO2 films as the ZrO2 content is more than 15%.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号