132 resultados para Pure error
Resumo:
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.
Resumo:
We report a novel 1D J-edited pure shift NMR experiment (J-PSHIFT) that was constructed from a pseudo 2D experiment for the direct measurement of proton-proton scalar couplings. The experiment gives homonuclear broad-band H-1-decoupled H-1 NMR spectra, which provide a single peak for chemically distinct protons, and only retain the homonuclear-scalar-coupled doublet pattern at the chemical-shift positions of the protons in the coupled network of a specific proton. This permits the direct and unambiguous measurement of the magnitudes of the couplings. The incorporation of a 1D selective correlation spectroscopy (COSY)/ total correlation spectroscopy (TOCSY) block in lieu of the initial selective pulse, results in the exclusive detection of the correlated spectrum of a specific proton.
Resumo:
This paper deals with dynamic recrystallization (DRX), static recrystallization, and grain growth phenomena of pure magnesium after equal channel angular pressing (ECAP) by route A and B-C at 523 K (250 A degrees C) followed by 80 pct cold rolling. The ECAP-deformed and the subsequently rolled samples were annealed at 373 K and 773 K (100 A degrees C and 500 A degrees C). The associated changes in the microstructure and texture were studied using electron back-scattered diffraction. ECAP produced an average grain size of 12 to 18 A mu m with B and C-2 fiber textures. Subsequent rolling led to an average grain size 8 to 10 A mu m with basal texture fiber parallel to ND. There was no noticeable increase in the average grain size on annealing at 373 K (100 A degrees C). However, significant increase in the average grain size occurred at 773 K (500 A degrees C). The occurrence of different DRX mechanisms was detected: discontinuous dynamic recrystallization was attributed to basal slip activity and continuous dynamic recovery and recrystallization to prismatic/pyramidal slip systems. Only continuous static recrystallization could be observed on annealing.
Resumo:
A residual based a posteriori error estimator is derived for a quadratic finite element method (FEM) for the elliptic obstacle problem. The error estimator involves various residuals consisting of the data of the problem, discrete solution and a Lagrange multiplier related to the obstacle constraint. The choice of the discrete Lagrange multiplier yields an error estimator that is comparable with the error estimator in the case of linear FEM. Further, an a priori error estimate is derived to show that the discrete Lagrange multiplier converges at the same rate as that of the discrete solution of the obstacle problem. The numerical experiments of adaptive FEM show optimal order convergence. This demonstrates that the quadratic FEM for obstacle problem exhibits optimal performance.
Resumo:
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.
Resumo:
The present study focuses on exploring air-assisted atomization strategies for effective atomization of high-viscosity biofuels, such as pure plant oils (PPOs). The first part of the study concerns application of a novel air-assisted impinging jet atomization for continuous spray applications, and the second part concerns transient spray applications. The particle/droplet imaging analysis (PDIA) technique along with direct imaging methods are used for the purpose of spray characterization. In the first part, effective atomization of Jatropha PPO is demonstrated at gas-to-liquid ratios (GLRs) on the order 0.1. The effect of liquid and gas flow rates on the spray characteristics is evaluated, and results indicate a Sauter mean diameter (SMD) of 50 mu m is achieved with GLRs as low as 0.05. In the second part of the study, a commercially available air-assisted transient atomizer is evaluated using Jatropha PPO. The effect of the pressure difference across the air injector and ambient gas pressure on liquid spray characteristics is studied. The results indicate that it is possible to achieve the same level of atomization of Jatropha as diesel fuel by operating the atomizer at a higher pressure difference. Specifically, a SMD of 44 mu m is obtained for the Jatropha oil using injection pressures of <1 MPa. A further interesting observation associated with this injector is the near constancy of a nondimensional spray penetration rate for the Jatropha oil spray.
Resumo:
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.
Resumo:
Increasing the mutation rate, mu, of viruses above a threshold, mu(c), has been predicted to trigger a catastrophic loss of viral genetic information and is being explored as a novel intervention strategy. Here, we examine the dynamics of this transition using stochastic simulations mimicking within-host HIV-1 evolution. We find a scaling law governing the characteristic time of the transition: tau approximate to 0.6/(mu - mu(c)). The law is robust to variations in underlying evolutionary forces and presents guidelines for treatment of HIV-1 infection with mutagens. We estimate that many years of treatment would be required before HIV-1 can suffer an error catastrophe.
Resumo:
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.
Resumo:
In this article, an abstract framework for the error analysis of discontinuous Galerkin methods for control constrained optimal control problems is developed. The analysis establishes the best approximation result from a priori analysis point of view and delivers a reliable and efficient a posteriori error estimator. The results are applicable to a variety of problems just under the minimal regularity possessed by the well-posedness of the problem. Subsequently, the applications of C-0 interior penalty methods for a boundary control problem as well as a distributed control problem governed by the biharmonic equation subject to simply supported boundary conditions are discussed through the abstract analysis. Numerical experiments illustrate the theoretical findings.
Resumo:
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.
Resumo:
The functional source coding problem in which the receiver side information (Has-set) and demands (Want-set) include functions of source messages is studied using row-Latin rectangle. The source transmits encoded messages, called the functional source code, in order to satisfy the receiver's demands. We obtain a minimum length using the row-Latin rectangle. Next, we consider the case of transmission errors and provide a necessary and sufficient condition that a functional source code must satisfy so that the receiver can correctly decode the values of the functions in its Want-set.