cssi/SciSciGPT-SciSciNet huggingface dataset:
Locomotor and reinforcing effects of pentedrone, pentylone and methylone in rats.

The broad diversity of synthetic cathinone psychostimulant drugs that are available to users complicates research efforts to provide understanding of health risks. Second generation cathinones pentedrone and pentylone are distinguished from each other by the 3,4-methylenedioxy structural motif (which distinguishes methamphetamine from 3,4-methylenedioxymethamphetamine) and each incorporates the α-alkyl chain motif contained in the transporter-inhibitor cathinones (3,4-methylenedioxypyrovalerone (MDPV), α-pyrrolidinopentiophenone (α-PVP)) but not in the monoamine releasers (mephedrone, methylone). Studies were conducted in male and female Wistar rats to compare locomotor and thermoregulatory effects of pentedrone, pentylone and methylone using an implanted radiotelemetry system. Reinforcing effects were assessed in female Wistar rats trained in the intravenous self-administration (IVSA) procedure and subjected to dose-substitution (0.025-0.3 m/gkg/inf) under a fixed-ratio 1 response contingency. Pentedrone, pentylone and methylone dose-effect curves were contrasted with those for α-PVP and α-pyrrolidinohexiophenone (α-PHP). Dose dependent increases in locomotion were observed after intraperitoneal injection of pentylone (0.5-10.0 mg/kg), pentedrone (0.5-10.0 mg/kg) or mephedrone (0.5-10.0 mg/kg) in male and female rats. The maximum locomotor effect was similar across drugs but lasted longest after pentedrone. Mean body temperature did not vary systematically more than 0.5 °C after pentedrone or pentylone in either sex. A sustained hyperthermia (0.4-0.8 °C) was observed for four hours after 10.0 mg/kg methylone in male rats. More infusions of pentedrone or pentylone were self-administered compared with methylone, but all three were less potent than α-PVP or α-PHP. These studies support the inference that second generation cathinones pentylone and pentedrone have abuse liability greater than that of methylone. This article is part of the Special Issue entitled 'Designer Drugs and Legal Highs.'
Noncanonical Contributions of MutLγ to VDE-Initiated Crossovers During Saccharomyces cerevisiae Meiosis

In Saccharomyces cerevisiae, the meiosis-specific axis proteins Hop1 and Red1 are present nonuniformly across the genome. In a previous study, the meiosis-specific VMA1-derived endonuclease (VDE) was used to examine Spo11-independent recombination in a recombination reporter inserted in a Hop1/Red1-enriched region (HIS4) and in a Hop1/Red1-poor region (URA3). VDE-initiated crossovers at HIS4 were mostly dependent on Mlh3, a component of the MutLγ meiotic recombination intermediate resolvase, while VDE-initiated crossovers at URA3 were mostly Mlh3-independent. These differences were abolished in the absence of the chromosome axis remodeler Pch2, and crossovers at both loci became partly Mlh3-dependent. To test the generality of these observations, we examined inserts at six additional loci that differed in terms of Hop1/Red1 enrichment, chromosome size, and distance from centromeres and telomeres. All six loci behaved similarly to URA3: the vast majority of VDE-initiated crossovers were Mlh3-independent. This indicates that, counter to previous suggestions, levels of meiotic chromosome axis protein enrichment alone do not determine which recombination pathway gives rise to crossovers during VDE-initiated meiotic recombination. In pch2∆ mutants, the fraction of VDE-induced crossovers that were Mlh3-dependent increased to levels previously observed for Spo11-initiated crossovers in pch2∆, indicating that Pch2-dependent processes play an important role in controlling the balance between MutLγ-dependent and MutLγ-independent crossovers.
PHYLUCE is a software package for the analysis of conserved genomic loci.

Summary: Targeted enrichment of conserved and ultraconserved genomic elements allows universal collection of phylogenomic data from hundreds of species at multiple time scales ( 300 Ma). Prior to downstream inference, data from these types of targeted enrichment studies must undergo preprocessing to assemble contigs from sequence data; identify targeted, enriched loci from the off-target background data; align enriched contigs representing conserved loci to one another; and prepare and manipulate these alignments for subsequent phylogenomic inference. PHYLUCE is an efficient and easy-to-install software package that accomplishes these tasks across hundreds of taxa and thousands of enriched loci. Availability and Implementation: PHYLUCE is written for Python 2.7. PHYLUCE is supported on OSX and Linux (RedHat/CentOS) operating systems. PHYLUCE source code is distributed under a BSD-style license from https://www.github.com/faircloth-lab/phyluce/. PHYLUCE is also available as a package (https://binstar.org/faircloth-lab/phyluce) for the Anaconda Python distribution that installs all dependencies, and users can request a PHYLUCE instance on iPlant Atmosphere (tag: phyluce). The software manual and a tutorial are available from http://phyluce.readthedocs.org/en/latest/ and test data are available from doi: 10.6084/m9.figshare.1284521. Contact: brant@faircloth-lab.org Supplementary information: Supplementary data are available at Bioinformatics online.
Intermolecular Morita–Baylis–Hillman reactions using dicobalthexacarbonyl complexed acetylenic acetals

