首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4737篇
  免费   126篇
  国内免费   3篇
化学   2995篇
晶体学   15篇
力学   116篇
数学   864篇
物理学   876篇
  2023年   36篇
  2020年   43篇
  2019年   35篇
  2018年   61篇
  2017年   60篇
  2016年   114篇
  2015年   75篇
  2014年   81篇
  2013年   184篇
  2012年   124篇
  2011年   137篇
  2010年   119篇
  2009年   115篇
  2008年   143篇
  2007年   177篇
  2006年   145篇
  2005年   135篇
  2004年   126篇
  2003年   110篇
  2002年   122篇
  2001年   77篇
  2000年   96篇
  1999年   91篇
  1998年   75篇
  1997年   76篇
  1996年   68篇
  1995年   66篇
  1994年   50篇
  1993年   77篇
  1992年   59篇
  1991年   61篇
  1990年   49篇
  1989年   46篇
  1988年   52篇
  1987年   52篇
  1986年   69篇
  1985年   80篇
  1984年   51篇
  1983年   46篇
  1982年   54篇
  1981年   71篇
  1980年   60篇
  1979年   71篇
  1978年   58篇
  1977年   68篇
  1976年   52篇
  1975年   45篇
  1974年   48篇
  1973年   37篇
  1934年   38篇
排序方式: 共有4866条查询结果,搜索用时 15 毫秒
1.
2.
3.
Ohne Zusammenfassung  相似文献   
4.
Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3.  相似文献   
5.
We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20  相似文献   
6.
7.
Starch belongs to the polyglucan group. This type of polysaccharide shows a broad β-relaxation process in dielectric spectra at low temperatures, which has its molecular origin in orientational motions of sugar rings via glucosidic linkages. This chain dynamic was investigated for α(1,4)-linked starch oligomers with well-defined chain lengths of 2, 3, 4, 6, and 7 anhydroglucose units (AGUs) and for α(1,4)-polyglucans with average degrees of polymerization of 5, 10, 56, 70, and so forth (up to 3000; calculated from the mean molecular weight). The activation energy (Ea) of the segmental chain motion was lowest for dimeric maltose (Ea = 49.4 ± 1.3 kJ/mol), and this was followed by passage through a maximum at a degree of polymerization of 6 (Ea = 60.8 ± 1.8 kJ/mol). Subsequently, Ea leveled off at a value of about 52 ± 1.5 kJ/mol for chains containing more than 100 repeating units. The results were compared with the values of cellulose-like oligomers and polymers bearing a β(1,4)-linkage. Interestingly, the shape of the Ea dependency on the chain length of the molecules was qualitatively the same for both systems, whereas quantitatively the starch-like substances generally showed higher Ea values. Additionally, and for comparison, three cyclodextrins were measured by dielectric relaxation spectroscopy. The ringlike molecules, with 6, 7, and 8 α(1,4)-linked AGUs, showed moderately different types of dielectric spectra. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 188–197, 2004  相似文献   
8.
Mathematical Methods of Operations Research -  相似文献   
9.
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n 1/4 m 1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n 2 m), as opposed to O(nm 2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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