cssi/SciSciGPT-SciSciNet huggingface dataset:
Memory and truth: correcting errors with true feedback versus overwriting correct answers with errors

In five experiments, we examined the conditions under which participants remembered true and false information given as feedback. Participants answered general information questions, expressed their confidence in the correctness of their answers, and were given true or false feedback. In all five experiments, participants hypercorrected when they had made a mistake; that is, they remembered better the correct feedback to errors made with high compared to low confidence. However, in none of the experiments did participants hyper'correct' when false feedback followed an initially correct response. Telling people whether the feedback was right or wrong made little difference, suggesting that people already knew whether the feedback was true or false and differentially encoded the true feedback compared to the false feedback. An exception occurred when false feedback followed an error: participants hyper'corrected' to this false feedback, suggesting that when people are wrong initially, they are susceptible to further incorrect information. These results indicate that people have some kind of privileged access to whether their answers are right or wrong, above and beyond their confidence ratings, and that they behave differently when trying to remember new “corrective” information depending upon whether they, themselves, were right or wrong initially. The likely source of this additional information is knowledge about the truth of the feedback, which they rapidly process and use to modulate memory encoding.
Plan explanations as model reconciliation: an empirical study

Recent work in explanation generation for decision making agents has looked at how unexplained behavior of autonomous systems can be understood in terms of differences in the model of the system and the human's understanding of the same, and how the explanation process as a result of this mismatch can be then seen as a process of reconciliation of these models. Existing algorithms in such settings, while having been built on contrastive, selective and social properties of explanations as studied extensively in the psychology literature, have not, to the best of our knowledge, been evaluated in settings with actual humans in the loop. As such, the applicability of such explanations to human-AI and human-robot interactions remains suspect. In this paper, we set out to evaluate these explanation generation algorithms in a series of studies in a mock search and rescue scenario with an internal semi-autonomous robot and an external human commander. During that process, we hope to demonstrate to what extent the properties of these algorithms hold as they are evaluated by humans.
Stoichiometric balance of protein copy numbers is measurable and functionally significant in a protein-protein interaction network for yeast endocytosis

Stoichiometric balance, or dosage balance, implies that proteins that are subunits of obligate complexes (e.g. the ribosome) should have copy numbers expressed to match their stoichiometry in that complex. Establishing balance (or imbalance) is an important tool for inferring subunit function and assembly bottlenecks. We show here that these correlations in protein copy numbers can extend beyond complex subunits to larger protein-protein interactions networks (PPIN) involving a range of reversible binding interactions. We develop a simple method for quantifying balance in any interface-resolved PPINs based on network structure and experimentally observed protein copy numbers. By analyzing such a network for the clathrin-mediated endocytosis (CME) system in yeast, we found that the real protein copy numbers were significantly more balanced in relation to their binding partners compared to randomly sampled sets of yeast copy numbers. The observed balance is not perfect, highlighting both under and overexpressed proteins. We evaluate the potential cost and benefits of imbalance using two criteria. First, a potential cost to imbalance is that ‘leftover’ proteins without remaining functional partners are free to misinteract. We systematically quantify how this misinteraction cost is most dangerous for strong-binding protein interactions and for network topologies observed in biological PPINs. Second, a more direct consequence of imbalance is that the formation of specific functional complexes depends on relative copy numbers. We therefore construct simple kinetic models of two sub-networks in the CME network to assess multi-protein assembly of the ARP2/3 complex and a minimal, nine-protein clathrin-coated vesicle forming module. We find that the observed, imperfectly balanced copy numbers are less effective than balanced copy numbers in producing fast and complete multi-protein assemblies. However, we speculate that strategic imbalance in the vesicle forming module allows cells to tune where endocytosis occurs, providing sensitive control over cargo uptake via clathrin-coated vesicles.
Phenome-wide heritability analysis of the UK Biobank

Heritability estimation provides important information about the relative contribution of genetic and environmental factors to phenotypic variation, and provides an upper bound for the utility of genetic risk prediction models. Recent technological and statistical advances have enabled the estimation of additive heritability attributable to common genetic variants (SNP heritability) across a broad phenotypic spectrum. Here, we present a computationally and memory efficient heritability estimation method that can handle large sample sizes, and report the SNP heritability for 551 complex traits derived from the interim data release (152,736 subjects) of the large-scale, population-based UK Biobank, comprising both quantitative phenotypes and disease codes. We demonstrate that common genetic variation contributes to a broad array of quantitative traits and human diseases in the UK population, and identify phenotypes whose heritability is moderated by age (e.g., a majority of physical measures including height and body mass index), sex (e.g., blood pressure related traits) and socioeconomic status (education). Our study represents the first comprehensive phenome-wide heritability analysis in the UK Biobank, and underscores the importance of considering population characteristics in interpreting heritability.
Enantioselective Enolate Protonation: Matching Chiral Aniline and Substrate Acidity

