全文获取类型
收费全文 | 5154篇 |
免费 | 403篇 |
国内免费 | 626篇 |
专业分类
化学 | 389篇 |
晶体学 | 12篇 |
力学 | 339篇 |
综合类 | 101篇 |
数学 | 4187篇 |
物理学 | 1155篇 |
出版年
2024年 | 10篇 |
2023年 | 40篇 |
2022年 | 74篇 |
2021年 | 90篇 |
2020年 | 112篇 |
2019年 | 117篇 |
2018年 | 125篇 |
2017年 | 132篇 |
2016年 | 149篇 |
2015年 | 105篇 |
2014年 | 226篇 |
2013年 | 495篇 |
2012年 | 199篇 |
2011年 | 284篇 |
2010年 | 247篇 |
2009年 | 261篇 |
2008年 | 387篇 |
2007年 | 352篇 |
2006年 | 332篇 |
2005年 | 264篇 |
2004年 | 243篇 |
2003年 | 259篇 |
2002年 | 250篇 |
2001年 | 202篇 |
2000年 | 182篇 |
1999年 | 178篇 |
1998年 | 187篇 |
1997年 | 125篇 |
1996年 | 109篇 |
1995年 | 82篇 |
1994年 | 71篇 |
1993年 | 42篇 |
1992年 | 31篇 |
1991年 | 22篇 |
1990年 | 39篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 11篇 |
1986年 | 20篇 |
1985年 | 13篇 |
1984年 | 21篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1976年 | 3篇 |
1973年 | 3篇 |
1936年 | 4篇 |
排序方式: 共有6183条查询结果,搜索用时 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.
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.
6.
Paul Bankston 《Archive for Mathematical Logic》2006,45(1):97-112
The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those
elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure
conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a
topological analogue and indicate some applications. 相似文献
7.
8.
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. 相似文献
9.
10.
设珮犠(狋):犚犖+ →犚犱是犖指标犱维广义Wiener过程,对任意紧集犈1,…,犈犿犚犖> ,该文研究了犿项代数和珮犠(犈1)…珮犠(犈犿)的Hausdorff维数,Packing维数和正的Lebesgue测度及内点的存在性. 其结果包含并推广了布朗单的结果. 相似文献