全文获取类型
收费全文 | 23327篇 |
免费 | 1215篇 |
国内免费 | 2573篇 |
专业分类
化学 | 10206篇 |
晶体学 | 185篇 |
力学 | 1018篇 |
综合类 | 382篇 |
数学 | 8775篇 |
物理学 | 6549篇 |
出版年
2024年 | 22篇 |
2023年 | 165篇 |
2022年 | 278篇 |
2021年 | 249篇 |
2020年 | 359篇 |
2019年 | 420篇 |
2018年 | 367篇 |
2017年 | 479篇 |
2016年 | 522篇 |
2015年 | 401篇 |
2014年 | 721篇 |
2013年 | 1690篇 |
2012年 | 1113篇 |
2011年 | 1122篇 |
2010年 | 1053篇 |
2009年 | 1519篇 |
2008年 | 1603篇 |
2007年 | 1694篇 |
2006年 | 1471篇 |
2005年 | 1179篇 |
2004年 | 1149篇 |
2003年 | 1002篇 |
2002年 | 869篇 |
2001年 | 737篇 |
2000年 | 1458篇 |
1999年 | 1100篇 |
1998年 | 1019篇 |
1997年 | 467篇 |
1996年 | 425篇 |
1995年 | 344篇 |
1994年 | 336篇 |
1993年 | 282篇 |
1992年 | 259篇 |
1991年 | 188篇 |
1990年 | 147篇 |
1989年 | 121篇 |
1988年 | 92篇 |
1987年 | 92篇 |
1986年 | 61篇 |
1985年 | 86篇 |
1984年 | 55篇 |
1983年 | 41篇 |
1982年 | 57篇 |
1981年 | 70篇 |
1980年 | 37篇 |
1979年 | 38篇 |
1978年 | 43篇 |
1977年 | 31篇 |
1976年 | 23篇 |
1973年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
Jan P. Boroński 《Topology and its Applications》2007,154(18):3156-3166
A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n-dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of the triangulation. Each element of the subcollection contains the vertices v and u such that f(v)f(u)?0. 相似文献
102.
We study the existence and the continuity properties of the boundary values on the real axis of the resolvent of a self-adjoint operator H in the framework of the conjugate operator method initiated by Mourre. We allow the conjugate operator A to be the generator of a C0-semigroup (finer estimates require A to be maximal symmetric) and we consider situations where the first commutator [H,iA] is not comparable to H. The applications include the spectral theory of zero mass quantum field models. 相似文献
103.
T. Domínguez Benavides 《Journal of Mathematical Analysis and Applications》2004,291(1):100-108
Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping. 相似文献
104.
Pingan Zeng Jiaquan Liu Yuxia Guo 《Journal of Mathematical Analysis and Applications》2004,300(1):102-128
In this paper, by using the Morse index theory for strongly indefinite functionals developed in [Nonlinear Anal. TMA, in press], we compute precisely the critical groups at the origin and at infinity, respectively. The abstract theorems are used to study the existence (multiplicity) of nontrivial periodical solutions for asymptotically wave equation and beam equation with resonance both at infinity and at zero. 相似文献
105.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
106.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献
107.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
108.
In this paper, by the use of a fixed point theorem, many new necessary and sufficient conditions for the existence of positive solutions in C[0,1]∩C1[0,1]∩C2(0,1) or C[0,1]∩C2(0,1) are presented for singular superlinear and sublinear second-order boundary value problems. Singularities at t=0, t=1 will be discussed. 相似文献
109.
Zhimin He 《Journal of Mathematical Analysis and Applications》2004,296(1):97-109
In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered. 相似文献
110.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献