A comparison of chiral anilines 1a−f in the asymmetric protonation of enolate 15 shows that the optimum ΔpKa value (chiral acid vs protonated enolate) for the highest enantioselectivity is ca. 3 (Table 2). An extension of this concept to amino acid enolates was possible, and 1e was found to give the best enantioselectivity (85% ee) with the alanine-derived N-lithioenolate 5a (Table 3). Changes in aniline pKa due to variation of substituents at the aniline nitrogen were evaluated briefly, but these changes did not show consistent trends in the enantioselectivity vs pKa.
Indol-2-one intermediates: mechanistic evidence and synthetic utility. Total syntheses of (+/-)-flustramines A and C.

A variety of 3,3-disubstituted 2-indolinones have been prepared by treatment of 3-bromo-3-alkyl-2-indolinones with dienophiles/nucleophiles in the presence of cesium carbonate. Application of this general strategy has facilitated the total syntheses of the reverse prenylated marine natural products (±)-flustramine A and (±)-flustramine C.
Association Between Substance Use Disorder and Polygenic Liability to Schizophrenia.

Background There are high levels of comorbidity between schizophrenia and substance use disorder, but little is known about the genetic etiology of this comorbidity.
Titanium-catalyzed addition of perfluoroalkyl iodides to alkenes

Abstract Perfluoroalkyl iodides, in the presence of a catalytic amount of Ti0 generated in situ, add to alkenes in dimethoxyethane solvent to afford 1-(n-perfluoroalkyl)-2-iodoalkanes in moderate to good yields. 1-Alkenes, 1-alkynes and alkenes containing bromo or ester substituents gave yields of the 1:1 addition adducts with n-perfluoroalkyl iodides. 1-Alkenes containing ketone or alcohol groups gave low yields of the 1:1 adduct. Reduction of the 1:1 adducts with Zn CH 3 CO 2 H is readily accomplished, and the overall procedure is amenable to a one-flask procedure. With diallyl ether, a tetrahydrofuran derivative was obtained in good yield. The reaction is completely suppressed by p-dinitrobenzene and partially suppressed by galvinoxyl. A single electron transfer mechanism is proposed.
MetaWRAP-a flexible pipeline for genome-resolved metagenomic data analysis.

The study of microbiomes using whole-metagenome shotgun sequencing enables the analysis of uncultivated microbial populations that may have important roles in their environments. Extracting individual draft genomes (bins) facilitates metagenomic analysis at the single genome level. Software and pipelines for such analysis have become diverse and sophisticated, resulting in a significant burden for biologists to access and use them. Furthermore, while bin extraction algorithms are rapidly improving, there is still a lack of tools for their evaluation and visualization. To address these challenges, we present metaWRAP, a modular pipeline software for shotgun metagenomic data analysis. MetaWRAP deploys state-of-the-art software to handle metagenomic data processing starting from raw sequencing reads and ending in metagenomic bins and their analysis. MetaWRAP is flexible enough to give investigators control over the analysis, while still being easy-to-install and easy-to-use. It includes hybrid algorithms that leverage the strengths of a variety of software to extract and refine high-quality bins from metagenomic data through bin consolidation and reassembly. MetaWRAP’s hybrid bin extraction algorithm outperforms individual binning approaches and other bin consolidation programs in both synthetic and real data sets. Finally, metaWRAP comes with numerous modules for the analysis of metagenomic bins, including taxonomy assignment, abundance estimation, functional annotation, and visualization. MetaWRAP is an easy-to-use modular pipeline that automates the core tasks in metagenomic analysis, while contributing significant improvements to the extraction and interpretation of high-quality metagenomic bins. The bin refinement and reassembly modules of metaWRAP consistently outperform other binning approaches. Each module of metaWRAP is also a standalone component, making it a flexible and versatile tool for tackling metagenomic shotgun sequencing data. MetaWRAP is open-source software available at https://github.com/bxlab/metaWRAP .
Using semidirect product of (semi)groups in public key cryptography.

In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This protocol can be based on any group or semigroup, in particular on any non-commutative group. One of its special cases is the standard Diffie-Hellman protocol, which is based on a cyclic group. However, when this protocol is used with a noncommutative (semi)group, it acquires several useful features that make it compare favorably to the Diffie-Hellman protocol. The focus then shifts to selecting an optimal platform (semi)group, in terms of security and efficiency. We show, in particular, that one can get a variety of new security assumptions by varying an automorphism used for a (semi)group extension.
Stabilization of the Pseudo-Benzene N6 Ring with Oxygen

The long sought N6 ring that is isoelectronic with benzene can be formed by adding coordinate-covalent bonds from oxygen. Optimized structures, normal infrared harmonic frequencies, heats of formation, and activation energies for unimolecular dissociation are presented for the N4O, N4O2, N6O, N6O2, and N6O3 systems. By increasing the number of oxygen atoms adjacent to the ring, a nitrogen ring with alternating positive and negative atomic charges can be created. In fact, the N4O2 and N6O3 systems have completely planar structures and computed heats of formation of 125.0 and 154.7 kcal mol-1, respectively. Furthermore, these systems appear kinetically stable with barriers to unimolecular dissociation of 44.8 and 62.4 kcal mol-1, respectively.
Tracing the ancestry of operons in bacteria

