cssi/SciSciGPT-SciSciNet huggingface dataset:
Capacity region of the symmetric injective K-user Deterministic Interference Channel

We characterize the capacity region of the symmetric injective K-user Deterministic Interference Channel (DIC) for all channel parameters. The achievable rate region is derived by first projecting the achievable rate region of Han-Kobayashi (HK) scheme, which is in terms of common and private rates for each user, along the direction of aggregate rates for each user (i.e., the sum of common and private rates). We then show that the projected region is characterized by only the projection of those facets in the HK region for which the coefficient of common rate and private rate are the same for all users, hence simplifying the region. Furthermore, we derive a tight converse for each facet of the simplified achievable rate region.
Online network coding for optimal throughput and delay - the three-receiver case

For a packet erasure broadcast channel with three receivers, we propose a new coding algorithm that makes use of feedback to dynamically adapt the code. Our algorithm is throughput optimal, and we conjecture that it also achieves an asymptotically optimal average decoding delay at the receivers. We consider heavy traffic asymptotics, where the load factor rho approaches 1 from below with either the arrival rate (lambda) or the channel parameter (mu) being fixed at a number less than 1. We verify through simulations that our algorithm achieves an asymptotically optimal decoding delay of O (1/1-rho).
Local automorphisms of finitary incidence algebras

Abstract Let R be a commutative, indecomposable ring with identity and ( P , ≤ ) a partially ordered set. Let F I ( P ) denote the finitary incidence algebra of ( P , ≤ ) over R. We will show that, in most cases, local automorphisms of F I ( P ) are actually R-algebra automorphisms. In fact, the existence of local automorphisms which fail to be R-algebra automorphisms will depend on the chosen model of set theory and will require the existence of measurable cardinals. We will discuss local automorphisms of cartesian products as a special case in preparation of the general result.
Isospectral graph reductions and improved estimates of matrices’ spectra

Via the process of isospectral graph reduction the adjacency matrix of a graph can be reduced to a smaller matrix while its spectrum is preserved up to some known set. It is then possible to estimate the spectrum of the original matrix by considering Gershgorin-type estimates associated with the reduced matrix. The main result of this paper is that eigenvalue estimates associated with Gershgorin, Brauer, Brualdi, and Varga improve as the matrix size is reduced. Moreover, given that such estimates improve with each successive reduction, it is also possible to estimate the eigenvalues of a matrix with increasing accuracy by repeated use of this process.
Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair

Recent works by Ahmad et al. and by Hollmann studied the concept of “locally repairable regenerating codes (LRRCs)” that successfully combines the functional repair and partial information exchange of regenerating codes (RCs) with the much-desired local repairability feature of locally repairable codes (LRCs). One important issue that needs to be addressed by any local repair schemes (including both LRCs and LRRCs) is that sometimes designated helper nodes may be temporarily unavailable, the result of various reasons that include multiple failures, degraded reads, or power-saving strategies to name a few. Under the setting of LRRCs with temporary node unavailability, this paper studies the impact of different helper selection methods. It proves that with node unavailability, all existing methods of helper selection, including those used in RCs and LRCs, can be insufficient in terms of achieving the optimal repair-bandwidth. For some scenarios, it is necessary to combine LRRCs with a new class of helper selection methods, termed dynamic helper selection , to achieve optimal repair-bandwidth. This paper also compares the performance of different classes of helper selection methods and answers the following fundamental question: is one method of helper selection intrinsically better than the other? for various scenarios.
Linear-Response Density Cumulant Theory for Excited Electronic States

We present a linear-response formulation of density cumulant theory (DCT) that provides a balanced and accurate description of many electronic states simultaneously. In the original DCT formulation, only information about a single electronic state (usually, the ground state) is obtained. We discuss the derivation of linear-response DCT, present its implementation for the ODC-12 method (LR-ODC-12), and benchmark its performance for excitation energies in small molecules (N2, CO, HCN, HNC, C2H2, and H2CO), as well as challenging excited states in ethylene, butadiene, and hexatriene. For small molecules, LR-ODC-12 shows smaller mean absolute errors in excitation energies than equation-of-motion coupled cluster theory with single and double excitations (EOM-CCSD), relative to the reference data from EOM-CCSDT. In a study of butadiene and hexatriene, LR-ODC-12 correctly describes the relative energies of the singly excited 11Bu and the doubly excited 21Ag states, in excellent agreement with highly accurate sem...
$(k,\lambda)$-Anti-Powers and Other Patterns in Words

