全文获取类型
收费全文 | 5426篇 |
免费 | 144篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 68篇 |
综合类 | 7篇 |
化学工业 | 952篇 |
金属工艺 | 118篇 |
机械仪表 | 168篇 |
建筑科学 | 132篇 |
矿业工程 | 6篇 |
能源动力 | 202篇 |
轻工业 | 287篇 |
水利工程 | 10篇 |
石油天然气 | 17篇 |
无线电 | 915篇 |
一般工业技术 | 926篇 |
冶金工业 | 764篇 |
原子能技术 | 26篇 |
自动化技术 | 983篇 |
出版年
2023年 | 27篇 |
2022年 | 95篇 |
2021年 | 131篇 |
2020年 | 39篇 |
2019年 | 62篇 |
2018年 | 77篇 |
2017年 | 80篇 |
2016年 | 101篇 |
2015年 | 105篇 |
2014年 | 148篇 |
2013年 | 428篇 |
2012年 | 264篇 |
2011年 | 351篇 |
2010年 | 300篇 |
2009年 | 356篇 |
2008年 | 293篇 |
2007年 | 254篇 |
2006年 | 209篇 |
2005年 | 167篇 |
2004年 | 148篇 |
2003年 | 140篇 |
2002年 | 110篇 |
2001年 | 108篇 |
2000年 | 78篇 |
1999年 | 102篇 |
1998年 | 307篇 |
1997年 | 195篇 |
1996年 | 161篇 |
1995年 | 99篇 |
1994年 | 105篇 |
1993年 | 103篇 |
1992年 | 56篇 |
1991年 | 41篇 |
1990年 | 41篇 |
1989年 | 40篇 |
1988年 | 39篇 |
1987年 | 20篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 16篇 |
1983年 | 10篇 |
1982年 | 17篇 |
1980年 | 9篇 |
1979年 | 20篇 |
1978年 | 12篇 |
1977年 | 12篇 |
1976年 | 15篇 |
1975年 | 9篇 |
1974年 | 8篇 |
1973年 | 9篇 |
排序方式: 共有5581条查询结果,搜索用时 0 毫秒
91.
Stephen J.H. Yang Jia Zhang Leon Lin Jeffrey J.P. Tsai 《Expert systems with applications》2009,36(7):10312-10324
As a large amount of information is added onto the Internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important. However, how to quickly discover the right resource in a large-scale P2P network without generating too much network traffic remains highly challenging. In this paper, we propose a novel P2P search method, by applying the concept of social grouping and intelligent social search; we derive peers into social groups in a P2P network to improve search performance. Through a super-peer-based architecture, we establish and maintain virtual social groups on top of a P2P network. The interactions between the peers in the P2P network are used to incrementally build the social relationships between the peers in the associated social groups. In such a P2P network, a search query is propagated along the social groups in the overlay social network. Our preliminary experiments have demonstrated that our method can significantly shorten search routes and result in a higher peer search performance. In addition, our method also enhances the trustworthiness of search results because searches go through trusted peers. 相似文献
92.
Ming-Chao Chiang Author Vitae Chun-Wei Tsai Author Vitae Chu-Sing Yang Author Vitae 《Information Sciences》2011,181(4):716-3410
This paper presents an efficient algorithm, called pattern reduction (PR), for reducing the computation time of k-means and k-means-based clustering algorithms. The proposed algorithm works by compressing and removing at each iteration patterns that are unlikely to change their membership thereafter. Not only is the proposed algorithm simple and easy to implement, but it can also be applied to many other iterative clustering algorithms such as kernel-based and population-based clustering algorithms. Our experiments—from 2 to 1000 dimensions and 150 to 10,000,000 patterns—indicate that with a small loss of quality, the proposed algorithm can significantly reduce the computation time of all state-of-the-art clustering algorithms evaluated in this paper, especially for large and high-dimensional data sets. 相似文献
93.
Ribbed helix lip seals for rotating shafts have been widely used to retain oil and exclude contaminants in many applications throughout the industry. The objective of this study is to better understand the basic flow behavior associated with the pumping process of a ribbed helix lip seal. The theoretical model consists of a flow analysis of the lubricating film of the hydraulic fluid in conjunction with a stress analysis of the lip seal distortion. The complicated mechanical interaction between the oil flow and rubber deformation was simulated using a coupled fluid–structure approach implemented in a commercial computational fluid dynamics (CFD) code ESI-CFD, ACE+®. The flow characteristics and rubber deformation around a ribbed helix lip seal were fully resolved in a pumping-rate test environment, where both air and oil sides were filled with oil initially. The three-dimensional pressure field solved by the model via the coupled flow-stress analysis was compared with the predictions obtained from the model via the nondeformable rubber assumption to elucidate the significant effect of the fluid–structure interaction on accurate simulation of the oil pumping behavior. In the rotating speed ranging from 1000 to 6000 rpm, both measured and calculated pumping rates increase with the shaft speed for a ribbed helix lip seal. As compared to the baseline case, calculations with considering the fluid–structure interaction at higher rotary speeds can result in thicker oil films, and in turn produce greater pumping rates. 相似文献
94.
Developing augmented reality (AR) applications for mobile devices and outdoor environments has historically required a number of technical trade-offs related to tracking. One approach is to rely on computer vision which provides very accurate tracking, but can be brittle, and limits the generality of the application. Another approach is to rely on sensor-based tracking which enables widespread use, but at the cost of generally poor tracking performance. In this paper we present and evaluate a new approach, which we call Indirect AR, that enables perfect alignment of virtual content in a much greater number of application scenarios.To achieve this improved performance we replace the live camera view used in video see through AR with a previously captured panoramic image. By doing this we improve the perceived quality of the tracking while still maintaining a similar overall experience. There are some limitations of this technique, however, related to the use of panoramas. We evaluate these boundaries conditions on both a performance and experiential basis through two user studies. The result of these studies indicates that users preferred Indirect AR over traditional AR in most conditions, and when conditions do degrade to the point the experience changes, Indirect AR can still be a very useful tool in many outdoor application scenarios. 相似文献
95.
Maw-Kae Hor Cheng-Yuan Tang Yi-Leh Wu Kai-Hsuan Chan Jeng-Jiun Tsai 《Pattern recognition letters》2011,32(8):1210-1221
This paper proposes robust refinement methods to improve the popular patch multi-view 3D reconstruction algorithm by Furukawa and Ponce (2008). Specifically, a new method is proposed to improve the robustness by removing outliers based on a filtering approach. In addition, this work also proposes a method to divide the 3D points in to several buckets for applying the sparse bundle adjustment algorithm (SBA) individually, removing the outliers and finally merging them. The residuals are used to filter potential outliers to reduce the re-projection error used as the performance evaluation of refinement. In our experiments, the original mean re-projection error is about 47.6. After applying the proposed methods, the mean error is reduced to 2.13. 相似文献
96.
Tich Phuoc Tran Thi Thanh Sang Nguyen Poshiang Tsai Xiaoying Kong 《Artificial Intelligence Review》2011,35(4):369-382
In the modern age of Internet connectivity, advanced information systems have accumulated huge volumes of data. Such fast
growing, tremendous amount of data, collected and stored in large databases has far exceeded our human ability to comprehend
without proper tools. There has been a great deal of research conducted to explore the potential applications of Machine Learning
technologies in Security Informatics. This article studies the Network Security Detection problems in which predictive models
are constructed to detect network security breaches such as spamming. Due to overwhelming volume of data, complexity and dynamics
of computer networks and evolving cyber threats, current security systems suffer limited performance with low detection accuracy
and high number of false alarms. To address such performance issues, a novel Machine Learning algorithm, namely Boosted Subspace
Probabilistic Neural Network (BSPNN), has been proposed which combines a Radial Basis Function Neural Network with an innovative
diversity-based ensemble learning framework. Extensive empirical analyses suggested that BSPNN achieved high detection accuracy
with relatively small computational complexity compared with other conventional detection methods. 相似文献
97.
This paper proposes a fast and robust 3D human face geometric data registration strategy dedicated for image-guided medical
applications. The registration scheme is composed of a coarse transformation stage and a fine-tuning stage. In the first stage,
fuzzy c-mean is used to reduce the data amount of template 3D image, and evolutionary computation is implemented to find optimal
initial pose for the Iterative Closest Point plus k-dimensional (KD) tree scheme. In the second stage, the huge reference
image data are replaced by a Kriging model. The time-consuming search for corresponding points in evaluating the degree of
misalignment is substituted by projecting the points in the template image onto the model. To illustrate the validity and
applicability of the proposed approach, a problem composed of 174 635 points reference image and an 11 280 points template
image is demonstrated. Computational results show that our approach accelerates the registration process from 1361.28 seconds
to 432.85 seconds when compared with the conventional ICP plus K-D tree scheme, while the average misalignment reduces from
11.35 mm to 2.33 mm.
This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January
31–February 2, 2008 相似文献
98.
The purpose of this study was to investigate mapping of user interfaces on consumer electronic appliances. A digital clock with five different interface modes was chosen for the experiment. Forty elderly subjects (above 65 years) and 40 middle-aged subjects (45-64 years) participated in the study. Every subject had to complete three different tasks, namely time setting, alarm time setting and date setting. The researchers investigated what problems were encountered when performing these tasks and collected data such as operational time, the number of total inputs, subjective estimation and interview information. The findings of this study indicated that the interface modes had significant effects on operational time, the number of total inputs and subjective estimation. Finally, the study confirms that when the spatial relationship between buttons and display contents are clearly indicated, the operation is easier to complete. 相似文献
99.
Yang G Stewart CV Sofka M Tsai CL 《IEEE transactions on pattern analysis and machine intelligence》2007,29(11):1973-1989
Our goal is an automated 2D-image-pair registration algorithm capable of aligning images taken of a wide variety of natural and man-made scenes as well as many medical images. The algorithm should handle low overlap, substantial orientation and scale differences, large illumination variations, and physical changes in the scene. An important component of this is the ability to automatically reject pairs that have no overlap or have too many differences to be aligned well.We propose a complete algorithm, including techniques for initialization, for estimating transformation parameters, and for automatically deciding if an estimate is correct. Keypoints extracted and matched between images are used to generate initial similarity transform estimates, each accurate over a small region. These initial estimates are rank-ordered and tested individually in succession. Each estimate is refined using the Dual-Bootstrap ICP algorithm, driven by matching of multiscale features. A three-part decision criteria, combining measurements of alignment accuracy, stability in the estimate, and consistency in the constraints, determines whether the refined transformation estimate is accepted as correct. Experimental results on a data set of 22 challenging image pairs show that the algorithm effectively aligns 19 of the 22 pairs and rejects 99.8% of the misalignments that occur when all possible pairs are tried. The algorithm substantially out-performs algorithms based on keypoint matching alone. 相似文献
100.
Urine is a human specimen that is easily obtained non-invasively for clinical diagnosis. We attempted to enhance the resolution of current human urine proteomes and construct a comprehensive reference database for advanced studies, such as the discovery of biomarkers for renal diseases. Multi-dimensional LC-MS/MS was coupled with de novo sequencing and database matching. The proposed approach improved the identification of not only the proteins, but also the post-translational sites of urinary proteins. We identified 165, 200 and 259 unique gene products in the urine proteomes from males, females and pregnant women, respectively. When all of the results were combined and the redundancies removed, a total of 1095 distinct peptides were identified. Of these, 1016 peptides were associated with 334 unique gene products. In this study, over 100 gene products, including some disease-related proteins, were detected in urine for the first time by proteomic approaches. Various proteins with novel post-translational hydroxylation were identified using the MASCOT program and de novo sequencing. All proteins with peptide information were summarized into a comprehensive urine protein database. We believe that this comprehensive urine proteome database will assist in the identification of urinary proteins/polypeptides whose spectra are difficult to interpret in the discovery of urinary biomarkers. 相似文献