全文获取类型
收费全文 | 1789篇 |
免费 | 334篇 |
国内免费 | 47篇 |
专业分类
化学 | 210篇 |
晶体学 | 6篇 |
力学 | 228篇 |
综合类 | 79篇 |
数学 | 773篇 |
物理学 | 874篇 |
出版年
2024年 | 4篇 |
2023年 | 29篇 |
2022年 | 66篇 |
2021年 | 63篇 |
2020年 | 61篇 |
2019年 | 45篇 |
2018年 | 40篇 |
2017年 | 86篇 |
2016年 | 81篇 |
2015年 | 79篇 |
2014年 | 126篇 |
2013年 | 136篇 |
2012年 | 83篇 |
2011年 | 92篇 |
2010年 | 98篇 |
2009年 | 83篇 |
2008年 | 110篇 |
2007年 | 102篇 |
2006年 | 79篇 |
2005年 | 78篇 |
2004年 | 62篇 |
2003年 | 76篇 |
2002年 | 64篇 |
2001年 | 57篇 |
2000年 | 38篇 |
1999年 | 53篇 |
1998年 | 37篇 |
1997年 | 24篇 |
1996年 | 22篇 |
1995年 | 31篇 |
1994年 | 25篇 |
1993年 | 19篇 |
1992年 | 16篇 |
1991年 | 14篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 3篇 |
1974年 | 5篇 |
排序方式: 共有2170条查询结果,搜索用时 31 毫秒
1.
2.
Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear 相似文献
3.
One of the most ignored, but urgent and vital challenges confronting society today is the vulnerability of urban areas to extreme events. Current organization of response systems, predominantly based on a command and control model, limits their effectiveness and efficiency. Particularly, in decision‐making processes where a large number of actors may be involved. In this article, a new distributed collaborative decision‐making model is proposed to overcome command and control limitations encountered in stressful, hostile, chaotic, and large‐scale settings. This model was derived by borrowing concepts from the collective decision making of honeybees foraging, a successful process in solving complex tasks within complex settings. The model introduced in this article was evaluated through differential equations, i.e., continuous analysis, and difference equations, i.e., discrete analysis. The most important result found is that the best available option in any large‐scale decision‐making problem can be configured as an attractor, in a distributed and timely manner. We suggest that the proposed model has the potential to facilitate decision‐making processes in large‐scale settings. © 2005 Wiley Periodicals, Inc. Complexity 11:28–38, 2005 相似文献
4.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
5.
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. 相似文献
6.
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 相似文献
7.
Hossam A. Zaki 《Computational Optimization and Applications》1995,4(1):23-45
State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented. 相似文献
8.
On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls
N. I. Pogodaev 《Siberian Mathematical Journal》2007,48(5):897-912
We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints. 相似文献
9.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
10.
S. V. Dil’man 《Mathematical Notes》2006,79(5-6):625-631
In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained. 相似文献