全文获取类型
收费全文 | 5385篇 |
免费 | 360篇 |
国内免费 | 521篇 |
专业分类
化学 | 407篇 |
晶体学 | 4篇 |
力学 | 334篇 |
综合类 | 123篇 |
数学 | 4997篇 |
物理学 | 401篇 |
出版年
2024年 | 5篇 |
2023年 | 61篇 |
2022年 | 85篇 |
2021年 | 101篇 |
2020年 | 113篇 |
2019年 | 113篇 |
2018年 | 132篇 |
2017年 | 136篇 |
2016年 | 136篇 |
2015年 | 106篇 |
2014年 | 214篇 |
2013年 | 365篇 |
2012年 | 237篇 |
2011年 | 299篇 |
2010年 | 270篇 |
2009年 | 368篇 |
2008年 | 367篇 |
2007年 | 343篇 |
2006年 | 337篇 |
2005年 | 269篇 |
2004年 | 237篇 |
2003年 | 278篇 |
2002年 | 236篇 |
2001年 | 211篇 |
2000年 | 180篇 |
1999年 | 177篇 |
1998年 | 180篇 |
1997年 | 157篇 |
1996年 | 97篇 |
1995年 | 73篇 |
1994年 | 58篇 |
1993年 | 51篇 |
1992年 | 37篇 |
1991年 | 28篇 |
1990年 | 22篇 |
1989年 | 13篇 |
1988年 | 16篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 24篇 |
1984年 | 22篇 |
1983年 | 12篇 |
1982年 | 22篇 |
1981年 | 16篇 |
1980年 | 19篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有6266条查询结果,搜索用时 0 毫秒
71.
Joachim Gwinner 《Optimization》2018,67(7):1017-1030
AbstractThis paper is concerned with elliptic variational inequalities that depend on two parameters. First, we investigate the dependence of the solution of the forward problem on these parameters and prove a Lipschitz estimate. Then, we study the inverse problem of identification of these two parameters and formulate two optimization approaches to this parameter identification problem. We extend the output least-squares approach, provide an existence result and establish a convergence result for finite-dimensional approximation. Further, we investigate the modified output least-squares approach which is based on energy functionals. This latter approach can be related to vector approximation. 相似文献
72.
A set D of vertices of a graph G = (V, E) is called a dominating set if every vertex of V not in D is adjacent to a vertex of D. In 1996, Reed proved that every graph of order n with minimum degree at least 3 has a dominating set of cardinality at most 3n/8. In this paper we generalize Reed's result. We show that every graph G of order n with minimum degree at least 2 has a dominating set of cardinality at most (3n +IV21)/8, where V2 denotes the set of vertices of degree 2 in G. As an application of the above result, we show that for k ≥ 1, the k-restricted domination number rk (G, γ) ≤ (3n+5k)/8 for all graphs of order n with minimum degree at least 3. 相似文献
73.
We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?0‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel. 相似文献
74.
Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x
n)}, where {x
n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper. 相似文献
75.
V. A. Yudin 《Mathematical Notes》1998,63(2):279-282
76.
N. G. Karpova 《Mathematical Notes》1998,64(1):55-62
LetG be a domain in
n
,n2, letA be a connected complex (n–1)-dimensional submanifold ofG, and let be a plurisubharmonic function inGA. We obtain conditions on the growth of that guarantee the local boundedness of at a point a A G and the existence of a plurisubharmonic extension of toG.Translated fromMatematicheskie Zametki, Vol. 64, No. 1, pp. 64–72, July, 1998.The author wishes to express her gratitude to Professor E. M. Chirka for numerous useful discussions and for his assistance in writing the present text. 相似文献
77.
Jan Kyn?l 《Discrete Mathematics》2008,308(19):4315-4321
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length . We disprove a conjecture of Erd?s by constructing an example without any such path of length greater than . 相似文献
78.
We construct a Sidon set A [1,N] which has (N log N)1/3 elements and which is maximal in the sense that the inclusion of any other integer from [1, N] destroys the Sidon property. 相似文献
79.
Sébastien Verel Arnaud Liefooghe Laetitia Jourdan Clarisse Dhaenens 《European Journal of Operational Research》2013
The structure of the search space explains the behavior of multiobjective search algorithms, and helps to design well-performing approaches. In this work, we analyze the properties of multiobjective combinatorial search spaces, and we pay a particular attention to the correlation between the objective functions. To do so, we extend the multiobjective NK-landscapes in order to take the objective correlation into account. We study the co-influence of the problem dimension, the degree of non-linearity, the number of objectives, and the objective correlation on the structure of the Pareto optimal set, in terms of cardinality and number of supported solutions, as well as on the number of Pareto local optima. This work concludes with guidelines for the design of multiobjective local search algorithms, based on the main fitness landscape features. 相似文献
80.
The robust optimization methodology is known as a popular method dealing with optimization problems with uncertain data and hard constraints. This methodology has been applied so far to various convex conic optimization problems where only their inequality constraints are subject to uncertainty. In this paper, the robust optimization methodology is applied to the general nonlinear programming (NLP) problem involving both uncertain inequality and equality constraints. The uncertainty set is defined by conic representable sets, the proposed uncertainty set is general enough to include many uncertainty sets, which have been used in literature, as special cases. The robust counterpart (RC) of the general NLP problem is approximated under this uncertainty set. It is shown that the resulting approximate RC of the general NLP problem is valid in a small neighborhood of the nominal value. Furthermore a rather general class of programming problems is posed that the robust counterparts of its problems can be derived exactly under the proposed uncertainty set. Our results show the applicability of robust optimization to a wider area of real applications and theoretical problems with more general uncertainty sets than those considered so far. The resulting robust counterparts which are traditional optimization problems make it possible to use existing algorithms of mathematical optimization to solve more complicated and general robust optimization problems. 相似文献