cssi/SciSciGPT-SciSciNet huggingface dataset:
Application of pulse radiolysis to mechanistic investigations of water oxidation catalysis

Radiolysis is a powerful technique capable of generating both inorganic and organic strong one-electron oxidants over a wide range of aqueous medium conditions. Accordingly, current pulse radiolysis methods are quite advanced and have been productively used to study dynamics of many types of redox reactions for several decades. Nonetheless, despite its apparent usefulness for gaining mechanistic insights into water oxidation catalysis through probing normally inaccessible oxidation states of the catalysts, pulse radiolysis has only infrequently been applied to this purpose. In this paper, we identify those oxidizing radicals deemed most suited to these types of studies and describe methods for their radiolytic generation, review the scant literature on pulse radiolysis studies of both heterogeneous and homogeneous water oxidation catalysts, and discuss results of our own investigations of two dimeric and one monomeric ruthenium-based catalysts, each of which appears to oxidize water by a distinct pathway. The optical spectra and redox dynamics of transient species determined have in each case provided information central to evaluating proposed catalytic mechanisms. Moreover, quantitative “over-oxidation” by generating a stoichiometric excess amount of radicals has permitted investigation of an intermediate formed from a highly reactive precursor, demonstrating the unique capability of the pulse radiolysis method. As illustrated by these examples, this technique is broadly applicable to investigations of catalyzed water oxidation, which has the potential to become a method of choice for detecting and characterizing reaction transients.
Diastereoselective sulfur ylide promoted aldol/epoxidation

A mixture of cyclohexanone or 4-methylcyclohexanone and an aromatic aldehyde is treated with dimethylsulfoxonium methylide to effect a tandem aldol/epoxidation reaction. The resulting product contains three or four new stereocenters but only one of the possible four or eight diastereomers is formed.
Synthesis and reaction of phthaloyl peroxide derivatives, potential organocatalysts for the stereospecific dihydroxylation of alkenes

To improve the synthesis and reactivity of phthaloyl peroxide derivatives a method has been developed using sodium percarbonate and phthaloyl chlorides. The reactions of the new phthaloyl peroxide derivatives with trans-stillbene as well as the improved reactivity of 3,4-dichlorophthaloyl peroxide with a variety of alkenes are reported.
Synthesis of the C21-C28 segment of pectenotoxin-4

Abstract The synthesis of the C21–C28 segment of pectenotoxin-4 as the C21 Weinreb amide is described. Feasibility studies for the union of a related Weinreb amide and a functionalized alkyne are also reported.
variancePartition: interpreting drivers of variation in complex gene expression studies

As large-scale studies of gene expression with multiple sources of biological and technical variation become widely adopted, characterizing these drivers of variation becomes essential to understanding disease biology and regulatory genetics. We describe a statistical and visualization framework, variancePartition, to prioritize drivers of variation based on a genome-wide summary, and identify genes that deviate from the genome-wide trend. Using a linear mixed model, variancePartition quantifies variation in each expression trait attributable to differences in disease status, sex, cell or tissue type, ancestry, genetic background, experimental stimulus, or technical variables. Analysis of four large-scale transcriptome profiling datasets illustrates that variancePartition recovers striking patterns of biological and technical variation that are reproducible across multiple datasets. Our open source software, variancePartition, enables rapid interpretation of complex gene expression studies as well as other high-throughput genomics assays. variancePartition is available from Bioconductor: http://bioconductor.org/packages/variancePartition .
Substituent effects on the amination of racemic allyl carbonates using commercially available chiral rhodium catalysts

In the presence of commercially available chiral rhodium catalysts, a competitive benzylamination of racemic allyl carbonates, substituted with p-X-Ph groups, shows that the reaction proceeds faster with substituents (X) that are more electron-withdrawing. Mechanistic implications of these results are discussed.
Synthesis of 2-amino-1,3-dienes by chromium-catalyzed addition of silylated propargyl bromides to imines

(Silyl)methylallenic amines were synthesized by the chromium-catalyzed addition of (4-bromobutynyl)trimethylsilane to tosyl imines. Regioisomeric mixtures of the desired allene and the corresponding alkyne were obtained. Allenic imines were then treated with TBAF to afford 2-aminomethyl-1,3-dienes in good yields (62–92%). In the presence of a Lewis acid, silylallenic imines were added to benzaldehyde dimethylacetal to give highly functionalized dienes with excellent yields and good to excellent diastereomeric ratios.
Concise Syntheses of (−)- and (+)-Syringolide 1 and (−)-Δ7-Syringolide 1

(−)- and (+)-Syringolide 1 have been synthesized from 2,3-O-isopropylidene-β-threo-pentulofuranose (1), which was readily prepared from d- or l-xylose, respectively. Condensation of 1 with 3-oxooctanoic acid and treatment of the ester with TFA:H2O (9:1) produced syringolide 1 in 6.3% yield for the two steps. According to the same synthetic route by replacing 3-oxooctanoic acid with 3-oxo-7-octenoic acid, (−)-Δ7-syringolide 1 was prepared in 5.8% yield. Primary β-keto esters of arabinulose and fructose were also prepared to test the selectivity of the biomimetic cyclization to form syringolide analogs.
Tandem anionic 5-Exo dig cyclization/Claisen rearrangement as an efficient route to fused polycyclic ring systems.

