全文获取类型
收费全文 | 2817篇 |
免费 | 228篇 |
国内免费 | 214篇 |
专业分类
化学 | 467篇 |
晶体学 | 4篇 |
力学 | 76篇 |
综合类 | 34篇 |
数学 | 1994篇 |
物理学 | 684篇 |
出版年
2024年 | 8篇 |
2023年 | 29篇 |
2022年 | 57篇 |
2021年 | 73篇 |
2020年 | 67篇 |
2019年 | 63篇 |
2018年 | 67篇 |
2017年 | 72篇 |
2016年 | 82篇 |
2015年 | 51篇 |
2014年 | 106篇 |
2013年 | 178篇 |
2012年 | 113篇 |
2011年 | 141篇 |
2010年 | 117篇 |
2009年 | 180篇 |
2008年 | 203篇 |
2007年 | 198篇 |
2006年 | 181篇 |
2005年 | 180篇 |
2004年 | 137篇 |
2003年 | 122篇 |
2002年 | 117篇 |
2001年 | 86篇 |
2000年 | 92篇 |
1999年 | 89篇 |
1998年 | 59篇 |
1997年 | 63篇 |
1996年 | 48篇 |
1995年 | 35篇 |
1994年 | 37篇 |
1993年 | 18篇 |
1992年 | 19篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 18篇 |
1987年 | 18篇 |
1986年 | 14篇 |
1985年 | 10篇 |
1984年 | 14篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1974年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有3259条查询结果,搜索用时 18 毫秒
21.
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. 相似文献
22.
High-resolution Fourier transform spectra of CH3OH have been investigated in the infrared region from 930 to 1450 cm−1 in order to map the torsion-rotation energy manifolds associated with the ν7 in-plane CH3 rock, the ν11 out-of-plane CH3 rock, and the ν6 OH bend. Upper-state term values have been determined from the assigned spectral subbands, and have been fitted to power-series expansions to obtain substate origins and effective B-values for the three modes. The substate origins have been grouped into related families according to systematic trends observed in the torsion-vibration energy map, but there are substantial differences from the traditional torsional patterns. There appears to be significant torsion-mediated spectral mixing, and a variety of “forbidden” torsional combination subbands with |Δυt|>1 have been observed, where υt denotes the torsional quantum number (equivalent to υ12). For example, coupling of the (υ6,υt)=(1,0) OH bend to nearby torsionally excited (υ7,υt)=(1,1) CH3-rock and (υ8,υt)=(1,1) CO-stretch states introduces (υ6,υt)=(1,0)←(0,1) subbands into the spectrum and makes the ν7+ν12−ν12 torsional hot band stronger than the ν7 fundamental. The results suggest a picture of strong coupling among the OH-bending, CH3-rocking, and CO-stretching modes that significantly modifies the traditional energy structure and raises interesting and provocative questions about the torsion-vibration identity of a number of the observed states. 相似文献
23.
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 相似文献
24.
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. 相似文献
25.
进一步研究了具有三个cM公共值的亚纯函数的唯一性,改进了H.Ueda和仪洪勋等人的有关结果. 相似文献
26.
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.
27.
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. 相似文献
28.
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. 相似文献
29.
Gerhard Starke 《Numerische Mathematik》1997,78(1):103-117
Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES
or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of
values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from
the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular,
the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations
of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners
which constitute popular preconditioning strategies for such problems.
Received May 3, 1996 相似文献
30.
陈迪 《应用数学与计算数学学报》1994,8(1):70-76
本文讨论了具有r个成败型元件串联系统可靠性的置信下限问题。研究了虚拟系统法置信下限的小样本性质,证明了,在通常情况下虚拟系统法置信下限要大于常见的L-M法置信下限.更一般地,本文证明了在成败型试验中,当成功数与试验数之比保持不变时,试验次数的增加将直接缩小成功率置信区间的长度。 相似文献