Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Dynamics of the Indian-Ocean oxygen minimum zones

In the Indian Ocean, mid-depth oxygen minimum zones (OMZs) occur in the Arabian Sea and the Bay of Bengal. The lower part of the Arabian-Sea OMZ (ASOMZ; below 400 m) intensifies northward across the basin; in contrast, its upper part (above 400 m) is located in the central/eastern basin, well east of the most productive regions along the western boundary. The Bay-of-Bengal OMZ (BBOMZ), although strong, is weaker than the ASOMZ. To investigate the processes that maintain the Indian-Ocean OMZs, we obtain a suite of solutions to a coupled biological/physical model. Its physical component is a variable-density, 6 1/2-layer model, in which each layer corresponds to a distinct dynamical regime or water-mass type. Its biological component has six compartments: nutrients, phytoplankton, zooplankton, two size classes of detritus, and oxygen. Because the model grid is non-eddy resolving (0.5 degrees), the biological model also includes a parameterization of enhanced mixing based on the eddy kinetic energy derived from satellite observations. To explore further the impact of local processes on OMZs, we also obtain analytic solutions to a one-dimensional, simplified version of the biological model. Our control run is able to simulate basic features of the oxygen, nutrient, and phytoplankton fields throughout the Indian Ocean. The model OMZs result from a balance, or lack thereof, between a sink of oxygen by remineralization and subsurface oxygen sources due primarily to northward spreading of oxygenated water from the Southern Hemisphere, with a contribution from Persian-Gulf water in the northern Arabian Sea. The northward intensification of the lower ASOMZ results mostly from horizontal mixing since advection is weak in its depth range. The eastward shift of the upper ASOMZ is due primarily to enhanced advection and vertical eddy mixing in the western Arabian Sea, which spread oxygenated waters both horizontally and vertically. Advection carries small detritus from the western boundary into the central/eastern Arabian Sea, where it provides an additional source of remineralization that drives the ASOMZ to suboxic levels. The model BBOMZ is weaker than the ASOMZ because the Bay lacks a remote source of detritus from the western boundary. Although detritus has a prominent annual cycle, the model OMZs do not because there is not enough time for significant remineralization to occur.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Analysis of OSNR Requirements for Higher Modulation Schemes for Various Local Oscillator Powers

To meet the growing demands of data traffic in long haul communication, it is necessary to efficiently use the low-loss region(C-band) of the optical spectrum, by increasing the no. of optical channels and increasing the bit rate on each channel But narrow pulses occupy higher spectral bandwidth. To circumvent this problem, higher order modulation schemes such as QPSK and QAM can be used to modulate the bits, which increases the spectral efficiency without demanding any extra spectral bandwidth. On the receiver side, to meet a satisfy, a given BER, the received optical signal requires to have minimum OSNR. In our study in this paper, we analyses for different modulation schemes, the OSNR required with and without preamplifier. The theoretical limit of OSNR requirement for a modulation scheme is compared for a given link length by varying the local oscillator (LO) power. Our analysis shows that as we increase the local oscillator (LO) power, the OSNR requirement decreases for a given BER. Also a combination of preamplifier and local oscillator (LO) gives the OSNR closest to theoretical limit.

Local solutions to local problems: A stormwater education collaborative

