A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.

An encaged sigma* orbital in 3-methoxy-2,4,10-trioxaadamantane. Preferred exo-anomeric effect as revealed by the crystal structure

In the titled tricyclic orthocarbonate derivative, the three endocyclic C-O bonds are longer than the exo-cyclic C-O bond (similar to 4.40 angstrom vs. similar to 1.37 angstrom). This indicates an anomeric-type interaction between the two electron lone pairs on the exocyclic oxygen atom and the antibonding orbitals of the two antiperiplanar endocyclic C-O bonds. The remaining endocyclic C-O bond - marginally shorter than the other two apparently adds to this effect. Intriguingly, the antibonding orbital of the exocyclic C-O bond extends into the interior of the adamantyl cage, and is stereoelectronically prevented from overlapping with any of the six adjacent lone pairs. The results also seem to indicate a preference for interaction between a single donor oxygen atom and multiple acceptor antibonding orbitals rather than vice versa. The results add insightfully to the substantial body of evidence favouring the antiperiplanar lone pair hypothesis (ALPH). (C) 2014 Elsevier B.V. All rights reserved.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Implication of a sigma-Methane Complex en Route to Elimination of Methane from a Ruthenium Complex: An Experimental and Theoretical Investigation

The five-coordinated 16-electron complex Ru(Me)(dppe)(2)]OTf] (3) undergoes methane elimination at room temperature to afford the ortho-metalated species (dppe){(C6H5)(C6H4)PCH2CH2P(C6H5)(2)}Ru]OTf] (7). Methane elimination, monitored using NMR spectroscopy, revealed no intermediate throughout the reaction. The NOE between Ru-Me protons and ortho phenyl protons and an agostic interaction trans to the methyl group were found in complex 3 by NMR spectroscopy, which form the basis for three plausible pathways for methane elimination and ortho metalation: pathway I (through spatial interaction), pathway II (through oxidative addition and reductive elimination), and pathway III (through agostic interaction). Methane elimination from complex 3 via pathway I was discounted, since it involves interactions through space and not through bonds. Moreover, the calculated energy barrier for the pathway I transition state was quite high (71.3 kcal/mol), which also indicates that this pathway is very unlikely. Furthermore, no spectroscopic evidence for oxidatively added seven-coordinated Ru(IV) species was found and the computed energy barrier of the transition state for pathway II was moderately high (41.1 kcal/mol), which suggests that this cannot be the right pathway for methane elimination and ortho-metalation of complex 3. On the other hand, indirect evidence in the form of chemical reactions point to the most plausible pathway for methane elimination, pathway III, via the intermediacy of a sigma-CH4 complex that could not be found spectroscopically. DFT calculations at several levels on this pathway showed an initial low-barrier rearrangement through TS1 to a square-pyramidal intermediate wherein methyl and agostic C-H are cis to each other. Migration of hydrogen from agostic C-H and elimination of methane proceed through the transition state TS2, which retains a weak metal-H bonding through most parts of the reaction coordinate. Upon comparison of all three pathways, pathway III was found to be the most likely for methane elimination and ortho-metalation of complex 3.

A Remark on the A Posteriori Error Analysis of Discontinuous Galerkin Methods for the Obstacle Problem

We revisit the a posteriori error analysis of discontinuous Galerkin methods for the obstacle problem derived in 25]. Under a mild assumption on the trace of obstacle, we derive a reliable a posteriori error estimator which does not involve min/max functions. A key in this approach is an auxiliary problem with discrete obstacle. Applications to various discontinuous Galerkin finite element methods are presented. Numerical experiments show that the new estimator obtained in this article performs better.

Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

Crystallographic studies of the extracytoplasmic function sigma factor sigma(J) from Mycobacterium tuberculosis

Mycobacterium tuberculosis has multiple sigma factors which enable the bacterium to reprogram its transcriptional machinery under diverse environmental conditions. sigma(J), an extracytoplasmic function sigma factor, is upregulated in late stationary phase cultures and during human macrophage infection. sigma(J) governs the cellular response to hydrogen peroxide-mediated oxidative stress. sigma(J) differs from other canonical sigma factors owing to the presence of a SnoaL_2 domain at the C-terminus. sigma(J) crystals belonged to the tetragonal space group I422, with unit-cell parameters a = b = 133.85, c = 75.08 angstrom. Diffraction data were collected to 2.16 angstrom resolution on the BM14 beamline at the European Synchrotron Radiation Facility (ESRF).

An Unbiased Risk Estimator for Multiplicative Noise - Application to 1-D Signal Denoising

The effect of multiplicative noise on a signal when compared with that of additive noise is very large. In this paper, we address the problem of suppressing multiplicative noise in one-dimensional signals. To deal with signals that are corrupted with multiplicative noise, we propose a denoising algorithm based on minimization of an unbiased estimator (MURE) of meansquare error (MSE). We derive an expression for an unbiased estimate of the MSE. The proposed denoising is carried out in wavelet domain (soft thresholding) by considering time-domain MURE. The parameters of thresholding function are obtained by minimizing the unbiased estimator MURE. We show that the parameters for optimal MURE are very close to the optimal parameters considering the oracle MSE. Experiments show that the SNR improvement for the proposed denoising algorithm is competitive with a state-of-the-art method.

A posteriori error estimates of discontinuous Galerkin methods for the Signorini problem

A reliable and efficient a posteriori error estimator is derived for a class of discontinuous Galerkin (DG) methods for the Signorini problem. A common property shared by many DG methods leads to a unified error analysis with the help of a constraint preserving enriching map. The error estimator of DG methods is comparable with the error estimator of the conforming methods. Numerical experiments illustrate the performance of the error estimator. (C) 2015 Elsevier B.V. All rights reserved.

Error exponent analysis of energy-based Bayesian decentralized spectrum sensing under fading

This paper considers decentralized spectrum sensing, i.e., detection of occupancy of the primary users' spectrum by a set of Cognitive Radio (CR) nodes, under a Bayesian set-up. The nodes use energy detection to make their individual decisions, which are combined at a Fusion Center (FC) using the K-out-of-N fusion rule. The channel from the primary transmitter to the CR nodes is assumed to undergo fading, while that from the nodes to the FC is assumed to be error-free. In this scenario, a novel concept termed as the Error Exponent with a Confidence Level (EECL) is introduced to evaluate and compare the performance of different detection schemes. Expressions for the EECL under general fading conditions are derived. As a special case, it is shown that the conventional error exponent both at individual sensors, and at the FC is zero. Further, closed-form lower bounds on the EECL are derived under Rayleigh fading and lognormal shadowing. As an example application, it answers the question of whether to use pilot-signal based narrowband sensing, where the signal undergoes Rayleigh fading, or to sense over the entire bandwidth of a wideband signal, where the signal undergoes lognormal shadowing. Theoretical results are validated using Monte Carlo simulations. (C) 2015 Elsevier B.V. All rights reserved.