全文获取类型
收费全文 | 12548篇 |
免费 | 1004篇 |
国内免费 | 14篇 |
专业分类
电工技术 | 110篇 |
综合类 | 8篇 |
化学工业 | 3084篇 |
金属工艺 | 202篇 |
机械仪表 | 389篇 |
建筑科学 | 528篇 |
矿业工程 | 30篇 |
能源动力 | 297篇 |
轻工业 | 2503篇 |
水利工程 | 96篇 |
石油天然气 | 38篇 |
无线电 | 904篇 |
一般工业技术 | 2395篇 |
冶金工业 | 881篇 |
原子能技术 | 37篇 |
自动化技术 | 2064篇 |
出版年
2024年 | 46篇 |
2023年 | 176篇 |
2022年 | 203篇 |
2021年 | 446篇 |
2020年 | 355篇 |
2019年 | 367篇 |
2018年 | 503篇 |
2017年 | 525篇 |
2016年 | 611篇 |
2015年 | 508篇 |
2014年 | 674篇 |
2013年 | 1235篇 |
2012年 | 1069篇 |
2011年 | 874篇 |
2010年 | 652篇 |
2009年 | 622篇 |
2008年 | 664篇 |
2007年 | 561篇 |
2006年 | 507篇 |
2005年 | 360篇 |
2004年 | 307篇 |
2003年 | 283篇 |
2002年 | 256篇 |
2001年 | 161篇 |
2000年 | 146篇 |
1999年 | 128篇 |
1998年 | 191篇 |
1997年 | 166篇 |
1996年 | 118篇 |
1995年 | 110篇 |
1994年 | 96篇 |
1993年 | 90篇 |
1992年 | 51篇 |
1991年 | 36篇 |
1990年 | 30篇 |
1989年 | 29篇 |
1988年 | 34篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 37篇 |
1984年 | 27篇 |
1983年 | 19篇 |
1982年 | 26篇 |
1981年 | 18篇 |
1980年 | 18篇 |
1979年 | 24篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1976年 | 18篇 |
1973年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
131.
Although directory-based cache-coherence protocols are the best choice when designing chip multiprocessors with tens of cores on-chip, the memory overhead introduced by the directory structure may not scale gracefully with the number of cores. Many approaches aimed at improving the scalability of directories have been proposed. However, they do not bring perfect scalability and usually reduce the directory memory overhead by compressing coherence information, which in turn results in extra unnecessary coherence messages and, therefore, wasted energy and some performance degradation. In this work, we present a distributed directory organization based on duplicate tags for tiled CMP architectures whose size is independent on the number of tiles of the system up to a certain number of tiles. We demonstrate that this number of tiles corresponds to the number of sets in the private caches. Additionally, we show that the area overhead of the proposed directory structure is 0.56% with respect to the on-chip data caches. Moreover, the proposed directory structure keeps the same information than a non-scalable full-map directory. Finally, we propose a mechanism that takes advantage of this directory organization to remove the network traffic caused by replacements. This mechanism reduces total traffic by 15% for a 16-core configuration compared to a traditional directory-based protocol. 相似文献
132.
Using an asymptotic characterization of probabilistic finite state languages over a one-letter alphabet we construct a probabilistic
language with regular support that cannot be generated by probabilistic CFGs. Since all probability values used in the example
are rational, our work is immune to the criticism leveled by Suppes (Synthese 22:95–116, 1970) against the work of Ellis (1969) who first constructed probabilistic FSLs that admit no probabilistic FSGs. Some implications for probabilistic language
modeling by HMMs are discussed. 相似文献
133.
P. Javier Herrera Gonzalo Pajares María Guijarro José J. Ruz Jesús M. de la Cruz 《Expert systems with applications》2011,38(7):8622-8631
We present a novel strategy for computing disparity maps from omni-directional stereo images obtained with fish-eye lenses in forest environments. At a first segmentation stage, the method identifies textures of interest to be either matched or discarded. Two of them are identified by applying the powerful Support Vector Machines approach. At a second stage, a stereovision matching process is designed based on the application of four stereovision matching constraints: epipolarity, similarity, uniqueness and smoothness. The epipolarity guides the process. The similarity and uniqueness are mapped once again through the Support Vector Machines, but under a different way to the previous case; after this an initial disparity map is obtained. This map is later filtered by applying the Discrete Simulated Annealing framework where the smoothness constraint is conveniently mapped. The combination of the segmentation and stereovision matching approaches makes the main contribution. The method is compared against the usage of simple features and combined similarity matching strategies. 相似文献
134.
Atrial Fibrillation (AF) is the most common supraventricular tachyarrhythmia. Recently, it has been suggested that AF is partially organized on its onset and termination, thus being more suitable for antiarrhythmia and to avoid unnecessary therapy. Although several invasive and non-invasive AF organization estimators have been proposed, the organization time course in the first and last minutes of AF has not been quantified yet. The aim of this work is to study non-invasively the organization variation within the first and last minutes of paroxysmal AF. The organization was evaluated making use of sample entropy, which can robustly estimate electrical atrial activity organization from surface ECG recordings. This work proves an organization decrease in the first minutes of AF onset and an increase within the last minute before spontaneous AF termination. These results are in agreement with the conclusions reported by other authors who made use of invasive recordings. 相似文献
135.
136.
Tristan Roussillon Hervé Piégay Isabelle Sivignon Laure Tougne Franck Lavigne 《Computers & Geosciences》2009,35(10):1992-2000
The shape of sedimentary particles is an important property, from which geographical hypotheses related to abrasion, distance of transport, river behavior, etc. can be formulated. In this paper, we use digital image analysis, especially discrete geometry, to automatically compute some shape parameters such as roundness, i.e. a measure of how much the corners and edges of a particle have been worn away.In contrast to previous work in which traditional digital images analysis techniques, such as Fourier transform, are used, we opted for a discrete geometry approach that allowed us to implement Wadell's original index, which is known to be more accurate, but more time consuming to implement in the field.Our implementation of Wadell's original index is highly correlated (92%) with the roundness classes of Krumbein's chart, used as a ground-truth. In addition, we show that other geometrical parameters, which are easier to compute, can be used to provide good approximations of roundness.We also used our shape parameters to study a set of pebbles digital images taken from the Progo basin river network (Indonesia). The results we obtained are in agreement with previous work and open new possibilities for geomorphologists thanks to automatic computation. 相似文献
137.
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We formalize the connections between the coinductive big-step semantics and the standard small-step semantics, proving that both semantics are equivalent. We then study the use of coinductive big-step semantics in proofs of type soundness and proofs of semantic preservation for compilers. A methodological originality of this paper is that all results have been proved using the Coq proof assistant. We explain the proof-theoretic presentation of coinductive definitions and proofs offered by Coq, and show that it facilitates the discovery and the presentation of the results. 相似文献
138.
Fumiya Iida Yohei Minekawa Jürgen Rummel André Seyfarth 《Robotics and Autonomous Systems》2009,57(2):139-144
Conventional models of bipedal walking generally assume rigid body structures, while elastic material properties seem to play an essential role in nature. On the basis of a novel theoretical model of bipedal walking, this paper investigates a model of biped robot which makes use of minimum control and elastic passive joints inspired from the structures of biological systems. The model is evaluated in simulation and a physical robotic platform by analyzing the kinematics and ground reaction force. The experimental results show that, with a proper leg design of passive dynamics and elasticity, an attractor state of human-like walking gait patterns can be achieved through extremely simple control without sensory feedback. The detailed analysis also explains how the dynamic human-like gait can contribute to adaptive biped walking. 相似文献
139.
Pattern classification with mixtures of weighted least-squares support vector machine experts 总被引:1,自引:1,他引:0
Clodoaldo A. M. Lima André L. V. Coelho Fernando J. Von Zuben 《Neural computing & applications》2009,18(7):843-860
Support Vector Machine (SVM) classifiers are high-performance classification models devised to comply with the structural risk minimization principle and to properly exploit the kernel artifice of nonlinearly mapping input data into high-dimensional feature spaces toward the automatic construction of better discriminating linear decision boundaries. Among several SVM variants, Least-Squares SVMs (LS-SVMs) have gained increased attention recently due mainly to their computationally attractive properties coming as the direct result of applying a modified formulation that makes use of a sum-squared-error cost function jointly with equality, instead of inequality, constraints. In this work, we present a flexible hybrid approach aimed at augmenting the proficiency of LS-SVM classifiers with regard to accuracy/generalization as well as to hyperparameter calibration issues. Such approach, named as Mixtures of Weighted Least-Squares Support Vector Machine Experts, centers around the fusion of the weighted variant of LS-SVMs with Mixtures of Experts models. After the formal characterization of the novel learning framework, simulation results obtained with respect to both binary and multiclass pattern classification problems are reported, ratifying the suitability of the novel hybrid approach in improving the performance issues considered. 相似文献
140.
Luiz Augusto da Cruz Meleiro Fernando José Von Zuben Rubens Maciel Filho 《Engineering Applications of Artificial Intelligence》2009,22(2):201-215
In the present work, a constructive learning algorithm was employed to design a near-optimal one-hidden layer neural network structure that best approximates the dynamic behavior of a bioprocess. The method determines not only a proper number of hidden neurons but also the particular shape of the activation function for each node. Here, the projection pursuit technique was applied in association with the optimization of the solvability condition, giving rise to a more efficient and accurate computational learning algorithm. As each activation function of a hidden neuron is defined according to the peculiarities of each approximation problem, better rates of convergence are achieved, guiding to parsimonious neural network architectures. The proposed constructive learning algorithm was successfully applied to identify a MIMO bioprocess, providing a multivariable model that was able to describe the complex process dynamics, even in long-range horizon predictions. The resulting identification model was considered as part of a model-based predictive control strategy, producing high-quality performance in closed-loop experiments. 相似文献