全文获取类型
收费全文 | 1352篇 |
免费 | 144篇 |
国内免费 | 33篇 |
专业分类
化学 | 354篇 |
晶体学 | 2篇 |
力学 | 142篇 |
综合类 | 55篇 |
数学 | 411篇 |
物理学 | 565篇 |
出版年
2024年 | 1篇 |
2023年 | 27篇 |
2022年 | 77篇 |
2021年 | 62篇 |
2020年 | 61篇 |
2019年 | 62篇 |
2018年 | 42篇 |
2017年 | 56篇 |
2016年 | 55篇 |
2015年 | 64篇 |
2014年 | 88篇 |
2013年 | 88篇 |
2012年 | 59篇 |
2011年 | 74篇 |
2010年 | 65篇 |
2009年 | 59篇 |
2008年 | 67篇 |
2007年 | 54篇 |
2006年 | 49篇 |
2005年 | 51篇 |
2004年 | 39篇 |
2003年 | 43篇 |
2002年 | 43篇 |
2001年 | 38篇 |
2000年 | 16篇 |
1999年 | 26篇 |
1998年 | 21篇 |
1997年 | 19篇 |
1996年 | 12篇 |
1995年 | 16篇 |
1994年 | 19篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1974年 | 3篇 |
排序方式: 共有1529条查询结果,搜索用时 31 毫秒
1.
科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高. 相似文献
2.
主成分分析在地区科技竞争力评测中的应用 总被引:16,自引:0,他引:16
近年来对于科技竞争力的研究在国内方兴未艾,其中对于科技竞争力的评测是众多学者研究的重点和热点,也是各级决策者最为关心、最为重要的课题之一。本文根据科技竞争力概念和内涵来确定评测指标体系的构成要素,建立了评测指标体系,并利用主成分分析方法对采集来的数据进行分析,得到最终的评测结果。 相似文献
3.
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 相似文献
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.
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. 相似文献
7.
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. 相似文献
8.
Those who have worked in the Royal Institution of Great Britain have, since its foundation in 1799, made significant contributions
to scientific knowledge, to its practical application, and to its communication to a wide variety of audiences. Such work
cannot be carried out in an architectural vacuum, and in this paper we examine how the buildings of the Royal Institution,
20 and 21 Albemarle Street in central London, have shaped the work undertaken within its walls and how, on a number of occasions,
the buildings have been reconfigured to take account of the evolving needs of scientific research and communication.
This paper is based on the Conservation Plan of the Royal Institution that we wrote during 2003. The Conservation Plan did
not examine the land owned by the Royal Institution to the north (i.e., 22 and 23 Albemarle Street; for this area see Richard Garnier, “Grafton Street, Mayfair,” Georgian Group Journal 13 (2003), 210–272), but it did discuss 18 and 19 Albemarle Street. In this paper we concentrate on the core Royal Institution
buildings at 20 and 21 Albemarle Street. Other studies of the relationship of architecture,space, and science include Crosbie
Smith and Jon Agar, ed., Making Space for Science: Territorial Themes in the Shaping of Knowledge (Basingstoke: Macmillan, 1997); Peter Galison and Emily Thompson, ed., The Architecture of Science (Cambridge, Mass.: MIT Press, 1999); and Sophie Forgan,“The architecture of science and the idea of a university,” Studies in History and Philosophy of Science 20 (1989), 405–434.
Frank A.J.L. James is Professor of the History of Science at the Royal Institution; he has written widely on the history of
nineteenth-century science in its social and cultural contexts and is editor of the Correspondence of Michael Faraday. He is President of the British Society for the History of Science. Anthony Peers is an Associate of Rodney Melville and
Partners where he works in the field of building conservation as an architectural historian. He is a Council member of the
Ancient Monument Society. 相似文献
10.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献