Currently completing its fifth year, the Coastal Waccamaw Stormwater Education Consortium (CWSEC) helps northeastern South Carolina communities meet National Pollutant Discharge Elimination System (NPDES) Phase II permit requirements for Minimum Control Measure 1 - Public Education and Outreach - and Minimum Control Measure 2 - Public Involvement. Coordinated by Coastal Carolina University, six regional organizations serve as core education providers to eight coastal localities including six towns and cities and two large counties. CWSEC recently finished a needs assessment to begin the process of strategizing for the second NPDES Phase II 5-year permit cycle in order to continue to develop and implement effective, results-oriented stormwater education and outreach programs to meet federal requirements and satisfy local environmental and economic needs. From its conception in May 2004, CWSEC set out to fulfill new federal Clean Water Act requirements associated with the NPDES Phase II Stormwater Program. Six small municipal separate storm sewer systems (MS4s) located within the Myrtle Beach Urbanized Area endorsed a coordinated approach to regional stormwater education, and participated in a needs assessment resulting in a Regional Stormwater Education Strategy and a Phased Education Work Plan. In 2005, CWSEC was formally established and the CWSEC’s Coordinator was hired. The Coordinator, who is also the Environmental Educator at Coastal Carolina University’s Waccamaw Watershed Academy, organizes six regional agencies who serve as core education providers for eight coastal communities. The six regional agencies working as core education providers to the member MS4s include Clemson Public Service and Carolina Clear Program, Coastal Carolina University’s Waccamaw Watershed Academy, Murrells Inlet 2020, North Inlet-Winyah Bay National Estuarine Research Reserve’s Coastal Training and Public Education Programs, South Carolina Sea Grant Consortium, and Winyah Rivers Foundation’s Waccamaw Riverkeeper®. CWSEC’s organizational structure results in a synergy among the education providers, achieving greater productivity than if each provider worked separately. The member small MS4s include City of Conway, City of North Myrtle Beach, City of Myrtle Beach, Georgetown County, Horry County, Town of Atlantic Beach, Town of Briarcliffe Acres, and Town of Surfside Beach. Each MS4 contributes a modest annual fee toward the salary of the Coordinator and operational costs. (PDF contains 3 pages)

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Noiseless method for checking the Peres separability criterion by local operations and classical communication

We present a method for checking the Peres separability criterion in an arbitrary bipartite quantum state rho(AB) within local operations and classical communication scenario. The method does not require noise operation which is needed in making the partial transposition map physically implementable. The main task for the two observers, Alice and Bob, is to measure some specific functions of the partial transposed matrix. With these functions, they can determine the eigenvalues of rho(T)(AB)(B), among which the minimum serves as an entanglement witness.

The use of a biased heuristic by a genetic algorithm applied to the design of multipoint connections in a local access network

This paper presents a genetic algorithm for finding a constrained minimum spanning tree. The problem is of relevance in the design of minimum cost communication networks, where there is a need to connect all the terminals at a user site to a terminal concentrator in a multipoint (tree) configuration, while ensuring that link capacity constraints are not violated. The approach used maintains a distinction between genotype and phenotype, which produces superior results to those found using a direct representation in a previous study.

An intelligent configuration-sampling based local motion planner for robotic manipulators

Manipulator motion planning is a task which relies heavily on the construction of a configuration space prior to path planning. However when fast real-time motion is needed, the full construction of the manipulator's high-dimensional configu-ration space can be too slow and expensive. Alternative planning methods, which avoid this full construction of the manipulator's configuration space are needed to solve this problem. Here, one such existing local planning method for manipulators based on configuration-sampling and subgoal-selection has been extended. Using a modified Artificial Potential Fields (APF) function, goal-configuration sampling and a novel subgoal selection method, it provides faster, more optimal paths than the previously proposed work. Simulation results show a decrease in both runtime and path lengths, along with a decrease in unexpected local minimum and crashing issues.

Kernel-based local order estimation of nonlinear nonparametric systems

We consider the local order estimation of nonlinear autoregressive systems with exogenous inputs (NARX), which may have different local dimensions at different points. By minimizing the kernel-based local information criterion introduced in this paper, the strongly consistent estimates for the local orders of the NARX system at points of interest are obtained. The modification of the criterion and a simple procedure of searching the minimum of the criterion, are also discussed. The theoretical results derived here are tested by simulation examples.

Municipio saludable como polo de desarrollo local "diagnóstico situación láctea Macheta"

