cssi/SciSciGPT-SciSciNet huggingface dataset:
Hybrid Cell Outage Compensation in 5G Networks: Sky-Ground Approach

Unmanned Aerial Vehicles (UAVs) enabled communications is a novel and attractive area of research in cellular communications. It provides several degrees of freedom in time, space and it can be used for multiple purposes. This is why wide deployment of UAVs has the potential to be integrated in the upcoming 5G standard. In this paper, we present a novel cell outage compensation (COC) framework to mitigate the effect of the failure of any outdoor Base Station (BS) in 5G networks. Within our framework, the outage compensation is done with the assistance of sky BSs (UAVs) and Ground BSs (GBSs). An optimization problem is formulated to jointly minimize the energy of the Drone BSs (DBSs) and GBSs involved in the healing process which accordingly will minimize the number of DBSs and determine their optimal 2D positions. In addition, the DBSs will mainly heal the users that the GBS cannot heal due to capacity issues. Simulation results show that the proposed hybrid approach outperforms the conventional COC approach. Moreover, all users receive the minimum quality of service in addition to minimizing the UAVs' consumed energy.
On the near-equality case of the positive mass theorem

The positive mass conjecture states that any complete asymptotically flat manifold of nonnnegative scalar curvature has nonnegative mass. Moreover, the equality case of the positive mass conjecture states that in the above situation, if the mass is zero, then the Riemannian manifold must be Euclidean space. The positive mass conjecture was proved by R. Schoen and S.-T. Yau for all manifolds of dimension less than 8 (see [SY]), and it was proved by E. Witten for all spin manifolds [Wi]. In this article, we consider complete asymptotically flat manifolds of nonnegative scalar curvature which are also harmonically flat in an end. We show that, whenever the positive mass theorem holds, any appropriately normalized sequence of such manifolds whose masses converge to zero must have metrics that uniformly converge to the Euclidean metric outside a compact region. This result is an ingredient in a proof, coauthored with H. Bray, of the Riemannian Penrose inequality in dimensions less than 8 (see [BL])
On Real-Time Communication Systems with Noisy Feedback

We consider a real-time communication system with noisy feedback consisting of a Markov source, a forward and a backward discrete memoryless channels, and a receiver with finite memory. The objective is to design an optimal communication strategy (that is, encoding, decoding, and memory update strategies) to minimize the total expected distortion over a finite horizon. We present a sequential decomposition for the problem, which results in a set of nested optimality equations to determine optimal communication strategies. This provides a systematic methodology to determine globally optimal joint source-channel encoding and decoding strategies for real-time communication systems with noisy feedback.
Understanding the detectability of potential changes to the 100-year peak storm surge

In many coastal communities, the risks driven by storm surges are motivating substantial investments in flood risk management. The design of adaptive risk management strategies, however, hinges on the ability to detect future changes in storm surge statistics. Previous studies have used observations to identify changes in past storm surge statistics. Here, we focus on the simple and decision-relevant question: How fast can we learn from past and potential future storm surge observations about changes in future statistics? Using Observing System Simulation Experiments, we quantify the time required to detect changes in the probability of extreme storm surge events. We estimate low probabilities of detection when substantial but gradual changes to the 100-year storm surge occur. As a result, policy makers may underestimate considerable increases in storm surge risk over the typically long lifespans of major infrastructure projects.
Algorithms for Provisioning Queries and Analytics

Provisioning is a technique for avoiding repeated expensive computations in what-if analysis. Given a query, an analyst formulates k hypotheticals, each retaining some of the tuples of a database instance, possibly overlapping, and she wishes to answer the query under scenarios, where a scenario is defined by a subset of the hypotheticals that are "turned on". We say that a query admits compact provisioning if given any database instance and any k hypotheticals, one can create a poly-size (in k) sketch that can then be used to answer the query under any of the 2^k possible scenarios without accessing the original instance. In this paper, we focus on provisioning complex queries that combine relational algebra (the logical component), grouping, and statistics/analytics (the numerical component). We first show that queries that compute quantiles or linear regression (as well as simpler queries that compute count and sum/average of positive values) can be compactly provisioned to provide (multiplicative) approximate answers to an arbitrary precision. In contrast, exact provisioning for each of these statistics requires the sketch size to be exponential in k. We then establish that for any complex query whose logical component is a positive relational algebra query, as long as the numerical component can be compactly provisioned, the complex query itself can be compactly provisioned. On the other hand, introducing negation or recursion in the logical component again requires the sketch size to be exponential in k. While our positive results use algorithms that do not access the original instance after a scenario is known, we prove our lower bounds even for the case when, knowing the scenario, limited access to the instance is allowed.
PersonaBank: A Corpus of Personal Narratives and Their Story Intention Graphs

