首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   457篇
  免费   7篇
  国内免费   4篇
化学   238篇
力学   6篇
数学   169篇
物理学   55篇
  2023年   5篇
  2022年   5篇
  2021年   7篇
  2020年   7篇
  2019年   7篇
  2018年   5篇
  2017年   12篇
  2016年   15篇
  2015年   27篇
  2014年   20篇
  2013年   51篇
  2012年   28篇
  2011年   30篇
  2010年   29篇
  2009年   23篇
  2008年   24篇
  2007年   22篇
  2006年   22篇
  2005年   17篇
  2004年   15篇
  2003年   16篇
  2002年   14篇
  2001年   7篇
  2000年   5篇
  1999年   2篇
  1997年   4篇
  1996年   5篇
  1995年   3篇
  1994年   2篇
  1992年   1篇
  1991年   1篇
  1990年   1篇
  1989年   3篇
  1988年   1篇
  1987年   1篇
  1985年   2篇
  1984年   2篇
  1982年   2篇
  1981年   1篇
  1980年   1篇
  1979年   2篇
  1978年   6篇
  1977年   1篇
  1976年   1篇
  1975年   4篇
  1974年   3篇
  1970年   1篇
  1969年   1篇
  1967年   2篇
  1930年   1篇
排序方式: 共有468条查询结果,搜索用时 328 毫秒
91.
92.
Developed from the application of operational mathematics and Markoff-theory in quantum mechanics [CA: 81: 8225v], transform space treatment of Einstein diffusion [CA: 82: 49699s], and acoustoopic effects in lasers [CA: 82: 162686y], the paper examines non-classical aspects of laser driven fusion presenting favorable options which remain generally inexplored.  相似文献   
93.
94.
For every planar straight line graph (Pslg), there is a vertex-face assignment such that every vertex is assigned to at most two incident faces, and every face is assigned to all its reflex corners and one more incident vertex. Such an assignment allows us to augment every disconnected Pslg into a connected Pslg such that the degree of every vertex increases by at most two.  相似文献   
95.
During the iterations of interior point methods symmetric indefinite systems are decomposed by LD̂L T factorization. This step can be performed in a special way where the symmetric indefinite system is transformed to a positive definite one, called the normal equations system. This approach proved to be efficient in most of the cases and numerically reliable, due to the positive definite property. It has been recognized, however, that in case the linear program contains “dense” columns, this approach results in an undesirable fill–in during the computations and the direct factorization of the symmetric indefinite system is more advantageous. The paper describes a new approach to detect cases where the system of normal equations is not preferable for interior point methods and presents a new algorithm for detecting the set of columns which is responsible for the excessive fill–in in the matrix AA T . By solving large–scale linear programming problems we demonstrate that our heuristic is reliable in practice. This work was supported in part by the Hungarian Scientific Research Fund OTKA K60480.  相似文献   
96.
Esterification of sodium salt of carboxilic acids were performed with alkyl bromide in phase-transfer conditions without solvent.  相似文献   
97.
An improved preparation of tosylhydrazones of α- and β-keto esters, by means of active aluminium oxide as catalyst, are described.  相似文献   
98.
Starting from the racemic ethyl 3-hydroxy-3-(10-alkyl-10H-phenothiazin-3-yl)propanoates as substrates, a multienzymatic procedure was developed for the efficient synthesis of the corresponding highly enantiomerically enriched (R)- and (S)-3-heteroaryl-3-hydroxypropanoic acids.  相似文献   
99.
Traditionally, two variants of the L-shaped method based on Benders’ decomposition principle are used to solve two-stage stochastic programming problems: the aggregate and the disaggregate version. In this study we report our experiments with a special convex programming method applied to the aggregate master problem. The convex programming method is of the type that uses an oracle with on-demand accuracy. We use a special form which, when applied to two-stage stochastic programming problems, is shown to integrate the advantages of the traditional variants while avoiding their disadvantages. On a set of 105 test problems, we compare and analyze parallel implementations of regularized and unregularized versions of the algorithms. The results indicate that solution times are significantly shortened by applying the concept of on-demand accuracy.  相似文献   
100.
It is shown that in any polygonal art gallery of n sides it is possible to place n/3 point guards whose range of vision is 180° so that every interior point of the gallery can be seen by at least one of them. The guards can be stationed at any point of the art gallery. This settles an open problem posed by J. Urrutia.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号