The effect of code-mixing on accent identification accuracy

We investigate whether accent identification is more effective for English utterances embedded in a different language as part of a mixed code than for English utterances that are part of a monolingual dialogue. Our focus is on Xhosa and Zulu, two South African languages for which code-mixing with English is very common. In order to carry out our investigation, we extract English utterances from mixed-code Xhosa and Zulu speech corpora, as well as comparable utterances from an English-only corpus by Xhosa and Zulu mother-tongue speakers. Experiments using automatic accent identification systems show that identification is substantially more accurate for the utterances originating from the mixed-code speech. These findings are supported by a corresponding set of perceptual experiments in which human subjects were asked to identify the accents of recorded utterances. We conclude that accent identification is more successful for these utterances because accents are more pronounced for English embedded in mother-tongue speech than for English spoken as part of a monolingual dialogue by non-native speakers. Furthermore we find that this is true for human listeners as well as for automatic identification systems.     

Unmanned Aerial Vehicle Localization Based on Monocular Vision and Online Mosaicking

This paper presents a new approach for vision-based UAV localization, using mosaics as environment representations. Inter-image motions are used to estimate the motion of the UAV. Online mosaicking is applied to reduce the impact of the accumulative errors in UAV position estimation. A new method to build an stochastic mosaic given the image-to-image homographies is detailed. The mosaic consists of a network of inter-image relations, and is used to create a consistent view of the environment of the UAV and hence, to detect the drift in position estimation by using the mosaic as a resource. The technique could be called simultaneous localization and mosaicking. This technique is specially suitable for monitoring and surveillance tasks in which the UAV will repeatedly cover the same area. The paper also shows experimental results with real UAVs where the benefits of the proposed method are evident.     

On graph reasoning

In this paper, we study the (positive) graph relational calculus. The basis for this calculus was introduced by Curtis and Lowe in 1996 and some variants, motivated by their applications to semantics of programs and foundations of mathematics, appear scattered in the literature. No proper treatment of these ideas as a logical system seems to have been presented. Here, we give a formal presentation of the system, with precise formulation of syntax, semantics, and derivation rules. We show that the set of rules is sound and complete for the valid inclusions, and prove a finite model result as well as decidability. We also prove that the graph relational language has the same expressive power as a first-order positive fragment (both languages define the same binary relations), so our calculus may be regarded as a notational variant of the positive existential first-order logic of binary relations. The graph calculus, however, has a playful aspect, with rules easy to grasp and use. This opens a wide range of applications which we illustrate by applying our calculus to the positive relational calculus (whose set of valid inclusions is not finitely axiomatizable), obtaining an algorithm for deciding the valid inclusions and equalities of the latter.     

A formal analysis of database replication protocols with SI replicas and crash failures

This paper provides a formal specification and proof of correctness of a basic Generalized Snapshot Isolation certification-based data replication protocol for database middleware architectures. It has been modeled using a state transition system, as well as the main system components, allowing a perfect match with the usual deployment in a middleware system. The proof encompasses both safety and liveness properties, as it is commonly done for a distributed algorithm. Furthermore, a crash failure model has been assumed for the correctness proof, although recovery analysis is not the aim of this paper. This allows an easy extension toward a crash-recovery model support in future works. The liveness proof focuses in the uniform commit: if a site has committed a transaction, the rest of sites will either commit it or it would have crashed.     

Differential evolution solution to the SLAM problem

A new solution to the Simultaneous Localization and Modelling problem is presented in this paper. The algorithm is based on the stochastic search for solutions in the state space to the global localization problem by means of a differential evolution algorithm. This non linear evolutive filter, called Evolutive Localization Filter (ELF), searches stochastically along the state space for the best robot pose estimate. The set of pose solutions (the population) focuses on the most likely areas according to the perception and up to date motion information. The population evolves using the log-likelihood of each candidate pose according to the observation and the motion errors derived from the comparison between observed and predicted data obtained from the probabilistic perception and motion model.The proposed SLAM algorithm operates in two steps: in the first step the ELF filter is used at local level to re-localize the robot based on the robot odometry, the laser scan at a given position and a local map where only a low number of the last scans have been integrated. In the second step, the aligned laser measures and the corrected robot poses are used to detect whether the robot is revisiting a previously crossed area (i.e., a cycle in the robot trajectory exists). Once a cycle is detected, the Evolutive Localization Filter is used again to estimate the accumulated residual drift in the detected loop and then to re-estimate the robot poses in order to integrate the sensor measures in the global map of the environment.The algorithm has been tested in different environments to demonstrate the effectiveness, robustness and computational efficiency of the proposed approach.     

