全文获取类型
收费全文 | 21374篇 |
免费 | 2494篇 |
国内免费 | 1536篇 |
专业分类
化学 | 4219篇 |
晶体学 | 71篇 |
力学 | 2292篇 |
综合类 | 399篇 |
数学 | 13044篇 |
物理学 | 5379篇 |
出版年
2024年 | 39篇 |
2023年 | 171篇 |
2022年 | 312篇 |
2021年 | 394篇 |
2020年 | 492篇 |
2019年 | 510篇 |
2018年 | 523篇 |
2017年 | 659篇 |
2016年 | 704篇 |
2015年 | 537篇 |
2014年 | 922篇 |
2013年 | 1550篇 |
2012年 | 984篇 |
2011年 | 1011篇 |
2010年 | 977篇 |
2009年 | 1166篇 |
2008年 | 1306篇 |
2007年 | 1357篇 |
2006年 | 1254篇 |
2005年 | 1198篇 |
2004年 | 981篇 |
2003年 | 888篇 |
2002年 | 1026篇 |
2001年 | 825篇 |
2000年 | 725篇 |
1999年 | 676篇 |
1998年 | 613篇 |
1997年 | 492篇 |
1996年 | 470篇 |
1995年 | 395篇 |
1994年 | 315篇 |
1993年 | 262篇 |
1992年 | 229篇 |
1991年 | 206篇 |
1990年 | 139篇 |
1989年 | 120篇 |
1988年 | 108篇 |
1987年 | 102篇 |
1986年 | 103篇 |
1985年 | 112篇 |
1984年 | 104篇 |
1983年 | 42篇 |
1982年 | 86篇 |
1981年 | 66篇 |
1980年 | 52篇 |
1979年 | 58篇 |
1978年 | 38篇 |
1977年 | 22篇 |
1976年 | 23篇 |
1974年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
141.
Some previous works show that symmetric fixed- and variable-stepsize linear multistep methods for second-order systems which do not have any parasitic root in their first characteristic polynomial give rise to a slow error growth with time when integrating reversible systems. In this paper, we give a technique to construct variable-stepsize symmetric methods from their fixed-stepsize counterparts, in such a way that the former have the same order as the latter. The order and symmetry of the integrators obtained is proved independently of the order of the underlying fixed-stepsize integrators. As this technique looks for efficiency, we concentrate on explicit linear multistep methods, which just make one function evaluation per step, and we offer some numerical comparisons with other one-step adaptive methods which also show a good long-term behaviour.
142.
L. D. Popov 《Central European Journal of Mathematics》2004,2(1):76-86
For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type
is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the
original problem is copositive plus or belongs to the intersection of matrix classes P
0 and Q
0. 相似文献
143.
We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
144.
145.
In this paper, we study the linearization of the Cauchy problem and the mixed problem for the system of Grad--Hermite moments in nonequilibrium thermodynamics in the neighborhood of the equilibrium state. Stability conditions for solutions of the Cauchy problem are proved as a generalization of the classical Hermite--Biller theorem on stable polynomials. For the mixed problem, we prove an analog of the Vishik--Lyusternik theorem on small singular perturbations of general elliptic problems. The last observation allows us to introduce the Shapiro--Lopatinskii condition, which implies the well-posedness of the mixed problem. 相似文献
146.
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows 总被引:6,自引:0,他引:6
Michael Polacek Richard F. Hartl Karl Doerner Marc Reimann 《Journal of Heuristics》2004,10(6):613-627
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times. 相似文献
147.
Manuel Ritoré Cé sar Rosales 《Transactions of the American Mathematical Society》2004,356(11):4601-4622
We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.
We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.
148.
林诒勋 《高校应用数学学报(英文版)》2003,18(3):361-369
§ 1 IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th… 相似文献
149.
构造一个求解椭圆型边值问题的多子域D—N交替算法,导出对应的容度方程和等价的迭代法,证明算法的收敛性。 相似文献
150.
In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.