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

2009 IEEE International Conference on Internet Multimedia Services Architecture and Applications, IMSAA 2009

作者： Elsholz, Jan-Patrick Schmidt, Holger Schober, Sven Hauck, Franz J. Kassler, Andreas Institute of Distributed Systems Ulm University Germany Computer Science Department Karlstads Universitet Sweden

ISBN: (纸本)9781424447923

The globalisation of our society leads to an increasing need for spontaneous communication. However, the development of such applications is a tedious and error-prone process. This results from the fact that in general only basic functionality is available in terms of protocol implementations and encoders/decoders. This leads to inflexible proprietary software systems implementing unavailable functionality on their own. In this work we introduce Instant-X, a novel component-based middleware platform for multimedia applications. Unlike related work, Instant-X provides a generic programming model with an API for essential tasks of multimedia applications with respect to signalling and data transmission. This API abstracts from concrete component implementations and thus allows replacing specific protocol implementations without changing the application code. Furthermore, Instant-X supports dynamic deployment, i.e., unavailable components can be automatically loaded at runtime. To show the feasibility of our approach we evaluated our Instant-X prototype regarding code complexity and performance. ©2009 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm

引用

Memetic Computing 2009年第2期1卷 101-123页

作者： Fischer, Thomas Bauer, Kerstin Merz, Peter Distributed Algorithms Group Department of Computer Science University of Kaiserslautern Kaiserslautern Germany Embedded Systems Group Department of Computer Science University of Kaiserslautern Kaiserslautern Germany

The Routing and Wavelength Assignment problem is a graph optimization problem which deals with optical networks, where communication requests in a network have to be fulfilled. In this paper, we present a multilevel distributed memetic algorithm (ML-DMA) for the static RWA which finds provable optimal solutions for most benchmark instances with known lower bounds and is capable of handling large instances. Components of our ML-DMA include iterated local search, recombination, multilevel scaling, and a gossip-based distribution algorithm. Results demonstrated that our ML-DMA is among the most sophisticated heuristic RWA algorithms published so far. © 2009 Springer-Verlag.

关键词： Iterated local search Memetic algorithms Multilevel approach Routing and wavelength assignment problem

来源：评论

学校读者我要写书评

暂无评论

Security by wireless: Why play fairer than the attacker 09

Security by wireless: Why play fairer than the attacker

引用

Asian Internet Engineeering Conference, AINTEC 2009

作者： Martinovic, Ivan Disco / Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern 67653 Kaiserslautern Germany

ISBN: (纸本)9781605586144

Security in wireless networks is a notorious problem, suffering from the following dilemma: On the one hand, wireless medium access puts the attacker into a much better position, on the other hand wireless devices most often have resource deficiencies (processing, memory, energy) which make conventional attack countermeasures based on cryptographic solutions impractical. Though, there have been many approaches towards lightweight security for wireless networks, this dilemma always persists, at least for the low-cost sector, say, for example, sensor networks or RFIDs. So far the overwhelming majority of wireless security approaches followed a conventional security paradigm which abstracts the physical communication as a logical channel. We depart from this paradigm, and try to leverage from the physical characteristics of wireless communications as much as possible, thus bringing us again in equality of arms with the attacker. This we coined the security by wireless principle. In the talk, several incarnations of the security by wireless principle are presented. These are taken from WLAN as well as wireless sensor network scenarios and show for different security goals that security by wireless designs can lead to interesting security solutions. Copyright 2009 ACM.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Abstract user interfaces for mobile processes

Abstract user interfaces for mobile processes

引用

16. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2009 - 16th Conference on Communication in distributed systems, KiVS 2009

作者： Zaplata, Sonja Vilenica, Ante Bade, Dirk Kunze, Christian P. Distributed Systems and Information Systems Computer Science Department University of Hamburg Vogt-Kölln-Str. 30 22527 Hamburg Germany

ISBN: (纸本)9783540926658

An important focus of recent business process management systems is on the distributed, self-contained and even disconnected execution of processes involving mobile devices. Such an execution context leads to the class of mobile processes which are able to migrate between mobile and stationary devices in order to share functionalities and resources provided by the entire (mobile) environment. However, both the description and the execution of tasks which involve interactions of mobile users still require the executing device and its context to be known in advance in order to come up with a suitable user interface. Since this seems not appropriate for such decentralized and highly dynamic mobile processes, this work focuses on the integration of manual tasks on the respective ad-hoc creation of user interfaces at runtime. As an important prerequisite for that, this paper first presents an abstract and modality-independent interaction model to support the development and execution of user-centric mobile processes. Furthermore, the paper describes a prototype implementation for a corresponding system infrastructure component based on a service-oriented execution module, and, finally, shows its integration into the DEMAC (distributed Environment for Mobility-Aware Computing) middleware.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