The scope and limitations of a tandem 5-exo dig cyclization/Claisen rearrangement sequence involving appropriately substituted 4-alkyn-1-ols as an efficient “one-pot” route to fused tricyclic ring systems is described. The reaction rates were found to be strongly dependent on the nature of the terminal substitutent of the triple bond. In some cases the entire sequence was found to proceed in good yield at temperatures as low as 115 °C.
Synthesis of (2R,3S) 3-amino-4-mercapto-2-butanol, a threonine analogue for covalent inhibition of sortases.

Abstract l -Threonine 2 was converted in seven steps into the protected aminomercaptoalcohol 8, a threonine mimic. This compound 8 was coupled to various oligopeptides to produce two different tetrapeptide analogues, for example, 11 and 17, which were shown to inhibit the Sortase enzymes (SrtA and SrtB) via covalent attachment of the thiol groups of 11 and 17 to the catalytically active cysteine residue of the Sortase enzymes.
Use of the vicinal element effect for regiochemical control of quinone substitutions and its implication for convergent mitomycin construction.

Nucleophilic substitution reactions of 2-methoxy-3-alkyl-p-benzoquinones are described as they relate to the construction of the mitomycin backbone. Normally controlled by activating groups attache...
Direct nucleophilic fluorination of carbonyl groups of benzophenones and benzils with Deoxofluor

The carbonyl groups of diaryl ketones and diaryl diketones were directly fluorinated with bis(2-methoxyethyl)aminosulfur trifluoride (Deoxofluor) under neat conditions to give the corresponding gem-difluorides and tetrafluorinated derivatives in moderate to high yields.
Modeling mechanical interactions in growing populations of rod-shaped bacteria

