首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   41023篇
  免费   8352篇
  国内免费   1439篇
化学   43898篇
晶体学   377篇
力学   585篇
综合类   1篇
数学   2479篇
物理学   3474篇
  2023年   40篇
  2022年   109篇
  2021年   285篇
  2020年   1319篇
  2019年   2666篇
  2018年   1098篇
  2017年   725篇
  2016年   3471篇
  2015年   3638篇
  2014年   3568篇
  2013年   4336篇
  2012年   3259篇
  2011年   2512篇
  2010年   3044篇
  2009年   3006篇
  2008年   2648篇
  2007年   1965篇
  2006年   1674篇
  2005年   1851篇
  2004年   1612篇
  2003年   1480篇
  2002年   2135篇
  2001年   1457篇
  2000年   1368篇
  1999年   408篇
  1998年   83篇
  1997年   89篇
  1996年   90篇
  1995年   57篇
  1994年   59篇
  1993年   76篇
  1992年   57篇
  1991年   46篇
  1990年   46篇
  1989年   51篇
  1988年   29篇
  1987年   30篇
  1986年   35篇
  1985年   41篇
  1984年   29篇
  1983年   23篇
  1982年   22篇
  1981年   27篇
  1980年   20篇
  1979年   19篇
  1978年   17篇
  1977年   24篇
  1976年   25篇
  1974年   19篇
  1973年   17篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
2.
3.
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.  相似文献   
4.
This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.  相似文献   
5.
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.  相似文献   
6.
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)  相似文献   
7.
The fuzzification of convex sets in median algebras is considered, and some of their properties are investigated. A characterization of finite valued fuzzy convex set is given.  相似文献   
8.
9.
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  相似文献   
10.
The inhomogeneous Dirichlet problems concerning divergence form elliptic equations are studied. Optimal regularity requirements on the coefficients and domains for the W1,p theory, 1 < p < ∞, are obtained. The principal coefficients are supposed to be in the John‐Nirenberg space with small BMO seminorms. The domain is a Reifenberg domain. These conditions for the W1,p theory not only weaken the requirements on the coefficients but also lead to a more general geometric condition on the domains. In fact, these domains might have fractal dimensions. © 2004 Wiley Periodicals, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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