Given a word, we are interested in the structure of its contiguous subwords split into $k$ blocks of equal length, especially in the homogeneous and anti-homogeneous cases. We introduce the notion of $(\mu_1,\dots,\mu_k)$-block-patterns, words of the form $w = w_1\cdots w_k$ where, when $\{w_1,\dots,w_k\}$ is partitioned via equality, there are $\mu_s$ sets of size $s$ for each $s \in \{1,\dots,k\}$. This is a generalization of the well-studied $k$-powers and the $k$-anti-powers recently introduced by Fici, Restivo, Silva, and Zamboni, as well as a refinement of the $(k,\lambda)$-anti-powers introduced by Defant. We generalize the anti-Ramsey-type results of Fici et al. to $(\mu_1,\dots,\mu_k)$-block-patterns and improve their bounds on $N_\alpha(k,k)$, the minimum length such that every word of length $N_\alpha(k,k)$ on an alphabet of size $\alpha$ contains a $k$-power or $k$-anti-power. We also generalize their results on infinite words avoiding $k$-anti-powers to the case of $(k,\lambda)$-anti-powers. We provide a few results on the relation between $\alpha$ and $N_\alpha(k,k)$ and find the expected number of $(\mu_1,\dots,\mu_k)$-block-patterns in a word of length $n$.
How Much Knowledge Is Too Little? When a Lack of Knowledge Becomes a Barrier to Comprehension:

Have you ever found it difficult to read something because you lack knowledge on the topic? We investigated this phenomenon with a sample of 3,534 high school students who took a background-knowledge test before working on a reading-comprehension test on the topic of ecology. Broken-line regression revealed a knowledge threshold: Below the threshold, the relationship between comprehension and knowledge was weak (β = 0.18), but above the threshold, a strong and positive relation emerged (β = 0.81). Further analyses indicated that certain topically relevant words (e.g., ecosystem, habitat) were more important to know than others when predicting the threshold, and these keywords could be identified using natural-language-processing techniques. Collectively, these results may help identify who is likely to have a problem comprehending information on a specific topic and, to some extent, what knowledge is likely required to comprehend information on that topic.
Moduli Spaces of q-Connections and Gap Probabilities

Our goal is to show that the one-interval gap probability for the q-Hahn orthogonal polynomial ensemble can be expressed through a solution of the asymmetric q-Painleve V equation. The case of the q-Hahn ensemble we consider is the most general case of the orthogonal polynomial ensembles that have been studied. Our approach is based on the analysis of q-connections on the Riemann sphere with a particular singularity structure. It requires a new derivation of a q-difference equation of Sakai's hierarchy of type A_{2}^{(1)}. We also calculate its Lax pair.
Enumeration of Lozenge Tilings of Halved Hexagons with a Boundary Defect

We generalize a special case of a theorem of Proctor on the enumeration of lozenge tilings of a hexagon with a maximal staircase removed using Kuo’s graphical condensation method. Additionally, we prove a formula for a weighted version of the given region. The result also extends work of Ciucu and Fischer. By applying the factorization theorem of Ciucu, we are also able to generalize a special case of MacMahon’s boxed plane partition formula.
Execution templates: caching control plane decisions for strong scaling of data analytics

Control planes of cloud frameworks trade off between scheduling granularity and performance. Centralized systems schedule at task granularity, but only schedule a few thousand tasks per second. Distributed systems schedule hundreds of thousands of tasks per second but changing the schedule is costly. We present execution templates, a control plane abstraction that can schedule hundreds of thousands of tasks per second while supporting fine-grained, per-task scheduling decisions. Execution templates leverage a program's repetitive control flow to cache blocks of frequently-executed tasks. Executing a task in a template requires sending a single message. Large-scale scheduling changes install new templates, while small changes apply edits to existing templates. Evaluations of execution templates in Nimbus, a data analytics framework, find that they provide the fine-grained scheduling flexibility of centralized control planes while matching the strong scaling of distributed ones. Execution templates support complex, real-world applications, such as a fluid simulation with a triply nested loop and data dependent branches.
Joint uplink-downlink cell associations for interference networks with local connectivity

We study information theoretic models of interference networks that consist of K Base Station (BS) — Mobile Terminal (MT) pairs. Each BS is connected to the MT carrying the same index as well as L following MTs, where the connectivity parameter L ≥ 1. We fix the value of L and study large networks as K goes to infinity. We assume that each MT can be associated with N c BSs, and these associations are determined by a cloud-based controller that has a global view of the network. An MT has to be associated with a BS, in order for the BS to transmit its message in the downlink, or decode its message in the uplink. In previous work, the cell associations that maximize the average uplink-downlink per user degrees of freedom (puDoF) were identified for the case when L =1. Further, when only the downlink is considered, the problem was settled for all values of L when we are restricted to use only zero-forcing interference cancellation schemes. In this work, we first propose puDoF inner bounds for arbitrary values of L when only the uplink is considered, and characterize the uplink puDoF value when only zero-forcing schemes are allowed and N c ≥ L. We then introduce new achievable average uplink-downlink puDoF values, and conjecture that the new scheme is optimal for all values of L, when we restrict our attention to zero-forcing schemes.
Fully non-linear elliptic equations on compact Hermitian manifolds

