全文获取类型
收费全文 | 3033篇 |
免费 | 385篇 |
国内免费 | 264篇 |
专业分类
电工技术 | 87篇 |
技术理论 | 1篇 |
综合类 | 278篇 |
化学工业 | 224篇 |
金属工艺 | 34篇 |
机械仪表 | 98篇 |
建筑科学 | 272篇 |
矿业工程 | 37篇 |
能源动力 | 65篇 |
轻工业 | 141篇 |
水利工程 | 151篇 |
石油天然气 | 52篇 |
武器工业 | 9篇 |
无线电 | 280篇 |
一般工业技术 | 301篇 |
冶金工业 | 219篇 |
原子能技术 | 10篇 |
自动化技术 | 1423篇 |
出版年
2024年 | 24篇 |
2023年 | 69篇 |
2022年 | 104篇 |
2021年 | 124篇 |
2020年 | 113篇 |
2019年 | 121篇 |
2018年 | 98篇 |
2017年 | 113篇 |
2016年 | 127篇 |
2015年 | 119篇 |
2014年 | 179篇 |
2013年 | 163篇 |
2012年 | 184篇 |
2011年 | 208篇 |
2010年 | 185篇 |
2009年 | 201篇 |
2008年 | 201篇 |
2007年 | 213篇 |
2006年 | 174篇 |
2005年 | 155篇 |
2004年 | 131篇 |
2003年 | 120篇 |
2002年 | 97篇 |
2001年 | 81篇 |
2000年 | 41篇 |
1999年 | 48篇 |
1998年 | 32篇 |
1997年 | 26篇 |
1996年 | 19篇 |
1995年 | 14篇 |
1994年 | 21篇 |
1993年 | 12篇 |
1992年 | 8篇 |
1991年 | 10篇 |
1990年 | 12篇 |
1989年 | 11篇 |
1988年 | 21篇 |
1987年 | 6篇 |
1986年 | 6篇 |
1985年 | 10篇 |
1984年 | 11篇 |
1982年 | 6篇 |
1980年 | 4篇 |
1978年 | 4篇 |
1973年 | 4篇 |
1964年 | 6篇 |
1962年 | 4篇 |
1958年 | 5篇 |
1957年 | 4篇 |
1955年 | 5篇 |
排序方式: 共有3682条查询结果,搜索用时 15 毫秒
101.
基于数据挖掘的个性化网页推送服务模式研究 总被引:1,自引:1,他引:0
周文鹏 《计算机与数字工程》2010,38(8):58-61
为满足用户及时获取个性化信息的需求,利用数据挖掘中的聚类分析方法对Web日志数据进行聚类,对网站已有用户的访问行为进行划分,得出各类别用户网页推送的数据集;采用关联规则方法提取聚类结果中各个簇的访问规则,完成个性化页面推送服务。结果表明该模式能够实现网站个性化页面推送的功能。 相似文献
102.
序列模式挖掘是数据挖掘的一个重要问题.传统的序列模式仅能揭示频繁出现的项目以及出现的顺序,但不能揭示在前续项目出现的情况下,后续项目出现的时间.在本文中,引入一种新的多时间粒度序列模式,模式中相邻项目之间的转换时间采用从原数据集中导出的、多时间粒度下的最小有界时间区间和平均时间标注.建立了多时间粒度序列模式挖掘模型,提出了一种新的多时间序列模式挖掘算法MG-PrefixSpan.实验表明,算法是有效的. 相似文献
103.
多模式串匹配算法是网络内容过滤系统的核心技术。巨大的存储空间开销是制约多模式匹配串算法应用的瓶颈之一。提出一种基于子串识别的多模式匹配算法—HashBOM,该算法利用位哈希表存储模式串的子串信息以大幅度减少存储空间,利用递归哈希函数计算字符串的哈希值以实现快速匹配。理论分析表明,该算法的空间复杂度为O(rm~2),优于基于子串识别的匹配算法BOM的空间复杂度O(mr|∑|log_2mr);该算法搜索匹配过程的平均时间复杂度为O(nlog|∑|)mr/m,与BOM算法相同(其中m为最短模式串的长度,r为模式串的个数,n为待匹配文本的长度,|∑|为字母表的大小)。在随机数据集和真实数据集上的实验表明,该算法的存储空间远远低于BOM算法,而匹配速度与BOM算法相当,非常适合在线实时匹配的应用环境。 相似文献
104.
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving–yet restricted–set of tuples and thus provide timely and incremental results. Although sliding windows get frequently employed in many user requests, additional types like partitioned or landmark windows are also available in stream processing engines. In this paper, we set out to study the existence of monotonic-related semantics for a rich set of windowing constructs in order to facilitate a more efficient maintenance of their changing contents. After laying out a formal foundation for expressing windowed queries, we investigate update patterns observed in most common window variants as well as their impact on adaptations of typical operators (like windowed join, union or aggregation), thus offering more insight towards design and implementation of stream processing mechanisms. Furthermore, we identify syntactic equivalences in algebraic expressions involving windows, to the potential benefit of query optimizations. Finally, this framework is validated for several windowed operations against streaming datasets with simulations at diverse arrival rates and window specifications, providing concrete evidence of its significance. 相似文献
105.
Christian Hübscher Stefan L. PauwelsSandra P. Roth Javier A. Bargas-AvilaKlaus Opwis 《Interacting with computers》2011,23(3):189-201
This work explores the possibility of taking the structural characteristics of approaches to interaction design as a basis for the organization of interaction design patterns. The Universal Model of the User Interface (Baxley, 2003) is seen as well suited to this; however, in order to cover the full range of interaction design patterns the model had to be extended slightly. Four existing collections of interaction design patterns have been selected for an analysis in which the patterns have been mapped onto the extended model. The conclusion from this analysis is that the use of the model supports the process of building a pattern language, because it is predictive and helps to complete the language. If several pattern writers were to adopt the model, a new level of synergy could be attained among these pattern efforts. A concluding vision would be that patterns could be transferred freely between pattern collections to make them as complete as possible. 相似文献
106.
Many kinds of information are hidden in email data, such as the information being exchanged, the time of exchange, and the user IDs participating in the exchange. Analyzing the email data can reveal valuable information about the social networks of a single user or multiple users, the topics being discussed, and so on. In this paper, we describe a novel approach for temporally analyzing the communication patterns embedded in email data based on time series segmentation. The approach computes egocentric communication patterns of a single user, as well as sociocentric communication patterns involving multiple users. Time series segmentation is used to uncover patterns that may span multiple time points and to study how these patterns change over time. To find egocentric patterns, the email communication of a user is represented as an item-set time series. An optimal segmentation of the item-set time series is constructed, from which patterns are extracted. To find sociocentric patterns, the email data is represented as an item-setgroup time series. Patterns involving multiple users are then extracted from an optimal segmentation of the item-setgroup time series. The proposed approach is applied to the Enron email data set, which produced very promising results. 相似文献
107.
The process of designing a networked learning environment can be characterized by a high degree of uncertainty. This is especially true when the design includes innovative technologies. It is difficult to design a networked learning environment that closely fits the requirements of the educational practice. Often the technology seems leading in the design process because it is the most tangible aspect of the e-learning environment. This brings along the risk that the technology becomes detached from its context of use.Design patterns are a means to overcome this problem of detachment between design and practice. Design patterns make the tight relationship between the two more explicit. In this paper we further elaborate on the relationship between design and practice. We will stress the importance of theory in the development of design patterns. Theory development is an essential aspect of our approach to the development of design patterns. The approach is oriented towards a systematic analysis of problems and the development of conceptual models that guide the definition and evaluation of design patterns. In this paper we present a case study of how the approach was used to develop design patterns for networked learning in the classroom. 相似文献
108.
Frequent pattern mining is an essential theme in data mining. Existing algorithms usually use a bottom-up search strategy. However, for very high dimensional data, this strategy cannot fully utilize the minimum support constraint to prune the rowset search space. In this paper, we propose a new method called top-down mining together with a novel row enumeration tree to make full use of the pruning power of the minimum support constraint. Furthermore, to efficiently check if a rowset is closed, we develop a method called the trace-based method. Based on these methods, an algorithm called TD-Close is designed for mining a complete set of frequent closed patterns. To enhance its performance further, we improve it by using new pruning strategies and new data structures that lead to a new algorithm TTD-Close. Our performance study shows that the top-down strategy is effective in cutting down search space and saving memory space, while the trace-based method facilitates the closeness-checking. As a result, the algorithm TTD-Close outperforms the bottom-up search algorithms such as Carpenter and FPclose in most cases. It also runs faster than TD-Close. 相似文献
109.
An order-clique-based approach for mining maximal co-locations 总被引:2,自引:0,他引:2
Most algorithms for mining spatial co-locations adopt an Apriori-like approach to generate size-k prevalence co-locations after size-(k − 1) prevalence co-locations. However, generating and storing the co-locations and table instances is costly. A novel order-clique-based approach for mining maximal co-locations is proposed in this paper. The efficiency of the approach is achieved by two techniques: (1) the spatial neighbor relationships and the size-2 prevalence co-locations are compressed into extended prefix-tree structures, which allows the order-clique-based approach to mine candidate maximal co-locations and co-location instances; and (2) the co-location instances do not need to be stored after computing some characteristics of the corresponding co-location, which significantly reduces the execution time and space required for mining maximal co-locations. The performance study shows that the new method is efficient for mining both long and short co-location patterns, and is faster than some other methods (in particular the join-based method and the join-less method). 相似文献
110.
Abdenour Hadid Author Vitae Matti Pietikäinen Author Vitae 《Pattern recognition》2009,42(11):2818-2827
While many works consider moving faces only as collections of frames and apply still image-based methods, recent developments indicate that excellent results can be obtained using texture-based spatiotemporal representations for describing and analyzing faces in videos. Inspired by the psychophysical findings which state that facial movements can provide valuable information to face analysis, and also by our recent success in using LBP (local binary patterns) for combining appearance and motion for dynamic texture analysis, this paper investigates the combination of facial appearance (the shape of the face) and motion (the way a person is talking and moving his/her facial features) for face analysis in videos. We propose and study an approach for spatiotemporal face and gender recognition from videos using an extended set of volume LBP features and a boosting scheme. We experiment with several publicly available video face databases and consider different benchmark methods for comparison. Our extensive experimental analysis clearly assesses the promising performance of the LBP-based spatiotemporal representations for describing and analyzing faces in videos. 相似文献