全文获取类型
收费全文 | 14584篇 |
免费 | 1264篇 |
国内免费 | 566篇 |
专业分类
化学 | 1578篇 |
晶体学 | 33篇 |
力学 | 1445篇 |
综合类 | 241篇 |
数学 | 11138篇 |
物理学 | 1979篇 |
出版年
2024年 | 29篇 |
2023年 | 153篇 |
2022年 | 323篇 |
2021年 | 412篇 |
2020年 | 319篇 |
2019年 | 327篇 |
2018年 | 371篇 |
2017年 | 486篇 |
2016年 | 475篇 |
2015年 | 336篇 |
2014年 | 629篇 |
2013年 | 918篇 |
2012年 | 789篇 |
2011年 | 700篇 |
2010年 | 659篇 |
2009年 | 831篇 |
2008年 | 868篇 |
2007年 | 975篇 |
2006年 | 788篇 |
2005年 | 672篇 |
2004年 | 542篇 |
2003年 | 530篇 |
2002年 | 510篇 |
2001年 | 454篇 |
2000年 | 412篇 |
1999年 | 346篇 |
1998年 | 351篇 |
1997年 | 297篇 |
1996年 | 231篇 |
1995年 | 238篇 |
1994年 | 193篇 |
1993年 | 164篇 |
1992年 | 146篇 |
1991年 | 120篇 |
1990年 | 102篇 |
1989年 | 83篇 |
1988年 | 78篇 |
1987年 | 54篇 |
1986年 | 57篇 |
1985年 | 76篇 |
1984年 | 71篇 |
1983年 | 21篇 |
1982年 | 41篇 |
1981年 | 34篇 |
1980年 | 38篇 |
1979年 | 43篇 |
1978年 | 30篇 |
1977年 | 41篇 |
1976年 | 23篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here. 相似文献
52.
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 相似文献
53.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
54.
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented. 相似文献
55.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
56.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
57.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
58.
Asaf Levin 《Operations Research Letters》2004,32(6):530-534
Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm. 相似文献
59.
Claudia Garetto 《Acta Appl Math》2004,80(2):123-174
The aim of this work is to develop a global calculus for pseudo-differential operators acting on suitable algebras of generalized functions. In particular, a condition of global hypoellipticity of the symbols gives a result of regularity for the corresponding pseudo-differential equations. This calculus and this frame are proposed as tools for the study in Colombeau algebras of partial differential equations globally defined on R
n
. 相似文献
60.
Toshihiro Kobayashi 《Mathematical Methods in the Applied Sciences》2004,27(1):79-89
This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献