全文获取类型
收费全文 | 16712篇 |
免费 | 1347篇 |
国内免费 | 42篇 |
专业分类
电工技术 | 196篇 |
综合类 | 13篇 |
化学工业 | 3957篇 |
金属工艺 | 307篇 |
机械仪表 | 482篇 |
建筑科学 | 769篇 |
矿业工程 | 35篇 |
能源动力 | 468篇 |
轻工业 | 2650篇 |
水利工程 | 117篇 |
石油天然气 | 48篇 |
无线电 | 1821篇 |
一般工业技术 | 3317篇 |
冶金工业 | 1044篇 |
原子能技术 | 128篇 |
自动化技术 | 2749篇 |
出版年
2024年 | 38篇 |
2023年 | 254篇 |
2022年 | 277篇 |
2021年 | 645篇 |
2020年 | 507篇 |
2019年 | 477篇 |
2018年 | 617篇 |
2017年 | 574篇 |
2016年 | 808篇 |
2015年 | 628篇 |
2014年 | 816篇 |
2013年 | 1454篇 |
2012年 | 1190篇 |
2011年 | 1038篇 |
2010年 | 777篇 |
2009年 | 758篇 |
2008年 | 778篇 |
2007年 | 700篇 |
2006年 | 608篇 |
2005年 | 440篇 |
2004年 | 386篇 |
2003年 | 355篇 |
2002年 | 354篇 |
2001年 | 282篇 |
2000年 | 236篇 |
1999年 | 226篇 |
1998年 | 396篇 |
1997年 | 246篇 |
1996年 | 214篇 |
1995年 | 192篇 |
1994年 | 150篇 |
1993年 | 155篇 |
1992年 | 95篇 |
1991年 | 99篇 |
1990年 | 80篇 |
1989年 | 82篇 |
1988年 | 71篇 |
1987年 | 51篇 |
1986年 | 53篇 |
1985年 | 73篇 |
1984年 | 79篇 |
1983年 | 50篇 |
1982年 | 62篇 |
1981年 | 54篇 |
1980年 | 59篇 |
1979年 | 61篇 |
1978年 | 49篇 |
1977年 | 41篇 |
1976年 | 49篇 |
1975年 | 36篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
Do Luu-Ngoc Yang Hyung-Jeong Nguyen Hai-Duong Kim Soo-Hyung Lee Guee-Sang Na In-Seop 《The Journal of supercomputing》2021,77(10):10773-10790
The Journal of Supercomputing - In this study, we present a fusion model for emotion recognition based on visual data. The proposed model uses video information as its input and generates emotion... 相似文献
152.
Applied Intelligence - In the field of supervised learning, the problem of class imbalance is one of the most difficult problems, and has attracted a great deal of research attention in recent... 相似文献
153.
Michel P. Tcheou André L.L. Miranda Lisandro Lovisolo Eduardo A.B. da Silva Marco A.M. Rodrigues Paulo S.R. Diniz 《Digital Signal Processing》2012,22(2):288-297
In this paper, we verify how far electric disturbance signals can be compressed without compromising the analysis of encoded fault records. A recently proposed compression algorithm, referred to as Damped Sinusoidal Matching Pursuit (DSMP) has the remarkable feature of obtaining both compact and physically interpretable representations. However, for fault analysis applications, one is primarily interested in how accurate can be the analysis performed on compressed signals, instead of evaluating mean-squared error figures. Unlike previous works in digital fault records compression, the performance of the DSMP compression method is evaluated using a protocol based on fault analysis procedures commonly performed by expert engineers. This protocol is applied for comparing the results obtained in the analysis of both uncompressed records and their compressed versions at different compression ratios. The results show that the DSMP is a reliable compression system since it achieves high compression ratios (6.4:1) without causing fault analysis misinterpretation. 相似文献
154.
In this paper, a low complexity data demodulation algorithm is proposed that requires time of arrival information of the received signal exclusively. As an application example, the algorithm is applied to an ultra-wideband impulse radio communication system with pulse position modulation. The algorithm is insensitive to a common time delay for all pulses, that means, it does not require an accurate synchronization between the transmitter and the receiver. For the performance estimation, only a symbol synchronization is assumed, i.e., that there is a priori knowledge which pulse marks the beginning of a received data symbol. The performance of the proposed algorithm is evaluated for straightforward time of arrivals estimators, such as a maximum detector or a threshold detector. It is shown that the proposed algorithm outperforms a least squares algorithm in all considered scenarios. In particular, an increased robustness against additive white Gaussian noise, impulse like noise, and multiuser interference is demonstrated as well as an improved performance for multipath propagation channels. 相似文献
155.
Lasserre S Hernando J Hill S Schümann F Anasagasti Pde M Jaoudé GA Markram H 《IEEE transactions on visualization and computer graphics》2012,18(2):214-227
We present a process to automatically generate three-dimensional mesh representations of the complex, arborized cell membrane surface of cortical neurons (the principal information processing cells of the brain) from nonuniform morphological measurements. Starting from manually sampled morphological points (3D points and diameters) from neurons in a brain slice preparation, we construct a polygonal mesh representation that realistically represents the continuous membrane surface, closely matching the original experimental data. A mapping between the original morphological points and the newly generated mesh enables simulations of electrophysiolgical activity to be visualized on this new membrane representation. We compare the new mesh representation with the state of the art and present a series of use cases and applications of this technique to visualize simulations of single neurons and networks of multiple neurons. 相似文献
156.
Motion is a key feature for a wide class of computer vision approaches to recognize actions. In this article, we show how to define bio-inspired features for action recognition. To do so, we start from a well-established bio-inspired motion model of cortical areas V1 and MT. The primary visual cortex, designated as V1, is the first cortical area encountered in the visual stream processing and early responses of V1 cells consist in tiled sets of selective spatiotemporal filters. The second cortical area of interest in this article is area MT where MT cells pool incoming information from V1 according to the shape and characteristic of their receptive field. To go beyond the classical models and following the observations from Xiao et al. [61], we propose here to model different surround geometries for MT cells receptive fields. Then, we define the so-called bio-inspired features associated to an input video, based on the average activity of MT cells. Finally, we show how these features can be used in a standard classification method to perform action recognition. Results are given for the Weizmann and KTH databases. Interestingly, we show that the diversity of motion representation at the MT level (different surround geometries), is a major advantage for action recognition. On the Weizmann database, the inclusion of different MT surround geometries improved the recognition rate from 63.01 ± 2.07% up to 99.26 ± 1.66% in the best case. Similarly, on the KTH database, the recognition rate was significantly improved with the inclusion of MT different surround geometries (from 47.82 ± 2.71% up to 92.44 ± 0.01% in the best case). We also discussed the limitations of the current approach which are closely related to the input video duration. These promising results encourage us to further develop bio-inspired models incorporating other brain mechanisms and cortical areas in order to deal with more complex videos. 相似文献
157.
Tuan Hue Thi Li Cheng Jian Zhang Li Wang Shinichi Satoh 《Computer Vision and Image Understanding》2012,116(3):378-395
In this paper, we propose a framework for human action analysis from video footage. A video action sequence in our perspective is a dynamic structure of sparse local spatial–temporal patches termed action elements, so the problems of action analysis in video are carried out here based on the set of local characteristics as well as global shape of a prescribed action. We first detect a set of action elements that are the most compact entities of an action, then we extend the idea of Implicit Shape Model to space time, in order to properly integrate the spatial and temporal properties of these action elements. In particular, we consider two different recipes to construct action elements: one is to use a Sparse Bayesian Feature Classifier to choose action elements from all detected Spatial Temporal Interest Points, and is termed discriminative action elements. The other one detects affine invariant local features from the holistic Motion History Images, and picks up action elements according to their compactness scores, and is called generative action elements. Action elements detected from either way are then used to construct a voting space based on their local feature representations as well as their global configuration constraints. Our approach is evaluated in the two main contexts of current human action analysis challenges, action retrieval and action classification. Comprehensive experimental results show that our proposed framework marginally outperforms all existing state-of-the-arts techniques on a range of different datasets. 相似文献
158.
Li C Yang S Nguyen TT 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(3):627-646
Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms. 相似文献
159.
Jose Saldana Julián Fernández-Navajas José Ruiz-Mas Jenifer Murillo Eduardo Viruete Navarro José I. Aznar 《Computer Networks》2012,56(7):1893-1919
This work presents a study of RTP multiplexing schemes, which are compared with the normal use of RTP, in terms of experienced quality. Bandwidth saving, latency and packet loss for different options are studied, and some tests of Voice over IP (VoIP) traffic are carried out in order to compare the quality obtained using different implementations of the router buffer. Voice quality is calculated using ITU R-factor, which is a widely accepted quality estimator. The tests show the bandwidth savings of multiplexing, and also the importance of packet size for certain buffers, as latency and packet loss may be affected. The customer’s experience improvement is measured, showing that the use of multiplexing can be interesting in some scenarios, like an enterprise with different offices connected via the Internet. The system is also tested using different numbers of samples per packet, and the distribution of the flows into different tunnels is found to be an important factor in order to achieve an optimal perceived quality for each kind of buffer. Grouping all the flows into a single tunnel will not always be the best solution, as the increase of the number of flows does not improve bandwidth efficiency indefinitely. If the buffer penalizes big packets, it will be better to group the flows into a number of tunnels. The router processing capacity has to be taken into account too, as the limit of packets per second it can manage must not be exceeded. The obtained results show that multiplexing is a good way to improve customer’s experience of VoIP in scenarios where many RTP flows share the same path. 相似文献
160.
In this paper, a new approximation to off-line signature verification is proposed based on two-class classifiers using an
expert decisions ensemble. Different methods to extract sets of local and a global features from the target sample are detailed.
Also a normalization by confidence voting method is used in order to decrease the final equal error rate (EER). Each set of
features is processed by a single expert, and on the other approach proposed, the decisions of the individual classifiers
are combined using weighted votes. Experimental results are given using a subcorpus of the large MCYT signature database for
random and skilled forgeries. The results show that the weighted combination outperforms the individual classifiers significantly.
The best EER obtained were 6.3 % in the case of skilled forgeries and 2.31 % in the case of random forgeries. 相似文献