Advances in synthetic biology allow us to engineer bacterial collectives with pre-specified characteristics. However, the behavior of these collectives is difficult to understand, as cellular growth and division as well as extra-cellular fluid flow lead to complex, changing arrangements of cells within the population. To rationally engineer and control the behavior of cell collectives we need theoretical and computational tools to understand their emergent spatiotemporal dynamics. Here, we present an agent-based model that allows growing cells to detect and respond to mechanical interactions. Crucially, our model couples the dynamics of cell growth to the cell's environment: Mechanical constraints can affect cellular growth rate and a cell may alter its behavior in response to these constraints. This coupling links the mechanical forces that influence cell growth and emergent behaviors in cell assemblies. We illustrate our approach by showing how mechanical interactions can impact the dynamics of bacterial collectives growing in microfluidic traps.
Synthesis of Substituted 2,3,5,6-tetraarylbenzo(1,2-b:5,4-b')difurans

A series of substituted 2,3,5,6-tetraarylbenzo(l,2-b:5,4-b')difurans 1 was synthesized. This synthesis is based upon the photocyclization of 2,5-dibenzoylresorcinol dibenzyl ethers to the corresponding tetrahydrobenzo(1,2-b:5,4-b')difurans. Treatment of the photoproducts with methanesulfonyl chloride in pyridine afforded 1 in overall yields ranging from 30-72%. A number of these compounds have high fluorescence quantum yields (of phi(sub f) = 0.76-0.90), and their fluorescence spectra exhibit large solvatochromic shifts. These compounds may be suitable for use as fluorescent probes.
Reactions of 2-amino-4h-1-benzopyran-4-one with 4-oxo-4h-1-benzopyran-3-carbaldehydes

The title aldehyde 1 reacts smoothly with the enamine moiety of 2-aminochromone 2 to produce hitherto unreported 3-(2-hydroxybenzoyl)-5H-1-benzopyrano[2,3-b]pyridin-5-one (azaxanthone) 5. This reaction has been extended for the synthesis of bisazaxanthone 9.
Efficient Total Syntheses of Pumiliotoxins A and B. Applications of Iodide-Promoted Iminium Ion−Alkyne Cyclizations in Alkaloid Construction

A practical route for the total synthesis of pumiliotoxin A alkaloids is described. The central step is formation of the piperidine ring and establishment of the (Z)-alkylidene side chain by an iodide-promoted iminium ion−alkyne cyclization. The total synthesis of (+)-15(S)-pumiliotoxin A (2) was realized in 5 steps and 32% overall yield from alkyne 36 and epoxide 7. This synthesis of 2 proceeded in 13 steps and 12% overall yield from (S)-2-methyl-1-penten-3-ol (25) and 8 steps and 9% overall yield from N-[(benzyloxy)carbonyl]-l-proline. The synthesis of (+)-pumiliotoxin B (3) was similarly achieved in four steps and 44% overall yield from alkyne 54 and epoxide 7. The overall yield of enantiopure 3 was 8% from N-[(benzyloxy)carbonyl]-l-proline and 10% from (4S,5R)-4-methyl-5-phenyl-2-oxazolidinone. These syntheses represent substantial improvement over previous routes to these important alkaloids.
The OsO4-mediated oxidative cleavage of olefins catalyzed by alternative osmium sources

Abstract The OsO4-mediated oxidative cleavage of olefins is compatible with alternative, easier-to-handle osmium sources. Four different osmium sources were employed with favorable results.
Synthesis of tri-substituted vinyl boronates via ruthenium-catalyzed olefin cross-metathesis

Abstract Tri-substituted vinyl pinacol boronates, which are key reactive intermediates in a variety of transformations, are synthesized using ruthenium-catalyzed olefin cross-metathesis of α-substituted vinyl boronates and various alkenes. Cross-metathesis of 2-isopropenyl pinacol boronate proceeds with moderate yield and high Z -selectivity when sterically unhindered cross partners are used. Cross-metathesis of vinyl boronates that possess α-substitution larger than a methyl group is also achieved. Yield and Z -selectivity are lower in these cases, and the success of a cross-metathesis reaction is highly dependent on the steric bulk surrounding the double bond of the α-substituted vinyl boronate.
Simplified Kinematics of Continuum Robot Equilibrium Modulation via Moment Coupling Effects and Model Calibration

Recently, a new concept for continuum robots capable of producing macro-scale and micro-scale motion has been presented. These robots achieve their multi-scale motion capabilities by coupling direct-actuation of push-pull back-bones for macro motion with indirect actuation whereby the equilibrium pose is altered to achieve micro-scale motion. This paper presents a first attempt at explaining the micro-motion capabilities of these robots from a modeling perspective. This paper presents the macro and micro motion kinematics of a single segment continuum robot by using statics coupling effects among its sub-segments. Experimental observations of the micro-scale motion demonstrate a turning point behavior which could not be explained well using the current modeling methods. We present a simplistic modeling approach that introduces two calibration parameters to calibrate the moment coupling effects among the sub segments of the robot. It is shown that these two parameters can reproduce the turning point behavior at the micro-scale. The instantaneous macro and micro scale kinematics Jacobians and the calibration parameters identification Jacobian are derived. The modeling approach is verified against experimental data showing that our simplistic modeling approach can capture the experimental motion data with RMS position error of 5.82 micrometers if one wishes to fit the entire motion profile with the turning point. If one chooses to exclude motions past the turning point, our model can fit the experimental data with an accuracy of 4.76 micrometers.
Fast SGL Fourier transforms for scattered data

Abstract Spherical Gauss-Laguerre (SGL) basis functions, i.e., normalized functions of the type L n − l − 1 ( l + 1 / 2 ) ( r 2 ) r l Y l m ( ϑ , φ ) , | m | ≤ l n ∈ N , L n − l − 1 ( l + 1 / 2 ) being a generalized Laguerre polynomial, Y l m a spherical harmonic, constitute an orthonormal polynomial basis of the space L 2 on R 3 with radial Gaussian (multivariate Hermite) weight exp ⁡ ( − r 2 ) . We have recently described fast Fourier transforms for the SGL basis functions based on an exact quadrature formula with certain grid points in R 3 . In this paper, we present fast SGL Fourier transforms for scattered data. The idea is to employ well-known basal fast algorithms to determine a three-dimensional trigonometric polynomial that coincides with the bandlimited function of interest where the latter is to be evaluated. This trigonometric polynomial can then be evaluated efficiently using the well-known non-equispaced FFT (NFFT). We prove an error estimate for our algorithms and validate their practical suitability in extensive numerical experiments.
Packing perfect matchings in random hypergraphs

We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as \emph{online sprinkling}. As an illustrative application of this method, we show that for any fixed integer $k\geq 3$, the binomial $k$-uniform random hypergraph $H^{k}_{n,p}$ contains $N:=(1-o(1))\binom{n-1}{k-1}p$ edge-disjoint perfect matchings, provided $p\geq \frac{\log^{C}n}{n^{k-1}}$, where $C:=C(k)$ is an integer depending only on $k$. Our result for $N$ is asymptotically best optimal and for $p$ is optimal up to the $polylog(n)$ factor.
Deformations of Galois representations and exceptional monodromy, II: raising the level

Building on lifting results of Ramakrishna, Khare and Ramakrishna proved a purely Galois-theoretic level-raising theorem for odd representations \(\bar{\rho } :\mathrm {Gal}(\overline{\mathbb {Q}}/\mathbb {Q}) \rightarrow \mathrm {GL}_2(\overline{\mathbb {F}}_{\ell })\). In this paper, we generalize these techniques from type A1 to general (semi-)simple groups. We then strengthen our previous results on constructing geometric Galois representations with exceptional monodromy groups, achieving such constructions for almost all \(\ell \), rather than a density-one set, and achieving greater flexibility in the Hodge numbers of the lifts; the latter improvement requires the new level-raising result.
The mathematics of lecture hall partitions

Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to lecture hall partitions have used polyhedral geometry to discover further properties of these rich combinatorial objects.In this paper we give an overview of some of the surprising connections that have surfaced in the process of trying to understand the lecture hall partitions.
Matrices with prescribed row and column sums

Abstract This is a survey of the recent progress and open questions on the structure of the sets of 0–1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from the set, discrete versions of the Brunn–Minkowski inequality and the statistical dependence between row and column sums.
Upper bounds on the number of conjugacy classes in unitriangular groups

We provide a new upper bound on the number of conjugacy classes in the group Un(q) of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of Un(q).
String Field Theory

This article is a concise review of covariant string field theory prepared for the Encyclopedia of Mathematical Physics, Elsevier (2006). Referencing follows the publisher's guidelines.
Generalized Forchheimer Flows of Isentropic Gases

We consider generalized Forchheimer flows of either isentropic gases or slightly compressible fluids in porous media. By using Muskat’s and Ward’s general form of the Forchheimer equations, we describe the fluid dynamics by a doubly nonlinear parabolic equation for the appropriately defined pseudo-pressure. The volumetric flux boundary condition is converted to a time-dependent Robin-type boundary condition for this pseudo-pressure. We study the corresponding initial boundary value problem, and estimate the $$L^\infty $$ and $$W^{1,2-a}$$ (with $$0<a<1$$ ) norms for the solution on the entire domain in terms of the initial and boundary data. It is carried out by using a suitable trace theorem and an appropriate modification of Moser’s iteration.
Straggler Mitigation in Distributed Optimization Through Data Encoding

Slow running or straggler tasks can significantly reduce computation speed in distributed computation. Recently, coding-theory-inspired approaches have been applied to mitigate the effect of straggling, through embedding redundancy in certain linear computational steps of the optimization algorithm, thus completing the computation without waiting for the stragglers. In this paper, we propose an alternate approach where we embed the redundancy directly in the data itself, and allow the computation to proceed completely oblivious to encoding. We propose several encoding schemes, and demonstrate that popular batch algorithms, such as gradient descent and L-BFGS, applied in a coding-oblivious manner, deterministically achieve sample path linear convergence to an approximate solution of the original problem, using an arbitrarily varying subset of the nodes at each iteration. Moreover, this approximation can be controlled by the amount of redundancy and the number of nodes used in each iteration. We provide experimental results demonstrating the advantage of the approach over uncoded and data replication strategies.
Modular Categories of Dimension $p^3m$ with $m$ Square-Free

We give a complete classification of modular categories of dimension $p^3m$ where $p$ is prime and $m$ is a square-free integer. When $p$ is odd, all such categories are pointed. For $p=2$ one encounters modular categories with the same fusion ring as orthogonal quantum groups at certain roots of unity, namely $SO(2m)_2$. As an immediate step we classify a more general class of so-called even metaplectic modular categories with the same fusion rules as $SO(2N)_2$ with $N$ odd.
Distributed Event Localization via Alternating Direction Method of Multipliers

This paper addresses the problem of distributed event localization using noisy range measurements with respect to sensors with known positions. Event localization is fundamental in many wireless sensor network applications such as homeland security, law enforcement, and environmental studies. However, most existing distributed algorithms require the target event to be within the convex hull of the deployed sensors. Based on the alternating direction method of multipliers (ADMM), we propose two scalable distributed algorithms named GS-ADMM and J-ADMM which do not require the target event to be within the convex hull of the deployed sensors. More specifically, the two algorithms can be implemented in a scenario in which the entire sensor network is divided into several clusters with cluster heads collecting measurements within each cluster and exchanging intermediate computation information to achieve localization consistency (consensus) across all clusters. This scenario is important in many applications such as homeland security and law enforcement. Simulation results confirm effectiveness of the proposed algorithms.
Quantum perceptron models

We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points N, namely O(√N). The second algorithm illustrates how the classical mistake bound of O(1/γ2) can be further improved to O(1/√γ) through quantum means, where γ denotes the margin. Such improvements are achieved through the application of quantum amplitude amplification to the version space interpretation of the perceptron model.
Simultaneously Self-Attending to All Mentions for Full-Abstract Biological Relation Extraction

Most work in relation extraction forms a prediction by looking at a short span of text within a single sentence containing a single entity pair mention. This approach often does not consider interactions across mentions, requires redundant computation for each mention pair, and ignores relationships expressed across sentence boundaries. These problems are exacerbated by the document- (rather than sentence-) level annotation common in biological text. In response, we propose a model which simultaneously predicts relationships between all mention pairs in a document. We form pairwise predictions over entire paper abstracts using an efficient self-attention encoder. All-pairs mention scores allow us to perform multi-instance learning by aggregating over mentions to form entity pair representations. We further adapt to settings without mention-level annotation by jointly training to predict named entities and adding a corpus of weakly labeled data. In experiments on two Biocreative benchmark datasets, we achieve state of the art performance on the Biocreative V Chemical Disease Relation dataset for models without external KB resources. We also introduce a new dataset an order of magnitude larger than existing human-annotated biological information extraction datasets and more accurate than distantly supervised alternatives.
Unsteady propulsion by an intermittent swimming gait

Inviscid computational results are presented on a self-propelled swimmer modelled as a virtual body combined with a two-dimensional hydrofoil pitching intermittently about its leading edge. Lighthill (Proc. R. Soc. Lond. B, vol. 179, 1971, pp. 125–138) originally proposed that this burst-and-coast behaviour can save fish energy during swimming by taking advantage of the viscous Bone–Lighthill boundary layer thinning mechanism. Here, an additional inviscid Garrick mechanism is discovered that allows swimmers to control the ratio of their added-mass thrust-producing forces to their circulatory drag-inducing forces by decreasing their duty cycle, , of locomotion. This mechanism can save intermittent swimmers as much as 60 % of the energy it takes to swim continuously at the same speed. The inviscid energy savings are shown to increase with increasing amplitude of motion, increase with decreasing Lighthill number, , and switch to an energetic cost above continuous swimming for sufficiently low . Intermittent swimmers are observed to shed four vortices per cycle that give rise to an asymmetric time-averaged jet structure with both momentum surplus and deficit branches. In addition, previous thrust and power scaling laws of continuous self-propelled swimming are further generalized to include intermittent swimming. The key is that by averaging the thrust and power coefficients over only the bursting period then the intermittent problem can be transformed into a continuous one. Furthermore, the intermittent thrust and power scaling relations are extended to predict the mean speed and cost of transport of swimmers. By tuning a few coefficients with a handful of simulations these self-propelled relations can become predictive. In the current study, the mean speed and cost of transport are predicted to within 3 % and 18 % of their full-scale values by using these relations.
Device-centric cooperation in mobile networks

The increasing popularity of applications such as video streaming in today's mobile devices introduces higher demand for throughput, and puts a strain especially on cellular links. Cooperation among mobile devices by exploiting both cellular and local area connections is a promising approach to meet the increasing demand. In this paper, we consider that a group of cooperative mobile devices, exploiting both cellular and local area links and within proximity of each other, are interested in the same video content. Traditional network control algorithms introduce high overhead and delay in this setup as the control and cooperation decisions are made in a source- centric manner. Instead, we develop a device-centric stochastic cooperation scheme. Our device-centric scheme; DcC allows mobile devices to make control decisions such as flow control, scheduling, and cooperation without loss of optimality. Thanks to being device-centric, DcC reduces; (i) overhead; i.e., the number of control packets that should be transmitted over cellular links, so cellular links are used more efficiently, and (ii) the amount of delay that each packet experiences, which improves quality of service. The simulation results demonstrate the benefits of DcC. Index Terms—Cooperative mobile devices, network utility maximization, stochastic network control. I. INTRODUCTION The increasing popularity of applications such as video streaming in today's mobile devices introduces higher demand for throughput, and puts a strain especially on cellular links. In fact, cellular traffic is growing exponentially and it is expected to remain so for the foreseeable future (1), (2).
Minimax adaptive wavelet estimator for the anisotropic functional deconvolution model with unknown kernel

In the present paper, we consider the estimation of a periodic two-dimensional function f(·,·) based on observations from its noisy convolution, and convolution kernel g(·,·) unknown. We derive the...
Orientations, Semiorders, Arrangements, and Parking Functions

It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph $G$, we define the $G$-semiorder arrangement and show that the Pak-Stanley labeling of its regions produces all $G$-parking functions.
Learning the exact topology of undirected consensus networks

In this article, we present a method to learn the interaction topology of a network of agents undergoing linear consensus updates in a non invasive manner. Our approach is based on multivariate Wiener filtering, which is known to recover spurious edges apart from the true edges in the topology. The main contribution of this work is to show that in the case of undirected consensus networks, all spurious links obtained using Wiener filtering can be identified using frequency response of the Wiener filters. Thus, the exact interaction topology of the agents is unveiled. The method presented requires time series measurements of the state of the agents and does not require any knowledge of link weights. To the best of our knowledge this is the first approach that provably reconstructs the structure of undirected consensus networks with correlated noise. We illustrate the effectiveness of the method developed through numerical simulations as well as experiments on a five node network of Raspberry Pis.
Coexistence of RF-powered IoT and a Primary Wireless Network With Secrecy Guard Zones

This paper studies the secrecy performance of a wireless network (primary network) overlaid with an ambient RF energy harvesting Internet of Things (IoT) network (secondary network). The nodes in the secondary network are assumed to be solely powered by ambient RF energy harvested from the transmissions of the primary network. We assume that the secondary nodes can eavesdrop on the primary transmissions due to which the primary network uses secrecy guard zones . The primary transmitter goes silent if any secondary receiver is detected within its guard zone. Using tools from stochastic geometry, we derive the probability of successful connection of the primary network as well as the probability of secure communication. Two conditions must be jointly satisfied in order to ensure successful connection: 1) the signal-to-interference-plus-noise ratio (SINR) at the primary receiver is above a predefined threshold, and 2) the primary transmitter is not silent. In order to ensure secure communication, the SINR value at each of the secondary nodes should be less than a predefined threshold. Clearly, when more secondary nodes are deployed, more primary transmitters will remain silent for a given guard zone radius, which will in turn impact the amount of energy harvested by the secondary network. Our results concretely show the existence of an optimal deployment density for the secondary network that maximizes the density of nodes that are able to harvest sufficient amount of energy. Furthermore, we show the dependence of this optimal deployment density on the guard zone radius of the primary network. In addition, we show that the optimal guard zone radius selected by the primary network is a function of the deployment density of the secondary network. This interesting coupling between the performance of the two networks is studied using tools from game theory. We propose an algorithm that can assist the two networks to converge to Nash equilibrium. The convergence of this algorithm is verified using simulations. Overall, this paper is one of the few concrete works that symbiotically merge tools from stochastic geometry and game theory.
Uniqueness of the multiplicative cyclotomic trace

