cssi/SciSciGPT-SciSciNet huggingface dataset:
[Rh(CO)2Cl]2-catalyzed domino reactions involving allylic substitution and subsequent carbocyclization reactions.

Three novel domino reaction processes have been discovered and developed that employ the regioselective and stereoselective [Rh(CO)2Cl]2-catalyzed alkylations of allylic trifluoroacetates with α-su...
Metagenomic characterization of the effect of feed additives on the gut microbiome and antibiotic resistome of feedlot cattle

In North America, antibiotic feed additives such as monensin and tylosin are added to the finishing diets of feedlot cattle to counter the ill-effects of feeding diets with rapidly digestible carbohydrates. While these feed additives have been proven to improve feed efficiency and reduce liver abscess incidence, how these products impact the gastrointestinal microbiota is not completely understood. In this study, we analyzed the impact of providing antibiotic feed additives to feedlot cattle using metagenome sequencing of treated and control animals. Our results indicate that use of antibiotic feed additives does not produce discernable changes at the phylum level. However, treated cattle had reduced abundance of gram-positive bacteria at the genus level. The abundance of Ruminococcus, Erysipelotrichaceae and Lachnospiraceae in the gut of treated steers was reduced. Functional analysis of the data indicates that there was only minimal impact due to the treatment in the rumen. Genes involved in detoxification were significantly increased in the rumen of AB steers. But the relative abundance of these genes was < 0.3%. However, our results did not show any correlation between the presence of antimicrobial resistance genes in the gut microbiota and the administration of antibiotic feed additives.
Epoxidation of cyclic olefins using dimeric molybdenum(VI) catalysts

Abstract Catalytic properties of dimeric molybdenum(VI) triketonates were compared to those of MoO 2 (acac) 2 in the epoxidation reaction of cyclooctene and 1,5-cyclooctadiene with tertiary butyl hydroperoxide. Studies of the reaction at a molar ratio of olefin:TBHP:catalyst= 1:1:0.001 for the monoolefin and 1:2:0.001 for the diolefin at 40 and 80 °C in dichloroethane were carried out. The dimeric Mo(VI) complexes preferentially catalyzed the production of a monoepoxide.
Improved synthesis of 4-amino-7-nitrobenz-2,1,3-oxadiazoles using NBD fluoride (NBD-F)

Abstract The 7-nitrobenz-2,1,3-oxadiazole (NBD) unit is a highly useful fluorescent tag with wide application in biology. Installation of the NBD group typically proceeds via the SNAr reaction between an amine and an NBD halide. Herein, we demonstrate that NBD-F 1 results in significantly higher yields than NBD-Cl 2, and that triethylamine in dimethylformamide at 23 °C overnight is a broadly applicable set of conditions for this reaction. In particular, the highly useful fluorescent carbohydrate 2-NBD-glucosamine (2-NBDG, 3) can now be prepared in 75% yield with NBD-F as compared to 12% with NBD-Cl.
Face enumeration on flag complexes and flag spheres

We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures including the Charney-Davis conjecture and Gal's conjecture, and the upper bound conjecture for flag spheres and pseudomanifolds.
Palladium-catalyzed synthesis of carbazoles from N-(2-halophenyl)-2,6-diisopropylanilines via C–C cleavage

Abstract The synthesis of 1-isopropyl-substituted carbazoles by the palladium-catalyzed dealkylative cyclization of N-(2-halophenyl)-2,6-diisopropylanilines is described. The reaction involves intramolecular C–C bond formation, coupled with the cleavage of a C–X bond and a C–C bond, and is proposed to proceed through the formation of a dearomatized intermediate.
Application of Oxazolidinone α-Fluoro Amide Chiral Building Blocks in the Asymmetric Synthesis of Fluorinated Carbohydrates: 2-Deoxy-2-fluoropentoses

Abstract Deconjugative electrophilic fluorination of the lithium dienolate of Z-α,β-unsaturated imide (+)-9 with N-fluorobenzenesulfonimide (NFSi) afforded the E-β,γ-unsaturated α-fluoro imide (+)-10 as a single diastereoisomer. Dihydroxylation resulted in the formation of 2-fluoro-2-deoxy-γ-xylonic and -lyxonic lactones, 12a and 12b, respectively. Reduction and deprotection of the lactones afforded 2-deoxy-2-fluoro-xylo- d -pyranose (15) and 2-deoxy-2-fluoro-lyxo- l -pyranose (17).
Simultaneous isotope dilution quantification and metabolic tracing of deoxyribonucleotides by liquid chromatography high resolution mass spectrometry.

Abstract Quantification of cellular deoxyribonucleoside mono- (dNMP), di- (dNDP), triphosphates (dNTPs) and related nucleoside metabolites are difficult due to their physiochemical properties and widely varying abundance. Involvement of dNTP metabolism in cellular processes including senescence and pathophysiological processes including cancer and viral infection make dNTP metabolism an important bioanalytical target. We modified a previously developed ion pairing reversed phase chromatography-mass spectrometry method for the simultaneous quantification and 13C isotope tracing of dNTP metabolites. dNMPs, dNDPs, and dNTPs were chromatographically resolved to avoid mis-annotation of in-source fragmentation. We used commercially available 13C15N-stable isotope labeled analogs as internal standards and show that this isotope dilution approach improves analytical figures of merit. At sufficiently high mass resolution achievable on an Orbitrap mass analyzer, stable isotope resolved metabolomics allows simultaneous isotope dilution quantification and 13C isotope tracing from major substrates including 13C-glucose. As a proof of principle, we quantified dNMP, dNDP and dNTP pools from multiple cell lines. We also identified isotopologue enrichment from glucose corresponding to ribose from the pentose-phosphate pathway in dNTP metabolites.
Age affects myosin relaxation states in skeletal muscle fibers of female but not male mice

