cssi/SciSciGPT-SciSciNet huggingface dataset:
Nearly optimal static Las Vegas succinct dictionary

Given a set S of n (distinct) keys from key space [U], each associated with a value from Σ, the static dictionary problem asks to preprocess these (key, value) pairs into a data structure, supporting value-retrieval queries: for any given x∈ [U], valRet(x) must return the value associated with x if x∈ S, or return ⊥ if x∉ S. The special case where |Σ|=1 is called the membership problem. The “textbook” solution is to use a hash table, which occupies linear space and answers each query in constant time. On the other hand, the minimum possible space to encode all (key, value) pairs is only OPT:= ⌈lg2( U n )+nlg2|Σ|⌉ bits, which could be much less. In this paper, we design a randomized dictionary data structure using OPT+lgn+O(lglglglglgU) bits of space, and it has expected constant query time, assuming the query algorithm can access an external lookup table of size n 0.001. The lookup table depends only on U, n and |Σ|, and not the input. Previously, even for membership queries and U≤ n O(1), the best known data structure with constant query time requires OPT+n/lgn bits of space by Pagh (SIAM J. Comput. 2001) and Pǎtrascu (FOCS 2008); the best known using OPT+n 0.999 space has query time O(lgn); the only known non-trivial data structure with OPT+n 0.001 space has O(lgn) query time and requires a lookup table of size ≥ n 2.99 (!). Our new data structure answers open questions by Pǎtrascu and Thorup.
DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checking

The increased focus on misinformation has spurred development of data and systems for detecting the veracity of a claim as well as retrieving authoritative evidence. The Fact Extraction and VERification (FEVER) dataset provides such a resource for evaluating endto- end fact-checking, requiring retrieval of evidence from Wikipedia to validate a veracity prediction. We show that current systems for FEVER are vulnerable to three categories of realistic challenges for fact-checking – multiple propositions, temporal reasoning, and ambiguity and lexical variation – and introduce a resource with these types of claims. Then we present a system designed to be resilient to these “attacks” using multiple pointer networks for document selection and jointly modeling a sequence of evidence sentences and veracity relation predictions. We find that in handling these attacks we obtain state-of-the-art results on FEVER, largely due to improved evidence retrieval.
Separations and equivalences between turnstile streaming and linear sketching

A longstanding observation, which was partially proven by Li, Nguyen, and Woodruff in 2014, and extended by Ai, Hu, Li, and Woodruff in 2016, is that any turnstile streaming algorithm can be implemented as a linear sketch (the reverse is trivially true). We study the relationship between turnstile streaming and linear sketching algorithms in more detail, giving both new separations and new equivalences between the two models. It was shown by Li, Nguyen, and Woodruff in 2014 that, if a turnstile algorithm works for arbitrarily long streams with arbitrarily large coordinates at intermediate stages of the stream, then the turnstile algorithm is equivalent to a linear sketch. We show separations of the opposite form: if either the stream length or the maximum value of the stream are substantially restricted, there exist problems where linear sketching is exponentially harder than turnstile streaming. A further limitation of the Li, Nguyen, and Woodruff equivalence is that the turnstile sketching algorithm is neither explicit nor uniform, but requires an exponentially long advice string. We show how to remove this limitation for deterministic streaming algorithms: we give an explicit small-space algorithm that takes the streaming algorithm and computes an equivalent module.
Diagnosing the Environment Bias in Vision-and-Language Navigation

Vision-and-Language Navigation (VLN) requires an agent to follow natural-language instructions, explore the given environments, and reach the desired target locations. These step-by-step navigational instructions are crucial when the agent is navigating new environments about which it has no prior knowledge. Most recent works that study VLN observe a significant performance drop when tested on unseen environments (i.e., environments not used in training), indicating that the neural agent models are highly biased towards training environments. Although this issue is considered as one of the major challenges in VLN research, it is still under-studied and needs a clearer explanation. In this work, we design novel diagnosis experiments via environment re-splitting and feature replacement, looking into possible reasons for this environment bias. We observe that neither the language nor the underlying navigational graph, but the low-level visual appearance conveyed by ResNet features directly affects the agent model and contributes to this environment bias in results. According to this observation, we explore several kinds of semantic representations that contain less low-level visual information, hence the agent learned with these features could be better generalized to unseen testing environments. Without modifying the baseline agent model and its training method, our explored semantic features significantly decrease the performance gaps between seen and unseen on multiple datasets (i.e. R2R, R4R, and CVDN) and achieve competitive unseen results to previous state-of-the-art models. Our code and features are available at: this https URL
q-Deformed character theory for infinite-dimensional symplectic and orthogonal groups

The classification of irreducible, spherical characters of the infinite-dimensional unitary/orthogonal/symplectic groups can be obtained by finding all possible limits of normalized, irreducible characters of the corresponding finite-dimensional groups, as the rank tends to infinity. We solve a q-deformed version of the latter problem for orthogonal and symplectic groups, extending previously known results for the unitary group. The proof is based on novel determinantal and double-contour integral formulas for the q-specialized characters.
Privately preventing malaria in the United States, 1900-1925

