全文获取类型
收费全文 | 739篇 |
免费 | 39篇 |
国内免费 | 33篇 |
学科分类
工业技术 | 811篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 3篇 |
2021年 | 13篇 |
2020年 | 13篇 |
2019年 | 13篇 |
2018年 | 17篇 |
2017年 | 27篇 |
2016年 | 30篇 |
2015年 | 32篇 |
2014年 | 47篇 |
2013年 | 42篇 |
2012年 | 53篇 |
2011年 | 53篇 |
2010年 | 44篇 |
2009年 | 69篇 |
2008年 | 42篇 |
2007年 | 50篇 |
2006年 | 44篇 |
2005年 | 45篇 |
2004年 | 29篇 |
2003年 | 28篇 |
2002年 | 24篇 |
2001年 | 11篇 |
2000年 | 11篇 |
1999年 | 4篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有811条查询结果,搜索用时 31 毫秒
61.
韦宝典 《计算机工程与应用》2006,42(11):16-20,182
树结构的层次性和链式的存储方式使其在数据查找的实现中体现出很高的效率,在数据插入和删除等操作的实现中无需移动大量节点,因而不仅在计算机科学领域具有广泛的应用,在实现特殊的信息安全方面也具有独特的作用。文章研究如何将树结构应用于仅增签名、前向安全签名、递增签名、可修订签名、内容抽取签名等特殊签名方案的问题,比较分析基于树结构的方案与普通方案在功能和效率上的差异。 相似文献
62.
In this paper, we propose a robust incremental learning framework for accurate skin region segmentation in real-life images. The proposed framework is able to automatically learn the skin color information from each test image in real-time and generate the specific skin model (SSM) for that image. Consequently, the SSM can adapt to a certain image, in which the skin colors may vary from one region to another due to illumination conditions and inherent skin colors. The proposed framework consists of multiple iterations to learn the SSM, and each iteration comprises two major steps: (1) collecting new skin samples by region growing; (2) updating the skin model incrementally with the available skin samples. After the skin model converges (i.e., becomes the SSM), a post-processing can be further performed to fill up the interstices on the skin map. We performed a set of experiments on a large-scale real-life image database and our method observably outperformed the well-known Bayesian histogram. The experimental results confirm that the SSM is more robust than static skin models. 相似文献
63.
Abdelhamid Bouchachia Roland Mittermeir 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(2):193-207
Fuzzy classification systems (FCS) are traditionally built from observations (data points) in an off-line one shot-experiment. Once the learning phase is exhausted, the classifier is no more capable to learn further knowledge from new observations nor is it able to update itself in the future. This paper investigates the problem of incremental learning in the context of FCS. It shows how, in contrast to off-line or batch learning, incremental learning infers knowledge in the form of fuzzy rules from data that evolves over time. To accommodate incremental learning, appropriate mechanisms are applied in all steps of the FCS construction: (1) Incremental supervised clustering to generate granules in a progressive manner, (2) Systematic and automatic update of fuzzy partitions, (3) Incremental feature selection using an incremental version of Fisher’s interclass separability criterion. The effect of incrementality on various aspects is demonstrated via a numerical evaluation. 相似文献
64.
数据挖掘的一个重要方面是挖掘关联规则,目前已提出了包括经典算法Apriori在内的许多算法,而在实际关联规则的挖掘过程中,用户将需要不断调整用于描述用户兴趣程度的阈值:最小支持度和最小置信度。如何维护已发现的关联规则变得至关重要。该文提出的GIUA算法解决了在数据库D不变的情况下,最小支持度和最小置信度发生变化时关联规则的维护问题,最大效率地利用原有结果,通过动态分组将连接步和修剪步的循环减到最少,并尽可能地将挖掘过程并行化。 相似文献
65.
66.
姜玉泉 《计算机工程与应用》2003,39(24):187-188,201
发现最大频繁项目集是多种数据挖掘应用中的关键问题,目前已经提出了许多算法用于发现最大频繁项目集,而对最大频繁项目集维护问题的研究工作却不多,因此,迫切需要设计高效的算法来更新、维护和管理已挖掘出来的最大频繁项目集,为此,该文提出了一种快速的增量式更新最大频繁项目集算法IUAFI,并举例说明了算法的执行过程。 相似文献
67.
在分析现有的关联规则算法FUP的基础上,指出了该算法的不足之处,进而提出了一种改进的增量式更新算法AUI,AUI算法解决了在线环境下最小支持度和最小置信度两个阈值不变而事务数据库发生变化时高效更新关联规则的问题。实验分析证明了新算法的有效性和优越性。 相似文献
68.
Jesus Nuevo Luis M. Bergasa David F. Llorca Manuel Ocaña 《Image and vision computing》2011,29(4):209-218
This paper describes an active model with a robust texture model built on-line. The model uses one camera and it is able to operate without active illumination. The texture model is defined by a series of clusters, which are built in a video sequence using previously encountered samples. This model is used to search for the corresponding element in the following frames. An on-line clustering method, named leaderP is described and evaluated on an application of face tracking. A 20-point shape model is used. This model is built offline, and a robust fitting function is used to restrict the position of the points. Our proposal is to serve as one of the stages in a driver monitoring system. To test it, a new set of sequences of drivers recorded outdoors and in a realistic simulator has been compiled. Experimental results for typical outdoor driving scenarios, with frequent head movement, turns and occlusions are presented. Our approach is tested and compared with the Simultaneous Modeling and Tracking (SMAT) [1], and the recently presented Stacked Trimmed Active Shape Model (STASM) [2], and shows better results than SMAT and similar fitting error levels to STASM, with much faster execution times and improved robustness. 相似文献
69.
Guidelines for the incremental identification of aspects in requirements specifications 总被引:1,自引:0,他引:1
Jorge García-Duque Martín López-Nores José J. Pazos-Arias Ana Fernández-Vilas Rebeca P. Díaz-Redondo Alberto Gil-Solla Manuel Ramos-Cabrer Yolanda Blanco-Fernández 《Requirements Engineering》2006,11(4):239-263
The desired principle of separation of concerns in software development can be jeopardized by the so-called crosscutting concerns, which tend to be scattered over (and tangled with) the functionality of the modular units of a system. The correct identification of such concerns (and their encapsulation into separate artifacts) is thereby considered a way to improve software understanding and evolution. Pursuing a proper management of concerns from the requirements engineering stage can greatly benefit the entire software life-cycle. In this paper, we propose conceptual guidelines on how to perform the identification of crosscutting concerns in the process of building requirements specifications. We argue that the identification must be carried out in an incremental way, to encapsulate apart the crosscutting concerns even if they have not emerged completely yet.
相似文献
Yolanda Blanco-FernándezEmail: |
70.
Petri net is used widely to analyze and model various systems formally. Recently, many Petri nets mania devote their efforts to enhancing and extending the expressive power of Petri nets. One such effort is to extend Petri nets with object-oriented concepts. An object-oriented paradigm provides excellent concepts to model real-world problems. Object-oriented concepts allow us to build software systems easily, intuitively, and naturally. Although several high-level Petri nets with the concept of objects are suggested, these nets do not fully support the object-oriented concepts. In this paper, we propose a hierarchical object-oriented Petri net (HOONet). The formal syntax and semantics of HOONet are explained in detail. HOONet supports a wide range of object-oriented features including abstract, encapsulated and modularized objects, object interaction by message passing, inheritance, and ploymorphism. HOONet also supports a variety of modeling and analysis mechanisms such as incremental modeling of evolving systems, unfolding the HOONet to lower level Petri net, and incremental reachability analysis for HOONet models. We demonstrate the usefulness of HOONet by applying it to modeling and analysis with an example. 相似文献