The recent discovery that myosin has two distinct states in relaxed muscle-disordered relaxed (DRX) and super-relaxed (SRX)-provides another factor to consider in our fundamental understanding of the aging mechanism in skeletal muscle, since myosin is thought to be a potential contributor to dynapenia (age-associated loss of muscle strength independent of atrophy). The primary goal of this study was to determine the effects of age on DRX and SRX states and to examine their sex specificity. We have used quantitative fluorescence microscopy of the fluorescent nucleotide analog 2'/3'-O-(N-methylanthraniloyl) ATP (mantATP) to measure single-nucleotide turnover kinetics of myosin in skinned skeletal muscle fibers under relaxing conditions. We examined changes in DRX and SRX in response to the natural aging process by measuring the turnover of mantATP in skinned fibers isolated from psoas muscle of adult young (3-4 months old) and aged (26-28 months old) C57BL/6 female and male mice. Fluorescence decays were fitted to a multi-exponential decay function to determine both the time constants and mole fractions of fast and slow turnover populations, and significance was analyzed by a t-test. We found that in females, both the DRX and SRX lifetimes of myosin ATP turnover at steady state were shorter in aged muscle fibers compared to young muscle fibers (p ≤ 0.033). However, there was no significant difference in relaxation lifetime of either DRX (p = 0.202) or SRX (p = 0.804) between young and aged male mice. No significant effects were measured on the mole fractions (populations) of these states, as a function of sex or age (females, p = 0.100; males, p = 0.929). The effect of age on the order of myosin heads at rest and their ATPase function is sex specific, affecting only females. These findings provide new insight into the molecular factors and mechanisms that contribute to aging muscle dysfunction in a sex-specific manner.
Structural diversity based on cyclopropane scaffolds

A practical and efficient route for the stereoselective conversion of easily accessible homoallylic alcohols to diastereomerically pure cis- and trans-disubstituted and 1,2,3-trisubstituted cyclopropanes has been developed. The diversity of structures that can be prepared and the simplicity of the overall sequence make this route ideal for extension to solid-phase synthesis techniques and ultimately combinatorial library generation.
SYNTHESIS AND PROPERTIES OF A BIPOLAR, BISPHOSPHATIDYL ETHANOLAMINE THAT FORMS STABLE 2-DIMENSIONAL SELF-ASSEMBLED BILAYER SYSTEMS AND LIPOSOMES

Phosphatidyl ethanolamine is one of the most common naturally occurring phospholipids. The presence of an amino group also makes it one of the most straightforward to functionalize. Unfortunately h...
Global strong solution with BV derivatives to singular solid-on-solid model with exponential nonlinearity

Abstract In this work, we consider the one dimensional very singular fourth-order equation for solid-on-solid model in attachment-detachment-limit regime with exponential nonlinearity h t = ∇ ⋅ ( 1 | ∇ h | ∇ e δ E δ h ) = ∇ ⋅ ( 1 | ∇ h | ∇ e − ∇ ⋅ ( ∇ h | ∇ h | ) ) where total energy E = ∫ | ∇ h | is the total variation of h. Using a logarithmic correction for total energy E = ∫ | ∇ h | ln ⁡ | ∇ h | d x and gradient flow structure with a suitable defined functional, we prove the one dimensional evolution variational inequality solution preserves a positive gradient h x which has upper and lower bounds but in BV space. We also obtain the global strong solution to the solid-on-solid model which allows an asymmetric singularity h x x + to happen.
Investigation of two rational routes for preparing p-phenylene-linked porphyrin trimers

Abstract Multiporphyrin arrays with p-phenylene linkers, aryl groups at the non-linking meso positions, and no β-substituents are attractive constructs for light-harvesting applications. Condensation of a free base porphyrin-benzaldehyde and 5-mesityldipyrromethane (10 mM each) in CH2Cl2 containing 100 mM TFA at room temperature for 30–40 min followed by oxidation with DDQ afforded a p-phenylene-linked porphyrin trimer in 36% yield. Suzuki coupling of an iodo-porphyrin and a bis(dioxaborolane)-porphyrin (20 and 10 mM, respectively) in toluene/DMF (2:1) containing K2CO3 (8 equiv.) at 90–95°C for ∼20 h afforded the same trimer in 66% yield. The former route was used to prepare a diethynyl substituted p-phenylene-linked porphyrin trimer. While the two routes are somewhat complementary in scope, both are convergent and proceed in a rational manner.
Radical addition of RFI to alkenylsuccinic anhydrides and gem-substituted alkenyl triesters: Zinc and radical induced, or spontaneous radical cyclization, of the δ-iodoalkanoic esters to γ-lactones

