全文获取类型
收费全文 | 5342篇 |
免费 | 416篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 70篇 |
综合类 | 7篇 |
化学工业 | 1568篇 |
金属工艺 | 61篇 |
机械仪表 | 107篇 |
建筑科学 | 213篇 |
矿业工程 | 11篇 |
能源动力 | 205篇 |
轻工业 | 712篇 |
水利工程 | 46篇 |
石油天然气 | 8篇 |
无线电 | 361篇 |
一般工业技术 | 1013篇 |
冶金工业 | 399篇 |
原子能技术 | 33篇 |
自动化技术 | 949篇 |
出版年
2024年 | 12篇 |
2023年 | 82篇 |
2022年 | 235篇 |
2021年 | 398篇 |
2020年 | 184篇 |
2019年 | 187篇 |
2018年 | 220篇 |
2017年 | 191篇 |
2016年 | 267篇 |
2015年 | 196篇 |
2014年 | 287篇 |
2013年 | 366篇 |
2012年 | 358篇 |
2011年 | 466篇 |
2010年 | 297篇 |
2009年 | 253篇 |
2008年 | 310篇 |
2007年 | 245篇 |
2006年 | 174篇 |
2005年 | 154篇 |
2004年 | 136篇 |
2003年 | 122篇 |
2002年 | 91篇 |
2001年 | 64篇 |
2000年 | 50篇 |
1999年 | 58篇 |
1998年 | 43篇 |
1997年 | 37篇 |
1996年 | 49篇 |
1995年 | 23篇 |
1994年 | 24篇 |
1993年 | 23篇 |
1992年 | 28篇 |
1991年 | 14篇 |
1990年 | 9篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 11篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 8篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1967年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有5763条查询结果,搜索用时 472 毫秒
131.
132.
A key feature for infrastructures providing coordination services is the ability to define the behaviour of coordination abstractions according to the requirements identified at design-time. We take as a representative for this scenario the logic-based language ReSpecT (Reaction Specification Tuples), used to program the reactive behaviour of tuple centres. ReSpecT specifications are at the core of the engineering methodology underlying the TuCSoN infrastructure, and are therefore the “conceptual place” where formal methods can be fruitfully applied to guarantee relevant system properties.In this paper we introduce ReSpecT nets, a formalism that can be used to describe reactive behaviours that can succeed and fail, and that allows for an encoding to Petri nets with inhibitor arcs. ReSpecT nets are introduced to give a core model to a fragment of the ReSpecT language, and to pave the way for devising an analysis methodology including formal verification of safety and liveness properties. In particular, we provide a semantics to ReSpecT specifications through a mapping to ReSpecT nets. The potential of this approach for the analysis of ReSpecT specifications is discussed, presenting initial results for the analysis of safety properties. 相似文献
133.
Aliaksei Kerhet Michele Magno Francesco Leonardi Andrea Boni Luca Benini 《Journal of Real-Time Image Processing》2007,2(4):331-342
In this paper we propose MicrelEye, a wireless video node for cooperative distributed video processing applications that involve
image classification. The node is equipped with a low-cost VGA CMOS image sensor, a reconfigurable processing engine (FPGA,
Microcontroller, SRAM) and a Bluetooth 100-m transceiver. It has a size of few cubic centimeters and its typical power consumption
is approximately ten times less than that of typical commercial DSP-based solutions. As regards classification, a highly optimized
hardware-oriented support vector machine-like (SVM-like) algorithm called ERSVM is proposed and implemented. We describe our
hardware and software architecture, its performance and power characteristics. The case study considered in this paper is
people detection. The obtained results suggest that the present technology allows for the design of simple intelligent video
nodes capable of performing classification tasks locally.
相似文献
Luca BeniniEmail: |
134.
Sinz A 《Mass spectrometry reviews》2006,25(4):663-682
Closely related to studying the function of a protein is the analysis of its three-dimensional structure and the identification of interaction sites with its binding partners. An alternative approach to the high-resolution methods for three-dimensional protein structure analysis, such as X-ray crystallography and NMR spectroscopy, consists of covalently connecting two functional groups of the protein(s) under investigation. The location of the created cross-links imposes a distance constraint on the location of the respective side chains and allows one to draw conclusions on the three-dimensional structure of the protein or a protein complex. Recently, chemical cross-linking of proteins has been combined with a mass spectrometric analysis of the created cross-linked products. This review article describes the most popular cross-linking reagents for protein structure analysis and gives an overview of the different available strategies that employ chemical cross-linking and different mass spectrometric techniques. The challenges for mass spectrometry caused by the enormous complexity of the cross-linking reaction mixtures are emphasized. The various approaches described in the literature to facilitate the mass spectrometric detection of cross-linked products as well as computer software for data analyses are reviewed. 相似文献
135.
We describe an algorithm for obtaining the central primitive idempotents of the algebra associated with a monomial representation. As a consequence, we obtain its irreducible constituents. This is implemented in Magma, using an algorithm based on Dixon’s modular approach. In the case of permutation representations, we get a simplified version of the algorithms of Michler and Weller. 相似文献
136.
Evolutionary game-theoretic models and, in particular, the so-called replicator equations have recently proven to be remarkably effective at approximately solving the maximum clique and related problems. The approach is centered around a classic result from graph theory that formulates the maximum clique problem as a standard (continuous) quadratic program and exploits the dynamical properties of these models, which, under a certain symmetry assumption, possess a Lyapunov function. In this letter, we generalize previous work along these lines in several respects. We introduce a wide family of game-dynamic equations known as payoff-monotonic dynamics, of which replicator dynamics are a special instance, and show that they enjoy precisely the same dynamical properties as standard replicator equations. These properties make any member of this family a potential heuristic for solving standard quadratic programs and, in particular, the maximum clique problem. Extensive simulations, performed on random as well as DIMACS benchmark graphs, show that this class contains dynamics that are considerably faster than and at least as accurate as replicator equations. One problem associated with these models, however, relates to their inability to escape from poor local solutions. To overcome this drawback, we focus on a particular subclass of payoff-monotonic dynamics used to model the evolution of behavior via imitation processes and study the stability of their equilibria when a regularization parameter is allowed to take on negative values. A detailed analysis of these properties suggests a whole class of annealed imitation heuristics for the maximum clique problem, which are based on the idea of varying the parameter during the imitation optimization process in a principled way, so as to avoid unwanted inefficient solutions. Experiments show that the proposed annealing procedure does help to avoid poor local optima by initially driving the dynamics toward promising regions in state space. Furthermore, the models outperform state-of-the-art neural network algorithms for maximum clique, such as mean field annealing, and compare well with powerful continuous-based heuristics. 相似文献
137.
Design and control of an IPMC wormlike robot. 总被引:2,自引:0,他引:2
Paolo Arena Claudia Bonomo Luigi Fortuna Mattia Frasca Salvatore Graziani 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2006,36(5):1044-1052
This paper presents an innovative wormlike robot controlled by cellular neural networks (CNNs) and made of an ionic polymer-metal composite (IPMC) self-actuated skeleton. The IPMC actuators, from which it is made of, are new materials that behave similarly to biological muscles. The idea that inspired the work is the possibility of using IPMCs to design autonomous moving structures. CNNs have already demonstrated their powerfulness as new structures for bio-inspired locomotion generation and control. The control scheme for the proposed IPMC moving structure is based on CNNs. The wormlike robot is totally made of IPMCs, and each actuator has to carry its own weight. All the actuators are connected together without using any other additional part, thereby constituting the robot structure itself. Worm locomotion is performed by bending the actuators sequentially from "tail" to "head," imitating the traveling wave observed in real-world undulatory locomotion. The activation signals are generated by a CNN. In the authors' opinion, the proposed strategy represents a promising solution in the field of autonomous and light structures that are capable of reconfiguring and moving in line with spatial-temporal dynamics generated by CNNs. 相似文献
138.
139.
Vedaldi A Zisserman A 《IEEE transactions on pattern analysis and machine intelligence》2012,34(3):480-492
Large scale nonlinear support vector machines (SVMs) can be approximated by linear ones using a suitable feature map. The linear SVMs are in general much faster to learn and evaluate (test) than the original nonlinear SVMs. This work introduces explicit feature maps for the additive class of kernels, such as the intersection, Hellinger's, and χ2 kernels, commonly used in computer vision, and enables their use in large scale problems. In particular, we: 1) provide explicit feature maps for all additive homogeneous kernels along with closed form expression for all common kernels; 2) derive corresponding approximate finite-dimensional feature maps based on a spectral analysis; and 3) quantify the error of the approximation, showing that the error is independent of the data dimension and decays exponentially fast with the approximation order for selected kernels such as χ2. We demonstrate that the approximations have indistinguishable performance from the full kernels yet greatly reduce the train/test times of SVMs. We also compare with two other approximation methods: Nystrom's approximation of Perronnin et al., which is data dependent, and the explicit map of Maji and Berg for the intersection kernel, which, as in the case of our approximations, is data independent. The approximations are evaluated on a number of standard data sets, including Caltech-101, Daimler-Chrysler pedestrians, and INRIA pedestrians. 相似文献
140.
Gualdi G Prati A Cucchiara R 《IEEE transactions on pattern analysis and machine intelligence》2012,34(8):1589-1604
The common paradigm employed for object detection is the sliding window (SW) search. This approach generates grid-distributed patches, at all possible positions and sizes, which are evaluated by a binary classifier: The tradeoff between computational burden and detection accuracy is the real critical point of sliding windows; several methods have been proposed to speed up the search such as adding complementary features. We propose a paradigm that differs from any previous approach since it casts object detection into a statistical-based search using a Monte Carlo sampling for estimating the likelihood density function with Gaussian kernels. The estimation relies on a multistage strategy where the proposal distribution is progressively refined by taking into account the feedback of the classifiers. The method can be easily plugged into a Bayesian-recursive framework to exploit the temporal coherency of the target objects in videos. Several tests on pedestrian and face detection, both on images and videos, with different types of classifiers (cascade of boosted classifiers, soft cascades, and SVM) and features (covariance matrices, Haar-like features, integral channel features, and histogram of oriented gradients) demonstrate that the proposed method provides higher detection rates and accuracy as well as a lower computational burden w.r.t. sliding window detection. 相似文献