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

2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012

作者： Bazzi, Rida A. Topp, Bryan Neamtiu, Iulian School of Comp. Inf. and Dec. Sys. Engineering Arizona State University Tempe AZ 85287 United States Department of Computer Science and Engineering University of California Riverside Riverside CA 92521 United States

ISBN: (纸本)9781467317641

We consider the overhead incurred by programs that can be updated dynamically and argue that, in general, and regardless of the mechanism used, the program must incur an overhead during normal execution. We argue that the overhead during normal execution of the updateable program need not be as high as the overhead for the updated program. In light of the fundamental limitations and the differences in the overhead that must be incurred by the updateable and updated programs, we propose a new mechanism for dynamic software update based on a new shifting gears approach. The mechanism attempts to incur just the required overhead depending on the stage of update the application is in. Before an update the execution incurs low overhead and when an update occurs the execution incurs higher overhead which reverts to low overhead as the execution progresses. We evaluate the mechanism by modifying an application by hand. Preliminary performance numbers show that the mechanism performs better than existing mechanisms for dynamic software update. © 2012 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Trustworthy Web Service Selection Using Probabilistic Models

Trustworthy Web Service Selection Using Probabilistic Models

引用

IEEE International Conference on Web Services (ICWS)

作者： Mohamad Mehdi Nizar Bouguila Jamal Bentahar Engineering and Computer Science Concordia University Montreal Canada Concordia Inst. for Inf. Syst. Eng. Montreal QC Canada

Software architectures of large-scale systems are perceptibly shifting towards employing open and distributed computing. Service Oriented Computing (SOC) is a typical example of such environment in which the quality of interactions amongst software agents is a critical concern. Agent-based web services in open and distributed architectures need to interact with each other to achieve their goals and fulfill complex user requests. Two common tasks are inf.uenced by the quality of interactions among web services: the selection and composition. Thus, to ensure the maximum gain in both tasks, it is essential for each agent-based web service to maintain a model of its environment. This model then provides a means for a web service to predict the quality of future interactions with its peers. In this paper, we formulate this model as a machine learning problem which we analyze by modeling the trustworthiness of web services using probabilistic models. We propose two approaches for trust learning of single and composed services; Bayesian Networks and Mixture of Multinomial Dirichlet Distributions (MMDD). The effectiveness of our approaches is empirically assessed using a simulation study. Our results show that representing the quality of a web service by Multinomial Dirichlet Distribution (MDD) provides high flexibility and accuracy in modeling trust. They also show that using our approaches to estimate trust enhances web services selection and composition.

关键词： Web services Computational modeling Bayesian methods Vectors Measurement Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

A comparable study employing weka clustering/classification algorithms for web page classification

A comparable study employing weka clustering/classification ...

引用

15th Panhellenic Conference on inf.rmatics, PCI 2011

作者： Charalampopoulos, Ioannis Anagnostopoulos, Ioannis Dpt of Inf. and Comm. Systems Engineering University of Aegean Karlovassi Samos island Greece Dpt of Computer Science and Biomedical Informatics University of Central Greece Lamia Greece

ISBN: (纸本)9780769543895

Documents and web pages share many similarities. Thus classification methods used in documents can be applied to advanced web content, with or even without modifications. Algorithms for document and web classification are presented as an introduction. One out of many tools that can be used in method evaluation, application and modification is WEKA (Waikato Environment for Knowledge Analysis). Testing results and conclusions strengthen the principles and bases of classification, while demonstrating the need for a new interlayer in the evaluation of classification methods. © 2011 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Building the Knowledge Base through Bayesian Network for Cognitive Wireless Networks

Building the Knowledge Base through Bayesian Network for Cog...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Niandong Du Yuebin Bai Lianhe Luo Wei Wu Jianli Guo School of Computer Science and Engineering Beihang University Beijing China Sci. & Technol. on Inf. Transm. & Dissemination in Commun. Networks Lab. Shijiazhuang China

