首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   807篇
  免费   20篇
  国内免费   14篇
化学   483篇
晶体学   7篇
力学   42篇
数学   119篇
物理学   190篇
  2023年   6篇
  2022年   16篇
  2021年   16篇
  2020年   19篇
  2019年   16篇
  2018年   22篇
  2017年   14篇
  2016年   20篇
  2015年   17篇
  2014年   30篇
  2013年   47篇
  2012年   66篇
  2011年   53篇
  2010年   36篇
  2009年   29篇
  2008年   45篇
  2007年   47篇
  2006年   52篇
  2005年   38篇
  2004年   23篇
  2003年   36篇
  2002年   22篇
  2001年   12篇
  2000年   5篇
  1999年   8篇
  1998年   7篇
  1997年   8篇
  1996年   6篇
  1994年   7篇
  1993年   9篇
  1992年   9篇
  1991年   3篇
  1990年   9篇
  1989年   6篇
  1988年   4篇
  1987年   3篇
  1984年   5篇
  1983年   6篇
  1982年   3篇
  1981年   3篇
  1980年   6篇
  1974年   3篇
  1973年   4篇
  1970年   3篇
  1969年   3篇
  1968年   5篇
  1961年   4篇
  1960年   4篇
  1958年   3篇
  1948年   3篇
排序方式: 共有841条查询结果,搜索用时 15 毫秒
101.
We establish limit theorems involving weak convergence of multiple generations of critical and supercritical branching processes. These results arise naturally when dealing with the joint asymptotic behavior of functionals defined in terms of several generations of such processes. Applications of our main result include a functional central limit theorem (CLT), a Darling–Erdös result, and an extremal process result. The limiting process for our functional CLT is an infinite dimensional Brownian motion with sample paths in the infinite product space (C 0[0,1]), with the product topology, or in Banach subspaces of (C 0[0,1]) determined by norms related to the distribution of the population size of the branching process. As an application of this CLT we obtain a central limit theorem for ratios of weighted sums of generations of a branching processes, and also to various maximums of these generations. The Darling–Erdös result and the application to extremal distributions also include infinite-dimensional limit laws. Some branching process examples where the CLT fails are also included.  相似文献   
102.
103.
104.
105.
Information Geometry is a useful tool to study and compare the solutions of a Stochastic Differential Equations (SDEs) for non-equilibrium systems. As an alternative method to solving the Fokker–Planck equation, we propose a new method to calculate time-dependent probability density functions (PDFs) and to study Information Geometry using Monte Carlo (MC) simulation of SDEs. Specifically, we develop a new MC SDE method to overcome the challenges in calculating a time-dependent PDF and information geometric diagnostics and to speed up simulations by utilizing GPU computing. Using MC SDE simulations, we reproduce Information Geometric scaling relations found from the Fokker–Planck method for the case of a stochastic process with linear and cubic damping terms. We showcase the advantage of MC SDE simulation over FPE solvers by calculating unequal time joint PDFs. For the linear process with a linear damping force, joint PDF is found to be a Gaussian. In contrast, for the cubic process with a cubic damping force, joint PDF exhibits a bimodal structure, even in a stationary state. This suggests a finite memory time induced by a nonlinear force. Furthermore, several power-law scalings in the characteristics of bimodal PDFs are identified and investigated.  相似文献   
106.
V K Gupta  A Wadhwa  J D Anand 《Pramana》1995,45(2):195-208
We evaluate the emissivity rates for d-decay and s-decay by exactly solving the angular integrals involved and without assuming the degeneracy of electrons. We have also studied the effects of QCD coupling constant as well as the s-quark mass on the emissivity rates. We find that these parameters are important in determining the threshold and extinction densities for d- and s-decays.  相似文献   
107.
108.
Distributed computing systems are becoming bigger and more complex. Although the complexity of large‐scale distributed systems has been acknowledged to be an important challenge, there has not been much work in defining or measuring system complexity. Thus, today, it is difficult to compare the complexities of different systems, or to state that one system is easier to program, to manage, or to use than another. In this article, we try to understand the factors that cause computing systems to appear very complex to people. We define different aspects of system complexity and propose metrics for measuring these aspects. We also show how these aspects affect different kinds of people—viz. developers, administrators, and end‐users. On the basis of the aspects and metrics of complexity that we identify, we propose general guidelines that can help reduce the complexity of systems. © 2007 Wiley Periodicals, Inc. Complexity 12: 37–45, 2007  相似文献   
109.
Sb-doped silica EDF showed an opposite temperature dependent gain profile compared to Al-doped silica EDF. Concatenation of those two EDFs showed a gain variation less than ± 0.4 dB over 40nm of C-band with the 15dB gain, in the temperature range of - 40 to + 80℃.  相似文献   
110.
Radio astronomical data available on the galactic background radiation has been carefully examined to deduce information on the existence or otherwise of a Galactic Radio Halo. It is shown that, though considerable doubt has been recently expressed by some regarding its existence, no convincing and quantitative reasoning has been so far advanced towards this; on the other hand, there are substantial arguments in its favour.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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