全文获取类型
收费全文 | 3075篇 |
免费 | 208篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 35篇 |
综合类 | 2篇 |
化学工业 | 740篇 |
金属工艺 | 33篇 |
机械仪表 | 54篇 |
建筑科学 | 90篇 |
矿业工程 | 7篇 |
能源动力 | 96篇 |
轻工业 | 480篇 |
水利工程 | 25篇 |
石油天然气 | 6篇 |
无线电 | 253篇 |
一般工业技术 | 453篇 |
冶金工业 | 522篇 |
原子能技术 | 22篇 |
自动化技术 | 469篇 |
出版年
2024年 | 3篇 |
2023年 | 34篇 |
2022年 | 129篇 |
2021年 | 131篇 |
2020年 | 68篇 |
2019年 | 56篇 |
2018年 | 100篇 |
2017年 | 78篇 |
2016年 | 94篇 |
2015年 | 97篇 |
2014年 | 134篇 |
2013年 | 179篇 |
2012年 | 188篇 |
2011年 | 193篇 |
2010年 | 134篇 |
2009年 | 145篇 |
2008年 | 112篇 |
2007年 | 119篇 |
2006年 | 92篇 |
2005年 | 71篇 |
2004年 | 63篇 |
2003年 | 74篇 |
2002年 | 61篇 |
2001年 | 38篇 |
2000年 | 43篇 |
1999年 | 52篇 |
1998年 | 192篇 |
1997年 | 125篇 |
1996年 | 89篇 |
1995年 | 63篇 |
1994年 | 56篇 |
1993年 | 43篇 |
1992年 | 16篇 |
1991年 | 20篇 |
1990年 | 13篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 12篇 |
1986年 | 14篇 |
1985年 | 10篇 |
1984年 | 13篇 |
1983年 | 14篇 |
1982年 | 10篇 |
1981年 | 13篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 14篇 |
1976年 | 15篇 |
1973年 | 3篇 |
排序方式: 共有3287条查询结果,搜索用时 15 毫秒
81.
Giuseppe Della Penna Daniele Magazzeni Sergio Orefice 《Journal of Visual Languages and Computing》2010,21(1):23-32
In this paper we present a graphical software system that provides an automatic support to the extraction of information from web pages. The underlying extraction technique exploits the visual appearance of the information in the document, and is driven by the spatial relations occurring among the elements in the page. However, the usual information extraction modalities based on the web page structure can be used in our framework, too. The technique has been integrated within the Spatial Relation Query (SRQ) tool. The tool is provided with a graphical front-end which allows one to define and manage a library of spatial relations, and to use a SQL-like language for composing queries driven by these relations and by further semantic and graphical attributes. 相似文献
82.
Roberto Marzotto Paul Zoratti Daniele Bagni Andrea Colombari Vittorio Murino 《Computer Vision and Image Understanding》2010,114(11):1164-1179
This paper presents an algorithm for roadway path extraction and tracking and its implementation in a Field Programmable Gate Array (FPGA) device. The implementation is particularly suitable for use as a core component of a Lane Departure Warning (LDW) system, which requires high-performance digital image processing as well as low-cost semiconductor devices, appropriate for the high volume production of the automotive market. The FPGA technology proved to be a proper platform to meet these two contrasting requirements. The proposed algorithm is specifically designed to be completely embedded in FPGA hardware to process wide VGA resolution video sequences at 30 frames per second. The main contributions of this work lie in (i) the proper selection, customization and integration of the main functions for road extraction and tracking to cope with the addressed application, and (ii) the subsequent FPGA hardware implementation as a modular architecture of specialized blocks. Experiments on real road scenario video sequences running on the FPGA device illustrate the good performance of the proposed system prototype and its ability to adapt to varying common roadway conditions, without the need for a per-installation calibration procedure. 相似文献
83.
84.
In recent years, Grid systems and Peer to Peer networks are the most commonly-used solutions to achieve the same goal: the sharing of resources and services in heterogeneous, dynamic, distributed environments. Many studies have proposed hybrid approaches that try to conjugate the advantages of the two models. This paper proposes an architecture that integrates the P2P interaction model in Grid environments, so as to build an open cooperative model wherein Grid entities are composed in a decentralized way. In particular, this paper focuses on a QoS aware discovery algorithm for P2P Grid systems, analyzing protocol and explaining techniques used to improve its performance. 相似文献
85.
86.
We present a method for producing quad‐dominant subdivided meshes, which supports both adaptive refinement and adaptive coarsening. A hierarchical structure is stored implicitly in a standard half‐edge data structure, while allowing us to efficiently navigate through the different level of subdivision. Subdivided meshes contain a majority of quad elements and a moderate amount of triangles and pentagons in the regions of transition across different levels of detail. Topological LOD editing is controlled with local conforming operators, which support both mesh refinement and mesh coarsening. We show two possible applications of this method: we define an adaptive subdivision surface scheme that is topologically and geometrically consistent with the Catmull–Clark subdivision; and we present a remeshing method that produces semi‐regular adaptive meshes. 相似文献
87.
Varsta Markus Heikkonen Jukka Lampinen Jouko Millán José Del R. 《Neural Processing Letters》2001,13(3):237-251
This paper compares two Self-Organizing Map (SOM) based models for temporal sequence processing (TSP) both analytically and experimentally. These models, Temporal Kohonen Map (TKM) and Recurrent Self-Organizing Map (RSOM), incorporate leaky integrator memory to preserve the temporal context of the input signals. The learning and the convergence properties of the TKM and RSOM are studied and we show analytically that the RSOM is a significant improvement over the TKM, because the RSOM allows simple derivation of a consistent learning rule. The results of the analysis are demonstrated with experiments. 相似文献
88.
Privacy preserving technologies are likely to become an essential component of adaptive services in pervasive and mobile computing. Although privacy issues have been studied for a long time in computer science as well as in other fields, most studies are focused on the release of data from large repositories. Mobile and pervasive computing pose new challenges, requiring specific formal models for attacks and new privacy preserving techniques. This paper considers a specific pervasive computing scenario, and shows that the application of state-of-the-art techniques for the anonymization of service requests is insufficient to protect the privacy of users. A specific class of attacks, called shadow attacks, is formally defined and a defense technique is proposed. This defense is formally proved to be correct, and its effectiveness is validated by extensive experiments in a simulated environment. 相似文献
89.
We analyze generalization in XCSF and introduce three improvements. We begin by showing that the types of generalizations evolved by XCSF can be influenced by the input range. To explain these results we present a theoretical analysis of the convergence of classifier weights in XCSF which highlights a broader issue. In XCSF, because of the mathematical properties of the Widrow-Hoff update, the convergence of classifier weights in a given subspace can be slow when the spread of the eigenvalues of the autocorrelation matrix associated with each classifier is large. As a major consequence, the system's accuracy pressure may act before classifier weights are adequately updated, so that XCSF may evolve piecewise constant approximations, instead of the intended, and more efficient, piecewise linear ones. We propose three different ways to update classifier weights in XCSF so as to increase the generalization capabilities of XCSF: one based on a condition-based normalization of the inputs, one based on linear least squares, and one based on the recursive version of linear least squares. Through a series of experiments we show that while all three approaches significantly improve XCSF, least squares approaches appear to be best performing and most robust. Finally we show how XCSF can be extended to include polynomial approximations. 相似文献
90.
Berretti S. Del Bimbo A. Vicario E. 《IEEE transactions on pattern analysis and machine intelligence》2001,23(10):1089-1105
In retrieval from image databases, evaluation of similarity, based both on the appearance of spatial entities and on their mutual relationships, depends on content representation based on attributed relational graphs. This kind of modeling entails complex matching and indexing, which presently prevents its usage within comprehensive applications. In this paper, we provide a graph-theoretical formulation for the problem of retrieval based on the joint similarity of individual entities and of their mutual relationships and we expound its implications on indexing and matching. In particular, we propose the usage of metric indexing to organize large archives of graph models, and we propose an original look-ahead method which represents an efficient solution for the (sub)graph error correcting isomorphism problem needed to compute object distances. Analytic comparison and experimental results show that the proposed lookahead improves the state-of-the-art in state-space search methods and that the combined use of the proposed matching and indexing scheme permits for the management of the complexity of a typical application of retrieval by spatial arrangement 相似文献