Abstract Making use of the theory of noncommutative motives, we characterize the topological Dennis trace map as the unique multiplicative natural transformation from algebraic K-theory to topological Hochschild homology (THH) and the cyclotomic trace map as the unique multiplicative lift through topological cyclic homology (TC). Moreover, we prove that the space of all multiplicative structures on algebraic K-theory is contractible. We also show that the algebraic K-theory functor from small stable ∞-categories to spectra is lax symmetric monoidal, which in particular implies that E n ring spectra give rise to E n − 1 ring algebraic K-theory spectra. Along the way, we develop a “multiplicative Morita theory”, establishing a symmetric monoidal equivalence between the ∞-category of small idempotent-complete stable ∞-categories and the Morita localization of the ∞-category of spectral categories.
Finding Dominant User Utterances And System Responses in Conversations

There are several dialog frameworks which allow manual specification of intents and rule based dialog flow. The rule based framework provides good control to dialog designers at the expense of being more time consuming and laborious. The job of a dialog designer can be reduced if we could identify pairs of user intents and corresponding responses automatically from prior conversations between users and agents. In this paper we propose an approach to find these frequent user utterances (which serve as examples for intents) and corresponding agent responses. We propose a novel SimCluster algorithm that extends standard K-means algorithm to simultaneously cluster user utterances and agent utterances by taking their adjacency information into account. The method also aligns these clusters to provide pairs of intents and response groups. We compare our results with those produced by using simple Kmeans clustering on a real dataset and observe upto 10% absolute improvement in F1-scores. Through our experiments on synthetic dataset, we show that our algorithm gains more advantage over K-means algorithm when the data has large variance.
Inverse boundary problems for polyharmonic operators with unbounded potentials

