An automatic and general least-squares projection procedure for sweep meshing

In this paper, we present a new and automatic node projection algorithm to generate hexahedral meshes in extrusion geometries. It is designed to preserve the shape of the cap surfaces in the inner layers of a sweeping mesh. The algorithm is based on least-squares approximation of affine mappings. We report that the functionals that have been traditionally used to compute the affine mapping generate four undesired effects on the inner layers of nodes. Namely, the flattening, skewing, offset scaling, and flipping of the inner layer meshes. To overcome these drawbacks we first analyze several properties of a new functional that depends on two vector parameters. Second, we introduce the concept of the pseudo-area and pseudo-normal vectors defined by a loop of nodes. In addition, we prove several geometrical properties of these vectors. Third, based on the properties of the new functional and on the definition of the pseudo-normal vector, we detail a new projection algorithm that automatically selects the functional vector parameters. The aim of this paper is to provide the implementation details to developers, although we also present the background of the algorithm. Finally, several mesh examples are discussed to assess the properties of the proposed algorithm.     

Energy-saving scheduling on IaaS HPC cloud environments based on a multi-objective genetic algorithm

The Journal of Supercomputing - Nowadays, cloud computing is a growing scenario applied to many scientific and manufacturing areas due to its flexibility for adapting to highly demanding computing...     

Robust network monitoring in the presence of non-cooperative traffic queries

We present the design of a predictive load shedding scheme for a network monitoring platform that supports multiple and competing traffic queries. The proposed scheme can anticipate overload situations and minimize their impact on the accuracy of the traffic queries. The main novelty of our approach is that it considers queries as black boxes, with arbitrary (and highly variable) input traffic and processing cost. Our system only requires a high-level specification of the accuracy requirements of each query to guide the load shedding procedure and assures a fair allocation of computing resources to queries in a non-cooperative environment. We present an implementation of our load shedding scheme in an existing network monitoring system and evaluate it with a diverse set of traffic queries. Our results show that, with the load shedding mechanism in place, the monitoring system can preserve the accuracy of the queries within predefined error bounds even during extreme overload conditions.     

Is It Possible to Retain Customer Loyalty When a Service Has Failed?

This article aims to analyze the impact of recovery on loyalty in the context of a service chain characterized by the e‐quality–perceived value–loyalty relationship. A sample of 91 out of 1,201 respondents claimed to have had service problems with an online travel agency website. A causal model to test relationships was performed using structural equations modeling, and it was found that data fit with the proposed model. The really important point to retaining customers is quality. It is not so clear that the recovery effort might affect loyalty. Our findings underpin some previous stream of literature confirming that recovery does not always affect loyalty. Although the literature has not reached a consensus in this topic, we add new elements in this debate.     

A Secure Elliptic Curve-Based RFID Protocol

Nowadays, the use of Radio Frequency Identification (RFID) systems in industry and stores has increased. Nevertheless, some of these systems present privacy problems that may discourage potential users. Hence, high confidence and effient privacy protocols are urgently needed. Previous studies in the literature proposed schemes that are proven to be secure, but they have scalability problems. A feasible and scalable protocol to guarantee privacy is presented in this paper. The proposed protocol uses elliptic curve cryptography combined with a zero knowledge-based authentication scheme. An analysis to prove the system secure, and even forward secure is also provided. This work is supported by the Generalitat de Catalunya under Grant No. FIC 2007FIC 00880, and the projects of the Spanish MCyT MTM2007-66842-C02-02 and TIN2006-15662-C02-02.     

Responses of the reflectance indices PRI and NDVI to experimental warming and drought in European shrublands along a north-south climatic gradient

The aim of this study was to evaluate the use of ground-based canopy reflectance measurements to detect changes in physiology and structure of vegetation in response to experimental warming and drought treatment at six European shrublands located along a North-South climatic gradient. We measured canopy reflectance, effective green leaf area index (green LAIe) and chlorophyll fluorescence of dominant species. The treatment effects on green LAIe varied among sites. We calculated three reflectance indices: photochemical reflectance index PRI [531 nm; 570 nm], normalized difference vegetation index NDVI₆₈₀ [780 nm; 680 nm] using red spectral region, and NDVI₅₇₀ [780 nm; 570 nm] using the same green spectral region as PRI. All three reflectance indices were significantly related to green LAIe and were able to detect changes in shrubland vegetation among treatments. In general warming treatment increased PRI and drought treatment reduced NDVI values. The significant treatment effect on photochemical efficiency of plants detected with PRI could not be detected by fluorescence measurements. However, we found canopy level measured PRI to be very sensitive to soil reflectance properties especially in vegetation areas with low green LAIe. As both soil reflectance and LAI varied between northern and southern sites it is problematic to draw universal conclusions of climate-derived changes in all vegetation types based merely on PRI measurements. We propose that canopy level PRI measurements can be more useful in areas of dense vegetation and dark soils.     

Efficient algorithms for counting parameterized list H-colorings

We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simple. We introduce the concept of compactor and a new algorithmic technique, compactor enumeration, that allow us to design fixed parameter algorithms for parameterized counting problems.