全文获取类型
收费全文 | 14792篇 |
免费 | 1467篇 |
国内免费 | 1495篇 |
专业分类
化学 | 2023篇 |
晶体学 | 26篇 |
力学 | 840篇 |
综合类 | 239篇 |
数学 | 11925篇 |
物理学 | 2701篇 |
出版年
2024年 | 39篇 |
2023年 | 184篇 |
2022年 | 176篇 |
2021年 | 276篇 |
2020年 | 321篇 |
2019年 | 381篇 |
2018年 | 380篇 |
2017年 | 438篇 |
2016年 | 504篇 |
2015年 | 360篇 |
2014年 | 631篇 |
2013年 | 1151篇 |
2012年 | 671篇 |
2011年 | 731篇 |
2010年 | 686篇 |
2009年 | 889篇 |
2008年 | 954篇 |
2007年 | 1018篇 |
2006年 | 903篇 |
2005年 | 843篇 |
2004年 | 705篇 |
2003年 | 628篇 |
2002年 | 652篇 |
2001年 | 566篇 |
2000年 | 514篇 |
1999年 | 526篇 |
1998年 | 416篇 |
1997年 | 380篇 |
1996年 | 300篇 |
1995年 | 215篇 |
1994年 | 183篇 |
1993年 | 136篇 |
1992年 | 130篇 |
1991年 | 107篇 |
1990年 | 80篇 |
1989年 | 64篇 |
1988年 | 59篇 |
1987年 | 55篇 |
1986年 | 52篇 |
1985年 | 79篇 |
1984年 | 71篇 |
1983年 | 27篇 |
1982年 | 54篇 |
1981年 | 30篇 |
1980年 | 43篇 |
1979年 | 37篇 |
1978年 | 26篇 |
1977年 | 25篇 |
1976年 | 17篇 |
1974年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
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.
103.
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. 相似文献
104.
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 相似文献
105.
106.
107.
108.
In this paper, we exhibit a unified treatment of the mixed initial boundary value problem for second order (in time) parabolic linear differential equations in Banach spaces, whose boundary conditions are of a dynamical nature. Results regarding existence, uniqueness, continuous dependence (on initial data) and regularity of classical and strict solutions are established. Moreover, several examples are given as samples for possible applications.
109.
§ 1. Introduction Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa… 相似文献
110.