全文获取类型
收费全文 | 7164篇 |
免费 | 431篇 |
国内免费 | 502篇 |
专业分类
化学 | 295篇 |
晶体学 | 2篇 |
力学 | 362篇 |
综合类 | 80篇 |
数学 | 3730篇 |
物理学 | 672篇 |
综合类 | 2956篇 |
出版年
2024年 | 11篇 |
2023年 | 57篇 |
2022年 | 90篇 |
2021年 | 89篇 |
2020年 | 109篇 |
2019年 | 105篇 |
2018年 | 104篇 |
2017年 | 103篇 |
2016年 | 141篇 |
2015年 | 152篇 |
2014年 | 265篇 |
2013年 | 360篇 |
2012年 | 320篇 |
2011年 | 350篇 |
2010年 | 326篇 |
2009年 | 470篇 |
2008年 | 484篇 |
2007年 | 592篇 |
2006年 | 478篇 |
2005年 | 417篇 |
2004年 | 371篇 |
2003年 | 345篇 |
2002年 | 353篇 |
2001年 | 260篇 |
2000年 | 242篇 |
1999年 | 203篇 |
1998年 | 197篇 |
1997年 | 158篇 |
1996年 | 160篇 |
1995年 | 130篇 |
1994年 | 97篇 |
1993年 | 85篇 |
1992年 | 73篇 |
1991年 | 53篇 |
1990年 | 52篇 |
1989年 | 39篇 |
1988年 | 50篇 |
1987年 | 31篇 |
1986年 | 31篇 |
1985年 | 23篇 |
1984年 | 29篇 |
1983年 | 7篇 |
1982年 | 18篇 |
1981年 | 10篇 |
1980年 | 12篇 |
1979年 | 10篇 |
1978年 | 14篇 |
1977年 | 9篇 |
1976年 | 7篇 |
1975年 | 2篇 |
排序方式: 共有8097条查询结果,搜索用时 46 毫秒
1.
《Current Applied Physics》2015,15(3):319-325
Pd is one of the metals suitable for inducing low-temperature crystallization in Ge. However, it is not clear how residual Pd atoms are integrated into the Ge lattice. Therefore, time-differential γ–γ perturbed angular correlations (TDPAC) technique using the 100Pd(→100Rh) nuclear probe produced by recoil implantation has been applied to study the hyperfine interactions of this probe in single-crystalline undoped Ge. A Pd-vacancy complex aligned along the <111> crystallographic direction with a unique interaction frequency of 8.4(5) Mrad/s has been identified. This complex was measured to have a maximum relative fraction of about 76(4)% following annealing at 350 °C. Further annealing at higher temperatures reduced this fraction, possibly via dissociation of the complex. Calculations suggest dissociation energy of 1.94(5) eV for the complex. DFT calculations performed in this work are in reasonable good agreement with the experimental values for the electric-field gradient of the defect complex in Ge and Si for comparison. The calculations predict a split-vacancy configuration with the Pd on a bond-centred interstitial site having a nearest-neighbour semi-vacancy on both sides (V-PdBI-V) in Ge and Si. 相似文献
2.
3.
对一类Minimax分式规划问题(MFP)提出一个迭代算法.首先通过引进变量和指数变换,将问题(MFP)等价转化为问题(Q),然后利用代数-几何平均不等式以及合适的转化过程,将等价问题(Q)压缩为凸规划问题(Q).从而根据选择不同的点所对应的压缩问题(Q),将原问题的求解过程转化为求解一系列的凸规划问题.数值实验表明算法是可行有效的. 相似文献
4.
文章基于两点Gauss型求积公式,分别结合梯形积分公式和Adomian分解法构造了两种牛顿型迭代格式.借助泰勒展开式,文章证明了这两种迭代格式都具有四阶收敛,并通过数值实验例子验证这两种迭代格式的有效性. 相似文献
5.
6.
算法的相关性变换与划分带个数的关系 总被引:1,自引:0,他引:1
王树义 《大连理工大学学报》1995,35(3):422-424
使用相关性变换法,划分并映射循环算法到具有固定尺寸的Systolic阵列。下标集合被划分成若干条带,划分带的条数与变换后的Systolic阵列算法的执行时间成正比。指出了Moldovan给出的计算划分带条数的公式有很大局限性,给出了由空间变换计算划分带条数的方法。 相似文献
7.
杨晓光 《应用数学学报(英文版)》1997,13(4):337-341
1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv… 相似文献
8.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
9.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
10.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献