全文获取类型
收费全文 | 20762篇 |
免费 | 998篇 |
国内免费 | 2494篇 |
专业分类
系统科学 | 3433篇 |
丛书文集 | 573篇 |
教育与普及 | 33篇 |
理论与方法论 | 38篇 |
现状及发展 | 124篇 |
综合类 | 20042篇 |
自然研究 | 11篇 |
出版年
2024年 | 156篇 |
2023年 | 260篇 |
2022年 | 446篇 |
2021年 | 482篇 |
2020年 | 508篇 |
2019年 | 432篇 |
2018年 | 381篇 |
2017年 | 470篇 |
2016年 | 435篇 |
2015年 | 649篇 |
2014年 | 959篇 |
2013年 | 872篇 |
2012年 | 1243篇 |
2011年 | 1381篇 |
2010年 | 1100篇 |
2009年 | 1307篇 |
2008年 | 1373篇 |
2007年 | 1848篇 |
2006年 | 1709篇 |
2005年 | 1396篇 |
2004年 | 1243篇 |
2003年 | 995篇 |
2002年 | 864篇 |
2001年 | 685篇 |
2000年 | 543篇 |
1999年 | 513篇 |
1998年 | 402篇 |
1997年 | 336篇 |
1996年 | 242篇 |
1995年 | 209篇 |
1994年 | 160篇 |
1993年 | 138篇 |
1992年 | 105篇 |
1991年 | 93篇 |
1990年 | 91篇 |
1989年 | 74篇 |
1988年 | 63篇 |
1987年 | 40篇 |
1986年 | 17篇 |
1985年 | 11篇 |
1984年 | 3篇 |
1981年 | 7篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
传统的DOA估计一般是假设噪声为白高斯的二阶谱估计算法.针对更接近于实际情况的空间色噪声,提出了一种基于累积量MUSIC算法的同步CDMA系统解相干DOA估计算法.该算法不仅能消除多径干扰并且与二阶MUSIC算法相比能更有效抑制空间色噪声,提高估计的准确性. 相似文献
912.
一类并行隐式Runge-Kutta方法的A稳定性分析 总被引:2,自引:0,他引:2
本文针对多处理机系统构造了一类并行隐式Runge—Kutta方法,给出了一个具有三阶精度的并行二级Runge—Kutta公式,并证明了该计算公式具有A稳定性,数值结果表明该计算公式对求解刚性常微分方程是有效的。 相似文献
913.
波束域Root-MUSIC算法的进一步降阶处理 总被引:1,自引:0,他引:1
研究了波束域降阶Root-MUSIC算法,在子阵分解降阶的基础上,进一步将多项式的求根阶次降到与源数目相同,提出了求解降阶多项式的方法。该方法最大程度地减少了求根多项式的阶次和求解多项式的次数,并保持了Root—MUSIC算法的优良性能。显著降低运算量是其最大优点,仿真结果验证了降阶算法的有效性,并比较了不同阶次波束域Root—MUSIC算法的估计性能。 相似文献
914.
优化物流中心配送方案的遗传算法 总被引:25,自引:0,他引:25
提出了一种配送方案模型 ,该模型在满足车辆满载约束的同时充分考虑货物的运到期限 ,通过实例计算表明 ,该算法对确定配送装车方案是可行和有效的. 相似文献
915.
Li LayuanWuhan University of Water Transportation Engineering Wuhan P.R.China 《系统工程与电子技术(英文版)》1992,(4)
A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)相似文献
916.
We propose a development stemming from Roux (1988). The principle is progressively to modify the dissimilarities so that every quadruple satisfies not only the additive inequality, as in Roux's method, but also all triangle inequalities. Our method thus ensures that the results are tree distances even when the observed dissimilarities are nonmetric. The method relies on the analytic solution of the least-squares projection onto a tree distance of the dissimilarities attached to a single quadruple. This goal is achieved by using geometric reasoning which also enables an easy proof of algorithm's convergence. This proof is simpler and more complete than that of Roux (1988) and applies to other similar reduction methods based on local least-squares projection. The method is illustrated using Case's (1978) data. Finally, we provide a comparative study with simulated data and show that our method compares favorably with that of Studier and Keppler (1988) which follows in the ADDTREE tradition (Sattath and Tversky 1977). Moreover, this study seems to indicate that our method's results are generally close to the global optimum according to variance accounted for.We offer sincere thanks to Gilles Caraux, Bernard Fichet, Alain Guénoche, and Maurice Roux for helpful discussions, advice, and for reading the preliminary versions of this paper. We are grateful to three anonymous referees and to the editor for many insightful comments. This research was supported in part by the GREG and the IA2 network. 相似文献
917.
This paper provides a new sorting algorithm called “Only-Once-Sorting” algorithm. Using a mathematical formula, this algorithm
can put elements in the positions they should be stored only once, then compacts them. The algorithm completes sorting a sequence
ofn elements in a calculation time of O(n).
Xu Xusong: born in June 1945. Professor. Current research interest is in data structure and algorithm, information systems
analysis and design 相似文献
918.
计算机时钟同步技术研究 总被引:26,自引:1,他引:25
首先介绍了和分析了计算机时钟同步系统的主要理论与技术,研究了同步系统的三个主要组成部分,然后研究了应用最为广泛的绝对物理时钟同步系统的设计方法,对其两种核心算法:CRI算法和PCS算法进行了详细的分析及性能比较,作为上述时钟同步理论的一个应用例子,本文最后简要介绍了基于网络时间协议(NTP)的同步技术及其软件实现。 相似文献
919.
S. C. Mitchell R. H. Waring D. Land W. V. Thorpe 《Cellular and molecular life sciences : CMLS》1987,43(4):382-383
Summary The production of odorous urine after the ingestion of asparagus has been shown to occur in 43% of 800 volunteers investigated. This characteristics is reproducible over a 12-month-period and has been shown to remain with individuals for virtually a lifetime. Family studies suggest that the ability to produce the odorous urine is inherited as an autosomal dominant trait. 相似文献
920.
Summary
Agrobacterium tumefaciens A208 with nopaline plasmid pTiT37 was used to obtain stem tumors on plantlets ofFagraea fragrans grown in vitro. Bacterial elimination and tissue proliferation were simultaneously achieved by growing tumors on cefatoxime medium. After some tissue growth the shoots regenerated. An examination of these showed the presence of nopaline, indicating genetic transformation by T-DNA. 相似文献