INVERSE BOUNDARY PROBLEMS FOR POLYHARMONIC OPERATORS WITH UNBOUNDED POTENTIALS arXiv:1308.3782v2 [math.AP] 1 Aug 2015 KATSIARYNA KRUPCHYK AND GUNTHER UHLMANN Abstract. We show that the knowledge of the Dirichlet–to–Neumann map on the boundary of a bounded open set in R n for the perturbed polyharmonic n operator (−∆) m + q with q ∈ L 2m , n > 2m, determines the potential q in the set uniquely. In the course of the proof, we construct a special Green function for the polyharmonic operator and establish its mapping properties in suitable weighted L 2 and L p spaces. The L p estimates for the special Green function are derived from L p Carleman estimates with linear weights for the polyharmonic operator. 1. Introduction Let Ω ⊂ R n be a bounded open set with C ∞ boundary, and let (−∆) m , m = n 1, 2, . . . , be a polyharmonic operator. Let q ∈ L 2m (Ω) be a complex valued potential. We shall assume throughout the paper that n > 2m. Let γ be the Dirichlet trace operator, given by m γ : H (Ω) → m−1 Y H m−j−1/2 (∂Ω), γu = (u| ∂Ω , ∂ ν u| ∂Ω , . . . , ∂ ν m−1 u| ∂Ω ), j=0 which is bounded and surjective, see [8, Theorem 9.5, p. 226]. Here and in what follows H s (Ω) and H s (∂Ω), s ∈ R, are the standard L 2 –based Sobolev spaces in Ω and its boundary ∂Ω, respectively, and ν is the exterior unit normal to the boundary. We shall also set H 0 m (Ω) = {u ∈ H m (Ω) : γu = 0}. An application of the Sobolev embedding theorem shows that the operator of multiplication by q is continuous: H 0 m (Ω) → H −m (Ω), and standard arguments, see Appendix A, imply that the operator (−∆) m + q : H 0 m (Ω) → H −m (Ω) = (H 0 m (Ω)) ′ is Fredholm of index zero. Furthermore, the operator in (1.1) has a discrete spectrum. We shall assume throughout the paper that
Smoothness and Structure Learning by Proxy

