Distributed Computing on Core-Periphery Networks: Axiom-based Design

Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm

The Topology of Wireless Communication

In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received power of a signal at a receiver against the sum of strengths of other interfering signals plus background noise. To describe the behavior of a multi-station network, we use the convenient representation of a \emph{reception map}. In the SINR model, the resulting \emph{SINR diagram} partitions the plane into reception zones, one per station, and the complementary region of the plane where no station can be heard. We consider the general case where transmission energies are arbitrary (or non-uniform). Under that setting, the reception zones are not necessarily convex or even connected. This poses the algorithmic challenge of designing efficient point location techniques as well as the theoretical challenge of understanding the geometry of SINR diagrams. We achieve several results in both directions. We establish a form of weaker convexity in the case where stations are aligned on a line. In addition, one of our key results concerns the behavior of a $(d+1)$-dimensional map. Specifically, although the $d$-dimensional map might be highly fractured, drawing the map in one dimension higher "heals" the zones, which become connected. In addition, as a step toward establishing a weaker form of convexity for the $d$-dimensional map, we study the interference function and show that it satisfies the maximum principle. Finally, we turn to consider algorithmic applications, and propose a new variant of approximate point location.Comment: 64 pages, appeared in STOC'1

Generalized Perron--Frobenius Theorem for Nonsquare Matrices

The celebrated Perron--Frobenius (PF) theorem is stated for irreducible nonnegative square matrices, and provides a simple characterization of their eigenvectors and eigenvalues. The importance of this theorem stems from the fact that eigenvalue problems on such matrices arise in many fields of science and engineering, including dynamical systems theory, economics, statistics and optimization. However, many real-life scenarios give rise to nonsquare matrices. A natural question is whether the PF Theorem (along with its applications) can be generalized to a nonsquare setting. Our paper provides a generalization of the PF Theorem to nonsquare matrices. The extension can be interpreted as representing client-server systems with additional degrees of freedom, where each client may choose between multiple servers that can cooperate in serving it (while potentially interfering with other clients). This formulation is motivated by applications to power control in wireless networks, economics and others, all of which extend known examples for the use of the original PF Theorem. We show that the option of cooperation between servers does not improve the situation, in the sense that in the optimal solution no cooperation is needed, and only one server needs to serve each client. Hence, the additional power of having several potential servers per client translates into \emph{choosing} the best single server and not into \emph{sharing} the load between the servers in some way, as one might have expected. The two main contributions of the paper are (i) a generalized PF Theorem that characterizes the optimal solution for a non-convex nonsquare problem, and (ii) an algorithm for finding the optimal solution in polynomial time

The Generalized Microscopic Image Reconstruction Problem

This paper presents and studies a generalization of the microscopic image reconstruction problem (MIR) introduced by Frosini and Nivat [Andrea Frosini and Maurice Nivat, 2007; Nivat, 2002]. Consider a specimen for inspection, represented as a collection of points typically organized on a grid in the plane. Assume each point x has an associated physical value l_x, which we would like to determine. However, it might be that obtaining these values precisely (by a surgical probe) is difficult, risky, or impossible. The alternative is to employ aggregate measuring techniques (such as EM, CT, US or MRI), whereby each measurement is taken over a larger window, and the exact values at each point are subsequently extracted by computational methods. In this paper we extend the MIR framework in a number of ways. First, we consider a generalized setting where the inspected object is represented by an arbitrary graph G, and the vector l in R^n assigns a value l_v to each node v. A probe centered at a vertex v will capture a window encompassing its entire neighborhood N[v], i.e., the outcome of a probe centered at v is P_v = sum_{w in N[v]} l_w. We give a criterion for the graphs for which the extended MIR problem can be solved by extracting the vector l from the collection of probes, P^- = {P_v | v in V}. We then consider cases where such reconstruction is impossible (namely, graphs G for which the probe vector P is inconclusive, in the sense that there may be more than one vector l yielding P). Let us assume that surgical probes (whose outcome at vertex v is the exact value of l_v) are technically available to us (yet are expensive or risky, and must be used sparingly). We show that in such cases, it may still be possible to achieve reconstruction based on a combination of a collection of standard probes together with a suitable set of surgical probes. We aim at identifying the minimum number of surgical probes necessary for a unique reconstruction, depending on the graph topology. This is referred to as the Minimum Surgical Probing problem (MSP). Besides providing a solution for the above problems for arbitrary graphs, we also explore the range of possible behaviors of the Minimum Surgical Probing problem by determining the number of surgical probes necessary in certain specific graph families, such as perfect k-ary trees, paths, cycles, grids, tori and tubes

