Non-self-adjoint graphs

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity transforms to self-adjoint Laplacians. Among other things, we describe a simple way to relate the similarity transforms between Laplacians on certain graphs with elementary similarity transforms between matrices defining the boundary conditions.

Long distance dispersal shaped patterns of human genetic diversity in Eurasia

Most previous attempts at reconstructing the past history of human populations did not explicitly take geography into account, or considered very simple scenarios of migration and ignored environmental information. However, it is likely that the Last Glacial Maximum (LGM) affected the demography and the range of many species, including our own. Moreover, long-distance dispersal (LDD) may have been an important component of human migrations, allowing fast colonization of new territories and preserving high levels of genetic diversity. Here, we use a high-quality microsatellite dataset genotyped in 22 populations to estimate the posterior probabilities of several scenarios for the settlement of the Old World by modern humans. We considered models ranging from a simple spatial expansion to others including LDD and a LGM-induced range contraction, as well as Neolithic demographic expansions. We find that scenarios with LDD are much better supported by data than models without LDD. Nevertheless, we show evidence that LDD events to empty habitats were strongly prevented during the settlement of Eurasia. This unexpected absence of LDD ahead of the colonization wave front could have been caused by an Allee effect, either due to intrinsic causes such as an inbreeding depression built during the expansion, or to extrinsic causes such as direct competition with archaic humans. Overall, our results suggest only a relatively limited effect of the LGM-contraction on current patterns of human diversity. This is in clear contrast with the major role of LDD migrations, which have potentially contributed to the intermingled genetic structure of Eurasian populations.

Wet tundra polygon centers and distance between polygon centroids on Samoylov Island, Lena Delta, Siberia, Russia, with links to shape files

Subgrid processes occur in various ecosystems and landscapes but, because of their small scale, they are not represented or poorly parameterized in climate models. These local heterogeneities are often important or even fundamental for energy and carbon balances. This is especially true for northern peatlands and in particular for the polygonal tundra, where methane emissions are strongly influenced by spatial soil heterogeneities. We present a stochastic model for the surface topography of polygonal tundra using Poisson-Voronoi diagrams and we compare the results with available recent field studies. We analyze seasonal dynamics of water table variations and the landscape response under different scenarios of precipitation income. We upscale methane fluxes by using a simple idealized model for methane emission. Hydraulic interconnectivities and large-scale drainage may also be investigated through percolation properties and thresholds in the Voronoi graph. The model captures the main statistical characteristics of the landscape topography, such as polygon area and surface properties as well as the water balance. This approach enables us to statistically relate large-scale properties of the system to the main small-scale processes within the single polygons.

Transport costs, distance, and time : evidence from the Japanese Census of Logistics

Geographic distance is a standard proxy for transport costs under the simple assumption that freight fees increase monotonically over space. Using the Japanese Census of Logistics, this paper examines the extent to which transport distance and time affect freight costs across shipping modes, commodity groups, and prefecture pairs. The results show substantial heterogeneity in transport costs and time across shipping modes. Consistent with an iceberg formulation of transport costs, distance has a significantly positive effect on freight costs by air transportation. However, I find the puzzling results that business enterprises are likely to pay more for short-distance shipments by truck, ship, and railroad transportation. As a plausible explanation, I discuss aggregation bias arising from freight-specific premiums for timely, frequent, and small-batch shipments.

A practical approach for outdoors distributed target localization in wireless sensor networks

Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate.

Horizontal visibility graphs generated by type-I intermittency

The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associatedHVgraphs.We showhowthe alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics.We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.

Planar point sets with large minimum convex decompositions

We show the existence of sets with n points (n ? 4) for which every convex decomposition contains more than (35/32)n?(3/2) polygons,which refutes the conjecture that for every set of n points there is a convex decomposition with at most n+C polygons. For sets having exactly three extreme pointswe show that more than n+sqr(2(n ? 3))?4 polygons may be necessary to form a convex decomposition.

Gromov hyperbolicity of periodic planar graphs

The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it. The main result in this paper is a very simple characterization of the hyperbolicity of a large class of periodic planar graphs.

Efficient studies of long-distance Bmp5 gene regulation using bacterial artificial chromosomes

