Computationally Relaxed Locally Decodable Codes, Revisited

We revisit computationally relaxed locally decodable codes (crLDCs) (Blocki et al., Trans. Inf. Theory '21) and give two new constructions. Our first construction is a Hamming crLDC that is conceptually simpler than prior constructions, leveraging digital signature schemes and an appropriately chosen Hamming code. Our second construction is an extension of our Hamming crLDC to handle insertion-deletion (InsDel) errors, yielding an InsDel crLDC. This extension crucially relies on the noisy binary search techniques of Block et al. (FSTTCS '20) to handle InsDel errors. Both crLDC constructions have binary codeword alphabets, are resilient to a constant fraction of Hamming and InsDel errors, respectively, and under suitable parameter choices have poly-logarithmic locality and encoding length linear in the message length and polynomial in the security parameter. These parameters compare favorably to prior constructions in the poly-logarithmic locality regime

Pulsational Analysis of the Cores of Massive Stars and its Relevance to Pulsar Kicks

The mechanism responsible for the natal kicks of neutron stars continues to be a challenging problem. Indeed, many mechanisms have been suggested, and one hydrodynamic mechanism may require large initial asymmetries in the cores of supernova progenitor stars. Goldreich, Lai, & Sahrling (1997) suggested that unstable g-modes trapped in the iron (Fe) core by the convective burning layers and excited by the $\epsilon$-mechanism may provide the requisite asymmetries. We perform a modal analysis of the last minutes before collapse of published core structures and derive eigenfrequencies and eigenfunctions, including the nonadiabatic effects of growth by nuclear burning and decay by both neutrino and acoustic losses. In general, we find two types of g-modes: inner-core g-modes, which are stabilized by neutrino losses and outer-core g-modes which are trapped near the burning shells and can be unstable. Without exception, we find at least one unstable g-mode for each progenitor in the entire mass range we consider, 11 M_{\sun} to 40 M_{\sun}. More importantly, we find that the timescales for growth and decay are an order of magnitude or more longer than the time until the commencement of core collapse. We conclude that the $\epsilon$-mechanism may not have enough time to significantly amplify core g-modes prior to collapse.Comment: 32 pages including 12 color figures and 2 tables, submitted to Ap

Locally Decodable/Correctable Codes for Insertions and Deletions

Recent efforts in coding theory have focused on building codes for insertions and deletions, called insdel codes, with optimal trade-offs between their redundancy and their error-correction capabilities, as well as efficient encoding and decoding algorithms. In many applications, polynomial running time may still be prohibitively expensive, which has motivated the study of codes with super-efficient decoding algorithms. These have led to the well-studied notions of Locally Decodable Codes (LDCs) and Locally Correctable Codes (LCCs). Inspired by these notions, Ostrovsky and Paskin-Cherniavsky (Information Theoretic Security, 2015) generalized Hamming LDCs to insertions and deletions. To the best of our knowledge, these are the only known results that study the analogues of Hamming LDCs in channels performing insertions and deletions. Here we continue the study of insdel codes that admit local algorithms. Specifically, we reprove the results of Ostrovsky and Paskin-Cherniavsky for insdel LDCs using a different set of techniques. We also observe that the techniques extend to constructions of LCCs. Specifically, we obtain insdel LDCs and LCCs from their Hamming LDCs and LCCs analogues, respectively. The rate and error-correction capability blow up only by a constant factor, while the query complexity blows up by a poly log factor in the block length. Since insdel locally decodable/correctble codes are scarcely studied in the literature, we believe our results and techniques may lead to further research. In particular, we conjecture that constant-query insdel LDCs/LCCs do not exist

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes

We formally introduce, define, and construct memory-hard puzzles. Intuitively, for a difficulty parameter $t$, a cryptographic puzzle is memory-hard if any parallel random access machine (PRAM) algorithm with small cumulative memory complexity ($\ll t^2$) cannot solve the puzzle; moreover, such puzzles should be both easy to generate and be solvable by a sequential RAM algorithm running in time $t$. Our definitions and constructions of memory-hard puzzles are in the standard model, assuming the existence of indistinguishability obfuscation ($i\mathcal{O}$) and one-way functions (OWFs), and additionally assuming the existence of a memory-hard language. Intuitively, a language is memory-hard if it is undecidable by any PRAM algorithm with small cumulative memory complexity, while a sequential RAM algorithm running in time $t$ can decide the language. Our definitions and constructions of memory-hard objects are the first such definitions and constructions in the standard model without relying on idealized assumptions (such as random oracles). We give two applications which highlight the utility of memory-hard puzzles. For our first application, we give a construction of a (one-time) memory-hard function (MHF) in the standard model, using memory-hard puzzles and additionally assuming $i\mathcal{O}$ and OWFs. For our second application, we show any cryptographic puzzle (e.g., memory-hard, time-lock) can be used to construct resource-bounded locally decodable codes (LDCs) in the standard model, answering an open question of Blocki, Kulkarni, and Zhou (ITC 2020). Resource-bounded LDCs achieve better rate and locality than their classical counterparts under the assumption that the adversarial channel is resource bounded (e.g., a low-depth circuit). Prior constructions of MHFs and resource-bounded LDCs required idealized primitives like random oracles