Abstract Radical addition of RFI to alkenylsuccinic anhydrides affords ω-(perfluoroalkyl)-δ-iodoalkyl-2-butane-1,4-dioc acid anhydrides, and these adducts are reductively dehalogenated and esterified by zinc and acid in ethanol without lactonization. However, the RFI adducts react with KOH in ethanol to give the alkenyl half esters (but no γ-lactone), which convert to the γ-lactones by acid catalysis. When treated with water, ethanol, Zn and 48% HBr, the RFI adduct from but-3-en-2-yl-succinic anhydride converts to the iodo half ester, RFCH2CHICH(CH3)CH(CO2H)CH2CO2Et, which undergoes Zn induced (SHi) conversion to γ-lactone. RFI (AIBN) and the triester CH2CHCH2C(CO2Et)2CH2CO2Et yield RFCH2CHICH2C(CO2Et)2CH2CO2Et (95%). When heated to 140 °C, the adduct loses iodoethane.and cyclizes to diester γ-lactones (94%). With benzoyl peroxide, RFI and the triester at 99 °C, spontaneous radical cyclization of the adduct to lactone occurs. Evidently, the gem-disubstituted triester readily forms a five-membered lactone as a consequence of steric compression in the open chain form.
Synthesis of substituted 2-amino-4-quinazolinones via ortho-fluorobenzoyl guanidines

A novel route to 12 substituted 2-amino-4-quinazolinones is described. Starting from 2,6-difluoro-4-methoxybenzonitrile, substitution of one of the fluorine atoms either directly or indirectly with heterocycles (e.g., pyridyl, thiazolyl, pyrazolyl) followed by hydrolysis of the nitrile gave a series of o-fluorobenzoic acid derivatives. Condensation with a set of six N,N-disubstituted guanidines followed by base-promoted ring closure afforded 2-amino-4-quinazolinone derivatives.
FIRST EXPERIMENTAL EVIDENCE FOR THE FORMATION OF A SILICATE ANION BY INTRAMOLECULAR ADDITION OF A PERSULFOXIDE TO A TRIMETHYLSILOXY GROUP

Abstract The photooxidation of an α-trimethylsiloxysulfide has been studied. The reaction generates a persulfoxide which can be trapped by diphenylsulfoxide, decompose to generate triplet oxygen and substrate, or rearrange to a silicate product via a silicate intermediate.
Hydrothermal Synthesis and Crystal Structure of CaIn2(PO4)2(HPO4): An octahedral‐tetrahedral framework ternary calcium indium(III) phosphate

