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

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Yeo, Chee Shin Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Vic. 3010 Australia

ISBN: (纸本)1424409101

Utility computing has been anticipated to be the next generation of computing usage. Users have the freedom to easily switch to any commercial computing service to complete jobs whenever the need arises and simply pay only on usage, without any investment costs. A commercial computing service however has certain objectives or goals that it aims to achieve. In this paper, we identify three essential objectives for a commercial computing service: (i) meet SLA, (ii) maintain reliability, and (iii) earn profit. This leads to the problem of whether a resource management policy implemented in the commercial computing service is able to meet the required objectives or not. So, we also develop two evaluation methods that are simple and intuitive: (i) separate and (ii) integrated risk analysis to analyze the effectiveness of resource management policies in achieving the required objectives. Evaluation results based on five policies successfully demonstrate the applicability of separate and integrated risk analysis to assess policies in terms of the required objectives. © 2007 IEEE.

关键词： Utility programs

来源：评论

学校读者我要写书评

暂无评论

Authentication in reprogramming of sensor networks for mote class adversaries

Authentication in reprogramming of sensor networks for mote ...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Limin, Wang Kulkarni, Sandeep S. Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI 48824 United States

ISBN: (纸本)1424409101

Reprogramming is an essential service for wireless sensor networks. Authenticating reprogramming process is important as sensors need to verify that the code image is truly from a trusted source. There are two ways to achieve authentication: public key based and symmetric key based. Although previous work has shown that public key authentication is feasible on sensor nodes if used sparingly, it is still quite expensive compared to symmetric key based approach. In this paper, we propose a symmetric key based protocol for authenticating reprogramming process. Our protocol is based on the secret instantiation algorithm from [5, 11], which requires only O(log n) keys to be maintained at each sensor. We integrate this algorithm with the existing reprogramming protocol. Through simulation, we show that it is able to authenticate reprogramming process at very low communication cost, and has very short delay. ©2007 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

Visualizing requirements in UML models

Visualizing requirements in UML models

引用

First International Workshop on Visualization in Requirements engineering, REV 2006, at the 14th IEEE Requirements engineering Conference, RE 2006

作者： Konrad, Sascha Goldsby, Heather Lopez, Karli Cheng, Betty H.C. Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI 48824 United States

ISBN: (纸本)0769527116

As the Unified Modeling Language (UML) and model-driven development (MDD) become increasingly common in industry, many developers are faced with the difficult task of understanding how an existing UML model realizes system requirements. Essentially, developers are required to understand the structure and behavior of UML models that they may have not created. Understanding these relationships is non-trivial, because the interactions in the model are not readily apparent. Commonly, the only means to elicit these relationships is visual inspection and guided simulation. This paper describes an alternative approach termed REVU (Requirements Visualization of UML), a process for visualizing functional requirements in terms of behavioral interactions in a UML model. We illustrate the use of this process with the visualization of scenarios for an adaptive light control system. © 2006 IEEE.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

A SLA-oriented management of containers for hosting stateful web services

A SLA-oriented management of containers for hosting stateful...

引用

3rd IEEE International Conference on e-science and Grid Computing

作者： Reich, Christoph Bubendorfer, Kris Banholzer, Matthias Buyya, Rajkumar Department of Computer Science Hochschule Furtwangen University Germany School of Mathematics Statistics and Computer Science Victoria University of Wellington New Zealand Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)9780769530642

Service-Oriented Architectures provide integration of interoperability for independent and loosely coupled services. Web services and the associated new standards such as WSRF are frequently used to realise such Service-Oriented Architectures. In such systems, autonomic principles of self-configuration, self-optimisation, self-healing and self-adapting are desirable to ease management and improve robustness. In this paper we focus on the extension of the self management and autonomic behaviour of a WSRF container connected by a structured P2P overlay network to monitor and rectify its QoS to satisfy its SLAs. The SLA plays an important role during two distinct phases in the life-cycle of a WSRF container Firstly during service deployment when services are assigned to containers in such a way as to minimise the threat of SLA violations, and secondly during maintenance when violations are detected and services are migrated to other containers to preserve QoS. In addition, as the architecture has been designed and built using standardised modem technologies and with high levels of transparency, conventional web services can be deployed with the addition of a SLA specification.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Prewavelets with finite decomposition and finite reconstruction

引用

Journal of Information and Computational science 2007年第1期4卷 35-41页

作者： Guan, Yujing Li, Ying Jiang, Zhengyi Institute of Mathematics Jilin University Changchun 130021 China State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China College of Computer Science and Technology Jilin University Changchun 130021 China Key Laboratory of Symbol Computation and Knowledge Engineering Changchun 130021 China

The necessary and sufficient condition for the existence of prewavelets with finite decomposition and finite reconstruction is presented. Especially when r = 1, we show that {φj(x-k) | 1 &le j &le r, k ∈ s} is shift-orthogonal if there exist prewavelets with finite decomposition and finite reconstruction, i.e., non-trivial prewavelets with finite decomposition and finite reconstruction does not exist. As an example, when r = 2 we construct a prewavelet with finite decomposition and finite reconstruction where the scale function is not shift-orthogonal, which demonstrate that there exist vector prewavelets with finite decomposition and finite reconstruction.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

A modal logic for beliefs and pro attitudes

A modal logic for beliefs and pro attitudes

引用

AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference

作者： Su, Kaile Sattar, Abdul Lin, Han Reynolds, Mark Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Department of Computer Science Sun Yat-Sen University Guangzhou China School of Computer Science and Software Engineering University of Western Australia Perth Australia

ISBN: (纸本)1577353234