We derive a priori estimates for solutions of a general class of fully non-linear equations on compact Hermitian manifolds. Our method is based on ideas that have been used for different specific equations, such as the complex Monge–Ampere, Hessian and inverse Hessian equations. As an application we solve a class of Hessian quotient equations on Kahler manifolds assuming the existence of a suitable subsolution. The method also applies to analogous equations on compact Riemannian manifolds.
Some criteria for the symmetry of stratified water waves

This paper considers two-dimensional stably stratified steady periodic gravity water waves with surface profiles monotonic between crests and troughs. We provide sufficient conditions under which such waves are necessarily symmetric. This is done by first exploiting some elliptic structure in the governing equations to show that, in certain size regimes, a maximum principle holds. This then forms the basis for a method of moving planes argument.
Covering 2-connected 3-regular graphs with disjoint paths

A path cover of a graph is a set of disjoint paths so that every vertex in the graph is contained in one of the paths. The path cover number $p(G)$ of graph $G$ is the cardinality of a path cover with the minimum number of paths. Reed in 1996 conjectured that a $2$-connected $3$-regular graph has path cover number at most $\lceil n/10\rceil$. In this paper, we confirm this conjecture.
Modulational instability in a full‐dispersion shallow water model

We propose a shallow water model which combines the dispersion relation of water waves and the Boussinesq equations, and which extends the Whitham equation to permit bidirectional propagation. We establish that its sufficiently small, periodic wave train is spectrally unstable to long wavelength perturbations, provided that the wave number is greater than a critical value, like the Benjamin-Feir instability of a Stokes wave. We verify that the asso- ciated linear operator possesses infinitely many collisions of purely imaginary eigenvalues, but they do not contribute to instability away from the origin in the spectral plane to the leading order in the amplitude parameter. We discuss the effects of surface tension on the modulational instability. The results agree with those from formal asymptotic expansions and numerical computations for the physical problem.
A Novel Decomposition for Control of DC Circuits and Grid Models with Heterogeneous Energy Sources

The way in which electric power depends on the topology of circuits with mixed voltage and current sources is examined. The power flowing in any steady-state DC circuit is shown to depend on a minimal set of key variables called fundamental node voltages and fundamental edge currents. Every steady-state DC circuit can be decomposed into a voltage controlled subcircuit and a current controlled subcircuit. In terms of such a decomposition, the $I^{2}R$ losses of a mixed source circuit are always the sum of losses on the voltage controlled subcircuit and the current controlled subcircuit. The paper concludes by showing that the total power flowing in a mixed source circuit can be found as critical points of the power expressed in terms of the key voltage and current variables mentioned above. The possible relationship to topology control of electric grid operations is discussed.
Residual Cauchy-Type Formula on Riemann Surfaces

We construct a Cauchy-type formula on open subdomains of Riemann surfaces of the form \({{\widetilde{V}}}=\left\{ z\in \mathbb {C}\mathbb {P}^2: P(z)=0\right\} \).
Time-series analysis of photovoltaic distributed generation impacts on a local distributed network

Increasing penetration level of photovoltaic (PV) distributed generation (DG) into distribution networks will have many impacts on nominal circuit operating conditions including voltage quality and reverse power flow issues. In U.S. most studies on PVDG impacts on distribution networks are performed for west coast and central states. The objective of this paper is to study the impacts of PVDG integration on a local distribution network based on real-world settings for network parameters and time-series analysis. PVDG penetration level is considered to find the hosting capacity of the network without having major issues in terms of voltage quality and reverse power flow. Time-series analyses show that distributed installation of PVDGs on commercial buses has the maximum network energy loss reduction and larger penetration ratios for them. Additionally, the penetration ratio thresholds for which there will be no power quality and reverse power flow issues and optimal allocation of PVDG and penetration levels are identified for different installation scenarios.
Pointlike sets for varieties determined by groups

Abstract For a variety of finite groups H , let H ‾ denote the variety of finite semigroups all of whose subgroups lie in H . We give a characterization of the subsets of a finite semigroup that are pointlike with respect to H ‾ . Our characterization is effective whenever H has a decidable membership problem. In particular, the separation problem for H ‾ -languages is decidable for any decidable variety of finite groups H . This generalizes Henckell's theorem on decidability of aperiodic pointlikes.
On Motzkin’s method for inconsistent linear systems

Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin’s method, can be viewed as an iterative method that projects the current estimation onto the solution hyperplane corresponding to the most violated constraint. Although this leads to an optimal selection strategy for consistent systems, for inconsistent least square problems, the strategy presents a tradeoff between convergence rate and solution accuracy. We provide a theoretical analysis that shows Motzkin’s method offers an initially accelerated convergence rate and this acceleration depends on the dynamic range of the residual. We quantify this acceleration for Gaussian systems as a concrete example. Lastly, we include experimental evidence on real and synthetic systems that support the analysis.
Behavioral training of marmosets and electrophysiological recording from the cerebellum

