首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3237篇
  免费   334篇
  国内免费   178篇
化学   149篇
晶体学   8篇
力学   282篇
综合类   46篇
数学   2166篇
物理学   1098篇
  2023年   27篇
  2022年   49篇
  2021年   56篇
  2020年   54篇
  2019年   62篇
  2018年   59篇
  2017年   92篇
  2016年   109篇
  2015年   65篇
  2014年   168篇
  2013年   207篇
  2012年   120篇
  2011年   202篇
  2010年   193篇
  2009年   180篇
  2008年   212篇
  2007年   252篇
  2006年   200篇
  2005年   156篇
  2004年   176篇
  2003年   155篇
  2002年   115篇
  2001年   92篇
  2000年   89篇
  1999年   95篇
  1998年   69篇
  1997年   70篇
  1996年   46篇
  1995年   57篇
  1994年   37篇
  1993年   29篇
  1992年   32篇
  1991年   28篇
  1990年   17篇
  1989年   18篇
  1988年   20篇
  1987年   19篇
  1986年   9篇
  1985年   20篇
  1984年   14篇
  1983年   11篇
  1982年   7篇
  1981年   10篇
  1980年   9篇
  1979年   9篇
  1978年   6篇
  1977年   7篇
  1976年   5篇
  1975年   4篇
  1973年   3篇
排序方式: 共有3749条查询结果,搜索用时 78 毫秒
181.
对目前精算教材中的有关保险精算函数作了较为细致的分析和比较,较为深入地讨论了均衡净保费的责任准备金计算的未来法及过去法的联系.  相似文献   
182.
In this paper, we study the calibration problem for the Merton–Vasicek default probability model [Robert Merton, On the pricing of corporate debt: the risk structure of interest rate, Journal of Finance 29 (1974) 449–470]. We derive conditions that guarantee existence and uniqueness of the solution. Using analytical properties of the model, we propose a fast calibration procedure for the conditional default probability model in the integrated market and credit risk framework. Our solution allows one to avoid numerical integration problems as well as problems related to the numerical solution of the nonlinear equations.  相似文献   
183.
本文用叠代法求得了含弛豫项的广义光学Bloch方程的近似解。与计算机给出的数值积分解的比较表明,一阶叠代解具有足够好的精度。由此得出了上能级占有几率随时间变化的解析表达式及多光子吸收、Bloch-Siegert频移等有用结果。  相似文献   
184.
Credal networks generalize Bayesian networks by relaxing the requirement of precision of probabilities. Credal networks are considerably more expressive than Bayesian networks, but this makes belief updating NP-hard even on polytrees. We develop a new efficient algorithm for approximate belief updating in credal networks. The algorithm is based on an important representation result we prove for general credal networks: that any credal network can be equivalently reformulated as a credal network with binary variables; moreover, the transformation, which is considerably more complex than in the Bayesian case, can be implemented in polynomial time. The equivalent binary credal network is then updated by L2U, a loopy approximate algorithm for binary credal networks. Overall, we generalize L2U to non-binary credal networks, obtaining a scalable algorithm for the general case, which is approximate only because of its loopy nature. The accuracy of the inferences with respect to other state-of-the-art algorithms is evaluated by extensive numerical tests.  相似文献   
185.
Revenue management (RM) enhances the revenues of a company by means of demand-management decisions. An RM system must take into account the possibility that a booking may be canceled, or that a booked customer may fail to show up at the time of service (no-show). We review the Passenger Name Record data mining based cancellation rate forecasting models proposed in the literature, which mainly address the no-show case. Using a real-world dataset, we illustrate how the set of relevant variables to describe cancellation behavior is very different in different stages of the booking horizon, which not only confirms the dynamic aspect of this problem, but will also help revenue managers better understand the drivers of cancellation. Finally, we examine the performance of the state-of-the-art data mining methods when applied to Passenger Name Record based cancellation rate forecasting.  相似文献   
186.
Various analytic approaches have been developed to solve the famous Landau-Zener (LZ) problem. Here, we introduce a time-evolution operator method to investigate such a problem by numerically solving the induced algebraic equations (by Runge-Kutta method). Based on these calculations, transitions between two levels driven by various time-dependent external fields can be simulated in detail, typically near the so-called avoided crossing points. Far from these points, our results reduce to the original Landau-Zener transition (LZT).  相似文献   
187.
Dependence and the asymptotic behavior of large claims reinsurance   总被引:1,自引:0,他引:1  
We consider an extension of the classical compound Poisson risk model, where the waiting time between two consecutive claims and the forthcoming claim are no longer independent. Asymptotic tail probabilities of the reinsurance amount under ECOMOR and LCR treaties are obtained. Simulation results are provided in order to illustrate this.  相似文献   
188.
In this paper, it is assumed that an insurer with a jump-diffusion risk process would invest its surplus in a bond market, and the interest structure of the bond market is assumed to follow the Vasicek interest model. This paper focuses on the studying of the ruin problems in the above compounded process. In this compounded risk model, ruin may be caused by a claim or oscillation. We decompose the ruin probability for the compounded risk process into two probabilities: the probability that ruin caused by a claim and the probability that ruin caused by oscillation. Integro-differential equations for these ruin probabilities are derived. When the claim sizes are exponentially distributed, the above-mentioned integro-differential equations can be reduced into a three-order partial differential equation.  相似文献   
189.
It is applied the interpolation procedure to calculate the stationary probability distribution of colored-gain-noise model of a single-mode dye laser which operates above threshold with correlation time τ covering a very wide rang. By use of Stochastic Runge-Kutta Algorithm, it also has carried out numerical simulations of the steady-state properties. Comparing the results of the interpolation procedure and the unified colored-noise approximation with simulation results, the agreement between the results of the interpolation procedure and simulation results is much better than that of the unified colored-noise approximation when correlation time τ covers range from moderate to large.  相似文献   
190.
Computing semiparametric bounds for option prices is a widely studied pricing technique. In contrast to parametric pricing techniques, such as Monte-Carlo simulations, semiparametric pricing techniques do not require strong assumptions about the underlying asset price distribution. We extend classical results in this area. Specifically, we derive closed-form semiparametric bounds for the payoff of a European call option, given up to third-order moment (i.e., mean, variance, and skewness) information on the underlying asset price. We analyze how these bounds tighten the corresponding bounds, when only second-order moment (i.e., mean and variance) information is provided. We describe applications of these results in the context of option pricing; as well as in other areas such as inventory management, and actuarial science.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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