全文获取类型
收费全文 | 19717篇 |
免费 | 777篇 |
国内免费 | 1077篇 |
专业分类
化学 | 2313篇 |
晶体学 | 41篇 |
力学 | 422篇 |
综合类 | 93篇 |
数学 | 4783篇 |
物理学 | 2083篇 |
综合类 | 11836篇 |
出版年
2024年 | 30篇 |
2023年 | 133篇 |
2022年 | 176篇 |
2021年 | 214篇 |
2020年 | 234篇 |
2019年 | 289篇 |
2018年 | 249篇 |
2017年 | 346篇 |
2016年 | 325篇 |
2015年 | 413篇 |
2014年 | 949篇 |
2013年 | 1102篇 |
2012年 | 1025篇 |
2011年 | 1205篇 |
2010年 | 1120篇 |
2009年 | 1354篇 |
2008年 | 1319篇 |
2007年 | 1344篇 |
2006年 | 1248篇 |
2005年 | 1099篇 |
2004年 | 926篇 |
2003年 | 827篇 |
2002年 | 754篇 |
2001年 | 680篇 |
2000年 | 587篇 |
1999年 | 479篇 |
1998年 | 421篇 |
1997年 | 373篇 |
1996年 | 299篇 |
1995年 | 255篇 |
1994年 | 236篇 |
1993年 | 202篇 |
1992年 | 186篇 |
1991年 | 133篇 |
1990年 | 124篇 |
1989年 | 158篇 |
1988年 | 133篇 |
1987年 | 77篇 |
1986年 | 51篇 |
1985年 | 64篇 |
1984年 | 54篇 |
1983年 | 24篇 |
1982年 | 52篇 |
1981年 | 59篇 |
1980年 | 70篇 |
1979年 | 55篇 |
1978年 | 28篇 |
1977年 | 29篇 |
1976年 | 22篇 |
1973年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
In this paper, the notion of gap functions is extended from scalar case to vector one. Then, gap functions and generalized
functions for several kinds of vector equilibrium problems are shown. As an application, the dual problem of a class of optimization
problems with a system of vector equilibrium constraints (in short, OP) is established, the concavity of the dual function,
the weak duality of (OP) and the saddle point sufficient condition are derived by using generalized gap functions.
This work was supported by the National Natural Science Foundation of China (10671135) and the Applied Research Project of
Sichuan Province (05JY029-009-1). 相似文献
103.
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. 相似文献
104.
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) 相似文献
105.
工况图在热电厂的设计和运行中具有广泛的用途。本文根据引进型双抽非再热200MW供热机组的技术特点,通过编程在纯凝汽工况、单抽工业抽汽工况、单抽采暖抽汽工况和双抽供热等典型变工况计算的基础上,完成了当新蒸汽负荷、工业抽汽负荷和采暖抽汽负荷发生改变时的变工况计算,并绘制了该机组的运行工况图. 相似文献
106.
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. 相似文献
107.
I. P. Rochev 《Mathematical Notes》2007,81(1-2):247-259
We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points. 相似文献
108.
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. 相似文献
109.
本文讨论了生长曲线模型中多组数据对回归分析的联合影响问题,给出了度量准则及其化简式与统计解释,推广了已有文献中的有关结果. 相似文献
110.
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. 相似文献