全文获取类型
收费全文 | 9732篇 |
免费 | 1551篇 |
国内免费 | 1000篇 |
专业分类
电工技术 | 1229篇 |
综合类 | 1109篇 |
化学工业 | 364篇 |
金属工艺 | 205篇 |
机械仪表 | 620篇 |
建筑科学 | 628篇 |
矿业工程 | 594篇 |
能源动力 | 193篇 |
轻工业 | 155篇 |
水利工程 | 250篇 |
石油天然气 | 296篇 |
武器工业 | 219篇 |
无线电 | 1457篇 |
一般工业技术 | 665篇 |
冶金工业 | 263篇 |
原子能技术 | 58篇 |
自动化技术 | 3978篇 |
出版年
2024年 | 36篇 |
2023年 | 114篇 |
2022年 | 267篇 |
2021年 | 320篇 |
2020年 | 356篇 |
2019年 | 278篇 |
2018年 | 313篇 |
2017年 | 379篇 |
2016年 | 414篇 |
2015年 | 542篇 |
2014年 | 705篇 |
2013年 | 687篇 |
2012年 | 864篇 |
2011年 | 843篇 |
2010年 | 685篇 |
2009年 | 655篇 |
2008年 | 709篇 |
2007年 | 789篇 |
2006年 | 598篇 |
2005年 | 495篇 |
2004年 | 383篇 |
2003年 | 380篇 |
2002年 | 304篇 |
2001年 | 240篇 |
2000年 | 172篇 |
1999年 | 148篇 |
1998年 | 113篇 |
1997年 | 100篇 |
1996年 | 61篇 |
1995年 | 64篇 |
1994年 | 59篇 |
1993年 | 50篇 |
1992年 | 32篇 |
1991年 | 19篇 |
1990年 | 16篇 |
1989年 | 14篇 |
1988年 | 10篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1965年 | 4篇 |
1964年 | 3篇 |
1963年 | 3篇 |
1961年 | 3篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
801.
802.
用多个对应的后向神经网络进行同杆双回线故障识别及测距的模式 总被引:6,自引:4,他引:6
电力系统高压同杆双回输电线的应用日益增多,但其故障识别与测距的问题尚未完全解决,同杆双回线因存在回路间耦合等因素,使得用单一的神经网络进行故障识别与测距的结果并不理想。作者比较分析了BP网络与Kohonen网络在同杆双回线测距方面的优缺点,提出了将故障识别与测距任务分配到多个网络的方法即将同杆双回线的每种故障模式各与一个BP人工神经网络对应,在线路上取一些固定点作为标志点,训练成功的BP网络输出的模糊值代表了标志点上发生故障的可能性。用模糊值构成插值曲线,根据曲线的相对位置确定故障模式,并由曲线的最小值求得故障距离。大量仿真表明该法可以准确可靠地确定故障模式并能测得较高的测距精度。 相似文献
803.
0 INTRODUCTIONTheresearchonnanocompositesmaterialshasbe comeanewstudyfocusinrecentyears[1] .Thecom positesarecombinedwithparticle particle[2 ] ,orpar ticle fiber[3] .Thestudyonbariumtitanatecompositesiswidespreadandagreatprogresshasbeenmade .Butitisonlylimitedin… 相似文献
804.
805.
806.
探讨了计算机网络技术在现代教学中的应用,就基于Web的多媒体教学系统的功能和系统结构进行了较为深入的研究,详细地阐述了设计网络多媒体教学系统的关键技术及实现方法. 相似文献
807.
Zengping Tian Hongjun Lu Wenyun Ji Aoying Zhou Zhong Tian 《International Journal on Digital Libraries》2002,3(4):325-331
Detecting and eliminating duplicate records is one of the major tasks for improving data quality. The task, however, is not
as trivial as it seems since various errors, such as character insertion, deletion, transposition, substitution, and word
switching, are often present in real-world databases. This paper presents an n-gram-based approach for detecting duplicate
records in large databases. Using the approach, records are first mapped to numbers based on the n-grams of their field values.
The obtained numbers are then clustered, and records within a cluster are taken as potential duplicate records. Finally, record
comparisons are performed within clusters to identify true duplicate records. The unique feature of this method is that it
does not require preprocessing to correct syntactic or typographical errors in the source data in order to achieve high accuracy.
Moreover, sorting the source data file is unnecessary. Only a fixed number of database scans is required. Therefore, compared
with previous methods, the algorithm is more time efficient.
Published online: 22 August 2001 相似文献
808.
Reasoning About Distance Based on Fuzzy Sets 总被引:1,自引:2,他引:1
Hans W. Guesgen 《Applied Intelligence》2002,17(3):265-270
Most computer systems that deal with issues of space reason about distance by using a metric. For example, most geographic information systems apply the euclidean metric, requiring all subjects to adhere to the same view of space. As a result, dealing with imprecise or uncertain geographic information becomes difficult or sometimes even impossible. In this paper, we describe a way of reasoning about distance that is not restricted to euclidean geometry. The idea is to use fuzzy sets to describe how close objects are to each other. 相似文献
809.
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The BSP (or CGM) machine is a parallel multicomputer consisting of p processors for which a memory of n words is evenly distributed and each processor can send and receive at most h messages in a superstep. The faults are deterministic (i.e., worst-case distributions of faults are considered) and static (i.e., they do not change in the course of computation). We assume that a constant fraction of processors are faulty. We present two fault-tolerant simulation techniques for BSP and CGM: 1. A deterministic simulation that achieves O(1) slowdown for local computations and O((logh p)2) slowdown for communications per superstep, provided that a preprocessing is done that requires O((logh p)2) supersteps and linear (in h) computation per processor in each superstep. 2. A randomized simulation that achieves O(1) slowdown for local computations and O(logh p) slowdown for communications per superstep with high probability, after the same (deterministic) preprocessing as above. Our results are fully scalable over all values of p from Θ(1) to Θ(n). Furthermore, our results imply that if pn for 0<<1 and h=Θ((n/p)δ) for 0<δ1 (which hold in almost all practical BSP and CGM computations), algorithms can be made resilient to a constant fraction of processor faults without any asymptotic slowdown. 相似文献
810.
To eliminate the error
of distance measurement caused by amplitude change from signal attenuation, the method based on dual
thresholds is introduced. Thus the precise ultrasonic measurement is accomplished. Combining wiht the mechanical scanning the on-line
detection of roller shape is implemented. 相似文献