Passive target detection and tracking from electromagnetic field measurements

This paper presents a novel approach to the localization of moving targets in a complex environment based on the measurement of the perturbations induced by the target presence on an independently‐generated time‐varying electromagnetic field. Field perturbations are measured via a set of sensors deployed over the domain of interest and used to detect and track a possible target by resorting to a particle Bernoulli filter (PBF). To comply with real‐time operation, the PBF works along with an artificial neural network (ANN) model of the environment trained offline via finite elements (FEs). The performance of the proposed algorithm is assessed via simulation experiments.     

A Technique for Extracting Sub-source Similarities from Information Sources Having Different Formats

In this paper we propose a semi-automatic technique for deriving the similarity degree between two portions of heterogeneous information sources (hereafter, sub-sources). The proposed technique consists in two phases: the first one selects the most promising pairs of sub-sources, whereas the second one computes the similarity degree relative to each promising pair. We show that the detection of sub-source similarities is a special case (and a very interesting one, for semi-structured information sources) of the more general problem of Scheme Match. In addition, we present a real example case to clarify the proposed technique, a set of experiments we have conducted to verify the quality of its results, a discussion about its computational complexity and its classification in the context of related literature. Finally, we discuss some possible applications which can benefit by derived similarities.     

Constraint-Based Verification of Parameterized Cache Coherence Protocols

