全文获取类型
收费全文 | 4716篇 |
免费 | 370篇 |
国内免费 | 449篇 |
专业分类
化学 | 622篇 |
晶体学 | 5篇 |
力学 | 235篇 |
综合类 | 76篇 |
数学 | 3619篇 |
物理学 | 978篇 |
出版年
2024年 | 6篇 |
2023年 | 43篇 |
2022年 | 85篇 |
2021年 | 83篇 |
2020年 | 120篇 |
2019年 | 117篇 |
2018年 | 131篇 |
2017年 | 142篇 |
2016年 | 144篇 |
2015年 | 105篇 |
2014年 | 207篇 |
2013年 | 474篇 |
2012年 | 172篇 |
2011年 | 254篇 |
2010年 | 226篇 |
2009年 | 238篇 |
2008年 | 336篇 |
2007年 | 298篇 |
2006年 | 282篇 |
2005年 | 249篇 |
2004年 | 213篇 |
2003年 | 204篇 |
2002年 | 210篇 |
2001年 | 157篇 |
2000年 | 151篇 |
1999年 | 146篇 |
1998年 | 133篇 |
1997年 | 100篇 |
1996年 | 82篇 |
1995年 | 58篇 |
1994年 | 61篇 |
1993年 | 36篇 |
1992年 | 38篇 |
1991年 | 22篇 |
1990年 | 31篇 |
1989年 | 21篇 |
1988年 | 17篇 |
1987年 | 9篇 |
1986年 | 16篇 |
1985年 | 19篇 |
1984年 | 19篇 |
1983年 | 6篇 |
1982年 | 13篇 |
1981年 | 10篇 |
1980年 | 8篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 8篇 |
1973年 | 3篇 |
排序方式: 共有5535条查询结果,搜索用时 62 毫秒
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.
7.
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. 相似文献
8.
Annegret K. Wagler 《Mathematical Methods of Operations Research》2002,56(1):127-149
An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two
superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how
far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph
of a bipartite graph or from the complement of such a graph. 相似文献
9.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
10.