Visually impaired people and the emerging connected TV: a comparative study of TV and Web applications’ accessibility

With the TV signal digitization and the current market growth of connected TVs, the authors envision the appearance of accessibility barriers to visually impaired persons. The paper addresses the following hypothesis: (1) visually impaired users want to extend their TV usage to explore new TV features; (2) TV applications are in less conformance with accessibility guidelines compared to their Desktop versions. Additionally, the authors wanted to assess whether guideline conformance reflected real TV accessibility problems experienced by users. The methods used for this study included surveys aimed at characterizing the interest of the visually impaired population regarding the use of TV, and specifically of Web applications on TV, an automated accessibility evaluation to compare TV and Desktop versions of the same Web application, to understand their conformance with accessibility guidelines, and a user study where participants with visual impairments were asked to perform some tasks on both versions. From the survey, we confirmed that people with visual disabilities are interested in extra features on their TV. Results from the automated accessibility evaluation show that TV applications are in a significantly better level of conformance with accessibility guidelines. The user study has illustrated that users were unable to complete any task using the TV versions of the applications. The results from these studies demonstrated that the new features that come with connected TVs still have a long way to go in order to be accessible by all. Furthermore, they lead us to concur with other works that automated evaluations are not enough to assess the accessibility of a Web page.     

Position USBL/DVL sensor-based navigation filter in the presence of unknown ocean currents

This paper presents a novel approach to the design of globally asymptotically stable (GAS) position and velocity filters for Autonomous Underwater Vehicles (AUVs) based directly on the sensor readings of an Ultra-short Baseline (USBL) acoustic array system and a Doppler Velocity Log (DVL). The proposed methodology is based on an equivalent linear time-varying (LTV) system that fully captures the dynamics of the nonlinear system, allowing for the use of powerful linear system analysis and filtering design tools that yield GAS filter error dynamics. Numerical results using Monte Carlo simulations and comparison to the Bayesian Cramér Rao Bound (BCRB) reveal that the performance of the proposed filter is tight to this theoretical estimation error lower bound. In comparison with other approaches, the present solution achieves the same level of performance of the Extended Kalman Filter (EKF), which does not offer GAS guarantees, and outperforms other classical filtering approaches designed in inertial coordinates instead of the body-fixed coordinate frame.     

Increasing selective pressure towards the best compromise in evolutionary multiobjective optimization: The extended NOSGA method

Most current approaches in the evolutionary multiobjective optimization literature concentrate on adapting an evolutionary algorithm to generate an approximation of the Pareto frontier. However, finding this set does not solve the problem. The decision-maker still has to choose the best compromise solution out of that set. Here, we introduce a new characterization of the best compromise solution of a multiobjective optimization problem. By using a relational system of preferences based on a multicriteria decision aid way of thinking, and an outranked-based dominance generalization, we derive some necessary and sufficient conditions which describe satisfactory approximations to the best compromise. Such conditions define a lexicographic minimum of a bi-objective optimization problem, which is a map of the original one. The NOSGA-II method is a NSGA-II inspired efficient way of solving the resulting mapped problem.     

Sensitivity of SAR data to post-fire forest regrowth in Mediterranean and boreal forests

Disturbed forests may need decades to reach a mature stage and optically-based vegetation indices are usually poorly suited for monitoring purposes due to the rapid saturation of the signal with increasing canopy cover. Spaceborne synthetic aperture radar (SAR) data provide an alternate monitoring approach since the backscattered microwave energy is sensitive to the vegetation structure. Images from two regions in Spain and Alaska were used to analyze SAR metrics (cross-polarized backscatter and co-polarized interferometric coherence) from regrowing forests previously affected by fire. TerraSAR-X X-band backscatter showed the lowest sensitivity to forest regrowth, with the average backscatter increasing by 1-2 dB between the most recent fire scar and the unburned forest. Increased sensitivity (around 3-4 dB) was observed for C-band Envisat Advanced Synthetic Aperture (ASAR) backscatter. The Advanced Land Observing Satellite (ALOS) Phased Array-type L-band Synthetic Aperture Radar (PALSAR) L-band backscatter presented the highest dynamic range from unburned to recently burned forests (approximately 8 dB). The interferometric coherence showed low sensitivity to forest regrowth at all SAR frequencies. For Mediterranean forests, five phases of forest regrowth were discerned whereas for boreal forest, up to four different regrowth phases could be discerned with L-band SAR data. In comparison, the Normalized Difference Vegetation Index (NDVI) provided reliable differentiation only for the most recent development stages. The results obtained were consistent in both environments.     

