全文获取类型
收费全文 | 5553篇 |
免费 | 663篇 |
国内免费 | 577篇 |
专业分类
电工技术 | 355篇 |
综合类 | 715篇 |
化学工业 | 221篇 |
金属工艺 | 72篇 |
机械仪表 | 283篇 |
建筑科学 | 114篇 |
矿业工程 | 27篇 |
能源动力 | 76篇 |
轻工业 | 57篇 |
水利工程 | 61篇 |
石油天然气 | 117篇 |
武器工业 | 102篇 |
无线电 | 1035篇 |
一般工业技术 | 790篇 |
冶金工业 | 52篇 |
原子能技术 | 98篇 |
自动化技术 | 2618篇 |
出版年
2024年 | 21篇 |
2023年 | 76篇 |
2022年 | 79篇 |
2021年 | 112篇 |
2020年 | 151篇 |
2019年 | 150篇 |
2018年 | 153篇 |
2017年 | 179篇 |
2016年 | 214篇 |
2015年 | 208篇 |
2014年 | 281篇 |
2013年 | 469篇 |
2012年 | 404篇 |
2011年 | 441篇 |
2010年 | 309篇 |
2009年 | 329篇 |
2008年 | 373篇 |
2007年 | 395篇 |
2006年 | 352篇 |
2005年 | 287篇 |
2004年 | 248篇 |
2003年 | 253篇 |
2002年 | 200篇 |
2001年 | 139篇 |
2000年 | 137篇 |
1999年 | 102篇 |
1998年 | 99篇 |
1997年 | 92篇 |
1996年 | 76篇 |
1995年 | 55篇 |
1994年 | 81篇 |
1993年 | 58篇 |
1992年 | 57篇 |
1991年 | 29篇 |
1990年 | 27篇 |
1989年 | 26篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 17篇 |
1985年 | 19篇 |
1984年 | 10篇 |
1983年 | 16篇 |
1982年 | 8篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有6793条查询结果,搜索用时 881 毫秒
11.
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. 相似文献
12.
It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions. 相似文献
13.
本文在反射系数序列为非高斯、平稳和统计独立的随机过程,地震子波为非因果、混合相位的假设条件下,分别应用滑动平均(MA)和自回归滑动平均(ARMA)模型对地震记录进行建模,并采用运算代价较小的基于高阶累积量的线性化求解方法——累积量矩阵方程法进行了子波提取和模型适应性的研究。数值模拟结果和实际地震数据处理结果表明:自回归滑动平均(ARMA)模型比滑动平均(MA)模型具有参数节省、模型更为高效的特点;累积量矩阵方程法可以有效地压制加性高斯噪声,但对累积量样本估计的准确性要求较高;如果累积量样本估计的误差和方差适度,结合自回归滑动平均(ARMA)模型描述的累积量矩阵方程法可以高效、准确地估计出地震子波。 相似文献
14.
一种基于小波逼近的稳定直接自适应控制算法 总被引:3,自引:0,他引:3
针对一类未知不稳定非线性系统,基于小波逼近理论,提出了一种直接自适应控制
算法,并由Lyapnov理论证明了整个控制闭环系统的稳定性. 相似文献
15.
混合Hermite-Lagrange插值之同时逼近 总被引:1,自引:1,他引:0
谢庭藩 《中国计量学院学报》1993,(2)
对于(-1,1)中的结点组{X_k}_(k=1)~n,记l_k(x)为相应的Lagrange插值基本多项式,又记A_n=‖∑(2-x~2-x_k~2)(1-x_k~2)~-1丨l_k(x)‖。对于f∈C_([-1,1)~q与r=[q+2/2],本文证明满足条件H_n(f,x_k)=f(x_k)(k=1,2,…,n),H_n~(s)(f,±1)=f~(s)(±1)(s=0,1,…,n-1)的n+2r-1次代数多项式H_n(f,x)有逼近性质H_n~(s)(f,x)-f~(s)(x)=(?)其中δ_n(x)=n~(-1)(1-x~2)~(1/2),△_n(x)=δ_n(x)+n~(-2).作为证明的重要工具,本文还对n次代数多项式P_n(x),建立了另一形式的Bernstein不等武:若 P_n(x)=O(1)δ_n~q(x)ω(δ_n(x)),则p_n~(S)(X)=O(1)δ_n~(q-2S)(X)ω(δ_n(X))△_n~s(X)。 相似文献
16.
基于局部多项式逼近的变参数梯度估计算法 总被引:1,自引:0,他引:1
本文分析了梯度辨识算法跟踪时变系统的缺点,提出了一种新的基于局部多项式逼近的变参数梯度估计算法。本算法具有良好跟踪性能特别适用于时变系统跟踪且其对噪声的敏感程度与一般梯度估计方法相当。仿真结果验证了其良好性能。 相似文献
17.
Sei‐ichiro Kawase 《International Journal of Satellite Communications and Networking》2005,23(1):67-76
This paper proposes a technique for monitoring the longitudinal motion of geosynchronous satellites. A two‐antenna interferometer is used, with the baseline orientation adjusted to a particular horizontal azimuth. The interferometer then becomes insensitive to the north–south motion of the satellite, and this enables direct measurement of the satellite's longitudinal motion. Longitudes are monitored continuously, with no delay when orbital manoeuvres occur. The proposed technique is particularly useful when two or more satellites are operating in close proximity and their longitudes must be precisely monitored for safety control. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
18.
In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
19.
对称配筋小偏心受压构件的截面设计 总被引:4,自引:1,他引:3
对小偏心受压构件在对称配筋情况下的截面配筋计算,提出用最佳一次逼近多项式简化基本公式,直接按二次方程求解ξ的近似方法,具有精度高,相对误差小,计算方便等优点,可供工程设计人员参考。 相似文献
20.