Arogyashree: A distributed file system for large scale internet-based telemedicine

Arogyashree: A distributed file system for large scale inter...

引用

1st International Workshop on Mobilizing Health Information to Support Healthcare-Related Knowledge Work, MobiHealthInf 2009 In Conjunction with BIOSTEC 2009

作者： Ponnavaikko, Kovendhan Janakiram, D. Distributed and Object Systems Lab Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

ISBN: (纸本)9789898111784

Today, a typical telemedicine system involves a small set of hospitals providing remote healthcare services to a small section of the society using nodal centers, mobile health units, etc. However, the benefits of a telemedicine system increase with scale. One of the key requirements of such a large scale system is to allow large numbers of patient medical records, in the form of electronic files, to be efficiently stored and accessed from widely distributed locations. In this paper, we address the need for a distributed file system to manage patient data in large scale telemedicine systems. We use the resources of unreliable Internet edge nodes distributed among hospitals, labs, etc., to provide reliable file system services to patients and doctors. Besides building an Internet-based system that scales with the number of nodes and files, we also attempt to optimize record access times for doctors to provide timely responses.

关键词： Hospitals

来源：评论

学校读者我要写书评

暂无评论

SemanticQA: Web-based ontology-driven question answering 09

SemanticQA: Web-based ontology-driven question answering

引用

24th Annual ACM Symposium on Applied Computing, SAC 2009

作者： Tartir, Samir McKnight, Bobby Arpinar, I. Budak Large-Scale Distributed Information Systems Lab. Department of Computer Science University of Georgia Athens GA 30602-7404 United States

ISBN: (纸本)9781605581668

The ability to ask specific question to the internet using natural language and receiving answers instead of documents is highly desired. Recent advancements in semantic web technologies make it possible to support such capability with more accuracy compared to existing non-semantic techniques. Using our expertise in ontology building and semantic search and discovery we designed an ontology-driven question answering system that extracts answers from web documents. This system processes natural language queries using a background ontology and finds possible answer(s) to the question from web documents. Copyright 2009 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A Property-based Approach for Characterizing Goals 09

A Property-based Approach for Characterizing Goals

引用

International Conference on Autonomous Agents and Multiagent systems

作者： Lars Braubach Alexander Pokahr Distributed Systems and Information Systems Computer Science Department University of Hamburg

ISBN: (纸本)9781615673346

Goals are an essential attitude of proactive agents described with mentalistic attitudes. Nonetheless, in the literature no well agreed-upon definition of the term goal has arisen so far. In this paper it is argued that a property-based view on goals can help understanding the nature of the goal concept. Therefore, the goal concept is discussed with respect to typical properties, which are associated with the representation and processing of goals. It is discussed, how the well-known PRS architecture and recent extensions deal with these characteristics. As a result, we argue that supporting also longterm goals, which may not (immediately or at all) lead to actions, would enrich the possibilities of the agent developer as also more strategic behavior is expressible.

关键词： Languages Agent Programming Goals BDI Language object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A distributed heuristic for decentralized workflow scheduling in global grids

A distributed heuristic for decentralized workflow schedulin...

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781424451494

Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid environment. However, in this paper, we present a distributed list heuristic for decentralized scheduling of workflow applications in global Grids. The simulation results show that the proposed scheduling approach is scalable with respect to increased workload on the system. © 2009 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global grids

Dependable workflow scheduling in global grids

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

ISBN: (纸本)9781424451494

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel applications on Utility Grids: Time and cost trade-off management

Scheduling parallel applications on Utility Grids: Time and ...

引用

32nd Australasian computer science Conference, ACSC 2009

作者： Garg, Saurabh Kumar Buyya, Rajkumar Siegel, H.J. Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne VIC 3010 Australia Electrical and Computer Engineering Department Colorado State University Fort Collins United States Computer Science Department Colorado State University Fort Collins United States

ISBN: (纸本)9781920682729

With the growth of Utility Grids and various Grid market infrastructures, the need for efficient and cost effective scheduling algorithms is also increasing rapidly, particularly in the area of meta-scheduling. In these environments,users not only may have conflicting requirements with other users, but also they have to manage the trade-off between time and cost such that their applications can be executed most economically in the minimum time. Thus, choosing of the best Grid resources becomes a challenge in such a competitive market. This paper presents two novel heuristics for scheduling parallel applications on Utility Grids that manage and optimize the trade-off between time and cost constraints. The performance of the heuristics is evaluated through extensive simulations of a real-world environment with real parallel workload models to demonstrate the practicality of our algorithms. We compare our scheduling algorithms against other common algorithms used by current meta-schedulers. The results shows that our algorithms outperform other algorithms by minimizing the time and cost of application execution on Utility Grids. Copyright © 2009, Australian computer Society, Inc.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：