全文获取类型
收费全文 | 7058篇 |
免费 | 361篇 |
国内免费 | 53篇 |
专业分类
电工技术 | 133篇 |
综合类 | 26篇 |
化学工业 | 1788篇 |
金属工艺 | 118篇 |
机械仪表 | 211篇 |
建筑科学 | 277篇 |
矿业工程 | 6篇 |
能源动力 | 462篇 |
轻工业 | 725篇 |
水利工程 | 76篇 |
石油天然气 | 115篇 |
无线电 | 653篇 |
一般工业技术 | 1142篇 |
冶金工业 | 337篇 |
原子能技术 | 83篇 |
自动化技术 | 1320篇 |
出版年
2024年 | 24篇 |
2023年 | 151篇 |
2022年 | 317篇 |
2021年 | 405篇 |
2020年 | 295篇 |
2019年 | 335篇 |
2018年 | 416篇 |
2017年 | 358篇 |
2016年 | 355篇 |
2015年 | 236篇 |
2014年 | 320篇 |
2013年 | 641篇 |
2012年 | 356篇 |
2011年 | 505篇 |
2010年 | 350篇 |
2009年 | 326篇 |
2008年 | 288篇 |
2007年 | 217篇 |
2006年 | 201篇 |
2005年 | 140篇 |
2004年 | 111篇 |
2003年 | 117篇 |
2002年 | 90篇 |
2001年 | 64篇 |
2000年 | 73篇 |
1999年 | 50篇 |
1998年 | 77篇 |
1997年 | 41篇 |
1996年 | 49篇 |
1995年 | 40篇 |
1994年 | 36篇 |
1993年 | 44篇 |
1992年 | 36篇 |
1991年 | 32篇 |
1990年 | 30篇 |
1989年 | 20篇 |
1988年 | 35篇 |
1987年 | 30篇 |
1986年 | 20篇 |
1985年 | 15篇 |
1984年 | 27篇 |
1983年 | 22篇 |
1982年 | 22篇 |
1981年 | 16篇 |
1980年 | 21篇 |
1979年 | 16篇 |
1978年 | 17篇 |
1976年 | 18篇 |
1975年 | 19篇 |
1974年 | 12篇 |
排序方式: 共有7472条查询结果,搜索用时 15 毫秒
91.
Recommendations in location-based social networks: a survey 总被引:2,自引:0,他引:2
92.
Samaha MA Ochanda FO Tafreshi HV Tepper GC Gad-el-Hak M 《The Review of scientific instruments》2011,82(4):045109
Light scattering was used to measure the time-dependent loss of air entrapped within a submerged microporous hydrophobic surface subjected to different environmental conditions. The loss of trapped air resulted in a measurable decrease in surface reflectivity and the kinetics of the process was determined in real time and compared to surface properties, such as porosity and morphology. The light-scattering results were compared with measurements of skin-friction drag, static contact angle, and contact-angle hysteresis. The in situ, noninvasive optical technique was shown to correlate well with the more conventional methods for quantifying surface hydrophobicity, such as flow slip and contact angle. 相似文献
93.
Anas Hatim Said Belkouch Mohamed El Aakif Moha M’rabet Hassani Noureddine Chabini 《Multimedia Tools and Applications》2013,67(3):667-685
The Discrete Cosine Transform (DCT) is one of the most widely used techniques for image compression. Several algorithms are proposed to implement the DCT-2D. The scaled SDCT algorithm is an optimization of the DCT-1D, which consists in gathering all the multiplications at the end. In this paper, in addition to the hardware implementation on an FPGA, an extended optimization has been performed by merging the multiplications in the quantization block without having an impact on the image quality. A simplified quantization has been performed also to keep higher the performances of the all chain. Tests using MATLAB environment have shown that our proposed approach produces images with nearly the same quality of the ones obtained using the JPEG standard. FPGA-based implementations of this proposed approach is presented and compared to other state of the art techniques. The target is an an Altera Cyclone II FPGA using the Quartus synthesis tool. Results show that our approach outperforms the other ones in terms of processing-speed, used resources and power consumption. A comparison has been done between this architecture and a distributed arithmetic based architecture. 相似文献
94.
Mohamed Hammami Salma Kammoun Jarraya Hanene Ben-Abdallah 《Multimedia Tools and Applications》2013,63(3):899-926
Fast and accurate moving object segmentation in dynamic scenes is the first step in many computer vision applications. In this paper, we propose a new background modeling method for moving object segmentation based on dynamic matrix and spatio-temporal analyses of scenes. Our method copes with some challenges related to this field. A new algorithm is proposed to detect and remove cast shadow. A comparative study by quantitative evaluations shows that the proposed approach can detect foreground robustly and accurately from videos recorded by a static camera and which include several constraints. A Highway Control and Management System called RoadGuard is proposed to show the robustness of our method. In fact, our system has the ability to control highway by detecting strange events that can happen like vehicles suddenly stopped in roads, parked vehicles in emergency zones or even illegal conduct such as going out from the road. Moreover, RoadGuard is capable of managing highways by saving information about the date and time of overloaded roads. 相似文献
95.
Tree index structures are crucial components in data management systems. Existing tree index structure are designed with the implicit assumption that the underlying external memory storage is the conventional magnetic hard disk drives. This assumption is going to be invalid soon, as flash memory storage is increasingly adopted as the main storage media in mobile devices, digital cameras, embedded sensors, and notebooks. Though it is direct and simple to port existing tree index structures on the flash memory storage, that direct approach does not consider the unique characteristics of flash memory, i.e., slow write operations, and erase-before-update property, which would result in a sub optimal performance. In this paper, we introduce FAST (i.e., Flash-Aware Search Trees) as a generic framework for flash-aware tree index structures. FAST distinguishes itself from all previous attempts of flash memory indexing in two aspects: (1) FAST is a generic framework that can be applied to a wide class of data partitioning tree structures including R-tree and its variants, and (2) FAST achieves both efficiency and durability of read and write flash operations through memory flushing and crash recovery techniques. Extensive experimental results, based on an actual implementation of FAST inside the GiST index structure in PostgreSQL, show that FAST achieves better performance than its competitors. 相似文献
96.
97.
Emira Nechadi Mohamed Naguib Harmas Najib Essounbouli Abdelaziz Hamzaoui 《国际自动化与计算杂志》2013,10(4):281-287
Power system stability is enhanced through a novel stabilizer developed around an adaptive fuzzy sliding mode approach which applies the Nussbaum gain to a nonlinear model of a single-machine infinite-bus (SMIB) and multi-machine power system stabilizer subjected to a three phase fault. The Nussbaum gain is used to avoid the positive sign constraint and the problem of controllability of the system. A comparative simulation study is presented to evaluate the achieved performance. 相似文献
98.
From the perspective of data security, which has always been an important aspect of quality of service, cloud computing focuses a new challenging security threats. Therefore, a data security model must solve the most challenges of cloud computing security. The proposed data security model provides a single default gateway as a platform. It used to secure sensitive user data across multiple public and private cloud applications, including Salesforce, Chatter, Gmail, and Amazon Web Services, without influencing functionality or performance. Default gateway platform encrypts sensitive data automatically in a real time before sending to the cloud storage without breaking cloud application. It did not effect on user functionality and visibility. If an unauthorized person gets data from cloud storage, he only sees encrypted data. If authorized person accesses successfully in his cloud, the data is decrypted in real time for your use. The default gateway platform must contain strong and fast encryption algorithm, file integrity, malware detection, firewall, tokenization and more. This paper interested about authentication, stronger and faster encryption algorithm, and file integrity. 相似文献
99.
The constrained L(1) estimation is an attractive alternative to both the unconstrained L(1) estimation and the least square estimation. In this letter, we propose a cooperative recurrent neural network (CRNN) for solving L(1) estimation problems with general linear constraints. The proposed CRNN model combines four individual neural network models automatically and is suitable for parallel implementation. As a special case, the proposed CRNN includes two existing neural networks for solving unconstrained and constrained L(1) estimation problems, respectively. Unlike existing neural networks, with penalty parameters, for solving the constrained L(1) estimation problem, the proposed CRNN is guaranteed to converge globally to the exact optimal solution without any additional condition. Compared with conventional numerical algorithms, the proposed CRNN has a low computational complexity and can deal with the L(1) estimation problem with degeneracy. Several applied examples show that the proposed CRNN can obtain more accurate estimates than several existing algorithms. 相似文献
100.
Hierarchically Distributed Peer-to-Peer Document Clustering and Cluster Summarization 总被引:1,自引:0,他引:1
Hammouda Khaled M. Kamel Mohamed S. 《Knowledge and Data Engineering, IEEE Transactions on》2009,21(5):681-698
In distributed data mining, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose a Hierarchically-distributed Peer-to-Peer (HP2PC) architecture and clustering algorithm. The architecture is based on a multi-layer overlay network of peer neighborhoods. Supernodes, which act as representatives of neighborhoods, are recursively grouped to form higher level neighborhoods. Within a certain level of the hierarchy, peers cooperate within their respective neighborhoods to perform P2P clustering. Using this model, we can partition the clustering problem in a modular way across neighborhoods, solve each part individually using a distributed K-means variant, then successively combine clusterings up the hierarchy where increasingly more global solutions are computed. In addition, for document clustering applications, we summarize the distributed document clusters using a distributed keyphrase extraction algorithm, thus providing interpretation of the clusters. Results show decent speedup, reaching 165 times faster than centralized clustering for a 250-node simulated network, with comparable clustering quality to the centralized approach. We also provide comparison to the P2P K-means algorithm and show that HP2PC accuracy is better for typical hierarchy heights. Results for distributed cluster summarization match those of their centralized counterparts with up to 88% accuracy. 相似文献