An intermolecular Morita–Baylis–Hillman (MBH) reaction using dicobalthexacarbonyl complexed acetylenic acetals as the electrophile is reported. Employing BF3–OEt2 as the Lewis acid with a sulfide as the Lewis base MBH adducts were obtained.
Water relations of Calycanthus flowers: Hydraulic conductance, capacitance, and embolism resistance.

For most angiosperms, producing and maintaining flowers is critical to sexual reproduction, yet little is known about the physiological processes involved in maintaining flowers throughout anthesis. Among extant species, flowers of the genus Calycanthus have the highest hydraulic conductance and vein densities of species measured to date, yet they can wilt by late morning under hot conditions. Here, we combine diurnal measurements of gas exchange and water potential, pressure-volume relations, functional responses of gas exchange, and characterization of embolism formation using high resolution X-ray computed microtomography to determine drought responses of Calycanthus flowers. Transpiration from flowers frequently exceeded transpiration from leaves, and flowers were unable to limit transpiration under conditions of high vapour pressure deficit. As a result, they rely heavily on hydraulic capacitance to prevent water potential declines. Despite having high water potentials at turgor loss, flowers were very resistant to embolism formation, with no embolism apparent until tepal water potentials had declined to -2 MPa. Although Calycanthus flowers remain connected to the stem xylem and have high hydraulic capacitance, their inability to curtail transpiration leads to turgor loss. These results suggest that extreme climate events may cause flower failure, potentially preventing successful reproduction.
Synthesis of 3‐amino‐2‐carbamoylthiophene and its reaction with cycloalkanones to form imines

3-Amino-2-carbamoylthiophene (2) was obtained in 75% yield by reaction of methyl 3-aminothiophene-2-carboxylate with saturated aqueous ammonia containing ammonium chloride catalyst at room temperature over a period of 2,3 months, Treatment of 2 with cyclopentanone, cyclohexanone, and cycloheptanone in ethanol at pH 3.4 gave facile formation of 2-carbamoyl-3-cycloalkylidenaminothiophenes in yields of 73%, 86%, and 60%, respectively. Infrared and 1H nmr spectra of these imines indicate that they occur in intramolecularly hydrogenbonded form, i.e. with chelate rings. Comparison is made with reported syntheses and reactions of 2 and its isosteric 2-aminobenzamide.
Ionic current correlations are ubiquitous across phyla

Ionic currents, whether measured as conductance amplitude or as ion channel transcript numbers, can vary many-fold within a population of identified neurons. In invertebrate neuronal types multiple currents can be seen to vary while at the same time their magnitudes are correlated. These conductance amplitude correlations are thought to reflect a tight homeostasis of cellular excitability that enhances the robustness and stability of neuronal activity over long stretches of time. Although such ionic conductance correlations are well documented in invertebrates, they have not been reported in vertebrates. Here we demonstrate with two examples, identified mouse hippocampal granule cells (GCs) and cholinergic basal forebrain neurons, that the correlation of ionic conductance amplitudes between different ionic currents also exists in vertebrates, and we argue that it is a ubiquitous phenomenon expressed by many species across phyla. We further demonstrate that in dentate gyrus GCs these conductance correlations are likely regulated in a circadian manner. This is reminiscent of the known conductance regulation by neuromodulators in crustaceans. However, in GCs we observe a more nuanced regulation, where for some conductance pairs the correlations are completely eliminated while for others the correlation is quantitatively modified but not obliterated.
The effects of host species and sexual dimorphism differ among root, leaf and flower microbiomes of wild strawberries in situ.

Plant-associated microbiomes profoundly influence host interactions with below- and aboveground environments. Characterizing plant-associated microbiomes in experimental settings have revealed important drivers of microbiota assemblies within host species. However, it remains unclear how important these individual drivers (e.g., organ type, host species, host sexual phenotype) are in structuring the patterns of plant–microbiota association in the wild. Using 16s rRNA sequencing, we characterized root, leaf and flower microbiomes in three closely related, sexually polymorphic Fragaria species, in the broadly sympatric portion of their native ranges in Oregon, USA. Taking into account the potential influence of broad-scale abiotic environments, we found that organ type explained the largest variation of compositional and phylogenetic α- and β-diversity of bacterial communities in these wild populations, and its overall effect exceeded that of host species and host sex. Yet, the influence of host species increased from root to leaf to flower microbiomes. We detected strong sexual dimorphism in flower and leaf microbiomes, especially in host species with the most complete separation of sexes. Our results provide the first demonstration of enhanced influence of host species and sexual dimorphism from root to flower microbiomes, which may be applicable to many other plants in the wild.
Reactive point processes: A new approach to predicting power failures in underground electrical systems

