全文获取类型
收费全文 | 4192篇 |
免费 | 416篇 |
国内免费 | 273篇 |
专业分类
化学 | 270篇 |
晶体学 | 1篇 |
力学 | 187篇 |
综合类 | 140篇 |
数学 | 3847篇 |
物理学 | 436篇 |
出版年
2024年 | 5篇 |
2023年 | 27篇 |
2022年 | 77篇 |
2021年 | 110篇 |
2020年 | 74篇 |
2019年 | 81篇 |
2018年 | 74篇 |
2017年 | 135篇 |
2016年 | 179篇 |
2015年 | 107篇 |
2014年 | 250篇 |
2013年 | 263篇 |
2012年 | 198篇 |
2011年 | 213篇 |
2010年 | 195篇 |
2009年 | 274篇 |
2008年 | 292篇 |
2007年 | 250篇 |
2006年 | 238篇 |
2005年 | 236篇 |
2004年 | 171篇 |
2003年 | 187篇 |
2002年 | 155篇 |
2001年 | 130篇 |
2000年 | 119篇 |
1999年 | 103篇 |
1998年 | 119篇 |
1997年 | 85篇 |
1996年 | 80篇 |
1995年 | 51篇 |
1994年 | 39篇 |
1993年 | 36篇 |
1992年 | 40篇 |
1991年 | 24篇 |
1990年 | 20篇 |
1989年 | 27篇 |
1988年 | 23篇 |
1987年 | 6篇 |
1986年 | 8篇 |
1985年 | 43篇 |
1984年 | 24篇 |
1983年 | 12篇 |
1982年 | 19篇 |
1981年 | 19篇 |
1980年 | 22篇 |
1979年 | 17篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1959年 | 2篇 |
排序方式: 共有4881条查询结果,搜索用时 31 毫秒
41.
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. 相似文献
42.
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) 相似文献
43.
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. 相似文献
44.
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. 相似文献
45.
刘国志 《数学的实践与认识》2006,36(12):1-5
提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果. 相似文献
46.
为改进Fuzzy HX环的结果,使之包含Fuzzy商环,提出了弱Fuzzy HX环的概念,研究了它的性质与结构,并重新讨论了拟Fuzzy商环,证明了在正则条件下拟Fuzzy商环与弱Fuzzy HX环的统一性:同时也得到了一致弱Fuzzy HX环与普通Fuzzy商环的关系。 相似文献
47.
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. 相似文献
48.
M. W. Warner 《Fuzzy Sets and Systems》1989,30(3):321-327
An amended proof of a theorem of Franklin's on sequentiality and sequential compactness is presented, and a corresponding fuzzy version formulated using the theory of quasi-coincidence. 相似文献
49.
50.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献