全文获取类型
收费全文 | 6572篇 |
免费 | 543篇 |
国内免费 | 497篇 |
专业分类
化学 | 285篇 |
晶体学 | 1篇 |
力学 | 270篇 |
综合类 | 180篇 |
数学 | 6330篇 |
物理学 | 546篇 |
出版年
2024年 | 6篇 |
2023年 | 41篇 |
2022年 | 101篇 |
2021年 | 136篇 |
2020年 | 107篇 |
2019年 | 123篇 |
2018年 | 115篇 |
2017年 | 199篇 |
2016年 | 245篇 |
2015年 | 162篇 |
2014年 | 341篇 |
2013年 | 379篇 |
2012年 | 321篇 |
2011年 | 294篇 |
2010年 | 271篇 |
2009年 | 396篇 |
2008年 | 412篇 |
2007年 | 405篇 |
2006年 | 384篇 |
2005年 | 362篇 |
2004年 | 292篇 |
2003年 | 296篇 |
2002年 | 266篇 |
2001年 | 227篇 |
2000年 | 246篇 |
1999年 | 189篇 |
1998年 | 213篇 |
1997年 | 179篇 |
1996年 | 126篇 |
1995年 | 91篇 |
1994年 | 79篇 |
1993年 | 71篇 |
1992年 | 68篇 |
1991年 | 48篇 |
1990年 | 43篇 |
1989年 | 35篇 |
1988年 | 37篇 |
1987年 | 16篇 |
1986年 | 15篇 |
1985年 | 54篇 |
1984年 | 37篇 |
1983年 | 16篇 |
1982年 | 29篇 |
1981年 | 31篇 |
1980年 | 30篇 |
1979年 | 23篇 |
1978年 | 19篇 |
1977年 | 13篇 |
1976年 | 7篇 |
1974年 | 6篇 |
排序方式: 共有7612条查询结果,搜索用时 0 毫秒
11.
B. F. Svaiter 《Proceedings of the American Mathematical Society》2003,131(12):3851-3859
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exists a convex representation of the operator which is a fixed point of this conjugation.
12.
Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration 总被引:9,自引:1,他引:8
Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C2 function [respectively, a lower C1 function]. 相似文献
13.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献
14.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
15.
HUYUDA MENGZHIQING 《高校应用数学学报(英文版)》1998,13(4):473-477
In this paper, the existence theorem of the cone-weak subdiflerential of set-valued mapping in locally convex topological vector space is proved. 相似文献
16.
We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence. 相似文献
17.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
18.
Liang-gen Hu 《应用数学学报(英文版)》2007,23(2):281-288
In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic. 相似文献
19.
In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent. 相似文献
20.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献