Reactive point processes (RPPs) are a new statistical model designed for predicting discrete events in time based on past history. RPPs were developed to handle an important problem within the domain of electrical grid reliability: short-term prediction of electrical grid failures (“manhole events”), including outages, fires, explosions and smoking manholes, which can cause threats to public safety and reliability of electrical service in cities. RPPs incorporate self-exciting, self-regulating and saturating components. The self-excitement occurs as a result of a past event, which causes a temporary rise in vulner ability to future events. The self-regulation occurs as a result of an external inspection which temporarily lowers vulnerability to future events. RPPs can saturate when too many events or inspections occur close together, which ensures that the probability of an event stays within a realistic range. Two of the operational challenges for power companies are (i) making continuous-time failure predictions, and (ii) cost/benefit analysis for decision making and proactive maintenance. RPPs are naturally suited for handling both of these challenges. We use the model to predict power-grid failures in Manhattan over a short-term horizon, and to provide a cost/benefit analysis of different proactive maintenance programs.
Genes of the pig, Sus scrofa, reconstructed with EvidentialGene

The pig is a well-studied model animal of biomedical and agricultural importance. Genes of this species, Sus scrofa, are known from experiments and predictions, and collected at the NCBI reference sequence database section. Gene reconstruction from transcribed gene evidence of RNA-seq now can accurately and completely reproduce the biological gene sets of animals and plants. Such a gene set for the pig is reported here, including human orthologs missing from current NCBI and Ensembl reference pig gene sets, additional alternate transcripts, and other improvements. Methodology for accurate and complete gene set reconstruction from RNA is used: the automated SRA2Genes pipeline of EvidentialGene project.
Improved Synthesis of 2,2,2-Trinitroethyl Ethers

Abstract An improved synthesis of 2,2,2-trinitroethyl ethers (from iodomethyl ethers and trinitromethane) that avoids the use of unstable potassium trinitromethide is described.
Structure and magnetic properties of Pb2Cu3B4O11: a new copper borate featuring [Cu3O8]10- units.

Pb2Cu3B4O11 crystallizes in the monoclinic space group P2/n (No. 13) with a = 6.8016(15) A, b = 4.7123(10) A, c = 14.614(3) A, β = 97.089(3)°, and Z = 2. The crystal structure consists of infinite ...
An Asymmetric, Bifunctional Catalytic Approach to Non-Natural α-Amino Acid Derivatives

A catalytic, asymmetric process for the synthesis of 1,4-benzoxazinones from o-benzoquinone imides and ketene enolates is reported. Addition of Lewis acids (Zn(OTf)2, In(OTf)3, and in particular Sc(OTf)3) creates a bifunctional catalytic system that dramatically increases the reaction rate and the yield of these non-natural amino acid precursors while preserving the remarkable enantioselectivity inherent to the reaction. Cocatalyst Sc(OTf)3 increases the yield by up to 42% while producing products in >99% ee.
Room temperature syntheses of AuF6- and PtF6- salts, Ag+AuF6-, Ag2+PtF62-, and Ag2+pdF62-, and an estimate for E(MF6-) [M = Pt, Pd]

Solutions of AuF4- or PtF62- salts, prepared from the metals at ∼20 °C, in liquid anhydrous hydrogen fluoride (aHF), made basic with alkali fluorides, are further oxidized by photodissociated F2 (visible or near-UV light) to give AuF6- or PtF6- salts, including O2+AuF6- (with O2 in the F2). Similar photochemical oxidation of PdF62- salts does not occur. This new synthetic approach has provided LiAuF6 and LiPtF6 for the first time, each of which has the LiSbF6 type (R3) structure with (hexagonal cell): LiAuF6, a = 4.9953(9) A, c = 13.704(3) A, V/Z = 98.71(6) A3; LiPtF6, a = 5.0236(7) A, c = 13.623(2) A, V/Z = 99.25(5) A3. Interaction of AuF6- with Ag+ gives Ag+AuF6- (R3, a = 5.283(3) A, c = 15.053(6) A, V/Z = 121.3(2) A3), whereas PtF62- or PdF62- stabilize Ag2+ as Ag2+Pt(Pd)F62- (R3; AgPtF6: a = 5.049(8) A, c = 14.46(2) A, V/Z = 106.4(5) A3; and AgPdF6, a = 5.00(4) A, c = 14.6(2) A, V/Z = 105(3) A3). New cubic modifications (probable space group Ia3) have been found for AgMF6 (M, a value, A): Ru, 9....
Ethological principles predict the neuropeptides co-opted to influence parenting

