全文获取类型
收费全文 | 9754篇 |
免费 | 1053篇 |
国内免费 | 705篇 |
专业分类
化学 | 1366篇 |
晶体学 | 21篇 |
力学 | 688篇 |
综合类 | 168篇 |
数学 | 7396篇 |
物理学 | 1873篇 |
出版年
2024年 | 17篇 |
2023年 | 74篇 |
2022年 | 110篇 |
2021年 | 164篇 |
2020年 | 210篇 |
2019年 | 227篇 |
2018年 | 225篇 |
2017年 | 284篇 |
2016年 | 317篇 |
2015年 | 224篇 |
2014年 | 433篇 |
2013年 | 740篇 |
2012年 | 511篇 |
2011年 | 508篇 |
2010年 | 469篇 |
2009年 | 586篇 |
2008年 | 613篇 |
2007年 | 601篇 |
2006年 | 589篇 |
2005年 | 526篇 |
2004年 | 447篇 |
2003年 | 383篇 |
2002年 | 417篇 |
2001年 | 379篇 |
2000年 | 327篇 |
1999年 | 336篇 |
1998年 | 257篇 |
1997年 | 229篇 |
1996年 | 189篇 |
1995年 | 164篇 |
1994年 | 130篇 |
1993年 | 106篇 |
1992年 | 100篇 |
1991年 | 86篇 |
1990年 | 64篇 |
1989年 | 54篇 |
1988年 | 44篇 |
1987年 | 48篇 |
1986年 | 42篇 |
1985年 | 50篇 |
1984年 | 54篇 |
1983年 | 17篇 |
1982年 | 34篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 24篇 |
1978年 | 11篇 |
1977年 | 15篇 |
1976年 | 11篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation. 相似文献
52.
L. Contesse-Becker 《Journal of Optimization Theory and Applications》1993,79(2):273-310
In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile). 相似文献
53.
谐振子薛定谔方程的简单解法 总被引:2,自引:0,他引:2
物质的许多物理与化学性质都可以用线性谐振子模型解释,本文用简单的数学运算求解线性谐振子的薛定谔方程,避免了特殊函数等复杂的数学运算,得出了量子力学教材完全相同的结果。 相似文献
54.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
55.
O. Yu. Dashkova 《Algebra and Logic》2007,46(5):297-302
We are concerned with infinite-dimensional locally soluble linear groups of infinite central dimension that are not soluble
A3-groups and all of whose proper subgroups, which are not soluble A3-groups, have finite central dimension. The structure of groups in this class is described. The case of infinite-dimensional
locally nilpotent linear groups satisfying the specified conditions is treated separately. A similar problem is solved for
infinite-dimensional locally soluble linear groups of infinite fundamental dimension that are not soluble A3-groups and all of whose proper subgroups, which are not soluble A3-groups, have finite fundamental dimension.
__________
Translated from Algebra i Logika, Vol. 46, No. 5, pp. 548–559, September–October, 2007. 相似文献
56.
We study problems of interpolation of positive linear operators in couples of ordered Banach spaces. From this viewpoint, we study couples of noncommutative spaces L 1, L ∞ associated with weights and traces on von Neumann algebras. 相似文献
57.
Juan Pablo Vielma 《Operations Research Letters》2007,35(1):29-35
Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel. 相似文献
58.
J. MALINEN O. NEVANLINNA V. TURUNEN Z. YUAN 《数学学报(英文版)》2007,23(4):745-748
Let T be a bounded linear operator in a Banach space, with σ(T)={1}. In 1983, Esterle-Berkani' s conjecture was proposed for the decay of differences (I - T) T^n as follows: Eitheror lim inf (n→∞(n+1)||(I-T)T^n||≥1/e or T = I. We prove this claim and discuss some of its consequences. 相似文献
59.
In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions. 相似文献
60.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献