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

International Conference on Embedded and Ubiquitous Computing, EUC 2004

作者： Waluyo, Agustinus Borgy Srinivasan, Bala Taniar, David School of Computer Science and Software Engineering Monash University Australia School of Business Systems Monash University Australia

ISBN: (纸本)354022906X

Broadcast strategy is known as an effective mechanism to disseminate database information to mobile clients. However, with a very large database items, the access time of mobile client increases accordingly due to high waiting time to find their data of interest. In this paper, we propose analytical models for both query access times over broadcast channel and on-demand channel. We examine the analytical model to find optimum number of broadcast items in a channel while utilising query access time over on-demand channel as a threshold point. The optimum number indicates a point to split the broadcast cycle and allocate the data items in the new channel. Several factors are taken into account, which includes request arrival rate, service rate, number of request, size of data item, size of request, number of data item to retrieve, and bandwidth. A simulation model is developed to find out the performance of the analytical model, and it is found the model is close to accurate. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

Towards an ontology for agent mobility

Towards an ontology for agent mobility

引用

23rd International Conference on Conceptual Modeling, ER 2004

作者： Price, Rosanne Krishnaswamy, Shonali Loke, Seng W. Chhetri, Mohan B. School of Business Systems Monash University Australia School of Computer Science and Software Engineering Monash University Australia

ISBN: (纸本)3540237224

The benefits of agent mobility have been recognized for a variety of applications such as wireless ad hoc environments and network management. Mobile agent toolkits have been developed in response;however, they do not address the need for conceptual modeling techniques required for the analysis and design phases of mobile agent applications. On the other hand, conceptual level modeling techniques developed as part of Agent Oriented software engineering methodologies do not specifically address the requirement for modeling mobility. This paper represents a first step towards developing support for conceptual modeling of mobile agents, in terms of an ontology describing the abstract concepts and inter-relationships required to model agent mobility. The specific aim of this paper is to present an ontology that is widely applicable, not constrained by the peculiarities of any one mobile agent toolkit or application, and specified using an easily understood informal vocabulary. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Allocation of data items for multi channel data broadcasting in a mobile computing environment

Allocation of data items for multi channel data broadcasting...

引用

International Conference on Embedded and Ubiquitous Computing, EUC 2004

作者： Waluyo, Agustinus Borgy Srinivasan, Bala Taniar, David School of Computer Science and Software Engineering Monash University Australia School of Business Systems Monash University Australia

ISBN: (纸本)354022906X

Utilising broadcast mechanism for query processing in a mobile computing environment is very much desirable due to its scalability. Therefore, it is necessary to maintain the advantage of this mechanism by minimising query access time over a large number of broadcast items. In this paper, we propose a broadcast ordering scheme at the server side, which aims to minimize query access time of mobile clients. We concern with data broadcast over multiple wireless channels. Generally, this scheme considers single and multiple data items request. We develop a simulation model to analyze the performance of the proposed scheme. The proposed scheme provides a substantially lower access time as compared to the conventional method. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

A hierarchical extraction policy for content extraction signatures: Selectively handling verifiable digital content

引用

International Journal on Digital Libraries 2004年第3期4卷 208-222页

作者： Bull, Laurence McG. Squire, David Zheng, Yuliang School of Computer Science and Software Engineering Monash University Caulfield VIC 3145 900 Dandenong Road Australia Department of Software and Information Systems University of North Carolina at Charlotte Charlotte NC 28223 United States

Content extraction signatures (CES) enable the selective disclosure of verifiable content from signed documents. We have previously demonstrated a CES Extraction Policy for fragment grouping to allow the document signer to designate which subsets of the original document are valid subdocuments. Extending this ability, we introduce a new Hierarchical Grouping Extraction Policy that is more powerful, and for which the encoding is dramatically smaller, than the existing Grouping Extraction Policy. This new Extraction Policy maps naturally onto the hierarchically structured documents commonly found in digital libraries. After giving a motivating example involving digital libraries we then conjecture as to how to enrich their functionality through the use of CESs. We also show how to implement the new extraction policy using XML signatures with a custom transform along with an improved design for the XML signature structure in order to achieve CES functionality. © Springer-Verlag 2004.

关键词： Content extraction signatures Hierarchical extraction policy Privacy-enhancing signatures Selective content disclosure Xml signature custom transforms

来源：评论

学校读者我要写书评

暂无评论

Understanding the behavior and performance of non-blocking communications in MPI

引用

10th International European Conference on Parallel Processing, Euro-Par 2004

作者： Saif, Taher Parashar, Manish The Applied Software Systems Laboratory Department of Electrical and Computer Engineering Rutgers University PiscatawayNJ08854 United States

ISBN: (纸本)3540229248