Upland Habitat Quality and Historic Landscape Composition Influence Genetic Variation of a Pond-Breeding Salamander

Understanding the temporal and spatial scale at which habitat alteration impacts populations is important for conservation and management. Amphibians have declined more than other vertebrates, and pond-breeding species are particularly susceptible to habitat loss and fragmentation because they have terrestrial and aquatic life stages. One approach to management of pond-breeding species is protection of core upland habitat surrounding the breeding pond. We used genetic variation as an indicator of population status in a common amphibian species, spotted salamanders (Ambystoma maculatum), to determine how amount of suitable upland habitat relates to population status in the greater Charlotte, North Carolina, USA metropolitan area. We developed candidate models to evaluate the relative influence of historical and contemporary forested habitat availability on population genetic variation at two spatial scales of upland area (164 m and 2000 m) at four time intervals over the past seven decades (1938, 1978, 1993, 2005). We found that historical land cover best predicted contemporary allelic richness. Inbreeding coefficient and observed heterozygosity were not effectively predicted by forest cover at either spatial or temporal scales. Allelic richness was best predicted at the smaller spatial scale in the 1993 time interval. Predicting and understanding how future landscape configuration affects genetic variation of common and rare species is imperative for the conservation of amphibian and other wildlife populations

Integration of protein phosphorylation, acetylation, and methylation data sets to outline lung cancer signaling networks

Integrated multiomics network analysis reveals signaling profiles in lung cancer.</jats:p

The Fifth Data Release of the Sloan Digital Sky Survey

This paper describes the Fifth Data Release (DR5) of the Sloan Digital Sky Survey (SDSS). DR5 includes all survey quality data taken through June 2005 and represents the completion of the SDSS-I project (whose successor, SDSS-II will continue through mid-2008). It includes five-band photometric data for 217 million objects selected over 8000 square degrees, and 1,048,960 spectra of galaxies, quasars, and stars selected from 5713 square degrees of that imaging data. These numbers represent a roughly 20% increment over those of the Fourth Data Release; all the data from previous data releases are included in the present release. In addition to "standard" SDSS observations, DR5 includes repeat scans of the southern equatorial stripe, imaging scans across M31 and the core of the Perseus cluster of galaxies, and the first spectroscopic data from SEGUE, a survey to explore the kinematics and chemical evolution of the Galaxy. The catalog database incorporates several new features, including photometric redshifts of galaxies, tables of matched objects in overlap regions of the imaging survey, and tools that allow precise computations of survey geometry for statistical investigations.Comment: ApJ Supp, in press, October 2007. This paper describes DR5. The SDSS Sixth Data Release (DR6) is now public, available from http://www.sdss.or

US Cosmic Visions: New Ideas in Dark Matter 2017: Community Report

This white paper summarizes the workshop "U.S. Cosmic Visions: New Ideas in Dark Matter" held at University of Maryland on March 23-25, 2017.Comment: 102 pages + reference

The Seventh Data Release of the Sloan Digital Sky Survey

This paper describes the Seventh Data Release of the Sloan Digital Sky Survey (SDSS), marking the completion of the original goals of the SDSS and the end of the phase known as SDSS-II. It includes 11663 deg^2 of imaging data, with most of the roughly 2000 deg^2 increment over the previous data release lying in regions of low Galactic latitude. The catalog contains five-band photometry for 357 million distinct objects. The survey also includes repeat photometry over 250 deg^2 along the Celestial Equator in the Southern Galactic Cap. A coaddition of these data goes roughly two magnitudes fainter than the main survey. The spectroscopy is now complete over a contiguous area of 7500 deg^2 in the Northern Galactic Cap, closing the gap that was present in previous data releases. There are over 1.6 million spectra in total, including 930,000 galaxies, 120,000 quasars, and 460,000 stars. The data release includes improved stellar photometry at low Galactic latitude. The astrometry has all been recalibrated with the second version of the USNO CCD Astrograph Catalog (UCAC-2), reducing the rms statistical errors at the bright end to 45 milli-arcseconds per coordinate. A systematic error in bright galaxy photometr is less severe than previously reported for the majority of galaxies. Finally, we describe a series of improvements to the spectroscopic reductions, including better flat-fielding and improved wavelength calibration at the blue end, better processing of objects with extremely strong narrow emission lines, and an improved determination of stellar metallicities. (Abridged)Comment: 20 pages, 10 embedded figures. Accepted to ApJS after minor correction