首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   28882篇
  免费   704篇
  国内免费   231篇
化学   19518篇
晶体学   132篇
力学   678篇
综合类   1篇
数学   5416篇
物理学   4072篇
  2022年   185篇
  2021年   279篇
  2020年   350篇
  2019年   317篇
  2018年   279篇
  2017年   295篇
  2016年   604篇
  2015年   631篇
  2014年   665篇
  2013年   1420篇
  2012年   1420篇
  2011年   1720篇
  2010年   960篇
  2009年   826篇
  2008年   1475篇
  2007年   1482篇
  2006年   1566篇
  2005年   1413篇
  2004年   1348篇
  2003年   1112篇
  2002年   1055篇
  2001年   465篇
  2000年   418篇
  1999年   405篇
  1998年   399篇
  1997年   448篇
  1996年   406篇
  1995年   370篇
  1994年   398篇
  1993年   350篇
  1992年   333篇
  1991年   331篇
  1990年   281篇
  1989年   285篇
  1988年   272篇
  1987年   226篇
  1986年   252篇
  1985年   372篇
  1984年   382篇
  1983年   327篇
  1982年   354篇
  1981年   318篇
  1980年   345篇
  1979年   273篇
  1978年   315篇
  1977年   288篇
  1976年   233篇
  1975年   194篇
  1974年   202篇
  1973年   167篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
92.
93.
The melting behaviour, some phase boundaries and the lattice parameters in the region of the NiAs-type phase in the ternary system cobalt-antimony-tellurium have been determined by differential thermal analysis and X-ray diffraction. A projection of the liquidus surface and the phase relationships in different sections with constant antimony/tellurium ratios are presented. The peculiar variation of the lattice parameters with the composition of the nonstoichiometric NiAs-type phase is discussed in terms of the defect structure.Dedicated to Prof. K. L. Komarek on the occasion of his 65th birthday  相似文献   
94.
What is the maximum number of unit distances between the vertices of a convex n-gon in the plane? We review known partial results for this and other open questions on multiple occurrences of the same interpoint distance in finite planar subsets. Some new results are proved for small n. Challenging conjectures, both old and new, are highlighted.  相似文献   
95.
96.
Summary. Recombinant Escherichia coli overexpressing Pseudomonas sp. NCIMB 9872 cyclopentanone monooxygenase (CPMO, EC 1.14.13.16) and Acinetobacter sp. NCIMB 9871 cyclohexanone monooxygenase (CHMO, EC 1.14.13.22) have been utilized in whole-cell Baeyer-Villiger biotransformations of prochiral bicycloketones. A significant difference in substrate acceptance and stereoselectivity was observed for bicyclo[3.3.0] and bicyclo[4.3.0] substrates. A plausible mechanism of these transformations was established by means of high level DFT/B3LYP calculations suggesting an essential difference in electronic requirements for a successful enzymatic conversion, which was similarly encountered in recombinant whole-cell mediated biooxidations. Some of the lactones produced in the biocatalytic Baeyer-Villiger oxidation represent key intermediates for the synthesis of indole alkaloids.  相似文献   
97.
98.
The reduction of chromate by glutathione, its mono- and diethyl esters, -cysteine, 2-mercapto-propionic acid and mercapto-succinic acid has been studied. The empirical rate law kobs = ab[Thiol]2/(1 + b[Thiol]) is obeyed by all of these thiols, at neutral pH. No evidence could be obtained for a first-order pathway in glutathione under these conditions. These observations are used to comment on the stability of intermediates potentially important in explaining chromate toxicity.  相似文献   
99.
100.
This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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