全文获取类型
收费全文 | 24798篇 |
免费 | 3531篇 |
国内免费 | 1318篇 |
专业分类
化学 | 2613篇 |
晶体学 | 46篇 |
力学 | 1883篇 |
综合类 | 372篇 |
数学 | 5853篇 |
物理学 | 5389篇 |
无线电 | 13491篇 |
出版年
2024年 | 87篇 |
2023年 | 323篇 |
2022年 | 580篇 |
2021年 | 674篇 |
2020年 | 670篇 |
2019年 | 591篇 |
2018年 | 644篇 |
2017年 | 850篇 |
2016年 | 1112篇 |
2015年 | 1136篇 |
2014年 | 1781篇 |
2013年 | 1812篇 |
2012年 | 1748篇 |
2011年 | 1914篇 |
2010年 | 1367篇 |
2009年 | 1522篇 |
2008年 | 1653篇 |
2007年 | 1710篇 |
2006年 | 1459篇 |
2005年 | 1236篇 |
2004年 | 1048篇 |
2003年 | 904篇 |
2002年 | 811篇 |
2001年 | 632篇 |
2000年 | 570篇 |
1999年 | 460篇 |
1998年 | 434篇 |
1997年 | 351篇 |
1996年 | 303篇 |
1995年 | 238篇 |
1994年 | 183篇 |
1993年 | 166篇 |
1992年 | 138篇 |
1991年 | 80篇 |
1990年 | 73篇 |
1989年 | 60篇 |
1988年 | 58篇 |
1987年 | 37篇 |
1986年 | 36篇 |
1985年 | 44篇 |
1984年 | 40篇 |
1983年 | 11篇 |
1982年 | 34篇 |
1981年 | 12篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 7篇 |
1976年 | 4篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
1.
2.
3.
4.
Namyong Kim 《ETRI Journal》2006,28(2):155-161
In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance. 相似文献
5.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
6.
论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。 相似文献
7.
改进型遗传算法在加载天线设计中的运用 总被引:5,自引:2,他引:3
遗传算法是一种全新的优化搜索方法,可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处,介绍了一种改进型的遗传算法,并阐述了其在短波宽带集总加载天线优化设计中的运用。 相似文献
8.
本文概述了离子注入过程中污染产生的原因和防止污染的措施,特别强调了对微粒污染和金属污染的防护以满足ULSI加工对离子注入的要求。 相似文献
9.
In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively. 相似文献
10.
Jinchao Xu 《应用数学学报(英文版)》2002,18(2):185-200
Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids. 相似文献