全文获取类型
收费全文 | 2461篇 |
免费 | 203篇 |
国内免费 | 197篇 |
专业分类
化学 | 286篇 |
晶体学 | 2篇 |
力学 | 59篇 |
综合类 | 33篇 |
数学 | 1873篇 |
物理学 | 608篇 |
出版年
2024年 | 7篇 |
2023年 | 29篇 |
2022年 | 44篇 |
2021年 | 69篇 |
2020年 | 60篇 |
2019年 | 53篇 |
2018年 | 53篇 |
2017年 | 57篇 |
2016年 | 65篇 |
2015年 | 42篇 |
2014年 | 90篇 |
2013年 | 167篇 |
2012年 | 113篇 |
2011年 | 127篇 |
2010年 | 122篇 |
2009年 | 175篇 |
2008年 | 198篇 |
2007年 | 174篇 |
2006年 | 175篇 |
2005年 | 151篇 |
2004年 | 111篇 |
2003年 | 103篇 |
2002年 | 89篇 |
2001年 | 67篇 |
2000年 | 77篇 |
1999年 | 73篇 |
1998年 | 45篇 |
1997年 | 50篇 |
1996年 | 41篇 |
1995年 | 33篇 |
1994年 | 35篇 |
1993年 | 15篇 |
1992年 | 20篇 |
1991年 | 13篇 |
1990年 | 10篇 |
1989年 | 9篇 |
1988年 | 16篇 |
1987年 | 14篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1974年 | 2篇 |
1972年 | 1篇 |
排序方式: 共有2861条查询结果,搜索用时 33 毫秒
1.
2.
In the present paper, some new almost fixed point theorems and fixed point theorems for lower semicontinuous type multivalued mappings are obtained in metrizable H-spaces. 相似文献
3.
李永祥 《数学物理学报(A辑)》2003,23(2):245-252
该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈[0,1],u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):[0,1]×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性. 相似文献
4.
A MCSCF-method for minimization of the variance yielding an optimal basisset of variance minimizing orbitals in analogy to Löwdin's natural orbitals for minimal energy is developed. 相似文献
5.
Xiangtong Qi 《Discrete Applied Mathematics》2007,155(3):416-422
We study a machine scheduling model in which job scheduling and machine maintenance activities have to be considered simultaneously. We develop the worst-case bounds for some heuristic algorithms, including a sharper worst-case bound of the SPT schedule than the results in the literature, and another bound of the EDD schedule. 相似文献
6.
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. 相似文献
7.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
8.
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. 相似文献
9.
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. 相似文献
10.
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 相似文献