Link Conditions for Simplifying Meshes with Embedded Structures

Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.

Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.

On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Global response sensitivity analysis using probability distance measures and generalization of Sobol's analysis

The study introduces two new alternatives for global response sensitivity analysis based on the application of the L-2-norm and Hellinger's metric for measuring distance between two probabilistic models. Both the procedures are shown to be capable of treating dependent non-Gaussian random variable models for the input variables. The sensitivity indices obtained based on the L2-norm involve second order moments of the response, and, when applied for the case of independent and identically distributed sequence of input random variables, it is shown to be related to the classical Sobol's response sensitivity indices. The analysis based on Hellinger's metric addresses variability across entire range or segments of the response probability density function. The measure is shown to be conceptually a more satisfying alternative to the Kullback-Leibler divergence based analysis which has been reported in the existing literature. Other issues addressed in the study cover Monte Carlo simulation based methods for computing the sensitivity indices and sensitivity analysis with respect to grouped variables. Illustrative examples consist of studies on global sensitivity analysis of natural frequencies of a random multi-degree of freedom system, response of a nonlinear frame, and safety margin associated with a nonlinear performance function. (C) 2015 Elsevier Ltd. All rights reserved.

Sampling and learning the Mallows and Generalized Mallows models under the Cayley distance

[EN]The Mallows and Generalized Mallows models are compact yet powerful and natural ways of representing a probability distribution over the space of permutations. In this paper we deal with the problems of sampling and learning (estimating) such distributions when the metric on permutations is the Cayley distance. We propose new methods for both operations, whose performance is shown through several experiments. We also introduce novel procedures to count and randomly generate permutations at a given Cayley distance both with and without certain structural restrictions. An application in the field of biology is given to motivate the interest of this model.

Extending Distance-based Ranking Models In Estimation of Distribution Algorithms

Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking models, such as Mallows and Generalized Mallows under the Kendall’s-t distance, have demonstrated their validity when solving this type of problems. Nevertheless, there are still many trends that deserve further study. In this paper, we extend the use of distance-based ranking models in the framework of EDAs by introducing new distance metrics such as Cayley and Ulam. In order to analyse the performance of the Mallows and Generalized Mallows EDAs under the Kendall, Cayley and Ulam distances, we run them on a benchmark of 120 instances from four well known permutation problems. The conducted experiments showed that there is not just one metric that performs the best in all the problems. However, the statistical test pointed out that Mallows-Ulam EDA is the most stable algorithm among the studied proposals.

Approximate Best Proximity Points of Cyclic Self-maps in Metric Spaces and Cyclic Asymptotic Regularity

3rd International Conference on Mathematical Modeling in Physical Sciences (IC-MSQUARE) Madrid, AUG 28-31, 2014 / editado por Vagenas, EC; Vlachos, DS; Bastos, C; Hofer, T; Kominis, Y; Kosmas, O; LeLay, G; DePadova, P; Rode, B; Suraud, E; Varga, K

On contractive cyclic fuzzy maps in metric spaces and some related results on fuzzy best proximity points and fuzzy fixed points

This paper investigates some properties of cyclic fuzzy maps in metric spaces. The convergence of distances as well as that of sequences being generated as iterates defined by a class of contractive cyclic fuzzy mapping to fuzzy best proximity points of (non-necessarily intersecting adjacent subsets) of the cyclic disposal is studied. An extension is given for the case when the images of the points of a class of contractive cyclic fuzzy mappings restricted to a particular subset of the cyclic disposal are allowed to lie either in the same subset or in its next adjacent one.

Long Distance Wireless Networking for Site - Office Data Communications

Effective data communications between the project site and decision making office can be critical for the success of a construction project. It allows convenient access to centrally stored information and allows centrally located decision makers to remotely monitor the site and collect data in real-time. However, high bandwidth, flexible data communication networks, such as wired local area networks, can often be time-consuming and costly to deploy for such purposes especially when project sites (dams, highways, etc.) are located in rural, undeveloped areas where networking infrastructure is not available. In such construction sites, wireless networking could reliably link the construction site and the decision-making office. This paper presents a case study on long-distance, site – office wireless data communications. The purpose was to investigate the capability of wireless technology in exchanging construction data in a fast and efficient manner and in allowing site personnel to interact and share knowledge and data with the office staff. This study took place at the University of Michigan’s campus where performance, reliability, and cost/benefit tests were performed. The indoor and outdoor tests performed demonstrated the suitability of this technology for office-site data communications and exposed the need for more research to further improve the reliability and data handling of this technology.

Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank

This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.

Early Holocene M similar to 6 explosive eruption from Plosky volcanic massif (Kamchatka) and its tephra as a link between terrestrial and marine paleoenvironmental records