Tactical communication networking faces complexity, heterogeneity, and reliability requirements. The emerging research area of cognitive networks offers a potential for dealing with these problems. A key feature of cognitive networks is the knowledge base, which is produced during the process of learning and responsible for the decision making. We propose a cognitive network model integrated with the knowledge base, which is a primary part of cognitive networks. And then we focus on the construction of the knowledge base and the expression form of the knowledge in the model. In this paper, we use the Bayesian Network (BN) to construct the knowledge base, which is a unique tool for creating a representation of the dependence relationships among network protocol parameters. The data structure of the dependence relationships of the BN is translated into the knowledge which is expressed by the probability. In the simulation experiments, we create the BN through the sampling data to construct the knowledge base using the mathematical tool MATLAB and prove the efficiency of our cognitive network model for optimizing network performance in the OPENT simulation platform.

关键词： Knowledge based systems Bayesian methods Protocols Knowledge engineering Decision making Delay Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A Novel Hash-based RFID Mutual Authentication Protocol

A Novel Hash-based RFID Mutual Authentication Protocol

引用

International Conference on Computational Intelligence and Security

作者： Li Huixian Yin Ping Wang Xuan Pang Liaojun School of Computer Science and Engineering Northwestern Polytechnical University Xi'an Shanxi China School of Computer Science and Engineering Northwestern Polytechnical University Xi'an Shaanxi China Minist. of Educ. Key Lab. of Comput. Networks & Inf. Security Xi'an China

RFID is considered as a significant technology which supplies amounts of change in chain management. The most important problem with the RFID system is that the attacker can access the tag's inf.rmation, which leads to the security and privacy problems. Aimed at these problems, a secure hash-based mutual authentication protocol is proposed by utilizing the hash function, the PRNG (pseudo-random number generator) and the secret key. In the proposal, the tag conceals the ID with a random number, the hash function and the secret key. A hash value is transmitted as a substitute for the ID, which realizes the anonymous transmission of the inf.rmation. The reader and the tag authenticate each other, which eliminates intended or meaningless interferences from the attacker. The computational complexity of the proposed protocol is the same with several hash-based protocols, provided adequate security level and efficiency for practical applications.

关键词： Protocols Databases Authentication Radiofrequency identification Synchronization Resists

来源：评论

学校读者我要写书评

暂无评论

A self-stabilising algorithm for 3-edge-connectivity

引用

International Journal of High Performance Computing and Networking 2011年第1期7卷 40-52页

作者： Saifullah, Abusayeed M. Tsin, Yung H. Computer and Inf. Science and Engineering University of Florida E301 CSE Building P.O. Box 116120 Gainesville FL 32611 United States Computer Science and Engineering Department Washington University Campus Box 1045 1 Brookings Drive St Louis MO 63130 United States School of Computer Science University of Windsor 401 Sunset Avenue Windsor ON N9C 3K7 Canada

Self-stabilisation is a theoretical framework for fault-tolerance without external assistance. Adoption of self-stabilisation in distributed systems has received considerable research interest over the last decade. In this paper, we propose a self-stabilising algorithm for 3-edge-connectivity of an asynchronous distributed model of computation. A self-stabilising depth-first search algorithm is run concurrently to build a depth-first search spanning tree of the system. Once such a tree is constructed, all the 3-edge-connected components of the system can be detected in O(h) rounds, where h is the height of the depth-first search tree. The result of computation is kept in a distributed fashion in the sense that, upon stabilisation of the algorithm, each processor knows all other processors that are 3-edge-connected to it. The space complexity of our algorithm is O(n2 log Δ) bits per processor, where Δ is an upper bound on the degree of a processor. Copyright © 2011 Inderscience Enterprises Ltd.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Research and exploration on network public sentiment monitoring for financial securities based on ontology

Research and exploration on network public sentiment monitor...

引用

2010 International Conference on computer Application and System Modeling, ICCASM 2010

作者： Zhu, Jiang Wang, Shi-Min Dept. of Computer Science and Inf. Engineering Beijing Technology and Business University BTBU Beijing 100048 China

ISBN: (纸本)9781424472369