The behavior and performance of MPI non-blocking message passing operations are sensitive to implementation specifics as they are heavily dependant on available system level buffers. In this paper we investigate the behavior of non-blocking communication primitives provided by popular MPI implementations and propose strategies for these primitives than can reduce processor synchronization overheads. We also demonstrate the improvements in the performance of a parallel Structured Adaptive Mesh Refinement (SAMR) application using these strategies. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Transformations for write-all-with-collision model

引用

7th International Conference on Principles of Distributed systems, OPODIS 2003

作者： Kulkarni, Sandeep S. Arumugam, Mahesh Umamaheswaran Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East LansingMI48824 United States

ISBN: (纸本)3540226672

In this paper, we consider a new atomicity model, write all with collision (WAC), and compare it with existing models considered in the literature. This model captures the computations in sensor networks. We show that it is possible to transform a program from WAC model into a program in read/write model, and vice versa. Further, we show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing. In other words, if a deterministic program cannot read then it is important that it can tell time. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Stabilization

来源：评论

学校读者我要写书评

暂无评论

software Landscapes: Visualizing the Structure of Large software systems

Software Landscapes: Visualizing the Structure of Large Soft...

引用

6th Joint Eurographics - IEEE TCVG Symposium on Visualization, VisSym 2004

作者： Balzer, Michael Noack, Andreas Deussen, Oliver Lewerentz, Claus Department of Computer and Information Science University of Konstanz Germany Software Systems Engineering Research Group Technical University Cottbus Germany

ISBN: (纸本)390567307X

Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and complex systems. This paper presents a three-dimensional visualization technique that represents the static structure of object-oriented programs using landscape-like distributions of three-dimensional objects on a two-dimensional plane. The familiar landscape metaphor facilitates intuitive navigation and comprehension. The visual complexity is reduced by adjusting the transparency of object surfaces to the distance of the viewpoint. An approach called Hierarchical Net is proposed for a clear representation of the relationships between the subsystems. © The Eurographics Association 2004.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Implementing hierarchical features in a graphically based formal modelling language

Implementing hierarchical features in a graphically based fo...

引用

Proceedings of the 28th Annual International computer software and Applications Conference, COMPSAC 2004

作者： Henderson, Peter Walters, Robert John Crouch, Stephen Declarative Systems and Software Engineering Group Department of Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom

Many developers who could benefit from building and analysing formal models of their systems are deterred from doing so by the process algebra style input languages of formal modelling languages which they find difficult to read and understand. This barrier to the adoption of formal modelling techniques can be significantly reduced if the process algebra is replaced with a graphical notation supported by a model generation tool. However, whilst having a diagrammatic base for the language appeals to the novice modeller, the diagrams can become cluttered for larger models. In this paper we address the issues of how to add hierarchical features to a graphical language without losing the fundamental benefits and appeal of a having the graphical interface to the language. We illustrate these ideas using an existing formal modelling language. © 2004 IEEE.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

A market-based scheduler for JXTA-based peer-to-peer computing system

A market-based scheduler for JXTA-based peer-to-peer computi...

引用

International Conference on Computational Science and its Applications, ICCSA 2004

作者： Ping, Tan Tien Sodhy, Gian Chand Yong, Chan Huah Haron, Fazilah Buyya, Rajkumar School of Computer Science Universiti Sains Malaysia Penang11800 Malaysia Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)3540220607

Peer-to-Peer (P2P) computing is said to be the next wave of computing after client-server and web-based computing. It provides an opportunity to harness a lot of idle peer-resources such as desktop computers across the Internet, for solving large-scale computing applications. Each peer is autonomous and it needs incentive for sustained contribution of its resources to P2P applications. In addition, a flexible and efficient job scheduling is needed to harvest the idle computing power as cheaply and economically as possible. This paper introduces an economic based job scheduler for mapping jobs to resources in P2P computing environment. The scheduler has been implemented with the Compute Power Market (CPM) system developed using Sun JXTA P2P technology. Our scheduler can be configured depending on users’ quality of service requirements such as the deadline and budget constraints. Our scheduler follows a hierarchy scheme. The design allows multiple consumers and multiple providers to schedule and run jobs. To allow wider support for a wide variety of applications, the system is designed to allow easy ‘plug in’ of user applications. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Predicate abstraction of ANSI-C programs using SAT

Predicate abstraction of ANSI-C programs using SAT

引用

作者： Clarke, Edmund Kroening, Daniel Sharygina, Natasha Yorav, Karen Computer Science Department Carnegie Mellon University Pittsburgh PA Computer Systems Institute Swiss Institute of Technology Zurich Switzerland Software Engineering Institute Carnegie Mellon University Pittsburgh PA IBM Haifa Israel

Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relations of ANSI-C programs. The SAT-based approach computes a more precise and safe abstraction compared to existing predicate abstraction techniques.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：