The new ternary calcium indium(III) phosphate CaIn2(PO4)2(HPO4) with mixed octahedral-tetrahedral framework was synthesized through hydrothermal reaction of stoichiometric amounts of CaO and InCl3 with excess of H3PO4 and H2O at pH = 1. Single crystal x-ray diffraction studies show the compound to crystallize in monoclinic symmetry, space group P21/n (#14) with a = 657.08(6), b = 2023.7(2), c = 665.72(7) pm, β = 91.20(1)°, Z = 4 and R = 0.043. The framework is built up of dimers of edge-sharing InO6 octahedra forming In2O10 units sharing all their OXO ligands with PO4 tetrahedra, and HPO4 groups. Hydrothermal-Synthese und Kristallstruktur von CaIn2(PO4)2(HPO4): Ein ternares Calcium-Indium(III)-Phosphat mit einem dreidimensionalen Oktaeder-Tetraeder-Gerust Das neue ternare Calcium-Indium(III)-Phosphat, CaIn2(PO4)2(HPO4), mit dreidimensionaler Oktaeder-Tetraeder-Raumnetzstrukur entsteht durch hydrothermale Umsetzung von stochiometrischen Gemischen von CaO und InCl3 mit einem Uberschus von H3PO4 und H2O. Die Kristallstruktur von CaIn2(PO4)2(HPO4) wurde aus Einkristall-Rontgendaten bestimmt (monoklin), Raumgruppe P21/n (#14), Z = 4, a = 657.08(6) pm, b = 2023.7(2) pm, c = 665.72(7) pm, β = 91.20(1)°, R = 0.043. Die dreidimensionale Raumnetzstruktur besteht aus kantenverknupften [In2O10]-Dimeren und PO4-Tetraedern sowie HPO4-Gruppen.
Isomeric Complexes of Peptides with Class II Proteins of the Major Histocompatibility Complex

An important event in the generation of an immune response is the activation of T cells by peptides bound to the class II proteins of the major histocompatiblity complex (MHC). Binding of a peptide to an MHC protein is stabilized by multiple interactions between the protein, peptide side-chains, and peptide backbone. Unstable protein−peptide complexes that precede formation of long-lived complexes are presumably engaged in a smaller number of these binding interactions. To investigate the effect of peptide structure on the formation of unstable complexes, we have strategically modified a peptide that forms only long-lived complexes (dissociation rate constant koff = 2.5 × 10-6 s-1). Dissociation of the modified peptide from an MHC protein is biphasic with dissociation rate constants koff = 5.3 × 10-4 and 2.6 × 10-6 s-1. Thus, at least two detectable complexes are formed. These results demonstrate that changes in peptide structure alone are sufficient to result in the formation of isomeric structures of MH...
Leaf shedding as an anti-bacterial defense in Arabidopsis cauline leaves.

Plants utilize an innate immune system to protect themselves from disease. While many molecular components of plant innate immunity resemble the innate immunity of animals, plants also have evolved a number of truly unique defense mechanisms, particularly at the physiological level. Plant’s flexible developmental program allows them the unique ability to simply produce new organs as needed, affording them the ability to replace damaged organs. Here we develop a system to study pathogen-triggered leaf abscission in Arabidopsis. Cauline leaves infected with the bacterial pathogen Pseudomonas syringae abscise as part of the defense mechanism. Pseudomonas syringae lacking a functional type III secretion system fail to elicit an abscission response, suggesting that the abscission response is a novel form of immunity triggered by effectors. HAESA/HAESA-like 2, INFLORESCENCE DEFICIENT IN ABSCISSION, and NEVERSHED are all required for pathogen-triggered abscission to occur. Additionally phytoalexin deficient 4, enhanced disease susceptibility 1, salicylic acid induction-deficient 2, and senescence-associated gene 101 plants with mutations in genes necessary for bacterial defense and salicylic acid signaling, and NahG transgenic plants with low levels of salicylic acid fail to abscise cauline leaves normally. Bacteria that physically contact abscission zones trigger a strong abscission response; however, long-distance signals are also sent from distal infected tissue to the abscission zone, alerting the abscission zone of looming danger. We propose a threshold model regulating cauline leaf defense where minor infections are handled by limiting bacterial growth, but when an infection is deemed out of control, cauline leaves are shed. Together with previous results, our findings suggest that salicylic acid may regulate both pathogen- and drought-triggered leaf abscission.
Regulated nuclear accumulation of a histone methyltransferase times the onset of heterochromatin formation in C. elegans embryos

Heterochromatin formation during early embryogenesis is timed precisely, but how this process is regulated remains elusive. We report the discovery of a histone methyltransferase complex whose nuclear accumulation and activation establish the onset of heterochromatin formation in Caenorhabditis elegans embryos. We find that the inception of heterochromatin generation coincides with the accumulation of the histone H3 lysine 9 (H3K9) methyltransferase MET-2 (SETDB) into nuclear hubs. The absence of MET-2 results in delayed and disturbed heterochromatin formation, whereas accelerated nuclear localization of the methyltransferase leads to precocious H3K9 methylation. We identify two factors that bind to and function with MET-2: LIN-65, which resembles activating transcription factor 7–interacting protein (ATF7IP) and localizes MET-2 into nuclear hubs, and ARLE-14, which is orthologous to adenosine 5′-diphosphate–ribosylation factor-like 14 effector protein (ARL14EP) and promotes stable association of MET-2 with chromatin. These data reveal that nuclear accumulation of MET-2 in conjunction with LIN-65 and ARLE-14 regulates timing of heterochromatin domains during embryogenesis.
Diophantine subsets of function fields of curves

We consider diophantine subsets of function fields of curves and show, roughly speaking, that they are either very small or very large. In particular, this implies that the ring of polynomials k[t] is not a diophantine subset of the field of rational functions k(t) for many fields k.
NQO1 targeting prodrug triggers innate sensing to overcome checkpoint blockade resistance

Lack of proper innate sensing inside tumor microenvironment (TME) limits T cell-targeted immunotherapy. NAD(P)H:quinone oxidoreductase 1 (NQO1) is highly enriched in multiple tumor types and has emerged as a promising target for direct tumor-killing. Here, we demonstrate that NQO1-targeting prodrug β-lapachone triggers tumor-selective innate sensing leading to T cell-dependent tumor control. β-Lapachone is catalyzed and bioactivated by NQO1 to generate ROS in NQO1high tumor cells triggering oxidative stress and release of the damage signals for innate sensing. β-Lapachone-induced high mobility group box 1 (HMGB1) release activates the host TLR4/MyD88/type I interferon pathway and Batf3 dendritic cell-dependent cross-priming to bridge innate and adaptive immune responses against the tumor. Furthermore, targeting NQO1 is very potent to trigger innate sensing for T cell re-activation to overcome checkpoint blockade resistance in well-established tumors. Our study reveals that targeting NQO1 potently triggers innate sensing within TME that synergizes with immunotherapy to overcome adaptive resistance.
Learning via social awareness: improving sketch representations with facial feedback

In the quest towards general artificial intelligence (AI), researchers have explored developing loss functions that act as intrinsic motivators in the absence of external rewards. This paper argues that such research has overlooked an important and useful intrinsic motivator: social interaction. We posit that making an AI agent aware of implicit social feedback from humans can allow for faster learning of more generalizable and useful representations, and could potentially impact AI safety. We collect social feedback in the form of facial expression reactions to samples from Sketch RNN, an LSTM-based variational autoencoder (VAE) designed to produce sketch drawings. We use a Latent Constraints GAN (LC-GAN) to learn from the facial feedback of a small group of viewers, and then show in an independent evaluation with 76 users that this model produced sketches that lead to significantly more positive facial expressions. Thus, we establish that implicit social feedback can improve the output of a deep learning model.
Symmetric subgroup actions on isotropic Grassmannians

Abstract Let G be the group preserving a nondegenerate sesquilinear form B on a vector space V, and H a symmetric subgroup of G of the type G 1 × G 2 . We explicitly parameterize the H-orbits in Gr G ( r ) , the Grassmannian of r-dimensional isotropic subspaces of V, by a complete set of H-invariants. We describe the Bruhat order in terms of the majorization relationship over a diagram of these H-invariants. The inclusion order, the stabilizer, the orbit dimension, the open H-orbits, the decompositions of an H orbit into H ∩ G 0 and H 0 orbits are also explicitly described.
THE TRI-PENTAGONAL NUMBER THEOREM AND RELATED IDENTITIES

I revisit an automated proof of Andrews' pentagonal number theorem found by Riese. I uncover a simple polynomial identity hidden behind his proof. I explain how to use this identity to prove Andrews' result along with a variety of new formulas of similar type. I reveal an interesting relation between the tri-pentagonal theorem and items (19), (20), (94), (98) on the celebrated Slater list. Finally, I establish a new infinite family of multiple series identities.
On asymptotic consensus value in directed random networks

We study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed random graphs, where each agent can communicate with any other agent with some exogenously specified probability. While different aspects of consensus algorithms over random switching networks have been widely studied, a complete characterization of the distribution of the asymptotic value for general asymmetric random consensus algorithms remains an open problem. In this paper, we derive closed-form expressions for the mean and an upper bound for the variance of the asymptotic consensus value, when the underlying network evolves according to an i.i.d. directed random graph process.
Why Do You Spread This Message? Understanding Users Sentiment in Social Media Campaigns

Twitter has been increasingly used for spreading messages about campaigns. Such campaigns try to gain followers through their Twitter accounts, influence the followers and spread messages through them. In this paper, we explore the relationship between followers’ sentiment towards the cam-paign topic and their rate of retweeting of messages gener-ated by the campaign. Our analysis with followers of mul-tiple social-media campaigns found statistical significant correlations between such sentiment and retweeting rate. Based on our analysis, we have conducted an online inter-vention study among the followers of different social-media campaigns. Our study shows that targeting followers based on their sentiment towards the campaign can give higher re-tweet rate than a number of other baseline approaches.
Unique Continuation for Fractional Orders of Elliptic Equations

We establish the strong unique continuation property of fractional orders of linear elliptic equations with Lipschitz coefficients by establishing almost monotonicity for an Almgren-type frequency functional via an extension procedure.
Improved well-posedness for the quadratic derivative nonlinear wave equation in 2D

Abstract In this paper we consider the Cauchy problem for the nonlinear wave equation (NLW) with quadratic derivative nonlinearities in two space dimensions. Following Grunrock's result in 3D, we take the data in the Fourier-Lebesgue spaces H ˆ s r , which coincide with the Sobolev spaces of the same regularity for r = 2 , but scale like lower regularity Sobolev spaces for 1 r 2 . We show local well-posedness (LWP) for the range of exponents s > 1 + 3 2 r , 1 r ≤ 2 . On one end this recovers the sharp result on the Sobolev scale, H 7 4 + , while on the other end establishes the H ˆ 5 2 1 + result, which scales like the Sobolev H 3 2 + , thus, corresponding to a 1 4 derivative improvement on the Sobolev scale.
Harmonic Maass form eigencurves

We construct two families of harmonic Maass Hecke eigenforms. Using these families, we construct p-adic harmonic Maass forms in the sense of Serre. The p-adic properties of these forms answer a question of Mazur about the existence of an “eigencurve-type” object in the world of harmonic Maass forms.
LANGLANDS PROGRAM, TRACE FORMULAS, AND THEIR GEOMETRIZATION

The Langlands Program relates Galois representations and auto- morphic representations of reductive algebraic groups. The trace formula is a powerful tool in the study of this connection and the Langlands Functorial- ity Conjecture. After giving an introduction to the Langlands Program and its geometric version, which applies to curves over finite fields and over the complex field, I give a survey of my recent joint work with Robert Langlands and Ngo Bao Chau (FLN, FN) on a new approach to proving the Functoriality Conjecture using the trace formulas, and on the geometrization of the trace formulas. In particular, I discuss the connection of the latter to the categorifi- cation of the Langlands correspondence.
Doubly random parallel stochastic methods for large scale learning

We consider learning problems over training sets in which both, the number of training examples and the dimension of the feature vectors, are large. To solve these problems we propose the random parallel stochastic algorithm (RAPSA). We call the algorithm random parallel because it utilizes multiple processors to operate in a randomly chosen subset of blocks of the feature vector. We call the algorithm parallel stochastic because processors choose elements of the training set randomly and independently. Algorithms that are parallel in either of these dimensions exist, but RAPSA is the first attempt at a methodology that is parallel in both, the selection of blocks and the selection of elements of the training set. In RAPSA, processors utilize the randomly chosen functions to compute the stochastic gradient component associated with a randomly chosen block. The technical contribution of this paper is to show that this minimally coordinated algorithm converges to the optimal classifier when the training objective is convex. In particular, we show that: (i) When using decreasing stepsizes, RAPSA converges almost surely over the random choice of blocks and functions. (ii) When using constant stepsizes, convergence is to a neighborhood of optimality with a rate that is linear in expectation. RAPSA is numerically evaluated on the MNIST digit recognition problem.
An Asynchronous Distributed Expectation Maximization Algorithm for Massive Data: The DEM Algorithm

The family of expectation--maximization (EM) algorithms provides a general approach to fitting flexible models for large and complex data. The expectation (E) step of EM-type algorithms is time-con...
Theta-regularity of curves and Brill–Noether loci

We provide a bound on the $\Theta$-regularity of an arbitrary reduced and irreducible curve embedded in a polarized abelian variety in terms of its degree and codimension. This is an "abelian" version of Gruson-Lazarsfeld-Peskine's bound on the Castelnuovo--Mumford regularity of a non-degenerate curve embedded in a projective space. As an application, we provide a Castelnuovo type bound for the genus of a curve in a (non necessarily principally) polarized abelian variety. Finally, we bound the $\Theta$-regularity of a class of higher dimensional subvarieties in Jacobian varieties, i.e. the Brill-Noether loci associated to a Petri general curve, extending earlier work of Pareschi-Popa.
Analysis of spectral clustering algorithms for community detection: the general bipartite setting

We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM). A modern spectral clustering algorithm consists of three steps: (1) regularization of an appropriate adjacency or Laplacian matrix (2) a form of spectral truncation and (3) a k-means type algorithm in the reduced spectral domain. We focus on the adjacency-based spectral clustering and for the first step, propose a new data-driven regularization that can restore the concentration of the adjacency matrix even for the sparse networks. This result is based on recent work on regularization of random binary matrices, but avoids using unknown population level parameters, and instead estimates the necessary quantities from the data. We also propose and study a novel variation of the spectral truncation step and show how this variation changes the nature of the misclassification rate in a general SBM. We then show how the consistency results can be extended to models beyond SBMs, such as inhomogeneous random graph models with approximate clusters, including a graphon clustering problem, as well as general sub-Gaussian biclustering. A theme of the paper is providing a better understanding of the analysis of spectral methods for community detection and establishing consistency results, under fairly general clustering models and for a wide regime of degree growths, including sparse cases where the average expected degree grows arbitrarily slowly.
Integrable probability: From representation theory to Macdonald processes