Ethologists predicted that parental care evolves by modifying behavioural precursors in the asocial ancestor. As a corollary, we predict that the evolved mechanistic changes reside in genetic pathways underlying these traits. Here we test our hypothesis in female burying beetles, Nicrophorus vespilloides, an insect where caring adults regurgitate food to begging, dependent offspring. We quantify neuropeptide abundance in brains collected from three behavioural states: solitary virgins, individuals actively parenting or post-parenting solitary adults and quantify 133 peptides belonging to 18 neuropeptides. Eight neuropeptides differ in abundance in one or more states, with increased abundance during parenting in seven. None of these eight neuropeptides have been associated with parental care previously, but all have roles in predicted behavioural precursors for parenting. Our study supports the hypothesis that predictable traits and pathways are targets of selection during the evolution of parenting and suggests additional candidate neuropeptides to study in the context of parenting.
The electron transfer reactions of cyano substituted pyridines and quinolines with thermally generated diphenyl ketyl

Electron transfer reactions of cyano substituted pyridines and quinolines with thermally generated diphenyl ketyl are reported. When E1/2(-) for the heterocycle is less negative than -2V, electron transfer occurs from the ketyl to the heterocyclic base. In some cases the products obtained from the thermal reaction are the same as those obtained from the photochemical reaction with benzophenone and alcohols. In other cases different products are formed. Two bases, 2-pyridinecarbonitrile and 2,4-pyridinedicarbonitrile, undergo regiospecific reactions in which the course of the reaction is determined by the acidity of the medium. A mechanism in which the heterocyclic nitrogen is involved in the substitution process at the 2 position is proposed.
Tandem carbon-carbon and carbon-chlorine bond formation by Cu(II) chloride-promoted [3,3] sigmatropic rearrangement of N-allylhydrazones.

A new copper(II) chloride-promoted rearrangement of N-allylhydrazones has been developed. Treatment of a number of aromatic N-allylhydrazones with copper(II) chloride provides the formation of both a new carbon−carbon bond and a carbon−chlorine bond in the same reaction. Substrate studies revealed that the carbon−carbon bond-forming step proceeds by way of a concerted [3,3] sigmatropic rearrangement and selectively generates trans-substituted alkenes.
Predictive Kinetics: A New Approach for the 21st Century

The capability to reliably predict the behavior of reactive chemical systems would allow rational a priori design of chemical reaction systems. Recent progress toward overcoming several technical obstacles to predictive kinetics for homogeneous gas-phase systems is reviewed. The focus is on (1) updates to the fundamental data model used in kinetic modeling, (2) methods for solving large kinetic simulations efficiently without relying on uncontrolled approximations, and (3) methods for determining whether or not the model predictions are consistent with experimental data. Appropriate handling and archiving of experimental data from different sources, and of the many uncertainties in the data embedded throughout the kinetic models, is a major challenge facing the kinetics community as kinetics becomes a predictive science.
A PRACTICAL PHOTOCHEMICAL SYNTHESIS OF 6-AZA-1,10-PHENANTHROIC ANHYDRIDE

Abstract A high yield synthesis of 6-aza-1, 10-phenanthroic anhydride has been developed. The key step is a volume-efficient photochemical cyclization of azastilbene 5 to the photochemically stable dihydroazaphenanthrene 9.
Functionalized Oxepines via Fragmentation of Highly Strained Epoxides

Epoxidation of highly strained cyclobutenes followed by thermal rearrangement provides a new entry into oxepine-containing bicyclo[5.3.0] ring systems. In contrast to the rearrangement of the corresponding cyclopropanated systems, the strained epoxides in this study are believed to fragment through two competing pathways leading to a mixture of diastereomeric 5-7 ring systems.
Local Markov property for models satisfying composition axiom

The local Markov condition for a DAG to be an independence map of a probability distribution is well known. For DAGs with latent variables, represented as bi-directed edges in the graph, the local Markov property may invoke exponential number of conditional independencies. This paper shows that the number of conditional independence relations required may be reduced if the probability distributions satisfy the composition axiom. In certain types of graphs, only linear number of conditional independencies are required. The result has applications in testing linear structural equation models with correlated errors.
Markov equivalence classes for maximal ancestral graphs

Ancestral graphs provide a class of graphs that can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables, corresponding to marginalization and conditioning. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We introduce a simple representation of a Markov equivalence class of ancestral graphs, thereby facilitating the model search process for some given data. More specifically, we define a join operation on ancestral graphs which will associate a unique graph with an equivalence class. We also extend the separation criterion for ancestral graphs (which is an extension of d-separation) and provide a proof of the pairwise Markov property for joined ancestral graphs. Proving the pairwise Markov property is the first step towards developing a global Markov property for these graphs. The ultimate goal of this work is to obtain a full characterization of the structure of Markov equivalence classes for maximal ancestral graphs, thereby extending analogous results for DAGs given by Frydenberg (1990), Verma and Pearl (1991), Chickering (1995) and Andersson et al. (1997).
The Complexity of Black-Box Mechanism Design with Priors

