784 research outputs found

    Resources and student achievement – evidence from a Swedish policy reform

    Get PDF
    This paper utilizes a policy change to estimate the effect of teacher density on student performance. We find that an increase in teacher density has a positive effect on student achievement. The baseline estimate – obtained by using the grade point average as the outcome variable – implies that resource increases corresponding to the class-size reduction in the STAR-experiment (i.e., a reduction of 7 students) improves performance by 2.6 percentile ranks (or 0.08 standard deviations). When we use test score data for men, potentially a more objective measure of student performance, the effect of resources appears to be twice the size of the baseline estimate.Student performance; teacher/student ratio; policy reform; differences-in-differences

    Continuous Transmission of Spatially Coupled LDPC Code Chains

    Get PDF
    We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially coupled low-density parity-check (SC-LDPC) codes. In CC transmission, instead of transmitting a sequence of independent code words from a terminated SC-LDPC code chain, we connect multiple chains in a layered format, where encoding, transmission, and decoding are performed in a continuous fashion. The connections between chains are created at specific points, chosen to improve the finite-length performance of the code structure under iterative decoding. We describe the design of CC schemes for different SC-LDPC code ensembles constructed from protographs: a (J,K) -regular SC-LDPC code chain, a spatially coupled repeat-accumulate (SC-RA) code, and a spatially coupled accumulate-repeat-jagged-accumulate (SC-ARJA) code. In all cases, significant performance improvements are reported and it is shown that using CC transmission only requires a small increase in decoding complexity and decoding delay with respect to a system employing a single SC-LDPC code chain for transmission.This material is based upon work supported in part by the National Science Foundation under Grant Nos. CCF-1161754 and CCSS-1710920, in part by NSERC Canada, and in part by the Spanish Ministry of Economy and Competitiveness and the Spanish National Research Agency under grants TEC2016-78434-C3-3-R (AEI/FEDER, EU) and Juan de la Cierva Fellowship IJCI-2014-19150

    Spatially coupled generalized LDPC codes: asymptotic analysis and finite length scaling

    Get PDF
    Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result in improved error floor performance, due to better minimum distance and trapping set properties, at a cost of some increased decoding complexity. In this paper, we study spatially coupled generalized low-density parity-check (SC-GLDPC) codes and present a comprehensive analysis of these codes, including: (1) an iterative decoding threshold analysis of SC-GLDPC code ensembles demonstrating capacity approaching thresholds via the threshold saturation effect; (2) an asymptotic analysis of the minimum distance and free distance properties of SC-GLDPC code ensembles, demonstrating that the ensembles are asymptotically good; and (3) an analysis of the finite-length scaling behavior of both GLDPC block codes and SC-GLDPC codes based on a peeling decoder (PD) operating on a binary erasure channel (BEC). Results are compared to GLDPC block codes, and the advantages and disadvantages of SC-GLDPC codes are discussed.This work was supported in part by the National Science Foundation under Grant ECCS-1710920, Grant OIA-1757207, and Grant HRD-1914635; in part by the European Research Council (ERC) through the European Union's Horizon 2020 research and innovation program under Grant 714161; and in part by the Spanish Ministry of Science, Innovation and University under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU)

    Randomly Punctured LDPC Codes

    Get PDF
    In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary- input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of the mother code ensemble on the BEC and the design rate, and we show how the prediction can be improved with knowledge of the BI-AWGNC threshold. We also perform an asymptotic minimum distance analysis of randomly punctured code ensembles and present simulation results that confirm the robust decoding performance promised by the asymptotic results. Protograph-based LDPC block code and spatially coupled LDPC code ensembles are used throughout as examples to demonstrate the results

    Randomly Punctured Spatially Coupled LDPC Codes

    Get PDF
    In this paper, we study random puncturing of protograph-based spatially coupled low-density parity-check (SC- LDPC) code ensembles. We show that, with respect to iterative decoding threshold, the strength and suitability of an LDPC code ensemble for random puncturing over the binary erasure channel (BEC) is completely determined by a single constant that depends only on the rate and iterative decoding threshold of the mother code ensemble. We then use this analysis to show that randomly punctured SC-LDPC code ensembles display near capacity thresholds for a wide range of rates. We also perform an asymptotic minimum distance analysis and show that, like the SC-LDPC mother code ensemble, the punctured SC-LDPC code ensembles are also asymptotically good. Finally, we present some simulation results that confirm the excellent decoding performance promised by the asymptotic results

    Field-driven solid-on-solid interfaces moving under a stochastic Arrhenius dynamic: effects of the barrier height

    Full text link
    We present analytical results and kinetic Monte Carlo simulations for the mobility and microscopic structure of solid-on-solid (SOS) interfaces driven far from equilibrium by an external force, such as an applied field or (electro)chemical potential difference. The interfaces evolve under a specific stochastic dynamic with a local energy barrier (an Arrhenius dynamic), known as the transition dynamics approximation (TDA). We calculate the average height of steps on the interface, the average interface velocity, and the skewness of the interface as functions of the driving force and the height of the energy barrier. We find that the microscopic interface structure depends quite strongly on the barrier height. As the barrier becomes higher, the local interface width decreases and the skewness increases, suggesting increasing short-range correlations between the step heights.Comment: 6 pages, 5 figs. RevTe

    Fluid loading on fixed offshore structures

    Get PDF
    This document reviews the experimental work performed on wave particle kinematics and fluid loading in the context of the design of fixed offshore structures. It compares various methods (spectral, deterministic etc) of estimating loading conditions for extreme and fatigue strength calculations and describes the sensitivity of the calculations to various fluid loading parameters

    Interpolatory methods for H\mathcal{H}_\infty model reduction of multi-input/multi-output systems

    Full text link
    We develop here a computationally effective approach for producing high-quality H\mathcal{H}_\infty-approximations to large scale linear dynamical systems having multiple inputs and multiple outputs (MIMO). We extend an approach for H\mathcal{H}_\infty model reduction introduced by Flagg, Beattie, and Gugercin for the single-input/single-output (SISO) setting, which combined ideas originating in interpolatory H2\mathcal{H}_2-optimal model reduction with complex Chebyshev approximation. Retaining this framework, our approach to the MIMO problem has its principal computational cost dominated by (sparse) linear solves, and so it can remain an effective strategy in many large-scale settings. We are able to avoid computationally demanding H\mathcal{H}_\infty norm calculations that are normally required to monitor progress within each optimization cycle through the use of "data-driven" rational approximations that are built upon previously computed function samples. Numerical examples are included that illustrate our approach. We produce high fidelity reduced models having consistently better H\mathcal{H}_\infty performance than models produced via balanced truncation; these models often are as good as (and occasionally better than) models produced using optimal Hankel norm approximation as well. In all cases considered, the method described here produces reduced models at far lower cost than is possible with either balanced truncation or optimal Hankel norm approximation

    Fluctuations in viscous fingering

    Full text link
    Our experiments on viscous (Saffman-Taylor) fingering in Hele-Shaw channels reveal finger width fluctuations that were not observed in previous experiments, which had lower aspect ratios and higher capillary numbers Ca. These fluctuations intermittently narrow the finger from its expected width. The magnitude of these fluctuations is described by a power law, Ca^{-0.64}, which holds for all aspect ratios studied up to the onset of tip instabilities. Further, for large aspect ratios, the mean finger width exhibits a maximum as Ca is decreased instead of the predicted monotonic increase.Comment: Revised introduction, smoothed transitions in paper body, and added a few additional minor results. (Figures unchanged.) 4 pages, 3 figures. Submitted to PRE Rapi

    Low dose Naltrexone for induction of remission in inflammatory bowel disease patients

    Get PDF
    Background: Around 30% of patients with inflammatory bowel disease (IBD) are refractory to current IBD drugs or relapse over time. Novel treatments are called for, and low dose Naltrexone (LDN) may provide a safe, easily accessible alternative treatment option for these patients. We investigated the potential of LDN to induce clinical response in therapy refractory IBD patients, and investigated its direct effects on epithelial barrier function. Methods: Patients not in remission and not responding to conventional therapy were offered to initiate LDN as a concomitant treatment. In total 47 IBD patients prescribed LDN were followed prospectively for 12 weeks. Where available, endoscopic remission data, serum and biopsies were collected. Further the effect of Naltrexone on wound healing (scratch assay), cytokine production and endoplasmic reticulum (ER) stress (GRP78 and CHOP western blot analysis, immunohistochemistry) were investigated in HCT116 and CACO2 intestinal epithelial cells, human IBD intestinal organoids and patient samples. Results: Low dose Naltrexone induce
    corecore