Motivation Complexity is a fundamental attribute of life. Complex systems are made of parts that together perform functions that a single component, or subsets of components, cannot. Examples of complex molecular systems include protein structures such as the F1Fo-ATPase, the ribosome, or the flagellar motor: each one of these structures requires most or all of its components to function properly. Given the ubiquity of complex systems in the biosphere, understanding the evolution of complexity is central to biology. At the molecular level, operons are classic examples of a complex system. An operon's genes are co-transcribed under the control of a single promoter to a polycistronic mRNA molecule, and the operon's gene products often form molecular complexes or metabolic pathways. With the large number of complete bacterial genomes available, we now have the opportunity to explore the evolution of these complex entities, by identifying possible intermediate states of operons. Results In this work, we developed a maximum parsimony algorithm to reconstruct ancestral operon states, and show a simple vertical evolution model of how operons may evolve from the individual component genes. We describe several ancestral states that are plausible functional intermediate forms leading to the full operon. We also offer Reconstruction of Ancestral Gene blocks Using Events or ROAGUE as a software tool for those interested in exploring gene block and operon evolution. Availability and implementation The software accompanying this paper is available under GPLv3 license on: https://github.com/nguyenngochuy91/Ancestral-Blocks-Reconstruction. Supplementary information Supplementary data are available at Bioinformatics online.
An intramolecular cycloaddition approach to pyrrolo[3,2-c]quinolones

Abstract An approach to pyrrolo[3,2- c ]quinolones is described which relies on an intramolecular azomethine ylide alkene cycloaddition reaction. Critical to the success of this reaction was the requirement for alkylation of the aniline nitrogen, in the absence of this substituent a decarboxylative-Michael addition pathway was observed.
Sequential ring-closing metathesis and silicon-assisted cross-coupling reactions: stereocontrolled synthesis of highly substituted unsaturated alcohols.

A sequential ring-closing metathesis/silicon-assisted cross-coupling sequence has been developed. Alkenyldimethylsilyl ethers of ω-unsaturated alcohols undergo facile ring closure with Schrock's catalyst to afford five-, six-, and seven-membered cycloalkenylsiloxanes bearing substituents on both alkenyl carbons. These siloxanes were highly effective coupling partners with various aryl and alkenyl halides and in the presence of Pd(0) afforded styrenes and dienes in high yield and specificity and with good functional group compatibility.
Synthesis of circumdatin F and sclerotigenin. Use of the 2-nitrobenzyl group for protection of a diketopiperazine amide; synthesis of ent-fumiquinazoline G

Abstract The Eguchi aza Wittig protocol has been used for the synthesis of sclerotigenin and circumdatin F by selective acylation of the more acidic anilide nitrogen of a benzodiazepinedione without the need for protecting groups. The use of the 2-nitrobenzyl group as a photochemically labile protecting group for the amide nitrogen of a diketopiperazine permits the use of the aza Wittig procedure for the synthesis of fumiquinazoline G.
Real-time observation of DNA target interrogation and product release by the RNA-guided endonuclease CRISPR Cpf1 (Cas12a)

CRISPR-Cas9, which imparts adaptive immunity against foreign genomic invaders in certain prokaryotes, has been repurposed for genome-engineering applications. More recently, another RNA-guided CRISPR endonuclease called Cpf1 (also known as Cas12a) was identified and is also being repurposed. Little is known about the kinetics and mechanism of Cpf1 DNA interaction and how sequence mismatches between the DNA target and guide-RNA influence this interaction. We used single-molecule fluorescence analysis and biochemical assays to characterize DNA interrogation, cleavage, and product release by three Cpf1 orthologs. Our Cpf1 data are consistent with the DNA interrogation mechanism proposed for Cas9. They both bind any DNA in search of protospacer-adjacent motif (PAM) sequences, verify the target sequence directionally from the PAM-proximal end, and rapidly reject any targets that lack a PAM or that are poorly matched with the guide-RNA. Unlike Cas9, which requires 9 bp for stable binding and ∼16 bp for cleavage, Cpf1 requires an ∼17-bp sequence match for both stable binding and cleavage. Unlike Cas9, which does not release the DNA cleavage products, Cpf1 rapidly releases the PAM-distal cleavage product, but not the PAM-proximal product. Solution pH, reducing conditions, and 5′ guanine in guide-RNA differentially affected different Cpf1 orthologs. Our findings have important implications on Cpf1-based genome engineering and manipulation applications.
Near-optimal Coded Apertures for Imaging via Nazarov’s Theorem

