Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using coordinate interleaved orthogonal designs (CIODs). It is shown that using two uncorrelated transmit antennas at the nodes, but using only one RF transmit chain and space-time coding across these antennas can give a better performance without using any extra resources and without increasing the hardware implementation cost and complexity. In the first transmission scheme, two antennas are used only at the relay, adaptive network coding (ANC) is employed at the relay and the relay transmits a CIOD space time block code (STBC). This gives a better performance compared to an existing ANC scheme for two-way relay channel which uses one antenna each at all the three nodes. It is shown that for this scheme at high SNR the average end-to-end symbol error probability (SEP) is upper bounded by twice the SEP of a point-to-point fading channel. In the second transmission scheme, two transmit antennas are used at all the three nodes, CIOD STBCs are transmitted in multiple access and broadcast phases. This scheme provides a diversity order of two for the average end-to-end SEP with an increased decoding complexity of O(M-3) for an arbitrary signal set and O(M-2 root M) for square QAM signal set. Simulation results show that the proposed schemes performs better than the existing ANC schemes under perfect and imperfect channel state information.

Experimental studies on the influence of intermediate principal stress and inclination on the mechanical behaviour of angular sands

A comprehensive experimental study has been made on angular sand to investigate various aspects of mechanical behavior. A hollow cylinder torsion testing apparatus is used in this program to apply a range of stress conditions on this angular quartzitic fine sand under monotonic drained shear. The effect of the magnitude and inclination of the principal stresses on an element of sand is studied through these experiments. This magnitude and inclination of the principal stresses are presented as an ``ensemble measure of fabric in sands''. This ensemble measure of fabric in the sands evolves through the shearing process, and reaches the final state, which indeed has a unique fabric. The sand shows significant variation in strength with changing inclination of the principal stresses. The locus of the final stress state in principal stress space is also mapped from these series of experiments. Additional aspects of non-coaxiality, a benchmarking exercise with a few constitutive models is presented here. This experimental approach albeit indirect shows that a unique state which is dependent on the fabric, density and confining stress exists. This suite of experiments provides a well-controlled data set for a clear understanding on the mechanical behavior of sands.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

A note on tetrablock contractions

A commuting triple of operators (A, B, P) on a Hilbert space H is called a tetrablock contraction if the closure of the set E = {(a(11),a(22),detA) : A = GRAPHICS] with parallel to A parallel to <1} is a spectral set. In this paper, we construct a functional model and produce a set of complete unitary invariants for a pure tetrablock contraction. In this construction, the fundamental operators, which are the unique solutions of the operator equations A - B* P = DPX1DP and B - A* P = DPX2DP where X-1, X-2 is an element of B(D-P) play a pivotal role. As a result of the functional model, we show that every pure tetrablock isometry (A, B, P) on an abstract Hilbert space H is unitarily equivalent to the tetrablock contraction (MG1*+G2z, MG2*+G1z, M-z) on H-DP*(2). (D), where G(1) and G(2) are the fundamental operators of (A*, B*, P*). We prove a Beurling Lax Halmos type theorem for a triple of operators (MF1*+F2z, MF2*+F1z, M-z), where epsilon is a Hilbert space and F-1, F-2 is an element of B(epsilon). We also deal with a natural example of tetrablock contraction on a functions space to find out its fundamental operators.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.

Toward canonical trophic aggregations

The attractiveness of the trophic concept is that it was the first attempt at a holistic perspective on an ecosystem which met with any degree of success. Just as temperature, pressure, and volume allow one to characterize the incomprehensible multitude of particulate motions in a simple gas, the hope is that a small set of figures, such as trophic storages or trophic efficiencies, permit one to compare two ecosystems with overwhelmingly disparate complexities. Thus, if it were possible to demonstrate that an arbitrary network of ecosystem flows could be reduced to a trophic configuration, the aggregation process thus defined would become a key component of the evolving discipline of "macroscopic ecology" (see also Odum 1977 and Ulanowicz 1979).

Stock assessment of loggerhead and leatherback sea turtles and An assessment of the impact of the pelagic longline fishery on the loggerhead and leatherback sea turtles of the Western North Atlantic