We present a new corpus, PersonaBank, consisting of 108 personal stories from weblogs that have been annotated with their Story Intention Graphs, a deep representation of the content of a story. We describe the topics of the stories and the basis of the Story Intention Graph representation, as well as the process of annotating the stories to produce the Story Intention Graphs and the challenges of adapting the tool to this new personal narrative domain. We also discuss how the corpus can be used in applications that retell the story using different styles of tellings, co-tellings, or as a content planner.
Deep neural network architectures for modulation classification

In this work, we investigate the value of employing deep learning for the task of wireless signal modulation recognition. Recently in [1], a framework has been introduced by generating a dataset using GNU radio that mimics the imperfections in a real wireless channel, and uses 10 different modulation types. Further, a convolutional neural network (CNN) architecture was developed and shown to deliver performance that exceeds that of expert-based approaches. Here, we follow the framework of [1] and find deep neural network architectures that deliver higher accuracy than the state of the art. We tested the architecture of [1] and found it to achieve an accuracy of approximately 75% of correctly recognizing the modulation type. We first tune the CNN architecture of [1] and find a design with four convolutional layers and two dense layers that gives an accuracy of approximately 83.8% at high SNR. We then develop architectures based on the recently introduced ideas of Residual Networks (ResNet [2]) and Densely Connected Networks (DenseNet [3]) to achieve high SNR accuracies of approximately 83.5% and 86.6%, respectively. Finally, we introduce a Convolutional Long Short-term Deep Neural Network (CLDNN [4]) to achieve an accuracy of approximately 88.5% at high SNR.
Symplectic Structures on the Cotangent Bundles of Open 4-Manifolds

We show that, for any two orientable smooth open 4-manifolds $X_0,X_1$ which are homeomorphic, their cotangent bundles $T^*X_0,T^*X_1$ are symplectomorphic with their canonical symplectic structure. In particular, for any smooth manifold $R$ homeomorphic to $\mathbb{R}^4$, the standard Stein structure on $T^*R$ is Stein homotopic to the standard Stein structure on $T^*\mathbb{R}^4 = \mathbb{R}^8$. We use this to show that any exotic $\mathbb{R}^4$ embeds in the standard symplectic $\mathbb{R}^8$ as a Lagrangian submanifold. As a corollary, we show that $\mathbb{R}^8$ has uncountably many smoothly distinct foliations by Lagrangian $\mathbb{R}^4$s with their standard smooth structure.
Tensor Decompositions via Two-Mode Higher-Order SVD (HOSVD)

Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlike the classical higher-order singular value decomposition which unfolds a tensor along a single mode, we consider unfoldings along two modes and use rank-1 constraints to characterize the underlying components. This tensor decomposition method provably handles a greater level of noise compared to previous methods and achieves a high estimation accuracy. Numerical results demonstrate that our algorithm is robust to various noise distributions and that it performs especially favorably as the order increases.
Homoclinic orbits in the Euler problem of two fixed centers

Abstract We give a complete description of the shapes and the behavior of all homoclinic orbits in the Euler problem of two fixed centers.
Establishing a histology-specific biologically effective dose threshold for lung stereotactic ablative radiotherapy (SABR): Is ≥100 Gy10 enough?

