全文获取类型
收费全文 | 15044篇 |
免费 | 2244篇 |
国内免费 | 1552篇 |
专业分类
电工技术 | 1343篇 |
综合类 | 2083篇 |
化学工业 | 748篇 |
金属工艺 | 316篇 |
机械仪表 | 911篇 |
建筑科学 | 879篇 |
矿业工程 | 305篇 |
能源动力 | 410篇 |
轻工业 | 479篇 |
水利工程 | 490篇 |
石油天然气 | 297篇 |
武器工业 | 195篇 |
无线电 | 1438篇 |
一般工业技术 | 924篇 |
冶金工业 | 339篇 |
原子能技术 | 63篇 |
自动化技术 | 7620篇 |
出版年
2024年 | 49篇 |
2023年 | 152篇 |
2022年 | 242篇 |
2021年 | 347篇 |
2020年 | 461篇 |
2019年 | 426篇 |
2018年 | 411篇 |
2017年 | 502篇 |
2016年 | 594篇 |
2015年 | 683篇 |
2014年 | 944篇 |
2013年 | 961篇 |
2012年 | 1181篇 |
2011年 | 1290篇 |
2010年 | 1055篇 |
2009年 | 1062篇 |
2008年 | 1201篇 |
2007年 | 1237篇 |
2006年 | 1069篇 |
2005年 | 912篇 |
2004年 | 727篇 |
2003年 | 639篇 |
2002年 | 487篇 |
2001年 | 417篇 |
2000年 | 344篇 |
1999年 | 243篇 |
1998年 | 195篇 |
1997年 | 166篇 |
1996年 | 155篇 |
1995年 | 133篇 |
1994年 | 102篇 |
1993年 | 71篇 |
1992年 | 67篇 |
1991年 | 56篇 |
1990年 | 52篇 |
1989年 | 45篇 |
1988年 | 35篇 |
1987年 | 20篇 |
1986年 | 9篇 |
1985年 | 11篇 |
1984年 | 7篇 |
1983年 | 14篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1976年 | 4篇 |
1963年 | 7篇 |
1961年 | 8篇 |
1960年 | 4篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Yasoub Eghbali Mahmoud Ferdosizade Naeiny 《International Journal of Communication Systems》2020,33(14)
In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals. 相似文献
2.
3.
针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题,研究一种八叉树索引结合OSG分页结点的快速可视化方法,可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织,建立各层级的八叉树结点并以文件映射的方式分块保存,对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术,对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析,结果表明所提方法具有索引建立速度快、内存占用小等优点,同时可视化交互更加流畅,适用于各种配置计算机下海量点云数据的调度管理与实时可视化。 相似文献
4.
5.
6.
7.
Sachiyuki Hasegawa Kazuyuki Shimizu Takeshi Kobayashi Masakazu Matsubara 《Journal of chemical technology and biotechnology (Oxford, Oxfordshire : 1986)》1985,35(1):33-42
Repeated batch operation using two fermentors (RBTF) to penicillin fermentation was demonstrated by computer simulation to improve productivity. Three operation modes were compared: chemostat, repeated batch operation using a single fermentor (RBSF) and RBTF; in each case account was made of the lag period before growth. The simulated fermentor performances were assessed on the basis of the penicillin productivity and concentration; the simulation was based on published batch fermentation data. It was shown that RBTF was superior to RBSF and chemostat. The advantage of RBTF increased as the lag period became greater. 相似文献
8.
A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements
for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained,
the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy
of the solution of this system is ten times higher than when using three field elements.
__________
Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007. 相似文献
9.
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. 相似文献