Marmosets present the opportunity to investigate genetically based neurological disease in primates, in particular, diseases that affect social behaviors, vocal communication, and eye movements. Al...
Quantum Security of Hash Functions and Property-Preservation of Iterated Hashing

This work contains two major parts: comprehensively studying the security notions of cryptographic hash functions against quantum attacks and the relationships between them; and revisiting whether Merkle-Damgard and related iterated hash constructions preserve the security properties of the compression function in the quantum setting. Specifically, we adapt the seven notions in Rogaway and Shrimpton (FSE’04) to the quantum setting and prove that the seemingly stronger attack model where an adversary accesses a challenger in quantum superposition does not make a difference. We confirm the implications and separations between the seven properties in the quantum setting, and in addition we construct explicit examples separating an inherently quantum notion called collapsing from several proposed properties. Finally, we pin down the properties that are preserved under several iterated hash schemes. In particular, we prove that the ROX construction in Andreeva et al. (Asiacrypt’07) preserves the seven properties in the quantum random oracle model.
Novel derivatives of anaplastic lymphoma kinase inhibitors: Synthesis, radiolabeling, and preliminary biological studies of fluoroethyl analogues of crizotinib, alectinib, and ceritinib

Anaplastic lymphoma kinase (ALK), an oncogenic receptor tyrosine kinase, is a therapeutic target in various cancers, including non-small cell lung cancer. Although several ALK inhibitors, including crizotinib, ceritinib, and alectinib, are approved for cancer treatment, their long-term benefit is often limited by the cancer's acquisition of resistance owing to secondary point mutations in ALK. Importantly, some ALK inhibitors cannot cross the blood-brain barrier (BBB) and thus have little or no efficacy against brain metastases. The introduction of a lipophilic moiety, such as a fluoroethyl group may improve the drug's BBB penetration. Herein, we report the synthesis of fluoroethyl analogues of crizotinib 1, alectinib 4, and ceritinib 9, and their radiolabeling with 18F for pharmacokinetic studies. The fluoroethyl derivatives and their radioactive analogues were obtained in good yields with high purity and good molar activity. A cytotoxicity screen in ALK-expressing H2228 lung cancer cells showed that the analogues had up to nanomolar potency and the addition of the fluorinated moiety had minimal impact overall on the potency of the original drugs. Positron emission tomography in healthy mice showed that the analogues had enhanced BBB penetration, suggesting that they have therapeutic potential against central nervous system metastases.
All Out of Proportion: The Ongoing Disagreement about Structured Proportionality in Australia:

In 2015, a majority of the High Court of Australia incorporated structured proportionality testing into Australian constitutional law for the first time, but the test’s suitability for Australian l...
The Law and Economics of Tort Liability for Human Rights Violations in Global Supply Chains

The human rights of foreign workers in global supply chains are routinely violated, yet the problem so far has largely evaded a legal solution. Economic analysis shows why domestic tort liability can partially address this problem. Many consumers in developed countries have a lower willingness-to-pay for products produced by global supply chains that systemically subject foreign workers to egregiously dangerous working conditions in gross violation of their human rights. This attribute of consumer demand provides a basis for subjecting the domestic chain leader to domestic tort liability for the bodily injuries suffered by these foreign workers, including those employed by independent suppliers. Chain leaders, like other product sellers, are obligated to warn about foreseeable safety risks that are not known by consumers and would be material to their decision about whether to purchase or use a product. The tort duty also requires sellers to instruct consumers about the ways in which the purchase or use of the product might foreseeably harm third parties. A domestic seller that is the chain leader of a global supply chain would breach this duty by not warning domestic consumers that the product is produced by foreign workers who are systemically subjected to working conditions that are so unsafe as to amount to a gross violation of their human rights. Because the purchase of the product foreseeably exposes foreign workers to this ongoing risk of physical harm, they are protected by the tort duty and can recover for its breach. Causation can be established by the logic of the breached tort duty. If consumers had been warned that the product is produced in such a systemically unsafe work environment, a substantial number of them would not have purchased it--they would instead have purchased the same product at the higher price necessary to protect the foreign workers from these ongoing safety violations. By distorting consumer demand in this manner, the domestic product seller’s failure to warn domestic consumers of these human rights violations in the global supply chain proximately caused injury to these foreign workers, entitling them to compensation. By remedying these human rights violations, domestic chain leaders would satisfy the reasonable expectations of domestic consumers who have altruistic preferences to rescue foreign workers from extreme dangers within the production process. Tort law cannot redress the full range of human rights violations in global supply chains, but consumer demand provides a sound basis for tort liability that addresses a limited, though important component of the problem.
Geochemical conditions conducive for retention of trace elements and radionuclides during shale–fluid interactions

