全文获取类型
收费全文 | 66789篇 |
免费 | 7252篇 |
国内免费 | 4237篇 |
专业分类
电工技术 | 5479篇 |
技术理论 | 2篇 |
综合类 | 6000篇 |
化学工业 | 9756篇 |
金属工艺 | 3803篇 |
机械仪表 | 4425篇 |
建筑科学 | 5347篇 |
矿业工程 | 2114篇 |
能源动力 | 1710篇 |
轻工业 | 6769篇 |
水利工程 | 1748篇 |
石油天然气 | 2557篇 |
武器工业 | 792篇 |
无线电 | 7455篇 |
一般工业技术 | 6571篇 |
冶金工业 | 2677篇 |
原子能技术 | 974篇 |
自动化技术 | 10099篇 |
出版年
2024年 | 427篇 |
2023年 | 1306篇 |
2022年 | 2684篇 |
2021年 | 3420篇 |
2020年 | 2575篇 |
2019年 | 1944篇 |
2018年 | 2167篇 |
2017年 | 2459篇 |
2016年 | 2119篇 |
2015年 | 3085篇 |
2014年 | 4041篇 |
2013年 | 4623篇 |
2012年 | 5346篇 |
2011年 | 5489篇 |
2010年 | 5150篇 |
2009年 | 4751篇 |
2008年 | 4606篇 |
2007年 | 4457篇 |
2006年 | 3818篇 |
2005年 | 3060篇 |
2004年 | 2212篇 |
2003年 | 1580篇 |
2002年 | 1473篇 |
2001年 | 1186篇 |
2000年 | 1079篇 |
1999年 | 808篇 |
1998年 | 434篇 |
1997年 | 386篇 |
1996年 | 362篇 |
1995年 | 296篇 |
1994年 | 214篇 |
1993年 | 167篇 |
1992年 | 129篇 |
1991年 | 95篇 |
1990年 | 58篇 |
1989年 | 68篇 |
1988年 | 47篇 |
1987年 | 24篇 |
1986年 | 24篇 |
1985年 | 12篇 |
1984年 | 19篇 |
1983年 | 10篇 |
1982年 | 6篇 |
1981年 | 12篇 |
1980年 | 21篇 |
1979年 | 8篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1959年 | 8篇 |
1951年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
电网智能综合补偿系统的设计 总被引:1,自引:0,他引:1
电网智能综合补偿系统可根据电网的动态变化情况,对电网的电压、功能率因数、谐波及三相不平均等因素实现综合补偿,文中详细介绍了这一基于80C196的智能控制系统的基本结构和软硬件设计思想,实验结果表明了该系统的可行性和智能控制方法的有效性。 相似文献
72.
ZHANG Jie 《数字社区&智能家居》2008,(35)
应用第二代VLAN技术,以锐捷S2126交换机为基础,设计并实现了一个解决企业内部管理的交换机网络互连方案。 相似文献
73.
74.
Batch Nearest Neighbor Search for Video Retrieval 总被引:2,自引:0,他引:2
Jie Shao Zi Huang Heng Tao Shen Xiaofang Zhou Ee-Peng Lim Yijun Li 《Multimedia, IEEE Transactions on》2008,10(3):409-420
To retrieve similar videos to a query clip from a large database, each video is often represented by a sequence of high- dimensional feature vectors. Typically, given a query video containing m feature vectors, an independent nearest neighbor (NN) search for each feature vector is often first performed. After completing all the NN searches, an overall similarity is then computed, i.e., a single content-based video retrieval usually involves m individual NN searches. Since normally nearby feature vectors in a video are similar, a large number of expensive random disk accesses are expected to repeatedly occur, which crucially affects the overall query performance. Batch nearest neighbor (BNN) search is stated as a batch operation that performs a number of individual NN searches. This paper presents a novel approach towards efficient high-dimensional BNN search called dynamic query ordering (DQO) for advanced optimizations of both I/O and CPU costs. Observing the overlapped candidates (or search space) of a pervious query may help to further reduce the candidate sets of subsequent queries, DQO aims at progressively finding a query order such that the common candidates among queries are fully utilized to maximally reduce the total number of candidates. Modelling the candidate set relationship of queries by a candidate overlapping graph (COG), DQO iteratively selects the next query to be executed based on its estimated pruning power to the rest of queries with the dynamically updated COG. Extensive experiments are conducted on real video datasets and show the significance of our BNN query processing strategy. 相似文献
75.
Yan R Zhang J Yang J Hauptmann AG 《IEEE transactions on pattern analysis and machine intelligence》2006,28(4):578-593
To deal with the problem of insufficient labeled data in video object classification, one solution is to utilize additional pairwise constraints that indicate the relationship between two examples, i.e., whether these examples belong to the same class or not. In this paper, we propose a discriminative learning approach which can incorporate pairwise constraints into a conventional margin-based learning framework. Different from previous work that usually attempts to learn better distance metrics or estimate the underlying data distribution, the proposed approach can directly model the decision boundary and, thus, require fewer model assumptions. Moreover, the proposed approach can handle both labeled data and pairwise constraints in a unified framework. In this work, we investigate two families of pairwise loss functions, namely, convex and nonconvex pairwise loss functions, and then derive three pairwise learning algorithms by plugging in the hinge loss and the logistic loss functions. The proposed learning algorithms were evaluated using a people identification task on two surveillance video data sets. The experiments demonstrated that the proposed pairwise learning algorithms considerably outperform the baseline classifiers using only labeled data and two other pairwise learning algorithms with the same amount of pairwise constraints. 相似文献
76.
77.
XIE Qiang XIE Jie CHI LiNa LI ChunJie WU DeYi ZHANG ZhenJia KONG HaiNan 《中国科学:技术科学(英文版)》2013,(7):1749-1757
A zeolite (ZFA) was synthesized from coal fly ash and then modified using hexadecyltrimethylammonium. The surfactant modified ZFA (SMZFA) was evaluated for its versatility to sequester multiple classes of pollutants from water. The target pollutants include ionic inorganic pollutants (ammonium and phosphate), ionic organic pollutants (methylene blue and humic acid), ionizable organic pollutants (bisphenol A,-chlorophenol and phenol, with different pKa), and electrically neutral or-ganic pollutants (aniline, nitrobenzene, and naphthalene, with different hydrophobicity). The SMZFA showed high potential for the retention of ammonium and phosphate, being comparable with ZFA. While the negative charge in the internal pores of zeolite was responsible for the retention of ammonium, the oxides of CaO, Al2O3and Fe2O3in the non-zeolite fraction, which originated from coal fly ash but received modification during zeolite synthesis, accounted for the removal of phosphate. Results also showed that while ZFA had little affinity for humic acid, the ionizable, and the electrically neutral organic compounds, SMZFA exhibited greatly enhanced adsorption capacity. Thus, the surfactant modified external surface, which formed a bilayer micelle of zeolite, imparts a hydrophobic characteristic that enables the uptake of the organic pollutants. We showed that SMZFA is a promising versatile sorbent for water treatment. 相似文献
78.
Dai J Feng J Zhou J 《IEEE transactions on pattern analysis and machine intelligence》2012,34(8):1618-1632
During the past decade, many efforts have been made to use palmprints as a biometric modality. However, most of the existing palmprint recognition systems are based on encoding and matching creases, which are not as reliable as ridges. This affects the use of palmprints in large-scale person identification applications where the biometric modality needs to be distinctive as well as insensitive to changes in age and skin conditions. Recently, several ridge-based palmprint matching algorithms have been proposed to fill the gap. Major contributions of these systems include reliable orientation field estimation in the presence of creases and the use of multiple features in matching, while the matching algorithms adopted in these systems simply follow the matching algorithms for fingerprints. However, palmprints differ from fingerprints in several aspects: 1) Palmprints are much larger and thus contain a large number of minutiae, 2) palms are more deformable than fingertips, and 3) the quality and discrimination power of different regions in palmprints vary significantly. As a result, these matchers are unable to appropriately handle the distortion and noise, despite heavy computational cost. Motivated by the matching strategies of human palmprint experts, we developed a novel palmprint recognition system. The main contributions are as follows: 1) Statistics of major features in palmprints are quantitatively studied, 2) a segment-based matching and fusion algorithm is proposed to deal with the skin distortion and the varying discrimination power of different palmprint regions, and 3) to reduce the computational complexity, an orientation field-based registration algorithm is designed for registering the palmprints into the same coordinate system before matching and a cascade filter is built to reject the nonmated gallery palmprints in early stage. The proposed matcher is tested by matching 840 query palmprints against a gallery set of 13,736 palmprints. Experimental results show that the proposed matcher outperforms the existing matchers a lot both in matching accuracy and speed. 相似文献
79.
Pan JJ Pan SJ Yin J Ni LM Yang Q 《IEEE transactions on pattern analysis and machine intelligence》2012,34(3):587-600
Recent years have witnessed the growing popularity of sensor and sensor-network technologies, supporting important practical applications. One of the fundamental issues is how to accurately locate a user with few labeled data in a wireless sensor network, where a major difficulty arises from the need to label large quantities of user location data, which in turn requires knowledge about the locations of signal transmitters or access points. To solve this problem, we have developed a novel machine learning-based approach that combines collaborative filtering with graph-based semi-supervised learning to learn both mobile users' locations and the locations of access points. Our framework exploits both labeled and unlabeled data from mobile devices and access points. In our two-phase solution, we first build a manifold-based model from a batch of labeled and unlabeled data in an offline training phase and then use a weighted k-nearest-neighbor method to localize a mobile client in an online localization phase. We extend the two-phase colocalization to an online and incremental model that can deal with labeled and unlabeled data that come sequentially and adapt to environmental changes. Finally, we embed an action model to the framework such that additional kinds of sensor signals can be utilized to further boost the performance of mobile tracking. Compared to other state-of-the-art systems, our framework has been shown to be more accurate while requiring less calibration effort in our experiments performed on three different testbeds. 相似文献
80.
This paper concerns the problem of designing a modified repetitive-control system for a class of strictly proper plants. Repetitive control involves two types of actions: control and learning; but the insertion of a low-pass filter in a modified repetitive controller, which is employed to guarantee the stability of the system, mixes the two actions together. In this paper, a continuous–discrete two-dimensional model is first constructed. Next, the continuity of repetitive control and Lyapunov stability theory are applied to the model to establish two linear-matrix-inequality (LMI) based sufficient stability conditions, one for the design of the cutoff angular frequency and one for the design of the feedback gains. The features of these conditions are exploited to develop an iterative algorithm that searches for the best combination of the maximum cutoff angular frequency of the low-pass filter and the feedback gains. A numerical example illustrates the design procedure and demonstrates the validity of the method. 相似文献