Agents' pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural and satisfying formalization of these attitudes is a longstanding problem in the community of agent theory. Most of existing modal logic approaches are based on Kripke structures and have to face the so-called side-effect problem. This paper presents a new modal logic formalizing agents' pro attitudes, based on neighborhood models. There are three distinguishing features of this logic. Firstly, this logic naturally satisfies Bratman's requirements for agents' beliefs and pro attitudes, as well as some interesting properties that have not been discussed before. Secondly, we give a sound and complete axiom system for characterizing all the valid properties of beliefs and pro attitudes. We introduce for the first time the notion of linear neighborhood frame for obtaining the semantic model, and this brings a new member to the family of non-normal modal logics. Finally, we argue that the present logic satisfies an important requirement proposed from the viewpoint of computation, that is, computational grounding, which means that properties in this logic can be given an interpretation in terms of some concrete computational model. Indeed, the presented neighborhood frame can be naturally derived from probabilistic programming with utilities. Copyright © 2007, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

An improved Bayesian network structure learning algorithm and its application in an intelligent B2C portal

引用

Web Intelligence and Agent systems 2007年第2期5卷 127-138页

作者： Ji, Junzhong Liu, Chunnian Yan, Jing Zhong, Ning College of Computer Science and Technology Beijing University of Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing 100022 China Department of Information Engineering Maebashi Institute of Technology 460-1 Kamisadori-Cho Maebashi-City 371-0816 Japan

Web Intelligence (WI) is a new and active research field in current AI and IT. intelligent B2C Portals are an important research topic in WI. In this paper, we first investigate and analyze the architecture of a B2C portal for personalized recommendation from the viewpoint of conceptual levels of WI. Aiming at knowledge-level data mining in a B2C portal, we present a new improved learning algorithm of Bayesian Networks, which consists of two major contributions, namely, reducing Conditional Independence (CI) test costs by few lower order CI tests and accelerating search process by means of sort order for candidate parent nodes. Experimental results on benchmark ALARM data sets show that the improved algorithm has high accuracy, and is more efficient in the time performance than other algorithms. Finally, we apply this algorithm to learning Customer Shopping Model (CSM) in an intelligent recommendation system. By a number of experiments on real world data, we find that the recommendation method based on the learned CSM outperforms some traditional ones in rates of coverage and precision. © 2007 - IOS Press and the authors. All rights reserved.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Recent advances in networked control systems

Recent advances in networked control systems

引用

International Conference on Control, Automation and systems, ICCAS 2007

作者： Sun, Zengqi Li, Hongbo Wang, Yan Department of Computer Science and Technology State Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing 100084 China School of Automation Science and Electrical Engineering Beijing University of Aeronautics and Astronautics Beijing 100083 China

ISBN: (纸本)8995003871

This paper presents a comprehensive overview of the current state of research in the area of Networked control systems (NCSs) first. Then two modeling and control methods are introduced for NCSs in details. The first one is a stochastic control method, which investigates the H∞ control problem for NCSs with random network-induced delay. The second one is a switch control method, which focuses on solving the stabilization problem for NCSs in discrete-time domain, where both network-induced delay and packet dropout are taken into account. Illustrative examples are given to demonstrate the effectiveness of the proposed approaches. Finally, this paper concludes with the discussion of possible future development of NCSs from a control perspective.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Importance sampling for general hybrid Bayesian networks

Importance sampling for general hybrid Bayesian networks

引用

11th International Conference on Artificial Intelligence and Statistics, AISTATS 2007

作者： Yuan, Changhe Druzdzel, Marek J. Department of Computer Science and Engineering Mississippi State University Mississippi State MS 39762 United States Decision Systems Laboratory School of Information Sciences and Intelligent Systems Program University of Pittsburgh Pittsburgh PA 15260 United States

Some real problems are more naturally modeled by hybrid Bayesian networks that consist of mixtures of continuous and discrete variables with their interactions described by equations and continuous probability distributions. However, inference in such general hybrid models is hard. Therefore, existing approaches either only deal with special instances, such as Conditional Linear Gaussians (CLGs), or approximate a general model with a restricted version and then perform inference on the simpler model. However, results thus obtained highly depend on the quality of the approximations. This paper describes an importance sampling-based algorithm that directly deals with hybrid Bayesian networks constructed in the most general settings and guarantees to converge to the correct answers given enough time.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

A geometric optimization approach to detecting and intercepting dynamic targets

A geometric optimization approach to detecting and intercept...

引用

2007 American Control Conference, ACC

作者： Ferrari, Silvia Cai, Chenghui Fierro, Rafael Perteet, Brent Laboratory for Intelligent Systems and Controls Department of Mechanical Engineering and Materials Science Duke University Durham NC 27708-0300 United States MARHES Lab. School of Electrical and Computer Engineering Oklahoma State University Stillwater OK 74078-5032 United States

ISBN: (纸本)1424409888

A methodology is developed to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane. The sensing-pursuit problem considered in this paper is analogous to the Marco Polo game, in which the pursuer must capture multiple mobile targets that are sensed intermittently, and with very limited information. In this paper, the mobile sensor network consists of a set of robotic sensors that must track and capture mobile targets based on the information obtained through cooperative detections. Since the sensors are installed on robotic platforms and have limited rangce, the geometry of the platforms and of the sensors field-of-view play a key role in obstacle avoidance and target detection. Thus, a new cell decomposition approach is presented to formulate the probability of detection and the cost of operating the robots based on the geometric properties of the network. Numerical simulations verify the validity and flexibility of our methodology. ©2007 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：