We characterize the fundamental limits of coded aperture imaging systems up to universal constants by drawing upon a theorem of Nazarov regarding Fourier transforms. Our work is performed under a simple propagation and sensor model that accounts for thermal and shot noise, scene correlation, and exposure time. Focusing on mean square error as a measure of linear reconstruction quality, we show that appropriate application of a theorem of Nazarov leads to essentially optimal coded apertures, up to a constant multiplicative factor in exposure time. Additionally, we develop a heuristically efficient algorithm to generate such patterns that explicitly takes into account scene correlations. This algorithm finds apertures that correspond to local optima of a certain potential on the hypercube, yet are guaranteed to be tight. Finally, for i.i.d. scenes, we show improvements upon prior work by using spectrally flat sequences with bias. The development focuses on 1D apertures for conceptual clarity; the natural generalizations to 2D are also discussed.
Anion-Molecule Approaches to Non-Kekulé Molecules: The Radical Anion of Cyclopentadienylidenetrimethylenemethane and Derivatives

Cyclopentadienylidenetrimethylenemethane radical anion 4, the one-electron reduction product of the corresponding diradical 3, was generated by a gas phase ion-molecule reaction of 6,6-dimethylfulv...
Lewis Acid Catalyzed α-Functionalization of Ketals for the Regioselective Synthesis of α-Carbamoyl Ketals

Treatment of 1 with DEAD in the presence of BF3·OEt2 gave 2 (R = H), which was N-alkylated to give 2 (R = CH2CO2Et), and insitu eliminated (E1cb) to give α-carbamoyl ketals.
Reversible Disruption of Specific Transcription Factor-DNA Interactions Using CRISPR/Cas9

The control of gene expression by transcription factor binding sites frequently determines phenotype. However, it is difficult to determine the function of single transcription factor binding sites within larger transcription networks. Here, we use deactivated Cas9 (dCas9) to disrupt binding to specific sites, a method we term CRISPRd. Since CRISPR guide RNAs are longer than transcription factor binding sites, flanking sequence can be used to target specific sites. Targeting dCas9 to an Oct4 site in the Nanog promoter displaced Oct4 from this site, reduced Nanog expression, and slowed division. In contrast, disrupting the Oct4 binding site adjacent to Pax6 upregulated Pax6 transcription and disrupting Nanog binding its own promoter upregulated its transcription. Thus, we can easily distinguish between activating and repressing binding sites and examine autoregulation. Finally, multiple guide RNA expression allows simultaneous inhibition of multiple binding sites, and conditionally destabilized dCas9 allows rapid reversibility.
Precision identification of diverse bloodstream pathogens in the gut microbiome

A comprehensive evaluation of every patient with a bloodstream infection includes an attempt to identify the infectious source. Pathogens can originate from various places, such as the gut microbiota, skin and the external environment. Identifying the definitive origin of an infection would enable precise interventions focused on management of the source1,2. Unfortunately, hospital infection control practices are often informed by assumptions about the source of various specific pathogens; if these assumptions are incorrect, they lead to interventions that do not decrease pathogen exposure3. Here, we develop and apply a streamlined bioinformatic tool, named StrainSifter, to match bloodstream pathogens precisely to a candidate source. We then leverage this approach to interrogate the gut microbiota as a potential reservoir of bloodstream pathogens in a cohort of hematopoietic cell transplantation recipients. We find that patients with Escherichia coli and Klebsiella pneumoniae bloodstream infections have concomitant gut colonization with these organisms, suggesting that the gut may be a source of these infections. We also find cases where typically nonenteric pathogens, such as Pseudomonas aeruginosa and Staphylococcus epidermidis, are found in the gut microbiota, thereby challenging the existing informal dogma of these infections originating from environmental or skin sources. Thus, we present an approach to distinguish the source of various bloodstream infections, which may facilitate more accurate tracking and prevention of hospital-acquired infections.
A Model for Adult Organ Resizing Demonstrates Stem Cell Scaling through a Tunable Commitment Rate

Abstract Many adult organs grow or shrink to accommodate different physiological demands. Often, as total cell number changes, stem cell number changes proportionally in a phenomenon called "stem cell scaling". The cellular behaviors that give rise to scaling are unknown. Here we study two complementary theoretical models of the adult Drosophila midgut, a stem cell-based organ with known resizing dynamics. First, we derive a differential equations model of midgut resizing and show that the in vivo kinetics of growth can be recapitulated if the rate of fate commitment depends on the tissue's stem cell proportion. Second, we develop a 2D simulation of the midgut and find that proportion-dependent commitment rate and stem cell scaling can arise phenomenologically from the stem cells' exploration of physical tissue space during its lifetime. Together, these models provide a biophysical understanding of how stem cell scaling is maintained during organ growth and shrinkage.
Synthesis and Structure of NaGaSn2. A Zintl Phase with a Helical Framework Structure

A new Zintl phase NaGaSn2 is obtained pure from stoichiometric reactions of the elements in sealed Ta at ∼450 °C. Its orthorhombic framework structure (space group C2221, 6.309(3) × 10.986(4) × 6.162(4) A) contains one-dimensional helical pores ∼6 A in diameter along c (6 atoms/turn) that bind relatively well-ordered sodium countercations at 50% occupancy. The structure can also be described in terms of interlinked puckered double layers normal to b and parallel to the channels. Gallium is disordered over both tetrahedral framework sites, the gallium-richer and more negative site having closer sodium neighbors. The potassium compound cannot be made. Among analogous phases reported by others, NaInSn2 has a lower symmetry and ordered cations, while NaGaSn5 cannot be reproduced.
Aza Diels–Alder reactions utilizing 4-iodo-2-trimethylsilyloxy-butadiene

