全文获取类型
收费全文 | 4906篇 |
免费 | 415篇 |
国内免费 | 411篇 |
专业分类
化学 | 215篇 |
晶体学 | 3篇 |
力学 | 537篇 |
综合类 | 71篇 |
数学 | 3922篇 |
物理学 | 984篇 |
出版年
2024年 | 10篇 |
2023年 | 54篇 |
2022年 | 67篇 |
2021年 | 72篇 |
2020年 | 124篇 |
2019年 | 130篇 |
2018年 | 152篇 |
2017年 | 148篇 |
2016年 | 176篇 |
2015年 | 119篇 |
2014年 | 263篇 |
2013年 | 447篇 |
2012年 | 210篇 |
2011年 | 305篇 |
2010年 | 258篇 |
2009年 | 269篇 |
2008年 | 345篇 |
2007年 | 306篇 |
2006年 | 280篇 |
2005年 | 257篇 |
2004年 | 214篇 |
2003年 | 209篇 |
2002年 | 200篇 |
2001年 | 160篇 |
2000年 | 160篇 |
1999年 | 149篇 |
1998年 | 139篇 |
1997年 | 96篇 |
1996年 | 76篇 |
1995年 | 59篇 |
1994年 | 50篇 |
1993年 | 31篇 |
1992年 | 21篇 |
1991年 | 17篇 |
1990年 | 30篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 13篇 |
1984年 | 13篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1973年 | 3篇 |
1936年 | 2篇 |
排序方式: 共有5732条查询结果,搜索用时 625 毫秒
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.
6.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献
7.
The existence and occurrence, especially by a backward bifurcation, of endemic equilibria is of utmost importance in determining the spread and persistence of a disease. In many epidemiological models, the equation for the endemic equilibria is quadratic, with the coefficients determined by the parameters of the model. Despite its apparent simplicity, such an equation can describe an amazing number of dynamical behaviors. In this paper, we shall provide a comprehensive survey of possible bifurcation patterns, deriving explicit conditions on the equation's parameters for the occurrence of each of them, and discuss illustrative examples. 相似文献
8.
9.
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.
10.
Volker Elling. 《Mathematics of Computation》2006,75(256):1721-1733
A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well posed.