These are lecture notes for a mini-course given at the Cornell Probability Summer School in July 2013. Topics include lozenge tilings of polygons and their representation theoretic interpretation, the ( q , t )-deformation of those leading to the Macdonald processes, nearest neighbor dynamics on Macdonald processes, their limit to semi-discrete Brownian polymers, and large time asymptotic analysis of polymer's partition function.
Path-Following through Control Funnel Functions

We present an approach to path following using so-called control funnel functions. Synthesizing controllers to “robustly” follow a reference trajectory is a fundamental problem for autonomous vehicles. Robustness, in this context, requires our controllers to handle a specified amount of deviation from the desired trajectory. Our approach considers a timing law that describes how fast to move along a given reference trajectory and a control feedback law for reducing deviations from the reference. We synthesize both feedback laws using “control funnel functions” that jointly encode the control law as well as its correctness argument over a mathematical model of the vehicle dynamics. We adapt a previously described demonstration-based learning algorithm to synthesize a control funnel function as well as the associated feedback law. We implement this law on top of a 1/8th scale autonomous vehicle called the Parkour car. We compare the performance of our path following approach against a trajectory tracking approach by specifying trajectories of varying lengths and curvatures. Our experiments demonstrate the improved robustness obtained from the use of control funnel functions.
Segment Description of Turbulence