Abstract Objectives Squamous cell carcinoma (SCC) is associated with worse local control and overall survival (OS) compared to adenocarcinoma (ADC) in patients with early stage non-small cell lung cancer (ES-NSCLC). Biological effective dose (BED) escalation above 100 Gy10 improves tumor control, yet SCC and ADC may respond differentially to BED beyond 100 Gy10. Materials and Methods We queried the National Cancer Database for ES-NSCLC (T1-2N0, Stage I-IIA) patients with SCC or ADC treated with stereotactic ablative radiotherapy (SABR). Receiver operator characteristic (ROC) curve analysis was used to identify the optimal dose threshold for SCC and ADC. Patients were stratified by histology and BED (≥122 Gy10 vs Results Ultimately 11,084 ES-NSCLC patients with either ADC (n = 6476) or SCC (n = 4608) were eligible for analysis. Calculated optimal BED threshold for both SCC and ADC was 122 Gy10. Univariable analysis demonstrated a median (36 months vs 32 months), 3-year (51% vs 43%), and 5-year (27% vs 22%) OS advantage in SCC patients receiving BED escalation ≥122 Gy10 (p = 0.002). No survival difference was observed in the ADC dose escalation arm (p = 0.650). BED escalation ≥122 Gy10 remained an independent predictor of improved survival on IPW multivariable comparison (p Conclusion Escalation of BED ≥ 122 Gy10 was an independent prognosticator of improved survival in patients with SCC of the lung post-SABR. No survival benefit was observed for ADC, suggesting a differential response to BED escalation.
Experimental Design via Generalized Mean Objective Cost of Uncertainty

The mean objective cost of uncertainty (MOCU) quantifies the performance cost of using an operator that is optimal across an uncertainty class of systems as opposed to using an operator that is optimal for a particular system. MOCU-based experimental design selects an experiment to maximally reduce MOCU, thereby gaining the greatest reduction of uncertainty impacting the operational objective. The original formulation applies to finding optimal system operators, where optimality is with respect to a cost function, such as mean-square error; and the prior distribution governing the uncertainty class relates directly to the underlying physical system. Here, we provide a generalized MOCU and the corresponding experimental design. We, then, demonstrate how this new formulation includes as special cases MOCU-based experimental design methods developed for materials science and genomic networks, when there is experimental error. Most importantly, we show that the classical knowledge gradient and efficient global optimization procedures are specific implementations of MOCU-based experimental design under their modeling assumptions.
Gerstenhaber-Batalin-Vilkoviski structures on coisotropic intersections

Let $Y,Z$ be a pair of smooth coisotropic subvarieties in a smooth algebraic Poisson variety $X$. We show that any data of first order deformation of the structure sheaf $\oo_X$ to a sheaf of noncommutative algebras and of the sheaves $\oo_Y$ and $\oo_Z$ to sheaves of right and left modules over the deformed algebra, respectively, gives rise to a Batalin-Vilkoviski algebra structure on the Tor-sheaf ${\scr{T}\!}or^{\oo_X}_\idot(\oo_Y,\oo_Z)$. The induced Gerstenhaber bracket on the Tor-sheaf turns out to be canonically defined; it is independent of the choices of deformations involved. There are similar results for Ext-sheaves as well. Our construction is motivated by, and is closely related to, a result of Behrend-Fantechi \cite{BF}, who studied intersections of Lagrangian submanifolds in a symplectic manifold.
Phase transitions in spectral community detection of large noisy networks

In this paper, we study the sensitivity of the spectral clustering based community detection algorithm subject to a Erdos-Renyi type random noise model. We prove phase transitions in community detectability as a function of the external edge connection probability and the noisy edge presence probability under a general network model where two arbitrarily connected communities are interconnected by random external edges. Specifically, the community detection performance transitions from almost perfect detectability to low detectability as the intercommunity edge connection probability exceeds some critical value.We derive upper and lower bounds on the critical value and show that the bounds are identical when the two communities have the same size. The phase transition results are validated using network simulations. Using the derived expressions for the phase transition threshold we propose a method for estimating this threshold from observed data.
On the Motion of a Self-Gravitating Incompressible Fluid with Free Boundary

We consider the motion of the interface separating a vacuum from an inviscid, incompressible, and irrotational fluid, subject to the self-gravitational force and neglecting surface tension, in two space dimensions. The fluid motion is described by the Euler–Poisson system in moving bounded simply-connected domains. A family of equilibrium solutions of the system are the perfect balls moving at constant velocity. We show that for smooth data that are small perturbations of size $${\epsilon}$$ of these static states, measured in appropriate Sobolev spaces, the solution exists and the perturbation remains of size $${\epsilon}$$ on a time interval of length at least $${c\epsilon^{-2},}$$ where c is a constant independent of $${\epsilon.}$$ This should be compared with the lifespan $${O(\epsilon^{-1})}$$ provided by local well-posedness. The key ingredient of our proof is finding a two-step nonlinear transformation which removes quadratic terms from the nonlinearity. Compared with the gravity water wave problem, besides the different geometry of the bounded moving domain, an important difference is that the gravity in water waves is a constant vector, while the self-gravity in the Euler–Poisson system depends nonlinearly on the interface.
An Informed Model of Personal Information Release in Social Networking Sites

The emergence of online social networks and the growing popularity of digital communication has resulted in an increasingly amount of information about individuals available on the Internet. Social network users are given the freedom to create complex digital identities, and enrich them with truthful or even fake personal information. However, this freedom has led to serious security and privacy incidents, due to the role users' identities play in establishing social and privacy settings. In this paper, we take a step toward a better understanding of online information exposure. Based on the detailed analysis of a sample of real-world data, we develop a deception model for online users. The model uses a game theoretic approach to characterizing a user's willingness to release, withhold or lie about information depending on the behavior of individuals within the user's circle of friends. In the model, we take into account both the heterogeneous nature of users and their different attitudes, as well as the different types of information they may expose online.
Quantum Computing Circuits and Devices

Editor’s note: As an emerging technology, quantum computing brings unique promises in creating a fundamentally different paradigm of information processing. This article reviews introductory concepts and building blocks—quantum logic gates and memory, i.e., qubits, for quantum computing and depicts the challenges as well as prospects associated with design, test, and fabrication of quantum devices. —Swarup Bhunia, Case Western Reserve University
Algebraic Tangent Cones of Reflexive Sheaves

We study the notion of algebraic tangent cones at singularities of reflexive sheaves. These correspond to extensions of reflexive sheaves across a negative divisor. We show the existence of optimal extensions in a constructive manner, and we prove the uniqueness in a suitable sense. The results here are an algebro-geometric counterpart of our previous study on singularities of Hermitian-Yang-Mills connections.
Atmospheric Lepton Fluxes

This review of atmospheric muons and neutrinos emphasizes the high energy range relevant for backgrounds to high-energy neutrinos of astrophysical origin. After a brief historical introduction, the main distinguishing features of atmospheric νμ and νe are discussed, along with the implications of the muon charge ratio for the νµ / νµ ratio. Methods to account for effects of the knee in the primary cosmic-ray spectrum and the energy-dependence of hadronic interactions on the neutrino fluxes are discussed and illustrated in the context of recent results from IceCube. A simple numerical/analytic method is proposed for systematic investigation of uncertainties in neutrino fluxes arising from uncertainties in the primary cosmic-ray spectrum/composition and hadronic interactions.
Remarks on the speed of convergence of mixing coefficients and applications

Abstract We study dependence coefficients for copula-based Markov chains. We provide new tools to check the convergence rates of mixing coefficients of copula-based Markov chains. We apply results to the Metropolis–Hastings algorithm. A necessary condition for symmetric copulas is given and mixtures of copulas are studied.
Denseness and Zariski denseness of Jones braid representations

Using various tools from representation theory and group theory, but without using hard classification theorems such as the classification of finite simple groups, we show that the Jones representations of braid groups are dense in the (complex) Zariski topology when the parameter t is not a root of unity. As first established by Freedman, Larsen and Wang, we obtain the same result when t is a nonlattice root of unity, other than one initial case when t has order 10. We also compute the real Zariski closure of these representations (meaning, the closure in Zariski closure of the real Weil restriction). When such a representation is indiscrete in the analytic topology, then its analytic closure is the same as its real Zariski closure. In this article we will study representations of braid groups associated with the Jones polynomial J.L;t/. Our question is to determine the closures of these representations, which are then Lie groups. Freedman, Larsen and Wang [4] computed these closures in the important case where tD exp.2 i=r/ is a principal root of unity. In this case, the (reduced) braid representations are unitary, and the braids can be interpreted as quantum circuits. Freedman, Larsen and Wang established that the Jones representations are eventually dense if rD 5 or r 7. This has the important corollary that these representations are universal for quantum computation. In this article t will usually be a complex number which is not a root of unity. Although the Jones polynomial is not directly a model of quantum computation for these values of t , the closure of the braid group representation is still interesting for related questions in complexity theory; see Ahargonov, Arad, Eban and Landau [1]. Also, we will say more about the Zariski closure of the braid group action in the target group GL.N;C/, rather than the closure in the usual topology. Switching to the Zariski topology simplifies the question, and yet in many cases it does not change the question very much. To be precise, we will consider two Zariski topologies on GL.N;C/ and SL.N;C/. The usual Zariski topology is generated by polynomials in the complex matrix entries, and
A characterization of bipartite Leonard pairs using the notion of a tail

Abstract Let V denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations A : V → V and A ⁎ : V → V that satisfy (i) and (ii) below. (i) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing A ⁎ is diagonal. (ii) There exists a basis for V with respect to which the matrix representing A ⁎ is irreducible tridiagonal and the matrix representing A is diagonal. We call such a pair a Leonard pair on V . Very roughly speaking, a Leonard pair is a linear algebraic abstraction of a Q -polynomial distance-regular graph. There is a well-known class of distance-regular graphs said to be bipartite and there is a related notion of a bipartite Leonard pair. Recently, M.S. Lang introduced the notion of a tail for bipartite distance-regular graphs and there is an abstract version of this tail notion. Lang characterized the bipartite Q -polynomial distance-regular graphs using tails. In this paper, we obtain a similar characterization of the bipartite Leonard pairs using tails. Whereas Lang's arguments relied on the combinatorics of a distance-regular graph, our results are purely algebraic in nature.
On the filtration of a free algebra by its associative lower central series

Abstract This paper concerns the associative lower central series ideals M i of the free algebra A n on n generators. Namely, we study the successive quotients N i = M i / M i + 1 , which admit an action of the Lie algebra W n of vector fields on C n . We bound the degree | λ | of tensor field modules F λ appearing in the Jordan–Holder series of each N i , confirming a recent conjecture of Arbesfeld and Jordan. As an application, we compute these decompositions for small n and i.
Learning with differential privacy: stability, learnability and the sufficiency and necessity of ERM principle

While machine learning has proven to be a powerful data-driven solution to many real-life problems, its use in sensitive domains has been limited due to privacy concerns. A popular approach known as differential privacy offers provable privacy guarantees, but it is often observed in practice that it could substantially hamper learning accuracy. In this paper we study the learnability (whether a problem can be learned by any algorithm) under Vapnik's general learning setting with differential privacy constraint, and reveal some intricate relationships between privacy, stability and learnability. In particular, we show that a problem is privately learnable if an only if there is a private algorithm that asymptotically minimizes the empirical risk (AERM). In contrast, for non-private learning AERM alone is not sufficient for learnability. This result suggests that when searching for private learning algorithms, we can restrict the search to algorithms that are AERM. In light of this, we propose a conceptual procedure that always finds a universally consistent algorithm whenever the problem is learnable under privacy constraint. We also propose a generic and practical algorithm and show that under very general conditions it privately learns a wide class of learning problems. Lastly, we extend some of the results to the more practical (e, δ)-differential privacy and establish the existence of a phase-transition on the class of problems that are approximately privately learnable with respect to how small δ needs to be.
A hybridizable discontinuous Galerkin method for two-phase flow in heterogeneous porous media

We present a new method for simulating incompressible immiscible two-phase flow in porous media. The semi-implicit method decouples the wetting phase pressure and saturation equations. The equations are discretized using a hybridizable discontinuous Galerkin (HDG) method. The proposed method is of high order, conserves global/local mass balance, and the number of globally coupled degrees of freedom is significantly reduced compared to standard interior penalty discontinuous Galerkin methods. Several numerical examples illustrate the accuracy and robustness of the method. These examples include verification of convergence rates by manufactured solutions, common 1D benchmarks and realistic discontinuous permeability fields.
Streaming Periodicity with Mismatches

We study the problem of finding all $k$-periods of a length-$n$ string $S$, presented as a data stream. $S$ is said to have $k$-period $p$ if its prefix of length $n-p$ differs from its suffix of length $n-p$ in at most $k$ locations. We give a one-pass streaming algorithm that computes the $k$-periods of a string $S$ using $\text{poly}(k, \log n)$ bits of space, for $k$-periods of length at most $\frac{n}{2}$. We also present a two-pass streaming algorithm that computes $k$-periods of $S$ using $\text{poly}(k, \log n)$ bits of space, regardless of period length. We complement these results with comparable lower bounds.
Off-the-grid spectral compressed sensing with prior information

Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In this paper, we extend off-the-grid CS to applications where some prior information about spectrally sparse signal is known. We specifically consider cases where a few contributing frequencies or poles, but not their amplitudes or phases, are known a priori. Our results show that equipping off-the-grid CS with the known-poles algorithm can increase the probability of recovering all the frequency components.
Birational Superrigidity and K-Stability of Singular Fano Complete Intersections

We introduce an inductive argument for proving birational superrigidity and K-stability of singular Fano complete intersections of index one, using the same types of information from lower dimensions. In particular, we prove that a hypersurface in $\mathbb{P}^{n+1}$ of degree $n+1$ with only ordinary singularities of multiplicity at most $n-5$ is birationally superrigid and K-stable if $n\gg0$. As part of the argument, we also establish an adjunction type result for local volumes of singularities.
Why aren’t regular expressions a lingua franca? an empirical study on the re-use and portability of regular expressions

This paper explores the extent to which regular expressions (regexes) are portable across programming languages. Many languages offer similar regex syntaxes, and it would be natural to assume that regexes can be ported across language boundaries. But can regexes be copy/pasted across language boundaries while retaining their semantic and performance characteristics? In our survey of 158 professional software developers, most indicated that they re-use regexes across language boundaries and about half reported that they believe regexes are a universal language.We experimentally evaluated the riskiness of this practice using a novel regex corpus — 537,806 regexes from 193,524 projects written in JavaScript, Java, PHP, Python, Ruby, Go, Perl, and Rust. Using our polyglot regex corpus, we explored the hitherto-unstudied regex portability problems: logic errors due to semantic differences, and security vulnerabilities due to performance differences. We report that developers’ belief in a regex lingua franca is understandable but unfounded. Though most regexes compile across language boundaries, 15% exhibit semantic differences across languages and 10% exhibit performance differences across languages. We explained these differences using regex documentation, and further illuminate our findings by investigating regex engine implementations. Along the way we found bugs in the regex engines of JavaScript-V8, Python, Ruby, and Rust, and potential semantic and performance regex bugs in thousands of modules.
Hybrid Direct-Indirect Adaptive Control of Nonlinear System with Unmatched Uncertainty

In this paper, we present a hybrid direct-indirect model reference adaptive controller (MRAC), to address a class of problems with matched and unmatched uncertainties. In the proposed architecture, the unmatched uncertainty is estimated online through a companion observer model. Upon convergence of the observer, the unmatched uncertainty estimate is remodeled into a state dependent linear form to augment the nominal system dynamics. Meanwhile, a direct adaptive controller designed for a switching system cancels the effect of matched uncertainty in the system and achieves reference model tracking. We demonstrate that the proposed hybrid controller can handle a broad class of nonlinear systems with both matched and unmatched uncertainties.
Robust and interpretable PAM50 reclassification exhibits survival advantage for myoepithelial and immune phenotypes

We introduce a classification of breast tumors into seven classes which are more clearly defined by interpretable mRNA signatures along the PAM50 gene set than the five traditional PAM50 intrinsic subtypes. Each intrinsic subtype is partially concordant with one of our classes, and the two additional classes correspond to division of the classes concordant with the Luminal B and the Normal intrinsic subtypes along expression of the Her2 gene group. Our Normal class shows similarity with the myoepithelial mammary cell phenotype, including TP63 expression (specificity: 80.8% and sensitivity: 82.8%), and exhibits the best overall survival (89.6% at 5 years). Though Luminal A tumors are traditionally considered the least aggressive, our analysis shows that only the Luminal A tumors which are now classified as myoepithelial have this phenotype, while tumors in our luminal class (concordant with Luminal A) may be more aggressive than previously thought. We also find that patients with basal tumors surviving to 48 months exhibit favorable continued survival rates when certain markers for B lymphocytes are present and poor survival rates when they are absent, which is consistent with recent findings.
Assessing and Providing Culturally Competent Care in Radiation Oncology for Deaf Cancer Patients.

Abstract Purpose Recognition of disparities for vulnerable populations in the field of oncology is increasing, but little attention has been paid to deaf patients. At least a million Americans are culturally deaf and use American Sign Language. Poor linguistic and cultural competency among physicians is a barrier to care delivery for these patients, placing them at risk for treatment disparities. To better educate oncology practitioners, including radiation oncologists, regarding the unique needs of this cohort, we performed an evidence-based literature review of culturally competent care for deaf patients to improve patient care and delivery. Methods and Materials PubMed was systematically reviewed for publications reporting on deaf patients for articles regarding (1) survivorship, patterns of failure, or toxicity in treating malignancies or (2) cultural and linguistic barriers to delivery of oncological care. Publications were excluded if deafness was a side effect of treatment or barriers and outcomes were reported on nonmalignant conditions. Results Barriers to care were poor health literacy, accessibility to providers or resources in preferred language (ie, American Sign Language), and limited cultural and linguistic proficiency of providers. Deaf patients may have a delay in cancer diagnosis, but no articles reported on treatment outcomes for malignancies in deaf patients. Currently, no oncology-specific guidelines exist on care delivery for deaf patients with cancer. We propose the need for a care model that provides guidelines on creating effective and total communication accessibility for deaf patients and improves cultural and linguistic competency among providers. Guidance should be provided on implementation of resources and training for oncology practitioners and how their respective institutions and staff can help create inclusive care environments. Conclusions Clinical outcomes of deaf patients with cancer remain poorly characterized, highlighting the need for a care model to promote provision of linguistically and culturally competent oncological care for deaf patients.
Synthesis of 2H-Chromenes via Hydrazine-Catalyzed Ring-Closing Carbonyl-Olefin Metathesis.

The catalytic ring-closing carbonyl-olefin metathesis (RCCOM) of O-allyl salicylaldehydes to form 2H-chromenes is described. The method utilizes a [2.2.1]-bicyclic hydrazine catalyst and operates v...
Dual Hats and Arbitrator Diversity: Goals in Tension

This essay outlines a quandary facing international investment dispute settlement (IIDS): the tension between the wish to curb “dual hatting” and the wish to increase the diversity of those appointed as arbitrators in IIDS cases. Thoughtful observers are concerned by the effect on IIDS, either in fact or as a matter of appearance, of lawyers who wear “dual hats”—one as arbitrator in IIDS cases, and a second as counsel representing clients in other IIDS matters. Concurrently, other thoughtful observers are concerned that appointments to IIDS predominantly go to a small cadre of established arbitrators caricatured as “pale, male and stale.” This concern has prompted efforts to increase the pool of female and minority arbitrators. However, these individuals would be drawn primarily from the ranks of younger practicing lawyers who must continue to practice unless and until they receive sufficient appointments to make full-time service as arbitrators economically feasible.
Time Scale for Velocity to Track a Force

In this paper we derive and discuss the time it takes for a force to turn a velocity. More precisely, we derive the formula for the time τ it takes a constant force that makes an angle α with the initial velocity v(0) to have v(τ) get within an angle θ < α of the force. We then show how the addition of a viscous force decreases τ logarithmically. The result can be generalized to any vector quantity whose first time derivative is a constant.
Multi-stakeholder Recommendation and its Connection to Multi-sided Fairness

There is growing research interest in recommendation as a multi-stakeholder problem, one where the interests of multiple parties should be taken into account. This category subsumes some existing well-established areas of recommendation research including reciprocal and group recommendation, but a detailed taxonomy of different classes of multi-stakeholder recommender systems is still lacking. Fairness-aware recommendation has also grown as a research area, but its close connection with multi-stakeholder recommendation is not always recognized. In this paper, we define the most commonly observed classes of multi-stakeholder recommender systems and discuss how different fairness concerns may come into play in such systems.
Network dependence testing via diffusion maps and distance-based correlations

SummaryDeciphering the associations between network connectivity and nodal attributes is one of the core problems in network science. The dependency structure and high dimensionality of networks pose unique challenges to traditional dependency tests in terms of theoretical guarantees and empirical performance. We propose an approach to test network dependence via diffusion maps and distance-based correlations. We prove that the new method yields a consistent test statistic under mild distributional assumptions on the graph structure, and demonstrate that it is able to efficiently identify the most informative graph embedding with respect to the diffusion time. The methodology is illustrated on both simulated and real data.
Fingerprinting CANDO: Increased Accuracy with Structure- and Ligand-Based Shotgun Drug Repurposing.

We have upgraded our Computational Analysis of Novel Drug Opportunities (CANDO) platform for shotgun drug repurposing by including ligand-based, data fusion, and decision tree pipelines. The goal o...
The global market for photonics

Abstract not available. The document was not made available for publication as part of the conference proceedings.
The Ropelengths of Knots Are Almost Linear in Terms of Their Crossing Numbers

For a knot or link &#x1d4a6;, let L(&#x1d4a6;) be the ropelength of &#x1d4a6; and Cr(&#x1d4a6;) be the crossing number of &#x1d4a6;. In this paper, we show that there exists a constant a > 0 such that L(&#x1d4a6;) ≤ aCr(&#x1d4a6;)ln5(Cr(&#x1d4a6;)) for any &#x1d4a6;, i...
Multicenter Analysis of Dosing Protocols for Sotalol Initiation

Sotalol, a Vaughan-Williams Class III antiarrhythmic medication, is used to manage atrial arrhythmias. Due to its QT-prolonging effect and subsequent increased risk of torsade de pointes, many centers admit patients during the initial dosing period. Despite its widespread use, little information is available regarding dosing protocols during this period. In this multicenter investigation, dosing protocols in patients initiating sotalol therapy were examined to identify predictors of successful sotalol initiation. Over a 4-year period, patients admitted to 5 hospitals in the United States for inpatient telemetry monitoring during initiation for nonresearch purposes were enrolled. A 3-day course of 5 of 6 doses of sotalol was considered successful completion of the loading protocol. Of the 213 enrolled patients, over 90% were successfully discharged on sotalol. Significant bradycardia, ineffectiveness, and excessive QT prolongation were reasons for failed completion. Absence of a dose adjustment was a strong predictor of successful initiation (odds ratio: 6.6, 95% confidence interval: 1.3-32.7, P = .02). Hypertension, use of a calcium channel blocker, use of a separate β-blocker, and presence of a pacemaker were predictors of dose adjustments. Marginal structural models (ie, inverse probability weighting based on probability of a dose adjustment) verified that these factors also predicted successful initiation via preventing any dose adjustment and suggests that considering these factors may result in a higher likelihood of successful initiation in future investigations. In conclusion, we found that the majority of patients admitted for sotalol initiation are successfully discharged on the medication. The study findings suggest that factors predicting need for dose adjustment can be used to identify patients who could undergo outpatient initiation. Prospective studies are needed to verify this approach.
Osmotic Swelling Responses Are Conserved Across Cartilaginous Tissues With Varied Sulfated-Glycosaminoglycan Contents

Determining the influence of tissue composition on the osmotic swelling stress of articular cartilage and meniscus fibrocartilage is important to enhance our understanding of physiology and disease. This osmotic swelling stress is critical for the load-bearing capability of both tissues and results in part due to the interactions between the negatively charged sulfated glycosaminoglycan (sGAG) chains and the ionic interstitial fluid. Changes in sGAG content, as those occurring during the progression of degenerative joint disease, alter such interactions. Here, we compare the time-varying effects of altered osmotic environments on the confined compression swelling behavior of bovine tissues spanning a range of sGAG concentrations: juvenile articular cartilage, juvenile and adult meniscus, and juvenile cartilage enzymatically degraded to reduce its sGAG content. The transient response to changes in bath conditions was evaluated for explants assigned to one of three compressive offsets (5%, 10%, or 15% strain) and one of three bath conditions (0.1X, 1X, or 10X phosphate-buffered saline). Our results show that relative responses to alterations to the osmotic environment are consistent across native tissues but differ for degraded juvenile cartilage, demonstrating that changes in sGAG do not completely recapitulate the native swelling behaviors. Further, we found a strong correlation between aggregate modulus and sGAG/collagen, as well as between sGAG and collagen contents across native tissue types, suggesting some conservation of composition-function relationships across a range of tissue types with varying sGAG concentrations. © 2019 Orthopaedic Research Society. Published by Wiley Periodicals, Inc. J Orthop Res 38:785-792, 2020.
Spatial Channel Covariance Estimation for Hybrid Architectures Based on Tensor Decompositions

Spatial channel covariance information can replace full instantaneous channel state information for the analog precoder design in hybrid analog/digital architectures. Obtaining spatial channel covariance estimation, however, is challenging in the hybrid structure due to the use of fewer radio frequency (RF) chains than the number of antennas. In this paper, we propose a spatial channel covariance estimation method based on higher-order tensor decomposition for spatially sparse time-varying frequency-selective channels. The proposed method leverages the fact that the channel can be represented as a low-rank higher-order tensor. We also derive the Cramer-Rao lower bound on the estimation accuracy of the proposed method. Numerical results and theoretical analysis show that the proposed tensor-based approach achieves higher estimation accuracy in comparison with prior compressive-sensing-based approaches or conventional angle-of-arrival estimation approaches.
Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems

Restless bandit problems are instances of non-stationary multi-armed bandits. These problems have been studied well from the optimization perspective, where the goal is to efficiently find a near-optimal policy when system parameters are known. However, very few papers adopt a learning perspective, where the parameters are unknown. In this paper, we analyze the performance of Thompson sampling in episodic restless bandits with unknown parameters. We consider a general policy map to define our competitor and prove an $\tilde{\bigO}(\sqrt{T})$ Bayesian regret bound. Our competitor is flexible enough to represent various benchmarks including the best fixed action policy, the optimal policy, the Whittle index policy, or the myopic policy. We also present empirical results that support our theoretical findings.
Diffraction Gratings for Uniform Light Extraction from Light Guides

A theoretical approach for uniformly extracting light propagating through a light guide plate is developed here. Typically, liquid crystal display modalities utilize a backlit lighting system illuminated from the edge with light emitting diodes. The backlight acts as a light guide plate and is coupled with a diffuser sheet along the surface to uniformly extract the light. Our approach employs sub-micron diffraction gratings and eliminates the need for diffuser sheets, while ensuring the uniform extraction of light. The physical dimensions of the grating are varied along the surface of the light guide plate to control the diffraction efficiency, thus determining the local viewing angle and emitted intensity.
Optical Signal Processing

Abstract : We studied optical processing techniques to detect and track frequency hopped radio signals in a dense electromagnetic environment by using cross-spectrum of two signals obtained from antenna elements spaced by one-half an RF wavelength. We decimate the array by retaining only every Mth element and scan the cross-spectrum past the decimated array. We therefore reduce the circuit complexity, but suffer some loss in system performance because we require more photodetector bandwidth to accommodate the scanning action. An extension of the decimated array concept is to decimate the reference waveform in the heterodyne spectrum analyzer. In this case, we generate only 64 optical probes in the Fourier domain instead of the 2048 that are normally required. The advantage is that all of the optical power in the reference beam can be concentrated into the reduced number of optical probes, thereby offsetting some of the intrinsic loss in performance experienced by the cross-spectrum analyzer. (JHD)
Gender, Family, and Work

The country has prohibited sex discrimination since the 1960’s, but society continues to view women and men differently because women give birth, breastfeed, and are traditional caregivers. This article takes a historical look at court decisions and legislative efforts to address equality where men and women are not similarly situated and also explores recent developments and current debates, such as caregiver discrimination, lactation rooms and breaks, and the Affordable Care Act’s contraceptive mandate. Despite the abundance of legislation and court decisions over the past forty years, much progress still needs to be made.
Directed evolution improves the catalytic efficiency of TEV protease

Tobacco etch virus protease (TEV) is one of the most widely used proteases in biotechnology because of its exquisite sequence specificity. A limitation, however, is its slow catalytic rate. We developed a generalizable yeast-based platform for directed evolution of protease catalytic properties. Protease activity is read out via proteolytic release of a membrane-anchored transcription factor, and we temporally regulate access to TEV's cleavage substrate using a photosensory LOV domain. By gradually decreasing light exposure time, we enriched faster variants of TEV over multiple rounds of selection. Our TEV-S153N mutant (uTEV1Δ), when incorporated into the calcium integrator FLARE, improved the signal/background ratio by 27-fold, and enabled recording of neuronal activity in culture with 60-s temporal resolution. Given the widespread use of TEV in biotechnology, both our evolved TEV mutants and the directed-evolution platform used to generate them could be beneficial across a wide range of applications.