We study black-box reductions from mechanism design to algorithm design for welfare maximization in settings of incomplete information. Given oracle access to an algorithm for an underlying optimization problem, the goal is to simulate an incentive compatible mechanism. The mechanism will be evaluated on its expected welfare, relative to the algorithm provided, and its complexity is measured by the time (and queries) needed to simulate the mechanism on any input. While it is known that black-box reductions are not possible in many prior-free settings, settings with priors appear more promising: there are known reductions for Bayesian incentive compatible (BIC) mechanism design for general classes of welfare maximization problems. This dichotomy begs the question: which mechanism design problems admit black-box reductions, and which do not? Our main result is that black-box mechanism design is impossible under two of the simplest settings not captured by known positive results. First, for the problem of allocating n goods to a single buyer whose valuation is additive and independent across the goods, subject to a downward-closed constraint on feasible allocations, we show that there is no polytime (in n) BIC black-box reduction for expected welfare maximization. Second, for the setting of multiple single-parameter agents---where polytime BIC reductions are known---we show that no polytime reductions exist when the incentive requirement is tightened to Max-In-Distributional-Range. In each case, we show that achieving a sub-polynomial approximation to the expected welfare requires exponentially many queries, even when the set of feasible allocations is known to be downward-closed.
An incentive compatible, efficient market for air traffic flow management

We present a market-based approach to the Air Traffic Flow Management (ATFM) problem. The goods in our market are delays and buyers are airline companies; the latter pay money to the Federal Aviation Administration (FAA) to buy away the desired amount of delay on a per flight basis. We give a notion of equilibrium for this market and an LP whose every optimal solution gives an equilibrium allocation of flights to landing slots as well as equilibrium prices for the landing slots. Via a reduction to matching, we show that this equilibrium can be computed combinatorially in strongly polynomial time. Moreover, there is a special set of equilibrium prices, which can be computed easily, that is identical to the VCG solution, and therefore the market is incentive compatible in dominant strategy.
Generalizing the theory of cooperative inference

Cooperation information sharing is important to theories of human learning and has potential implications for machine learning. Prior work derived conditions for achieving optimal Cooperative Inference given strong, relatively restrictive assumptions. We relax these assumptions by demonstrating convergence for any discrete joint distribution, robustness through equivalence classes and stability under perturbation, and effectiveness by deriving bounds from structural properties of the original joint distribution. We provide geometric interpretations, connections to and implications for optimal transport, and connections to importance sampling, and conclude by outlining open questions and challenges to realizing the promise of Cooperative Inference.
Segmental Recurrent Neural Networks

Abstract: We introduce segmental recurrent neural networks (SRNNs) which define, given an input sequence, a joint probability distribution over segmentations of the input and labelings of the segments. Representations of the input segments (i.e., contiguous subsequences of the input) are computed by encoding their constituent tokens using bidirectional recurrent neural nets, and these "segment embeddings" are used to define compatibility scores with output labels. These local compatibility scores are integrated using a global semi-Markov conditional random field. Both fully supervised training -- in which segment boundaries and labels are observed -- as well as partially supervised training -- in which segment boundaries are latent -- are straightforward. Experiments on handwriting recognition and joint Chinese word segmentation/POS tagging show that, compared to models that do not explicitly represent segments such as BIO tagging schemes and connectionist temporal classification (CTC), SRNNs obtain substantially higher accuracies.
Indices of inseparability and refined ramification breaks

Abstract Let K be a finite extension of Q p which contains a primitive p th root of unity ζ p . Let L / K be a totally ramified ( Z / p Z ) 2 -extension which has a single ramification break b . In [2] Byott and Elder defined a “refined ramification break” b ⁎ for L / K . In this paper we prove that if p > 2 and the index of inseparability i 1 of L / K is not equal to p 2 b − p b then b ⁎ = i 1 − p 2 b + p b + b .
The FastMap Algorithm for Shortest Path Computations

We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data mining algorithm of the same name and runs in near-linear time. Hence, FastMap is orders of magnitude faster than competing approaches that produce a Euclidean embedding using Semidefinite Programming. FastMap also produces admissible and consistent heuristics and therefore guarantees the generation of shortest paths. Moreover, FastMap applies to general undirected graphs for which many traditional heuristics, such as the Manhattan Distance heuristic, are not well defined. Empirically, we demonstrate that A* search using the FastMap heuristic is competitive with A* search using other state-of-the-art heuristics, such as the Differential heuristic.
Improving direct physical properties prediction of heterogeneous materials from imaging data via convolutional neural network and a morphology-aware generative model

Abstract Direct prediction of material properties from microstructures through statistical models has shown to be a potential approach to accelerating computational material design with large design spaces. However, statistical modeling of highly nonlinear mappings defined on high-dimensional microstructure spaces is known to be data-demanding. Thus, the added value of such predictive models diminishes in common cases where material samples (in forms of 2D or 3D microstructures) become costly to acquire either experimentally or computationally. To this end, we propose a generative machine learning model that creates an arbitrary amount of artificial material samples with negligible computation cost, when trained on only a limited amount of authentic samples. The key contribution of this work is the introduction of a morphology constraint to the training of the generative model, that enforces the resultant artificial material samples to have the same morphology distribution as the authentic ones. We show empirically that the proposed model creates artificial samples that better match with the authentic ones in material property distributions than those generated from a state-of-the-art Markov Random Field model, and thus is more effective at improving the prediction performance of a predictive structure-property model.
Solutions to the T-Systems with Principal Coefficients

