Tetra-trees properties in graphic interaction

The localization of the components of an object near to a device before obtaining the real interaction is usually determined by means of a proximity measurement to the device of the object’s features. In order to do this efficiently, hierarchical decompositions are used, so that the features of the objects are classified into several types of cells, usually rectangular.In this paper we propose a solution based on the classification of a set of points situated on the device in a little-known spatial decomposition named tetra-tree. Using this type of spatial decomposition gives us several quantitative and qualitative properties that allow us a more realistic and intuitive visual interaction, as well as the possibility of selecting inaccessible components. These features could be used in virtual sculpting or accessibility tasks.In order to show these properties we have compared an interaction system based on tetra-trees to one based on octrees.     

An Experimental Economics Investigation of Shipper-carrier Interactions in the Choice of Mode and Shipment Size in Freight Transport

The paper discusses the theoretical and empirical evidence on the subject and concludes that freight mode choice can be best understood as the outcome of interactions between shippers and carriers, and that mode choice depends to a large extent on the shipment size that results from shipper-carrier interactions. These conclusions are supported by economic experiments designed to test the hypothesis of cooperative behavior. This was accomplished by conducting two sets of experiments (ones with the shipper playing the lead role in selecting the shipment size; and others in which the shipment size decision was left to the carriers), and by comparing their results to the ones obtained numerically under the assumption of perfect cooperation. The comparison of results indicated that the experiments converged to the perfect cooperation case. This is in line with the conclusion from game theory that indicates that under typical market conditions the shipper and carrier would cooperate. These results also imply that it really does not matter who “makes” the decision about the shipment size and mode to be used at a given time period, as over time the shipper—that is the customer—ends up selecting the bids more consistent with its own interest. In other words, these results do not support the assumption that freight mode choice is solely made by the carriers.     

Differential evolution for solving the mobile location management

In this work we present two new approaches to solve the location management problem, respectively, based on the location areas and the reporting cells strategies. The location management problem corresponds to the management of the network configuration with the objective of minimizing the costs involved. We use the differential evolution algorithm to find the best configuration for the location areas and the reporting cells strategies, which principally considers the location update and paging costs. With this work we want to define the best values to the differential evolution configuration, using test networks and also realistic networks, as well as compare our results with the ones obtained by other authors. These two new approaches applied to this problem have given us very good results, when compared with those obtained by other authors.     

Information fusion for automotive applications – An overview

This article focusses on the fusion of information from various automotive sensors like radar, video, and lidar for enhanced safety and traffic efficiency. Fusion is not restricted to data from sensors onboard the same vehicle but vehicular communication systems allow to propagate and fuse information with sensor data from other vehicles or from the road infrastructure as well. This enables vehicles to perceive information from regions that are hardly accessible otherwise and represents the basis for cooperative driving maneuvers. While the Bayesian framework builds the basis for information fusion, automobile environments are characterized by their a priori unknown topology, i.e., the number, type, and structure of the perceived objects is highly variable. Multi-object detection and tracking methods are a first step to cope with this challenge. Obviously, the existence or non-existence of an object is of paramount importance for safe driving. Such decisions are highly influenced by the association step that assigns sensor measurements to object tracks. Methods that involve multiple sequences of binary assignments are compared with soft-assignment strategies. Finally, fusion based on finite set statistics that (theoretically) avoid an explicit association are discussed.     

Model‐based code generation for HLA federates

This paper addresses the problem of automated code generation for a High Level Architecture compliant federate application given its behavior model. The behavior model is a part of the architectural model of a federation that the federate can participate in. The federate behavior model is based on Live Sequence Charts, adopted as the behavioral specification formalism in the Federation Architecture Metamodel (FAMM). FAMM serves as a formal language for describing federation architectures. An objective is to help the testing of federation architecture by means of its prototype implementation early in the development lifecycle. A further objective is to help developers construct complete federate applications that are well modularized. The approach to achieve these objectives is aspect‐oriented in that the generated code, which handles the federate's interactions with a federation execution, serves as the base code, where the computation logic is to be weaved as an aspect. Copyright © 2009 John Wiley & Sons, Ltd.     

A flux-free a posteriori error estimator for the incompressible Stokes problem using a mixed FE formulation

In this contribution, we present an a posteriori error estimator for the incompressible Stokes problem valid for a conventional mixed FE formulation. Due to the saddle-point property of the problem, conventional error estimators developed for pure minimization problems cannot be utilized straight-forwardly. The new estimator is built up by two key ingredients. At first, a computed error approximation, exactly fulfilling the continuity equation for the error, is obtained via local Dirichlet problems. Secondly, we adopt the approach of solving local equilibrated flux-free problems in order to bound the remaining, incompressible, error. In this manner, guaranteed upper and lower bounds, of the velocity “energy norm” of the error as well as goal-oriented (linear) output functionals, with respect to a reference (overkill) mesh are obtained. In particular, it should be noted that this approach requires no computation of hybrid fluxes. Furthermore, the estimator is applicable to mixed FE formulations using continuous pressure approximations, such as the Mini and Taylor–Hood class of elements. In conclusion, a few simple numerical examples are presented, illustrating the accuracy of the error bounds.     

Robust clusterwise linear regression through trimming

The presence of clusters in a data set is sometimes due to the existence of certain relations among the measured variables which vary depending on some hidden factors. In these cases, observations could be grouped in a natural way around linear and nonlinear structures and, thus, the problem of doing robust clustering around linear affine subspaces has recently been tackled through the minimization of a trimmed sum of orthogonal residuals. This “orthogonal approach” implies that there is no privileged variable playing the role of response variable or output. However, there are problems where clearly one variable is wanted to be explained in terms of the other ones and the use of vertical residuals from classical linear regression seems to be more advisable. The so-called TCLUST methodology is extended to perform robust clusterwise linear regression and a feasible algorithm for the practical implementation is proposed. The algorithm includes a “second trimming” step aimed to diminishing the effect of leverage points.     

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

The problem of computing the chromatic number of a P ₅-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P ₅-free graph admits a k-coloring, and finding one, if it does.