全文获取类型
收费全文 | 5157篇 |
免费 | 544篇 |
国内免费 | 585篇 |
专业分类
化学 | 1298篇 |
晶体学 | 4篇 |
力学 | 243篇 |
综合类 | 151篇 |
数学 | 3298篇 |
物理学 | 1292篇 |
出版年
2024年 | 4篇 |
2023年 | 59篇 |
2022年 | 101篇 |
2021年 | 119篇 |
2020年 | 122篇 |
2019年 | 102篇 |
2018年 | 107篇 |
2017年 | 104篇 |
2016年 | 138篇 |
2015年 | 93篇 |
2014年 | 526篇 |
2013年 | 614篇 |
2012年 | 326篇 |
2011年 | 494篇 |
2010年 | 408篇 |
2009年 | 458篇 |
2008年 | 388篇 |
2007年 | 285篇 |
2006年 | 228篇 |
2005年 | 206篇 |
2004年 | 198篇 |
2003年 | 165篇 |
2002年 | 181篇 |
2001年 | 121篇 |
2000年 | 112篇 |
1999年 | 107篇 |
1998年 | 119篇 |
1997年 | 68篇 |
1996年 | 60篇 |
1995年 | 50篇 |
1994年 | 37篇 |
1993年 | 27篇 |
1992年 | 23篇 |
1991年 | 13篇 |
1990年 | 20篇 |
1989年 | 16篇 |
1988年 | 9篇 |
1987年 | 4篇 |
1986年 | 10篇 |
1985年 | 11篇 |
1984年 | 9篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1976年 | 3篇 |
1973年 | 3篇 |
1959年 | 2篇 |
1936年 | 3篇 |
排序方式: 共有6286条查询结果,搜索用时 31 毫秒
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.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice. 相似文献
3.
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. 相似文献
4.
5.
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.
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.