The $A_\infty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). We define T-systems with principal coefficients from cluster algebra aspect, and give combinatorial solutions with respect to any valid initial condition in terms of partition functions of perfect matchings, non-intersecting paths and networks. This also provides a solution to other systems with various choices of coefficients on T-systems including Speyer's octahedron recurrence (Speyer 2007), generalized lambda-determinants (Di Francesco 2013) and (higher) pentagram maps (Schwartz 1992, Ovsienko et al. 2010, Glick 2011, Gekhtman et al. 2016).
Bayesian estimations for diagonalizable bilinear SPDEs

Abstract The main goal of this paper is to study the parameter estimation problem, using the Bayesian methodology, for the drift coefficient of some linear (parabolic) SPDEs driven by a multiplicative noise of special structure. We take the spectral approach by assuming that one path of the first N Fourier modes of the solution is continuously observed over a finite time interval. First, we show that the model is regular and fits into classical local asymptotic normality framework, and thus the MLE and the Bayesian estimators are weakly consistent, asymptotically normal, efficient, and asymptotically equivalent in the class of loss functions with polynomial growth. Secondly, and mainly, we prove a Bernstein–Von Mises type result, that strengthens the existing results in the literature, and that also allows to investigate the Bayesian type estimators with respect to a larger class of priors and loss functions than that covered by classical asymptotic theory. In particular, we prove strong consistency and asymptotic normality of Bayesian estimators in the class of loss functions of at most exponential growth. Finally, we present some numerical examples that illustrate the obtained theoretical results.
On Kawai theorem for orbifold Riemann surfaces

We prove a generalization of Kawai theorem for the case of orbifold Riemann surface. The computation is based on a formula for the differential of a holomorphic map from the cotangent bundle of the Teichmuller space to the $${\mathrm {PSL}}(2,\mathbb {C})$$ -character variety, which allows to evaluate explicitly the pullback of Goldman symplectic form in the spirit of Riemann bilinear relations. As a corollary, we obtain a generalization of Goldman’s theorem that the pullback of Goldman symplectic form on the $${\mathrm {PSL}}(2,\mathbb {R})$$ -character variety is a symplectic form of the Weil–Petersson metric on the Teichmuller space.
Cyber-Induced Risk Modeling for Microprocessor-Based Relays in Substations

Once critical substations are compromised, attack agents can coordinate among their peers to plot for maximizing disruption using local control devices. For defenders, it is critical to enumerate and identify all digital relays to determine the systemic risks. Any combination of disruptive switching via the compromised relays can result in misoperation or immediate effect to the system. The resulting consequence of these attack’s initial events would possibly incur cascading failure to a grid. This paper quantifies the criticality of substation protective relays with the combination of the outage level and its corresponding severity risk index. The proposed hypothesized outages are based on the type of protective relaying, bus configuration of a substation, and commonly implemented relaying schemes, such as bus differential, directional overcurrent and distance relays, are studied. This preliminary work also provides three approaches of determination in probabilities for sensitivity analysis. The proposed risk indices are evaluated using IEEE test systems.
Efficient third-harmonic generation in composite aluminum nitride/silicon nitride microrings

Aluminum nitride and silicon nitride have recently emerged as important nonlinear optical materials in integrated photonics for their quadratic and cubic optical nonlinearity, respectively. A composite aluminum nitride and silicon nitride waveguide structure, if realized, will simultaneously allow highly efficient second- and third-harmonic generation on the same chip platform and therefore assists 2f-3f self-referenced frequency combs. On-chip third-harmonic generation, being a higher-order nonlinear optics effect, is more demanding than second-harmonic generation due to the large frequency difference between the fundamental- and third-harmonic frequencies, which implies a large change of refractive indices and more stringent requirements on phase matching. In this work we demonstrate high-efficiency third-harmonic generation in a high-Q composite aluminum nitride/silicon nitride ring cavity. By carefully engineering the microring resonator geometry of the bilayer structure to optimize the quality factor, mode volume, and modal overlap of the optical fields, we report a maximum conversion efficiency of 180% W−2, corresponding to an absolute conversion efficiency of 0.16%. This composite photonic chip design provides a solution for efficient frequency conversion over a large wavelength span, broadband comb generation, and self-referenced frequency combs.
New sufficient conditions for Multiple-Access Channel with correlated sources

The problem of three-user Multiple-Access Channel (MAC) with correlated sources is investigated. An extension to the Cover-El Gamal-Salehi (CES) scheme is introduced. We argue that if the sources impose certain algebraic structures, then the application of structured codes improves upon the CES scheme. Based on this notion, we use a combination of the CES scheme with linear codes, and propose a new coding strategy. We derive new sufficient conditions to transmit correlated sources reliably. We consider an example of a three-user MAC with binary inputs. Using this example, we show strict improvements over the CES scheme.
Enomoto and Ota’s Conjecture Holds for Large Graphs