Abstract The aza Diels–Alder reaction is described for a novel diene. Imines bearing benzyl and aromatic protecting groups both work well. Moderate diastereoselectivities can be obtained using the simple α-methylbenzyl chiral auxiliary.
Non-Precious Metal Catalysts for C–H Borylation Enabled by Metal–Metal Cooperativity

Homogeneous catalysts for C–H functionalization typically require precious metals such as Pd, Ru, Rh, or Ir because of their facility in mediating two-electron redox mechanisms. Base metals such as Cu or Fe instead tend to undergo one-electron redox processes. By coupling together two base metal sites in a hetero­bimetallic catalyst design, base metal catalysts for photochemical C–H borylation were discovered. The optimal catalyst, (IPr)Cu–FeCp(CO)2, represents the first homogeneous catalyst for C–H borylation that contains no precious metals. Using metal–metal cooperativity in this way allows for base metal catalysts to replace precious metal catalysts while maintaining advantageous regio­selectivity patterns. The proposed mechanism for heterobimetallic C–H borylation features bimetallic versions of classic organometallic reaction steps, serves as a guide for future catalyst designs, and opens the possibility for other precious metal transformations to be approached using metal–metal cooperativity as a design strategy.
Design and Implementation of an Efficient Synthetic Approach to Furanosylated Indolocarbazoles: Total Synthesis of (+)- and (−)-K252a

The first total synthesis of the natural product (+)-K252a (2) has been achieved in 12 steps from commercially available materials, with a longest linear sequence of seven steps and an overall yield of 21%. The synthetic strategy employs novel rhodium carbenoid chemistry in the construction of both the indolocarbazole aglycon (4) and the carbohydrate moiety (9).
Stereoselective Synthesis of the α-Glycoside of a KDO “C”-Disaccharide

The reaction of tert-butyl (4,5,7, 8-tetra-O-acetyl-3-deoxy-alpha-D-manno-2-octulopyranosyl chloride)onate donor 7 with the 6-formylgalactopyranoside acceptor 4 in the presence of SmI(2) provided only the KDO alpha-C-disaccharide 8. The bulky tert-butyl ester in the donor was used to reverse the stereochemical outcome of C-glycosylation, stereoselectively forming the alpha-"C"-disaccharide of KDO.
High Yield of Germanium Nanocrystals Synthesized from Germanium Diiodide in Solution

High chemical yields, up to 73%, were achieved for germanium (Ge) nanocrystals synthesized in solution with germanium diiodide (GeI2) and LiAlH4 as a reducing agent in tri-n-octylphosphine (TOP) or tri-n-butylphosphine (TBP). Ge nanocrystals were characterized by transmission electron microscopy (TEM), energy-dispersive X-ray spectroscopy (EDS), X-ray diffraction (XRD), Fourier transform infrared (FTIR) spectroscopy, and X-ray photoelectron spectroscopy (XPS). Reactions in TOP at 300 °C yielded Ge nanocrystals with moderate size polydispersity and good crystallinity with average diameters that could be manipulated by varying the precursor concentration from ∼3 to ∼11 nm. High chemical yields are enabled by the high reactivity of GeI2, high GeI2 solubility in alkyl phosphines, and relatively mild reaction temperature, which minimizes byproduct formation and solvent degradation. Compared to reactions carried out in TOP with the same concentration of GeI2, nanocrystals synthesized in TBP at 240 °C exhibit la...
Palladium-Catalyzed Ring-Opening Cyclization/Hydrosilylation of 1-Cyclopropyl-1,6-heptadienes to Form (E)-1-Butenyl Cyclopentanes

Reaction of 4,4-dicarbomethoxy-1-cyclopropyl-1,6-heptadiene (3) and HSiMe2OSiPh2t-Bu catalyzed by a 1:1 mixture of (phen)Pd(Me)Cl (2) (phen = 1,10-phenanthroline) and NaBAr4 [Ar = 3,5-C6H3(CF3)2] i...
Mouse embryonic stem cells can differentiate via multiple paths to the same state

In embryonic development, cells differentiate through stereotypical sequences of intermediate states to generate particular mature fates. By contrast, driving differentiation by ectopically expressing terminal transcription factors (direct programming) can generate similar fates by alternative routes. How differentiation in direct programming relates to embryonic differentiation is unclear. We applied single-cell RNA sequencing to compare two motor neuron differentiation protocols: a standard protocol approximating the embryonic lineage, and a direct programming method. Both initially undergo similar early neural commitment. Later, the direct programming path diverges into a novel transitional state rather than following the expected embryonic spinal intermediates. The novel state in direct programming has specific and uncharacteristic gene expression. It forms a loop in gene expression space that converges separately onto the same final motor neuron state as the standard path. Despite their different developmental histories, motor neurons from both protocols structurally, functionally, and transcriptionally resemble motor neurons isolated from embryos.
Privatization and Restructuring : An Incomplete-Contract Approach

