全文获取类型
收费全文 | 5959篇 |
免费 | 277篇 |
国内免费 | 7篇 |
学科分类
工业技术 | 6243篇 |
出版年
2023年 | 53篇 |
2022年 | 59篇 |
2021年 | 110篇 |
2020年 | 72篇 |
2019年 | 111篇 |
2018年 | 189篇 |
2017年 | 181篇 |
2016年 | 189篇 |
2015年 | 181篇 |
2014年 | 229篇 |
2013年 | 387篇 |
2012年 | 302篇 |
2011年 | 401篇 |
2010年 | 306篇 |
2009年 | 246篇 |
2008年 | 289篇 |
2007年 | 285篇 |
2006年 | 260篇 |
2005年 | 182篇 |
2004年 | 170篇 |
2003年 | 165篇 |
2002年 | 149篇 |
2001年 | 110篇 |
2000年 | 111篇 |
1999年 | 95篇 |
1998年 | 240篇 |
1997年 | 161篇 |
1996年 | 128篇 |
1995年 | 85篇 |
1994年 | 68篇 |
1993年 | 73篇 |
1992年 | 38篇 |
1991年 | 37篇 |
1990年 | 35篇 |
1989年 | 30篇 |
1988年 | 19篇 |
1987年 | 21篇 |
1986年 | 22篇 |
1985年 | 31篇 |
1984年 | 44篇 |
1983年 | 26篇 |
1982年 | 26篇 |
1981年 | 33篇 |
1980年 | 28篇 |
1979年 | 25篇 |
1977年 | 33篇 |
1976年 | 45篇 |
1975年 | 26篇 |
1974年 | 18篇 |
1973年 | 23篇 |
排序方式: 共有6243条查询结果,搜索用时 0 毫秒
91.
Animated meshes are often represented by a sequence of static meshes with constant connectivity. Due to their frame-based representation they usually occupy a vast amount of bandwidth or disk space. We present a fast and efficient scalable predictive coding (SPC) scheme for frame-based representations of animated meshes. SPC decomposes animated meshes in spatial and temporal layers which are efficiently encoded in one pass through the animation. Coding is performed in a streamable and scalable fashion. Dependencies between neighbouring spatial and temporal layers are predictively exploited using the already encoded spatio-temporal neighbourhood. Prediction is performed in the space of rotation-invariant coordinates compensating local rigid motion. SPC supports spatial and temporal scalability, and it enables efficient compression as well as fast encoding and decoding. Parts of SPC were adopted in the MPEG-4 FAMC standard. However, SPC significantly outperforms the streaming mode of FAMC with coding gains of over 33%, while in comparison to the scalable FAMC, SPC achieves coding gains of up to 15%. SPC has the additional advantage over FAMC of achieving real-time encoding and decoding rates while having only low memory requirements. Compared to some other non-scalable state-of-the-art approaches, SPC shows superior compression performance with gains of over 16% in bit-rate. 相似文献
92.
We consider interconnections of locally input-to-state stable (LISS) systems. The class of LISS systems is quite large, in particular it contains input-to-state stable (ISS) and integral input-to-state stable (iISS) systems.Local small-gain conditions both for LISS trajectory and Lyapunov formulations guaranteeing LISS of the composite system are provided in this paper. Notably, estimates for the resulting stability region of the composite system are also given. This in particular provides an advantage over the linearization approach, as will be discussed. 相似文献
93.
With motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions. 相似文献
94.
Jon Olav Hauglid Norvald H. Ryeng Kjetil Nørvåg 《Distributed and Parallel Databases》2010,28(2-3):157-185
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach. 相似文献
95.
D. Bjørner 《Cybernetics and Systems Analysis》2010,46(4):609-623
In this paper, we wish to advocate that departments of computer science put emphasis on teaching programming and software
engineering based on formal methods; and more emphasis on research into formal methods for the trustworthy development of
software. We also wish to advocate that the concepts of domain science and domain engineering become an indispensable part
of the science of informatics and of software engineering. 相似文献
96.
Michael A. Bender Gerth Stølting Brodal Rolf Fagerberg Riko Jacob Elias Vicari 《Theory of Computing Systems》2010,47(4):934-962
We study the problem of sparse-matrix dense-vector multiplication (SpMV) in external memory. The task of SpMV is to compute
y:=Ax, where A is a sparse N×N matrix and x is a vector. We express sparsity by a parameter k, and for each choice of k consider the class of matrices where the number of nonzero entries is kN, i.e., where the average number of nonzero entries per column is k. 相似文献
97.
Roberto Sanchez Geneviève Dauphin-Tanguy Xavier Guillaud Frédéric Colas 《Simulation Modelling Practice and Theory》2010,18(9):1185-1198
This paper proposes a model of a three phase electrical inverter with a LC output filter in delta connection used in a renewable energy supply system. The concept of inverse bond graph via bicausality is used for the control law design. The control law robustness is tested by connecting passive and active (induction machine) loads. 相似文献
98.
Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications 总被引:1,自引:0,他引:1
Tae-Kyun Kim Björn Stenger Josef Kittler Roberto Cipolla 《International Journal of Computer Vision》2011,91(2):216-232
This paper presents an incremental learning solution for Linear Discriminant Analysis (LDA) and its applications to object
recognition problems. We apply the sufficient spanning set approximation in three steps i.e. update for the total scatter matrix, between-class scatter matrix and the projected data
matrix, which leads an online solution which closely agrees with the batch solution in accuracy while significantly reducing
the computational complexity. The algorithm yields an efficient solution to incremental LDA even when the number of classes
as well as the set size is large. The incremental LDA method has been also shown useful for semi-supervised online learning.
Label propagation is done by integrating the incremental LDA into an EM framework. The method has been demonstrated in the
task of merging large datasets which were collected during MPEG standardization for face image retrieval, face authentication
using the BANCA dataset, and object categorisation using the Caltech101 dataset. 相似文献
99.
Flavien PilletAuthor Vitae Carmen RomeraAuthor Vitae Emmanuelle TrévisiolAuthor Vitae Sophie BellonAuthor VitaeMarie-Paule Teulade-FichouAuthor Vitae Jean-Marie FrançoisAuthor Vitae Geneviève PratvielAuthor Vitae Véronique Anton LeberreAuthor Vitae 《Sensors and actuators. B, Chemical》2011,157(1):304-309
Surface plasmon resonance imaging (SPRi) is a label free technology for biomolecular interaction, which gives access to binding kinetic parameters from real time acquisition. It offers the possibility to test in a single run a large number of interactions, allowing rapid identification of the most suitable compounds toward a given biological entity. Until now, this technique has proven to be relevant for interaction between relatively large molecules (protein, antibodies, DNA) but has not been challenged yet for the screening of small molecules that can be of interested in the field of drug discovery. As a proof a principle, we have used SPRi to screen for interaction of several small molecules, referred to as G4-ligands on G-quadruplex DNA. This technology allowed to easy discrimination of the binding properties of four G4-ligands on quadruplex DNA models. 相似文献
100.
We introduce a class of tree bimorphisms that define exactly the translations performed by syntax-directed translation schemata. We also show that these “quasi-alphabetic” tree bimorphisms preserve recognizability, and that their class is closed under composition and inverses. 相似文献