Mobile ad hoc networks (MANETs) are wireless networks formed spontaneously. Communication in such networks typically involves multi-hop relays, and is subjected to dynamic topology changes and frequent link failures. ...
详细信息
ISBN:
(纸本)3540261818
Mobile ad hoc networks (MANETs) are wireless networks formed spontaneously. Communication in such networks typically involves multi-hop relays, and is subjected to dynamic topology changes and frequent link failures. this complex scenario demands robust routing protocol standards that ensure correct and timely delivery of messages. Recently, formal verification has been successful in detecting ambiguities in protocol standards. We consider the Ad hoc On Demand Distance Vector (AODV) protocol, a reactive protocol currently undergoing standardisation at the IETF (RFC3561). AODV performs route discovery whenever a route to the destination is needed, and retains routing information for a period of time specified by the standard. We apply the real-time model checker UPPAAL to consider the effect of the protocol parameters on the timing behaviour of AODV, thus complementing the earlier untimed verification effort. Our study of the recent versions of the standard (RFC3561-bis-01) has highlighted a dependency of the lifetime of routes on network size, which can be alleviated by allowing the route timeouts to adapt to network growth.
Refinement is a key concept in the B-Method. While refinement is at the heart of the B Method, so far no automatic refinement checker has been developed for it. In this paper we present a refinement checking algorithm...
详细信息
ISBN:
(纸本)3540297979
Refinement is a key concept in the B-Method. While refinement is at the heart of the B Method, so far no automatic refinement checker has been developed for it. In this paper we present a refinement checking algorithm and implementation for B. It is based on using an operational semantics of 13, obtained in practice by the PR,013 animator. the refinement checker has been integrated into PROB toolset and we present various case studies and empirical results in the paper, showing the algorithm to be Surprisingly effective. the algorithm checks that a refinement preserves the trace properties of a specification. We also compare our tool against the refinement checker FDR for CSP and discuss an extension for singleton failure refinement.
Using a variety of computational modeling and simulation methods, we examine the production and long-time evolution of damage created in irradiated MgO. We find that the damage produced in low energy (order 1 keV) col...
详细信息
Using a variety of computational modeling and simulation methods, we examine the production and long-time evolution of damage created in irradiated MgO. We find that the damage produced in low energy (order 1 keV) collision cascades typically consists of point defects and small defect clusters. Over long times, interstitials annihilate with vacancies and aggregate with other interstitials, forming larger clusters that exhibit surprising behavior. For example, a sixatom interstitial cluster is found to have extremely high mobility. the implications of highly-mobile large clusters are explored via a rate theory model and comparison to other materials. We conclude that successful modeling of radiation damage evolution in MgO requires explicit treatment of large interstitial clusters. (C) 2004 Elsevier B.V. All rights reserved.
the so-called light logics [1,2,3] have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is...
详细信息
Artificial Neural Networks are bioinspired mathematical models that have been widely used to solve many complex problems. However, the training of a Neural Network is a difficult task since the traditional training al...
详细信息
ISBN:
(纸本)9728865198
Artificial Neural Networks are bioinspired mathematical models that have been widely used to solve many complex problems. However, the training of a Neural Network is a difficult task since the traditional training algorithms may get trapped into local solutions easily. this problem is greater in Recurrent Neural Networks, where the traditional training algorithms sometimes provide unsuitable solutions. Some evolutionary techniques have also been used to improve the training stage, and to overcome such local solutions, but they have the disadvantage that the time taken to train the network is high. the objective of this work is to show that the use of some non-linear programming techniques is a good choice to train a Neural Network, since they may provide suitable solutions quickly. In the experimental section, we apply the models proposed to train an Elman Recurrent Neural Network in real-life Time Series Prediction problems.
this paper introduces an agent-based framework and a programming environment for the software on-demand (SOD) service. Streaming is a technology that enables either real-time or on-demand distribution of audio, video,...
详细信息
this paper introduces an agent-based framework and a programming environment for the software on-demand (SOD) service. Streaming is a technology that enables either real-time or on-demand distribution of audio, video, and multimedia contents over networks. Recently streaming technology has been applied onto applications, and many deployment tools for enterprise applications have been developed. ETRI is also planning to provide the software on-demand service using the streaming technology through the Internet. this paper introduces an agent-based framework for the SOD system and presents programming environments for streaming service
Most pavement design and construction specifications do not adequately define the pavement functional surface characteristics that are important to highway users. the result is that sometimes completed highway project...
详细信息
ISBN:
(纸本)9780984065820
Most pavement design and construction specifications do not adequately define the pavement functional surface characteristics that are important to highway users. the result is that sometimes completed highway projects do not meet user expectations. Currently, most specifications address only smoothness (ride quality), whereas other desirable surface characteristics such as durability, and surface texture [friction (safety) and noise (environment)] are not often specifically addressed. the purpose of this paper is to look primarily at the functional characteristics of paved highway surfaces. First, functional performance will be described. Secondly, the individual surface characteristics affecting functional performance will be discussed with emphasis on pavement texture which has a major effect on friction (safety) and noise (environment). Next, recent innovative techniques and equipment to measure and evaluate these characteristics will be explained. Safety efforts underway bothinternationally and in the U.S. will be addressed. Finally, examples of the best practices will be described. Consideration of these factors by the engineering profession will help ensure that the highway user expectations are met on completed projects by providing durable, safe and quiet highways.
In this paper, we evaluate the intrinsic survivability of packet-path networks such as ORION ones. By intrinsic survivability we refer to the ability to activate packet routing around node/link failures affecting path...
详细信息
ISBN:
(纸本)0780392361
In this paper, we evaluate the intrinsic survivability of packet-path networks such as ORION ones. By intrinsic survivability we refer to the ability to activate packet routing around node/link failures affecting paths. this can be considered as an automatic increase of traffic granularity (path to packet) around the failure. A distinctive feature of our model is that downstream nodes (after the failures) "catch" re-routed packets of the LSPs they recognize, and route them in path mode afterwards.
We consider the scheduling problem in a new optical transport network called time-domain wavelength interleaved networks (TWIN). Due to the innovative architecture of TWIN, four issues are essential in the designing o...
详细信息
We consider the scheduling problem in a new optical transport network called time-domain wavelength interleaved networks (TWIN). Due to the innovative architecture of TWIN, four issues are essential in the designing of scheduling schemes: there are no transmitting/receiving conflicts; propagation delays are observed; throughput is maximized; queueing delay and delay variance are kept as small as possible. We formulate the scheduling problem into an integer linear programming (ILP) problem and present a novel heuristic algorithm - the destination slot set (DSS) algorithm. We compare the performance of DSS with an existing algorithm in TWIN - dynamic scheduling (DS), and show that while achieving the maximum throughput, DSS introduces much smaller queueing delay and delay variance than DS. We highlight that this is a requisite for providing QoS in TWIN, which was overlooked by previous works. We also show that DSS has a smaller computing complexity than DS, which makes it feasible for real-time scheduling.
We are interested in optimizing the strategies of autonomous agents, which are coordinating their actions toward a same objective. Partial observations of the universe and partial communications between the agents are...
详细信息
We are interested in optimizing the strategies of autonomous agents, which are coordinating their actions toward a same objective. Partial observations of the universe and partial communications between the agents are hypothesized. thus, the strategies of the agents are partially independent. this problem is related to the POMDP family. However, our approach is not based on the dynamic programming. In a previous work, it has been shown that the optimal strategies for the POMDP problem could be approximated by dynamic Bayesian networks with input and output (i.e. exchanging information withthe universe). A method, based on the cross-entropy, has been implemented for optimizing the parameters of such DBN, relatively to the POMDP problem; as a result the whole method was able to compute a near-optimal solution of the POMDP. this method is applied to our problem of autonomous agents. In this case, the strategy of each agent is modelled by a dynamic Bayesian network. these DBNs are assumed to be disjoint (independence of the agents). However, these DBNs are able to exchange information withthe universe and withthe communication system.
暂无评论