Since an enterprise, which is to be privatized, has to be restructured in uncertainty, and the restructuring investments are sunk when the final decision on the sale price is taken, there is an imminent danger that restructuring is not efficient, and there is underinvestment. We consider, restructuring by the private buyer of the firm, by a government privatization agency, and by both. In the first two cases—one-sided restructuring—a first best can be achieved. In the case of both-sided restructuring, however, the first best cannot be reached if both parties engage in restructuring after signing the contract.
Pseudo-LiDAR From Visual Depth Estimation: Bridging the Gap in 3D Object Detection for Autonomous Driving

3D object detection is an essential task in autonomous driving. Recent techniques excel with highly accurate detection rates, provided the 3D input data is obtained from precise but expensive LiDAR technology. Approaches based on cheaper monocular or stereo imagery data have, until now, resulted in drastically lower accuracies --- a gap that is commonly attributed to poor image-based depth estimation. However, in this paper we argue that it is not the quality of the data but its representation that accounts for the majority of the difference. Taking the inner workings of convolutional neural networks into consideration, we propose to convert image-based depth maps to pseudo-LiDAR representations --- essentially mimicking the LiDAR signal. With this representation we can apply different existing LiDAR-based detection algorithms. On the popular KITTI benchmark, our approach achieves impressive improvements over the existing state-of-the-art in image-based performance --- raising the detection accuracy of objects within the 30m range from the previous state-of-the-art of 22% to an unprecedented 74%. At the time of submission our algorithm holds the highest entry on the KITTI 3D object detection leaderboard for stereo-image-based approaches.
A Dynamical Systems Perspective on Nesterov Acceleration

We present a dynamical system framework for understanding Nesterov's accelerated gradient method. In contrast to earlier work, our derivation does not rely on a vanishing step size argument. We show that Nesterov acceleration arises from discretizing an ordinary differential equation with a semi-implicit Euler integration scheme. We analyze both the underlying differential equation as well as the discretization to obtain insights into the phenomenon of acceleration. The analysis suggests that a curvature-dependent damping term lies at the heart of the phenomenon. We further establish connections between the discretized and the continuous-time dynamics.
Connected, but Qualified? Social Affiliations, Human Capital, and Service Professional Performance

While social capital has been found to play an important role in economic transactions when information is incomplete, it remains unclear how it interacts with human capital in transaction performa...
Automatic Detection and Categorization of Election-Related Tweets

With the rise in popularity of public social media and micro-blogging services, most notably Twitter, the people have found a venue to hear and be heard by their peers without an intermediary. As a consequence, and aided by the public nature of Twitter, political scientists now potentially have the means to analyse and understand the narratives that organically form, spread and decline among the public in a political campaign.However, the volume and diversity of the conversation on Twitter, combined with its noisy and idiosyncratic nature, make this a hard task. Thus, advanced data mining and language processing techniques are required to process and analyse the data. In this paper, we present and evaluate a technical framework, based on recent advances in deep neural networks, for identifying and analysing election-related conversation on Twitter on a continuous, longitudinal basis. Our models can detect election-related tweets with an F-score of 0.92 and can categorize these tweets into 22 topics with an F-score of 0.90.
BRILL–NOETHER THEOREMS AND GLOBALLY GENERATED VECTOR BUNDLES ON HIRZEBRUCH SURFACES

In this paper, we show that the cohomology of a general stable bundle on a Hirzebruch surface is determined by the Euler characteristic provided that the first Chern class satisfies necessary intersection conditions. More generally, we compute the Betti numbers of a general stable bundle. We also show that a general stable bundle on a Hirzebruch surface has a special resolution generalizing the Gaeta resolution on the projective plane. As a consequence of these results, we classify Chern characters such that the general stable bundle is globally generated.
On Uniserial Modules in the Auslander-Reiten Quiver

Abstract This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular algebras, and give estimates for the number of middle terms of an almost split sequence with a uniserial end term.
On the equality conditions of the Brunn-Minkowski theorem