We propose a segment description for turbulent solutions to evo- lution equations in an eort to develop an eectiv e description rather than the classical Reynolds average. The new description has connections with symbolic dynamics and shadowing technique. The challenge of future study is how to eectiv ely implement the description numerically.
Slopes of indecomposable F-isocrystals

We prove that for an indecomposable convergent or overconvergent F-isocrystal on a smooth irreducible variety over a perfect field of characteristic p, the gap between consecutive slopes at the generic point cannot exceed 1. (This may be thought of as a crystalline analogue of the following consequence of Griffiths transversality: for an indecomposable variation of complex Hodge structures, there cannot be a gap between nonzero Hodge numbers.) As an application, we deduce a refinement of a result of V.Lafforgue on the slopes of Frobenius of an l-adic local system. We also prove similar statements for G-local systems (crystalline and l-adic ones), where G is a reductive group. We translate our results on local systems into properties of the p-adic absolute values of the Hecke eigenvalues of a cuspidal automorphic representation of a reductive group over the adeles of a global field of characteristic p>0.
Using Battery Storage for Peak Shaving and Frequency Regulation: Joint Optimization for Superlinear Gains

We consider using a battery storage system simultaneously for peak shaving and frequency regulation through a joint optimization framework, which captures battery degradation, operational constraints, and uncertainties in customer load and regulation signals. Under this framework, using real data we show the electricity bill of users can be reduced by up to 12%. Furthermore, we demonstrate that the saving from joint optimization is often larger than the sum of the optimal savings when the battery is used for the two individual applications. A simple threshold real-time algorithm is proposed and achieves this superlinear gain. Compared to prior works that focused on using battery storage systems for single applications, our results suggest that batteries can achieve much larger economic benefits than previously thought if they jointly provide multiple services.
Recurrence in 2D inviscid channel flow

