全文获取类型
收费全文 | 4727篇 |
免费 | 394篇 |
国内免费 | 386篇 |
专业分类
化学 | 446篇 |
晶体学 | 10篇 |
力学 | 564篇 |
综合类 | 85篇 |
数学 | 3254篇 |
物理学 | 1148篇 |
出版年
2024年 | 11篇 |
2023年 | 45篇 |
2022年 | 93篇 |
2021年 | 103篇 |
2020年 | 117篇 |
2019年 | 117篇 |
2018年 | 114篇 |
2017年 | 137篇 |
2016年 | 169篇 |
2015年 | 108篇 |
2014年 | 238篇 |
2013年 | 370篇 |
2012年 | 202篇 |
2011年 | 277篇 |
2010年 | 231篇 |
2009年 | 256篇 |
2008年 | 343篇 |
2007年 | 325篇 |
2006年 | 272篇 |
2005年 | 232篇 |
2004年 | 212篇 |
2003年 | 199篇 |
2002年 | 201篇 |
2001年 | 164篇 |
2000年 | 140篇 |
1999年 | 128篇 |
1998年 | 147篇 |
1997年 | 83篇 |
1996年 | 93篇 |
1995年 | 66篇 |
1994年 | 45篇 |
1993年 | 41篇 |
1992年 | 36篇 |
1991年 | 15篇 |
1990年 | 26篇 |
1989年 | 17篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 14篇 |
1985年 | 13篇 |
1984年 | 15篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1976年 | 5篇 |
1973年 | 8篇 |
1936年 | 2篇 |
排序方式: 共有5507条查询结果,搜索用时 15 毫秒
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.
5.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
6.
Mark L. Agranovsky E. K. Narayanan 《Proceedings of the American Mathematical Society》2006,134(7):2117-2123
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.
7.
8.
Blaise Faugeras Jé rô me Pousin Franck Fontvieille. 《Mathematics of Computation》2006,75(253):209-222
A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusion-dissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.
9.
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. 相似文献
10.