全文获取类型
收费全文 | 3870篇 |
免费 | 251篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 43篇 |
综合类 | 2篇 |
化学工业 | 1063篇 |
金属工艺 | 60篇 |
机械仪表 | 108篇 |
建筑科学 | 100篇 |
矿业工程 | 6篇 |
能源动力 | 190篇 |
轻工业 | 532篇 |
水利工程 | 34篇 |
石油天然气 | 14篇 |
无线电 | 264篇 |
一般工业技术 | 680篇 |
冶金工业 | 108篇 |
原子能技术 | 31篇 |
自动化技术 | 897篇 |
出版年
2024年 | 7篇 |
2023年 | 66篇 |
2022年 | 171篇 |
2021年 | 196篇 |
2020年 | 139篇 |
2019年 | 137篇 |
2018年 | 157篇 |
2017年 | 152篇 |
2016年 | 179篇 |
2015年 | 127篇 |
2014年 | 195篇 |
2013年 | 303篇 |
2012年 | 250篇 |
2011年 | 330篇 |
2010年 | 211篇 |
2009年 | 224篇 |
2008年 | 186篇 |
2007年 | 172篇 |
2006年 | 126篇 |
2005年 | 126篇 |
2004年 | 77篇 |
2003年 | 65篇 |
2002年 | 69篇 |
2001年 | 49篇 |
2000年 | 40篇 |
1999年 | 30篇 |
1998年 | 35篇 |
1997年 | 25篇 |
1996年 | 37篇 |
1995年 | 26篇 |
1994年 | 18篇 |
1993年 | 11篇 |
1992年 | 13篇 |
1991年 | 22篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 12篇 |
1987年 | 6篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 14篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 9篇 |
1977年 | 6篇 |
1975年 | 5篇 |
1973年 | 6篇 |
1972年 | 3篇 |
排序方式: 共有4132条查询结果,搜索用时 11 毫秒
21.
Rodrygo L.T. Santos Pablo A. Roberto Alberto H.F. Laender 《Journal of Systems and Software》2008,81(5):809-822
We present a new Web services-based framework for building componentized digital libraries (DLs). We particularly demonstrate how traditional RDBMS technology can be easily deployed to support several common digital library services. Configuration and customization of the framework to build specialized systems is supported by a wizard-like tool which is based on a generic metamodel for DLs. Such a tool implements a workflow process that segments the DL design tasks into well-defined steps and drives the designer along these steps. Both the framework and the configuration tool are evaluated in terms of several performance and usability criteria. Our experimental evaluation demonstrates the feasibility and superior performance of our framework, as well as the effectiveness of the wizard tool for setting up DLs. 相似文献
22.
Motif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of such motifs. The remainder of the paper presents approaches to the discovery of irredundant motifs both by offline and incremental algorithms. 相似文献
23.
Alberto Ros Ricardo Fernández-Pascual Manuel E. Acacio José M. García 《Journal of Parallel and Distributed Computing》2008
In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node’s L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails. 相似文献
24.
Yolanda Blanco-Fernndez Jos J. Pazos-Arias Alberto Gil-Solla Manuel Ramos-Cabrer Martín Lpez-Nores Jorge García-Duque Ana Fernndez-Vilas Rebeca P. Díaz-Redondo Jesús Bermejo-Muoz 《Knowledge》2008,21(4):305-320
Recommender systems arose with the goal of helping users search in overloaded information domains (like e-commerce, e-learning or Digital TV). These tools automatically select items (commercial products, educational courses, TV programs, etc.) that may be appealing to each user taking into account his/her personal preferences. The personalization strategies used to compare these preferences with the available items suffer from well-known deficiencies that reduce the quality of the recommendations. Most of the limitations arise from using syntactic matching techniques because they miss a lot of useful knowledge during the recommendation process. In this paper, we propose a personalization strategy that overcomes these drawbacks by applying inference techniques borrowed from the Semantic Web. Our approach reasons about the semantics of items and user preferences to discover complex associations between them. These semantic associations provide additional knowledge about the user preferences, and permit the recommender system to compare them with the available items in a more effective way. The proposed strategy is flexible enough to be applied in many recommender systems, regardless of their application domain. Here, we illustrate its use in AVATAR, a tool that selects appealing audiovisual programs from among the myriad available in Digital TV. 相似文献
25.
Guilherme T. de Assis Alberto H. F. Laender Marcos André Gonçalves Altigran S. da Silva 《World Wide Web》2009,12(3):285-319
Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing
an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages
deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a
topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we
describe an approach to focused crawling that exploits not only content-related information but also genre information present
in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic
of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and
the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The
effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the
crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers
of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve
levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the
relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed
strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert
or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such
a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling
process. 相似文献
26.
Degree-Optimal Routing for P2P Systems 总被引:1,自引:0,他引:1
Giovanni Chiola Gennaro Cordasco Luisa Gargano Mikael Hammar Alberto Negro Vittorio Scarano 《Theory of Computing Systems》2009,45(1):43-63
We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g.
optimal average path length O(log 2
n/δlog δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is optimal. It is known that Ω(log n) is a lower bound on the average path length for uniform overlays with O(log n) degree (Xu et al., IEEE J. Sel. Areas Commun. 22(1), 151–163, 2004).
Our work is inspired by neighbor-of-neighbor (NoN) routing, a recently introduced variation of greedy routing that allows us to achieve optimal average path length in randomized networks. The advantage of our proposal is that of allowing
the NoN technique to be implemented without adding any overhead to the corresponding deterministic network.
We propose a family of networks parameterized with a positive integer c which measures the amount of randomness that is used. By varying the value c, the system goes from the deterministic case (c=1) to an “almost uniform” system. Increasing c to relatively low values allows for routing with asymptotically optimal average path length while retaining most of the advantages
of a uniform system, such as easy programmability and quick bootstrap of the nodes entering the system.
We also provide a matching lower bound for the average path length of the routing schemes for any c.
This work was partially supported by the Italian FIRB project “WEB-MINDS” (Wide-scalE, Broadband MIddleware for Network Distributed
Services), . 相似文献
27.
月球探测(车)机器人技术的发展与展望 总被引:1,自引:0,他引:1
简述当前国内外探月研究进展及月球探测(车)机器人研究发展情况.基于月球的复杂环境特征,对比轮式运动与步行式运动月球探测(车)机器人的优势与缺陷,重点介绍了一种新型六轮腿式月球探测机器人方案.该方案具有高机动性,越障能力强,容错性好等特点,对该方案主要技术性能、本体结构、运动系统、轮腿切换机构工作原理等关键技术进行了探讨. 相似文献
28.
Applied Intelligence - Forecasting future heat load in smart district heating networks is a key problem for utility companies that need such predictions for optimizing their operational activities.... 相似文献
29.
A growing number of patients are recognised to have chronic kidney disease (CKD). However, only a minority will progress to end-stage renal disease requiring dialysis or transplantation. Currently available diagnostic and staging tools frequently fail to identify those at higher risk of progression or death. Furthermore within specific disease entities there are shortcomings in the prediction of the need for therapeutic interventions or the response to different forms of therapy. Kidney and urine proteomic biomarkers are considered as promising diagnostic tools to predict CKD progression early in diabetic nephropathy, facilitating timely and selective intervention that may reduce the related health-care expenditures. However, independent groups have not validated these findings and the technique is not currently available for routine clinical care. Furthermore, there are gaps in our understanding of predictors of progression or need for therapy in non-diabetic CKD. Presumably, a combination of tissue and urine biomarkers will be more informative than individual markers. This review identifies clinical questions in need of an answer, summarises current information on proteomic biomarkers and CKD, and describes the European Kidney and Urine Proteomics initiative that has been launched to carry out a clinical study aimed at identifying urinary proteomic biomarkers distinguishing between fast and slow progressors among patients with biopsy-proven primary glomerulopathies. 相似文献
30.
When performing a classification task, we may find some data-sets with a different class distribution among their patterns. This problem is known as classification with imbalanced data-sets and it appears in many real application areas. For this reason, it has recently become a relevant topic in the area of Machine Learning.The aim of this work is to improve the behaviour of fuzzy rule based classification systems (FRBCSs) in the framework of imbalanced data-sets by means of a tuning step. Specifically, we adapt the 2-tuples based genetic tuning approach to classification problems showing the good synergy between this method and some FRBCSs.Our empirical results show that the 2-tuples based genetic tuning increases the performance of FRBCSs in all types of imbalanced data. Furthermore, when the initial Rule Base, built by a fuzzy rule learning methodology, obtains a good behaviour in terms of accuracy, we achieve a higher improvement in performance for the whole model when applying the genetic 2-tuples post-processing step. This enhancement is also obtained in the case of cooperation with a preprocessing stage, proving the necessity of rebalancing the training set before the learning phase when dealing with imbalanced data. 相似文献