As data sets grow in size, the ability of learning methods to find structure in them is increasingly hampered by the time needed to search the large spaces of possibilities and generate a score for each that takes all of the observed data into account. For instance, Bayesian networks, the model chosen in this paper, have a super-exponentially large search space for a fixed number of variables. One possible method to alleviate this problem is to use a proxy, such as a Gaussian Process regressor, in place of the true scoring function, training it on a selection of sampled networks. We prove here that the use of such a proxy is well-founded, as we can bound the smoothness of a commonly-used scoring function for Bayesian network structure learning. We show here that, compared to an identical search strategy using the network's exact scores, our proxy-based search is able to get equivalent or better scores on a number of data sets in a fraction of the time.
Real hyperbolic hyperplane complements in the complex hyperbolic plane

Abstract This paper studies Riemannian manifolds of the form M ∖ S , where M 4 is a complete four dimensional Riemannian manifold with finite volume whose metric is modeled on the complex hyperbolic plane C H 2 , and S is a compact totally geodesic codimension two submanifold whose induced Riemannian metric is modeled on the real hyperbolic plane H 2 . In this paper we write the metric on C H 2 in polar coordinates about S, compute formulas for the components of the curvature tensor in terms of arbitrary warping functions ( Theorem 7.1 ), and prove that there exist warping functions that yield a complete finite volume Riemannian metric on M ∖ S whose sectional curvature is bounded above by a negative constant ( Theorem 1.1 (1)). The cases of M ∖ S modeled on H n ∖ H n − 2 and C H n ∖ C H n − 1 were studied by Belegradek in [4] and [3] , respectively. One may consider this work as “part 3” to this sequence of papers.
The Bergman kernel on forms: General theory