The regulatory regions surrounding many genes may be large and difficult to study using standard transgenic approaches. Here we describe the use of bacterial artificial chromosome clones to rapidly survey hundreds of kilobases of DNA for potential regulatory sequences surrounding the mouse bone morphogenetic protein-5 (Bmp5) gene. Simple coinjection of large insert clones with lacZ reporter constructs recapitulates all of the sites of expression observed previously with numerous small constructs covering a large, complex regulatory region. The coinjection approach has made it possible to rapidly survey other regions of the Bmp5 gene for potential control elements, to confirm the location of several elements predicted from previous expression studies using regulatory mutations at the Bmp5 locus, to test whether Bmp5 control regions act similarly on endogenous and foreign promoters, and to show that Bmp5 control elements are capable of rescuing phenotypic effects of a Bmp5 deficiency. This rapid approach has identified new Bmp5 control regions responsible for controlling the development of specific anatomical structures in the vertebrate skeleton. A similar approach may be useful for studying complex control regions surrounding many other genes important in embryonic development and human disease.

Determination of the distance between two spin labels attached to a macromolecule.

An EPR "spectroscopic ruler" was developed using a series of alpha-helical polypeptides, each modified with two nitroxide spin labels. The EPR line broadening due to electron-electron dipolar interactions in the frozen state was determined using the Fourier deconvolution method. These dipolar spectra were then used to estimate the distances between the two nitroxides separated by 8-25 A. Results agreed well with a simple alpha-helical model. The standard deviation from the model system was 0.9 A in the range of 8-25 A. This technique is applicable to complex systems such as membrane receptors and channels, which are difficult to access with high-resolution NMR or x-ray crystallography, and is expected to be particularly useful for systems for which optical methods are hampered by the presence of light-interfering membranes or chromophores.

Comparison of Couples' Normal Life Cycle Development and Intimacy Distance Regulation

When conceptualizing healthy couple relationships, it is tempting to use a simple framework as a panacea. Unfortunately, this desire for simplicity can lead to a narrow and naive perspective. Individuals interact and are influenced by a variety of factors (i.e., various social systems, multiple context memberships, complex interconnecting exchanges, etc.); consequently, it is necessary to guard against an overly narrow interpretation when examining healthy couple interactions. It is the purpose of this paper to develop one aspect of a complex perspective for healthy couple relationships by comparing couple life cycle development with couple intimacy-distance regulation.

New glimpses on convex infinite optimization duality

Given a convex optimization problem (P) in a locally convex topological vector space X with an arbitrary number of constraints, we consider three possible dual problems of (P), namely, the usual Lagrangian dual (D), the perturbational dual (Q), and the surrogate dual (Δ), the last one recently introduced in a previous paper of the authors (Goberna et al., J Convex Anal 21(4), 2014). As shown by simple examples, these dual problems may be all different. This paper provides conditions ensuring that inf(P)=max(D), inf(P)=max(Q), and inf(P)=max(Δ) (dual equality and existence of dual optimal solutions) in terms of the so-called closedness regarding to a set. Sufficient conditions guaranteeing min(P)=sup(Q) (dual equality and existence of primal optimal solutions) are also provided, for the nominal problems and also for their perturbational relatives. The particular cases of convex semi-infinite optimization problems (in which either the number of constraints or the dimension of X, but not both, is finite) and linear infinite optimization problems are analyzed. Finally, some applications to the feasibility of convex inequality systems are described.

Perceived importance of zones surrounding a vehicle and learning to use a convex mirror effectively. Final report.

National Highway Traffic Safety Administration, Washington, D.C.

Steiner trade spectra of complete partite graphs

The Steiner trade spectrum of a simple graph G is the set of all integers t for which there is a simple graph H whose edges can be partitioned into t copies of G in two entirely different ways. The Steiner trade spectra of complete partite graphs were determined in all but a few cases in a recent paper by Billington and Hoffman (Discrete Math. 250 (2002) 23). In this paper we resolve the remaining cases. (C) 2004 Elsevier B.V. All rights reserved.

Monitoring long distance WDM communication lines using a high-loss loopback supervisory system

In this paper, we present experimental results for monitoring long distance WDM communication links using a line monitoring system suitable for legacy optically amplified long-haul undersea systems. This monitoring system is based on setting up a simple, passive, low cost high-loss optical loopback circuit at each repeater that provides a connection between the existing anti-directional undersea fibres, and can be used to define fault location. Fault location is achieved by transmitting a short pulse supervisory signal along with the WDM data signals where a portion of the overall signal is attenuated and returned to the transmit terminal by the loopback circuit. A special receiver is used at the terminal to extract the weakly returned supervisory signal where each supervisory signal is received at different times corresponding to different optical repeaters. Therefore, the degradation in any repeater appears on its corresponding supervisory signal level. We use a recirculating loop to simulate a 4600 km fibre link, on which a high-loss loopback supervisory system is implemented. Successful monitoring is accomplished through the production of an appropriate supervisory signal at the terminal that is detected and identified in a satisfactory time period after passing through up to 45 dB attenuation in the loopback circuit. © 2012 Elsevier B.V. All rights reserved.