On September 7, 2000 the National Marine Fisheries Service announced that it was reinitiating consultation under Section 7 of the Endangered Species Act on pelagic fisheries for swordfish, sharks, tunas, and billfish. 1 Bycatch of a protected sea turtle species is considered a take under the Endangered Species Act (PL93-205). On June 30, 2000 NMFS completed a Biological Opinion on an amendment to the Highly Migratory Pelagic Fisheries Management Plan that concluded that the continued operation of the pelagic longline fishery was likely to jeopardize the continued existence of loggerhead and leatherback sea turtles.2 Since that Biological Opinion was issued NMFS concluded that further analyses of observer data and additional population modeling of loggerhead sea turtles was needed to determine more precisely the impact of the pelagic longline fishery on turtles. 3,4 Hence, the reinitiation of consultation. The documents that follow constitute the scientific review and synthesis of information pertaining to the narrowly defined reinitiation of consultation: the impact of the pelagic longline fishery on loggerhead and leatherback sea turtles The document is in 3 parts, plus 5 appendices. Part I is a stock assessment of loggerhead sea turtles of the Western North Atlantic. Part II is a stock assessment of leatherback sea turtles of the Western North Atlantic. Part III is an assessment of the impact of the pelagic longline fishery on loggerhead and leatherback sea turtles of the Western North Atlantic. These documents were prepared by the NMFS Southeast Fisheries Science Center staff and academic colleagues at Duke University and Dalhousie University. Personnel involved from the SEFSC include Joanne Braun-McNeill, Lisa Csuzdi, Craig Brown, Jean Cramer, Sheryan Epperly, Steve Turner, Wendy Teas, Nancy Thompson, Wayne Witzell, Cynthia Yeung, and also Jeff Schmid under contract from the University or Miami. Our academic colleagues, Ransom Myers, Keith Bowen, and Leah Gerber from Dalhousie University and Larry Crowder and Melissa Snover from Duke University, also recipients of a Pew Charitable Trust Grant for a Comprehensive Study of the Ecological Impacts of the Worldwide Pelagic Longline Industry, made significant contributions to the quantitative analyses and we are very grateful for their collaboration. We appreciate the reviews of the stock definition sections on loggerheads and leatherbacks by Brian Bowen, University of Florida, and Peter Dutton, National Marine Fisheries Service Southwest Fisheries Science Center, respectively, and the comments of the NMFS Center of Independent Experts reviewers Robert Mohn, Ian Poiner, and YouGan Wang on the entire document. We also wish to acknowledge all the unpublished data used herein which were contributed by many researchers, especially the coordinators and volunteers of the nesting beach surveys and the sea turtle stranding and salvage network and the contributors to the Cooperative Marine Turtle Tagging Program. (PDF contains 349 pages)

Effects of temperature on the threshold of phosphorus for algal blooms

Algal blooms, worsening marine ecosystems and causing great economic loss, have been paid much attention to for a long time. Such environmental factors as light penetration, water temperature, and nutrient concentration are crucial in blooms processes. Among them, only nutrients can be controlled. Therefore, the threshold of nutrients for algal blooms is of great concern. To begin with, a dynamic eutrophication model has been constructed to simulate the algal growth and phosphorus cycling. The model encapsulates the essential biological processes of algal growth and decay, and phosphorus regeneration due to algal decay. The nutrient limitation is based upon commonly used Monod's kinetics. The effects of temperature and phosphorus limitation are particularly addressed. Then, we have endeavored to elucidate the threshold of phosphorus at different temperature for algal blooms. Based on the numerical simulation, the isoquant contours of change rate of alga as shown in the figure are obtained, which obviously demonstrate the threshold of nutrient at an arbitrary reasonable temperature. The larger the change rate is, the more rapidly the alga grows. If the phosphorus concentration at a given temperature remains larger than the threshold the algal biomass may increase monotonically, leading to the algal blooming. With the rising of temperature, the threshold is apparently reduced, which may explain why likely red tide disasters occur in a fine summer day. So, high temperature and sufficient phosphorus supply are the major factors which result in algal growth and blowout of red tide.

Influence of Training Set Selection in Artificial Neural Network-Based Propagation Path Loss Predictions

This paper analyzes the use of artificial neural networks (ANNs) for predicting the received power/path loss in both outdoor and indoor links. The approach followed has been a combined use of ANNs and ray-tracing, the latter allowing the identification and parameterization of the so-called dominant path. A complete description of the process for creating and training an ANN-based model is presented with special emphasis on the training process. More specifically, we will be discussing various techniques to arrive at valid predictions focusing on an optimum selection of the training set. A quantitative analysis based on results from two narrowband measurement campaigns, one outdoors and the other indoors, is also presented.