This article explores the collective action problem of disease prevention by developing the conditions under which people engage in private means of mosquito control and malaria prevention. People are more likely to overcome problems related to collective action and free riding when they face financial rewards or when they lower transactions costs related to monitoring and enforcement. These conditions hold especially when they can tie the collective good of prevention with complementary private goods, and when they can form associations and firms that encourage prevention. These conditions are developed with reference to the American experience with malaria in the early twentieth century, and, in particular, private efforts to eliminate mosquitos and lower malaria prevalence rates. The persistence of malaria in the southern United States supports this logic too, as the private benefits of prevention there were lower than the costs. This study shows that the scope for individual responses to changing prevalence rates is wider than typically assumed
Manipulating deformable objects by interleaving prediction, planning, and control:

We present a framework for deformable object manipulation that interleaves planning and control, enabling complex manipulation tasks without relying on high-fidelity modeling or simulation. The key...
Combined abdominal heterotopic heart and aorta transplant model in mice

Background Allograft vasculopathy (AV) remains a major obstacle to long-term allograft survival. While the mouse aortic transplantation model has been proven as a useful tool for study of the pathogenesis of AV, simultaneous transplantation of the aorta alongside the transplantation of another organ may reveal more clinically relevant mechanisms that contribute to the pathogenesis of chronic allograft rejection. Therefore, we developed a combined abdominal heart and aorta transplantation model in mice which benefits from reducing animal and drug utilization, while providing an improved model to study the progressive nature of AV. Methods The middle of the infrarenal aorta of the recipient mouse was ligatured between the renal artery and its bifurcation. Proximal and distal aortotomies were performed at this site above and below the ligature, respectively, for the subsequent anastomoses of the donor aorta and heart grafts to the recipient infrarenal aorta in an end-to-side fashion. The distal anastomotic site of the recipient infrarenal aorta was connected with the outlet of the donor aorta. Uniquely, the proximal anastomotic site on the recipient infrarenal aorta was shared to connect with both the inlet of the donor aorta and the inflow tract to the donor heart. The outflow tract from the donor heart was connected to the recipient inferior vena cava (IVC). Results The median times for harvesting the heart graft, aorta graft, recipient preparation and anastomosis were 11.5, 8.0, 9.0 and 40.5 min, respectively, resulting in a total median ischemic time of 70 min. The surgery survival rate was more than 96% (29/30). Both the syngeneic C57Bl/6 aorta and heart grafts survived more than 90 days in 29 C57Bl/6 recipients. Further, Balb/c to C57Bl/6 allografts treated with anti-CD40L and CTLA4.Ig survived more than 90 days with a 100% (3/3) survival rate. (3/3). Conclusions This model is presented as a new tool for researchers to investigate transplant immunology and assess immunosuppressive strategies. It is possible to share a common anastomotic stoma on the recipient abdominal aorta to reconstruct both the aorta graft entrance and heart graft inflow tract. This allows for the study of allogeneic effects on both the aorta and heart from the same animal in a single survival surgery.
Characteristics of charged particle production in relativistic heavy-ion collisions

Inclusive spectra of charged particles at midrapidity in Au+Au collisions at $$\sqrt {s_{NN} } = 130$$ GeV and 200 GeV were measured with the STAR detector at RHIC. The measured mean transverse momentum 〈p T 〉 shows a characteristic dependence on charged particle multiplicity and beam energy in Au+Au collisions that is distinctly different from pp, $$p\bar p$$ and e+e− collisions. A 32%±3%(syst) increase in 〈p T 〉 from pp to Au+Au collisions was observed at 200 GeV. While the charged multiplicity was found to increase by 19%±5%(syst) from $$\sqrt {s_{NN} } = 130$$ GeV to 200 GeV, no significant difference in 〈p T 〉 was found between the two energies. A comparison with model predictions is discussed.
Fast Privacy-Preserving Punch Cards

Loyalty programs in the form of punch cards that can be redeemed for benefits have long been a ubiquitous element of the consumer landscape. However, their increasingly popular digital equivalents, while providing more convenience and better bookkeeping, pose a considerable risk to consumer privacy. This paper introduces a privacy-preserving punch card protocol that allows firms to digitize their loyalty programs without forcing customers to submit to corporate surveillance. We also present a number of extensions that allow our scheme to provide other privacy-preserving customer loyalty features. Compared to the best prior work, we achieve a $14\times$ reduction in the computation and a $11\times$ reduction in communication required to perform a "hole punch," a $55\times$ reduction in the communication required to redeem a punch card, and a $128\times$ reduction in the computation time required to redeem a card. Much of our performance improvement can be attributed to removing the reliance on pairings or range proofs present in prior work, which has only addressed this problem in the context of more general loyalty systems. By tailoring our scheme to punch cards and related loyalty systems, we demonstrate that we can reduce communication and computation costs by orders of magnitude.
Interface asymptotics of eigenspace Wigner distributions for the harmonic oscillator

Eigenspaces of the quantum isotropic Harmonic Oscillator Hℏ:=−ℏ22Δ+12||x||2 on Rd have extremally high multiplicites and the eigenspace projections Πℏ,EN(ℏ) have special asymptotic properties. Thi...
Reflection in Game-Based Learning: A Survey of Programming Games

Reflection is a critical aspect of the learning process. However, educational games tend to focus on supporting learning concepts rather than supporting reflection. While reflection occurs in educational games, the educational game design and research community can benefit from more knowledge of how to facilitate player reflection through game design. In this paper, we examine educational programming games and analyze how reflection is currently supported. We find that current approaches prioritize accuracy over the individual learning process and often only support reflection post-gameplay. Our analysis identifies common reflective features, and we develop a set of open areas for future work. We discuss these promising directions towards engaging the community in developing more mechanics for reflection in educational games.
Nonlinear nanophotonic devices in the ultraviolet to visible wavelength range

Although the first lasers invented operated in the visible, the first on-chip devices were optimized for near-infrared (IR) performance driven by demand in telecommunications. However, as the applications of integrated photonics has broadened, the wavelength demand has as well, and we are now returning to the visible (Vis) and pushing into the ultraviolet (UV). This shift has required innovations in device design and in materials as well as leveraging nonlinear behavior to reach these wavelengths. This review discusses the key nonlinear phenomena that can be used as well as presents several emerging material systems and devices that have reached the UV-Vis wavelength range.
Semiclassical dynamics and coherent soliton condensates in self‐focusing nonlinear media with periodic initial conditions

The small dispersion limit of the focusing nonlinear Schrodinger equation with periodic initial conditions is studied analytically and numerically. First, through a comprehensive set of numerical simulations, it is demonstrated that solutions arising from a certain class of initial conditions, referred to as "periodic single-lobe" potentials, share the same qualitative features, which also coincide with those of solutions arising from localized initial conditions. The spectrum of the associated scattering problem in each of these cases is then numerically computed, and it is shown that such spectrum is confined to the real and imaginary axes of the spectral variable in the semiclassical limit. This implies that all nonlinear excitations emerging from the input have zero velocity, and form a coherent nonlinear condensate. Finally, by employing a formal Wentzel-Kramers-Brillouin expansion for the scattering eigenfunctions, asymptotic expressions for the number and location of the bands and gaps in the spectrum are obtained, as well as corresponding expressions for the relative band widths and the number of "effective solitons". These results are shown to be in excellent agreement with those from direct numerical computation of the eigenfunctions. In particular, a scaling law is obtained showing that the number of effective solitons is inversely proportional to the small dispersion parameter.
Cytoplasmic sequestration of HDAC7 from mitochondrial and nuclear compartments upon initiation of apoptosis

2757 Control of global histone acetylation status is largely governed by the opposing enzymatic activities of histone acetyltransferases (HATs) and deacetylases (HDACs). HDACs were originally identified as modulators of nuclear histone acetylation status and have been linked to chromosomal condensation and subsequent gene repression. Accumulating evidence highlights HDAC modification of non-histone targets. Mitochondria were first characterized as intracellular organelles responsible for energy production through the coupling of oxidative phosphorylation to respiration. More recently, mitochondria have been implicated in programmed cell death whereby release of pro-apoptotic inner membrane space factors facilitates apoptotic progression. Here we describe the novel discovery that the nuclear encoded Class II human histone deacetylase HDAC7 localizes to the mitochondrial inner membrane space (IMS) of prostate epithelial cells and exhibits cytoplasmic relocalization in response to initiation of the apoptotic cascade. These results highlight a previously unrecognized link between HDACs, mitochondria, and programmed cell death.
Efficient and Simple Algorithms for Fault-Tolerant Spanners

It was recently shown that a version of the greedy algorithm gives a construction of fault-tolerant spanners that is size-optimal, at least for vertex faults. However, the algorithm to construct this spanner is not polynomial-time, and the best-known polynomial time algorithm is significantly suboptimal. Designing a polynomial-time algorithm to construct (near-)optimal fault-tolerant spanners was given as an explicit open problem in the two most recent papers on fault-tolerant spanners ([Bodwin, Dinitz, Parter, Vassilevka Williams SODA '18] and [Bodwin, Patel PODC '19]). We give a surprisingly simple algorithm which runs in polynomial time and constructs fault-tolerant spanners that are extremely close to optimal (off by only a linear factor in the stretch) by modifying the greedy algorithm to run in polynomial time. To complement this result, we also give simple distributed constructions in both the LOCAL and CONGEST models.
Is a bad mentor better than no mentor

Mentoring is generally touted as beneficial, yet not all mentoring is good, and the literature gives scant attention to the effects of quality of mentoring on career outcomes. Our study aims to close the gap by providing a comparison among three groups - employees with a good mentor, a bad mentor, and no mentor at all. The study finds that for more than 3,000 respondents, those with a mentor, even a bad one, enjoy the benefits of mentorship. However, the idea that having a bad mentor is better than no mentorship is only partly correct - it is contingent on just how bad and bad in what ways. The quality of the mentoring experience influences job satisfaction more while a mere presence of a mentor is important for the salary of the proteges. Furthermore, mentored public sector workers, unlike workers in the private and non-profit sectors, have a lower salary and job satisfaction compared to those who have no mentor. We provide suggestions about what may account for this unexpected and curious finding.
Stable blowup for the focusing energy critical nonlinear wave equation under random perturbations

We consider the radial focusing energy critical nonlinear wave equation in three spatial dimensions. We establish the stability of the ODE-blowup under random perturbations below the energy space. ...
Integrating genomic correlation structure improves copy number variations detection.

MOTIVATION Copy number variation plays important roles in human complex diseases. The detection of copy number variants (CNVs) is identifying mean shift in genetic intensities to locate chromosomal breakpoints, the step of which is referred to as chromosomal segmentation. Many segmentation algorithms have been developed with a strong assumption of independent observations in the genetic loci, and they assume each locus has an equal chance to be a breakpoint (i.e. boundary of CNVs). However, this assumption is violated in the genetics perspective due to the existence of correlation among genomic positions, such as linkage disequilibrium (LD). Our study showed that the LD structure is related to the location distribution of CNVs, which indeed presents a non-random pattern on the genome. To generate more accurate CNVs, we proposed a novel algorithm, LDcnv, that models the CNV data with its biological characteristics relating to genetic dependence structure (i.e. LD). RESULTS We theoretically demonstrated the correlation structure of CNV data in SNP array, which further supports the necessity of integrating biological structure in statistical methods for CNV detection. Therefore, we developed the LDcnv that integrated the genomic correlation structure with a local search strategy into statistical modeling of the CNV intensities. To evaluate the performance of LDcnv, we conducted extensive simulations and analyzed large-scale HapMap datasets. We showed that LDcnv presented high accuracy, stability and robustness in CNV detection and higher precision in detecting short CNVs compared to existing methods. This new segmentation algorithm has a wide scope of potential application with data from various high-throughput technology platforms. AVAILABILITY AND IMPLEMENTATION https://github.com/FeifeiXiaoUSC/LDcnv. SUPPLEMENTARY INFORMATION Supplementary data are available at Bioinformatics online.
Coordinated crawling via reinforcement learning

Rectilinear crawling locomotion is a primitive and common mode of locomotion in slender soft-bodied animals. It requires coordinated contractions that propagate along a body that interacts friction...
Twisted foliated fracton phases

In the study of three-dimensional gapped models, two-dimensional gapped states should be considered as a free resource. This is the basic idea underlying the notion of “foliated fracton order” proposed in Shirley et al. [Phys. Rev. X 8, 031051 (2018)]. We have found that many of the known type-I fracton models, although they appear very different, have the same foliated fracton order, known as “X-cube” order. In this paper, we identify three-dimensional fracton models with different kinds of foliated fracton order. Whereas the X-cube order corresponds to the gauge theory of a simple paramagnet with subsystem planar symmetry, the different orders correspond to twisted versions of the gauge theory for which the system prior to gauging has nontrivial order protected by the planar subsystem symmetry. We present constructions of the twisted models and demonstrate that they possess nontrivial order by studying their fractional excitation contents.
Polar Coding for Non-Stationary Channels

The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left \{{W_{i}}\right \}_{i=1}^{N}$ is considered. Such a sequence of channels is referred to as a non-stationary sequence of channels and arises in applications where data symbols experience different and independent channel characteristics. The sequence of channels is assumed to be completely known to both the transmitter and the receiver (a coherent scenario). Also, at each code block transmission, each of the channels is used only once. In other words, a codeword of length $N$ is constructed and then the $i$ -th encoded bit is transmitted over $W_{i}$ . The goal is to operate at a rate $R$ close to the average of the symmetric capacities of $W_{i}$ ’s, denoted by $\overline {I}_{N}$ . To this end, we construct a polar coding scheme using Arikan’s channel polarization transform in combination with certain permutations at each polarization level and certain skipped operations. In particular, given a non-stationary sequence of BMS channels $\left \{{W_{i}}\right \}_{i=1}^{N}$ and $P_{e}$ , where $0 , we construct a polar code of length $N$ and rate $R$ guaranteeing a block error probability of at most $P_{e}$ for transmission over $\left \{{W_{i}}\right \}_{i=1}^{N}$ such that $N \leqslant \frac {\kappa }{(\overline {I}_{N}- R)^{\mu }}$ , where $\mu $ is a constant and $\kappa $ is a constant depending on $P_{e}$ and $\mu $ . We further show a numerical upper bound on $\mu $ that is: $\mu \leqslant 7.34$ for non-stationary binary erasure channels and $\mu \leqslant 8.54$ for general non-stationary BMS channels. The encoding and decoding complexities of the constructed polar code preserve $O(N \log N)$ complexity of Arikan’s polar codes. In an asymptotic sense, when coded bits are transmitted over a non-stationary sequence of BMS channels $\left \{{W_{i}}\right \}_{i=1}^{\infty }$ , our proposed scheme achieves the average symmetric capacity $\overline {I}(\left \{{W_{i}}\right \}_{i=1}^{\infty }) \,\,{\textstyle \stackrel {\mathrm{ def}}{=}}\,\,\lim _{N\rightarrow \infty } \frac {1}{N}\sum _{i=1}^{N} I(W_{i})$ , assuming that the limit exists.
Algebro-geometric finite gap solutions to the Korteweg-de Vries equation as primitive solutions

Abstract In this paper we show that all algebro-geometric finite gap solutions to the Korteweg–de Vries equation can be realized as a limit of N-soliton solutions as N diverges to infinity (see remark 1 for the precise meaning of this statement). This is done using the primitive solution framework initiated by Dyachenko et al. (2016) and Zakharov et al. (2016) [25, 26]. One implication of this result is that the N-soliton solutions can approximate any bounded periodic solution to the Korteweg–de Vries equation arbitrarily well in the limit as N diverges to infinity. We also study primitive solutions numerically that have the same spectral properties as the algebro-geometric finite gap solutions but are not algebro-geometric solutions.
Identification of SARS-CoV-2 3CL Protease Inhibitors by a Quantitative High-Throughput Screening

The outbreak of coronavirus disease 2019 (COVID-19) caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has emphasized the urgency to develop effective therapeutics. Drug repurpo...
Modeling determinants of ridesourcing usage: A census tract-level analysis of Chicago

Abstract Ridesourcing services provided by companies like Uber, Lyft, and Didi have grown rapidly over the past decade and now serve a sizable portion of trips in many metropolitan areas. An understanding of these services (e.g. to whom, where, when, and for what purposes do they provide service?) is critical for regulating, planning, and managing urban multi-modal transportation systems effectively. Unfortunately, little is known about ridesourcing travel because private companies providing ridesourcing services were not previously subject to data sharing requirements. Fortunately, the city of Chicago recently collected and released spatially (census tract) and temporally (15-minute interval) aggregated data on ridesourcing trips collected from private companies. This study analyzes the Chicago ridesourcing data to examine factors influencing ridesourcing usage. The study employs a random-effects negative binomial (RENB) regression approach to model ridesourcing usage. Determinants considered in the model include weekend vs. weekday and weather variables as well as census tract socio-demographics and commute characteristics, land-use variables, places of interest, transit supply, parking features, and crime. The model results indicate ridesourcing demand is higher on days when temperatures are lower, there is less precipitation, and on the weekend, as well as in census tracts with (i) higher household incomes, (ii) a higher percentage of workers who carpool or take transit to work, (iii) a higher percentage of households with zero vehicles, (iv) higher population and employment density, (v) higher land-use diversity, (vi) fewer parking spots and higher parking rates, (vii) more restaurants, and (viii) more homicides. The results also demonstrate a non-linear (and insightful) relationship between ridesourcing demand and transit supply variables. The paper discusses the implications of these model results to inform transportation planning and policymaking as well as future research.
Development of Natural Language Processing Algorithm for Dental Charting

Purpose: The purpose was to develop a natural language processing algorithm, which will input data from oral examination transcripts to a structured database. Methods: Four case vignettes were produced with varying degree of soft tissue pathology, caries, existing restorations and occlusion relationships. Volunteers were instructed to perform simulated oral examinations based on the case vignettes, using natural language as in clinical settings. Twenty simulated oral examinations were collected and transcribed to develop a natural language processing algorithm in JAVA. The algorithm was reviewed and refined. Four additional simulated oral examinations were performed and transcribed as validation. Volunteers were asked to read the validation transcripts and fill in paper dental charts accordingly. The accuracy of the human volunteers and the algorithm were calculated. Results: After improvements, the recall rate of algorithm extracting data from transcripts was 99.0% and the precision was 97.8%. For the validation transcripts, human subjects had a 100% recall and precision rate. The mean recall and precision of algorithm processing the validation transcripts were 98.4% and 98.3% respectively. There was no statistic difference between human and the algorithm. Conclusion: natural language processing algorithm performs comparably with humans. The natural language processing algorithm potentially serves as a starting point to implement speech recognition for a voice-activated automatic dental charting system.
Old Drugs with New Tricks: Efficacy of Fluoroquinolones to Suppress Replication of Flaviviruses.

Repurposing FDA-approved compounds could provide the fastest route to alleviate the burden of disease caused by flaviviruses. In this study, three fluoroquinolones, enoxacin, difloxacin and ciprofloxacin, curtailed replication of flaviviruses Zika (ZIKV), dengue (DENV), Langat (LGTV) and Modoc (MODV) in HEK-293 cells at low micromolar concentrations. Time-of-addition assays suggested that enoxacin suppressed ZIKV replication at an intermediate step in the virus life cycle, whereas ciprofloxacin and difloxacin had a wider window of efficacy. A129 mice infected with 1 × 105 plaque-forming units (pfu) ZIKV FSS13025 (n = 20) or phosphate buffered saline (PBS) (n = 11) on day 0 and treated with enoxacin at 10 mg/kg or 15 mg/kg or diluent orally twice daily on days 1–5 did not differ in weight change or virus titer in serum or brain. However, mice treated with enoxacin showed a significant, five-fold decrease in ZIKV titer in testes relative to controls. Mice infected with 1 × 102 pfu ZIKV (n = 13) or PBS (n = 13) on day 0 and treated with 15 mg/kg oral enoxacin or diluent twice daily pre-treatment and days 1–5 post-treatment also did not differ in weight and viral load in the serum, brain, and liver, but mice treated with enoxacin showed a significant, 2.5-fold decrease in ZIKV titer in testes relative to controls. ZIKV can be sexually transmitted, so reduction of titer in the testes by enoxacin should be further investigated.
Characterization of mating type genes in heterothallic Neonectria species, with emphasis on N. coccinea, N. ditissima, and N. faginata.

Neonectria ditissima and N. faginata are canker pathogens involved in an insect-fungus disease complex of American beech (Fagus grandifolia) in North America commonly known as beech bark disease (B...
A Latency-Aware Task Offloading in Mobile Edge Computing Network for Distributed Elevated LiDAR

Recently, elevated LiDAR (ELiD) has been proposed as an alternative to local LiDAR sensors in autonomous vehicles (AV) because of the ability to reduce costs and computational requirements of AVs, reduce the number of overlapping sensors mapping an area, and to allow for a multiplicity of LiDAR sensing applications with the same shared LiDAR map data. Since ELiDs have been removed from the vehicle, their data must be processed externally in the cloud or on the edge, necessitating an optimized backhaul system that allocates data efficiently to compute servers. In this paper, we address this need for an optimized backhaul system by formulating a mixed-integer programming problem that minimizes the average latency of the uplink and downlink hop-by-hop transmission plus computation time for each ELiD while considering different bandwidth allocation schemes. We show that our model is capable of allocating resources for differing topologies, and we perform a sensitivity analysis that demonstrates the robustness of our problem formulation under different circumstances.
A geometric approach to counting norms in cyclic extensions of function fields

In this paper, we prove an explicit version of a function field analogue of a classical result of Odoni (Mathematika 22(1):71–80, 1975) about norms in number fields, in the case of a cyclic Galois extensions. In the particular case of a quadratic extension, we recover the result Bary-Soroker et al. (Finite Fields Appl 39:195–215, 2016) which deals with finding asymptotics for a function field version on sums of two squares, improved upon by Gorodetsky (Mathematika 63(2):622–665, 2017), and reproved by the author in his Ph.D. thesis using the method of this paper. The main tool is a twisted Grothendieck–Lefschetz trace formula, inspired by the paper (Church et al. in Contemp Math 620:1–54, 2014). Using a combinatorial description of the cohomology, we obtain a precise quantitative result which works in the $$q^n\rightarrow \infty $$ regime, and a new type of homological stability phenomena, which arises from the computation of certain inner products of representations.
A Helicopter Tour of Some Underlying Issues In Empirical Industrial Organization

This review considers conceptual issues underlying empirical work on markets. It is divided in three parts. The first part reviews the analysis of demand and equilibrium in retail markets and then ...
From Connectomic to Task-evoked Fingerprints: Individualized Prediction of Task Contrasts from Resting-state Functional Connectivity

Resting-state functional MRI (rsfMRI) yields functional connectomes that can serve as cognitive fingerprints of individuals. Connectomic fingerprints have proven useful in many machine learning tasks, such as predicting subject-specific behavioral traits or task-evoked activity. In this work, we propose a surface-based convolutional neural network (BrainSurfCNN) model to predict individual task contrasts from their resting-state fingerprints. We introduce a reconstructive-contrastive loss that enforces subject-specificity of model outputs while minimizing predictive error. The proposed approach significantly improves the accuracy of predicted contrasts over a well-established baseline. Furthermore, BrainSurfCNN’s prediction also surpasses test-retest benchmark in a subject identification task. (Source code is available at https://github.com/ngohgia/brain-surf-cnn)
O-Pair Search with MetaMorpheus for O-glycopeptide Characterization

We report O-Pair Search, an approach to identify O-glycopeptides and localize O-glycosites. Using paired collision- and electron-based dissociation spectra, O-Pair Search identifies O-glycopeptides via an ion-indexed open modification search and localizes O-glycosites using graph theory and probability-based localization. O-Pair Search reduces search times more than 2,000-fold compared to current O-glycopeptide processing software, while defining O-glycosite localization confidence levels and generating more O-glycopeptide identifications. Beyond the mucin-type O-glycopeptides discussed here, O-Pair Search also accepts user-defined glycan databases, making it compatible with many types of O-glycosylation. O-Pair Search is freely available within the open-source MetaMorpheus platform at https://github.com/smith-chem-wisc/MetaMorpheus .
Diagnostic accuracy among trainees to safely confirm peripherally inserted central catheter (PICC) placement using bedside ultrasound.

Background Real-time utilization of ultrasound to confirm peripherally inserted central catheter (PICC) placement improves efficacy and reduces patient radiation exposure. We evaluated if novice ul...
Female rats self-administer heroin by vapor inhalation.

Abstract Over the last two decades the United States has experienced a significant increase in the medical and non-medical use of opioid drugs, resulting in record numbers of opioid-related overdoses and deaths. There was an initial increase in non-medical use of prescription opioids around 2002, followed later by increased heroin use and then most recently fentanyl. Inhalation is a common route of administration for opioids, with a documented history spanning back to Mediterranean antiquity and up through modern use with e-cigarette devices. Unfortunately, preclinical studies using inhalation as the route of administration remain relatively few. This study was conducted to determine the efficacy of e-cigarette vapor inhalation of heroin in rats. Non-contingent exposure to heroin or methadone vapor produced anti-nociceptive efficacy in male and female rats. Female rats were trained to self-administer heroin vapor; the most-preferring half of the distribution obtained more vapor reinforcers when the concentration of heroin was reduced in the vapor vehicle and when pre-treated with the opioid receptor antagonist naloxone. The anti-nociceptive effect of heroin self-administered by vapor was identical in magnitude to that produced by intravenous self-administration. Finally, anxiety-like behavior increased 24–48 h after last heroin vapor access, consistent with withdrawal signs observed after intravenous self-administration. In sum, these studies show that rewarding and anti-nociceptive effects of heroin are produced in rats by vapor inhalation using e-cigarette technology. Importantly, self-administration models by this route can be deployed to determine health effects of inhaled heroin or other opioids.
The Masses and Spins of Neutron Stars and Stellar-Mass Black Holes

Abstract Stellar-mass black holes and neutron stars represent extremes in gravity, density, and magnetic fields. They therefore serve as key objects in the study of multiple frontiers of physics. In addition, their origin (mainly in core-collapse supernovae) and evolution (via accretion or, for neutron stars, magnetic spindown and reconfiguration) touch upon multiple open issues in astrophysics. In this review, we discuss current mass and spin measurements and their reliability for neutron stars and stellar-mass black holes, as well as the overall importance of spins and masses for compact object astrophysics. Current masses are obtained primarily through electromagnetic observations of binaries, although future microlensing observations promise to enhance our understanding substantially. The spins of neutron stars are straightforward to measure for pulsars, but the birth spins of neutron stars are more difficult to determine. In contrast, even the current spins of stellar-mass black holes are challenging to measure. As we discuss, major inroads have been made in black hole spin estimates via analysis of iron lines and continuum emission, with reasonable agreement when both types of estimate are possible for individual objects, and future X-ray polarization measurements may provide additional independent information. We conclude by exploring the exciting prospects for mass and spin measurements from future gravitational wave detections, which are expected to revolutionize our understanding of strong gravity and compact objects.
Hall’s Conjecture on Extremal Sets for Random Triangles

In this paper, we partially resolve Hall’s conjecture (Hall in J Appl Probab 19(3):712–715, 1982) on random triangles. We consider the probability that three points chosen uniformly at random from a bounded convex region of the plane form an acute triangle. Hall’s conjecture states that this probability is maximized by the disk. This can be interpreted as a probabilistic version of the isoperimetric inequality. We first prove that the disk is a weak local maximum among bounded domains in $${\mathbb {R}}^2$$ and that the ball is a weak local maximum in $${\mathbb {R}}^3$$ . In $${\mathbb {R}}^2$$ , we then prove a local $$C^{2,\frac{1}{2}}$$ -type estimate on the probability in the Hausdorff topology. This enables us to prove that the disk is a strong local maximum in the Gromov–Hausdorff topology (modulo congruences). Finally, we give an explicit upper bound on the isoperimetric ratio for a region which maximizes the probability and show how this reduces verifying the full conjecture to a finite, though currently intractable, calculation.
Modeling Interdependent and Periodic Real-World Action Sequences

Mobile health applications, including those that track activities such as exercise, sleep, and diet, are becoming widely used. Accurately predicting human actions in the real world is essential for targeted recommendations that could improve our health and for personalization of these applications. However, making such predictions is extremely difficult due to the complexities of human behavior, which consists of a large number of potential actions that vary over time, depend on each other, and are periodic. Previous work has not jointly modeled these dynamics and has largely focused on item consumption patterns instead of broader types of behaviors such as eating, commuting or exercising. In this work, we develop a novel statistical model, called TIPAS, for Time-varying, Interdependent, and Periodic Action Sequences. Our approach is based on personalized, multivariate temporal point processes that model time-varying action propensities through a mixture of Gaussian intensities. Our model captures short-term and long-term periodic interdependencies between actions through Hawkes process-based self-excitations. We evaluate our approach on two activity logging datasets comprising 12 million real-world actions (e.g., eating, sleep, and exercise) taken by 20 thousand users over 17 months. We demonstrate that our approach allows us to make successful predictions of future user actions and their timing. Specifically, TIPAS improves predictions of actions, and their timing, over existing methods across multiple datasets by up to 156%, and up to 37%, respectively. Performance improvements are particularly large for relatively rare and periodic actions such as walking and biking, improving over baselines by up to 256%. This demonstrates that explicit modeling of dependencies and periodicities in real-world behavior enables successful predictions of future actions, with implications for modeling human behavior, app personalization, and targeting of health interventions.
Buoyancy-Driven Entrainment in Dry Thermals

\citet{turner1957} proposed that dry thermals entrain because of buoyancy (via a constraint which requires an increase in the radius $a$). This however, runs counter to the scaling arguments commonly used to derive the entrainment rate, which rely on either the self-similarity of \citet{scorer1957} or the turbulent entrainment hypothesis of \citet{morton1956}. The assumption of turbulence-driven entrainment was investigated by \citet{lecoanet2018}, who found that the entrainment efficiency $e$ varies by less than $20\%$ between laminar (Re = 630) and turbulent (Re = 6300) thermals. This motivated us to utilize Turner's argument of buoyancy-controlled entrainment in addition to the thermal's vertical momentum equation to build a model for thermal dynamics which does not invoke turbulence or self-similarity. We derive simple expressions for the thermals' kinematic properties and their fractional entrainment rate $\epsilon$ and find close quantitative agreement with the values in direct numerical simulations. In particular, our expression for entrainment rate is consistent with the parameterization $\epsilon \sim B/w^2$, for Archimedean buoyancy $B$ and vertical velocity $w$. We also directly validate the role of buoyancy-driven entrainment by running simulations where gravity is turned off midway through a thermal's rise. The entrainment efficiency $e$ is observed to drop to less than 1/3 of its original value in both the laminar and turbulent cases when $g=0$, affirming the central role of buoyancy in entrainment in dry thermals.
Instantons for particles joined by strings in three dimensional gravity

We study the instantons describing the production of particles at the ends of codimension-one objects (strings and struts) in (2 + 1)-dimensional Minkowski and de Sitter spaces. A Minkowskian background allows only for systems with vanishing total mass, so that either negative mass particles or negative tension struts are required. On a de Sitter background, on the other hand, we find processes describing the production of string/particle systems with no negative energies involved. We also compute the probabilities of creating and of breaking an infinite cosmic string in de Sitter space. We perform our analysis of the system in de Sitter space employing a generalization of the toroidal coordinate system to the three-sphere.
Formation of Galactic Bulges

We use cosmological hydrodynamic simulations to investigate the formation of galactic bulges within the framework of hierarchical clustering in a representative cold dark matter (CDM) cosmological model. We show that the largest objects forming at cosmological redshifts z ~ 4 resemble observed bulges of spiral galaxies or moderate-sized ellipticals in their general properties, such as size, shape, and density profile. This is consistent with observational data indicating the existence of "old" bulges and ellipticals at more moderate redshifts. These bulges are gas dominated at redshift z = 3, with high rates of star formation, and would appear to be good candidates for small blue galaxies seen in the Hubble Deep Field.
INTERPRETING MAGNETIC VARIANCE ANISOTROPY MEASUREMENTS IN THE SOLAR WIND

The magnetic variance anisotropy () of the solar wind has been used widely as a method to identify the nature of solar wind turbulent fluctuations; however, a thorough discussion of the meaning and interpretation of the has not appeared in the literature. This paper explores the implications and limitations of using the as a method for constraining the solar wind fluctuation mode composition and presents a more informative method for interpreting spacecraft data. The paper also compares predictions of the from linear theory to nonlinear turbulence simulations and solar wind measurements. In both cases, linear theory compares well and suggests that the solar wind for the interval studied is dominantly Alfvenic in the inertial and dissipation ranges to scales of kρ i 5.
On the Number of Parts of Integer Partitions Lying in Given Residue Classes

Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.
Pathwise accuracy and ergodicity of metropolized integrators for SDEs

Metropolized integrators for ergodic stochastic differential equations (SDEs) are proposed that (1) are ergodic with respect to the (known) equilibrium distribution of the SDEs and (2) approximate pathwise the solutions of the SDEs on finitetime intervals. Both these properties are demonstrated in the paper, and precise strong error estimates are obtained. It is also shown that the Metropolized integrator retains these properties even in situations where the drift in the SDE is nonglobally Lipschitz, and vanilla explicit integrators for SDEs typically become unstable and fail to be ergodic. © 2009 Wiley Periodicals, Inc.
Superconductivity from repulsive interaction

The BCS theory of superconductivity named electron-phonon interaction as a glue that overcomes Coulomb repulsion and binds fermions into pairs which then condense and super-conduct. We review recent and not so recent works aiming to understand whether a nominally repulsive Coulomb interaction can by itself give rise to a superconductivity. We first discuss a generic scenario of the pairing by electron-electron interaction, put forward by Kohn and Luttinger back in 1965, and then turn to modern studies of the electronic mechanism of superconductivity in the lattice models for the cuprates, the Fe-pnictides, and the doped graphene. We show that the pairing in all three classes of materials can be viewed as lattice version of Kohn-Luttinger physics, despite that the pairing symmetries are different. We discuss under what conditions the pairing occurs and rationalize the need to do parquet renormalization-group analysis. We also discuss the interplay between superconductivity and density-wave instabilities.