全文获取类型
收费全文 | 1119篇 |
免费 | 211篇 |
国内免费 | 171篇 |
学科分类
工业技术 | 1501篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 37篇 |
2021年 | 44篇 |
2020年 | 60篇 |
2019年 | 57篇 |
2018年 | 56篇 |
2017年 | 41篇 |
2016年 | 47篇 |
2015年 | 52篇 |
2014年 | 75篇 |
2013年 | 68篇 |
2012年 | 87篇 |
2011年 | 69篇 |
2010年 | 79篇 |
2009年 | 80篇 |
2008年 | 82篇 |
2007年 | 89篇 |
2006年 | 67篇 |
2005年 | 71篇 |
2004年 | 44篇 |
2003年 | 46篇 |
2002年 | 30篇 |
2001年 | 31篇 |
2000年 | 24篇 |
1999年 | 16篇 |
1998年 | 17篇 |
1997年 | 17篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 9篇 |
1993年 | 8篇 |
1992年 | 15篇 |
1991年 | 15篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有1501条查询结果,搜索用时 31 毫秒
81.
82.
一种基于可用带宽的QoS多播路由算法 总被引:3,自引:2,他引:3
余萍 《计算机工程与设计》2006,27(16):2976-2978
设计一个加权最大可用带宽多播树求解模型,将可用带宽作为主度量并同时兼顾时延、时延抖动和包丢失率3个QoS约束构建多播树.各QoS度量的重要性可根据实际的服务需求灵活调整,算法具有多项式复杂度,并通过仿真证明其有效性. 相似文献
83.
84.
An integrated multi-unit chemical plant presents a challenging control design problem due to the existence of recycling streams. In this paper, we develop a framework for analyzing the effects of recycling dynamics on closed-loop performance from which a systematic design of a decentralized control system for a recycled, multi-unit plant is established. In the proposed approach, the recycled streams are treated as unmodelled dynamics of the “unit” model so that their effects on closed-loop stability and performance can be analyzed using the robust control theory. As a result, two measures are produced: (1) the ν-gap metric, which quantifies the strength of recycling effects, and (2) the maximum stability margin of “unit” controller, which represents the ability of the “unit” controller to compensate for such effects. A simple rule for the “unit” control design is then established using the combined two measures in order to guarantee the attainment of good overall closed-loop performances. As illustrated by several design examples, the controllability of a recycled, multi unit process under a decentralized “unit” controller can be determined without requiring any detailed design of the “unit” controller because the simple rule is calculated from the open-loop information only. 相似文献
85.
I. EpifanioAuthor Vitae J. GutiérrezAuthor VitaeJ. MaloAuthor Vitae 《Pattern recognition》2003,36(8):1799-1811
Two types of redundancies are contained in images: statistical redundancy and psychovisual redundancy. Image representation techniques for image coding should remove both redundancies in order to obtain good results. In order to establish an appropriate representation, the standard approach to transform coding only considers the statistical redundancy, whereas the psychovisual factors are introduced after the selection of the representation as a simple scalar weighting in the transform domain.In this work, we take into account the psychovisual factors in the definition of the representation together with the statistical factors, by means of the perceptual metric and the covariance matrix, respectively. In general the ellipsoids described by these matrices are not aligned. Therefore, the optimal basis for image representation should simultaneously diagonalize both matrices. This approach to the basis selection problem has several advantages in the particular application of image coding. As the transform domain is Euclidean (by definition), the quantizer design is highly simplified and at the same time, the use of scalar quantizers is truly justified. The proposed representation is compared to covariance-based representations such as the DCT and the KLT or PCA using standard JPEG-like and Max-Lloyd quantizers. 相似文献
86.
面向对象软件度量技术 总被引:4,自引:0,他引:4
提出了OO度量评价规则和标识一组OO度量套件的方法,一组切实可行的OO度量套件及其形式化描述方法,评价OO关键概念和结构特性。质量度量模型是软件质量评价体系中的关键技术,采用层次结构的度量模型。通过质量度量模型,就建立了软件内部属性和外部属性间的客观的定量的联系。OO软件度量框架用以规范化地帮助评测软件产品质量的过程。 相似文献
87.
Dohnal Vlastislav Gennaro Claudio Savino Pasquale Zezula Pavel 《Multimedia Tools and Applications》2003,21(1):9-33
In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations. 相似文献
88.
89.
90.