全文获取类型
收费全文 | 8973篇 |
免费 | 1125篇 |
国内免费 | 349篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1032篇 |
综合类 | 324篇 |
数学 | 5509篇 |
物理学 | 2815篇 |
出版年
2024年 | 23篇 |
2023年 | 91篇 |
2022年 | 298篇 |
2021年 | 269篇 |
2020年 | 192篇 |
2019年 | 206篇 |
2018年 | 226篇 |
2017年 | 342篇 |
2016年 | 444篇 |
2015年 | 294篇 |
2014年 | 546篇 |
2013年 | 605篇 |
2012年 | 489篇 |
2011年 | 544篇 |
2010年 | 433篇 |
2009年 | 570篇 |
2008年 | 587篇 |
2007年 | 597篇 |
2006年 | 483篇 |
2005年 | 434篇 |
2004年 | 374篇 |
2003年 | 316篇 |
2002年 | 296篇 |
2001年 | 252篇 |
2000年 | 226篇 |
1999年 | 194篇 |
1998年 | 182篇 |
1997年 | 158篇 |
1996年 | 135篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
The rational function optimization algorithm is one of the widely used methods to search stationary points on surfaces. However,
one of the drawbacks of this method is the step reduction procedure to deal with the overstepping problem. We present and
comment on a method such that the step obtained from the solution of the rational function equations possesses the desired
correct length. The analysis and discussion of the method is mainly centered on the location and optimization of transition
states.
Received: 18 June 1998 / Accepted: 17 September 1998 / Published online: 23 November 1998 相似文献
82.
The concept of crystalline module, that is, an unambiguously isolated, repeated quasi-molecular element, is introduced. This concept is more general than the concept of crystal lattice. The generalized modular approach allows extension of the methods and principles of crystallography to quasi-crystals, clusters, amorphous solids, and periodic biological structures. Principles of construction of aperiodic, nonequilibrium regular modular structures are formulated. Limitations on the size of icosahedral clusters are due to the presence of spherical shells with non-Euclidean tetrahedral tiling in their structure. A parametric relationship between the structures of icosahedral fullerenes and metal clusters of the Chini series was found. 相似文献
83.
84.
Prilezhaeva I. N. Solov'ev N. P. Khramushin N. I. 《Russian Journal of Electrochemistry》2004,40(11):1223-1226
Transformation of impedance spectra into relaxation time spectra (RTS) is used for determining contributions of individual processes of the oxygen electroreduction reaction (OER) to the polarization resistance of the electrochemical cell. The transformation technique involves the solution of the convolution equation found with the aid of a modified Van Cittert iteration algorithm checked on model impedance spectra. The technique, when used to analyze impedance spectra of electrochemical cells air|Pt|YSZ|YSZ + Pt|air, shows that the conversion of a globular structure of the YSZ + Pt cermet layer to a columnar one is accompanied by a change of peak amplitudes in RTS. The revealed RTS dynamics when heated to 750°C is compared with peculiarities of individual processes in OER. 相似文献
85.
86.
Yinyu Ye 《Mathematical Programming》1991,52(1-3):405-414
We analyze several affine potential reduction algorithms for linear programming based on simplifying assumptions. We show that, under a strong probabilistic assumption regarding the distribution of the data in an iteration, the decrease in the primal potential function will be
with high probability, compared to the guaranteed(1). ( 2n is a parameter in the potential function andn is the number of variables.) Under the same assumption, we further show that the objective reduction rate of Dikin's affine scaling algorithm is
with high probability, compared to no guaranteed convergence rate.Research supported in part by NSF Grant DDM-8922636. 相似文献
87.
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rn1 and Y R
n2 are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010. 相似文献
88.
We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures. 相似文献
89.
On affine scaling algorithms for nonconvex quadratic programming 总被引:8,自引:0,他引:8
Yinyu Ye 《Mathematical Programming》1992,56(1-3):285-300
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa. 相似文献
90.