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

2010 International Conference on Network and Service Management, CNSM 2010

作者： Feeney, Kevin Brennan, Rob Foley, Simon N. FAME Knowledge and Data Engineering Group Trinity College Dublin Ireland FAME Department of Computer Science University College Cork Ireland

ISBN: (纸本)9781424489084

Federated policy systems are required to support the complexity and organizational heterogeneity of the modern marketplace. The Community-based Policy Management System (CBPMS) is such a distributed policy management approach. It utilizes a tree-based capability authority model to partition and delegate federated capabilities. However CBPMS delegation chains have limitations such as: performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and a lack of flexibility with respect to delegation chain reduction or capability authority re-partitioning. In this paper we introduce a trust management model for CBPMS that addresses all of these issues. A brief security analysis is presented and a telecommunications service management use case described. © 2010 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Learning Hierarchical User Interest Models from Web Pages

引用

Wuhan University Journal of Natural sciences 2006年第1期11卷 6-10页

作者： YANG Feng-qin SUN Tie-li SUN Ji-gui College of Computer Science and Technology Jilin University Changchun 130012 Jilin China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 120012 Jilin China Department of Computer Science Northeast Normal University Changchun 130024 Jilin China

We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.

关键词： personalization user interest model vector space model agglomerate clustering method

来源：评论

学校读者我要写书评

暂无评论

Mining and predicting duplication over peer-to-peer query streams

Mining and predicting duplication over peer-to-peer query st...

引用

作者： Meng, Shicong Shao, Yifeng Shi, Cong Han, Dingyi Yu, Yong APEX Data and Knowledge Management Lab. Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China

ISBN: (纸本)0769527027

