首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5255篇
  免费   599篇
  国内免费   420篇
化学   508篇
晶体学   3篇
力学   924篇
综合类   94篇
数学   3445篇
物理学   1300篇
  2024年   7篇
  2023年   40篇
  2022年   54篇
  2021年   67篇
  2020年   108篇
  2019年   124篇
  2018年   128篇
  2017年   131篇
  2016年   140篇
  2015年   108篇
  2014年   222篇
  2013年   333篇
  2012年   241篇
  2011年   253篇
  2010年   256篇
  2009年   272篇
  2008年   298篇
  2007年   353篇
  2006年   281篇
  2005年   286篇
  2004年   268篇
  2003年   280篇
  2002年   259篇
  2001年   222篇
  2000年   230篇
  1999年   194篇
  1998年   161篇
  1997年   159篇
  1996年   116篇
  1995年   101篇
  1994年   75篇
  1993年   77篇
  1992年   80篇
  1991年   70篇
  1990年   27篇
  1989年   28篇
  1988年   21篇
  1987年   20篇
  1986年   26篇
  1985年   29篇
  1984年   20篇
  1983年   10篇
  1982年   17篇
  1981年   11篇
  1980年   11篇
  1979年   12篇
  1978年   15篇
  1977年   13篇
  1976年   6篇
  1957年   4篇
排序方式: 共有6274条查询结果,搜索用时 15 毫秒
101.
具有转向点超曲面的奇摄动椭圆型方程边值问题   总被引:5,自引:0,他引:5  
王庚 《数学季刊》2002,17(1):41-46
本文利用多重尺度法和比较定理,研究了n维空间中一类具有转向点超曲面的奇摄动椭圆方程边值问题,研究了该值问题解的渐近性态。  相似文献   
102.
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222].  相似文献   
103.
研究全稳定广义生灭最小Q过程的可配称性,获得广义生灭最小Q过程是可配称的充分必要条件,以及最小Q过程是唯一的可配称Q过程的充分必要条件.  相似文献   
104.
程衍富  戴同庆 《中国物理 C》2006,30(10):944-949
应用多尺度微扰理论到广义非简谐振子, 得到了一阶经典和量子微扰解. 特别是 我们的量子解在极限条件下能方便地转变为经典解, 并且坐标和动量算符的对易 关系的简化十分自然. 与Taylor级数解相比较, 无论是在经典还是在量子解 中频率移动都出现在各阶振动表达式中, 所以多尺度微扰解是弱耦合非简谐振动的较好解法.  相似文献   
105.
SUMMARY: In recent years, the multiparametric approach for evaluating perceptual rating of voice quality has been advocated. This study evaluates the accuracy of predicting perceived overall severity of voice quality with a minimal set of aerodynamic, voice range profile (phonetogram), and acoustic perturbation measures. One hundred and twelve dysphonic persons (93 women and 19 men) with laryngeal pathologies and 41 normal controls (35 women and six men) with normal voices participated in this study. Perceptual severity judgement was carried out by four listeners rating the G (overall grade) parameter of the GRBAS scale. The minimal set of instrumental measures was selected based on the ability of the measure to discriminate between dysphonic and normal voices, and to attain at least a moderate correlation with perceived overall severity. Results indicated that perceived overall severity was best described by maximum phonation time of sustained /a/, peak intraoral pressure of the consonant-vowel /pi/ strings production, voice range profile area, and acoustic jitter. Direct-entry discriminant function analysis revealed that these four voice measures in combination correctly predicted 67.3% of perceived overall severity levels.  相似文献   
106.
一种结合了基于任务的访问控制模型TBAC和基于角色的访问控制模型RBAC特点的新型访问控制模型-T-RBAC.该模型采用了以任务为中心的"用户-角色-任务-权限"的四级访问控制结构,较好地解决了当前工作流系统中存在的安全性问题.此外,在新模型的基础上设计了一套描述约束机制的语言ETCL,该语言在RCL2000的基础上扩充了时间特性和任务的概念,使新模型具备了较完整的约束描述能力.  相似文献   
107.
We consider nonnegative solutions of a parabolic equation in a cylinder D×(0,T), where D is a noncompact domain of a Riemannian manifold. Under the assumption [IU] (i.e., the associated heat kernel is intrinsically ultracontractive), we establish an integral representation theorem: any nonnegative solution is represented uniquely by an integral on (D×{0})∪(MD×[0,T)), where MD is the Martin boundary of D for the associated elliptic operator. We apply it in a unified way to several concrete examples to explicitly represent nonnegative solutions. We also show that [IU] implies the condition [SP] (i.e., the constant function 1 is a small perturbation of the elliptic operator on D).  相似文献   
108.
It is shown that if P(z) = z n + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.  相似文献   
109.
A non-monotone FEM discretization of a singularly perturbed one-dimensional reaction-diffusion problem whose solution exhibits strong layers is considered. The method is shown to be maximum-norm stable although it is not inverse monotone. Both a priori and a posteriori error bounds in the maximum norm are derived. The a priori result can be used to deduce uniform convergence of various layer-adapted meshes proposed in the literature. Numerical experiments complement the theoretical results. AMS subject classification (2000)  65L10, 65L50, 65L60  相似文献   
110.
本文利用“正则摄动法”[2]研究文献[1]中由“两变量法”[3]所得到的关于Wnm,和的递推方程和递推边界条件的求解问题。求得了本问题的一致有效渐近解,最后作为实例,我们利用“混合摄动法”[4]研究了轴对称线性弯曲问题,并将所得结果与文献[5]中给出的精确解相比较,两者基本上是一致的。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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