We report tephrochronological and geochemical data on early Holocene activity from Plosky volcanic massif in the Kliuchevskoi volcanic group, Kamchatka Peninsula. Explosive activity of this volcano lasted for similar to 1.5 kyr, produced a series of widely dispersed tephra layers, and was followed by profuse low-viscosity lava flows. This eruptive episode started a major reorganization of the volcanic structures in the western part of the Kliuchevskoi volcanic group. An explosive eruption from Plosky (M similar to 6), previously unstudied, produced tephra (coded PL2) of a volume of 10-12 km(3) (11-13 Gt), being one of the largest Holocene explosive eruptions in Kamchatka. Characteristic diagnostic features of the PL2 tephra are predominantly vitric sponge-shaped fragments with rare phenocrysts and microlites of plagioclase, olivine and pyroxenes, medium- to high-K basaltic andesitic bulk composition, high-K, high-Al and high-P trachyandesitic glass composition with SiO2 = 57.5-59.5 wt%, K2O = 2.3-2.7 wt%, Al2O3 = 15.8-16.5 wt%, and P2O5 = 0.5-0.7 wt%. Other diagnostic features include a typical subduction-related pattern of incompatible elements, high concentrations of all REE (> 10x mantle values), moderate enrichment in LREE (La/Yb similar to 5.3), and non-fractionated mantle-like pattern of LILE. Geochemical fingerprinting of the PL2 tephra with the help of EMP and LA-ICP-MS analyses allowed us to map its occurrence in terrestrial sections across Kamchatka and to identify this layer in Bering Sea sediment cores at a distance of > 600 km from the source. New high-precision C-14 dates suggest that the PL2 eruption occurred similar to 10,200 cal BP, which makes it a valuable isochrone for early Holocene climate fluctuations and permits direct links between terrestrial and marine paleoenvironmental records. The terrestrial and marine C-14 dates related to the PL2 tephra have allowed us to estimate an early Holocene reservoir age for the western Bering Sea at 1,410 +/- A 64 C-14 years. Another important tephra from the early Holocene eruptive episode of Plosky volcano, coded PL1, was dated at 11,650 cal BP. This marker is the oldest geochemically characterized and dated tephra marker layer in Kamchatka to date and is an important local marker for the Younger Dryas-early Holocene transition. One more tephra from Plosky, coded PL3, can be used as a marker northeast of the source at a distance of similar to 110 km.

Exceptionally Long Distance Transport of Volcanic Ash: Implications for Stratigraphy, Hazards and the Sourcing of Distal Tephra Deposits

Cryptotephras (tephra not visible to the naked eye) form the foundation of the tephrostratigraphic frameworks used in Europe to date and correlate widely distributed geologic, paleoenvironmental and archaeological records. Pyne-O'Donnell et al. (2012) established the potential for developing a similar crypto-tephrostratigraphy across eastern North America by identifying multiple tephra, including the White River Ash (east; WRAe), St. Helens We and East Lake, in a peat core located in Newfoundland. Following on from this work, several ongoing projects have examined additional peat cores from Michigan, New York State, Maine, Nova Scotia and Newfoundland to build a tephrostratigraphic framework for this region. Using the precedent set by recent research by Jensen et al.(in press) that correlated the Alaskan WRAe to the European cryptotephra AD860B, unknown tephras identified in this work were not necessarily assumed to be from "expected" source areas (e.g. the Cascades). Here we present several examples of the preservation of tephra layers with an intercontinental distribution (i.e. WRAe and Ksudach 1), from relatively small magnitude events (i.e. St. Helens layer T, Mono Crater), and the first example of a Mexican ash in the NE (Volcan Ceboruco, Jala pumice). There are several implications of the identification of these units. These far-travelled ashes: (1) highlight the need to consider "ultra" distal source volcanoes for unknown cryptotephra deposits,. (2) present an opportunity for physical volcanologists to examine why some eruptions have an exceptional distribution of ash that is not necessarily controlled by the magnitude of the event. (3) complicate the idea of using tephrostratigraphic frameworks to understand the frequency of eruptions towards aiding hazard planning and prediction (e.g. Swindles et al., 2011). (4) show that there is a real potential to link tropical and mid to high-latitude paleoenvironmental records. Jensen et al. (in press) Transatlantic correlation of the Alaskan White River Ash. Geology. Pyne-O'Donnell et al. (2012). High-precision ultra-distal Holocene tephrochronology in North America. Quaternary Science Reviews, 52, 6-11. Swindles et al. (2011). A 7000 yr perspective on volcanic ash clouds affecting northern Europe. Geology, 39, 887-890.

The Long Distance Transport of Airborne Ambrosia Pollen to the UK and the Netherlands from Central and South Europe

Background: The invasive alien species Ambrosia artemisiifolia (common or short ragweed) is increasing its range in Europe. In the UK and the Netherlands airborne concentrations of Ambrosia pollen are usually low. However, more than 30 Ambrosia pollen grains per cubic metre of air (above the level capable to trigger allergic symptoms) were recorded in Leicester (UK) and Leiden (NL) on 4 and 5 September 2014. Objective: The aims of this study were to determine whether the highly allergenic Ambrosia pollen recorded during the episode could be the result of long distance transport, to identify the potential sources of these pollen grains and describe the conditions that facilitated this possible long distance transport. Methods: Airborne Ambrosia pollen data were collected at 10 sites in Europe. Back trajectory and atmospheric dispersion calculations were performed using HYSPLIT_4. Results: Back trajectories calculated at Leicester and Leiden show that higher altitude air masses (1500m) originated from source areas on the Pannonian Plain and Ukraine. During the episode, air masses veered to the west and passed over the Rhône Valley. Dispersion calculations showed that the atmospheric conditions were suitable for Ambrosia pollen released from the Pannonian Plain and the Rhône Valley to reach the higher levels and enter the air stream moving to Northwest Europe where they were deposited at ground level and recorded by monitoring sites. Conclusions: The study indicates that the Ambrosia pollen grains recorded during the episode in Leicester and Leiden were probably not produced by local sources, but transported long distances from potential source regions in East Europe, i.e. the Pannonian Plain and Ukraine, as well as the Rhône Valley in France.

Fly by data link: feasibility of a relative navigation solution for aviation relying on a future L-band data link

Trabalho final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações