全文获取类型
收费全文 | 7981篇 |
免费 | 971篇 |
国内免费 | 591篇 |
专业分类
化学 | 615篇 |
晶体学 | 17篇 |
力学 | 648篇 |
综合类 | 220篇 |
数学 | 3498篇 |
物理学 | 4545篇 |
出版年
2024年 | 10篇 |
2023年 | 49篇 |
2022年 | 210篇 |
2021年 | 206篇 |
2020年 | 176篇 |
2019年 | 169篇 |
2018年 | 201篇 |
2017年 | 292篇 |
2016年 | 329篇 |
2015年 | 279篇 |
2014年 | 524篇 |
2013年 | 599篇 |
2012年 | 382篇 |
2011年 | 479篇 |
2010年 | 406篇 |
2009年 | 461篇 |
2008年 | 561篇 |
2007年 | 541篇 |
2006年 | 482篇 |
2005年 | 425篇 |
2004年 | 359篇 |
2003年 | 361篇 |
2002年 | 331篇 |
2001年 | 222篇 |
2000年 | 220篇 |
1999年 | 201篇 |
1998年 | 184篇 |
1997年 | 167篇 |
1996年 | 148篇 |
1995年 | 110篇 |
1994年 | 82篇 |
1993年 | 59篇 |
1992年 | 55篇 |
1991年 | 43篇 |
1990年 | 38篇 |
1989年 | 32篇 |
1988年 | 26篇 |
1987年 | 23篇 |
1986年 | 19篇 |
1985年 | 17篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1976年 | 4篇 |
1959年 | 5篇 |
1936年 | 3篇 |
排序方式: 共有9543条查询结果,搜索用时 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.
在摄像机进行航拍的图像处理系统中,由摄像机运动所引起的视频运动,背景变化是主要特点。在进行图像采集时,每个像素都在变化,采用传统的图像编码方式进行图像压缩,压缩效果比较差。提出了基于块分割的精确运动估计算法,它是一种很好的图像压缩方法。 相似文献
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.
Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast. 相似文献
10.