Produced water generated during unconventional oil and gas extractions contains a complex milieu of natural and anthropogenic potentially toxic chemical constituents including arsenic (As), chromium (Cr), and cadmium (Cd), naturally occurring radioactive materials (NORMs) including U and Ra, and a myriad of organic compounds. The human-ecological health risks and challenges associated with the disposal of produced water may be alleviated by understanding geochemical controls on processes responsible for the solubilization of potentially hazardous natural shale constituents to produced water. Here, we investigated, through a series of batch treatments, the leaching behavior of As, Se, Cu, Fe, Ba, Cr, Cd, and radioactive nuclides U, Ra from shale to produced water. Specifically, the effect of four major controls on element mobility was studied: (1) solution pH, (2) ionic strength of the solution, (3) oxic-anoxic conditions, and (4) an additive used in fracking fluid. The mobilization of metals and metalloids from shale was greatest in treatments containing sodium persulfate, an oxidant and a commonly used additive in fracture fluid. In the high ionic strength treatments, dissolved Ba concentrations increased 5-fold compared to low ionic strength treatments. Overall, anoxic conditions superimposed with low pH resulted in the largest increase of dissolved metals and radionuclides such as Ra. Overall, our results suggest that (1) limiting pore water acidification by injection of alkaline fluid in carbonate-low shale and (2) minimizing strong oxidizing conditions in shale formations may result in cost-effective in situ retention of produced water contaminants.
Imaging of Bunkers Under Slightly Rough Terrain With Clutter-Suppressed, Subsurface Interferometric SAR

A subsurface interferometric synthetic aperture radar (SAR) imaging technique is proposed for the detection and localization of clandestine underground facilities in the presence of a rough ground surface. The new approach consists of a two-step procedure: first, exploiting the distinctive scattering behaviors of the ground surface and the target, clutter suppression is performed with a polarimetric difference operation that does not alter the propagation phase of the target scattered signal, and then, a subsurface interferometric algorithm is applied to infer target depth by correlating the clutter-suppressed images obtained at two observation angles. The performance of the overall sensing algorithm for scene depth profile mapping from an airborne system is demonstrated with full-wave simulation data.
De-noising by thresholding operator adapted wavelets

Donoho and Johnstone (Ann Stat 26(3):879–921, 1998) proposed a method from reconstructing an unknown smooth function u from noisy data $$u+\zeta $$ by translating the empirical wavelet coefficients of $$u+\zeta $$ towards zero. We consider the situation where the prior information on the unknown function u may not be the regularity of u but that of $$ {\mathcal {L}}u$$ where $${\mathcal {L}}$$ is a linear operator (such as a PDE or a graph Laplacian). We show that the approximation of u obtained by thresholding the gamblet (operator adapted wavelet) coefficients of $$u+\zeta $$ is near minimax optimal (up to a multiplicative constant), and with high probability, its energy norm (defined by the operator) is bounded by that of u up to a constant depending on the amplitude of the noise. Since gamblets can be computed in $${\mathcal {O}}(N {\text {polylog}} N)$$ complexity and are localized both in space and eigenspace, the proposed method is of near-linear complexity and generalizable to nonhomogeneous noise.
End-to-End Latent Fingerprint Search

Latent fingerprints are one of the most important and widely used sources of evidence in law enforcement and forensic agencies. Yet the performance of the state-of-the-art latent recognition systems is far from satisfactory, and they often require manual markups to boost the latent search performance. Further, the COTS systems are proprietary and do not output the true comparison scores between a latent and reference prints to conduct quantitative evidential analysis. We present an end-to-end latent fingerprint search system, including automated region of interest (ROI) cropping, latent image preprocessing, feature extraction, feature comparison, and outputs a candidate list. Two separate minutiae extraction models provide complementary minutiae templates. To compensate for the small number of minutiae in small ridge area and poor quality latents, a virtual minutiae set is generated to construct a texture template. A 96-dimensional descriptor is extracted for each minutia from its neighborhood. For computational efficiency, the descriptor length for virtual minutiae is further reduced to 16 using product quantization. Our end-to-end system is evaluated on four latent databases: NIST SD27 (258 latents); MSP (1200 latents), WVU (449 latents), and N2N (10 000 latents) against a background set of 100K rolled prints, which includes the true rolled mates of the latents with rank-1 retrieval rates of 65.7%, 69.4%, 65.5%, and 7.6%, respectively. A multi-core solution implemented on 24 cores obtains 1-ms per latent to rolled comparison.
ELIMINATION from Design to Analysis

Elimination is a word puzzle game for browsers and mobile devices, where all levels are generated by a constrained evolutionary algorithm with no human intervention. This paper describes the design of the game and its level generation methods, and analysis of playtraces from almost a thousand players. The analysis corroborates that the level generator creates a sawtooth-shaped difficulty curve, as intended. The analysis also offers insights into player behavior in this game.
Personality and Behavior in Role-based Online Games