Abstract I will prove a recurrence theorem which says that any H s ( s > 2 ) solution to the 2D inviscid channel flow returns repeatedly to an arbitrarily small H 0 neighborhood. The periodic boundary condition is imposed along the stream-wise direction. The result is an extension of an early result of Li [Y. Li, A recurrence theorem on the solutions to the 2D Euler equation, Asian J. Math. 13 (1) (2009) 1–6] on the 2D Euler equation under periodic boundary conditions along both directions.
Analogs of Linguistic Structure in Deep Representations

We investigate the compositional structure of message vectors computed by a deep network trained on a communication game. By comparing truth-conditional representations of encoder-produced message vectors to human-produced referring expressions, we are able to identify aligned (vector, utterance) pairs with the same meaning. We then search for structured relationships among these aligned pairs to discover simple vector space transformations corresponding to negation, conjunction, and disjunction. Our results suggest that neural representations are capable of spontaneously developing a “syntax” with functional analogues to qualitative properties of natural language.
Transitional Behavior of $q$ -Composite Random Key Graphs With Applications to Networked Control

Random key graphs have received considerable attention and been used in various applications including secure sensor networks, social networks, the study of epidemics, cryptanalysis, and recommender systems. In this paper, we investigate $q$ -composite random key graphs, whose construction on $n$ nodes is as follows: each node independently selects a set of $K_n$ different keys uniformly at random from the same pool of $P_n$ distinct keys, and two nodes establish an undirected edge in between if and only if they share at least $q$ key(s). Such $q$ -composite random key graphs allow modeling secure sensor networks employing the well-known $q$ -composite key predistribution. For such graphs, we analyze the probabilities of having $k$ -connectivity, $k$ -robustness, a Hamilton cycle, and perfect matching, respectively. The derived results reveal that $q$ -composite random key graphs exhibit a sharp transition for each property: as $K_n$ increases, the probability of the property sharply increases. These results provide guidelines to design secure sensor networks for different control-related applications: distributed in-network parameter estimation, fault-tolerant consensus, and resilient data backup.
Frame-Based Continuous Lexical Semantics through Exponential Family Tensor Factorization and Semantic Proto-Roles.

We study how different frame annotations complement one another when learning continuous lexical semantics. We learn the representations from a tensorized skip-gram model that consistently encodes syntactic-semantic content better, with multiple 10% gains over baselines.
On Finding Ordinary or Monochromatic Intersection Points

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R 2 , not all parallel and not all passing through a common point, in time O(nlog n). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R d , no d passing through a line and not all passing through the same point, again, in time O(nlog n). Two additional algorithms are provided that find an ordinary or monochromatic intersection, respectively, in an arrangement of pseudolines in time
The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks

We study the trade-off between storage overhead and inter-cluster repair bandwidth in clustered storage systems, while recovering from multiple node failures within a cluster. A cluster is a collection of m nodes, and there are n clusters. For data collection, we download the entire content from any k clusters. For repair of t ≥ 2 nodes within a cluster, we take help from l local nodes, as well as d helper clusters. We characterize the optimal trade-off under functional repair, and also under exact repair for the minimum storage and minimum inter-cluster bandwidth (MBR) operating points. Our bounds show the following interesting facts: 1) When t|(m − l) the tradeoff is the same as that under t = 1, and thus there is no advantage in jointly repairing multiple nodes, 2) When t |(m − l), the optimal file-size at the MBR point under exact repair can be strictly less than that under functional repair. 3) Unlike the case of t = 1, increasing the number of local helper nodes does not necessarily increase the system capacity under functional repair.
Ordered Bell numbers, Hermite polynomials, skew Young tableaux, and Borel orbits

We give three interpretations of the number b of orbits of the Borel subgroup of upper triangular matrices on the variety X of complete quadrics. First, we show that b is equal to the number of standard Young tableaux on skew-diagrams. Then, we relate b to certain values of a modified Hermite polynomial. Third, we relate b to a certain cell decomposition on X previously studied by De Concini, Springer, and Strickland. Using these, we give asymptotic estimates for b as the dimension of the quadrics increases.
Constructing completely integrable fields by a generalized-streamlines method

The classical approach to visualizing a flow, in terms of its streamlines, motivates a topological/soft-analytic argument for constrained variational equations. In its full generality, that argument provides an explicit formula for completely integrable solutions to a broad class of n-dimensional quasilinear exterior systems. In particular, it yields explicit solutions for extremal surfaces in Minkowski space and for Born--Infeld models.
Triple derivations on von Neumann algebras

It is well known that every derivation of a von Neumann algebra into itself is an inner derivation and that every derivation of a von Neumann algebra into its predual is inner. It is less well known that every triple derivation (defined below) of a von Neumann algebra into itself is an inner triple derivation.We examine to what extent all triple derivations of a von Neumann algebra into its predual are inner. This rarely happens but it comes close. We prove a (triple) cohomological characterization of finite factors and a zero-one law for factors. Namely, we show that for any factor, the linear space of triple derivations into the predual, modulo the norm closure of the inner triple derivations, has dimension 0 or 1: It is zero if and only if the factor is finite.
Exact Tensor Completion Using t-SVD