Design of an optimised wheel profile for rail vehicles operating on two track gauges

This paper sets out an optimum synthesis methodology for wheel profiles of railway vehicles in order to secure good dynamic behaviour with different track configurations. Specifically, the optimisation process has been applied to the case of rail wheelsets mounted on double gauge bogies, that move over two different gauges, which also have different types of rail: the Iberian gauge (1668 mm) and the UIC gauge (1435 mm). Optimisation is performed using Genetic Algorithms and traditional optimisation methods in a complementary way. The objective function used is based on an ideal equivalent conicity curve which ensures good stability on straight sections and also proper negotiation of curves. To this end the curve is constructed in such a way that it is constant with a low value for small lateral wheelset displacements (with regard to stability), and increases as the displacements increase (to facilitate negotiation of curved sections). Using this kind of ideal conicity curve also enables a wheel profile to be secured where the contact points have a larger distribution over the active contact areas, making wear more homogeneous and reducing stresses. The result is a wheel profile with a conicity that is closer to the target conicity for both gauges studied, producing better curve negotiation while maintaining good stability on straight sections of track. The paper shows the resultant wheel profile, the contact curves it produces, and a number of dynamic analyses demonstrating better dynamic behaviour of the synthesised wheel on curved sections with respect to the original wheel.

On the contact width in generalized plain strain JKR model for isotropic solids

Adhesive contact model between an elastic cylinder and an elastic half space is studied in the present paper, in which an external pulling force is acted on the above cylinder with an arbitrary direction and the contact width is assumed to be asymmetric with respect to the structure. Solutions to the asymmetric model are obtained and the effect of the asymmetric contact width on the whole pulling process is mainly discussed. It is found that the smaller the absolute value of Dundurs' parameter beta or the larger the pulling angle theta, the more reasonable the symmetric model would be to approximate the asymmetric one.

Nonexistence of looping trajectories in hydromagnetic waves of finite amplitude. Breaking of waves in a cold collision-free plasma in a magnetic field. On stabilities of periodic waves in a cold collision-free plasma in a magnetic field.

This dissertation consists of three parts. In Part I, it is shown that looping trajectories cannot exist in finite amplitude stationary hydromagnetic waves propagating across a magnetic field in a quasi-neutral cold collision-free plasma. In Part II, time-dependent solutions in series expansion are presented for the magnetic piston problem, which describes waves propagating into a quasi-neutral cold collision-free plasma, ensuing from magnetic disturbances on the boundary of the plasma. The expansion is equivalent to Picard's successive approximations. It is then shown that orbit crossings of plasma particles occur on the boundary for strong disturbances and inside the plasma for weak disturbances. In Part III, the existence of periodic waves propagating at an arbitrary angle to the magnetic field in a plasma is demonstrated by Stokes expansions in amplitude. Then stability analysis is made for such periodic waves with respect to side-band frequency disturbances. It is shown that waves of slow mode are unstable whereas waves of fast mode are stable if the frequency is below the cutoff frequency. The cutoff frequency depends on the propagation angle. For longitudinal propagation the cutoff frequency is equal to one-fourth of the electron's gyrofrequency. For transverse propagation the cutoff frequency is so high that waves of all frequencies are stable.

Conditional independence in quantum many-body systems

In this thesis, I will discuss how information-theoretic arguments can be used to produce sharp bounds in the studies of quantum many-body systems. The main advantage of this approach, as opposed to the conventional field-theoretic argument, is that it depends very little on the precise form of the Hamiltonian. The main idea behind this thesis lies on a number of results concerning the structure of quantum states that are conditionally independent. Depending on the application, some of these statements are generalized to quantum states that are approximately conditionally independent. These structures can be readily used in the studies of gapped quantum many-body systems, especially for the ones in two spatial dimensions. A number of rigorous results are derived, including (i) a universal upper bound for a maximal number of topologically protected states that is expressed in terms of the topological entanglement entropy, (ii) a first-order perturbation bound for the topological entanglement entropy that decays superpolynomially with the size of the subsystem, and (iii) a correlation bound between an arbitrary local operator and a topological operator constructed from a set of local reduced density matrices. I also introduce exactly solvable models supported on a three-dimensional lattice that can be used as a reliable quantum memory.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.