检索结果-内蒙古大学图书馆

International Conference on Peer-to-Peer Computing

作者： Dingyi Han Ting Shen Shicong Meng Yong Yu Apex Data & Knowledge Management Laboratory Department of Computer Science & Engineering Shanghai Jiaotong University Shanghai China

Locality sensitive hash (LSH) is widely used in peer-to-peer (P2P) systems. Although it can support range or similarity queries, it breaks the load balance mechanism of traditional distributed hash table (DHT) based system by replacing consistent hash with LSH. To solve the imbalance problem, current systems either weaken the locality preserve ability from similarity preserved to order preserved or adopt load aware peer join mechanism. The first method does not support similarity query as it loses the similarity information and the second method is greatly affected by the dynamic nature of P2P networks. In this paper, we propose a novel system, cuckoo ring, which can preserve similarity information while load balanced. It does not guide the newly joining peer to the hot areas but move the items in the hot areas to cold areas so that the short life time peers are distributed uniformly across the network instead of being guided to the hot areas. Compared to traditional DHT systems, cuckoo ring only maintains a little more information about the global light load peers and the moved indexed items

关键词： Indexing Load management knowledge management computer science Data engineering knowledge engineering Nearest neighbor searches Q measurement

来源：评论

学校读者我要写书评

暂无评论

Information retrieval in folksonomies: Search and ranking

引用

3rd European Semantic Web Conference, ESWC 2006

作者： Hotho, Andreas Jäschke, Robert Schmilz, Christoph Stumme, Gerd Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 D-34121 Kassel Germany Research Center L3S Expo Plaza 1 D-30539 Hannover Germany

ISBN: (纸本)3540345442

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. The reason for their immediate success is the fact that no specific skills are needed for participating. At the moment, however, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

Emergent semantics in BibSonomy

Emergent semantics in BibSonomy

引用

36th Jahrestagung der Gesellschaft fur Informatik e.V. (GI): Informatik fur Menschen, INFORMATIK 2006

作者： Hotho, Andreas Jäschke, Robert Schmitz, Christoph Stumme, Gerd Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 D-34121 Kassel Germany Research Center L3S Expo Plaza 1 D-30539 Hannover Germany

ISBN: (纸本)9783885791881

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A product oriented approach to Dynamic Scheduling

A product oriented approach to Dynamic Scheduling

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Ana Almeida Lino Figueiredo Knowledge Engineering and Decision Support Research Group-GECAD Computer Science Department Institute Engineering of Porto Porto Portugal Knowledge Engineering and Decision Support Research Group-GECAD Electronic Department Institute Engineering of Porto Porto Portugal

The purpose of this paper is to present a system for dynamic scheduling of manufacturing orders using a product oriented approach, to be used in an integrated manner for dynamic, inter-active and iterative scheduling under a scheduling decision support system. Here is described a due date based scheduling method, where al the operations of one task are scheduled before the next task is considered, a task is considered to be the set of all the operations needed to produce one product. The referred method is to be applied to solve real world dynamic scheduling problems in a multi-order multi-resource environment, where the products to be processed have release times and due dates, and the resources are available in a limited amount. Some realistic constraints are considered, such as multilevel tasks, shared resources, alternative resources and temporal constraints. The objective is to meet the deadlines for all the tasks. Yet there is one limitation, pre-emption is not allowed.

关键词： Dynamic scheduling Job shop scheduling Processor scheduling Decision support systems knowledge engineering Humans Manufacturing systems computer science computer aided manufacturing computer integrated manufacturing

来源：评论

学校读者我要写书评

暂无评论

Runtime Semantic Interoperability for Gathering Ontology-based Network Context

Runtime Semantic Interoperability for Gathering Ontology-bas...

引用

IEEE Symposium on Network Operations and Management

作者： J. Keeney D. Lewis D. O'Sullivan A. Roelens V. Wade A. Boran R. Richardson Knowledge & Data Engineering Group Department of Computer Science Trinity College Dublin Dublin Ireland Bell Laboratories Ireland

The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network knowledge without necessarily binding explicitly to all of the potential sources of that knowledge. Though event-based publish-subscribe models allow efficient distribution of knowledge where the event types are known globally, dynamic service chains, ad hoc networks and pervasive computing application all introduce a more fluid and heterogeneous range of context knowledge. This requires some runtime translation of knowledge between sources and sinks of network context. This paper builds on existing mapping techniques that use ontological forms of existing management information models to examine the extent to which these can be employed for runtime semantic interoperability for network knowledge. It presents results in developing a management knowledge delivery framework based on existing models and platforms, but which offers a more decentralized knowledge exchange mechanism

关键词： Runtime Ontologies knowledge management Intelligent networks Publish-subscribe Context modeling Fluid dynamics Ad hoc networks Pervasive computing Context-aware services

来源：评论

学校读者我要写书评

暂无评论