In 2000, Enomoto and Ota conjectured that if a graph G satisfies $$\sigma _{2}(G) \ge |G| + k - 1$$ , then for any set of k vertices $$v_{1}, \ldots , v_{k}$$ and for any positive integers $$n_{1}, \ldots , n_{k}$$ with $$\sum n_{i} = |G|$$ , there exists a partition of V(G) into k paths $$P_{1}, \ldots , P_{k}$$ such that $$v_{i}$$ is an end of $$P_{i}$$ and $$|P_{i}| = n_{i}$$ for all i. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices.
Moment Bounds for Large Autocovariance Matrices Under Dependence

The goal of this paper is to obtain expectation bounds for the deviation of large sample autocovariance matrices from their means under weak data dependence. While the accuracy of covariance matrix estimation corresponding to independent data has been well understood, much less is known in the case of dependent data. We make a step toward filling this gap and establish deviation bounds that depend only on the parameters controlling the “intrinsic dimension” of the data up to some logarithmic terms. Our results have immediate impacts on high-dimensional time-series analysis, and we apply them to high-dimensional linear VAR(d) model, vector-valued ARCH model, and a model used in Banna et al. (Random Matrices Theory Appl 5(2):1650006, 2016).
Distinct orders dividing each other on both sides

We construct non-isomorphic linear orders X and Y that are both left-hand and right-hand divisors of one another, answering positively a question of Sierpinski.
Normal crossings singularities for symplectic topology

Abstract We introduce topological notions of normal crossings symplectic divisor and variety and establish that they are equivalent, in a suitable sense, to the desired geometric notions. Our proposed concept of equivalence of associated topological and geometric notions fits ideally with important constructions in symplectic topology. This partially answers Gromov's question on the feasibility of defining singular symplectic (sub)varieties and lays foundation for rich developments in the future. In subsequent papers, we establish a smoothability criterion for symplectic normal crossings varieties, in the process providing the multifold symplectic sum envisioned by Gromov, and introduce symplectic analogues of logarithmic structures in the context of normal crossings symplectic divisors.
Asymptotic behaviors in the homology of symmetric group and finite general linear group quandles

Abstract A quandle is an algebraic structure which attempts to generalize group conjugation. These structures have been studied extensively due to their connections with knot theory, algebraic combinatorics, and other fields. In this work, we approach the study of quandles from the perspective of the representation theory of categories. Namely, we look at collections of conjugacy classes of the symmetric groups and the finite general linear groups, and prove that they carry the structure of FI-quandles (resp. VIC ( q ) -quandles). As applications, we prove statements about the homology of these quandles, and construct FI-module and VIC ( q ) -module invariants of links.
How to End Password Reuse on the Web.

We present a framework by which websites can coordinate to make it difficult for users to set similar passwords at these websites, in an effort to break the culture of password reuse on the web today. Though the design of such a framework is fraught with risks to users' security and privacy, we show that these risks can be effectively mitigated through careful scoping of the goals for such a framework and through principled design. At the core of our framework is a private set-membership-test protocol that enables one website to determine, upon a user setting a password for use at it, whether that user has already set a similar password at another participating website, but with neither side disclosing to the other the password(s) it employs in the protocol. Our framework then layers over this protocol a collection of techniques to mitigate the leakage necessitated by such a test. We verify via probabilistic model checking that these techniques are effective in maintaining account security, and since these mechanisms are consistent with common user experience today, our framework should be unobtrusive to users who do not reuse similar passwords across websites (e.g., due to having adopted a password manager). Through a working implementation of our framework and optimization of its parameters based on insights of how passwords tend to be reused, we show that our design can meet the scalability challenges facing such a service.
Volatile transport on inhomogeneous surfaces: II. Numerical calculations (VT3D)

Abstract Several distant icy worlds have atmospheres that are in vapor-pressure equilibrium with their surface volatiles, including Pluto, Triton, and, probably, several large KBOs near perihelion. Studies of the volatile and thermal evolution of these have been limited by computational speed, especially for models that treat surfaces that vary with both latitude and longitude. In order to expedite such work, I present a new numerical model for the seasonal behavior of Pluto and Triton which (i) uses initial conditions that improve convergence, (ii) uses an expedient method for handling the transition between global and non-global atmospheres, (iii) includes local conservation of energy and global conservation of mass to partition energy between heating, conduction, and sublimation or condensation, (iv) uses time-stepping algorithms that ensure stability while allowing larger timesteps, and (v) can include longitudinal variability. This model, called VT3D, has been used in Young (2012a, 2012b ), Young (2013), Olkin et al. (2015), Young and McKinnon (2013), and French et al. (2015). Many elements of VT3D can be used independently. For example, VT3D can also be used to speed up thermophysical models (Spencer et al., 1989) for bodies without volatiles. Code implementation is included in the supplemental materials and is available from the author.
Signed enumeration of upper-right corners in path shuffles