Cytokinin-mediated source ⁄sink modifications improve drought tolerance and increase grain yield in rice under water-stress

Drought is the major environmental factor limiting crop productivity worldwide. We hypothesized that it is possible to enhance drought tolerance by delaying stress-induced senescence through the stress-induced synthesis of cytokinins in crop-plants. We generated transgenic rice (Oryza sativa) plants expressing an isopentenyltransferase (IPT) gene driven by PSARK, a stress- and maturation-induced promoter. Plants were tested for drought tolerance at two yield-sensitive developmental stages: pre- and post-anthesis. Under both treatments, the transgenic rice plants exhibited delayed response to stress with significantly higher grain yield (GY) when compared to wild-type plants. Gene expression analysis revealed a significant shift in expression of hormone-associated genes in the transgenic plants. During water-stress (WS), PSARK::IPT plants displayed increased expression of brassinosteroid-related genes and repression of jasmonate-related genes. Changes in hormone homeostasis were associated with resource(s) mobilization during stress. The transgenic plants displayed differential expression of genes encoding enzymes associated with hormone synthesis and hormone-regulated pathways. These changes and associated hormonal crosstalk resulted in the modification of source ⁄ sink relationships and a stronger sink capacity of the PSARK::IPT plants during WS. As a result, the transgenic plants had higher GY with improved quality (nutrients and starch content)

Cytokinin-mediated source ⁄sink modifications improve drought tolerance and increase grain yield in rice under water-stress

Drought is the major environmental factor limiting crop productivity worldwide. We hypothesized that it is possible to enhance drought tolerance by delaying stress-induced senescence through the stress-induced synthesis of cytokinins in crop-plants. We generated transgenic rice (Oryza sativa) plants expressing an isopentenyltransferase (IPT) gene driven by PSARK, a stress- and maturation-induced promoter. Plants were tested for drought tolerance at two yield-sensitive developmental stages: pre- and post-anthesis. Under both treatments, the transgenic rice plants exhibited delayed response to stress with significantly higher grain yield (GY) when compared to wild-type plants. Gene expression analysis revealed a significant shift in expression of hormone-associated genes in the transgenic plants. During water-stress (WS), PSARK::IPT plants displayed increased expression of brassinosteroid-related genes and repression of jasmonate-related genes. Changes in hormone homeostasis were associated with resource(s) mobilization during stress. The transgenic plants displayed differential expression of genes encoding enzymes associated with hormone synthesis and hormone-regulated pathways. These changes and associated hormonal crosstalk resulted in the modification of source ⁄ sink relationships and a stronger sink capacity of the PSARK::IPT plants during WS. As a result, the transgenic plants had higher GY with improved quality (nutrients and starch content)

The rice transcription factor OsWRKY47 is a positive regulator of the response to water deficit stress

OsWRKY47 is a divergent rice transcription factor belonging to the group II of the WRKY family. A transcriptomic analysis of the drought response of transgenic rice plants expressing PSARK::IPT, validated by qPCR, indicated that OsWRKY47 expression was induced under drought stress in PSARK::IPT plants. A PCR-assisted site selection assay (SELEX) of recombinant OsWRKY47 protein showed that the preferred sequence bound in vitro is (G/T)TTGACT. Bioinformatics analyses identified a number of gene targets of OsWRKY47; among these two genes encode a Calmodulin binding protein and a Cys-rich secretory protein. Using Oswrk47 knockout mutants and transgenic rice overexpressing OsWRKY47 we show that the transcription of these putative targets were regulated by OsWRKY47. Phenotypic analysis carried out with transgenic rice plants showed that Oswrky47 mutants displayed higher sensitivity to drought and reduced yield, while plants overexpressing OsWRKY47 were more tolerant.Fil: Raineri, Jesica. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Agrobiotecnología del Litoral. Universidad Nacional del Litoral. Instituto de Agrobiotecnología del Litoral; ArgentinaFil: Wang, Songhu. Chinese Academy of Sciences; República de China. University of California at Davis; Estados UnidosFil: Peleg, Zvi. The Hebrew University of Jerusalem; Israel. University of California at Davis; Estados UnidosFil: Blumwald, Eduardo. University of California at Davis; Estados UnidosFil: Chan, Raquel Lia. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Agrobiotecnología del Litoral. Universidad Nacional del Litoral. Instituto de Agrobiotecnología del Litoral; Argentin