首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   116268篇
  免费   7916篇
  国内免费   14810篇
化学   82764篇
晶体学   1271篇
力学   4269篇
综合类   1009篇
数学   20194篇
物理学   29487篇
  2024年   180篇
  2023年   1036篇
  2022年   2220篇
  2021年   2560篇
  2020年   3177篇
  2019年   3027篇
  2018年   2711篇
  2017年   3601篇
  2016年   3864篇
  2015年   3267篇
  2014年   4616篇
  2013年   8739篇
  2012年   7625篇
  2011年   6689篇
  2010年   5508篇
  2009年   7516篇
  2008年   7655篇
  2007年   7966篇
  2006年   7007篇
  2005年   5994篇
  2004年   5369篇
  2003年   4605篇
  2002年   5748篇
  2001年   3481篇
  2000年   3287篇
  1999年   3001篇
  1998年   2632篇
  1997年   2076篇
  1996年   1692篇
  1995年   1597篇
  1994年   1414篇
  1993年   1212篇
  1992年   1153篇
  1991年   800篇
  1990年   718篇
  1989年   695篇
  1988年   532篇
  1987年   455篇
  1986年   411篇
  1985年   363篇
  1984年   374篇
  1983年   211篇
  1982年   318篇
  1981年   277篇
  1980年   286篇
  1979年   275篇
  1978年   241篇
  1977年   195篇
  1976年   174篇
  1973年   127篇
排序方式: 共有10000条查询结果,搜索用时 109 毫秒
991.
, where μ and λ are minor-monotone graph invariants introduced by Colin de Verdière [3] and van der Holst, Laurent, and Schrijver [5]. It is also shown that a graph G exists with . The graphs G with maximal planar complement and , characterised by Kotlov, Lovász, and Vempala, are shown to be forbidden minors for . Received: June 13, 1997  相似文献   
992.
993.
If K is a number field of degree n over Q with discriminant D K and if α∈K generates K, i.e. K=Q(α), then the height of α satisfies with . The paper deals with the existence of small generators of number fields in this sense. We show: (1) For each $n$ there are infinitely many number fields K of degree $n$ with a generator α such that . (2) There is a constant d 2 such that every imaginary quadratic number field has a generator α which satisfies .?(3) If K is a totally real number field of prime degree n then one can find an integral generator α with . Received: 10 January 1997 / Revised version: 13 January 1998  相似文献   
994.
In this paper, we deal with multicriteria matrix games. Different solution concepts have been proposed to cope with these games. Recently, the concept of Pareto-optimal security strategy which assures the property of security in the individual criteria against an opponent's deviation in strategy has been introduced. However, the idea of security behind this concept is based on expected values, so that this security might be violated by mixed strategies when replications are not allowed. To avoid this inconvenience, we propose in this paper a new concept of solution for these games: the G-goal security strategy, which includes as part of the solution the probability of obtaining prespecified values in the payoff functions. Thus, attitude toward risk together with payoff values are considered jointly in the solution analysis.  相似文献   
995.
Let R be a complete discrete valuation ring with mixed characteristic. Denote by K its field of fractions and by k its residue field. Let 0 →A K B K C K → 0 be an exact sequence of abelian varieties over K and consider the corresponding complex of Nérons models 0 →ABC→ 0, over R. We assume that the identity component B k 0 of the special fibre B k of B is a torus and we study the defect of exactmess at B in this last sequence.
Re?u: 4 décembre 1997/ Version revisée: 15 décembre 1997  相似文献   
996.
We estimate the blow‐up time for the reaction diffusion equation utu+ λf(u), for the radial symmetric case, where f is a positive, increasing and convex function growing fast enough at infinity. Here λ>λ*, where λ* is the ‘extremal’ (critical) value for λ, such that there exists an ‘extremal’ weak but not a classical steady‐state solution at λ=λ* with ∥w(?, λ)∥→∞ as 0<λ→λ*?. Estimates of the blow‐up time are obtained by using comparison methods. Also an asymptotic analysis is applied when f(s)=es, for λ?λ*?1, regarding the form of the solution during blow‐up and an asymptotic estimate of blow‐up time is obtained. Finally, some numerical results are also presented. Copyright © 2007 John Wiley & Sons, Ltd.  相似文献   
997.
灰色模型的最优化及其参数的直接求法   总被引:2,自引:0,他引:2  
基于灰色模型的内涵表达式和白化方程响应式均为等比级数的观点,提出了一种不用求ago值、均值,不涉及灰色微分方程,白化微分方程概念,直接求灰色模型参数a,c的方法,通过此方法建立的新模型不仅从理论上可保证是在满足给定评价标准为模拟绝对误差平方和最小(或模拟相对误差平方和最小)、给定精度条件下的最优化模型,从而结束了灰色模型只有更优,没有最优的历史.并从理论上证明了新模型具有白化指数律重合性、白化系数律重合性,伸缩变换一致性.最后通过实例编程验证该方法具有可操作性,且预测精度高,效果好.  相似文献   
998.
In a previous paper we considered an extension of the hard hexagon model to a solvable two-dimensional lattice gas with at most two particles per pair of adjacent sites. Here we use various mathematical identities (in particular Gordon's generalization of the Rogers-Ramanujan relations) to express the local densities in terms of elliptic functions. The critical behavior is then readily obtained.Supported in part by the National Science Foundation Grant MCS 8201733.  相似文献   
999.
We report on experiments that evaluate the potential of terahertz (THz) time-domain spectroscopy (TDS) for quality control of polymeric compounds. We investigate specimens out of a polyethylene compound with silver-coated titanium dioxide nanospheres and a glass-fiber reinforced epoxy composite. We further examine an industrial polymer product produced by injection molding. Our data demonstrates that THz imaging is a powerful tool for contactless quality control in the polymer industry.  相似文献   
1000.
The coagulation equation with kernelK ij =A+B(i+j)+C ij and arbitrary initial conditions is studied analytically and a simple expression for the solution is found. For monodisperse initial conditions, we recover the known size distribution expressed in terms of a degeneracy factorN k, which is determined by a recursion relation. For polydisperse initial conditions, a similar solution form is found, which includes a degeneracy factorN kl, also determined by a recursion relation. The physical meaning ofN kl and the recursion relation is given. A method to get explicit expressions forN k andN kl is illustrated. Finally, the pre-gel solution is given explicitly and a general method to get the post-gel solution is proposed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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