Many previous works of data mining user queries in Peer-to-Peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models(Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction. © 2006 IEEE.

关键词： Time series analysis

来源：评论

学校读者我要写书评

暂无评论

GTMalpha - Towards a graphical notation for topic maps

GTMalpha - Towards a graphical notation for topic maps

引用

4th International Conference on Topic Maps Research and Applications, TMRA 2008

作者： Thomas, Hendrik Redmann, Tobias Pressler, Maik Markscheffel, Bernd Knowledge and Data Engineering Group School of Computer Science and Statistics Trinity College Dublin Ireland Department of Information and Knowledge Management Faculty of Economic Sciences Ilmenau University of Technology Germany

ISBN: (纸本)9783941152052

In the last years several drafts, recommendations and concepts for a graphical notation for Topic Maps have been published, but till today no graphical notation is generally approved and used in the Topic Maps community. In this paper we present GTMalpha as a conceptual new notation for a graphical representation of Topic Maps. Our objective is, to provide a practical usable notation, which allows a complete, consistent as well as easy to use graphical representation of any given topic map draft. GTMalpha provides a domain as well as a subject centric view and most important it considers the unique characteristics of the Topic Maps paradigm. This paper serves as a user oriented GTMalpha manual for ontology designers, domain experts as well as users.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

An improved ant colony optimization algorithm based on route optimization and its applications in travelling salesman problem

An improved ant colony optimization algorithm based on route...

引用

7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE

作者： Zhang, Yi Pei, Zhi-Li Yang, Jin-Hui Liang, Yan-Chun College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Department of Computer Science Jilin Business and Technology College College of Mathematics and Computer Science Inner Mongolia University for Nationalities

ISBN: (纸本)1424415098

In this paper, we introduce two improvements on Ant Colony Optimization (ACO) algorithm: route optimization and individual variation. The first is an optimized implementation of ACO, by which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance in solving large-scale TSP problems. In the second improvement, we introduce individual variation to ACO, by which the ants have different routing strategies. Simulation results show that the speed of convergence of ACO algorithm could be enhanced greatly. ©2007 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

ExerSync: Facilitating interpersonal synchrony in social exergames 13

ExerSync: Facilitating interpersonal synchrony in social exe...

引用

2013 2nd ACM Conference on computer Supported Cooperative Work, CSCW 2013

作者： Park, Taiwoo Lee, Uichin Lee, Bupjae Lee, Haechan Son, Sanghun Song, Seokyoung Song, Junehwa Department of Computer Science KAIST Daejeon 305-701 Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon 305-701 Korea Republic of

ISBN: (纸本)9781450313315

Social exergames provide immersive experiences of social interaction via online multiplayer games, ranging from simple group exercises (e.g., virtual cycling/rowing) to more structured multiplayer games (e.g., cooperative boat racing). In exergame design, interpersonal synchrony plays an important role as it enhances social rapport and prosocial behavior. In this paper, we build ExerSync platform that supports various assistive mechanisms for facilitating interpersonal synchrony even with heterogeneous exercise modalities. We consider a rhythm of body movements in repetitive aerobic exercises and explore the design space of incorporating rhythm into exergames. We build a prototype system and comparatively evaluate the effectiveness of various assistive mechanisms. The experiment results show that rhythm significantly lowers the perceived workloads and provides better competence and engagement, but the accuracy of interpersonal synchrony is not dependent on the use of rhythm. Copyright 2013 ACM.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

Label-aware Multi-level Contrastive Learning for Cross-lingual Spoken Language Understanding

Label-aware Multi-level Contrastive Learning for Cross-lingu...

引用

2022 Conference on Empirical Methods in Natural Language Processing, EMNLP 2022

作者： Liang, Shining Shou, Linjun Pei, Jian Gong, Ming Zuo, Wanli Zuo, Xianglin Jiang, Daxin College of Computer Science and Technology Jilin University China Key laboratory of Symbolic Computation and Knowledge Engineering MOE STCA Microsoft Department of Electrical & Computer Engineering Duke University United States

Despite the great success of spoken language understanding (SLU) in high-resource languages, it remains challenging in low-resource languages mainly due to the lack of labeled training data. The recent multilingual code-switching approach achieves better alignments of model representations across languages by constructing a mixed-language context in zero-shot cross-lingual SLU. However, current code-switching methods are limited to implicit alignment and disregard the inherent semantic structure in SLU, i.e., the hierarchical inclusion of utterances, slots, and words. In this paper, we propose to model the utterance-slot-word structure by a multi-level contrastive learning framework at the utterance, slot, and word levels to facilitate explicit alignment. Novel code-switching schemes are introduced to generate hard negative examples for our contrastive learning framework. Furthermore, we develop a label-aware joint model leveraging label semantics to enhance the implicit alignment and feed to contrastive learning. Our experimental results show that our proposed methods significantly improve the performance compared with the strong baselines on two zero-shot cross-lingual SLU benchmark datasets. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Modeling method for temperature anomaly analysis 10th

Modeling method for temperature anomaly analysis

引用

10th International Joint Conference on Computational Intelligence, IJCCI 2018

作者： Kerdprasop, Kittisak Chuaybamroong, Paradee Kerdprasop, Nittaya Data and Knowledge Engineering Research Unit School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand Department of Environmental Science Thammasat University Thailand

ISBN: (纸本)9789897583278

This study applies intelligent analytical methods to analyze temperature anomaly events during the past seven centuries of countries in the Southeast Asia including Thailand, Malaysia, Myanmar, and Cambodia. The temperature reconstruction during the years 1300 to 1999 were used as data source for anomaly analysis. In the analytical process, correlation analysis was applied to initially investigate the temperature variability concordance among the Southeast Asian countries. The results are that temperature variability patterns in Thailand, Myanmar, and Cambodia are moderately correlated to each other. On the contrary, the temperature variation patterns of Malaysia do not correlate to other countries in the same region. The further in-depth analysis focuses on the temperature anomaly of Thailand that shows high variability from the 14th to 16th centuries. Several machine learning algorithms had been applied to estimate the temperature anomaly of Thailand based on the anomaly events among the neighbors. The learned models reveal that Myanmar temperature anomaly most associate to the Thailand’s temperature variation. The performance of each model had been assessed and the results reveal that the chi-squared automatic interaction detection, or CHAID, is the best one with 0.624 correlation coefficient and relative error around 0.611. Copyright © 2018 by SCITEPRESS – science and Technology Publications, Lda. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Forest fire area estimation using support vector machine as an approximator 10th

Forest fire area estimation using support vector machine as ...

引用

10th International Joint Conference on Computational Intelligence, IJCCI 2018

作者： Kerdprasop, Nittaya Poomka, Pumrapee Chuaybamroong, Paradee Kerdprasop, Kittisak Data and Knowledge Engineering Research Unit School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand Department of Environmental Science Thammasat University Thailand

ISBN: (纸本)9789897583278

Forest fire is critical environmental issue that can cause severe damage. Fast detection and accurate estimation of forest fire burned area can help firefighters to effectively control damage. Thus, the purpose of this paper is to apply state of the art data modeling method to estimate the area of forest fire burning using support vector machine (SVM) algorithm as a tool for area approximation. The dataset is real forest fires data from the Montesinho natural park in the northeast region of Portugal. The original dataset comprises of 517 records with 13 attributes. We randomly sample the data 10 times to obtain 10 data-subsets for building estimation models using two kinds of SVM kernel: radial basis function and polynomial function. The obtained models are compared against other proposed techniques to assess performances based on the two measurement metrics: mean absolute error (MAE) and root mean square error (RMSE). The experimental results show that our SVM predictor using polynomial kernel function can precisely estimate forest fire damage area with the MAE and RMSE as low as 6.48 and 7.65, respectively. These errors are less than other techniques reported in the literature. Copyright © 2018 by SCITEPRESS – science and Technology Publications, Lda. All rights reserved.

关键词： Fires

来源：评论

学校读者我要写书评

暂无评论

Job Completion Time on a Virtualized Server with Software Rejuvenation

Job Completion Time on a Virtualized Server with Software Re...

引用

作者： Machida, Fumio Nicola, Victor F. Trivedi, Kishor S. Knowledge Discovery Research Laboratories NEC Corporation Japan Mathematics and Computer Science University of Twente Netherlands Department of Electrical and Computer Engineering Duke University United States

This article analyzes the completion time of a job running on a virtualized server subject to software aging and rejuvenation in a virtual machine monitor (VMM). A job running on the server may be interrupted by virtual machine (VM) failure, VMM failure or VMM rejuvenation. The job interruption is categorized as either preemptive-repeat (prt), in which case the interrupted job needs to restart from the beginning, or preemptive-resume (prs), in which case the job resumes execution from the point of interruption. Using a semi-Markov process (SMP) to model the server behavior, the steady-state server availability is computed and the theory developed in Kulkarni et al. [1987] is used to obtain the Laplace-Stieltjes transform (LST) of the job completion time. In the numerical experiments, we introduce four types of aging behavior of VMM. The effectiveness of VMM rejuvenation on job completion time is discussed in association with the type of interruption it causes and the VMM aging type. With our parameter settings, VMM rejuvenation with prs job interruption improves the performance of job execution regardless of the aging type, with performance degradation is taken into account. © 2014 ACM 1550-4832/2014/01-ART10 $15.00.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：