text
null | inputs
dict | prediction
null | prediction_agent
null | annotation
list | annotation_agent
null | multi_label
bool 1
class | explanation
null | id
stringlengths 1
5
| metadata
null | status
stringclasses 2
values | event_timestamp
null | metrics
null |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
null |
{
"abstract": " We prove generalized weighted Ostrowski and Ostrowski--Grüss type\ninequalities on time scales via a parameter function. In particular, our result\nextends a result of Dragomir and Barnett. Furthermore, we apply our results to\nthe continuous, discrete, and quantum cases, to obtain some interesting new\ninequalities.\n",
"title": "Generalized weighted Ostrowski and Ostrowski-Grüss type inequalities on time scales via a parameter function"
}
| null | null | null | null | true | null |
6401
| null |
Default
| null | null |
null |
{
"abstract": " There is an intuitive analogy of an organic chemist's understanding of a\ncompound and a language speaker's understanding of a word. Consequently, it is\npossible to introduce the basic concepts and analyze potential impacts of\nlinguistic analysis to the world of organic chemistry. In this work, we cast\nthe reaction prediction task as a translation problem by introducing a\ntemplate-free sequence-to-sequence model, trained end-to-end and fully\ndata-driven. We propose a novel way of tokenization, which is arbitrarily\nextensible with reaction information. With this approach, we demonstrate\nresults superior to the state-of-the-art solution by a significant margin on\nthe top-1 accuracy. Specifically, our approach achieves an accuracy of 80.1%\nwithout relying on auxiliary knowledge such as reaction templates. Also, 66.4%\naccuracy is reached on a larger and noisier dataset.\n",
"title": "\"Found in Translation\": Predicting Outcomes of Complex Organic Chemistry Reactions using Neural Sequence-to-Sequence Models"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
6402
| null |
Validated
| null | null |
null |
{
"abstract": " Tensors are a natural way to express correlations among many physical\nvariables, but storing tensors in a computer naively requires memory which\nscales exponentially in the rank of the tensor. This is not optimal, as the\nrequired memory is actually set not by the rank but by the mutual information\namongst the variables in question. Representations such as the tensor tree\nperform near-optimally when the tree decomposition is chosen to reflect the\ncorrelation structure in question, but making such a choice is non-trivial and\ngood heuristics remain highly context-specific. In this work I present two new\nalgorithms for choosing efficient tree decompositions, independent of the\nphysical context of the tensor. The first is a brute-force algorithm which\nproduces optimal decompositions up to truncation error but is generally\nimpractical for high-rank tensors, as the number of possible choices grows\nexponentially in rank. The second is a greedy algorithm, and while it is not\noptimal it performs extremely well in numerical experiments while having\nruntime which makes it practical even for tensors of very high rank.\n",
"title": "Efficient Decomposition of High-Rank Tensors"
}
| null | null | null | null | true | null |
6403
| null |
Default
| null | null |
null |
{
"abstract": " We propose the existence of a new universality in classical chaotic systems\nwhen the number of degrees of freedom is large: the statistical property of the\nLyapunov spectrum is described by Random Matrix Theory. We demonstrate it by\nstudying the finite-time Lyapunov exponents of the matrix model of a stringy\nblack hole and the mass deformed models. The massless limit, which has a dual\nstring theory interpretation, is special in that the universal behavior can be\nseen already at t=0, while in other cases it sets in at late time. The same\npattern is demonstrated also in the product of random matrices.\n",
"title": "Universality in Chaos: Lyapunov Spectrum and Random Matrix Theory"
}
| null | null | null | null | true | null |
6404
| null |
Default
| null | null |
null |
{
"abstract": " Threshold-linear networks (TLNs) are models of neural networks that consist\nof simple, perceptron-like neurons and exhibit nonlinear dynamics that are\ndetermined by the network's connectivity. The fixed points of a TLN, including\nboth stable and unstable equilibria, play a critical role in shaping its\nemergent dynamics. In this work, we provide two novel characterizations for the\nset of fixed points of a competitive TLN: the first is in terms of a simple\nsign condition, while the second relies on the concept of domination. We apply\nthese results to a special family of TLNs, called combinatorial\nthreshold-linear networks (CTLNs), whose connectivity matrices are defined from\ndirected graphs. This leads us to prove a series of graph rules that enable one\nto determine fixed points of a CTLN by analyzing the underlying graph.\nAdditionally, we study larger networks composed of smaller \"building block\"\nsubnetworks, and prove several theorems relating the fixed points of the full\nnetwork to those of its components. Our results provide the foundation for a\nkind of \"graphical calculus\" to infer features of the dynamics from a network's\nconnectivity.\n",
"title": "Fixed points of competitive threshold-linear networks"
}
| null | null |
[
"Quantitative Biology"
] | null | true | null |
6405
| null |
Validated
| null | null |
null |
{
"abstract": " This paper describes a decision procedure for disjunctions of conjunctions of\nanti-prenex normal forms of pure first-order logic (FOLDNFs) that do not\ncontain $\\vee$ within the scope of quantifiers. The disjuncts of these FOLDNFs\nare equivalent to prenex normal forms whose quantifier-free parts are\nconjunctions of atomic and negated atomic formulae (= Herbrand formulae). In\ncontrast to the usual algorithms for Herbrand formulae, neither skolemization\nnor unification algorithms with function symbols are applied. Instead, a\nprocedure is described that rests on nothing but equivalence transformations\nwithin pure first-order logic (FOL). This procedure involves the application of\na calculus for negative normal forms (the NNF-calculus) with $A \\dashv\\vdash A\n\\wedge A$ (= $\\wedge$I) as the sole rule that increases the complexity of given\nFOLDNFs. The described algorithm illustrates how, in the case of Herbrand\nformulae, decision problems can be solved through a systematic search for\nproofs that reduce the number of applications of the rule $\\wedge$I to a\nminimum in the NNF-calculus. In the case of Herbrand formulae, it is even\npossible to entirely abstain from applying $\\wedge$I. Finally, it is shown how\nthe described procedure can be used within an optimized general search for\nproofs of contradiction and what kind of questions arise for a\n$\\wedge$I-minimal proof strategy in the case of a general search for proofs of\ncontradiction.\n",
"title": "A Decision Procedure for Herbrand Formulae without Skolemization"
}
| null | null | null | null | true | null |
6406
| null |
Default
| null | null |
null |
{
"abstract": " The observation of electric dipole moments (EDMs) in atomic systems due to\nparity and time-reversal violating (P,T-odd) interactions can probe new physics\nbeyond the standard model and also provide insights into the matter-antimatter\nasymmetry in the Universe. The EDMs of open-shell atomic systems are sensitive\nto the electron EDM and the P,T-odd scalar-pseudoscalar (S-PS) semi-leptonic\ninteraction, but the dominant contributions to the EDMs of diamagnetic atoms\ncome from the hadronic and tensor-pseudotensor (T-PT) semi-leptonic\ninteractions. Several diamagnetic atoms like $^{129}$Xe, $^{171}$Yb,\n$^{199}$Hg, $^{223}$Rn, and $^{225}$Ra are candidates for the experimental\nsearch for the possible existence of EDMs, and among these $^{199}$Hg has\nyielded the lowest limit till date. The T or CP violating coupling constants of\nthe aforementioned interactions can be extracted from these measurements by\ncombining with atomic and nuclear calculations. In this work, we report the\ncalculations of the EDMs of the above atoms by including both the\nelectromagnetic and P,T-odd violating interactions simultaneously. These\ncalculations are performed by employing relativistic many-body methods based on\nthe random phase approximation (RPA) and the singles and doubles\ncoupled-cluster (CCSD) method starting with the Dirac-Hartree-Fock (DHF) wave\nfunction in both cases. The differences in the results from both the methods\nshed light on the importance of the non-core-polarization electron correlation\neffects that are accounted for by the CCSD method. We also determine electric\ndipole polarizabilities of these atoms, which have computational similarities\nwith EDMs and compare them with the available experimental and other\ntheoretical results to assess the accuracy of our calculations.\n",
"title": "The role of relativistic many-body theory in probing new physics beyond the standard model via the electric dipole moments of diamagnetic atoms"
}
| null | null | null | null | true | null |
6407
| null |
Default
| null | null |
null |
{
"abstract": " Reports and press releases highlight that security incidents continue to\nplague organizations. While researchers and practitioners' alike endeavor to\nidentify and implement realistic security solutions to prevent incidents from\noccurring, the ability to initially identify a security incident is paramount\nwhen researching a security incident lifecycle. Hence, this research\ninvestigates the ability of employees in a Global Fortune 500 financial\norganization, through internal electronic surveys, to recognize and report\nsecurity incidents to pursue a more holistic security posture. The research\ncontribution is an initial insight into security incident perceptions by\nemployees in the financial sector as well as serving as an initial guide for\nfuture security incident recognition and reporting initiatives.\n",
"title": "Security Incident Recognition and Reporting (SIRR): An Industrial Perspective"
}
| null | null | null | null | true | null |
6408
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we consider an optimal control problem for the coupled system\nof a nonlinear monotone Dirichlet problem with anisotropic p-Laplacian and\nmatrix-valued nonsmooth controls in its coefficients and a nonlinear equation\nof Hammerstein type. Using the direct method in calculus of variations, we\nprove the existence of an optimal control in considered problem and provide\nsensitivity analysis for a specific case of considered problem with respect to\ntwo-parameter regularization.\n",
"title": "On attainability of optimal controls in coefficients for system of Hammerstein type with anisotropic p-Laplacia"
}
| null | null |
[
"Mathematics"
] | null | true | null |
6409
| null |
Validated
| null | null |
null |
{
"abstract": " The Tweedie Compound Poisson-Gamma model is routinely used for modeling\nnon-negative continuous data with a discrete probability mass at zero. Mixed\nmodels with random effects account for the covariance structure related to the\ngrouping hierarchy in the data. An important application of Tweedie mixed\nmodels is pricing the insurance policies, e.g. car insurance. However, the\nintractable likelihood function, the unknown variance function, and the\nhierarchical structure of mixed effects have presented considerable challenges\nfor drawing inferences on Tweedie. In this study, we tackle the Bayesian\nTweedie mixed-effects models via variational inference approaches. In\nparticular, we empower the posterior approximation by implicit models trained\nin an adversarial setting. To reduce the variance of gradients, we\nreparameterize random effects, and integrate out one local latent variable of\nTweedie. We also employ a flexible hyper prior to ensure the richness of the\napproximation. Our method is evaluated on both simulated and real-world data.\nResults show that the proposed method has smaller estimation bias on the random\neffects compared to traditional inference methods including MCMC; it also\nachieves a state-of-the-art predictive performance, meanwhile offering a richer\nestimation of the variance function.\n",
"title": "Adversarial Variational Bayes Methods for Tweedie Compound Poisson Mixed Models"
}
| null | null | null | null | true | null |
6410
| null |
Default
| null | null |
null |
{
"abstract": " Temporal networks have been increasingly used to model a diversity of systems\nthat evolve in time; for example human contact structures over which dynamic\nprocesses such as epidemics take place. A fundamental aspect of real-life\nnetworks is that they are sampled within temporal and spatial frames.\nFurthermore, one might wish to subsample networks to reduce their size for\nbetter visualization or to perform computationally intensive simulations. The\nsampling method may affect the network structure and thus caution is necessary\nto generalize results based on samples. In this paper, we study four sampling\nstrategies applied to a variety of real-life temporal networks. We quantify the\nbiases generated by each sampling strategy on a number of relevant statistics\nsuch as link activity, temporal paths and epidemic spread. We find that some\nbiases are common in a variety of networks and statistics, but one strategy,\nuniform sampling of nodes, shows improved performance in most scenarios. Our\nresults help researchers to better design network data collection protocols and\nto understand the limitations of sampled temporal network data.\n",
"title": "Sampling of Temporal Networks: Methods and Biases"
}
| null | null | null | null | true | null |
6411
| null |
Default
| null | null |
null |
{
"abstract": " Unlike classical causal inference, which often has an average causal effect\nof a treatment within a population as a target, in settings such as\npersonalized medicine, the goal is to map a given unit's characteristics to a\ntreatment tailored to maximize the expected outcome for that unit. Obtaining\nhigh-quality mappings of this type is the goal of the dynamic regime literature\n(Chakraborty and Moodie 2013), with connections to reinforcement learning and\nexperimental design. Aside from the average treatment effects, mechanisms\nbehind causal relationships are also of interest. A well-studied approach to\nmechanism analysis is establishing average effects along with a particular set\nof causal pathways, in the simplest case the direct and indirect effects.\nEstimating such effects is the subject of the mediation analysis literature\n(Robins and Greenland 1992; Pearl 2001).\nIn this paper, we consider how unit characteristics may be used to tailor a\ntreatment assignment strategy that maximizes a particular path-specific effect.\nIn healthcare applications, finding such a policy is of interest if, for\ninstance, we are interested in maximizing the chemical effect of a drug on an\noutcome (corresponding to the direct effect), while assuming drug adherence\n(corresponding to the indirect effect) is set to some reference level. To solve\nour problem, we define counterfactuals associated with path-specific effects of\na policy, give a general identification algorithm for these counterfactuals,\ngive a proof of completeness, and show how classification algorithms in machine\nlearning (Chen, Zeng, and Kosorok 2016) may be used to find a high-quality\npolicy. We validate our approach via a simulation study.\n",
"title": "Personalizing Path-Specific Effects"
}
| null | null | null | null | true | null |
6412
| null |
Default
| null | null |
null |
{
"abstract": " In most physical sciences, students from underrepresented minority (URM)\ngroups constitute a small percentage of earned degrees at the undergraduate and\ngraduate levels. Bridge programs can serve as an initiative to increase the\nnumber of URM students that gain access to graduate school and earn advanced\ndegrees in physics. This talk discussed levels of representation in physical\nsciences as well as some results and best practices of current bridge programs\nin physics. The APS Bridge Program has enabled over 100 students to be placed\ninto Bridge or graduate programs in physics, while retaining 88% of those\nplaced.\n",
"title": "Bridge Programs as an approach to improving diversity in physics"
}
| null | null | null | null | true | null |
6413
| null |
Default
| null | null |
null |
{
"abstract": " Background: For newborn infants in critical care, continuous monitoring of\nbrain function can help identify infants at-risk of brain injury. Quantitative\nfeatures allow a consistent and reproducible approach to EEG analysis, but only\nwhen all implementation aspects are clearly defined.\nMethods: We detail quantitative features frequently used in neonatal EEG\nanalysis and present a Matlab software package together with exact\nimplementation details for all features. The feature set includes stationary\nfeatures that capture amplitude and frequency characteristics and features of\ninter-hemispheric connectivity. The software, a Neonatal Eeg featURe set in\nmAtLab (NEURAL), is open source and freely available. The software also\nincludes a pre-processing stage with a basic artefact removal procedure.\nConclusions: NEURAL provides a common platform for quantitative analysis of\nneonatal EEG. This will support reproducible research and enable comparisons\nacross independent studies. These features present summary measures of the EEG\nthat can also be used in automated methods to determine brain development and\nhealth of the newborn in critical care.\n",
"title": "NEURAL: quantitative features for newborn EEG using Matlab"
}
| null | null | null | null | true | null |
6414
| null |
Default
| null | null |
null |
{
"abstract": " Generating large quantities of quality labeled data in medical imaging is\nvery time consuming and expensive. The performance of supervised algorithms for\nvarious tasks on imaging has improved drastically over the years, however the\navailability of data to train these algorithms have become one of the main\nbottlenecks for implementation. To address this, we propose a semi-supervised\nlearning method where pseudo-negative labels from unlabeled data are used to\nfurther refine the performance of a pulmonary nodule detection network in chest\nradiographs. After training with the proposed network, the false positive rate\nwas reduced to 0.1266 from 0.4864 while maintaining sensitivity at 0.89.\n",
"title": "False Positive Reduction by Actively Mining Negative Samples for Pulmonary Nodule Detection in Chest Radiographs"
}
| null | null | null | null | true | null |
6415
| null |
Default
| null | null |
null |
{
"abstract": " WASP-12b is an extreme hot Jupiter in a 1 day orbit, suffering profound\nirradiation from its F type host star. The planet is surrounded by a\ntranslucent exosphere which overfills the Roche lobe and produces\nline-blanketing absorption in the near-UV. The planet is losing mass. Another\nunusual property of the WASP-12 system is that observed chromospheric emission\nfrom the star is anomalously low: WASP-12 is an extreme outlier amongst\nthousands of stars when the log $R^{'}_{HK}$ chromospheric activity indicator\nis considered. Occam's razor suggests these two extremely rare properties\ncoincide in this system because they are causally related. The absence of the\nexpected chromospheric emission is attributable to absorption by a diffuse\ncircumstellar gas shroud which surrounds the entire planetary system and fills\nour line of sight to the chromospherically active regions of the star. This\ncircumstellar gas shroud is probably fed by mass loss from WASP-12b. The\norbital eccentricity of WASP-12b is small but may be non-zero. The planet is\npart of a hierarchical quadruple system; its current orbit is consistent with\nprior secular dynamical evolution leading to a highly eccentric orbit followed\nby tidal circularization. When compared with the Galaxy's population of\nplanets, WASP-12b lies on the upper boundary of the sub-Jovian desert in both\nthe $(M_{\\rm P}, P)$ and $(R_{\\rm P}, P)$ planes. Determining the mass loss\nrate for WASP-12b will illuminate the mechanism(s) responsible for the\nsub-Jovian desert.\n",
"title": "WASP-12b: A Mass-Losing Extremely Hot Jupiter"
}
| null | null | null | null | true | null |
6416
| null |
Default
| null | null |
null |
{
"abstract": " It is shown that the adiabatic Born-Oppenheimer expansion does not satisfy\nthe necessary condition for the applicability of perturbation theory. A simple\nexample of an exact solution of a problem that can not be obtained from the\nBorn-Oppenheimer expansion is given. A new version of perturbation theory for\nmolecular systems is proposed.\n",
"title": "On the status of the Born-Oppenheimer expansion in molecular systems theory"
}
| null | null |
[
"Physics"
] | null | true | null |
6417
| null |
Validated
| null | null |
null |
{
"abstract": " The computation of the tropical prevariety is the first step in the\napplication of polyhedral methods to compute positive dimensional solution sets\nof polynomial systems. In particular, pretropisms are candidate leading\nexponents for the power series developments of the solutions. The computation\nof the power series may start as soon as one pretropism is available, so our\nparallel computation of the tropical prevariety has an application in a\npipelined solver.\nWe present a parallel implementation of dynamic enumeration. Our first\ndistributed memory implementation with forked processes achieved good speedups,\nbut quite often resulted in large variations in the execution times of the\nprocesses. The shared memory multithreaded version applies work stealing to\nreduce the variability of the run time. Our implementation applies the thread\nsafe Parma Polyhedral Library (PPL), in exact arithmetic with the GNU\nMultiprecision Arithmetic Library (GMP), aided by the fast memory allocations\nof TCMalloc.\nOur parallel implementation is capable of computing the tropical prevariety\nof the cyclic 16-roots problem. We also report on computational experiments on\nthe $n$-body and $n$-vortex problems; our computational results compare\nfavorably with Gfan.\n",
"title": "Computing Tropical Prevarieties in Parallel"
}
| null | null |
[
"Computer Science",
"Mathematics"
] | null | true | null |
6418
| null |
Validated
| null | null |
null |
{
"abstract": " Recently, G. A. Freiman, M. Herzog, P. Longobardi, M. Maj proved two\n`structure theorems' for ordered groups \\cite{FHLM}. We give elementary proof\nof these two theorems.\n",
"title": "3k-4 theorem for ordered groups"
}
| null | null | null | null | true | null |
6419
| null |
Default
| null | null |
null |
{
"abstract": " Correction of Type Ia Supernova brightnesses for extinction by dust has\nproven to be a vexing problem. Here we study the dust foreground to the highly\nreddened SN 2012cu, which is projected onto a dust lane in the galaxy NGC 4772.\nThe analysis is based on multi-epoch, spectrophotometric observations spanning\n3,300 - 9,200 {\\AA}, obtained by the Nearby Supernova Factory. Phase-matched\ncomparison of the spectroscopically twinned SN 2012cu and SN 2011fe across 10\nepochs results in the best-fit color excess of (E(B-V), RMS) = (1.00, 0.03) and\ntotal-to-selective extinction ratio of (RV , RMS) = (2.95, 0.08) toward SN\n2012cu within its host galaxy. We further identify several diffuse interstellar\nbands, and compare the 5780 {\\AA} band with the dust-to-band ratio for the\nMilky Way. Overall, we find the foreground dust-extinction properties for SN\n2012cu to be consistent with those of the Milky Way. Furthermore we find no\nevidence for significant time variation in any of these extinction tracers. We\nalso compare the dust extinction curve models of Cardelli et al. (1989),\nO'Donnell (1994), and Fitzpatrick (1999), and find the predictions of\nFitzpatrick (1999) fit SN 2012cu the best. Finally, the distance to NGC4772,\nthe host of SN 2012cu, at a redshift of z = 0.0035, often assigned to the Virgo\nSouthern Extension, is determined to be 16.6$\\pm$1.1 Mpc. We compare this\nresult with distance measurements in the literature.\n",
"title": "The Extinction Properties of and Distance to the Highly Reddened Type Ia Supernova SN 2012cu"
}
| null | null | null | null | true | null |
6420
| null |
Default
| null | null |
null |
{
"abstract": " The aim of this paper is to study, via theoretical analysis and numerical\nsimulations, the dynamics of Whitham and related equations. In particular we\nestablish rigorous bounds between solutions of the Whitham and KdV equations\nand provide some insights into the dynamics of the Whitham equation in\ndifferent regimes, some of them being outside the range of validity of the\nWhitham equation as a water waves model.\n",
"title": "On Whitham and related equations"
}
| null | null |
[
"Mathematics"
] | null | true | null |
6421
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper we extend the known results of analytic connectivity to\nnon-uniform hypergraphs. We prove a modified Cheeger's inequality and also give\na bound on analytic connectivity with respect to the degree sequence and\ndiameter of a hypergraph.\n",
"title": "Analytic Connectivity in General Hypergraphs"
}
| null | null |
[
"Computer Science"
] | null | true | null |
6422
| null |
Validated
| null | null |
null |
{
"abstract": " We explore an extended cosmological scenario where the dark matter is an\nadmixture of cold and additional non-cold species. The mass and temperature of\nthe non-cold dark matter particles are extracted from a number of cosmological\nmeasurements. Among others, we consider tomographic weak lensing data and Milky\nWay dwarf satellite galaxy counts. We also study the potential of these\nscenarios in alleviating the existing tensions between local measurements and\nCosmic Microwave Background (CMB) estimates of the $S_8$ parameter, with\n$S_8=\\sigma_8\\sqrt{\\Omega_m}$, and of the Hubble constant $H_0$. In principle,\na sub-dominant, non-cold dark matter particle with a mass $m_X\\sim$~keV, could\nachieve the goals above. However, the preferred ranges for its temperature and\nits mass are different when extracted from weak lensing observations and from\nMilky Way dwarf satellite galaxy counts, since these two measurements require\nsuppressions of the matter power spectrum at different scales. Therefore,\nsolving simultaneously the CMB-weak lensing tensions and the small scale crisis\nin the standard cold dark matter picture via only one non-cold dark matter\ncomponent seems to be challenging.\n",
"title": "Cosmological searches for a non-cold dark matter component"
}
| null | null | null | null | true | null |
6423
| null |
Default
| null | null |
null |
{
"abstract": " We consider a quasi-homogeneous polynomial $f \\in \\mathbb{Z}[x_0, \\ldots,\nx_N]$ of degree $w$ equal to the degree of $x_0 \\cdots x_N$ and show that the\n$F$-pure threshold of the reduction $f_p \\in \\mathbb{F}_p[x_0, \\ldots, x_N]$ is\nequal to the log canonical threshold if and only if the height of the\nArtin-Mazur formal group associated to $H^{N-1}\\left( X, {\\mathbb{G}}_{m,X}\n\\right)$, where $X$ is the hypersurface given by $f$, is equal to 1. We also\nprove that a similar result holds for Fermat hypersurfaces of degree $>N+1$.\nFurthermore, we give examples of weighted Delsarte surfaces which show that\nother values of the $F$-pure threshold of a quasi-homogeneous polynomial of\ndegree $w$ cannot be characterized by the height.\n",
"title": "F-pure threshold and height of quasi-homogeneous polynomials"
}
| null | null |
[
"Mathematics"
] | null | true | null |
6424
| null |
Validated
| null | null |
null |
{
"abstract": " We solve the problem of optimal liquidation with volume weighted average\nprice (VWAP) benchmark when the market impact is linear and transient. Our\nsetting is indeed more general as it considers the case when the trading\ninterval is not necessarily coincident with the benchmark interval:\nImplementation Shortfall and Target Close execution are shown to be particular\ncases of our setting. We find explicit solutions in continuous and discrete\ntime considering risk averse investors having a CARA utility function. Finally,\nwe show that, contrary to what is observed for Implementation Shortfall, the\noptimal VWAP solution contains both buy and sell trades also when the decay\nkernel is convex.\n",
"title": "Optimal VWAP execution under transient price impact"
}
| null | null | null | null | true | null |
6425
| null |
Default
| null | null |
null |
{
"abstract": " Cellular Electron CryoTomography (CECT) is a 3D imaging technique that\ncaptures information about the structure and spatial organization of\nmacromolecular complexes within single cells, in near-native state and at\nsub-molecular resolution. Although template matching is often used to locate\nmacromolecules in a CECT image, it is insufficient as it only measures the\nrelative structural similarity. Therefore, it is preferable to assess the\nstatistical credibility of the decision through hypothesis testing, requiring\nmany templates derived from a diverse population of macromolecular structures.\nDue to the very limited number of known structures, we need a generative model\nto efficiently and reliably sample pseudo-structures from the complex\ndistribution of macromolecular structures. To address this challenge, we\npropose a novel image-derived approach for performing hypothesis testing for\ntemplate matching by constructing generative models using the generative\nadversarial network. Finally, we conducted hypothesis testing experiments for\ntemplate matching on both simulated and experimental subtomograms, allowing us\nto conclude the identity of subtomograms with high statistical credibility and\nsignificantly reducing false positives.\n",
"title": "Image-derived generative modeling of pseudo-macromolecular structures - towards the statistical assessment of Electron CryoTomography template matching"
}
| null | null | null | null | true | null |
6426
| null |
Default
| null | null |
null |
{
"abstract": " We propose a novel Bayesian approach to modelling nonlinear alignments of\ntime series based on latent shared information. We apply the method to the\nreal-world problem of finding common structure in the sensor data of wind\nturbines introduced by the underlying latent and turbulent wind field. The\nproposed model allows for both arbitrary alignments of the inputs and\nnon-parametric output warpings to transform the observations. This gives rise\nto multiple deep Gaussian process models connected via latent generating\nprocesses. We present an efficient variational approximation based on nested\nvariational compression and show how the model can be used to extract shared\ninformation between dependent time series, recovering an interpretable\nfunctional decomposition of the learning problem. We show results for an\nartificial data set and real-world data of two wind turbines.\n",
"title": "Bayesian Alignments of Warped Multi-Output Gaussian Processes"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
6427
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper we explore the use of unsupervised methods for detecting\ncognates in multilingual word lists. We use online EM to train sound segment\nsimilarity weights for computing similarity between two words. We tested our\nonline systems on geographically spread sixteen different language groups of\nthe world and show that the Online PMI system (Pointwise Mutual Information)\noutperforms a HMM based system and two linguistically motivated systems:\nLexStat and ALINE. Our results suggest that a PMI system trained in an online\nfashion can be used by historical linguists for fast and accurate\nidentification of cognates in not so well-studied language families.\n",
"title": "Fast and unsupervised methods for multilingual cognate clustering"
}
| null | null |
[
"Computer Science"
] | null | true | null |
6428
| null |
Validated
| null | null |
null |
{
"abstract": " We report structural, susceptibility and specific heat studies of\nstoichiometric and off-stoichiometric poly- and single crystals of the A-site\nspinel compound FeSc2S4. In stoichiometric samples no long-range magnetic order\nis found down to 1.8 K. The magnetic susceptibility of these samples is field\nindependent in the temperature range 10 - 400 K and does not show irreversible\neffects at low temperatures. In contrast, the magnetic susceptibility of\nsamples with iron excess shows substantial field dependence at high\ntemperatures and manifests a pronounced magnetic irreversibility at low\ntemperatures with a difference between ZFC and FC susceptibilities and a\nmaximum at 10 K reminiscent of a magnetic transition. Single crystal x-ray\ndiffraction of the stoichiometric samples revealed a single phase spinel\nstructure without site inversion. In single crystalline samples with Fe excess\nbesides the main spinel phase a second ordered single-crystal phase was\ndetected with the diffraction pattern of a vacancy-ordered superstructure of\niron sulfide, close to the 5C polytype Fe9S10. Specific heat studies reveal a\nbroad anomaly, which evolves below 20 K in both stoichiometric and\noff-stoichiometric crystals. We show that the low-temperature specific heat can\nbe well described by considering the low-lying spin-orbital electronic levels\nof Fe2+ ions. Our results demonstrate significant influence of excess Fe ions\non intrinsic magnetic behavior of FeSc2S4 and provide support for the\nspin-orbital liquid scenario proposed in earlier studies for the stoichiometric\ncompound.\n",
"title": "Structure, magnetic susceptibility and specific heat of the spin-orbital-liquid candidate FeSc2S4 : Influence of fe off-stoichiometry"
}
| null | null | null | null | true | null |
6429
| null |
Default
| null | null |
null |
{
"abstract": " We consider cloud-based control scenarios in which clients with local control\ntasks outsource their computational or physical duties to a cloud service\nprovider. In order to address privacy concerns in such a control architecture,\nwe first investigate the issue of finding an appropriate privacy measure for\nclients who desire to keep local state information as private as possible\nduring the control operation. Specifically, we justify the use of Kramer's\nnotion of causally conditioned directed information as a measure of privacy\nloss based on an axiomatic argument. Then we propose a methodology to design an\noptimal \"privacy filter\" that minimizes privacy loss while a given level of\ncontrol performance is guaranteed. We show in particular that the optimal\nprivacy filter for cloud-based Linear-Quadratic-Gaussian (LQG) control can be\nsynthesized by a Linear-Matrix-Inequality (LMI) algorithm. The trade-off in the\ndesign is illustrated by a numerical example.\n",
"title": "Directed Information as Privacy Measure in Cloud-based Control"
}
| null | null | null | null | true | null |
6430
| null |
Default
| null | null |
null |
{
"abstract": " Simple finite dimensional Kantor triple systems over the complex numbers are\nclassified in terms of Satake diagrams. We prove that every simple and linearly\ncompact Kantor triple system has finite dimension and give an explicit\npresentation of all the classical and exceptional systems.\n",
"title": "Classification of simple linearly compact Kantor triple systems over the complex numbers"
}
| null | null | null | null | true | null |
6431
| null |
Default
| null | null |
null |
{
"abstract": " Spatial separation of suspended particles based on contrast in their physical\nor chemical properties forms the basis of various biological assays performed\non lab-on-achip devices. To electronically acquire this information, we have\nrecently introduced a microfluidic sensing platform, called Microfluidic CODES,\nwhich combines the resistive pulse sensing with the code division multiple\naccess in multiplexing a network of integrated electrical sensors. In this\npaper, we enhance the multiplexing capacity of the Microfluidic CODES by\nemploying sensors that generate non-orthogonal code waveforms and a new\ndecoding algorithm that combines machine learning techniques with minimum\nmean-squared error estimation. As a proof of principle, we fabricated a\nmicrofluidic device with a network of 10 code-multiplexed sensors and\ncharacterized it using cells suspended in phosphate buffer saline solution.\n",
"title": "Code-division multiplexed resistive pulse sensor networks for spatio-temporal detection of particles in microfluidic devices"
}
| null | null | null | null | true | null |
6432
| null |
Default
| null | null |
null |
{
"abstract": " Network navigability is a key feature of complex networked systems. For a\nnetwork embedded in a geometrical space, maximization of greedy routing (GR)\nmeasures based on the node geometrical coordinates can ensure efficient greedy\nnavigability. In PNAS, Seguin et al. (PNAS 2018, vol. 115, no. 24) define a\nmeasure for quantifying the efficiency of brain network navigability in the\nEuclidean space, referred to as the efficiency ratio, whose formula exactly\ncoincides with the GR-score (GR-efficiency) previously published by Muscoloni\net al. (Nature Communications 2017, vol. 8, no. 1615). In this Letter, we point\nout potential flaws in the study of Seguin et al. regarding the discussion of\nthe GR evaluation. In particular, we revise the concept of GR navigability,\ntogether with a careful discussion of the advantage offered by the new proposed\nGR-efficiency measure in comparison to the main measures previously adopted in\nliterature. Finally, we clarify and standardize the GR-efficiency terminology\nin order to simplify and facilitate the discussion in future studies.\n",
"title": "Navigability evaluation of complex networks by greedy routing efficiency"
}
| null | null | null | null | true | null |
6433
| null |
Default
| null | null |
null |
{
"abstract": " We study fermionic topological phases using the technique of fermion\ncondensation. We give a prescription for performing fermion condensation in\nbosonic topological phases which contain a fermion. Our approach to fermion\ncondensation can roughly be understood as coupling the parent bosonic\ntopological phase to a phase of physical fermions, and condensing pairs of\nphysical and emergent fermions. There are two distinct types of objects in\nfermionic theories, which we call \"m-type\" and \"q-type\" particles. The\nendomorphism algebras of q-type particles are complex Clifford algebras, and\nthey have no analogues in bosonic theories. We construct a fermionic\ngeneralization of the tube category, which allows us to compute the\nquasiparticle excitations in fermionic topological phases. We then prove a\nseries of results relating data in condensed theories to data in their parent\ntheories; for example, if $\\mathcal{C}$ is a modular tensor category containing\na fermion, then the tube category of the condensed theory satisfies\n$\\textbf{Tube}(\\mathcal{C}/\\psi) \\cong \\mathcal{C} \\times (\\mathcal{C}/\\psi)$.\nWe also study how modular transformations, fusion rules, and coherence\nrelations are modified in the fermionic setting, prove a fermionic version of\nthe Verlinde dimension formula, construct a commuting projector lattice\nHamiltonian for fermionic theories, and write down a fermionic version of the\nTuraev-Viro-Barrett-Westbury state sum. A large portion of this work is devoted\nto three detailed examples of performing fermion condensation to produce\nfermionic topological phases: we condense fermions in the Ising theory, the\n$SO(3)_6$ theory, and the $\\frac{1}{2}\\text{E}_6$ theory, and compute the\nquasiparticle excitation spectrum in each of these examples.\n",
"title": "Fermion condensation and super pivotal categories"
}
| null | null |
[
"Physics",
"Mathematics"
] | null | true | null |
6434
| null |
Validated
| null | null |
null |
{
"abstract": " Reliable identification of molecular biomarkers is essential for accurate\npatient stratification. While state-of-the-art machine learning approaches for\nsample classification continue to push boundaries in terms of performance, most\nof these methods are not able to integrate different data types and lack\ngeneralization power, limiting their application in a clinical setting.\nFurthermore, many methods behave as black boxes, and we have very little\nunderstanding about the mechanisms that lead to the prediction. While\nopaqueness concerning machine behaviour might not be a problem in deterministic\ndomains, in health care, providing explanations about the molecular factors and\nphenotypes that are driving the classification is crucial to build trust in the\nperformance of the predictive system. We propose Pathway Induced Multiple\nKernel Learning (PIMKL), a novel methodology to reliably classify samples that\ncan also help gain insights into the molecular mechanisms that underlie the\nclassification. PIMKL exploits prior knowledge in the form of a molecular\ninteraction network and annotated gene sets, by optimizing a mixture of\npathway-induced kernels using a Multiple Kernel Learning (MKL) algorithm, an\napproach that has demonstrated excellent performance in different machine\nlearning applications. After optimizing the combination of kernels for\nprediction of a specific phenotype, the model provides a stable molecular\nsignature that can be interpreted in the light of the ingested prior knowledge\nand that can be used in transfer learning tasks.\n",
"title": "PIMKL: Pathway Induced Multiple Kernel Learning"
}
| null | null | null | null | true | null |
6435
| null |
Default
| null | null |
null |
{
"abstract": " This paper introduces pyRecLab, a software library written in C++ with Python\nbindings which allows to quickly train, test and develop recommender systems.\nAlthough there are several software libraries for this purpose, only a few let\ndevelopers to get quickly started with the most traditional methods, permitting\nthem to try different parameters and approach several tasks without a\nsignificant loss of performance. Among the few libraries that have all these\nfeatures, they are available in languages such as Java, Scala or C#, what is a\ndisadvantage for less experienced programmers more used to the popular Python\nprogramming language. In this article we introduce details of pyRecLab, showing\nas well performance analysis in terms of error metrics (MAE and RMSE) and\ntrain/test time. We benchmark it against the popular Java-based library LibRec,\nshowing similar results. We expect programmers with little experience and\npeople interested in quickly prototyping recommender systems to be benefited\nfrom pyRecLab.\n",
"title": "pyRecLab: A Software Library for Quick Prototyping of Recommender Systems"
}
| null | null | null | null | true | null |
6436
| null |
Default
| null | null |
null |
{
"abstract": " We formulate stochastic gradient descent (SGD) as a Bayesian filtering\nproblem. Inference in the Bayesian setting naturally gives rise to BRMSprop and\nBAdam: Bayesian variants of RMSprop and Adam. Remarkably, the Bayesian approach\nrecovers many features of state-of-the-art adaptive SGD methods, including\namoungst others root-mean-square normalization, Nesterov acceleration and\nAdamW. As such, the Bayesian approach provides one explanation for the\nempirical effectiveness of state-of-the-art adaptive SGD algorithms.\nEmpirically comparing BRMSprop and BAdam with naive RMSprop and Adam on MNIST,\nwe find that Bayesian methods have the potential to considerably reduce test\nloss and classification error.\n",
"title": "A unified theory of adaptive stochastic gradient descent as Bayesian filtering"
}
| null | null | null | null | true | null |
6437
| null |
Default
| null | null |
null |
{
"abstract": " We perform a post-processing radiative feedback analysis on a 3D ab initio\ncosmological simulation of an atomic cooling halo under the direct collapse\nblack hole (DCBH) scenario. We maintain the spatial resolution of the\nsimulation by incorporating native ray-tracing on unstructured mesh data,\nincluding Monte Carlo Lyman-alpha (Ly{\\alpha}) radiative transfer. DCBHs are\nborn in gas-rich, metal-poor environments with the possibility of Compton-thick\nconditions, $N_H \\gtrsim 10^{24} {\\rm cm}^{-2}$. Therefore, the surrounding gas\nis capable of experiencing the full impact of the bottled-up radiation\npressure. In particular, we find that multiple scattering of Ly{\\alpha} photons\nprovides an important source of mechanical feedback after the gas in the\nsub-parsec region becomes partially ionized, avoiding the bottleneck of\ndestruction via the two-photon emission mechanism. We provide detailed\ndiscussion of the simulation environment, expansion of the ionization front,\nemission and escape of Ly{\\alpha} radiation, and Compton scattering. A sink\nparticle prescription allows us to extract approximate limits on the\npost-formation evolution of the radiative feedback. Fully coupled Ly{\\alpha}\nradiation hydrodynamics will be crucial to consider in future DCBH simulations.\n",
"title": "Radiative effects during the assembly of direct collapse black holes"
}
| null | null | null | null | true | null |
6438
| null |
Default
| null | null |
null |
{
"abstract": " We investigate the inherent influence of light polarization on the intensity\ndistribution in anisotropic media undergoing a local inhomogeneous rotation of\nthe principal axes. Whereas in general such configuration implies a complicated\ninteraction between geometric and dynamic phase, we show that, in a medium\nshowing an inhomogeneous circular birefringence, the geometric phase vanishes.\nDue to the spin-orbit interaction, the two circular polarizations perceive\nreversed spatial distribution of the dynamic phase. Based upon this effect,\npolarization-selective lens, waveguides and beam deflectors are proposed.\n",
"title": "Spin-orbit interactions in optically active materials"
}
| null | null | null | null | true | null |
6439
| null |
Default
| null | null |
null |
{
"abstract": " Formal ontologies are axiomatizations in a logic-based formalism. The\ndevelopment of formal ontologies, and their important role in the Semantic Web\narea, is generating considerable research on the use of automated reasoning\ntechniques and tools that help in ontology engineering. One of the main aims is\nto refine and to improve axiomatizations for enabling automated reasoning tools\nto efficiently infer reliable information. Defects in the axiomatization can\nnot only cause wrong inferences, but can also hinder the inference of expected\ninformation, either by increasing the computational cost of, or even\npreventing, the inference. In this paper, we introduce a novel, fully automatic\nwhite-box testing framework for first-order logic ontologies. Our methodology\nis based on the detection of inference-based redundancies in the given\naxiomatization. The application of the proposed testing method is fully\nautomatic since a) the automated generation of tests is guided only by the\nsyntax of axioms and b) the evaluation of tests is performed by automated\ntheorem provers. Our proposal enables the detection of defects and serves to\ncertify the grade of suitability --for reasoning purposes-- of every axiom. We\nformally define the set of tests that are generated from any axiom and prove\nthat every test is logically related to redundancies in the axiom from which\nthe test has been generated. We have implemented our method and used this\nimplementation to automatically detect several non-trivial defects that were\nhidden in various first-order logic ontologies. Throughout the paper we provide\nillustrative examples of these defects, explain how they were found, and how\neach proof --given by an automated theorem-prover-- provides useful hints on\nthe nature of each defect. Additionally, by correcting all the detected\ndefects, we have obtained an improved version of one of the tested ontologies:\nAdimen-SUMO.\n",
"title": "Automatic White-Box Testing of First-Order Logic Ontologies"
}
| null | null |
[
"Computer Science"
] | null | true | null |
6440
| null |
Validated
| null | null |
null |
{
"abstract": " In the Bak-Sneppen model, the lowest fitness particle and its two nearest\nneighbors are renewed at each temporal step with a uniform (0,1) fitness\ndistribution. The model presents a critical value that depends on the\ninteraction criteria (two nearest neighbors) and on the update procedure\n(uniform). Here we calculate the critical value for models where one or both\nproperties are changed. We study models with non-uniform updates, models with\nrandom neighbors and models with binary fitness and obtain exact results for\nthe average fitness and for $p_c$.\n",
"title": "Critical values in Bak-Sneppen type models"
}
| null | null | null | null | true | null |
6441
| null |
Default
| null | null |
null |
{
"abstract": " Consider a set of categorical variables $\\mathcal{P}$ where at least one,\ndenoted by $Y$, is binary. The log-linear model that describes the counts in\nthe resulting contingency table implies a specific logistic regression model,\nwith the binary variable as the outcome. Extending results in Christensen\n(1997), by also considering the case where factors present in the contingency\ntable disappear from the logistic regression model, we prove that the Maximum\nLikelihood Estimate (MLE) for the parameters of the logistic regression equals\nthe MLE for the corresponding parameters of the log-linear model. We prove\nthat, asymptotically, standard errors for the two sets of parameters are also\nequal. Subsequently, Wald confidence intervals are asymptotically equal. These\nresults demonstrate the extent to which inferences from the log-linear\nframework can be translated to inferences within the logistic regression\nframework, on the magnitude of main effects and interactions. Finally, we prove\nthat the deviance of the log-linear model is equal to the deviance of the\ncorresponding logistic regression, provided that the latter is fitted to a\ndataset where no cell observations are merged when one or more factors in\n$\\mathcal{P} \\setminus \\{ Y \\}$ become obsolete. We illustrate the derived\nresults with the analysis of a real dataset.\n",
"title": "On the correspondence of deviances and maximum likelihood and interval estimates from log-linear to logistic regression modelling"
}
| null | null |
[
"Statistics"
] | null | true | null |
6442
| null |
Validated
| null | null |
null |
{
"abstract": " We consider time-domain digital backpropagation with chromatic dispersion\nfilters jointly optimized and quantized using machine-learning techniques.\nCompared to the baseline implementations, we show improved BER performance and\n>40% power dissipation reductions in 28-nm CMOS.\n",
"title": "ASIC Implementation of Time-Domain Digital Backpropagation with Deep-Learned Chromatic Dispersion Filters"
}
| null | null | null | null | true | null |
6443
| null |
Default
| null | null |
null |
{
"abstract": " We present a formalization of convex polyhedra in the proof assistant Coq.\nThe cornerstone of our work is a complete implementation of the simplex method,\ntogether with the proof of its correctness and termination. This allows us to\ndefine the basic predicates over polyhedra in an effective way (i.e., as\nprograms), and relate them with the corresponding usual logical counterparts.\nTo this end, we make an extensive use of the Boolean reflection methodology.\nThe benefit of this approach is that we can easily derive the proof of several\nfundamental results on polyhedra, such as Farkas' Lemma, the duality theorem of\nlinear programming, and Minkowski's Theorem.\n",
"title": "A formalization of convex polyhedra based on the simplex method"
}
| null | null | null | null | true | null |
6444
| null |
Default
| null | null |
null |
{
"abstract": " We consider the weight spectrum of a class of quasi-perfect binary linear\ncodes with code distance 4. For example, extended Hamming code and Panchenko\ncode are the known members of this class. Also, it is known that in many cases\nPanchenko code has the minimal number of weight 4 codewords. We give exact\nrecursive formulas for the weight spectrum of quasi-perfect codes and their\ndual codes. As an example of application of the weight spectrum we derive a\nlower estimate for the conditional probability of correction of erasure\npatterns of high weights (equal to or greater than code distance).\n",
"title": "Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4"
}
| null | null | null | null | true | null |
6445
| null |
Default
| null | null |
null |
{
"abstract": " Efficient electro-optic (EO) modulators crucially rely on advanced materials\nthat exhibit strong electro-optic activity and that can be integrated into\nhigh-speed and efficient phase shifter structures. In this paper, we\ndemonstrate ultra-high in-device EO figures of merit of up to n3r33 = 2300 pm/V\nachieved in a silicon-organic hybrid (SOH) Mach-Zehnder Modulator (MZM) using\nthe EO chromophore JRD1. This is the highest material-related in-device EO\nfigure of merit hitherto achieved in a high-speed modulator at any operating\nwavelength. The {\\pi}-voltage of the 1.5 mm-long device amounts to 210 mV,\nleading to a voltage-length product of U{\\pi}L = 320 V{\\mu}m - the lowest value\nreported for MZM that are based on low-loss dielectric waveguides. The\nviability of the devices is demonstrated by generating high-quality\non-off-keying (OOK) signals at 40 Gbit/s with Q factors in excess of 8 at a\ndrive voltage as low as 140 mVpp. We expect that efficient high-speed EO\nmodulators will not only have major impact in the field of optical\ncommunications, but will also open new avenues towards ultra-fast\nphotonic-electronic signal processing.\n",
"title": "Ultra-High Electro-Optic Activity Demonstrated in a Silicon-Organic Hybrid (SOH) Modulator"
}
| null | null | null | null | true | null |
6446
| null |
Default
| null | null |
null |
{
"abstract": " How should an AI-based explanation system explain an agent's complex behavior\nto ordinary end users who have no background in AI? Answering this question is\nan active research area, for if an AI-based explanation system could\neffectively explain intelligent agents' behavior, it could enable the end users\nto understand, assess, and appropriately trust (or distrust) the agents\nattempting to help them. To provide insights into this question, we turned to\nhuman expert explainers in the real-time strategy domain, \"shoutcaster\", to\nunderstand (1) how they foraged in an evolving strategy game in real time, (2)\nhow they assessed the players' behaviors, and (3) how they constructed\npertinent and timely explanations out of their insights and delivered them to\ntheir audience. The results provided insights into shoutcasters' foraging\nstrategies for gleaning information necessary to assess and explain the\nplayers; a characterization of the types of implicit questions shoutcasters\nanswered; and implications for creating explanations by using the patterns\n",
"title": "How the Experts Do It: Assessing and Explaining Agent Behaviors in Real-Time Strategy Games"
}
| null | null | null | null | true | null |
6447
| null |
Default
| null | null |
null |
{
"abstract": " In a seminal paper [D. N. Page, Phys. Rev. Lett. 71, 1291 (1993)], Page\nproved that the average entanglement entropy of subsystems of random pure\nstates is $S_{\\rm ave}\\simeq\\ln{\\cal D}_{\\rm A} - (1/2) {\\cal D}_{\\rm\nA}^2/{\\cal D}$ for $1\\ll{\\cal D}_{\\rm A}\\leq\\sqrt{\\cal D}$, where ${\\cal\nD}_{\\rm A}$ and ${\\cal D}$ are the Hilbert space dimensions of the subsystem\nand the system, respectively. Hence, typical pure states are (nearly) maximally\nentangled. We develop tools to compute the average entanglement entropy\n$\\langle S\\rangle$ of all eigenstates of quadratic fermionic Hamiltonians. In\nparticular, we derive exact bounds for the most general translationally\ninvariant models $\\ln{\\cal D}_{\\rm A} - (\\ln{\\cal D}_{\\rm A})^2/\\ln{\\cal D}\n\\leq \\langle S \\rangle \\leq \\ln{\\cal D}_{\\rm A} - [1/(2\\ln2)] (\\ln{\\cal D}_{\\rm\nA})^2/\\ln{\\cal D}$. Consequently we prove that: (i) if the subsystem size is a\nfinite fraction of the system size then $\\langle S\\rangle<\\ln{\\cal D}_{\\rm A}$\nin the thermodynamic limit, i.e., the average over eigenstates of the\nHamiltonian departs from the result for typical pure states, and (ii) in the\nlimit in which the subsystem size is a vanishing fraction of the system size,\nthe average entanglement entropy is maximal, i.e., typical eigenstates of such\nHamiltonians exhibit eigenstate thermalization.\n",
"title": "Entanglement Entropy of Eigenstates of Quadratic Fermionic Hamiltonians"
}
| null | null | null | null | true | null |
6448
| null |
Default
| null | null |
null |
{
"abstract": " We describe a fast closed-loop optimization wavefront shaping system able to\nfocus light through dynamic scattering media. A MEMS-based spatial light\nmodulator (SLM), a fast photodetector and FPGA electronics are combined to\nimplement a closed-loop optimization of a wavefront with a single mode\noptimization rate of 4.1 kHz. The system performances are demonstrated by\nfocusing light through colloidal solutions of TiO2 particles in glycerol with\ntunable temporal stability.\n",
"title": "Focusing light through dynamical samples using fast closed-loop wavefront optimization"
}
| null | null | null | null | true | null |
6449
| null |
Default
| null | null |
null |
{
"abstract": " The curvature estimates of quotient curvature equation do not always exist\neven for convex setting \\cite{GRW}. Thus it is natural question to find other\ntype of elliptic equations possessing curvature estimates. In this paper, we\ndiscuss the existence of curvature estimate for fully nonlinear elliptic\nequations defined by symmetric polynomials, mainlly, the linear combination of\nelementary symmetric polynomials.\n",
"title": "The curvature estimates for convex solutions of some fully nonlinear Hessian type equations"
}
| null | null | null | null | true | null |
6450
| null |
Default
| null | null |
null |
{
"abstract": " Convolutional neural networks have achieved a great success in the recent\nyears. Although, the way to maximize the performance of the convolutional\nneural networks still in the beginning. Furthermore, the optimization of the\nsize and the time that need to train the convolutional neural networks is very\nfar away from reaching the researcher's ambition. In this paper, we proposed a\nnew convolutional neural network that combined several techniques to boost the\noptimization of the convolutional neural network in the aspects of speed and\nsize. As we used our previous model Residual-CNDS (ResCNDS), which solved the\nproblems of slower convergence, overfitting, and degradation, and compressed\nit. The outcome model called Residual-Squeeze-CNDS (ResSquCNDS), which we\ndemonstrated on our sold technique to add residual learning and our model of\ncompressing the convolutional neural networks. Our model of compressing adapted\nfrom the SQUEEZENET model, but our model is more generalizable, which can be\napplied almost to any neural network model, and fully integrated into the\nresidual learning, which addresses the problem of the degradation very\nsuccessfully. Our proposed model trained on very large-scale MIT\nPlaces365-Standard scene datasets, which backing our hypothesis that the new\ncompressed model inherited the best of the previous ResCNDS8 model, and almost\nget the same accuracy in the validation Top-1 and Top-5 with 87.64% smaller in\nsize and 13.33% faster in the training time.\n",
"title": "The Compressed Model of Residual CNDS"
}
| null | null | null | null | true | null |
6451
| null |
Default
| null | null |
null |
{
"abstract": " In this paper, we prove formulas that represent two-pointed Gromov-Witten\ninvariant <O_{h^a}O_{h^b}>_{0,d} of projective hypersurfaces with d=1,2 in\nterms of Chow ring of Mbar_{0,2}(P^{N-1},d), the moduli spaces of stable maps\nfrom genus 0 stable curves to projective space P^{N-1}. Our formulas are based\non representation of the intersection number w(O_{h^a}O_{h^b})_{0,d}, which was\nintroduced by Jinzenji, in terms of Chow ring of Mp_{0,2}(N,d), the moduli\nspace of quasi maps from P^1 to P^{N-1} with two marked points. In order to\nprove our formulas, we use the results on Chow ring of Mbar_{0,2}(P^{N-1},d),\nthat were derived by A. Mustata and M. Mustata. We also present explicit toric\ndata of Mp_{0,2}(N,d) and prove relations of Chow ring of Mp_{0,2}(N,d).\n",
"title": "Chow Rings of Mp_{0,2}(N,d) and Mbar_{0,2}(P^{N-1},d) and Gromov-Witten Invariants of Projective Hypersurfaces of Degree 1 and 2"
}
| null | null | null | null | true | null |
6452
| null |
Default
| null | null |
null |
{
"abstract": " Due to increasing urban population and growing number of motor vehicles,\ntraffic congestion is becoming a major problem of the 21st century. One of the\nmain reasons behind traffic congestion is accidents which can not only result\nin casualties and losses for the participants, but also in wasted and lost time\nfor the others that are stuck behind the wheels. Early detection of an accident\ncan save lives, provides quicker road openings, hence decreases wasted time and\nresources, and increases efficiency. In this study, we propose a preliminary\nreal-time autonomous accident-detection system based on computational\nintelligence techniques. Istanbul City traffic-flow data for the year 2015 from\nvarious sensor locations are populated using big data processing methodologies.\nThe extracted features are then fed into a nearest neighbor model, a regression\ntree, and a feed-forward neural network model. For the output, the possibility\nof an occurrence of an accident is predicted. The results indicate that even\nthough the number of false alarms dominates the real accident cases, the system\ncan still provide useful information that can be used for status verification\nand early reaction to possible accidents.\n",
"title": "A Real-Time Autonomous Highway Accident Detection Model Based on Big Data Processing and Computational Intelligence"
}
| null | null | null | null | true | null |
6453
| null |
Default
| null | null |
null |
{
"abstract": " We analyze a general class of difference operators $H_\\varepsilon =\nT_\\varepsilon + V_\\varepsilon$ on $\\ell^2(\\varepsilon \\mathbb{Z}^d)$, where\n$V_\\varepsilon$ is a one-well potential and $\\varepsilon$ is a small parameter.\nWe construct formal asymptotic expansions of WKB-type for eigenfunctions\nassociated with the low lying eigenvalues of $H_\\varepsilon$. These are\nobtained from eigenfunctions or quasimodes for the operator $H_\\varepsilon$,\nacting on $L^2(\\mathbb{R}^d)$, via restriction to the lattice\n$\\varepsilon\\mathbb{Z}^d$.\n",
"title": "Asymptotic Eigenfunctions for a class of Difference Operators"
}
| null | null | null | null | true | null |
6454
| null |
Default
| null | null |
null |
{
"abstract": " Despite a well-ordered pyrochlore crystal structure and strong magnetic\ninteractions between the Dy$^{3+}$ or Ho$^{3+}$ ions, no long range magnetic\norder has been detected in the pyrochlore titanates Ho$_2$Ti$_2$O$_7$ and\nDy$_2$Ti$_2$O$_7$. To explore the actual magnetic phase formed by cooling these\nmaterials, we measure their magnetization dynamics using toroidal,\nboundary-free magnetization transport techniques. We find that the dynamical\nmagnetic susceptibility of both compounds has the same distinctive\nphenomenology, that is indistinguishable in form from that of the dielectric\npermittivity of dipolar glass-forming liquids. Moreover, Ho$_2$Ti$_2$O$_7$ and\nDy$_2$Ti$_2$O$_7$ both exhibit microscopic magnetic relaxation times that\nincrease along the super-Arrhenius trajectories analogous to those observed in\nglass-forming dipolar liquids. Thus, upon cooling below about 2K,\nDy$_2$Ti$_2$O$_7$ and Ho$_2$Ti$_2$O$_7$ both appear to enter the same magnetic\nstate exhibiting the characteristics of a glass-forming spin-liquid.\n",
"title": "Common Glass-Forming Spin-Liquid State in the Pyrochlore Magnets Dy$_2$Ti$_2$O$_7$ and Ho$_2$Ti$_2$O$_7$"
}
| null | null |
[
"Physics"
] | null | true | null |
6455
| null |
Validated
| null | null |
null |
{
"abstract": " The students are introduced to navigation in general and the longitude\nproblem in particular. A few videos provide insight into scientific and\nhistorical facts related to the issue. Then, the students learn in two steps\nhow longitude can be derived from time measurements. They first build a\nLongitude Clock that visualises the math behind the concept. They use it to\ndetermine the longitudes corresponding to five time measurements. In the second\nstep, they assume the position of James Cook's navigator and plot the location\nof seven destinations on Cook's second voyage between 1772 and 1775.\n",
"title": "Britannia Rule the Waves"
}
| null | null | null | null | true | null |
6456
| null |
Default
| null | null |
null |
{
"abstract": " We introduce Error Forward-Propagation, a biologically plausible mechanism to\npropagate error feedback forward through the network. Architectural constraints\non connectivity are virtually eliminated for error feedback in the brain;\nsystematic backward connectivity is not used or needed to deliver error\nfeedback. Feedback as a means of assigning credit to neurons earlier in the\nforward pathway for their contribution to the final output is thought to be\nused in learning in the brain. How the brain solves the credit assignment\nproblem is unclear. In machine learning, error backpropagation is a highly\nsuccessful mechanism for credit assignment in deep multilayered networks.\nBackpropagation requires symmetric reciprocal connectivity for every neuron.\nFrom a biological perspective, there is no evidence of such an architectural\nconstraint, which makes backpropagation implausible for learning in the brain.\nThis architectural constraint is reduced with the use of random feedback\nweights. Models using random feedback weights require backward connectivity\npatterns for every neuron, but avoid symmetric weights and reciprocal\nconnections. In this paper, we practically remove this architectural\nconstraint, requiring only a backward loop connection for effective error\nfeedback. We propose reusing the forward connections to deliver the error\nfeedback by feeding the outputs into the input receiving layer. This mechanism,\nError Forward-Propagation, is a plausible basis for how error feedback occurs\ndeep in the brain independent of and yet in support of the functionality\nunderlying intricate network architectures. We show experimentally that\nrecurrent neural networks with two and three hidden layers can be trained using\nError Forward-Propagation on the MNIST and Fashion MNIST datasets, achieving\n$1.90\\%$ and $11\\%$ generalization errors respectively.\n",
"title": "Error Forward-Propagation: Reusing Feedforward Connections to Propagate Errors in Deep Learning"
}
| null | null | null | null | true | null |
6457
| null |
Default
| null | null |
null |
{
"abstract": " Logical models offer a simple but powerful means to understand the complex\ndynamics of biochemical regulation, without the need to estimate kinetic\nparameters. However, even simple automata components can lead to collective\ndynamics that are computationally intractable when aggregated into networks. In\nprevious work we demonstrated that automata network models of biochemical\nregulation are highly canalizing, whereby many variable states and their\ngroupings are redundant (Marques-Pita and Rocha, 2013). The precise charting\nand measurement of such canalization simplifies these models, making even very\nlarge networks amenable to analysis. Moreover, canalization plays an important\nrole in the control, robustness, modularity and criticality of Boolean network\ndynamics, especially those used to model biochemical regulation (Gates and\nRocha, 2016; Gates et al., 2016; Manicka, 2017). Here we describe a new\npublicly-available Python package that provides the necessary tools to extract,\nmeasure, and visualize canalizing redundancy present in Boolean network models.\nIt extracts the pathways most effective in controlling dynamics in these\nmodels, including their effective graph and dynamics canalizing map, as well as\nother tools to uncover minimum sets of control variables.\n",
"title": "CANA: A python package for quantifying control and canalization in Boolean Networks"
}
| null | null | null | null | true | null |
6458
| null |
Default
| null | null |
null |
{
"abstract": " We propose a family of variational approximations to Bayesian posterior\ndistributions, called $\\alpha$-VB, with provable statistical guarantees. The\nstandard variational approximation is a special case of $\\alpha$-VB with\n$\\alpha=1$. When $\\alpha \\in(0,1]$, a novel class of variational inequalities\nare developed for linking the Bayes risk under the variational approximation to\nthe objective function in the variational optimization problem, implying that\nmaximizing the evidence lower bound in variational inference has the effect of\nminimizing the Bayes risk within the variational density family. Operating in a\nfrequentist setup, the variational inequalities imply that point estimates\nconstructed from the $\\alpha$-VB procedure converge at an optimal rate to the\ntrue parameter in a wide range of problems. We illustrate our general theory\nwith a number of examples, including the mean-field variational approximation\nto (low)-high-dimensional Bayesian linear regression with spike and slab\npriors, mixture of Gaussian models, latent Dirichlet allocation, and (mixture\nof) Gaussian variational approximation in regular parametric models.\n",
"title": "$α$-Variational Inference with Statistical Guarantees"
}
| null | null | null | null | true | null |
6459
| null |
Default
| null | null |
null |
{
"abstract": " In the past decades, the phenomenal progress in the development of\nultraintense lasers has opened up many exciting new frontiers in laser matter\nphysics, including laser plasma ion acceleration. Currently a major challenge\nin this frontier is to find simple methods to stably produce monoenergetic ion\nbeams with sufficient charge for real applications. Here, we propose a novel\nscheme using a two color laser tweezer to fulfill this goal. In this scheme,\ntwo circularly polarized lasers with different wavelengths collide right on a\nthin nano-foil target containing mixed ion species. The radiation pressure of\nthis laser pair acts like a tweezer to pinch and fully drag the electrons out,\nforming a stable uniform accelerating field for the ions. Scaling laws and\nthree-dimensional particle-in-cell simulations confirm that high energy\n(10-1000 MeV) high charge ($\\sim 10^{10}$) proton beams with narrow energy\nspread ($\\sim4\\%-20\\%$) can be obtained by commercially available lasers. Such\na scheme may open up a new route for compact high quality ion sources for\nvarious applications.\n",
"title": "Stable monoenergetic ion acceleration by a two color laser tweezer"
}
| null | null | null | null | true | null |
6460
| null |
Default
| null | null |
null |
{
"abstract": " We demonstrated a novel on-chip polarization controlling structure,\nfabricated by standard 0.18-um foundry technology. It achieved polarization\nrotation with a size of 0.726 um * 5.27 um and can be easily extended into\ndynamic polarization controllers.\n",
"title": "Experimental demonstration of an ultra-compact on-chip polarization controlling structure"
}
| null | null | null | null | true | null |
6461
| null |
Default
| null | null |
null |
{
"abstract": " In the recent literature, \"end-to-end\" speech systems often refer to\nletter-based acoustic models trained in a sequence-to-sequence manner, either\nvia a recurrent model or via a structured output learning approach (such as\nCTC). In contrast to traditional phone (or senone)-based approaches, these\n\"end-to-end'' approaches alleviate the need of word pronunciation modeling, and\ndo not require a \"forced alignment\" step at training time. Phone-based\napproaches remain however state of the art on classical benchmarks. In this\npaper, we propose a letter-based speech recognition system, leveraging a\nConvNet acoustic model. Key ingredients of the ConvNet are Gated Linear Units\nand high dropout. The ConvNet is trained to map audio sequences to their\ncorresponding letter transcriptions, either via a classical CTC approach, or\nvia a recent variant called ASG. Coupled with a simple decoder at inference\ntime, our system matches the best existing letter-based systems on WSJ (in word\nerror rate), and shows near state of the art performance on LibriSpeech.\n",
"title": "Letter-Based Speech Recognition with Gated ConvNets"
}
| null | null |
[
"Computer Science"
] | null | true | null |
6462
| null |
Validated
| null | null |
null |
{
"abstract": " In the study of the human connectome, the vertices and the edges of the\nnetwork of the human brain are analyzed: the vertices of the graphs are the\nanatomically identified gray matter areas of the subjects; this set is exactly\nthe same for all the subjects. The edges of the graphs correspond to the axonal\nfibers, connecting these areas. In the biological applications of graph theory,\nit happens very rarely that scientists examine numerous large graphs on the\nvery same, labeled vertex set. Exactly this is the case in the study of the\nconnectomes. Because of the particularity of these sets of graphs, novel,\nrobust methods need to be developed for their analysis. Here we introduce the\nnew method of the Frequent Network Neighborhood Mapping for the connectome,\nwhich serves as a robust identification of the neighborhoods of given vertices\nof special interest in the graph. We apply the novel method for mapping the\nneighborhoods of the human hippocampus and discover strong statistical\nasymmetries between the connectomes of the sexes, computed from the Human\nConnectome Project. We analyze 413 braingraphs, each with 463 nodes. We show\nthat the hippocampi of men have much more significantly frequent neighbor sets\nthan women; therefore, in a sense, the connections of the hippocampi are more\nregularly distributed in men and more varied in women. Our results are in\ncontrast to the volumetric studies of the human hippocampus, where it was shown\nthat the relative volume of the hippocampus is the same in men and women.\n",
"title": "The Frequent Network Neighborhood Mapping of the Human Hippocampus Shows Much More Frequent Neighbor Sets in Males Than in Females"
}
| null | null |
[
"Quantitative Biology"
] | null | true | null |
6463
| null |
Validated
| null | null |
null |
{
"abstract": " We investigate the computational complexity of various problems for simple\nrecurrent neural networks (RNNs) as formal models for recognizing weighted\nlanguages. We focus on the single-layer, ReLU-activation, rational-weight RNNs\nwith softmax, which are commonly used in natural language processing\napplications. We show that most problems for such RNNs are undecidable,\nincluding consistency, equivalence, minimization, and the determination of the\nhighest-weighted string. However, for consistent RNNs the last problem becomes\ndecidable, although the solution length can surpass all computable bounds. If\nadditionally the string is limited to polynomial length, the problem becomes\nNP-complete and APX-hard. In summary, this shows that approximations and\nheuristic algorithms are necessary in practical applications of those RNNs.\n",
"title": "Recurrent Neural Networks as Weighted Language Recognizers"
}
| null | null | null | null | true | null |
6464
| null |
Default
| null | null |
null |
{
"abstract": " Graphical user interfaces (GUIs) are integral parts of software systems that\nrequire interactions from their users. Software testers have paid special\nattention to GUI testing in the last decade, and have devised techniques that\nare effective in finding several kinds of GUI errors. However, the introduction\nof new types of interactions in GUIs (e.g., direct manipulation) presents new\nkinds of errors that are not targeted by current testing techniques. We believe\nthat to advance GUI testing, the community needs a comprehensive and high level\nGUI fault model, which incorporates all types of interactions. The work\ndetailed in this paper establishes 4 contributions: 1) A GUI fault model\ndesigned to identify and classify GUI faults. 2) An empirical analysis for\nassessing the relevance of the proposed fault model against failures found in\nreal GUIs. 3) An empirical assessment of two GUI testing tools (i.e. GUITAR and\nJubula) against those failures. 4) GUI mutants we've developed according to our\nfault model. These mutants are freely available and can be reused by developers\nfor benchmarking their GUI testing tools.\n",
"title": "Classifying and Qualifying GUI Defects"
}
| null | null | null | null | true | null |
6465
| null |
Default
| null | null |
null |
{
"abstract": " The human brain network is modular--comprised of communities of tightly\ninterconnected nodes. This network contains local hubs, which have many\nconnections within their own communities, and connector hubs, which have\nconnections diversely distributed across communities. A mechanistic\nunderstanding of these hubs and how they support cognition has not been\ndemonstrated. Here, we leveraged individual differences in hub connectivity and\ncognition. We show that a model of hub connectivity accurately predicts the\ncognitive performance of 476 individuals in four distinct tasks. Moreover,\nthere is a general optimal network structure for cognitive\nperformance--individuals with diversely connected hubs and consequent modular\nbrain networks exhibit increased cognitive performance, regardless of the task.\nCritically, we find evidence consistent with a mechanistic model in which\nconnector hubs tune the connectivity of their neighbors to be more modular\nwhile allowing for task appropriate information integration across communities,\nwhich increases global modularity and cognitive performance.\n",
"title": "A mechanistic model of connector hubs, modularity, and cognition"
}
| null | null | null | null | true | null |
6466
| null |
Default
| null | null |
null |
{
"abstract": " We present a collection of 450 598 eclipsing and ellipsoidal binary systems\ndetected in the OGLE fields toward the Galactic bulge. The collection consists\nof binary systems of all types: detached, semi-detached, and contact eclipsing\nbinaries, RS CVn stars, cataclysmic variables, HW Vir binaries, double periodic\nvariables, and even planetary transits. For all stars we provide the I- and\nV-band time-series photometry obtained during the OGLE-II, OGLE-III, and\nOGLE-IV surveys. We discuss methods used to identify binary systems in the OGLE\ndata and present several objects of particular interest.\n",
"title": "The OGLE Collection of Variable Stars. Over 450 000 Eclipsing and Ellipsoidal Binary Systems Toward the Galactic Bulge"
}
| null | null |
[
"Physics"
] | null | true | null |
6467
| null |
Validated
| null | null |
null |
{
"abstract": " The discrete moment problem is a foundational problem in distribution-free\nrobust optimization, where the goal is to find a worst-case distribution that\nsatisfies a given set of moments. This paper studies the discrete moment\nproblems with additional \"shape constraints\" that guarantee the worst case\ndistribution is either log-concave or has an increasing failure rate. These\nclasses of shape constraints have not previously been studied in the\nliterature, in part due to their inherent nonconvexities. Nonetheless, these\nclasses of distributions are useful in practice. We characterize the structure\nof optimal extreme point distributions by developing new results in reverse\nconvex optimization, a lesser-known tool previously employed in designing\nglobal optimization algorithms. We are able to show, for example, that an\noptimal extreme point solution to a moment problem with $m$ moments and\nlog-concave shape constraints is piecewise geometric with at most $m$ pieces.\nMoreover, this structure allows us to design an exact algorithm for computing\noptimal solutions in a low-dimensional space of parameters. Moreover, We\ndescribe a computational approach to solving these low-dimensional problems,\nincluding numerical results for a representative set of instances.\n",
"title": "The discrete moment problem with nonconvex shape constraints"
}
| null | null | null | null | true | null |
6468
| null |
Default
| null | null |
null |
{
"abstract": " A Pilot unit of a closed loop gas (CLS) mixing and distribution system for\nthe INO project was designed and is being operated with (1.8 x 1.9) m^2 glass\nRPCs (Resistive Plate Chamber). The performance of an RPC depends on the\nquality and quantity of gas mixture being used, a number of studies on\ncontrolling the flow and optimization of the gas mixture is being carried out.\nIn this paper the effect of capillary as a dynamic impedance element on the\ndifferential pressure across RPC detector in a closed loop gas system is being\nhighlighted. The flow versus the pressure variation with different types of\ncapillaries and also with different types of gasses that are being used in an\nRPC is presented. An attempt is also made to measure the transient time of the\ngas flow through the capillary.\n",
"title": "Some studies using capillary for flow control in a closed loop gas recirculation system"
}
| null | null | null | null | true | null |
6469
| null |
Default
| null | null |
null |
{
"abstract": " We give a new analysis of a tuning problem in music theory, pertaining\nspecifically to the approximation of harmonics on a two-dimensional keyboard.\nWe formulate the question as a linear programming problem on families of\nconstraints and provide exact solutions for many new keyboard dimensions. We\nalso show that an optimal tuning for harmonic approximation can be obtained for\nany keyboard of given width, provided sufficiently many rows of octaves.\n",
"title": "Optimal Tuning of Two-Dimensional Keyboards"
}
| null | null | null | null | true | null |
6470
| null |
Default
| null | null |
null |
{
"abstract": " We consider a dual-hop wireless network where an energy constrained relay\nnode first harvests energy through the received radio-frequency signal from the\nsource, and then uses the harvested energy to forward the source's information\nto the destination node. The throughput and delay metrics are investigated for\na decode-and-forward relaying mechanism at finite blocklength regime and\ndelay-limited transmission mode. We consider ultra-reliable communication\nscenarios under discussion for the next fifth-generation of wireless systems,\nwith error and latency constraints. The impact on these metrics of the\nblocklength, information bits, and relay position is investigated.\n",
"title": "Ultra Reliable Short Message Relaying with Wireless Power Transfer"
}
| null | null | null | null | true | null |
6471
| null |
Default
| null | null |
null |
{
"abstract": " Trust in publicly verifiable Certificate Transparency (CT) logs is reduced\nthrough cryptography, gossip, auditing, and monitoring. The role of a monitor\nis to observe each and every log entry, looking for suspicious certificates\nthat interest the entity running the monitor. While anyone can run a monitor,\nit requires continuous operation and copies of the logs to be inspected. This\nhas lead to the emergence of monitoring-as-a-service: a trusted party runs the\nmonitor and provides registered subjects with selective certificate\nnotifications, e.g., \"notify me of all foo.com certificates\". We present a\nCT/bis extension for verifiable light-weight monitoring that enables subjects\nto verify the correctness of such notifications, reducing the trust that is\nplaced in these monitors. Our extension supports verifiable monitoring of\nwild-card domains and piggybacks on CT's existing gossip-audit security model.\n",
"title": "Verifiable Light-Weight Monitoring for Certificate Transparency Logs"
}
| null | null | null | null | true | null |
6472
| null |
Default
| null | null |
null |
{
"abstract": " Chainspace is a decentralized infrastructure, known as a distributed ledger,\nthat supports user defined smart contracts and executes user-supplied\ntransactions on their objects. The correct execution of smart contract\ntransactions is verifiable by all. The system is scalable, by sharding state\nand the execution of transactions, and using S-BAC, a distributed commit\nprotocol, to guarantee consistency. Chainspace is secure against subsets of\nnodes trying to compromise its integrity or availability properties through\nByzantine Fault Tolerance (BFT), and extremely high-auditability,\nnon-repudiation and `blockchain' techniques. Even when BFT fails, auditing\nmechanisms are in place to trace malicious participants. We present the design,\nrationale, and details of Chainspace; we argue through evaluating an\nimplementation of the system about its scaling and other features; we\nillustrate a number of privacy-friendly smart contracts for smart metering,\npolling and banking and measure their performance.\n",
"title": "Chainspace: A Sharded Smart Contracts Platform"
}
| null | null |
[
"Computer Science"
] | null | true | null |
6473
| null |
Validated
| null | null |
null |
{
"abstract": " This note deals with certain properties of convex functions. We provide\nresults on the convexity of the set of minima of these functions, the behaviour\nof their subgradient set under restriction, and optimization of these functions\nover an affine subspace.\n",
"title": "On Certain Properties of Convex Functions"
}
| null | null | null | null | true | null |
6474
| null |
Default
| null | null |
null |
{
"abstract": " In this paper we investigate the multiwavelengths properties of the magnetic\nearly B-type star HR7355. We present its radio light curves at several\nfrequencies, taken with the Jansky Very Large Array, and X-ray spectra, taken\nwith the XMM X-ray telescope. Modeling of the radio light curves for the Stokes\nI and V provides a quantitative analysis of the HR7355 magnetosphere. A\ncomparison between HR7355 and a similar analysis for the Ap star CUVir, allows\nus to study how the different physical parameters of the two stars affect the\nstructure of the respective magnetospheres where the non-thermal electrons\noriginate. Our model includes a cold thermal plasma component that accumulates\nat high magnetic latitudes that influences the radio regime, but does not give\nrise to X-ray emission. Instead, the thermal X-ray emission arises from shocks\ngenerated by wind stream collisions close to the magnetic equatorial plane. The\nanalysis of the X-ray spectrum of HR7355 also suggests the presence of a\nnon-thermal radiation. Comparison between the spectral index of the power-law\nX-ray energy distribution with the non-thermal electron energy distribution\nindicates that the non-thermal X-ray component could be the auroral signature\nof the non-thermal electrons that impact the stellar surface, the same\nnon-thermal electrons that are responsible for the observed radio emission. On\nthe basis of our analysis, we suggest a novel model that simultaneously\nexplains the X-ray and the radio features of HR7355 and is likely relevant for\nmagnetospheres of other magnetic early type stars.\n",
"title": "The detection of variable radio emission from the fast rotating magnetic hot B-star HR7355 and evidence for its X-ray aurorae"
}
| null | null | null | null | true | null |
6475
| null |
Default
| null | null |
null |
{
"abstract": " For many technological applications of superconductors the performance of a\nmaterial is determined by the highest current it can carry losslessly - the\ncritical current. In turn, the critical current can be controlled by adding\nnon-superconducting defects in the superconductor matrix. Here we report on\nsystematic comparison of different local and global optimization strategies to\npredict optimal structures of pinning centers leading to the highest possible\ncritical currents. We demonstrate performance of these methods for a\nsuperconductor with randomly placed spherical, elliptical, and columnar\ndefects.\n",
"title": "In silico optimization of critical currents in superconductors"
}
| null | null | null | null | true | null |
6476
| null |
Default
| null | null |
null |
{
"abstract": " The basin of attraction of a uniformly attracting sequence of holomorphic\nautomorphisms that agree to a certain order in the common fixed point, is\nbiholomorphic to $\\mathbb{C}^n$. We also give sufficient estimates how large\nthis order has to be.\n",
"title": "Attracting sequences of holomorphic automorphisms that agree to a certain order"
}
| null | null | null | null | true | null |
6477
| null |
Default
| null | null |
null |
{
"abstract": " Recent LENS experiment on a 3D Fermi gas has reported a negative effective\nmass ($m^*<0$) of Fermi polarons in the strongly repulsive regime. There\nnaturally arise a question whether the negative $m^*$ is a precursor of the\ninstability towards phase separation (or itinerant ferromagnetism). In this\nwork, we make use of the exact solutions to study the ground state and\nexcitation properties of repulsive Fermi polarons in 1D, which can also exhibit\na negative $m^*$ in the super Tonks-Girardeau regime. By analyzing the total\nspin, quasi-momentum distribution and pair correlations, we conclude that the\nnegative $m^*$ is irrelevant to the instability towards ferromagnetism or phase\nseparation, but rather an intrinsic feature of collective excitations for\nfermions in the strongly repulsive regime. Surprisingly, for large and negative\n$m^*$, such excitation is accompanied with a spin density modulation when the\nmajority fermions move closer to the impurity rather than being repelled far\naway, contrary to the picture of phase separation. These results suggest an\nalternative interpretation of negative $m^*$ as observed in recent LENS\nexperiment.\n",
"title": "Repulsive Fermi polarons with negative effective mass"
}
| null | null |
[
"Physics"
] | null | true | null |
6478
| null |
Validated
| null | null |
null |
{
"abstract": " In this paper, entropies, including measure-theoretic entropy and topological\nentropy, are considered for random $\\mathbb{Z}^k$-actions which are generated\nby random compositions of the generators of $\\mathbb{Z}^k$-actions. Applying\nPesin's theory for commutative diffeomorphisms we obtain a measure-theoretic\nentropy formula of $C^{2}$ random $\\mathbb{Z}^k$-actions via the Lyapunov\nspectra of the generators. Some formulas and bounds of topological entropy for\ncertain random $\\mathbb{Z}^k$(or $\\mathbb{Z}_+^k$ )-actions generated by more\ngeneral maps, such as Lipschitz maps, continuous maps on finite graphs and\n$C^{1}$ expanding maps, are also obtained. Moreover, as an application, we give\na formula of Friedland's entropy for certain $C^{2}$ $\\mathbb{Z}^k$-actions.\n",
"title": "Entropy Formula for Random $\\mathbb{Z}^k$-actions"
}
| null | null | null | null | true | null |
6479
| null |
Default
| null | null |
null |
{
"abstract": " We study a question of presence of Kohn points, yielding at low temperatures\nnon-analytic momentum dependence of magnetic susceptibility near its maximum,\nin electronic spectum of some three-dimensional systems. In particular, we\nconsider one-band model on face centered cubic lattice with hopping between\nnearest and next-nearest neighbors, which models some aspects of the dispersion\nof ZrZn$_2$, and the two-band model on body centered cubic lattice, modeling\nthe dispersion of chromium. For the former model it is shown that Kohn points\nyielding maxima of susceptibility exist in a certain (sufficiently wide) region\nof electronic concentrations; the dependence of the wave vectors, corresponding\nto the maxima, on the chemical potential is investigated. For the two-band\nmodel we show existence of the lines of Kohn points, yielding maximum of the\nsusceptibility, which position agrees with the results of band structure\ncalculations and experimental data on the wave vector of antiferromagnetism of\nchromium.\n",
"title": "Kohn anomalies in momentum dependence of magnetic susceptibility of some three-dimensional systems"
}
| null | null |
[
"Physics"
] | null | true | null |
6480
| null |
Validated
| null | null |
null |
{
"abstract": " Extending the notion of maximal green sequences to an abelian category, we\ncharacterize the stability functions, as defined by Rudakov, that induce a\nmaximal green sequence in an abelian length category. Furthermore, we use\n$\\tau$-tilting theory to give a description of the wall and chamber structure\nof any finite dimensional algebra. Finally we introduce the notion of green\npaths in the wall and chamber structure of an algebra and show that green paths\nserve as geometrical generalization of maximal green sequences in this context.\n",
"title": "Stability conditions, $τ$-tilting Theory and Maximal Green Sequences"
}
| null | null | null | null | true | null |
6481
| null |
Default
| null | null |
null |
{
"abstract": " Using a shallow water model with time-dependent forcing we show that the peak\nof an exoplanet thermal phase curve is, in general, offset from secondary\neclipse when the planet is rotating. That is, the planetary hot-spot is offset\nfrom the point of maximal heating (the substellar point) and may lead or lag\nthe forcing; the extent and sign of the offset is a function of both the\nrotation rate and orbital period of the planet. We also find that the system\nreaches a steady-state in the reference frame of the moving forcing. The model\nis an extension of the well studied Matsuno-Gill model into a full spherical\ngeometry and with a planetary-scale translating forcing representing the\ninsolation received on an exoplanet from a host star.\nThe speed of the gravity waves in the model is shown to be a key metric in\nevaluating the phase curve offset. If the velocity of the substellar point\n(relative to the planet's surface) exceeds that of the gravity waves then the\nhotspot will lag the substellar point, as might be expected by consideration of\nforced gravity wave dynamics. However, when the substellar point is moving\nslower than the internal wavespeed of the system the hottest point can lead the\npassage of the forcing. We provide an interpretation of this result by\nconsideration of the Rossby and Kelvin wave dynamics as well as, in the very\nslowly rotating case, a one-dimensional model that yields an analytic solution.\nFinally, we consider the inverse problem of constraining planetary rotation\nrate from an observed phase curve.\n",
"title": "The thermal phase curve offset on tidally- and non-tidally-locked exoplanets: A shallow water model"
}
| null | null |
[
"Physics"
] | null | true | null |
6482
| null |
Validated
| null | null |
null |
{
"abstract": " The asymptotic solution to the problem of comparing the means of two\nheteroscedastic populations, based on two random samples from the populations,\nhinges on the pivot underpinning the construction of the confidence interval\nand the test statistic being asymptotically standard Normal, which is known to\nhappen if the two samples are independent and the ratio of the sample sizes\nconverges to a finite positive number. This restriction on the asymptotic\nbehavior of the ratio of the sample sizes carries the risk of rendering the\nasymptotic justification of the finite sample approximation invalid. It turns\nout that neither the restriction on the asymptotic behavior of the ratio of the\nsample sizes nor the assumption of cross sample independence is necessary for\nthe pivotal convergence in question to take place. If the joint distribution of\nthe standardized sample means converges to a spherically symmetric\ndistribution, then that distribution must be bivariate standard Normal (which\ncan happen without the assumption of cross sample independence), and the\naforesaid pivotal convergence holds.\n",
"title": "On Asymptotic Standard Normality of the Two Sample Pivot"
}
| null | null |
[
"Mathematics",
"Statistics"
] | null | true | null |
6483
| null |
Validated
| null | null |
null |
{
"abstract": " For grain growth to proceed effectively and lead to planet formation a number\nof barriers to growth must be overcome. One such barrier, relevant for compact\ngrains in the inner regions of the disc, is the `bouncing barrier' in which\nlarge grains ($\\sim$ mm size) tend to bounce off each other rather than\nsticking. However, by maintaining a population of small grains it has been\nsuggested that cm-size particles may grow rapidly by sweeping up these small\ngrains. We present the first numerically resolved investigation into the\nconditions under which grains may be lucky enough to grow beyond the bouncing\nbarrier by a series of rare collisions leading to growth (so-called\n`breakthrough'). Our models support previous results, and show that in simple\nmodels breakthrough requires the mass ratio at which high velocity collisions\ntransition to growth instead of causing fragmentation to be low, $\\phi \\lesssim\n50$. However, in models that take into account the dependence of the\nfragmentation threshold on mass-ratio, we find breakthrough occurs more\nreadily, even if mass transfer is relatively inefficient. This suggests that\nbouncing may only slow down growth, rather than preventing growth beyond a\nthreshold barrier. However, even when growth beyond the bouncing barrier is\npossible, radial drift will usually prevent growth to arbitrarily large sizes.\n",
"title": "Breakthrough revisited: investigating the requirements for growth of dust beyond the bouncing barrier"
}
| null | null |
[
"Physics"
] | null | true | null |
6484
| null |
Validated
| null | null |
null |
{
"abstract": " The peculiar band structure of semimetals exhibiting Dirac and Weyl crossings\ncan lead to spectacular electronic properties such as large mobilities\naccompanied by extremely high magnetoresistance. In particular, two closely\nneighbouring Weyl points of the same chirality are protected from annihilation\nby structural distortions or defects, thereby significantly reducing the\nscattering probability between them. Here we present the electronic properties\nof the transition metal diphosphides, WP2 and MoP2, that are type-II Weyl\nsemimetals with robust Weyl points. We present transport and angle resolved\nphotoemission spectroscopy measurements, and first principles calculations. Our\nsingle crystals of WP2 display an extremely low residual low-temperature\nresistivity of 3 nohm-cm accompanied by an enormous and highly anisotropic\nmagnetoresistance above 200 million % at 63 T and 2.5 K. These properties are\nlikely a consequence of the novel Weyl fermions expressed in this compound. We\nobserve a large suppression of charge carrier backscattering in WP2 from\ntransport measurements.\n",
"title": "Extremely high magnetoresistance and conductivity in the type-II Weyl semimetals WP2 and MoP2"
}
| null | null | null | null | true | null |
6485
| null |
Default
| null | null |
null |
{
"abstract": " The stochastic $R$ matrix for $U_q(A^{(1)}_n)$ introduced recently gives rise\nto an integrable zero range process of $n$ classes of particles in one\ndimension. For $n=2$ we investigate how finitely many first class particles\nfixed as defects influence the grand canonical ensemble of the second class\nparticles. By using the matrix product stationary probabilities involving\ninfinite products of $q$-bosons, exact formulas are derived for the local\ndensity and current of the second class particles in the large volume limit.\n",
"title": "Density and current profiles in $U_q(A^{(1)}_2)$ zero range process"
}
| null | null | null | null | true | null |
6486
| null |
Default
| null | null |
null |
{
"abstract": " We have investigated the crystal structure of LaOBiPbS3 using neutron\ndiffraction and synchrotron X-ray diffraction. From structural refinements, we\nfound that the two metal sites, occupied by Bi and Pb, were differently\nsurrounded by the sulfur atoms. Calculated bond valence sum suggested that one\nmetal site was nearly trivalent and the other was nearly divalent. Neutron\ndiffraction also revealed site selectivity of Bi and Pb in the LaOBiPbS3\nstructure. These results suggested that the crystal structure of LaOBiPbS3 can\nbe regarded as alternate stacks of the rock-salt-type Pb-rich sulfide layers\nand the LaOBiS2-type Bi-rich layers. From band calculations for an ideal\n(LaOBiS2)(PbS) system, we found that the S bands of the PbS layer were\nhybridized with the Bi bands of the BiS plane at around the Fermi energy, which\nresulted in the electronic characteristics different from that of LaOBiS2.\nStacking the rock-salt type sulfide (chalcogenide) layers and the BiS2-based\nlayered structure could be a new strategy to exploration of new BiS2-based\nlayered compounds, exotic two-dimensional electronic states, or novel\nfunctionality.\n",
"title": "Crystal structure, site selectivity, and electronic structure of layered chalcogenide LaOBiPbS3"
}
| null | null | null | null | true | null |
6487
| null |
Default
| null | null |
null |
{
"abstract": " We considered a generic case of pre-transitional materials with static\nstress-generating defects, dislocations and coherent nano-precipitates, at\ntemperatures close but above the starting temperature of martensitic\ntransformation, Ms. Using the Phase Field Microelasticity theory and 3D\nsimulation, we demonstrated that the local stress generated by these defects\nproduces equilibrium nano-size martensitic embryos (MEs) in pre-transitional\nstate, these embryos being orientation variants of martensite. This is a new\ntype of equilibrium: the thermoelastic equilibrium between the MEs and parent\nphase in which the total volume of MEs and their size are equilibrium internal\nthermodynamic parameters. This thermoelastic equilibrium exists only in\npresence of the stress-generating defects. Cooling the pre-transitional state\ntowards Ms or applying the external stimuli, stress or magnetic field, results\nin a shift of the thermoelastic equilibrium provided by a reversible\nanhysteretic growth of MEs that results in a giant ME-generated macroscopic\nstrain. In particular, this effect can be associated with the diffuse phase\ntransformations observed in some ferroelectrics above the Curie point. It is\nshown that the ME-generated strain is giant and describes a superelasticity if\nthe applied field is stress. It describes a super magnetostriction if the\nmartensite (or austenite) are ferromagnetic and the applied field is a magnetic\nfield. In general, the material with defects can be a multiferroic with a giant\nmultiferroic response if the parent and martensitic phase have different\nferroic properties. Finally the ME-generated strain may explain or, at least,\ncontribute to the Invar and Elinvar effects that are typically observed in\npre-transitional austenite. The thermoelastic equilibrium and all these effects\nexist only if the interaction between the defects and MEs is infinite-range.\n",
"title": "Responses of Pre-transitional Materials with Stress-Generating Defects to External Stimuli: Superelasticity, Supermagnetostriction, Invar and Elinvar Effects"
}
| null | null | null | null | true | null |
6488
| null |
Default
| null | null |
null |
{
"abstract": " The Burr III distribution is used in a wide variety of fields of lifetime\ndata analysis, reliability theory, and financial literature, etc. It is defined\non the positive axis and has two shape parameters, say $c$ and $k$. These shape\nparameters make the distribution quite flexible. They also control the tail\nbehavior of the distribution. In this study, we extent the Burr III\ndistribution to the real axis and also add a skewness parameter, say\n$\\varepsilon$, with epsilon-skew extension approach. When the parameters $c$\nand $k$ have a relation such that $ck \\approx 1 $ or $ck < 1 $, it is skewed\nunimodal. Otherwise, it is skewed bimodal with the same level of peaks on the\nnegative and positive sides of real line. Thus, ESBIII distribution can capture\nfitting the various data sets even when the number of parameters are three.\nLocation and scale form of this distribution are also given. Some\ndistributional properties of the new distribution are investigated. The maximum\nlikelihood (ML) estimation method for the parameters of ESBIII is considered.\nThe robustness properties of ML estimators are studied and also tail behaviour\nof ESBIII distribution is examined. The applications on real data are\nconsidered to illustrate the modeling capacity of this distribution in the\nclass of bimodal distributions.\n",
"title": "On The Robustness of Epsilon Skew Extension for Burr III Distribution on Real Line"
}
| null | null | null | null | true | null |
6489
| null |
Default
| null | null |
null |
{
"abstract": " We introduce a logic, called LT, to express properties of transductions, i.e.\nbinary relations from input to output (finite) words. In LT, the input/output\ndependencies are modelled via an origin function which associates to any\nposition of the output word, the input position from which it originates. LT is\nwell-suited to express relations (which are not necessarily functional), and\ncan express all regular functional transductions, i.e. transductions definable\nfor instance by deterministic two-way transducers. Despite its high expressive\npower, LT has decidable satisfiability and equivalence problems, with tight\nnon-elementary and elementary complexities, depending on specific\nrepresentation of LT-formulas. Our main contribution is a synthesis result:\nfrom any transduction R defined in LT , it is possible to synthesise a regular\nfunctional transduction f such that for all input words u in the domain of R, f\nis defined and (u,f(u)) belongs to R. As a consequence, we obtain that any\nfunctional transduction is regular iff it is LT-definable. We also investigate\nthe algorithmic and expressiveness properties of several extensions of LT, and\nexplicit a correspondence between transductions and data words. As a\nside-result, we obtain a new decidable logic for data words.\n",
"title": "Logics for Word Transductions with Synthesis"
}
| null | null | null | null | true | null |
6490
| null |
Default
| null | null |
null |
{
"abstract": " We study massless fermions interacting through a particular four fermion term\nin four dimensions. Exact symmetries prevent the generation of bilinear fermion\nmass terms. We determine the structure of the low energy effective action for\nthe auxiliary field needed to generate the four fermion term and find it has an\nnovel structure that admits topologically non-trivial defects with non-zero\nHopf invariant. We show that fermions propagating in such a background pick up\na mass without breaking symmetries. Furthermore pairs of such defects\nexperience a logarithmic interaction. We argue that a phase transition\nseparates a phase where these defects proliferate from a broken phase where\nthey are bound tightly. We conjecture that by tuning one additional operator\nthe broken phase can be eliminated with a single BKT-like phase transition\nseparating the massless from massive phases.\n",
"title": "Topology and strong four fermion interactions in four dimensions"
}
| null | null |
[
"Physics"
] | null | true | null |
6491
| null |
Validated
| null | null |
null |
{
"abstract": " The generation of artificial data based on existing observations, known as\ndata augmentation, is a technique used in machine learning to improve model\naccuracy, generalisation, and to control overfitting. Augmentor is a software\npackage, available in both Python and Julia versions, that provides a high\nlevel API for the expansion of image data using a stochastic, pipeline-based\napproach which effectively allows for images to be sampled from a distribution\nof augmented images at runtime. Augmentor provides methods for most standard\naugmentation practices as well as several advanced features such as\nlabel-preserving, randomised elastic distortions, and provides many helper\nfunctions for typical augmentation tasks used in machine learning.\n",
"title": "Augmentor: An Image Augmentation Library for Machine Learning"
}
| null | null |
[
"Computer Science",
"Statistics"
] | null | true | null |
6492
| null |
Validated
| null | null |
null |
{
"abstract": " The identification of parameters in mathematical models using noisy\nobservations is a common task in uncertainty quantification. We employ the\nframework of Bayesian inversion: we combine monitoring and observational data\nwith prior information to estimate the posterior distribution of a parameter.\nSpecifically, we are interested in the distribution of a diffusion coefficient\nof an elliptic PDE. In this setting, the sample space is high-dimensional, and\neach sample of the PDE solution is expensive. To address these issues we\npropose and analyse a novel Sequential Monte Carlo (SMC) sampler for the\napproximation of the posterior distribution. Classical, single-level SMC\nconstructs a sequence of measures, starting with the prior distribution, and\nfinishing with the posterior distribution. The intermediate measures arise from\na tempering of the likelihood, or, equivalently, a rescaling of the noise. The\nresolution of the PDE discretisation is fixed. In contrast, our estimator\nemploys a hierarchy of PDE discretisations to decrease the computational cost.\nWe construct a sequence of intermediate measures by decreasing the temperature\nor by increasing the discretisation level at the same time. This idea builds on\nand generalises the multi-resolution sampler proposed in [P.S. Koutsourelakis,\nJ. Comput. Phys., 228 (2009), pp. 6184-6211] where a bridging scheme is used to\ntransfer samples from coarse to fine discretisation levels. Importantly, our\nchoice between tempering and bridging is fully adaptive. We present numerical\nexperiments in 2D space, comparing our estimator to single-level SMC and the\nmulti-resolution sampler.\n",
"title": "Multilevel Sequential${}^2$ Monte Carlo for Bayesian Inverse Problems"
}
| null | null | null | null | true | null |
6493
| null |
Default
| null | null |
null |
{
"abstract": " We have designed and tested experimentally a morphing structure consisting of\na neutrally stable thin cylindrical shell driven by a multiparameter\npiezoelectric actuation. The shell is obtained by plastically deforming an\ninitially flat copper disk, so as to induce large isotropic and almost uniform\ninelastic curvatures. Following the plastic deformation, in a perfectly\nisotropic system, the shell is theoretically neutrally stable, owning a\ncontinuous manifold of stable cylindrical shapes corresponding to the rotation\nof the axis of maximal curvature. Small imperfections render the actual\nstructure bistable, giving preferred orientations. A three-parameter\npiezoelectric actuation, exerted through micro-fiber-composite actuators,\nallows us to add a small perturbation to the plastic inelastic curvature and to\ncontrol the direction of maximal curvature. This actuation law is designed\nthrough a geometrical analogy based on a fully non-linear inextensible\nuniform-curvature shell model. We report on the fabrication, identification,\nand experimental testing of a prototype and demonstrate the effectiveness of\nthe piezoelectric actuators in controlling its shape. The resulting motion is\nan apparent rotation of the shell, controlled by the voltages as in a\n\"gear-less motor\", which is, in reality, a precession of the axis of principal\ncurvature.\n",
"title": "Multiparameter actuation of a neutrally-stable shell: a flexible gear-less motor"
}
| null | null | null | null | true | null |
6494
| null |
Default
| null | null |
null |
{
"abstract": " The fog radio access network (F-RAN) is a promising paradigm for the fifth\ngeneration wireless communication systems to provide high spectral efficiency\nand energy efficiency. Characterizing users to select an appropriate\ncommunication mode among fog access point (F-AP), and device-to-device (D2D) in\nF-RANs is critical for performance optimization. Using evolutionary game\ntheory, we investigate the dynamics of user access mode selection in F-RANs.\nSpecifically, the competition among groups of potential users space is\nformulated as a dynamic evolutionary game, and the evolutionary equilibrium is\nthe solution to this game. Stochastic geometry tool is used to derive the\nproposals' payoff expressions for both F-AP and D2D users by taking into\naccount the different nodes locations, cache sizes as well as the delay cost.\nThe analytical results obtained from the game model are evaluated via\nsimulations, which show that the evolutionary game based access mode selection\nalgorithm can reach a much higher payoff than the max rate based algorithm.\n",
"title": "An Evolutionary Game for User Access Mode Selection in Fog Radio Access Networks"
}
| null | null | null | null | true | null |
6495
| null |
Default
| null | null |
null |
{
"abstract": " The concepts of Gross Domestic Product (GDP), GDP per capita, and population\nare central to the study of political science and economics. However, a growing\nliterature suggests that existing measures of these concepts contain\nconsiderable error or are based on overly simplistic modeling choices. We\naddress these problems by creating a dynamic, three-dimensional latent trait\nmodel, which uses observed information about GDP, GDP per capita, and\npopulation to estimate posterior prediction intervals for each of these\nimportant concepts. By combining historical and contemporary sources of\ninformation, we are able to extend the temporal and spatial coverage of\nexisting datasets for country-year units back to 1500 A.D through 2015 A.D.\nand, because the model makes use of multiple indicators of the underlying\nconcepts, we are able to estimate the relative precision of the different\ncountry-year estimates. Overall, our latent variable model offers a principled\nmethod for incorporating information from different historic and contemporary\ndata sources. It can be expanded or refined as researchers discover new or\nalternative sources of information about these concepts.\n",
"title": "Latent Estimation of GDP, GDP per capita, and Population from Historic and Contemporary Sources"
}
| null | null | null | null | true | null |
6496
| null |
Default
| null | null |
null |
{
"abstract": " Fractional stochastic volatility models have been widely used to capture the\nnon-Markovian structure revealed from financial time series of realized\nvolatility. On the other hand, empirical studies have identified scales in\nstock price volatility: both fast-time scale on the order of days and\nslow-scale on the order of months. So, it is natural to study the portfolio\noptimization problem under the effects of dependence behavior which we will\nmodel by fractional Brownian motions with Hurst index $H$, and in the fast or\nslow regimes characterized by small parameters $\\eps$ or $\\delta$. For the\nslowly varying volatility with $H \\in (0,1)$, it was shown that the first order\ncorrection to the problem value contains two terms of order $\\delta^H$, one\nrandom component and one deterministic function of state processes, while for\nthe fast varying case with $H > \\half$, the same form holds at order\n$\\eps^{1-H}$. This paper is dedicated to the remaining case of a fast-varying\nrough environment ($H < \\half$) which exhibits a different behavior. We show\nthat, in the expansion, only one deterministic term of order $\\sqrt{\\eps}$\nappears in the first order correction.\n",
"title": "Portfolio Optimization under Fast Mean-reverting and Rough Fractional Stochastic Environment"
}
| null | null |
[
"Quantitative Finance"
] | null | true | null |
6497
| null |
Validated
| null | null |
null |
{
"abstract": " A Triangle Generative Adversarial Network ($\\Delta$-GAN) is developed for\nsemi-supervised cross-domain joint distribution matching, where the training\ndata consists of samples from each domain, and supervision of domain\ncorrespondence is provided by only a few paired samples. $\\Delta$-GAN consists\nof four neural networks, two generators and two discriminators. The generators\nare designed to learn the two-way conditional distributions between the two\ndomains, while the discriminators implicitly define a ternary discriminative\nfunction, which is trained to distinguish real data pairs and two kinds of fake\ndata pairs. The generators and discriminators are trained together using\nadversarial learning. Under mild assumptions, in theory the joint distributions\ncharacterized by the two generators concentrate to the data distribution. In\nexperiments, three different kinds of domain pairs are considered, image-label,\nimage-image and image-attribute pairs. Experiments on semi-supervised image\nclassification, image-to-image translation and attribute-based image generation\ndemonstrate the superiority of the proposed approach.\n",
"title": "Triangle Generative Adversarial Networks"
}
| null | null | null | null | true | null |
6498
| null |
Default
| null | null |
null |
{
"abstract": " When a speaker says the name of a color, the color that they picture is not\nnecessarily the same as the listener imagines. Color is a grounded semantic\ntask, but that grounding is not a mapping of a single word (or phrase) to a\nsingle point in color-space. Proper understanding of color language requires\nthe capacity to map a sequence of words to a probability distribution in\ncolor-space. A distribution is required as there is no clear agreement between\npeople as to what a particular color describes -- different people have a\ndifferent idea of what it means to be `very dark orange'. We propose a novel\nGRU-based model to handle this case. Learning how each word in a color name\ncontributes to the color described, allows for knowledge sharing between uses\nof the words in different color names. This knowledge sharing significantly\nimproves predicative capacity for color names with sparse training data. The\nextreme case of this challenge in data sparsity is for color names without any\ndirect training data. Our model is able to predict reasonable distributions for\nthese cases, as evaluated on a held-out dataset consisting only of such terms.\n",
"title": "Learning Distributions of Meant Color"
}
| null | null | null | null | true | null |
6499
| null |
Default
| null | null |
null |
{
"abstract": " The low-temperature properties of certain quantum magnets can be described in\nterms of a Bose-Einstein condensation (BEC) of magnetic quasiparticles\n(triplons). Some mean-field approaches (MFA) to describe these systems, based\non the standard grand canonical ensemble, do not take the anomalous density\ninto account and leads to an internal inconsistency, as it has been shown by\nHohenberg and Martin, and may therefore produce unphysical results. Moreover,\nan explicit breaking of the U(1) symmetry as observed, for example, in TlCuCl3\nmakes the application of MFA more complicated. In the present work, we develop\na self-consistent MFA approach, similar to the Hartree-Fock-Bogolyubov\napproximation in the notion of representative statistical ensembles, including\nthe effect of a weakly broken U(1) symmetry. We apply our results on\nexperimental data of the quantum magnet TlCuCl3 and show that magnetization\ncurves and the energy dispersion can be well described within this\napproximation assuming that the BEC scenario is still valid. We predict that\nthe shift of the critical temperature Tc due to a finite exchange anisotropy is\nrather substantial even when the anisotropy parameter \\gamma is small, e.g.,\n\\Delta T_c \\approx 10%$ of Tc in H = 6T and for \\gamma\\approx 4 \\mu eV.\n",
"title": "Bose - Einstein condensation of triplons with a weakly broken U(1) symmetry"
}
| null | null | null | null | true | null |
6500
| null |
Default
| null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.