Performance analysis of allocation policies for interGrid resource provisioning

Several Grids have been established and used for varying science applications during the last years. Most of these Grids, however, work in isolation and with different utilisation levels. Previous work has introduced an architecture and a mechanism to enable resource sharing amongst Grids. It has demonstrated that there can be benefits for a Grid to offload requests or provide spare resources to another Grid. In this work, we address the problem of resource provisioning to Grid applications in multiple-Grid environments. The provisioning is carried out based on availability information obtained from queueing-based resource management systems deployed at the provider sites which are the participants of the Grids. We evaluate the performance of different allocation policies. In contrast to existing work on load sharing across Grids, the policies described here take into account the local load of resource providers, imprecise availability information and the compensation of providers for the resources offered to the Grid. In addition, we evaluate these policies along with a mechanism that allows resource sharing amongst Grids. Experimental results obtained through simulation show that the mechanism and policies are effective in redirecting requests thus improving the applications’ average weighted response time.     

Thermal and cardiovascular strain imposed by motorcycle protective clothing under Australian summer conditions

Motorcycle protective clothing can be uncomfortably hot during summer, and this experiment was designed to evaluate the physiological significance of that burden. Twelve males participated in four, 90-min trials (cycling 30 W) across three environments (25, 30, 35 °C [all 40% relative humidity]). Clothing was modified between full and minimal injury protection. Both ensembles were tested at 25 °C, with only the more protective ensemble investigated at 30 and 35 °C. At 35 °C, auditory canal temperature rose at 0.02 °C min^?1 (SD 0.005), deviating from all other trials (p < 0.05). The thresholds for moderate (>38.5 °C) and profound hyperthermia (>40.0 °C) were predicted to occur within 105 min (SD 20.6) and 180 min (SD 33.0), respectively. Profound hyperthermia might eventuate in ~10 h at 30 °C, but should not occur at 25 °C. These outcomes demonstrate a need to enhance the heat dissipation capabilities of motorcycle clothing designed for summer use in hot climates, but without compromising impact protection.

Practitioner’s Summary:

Motorcycle protective clothing can be uncomfortably hot during summer. This experiment was designed to evaluate the physiological significance of this burden across climatic states. In the heat, moderate (>38.5 °C) and profound hyperthermia (>40.0 °C) were predicted to occur within 105 and 180 min, respectively.     

Boundary Detection in Particle‐based Fluids

This paper presents a novel method to detect free‐surfaces on particle‐based volume representation. In contrast to most particle‐based free‐surface detection methods, which perform the surface identification based on physical and geometrical properties derived from the underlying fluid flow simulation, the proposed approach only demands the spatial location of the particles to properly recognize surface particles, avoiding even the use of kernels. Boundary particles are identified through a Hidden Point Removal (HPR) operator used for visibility test. Our method is very simple, fast, easy to implement and robust to changes in the distribution of particles, even when facing large deformation of the free‐surface. A set of comparisons against state‐of‐the‐art boundary detection methods show the effectiveness of our approach. The good performance of our method is also attested in the context of fluid flow simulation involving free‐surface, mainly when using level‐sets for rendering purposes.     

Educational recommender systems and their application in lifelong learning

The almost unlimited access to educational information plethora came with a drawback: finding meaningful material is not a straightforward task anymore. Recommender algorithms can be used to make smart decisions in complex information systems and help the users decide upon useful materials; therefore, they become a promising area in academia and industry. The current paper presents a survey on educational recommender systems (RS): a set of analysis criteria are exposed and the technological specifications and challenges of each analysed system are provided, in the context of the main trends in the development of RS. Also, an ontology-based educational recommendation mechanism is proposed and its application to lifelong learning is highlighted, proving that RS can successfully support new learning paradigms.