This article describes a new proof of the equality condition for the Brunn-Minkowski inequality. The Brunn-Minkowski Theorem asserts that, for compact convex sets K,L ⊆ Rn, the n-th root of the Euclidean volume Vn is concave with respect to Minkowski combinations; that is, for λ ∈ [0, 1], Vn((1− λ)K + λL) ≥ (1− λ)Vn(K) + λVn(L). The equality condition asserts that if K and L both have positive volume, then equality holds for some λ ∈ (0, 1) if and only if K and L are homothetic. Denote n-dimensional Euclidean space by R. Given compact convex subsets K,L ⊆ R and a, b ≥ 0, denote aK + bL = {ax+ by | x ∈ K and y ∈ L}. An expression of this form is called a Minkowski combination or Minkowski sum. Since K and L are convex sets, the set aK + bL is also convex. Convexity also implies that aK + bK = (a + b)K for all a, b ≥ 0, although this does not hold for general sets. Two sets K and L are homothetic if K = aL+ x for some a > 0 and some point x ∈ R. The n-dimensional (Euclidean) volume of K will be denoted by Vn(K). The Brunn-Minkowski Theorem asserts that the n-th root of the Euclidean volume Vn is concave with respect to Minkowski combinations; that is, for λ ∈ [0, 1], (1) Vn((1− λ)K + λL) ≥ (1− λ)Vn(K) + λVn(L). If K and L have non-empty interiors, then equality holds for some λ ∈ (0, 1) if and only if K and L are homothetic. This article describes a new proof of this equality condition, using a homothetic projection theorem of Hadwiger. The Brunn-Minkowski Theorem is the centerpiece of modern convex geometry [1, 6, 14, 15]. This theorem encodes as special cases the classical isoperimetric inequality (relating volume and surface area [14, p. 318]), Urysohn’s inequality (relating volume and mean width, and strengthening the isodiametric inequality [14, p. 318]), and families of inequalities relating mean projections [14, p. 333]. The concavity implied by (1) leads to families of second-order discriminant-type inequalities for mixed volumes, such as Minkowski’s second mixed volume inequality [14, p. 317] and (after substantial additional labor) the Alexandrov-Fenchel Received by the editors May 9, 2010 and, in revised form, September 2, 2010. 2010 Mathematics Subject Classification. Primary 52A20, 52A38, 52A39, 52A40. c ©2011 American Mathematical Society Reverts to public domain 28 years from publication
Perron’s method for pathwise viscosity solutions

We use Perron’s method to construct viscosity solutions of fully non-linear degenerate parabolic pathwise (rough) partial differential equations. This provides an intrinsic method for proving the existence of solutions that relies only on a comparison principle, rather than considering equations driven by smooth approximating paths. The result covers the case of multidimensional geometric rough path noise, where the noise coefficients depend non-trivially on space and on the gradient of the solution. Also included in this note is a discussion of the comparison principle and a summary of the pathwise equations for which one has been proved.
Breaking the Span Assumption Yields Fast Finite-Sum Minimization

In this paper, we show that SVRG and SARAH can be modified to be fundamentally faster than all of the other standard algorithms that minimize the sum of $n$ smooth functions, such as SAGA, SAG, SDCA, and SDCA without duality. Most finite sum algorithms follow what we call the ``span assumption'': Their updates are in the span of a sequence of component gradients chosen in a random IID fashion. In the big data regime, where the condition number $\kappa=O(n)$, the span assumption prevents algorithms from converging to an approximate solution of accuracy $\epsilon$ in less than $n\ln(1/\epsilon)$ iterations. SVRG and SARAH do not follow the span assumption since they are updated with a hybrid of full-gradient and component-gradient information. We show that because of this, they can be up to $\Omega(1+(\ln(n/\kappa))_+)$ times faster. In particular, to obtain an accuracy $\epsilon = 1/n^\alpha$ for $\kappa=n^\beta$ and $\alpha,\beta\in(0,1)$, modified SVRG requires $O(n)$ iterations, whereas algorithms that follow the span assumption require $O(n\ln(n))$ iterations. Moreover, we present lower bound results that show this speedup is optimal, and provide analysis to help explain why this speedup exists. With the understanding that the span assumption is a point of weakness of finite sum algorithms, future work may purposefully exploit this to yield faster algorithms in the big data regime.
The traffic distribution of the squared unimodular random matrix and a formula for the moments of its ESD

The k-th moment of the mean empirical spectral distribution (ESD) of the squared unimodular random matrix of dimension N can be expressed in the form N−2k—1Qk(N), where Qk(x) is a polynomial of degree k + 1 with integer coefficients. We use tools from traffic-free probability to express the coefficients of this polynomial in terms of the number of quotients, with a certain property, of some colored directed graphs. The obtained result disproves the formula conjectured in A. Lakshminarayan, Z. Puchala, K. Życzkowski [3] .
Anomaly detection in unstructured environments using Bayesian nonparametric scene modeling

This paper explores the use of a Bayesian nonparametric topic modeling technique for the purpose of anomaly detection in video data. We present results from two experiments. The first experiment shows that the proposed technique is automatically able characterize the underlying terrain, and detect anomalous flora in image data collected by an underwater robot. The second experiment shows that the same technique can be used on images from a static camera in a dynamic unstructured environment. In the second dataset, consisting of video data from a static seafloor camera capturing images of a busy coral reef, the proposed technique was able to detect all three instances of an underwater vehicle passing in front of the camera, amongst many other observations of fishes, debris, lighting changes due to surface waves, and benthic flora.
Automorphisms of the bipartite graph planar algebra

For any abstract subfactor planar algebra P, there exists a finite index extremal subfactor M0⊂M1 with P as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and obtain subfactor planar subalgebras by taking fixed points under groups of automorphisms. This construction provides both new examples of subfactors and new descriptions of the planar algebras of previously known examples.
Constituency Parsing with a Self-Attentive Encoder