In this paper, we focus on the problem of completion of multidimensional arrays (also referred to as tensors), in particular three-dimensional (3-D) arrays, from limited sampling. Our approach is based on a recently proposed tensor algebraic framework where 3-D tensors are treated as linear operators over the set of 2-D tensors. In this framework, one can obtain a factorization for 3-D data, referred to as the tensor singular value decomposition (t-SVD), which is similar to the SVD for matrices. t-SVD results in a notion of rank referred to as the tubal-rank. Using this approach we consider the problem of sampling and recovery of 3-D arrays with low tubal-rank. We show that by solving a convex optimization problem, which minimizes a convex surrogate to the tubal-rank, one can guarantee exact recovery with high probability as long as number of samples is of the order $O(rnk \log (nk))$ , given a tensor of size $n\times n\times k$ with tubal-rank $r$ . The conditions under which this result holds are similar to the incoherence conditions for low-rank matrix completion under random sampling. The difference is that we define incoherence under the algebraic setup of t-SVD, which is different from the standard matrix incoherence conditions. We also compare the numerical performance of the proposed algorithm with some state-of-the-art approaches on real-world datasets.
Modularity based community detection in heterogeneous networks

Heterogeneous networks are networks consisting of different types of nodes and multiple types of edges linking such nodes. While community detection has been extensively developed as a useful technique for analyzing networks that contain only one type of nodes, very few community detection techniques have been developed for heterogeneous networks. In this paper, we propose a modularity based community detection framework for heterogeneous networks. Unlike existing methods, the proposed approach has the flexibility to treat the number of communities as an unknown quantity. We describe a Louvain type maximization method for finding the community structure that maximizes the modularity function. Our simulation results show the advantages of the proposed method over existing methods. Moreover, the proposed modularity function is shown to be consistent under a heterogeneous stochastic blockmodel framework. Analyses of the DBLP four-area dataset and a MovieLens dataset demonstrate the usefulness of the proposed method.
Joint Mode Selection and Resource Allocation for D2D Communications via Vertex Coloring

Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel joint mode selection and channel resource allocation algorithm via the vertex coloring approach. We decompose the problem into three subproblems and design algorithms for each of them. In the first step, we divide the users into groups using a vertex coloring algorithm. In the second step, we solve the power optimization problem using the interior-point method for each group and conduct mode selection between the cellular mode and D2D mode for D2D users, and we assign channel resources to these groups in the final step. Numerical results show that our algorithm achieves higher sum rate and serves more users with relatively small time consumption compared with other algorithms. Also, the influence of system parameters and the tradeoff between sum rate and the number of served users are studied through simulation results.
Invariant random subgroups of groups acting on hyperbolic spaces

Suppose that a group $G$ acts non-elementarily on a hyperbolic space $S$ and does not fix any point of $\partial S$. A subgroup $H\le G$ is said to be geometrically dense in $G$ if the limit sets of $H$ and $G$ coincide and $H$ does not fix any point of $\partial S$. We prove that every invariant random subgroup of $G$ is either geometrically dense or contained in the elliptic radical (i.e., the maximal normal elliptic subgroup of $G$). In particular, every ergodic measure preserving action of an acylindrically hyperbolic group on a Borel probability space $(X,\mu)$ either has finite stabilizers $\mu$-almost surely or otherwise the stabilizers are very large (in particular, acylindrically hyperbolic) $\mu$-almost surely.
Optimal discrete measures for Riesz potentials

For $s\geqslant d$, we obtain the leading term as $N\to \infty$ of the maximal weighted $N$-point Riesz $s$-polarization (or Chebyshev constant) for a certain class of $d$-rectifiable compact subsets of $\mathbb{R}^p$. This class includes compact subsets of $d$-dimensional $C^1$ manifolds whose boundary relative to the manifold has $\mathcal{H}_d$-measure zero, as well as finite unions of such sets when their pairwise intersections have $\mathcal{H}_d$-measure zero. We also explicitly find the weak$^*$ limit distribution of asymptotically optimal $N$-point polarization configurations as $N\to \infty$.
The space of morphisms on projective space

The theory of moduli of morphisms on Pn generalizes the study of rational maps on P1. This paper proves three results about the space of morphisms on Pn of degree d > 1, and its quotient by the conjugation action of PGL(n+1). First, we prove that this quotient is geometric, and compute the stable and semistable completions of the space of morphisms. This strengthens previous results of Silverman, as well as of Petsche, Szpiro, and Tepper. Second, we bound the size of the stabilizer group in PGL(n + 1) of every morphism in terms of only n and d. Third, we specialize to the case where n = 1, and show that the quotient space is rational for all d > 1; this partly generalizes a result of Silverman about the case d = 2.
Fundamental solution and the weight functions of the transient problem on a semi-infinite crack propagating in a half-plane

The two-dimensional transient problem that is studied concerns a semi-infinite crack in an isotropic solid comprising an infinite strip and a half-plane joined together and having the same elastic constants. The crack propagates along the interface at constant speed subject to time-independent loading. By means of the Laplace and Fourier transforms the problem is formulated as a vector Riemann-Hilbert problem. When the distance from the crack to the boundary grows to infinity the problem admits a closed-form solution. In the general case, a method of partial matrix factorization is proposed. In addition to factorizing some scalar functions it requires solving a certain system of integral equations whose numerical solution is computed by the collocation method. The stress intensity factors and the associated weight functions are derived. Numerical results for the weight functions are reported and the boundary effects are discussed. The weight functions are employed to describe propagation of a semi-infinite crack beneath the half-plane boundary at piecewise constant speed.