Este proyecto hace parte de un convenio entre la Gobernación de Cundinamarca y la Universidad del Rosario para desarrollar el proyecto Municipio Saludable como Polo de Desarrollo Local en tres municipios de Cundinamarca: Machetá, Sesquilé y Mesitas de El Colegio. Dicho programa tiene cuatro ejes, de los cuales la Facultad de Administración desarrolla el primer eje que se relaciona con la Generación de empleo e Ingresos. La investigación, objeto de estudio se llevó a cabo en el municipio de Machetá, donde se trabajó el tema lácteo con pequeños productores y se desarrolló el módulo de marco lógico, en el que se llevaron a cabo las siguientes actividades: a) Contacto con la comunidad, visitas periódicas al Municipio. b) Elaboración y aplicación de encuestas a funcionarios de la Alcaldía, vendedores de plaza y productores. c) Procesamiento y análisis de resultados. d) Construcción de árbol de problemas con la comunidad, e) Construcción de árbol de objetivos. f) Socialización con la comunidad. g) Elaboración de estrategias. h) Conclusiones y recomendaciones. Para mejorar las condiciones de vida de los pequeños productores de leche se recomienda la organización de una cooperativa u otro tipo de asociación que les permita ofertar un producto con cantidades, con la calidad que requieren las empresas procesadoras o entrar en un proceso mas elaborado que implica el montaje de un tanque de enfriamiento con capacidad mínima de 3.000 litros/diarios y /o procesar la leche para producir quesos y otros productos derivados de leche. Obtener esto, estabilizaría precios, ingresos y les daría poder de negociación que es algo con lo que no cuentan actualmente los pequeños productores.

Temperature and the development rates of thrips: evidence for a constraint on local adaptation?

Typically, the relationship between insect development and temperature is described by two characteristics: the minimum temperature needed for development to occur (T-min) and the number of day degrees required (DDR) for the completion of development. We investigated these characteristics in three English populations of Thrips major and T tabaci [Cawood, Yorkshire (N53degrees49', W1degrees7'); Boxworth, Cambridgeshire (N52degrees15', W0degrees1'); Silwood Park, Berkshire (N51degrees24', W0degrees38')], and two populations of Frankliniella occidentalis (Cawood; Silwood Park). While there were no significant differences among populations in either T-min (mean for T major = 7.0degreesC; T tabaci = 5.9degreesC; F. occidentalis = 6.7degreesC) or DDR (mean for T major = 229.9; T tabaci = 260.8; F occidentalis = 233.4), there were significant differences in the relationship between temperature and body size, suggesting the presence of geographic variation in this trait. Using published data, in addition to those newly collected, we found a negative relationship between T-min. and DDR for F occidentalis and T tabaci, supporting the hypothesis that a trade-off between T-min and DDR may constrain adaptation to local climatic conditions.

Sparse density estimation on multinomial manifold combining local component analysis

A new sparse kernel density estimator is introduced based on the minimum integrated square error criterion combining local component analysis for the finite mixture model. We start with a Parzen window estimator which has the Gaussian kernels with a common covariance matrix, the local component analysis is initially applied to find the covariance matrix using expectation maximization algorithm. Since the constraint on the mixing coefficients of a finite mixture model is on the multinomial manifold, we then use the well-known Riemannian trust-region algorithm to find the set of sparse mixing coefficients. The first and second order Riemannian geometry of the multinomial manifold are utilized in the Riemannian trust-region algorithm. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with competitive accuracy to existing kernel density estimators.

Genetic algorithm inversion of the average 1D crustal structure using local and regional earthquakes

Knowing the best 1D model of the crustal and upper mantle structure is useful not only for routine hypocenter determination, but also for linearized joint inversions of hypocenters and 3D crustal structure, where a good choice of the initial model can be very important. Here, we tested the combination of a simple GA inversion with the widely used HYPO71 program to find the best three-layer model (upper crust, lower crust, and upper mantle) by minimizing the overall P- and S-arrival residuals, using local and regional earthquakes in two areas of the Brazilian shield. Results from the Tocantins Province (Central Brazil) and the southern border of the Sao Francisco craton (SE Brazil) indicated an average crustal thickness of 38 and 43 km, respectively, consistent with previous estimates from receiver functions and seismic refraction lines. The GA + HYPO71 inversion produced correct Vp/Vs ratios (1.73 and 1.71, respectively), as expected from Wadati diagrams. Tests with synthetic data showed that the method is robust for the crustal thickness, Pn velocity, and Vp/Vs ratio when using events with distance up to about 400 km, despite the small number of events available (7 and 22, respectively). The velocities of the upper and lower crusts, however, are less well constrained. Interestingly, in the Tocantins Province, the GA + HYPO71 inversion showed a secondary solution (local minimum) for the average crustal thickness, besides the global minimum solution, which was caused by the existence of two distinct domains in the Central Brazil with very different crustal thicknesses. (C) 2010 Elsevier Ltd. All rights reserved.