首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9543篇
  免费   874篇
  国内免费   942篇
化学   1410篇
晶体学   45篇
力学   726篇
综合类   206篇
数学   7294篇
物理学   1678篇
  2024年   18篇
  2023年   66篇
  2022年   115篇
  2021年   115篇
  2020年   164篇
  2019年   211篇
  2018年   208篇
  2017年   290篇
  2016年   338篇
  2015年   223篇
  2014年   411篇
  2013年   777篇
  2012年   488篇
  2011年   529篇
  2010年   501篇
  2009年   668篇
  2008年   661篇
  2007年   681篇
  2006年   562篇
  2005年   495篇
  2004年   460篇
  2003年   476篇
  2002年   391篇
  2001年   288篇
  2000年   310篇
  1999年   284篇
  1998年   251篇
  1997年   240篇
  1996年   189篇
  1995年   124篇
  1994年   129篇
  1993年   96篇
  1992年   89篇
  1991年   73篇
  1990年   62篇
  1989年   44篇
  1988年   33篇
  1987年   34篇
  1986年   21篇
  1985年   41篇
  1984年   23篇
  1983年   22篇
  1982年   32篇
  1981年   31篇
  1980年   19篇
  1979年   18篇
  1978年   22篇
  1977年   13篇
  1976年   7篇
  1973年   5篇
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
91.
FIXEDPOINTSANDCOUPLEDFIXEDPOINTSFORINCREASINGOPERATORSWITHAPPLICMIONSTODIFFERENTIALINCLUSIONSINBANACHSPACESZHANGSHISHENGANDHU...  相似文献   
92.
93.
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM   总被引:1,自引:0,他引:1  
ABRANCHBOUNDMETHODFORSUBSETSUMPROBLEMWUSHIQUAN(吴士泉)(InstituteofAppliedMathematics,theChineseAcademyofSciences,Beijing100080,C...  相似文献   
94.
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.  相似文献   
95.
This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge–Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge–Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one.  相似文献   
96.
In this paper we prove the existence of a solution of a coupled system involving a two phase incompressible flow in the ground and the mechanical deformation of the porous medium where the porosity is a function of the global pressure. The model is strongly coupled and involves a nonlinear degenerate parabolic equation. In order to show the existence of a weak solution, we consider a sequence of related uniformly parabolic problems and apply the Schauder fixed point theorem to show that they possess a classical solution. We then prove the relative compactness of sequences of solutions by means of the Fréchet-Kolmogorov theorem; this yields the convergence of a subsequence to a weak solution of the parabolic system.  相似文献   
97.
We give some sufficient conditions for the Domínguez-Lorenzo condition in terms of the James constant, the Jordan-von Neumann constant, and the coefficient of weak orthogonality. As a consequence, we obtain fixed point theorems for multivalued nonexpansive mappings.  相似文献   
98.
In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.  相似文献   
99.
在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.  相似文献   
100.
In this paper, the notion of gap functions is extended from scalar case to vector one. Then, gap functions and generalized functions for several kinds of vector equilibrium problems are shown. As an application, the dual problem of a class of optimization problems with a system of vector equilibrium constraints (in short, OP) is established, the concavity of the dual function, the weak duality of (OP) and the saddle point sufficient condition are derived by using generalized gap functions. This work was supported by the National Natural Science Foundation of China (10671135) and the Applied Research Project of Sichuan Province (05JY029-009-1).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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