We demonstrate that replacing an LSTM encoder with a self-attentive architecture can lead to improvements to a state-of-the-art discriminative constituency parser. The use of attention makes explicit the manner in which information is propagated between different locations in the sentence, which we use to both analyze our model and propose potential improvements. For example, we find that separating positional and content information in the encoder can lead to improved parsing accuracy. Additionally, we evaluate different approaches for lexical representation. Our parser achieves new state-of-the-art results for single models trained on the Penn Treebank: 93.55 F1 without the use of any external data, and 95.13 F1 when using pre-trained word representations. Our parser also outperforms the previous best-published accuracy figures on 8 of the 9 languages in the SPMRL dataset.
Every genus one algebraically slice knot is 1-solvable

Cochran, Orr, and Teichner developed a filtration of the knot concordance group indexed by half integers called the solvable filtration. Its terms are denoted by $\mathcal{F}_n$. It has been shown that $\mathcal{F}_n/\mathcal{F}_{n.5}$ is a very large group for $n\ge 0$. For a generalization to the setting of links the third author showed that $\mathcal{F}_{n.5}/\mathcal{F}_{n+1}$ is non-trivial. In this paper we provide evidence that for knots $\mathcal{F}_{0.5}=\mathcal{F}_1$. In particular we prove that every genus 1 algebraically slice knot is 1-solvable.
Hierarchical Quantized Representations for Script Generation

Scripts define knowledge about how everyday scenarios (such as going to a restaurant) are expected to unfold. One of the challenges to learning scripts is the hierarchical nature of the knowledge. For example, a suspect arrested might plead innocent or guilty, and a very different track of events is then expected to happen. To capture this type of information, we propose an autoencoder model with a latent space defined by a hierarchy of categorical variables. We utilize a recently proposed vector quantization based approach, which allows continuous embeddings to be associated with each latent variable value. This permits the decoder to softly decide what portions of the latent hierarchy to condition on by attending over the value embeddings for a given setting. Our model effectively encodes and generates scripts, outperforming a recent language modeling-based method on several standard tasks, and allowing the autoencoder model to achieve substantially lower perplexity scores compared to the previous language modeling-based method.
Exponential stabilization without geometric control

We present examples of exponential stabilization for the damped wave equation on a compact manifold in situations where the geometric control condition is not satisfied. This follows from a dynamical argument involving a topological pressure on a suitable uncontrolled set.
The mean curvature flow for isoparametric submanifolds

A submanifold in space forms is isoparametric if the normal bundle is flat and principal curvatures along any parallel normal fields are constant. We study the mean curvature flow with initial data an isoparametric submanifold in Euclidean space and sphere. We show that the mean curvature flow preserves the isoparametric condition, develops singularities in finite time, and converges in finite time to a smooth submanifold of lower dimension. We also give a precise description of the collapsing
Incompressible surfaces, hyperbolic volume, Heegaard genus and homology

We show that if M is a complete, finite-volume, hyperbolic 3-manifold having exactly one cusp, and if H_1(M;Z_2) has dimension at least 6, then M has volume greater than 5.06. We also show that if M is a closed, orientable hyperbolic 3-manifold such that H_1(M;Z_2) has dimension at least 4, and if the image of the cup product map in H^2(M;Z_2) has dimension at most 1, then M has volume greater than 3.08. The proofs of these geometric results involve new topological results relating the Heegaard genus of a closed Haken manifold M to the Euler characteristic of the kishkes (i.e guts) of the complement of an incompressible surface in M.
A small frame and a certificate of its injectivity

We present a complex frame of eleven vectors in 4-space and prove that it defines injective measurements. That is, any rank-one 4 × 4 Hermitian matrix is uniquely determined by its values as a Hermitian form on this collection of eleven vectors. This disproves a recent conjecture of Bandeira, Cahill, Mixon, and Nelson. We use algebraic computations and certificates in order to prove injectivity.
A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models

Inference for spatial generalized linear mixed models (SGLMMs) for high-dimensional non-Gaussian spatial data is computationally intensive. The computational challenge is due to the high-dimensiona...
Multi-agent Path Planning and Network Flow

This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the latter, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, tomulti-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invariant, the problem always has a feasible solution path set with a longest finish time of no more than n + V - 1 steps, in which n is the number of agents and V is the number of vertices of the underlying graph.We then give a complete algorithm that finds such a solution in O(nVE) time, with E being the number of edges of the graph. Taking a further step, we study time and distance optimality of the feasible solutions, show that they have a pairwise Pareto optimal structure, and again provide efficient algorithms for optimizing two of these practical objectives.
Variational Inference of Disentangled Latent Concepts from Unlabeled Observations

Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant representations, transferability to other tasks, interpretability, etc. We consider the problem of unsupervised learning of disentangled representations from large pool of unlabeled observations, and propose a variational inference based approach to infer disentangled latent factors. We introduce a regularizer on the expectation of the approximate posterior over observed data that encourages the disentanglement. We also propose a new disentanglement metric which is better aligned with the qualitative disentanglement observed in the decoder's output. We empirically observe significant improvement over existing methods in terms of both disentanglement and data likelihood (reconstruction quality).