全文获取类型
收费全文 | 10425篇 |
免费 | 38篇 |
国内免费 | 139篇 |
专业分类
电工技术 | 131篇 |
综合类 | 3篇 |
化学工业 | 298篇 |
金属工艺 | 433篇 |
机械仪表 | 58篇 |
建筑科学 | 67篇 |
矿业工程 | 2篇 |
能源动力 | 58篇 |
轻工业 | 19篇 |
水利工程 | 19篇 |
石油天然气 | 31篇 |
无线电 | 369篇 |
一般工业技术 | 164篇 |
冶金工业 | 69篇 |
原子能技术 | 90篇 |
自动化技术 | 8791篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 18篇 |
2021年 | 33篇 |
2020年 | 26篇 |
2019年 | 27篇 |
2018年 | 30篇 |
2017年 | 21篇 |
2016年 | 30篇 |
2015年 | 15篇 |
2014年 | 225篇 |
2013年 | 198篇 |
2012年 | 775篇 |
2011年 | 3079篇 |
2010年 | 1147篇 |
2009年 | 1008篇 |
2008年 | 673篇 |
2007年 | 582篇 |
2006年 | 454篇 |
2005年 | 570篇 |
2004年 | 529篇 |
2003年 | 585篇 |
2002年 | 276篇 |
2001年 | 11篇 |
2000年 | 4篇 |
1999年 | 25篇 |
1998年 | 84篇 |
1997年 | 22篇 |
1996年 | 15篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 5篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 6篇 |
1988年 | 8篇 |
1987年 | 6篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 23篇 |
1983年 | 11篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
221.
222.
Yu-Ting Pai Author VitaeAuthor Vitae Shanq-Jang Ruan Author Vitae 《Pattern recognition》2010,43(9):3177-3187
Document image binarization involves converting gray level images into binary images, which is a feature that has significantly impacted many portable devices in recent years, including PDAs and mobile camera phones. Given the limited memory space and the computational power of portable devices, reducing the computational complexity of an embedded system is of priority concern. This work presents an efficient document image binarization algorithm with low computational complexity and high performance. Integrating the advantages of global and local methods allows the proposed algorithm to divide the document image into several regions. A threshold surface is then constructed based on the diversity and the intensity of each region to derive the binary image. Experimental results demonstrate the effectiveness of the proposed method in providing a promising binarization outcome and low computational cost. 相似文献
223.
Hyperspectral imaging, which records a detailed spectrum of light for each pixel, provides an invaluable source of information regarding the physical nature of the different materials, leading to the potential of a more accurate classification. However, high dimensionality of hyperspectral data, usually coupled with limited reference data available, limits the performances of supervised classification techniques. The commonly used pixel-wise classification lacks information about spatial structures of the image. In order to increase classification performances, integration of spatial information into the classification process is needed. In this paper, we propose to extend the watershed segmentation algorithm for hyperspectral images, in order to define information about spatial structures. In particular, several approaches to compute a one-band gradient function from hyperspectral images are proposed and investigated. The accuracy of the watershed algorithms is demonstrated by the further incorporation of the segmentation maps into a classifier. A new spectral-spatial classification scheme for hyperspectral images is proposed, based on the pixel-wise Support Vector Machines classification, followed by majority voting within the watershed regions. Experimental segmentation and classification results are presented on two hyperspectral images. It is shown in experiments that when the number of spectral bands increases, the feature extraction and the use of multidimensional gradients appear to be preferable to the use of vectorial gradients. The integration of the spatial information from the watershed segmentation in the hyperspectral image classifier improves the classification accuracies and provides classification maps with more homogeneous regions, compared to pixel-wise classification and previously proposed spectral-spatial classification techniques. The developed method is especially suitable for classifying images with large spatial structures. 相似文献
224.
Djamel Bouchaffra Author Vitae 《Pattern recognition》2010,43(7):2590-2607
Current extensions of hidden Markov models such as structural, hierarchical, coupled, and others have the power to classify complex and highly organized patterns. However, one of their major limitations is the inability to cope with topology: When applied to a visible observation (VO) sequence, the traditional HMM-based techniques have difficulty predicting the n-dimensional shape formed by the symbols of the VO sequence. To fulfill this need, we propose a novel paradigm named “topological hidden Markov models” (THMMs) that classifies VO sequences by embedding the nodes of an HMM state transition graph in a Euclidean space. This is achieved by modeling the noise embedded in the shape generated by the VO sequence. We cover the first and second level topological HMMs. We describe five basic problems that are assigned to a second level topological hidden Markov model: (1) sequence probability evaluation, (2) statistical decoding, (3) structural decoding, (4) topological decoding, and (5) learning. To show the significance of this research, we have applied the concept of THMMs to: (i) predict the ASCII class assigned to a handwritten numeral, and (ii) map protein primary structures to their 3D folds. The results show that the second level THMMs outperform the SHMMs and the multi-class SVM classifiers significantly. 相似文献
225.
This paper proposes a novel signal transformation and interpolation approach based on the modification of DCT (Discrete Cosine Transform). The proposed algorithm can be applied to any periodic or quasi periodic waveform for time scale and/or pitch modification purposes in addition to signal reconstruction, compression, coding and packet lost concealment. The proposed algorithm has two advantages:
(i)
Since DCT does not have the explicit phase information, one does not need the cubic spline interpolation of the phase component of the sinusoidal model. (ii)
The parameters to be interpolated can be reduced because of the energy packing efficiency of the DCT. This is particularly important if signal synthesis is carried out on a remote location from the transmitted parameters.
226.
T. Hoang Ngan Le Chia-Chen Lin Chin-Chen Chang Hoai Bac LeAuthor vitae 《Digital Signal Processing》2011,21(6):734-745
Many secret sharing schemes for digital images have been developed in recent decades. Traditional schemes typically must deal with the problem of computational complexity, and other visual secret sharing schemes come with a higher transmission cost and storage cost; that is, each shadow size is m times as big as the original secret image. The new (2,n) secret sharing scheme for grayscale images proposed in this paper is based a combination of acceptable image quality using block truncation coding (BTC), high compression ratio discrete wavelet transform (DWT) and good subjective performance of the vector quantization (VQ) technique. Experimental results confirm that our proposed scheme not only generates a high quality reconstructed original image but also generates small, random-like grayscale shadows. 相似文献
227.
Yacine Rebahi Mohamed Nassar Thomas Magedanz Olivier FestorAuthor vitae 《Information Security Technical Report》2011,16(1):12-19
The migration from circuit-switched networks to packet-switched networks necessitates the investigation of related issues such as service delivery, QoS, security, and service fraud and misuse. The latter can be seen as a combination of accounting and security aspects. In traditional telecommunication networks, fraud accounts for annual losses at an average of 3%–5% of the operators’ revenue and still increasing at a rate of more than 10% yearly. It is also expected that in VoIP networks, the situation will be worse due to the lack of strong built-in security mechanisms, and the use of open standards. This paper discusses the fraud problem in VoIP networks and evaluates the related available solutions. 相似文献
228.
Leszek Lilien Author Vitae Ajay Gupta Author Vitae Author Vitae Zijiang Yang Author Vitae 《Computers & Electrical Engineering》2010,36(2):328-340
We present opportunistic resource utilization networks or oppnets, a novel paradigm of specialized ad hoc networks. We believe that applications can benefit from using specialized ad hoc networks that provide a natural basis for them, the basis more efficient and effective than what general-purpose ad hoc networks can offer. Oppnets constitute the subcategory of ad hoc networks where diverse systems, not employed originally as nodes of an oppnet, join it dynamically in order to perform certain tasks they have been called to participate in. Oppnets have a significant potential to improve a variety of applications, and to create new application niches. We categorize opportunistic networks currently known in the literature as class 1opportunistic networks that use opportunistically only communication resources, and class 2opportunistic networks or oppnets that use opportunistically all kinds of resources, including not only communication but also computation, sensing, actuation, storage, etc. After describing the oppnets and the basics of their operation, we discuss the Oppnet Virtual Machine (OVM)—a proposed standard implementation framework for oppnet applications. It is followed by a discussion of an example application scenario using the OVM primitives. Next, we discuss the design and operations of a small-scale oppnet, named MicroOppnet, originally developed as a proof of concept. MicroOppnet is now being extended to serve as a testbed for experimentation and pilot implementations of oppnet architectures and their components. We conclude with a summary and a list of some open issues for oppnets. 相似文献
229.
Dragan Iveti? Author Vitae Author Vitae Branko Markoski Author Vitae 《Computers & Electrical Engineering》2010,36(1):169-179
This paper presents a novel video augmentation approach: a video recording of a real entity augmented by structured data. This augmented video is a self-contained entity integrating values of perceptible and non-perceptible attributes of the same real entity. It simplifies data search, storage and management. Streaming, sharing, collaboration and synchronization are also simplified by the fact that the structured data (so-called augmented data) are integrated in the video file and therefore only one file needs to be manipulated. Our approach was applied to address the issues which road engineers experience while using the ROad Measurement and Data Acquisition System (ROMDAS). The ROMDAS system collects and analyses the road-condition state through video recordings and the data corresponding acquired by specific measuring devices. Currently, however, road engineers have to search the videos manually in order to find details of interest provided by the analysis of the data measured due to the separation of the video from the data. The ROMDAS system manages a large collection of road-condition data. It does not offer history management of video recordings of the same road captured at different time. We present this hybrid video augmentation system: the Augmented Video stream Framework (AVF). It allows creation, search, history management and playback of such augmented video files for effective road surveying based on the discrete data recorded in parallel to the video recordings. The AVF provides road engineers with effective and more comfortable perceptible and non-perceptible data search, storage and history management to be used for (collaborative) road inspection and maintenance. 相似文献
230.
Wang Yafeng Author Vitae Yang Hao Author Vitae Author Vitae Wei Xiang Author Vitae 《Computers & Electrical Engineering》2010,36(4):789-801
One of the most challenging problems in high-data-rate wireless transmission is to reduce inter-symbol interference (ISI) resulted from the time dispersion caused by multi-path propagation. To solve this problem, equalization is introduced. Generally, efficient decision feedback equalizer (DFE) holds better performance than linear equalizer for the cancellation of ISI without noise enhancement. However, its inherent error propagation has some limitation for further improvement. In fact, as shown later in simulation results, conventional frequency domain DFE (FD-DFE) almost cannot be used in Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiplex (DFT-S OFDM) system in Evolved-UMTS (Universal Mobile Telecommunications System) Terrestrial Radio Access (E-UTRA) uplink transmission [3GPP, TR 25.814 V1.2.3. Physical layer aspects for evolved UTRA. May 2006 [release 7]]. Unique word (UW) is proposed in the literatures, as a known symbol sequence, can make error propagation beyond one FFT-block impossible since the last symbols of every block are always decided correctly. But the UW-based scheme is not appropriate for DFT-S OFDM, so it must be modified. This paper proposes a simple DFE-based equalization algorithm for DFT-S OFDM. Through cyclic detection and iteration, the new algorithm obtains a noticeable gain than conventional DFE, and is almost as effective as the modified UW-based methods but with much higher bandwidth efficiency. Furthermore, it does not need to change the frame structure of existing protocol. 相似文献