全文获取类型
收费全文 | 38967篇 |
免费 | 4593篇 |
国内免费 | 2750篇 |
专业分类
电工技术 | 5818篇 |
综合类 | 3374篇 |
化学工业 | 1737篇 |
金属工艺 | 1212篇 |
机械仪表 | 5767篇 |
建筑科学 | 2126篇 |
矿业工程 | 1119篇 |
能源动力 | 902篇 |
轻工业 | 873篇 |
水利工程 | 743篇 |
石油天然气 | 801篇 |
武器工业 | 678篇 |
无线电 | 6338篇 |
一般工业技术 | 5013篇 |
冶金工业 | 1342篇 |
原子能技术 | 823篇 |
自动化技术 | 7644篇 |
出版年
2024年 | 166篇 |
2023年 | 487篇 |
2022年 | 842篇 |
2021年 | 991篇 |
2020年 | 1124篇 |
2019年 | 902篇 |
2018年 | 920篇 |
2017年 | 1371篇 |
2016年 | 1536篇 |
2015年 | 1710篇 |
2014年 | 2482篇 |
2013年 | 2213篇 |
2012年 | 2907篇 |
2011年 | 3026篇 |
2010年 | 2271篇 |
2009年 | 2330篇 |
2008年 | 2451篇 |
2007年 | 2819篇 |
2006年 | 2523篇 |
2005年 | 2061篇 |
2004年 | 1833篇 |
2003年 | 1578篇 |
2002年 | 1255篇 |
2001年 | 1096篇 |
2000年 | 932篇 |
1999年 | 751篇 |
1998年 | 592篇 |
1997年 | 679篇 |
1996年 | 469篇 |
1995年 | 368篇 |
1994年 | 348篇 |
1993年 | 275篇 |
1992年 | 195篇 |
1991年 | 150篇 |
1990年 | 134篇 |
1989年 | 87篇 |
1988年 | 79篇 |
1987年 | 64篇 |
1986年 | 35篇 |
1985年 | 34篇 |
1984年 | 46篇 |
1983年 | 26篇 |
1982年 | 26篇 |
1981年 | 13篇 |
1977年 | 8篇 |
1973年 | 7篇 |
1964年 | 7篇 |
1959年 | 10篇 |
1956年 | 7篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
本文提出了将智能全站仪这种精密测量仪器广泛应用于田赛项目测量中,并结合其他科技元素用于解决田赛项目中跳远、投掷等项目的测量及数据管理问题,实现实时、自动、准确地裁定和报告比赛成绩。 相似文献
2.
Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm. 相似文献
3.
Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers 下载免费PDF全文
Youssouf Ould‐Cheikh‐Mouhamedou 《International Journal of Communication Systems》2015,28(9):1572-1579
The knowledge of turbo code's minimum Hamming distance (dmin) and its corresponding codeword multiplicity (Amin) is of a great importance because the error correction capability of a code is strongly tied to the values of dmin and Amin. Unfortunately, the computational complexity associated with the search for dmin and Amin can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and Amin values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd. 相似文献
4.
5.
Hai Huang Haichao An Haibo Ma Shenyan Chen 《International journal for numerical methods in engineering》2019,117(3):291-315
This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization. 相似文献
6.
如今我国信息化技术全面发展,尤其对于工程测量工作领域来讲,不管是在工程建设和管理方面都产生不小的支撑引导效用。由此,笔者具体结合如今工程建设信息化测绘核心任何以及设备布置细节,进行结构整体安全管理周期和周边地理空间信息技术发展能效整理解析,试图将工程测量最新发展机遇和技术挑战问题处理完全。希望能够借此为日后一定时期范围内相关工程测量规划主体提供合理指导性建议内容,最终为我国各类工程事业可持续发展前景绽放奠定深刻适应基础。 相似文献
7.
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. 相似文献
8.
以一种新的距离度量作为反馈的相关跟踪方法 总被引:5,自引:1,他引:4
基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对 收稿日期:2003 08 31; 修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。 要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。 相似文献
9.
A new and original method of calibrating helium leaks that makes it possible to take into account the existence of a number of auxiliary phenomena is described. For this purpose, a hollow leak the purpose of which is to reproduce only desorbed gas flows, is introduced into the vacuum system of the calibration bench. Analysis of the results of corresponding cumulation measurements makes it possible to introduce corrections for these phenomena. 相似文献
10.
A method of measuring and identifying the static parameters of a bipolar transistor is considered. The characteristic of the transistor, from which the parameters of the model are determined, is chosen depending on what group the calculated parameters belong to. The characteristics are measured in such a way that the equations of the model describing them can be reduced to the simplest form. 相似文献