Both offline and online human behaviors are affected by personality. Of special interests are online games, where players have to impersonate specific roles and their behaviors are extensively tracked by the game. In this paper, we propose to study the relationship between players’ personality and game behavior in League of Legends (LoL), one of the most popular Multiplayer Online Battle Arena (MOBA) games. We use linear mixed effects (LME) models to describe relationships between players’ personality traits (measured by the Five Factor Model) and two major aspects of the game: the impersonated roles and in-game actions. On the one hand, we study relationships within the game environment by modeling role attributes from match behaviors and vice versa. On the other hand, we analyze the relationship between a player’s five personality traits and their game behavior by showing significant correlations between each personality trait and the set of corresponding behaviors. Our findings suggest that personality and behavior are highly entangled and provide a new perspective to understand how personality can affect behavior in role-based online games.
On relative entropy and global index

Certain duality of relative entropy can fail for chiral conformal net with nontrivial representations. In this paper we quantify such statement by defining a quantity which measures the failure of such duality, and identify this quantity with relative entropy and global index associated with multi-interval subfactors for a large class of conformal nets. In particular we show that the duality holds for a large class of conformal nets if and only if they are holomorphic. The same argument also applies to CFT in two dimensions. In particular we show that the duality holds for a large class of CFT in two dimensions if and only if they are modular invariant. We also obtain various limiting properties of relative entropies which naturally follow from our formula.
“Unknown Symbols”: Online Legal Research in the Age of Emoji

Over the last decade, emoji and emoticons have made the leap from text messaging and social media to legal filings, court opinions, and law review articles. However, emoji and emoticons’ growth in ...
Algebraic model structures

We define a new notion of an algebraic model structure, in which the cofibrations and fibrations are retracts of coalgebras for comonads and algebras for monads, and prove "algebraic" analogs of classical results. Using a modified version of Quillen's small object ar- gument, we show that every cofibrantly generated model structure in the usual sense underlies a cofibrantly generated algebraic model structure. We show how to pass a cofibrantly generated algebraic model structure across an adjunction, and we characterize the algebraic Quillen adjunc- tion that results. We prove that pointwise algebraic weak factorization systems on diagram categories are cofibrantly generated if the original ones are, and we give an algebraic generalization of the projective model structure. Finally, we prove that certain fundamental comparison maps present in any cofibrantly generated model category are cofibrations when the cofibrations are monomorphisms, a conclusion that does not seem to be provable in the classical, nonalgebraic, theory.
Securities litigation and corporate tax avoidance

Abstract We examine whether litigation risk is systematically related to corporate tax avoidance. We find that the exogeneous reduction in the threat of securities class action litigation due to the 1999 ruling of the Ninth Circuit Court of Appeals effectively increases corporate tax avoidance, which is consistent with the notion that the threat of shareholder litigation plays a disciplinary role in curbing managerial rent extraction from tax avoidance activities. This finding is robust to alternative model specifications including two placebo tests and propensity score matching. We further find that labor union and alternative external governance mechanisms such as analyst coverage and institutional ownership mitigate this effect. Overall, our paper provides a significant contribution to the understanding of the relation between corporate governance and tax avoidance.
Ballot Measures for Open Space Conservation: Economic and Institutional Processes in Cities

This article examines referendums for open space conservation, focusing on an assessment of their likelihood in cities. It presents data on conservation referendums, over 15 years, based on the Tru...
El Niño–Related Tropical Land Surface Water and Energy Response in MERRA-2

AbstractAlthough El Nino events each have distinct evolutionary character, they typically provide systematic large-scale forcing for warming and increased drought frequency across the tropical cont...
Do Walking Muscle Synergies Influence Propensity of Severe Slipping

Slipping is frequently responsible for falling injuries. Preventing slips, and more importantly severe slips, is of importance in fall prevention. Our previous study characterized mild slipping and severe slipping by the analysis of muscle synergies. Significant discrepancies in motor control of slipping have been observed between mild and severe slippers. We are further interested in whether differences exist in baseline motor control patterns between persons who experience mild and severe slips when exposed to a slippery contaminant. This study investigated walking with a muscle synergy approach to detect if walking muscle synergies differ between groups experiencing different slip severities. Twenty healthy young adults (eight mild slippers and 12 severe slippers) participated in this study and their muscle synergies of walking were extracted. Muscle synergy analysis showed that mild slippers had a higher contribution of hamstring and quadriceps during walking while severe slippers had increased contribution of the tibialis group. This study provides novel information that may contribute to identifying diagnostic techniques for identifying persons or populations with a high risk of fall based on their walking patterns.
Interaction Geometry Causes Spectral Line-Shape Broadening at the Solid/Liquid Interface

