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

EMS 2008, European Modelling Symposium, 2nd UKSim European Symposium on computer Modelling and Simulation

作者： Chakraborty, Jayasree Konar, Amit Nagar, Atulya Tawfik, Hissam Artificial Intelligence Lab. ETCE Dept. Jadavpur University Kolkata 700032 India Intelligence and Distributed Systems Lab. Deanery of Business and Computer Sciences Liverpool Hope University Liverpool L169JD United Kingdom

ISBN: (纸本)9780769533254

The paper provides a new formulation of the wellknown box-pushing problem by robots as a multiobjective optimization problem, and presents Paretooptimal solutions to the problem. The proposed method allows both turning and translation of the box, while shifting it to a desired goal position. Local planning scheme is employed here to determine the magnitude of the forces applied by two mobile robots at specific locations on the box to align and translate it in each distinct step of motion of the box, so as to minimize the consumption of both time and energy. This is realized using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed scheme, to the best of the authors' knowledge, is a first successful communication-free, centralized co-operation between two robots applied in box-shifting, satisfying multiple objectives simultaneously using evolutionary algorithm. © 2008 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Loss temporal dependency characteristic inference in wireless sensor network

引用

Journal of Computational Information systems 2008年第5期4卷 2303-2308页

作者： Li, Yongjun Ji, Wenli Dai, Yafei Computer Networks and Distributed Systems Laboratory Peking University Beijing 100871 China School of Computer Science Northwestern Polytechnical University Xi'an 710072 China School of Communication Engineering Xi'an University of Science and Technology Xi'an 710075 China State Key Lab. for Adv. Opt. Commun Syst and Networks Beijing 1000871 China

The internal link loss characteristic inference has become an increasingly important issue for operating and evaluating a wireless sensor network. Due to the inherent stringent bandwidth and energy constraints, it is usually impractical to directly collect link loss statistical data from each node in sensor network. Here we consider the problem of inferring the internal link loss characteristics from end-to-end measurement. We use the Gilbert error model to model the sensor link losses, formulate the problem of link loss characteristics estimation as a Bayesian inference problem, and propose a Markov Chain Monte Carlo (MCMC) algorithm to solve it. The simulation shows that the link loss performance parameters can be inferred accurately, and the proposed algorithm scales well according to the sensor network size. © 2008 Binary Information Press.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...

Delay Bounds under Arbitrary Multiplexing: When Network Calc...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： J. B. Schmitt F. A. Zdarsky M. Fidler Distributed Computer Systems Lab (DISCO) University of Kaiserslautern Germany Multimedia Communications Lab (KOM) Darmstadt University of Technology Germany

Network calculus has proven as a valuable and versatile methodology for worst-case analysis of communication networks. One issue in which it is still lacking is the treatment of aggregate multiplexing, in particular if the FIFO property cannot be assumed when flows are merged. In this paper, we address the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing. Somewhat surprisingly, we find that direct application of network calculus results in loose bounds even in seemingly simple scenarios. The reasons for this "failure" of network calculus are discussed in detail and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented. This method is based on the solution of an optimization problem. For the special case of sink-tree networks this optimization problem is solved explicitly, thus arriving at a closed-form expression for the delay bound. Numerical experiments illustrate that in sink-tree networks the improvement over bounds based on direct application of network calculus can be considerable.

关键词： Calculus Aggregates Feedforward systems Queueing analysis Network topology Network servers Delay Telecommunication traffic Traffic control Quality of service

来源：评论

学校读者我要写书评

暂无评论

Loss cumulate generating function inference and application in wireless sensor network

引用

Journal of Computational Information systems 2008年第4期4卷 1399-1407页

The internal link loss characteristic inference has become an increasingly important issue for operating and evaluating a wireless sensor network. Due to the inherent stringent bandwidth and energy constraints of sensors, it is usually impractical to directly monitor each node or link in wireless sensor network. We consider the problem of inferring the internal link loss characteristics from passive end-to-end measurement in this paper. Specifically, the link loss performance inference during the data aggregation is considered. Under the assumptions that the link losses are mutually independent, we elab.rate a bias corrected link loss Cumulant Generating Function (CGF) algorithm. The simulation results show that the internal link loss CGF can be inferred accurately comparable to the sampled internal link loss CGF. At the end of this paper, we apply the result of internal link loss CGF inference to identify the lossy link in sensor network.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

The disco Network Calculator

The DISCO Network Calculator

引用

14th GI/ITG Conference - Measurement, Modelling and Evalutation of computer and Communication systems

作者： Nicos Gollan Frank A. Zdarsky Ivan Martinovic Jens B. Schmitt Distributed Computer Systems Lab (DISCO) Technische Universität Kaiserslautern p.o. box 3049 67653 Germany

Network calculus was developed for use in IP and ATM networks. It aims to be a system theory for deterministic queuing, allowing to derive deterministic guarantees on throughput and delay, as well as find bounds on buffer sizes and thereby allow for loss-free transfer. Traditional queuing theory analyzes the average or equilibrium behavior of a network, whereas network calculus shows the worst observable case. It describes network traffic and services in terms of curves, wide-sense increasing functions that represent accumulated data. By using a min-plus algebra, replacing the addition and multiplication in (R,+, ·) by minimum and addition (R,min,+), it avoids non-linearities in the required operations on those curves. Similar to traditional system theory, network calculus provides a concatenation result, thereby making it possible to reduce tandems of systems (respective services) to a single equivalent service. An extension of the network calculus, the sensor network calculus, provides results for handling cross-traffic in networks with tree topologies that are typical for sensor networks. More recent results handle effects like data scaling, which is an effect in networks that not only forward data, but also mutate it along the path. This may be the result of compression, aggregation, or other processing.

