cssi/SciSciGPT-SciSciNet huggingface dataset:
Cases Relating to Chapter 14 – Real Evidence

Publisher Summary This chapter presents several case studies related to real evidence. These cases include the case of Schmerber versus California, State versus Cowans, and Underwood versus State. In the first case, the petitioner was convicted in Los Angeles Municipal Court of the criminal offense of driving an automobile while under the influence of intoxicating liquor. He had been arrested at a hospital while receiving treatment for injuries suffered in an accident involving the automobile that he had apparently been driving. In the second case, the defendant was found guilty of one count of possession of a controlled substance with intent to deliver. The trial court sentenced defendant to seven years in the Illinois Department of Corrections. On appeal, defendant challenges the sufficiency of the evidence and contends the stipulated facts, together with the entire trial record, fail to establish a complete chain of custody for the controlled substance. In the third case, Justin Underwood was indicted for capital murder by the grand jury for Madison County. Underwood pleaded not guilty and proceeded to trial in the Circuit Court of Madison County. The jury returned a verdict of guilty on the charge of capital murder. The sentencing phase of the trial was held on the following day, and the jury found that Underwood should be sentenced to death.
Persistence and spreading speeds of parabolic-elliptic Keller-Segel models in shifting environments

The current paper is concerned with the persistence and spreading speeds of the following Keller-Segel chemoattraction system in shifting environments, \begin{equation}\label{abstract-eq1} \begin{cases} u_t=u_{xx}-\chi(uv_x)_x +u(r(x-ct)-bu),\quad x\in\R\cr 0=v_{xx}- \nu v+\mu u,\quad x\in\R, \end{cases} \end{equation} where $\chi$, $b$, $\nu$, and $\mu$ are positive constants, { $c\in\R$ }, $r(x)$ is Holder continuous, bounded, $r^*=\sup_{x\in\R}r(x)>0$, $r(\pm \infty):=\lim_{x\to \pm\infty}r(x)$ exist, and $r(x)$ satisfies either $r(-\infty) \chi\mu$ and $b\ge \big(1+\frac{1}{2}\frac{(\sqrt{r^*}-\sqrt{\nu})_+}{(\sqrt{r^*}+\sqrt{\nu})}\big)\chi\mu$. In the case that $r(-\infty) c^*:=2\sqrt{r^*}$, then the species becomes extinct in the habitat. If the moving speed $ -c^*\leq c c^*$, then the species will become extinct in the habitat. If $\lambda_{\infty}$, defined to be the generalized principle eigenvalue of the operator $u\to u_{xx}+cu_{x}+r(x)u$, is negative and the degradation rate $\nu$ of the chemo-attractant is grater than or equal to some number $\nu^*$, then the species will also become extinct in the habitat. If $\lambda_{\infty}>0$, then the species will persist surrounding the good habitat.
A real model of transitional growth and competitiveness in China

Abstract We present a stylized real model of the Chinese economy with the objective of explaining two features: (1) domestic production is highly competitive in the sense that an accumulation of capital that raises the marginal product of labor elicits increases in employment and output rather than only in wages; and (2) even though the domestic saving rate is high, foreign direct investment is also substantial. We explain these features in terms of a conventional neoclassical growth model — with no monetary or nominal exchange rate policy — by including two aspects of the economy explicitly in the model: (1) low production wages are sustained by a large reserve army of rural labor which drives internal migration, and (2) domestic capital is distinct from importable capital and complementary with it in production. The results suggest that underlying real phenomena are important in explaining recent history; while nominal renmimbi appreciation may dampen price and wage increases, it would probably not change the real factors that have sustained rapid growth.
Chapter 6 – Case Conceptualization

Publisher Summary The book includes descriptions of 25 actual play therapy activities and this chapter is dedicated to the discussion of case conceptualization. Before the session starts, the therapists need to understand the process of gathering intake and assessment data. The chapter focuses on the process of organizing that data into a comprehensive case conceptualization. During the intake and assessment phase, the play therapist locates as many of the pieces of the puzzle as possible and attempts to make sure they are all oriented correctly. During the process of formulating the case conceptualization, the play therapist attempts to discern the current relationships between the pieces of the child's life. The therapist also figures out the way they are put together, and then develops hypotheses about the way these currently function. In this process, it is essential that the play therapist develops a clear understanding of the way the child views the world as possible. This involves completing Appendix Parts A1 through A4 as described in the chapter, and then completing Workbook Parts IV and V. For each of these parts, a theoretical rationale, general instructions, and the continuation of the case of Steven Johnson are presented.
Effects of Off-Fault Inelasticity on Near-Fault Directivity Pulses

Near-fault motion is often dominated by long-period, pulse-like particle velocities with fault-normal polarization that, when enhanced by directivity, may strongly excite mid- to high-rise structures. We assess the extent to which plastic yielding may affect amplitude, frequency content, and distance scaling of near-fault directivity pulses. Dynamic simulations of 3D strike-slip ruptures reveal significant plasticity effects, and these persist when geometrical fault roughness is added. With and without off-fault yielding, these models (~ M 7) predict fault-normal pulse behavior similar to that of observed pulses (periods of 2-5 seconds, amplitudes increasing with rupture distance until approaching a limit), but yielding systematically reduces pulse amplitude and increases the dominant period. Yielding causes near-fault (< ~2 km) peak ground velocity (PGV) to saturate with respect to increases in both stress drop and epicentral distance, and at small distance to rupture, yielding may contribute significantly to the observed magnitude saturation of PGV. The results support the following elements for functional forms in empirical pulse models: (i) a fault-normal distance saturation factor, (ii) a period-dependent and along-strike distance-dependent factor representing directivity, and (iii) an along-strike saturation factor to truncate growth of the directivity factor. In addition to the foregoing effects on long-period fault-normal pulses, the model with off-fault plasticity is very efficient in suppressing the high-frequency fault-parallel acceleration pulses that otherwise develop when local supershear rupture transients occur. The latter result may explain, at least in part, the absence of an observable Mach wave signature from supershear rupture.
Investigation of Galileo Probe Entry Heating with Coupled Radiation and Ablation

This paper presents a trajectory-based heating and ablation study of the Galileo probe forebody flow and thermal protection system performance. The validity of modeling assumptions regarding diffus...
Gaps between divisible terms in \(a^2 (a^2 + 1)\)

Suppose $a^2 (a^2 + 1)$ divides $b^2 (b^2 + 1)$ with $b > a$. In this paper, we improve a previous result and prove a gap principle, without any additional assumptions, namely $b \gg a (\log a)^{1/8} / (\log \log a)^{12}$. We also obtain $b \gg_\epsilon a^{15/14 - \epsilon}$ under the abc conjecture.
Recovery of sparse signals from a mixture of linear samples

Mixture of linear regressions is a popular learning theoretic model that is used widely to represent heterogeneous data. In the simplest form, this model assumes that the labels are generated from either of two different linear models and mixed together. Recent works of Yin et al. and Krishnamurthy et al., 2019, focus on an experimental design setting of model recovery for this problem. It is assumed that the features can be designed and queried with to obtain their label. When queried, an oracle randomly selects one of the two different sparse linear models and generates a label accordingly. How many such oracle queries are needed to recover both of the models simultaneously? This question can also be thought of as a generalization of the well-known compressed sensing problem (Candes and Tao, 2005, Donoho, 2006). In this work, we address this query complexity problem and provide efficient algorithms that improves on the previously best known results.
Dynamic Convolution: Attention Over Convolution Kernels

Light-weight convolutional neural networks (CNNs) suffer performance degradation as their low computational budgets constrain both the depth (number of convolution layers) and the width (number of channels) of CNNs, resulting in limited representation capability. To address this issue, we present Dynamic Convolution, a new design that increases model complexity without increasing the network depth or width. Instead of using a single convolution kernel per layer, dynamic convolution aggregates multiple parallel convolution kernels dynamically based upon their attentions, which are input dependent. Assembling multiple kernels is not only computationally efficient due to the small kernel size, but also has more representation power since these kernels are aggregated in a non-linear way via attention. By simply using dynamic convolution for the state-of-the-art architecture MobileNetV3-Small, the top-1 accuracy of ImageNet classification is boosted by 2.9% with only 4% additional FLOPs and 2.9 AP gain is achieved on COCO keypoint detection.
An equivariant Hilbert basis theorem

We prove a version of the Hilbert basis theorem in the setting of equivariant algebraic geometry: given a group G acting on a finite type morphism of schemes X -> S, if S is topologically G-noetherian, then so is X.
Extractors for adversarial sources via extremal hypergraphs

Randomness extraction is a fundamental problem that has been studied for over three decades. A well-studied setting assumes that one has access to multiple independent weak random sources, each with some entropy. However, this assumption is often unrealistic in practice. In real life, natural sources of randomness can produce samples with no entropy at all or with unwanted dependence. Motivated by this and applications from cryptography, we initiate a systematic study of randomness extraction for the class of adversarial sources defined as follows. A weak source X of the form X 1, …, X N , where each X i is on n bits, is an (N,K,n,k)-source of locality d if the following hold: (1) Somewhere good sources: at least K of the X i ’s are independent, and each contains min-entropy at least k. We call these X i ’s good sources, and their locations are unknown. (2) Bounded dependence: each remaining (bad) source can depend arbitrarily on at most d good sources. We focus on constructing extractors with negligible error, in the regime where most of the entropy is contained within a few sources instead of across many (i.e., k is at least polynomial in K). In this setting, even for the case of 0-locality, very little is known prior to our work. For d=1, essentially no previous results are known. We present various new extractors for adversarial sources in a wide range of parameters, and some of our constructions work for locality d=K Ω(1). As an application, we also give improved extractors for small-space sources. The class of adversarial sources generalizes several previously studied classes of sources, and our explicit extractor constructions exploit tools from recent advances in extractor machinery, such as two-source non-malleable extractors and low-error condensers. Thus, our constructions can be viewed as a new application of non-malleable extractors. In addition, our constructions combine the tools from extractor theory in a novel way through various sorts of explicit extremal hypergraphs. These connections leverage recent progress in combinatorics, such as improved bounds on cap sets and explicit constructions of Ramsey graphs, and may be of independent interest.
Discriminantal bundles, arrangement groups, and subdirect products of free groups

We construct bundles $$E_k({{\mathscr {A}}},{{\mathscr {F}}}) \rightarrow M$$ over the complement M of a complex hyperplane arrangement $${{\mathscr {A}}}$$ , depending on an integer $$k \geqslant 1$$ and a set $${{\mathscr {F}}}=\{f_1, \ldots , f_\mu \}$$ of continuous functions $$f_i :M \rightarrow {{\mathbb {C}}}$$ whose differences are nonzero on M, generalizing the configuration space bundles arising in the Lawrence–Krammer–Bigelow representation of the pure braid group. We display such families $${{\mathscr {F}}}$$ for rank two arrangements, reflection arrangements of types $$A_\ell $$ , $$B_\ell $$ , $$D_\ell $$ , $$F_4$$ , and for arrangements supporting multinet structures with three classes, with the resulting bundles having nontrivial monodromy around each hyperplane. The construction extends to arbitrary arrangements by pulling back these bundles along products of inclusions arising from subarrangements of these types. We then consider the faithfulness of the resulting representations of the arrangement group $$\pi _1(M)$$ . We describe the kernel of the product $$\rho _{{\mathscr {X}}}:G \rightarrow \prod _{S \in {{\mathscr {X}}}} G_S$$ of homomorphisms of a finitely-generated group G onto quotient groups $$G_S$$ determined by a family $${{\mathscr {X}}}$$ of subsets of a fixed set of generators of G, extending a result of Theodore Stanford about Brunnian braids. When the projections $$G \rightarrow G_S$$ split in a compatible way, we show the image of $$\rho _{{\mathscr {X}}}$$ is normal with free abelian quotient, and identify the cohomological finiteness type of G. These results apply to some well-studied arrangements, implying several qualitative and residual properties of $$\pi _1(M)$$ , including an alternate proof of a result of Artal, Cogolludo, and Matei on arrangement groups and Bestvina–Brady groups, and a dichotomy for a decomposable arrangement $${{\mathscr {A}}}$$ : either $$\pi _1(M)$$ has a conjugation-free presentation or it is not residually nilpotent.
Thresholding Graph Bandits with GrAPL

In this paper, we introduce a new online decision making paradigm that we call Thresholding Graph Bandits. The main goal is to efficiently identify a subset of arms in a multi-armed bandit problem whose means are above a specified threshold. While traditionally in such problems, the arms are assumed to be independent, in our paradigm we further suppose that we have access to the similarity between the arms in the form of a graph, allowing us gain information about the arm means in fewer samples. Such settings play a key role in a wide range of modern decision making problems where rapid decisions need to be made in spite of the large number of options available at each time. We present GrAPL, a novel algorithm for the thresholding graph bandit problem. We demonstrate theoretically that this algorithm is effective in taking advantage of the graph structure when available and the reward function homophily (that strongly connected arms have similar rewards) when favorable. We confirm these theoretical findings via experiments on both synthetic and real data.
‘Ground Hog Da Din’ for the Sikh insurgency?

Between 1978 and 1992, Sikh militants rampaged across the northern Indian state of the Punjab demanding that a homeland for Sikhs, called Khalistan, be carved from that state. The so-called Khalist...
SHINE (Strategies for High-frequency INdoor Environments) with Efficient THz-AP Placement

The increasing demand for ultra-high throughput in ultra-dense networks might take a toll on 5G capacity. Moreover, with Internet-of-Things (IoT) and the growing use-cases for indoor killer-applications, it will be necessary to look beyond 5G technologies. One such promising technology is to move higher in the frequencies, such as the THz (300 GHz-10 THz) spectrum. THz has a massive number of greenfield-contiguous channels ranging from 10 GHz to 200 GHz (best case), which was not available in the traditional radio frequency (RF) or millimeter wave (mmWave) bands. Although THz has immense potential to cater to such demands, it comes with numerous challenges revolving around hardware, link budget, mobility, blockages, scheduling, and deployment. Terahertz access points (THz-APs) are sensitive to deployment and can critically impact a system’s dynamics (i.e., coverage, throughput, and efficiency). In this paper, we present Strategies for High-frequency INdoor Environments or SHINE, which focuses on efficient AP deployment in the THz spectrum and draws motivation from approaches used indoor to improve lighting conditions. Due to THz’s limited coverage area of a few meters, the number of THz-APs required to satisfy a densely populated room will be higher compared to today’s single router/box/AP model. This increased number of THzAPs will not only increase the operational costs, but also (in some cases) can make the system inefficient. Through SHINE, we explore the deployment-related challenges and propose strategies to mitigate the same.
Toward Low-Cost and Stable Blockchain Networks

Envisioned to be the future of secured distributed systems, blockchain networks have received increasing attention from both the industry and academia in recent years. However, blockchain mining processes demand high hardware costs and consume a vast amount of energy (studies have shown that the amount of energy consumed in Bitcoin mining is almost the same as the electricity used in Ireland). To address the high mining cost problem of blockchain networks, in this paper, we propose a blockchain mining resources allocation algorithm to reduce the mining cost in PoW-based (proof-of-work-based) blockchain networks. We first propose an analytical queueing model for general blockchain networks. In our queueing model, transactions arrive randomly to the queue and are served in a batch manner with unknown service rate probability distribution and agnostic to any priority mechanism. Then, we leverage the Lyapunov optimization techniques to propose a dynamic mining resources allocation algorithm (DMRA), which is parameterized by a tuning parameter $K \gt 0$. We show that our algorithm achieves an $[O(1/ K),O(K)]$ cost-optimality-gap-vs-delay tradeoff. Our simulation results also demonstrate the effectiveness of DMRA in reducing mining costs.
Selecting Chief Justices by Peer Vote

What characteristics do state supreme court justices prioritize when choosing leaders? At the federal level, collegial court leaders are appointed or rotated by seniority. A plurality of states per...
Stochastic multi-period optimal dispatch of energy storage in unbalanced distribution feeders

Abstract This paper presents a convex, multi-period, AC-feasible Optimal Power Flow (OPF) framework that robustly dispatches flexible demand-side resources in unbalanced distribution feeders against uncertainty in very-short timescale solar Photo-Voltaic (PV) forecasts. This is valuable for power systems with significant behind-the-meter solar PV generation as their operation is affected by uncertainty from forecasts of demand and solar PV generation. The aim of this work is then to ensure the feasibility and reliability of distribution system operation under high solar PV penetration. We develop and present a novel, robust OPF formulation that accounts for both the nonlinear power flow constraints and the uncertainty in forecasts. This is achieved by linearizing an optimal trajectory and using first-order methods to systematically tighten voltage bounds. Case studies on a realistic distribution feeder shows the effectiveness of a receding-horizon implementation.
Left-orderability, branched covers and double twist knots

For some families of two-bridge knots, including double-twist knots with genus at least four, we determine precisely the set of integers $n>1$ such that the fundamental group of the $n$-fold cyclic branched cover of the 3-sphere along these knots is left-orderable. There are knots, including the figure-eight knot, for which this set is empty. We give the first class of hyperbolic knots, not of this type, for which these integers can be completely determined.
Cell-Type-Specific Proteogenomic Signal Diffusion for Integrating Multi-Omics Data Predicts Novel Schizophrenia Risk Genes.

Summary Accumulation of diverse types of omics data on schizophrenia (SCZ) requires a systems approach to model the interplay between genome, transcriptome, and proteome. We introduce Markov affinity-based proteogenomic signal diffusion (MAPSD), a method to model intra-cellular protein trafficking paradigms and tissue-wise single-cell protein abundances. MAPSD integrates multi-omics data to amplify the signals at SCZ risk loci with small effect sizes, and reveal convergent disease-associated gene modules in the brain. We predicted a set of high-confidence SCZ risk loci followed by characterizing the subcellular localization of proteins encoded by candidate SCZ risk genes, and illustrated that most are enriched in neuronal cells in the cerebral cortex as well as Purkinje cells in the cerebellum. We demonstrated how the identified genes may be involved in neurodevelopment, how they may alter SCZ-related biological pathways, and how they facilitate drug repurposing. MAPSD is applicable in other polygenic diseases and can facilitate our understanding of disease mechanisms.
Coupling kinetic theory approaches for pedestrian dynamics and disease contagion in a confined environment

The goal of this work is to study an infectious disease spreading in a medium size population occupying a confined environment. For this purpose, we consider a kinetic theory approach to model crow...
Impact of UAV Wobbling on the Air-to-Ground Wireless Channel

This paper studies the impact of unmanned aerial vehicle (UAV) wobbling on the coherence time of the wireless channel between UAVs and a ground user equipment (UE), using a Rician multi-path channel model. We consider two different scenarios for the number of UAVs: (i) single UAV scenario (SUS), and (ii) multiple UAV scenario (MUS). For each scenario, we model UAV wobbling by two random processes, i.e., the Wiener and sinusoidal processes, and characterize the channel autocorrelation function (ACF) which is then used to derive the coherence time of the channel. For the MUS, we further show that the UAV-UE channels for different UAVs are uncorrelated from each other. A key observation in this paper is that even for small UAV wobbling, the coherence time of the channel may degrade quickly, which may make it difficult to track the channel and establish a reliable communication link.
Repurposing Disulfiram (Tetraethylthiuram Disulfide) as A Potential Drug Candidate against Borrelia burgdorferi In Vitro and In Vivo

Lyme disease caused by the Borrelia burgdorferi (Bb or B. burgdorferi) is the most common vector-borne, multi-systemic disease in the USA. Although most Lyme disease patients can be cured with a course of the first line of antibiotic treatment, some patients are intolerant to currently available antibiotics, necessitating the development of more effective therapeutics. We previously found several drugs, including disulfiram, that exhibited effective activity against B. burgdorferi. In the current study, we evaluated the potential of repurposing the FDA-approved drug, disulfiram for its borreliacidal activity. Our results indicate disulfiram has excellent borreliacidal activity against both the log and stationary phase B. burgdorferi sensu stricto B31 MI. Treatment of mice with disulfiram eliminated the B. burgdorferi sensu stricto B31 MI completely from the hearts and urinary bladder by day 28 post infection. Moreover, disulfiram-treated mice showed reduced expressions of inflammatory markers, and thus they were protected from histopathology and cardiac organ damage. Furthermore, disulfiram-treated mice showed significantly lower amounts of total antibody titers (IgM and IgG) at day 21 and total IgG2b at day 28 post infection. FACS analysis of lymph nodes revealed a decrease in the percentage of CD19+ B cells and an increase in total percentage of CD3+ T cells, CD3+ CD4+ T helpers, and naive and effector memory cells in disulfiram-treated mice. Together, our findings suggest that disulfiram has the potential to be repurposed as an effective antibiotic for treating Lyme disease.
Rapid Variability in the Wind from the White Dwarf Merger Candidate J005311

We analyze time-series spectroscopy of the white dwarf merger candidate J005311 and confirm the unique nature of its optical spectrum. We detect an additional broad emission feature peaking at 343 nm that was predicted in the Gvaramadze et al. (2019) models. Comparing ten spectra taken with the Large Binocular Telescope, we find significant variability in the profile of the strong O vi 381.1/383.4 nm emission feature. This appears to be caused by rapidly shifting subpeaks generated by clumpiness in the stellar wind of J005311. This line variability is similar to what is seen in many Wolf-Rayet stars. However, in J005311, the rate of motion of the subpeaks appears exceedingly high as they can reach 16,000 km s−1 in less than two hours.
Revealing Oz: Institutional Work Shaping Auditors' National Office Consultations*

National office consultations (NOCs) are a mechanism intended to enhance audit quality, consistent with the logic of professionalism inherent in the audit profession. Yet research indicates that the competing logic of commercialism has become institutionalized in audit firms. We examine how the coexisting and conflicting logics of professionalism and commercialism manifest themselves in the current NOC dynamic. Specifically, we interview 22 highly experienced Big 4 audit firm partners to investigate how key actors engage in institutional work that creates, maintains, and disrupts the influence of professionalism and commercialism in NOC practices. We observe a swing of the pendulum: in the wake of SOX, audit firms adopted professionalism-based practices which involved creating a more authoritative, “Oz”-like national office identity, while in recent years key actors’ institutional work reconfigured NOC practices and placed a renewed focus on commercialism. Our findings bring to light a number of implications that offer opportunities for future research. Although the new client-inclusive culture aims to improve audit outcomes by encouraging consultations and fostering open dialogue with clients, it also exposes the national office to relationship management pressures and client service demands. Thus, practices developed to uphold professionalism also created a channel for commercialism-focused practices, leading to unintended second-order effects.
Cascade Codes for Distributed Storage Systems

A novel coding scheme for exact repair-regenerating codes is presented in this paper. The codes proposed in this work can trade between the repair bandwidth of nodes (number of downloaded symbols from each surviving node in a repair process) and the required storage overhead of the system. These codes work for general system parameters $(n,k,d)$ , which are the total number of nodes, the number of nodes suffice for data recovery, and the number of helper nodes in a repair process, respectively. The proposed construction offers a unified scheme to develop exact-repair regenerating codes for the entire trade-off, including the MBR and MSR points. We conjecture that the new storage-vs.-bandwidth trade-off achieved by the proposed codes is optimum. Some other key features of this code include: the construction is linear; the required field size is only $\Theta (n)$ ; and the code parameters and in particular sub-packetization level is at most $(d-k+1)^{k}$ ; which is independent of the number of the parity nodes. Moreover, the proposed repair mechanism is helper-independent , that is the data sent from each helper only depends on the identity of the helper and failed nodes, but independent of the identity of other helper nodes participating in the repair process.
A New Approach to the Council's Yearbooks

Members of the NCTM are certainly familiar with the excellent volumes produced as the Council's yearbooks. These yearbooks continue to serve as significant references throughout the varied facets of mathematical education. The dedicated leadership of the yearbook editors and the unselfish contributions of many authors have assured the high quality we have come to expect as each of the thirtyseven yearbooks has been released. Long and meticulous planning and production have often resulted in a considerable time
Symbol alphabets from plabic graphs

Symbol alphabets of n-particle amplitudes in $$ \mathcal{N} $$ = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.
A platform incorporating trimeric antigens into self-assembling nanoparticles reveals SARS-CoV-2-spike nanoparticles to elicit substantially higher neutralizing responses than spike alone.

Antigens displayed on self-assembling nanoparticles can stimulate strong immune responses and have been playing an increasingly prominent role in structure-based vaccines. However, the development of such immunogens is often complicated by inefficiencies in their production. To alleviate this issue, we developed a plug-and-play platform using the spontaneous isopeptide-bond formation of the SpyTag:SpyCatcher system to display trimeric antigens on self-assembling nanoparticles, including the 60-subunit Aquifex aeolicus lumazine synthase (LuS) and the 24-subunit Helicobacter pylori ferritin. LuS and ferritin coupled to SpyTag expressed well in a mammalian expression system when an N-linked glycan was added to the nanoparticle surface. The respiratory syncytial virus fusion (F) glycoprotein trimer—stabilized in the prefusion conformation and fused with SpyCatcher—could be efficiently conjugated to LuS-SpyTag or ferritin-SpyTag, enabling multivalent display of F trimers with prefusion antigenicity. Similarly, F-glycoprotein trimers from human parainfluenza virus-type 3 and spike-glycoprotein trimers from SARS-CoV-2 could be displayed on LuS nanoparticles with decent yield and antigenicity. Notably, murine vaccination with 0.08 µg of SARS-CoV-2 spike-LuS nanoparticle elicited similar neutralizing responses as 2.0 µg of spike, which was ~ 25-fold higher on a weight-per-weight basis. The versatile platform described here thus allows for multivalent plug-and-play presentation on self-assembling nanoparticles of trimeric viral antigens, with SARS-CoV-2 spike-LuS nanoparticles inducing particularly potent neutralizing responses.
On the use of multigrid preconditioners for topology optimization

Topology optimization for large-scale problems continues to be a computational challenge. Several works exist in the literature to address this topic, and all make use of iterative solvers to handle the linear system arising from the finite element analysis (FEA). However, the preconditioners used in these works vary, and in many cases are notably suboptimal. A handful of works have already demonstrated the effectiveness of geometric multigrid (GMG) preconditioners in topology optimization. We provide a direct comparison of GMG preconditioners with algebraic multigrid (AMG) preconditioners. We demonstrate that AMG preconditioners offer improved robustness over GMG preconditioners as topologies evolve, albeit with a higher overhead cost. In 2D the gain from increased robustness more than offsets the overhead cost. However, in 3D the overhead becomes prohibitively large. We thus demonstrate the benefits of mixing geometric and algebraic methods to limit overhead cost while improving robustness, particularly in 3D.
Central Stars of Planetary Nebulae in the Magellanic Clouds: A Detailed Spectroscopic Analysis*

We observed five central stars of planetary nebulae (CSPN) in the LMC and three in the SMC with FUSE, in the range 905-1187 A. We performed a model-based analysis of these spectra in conjunction with HST spectra in the UV and optical range to determine stellar and nebular parameters. The signature of hot (T 2000 K) circumstellar molecular hydrogen is found in the FUSE spectra of most objects. We also find evidence of X-rays in the wind of SMP LMC 76.
Two-Photon Exchange: Future Experimental Prospects

The proton elastic form factor ratio is accessible in unpolarized Rosenbluth-type experiments as well as experiments which make use of polarization degrees of freedom. The extracted values show a distinct discrepancy, growing with $$Q^2$$ . Three recent experiments tested the proposed explanation, two-photon exchange, by measuring the positron–proton to electron–proton cross section ratio. In the results, a hard two-photon exchange effect at the couple-of-percent level is visible, significantly different from theoretical calculation. Theory at larger momentum transfer remains untested. This paper discusses the possibilities for future measurements at larger momentum transfer.
Entanglement evolution across a conformal interface

For two-dimensional conformal field theories (CFTs) in the ground state, it is known that a conformal interface along the entanglement cut can suppress the entanglement entropy from to , where L is the length of the subsystem A, and is the effective central charge which depends on the transmission property of the conformal interface. In this work, by making use of conformal mappings, we show that a conformal interface has the same effect on entanglement evolution in non-equilibrium cases, including global, local and certain inhomogeneous quantum quenches. I.e. a conformal interface suppresses the time evolution of entanglement entropy by effectively replacing the central charge c with , where is exactly the same as that in the ground state case. We confirm this conclusion by a numerical study on a critical fermion chain. Furthermore, based on the quasi-particle picture, we conjecture that this conclusion holds for an arbitrary quantum quench in CFTs, as long as the initial state can be described by a regularized conformal boundary state.
Automatic generation of efficient sparse tensor format conversion routines

This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases: coordinate remapping, analysis, and assembly. We then develop a language that precisely describes how different formats group together and order a tensor’s nonzeros in memory. This lets a compiler emit code that performs complex remappings of nonzeros when converting between formats. We also develop a query language that can extract statistics about sparse tensors, and we show how to emit efficient analysis code that computes such queries. Finally, we define an abstract interface that captures how data structures for storing a tensor can be efficiently assembled given specific statistics about the tensor. Disparate formats can implement this common interface, thus letting a compiler emit optimized sparse tensor conversion code for arbitrary combinations of many formats without hard-coding for any specific combination. Our evaluation shows that the technique generates sparse tensor conversion routines with performance between 1.00 and 2.01× that of hand-optimized versions in SPARSKIT and Intel MKL, two popular sparse linear algebra libraries. And by emitting code that avoids materializing temporaries, which both libraries need for many combinations of source and target formats, our technique outperforms those libraries by 1.78 to 4.01× for CSC/COO to DIA/ELL conversion.
On the optimal design of wall-to-wall heat transport

We consider the variational problem of achieving optimal transport of heat through an incompressible fluid layer. Modeling passive scalar transport by advection-diffusion, we maximize the mean rate of total transport by a divergence-free velocity field. Subject to various boundary conditions and intensity constraints, we prove that the maximal rate of transport scales linearly in the r.m.s. kinetic energy and, up to possible logarithmic corrections, as the $1/3$rd power of the mean enstrophy in the advective regime. This makes rigorous a previous prediction on the near optimality of convection rolls for energy-constrained transport. Optimal designs for enstrophy-constrained transport are significantly more difficult to describe: we introduce a "branching" construction with an unbounded number of degrees of freedom and prove it achieves nearly optimal transport. The main technical tool behind these results is a variational principle for evaluating the transport of candidate designs. This principle admits dual formulations for bounding transport from above and below. While the upper bound is closely related to the "background method", the lower bound reveals a connection between the optimal design problems considered herein and other apparently related model problems from mathematical materials science. These connections serve to motivate designs.
Higher spin Chern–Simons theory and the super Boussinesq hierarchy

Author(s): Gutperle, Michael; Li, Yi | Abstract: In this paper, we construct a map between a solution of supersymmetric Chern–Simons higher spin gravity based on the superalgebra [Formula: see text] with Lifshitz scaling and the [Formula: see text] super Boussinesq hierarchy. We show that under this map the time evolution equations of both theories coincide. In addition, we identify the Poisson structure of the Chern–Simons theory induced by gauge transformation with the second Hamiltonian structure of the super Boussinesq hierarchy.
Dynamics of Orthonormal Bases Associated to Basins of Attraction

Alpay et al. (in: Recent advances in inverse scattering, Schur analysis, and stochastic processes, Springer, Berlin, pp 67–87, 2015), a technique was developed which allows for the construction of a reproducing kernel Hilbert space on basins of attraction containing 0. When the right conditions are met, an explicit orthonormal basis can be constructed using a particular class of operators. It is natural then to consider how the orthonormal basis changes as we let the basin of attraction vary. We will consider this question for the basins of attraction containing 0 of the family of polynomials \(\mathcal {F} = \{az^{2^{n+2}}-2az^{2^{n+1}}:a\ne 0\}\), where \(n\in \mathbb {N}\).
Optically Loaded Semiconductor Quantum Memory Register

Long-distance quantum communication requires transmitting, buffering, and processing quantum information via nodes called quantum repeaters. Unfortunately, current technology is suited for either communication or storage, but not both simultaneously. To address this challenge, the authors propose an all-semiconductor hybrid quantum device that capacitively couples an optically active quantum-dot molecule to a gated-dot array. This optoelectronic device, which could be orders of magnitude faster than today's repeaters, emits a photon whose polarization is entangled with the electron spins in the array.
Distributing points uniformly on the unit sphere under a mirror reflection symmetry constraint

Abstract Uniformly distributed point sets on the unit sphere with and without symmetry constraints have been found useful in many scientific and engineering applications. Here, a novel variant of the Thomson problem is proposed and formulated as an unconstrained optimization problem. While the goal of the Thomson problem is to find the minimum energy configuration of N electrons constrained on the surface of the unit sphere, this novel variant imposes a new symmetry constraint – mirror reflection symmetry with the x–y plane as the plane of symmetry. Qualitative features of the two-dimensional projection of the optimal configurations are briefly mentioned and compared to the ground-state configurations of the two dimensional system of charged particles laterally confined by a parabolic potential well.
Gauss sums, Stickelberger’s theorem and the Gras conjecture for ray class groups

Let $k$ be a real abelian number field and $p$ an odd prime not dividing $[k:\mathbb{Q}]$. For a natural number $d$, let $E_d$ denote the group of units of $k$ congruent to $1$ modulo $d$, $C_d$ the subgroup of $d$-circular units of $E_d$, and $\mathfrak{C}(d)$ the ray class group of modulus $d$. Let $\rho$ be an irreducible character of $G=\mathrm{Gal}(k/\mathbb{Q})$ over $\mathbb{Q}_p$ and $e_{\rho} \in \mathbb{Z}_p[G]$ the corresponding idempotent. We show that if the ramification index of $p$ in $k$ is less than $p-1$, then $|e_{\rho} \mathrm{Syl}_p(E_d/C_d) | = |e_{\rho} \mathrm{Syl}_p(\mathfrak{C}_d)|$ where $\mathfrak{C}_d$ is the part of $\mathfrak{C}(d)$ where $G$ acts non-trivially. This is a ray class version of the Gras Conjecture. In the case when $p \mid [k:\mathbb{Q}]$, similar but slightly less precise results are obtained. In particular, beginning with what could be considered a Gauss sum for real fields, we construct explicit Galois annihilators of $\mathrm{Syl}_p(\mathfrak{C}_{\mathfrak{a}})$ akin to the classical Stickelberger Theorem.
Deep Learning for Robotic Mass Transport Cloaking

In this article, we consider the problem of mass transport cloaking using mobile robots. The robots move along a predefined curve that encloses a safe zone and carry sources that collectively counteract a chemical agent released in the environment. The goal is to steer the mass flux around a desired region so that it remains unaffected by the external concentration. We formulate the problem of controlling the robot positions and release rates as a partial differential equation (PDE)-constrained optimization, where the propagation of the chemical is modeled by the advection-diffusion (AD) PDE. We use a neural network (NN) to approximate the solution of the PDE. Particularly, we propose a novel loss function for the NN that utilizes the variational form of the AD-PDE and allows us to reformulate the planning problem as an unsupervised model-based learning problem. Our loss function is discretization-free and highly parallelizable. Unlike passive cloaking methods that use metamaterials to steer the mass flux, our method is the first to use mobile robots to actively control the concentration levels and create safe zones independent of environmental conditions. We demonstrate the performance of our method in simulations.
On fields of rationality for automorphic representations

This paper proves two results on the field of rationality Q(�) for an automorphic representa- tion �, which is the subfield of C fixed under the subgroup of Aut(C) stabilizing the isomorphism class of the finite part of �. For general linear groups and classical groups, our first main result is the finiteness of the set of discrete automorphic representationssuch thatis unramified away from a fixed finite set of places, �1 has a fixed infinitesimal character, and (Q(�) : Q) is bounded. The second main result is that for classical groups, (Q(�) : Q) grows to infinity in a family of automorphic representations in level aspect whose infinite components are discrete series in a fixed L-packet under mild conditions.
X-Ray Emission from Planetary Nebulae. I. Spherically Symmetric Numerical Simulations

The interaction of a fast wind with a spherical asymptotic giant branch (AGB) wind is thought to be the basic mechanism for shaping pre-planetary nebulae (PPNs) and later planetary nebulae (PNs). Due to the large speed of the fast wind, one expects extended X-ray emission from these objects, but X-ray emission has only been detected in a small fraction of PNs and only in one PPN. Using numerical simulations we investigate the constraints that can be set on the physical properties of the fast wind (speed, mass flux, opening angle) in order to produce the observed X-ray emission properties of PPNs and PNs. We combine numerical hydrodynamic simulations including radiative cooling using the code FLASH with calculations of the X-ray properties of the resulting expanding hot bubble using the atomic database ATOMDB. In this first study, we compute X-ray fluxes and spectra using one-dimensional models. Comparing our results with analytical solutions, we find some agreements and many disagreements. These disagreements, which are both qualitative and quantitative in nature, argue for the necessity of using numerical simulations for understanding the X-ray properties of PNs. We apply our spherical models to the objects BD +30 3639 and NGC 40. We find that the model values of the X-ray temperature and luminosity for these objects are significantly higher than observed values and discuss several mechanisms for resolving the discrepancies.
Quaternion-Based Self-Attentive Long Short-term User Preference Encoding for Recommendation

Quaternion space has brought several benefits over the traditional Euclidean space: Quaternions (i) consist of a real and three imaginary components, encouraging richer representations; (ii) utilize Hamilton product which better encodes the inter-latent interactions across multiple Quaternion components; and (iii) result in a model with smaller degrees of freedom and less prone to overfitting. Unfortunately, most of the current recommender systems rely on real-valued representations in Euclidean space to model either user's long-term or short-term interests. In this paper, we fully utilize Quaternion space to model both user's long-term and short-term preferences. We first propose a QUaternion-based self-Attentive Long term user Encoding (QUALE) to study the user's long-term intents. Then, we propose a QUaternion-based self-Attentive Short term user Encoding (QUASE) to learn the user's short-term interests. To enhance our models' capability, we propose to fuse QUALE and QUASE into one model, namely QUALSE, by using a Quaternion-based gating mechanism. We further develop Quaternion-based Adversarial learning along with the Bayesian Personalized Ranking (QABPR) to improve our model's robustness. Extensive experiments on six real-world datasets show that our fused QUALSE model outperformed 11 state-of-the-art baselines, improving 8.43% at HIT@1 and 10.27% at NDCG@1 on average compared with the best baseline.
A robotic vision system to measure tree traits

The autonomous measurement of tree traits, such as branching structure, branch diameters, branch lengths, and branch angles, is required for tasks such as robotic pruning of trees as well as structural phenotyping. We propose a robotic vision system called the Robotic System for Tree Shape Estimation (RoTSE) to determine tree traits in field settings. The process is composed of the following stages: image acquisition with a mobile robot unit, segmentation, reconstruction, curve skeletonization, conversion to a graph representation, and then computation of traits. Quantitative and qualitative results on apple trees are shown in terms of accuracy, computation time, and robustness. Compared to ground truth measurements, the RoTSE produced the following estimates: branch diameter (mean-squared error 0.99 mm), branch length (mean-squared error 45.64 mm), and branch angle (mean-squared error 10.36 degrees). The average run time was 8.47 minutes when the voxel resolution was 3 mm3.
Framing difficulties in quantum mechanics

Three types of framing errors help to explain the underlying structure of student difficulties in quantum mechanics.