全文获取类型
收费全文 | 3477篇 |
免费 | 267篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 47篇 |
综合类 | 3篇 |
化学工业 | 1140篇 |
金属工艺 | 44篇 |
机械仪表 | 78篇 |
建筑科学 | 125篇 |
矿业工程 | 3篇 |
能源动力 | 118篇 |
轻工业 | 399篇 |
水利工程 | 18篇 |
无线电 | 320篇 |
一般工业技术 | 644篇 |
冶金工业 | 109篇 |
原子能技术 | 43篇 |
自动化技术 | 656篇 |
出版年
2024年 | 8篇 |
2023年 | 44篇 |
2022年 | 243篇 |
2021年 | 267篇 |
2020年 | 112篇 |
2019年 | 103篇 |
2018年 | 128篇 |
2017年 | 127篇 |
2016年 | 160篇 |
2015年 | 142篇 |
2014年 | 149篇 |
2013年 | 235篇 |
2012年 | 220篇 |
2011年 | 273篇 |
2010年 | 195篇 |
2009年 | 195篇 |
2008年 | 168篇 |
2007年 | 144篇 |
2006年 | 140篇 |
2005年 | 100篇 |
2004年 | 88篇 |
2003年 | 70篇 |
2002年 | 53篇 |
2001年 | 38篇 |
2000年 | 29篇 |
1999年 | 37篇 |
1998年 | 38篇 |
1997年 | 33篇 |
1996年 | 30篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 11篇 |
1992年 | 10篇 |
1991年 | 5篇 |
1989年 | 8篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 6篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1983年 | 17篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 12篇 |
1979年 | 7篇 |
1978年 | 3篇 |
1977年 | 9篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有3747条查询结果,搜索用时 31 毫秒
101.
Félix Bou Francesco Paoli Antonio Ledda Hector Freytes 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(4):341-352
The present paper is a sequel to Paoli F, Ledda A, Giuntini R, Freytes H (On some properties of QMV algebras and QMV algebras, submitted). We provide two representation results for quasi-MV algebras in terms of MV algebras enriched with
additional structure; we investigate the lattices of subvarieties and subquasivarieties of quasi-MV algebras; we show that
quasi-MV algebras, as well as cartesian and flat quasi-MV algebras, have the amalgamation property. 相似文献
102.
Alessandro Lapadula Rosario Pugliese Francesco Tiezzi 《Electronic Notes in Theoretical Computer Science》2008,200(3):133
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider. 相似文献
103.
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: |
104.
105.
106.
Regional frequency analysis is a useful tool for accurate estimation of precipitation quantiles than at-site frequency analysis, especially in the case of regions with a short rainfall time series. The use of meteorological information, combined with rainfall data analysis, could improve the selection of homogeneous regions. Starting from 1958, 198 meteorological configurations, related to extreme events, have been identified throughout the national territory of Italy. The reanalyzed meteorological data of the 40 Year Re-analysis Archive (ERA-40) of the European Centre for Medium-Range Weather Forecast (ECMWF) have been analyzed to identify homogeneous regions with respect to the Convective Available Potential Energy (CAPE), the Q vector Divergence (QD) and the Vertically Integrated Moisture Flux (VIMF). The latter index appears to be the better candidate for finding regional homogeneity inside areas where high frequency values of CAPE or QD are present. The paper presents an application based on the delimitation of homogeneous regions using climatic indexes for the island of Sicily. By applying the proposed methodology, seven homogeneous areas over Sicily were found. The consistency of the final results has been validated by using a coupled approach based on the Valuation of Floods in Italy procedure (VAPI) and on the heterogeneity test of Hosking and Wallis (Water Resour Res 29:271–281, 1993, 1997). 相似文献
107.
This paper addresses a visibility-based pursuit-evasion problem in which a team of mobile robots with limited sensing and
communication capabilities must coordinate to detect any evaders in an unknown, multiply-connected planar environment. Our
distributed algorithm to guarantee evader detection is built around maintaining complete coverage of the frontier between
cleared and contaminated regions while expanding the cleared region. We detail a novel distributed method for storing and
updating this frontier without building a map of the environment or requiring global localization. We demonstrate the functionality
of the algorithm through simulations in realistic environments and through hardware experiments. We also compare Monte Carlo
results for our algorithm to the theoretical optimum area cleared as a function of the number of robots available. 相似文献
108.
Francesco Banterle Massimiliano Corsini Paolo Cignoni Roberto Scopigno 《Computer Graphics Forum》2012,31(1):19-32
In this work we present a new algorithm for accelerating the colour bilateral filter based on a subsampling strategy working in the spatial domain. The base idea is to use a suitable subset of samples of the entire kernel in order to obtain a good estimation of the exact filter values. The main advantages of the proposed approach are that it has an excellent trade‐off between visual quality and speed‐up, a very low memory overhead is required and it is straightforward to implement on the GPU allowing real‐time filtering. We show different applications of the proposed filter, in particular efficient cross‐bilateral filtering, real‐time edge‐aware image editing and fast video denoising. We compare our method against the state of the art in terms of image quality, time performance and memory usage. 相似文献
109.
Lorella Fatone Marco Giacinti Francesca Mariani Maria Cristina Recchioni Francesco Zirilli 《The Journal of supercomputing》2012,62(3):1480-1501
This paper shows two examples of how the analysis of option pricing problems can lead to computational methods efficiently implemented in parallel. These computational methods outperform ??general purpose?? methods (i.e., for example, Monte Carlo, finite differences methods). The GPU implementation of two numerical algorithms to price two specific derivatives (continuous barrier options and realized variance options) is presented. These algorithms are implemented in CUDA subroutines ready to run on Graphics Processing Units (GPUs) and their performance is studied. The realization of these subroutines is motivated by the extensive use of the derivatives considered in the financial markets to hedge or to take risk and by the interest of financial institutions in the use of state of the art hardware and software to speed up the decision process. The performance of these algorithms is measured using the (CPU/GPU) speed up factor, that is using the ratio between the (wall clock) times required to execute the code on a CPU and on a GPU. The choice of the reference CPU and GPU used to evaluate the speed up factors presented is stated. The outstanding performance of the algorithms developed is due to the mathematical properties of the pricing formulae used and to the ad hoc software implementation. In the case of realized variance options when the computation is done in single precision the comparisons between CPU and GPU execution times gives speed up factors of the order of a few hundreds. For barrier options, the corresponding speed up factors are of about fifteen, twenty. The CUDA subroutines to price barrier options and realized variance options can be downloaded from the website http://www.econ.univpm.it/recchioni/finance/w13. A?more general reference to the work in mathematical finance of some of the authors and of their coauthors is the website http://www.econ.univpm.it/recchioni/finance/. 相似文献
110.
This work presents a distributed method for control centers to monitor the operating condition of a power network, i.e., to estimate the network state, and to ultimately determine the occurrence of threatening situations. State estimation has been recognized to be a fundamental task for network control centers to operate safely and reliably a power grid. We consider (static) state estimation problems, in which the state vector consists of the voltage magnitude and angle at all network buses. We consider the state to be linearly related to network measurements, which include power flows, current injections, and voltage phasors at some buses. We admit the presence of several cooperating control centers, and we design two distributed methods for them to compute the minimum variance estimate of the state, given the network measurements. The two distributed methods rely on different modes of cooperation among control centers: in the first method an incremental mode of cooperation is used, whereas, in the second method, a diffusive interaction is implemented. Our procedures, which require each control center to know only the measurements and the structure of a subpart of the whole network, are computationally efficient and scalable with respect to the network dimension, provided that the number of control centers also increases with the network cardinality. Additionally, a finite-memory approximation of our diffusive algorithm is proposed, and its accuracy is characterized. Finally, our estimation methods are exploited to develop a distributed algorithm to detect corrupted network measurements. 相似文献