关键词： Calculus Calculators Java Wireless sensor networks Queueing analysis Analytical models Delay

来源：评论

学校读者我要写书评

暂无评论

Comprehensive review on blog mining under a cross-disciplinary framework

引用

Journal of Computational Information systems 2007年第4期3卷 1725-1730页

作者： Gao, Shengliang Yao, Conglei Lab. of Computer Networks and Distributed Systems Peking University Beijing 100871 China

Nowadays, blog has been playing a more and more important role in human life as the internet evolves dramatically. Academia has seen an research burst on blog since 2002, not only in the area of computer science like IR and web mining, but also in the area of social sciences. We present a blog-centered framework here to abstract and generalize current researches on blog mining, with the intention of providing a clear image on blog-focused research area.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Modeling semantic web services using UML 2

Modeling semantic web services using UML 2

引用

3rd International Workshop on Model-Driven Enterprise Information systems - MDEIS 2007;In Conjunction with ICEIS 2007

作者： Lautenbacher, Florian Bauer, Bemhard Programming Distributed Systems Lab. Institute of Computer Science University of Augsburg Germany

ISBN: (纸本)9789898111005

The development of web services and especially semantic web services is a tremendous task for people who are not familiar with all language constructs. Especially with the growing mass of several semantic web service approaches a language-independent service development is needed. This gap can be filled by using model-driven software development. Therefore, in this paper we introduce a meta-model for semantic web services and show the benefits of automatic code generation on the basis of a small example.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

An analytical flow control scheme for real-time traffic in wireless mesh network: From theoretic model to practical mechanism 07

An analytical flow control scheme for real-time traffic in w...

引用

4th International Conference on Mobile Technology, Applications and systems, Mobility 2007, Incorporating the 1st International Symposium on computer Human Interaction in Mobile Technology, IS-CHI 2007

作者： Liu, Yongqiang Zhao, Tong Liu, Zhongyi Yan, Wei Li, Xiaoming Computer Networks and Distributed Systems Lab. School of EECS Peking University 100871 China

ISBN: (纸本)9781595938190

The link interference and multi-hop characters make Wireless Mesh Network (WMN) performance can not be tuned well by local information. We propose an analytical flow control scheme (AFCS) based on the optimal bandwidth allocation model that is specifically designed for the unique characteristics of WMN. The original contribution incorporated in a flow contention model of WMN based on maximal link interference region. With the contention constraint, the optimality of bandwidth allocation can be achieved by maximizing the aggregated utility across all flows. We then deduce a practical equation for adjusting sending rate from the bandwidth allocation model. Based on the simplified analytical equation and the congestion notification message mechanism, we propose an equation-based flow control framework for real-time traffic in WMN. Simulation results have shown the AFCS can improve the capacity of the WMN by 40% and alleviate the unfairness and delay jitter greatly. The fast response, fairness and steadiness characters of the AFCS are helpful for rigorous real-time traffic and dynamic wireless network. Copyright 2007 ACM.

关键词： Flow control

来源：评论

学校读者我要写书评

暂无评论

From data privacy to location privacy: Models and algorithms 07

From data privacy to location privacy: Models and algorithms

引用

33rd International Conference on Very Large Data Bases, VLDB 2007

作者： Liu, Ling Distributed Data Intensive Systems Lab. School of Computer Science Georgia Institute of Technology United States

ISBN: (纸本)9781595936493

This tutorial presents the definition, the models and the techniques of location privacy from the data privacy perspective. By reviewing and revising the state of art research in data privacy area, the presenter describes the essential concepts, the alternative models, and the suite of techniques for providing location privacy in mobile and ubiquitous data management systems. The tutorial consists of two main components. First, we will introduce location privacy threats and give an overview of the state of art research in data privacy and analyze the applicability of the existing data privacy techniques to location privacy problems. Second, we will present the various location privacy models and techniques effective in either the privacy policy based framework or the location anonymization based framework. The discussion will address a number of important issues in both data privacy and location privacy research, including the location utility and location privacy trade-offs, the need for a careful combination of policy-based location privacy mechanisms and location anonymization based privacy schemes, as well as the set of safeguards for secure transmission, use and storage of location information, reducing the risks of unauthorized disclosure of location information. The tutorial is designed to be self-contained, and gives the essential background for anyone interested in learning about the concept and models of location privacy, and the principles and techniques for design and development of a secure and customizable architecture for privacy-preserving mobile data management in mobile and pervasive information systems. This tutorial is accessible to data management administrators, mobile location based service developers, and graduate students and researchers who are interested in data management in mobile information syhhhstems, pervasive computing, and data privacy. Copyright 2007 VLDB Endowment, ACM.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

e-petri net model for programming integrated network of wireless sensor networks and grids

e-petri net model for programming integrated network of wire...

引用

CIT 2007: 7th IEEE International Conference on computer and Information Technology

作者： Adimallikarjuna Reddy, V. Kumar, A. V. U. Phani Janakiram, D. Distributed and Object Systems Lab. Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 India

ISBN: (纸本)0769529836

Applications like weather forecasting and prediction, health-care monitoring, habitat monitoring, tsunami-warning systems, demand integration of Wireless Sensor Networks (WSNs) with grids. The issues that need to be addressed are, providing suitable programming platform, seamless networking, data management, service/resource discovery etc. Objective of this work is to provide a programming model for this integrated network. We propose a programming model built using e-Petri Net, an extension to the classical Petri Net. We define the meta model for the e-Petri Net using Generic Modeling Environment (GME) tool. This meta-model gives the flexibility in understanding and analysing the application before hand. © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：