首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2238篇
  免费   80篇
  国内免费   228篇
化学   1145篇
晶体学   8篇
力学   145篇
综合类   2篇
数学   904篇
物理学   342篇
  2025年   1篇
  2024年   10篇
  2023年   23篇
  2022年   37篇
  2021年   29篇
  2020年   39篇
  2019年   40篇
  2018年   36篇
  2017年   37篇
  2016年   43篇
  2015年   60篇
  2014年   94篇
  2013年   164篇
  2012年   151篇
  2011年   178篇
  2010年   140篇
  2009年   205篇
  2008年   180篇
  2007年   134篇
  2006年   124篇
  2005年   91篇
  2004年   96篇
  2003年   64篇
  2002年   57篇
  2001年   65篇
  2000年   62篇
  1999年   58篇
  1998年   39篇
  1997年   37篇
  1996年   30篇
  1995年   30篇
  1994年   39篇
  1993年   24篇
  1992年   26篇
  1991年   21篇
  1990年   15篇
  1989年   8篇
  1988年   8篇
  1987年   11篇
  1986年   8篇
  1985年   3篇
  1984年   9篇
  1983年   4篇
  1982年   4篇
  1981年   6篇
  1979年   1篇
  1978年   3篇
  1977年   2篇
排序方式: 共有2546条查询结果,搜索用时 15 毫秒
141.
In this paper, we discuss the existence of positive almost periodic type solutions for some nonlinear delay integral equations, by constructing a new fixed point theorem in the cone. Some known results are extended.  相似文献   
142.
Various techniques for building relaxations and generating valid inequalities for pure or mixed integer programming problems without special structure are reviewed and compared computationally. Besides classical techniques such as Gomory cuts, Mixed Integer Rounding cuts, lift-and-project and reformulation–linearization techniques, a new variant is also investigated: the use of the relaxation corresponding to the intersection of simple disjunction polyhedra (i.e. the so-called elementary closure of lift-and-project cuts). Systematic comparative computational results are reported on series of test problems including multidimensional knapsack problems (MKP) and MIPLIB test problems. From the results obtained, the relaxation based on the elementary closure of lift-and-project cuts appears to be one of the most promising.  相似文献   
143.
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k.  相似文献   
144.
凸体的曲率映象与仿射表面积   总被引:4,自引:0,他引:4  
冷岗松 《数学学报》2002,45(4):797-802
本文研究了一些特殊凸体与其极体的曲率仿射表面积乘积的下界.对任意两个凸体,建立了它们的投影体的混合体积与其仿射表面积的一个不等式(见文[1-15]).  相似文献   
145.
Mixed and hybrid finite element methods for the resolution of a wide range of linear and nonlinear boundary value problems (linear elasticity, Stokes problem, Navier–Stokes equations, Boussinesq equations, etc.) have known a great development in the last few years. These methods allow simultaneous computation of the original variable and its gradient, both of them being equally accurate. Moreover, they have local conservation properties (conservation of the mass and the momentum) as in the finite volume methods.The purpose of this paper is to give a review on some mixed finite elements developed recently for the resolution of Stokes and Navier–Stokes equations, and the linear elasticity problem. Further developments for a quasi-Newtonian flow obeying the power law are presented.  相似文献   
146.
构造一个新的非协调混合元格式求解stokes问题,证明了该元满足B-B条件,并且有2阶收敛速度.  相似文献   
147.
A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines.It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated.  相似文献   
148.
In this paper we generalize a partial integrodifferential equation satisfied by the finite time ruin probability in the classical Poisson risk model. The generalization also includes the bivariate distribution function of the time of and the deficit at ruin. We solve the partial integrodifferential equation by Laplace transforms with the help of Lagrange’s implicit function theorem. The assumption of mixed Erlang claim sizes is then shown to result in tractable computational formulas for the finite time ruin probability as well as the bivariate distribution function of the time of and the deficit at ruin. A more general partial integrodifferential equation is then briefly considered.  相似文献   
149.
《Mathematische Nachrichten》2017,290(5-6):785-793
We investigate the relationship among several numerical invariants associated to a (free) projective hypersurface V : the sequence of mixed multiplicities of its Jacobian ideal, the Hilbert polynomial of its Milnor algebra, and the sequence of exponents when V is free. As a byproduct, we obtain explicit equations for some of the homaloidal surfaces in the projective 3‐dimensional space constructed by C. Ciliberto, F. Russo and A. Simis.  相似文献   
150.
In actuarial science, collective risk models, in which the aggregate claim amount of a portfolio is defined in terms of random sums, play a crucial role. In these models, it is common to assume that the number of claims and their amounts are independent, even if this might not always be the case. We consider collective risk models with different dependence structures. Due to the importance of such risk models in an actuarial setting, we first investigate a collective risk model with dependence involving the family of multivariate mixed Erlang distributions. Other models based on mixtures involving bivariate and multivariate copulas in a more general setting are then presented. These different structures allow to link the number of claims to each claim amount, and to quantify the aggregate claim loss. Then, we use Archimedean and hierarchical Archimedean copulas in collective risk models, to model the dependence between the claim number random variable and the claim amount random variables involved in the random sum. Such dependence structures allow us to derive a computational methodology for the assessment of the aggregate claim amount. While being very flexible, this methodology is easy to implement, and can easily fit more complicated hierarchical structures.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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