全文获取类型
收费全文 | 17854篇 |
免费 | 2597篇 |
国内免费 | 1365篇 |
专业分类
电工技术 | 5361篇 |
技术理论 | 1篇 |
综合类 | 1709篇 |
化学工业 | 373篇 |
金属工艺 | 744篇 |
机械仪表 | 2103篇 |
建筑科学 | 440篇 |
矿业工程 | 445篇 |
能源动力 | 299篇 |
轻工业 | 143篇 |
水利工程 | 390篇 |
石油天然气 | 238篇 |
武器工业 | 234篇 |
无线电 | 3443篇 |
一般工业技术 | 1121篇 |
冶金工业 | 406篇 |
原子能技术 | 74篇 |
自动化技术 | 4292篇 |
出版年
2024年 | 95篇 |
2023年 | 282篇 |
2022年 | 421篇 |
2021年 | 514篇 |
2020年 | 534篇 |
2019年 | 471篇 |
2018年 | 524篇 |
2017年 | 678篇 |
2016年 | 749篇 |
2015年 | 905篇 |
2014年 | 1212篇 |
2013年 | 1079篇 |
2012年 | 1450篇 |
2011年 | 1610篇 |
2010年 | 1247篇 |
2009年 | 1307篇 |
2008年 | 1225篇 |
2007年 | 1420篇 |
2006年 | 1193篇 |
2005年 | 942篇 |
2004年 | 725篇 |
2003年 | 657篇 |
2002年 | 503篇 |
2001年 | 422篇 |
2000年 | 356篇 |
1999年 | 281篇 |
1998年 | 196篇 |
1997年 | 166篇 |
1996年 | 146篇 |
1995年 | 109篇 |
1994年 | 87篇 |
1993年 | 76篇 |
1992年 | 52篇 |
1991年 | 46篇 |
1990年 | 34篇 |
1989年 | 24篇 |
1988年 | 20篇 |
1987年 | 13篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1966年 | 1篇 |
1964年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
141.
提出一种新的图像去噪方法,它是Besov空间的变分模型,在负实数次Sobolev空间上定义了数据项,用Besov半范数定义了正则项。并详细推导了变分模型在Besov空间的阈值求解公式,先做一个Contourlet变换域的小阈值收缩,然后再利用该模型去噪。去除噪声的同时也损失了部分边缘信息,把边缘分为四种情况,针对不同情况确定相应的边缘补偿方法。实验表明该模型具有良好的去噪效果。 相似文献
142.
Bumhwi KimAuthor Vitae 《Neurocomputing》2011,74(4):646-655
A new incrementally growing neural network model, called the growing fuzzy topology ART (GFTART) model, is proposed based on integrating the conventional fuzzy ART model with the incremental topology-preserving mechanism of the growing cell structure (GCS) model. This is in addition, to a new training algorithm, called the push-pull learning algorithm. The proposed GFTART model has two purposes: First, to reduce the proliferation of incrementally generated nodes in the F2 layer by the conventional fuzzy ART model based on replacing each F2 node with a GCS. Second, to enhance the class-dependent clustering representation ability of the GCS model by including the categorization property of the conventional fuzzy ART model. In addition, the proposed push-pull training algorithm enhances the cluster discriminating property and partially improves the forgetting problem of the training algorithm in the GCS model. 相似文献
143.
V. Malathi S. BaskarK. Ramar 《Engineering Applications of Artificial Intelligence》2011,24(5):880-887
This paper proposes a new approach based on combined Wavelet Transform-Extreme Learning Machine (WT-ELM) technique for fault section identification (whether the fault is before or after the series capacitor as observed from the relay point), classification and location in a series compensated transmission line. This method uses the samples of fault currents for half cycle duration from the inception of fault. The features of fault currents are extracted by first level decomposition of the current samples using discrete wavelet transform (DWT) and the extracted features are applied as inputs to ELMs for fault section identification, classification and location. The feasibility of the proposed method has been tested on a 400 kV, 300 km series compensated transmission line for all the ten types of faults using MATLAB simulink. On testing 28,800 fault cases with varying fault resistance, fault inception angle, fault distance, load angle, percentage compensation level and source impedance, the performance of the proposed method has been found to be quite promising. The results also indicate that the proposed method is robust to wide variation in system and operating conditions. 相似文献
144.
A structured P2P network based on the small world phenomenon 总被引:1,自引:0,他引:1
In this paper, we propose a new structured P2P overlay network, named SW-Uinta(small-world). In order to reduce the routing
latency, we firstly construct the Uinta network in which both physical characteristics of network and data semantic are considered.
Furthermore, based on Uinta, a nondeterministic caching strategy is employed to allow for poly-logarithmic search time while
having only a constant cache size. Compared with the deterministic caching strategy proposed by previous P2P systems, the
nondeterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries
in the cache table of peer nodes can be updated by subsequent queries rather than only by running stabilization periodically.
In the following, a novel cache replacement scheme, named the SW cache replacement scheme, is used to improve lookup performance,
which has proved to satisfy the small-world principle. So we call this network SW-Uinta(small-world). After that, according
to the theoretical analysis, it can be proved that SW-Uinta(small-world) can get O((log 2
N)/k) search time with O(k) cache size. Lastly, the performance of SW-Uinta(small-world) is compared with those of other structured P2P networks such
as Chord and Uinta. It shows that SW-Uinta(small-world) can achieve improved object lookup performance and reduce maintenance
cost.
相似文献
Hai Jin (Corresponding author)Email: |
145.
Fethallah Benmansour Laurent D. Cohen 《Journal of Mathematical Imaging and Vision》2009,33(2):209-221
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the minimal
path approach. First, an initial point on the desired contour is chosen by the user. Next, new keypoints are detected automatically
using a front propagation approach. We assume that the desired object has a closed boundary. This a-priori knowledge on the
topology is used to devise a relevant criterion for stopping the keypoint detection and front propagation. The final domain
visited by the front will yield a band surrounding the object of interest. Linking pairs of neighboring keypoints with minimal
paths allows us to extract a closed contour from a 2D image. This approach can also be used for finding an open curve giving
extra information as stopping criteria. Detection of a variety of objects on real images is demonstrated. Using a similar
idea, we can extract networks of minimal paths from a 3D image called Geodesic Meshing. The proposed method is applied to
3D data with promising results.
相似文献
Laurent D. CohenEmail: |
146.
147.
148.
149.
150.
Lijing Dong Baihai Zhang Sing Kiong Nguang 《International journal of systems science》2016,47(9):2193-2200
This paper addresses the tracking problem of a class of multi-agent systems under uncertain communication environments which has been modelled by a finite number of constant Laplacian matrices together with their corresponding scheduling functions. Sliding mode control method is applied to solve this nonlinear tracking problem under a time-varying topology. The controller of each tracking agent has been designed by using only its own and neighbours’ information. Sufficient conditions for the existence of a sliding mode control tracking strategy have been provided by the solvability of linear matrix inequalities. At the end of this work, numerical simulations are employed to demonstrate the effectiveness of the proposed sliding mode control tracking strategy. 相似文献