Recompression: Technique for Word Equations and Compressed Data
Ontology highlight
ABSTRACT:
SUBMITTER: Leporati A
PROVIDER: S-EPMC7206631 | biostudies-literature | 2020 Jan
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:In 2005, we reported evidence indicating that upcoming phonological word forms-e.g., kite vs. airplane-were predicted during reading. We recorded brainwaves (electroencephalograms [EEGs]) as people read word-by-word and then correlated the predictability in context of indefinite articles that preceded nouns ( a kite vs. an airplane) with the average event-related brain potentials (ERPs) they elicited [K. A. DeLong, T. P. Urbach, M. Kutas, Nat. Neurosci. 8, 1117-1121 (2005)]. Amid a broader controversy about the role of word-form prediction in comprehension, those findings were recently challenged by a failed putative direct replication attempt [M. S. Nieuwland et al., eLife 7, e33468 (2018); nine labs, one experiment, and 2.6e4 observations]. To better understand the empirical justification for positing an association between prenominal article predictability and scalp potentials, we conducted a wide-ranging exploratory data analysis (EDA), pooling our original data with extant data from two followup studies (one lab, three experiments, and 1.2e4 observations). We modeled the time course of article predictability in the single-trial data by fitting linear mixed-effects regression (LMER) models at each time point and scalp location spanning a 3-s interval before, during, and after the article. Model comparisons based on Akaike information criteria (AIC) and slope-regression ERPs [rERPs; N. J. Smith, M. Kutas, Psychophysiology 52, 157-168 (2015)] provide substantial empirical support for a small positive association between article predictability and scalp potentials approximately 300 to 500 ms after article onset, predominantly over bilateral posterior scalp. We think this effect may reasonably be attributed to prediction of upcoming word forms.
| S-EPMC7456118 | biostudies-literature
Project description:We propose a sparse regression method capable of discovering the governing partial differential equation(s) of a given system by time series measurements in the spatial domain. The regression framework relies on sparsity-promoting techniques to select the nonlinear and partial derivative terms of the governing equations that most accurately represent the data, bypassing a combinatorially large search through all possible candidate models. The method balances model complexity and regression accuracy by selecting a parsimonious model via Pareto analysis. Time series measurements can be made in an Eulerian framework, where the sensors are fixed spatially, or in a Lagrangian framework, where the sensors move with the dynamics. The method is computationally efficient, robust, and demonstrated to work on a variety of canonical problems spanning a number of scientific domains including Navier-Stokes, the quantum harmonic oscillator, and the diffusion equation. Moreover, the method is capable of disambiguating between potentially nonunique dynamical terms by using multiple time series taken with different initial data. Thus, for a traveling wave, the method can distinguish between a linear wave equation and the Korteweg-de Vries equation, for instance. The method provides a promising new technique for discovering governing equations and physical laws in parameterized spatiotemporal systems, where first-principles derivations are intractable.
| S-EPMC5406137 | biostudies-literature
Project description:The paper deals with the oscillation of the first-order linear difference equation with deviating argument and nonnegative coefficients. New sufficient oscillation conditions, involving limsup, are given, which essentially improve all known results, based on an iterative technique. We illustrate the results and the improvement over other known oscillation criteria by examples, numerically solved in Matlab.
| S-EPMC5529606 | biostudies-other
Project description:The numerical solution of partial differential equations (PDEs) is challenging because of the need to resolve spatiotemporal features over wide length- and timescales. Often, it is computationally intractable to resolve the finest features in the solution. The only recourse is to use approximate coarse-grained representations, which aim to accurately represent long-wavelength dynamics while properly accounting for unresolved small-scale physics. Deriving such coarse-grained equations is notoriously difficult and often ad hoc. Here we introduce data-driven discretization, a method for learning optimized approximations to PDEs based on actual solutions to the known underlying equations. Our approach uses neural networks to estimate spatial derivatives, which are optimized end to end to best satisfy the equations on a low-resolution grid. The resulting numerical methods are remarkably accurate, allowing us to integrate in time a collection of nonlinear equations in 1 spatial dimension at resolutions 4× to 8× coarser than is possible with standard finite-difference methods.
| S-EPMC6681734 | biostudies-literature
Project description:The discovery of governing equations from scientific data has the potential to transform data-rich fields that lack well-characterized quantitative descriptions. Advances in sparse regression are currently enabling the tractable identification of both the structure and parameters of a nonlinear dynamical system from data. The resulting models have the fewest terms necessary to describe the dynamics, balancing model complexity with descriptive ability, and thus promoting interpretability and generalizability. This provides an algorithmic approach to Occam's razor for model discovery. However, this approach fundamentally relies on an effective coordinate system in which the dynamics have a simple representation. In this work, we design a custom deep autoencoder network to discover a coordinate transformation into a reduced space where the dynamics may be sparsely represented. Thus, we simultaneously learn the governing equations and the associated coordinate system. We demonstrate this approach on several example high-dimensional systems with low-dimensional behavior. The resulting modeling framework combines the strengths of deep neural networks for flexible representation and sparse identification of nonlinear dynamics (SINDy) for parsimonious models. This method places the discovery of coordinates and models on an equal footing.
| S-EPMC6842598 | biostudies-literature
Project description:ObjectivesAcceleration of MR sequences beyond current parallel imaging techniques is possible with the Compressed SENSE technique that has recently become available for 1.5 and 3 Tesla scanners, for nearly all image contrasts and for 2D and 3D sequences. The impact of this technique on examination timing parameters and MR protocols in a clinical setting was investigated in this retrospective study.Material and methodsA numerical analysis of the examination timing parameters (scan time, exam time, procedure time, interscan delay time, changeover time, nonscan time) based on the MR protocols of 6 different body regions (brain, knee, lumbar spine, breast, shoulder) using MR log files was performed and the total number of examinations acquired from January to April both in 2017 and 2018 on a 1.5 T MR scanner was registered. Percentages, box plots and unpaired two-sided t tests were obtained for statistical evaluation.ResultsAll examination timing parameters of the six anatomical regions analysed were significantly shortened after implementation of Compressed SENSE. On average, scan times were accelerated by 20.2% (p<0.0001) while procedure times were shortened by 16% (p<0.0001). Considering all anatomical regions and all MR protocols, 27% more examinations were performed over the same 4 month period in 2018 compared to 2017.ConclusionCompressed SENSE allows for a significant acceleration of MR examinations and a considerable increase in the total number of MR examinations is possible.
| S-EPMC6461228 | biostudies-literature
Project description:Murine primary rib-cage chondrocytes (mRCs) were isolated from E15.5 WT and HS-deficient Ext1gt/gt mice and expanded for 6-7 days. Tissue-engineered cartilage was generated by a 14-day chondrogenic culture of mRCs at 5×10^5 cells per 25 µl agarose carrier. Engineered cartilage was exposed to cyclic unconfined compression for 3 hours: 10-minute cycles of dynamic unconfined compression (25 % dynamic compression at 1 Hz superimposed to 10 % static off-set) were intermitted by 10-minute breaks (10 % static off-set).
2021-03-14 | E-MTAB-10258 | biostudies-arrayexpress
Project description:We develop an empirical likelihood (EL) inference on parameters in generalized estimating equations with nonignorably missing response data. We consider an exponential tilting model for the nonignorably missing mechanism, and propose modified estimating equations by imputing missing data through a kernel regression method. We establish some asymptotic properties of the EL estimators of the unknown parameters under different scenarios. With the use of auxiliary information, the EL estimators are statistically more efficient. Simulation studies are used to assess the finite sample performance of our proposed EL estimators. We apply our EL estimators to investigate a data set on earnings obtained from the New York Social Indicators Survey.
| S-EPMC4071774 | biostudies-literature
Project description:De novo genome sequence assembly is important both to generate new sequence assemblies for previously uncharacterized genomes and to identify the genome sequence of individuals in a reference-unbiased way. We present memory efficient data structures and algorithms for assembly using the FM-index derived from the compressed Burrows-Wheeler transform, and a new assembler based on these called SGA (String Graph Assembler). We describe algorithms to error-correct, assemble, and scaffold large sets of sequence data. SGA uses the overlap-based string graph model of assembly, unlike most de novo assemblers that rely on de Bruijn graphs, and is simply parallelizable. We demonstrate the error correction and assembly performance of SGA on 1.2 billion sequence reads from a human genome, which we are able to assemble using 54 GB of memory. The resulting contigs are highly accurate and contiguous, while covering 95% of the reference genome (excluding contigs <200 bp in length). Because of the low memory requirements and parallelization without requiring inter-process communication, SGA provides the first practical assembler to our knowledge for a mammalian-sized genome on a low-end computing cluster.
| S-EPMC3290790 | biostudies-literature