Line-shape broadness in vibrational spectra is usually associated with structural heterogeneity of the surrounding environment. At the solid/liquid interface, surface-sensitive sum-frequency generation spectroscopy (SFG) has shown a variety of distributions of the vibrational frequency for sapphire surface hydroxyl groups in contact with several liquids. Even though the broadness in SFG spectra could be associated with the surface heterogeneity and diverse interfacial interactions, the origin remains elusive in experiments. To better understand the physical picture of interfacial interactions, and hence broadness, we perform SFG along with molecular dynamics (MD) simulations of liquid molecules in contact with sapphire. In the SFG spectra, line-shape broadness of the sapphire hydroxyl group vibrational frequency increases in the following order: chloroform, acetone and dimethyl sulfoxide. The broadness in the interaction energy distributions calculated from the MD simulations for the molecules interacting...
Yoga for Depression and Anxiety: A Review of Published Research and Implications for Healthcare Providers

There is increasing interest in the use of yoga as way to manage or treat depression and anxiety. Yoga is afford- able, appealing, and accessible for many people, and there are plausible cognitive/affective and biologic mechanisms by which yoga could have a positive impact on depression and anxiety. There is indeed preliminary evidence that yoga may be helpful for these problems, and there are several ongoing larger-scale randomized clinical trials. The current evidence base is strongest for yoga as efficacious in reducing symptoms of unipolar depression. However, there may be risks to engaging in yoga as well. Healthcare providers can help patients evaluate whether a particular community-based yoga class is helpful and safe for them.
A Mechanism to Minimize Errors during Non-homologous End Joining.

Summary Enzymatic processing of DNA underlies all DNA repair, yet inappropriate DNA processing must be avoided. In vertebrates, double-strand breaks are repaired predominantly by non-homologous end joining (NHEJ), which directly ligates DNA ends. NHEJ has the potential to be highly mutagenic because it uses DNA polymerases, nucleases, and other enzymes that modify incompatible DNA ends to allow their ligation. Using frog egg extracts that recapitulate NHEJ, we show that end processing requires the formation of a “short-range synaptic complex” in which DNA ends are closely aligned in a ligation-competent state. Furthermore, single-molecule imaging directly demonstrates that processing occurs within the short-range complex. This confinement of end processing to a ligation-competent complex ensures that DNA ends undergo ligation as soon as they become compatible, thereby minimizing mutagenesis. Our results illustrate how the coordination of enzymatic catalysis with higher-order structural organization of substrate maximizes the fidelity of DNA repair.
A TOP-DOWN APPROACH FOR THE MULTIPLE EXERCISES AND VALUATION OF EMPLOYEE STOCK OPTIONS

We propose a new framework to value employee stock options (ESOs) that capture multiple exercises of different quantities over time. We also model the ESO holder’s job termination risk and incorpor...
On the Capacity of Computation Broadcast

The two-user computation broadcast problem is introduced as the setting where User 1 wants message $W_{1}$ and has side-information $W_{1}'$ , User 2 wants message $W_{2}$ and has side-information $W_{2}'$ , and $(W_{1}, W_{1}', W_{2}, W_{2}')$ may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio $H(W_{1},W_{2})/H(S)$ , where $S$ is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity of computation broadcast $C_ {{{{CB}}}}$ . It is shown that $C_ {{{{CB}}}}\leq H(W_{1},W_{2})/\bigg [H(W_{1}|W_{1}')+H(W_{2}|W_{2}')-\min \Big (I(W_{1}; W_{2}, W_{2}'|W_{1}'), I(W_{2}; W_{1}, W_{1}'|W_{2}')\Big)\bigg]$ . For the linear computation broadcast problem, where $W_{1}, W_{1}', W_{2}, W_{2}'$ are comprised of arbitrary linear combinations of a basis set of independent symbols, the bound is shown to be tight. For non-linear computation broadcast, it is shown that this bound is not tight in general. Examples are provided to prove that different instances of computation broadcast that have the same entropic structure, i.e., the same entropy for all subsets of $\{W_{1},W_{1}',W_{2},W_{2}'\}$ , can have different capacities. Thus, extra-entropic structure matters even for two-user computation broadcast. The significance of extra-entropic structure is further explored through a class of non-linear computation broadcast problems where the extremal values of capacity are shown to correspond to minimally and maximally structured problems within that class.
Among-family variation in survival and gene expression uncovers adaptive genetic variation in a threatened fish.

