全文获取类型
收费全文 | 2784篇 |
免费 | 244篇 |
国内免费 | 227篇 |
专业分类
化学 | 212篇 |
晶体学 | 2篇 |
力学 | 56篇 |
综合类 | 31篇 |
数学 | 1443篇 |
物理学 | 540篇 |
综合类 | 971篇 |
出版年
2024年 | 5篇 |
2023年 | 27篇 |
2022年 | 45篇 |
2021年 | 72篇 |
2020年 | 63篇 |
2019年 | 59篇 |
2018年 | 61篇 |
2017年 | 63篇 |
2016年 | 73篇 |
2015年 | 62篇 |
2014年 | 117篇 |
2013年 | 160篇 |
2012年 | 143篇 |
2011年 | 150篇 |
2010年 | 119篇 |
2009年 | 194篇 |
2008年 | 190篇 |
2007年 | 182篇 |
2006年 | 197篇 |
2005年 | 163篇 |
2004年 | 131篇 |
2003年 | 125篇 |
2002年 | 120篇 |
2001年 | 85篇 |
2000年 | 91篇 |
1999年 | 91篇 |
1998年 | 69篇 |
1997年 | 70篇 |
1996年 | 49篇 |
1995年 | 32篇 |
1994年 | 42篇 |
1993年 | 26篇 |
1992年 | 29篇 |
1991年 | 21篇 |
1990年 | 17篇 |
1989年 | 17篇 |
1988年 | 21篇 |
1987年 | 22篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1977年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有3255条查询结果,搜索用时 694 毫秒
11.
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. 相似文献
12.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献
13.
Tristrom Cooke 《Journal of multivariate analysis》2004,89(2):191-383
The quadratic discriminant function is often used to separate two classes of points in a multidimensional space. When the two classes are normally distributed, this results in the optimum separation. In some cases however, the assumption of normality is a poor one and the classification error is increased. The current paper derives an upper bound for the classification error due to a quadratic decision surface. The bound is strict when the class means and covariances and the quadratic discriminant surface satisfy certain specified symmetry conditions. 相似文献
14.
Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems. 相似文献
15.
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 相似文献
16.
We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m2+loglogσ)logσ) in the best case and O((m2+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force. 相似文献
17.
Ren-Cang Li. 《Mathematics of Computation》2003,72(242):715-728
This paper continues earlier studies by Bhatia and Li on eigenvalue perturbation theory for diagonalizable matrix pencils having real spectra. A unifying framework for creating crucial perturbation equations is developed. With the help of a recent result on generalized commutators involving unitary matrices, new and much sharper bounds are obtained.
18.
Regularity of Harmonic Functions in Cheeger-Type Sobolev Spaces 总被引:3,自引:0,他引:3
We give a geometric approach to the study of the regularity of harmonic functions in Cheeger-type Sobolev spaces, and prove the Hölder continuity of such functions. In the proof, we give a definition of an upper curvature bound of the unit sphere of a Banach space, which seems to be of independent interest. 相似文献
19.
Yiran He 《Journal of Global Optimization》2007,39(3):419-426
The existence of global error bound for convex inclusion problems is discussed in this paper, including pointwise global error
bound and uniform global error bound. The existence of uniform global error bound has been carefully studied in Burke and
Tseng (SIAM J. Optim. 6(2), 265–282, 1996) which unifies and extends many existing results. Our results on the uniform global
error bound (see Theorem 3.2) generalize Theorem 9 in Burke and Tseng (1996) by weakening the constraint qualification and
by widening the varying range of the parameter. As an application, the existence of global error bound for convex multifunctions
is also discussed. 相似文献
20.
要确定每个具体的Ramsey数的数值是相当困难的,至今人们只求出了为数很少的几个Ramsey数的数值.人们在研究Ramsey数性质的同时,也在估计Ramsey数的数值,得出了某些Ramsey数的下界值,但工作进展缓慢.本文提出了一种计算Ramsey数最优下界值的递归算法,该算法利用当今关于Ramsey数的最新结果,能得出Ramsey数的目前最优下界值.1 算法描述不妨将本算法定名为G,参数个数为1个以上(可变化),算法允许递归调用,其输出值为Ramsey数的目前最优下界值.C(k_1,k_2…,k_n)表示以k_1,k_2…,k_n作为输入,通过算法G所得到的输出结果,即C(k_1,k_2…,k_n)表示的是G算出的Ramsey数N(k_1,k_2,…,k_n;2)的目前最优下界值,其中N(k_1,k_2…,k_n;2)的含意与文献[2]中有关含意相同.算法G: 相似文献