According to the application research in the inf.rmation system and the rules of construction on domain ontology, this paper proposed the conception of adding the financial domain ontology to the existing public sentiment monitoring system for financial securities and built the system architecture based on ontology to resolve the problems such as the integration of heterogeneous data, domain inf.rmation sharing, the communication among netizens by using different terminology, the intelligence of providing public sentiment and the phenomenon of noise, which laid the foundation of realizing the artificial intelligence technology. With the help of the existing system, the paper focused on introducing the construction and formation of domain ontology and describing the integration between domain ontology and system, based on which a semantic system would be formed and the final result would be predicted. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Using interactive GA for requirements prioritization

Using interactive GA for requirements prioritization

引用

2nd International Symposium on Search Based Software engineering, SSBSE 2010

作者： Tonella, Paolo Susi, Angelo Palma, Francis Fondazione Bruno Kessler Software Engineering Research Unit Trento Italy University of Trento Department of Inf. Eng. and Computer Science Trento Italy

ISBN: (纸本)9780769541952

The order in which requirements are implemented in a system affects the value delivered to the final users in the successive releases of the system. Requirements prioritization aims at ranking the requirements so as to trade off user priorities and implementation constraints, such as technical dependencies among requirements and necessarily limited resources allocated to the project. Requirement analysts possess relevant knowledge about the relative importance of requirements. We use an Interactive Genetic Algorithm to produce a requirement ordering which complies with the existing priorities, satisfies the technical constraints and takes into account the relative preferences elicited from the user. On a real case study, we show that this approach improves non interactive optimization, ignoring the elicited preferences, and that it can handle a number of requirements which is otherwise problematic for state of the art techniques. © 2010 IEEE.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Combustible gases and early fire detection: An autonomous system for wireless sensor networks 10

Combustible gases and early fire detection: An autonomous sy...

引用

1st International Conference on Energy-Efficient Computing and Networking, e-Energy 2010

作者： Somov, A. Spirjakin, D. Ivanov, M. Khromushin, I. Passerone, R. Baranov, A. Savkin, A. Dept. of Inf. Engineering and Computer Science University of Trento Italy Dept. of High Tech. Radio-Electronics Moscow State Aviation Technological University Russia

ISBN: (纸本)9781450300421

Fires or toxic gas leakages may have grave consequences like significant pecuniary loss or even lead to human victims. In this paper we present an autonomous wireless sensor system for early fire and gas leak detection. The system consists of two modules: a gas sensor module and a power management module. The operation of the gas sensor module is based on the pyrolysis product detection which makes it possible to detect fire before inf.ammation. In addition, the on board gas sensor can identify the type of leaking gas. A generic energy scavenging module, able to handle both alternating current and direct current based ambient energy sources, provides the power supply for the gas sensor module. The harvested energy is stored in two energy buffers of different kind, and is delivered to the sensor node in accordance to an efficient energy supply switching algorithm. At the end of the paper we demonstrate the experimental results on gas detection, energy consumption evaluation, and show how to ensure the system autonomous operation. © 2010 ACM.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

An RST-tolerant shape descriptor for object detection

An RST-tolerant shape descriptor for object detection

引用

International Conference on Pattern Recognition

作者： Su, Chih-Wen Liao, Hong-Yuan Mark Liang, Yu-Ming Tyan, Hsiao-Rong Institute of Information Science Academia Sinica Taiwan Institutes of Computer Science and Engineering National Chiao Tung University Taiwan Department of Computer Science and Information Engineering Aletheia University Dept. Inf. and Comput. Eng. Chung Yuan Christian University Taiwan

ISBN: (纸本)9780769541099

In this paper, we propose a new object detection method that does not need a learning mechanism. Given a hand-drawn model as a query, we can detect and locate objects that are similar to the query model in cluttered images. To ensure the invariance with respect to rotation, scaling, and translation (RST), high curvature points (HCPs) on edges are detected first .Each pair of HCPs is then used to determine a circular region and all edge pixels covered by the circular region are transformed into a polar histogram. Finally, we use these local descriptors to detect and locate similar objects within any images. The experiment results show that the proposed method outperforms the existing state-of-the-art work. © 2010 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：