首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   39814篇
  免费   4427篇
  国内免费   4097篇
化学   14669篇
晶体学   157篇
力学   4872篇
综合类   394篇
数学   13890篇
物理学   14356篇
  2024年   109篇
  2023年   455篇
  2022年   897篇
  2021年   1066篇
  2020年   1358篇
  2019年   1189篇
  2018年   1218篇
  2017年   1394篇
  2016年   1538篇
  2015年   1359篇
  2014年   1985篇
  2013年   3682篇
  2012年   2158篇
  2011年   2414篇
  2010年   1906篇
  2009年   2509篇
  2008年   2570篇
  2007年   2475篇
  2006年   2149篇
  2005年   1882篇
  2004年   1527篇
  2003年   1471篇
  2002年   1310篇
  2001年   1031篇
  2000年   1091篇
  1999年   959篇
  1998年   834篇
  1997年   677篇
  1996年   540篇
  1995年   473篇
  1994年   396篇
  1993年   369篇
  1992年   348篇
  1991年   271篇
  1990年   277篇
  1989年   247篇
  1988年   233篇
  1987年   214篇
  1986年   177篇
  1985年   209篇
  1984年   209篇
  1983年   108篇
  1982年   163篇
  1981年   143篇
  1980年   114篇
  1979年   116篇
  1978年   96篇
  1977年   89篇
  1976年   78篇
  1973年   66篇
排序方式: 共有10000条查询结果,搜索用时 546 毫秒
71.
Sharp estimates (in the power scale) are obtained for the discretization error in the solutions to Poisson’s equation whose right-hand side belongs to a Korobov class. Compared to the well-known Korobov estimate, the order is almost doubled and has an ultimate value in the power scale.  相似文献   
72.
It is long known that the Fokker-Planck equation with prescribed constant coefficients of diffusion and linear friction describes the ensemble average of the stochastic evolutions in velocity space of a Brownian test particle immersed in a heat bath of fixed temperature. Apparently, it is not so well known that the same partial differential equation, but now with constant coefficients which are functionals of the solution itself rather than being prescribed, describes the kinetic evolution (in the N→∞ limit) of an isolated N-particle system with certain stochastic interactions. Here we discuss in detail this recently discovered interpretation. An erratum to this article can be found at  相似文献   
73.
Signed graphs for portfolio analysis in risk management   总被引:1,自引:0,他引:1  
We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable.  相似文献   
74.
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed.  相似文献   
75.
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.  相似文献   
76.
Let Ω be a symmetric cone. In this note, we introduce Hilbert's projective metric on Ω in terms of Jordan algebras and we apply it to prove that, given a linear invertible transformation g such that g(Ω) = Ω and a real number p, |p| 〉 1, there exists a unique element x ∈ Ω satisfying g(x) = x^p.  相似文献   
77.
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30  相似文献   
78.
The European Physical Journal A - The ω-meson photoproduction, γ + p→p + ω, is studied in the framework of a model, containing π-meson exchange in t-channel and...  相似文献   
79.
We investigate the dynamics of the Λ system driven by two resonant laser fields in presence of dissipation for coupling strengths where the rotating‐wave approximation starts to break down. This regime is characterised by Rabi frequencies being approximately equal or smaller than the field frequencies. A systematic procedure to obtain an expansion for the solution of the Bloch evolution equations of the system is presented. The lowest contribution results to be the well‐known rotating‐wave approximation. The method is based on a semi‐classical treatment of the problem, and its predictions are interpreted fully quantum mechanically. The theory is illustrated by a detailed study of the disappearance of coherent population trapping as the intensities of the fields increase.  相似文献   
80.
The Dirac optical potential for p-^14 Be elastic scattering is evaluated by the relativistic impulse approximation. Each of the real part and the imaginary part of the potential shows a pronounced “long tail” for the proton elastic scattering from halo nucleus ^14Be compared with the potentials for proton scattering from its adjacent nuclei ^12C and ^16O, which do not have halo structures.This kind of “long tail” phenomenon suggests another signature for halo nuclei.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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