全文获取类型
收费全文 | 1527篇 |
免费 | 98篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 7篇 |
综合类 | 1篇 |
化学工业 | 368篇 |
金属工艺 | 22篇 |
机械仪表 | 32篇 |
建筑科学 | 45篇 |
矿业工程 | 1篇 |
能源动力 | 56篇 |
轻工业 | 284篇 |
水利工程 | 14篇 |
石油天然气 | 7篇 |
无线电 | 158篇 |
一般工业技术 | 246篇 |
冶金工业 | 140篇 |
原子能技术 | 14篇 |
自动化技术 | 232篇 |
出版年
2024年 | 5篇 |
2023年 | 21篇 |
2022年 | 67篇 |
2021年 | 89篇 |
2020年 | 50篇 |
2019年 | 59篇 |
2018年 | 53篇 |
2017年 | 45篇 |
2016年 | 59篇 |
2015年 | 48篇 |
2014年 | 74篇 |
2013年 | 108篇 |
2012年 | 97篇 |
2011年 | 122篇 |
2010年 | 76篇 |
2009年 | 60篇 |
2008年 | 80篇 |
2007年 | 61篇 |
2006年 | 36篇 |
2005年 | 40篇 |
2004年 | 35篇 |
2003年 | 34篇 |
2002年 | 25篇 |
2001年 | 15篇 |
2000年 | 18篇 |
1999年 | 19篇 |
1998年 | 57篇 |
1997年 | 34篇 |
1996年 | 29篇 |
1995年 | 18篇 |
1994年 | 15篇 |
1993年 | 15篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1975年 | 2篇 |
1971年 | 1篇 |
1964年 | 1篇 |
排序方式: 共有1627条查询结果,搜索用时 631 毫秒
31.
Torresani L Hertzmann A Bregler C 《IEEE transactions on pattern analysis and machine intelligence》2008,30(5):878-892
This paper describes methods for recovering time-varying shape and motion of non-rigid 3D objects from uncalibrated 2D point tracks. For example, given a video recording of a talking person, we would like to estimate the 3D shape of the face at each instant, and learn a model of facial deformation. Time-varying shape is modeled as a rigid transformation combined with a non-rigid deformation. Reconstruction is ill-posed if arbitrary deformations are allowed, and thus additional assumptions about deformations are required. We first suggest restricting shapes to lie within a low-dimensional subspace, and describe estimation algorithms. However, this restriction alone is insufficient to constrain reconstruction. To address these problems, we propose a reconstruction method using a Probabilistic Principal Components Analysis (PPCA) shape model, and an estimation algorithm that simultaneously estimates 3D shape and motion for each instant, learns the PPCA model parameters, and robustly fills-in missing data points. We then extend the model to model temporal dynamics in object shape, allowing the algorithm to robustly handle severe cases of missing data. 相似文献
32.
Domenico Prattichizzo Author Vitae Lorenzo Ntogramatzidis Author Vitae 《Automatica》2008,44(11):2834-2839
The cheap LQ regulator is reinterpreted as an output nulling problem which is a basic problem of the geometric control theory. In fact, solving the LQ regulator problem is equivalent to keep the output of the related Hamiltonian system identically zero. The solution lies on a controlled invariant subspace whose dimension is characterized in terms of the minimal conditioned invariant of the original system, and the optimal feedback gain is computed as the friend matrix of the resolving subspace. This study yields a new computational framework for the cheap LQ regulator, relying only on the very basic and simple tools of the geometric approach, namely the algorithms for controlled and conditioned invariant subspaces and invariant zeros. 相似文献
33.
Sarv Ahrabi Sima Piazzo Lorenzo Momenzadeh Alireza Scarpiniti Michele Baccarelli Enzo 《The Journal of supercomputing》2022,78(9):12024-12045
The Journal of Supercomputing - We present a probabilistic method for classifying chest computed tomography (CT) scans into COVID-19 and non-COVID-19. To this end, we design and train, in an... 相似文献
34.
Paolini Emilio De Marinis Lorenzo Cococcioni Marco Valcarenghi Luca Maggiani Luca Andriolli Nicola 《Neural computing & applications》2022,34(18):15589-15601
Neural Computing and Applications - Photonics-based neural networks promise to outperform electronic counterparts, accelerating neural network computations while reducing power consumption and... 相似文献
35.
36.
Nano Research - The widespread and increasing interest in enhancing biosensing technologies by increasing their sensitivities and lowering their costs has led to the exploration and application of... 相似文献
37.
Antonio Fernández Anta José Luis López-Presa M. Araceli Lorenzo Pilar Manzano Juan Martinez-Romo Alberto Mozo Christopher Thraves 《Theory of Computing Systems》2011,48(1):1-22
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in
Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized
CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing.
In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining
constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the
remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS)
and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference
is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively
(the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds
we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show
that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call
Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy
is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish,
we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection
of packets. 相似文献
38.
Giacomo Bucci Laura Carnevali Lorenzo Ridi Enrico Vicario 《International Journal on Software Tools for Technology Transfer (STTT)》2010,12(5):391-403
Oris is a tool for qualitative verification and quantitative evaluation of reactive timed systems, which supports modeling
and analysis of various classes of timed extensions of Petri Nets. As most characterizing features, Oris implements symbolic
state space analysis of preemptive Time Petri Nets, which enable schedulability analysis of real-time systems running under
priority preemptive scheduling; and stochastic Time Petri Nets, which enable an integrated approach to qualitative verification
and quantitative evaluation. In this paper, we present the current version of the tool and we illustrate its application to
two different case studies in the areas of qualitative verification and quantitative evaluation, respectively. 相似文献
39.
The role of spectral resolution and classifier complexity in the analysis of hyperspectral images of forest areas 总被引:1,自引:0,他引:1
Michele Dalponte Lorenzo Bruzzone Loris Vescovo 《Remote sensing of environment》2009,113(11):2345-2355
Remote sensing hyperspectral sensors are important and powerful instruments for addressing classification problems in complex forest scenarios, as they allow one a detailed characterization of the spectral behavior of the considered information classes. However, the processing of hyperspectral data is particularly complex both from a theoretical viewpoint [e.g. problems related to the Hughes phenomenon (Hughes, 1968) and from a computational perspective. Despite many previous investigations that have been presented in the literature on feature reduction and feature extraction in hyperspectral data, only a few studies have analyzed the role of spectral resolution on the classification accuracy in different application domains. In this paper, we present an empirical study aimed at understanding the relationship among spectral resolution, classifier complexity, and classification accuracy obtained with hyperspectral sensors for the classification of forest areas. We considered two different test sets characterized by images acquired by an AISA Eagle sensor over 126 bands with a spectral resolution of 4.6 nm, and we subsequently degraded its spectral resolution to 9.2, 13.8, 18.4, 23, 27.6, 32.2 and 36.8 nm. A series of classification experiments were carried out with bands at each of the degraded spectral resolutions, and bands selected with a feature selection algorithm at the highest spectral resolution (4.6 nm). The classification experiments were carried out with three different classifiers: Support Vector Machine, Gaussian Maximum Likelihood with Leave-One-Out-Covariance estimator, and Linear Discriminant Analysis. From the experimental results, important conclusions can be made about the choice of the spectral resolution of hyperspectral sensors as applied to forest areas, also in relation to the complexity of the adopted classification methodology. The outcome of these experiments are also applicable in terms of directing the user towards a more efficient use of the current instruments (e.g. programming of the spectral channels to be acquired) and classification techniques in forest applications, as well as in the design of future hyperspectral sensors. 相似文献
40.
Dynamic SLAs management in service oriented environments 总被引:1,自引:0,他引:1
Giuseppe Di Modica Author Vitae Author Vitae Lorenzo Vita Author Vitae 《Journal of Systems and Software》2009,82(5):759-771
The increasing adoption of service oriented architectures across different administrative domains, forces service providers to use effective mechanisms and strategies of resource management in order for them to be able to guarantee the quality levels their customers demands during service provisioning. Service level agreements (SLA) are the most common mechanism used to establish agreements on the quality of a service (QoS) between a service provider and a service consumer. The WS-Agreement specification, developed by the Open Grid Forum, is a Web Service protocol to establish agreements on the QoS level to be guaranteed in the provision of a service. The committed agreement cannot be modified during service provision and is effective until all activities pertaining to it are finished or until one of the signing party decides to terminate it. In B2B scenarios where several service providers are involved in the composition of a service, and each of them plays both the parts of provider and customer, several one-to-one SLAs need to be signed. In such a rigid context the global QoS of the final service can be strongly affected by any violation on each single SLA. In order to prevent such violations, SLAs need to adapt to any possible needs that might come up during service provision. In this work we focus on the WS-Agreement specification and propose to enhance the flexibility of its approach. We integrate new functionality to the protocol that enable the parties of a WS-Agreement to re-negotiate and modify its terms during the service provision, and show how a typical scenario of service composition can benefit from our proposal. 相似文献