全文获取类型
收费全文 | 10106篇 |
免费 | 806篇 |
国内免费 | 961篇 |
专业分类
化学 | 638篇 |
晶体学 | 6篇 |
力学 | 468篇 |
综合类 | 142篇 |
数学 | 5373篇 |
物理学 | 1840篇 |
综合类 | 3406篇 |
出版年
2024年 | 5篇 |
2023年 | 74篇 |
2022年 | 98篇 |
2021年 | 107篇 |
2020年 | 159篇 |
2019年 | 182篇 |
2018年 | 161篇 |
2017年 | 203篇 |
2016年 | 236篇 |
2015年 | 204篇 |
2014年 | 362篇 |
2013年 | 656篇 |
2012年 | 476篇 |
2011年 | 553篇 |
2010年 | 488篇 |
2009年 | 606篇 |
2008年 | 626篇 |
2007年 | 712篇 |
2006年 | 687篇 |
2005年 | 572篇 |
2004年 | 498篇 |
2003年 | 450篇 |
2002年 | 452篇 |
2001年 | 391篇 |
2000年 | 364篇 |
1999年 | 347篇 |
1998年 | 293篇 |
1997年 | 269篇 |
1996年 | 232篇 |
1995年 | 180篇 |
1994年 | 174篇 |
1993年 | 168篇 |
1992年 | 140篇 |
1991年 | 117篇 |
1990年 | 100篇 |
1989年 | 83篇 |
1988年 | 93篇 |
1987年 | 55篇 |
1986年 | 37篇 |
1985年 | 43篇 |
1984年 | 40篇 |
1983年 | 18篇 |
1982年 | 34篇 |
1981年 | 20篇 |
1980年 | 21篇 |
1979年 | 25篇 |
1978年 | 10篇 |
1977年 | 16篇 |
1976年 | 12篇 |
1974年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
51.
A. A. Maleev 《Computational Mathematics and Mathematical Physics》2006,46(12):2031-2039
Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A. 相似文献
52.
J. J. EGOZCUE J. L. DIAZ-BARRERO V. PAWLOWSKY-GLAHN 《数学学报(英文版)》2006,22(4):1175-1182
The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison's ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space. 相似文献
53.
This paper investigates the existence of positive solutions of a singular boundary value problem with negative exponent similar
to standard Emden-Fowler equation. A necessary and sufficient condition for the existence of C[0, 1] positive solutions as
well as C1[0, 1] positive solutions is given by means of the method of lower and upper solutions with the Schauder fixed point theorem. 相似文献
54.
Banach空间二阶周期边值问题解的存在性 总被引:2,自引:0,他引:2
利用一些比较结果,讨论了Banach空间中二阶周期边值问题解的存在性,获得了若干解的存在性与唯一性结果。 相似文献
55.
Tiziana Cardinali Raffaella Servadei 《Proceedings of the American Mathematical Society》2004,132(8):2339-2349
In this paper we obtain the existence of periodic solutions for nonlinear ``invariance' problems monitored by impulsive differential inclusions subject to impulse effects.
56.
In this paper, by means of the method of upper and lower solutions and monotone iterative technique, the existence of maximal and minimal solutions of the boundary value problems for first order impulsive delay differential equations is established. 相似文献
57.
58.
Marco Pretti 《Journal of statistical physics》2003,111(3-4):993-1015
In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent. 相似文献
59.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
60.
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 相似文献