Variation in among-family transcriptional responses to different environmental conditions can help to identify adaptive genetic variation, even prior to a selective event. Coupling differential gene expression with formal survival analyses allows for the disentanglement of treatment effects, required for understanding how individuals plastically respond to environmental stressors, from the adaptive genetic variation responsible for differential survival. We combined these two approaches to investigate responses to an emerging conservation issue, thiamine (vitamin B1 ) deficiency, in a threatened population of Atlantic salmon (Salmo salar). Thiamine is an essential vitamin that is increasingly limited in many ecosystems. In Lake Champlain, Atlantic salmon cannot acquire thiamine in sufficient quantities to support natural reproduction; fertilized eggs must be reared in hatcheries and treated with supplemental thiamine. We evaluated transcriptional responses (via RNA sequencing) to thiamine treatment across families and found 3,616 genes differentially expressed between control (no supplemental thiamine) and treatment individuals. Fewer genes changed expression equally across families (i.e., additively) than exhibited genotype × environment interactions in response to thiamine. Differentially expressed genes were related to known physiological effects of thiamine deficiency, including oxidative stress, cardiovascular irregularities and neurological abnormalities. We also identified 1,446 putatively adaptive genes that were strongly associated with among-family survival in the absence of thiamine treatment, many of which related to neurogenesis and visual perception. Our results highlight the utility of coupling RNA sequencing with formal survival analyses to identify candidate genes that underlie the among-family variation in survival required for an adaptive response to natural selection.
AdaFilter: Adaptive Filter Fine-Tuning for Deep Transfer Learning.

There is an increasing number of pre-trained deep neural network models. However, it is still unclear how to effectively use these models for a new task. Transfer learning, which aims to transfer knowledge from source tasks to a target task, is an effective solution to this problem. Fine-tuning is a popular transfer learning technique for deep neural networks where a few rounds of training are applied to the parameters of a pre-trained model to adapt them to a new task. Despite its popularity, in this paper we show that fine-tuning suffers from several drawbacks. We propose an adaptive fine-tuning approach, called AdaFilter, which selects only a part of the convolutional filters in the pre-trained model to optimize on a per-example basis. We use a recurrent gated network to selectively fine-tune convolutional filters based on the activations of the previous layer. We experiment with 7 public image classification datasets and the results show that AdaFilter can reduce the average classification error of the standard fine-tuning by 2.54%.
Addressing Marketing Bias in Product Recommendations

Modern collaborative filtering algorithms seek to provide personalized product recommendations by uncovering patterns in consumer-product interactions. However, these interactions can be biased by how the product is marketed, for example due to the selection of a particular human model in a product image. These correlations may result in the underrepresentation of particular niche markets in the interaction data; for example, a female user who would potentially like motorcycle products may be less likely to interact with them if they are promoted using stereotypically 'male' images. In this paper, we first investigate this correlation between users' interaction feedback and products' marketing images on two real-world e-commerce datasets. We further examine the response of several standard collaborative filtering algorithms to the distribution of consumer-product market segments in the input interaction data, revealing that marketing strategy can be a source of bias for modern recommender systems. In order to protect recommendation performance on underrepresented market segments, we develop a framework to address this potential marketing bias. Quantitative results demonstrate that the proposed approach significantly improves the recommendation fairness across different market segments, with a negligible loss (or better) recommendation accuracy.
Mesh Refinement Method for Solving Bang-Bang Optimal Control Problems Using Direct Collocation

A mesh refinement method is developed for solving bang-bang optimal control problems using direct collocation. The method starts by finding a solution on a coarse mesh. Using this initial solution, the method then determines automatically if the Hamiltonian is linear with respect to the control, and, if so, estimates the locations of the discontinuities in the control. The switch times are estimated by determining the roots of the switching functions, where the switching functions are determined using estimates of the state and costate obtained from the collocation method. The accuracy of the switch times is then improved on subsequent meshes by dividing the original optimal control problem into multiple domains and including variables that define the locations of the switch times. While in principle any collocation method can be used, in this research the previously developed Legendre-Gauss-Radau collocation method is employed because it provides an accurate approximation of the costate which in turn improves the approximation of the switching functions. The method of this paper is designed to be used with a previously developed mesh refinement method in order to accurately approximate the solution in segments where the solution is smooth. The method is demonstrated on three examples where it is shown to accurately determine the switching structure of a bang-bang optimal control problem. When compared with previously developed mesh refinement methods, the results demonstrate that the method developed in this paper improves computational efficiency when solving bang-bang optimal control problems.
The Emerging Threat of Ebola

Ebola is one of the deadliest infectious disease of the modern era. Over 50% of those infected die. Prior to 1976, the disease was unknown. No one knows exactly where it came from, but it is postulated that a mutation in an animal virus allowed it to jump species and infect humans. In 1976 simultaneous outbreaks of Ebola occurred in what is now South Sudan and the Democratic Republic of the Congo (DRC). For 20 years, only sporadic cases were seen, but in 1995 a new outbreak occurred killing hundreds in the DRC. Since that time the frequency of these outbreaks has been increasing. It is uncertain why this is occurring, but many associate it with increasing human encroachment into forested areas bringing people and animals into more intimate contact and increased mobility of previously remote population. This chapter will navigate Ebola in the context of global health and security.