Abstract We resolve a conjecture of Albert and Bousquet-Melou enumerating quarter-planar walks with fixed horizontal and vertical projections according to their upper-right-corner count modulo 2. In doing this, we introduce a signed upper-right-corner count statistic. We find its distribution over planar walks with any choice of fixed horizontal and vertical projections. Additionally, we prove that the polynomial counting loops with a fixed horizontal and vertical projection according to the absolute value of their signed upper-right-corner count is ( x + 1 ) -positive. Finally, we conjecture an equivalence between ( x + 1 ) -positivity of the generating function for upper-right-corner count and signed upper-right-corner count, leading to a reformulation of a conjecture of Albert and Bousquet-Melou on which their asymptotic analysis of permutations is sortable by two stacks in parallel relies.
Evidence for parking conjectures

Abstract Let W be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W [3] and made three increasingly strong conjectures about these objects. The author generalized these parking objects and conjectures to the Fuss–Catalan level of generality [26] . Even the weakest of these conjectures would uniformly imply a collection of facts in Coxeter–Catalan theory which are at present understood only in a case-by-case fashion. We prove that when W belongs to any of the infinite families ABCDI, the strongest of these conjectures is generically true.
Noisy dynamic simulations in the presence of symmetry: Data alignment and model reduction

Abstract We process snapshots of trajectories of evolution equations with intrinsic symmetries, and demonstrate the use of recently developed eigenvector-based techniques to successfully quotient out the degrees of freedom associated with the symmetries in the presence of noise. Our illustrative examples include a one-dimensional evolutionary partial differential (the Kuramoto–Sivashinsky) equation with periodic boundary conditions, as well as a stochastic simulation of nematic liquid crystals which can be effectively modeled through a nonlinear Smoluchowski equation on the surface of a sphere. This is a useful first step towards data mining the symmetry-adjusted ensemble of snapshots in search of an accurate low-dimensional parametrization and the associated reduction of the original dynamical system. We also demonstrate a technique (Vector Diffusion Maps) that combines, in a single formulation, the symmetry removal step and the dimensionality reduction step.
The run transform

Abstract We consider the transform from sequences to triangular arrays defined in terms of generating functions by f ( x ) → 1 − x 1 − x y f ( x ( 1 − x ) 1 − x y ) . We establish a criterion for the transform of a nonnegative sequence to be nonnegative, and we show the transform counts certain classes of lattice paths by number of the so-called pyramid ascents and certain classes of partitions into sets of lists (blocks) by number of blocks that consist of increasing consecutive integers.
Open Gromov-Witten disk invariants in the presence of an anti-symplectic involution

Abstract For a symplectic manifold with an anti-symplectic involution having non-empty fixed locus, we construct a model of the moduli space of real sphere maps out of moduli spaces of decorated disk maps and give an explicit expression for its first Stiefel–Whitney class. As a corollary, we obtain a large number of examples, which include all odd-dimensional projective spaces and many complete intersections, for which many types of real moduli spaces are orientable. For these manifolds, we define open Gromov–Witten invariants with no restriction on the dimension of the manifolds or the type of the constraints if there are no boundary marked points; a WDVV-type recursion obtained in a sequel computes these invariants for many real symplectic manifolds. If there are boundary marked points, we define the invariants under some restrictions on the allowed boundary constraints, even though the moduli spaces are not orientable in these cases.
Trajectory fitting estimators for SPDEs driven by additive noise

In this paper we study the problem of estimating the drift/viscosity coefficient for a large class of linear, parabolic stochastic partial differential equations (SPDEs) driven by an additive space-time noise. We propose a new class of estimators, called trajectory fitting estimators (TFEs). The estimators are constructed by fitting the observed trajectory with an artificial one, and can be viewed as an analog to the classical least squares estimators from the time-series analysis. As in the existing literature on statistical inference for SPDEs, we take a spectral approach, and assume that we observe the first N Fourier modes of the solution, and we study the consistency and the asymptotic normality of the TFE, as \(N\rightarrow \infty \).
Smith theory and geometric Hecke algebras

In 1960 Borel proved a “localization” result relating the rational cohomology of a topological space X to the rational cohomology of the fixed points for a torus action on X. This result and its generalizations have many applications in Lie theory. In 1934, Smith proved a similar localization result relating the mod p cohomology of X to the mod p cohomology of the fixed points for a $${\mathbb {Z}}/p$$ -action on X. In this paper we study $${\mathbb {Z}}/p$$ -localization for constructible sheaves and functions. We show that $${\mathbb {Z}}/p$$ -localization on loop groups is related via the geometric Satake correspondence to some special homomorphisms that exist between algebraic groups defined over a field of small characteristic.