首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4071篇
  免费   310篇
  国内免费   340篇
化学   229篇
晶体学   4篇
力学   603篇
综合类   83篇
数学   3037篇
物理学   765篇
  2024年   5篇
  2023年   41篇
  2022年   61篇
  2021年   75篇
  2020年   93篇
  2019年   91篇
  2018年   98篇
  2017年   107篇
  2016年   139篇
  2015年   95篇
  2014年   209篇
  2013年   295篇
  2012年   157篇
  2011年   232篇
  2010年   203篇
  2009年   212篇
  2008年   284篇
  2007年   261篇
  2006年   237篇
  2005年   223篇
  2004年   189篇
  2003年   184篇
  2002年   192篇
  2001年   152篇
  2000年   123篇
  1999年   126篇
  1998年   120篇
  1997年   93篇
  1996年   90篇
  1995年   69篇
  1994年   44篇
  1993年   29篇
  1992年   25篇
  1991年   9篇
  1990年   25篇
  1989年   15篇
  1988年   15篇
  1987年   9篇
  1986年   9篇
  1985年   17篇
  1984年   14篇
  1983年   3篇
  1982年   9篇
  1981年   9篇
  1980年   5篇
  1979年   6篇
  1978年   7篇
  1977年   3篇
  1976年   5篇
  1973年   4篇
排序方式: 共有4721条查询结果,搜索用时 31 毫秒
1.
The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual.  相似文献   
2.
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.  相似文献   
3.
4.
一阶最优性条件研究   总被引:1,自引:1,他引:0  
本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究,给出了更实用而简捷的差别条件。最后,举出若干例子予以说明。  相似文献   
5.
A test for a function to be a solution of an elliptic PDE is given in terms of extensions, as solutions, from the boundaries inside the domains belonging to an isotopic family. It generalizes a result of Ehrenpreis for spheres moved along a straight line.

  相似文献   

6.
Clifford分析中无界域上正则函数的边值问题   总被引:1,自引:0,他引:1  
在引入修正Cauchy核的基础上,讨论了无界域上正则函数的带共轭值的边值问题:a(t)Φ (t) b(t)Φ (t) c(t)Φ-(t) d(t)Φ=g(t).首先给出了无界域上正则函数的Plemelj公式,然后利用积分方程方法和压缩不动点原理证明了问题解的存在唯一性.  相似文献   
7.
Aliprantis  C.D.  Cornet  B.  Tourky  R. 《Positivity》2002,6(3):205-241
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.  相似文献   
8.
本文在假设被终止或取消的风险与重大信息导致的标的资产价格跳跃的风险为非系统风险的情况下,应用无套利资本资产定价,推导出了标的的资产的价格服从跳-扩散过程具有随机寿命的未定权益满足的偏微分方程,然后应用Feynman-kac公式获得了未定权益的定价公式.  相似文献   
9.
股票价格遵循几何分式Brown运动的期权定价   总被引:6,自引:0,他引:6  
讨论了股票价格过程遵循几何分式B row n运动的欧式期权定价.由于该过程存在套利机会使得传统的期权定价方法(如资本资产定价模型(CAPM),套利定价模型(APT),动态均衡定价理论(DEPT))不可能对该期权定价.利用保险精算定价法,在对市场无其它任何假设条件下,获得了欧式期权的定价公式.并讨论了在有效期内股票支付已知红利和红利率的推广公式.  相似文献   
10.
Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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