全文获取类型
收费全文 | 9226篇 |
免费 | 1124篇 |
国内免费 | 363篇 |
专业分类
化学 | 883篇 |
晶体学 | 13篇 |
力学 | 1040篇 |
综合类 | 332篇 |
数学 | 5711篇 |
物理学 | 2734篇 |
出版年
2024年 | 21篇 |
2023年 | 98篇 |
2022年 | 250篇 |
2021年 | 272篇 |
2020年 | 189篇 |
2019年 | 207篇 |
2018年 | 225篇 |
2017年 | 346篇 |
2016年 | 447篇 |
2015年 | 297篇 |
2014年 | 561篇 |
2013年 | 609篇 |
2012年 | 501篇 |
2011年 | 559篇 |
2010年 | 449篇 |
2009年 | 600篇 |
2008年 | 623篇 |
2007年 | 648篇 |
2006年 | 503篇 |
2005年 | 453篇 |
2004年 | 390篇 |
2003年 | 322篇 |
2002年 | 306篇 |
2001年 | 258篇 |
2000年 | 232篇 |
1999年 | 200篇 |
1998年 | 190篇 |
1997年 | 164篇 |
1996年 | 142篇 |
1995年 | 109篇 |
1994年 | 71篇 |
1993年 | 86篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 24篇 |
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条查询结果,搜索用时 31 毫秒
991.
连续时间遗传算法模型及其强收敛性分析 总被引:4,自引:0,他引:4
本文在隐马尔可夫链的框架下利用隐马尔可夫链{Xt:t∈[0,∞)}的观测链的概率分布提出一个连续化遗传算法模型,并给出其一个强收敛结果,讨论了其离散骨架的性质。 相似文献
992.
Naoki Kawashima 《Journal of statistical physics》1996,82(1-2):131-153
We present cluster Monte Carlo algorithms for theXYZ quantum spin models. In the special case ofS=1/2, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study theS=1/2XY model in two dimensions with a representation in which the quantization axis lies in the easy plane. We find that the numerical autocorrelation time for the cluster algorithm remains of the order of unity and does not show any significant dependence on the temperature, the system size, or the Trotter number. On the other hand, the autocorrelation time for the conventional algorithm strongly depends on these parameters and can be very large. The use of improved estimators for thermodynamic averages further enhances the efficiency of the new algorithms. 相似文献
993.
The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Both the preemptive and the nonpreemptive cases of the problem are considered. 相似文献
994.
Open shop problems with unit time operations 总被引:2,自引:0,他引:2
Peter Brucker Bernd Jurisch Marion Jurisch 《Mathematical Methods of Operations Research》1993,37(1):59-73
We show that them-machine open shop problem in which all operations have unit processing times can be polynomially transformed to a special preemptive scheduling problem onm identical parallel machines. Many results published recently as well as some new results are derived by using this transformation. The new results include solutions of open problems mentioned in a recent paper by Kubiak et al. p]A similar relationship is derived between no-wait open shop problems with unit time operations andm-machine problems with jobs having unit processing times.This work was supported by Deutsche Forschungsgemeinschaft (Project JoPTAG). 相似文献
995.
Consider a Markov-modulated G/G/1 queueing system in which the arrival and the service mechanisms are controlled by an underlying Markov chain. The classical approaches to the waiting time of this type of queueing system have severe computational difficulties. In this paper, we develop a numerical algorithm to calculate the moments of the waiting time based on Gong and Hu's idea. Our numerical results show that the algorithm is powerful. A matrix recursive equation for the moments of the waiting time is also given under certain conditions. 相似文献
996.
997.
A learning process for fuzzy control rules using genetic algorithms 总被引:10,自引:0,他引:10
The purpose of this paper is to present a genetic learning process for learning fuzzy control rules from examples. It is developed in three stages: the first one is a fuzzy rule genetic generating process based on a rule learning iterative approach, the second one combines two kinds of rules, experts rules if there are and the previously generated fuzzy control rules, removing the redundant fuzzy rules, and the thrid one is a tuning process for adjusting the membership functions of the fuzzy rules. The three components of the learning process are developed formulating suitable genetic algorithms. 相似文献
998.
999.
1000.
最小风险证券组合的结构分析和迭代算法 总被引:1,自引:0,他引:1
本文分析了最小风险组合证券投资的结构特征,并提出了一种组合证券风险最小化的迭代算法,证明了其收敛性.该算法操作简单,且易于处理不允许卖空情况下的证券组合问题. 相似文献