全文获取类型
收费全文 | 2821篇 |
免费 | 245篇 |
国内免费 | 248篇 |
专业分类
化学 | 280篇 |
晶体学 | 3篇 |
力学 | 112篇 |
综合类 | 58篇 |
数学 | 2214篇 |
物理学 | 647篇 |
出版年
2024年 | 8篇 |
2023年 | 40篇 |
2022年 | 58篇 |
2021年 | 76篇 |
2020年 | 69篇 |
2019年 | 72篇 |
2018年 | 68篇 |
2017年 | 82篇 |
2016年 | 80篇 |
2015年 | 56篇 |
2014年 | 107篇 |
2013年 | 201篇 |
2012年 | 123篇 |
2011年 | 133篇 |
2010年 | 108篇 |
2009年 | 158篇 |
2008年 | 191篇 |
2007年 | 178篇 |
2006年 | 207篇 |
2005年 | 181篇 |
2004年 | 132篇 |
2003年 | 136篇 |
2002年 | 118篇 |
2001年 | 99篇 |
2000年 | 115篇 |
1999年 | 94篇 |
1998年 | 66篇 |
1997年 | 67篇 |
1996年 | 58篇 |
1995年 | 37篇 |
1994年 | 37篇 |
1993年 | 16篇 |
1992年 | 20篇 |
1991年 | 12篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 16篇 |
1987年 | 17篇 |
1986年 | 9篇 |
1985年 | 7篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1977年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有3314条查询结果,搜索用时 15 毫秒
1.
2.
3.
网络股泡沫大小测度研究 总被引:1,自引:0,他引:1
网络股泡沫是最能反映网络泡沫本质的表现形式,本文利用理性预期理论,构建了网络股泡沫大小的测度模型,说明网络股泡沫的存在,在此基础上确定了网络股泡沫大小的测度指标,并以雅虎公司股票为例对泡沫的大小进行了测度,结果符合网络泡沫的实际情况。 相似文献
4.
Trond Stølen Gustavsen 《Compositio Mathematica》2003,138(2):199-231
We relate the equisingular deformation theory of plane curve singularities and sandwiched surface singularities. We show the existence of a smooth map between the two corresponding deformation functors and study the kernel of this map. In particular we show that the map is an isomorphism when a certain invariant is large enough. 相似文献
5.
The paper discusses the relationship between weights and control vertices of two rational NURBS curves of degree two or three with all weights larger than zero when they represent the same curve parametrically and geometrically, and gives sufficient and necessary conditions for coincidence of two rational NURBS curves in non-degeneracy case. 相似文献
6.
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. 相似文献
7.
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. 相似文献
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 相似文献