全文获取类型
收费全文 | 5320篇 |
免费 | 626篇 |
国内免费 | 699篇 |
专业分类
化学 | 2153篇 |
晶体学 | 62篇 |
力学 | 974篇 |
综合类 | 51篇 |
数学 | 2513篇 |
物理学 | 892篇 |
出版年
2024年 | 25篇 |
2023年 | 67篇 |
2022年 | 128篇 |
2021年 | 152篇 |
2020年 | 227篇 |
2019年 | 190篇 |
2018年 | 200篇 |
2017年 | 161篇 |
2016年 | 241篇 |
2015年 | 189篇 |
2014年 | 259篇 |
2013年 | 384篇 |
2012年 | 252篇 |
2011年 | 258篇 |
2010年 | 238篇 |
2009年 | 297篇 |
2008年 | 333篇 |
2007年 | 301篇 |
2006年 | 316篇 |
2005年 | 291篇 |
2004年 | 232篇 |
2003年 | 264篇 |
2002年 | 199篇 |
2001年 | 162篇 |
2000年 | 167篇 |
1999年 | 152篇 |
1998年 | 132篇 |
1997年 | 129篇 |
1996年 | 109篇 |
1995年 | 73篇 |
1994年 | 69篇 |
1993年 | 55篇 |
1992年 | 50篇 |
1991年 | 41篇 |
1990年 | 35篇 |
1989年 | 29篇 |
1988年 | 32篇 |
1987年 | 20篇 |
1986年 | 18篇 |
1985年 | 32篇 |
1984年 | 25篇 |
1983年 | 6篇 |
1982年 | 25篇 |
1981年 | 20篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 11篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有6645条查询结果,搜索用时 15 毫秒
31.
New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered. 相似文献
32.
We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II11 reflection (or ∑1-compactness). We show that admissible sets such as H(ω2) and Lω2 which fail to have strict-II11 reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75. 相似文献
33.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
34.
35.
Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes. 相似文献
36.
Teruyuki Yorioka 《Mathematical Logic Quarterly》2006,52(2):203-216
We prove the iteration lemmata, which are the key lemmata to show that extensions by Pmax variations satisfy absoluteness for Π2-statements in the structure 〈H (ω 2), ∈, NSω 1, R 〉 for some set R of reals in L (ℝ), for the following statements: (1) The cofinality of the null ideal is ℵ1. (2) There exists a good basis of the strong measure zero ideal. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
37.
Mitre C. Dourado Fábio Protti Jayme L. Szwarcfiter 《Discrete Applied Mathematics》2007,155(18):2435-2443
Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard. 相似文献
38.
Amitabha Tripathi 《Discrete Applied Mathematics》2007,155(5):670-671
For a finite simple graph G, we denote the set of degrees of its vertices, known as its degree set, by D(G). Kapoor, Polimeni and Wall [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] have determined the least number of vertices among graphs with a given degree set. We give a very short proof of this result. 相似文献
39.
E. Alper Yildirim Xiaofei Fan-Orzechowski 《Computational Optimization and Applications》2006,33(2-3):229-247
We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions
of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph
to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable
set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite
formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex
that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure
is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly
rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start
strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently
extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality.
This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author
was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA. 相似文献
40.