Folkrank: A ranking algorithm for folksonomies

Folkrank: A ranking algorithm for folksonomies

引用

Workshop-Woche on Lernen, Wissen und Adaptivitat, LWA 2006

作者： Hotho, Andreas Jäschke, Robert Schmitz, Christoph Stumme, Gerd Knowledge and Data Engineering Group Department of Mathematics and Computer Science University of Kassel Wilhelmshöher Allee 73 D34121 Kassel Germany Research Center L3S Expo Plaza 1 D30539 Hannover Germany

In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structure search results. All findings are demonstrated on a large scale dataset. A long version of this paper has been published at the European Semantic Web Conference 2006 [3].

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Improved Classification of Surface Defects for Quality Control of Car Body Panels

Improved Classification of Surface Defects for Quality Contr...

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： C. Doring A. Eichhorn Xiaomeng Wang R. Kruse Department of Knowledge Processing and Language Engineering Faculty of Computer Science University of Magdeburg Magdeburg Germany BMW Group Munich Germany

The detection of the types of local surface form deviations is a major step in the automated quality assessment of car body parts during the manufacturing process. In previous studies we compared the performance of different soft computing techniques for this purpose. We achieved promising results with regard to classification accuracy and interpretability of rule bases, even though the dataset was rather small, high dimensional and unbalanced. In this paper we reconsider the collection of training examples and their assignment to defect types by the quality experts. We attempt to minimize the uncertainty of the quality experts' subjective and error-prone labelling in order to achieve a higher reliability of the defect detection. We show that refined and more accurate classification models can be built on the basis of a preprocessed training set that is more consistent. Using a partially supervised learning strategy we can report improvements in classification accuracy.

关键词： Quality control Manufacturing processes Paints Production Surface treatment Optical distortion Quality assessment Uncertainty Labeling Refining

来源：评论

学校读者我要写书评

暂无评论

A distributed model for capacitance requirements for self excited induction generators

引用

International Journal for engineering Modelling 2006年第1-4期19卷 11-14页

作者： Nithiyananthan, Kannan Ramachandran, Velimuthu Birla Institute of Technology and Science - Pilani Dubai Campus Knowledge Village Dubai 500022 United Arab Emirates Department of Computer Science and Engineering College of Engineering Guindy Anna University Chennai-600 025 India

The main objective of this paper is to construct a distributed environment through which the capacitance requirements of self excited induction generators can be monitored and controlled. A single-server/ multi-client architecture has been proposed which enables the self excited induction generators to access the remote server at any time, being able with their respective data to get the minimum capacitance requirements. An RMI (Remote Method Invocation) based distributed model has been developed in such a way that for every specific period of time, the remote server obtains the system data simultaneously from the neighbouring self excited induction generators with which the clients are registered and the server sends back the capacitance requirements as a response to the respective clients. The server creates a new thread of control for every client request and hence a complete distributed environment has been exploited.

关键词： Capacitance

来源：评论

学校读者我要写书评

暂无评论

Mining Maximal Frequent Patterns in a Unidirectional FP-tree

引用

Journal of Donghua University(English Edition) 2006年第6期000卷 105-109页

作者： SONG Jing-jing LIU Rui-xin WANG Yan JIANG Bao-qing SONG Jing-jing(Institute of Data and Knowledge Engineering Henan University Kaifeng 475001) LIU Rui-xin(Information Engineering Science Department Yellow River Conservancy Technical Institute Kaifeng 475003) WANG Yan(Institute of Data and Knowledge Engineering Henan University Kaifeng 475001 Department of Computer Science and Application Zhengzhou Institute of Aeronautical Industry Management Zhengzhou 450015)

Becausemining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However,because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques:single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_ FP-Max further lowers the expense of time and space.

关键词： data mining frequent pattern the maximal frequent pattern Unid _ FP-tree conditional Unid _ FP-tree

来源：评论

学校读者我要写书评

暂无评论

New Markov model used for path prediction over WLAN

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2006年第SUPPL. 1期36卷 24-28页

作者： Yu, Xue-Gang Liu, Yan-Heng Wei, Da Tian, Ming Wang, Pin College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China Department of Mathematics Ocean University of China Qingdao 266003 China

In order to reduce the complexity of the state space in Order-k Markov predictor, a new Step-2 Markov predictor is proposed to make path prediction over WLAN. The feasibility of the Step-2 Markov predictor is proved by calculating and comparing conditional entropy of Step-2 and Order-k Markov predictors. And the paper also analyzes and compares the prediction accuracy of the two kinds of Markov predictors using actual Wi-Fi trace data. The work shows that the Step-2 Markov predictor is more stable than Order-1 Markov predictor for different length trace files and it also reduces the complexity of the Markov state space dramatically and gets approximately the same prediction accuracy with Order-2 Markov predictor and higher accuracy than Order-k (k≠2) Markov predictors.

关键词： Local area networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：