representations of the computations carried out by the paths in a program, and of the systems of predicates that describe the input data that causes program paths to be executed. A symbolic evaluation system called DISSECT is described which can be used to analyze FORTRAN programs. The system includes a

the first time it was executed in a line with a different number of characters). All of these examples, although rather trivial by comparison to the challenges of large software projects, do share important characteristics of conventional programming. The user must: • Decide the intended result of executing

Copyright © 2012 Muhammad Hamad Alizai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We address the challenge of link estimation and routing over highly dynamic links, thats is, bursty links that rapidly shift between reliable and unreliable periods of transmissions. Based on significant empirical evidence of over 100,000 transmissions over each link in 802.15.4 and 802.11 testbeds, we propose two metrics, expected future transmissions (EFT) and MAC3, for runtime estimation of bursty wireless links.We introduce a bursty link estimator (BLE) that based on these twometrics, accurately estimates bursty links in the network rendering them available for data transmissions. Finally, we present bursty routing extensions (BRE): an adaptive routing strategy that uses BLE for forwarding packets over bursty links if they offer better routing progress than long-term stable links. Our evaluation, comprising experimental data from widely used IEEE 802.15.4-based testbeds, reveals an average of 19 % and a maximum of 42 % reduction in the number of transmissions when routing over long-range bursty links typically ignored by routing protocols. Additionally, we show that both BLE and BRE are not tied to any specific routing protocol and integrate seamlessly with existing routing protocols and link estimators. 1.

An alternative representation of an exact statistical field theory for simple fluids, based on the method of collective variables, is presented. The results obtained are examined from the point of another version of theory that was developed recently by performing a Hubbard

journal homepage: www.elsevier.com/locate/adhoc Enabling efficient reprogramming through reduction of executable modules

n Robots (and roboticists) increasingly appear

Service-based systems that are dynamically composed at runtime to provide complex, adaptive functionality are currently one of the main development paradigms in software engineering. However, the Quality of Service (QoS) delivered by these systems remains an important concern, and needs

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations

cognitive phenomena in this fashion it is hoped that an understanding of how intelligence is manifested at the systems level, as opposed to the individual cognitive level, will be obtained. Thus distributed cognition moves the unit of analysis to the system and finds its center of gravity

IOS Press Utilization of intelligent agents for supporting citizens in their access to e-government services 1