全文获取类型
收费全文 | 34575篇 |
免费 | 4074篇 |
国内免费 | 2135篇 |
专业分类
化学 | 5185篇 |
晶体学 | 101篇 |
力学 | 5175篇 |
综合类 | 550篇 |
数学 | 17317篇 |
物理学 | 12456篇 |
出版年
2024年 | 62篇 |
2023年 | 313篇 |
2022年 | 850篇 |
2021年 | 840篇 |
2020年 | 976篇 |
2019年 | 879篇 |
2018年 | 827篇 |
2017年 | 1145篇 |
2016年 | 1302篇 |
2015年 | 970篇 |
2014年 | 1766篇 |
2013年 | 2434篇 |
2012年 | 1906篇 |
2011年 | 2094篇 |
2010年 | 1837篇 |
2009年 | 2276篇 |
2008年 | 2136篇 |
2007年 | 2200篇 |
2006年 | 1748篇 |
2005年 | 1580篇 |
2004年 | 1407篇 |
2003年 | 1215篇 |
2002年 | 1187篇 |
2001年 | 958篇 |
2000年 | 947篇 |
1999年 | 814篇 |
1998年 | 734篇 |
1997年 | 572篇 |
1996年 | 538篇 |
1995年 | 522篇 |
1994年 | 442篇 |
1993年 | 397篇 |
1992年 | 371篇 |
1991年 | 303篇 |
1990年 | 261篇 |
1989年 | 188篇 |
1988年 | 206篇 |
1987年 | 190篇 |
1986年 | 188篇 |
1985年 | 236篇 |
1984年 | 204篇 |
1983年 | 93篇 |
1982年 | 143篇 |
1981年 | 99篇 |
1980年 | 63篇 |
1979年 | 64篇 |
1978年 | 76篇 |
1977年 | 75篇 |
1976年 | 41篇 |
1973年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO. 相似文献
92.
本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力.利用该算法在对模型的参数进行重估计时.涉及到复杂的目标函数的梯度运算.击运用矩阵运算使得梯度运算变得简单明了,因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明. 相似文献
93.
YunXiaWANG LinJIA ZhenSHI 《中国化学快报》2003,14(6):561-564
The addition-hydrolysis reaction of benzimidazolium salt with some mono- and bifunctional amine nucleophiles is reported,and a novel method of biomimetic synthesis for formamides and heterocycle compounds is provided. 相似文献
94.
Zhaohui Wang 《Thermochimica Acta》2004,414(1):31-33
Microcalorimetric measurements of excess molar enthalpies, at 298.15 K, are reported for the four binary systems formed by mixing 1-hexene with the cycloalkanes: cyclohexane and methylcyclohexane, and with the aromatic hydrocarcons: benzene and toluene. Smooth Redlich-Kister representations of the results are presented. It was found that the Liebermann-Fried model also provided good representations of the results. 相似文献
95.
96.
Most of the methods used in the ARCH literature for selecting the appropriate model are based on evaluating the ability of the models to describe the data. An alternative model selection approach is examined based on the evaluation of the predictability of the models in terms of standardized prediction errors. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
97.
We present the procedure of exactly solving the Izergin–Korepin model with open boundary conditions by using the algebraic Bethe ansatz, which include constructing the multi-particle state and achieving the eigenvalue of the transfer matrix and corresponding Bethe equations. We give a proof about our conclusions on the multi-particle state based on an assumption. When the model is Uq(su(2)) quantum invariant, our results agree with that obtained by analytic Bethe ansatz method. 相似文献
98.
本文利用我国上市公司1997至2002年的有关财务数据,建立了我国上市公司资本成本面板数据模型,运用该模型分析了我国上市公司资本成本与财务杠杆、企业规模的关系.结果表明,财务杠杆的提升、企业规模的扩大将使资本成本下降.该结论对我国上市公司优化资本结构、提高企业价值具有一定的参考价值. 相似文献
99.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
100.