We propose a new method for the parameterized verification of formal specifications of cache coherence protocols. The goal of parameterized verification is to establish system properties for an arbitrary number of caches. In order to achieve this purpose we define abstractions that allow us to reduce the original parameterized verification problem to a control state reachability problem for a system with integer data variables. Specifically, the methodology we propose consists of the following steps. We first define an abstraction in which we only keep track of the number of caches in a given state during the execution of a protocol. Then, we use linear arithmetic constraints to symbolically represent infinite sets of global states of the resulting abstract protocol. For reasons of efficiency, we relax the constraint operations by interpreting constraints over real numbers. Finally, we check parameterized safety properties of abstract protocols using symbolic backward reachability, a strategy that allows us to obtain sufficient conditions for termination for an interesting class of protocols. The latter problem can be solved by using the infinite-state model checker HyTech: Henzinger, Ho, and Wong-Toi, A model checker for hybrid systems, Proc. of the 9th International Conference on Computer Aided Verification (CAV'97), Lecture Notes in Computer Science, Springer, Haifa, Israel, 1997, Vol. 1254, pp. 460–463. HyTech handles linear arithmetic constraints using the polyhedra library of Halbwachs and Proy, Verification of real-time systems using linear relation analysis, Formal Methods in System Design, Vol. 11, No. 2, pp. 157–185, 1997. By using this methodology, we have automatically validated parameterized versions of widely implemented write-invalidate and write-update cache coherence protocols like Synapse, MESI, MOESI, Berkeley, Illinois, Firefly and Dragon (Handy, The Cache Memory Book, Academic Press, 1993). With this application, we have shown that symbolic model checking tools like HyTech, originally designed for the verification of hybrid systems, can be applied successfully to new classes of infinite-state systems of practical interest.     

Web accessibility guideline aggregation for older users and its validation

Web site-evaluation methodologies and validation engines take the view that all accessibility guidelines must be met to gain compliance. Problems exist in this regard, as contradictions within the rule set may arise, and the type of impairment or its severity is not isolated. The Barrier Walkthrough (BW) method goes someway to addressing these issues, by enabling barrier types derived from guidelines to be applied to different user categories such as motor or visual impairment, etc. However, the problem remains of combinatorial explosion of possibilities when one has to consider users with multiple disabilities. In this paper, a simple set theory operation is used to create a validation scheme for older users by aggregating barrier types specific to motor impaired and low-vision users, thereby creating a new “older users” category from the results of this set union. To evaluate the feasibility and validity of this aggregation approach, two BW experiments were conducted. The first experiment evaluated the aggregated results by focusing on quality attributes and showed that aggregation generates data whose quality is comparable to the original one. However, this first experiment could not test for validity, as the older users category was not included. To remedy this deficiency, another BW experiment was conducted with expert judges who evaluated a web page in the context of older users. In this second experiment, it was found that there is no significant difference between the aggregated and the manually evaluated (by experts) barrier scores, and that the same barriers are identified using experts and aggregation, even though there are differences in how severity scores are distributed. From these results, it is concluded that the aggregation of barriers is a viable alternative to expert evaluation, when the target of that aggregation could not be evaluated manually or it would not be feasible to do so. It is also argued that aggregation is a technique that can be used in combination with other evaluation methods, like user testing or subjective assessments.     

A variational integrators approach to second order modeling and identification of linear mechanical systems

The theory of variational integration provides a systematic procedure to discretize the equations of motion of a mechanical system, preserving key properties of the continuous time flow. The discrete-time model obtained by variational integration theory inherits structural conditions which in general are not guaranteed under general discretization procedures. We discuss a simple class of variational integrators for linear second order mechanical systems and propose a constrained identification technique which employs simple linear transformation formulas to recover the continuous time parameters of the system from the discrete-time identified model. We test this approach on a simulated eight degrees of freedom system and show that the new procedure leads to an accurate identification of the continuous-time parameters of second-order mechanical systems starting from discrete measured data.     

A design flow for supporting component-based software development in multiprocessor real-time systems

Component-based software development established as an effective technique to cope with the increasing complexity of modern computing systems. In the context of real-time systems, the M-BROE framework has been recently proposed to efficiently support component-based development of real-time applications on multiprocessor platforms in the presence of shared resources. The framework relies on a two-stage approach where software components are first partitioned upon a virtual multiprocessor platform and are later integrated upon the physical platform by means of component interfaces that abstract from the internal details of the applications. This work presents a complete design flow for the M-BROE framework. Starting from a model of software components, a first method is proposed to partition applications to virtual processors and perform a synthesis of multiple component interfaces. Then, a second method is proposed to support the integration of the components by allocating virtual processors to physical processors. Both methods take resource sharing into account. Experimental results are also presented to evaluate the proposed methodology.     

Understanding user requirements and preferences for a digital library Web portal

This article reports the findings of a user study conducted in the context of the TELplus project to gain insights about user needs and preferences for the digital library services offered by The European Library Web portal. The user requirements collection for the Web portal was designed by adopting a comprehensive survey approach. This combined explicit user feedback with implicit usage data so as to provide a more in-depth analysis of user experience with the portal. The analysis conducted shed light on likely motivations for both participant usage and reluctance to use the services provided, leading to more informed decisions on how to refine, improve, and present Web portal services to their future users. The lessons learnt from this case study also contributed to the development of an integrated methodological framework which provided insights for the future design and evaluation of digital library Web portals and services.     

Traffic analysis of peer-to-peer IPTV communities

The Internet is currently experiencing one of the most important challenges in terms of content distribution since its first uses as a medium for content delivery: users from passive downloaders and browsers are moving towards content producers and publishers. They often distribute and retrieve multimedia contents establishing network communities. This is the case of peer-to-peer IPTV communities.In this work we present a detailed study of P2P IPTV traffic, providing useful insights on both transport- and packet-level properties as well as on the behavior of the peers inside the network. In particular, we provide novel results on the (i) ports and protocols used; (ii) differences between signaling and video traffic; (iii) behavior of the traffic at different time scales; (iv) differences between TCP and UDP traffic; (v) traffic generated and received by peers; (vi) peers neighborhood and session duration. The knowledge gained thanks to this analysis is useful for several tasks, e.g. traffic identification, understanding the performance of different P2P IPTV technologies and the impact of such traffic on network nodes and links, and building more realistic models for simulations.¹     

A Survey of Airworthiness and Certification for UAS

The Italian SMAT project is a civilian program supported by Piemonte Region developed for the territorial monitoring and surveillance and for the prevention of natural hazards. In a different way from the previous surveillance programs, the SMAT project is based on the use of several unmanned platforms that are able to cooperate through ground coordination and control station. The flight in non-segregated airspace, needed in order to accomplish the territorial monitoring mission, is a main issue to be investigated and defined, because of the current lack of a common consensus and agreement on the regulations of UAS. The present work outlines the international initiatives that deal with the development of the regulatory framework on airworthiness and certification of UAS and their potential impact on the SMAT project.     

Focusing qualitative simulation using temporal logic: theoretical foundations

We illustrate TeQsim, a qualitative simulator for continuous dynamical systems that combines the expressive power of qualitative differential equations with temporal logic to constrain and refine the resulting predicted behaviors. Temporal logic is used to specify constraints that restrict the simulation to a region of the state space and to specify trajectories for input variables. A propositional linear‐time temporal logic is adopted, which is extended to a three valued logic that allows a formula to be conditionally entailed when quantitative information specified in the formula can be applied to a behavior to refine it. We present a formalization of the logic with correctness and completeness results for the adopted model checking algorithm. We show an example of the simulation of a non‐autonomous dynamical system and illustrate possible application tasks, ranging from simulation to monitoring and control of continuous dynamical systems, where TeQsim can be applied. This revised version was published online in June 2006 with corrections to the Cover Date.