The goal of this note is to explore the Bergman projection on forms. In particular, we show that some of most basic facts used to construct the Bergman kernel on functions, such as pointwise evaluation in $L^2_{0,q}(\Omega)\cap\ker\bar\partial_q$, fail for $(0,q)$-forms, $q \geq 1$. We do, however, provide a careful construction of the Bergman kernel and explicitly compute the Bergman kernel on $(0,n-1)$-forms. For the ball in $\mathbb{C}^2$, we also show that the size of the Bergman kernel on $(0,1)$-forms is not governed by the control metric, in stark contrast to Bergman kernel on functions.
Spectra of Tukey types of ultrafilters on Boolean algebras

Extending recent investigations on the structure of Tukey types of ultrafilters on \({\mathcal{P}(\omega)}\) to Boolean algebras in general, we classify the spectra of Tukey types of ultrafilters for several classes of Boolean algebras, including interval algebras, tree algebras, and pseudo-tree algebras.
Co-evolving Real-Time Strategy Game Micro

We investigate competitive co-evolution of unit micromanagement in real-time strategy games. Although good long-term macro-strategy and good short-term unit micromanagement both impact real-time strategy games performance, this paper focuses on generating quality micro. Better micro, for example, can help players win skirmishes and battles even when outnumbered. Prior work has shown that we can evolve micro to beat a given opponent. We remove the need for a good opponent to evolve against by using competitive co-evolution to evolve high-quality micro for both sides from scratch. We first co-evolve micro to control a group of ranged units versus a group of melee units. We then move to co-evolve micro for a group of ranged and melee units versus a group of ranged and melee units. Results show that competitive co-evolution produces good quality micro and when combined with the well-known techniques of fitness sharing, shared sampling, and a hall of fame takes less time to produce better quality micro than simple co-evolution. We believe these results indicate the viability of co-evolutionary approaches for generating good unit micro-management.
On the role of side information in strategic communication

This paper analyzes the fundamental limits of strategic communication in network settings. Strategic communication differs from the conventional communication paradigms in information theory since it involves different objectives for the encoder and the decoder, which are aware of this mismatch and act accordingly. This leads to a Stackelberg game where both agents commit to their mappings ex-ante. Building on our prior work on the point-to-point setting, this paper studies the compression and communication problems with the receiver and/or the transmitter side information setting. The equilibrium strategies and the associated costs are characterized for the Gaussian variables and quadratic cost functions. Several questions on the benefit of side information in source and joint source-channel coding in such strategic settings are analyzed. Our analysis has uncovered an interesting result on optimality of uncoded communication in strategic source-channel coding in the presence of receiver side information.
Studying soft matter with ``soft'' potentials: fast lattice Monte Carlo simulations and corresponding lattice self-consistent field calculations

We introduce fast lattice Monte Carlo (FLMC) simulations, where multiple occupancy of lattice sites is allowed with a proper Boltzmann weight and thus the evaluation of nearest-neighbor interactions can also be avoided. FLMC simulations (with multiple occupancy of lattice sites and Kronecker δ-function interactions) are much more efficient, in the study of equilibrium properties of soft matter such as polymers, than both conventional lattice MC simulations (with self- and mutual-avoiding walks and nearest-neighbor interactions) and fast off-lattice MC simulations (with pair-potential calculations). When compared with the corresponding lattice field theories based on the same Hamiltonian, FLMC simulations further provide a powerful means for unambiguously and quantitatively revealing the effects of long-wavelength correlations/fluctuations. Using confined homopolymers as an example, we report for the first time FLMC simulation data ranging from the single-chain case all the way to the lattice self-consistent field limit.
A Geometric Construction of the Witten Genus, I

I describe how the Witten genus of a complex manifold X can be seen from a rigorous analysis of a certain two-dimensional quantum field theory of maps from a surface to X.
Multitask Learning with CTC and Segmental CRF for Speech Recognition.

