首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   51673篇
  免费   10201篇
  国内免费   1484篇
化学   52085篇
晶体学   427篇
力学   836篇
数学   4649篇
物理学   5361篇
  2023年   116篇
  2022年   157篇
  2021年   402篇
  2020年   1561篇
  2019年   2911篇
  2018年   1212篇
  2017年   857篇
  2016年   3866篇
  2015年   3963篇
  2014年   3949篇
  2013年   4899篇
  2012年   3902篇
  2011年   3242篇
  2010年   3455篇
  2009年   3351篇
  2008年   3246篇
  2007年   2630篇
  2006年   2253篇
  2005年   2383篇
  2004年   2096篇
  2003年   1867篇
  2002年   2506篇
  2001年   1613篇
  2000年   1523篇
  1999年   606篇
  1998年   269篇
  1997年   251篇
  1996年   264篇
  1995年   247篇
  1994年   218篇
  1993年   211篇
  1992年   199篇
  1991年   174篇
  1990年   174篇
  1989年   174篇
  1988年   149篇
  1987年   125篇
  1986年   114篇
  1985年   166篇
  1984年   163篇
  1983年   126篇
  1982年   153篇
  1981年   158篇
  1980年   132篇
  1979年   140篇
  1978年   158篇
  1977年   115篇
  1976年   100篇
  1975年   117篇
  1974年   91篇
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
51.
52.
5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.  相似文献   
53.
We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.  相似文献   
54.
The concentrations of water, W, and electrolytes present in solutions of LiCl in N,N-dimethylacetamide, LiCl/DMAc, and of tetrabutylammonium fluoride. x-hydrate in DMSO, TBAF.xW/DMSO can be accurately and expediently determined by three independent methods, UV–vis, FTIR and EMF measurement. The first relies on the use of solvatochromic probes whose spectra are sensitive to solution composition. It is applicable to W/LiCl/DMAc solutions but not to TBAF.xW/DMSO, because the charge-transfer complex bands of the probes are suppressed by strong interactions with the latter electrolyte. Integration of νOH band of water may be employed in order to determine [W], hence [electrolyte] by weight difference. EMF measurement uses ion-selective electrodes in order to determine [electrolyte], hence [W] by weight difference. Results of the latter method were in excellent agreement with those of FTIR. The reason for the failure of Karl Fischer titration is addressed, and the relevance of the results obtained to functionalization of cellulose under homogenous solution conditions is briefly commented on.  相似文献   
55.
Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.  相似文献   
56.
It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   
57.
58.
59.
60.
A graph G is N2locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N2‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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