Persistent Scatterers Interferometry detects and measures ground subsidence in Lisbon

Results from the application of Persistent Scatterers Interferometry in Lisbon Metropolitan Area revealed two previously unknown subsiding urban areas: one (Laranjeiras) is located in the center of Lisbon; another (Vialonga) is to be found toward the North, in an industrial region crossed by Lisbon's main highway and railway lines. The two subsiding sectors are bordered by sharp velocity gradients, and the subsidence pattern appears partially delimited by mapped geologic faults. Surface geology and urbanization alone are unable to explain the phenomena. In the Vialonga area, the historical record of water pore pressure shows a clear decline of the levels (up to 65 m in 27 years), providing evidence of over-exploitation of groundwater resources. Limited information from wells drilled inside and outside the subsidence area points to a spatial correlation between the subsidence and the water pressure levels, and suggests that faults could be acting as hydraulic barriers in the aquifer system. The surface subsidence detected is probably caused by compaction of a clay-rich Oligocene-aged aquitard, led by over-exploitation of adjacent aquifers. The same Oligocene aquitard layer is present in the Laranjeiras area, immediately bellow a multi-layered sand-clay-limestone Miocene aquifer, but further work is needed to diagnose the possibility of over-exploitation of groundwater here. In this work we were able to independently confirm the PSI results, by comparing autonomous PSI results processed for the same geographical areas, and by comparing PSI with leveling and continuous GPS derived subsidence velocities, whose close match provided further ground validation of the space-borne PSI technique.     

An integration experience of a software architecture and a monitoring infrastructure to deploy applications with non‐functional requirements in computing grids

Resource management is an important aspect to consider regarding applications that might have different non‐functional or operational requirements, when running in distributed and heterogeneous environments. In this context, it is necessary to provide the means to specify the required resource constraints and an infrastructure that can adapt the applications in light of the changes in resource availability. We adopted a contract‐based approach to describe and maintain parallel applications that have non‐functional requirements in a Computing Grid context, called ZeliGrid. To form the supporting infrastructure we have designed a software architecture that integrates some of the Globus services, the LDAP and the NWS monitoring services. Some modules that map the contract approach into software artifacts were also integrated to this architecture. This paper addresses the architecture and integration issues of our approach, as well as how we put the pieces together highlighting deployment and implementation details, which have to consider diverse aspects such as monitoring, security and dynamic reconfiguration. Copyright © 2010 John Wiley & Sons, Ltd.     

Exoskeleton: Curve network abstraction for 3D shapes

In this paper, we introduce the concept of an exoskeleton as a new abstraction of arbitrary shapes that succinctly conveys both the perceptual and the geometric structure of a 3D model. We extract exoskeletons via a principled framework that combines segmentation and shape approximation. Our method starts from a segmentation of the shape into perceptually relevant parts and then constructs the exoskeleton using a novel extension of the Variational Shape Approximation method. Benefits of the exoskeleton abstraction to graphics applications such as simplification and chartification are presented.     

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience and storage. Further, even though conventional public key and elliptic curve cryptosystems are computationally feasible on sensor nodes, protocols based on them are not, as they require the exchange and storage of large keys and certificates, which is expensive.Using Pairing-Based Cryptography (PBC) protocols parties can agree on keys without any interaction. In this work, we (i) show how security in WSNs can be bootstrapped using an authenticated identity-based non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for 8, 16 and 32-bit processors commonly found in sensor nodes. TinyPBC is able to compute pairings, the most expensive primitive of PBC, in 1.90 s on ATmega128L, 1.27 s on MSP430 and 0.14 s on PXA27x.     

A Graph‐based Approach to Continuous Line Illustrations with Variable Levels of Detail

This paper introduces a method for automatically generating continuous line illustrations, drawings consisting of a single line, from a given input image. Our approach begins by inferring a graph from a set of edges extracted from the image in question and obtaining a path that traverses through all edges of the said graph. The resulting path is then subjected to a series of post‐processing operations to transform it into a continuous line drawing. Moreover, our approach allows us to manipulate the amount of detail portrayed in our line illustrations, which is particularly useful for simplifying the overall illustration while still retaining its most significant features. We also present several experimental results to demonstrate that our approach can automatically synthesize continuous line illustrations comparable to those of some contemporary artists.     

Decidability and complexity of Petri nets with unordered data

We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermann-hardness results for all our decidable decision problems. Then we consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. Here we prove that its complexity is also non-primitive recursive. Then we prove undecidability of depth-boundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems is undecidable for ν-PN. These results carry over to Petri Data Nets.