Segmental conditional random fields (SCRFs) and connectionist temporal classification (CTC) are two sequence labeling methods used for end-to-end training of speech recognition models. Both models define a transcription probability by marginalizing decisions about latent segmentation alternatives to derive a sequence probability: the former uses a globally normalized joint model of segment labels and durations, and the latter classifies each frame as either an output symbol or a "continuation" of the previous label. In this paper, we train a recognition model by optimizing an interpolation between the SCRF and CTC losses, where the same recurrent neural network (RNN) encoder is used for feature extraction for both outputs. We find that this multitask objective improves recognition accuracy when decoding with either the SCRF or CTC models. Additionally, we show that CTC can also be used to pretrain the RNN encoder, which improves the convergence rate when learning the joint model.
Partial results on the convexity of the Parisi functional with PDE approach

We investigate the convexity problem for the Parisi functional defined on the space of the so-called functional ordered parameters in the Sherrington-Kirkpatrick model. In the recent work of Panchenko [3], he proved that this functional is convex along one-sided directions with a probabilistic method. In this paper, we will study this problem with a PDE approach that simplifies his original proof and presents more general results.
Inner Product of Eigenfunctions over Curves and Generalized Periods for Compact Riemannian Surfaces

We show that for a smooth closed curve $$\gamma $$ on a compact Riemannian surface without boundary, the inner product of two eigenfunctions $$e_\lambda $$ and $$e_\mu $$ restricted to $$\gamma $$ , $$|\int e_\lambda \overline{e_\mu }\,\text {d}s|$$ , is bounded by $$\min \{\lambda ^\frac{1}{2},\mu ^\frac{1}{2}\}$$ . Furthermore, given $$0<c<1$$ , if $$0<\mu <c\lambda $$ , we prove that $$\int e_\lambda \overline{e_\mu }\,\text {d}s=O(\mu ^\frac{1}{4})$$ , which is sharp on the sphere $$S^2$$ . These bounds unify the period integral estimates and the $$L^2$$ -restriction estimates in an explicit way. Using a similar argument, we also show that the $$\nu $$ th order Fourier coefficient of $$e_\lambda $$ over $$\gamma $$ is uniformly bounded if $$0<\nu <c\lambda $$ , which generalizes a result of Reznikov for compact hyperbolic surfaces, and is sharp on both $$S^2$$ and the flat torus $$\mathbb T^2$$ . Moreover, we show that the analogs of our results also hold in higher dimensions for the inner product of eigenfunctions over hypersurfaces.
Attribute-Centered Loss for Soft-Biometrics Guided Face Sketch-Photo Recognition

Face sketches are able to capture the spatial topology of a face while lacking some facial attributes such as race, skin, or hair color. Existing sketch-photo recognition approaches have mostly ignored the importance of facial attributes. In this paper, we propose a new loss function, called attribute-centered loss, to train a Deep Coupled Convolutional Neural Network (DCCNN) for facial attribute guided sketch to photo matching. Specifically, an attribute-centered loss is proposed which learns several distinct centers, in a shared embedding space, for photos and sketches with different combinations of attributes. The DCCNN simultaneously is trained to map photos and pairs of testified attributes and corresponding forensic sketches around their associated centers, while preserving the spatial topology information. Importantly, the centers learn to keep a relative distance from each other, related to their number of contradictory attributes. Extensive experiments are performed on composite (E-PRIP) and semi-forensic (IIIT-D Semi-forensic) databases. The proposed method significantly outperforms the state-of-the-art.
Joint Caching and Pricing Strategies for Popular Content in Information Centric Networks

We develop an analytical framework for distribution of popular content in an information centric network (ICN) that is comprised of access ICNs, a transit ICN, and a content provider. Using a generalized Zipf distribution to model content popularity, we devise a game theoretic approach to jointly determine caching and pricing strategies in such an ICN. Under the assumption that the caching cost of the access and transit ICNs is inversely proportional to popularity, we show that the Nash caching strategies in the ICN are 0–1 (all or nothing) strategies. Further, for the case of symmetric access ICNs, we show that the Nash equilibrium is unique and the caching policy (0 or 1) is determined by a threshold on the popularity of the content (reflected by the Zipf probability metric), i.e., all content more popular than the threshold value is cached. We also show that the resulting threshold of the Access and Transit ICNs, as well as all prices can be obtained by a decomposition of the joint caching and pricing problem into two independent caching only and pricing only problems.
Doubly robust estimation in observational studies with partial interference

Interference occurs when the treatment (or exposure) of one individual affects the outcomes of others. In some settings it may be reasonable to assume individuals can be partitioned into clusters such that there is no interference between individuals in different clusters, i.e., there is partial interference. In observational studies with partial interference, inverse probability weighted (IPW) estimators have been proposed of different possible treatment effects. However, the validity of IPW estimators depends on the propensity score being known or correctly modeled. Alternatively, one can estimate the treatment effect using an outcome regression model. In this paper, we propose doubly robust (DR) estimators which utilize both models and are consistent and asymptotically normal if either model, but not necessarily both, is correctly specified. Empirical results are presented to demonstrate the DR property of the proposed estimators, as well as the efficiency gain of DR over IPW estimators when both models are correctly specified. The different estimators are illustrated using data from a study examining the effects of cholera vaccination in Bangladesh.
Asymmetric 2‐colorings of graphs

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their edges can be $2$-colored so that no matter how the graph is embedded in any orientable surface, there is no homeomorphism of the surface which induces a non-trivial color preserving automorphism of the graph.