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": " An elementary rheory of concatenation is introduced and used to establish\nmutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory,\nthe quantifier-free part of Kirby's finitary set theory, and Adjunctive Set\nTheory, with or without extensionality.\n",
"title": "Mutual Interpretability of Robinson Arithmetic and Adjunctive Set Theory with Extensionality"
} | null | null | null | null | true | null | 701 | null | Default | null | null |
null | {
"abstract": " JavaBIP allows the coordination of software components by clearly separating\nthe functional and coordination aspects of the system behavior. JavaBIP\nimplements the principles of the BIP component framework rooted in rigorous\noperational semantics. Recent work both on BIP and JavaBIP allows the\ncoordination of static components defined prior to system deployment, i.e., the\narchitecture of the coordinated system is fixed in terms of its component\ninstances. Nevertheless, modern systems, often make use of components that can\nregister and deregister dynamically during system execution. In this paper, we\npresent an extension of JavaBIP that can handle this type of dynamicity. We use\nfirst-order interaction logic to define synchronization constraints based on\ncomponent types. Additionally, we use directed graphs with edge coloring to\nmodel dependencies among components that determine the validity of an online\nsystem. We present the software architecture of our implementation, provide and\ndiscuss performance evaluation results.\n",
"title": "Coordination of Dynamic Software Components with JavaBIP"
} | null | null | null | null | true | null | 702 | null | Default | null | null |
null | {
"abstract": " In rapid release development processes, patches that fix critical issues, or\nimplement high-value features are often promoted directly from the development\nchannel to a stabilization channel, potentially skipping one or more\nstabilization channels. This practice is called patch uplift. Patch uplift is\nrisky, because patches that are rushed through the stabilization phase can end\nup introducing regressions in the code. This paper examines patch uplift\noperations at Mozilla, with the aim to identify the characteristics of uplifted\npatches that introduce regressions. Through statistical and manual analyses, we\nquantitatively and qualitatively investigate the reasons behind patch uplift\ndecisions and the characteristics of uplifted patches that introduced\nregressions. Additionally, we interviewed three Mozilla release managers to\nunderstand organizational factors that affect patch uplift decisions and\noutcomes. Results show that most patches are uplifted because of a wrong\nfunctionality or a crash. Uplifted patches that lead to faults tend to have\nlarger patch size, and most of the faults are due to semantic or memory errors\nin the patches. Also, release managers are more inclined to accept patch uplift\nrequests that concern certain specific components, and-or that are submitted by\ncertain specific developers.\n",
"title": "Is It Safe to Uplift This Patch? An Empirical Study on Mozilla Firefox"
} | null | null | null | null | true | null | 703 | null | Default | null | null |
null | {
"abstract": " Examining games from a fresh perspective we present the idea of game-inspired\nand game-based algorithms, dubbed \"gamorithms\".\n",
"title": "Gamorithm"
} | null | null | null | null | true | null | 704 | null | Default | null | null |
null | {
"abstract": " We establish the convergence rates and asymptotic distributions of the common\nbreak change-point estimators, obtained by least squares and maximum likelihood\nin panel data models and compare their asymptotic variances. Our model\nassumptions accommodate a variety of commonly encountered probability\ndistributions and, in particular, models of particular interest in econometrics\nbeyond the commonly analyzed Gaussian model, including the zero-inflated\nPoisson model for count data, and the probit and tobit models. We also provide\nnovel results for time dependent data in the signal-plus-noise model, with\nemphasis on a wide array of noise processes, including Gaussian process,\nMA$(\\infty)$ and $m$-dependent processes. The obtained results show that\nmaximum likelihood estimation requires a stronger signal-to-noise model\nidentifiability condition compared to its least squares counterpart. Finally,\nsince there are three different asymptotic regimes that depend on the behavior\nof the norm difference of the model parameters before and after the change\npoint, which cannot be realistically assumed to be known, we develop a novel\ndata driven adaptive procedure that provides valid confidence intervals for the\ncommon break, without requiring a priori knowledge of the asymptotic regime the\nproblem falls in.\n",
"title": "Common change point estimation in panel data from the least squares and maximum likelihood viewpoints"
} | null | null | [
"Mathematics",
"Statistics"
]
| null | true | null | 705 | null | Validated | null | null |
null | {
"abstract": " The study of relays with the scope of energy-harvesting (EH) looks\ninteresting as a means of enabling sustainable, wireless communication without\nthe need to recharge or replace the battery driving the relays. However,\nreliability of such communication systems becomes an important design challenge\nwhen such relays scavenge energy from the information bearing RF signals\nreceived from the source, using the technique of simultaneous wireless\ninformation and power transfer (SWIPT). To this aim, this work studies\nbidirectional communication in a decode-and-forward (DF) relay assisted\ncooperative wireless network in presence of co-channel interference (CCI). In\norder to quantify the reliability of the bidirectional communication systems, a\nclosed form expression for the outage probability of the system is derived for\nboth power splitting (PS) and time switching (TS) mode of operation of the\nrelay. Simulation results are used to validate the accuracy of our analytical\nresults and illustrate the dependence of the outage probability on various\nsystem parameters, like PS factor, TS factor, and distance of the relay from\nboth the users. Results of performance comparison between PS relaying (PSR) and\nTS relaying (TSR) schemes are also presented. Besides, simulation results are\nalso used to illustrate the spectral-efficiency and the energy-efficiency of\nthe proposed system. The results show that, both in terms of spectral\nefficiency and the energy-efficiency, the two-way communication system in\npresence of moderate CCI power, performs better than the similar system without\nCCI. Additionally, it is also found that PSR is superior to TSR protocol in\nterms of peak energy-efficiency.\n",
"title": "Outage analysis in two-way communication with RF energy harvesting relay and co-channel interference"
} | null | null | null | null | true | null | 706 | null | Default | null | null |
null | {
"abstract": " Generative Adversarial Networks (GANs) were intuitively and attractively\nexplained under the perspective of game theory, wherein two involving parties\nare a discriminator and a generator. In this game, the task of the\ndiscriminator is to discriminate the real and generated (i.e., fake) data,\nwhilst the task of the generator is to generate the fake data that maximally\nconfuses the discriminator. In this paper, we propose a new viewpoint for GANs,\nwhich is termed as the minimizing general loss viewpoint. This viewpoint shows\na connection between the general loss of a classification problem regarding a\nconvex loss function and a f-divergence between the true and fake data\ndistributions. Mathematically, we proposed a setting for the classification\nproblem of the true and fake data, wherein we can prove that the general loss\nof this classification problem is exactly the negative f-divergence for a\ncertain convex function f. This allows us to interpret the problem of learning\nthe generator for dismissing the f-divergence between the true and fake data\ndistributions as that of maximizing the general loss which is equivalent to the\nmin-max problem in GAN if the Logistic loss is used in the classification\nproblem. However, this viewpoint strengthens GANs in two ways. First, it allows\nus to employ any convex loss function for the discriminator. Second, it\nsuggests that rather than limiting ourselves in NN-based discriminators, we can\nalternatively utilize other powerful families. Bearing this viewpoint, we then\npropose using the kernel-based family for discriminators. This family has two\nappealing features: i) a powerful capacity in classifying non-linear nature\ndata and ii) being convex in the feature space. Using the convexity of this\nfamily, we can further develop Fenchel duality to equivalently transform the\nmax-min problem to the max-max dual problem.\n",
"title": "KGAN: How to Break The Minimax Game in GAN"
} | null | null | [
"Computer Science",
"Statistics"
]
| null | true | null | 707 | null | Validated | null | null |
null | {
"abstract": " This paper is concerned with the computation of representation matrices for\nthe action of Frobenius to the cohomology groups of algebraic varieties.\nSpecifically we shall give an algorithm to compute the matrices for arbitrary\nalgebraic varieties with defining equations over perfect fields of positive\ncharacteristic, and estimate its complexity. Moreover, we propose a specific\nefficient method, which works for complete intersections.\n",
"title": "Computing representation matrices for the action of Frobenius to cohomology groups"
} | null | null | [
"Computer Science",
"Mathematics"
]
| null | true | null | 708 | null | Validated | null | null |
null | {
"abstract": " We present possible explanations of pulsations in early B-type main sequence\nstars which arise purely from the excitation of gravity modes. There are three\nstars with this type of oscillations detected from the BRITE light curves:\n$\\kappa$ Cen, a Car, $\\kappa$ Vel. We show that by changing metallicity or the\nopacity profile it is possible in some models to dump pressure modes keeping\ngravity modes unstable. Other possible scenario involves pulsations of a lower\nmass companion.\n",
"title": "The solitary g-mode frequencies in early B-type stars"
} | null | null | null | null | true | null | 709 | null | Default | null | null |
null | {
"abstract": " Recently introduced composition operator for credal sets is an analogy of\nsuch operators in probability, possibility, evidence and valuation-based\nsystems theories. It was designed to construct multidimensional models (in the\nframework of credal sets) from a system of low- dimensional credal sets. In\nthis paper we study its potential from the computational point of view\nutilizing methods of polyhedral geometry.\n",
"title": "Composition of Credal Sets via Polyhedral Geometry"
} | null | null | null | null | true | null | 710 | null | Default | null | null |
null | {
"abstract": " Internet-of-Things end-nodes demand low power processing platforms\ncharacterized by heterogeneous dedicated units, controlled by a processor core\nrunning concurrent control threads. Such architecture scheme fits one of the\nmain target application domain of the RISC-V instruction set. We present an\nopen-source processing core compliant with RISC-V on the software side and with\nthe popular Pulpino processor platform on the hardware side, while supporting\ninterleaved multi-threading for IoT applications. The latter feature is a novel\ncontribution in this application domain. We report details about the\nmicroarchitecture design along with performance data.\n",
"title": "The microarchitecture of a multi-threaded RISC-V compliant processing core family for IoT end-nodes"
} | null | null | null | null | true | null | 711 | null | Default | null | null |
null | {
"abstract": " During the last two decades, Genetic Programming (GP) has been largely used\nto tackle optimization, classification, and automatic features selection\nrelated tasks. The widespread use of GP is mainly due to its flexible and\ncomprehensible tree-type structure. Similarly, research is also gaining\nmomentum in the field of Image Processing (IP) because of its promising results\nover wide areas of applications ranging from medical IP to multispectral\nimaging. IP is mainly involved in applications such as computer vision, pattern\nrecognition, image compression, storage and transmission, and medical\ndiagnostics. This prevailing nature of images and their associated algorithm\ni.e complexities gave an impetus to the exploration of GP. GP has thus been\nused in different ways for IP since its inception. Many interesting GP\ntechniques have been developed and employed in the field of IP. To give the\nresearch community an extensive view of these techniques, this paper presents\nthe diverse applications of GP in IP and provides useful resources for further\nresearch. Also, comparison of different parameters used in ten different\napplications of IP are summarized in tabular form. Moreover, analysis of\ndifferent parameters used in IP related tasks is carried-out to save the time\nneeded in future for evaluating the parameters of GP. As more advancement is\nmade in GP methodologies, its success in solving complex tasks not only related\nto IP but also in other fields will increase. Additionally, guidelines are\nprovided for applying GP in IP related tasks, pros and cons of GP techniques\nare discussed, and some future directions are also set.\n",
"title": "A Recent Survey on the Applications of Genetic Programming in Image Processing"
} | null | null | null | null | true | null | 712 | null | Default | null | null |
null | {
"abstract": " The control of dynamical, networked systems continues to receive much\nattention across the engineering and scientific research fields. Of particular\ninterest is the proper way to determine which nodes of the network should\nreceive external control inputs in order to effectively and efficiently control\nportions of the network. Published methods to accomplish this task either find\na minimal set of driver nodes to guarantee controllability or a larger set of\ndriver nodes which optimizes some control metric. Here, we investigate the\ncontrol of lattice systems which provides analytical insight into the\nrelationship between network structure and controllability. First we derive a\nclosed form expression for the individual elements of the controllability\nGramian of infinite lattice systems. Second, we focus on nearest neighbor\nlattices for which the distance between nodes appears in the expression for the\ncontrollability Gramian. We show that common control energy metrics scale\nexponentially with respect to the maximum distance between a driver node and a\ntarget node.\n",
"title": "Optimal Input Placement in Lattice Graphs"
} | null | null | null | null | true | null | 713 | null | Default | null | null |
null | {
"abstract": " We construct constant mean curvature surfaces in euclidean space with genus\nzero and n ends asymptotic to Delaunay surfaces using the DPW method.\n",
"title": "Construction of constant mean curvature n-noids using the DPW method"
} | null | null | [
"Mathematics"
]
| null | true | null | 714 | null | Validated | null | null |
null | {
"abstract": " We discuss various universality aspects of numerical computations using\nstandard algorithms. These aspects include empirical observations and rigorous\nresults. We also make various speculations about computation in a broader\nsense.\n",
"title": "Universality in numerical computation with random data. Case studies, analytic results and some speculations"
} | null | null | [
"Physics",
"Mathematics"
]
| null | true | null | 715 | null | Validated | null | null |
null | {
"abstract": " The relativistic jets created by some active galactic nuclei are important\nagents of AGN feedback. In spite of this, our understanding of what produces\nthese jets is still incomplete. X-ray observations, which can probe the\nprocesses operating in the central regions in immediate vicinity of the\nsupermassive black hole, the presumed jet launching point, are potentially\nparticularly valuable in illuminating the jet formation process. Here, we\npresent the hard X-ray NuSTAR observations of the radio-loud quasar 4C 74.26 in\na joint analysis with quasi-simultaneous, soft X-ray Swift observations. Our\nspectral analysis reveals a high-energy cut-off of 183$_{-35}^{+51}$ keV and\nconfirms the presence of ionized reflection in the source. From the average\nspectrum we detect that the accretion disk is mildly recessed with an inner\nradius of $R_\\mathrm{in}=4-180\\,R_\\mathrm{g}$. However, no significant\nevolution of the inner radius is seen during the three months covered by our\nNuSTAR campaign. This lack of variation could mean that the jet formation in\nthis radio-loud quasar differs from what is observed in broad-line radio\ngalaxies.\n",
"title": "The X-ray reflection spectrum of the radio-loud quasar 4C 74.26"
} | null | null | null | null | true | null | 716 | null | Default | null | null |
null | {
"abstract": " A new synthesis scheme is proposed to effectively generate a random vector\nwith prescribed joint density that induces a (latent) Gaussian tree structure.\nThe quality of synthesis is measured by total variation distance between the\nsynthesized and desired statistics. The proposed layered and successive\nencoding scheme relies on the learned structure of tree to use minimal number\nof common random variables to synthesize the desired density. We characterize\nthe achievable rate region for the rate tuples of multi-layer latent Gaussian\ntree, through which the number of bits needed to simulate such Gaussian joint\ndensity are determined. The random sources used in our algorithm are the latent\nvariables at the top layer of tree, the additive independent Gaussian noises,\nand the Bernoulli sign inputs that capture the ambiguity of correlation signs\nbetween the variables.\n",
"title": "Tree Structured Synthesis of Gaussian Trees"
} | null | null | null | null | true | null | 717 | null | Default | null | null |
null | {
"abstract": " We present a machine learning based information retrieval system for\nastronomical observatories that tries to address user defined queries related\nto an instrument. In the modern instrumentation scenario where heterogeneous\nsystems and talents are simultaneously at work, the ability to supply with the\nright information helps speeding up the detector maintenance operations.\nEnhancing the detector uptime leads to increased coincidence observation and\nimproves the likelihood for the detection of astrophysical signals. Besides,\nsuch efforts will efficiently disseminate technical knowledge to a wider\naudience and will help the ongoing efforts to build upcoming detectors like the\nLIGO-India etc even at the design phase to foresee possible challenges. The\nproposed method analyses existing documented efforts at the site to\nintelligently group together related information to a query and to present it\non-line to the user. The user in response can further go into interesting links\nand find already developed solutions or probable ways to address the present\nsituation optimally. A web application that incorporates the above idea has\nbeen implemented and tested for LIGO Livingston, LIGO Hanford and Virgo\nobservatories.\n",
"title": "Information Retrieval and Recommendation System for Astronomical Observatories"
} | null | null | [
"Physics"
]
| null | true | null | 718 | null | Validated | null | null |
null | {
"abstract": " In today's databases, previous query answers rarely benefit answering future\nqueries. For the first time, to the best of our knowledge, we change this\nparadigm in an approximate query processing (AQP) context. We make the\nfollowing observation: the answer to each query reveals some degree of\nknowledge about the answer to another query because their answers stem from the\nsame underlying distribution that has produced the entire dataset. Exploiting\nand refining this knowledge should allow us to answer queries more\nanalytically, rather than by reading enormous amounts of raw data. Also,\nprocessing more queries should continuously enhance our knowledge of the\nunderlying distribution, and hence lead to increasingly faster response times\nfor future queries.\nWe call this novel idea---learning from past query answers---Database\nLearning. We exploit the principle of maximum entropy to produce answers, which\nare in expectation guaranteed to be more accurate than existing sample-based\napproximations. Empowered by this idea, we build a query engine on top of Spark\nSQL, called Verdict. We conduct extensive experiments on real-world query\ntraces from a large customer of a major database vendor. Our results\ndemonstrate that Verdict supports 73.7% of these queries, speeding them up by\nup to 23.0x for the same accuracy level compared to existing AQP systems.\n",
"title": "Database Learning: Toward a Database that Becomes Smarter Every Time"
} | null | null | null | null | true | null | 719 | null | Default | null | null |
null | {
"abstract": " Beam search is a desirable choice of test-time decoding algorithm for neural\nsequence models because it potentially avoids search errors made by simpler\ngreedy methods. However, typical cross entropy training procedures for these\nmodels do not directly consider the behaviour of the final decoding method. As\na result, for cross-entropy trained models, beam decoding can sometimes yield\nreduced test performance when compared with greedy decoding. In order to train\nmodels that can more effectively make use of beam search, we propose a new\ntraining procedure that focuses on the final loss metric (e.g. Hamming loss)\nevaluated on the output of beam search. While well-defined, this \"direct loss\"\nobjective is itself discontinuous and thus difficult to optimize. Hence, in our\napproach, we form a sub-differentiable surrogate objective by introducing a\nnovel continuous approximation of the beam search decoding procedure. In\nexperiments, we show that optimizing this new training objective yields\nsubstantially better results on two sequence tasks (Named Entity Recognition\nand CCG Supertagging) when compared with both cross entropy trained greedy\ndecoding and cross entropy trained beam decoding baselines.\n",
"title": "A Continuous Relaxation of Beam Search for End-to-end Training of Neural Sequence Models"
} | null | null | [
"Computer Science"
]
| null | true | null | 720 | null | Validated | null | null |
null | {
"abstract": " In 1997 B. Weiss introduced the notion of measurably entire functions and\nproved that they exist on every arbitrary free C- action defined on standard\nprobability space. In the same paper he asked about the minimal possible growth\nof measurably entire functions. In this work we show that for every arbitrary\nfree C- action defined on a standard probability space there exists a\nmeasurably entire function whose growth does not exceed exp (exp[log^p |z|])\nfor any p > 3. This complements a recent result by Buhovski, Glücksam,\nLogunov, and Sodin (arXiv:1703.08101) who showed that such functions cannot\ngrow slower than exp (exp[log^p |z|]) for any p < 2.\n",
"title": "Measurably entire functions and their growth"
} | null | null | null | null | true | null | 721 | null | Default | null | null |
null | {
"abstract": " In this paper, we show how to construct graph theoretical models of\nn-dimensional continuous objects and manifolds. These models retain topological\nproperties of their continuous counterparts. An LCL collection of n-cells in\nEuclidean space is introduced and investigated. If an LCL collection of n-cells\nis a cover of a continuous n-dimensional manifold then the intersection graph\nof this cover is a digital closed n-dimensional manifold with the same topology\nas its continuous counterpart. As an example, we prove that the digital model\nof a continuous n-dimensional sphere is a digital n-sphere with at least 2n+2\npoints, the digital model of a continuous projective plane is a digital\nprojective plane with at least eleven points, the digital model of a continuous\nKlein bottle is the digital Klein bottle with at least sixteen points, the\ndigital model of a continuous torus is the digital torus with at least sixteen\npoints and the digital model of a continuous Moebius band is the digital\nMoebius band with at least twelve points.\n",
"title": "Graph Theoretical Models of Closed n-Dimensional Manifolds: Digital Models of a Moebius Strip, a Torus, a Projective Plane a Klein Bottle and n-Dimensional Spheres"
} | null | null | null | null | true | null | 722 | null | Default | null | null |
null | {
"abstract": " Let $f(x,y)=ax^2+bxy+cy^2$ be a binary quadratic form with integer\ncoefficients. For a prime $p$ not dividing the discriminant of $f$, we say $f$\nis completely $p$-primitive if for any non-zero integer $N$, the diophantine\nequation $f(x,y)=N$ has always an integer solution $(x,y)=(m,n)$ with\n$(m,n,p)=1$ whenever it has an integer solution. In this article, we study\nvarious properties of completely $p$-primitive binary quadratic forms. In\nparticular, we give a necessary and sufficient condition for a definite binary\nquadratic form $f$ to be completely $p$-primitive.\n",
"title": "Completely $p$-primitive binary quadratic forms"
} | null | null | null | null | true | null | 723 | null | Default | null | null |
null | {
"abstract": " The numerical availability of statistical inference methods for a modern and\nrobust analysis of longitudinal- and multivariate data in factorial experiments\nis an essential element in research and education. While existing approaches\nthat rely on specific distributional assumptions of the data (multivariate\nnormality and/or characteristic covariance matrices) are implemented in\nstatistical software packages, there is a need for user-friendly software that\ncan be used for the analysis of data that do not fulfill the aforementioned\nassumptions and provide accurate p-value and confidence interval estimates.\nTherefore, newly developed statistical methods for the analysis of repeated\nmeasures designs and multivariate data that neither assume multivariate\nnormality nor specific covariance matrices have been implemented in the freely\navailable R-package MANOVA.RM. The package is equipped with a graphical user\ninterface for plausible applications in academia and other educational purpose.\nSeveral motivating examples illustrate the application of the methods.\n",
"title": "Analysis of Multivariate Data and Repeated Measures Designs with the R Package MANOVA.RM"
} | null | null | [
"Statistics"
]
| null | true | null | 724 | null | Validated | null | null |
null | {
"abstract": " Phaseless super-resolution is the problem of recovering an unknown signal\nfrom measurements of the magnitudes of the low frequency Fourier transform of\nthe signal. This problem arises in applications where measuring the phase, and\nmaking high-frequency measurements, are either too costly or altogether\ninfeasible. The problem is especially challenging because it combines the\ndifficult problems of phase retrieval and classical super-resolution\n",
"title": "Multiple Illumination Phaseless Super-Resolution (MIPS) with Applications To Phaseless DOA Estimation and Diffraction Imaging"
} | null | null | null | null | true | null | 725 | null | Default | null | null |
null | {
"abstract": " This paper is the first chapter of three of the author's undergraduate\nthesis. We study the random matrix ensemble of covariance matrices arising from\nrandom $(d_b, d_w)$-regular bipartite graphs on a set of $M$ black vertices and\n$N$ white vertices, for $d_b \\gg \\log^4 N$. We simultaneously prove that the\nGreen's functions of these covariance matrices and the adjacency matrices of\nthe underlying graphs agree with the corresponding limiting law (e.g.\nMarchenko-Pastur law for covariance matrices) down to the optimal scale. This\nis an improvement from the previously known mesoscopic results. We obtain\neigenvector delocalization for the covariance matrix ensemble as consequence,\nas well as a weak rigidity estimate.\n",
"title": "Local Marchenko-Pastur Law for Random Bipartite Graphs"
} | null | null | null | null | true | null | 726 | null | Default | null | null |
null | {
"abstract": " Photoelectron yields of extruded scintillation counters with titanium dioxide\ncoating and embedded wavelength shifting fibers read out by silicon\nphotomultipliers have been measured at the Fermilab Test Beam Facility using\n120\\,GeV protons. The yields were measured as a function of transverse,\nlongitudinal, and angular positions for a variety of scintillator compositions\nand reflective coating mixtures, fiber diameters, and photosensor sizes. Timing\nperformance was also studied. These studies were carried out by the Cosmic Ray\nVeto Group of the Mu2e collaboration as part of their R\\&D program.\n",
"title": "Photoelectron Yields of Scintillation Counters with Embedded Wavelength-Shifting Fibers Read Out With Silicon Photomultipliers"
} | null | null | null | null | true | null | 727 | null | Default | null | null |
null | {
"abstract": " We report a precise measurement of hyperfine structure in the $ \\rm\n{3\\,S_{1/2}} $ state of the odd isotope of Li, namely $ \\rm {^7Li} $. The state\nis excited from the ground $ \\rm {2\\,S_{1/2}} $ state (which has the same\nparity) using two single-photon transitions via the intermediate $ \\rm\n{2\\,P_{3/2}} $ state. The value of the hyperfine constant we measure is $ A =\n93.095(52)$ MHz, which resolves two discrepant values reported in the\nliterature measured using other techniques. Our value is also consistent with\ntheoretical calculations.\n",
"title": "Precise measurement of hyperfine structure in the $ \\rm {3\\,S_{1/2}} $ state of $ \\rm{^7Li} $"
} | null | null | null | null | true | null | 728 | null | Default | null | null |
null | {
"abstract": " We study a dynamical system induced by the Artin reciprocity map for a global\nfield. We translate the conjugacy of such dynamical systems into various\narithmetical properties that are equivalent to field isomorphism, relating it\nto anabelian geometry.\n",
"title": "Reconstructing global fields from dynamics in the abelianized Galois group"
} | null | null | null | null | true | null | 729 | null | Default | null | null |
null | {
"abstract": " We introduce a new invariant, the real (logarithmic)-Kodaira dimension, that\nallows to distinguish smooth real algebraic surfaces up to birational\ndiffeomorphism. As an application, we construct infinite families of smooth\nrational real algebraic surfaces with trivial homology groups, whose real loci\nare diffeomorphic to $\\mathbb{R}^2$, but which are pairwise not birationally\ndiffeomorphic. There are thus infinitely many non-trivial models of the\neuclidean plane, contrary to the compact case.\n",
"title": "Algebraic models of the Euclidean plane"
} | null | null | null | null | true | null | 730 | null | Default | null | null |
null | {
"abstract": " Effective communication is required for teams of robots to solve\nsophisticated collaborative tasks. In practice it is typical for both the\nencoding and semantics of communication to be manually defined by an expert;\nthis is true regardless of whether the behaviors themselves are bespoke,\noptimization based, or learned. We present an agent architecture and training\nmethodology using neural networks to learn task-oriented communication\nsemantics based on the example of a communication-unaware expert policy. A\nperimeter defense game illustrates the system's ability to handle dynamically\nchanging numbers of agents and its graceful degradation in performance as\ncommunication constraints are tightened or the expert's observability\nassumptions are broken.\n",
"title": "Decentralization of Multiagent Policies by Learning What to Communicate"
} | null | null | null | null | true | null | 731 | null | Default | null | null |
null | {
"abstract": " The discovery of 1I/2017 U1 ('Oumuamua) has provided the first glimpse of a\nplanetesimal born in another planetary system. This interloper exhibits a\nvariable colour within a range that is broadly consistent with local small\nbodies such as the P/D type asteroids, Jupiter Trojans, and dynamically excited\nKuiper Belt Objects. 1I/'Oumuamua appears unusually elongated in shape, with an\naxial ratio exceeding 5:1. Rotation period estimates are inconsistent and\nvaried, with reported values between 6.9 and 8.3 hours. Here we analyse all\navailable optical photometry reported to date. No single rotation period can\nexplain the exhibited brightness variations. Rather, 1I/'Oumuamua appears to be\nin an excited rotational state undergoing Non-Principal Axis (NPA) rotation, or\ntumbling. A satisfactory solution has apparent lightcurve frequencies of 0.135\nand 0.126 hr-1 and implies a longest-to-shortest axis ratio of 5:1, though the\navailable data are insufficient to uniquely constrain the true frequencies and\nshape. Assuming a body that responds to NPA rotation in a similar manner to\nSolar System asteroids and comets, the timescale to damp 1I/'Oumuamua's\ntumbling is at least a billion years. 1I/'Oumuamua was likely set tumbling\nwithin its parent planetary system, and will remain tumbling well after it has\nleft ours.\n",
"title": "The tumbling rotational state of 1I/`Oumuamua"
} | null | null | null | null | true | null | 732 | null | Default | null | null |
null | {
"abstract": " In the context of orientable circuits and subcomplexes of these as\nrepresenting certain singular spaces, we consider characteristic class formulas\ngeneralizing those classical results as seen for the Riemann-Hurwitz formula\nfor regulating the topology of branched covering maps and that for monoidal\ntransformations which include the standard blowing-up process. Here the results\nare presented as cap product pairings, which will be elements of a suitable\nhomology theory, rather than characteristic numbers as would be the case when\ntaking Kronecker products once Poincaré duality is defined. We further\nconsider possible applications and examples including branched covering maps,\nsingular varieties involving virtual tangent bundles, the\nChern-Schwartz-MacPherson class, the homology L-class, generalized signature,\nand the cohomology signature class.\n",
"title": "Homology theory formulas for generalized Riemann-Hurwitz and generalized monoidal transformations"
} | null | null | [
"Mathematics"
]
| null | true | null | 733 | null | Validated | null | null |
null | {
"abstract": " Purpose: Basic surgical skills of suturing and knot tying are an essential\npart of medical training. Having an automated system for surgical skills\nassessment could help save experts time and improve training efficiency. There\nhave been some recent attempts at automated surgical skills assessment using\neither video analysis or acceleration data. In this paper, we present a novel\napproach for automated assessment of OSATS based surgical skills and provide an\nanalysis of different features on multi-modal data (video and accelerometer\ndata). Methods: We conduct the largest study, to the best of our knowledge, for\nbasic surgical skills assessment on a dataset that contained video and\naccelerometer data for suturing and knot-tying tasks. We introduce \"entropy\nbased\" features - Approximate Entropy (ApEn) and Cross-Approximate Entropy\n(XApEn), which quantify the amount of predictability and regularity of\nfluctuations in time-series data. The proposed features are compared to\nexisting methods of Sequential Motion Texture (SMT), Discrete Cosine Transform\n(DCT) and Discrete Fourier Transform (DFT), for surgical skills assessment.\nResults: We report average performance of different features across all\napplicable OSATS criteria for suturing and knot tying tasks. Our analysis shows\nthat the proposed entropy based features out-perform previous state-of-the-art\nmethods using video data. For accelerometer data, our method performs better\nfor suturing only. We also show that fusion of video and acceleration features\ncan improve overall performance with the proposed entropy features achieving\nhighest accuracy. Conclusions: Automated surgical skills assessment can be\nachieved with high accuracy using the proposed entropy features. Such a system\ncan significantly improve the efficiency of surgical training in medical\nschools and teaching hospitals.\n",
"title": "Video and Accelerometer-Based Motion Analysis for Automated Surgical Skills Assessment"
} | null | null | null | null | true | null | 734 | null | Default | null | null |
null | {
"abstract": " Many complex systems share two characteristics: 1) they are stochastic in\nnature, and 2) they are characterized by a large number of factors. At the same\ntime, various natural complex systems appear to have two types of intertwined\nconstituents that exhibit counteracting effects on their equilibrium. In this\nstudy, we employ these few characteristics to lay the groundwork for analyzing\nsuch complex systems. The equilibrium point of these systems is generally\nstudied either through the kinetic notion of equilibrium or its energetic\nnotion, but not both. We postulate that these systems attempt to regulate the\nstate vector of their constituents such that both the kinetic and the energetic\nnotions of equilibrium are met. Based on this postulate, we prove: 1) the\nexistence of a point such that the kinetic notion of equilibrium is met for the\nless abundant constituents and, at the same time, the state vector of more\nabundant entities is regulated to minimize the energetic notion of equilibrium;\n2) the effect of unboundedly increasing less (more) abundant constituents\nstabilizes (destabilizes) the system; and 3) the (unrestricted) equilibrium of\nthe system is the point at which the number of stabilizing and destabilizing\nentities increase unboundedly with the same rate.\n",
"title": "A Theory of Complex Stochastic Systems with Two Types of Counteracting Entities"
} | null | null | [
"Physics"
]
| null | true | null | 735 | null | Validated | null | null |
null | {
"abstract": " Even- and odd-frequency superconductivity coexist due to broken time-reversal\nsymmetry under magnetic field. In order to describe this mixing, we extend the\nlinearized Eliashberg equation for the spin and charge fluctuation mechanism in\nstrongly correlated electron systems. We apply this extended Eliashberg\nequation to the odd-frequency superconductivity on a quasi-one-dimensional\nisosceles triangular lattice under in-plane magnetic field and examine the\neffect of the even-frequency component.\n",
"title": "Mixing of odd- and even-frequency pairings in strongly correlated electron systems under magnetic field"
} | null | null | [
"Physics"
]
| null | true | null | 736 | null | Validated | null | null |
null | {
"abstract": " Let X be an irreducible smooth projective curve, of genus at least two, over\nan algebraically closed field k. Let $\\mathcal{M}^d_G$ denote the moduli stack\nof principal G-bundles over X of fixed topological type $d \\in \\pi_1(G)$, where\nG is any almost simple affine algebraic group over k. We prove that the\nuniversal bundle over $X \\times \\mathcal{M}^d_G$ is stable with respect to any\npolarization on $X \\times \\mathcal{M}^d_G$. A similar result is proved for the\nPoincaré adjoint bundle over $X \\times M_G^{d, rs}$, where $M_G^{d, rs}$ is\nthe coarse moduli space of regularly stable principal G-bundles over X of fixed\ntopological type d.\n",
"title": "Stability of the Poincaré bundle"
} | null | null | null | null | true | null | 737 | null | Default | null | null |
null | {
"abstract": " With $\\Fq$ the finite field of $q$ elements, we investigate the following\nquestion. If $\\gamma$ generates $\\Fqn$ over $\\Fq$ and $\\beta$ is a non-zero\nelement of $\\Fqn$, is there always an $a \\in \\Fq$ such that $\\beta(\\gamma + a)$\nis a primitive element? We resolve this case when $n=3$, thereby proving a\nconjecture by Cohen. We also improve substantially on what is known when $n=4$.\n",
"title": "Existence results for primitive elements in cubic and quartic extensions of a finite field"
} | null | null | [
"Mathematics"
]
| null | true | null | 738 | null | Validated | null | null |
null | {
"abstract": " In this paper we exhibit Morse geodesics, often called \"hyperbolic\ndirections\", in infinite unbounded torsion groups. The groups studied are\nlacunary hyperbolic groups and constructed using graded small cancellation\nconditions. In all previously known examples, Morse geodesics were found in\ngroups which also contained Morse elements, infinite order elements whose\ncyclic subgroup gives a Morse quasi-geodesic. Our result presents the first\nexample of a group which contains Morse geodesics but no Morse elements. In\nfact, we show that there is an isometrically embedded $7$-regular tree inside\nsuch groups where every infinite, simple path is a Morse geodesic.\n",
"title": "Morse geodesics in torsion groups"
} | null | null | null | null | true | null | 739 | null | Default | null | null |
null | {
"abstract": " We study the ultimate bounds on the estimation of temperature for an\ninteracting quantum system. We consider two coupled bosonic modes that are\nassumed to be thermal and using quantum estimation theory establish the role\nthe Hamiltonian parameters play in thermometry. We show that in the case of a\nconserved particle number the interaction between the modes leads to a decrease\nin the overall sensitivity to temperature, while interestingly, if particle\nexchange is allowed with the thermal bath the converse is true. We explain this\ndichotomy by examining the energy spectra. Finally, we devise experimentally\nimplementable thermometry schemes that rely only on locally accessible\ninformation from the total system, showing that almost Heisenberg limited\nprecision can still be achieved, and we address the (im)possibility for\nmultiparameter estimation in the system.\n",
"title": "Global and local thermometry schemes in coupled quantum systems"
} | null | null | null | null | true | null | 740 | null | Default | null | null |
null | {
"abstract": " We show that publishing results using the statistical significance\nfilter---publishing only when the p-value is less than 0.05---leads to a\nvicious cycle of overoptimistic expectation of the replicability of results.\nFirst, we show analytically that when true statistical power is relatively low,\ncomputing power based on statistically significant results will lead to\noverestimates of power. Then, we present a case study using 10 experimental\ncomparisons drawn from a recently published meta-analysis in psycholinguistics\n(Jäger et al., 2017). We show that the statistically significant results\nyield an illusion of replicability. This illusion holds even if the researcher\ndoesn't conduct any formal power analysis but just uses statistical\nsignificance to informally assess robustness (i.e., replicability) of results.\n",
"title": "The statistical significance filter leads to overconfident expectations of replicability"
} | null | null | [
"Mathematics",
"Statistics"
]
| null | true | null | 741 | null | Validated | null | null |
null | {
"abstract": " The center-of-mass motion of a single optically levitated nanoparticle\nresembles three uncoupled harmonic oscillators. We show how a suitable\nmodulation of the optical trapping potential can give rise to a coupling\nbetween two of these oscillators, such that their dynamics are governed by a\nclassical equation of motion that resembles the Schrödinger equation for a\ntwo-level system. Based on experimental data, we illustrate the dynamics of\nthis parametrically coupled system both in the frequency and in the time\ndomain. We discuss the limitations and differences of the mechanical analogue\nin comparison to a true quantum mechanical system.\n",
"title": "A levitated nanoparticle as a classical two-level atom"
} | null | null | null | null | true | null | 742 | null | Default | null | null |
null | {
"abstract": " We introduce new techniques to the analysis of neural spatiotemporal dynamics\nvia applying $\\epsilon$-machine reconstruction to electroencephalography (EEG)\nmicrostate sequences. Microstates are short duration quasi-stable states of the\ndynamically changing electrical field topographies recorded via an array of\nelectrodes from the human scalp, and cluster into four canonical classes. The\nsequence of microstates observed under particular conditions can be considered\nan information source with unknown underlying structure. $\\epsilon$-machines\nare discrete dynamical system automata with state-dependent probabilities on\ndifferent future observations (in this case the next measured EEG microstate).\nThey artificially reproduce underlying structure in an optimally predictive\nmanner as generative models exhibiting dynamics emulating the behaviour of the\nsource. Here we present experiments using both simulations and empirical data\nsupporting the value of associating these discrete dynamical systems with\nmental states (e.g. mind-wandering, focused attention, etc.) and with clinical\npopulations. The neurodynamics of mental states and clinical populations can\nthen be further characterized by properties of these dynamical systems,\nincluding: i) statistical complexity (determined by the number of states of the\ncorresponding $\\epsilon$-automaton); ii) entropy rate; iii) characteristic\nsequence patterning (syntax, probabilistic grammars); iv) duration, persistence\nand stability of dynamical patterns; and v) algebraic measures such as\nKrohn-Rhodes complexity or holonomy length of the decompositions of these. The\npotential applications include the characterization of mental states in\nneurodynamic terms for mental health diagnostics, well-being interventions,\nhuman-machine interface, and others on both subject-specific and\ngroup/population-level.\n",
"title": "Simulating and Reconstructing Neurodynamics with Epsilon-Automata Applied to Electroencephalography (EEG) Microstate Sequences"
} | null | null | null | null | true | null | 743 | null | Default | null | null |
null | {
"abstract": " We describe a 20-year survey carried out by the Lick-Carnegie Exoplanet\nSurvey Team (LCES), using precision radial velocities from HIRES on the Keck-I\ntelescope to find and characterize extrasolar planetary systems orbiting nearby\nF, G, K, and M dwarf stars. We provide here 60,949 precision radial velocities\nfor 1,624 stars contained in that survey. We tabulate a list of 357 significant\nperiodic signals that are of constant period and phase, and not coincident in\nperiod and/or phase with stellar activity indices. These signals are thus\nstrongly suggestive of barycentric reflex motion of the star induced by one or\nmore candidate exoplanets in Keplerian motion about the host star. Of these\nsignals, 225 have already been published as planet claims, 60 are classified as\nsignificant unpublished planet candidates that await photometric follow-up to\nrule out activity-related causes, and 54 are also unpublished, but are\nclassified as \"significant\" signals that require confirmation by additional\ndata before rising to classification as planet candidates. Of particular\ninterest is our detection of a candidate planet with a minimum mass of 3.9\nEarth masses and an orbital period of 9.9 days orbiting Lalande 21185, the\nfourth-closest main sequence star to the Sun. For each of our exoplanetary\ncandidate signals, we provide the period and semi-amplitude of the Keplerian\norbital fit, and a likelihood ratio estimate of its statistical significance.\nWe also tabulate 18 Keplerian-like signals that we classify as likely arising\nfrom stellar activity.\n",
"title": "The LCES HIRES/Keck Precision Radial Velocity Exoplanet Survey"
} | null | null | [
"Physics"
]
| null | true | null | 744 | null | Validated | null | null |
null | {
"abstract": " Artificial intelligence methods have often been applied to perform specific\nfunctions or tasks in the cyber-defense realm. However, as adversary methods\nbecome more complex and difficult to divine, piecemeal efforts to understand\ncyber-attacks, and malware-based attacks in particular, are not providing\nsufficient means for malware analysts to understand the past, present and\nfuture characteristics of malware.\nIn this paper, we present the Malware Analysis and Attributed using Genetic\nInformation (MAAGI) system. The underlying idea behind the MAAGI system is that\nthere are strong similarities between malware behavior and biological organism\nbehavior, and applying biologically inspired methods to corpora of malware can\nhelp analysts better understand the ecosystem of malware attacks. Due to the\nsophistication of the malware and the analysis, the MAAGI system relies heavily\non artificial intelligence techniques to provide this capability. It has\nalready yielded promising results over its development life, and will hopefully\ninspire more integration between the artificial intelligence and cyber--defense\ncommunities.\n",
"title": "Artificial Intelligence Based Malware Analysis"
} | null | null | null | null | true | null | 745 | null | Default | null | null |
null | {
"abstract": " Let a and b be algebraic numbers such that exactly one of a and b is an\nalgebraic integer, and let f_t(z):=z^2+t be a family of polynomials\nparametrized by t. We prove that the set of all algebraic numbers t for which\nthere exist positive integers m and n such that f_t^m(a)=f_t^n(b) has bounded\nWeil height. This is a special case of a more general result supporting a new\nbounded height conjecture in dynamics. Our results fit into the general setting\nof the principle of unlikely intersections in arithmetic dynamics.\n",
"title": "Bounded height in families of dynamical systems"
} | null | null | null | null | true | null | 746 | null | Default | null | null |
null | {
"abstract": " This note establishes the input-to-state stability (ISS) property for a\nclamped-free damped string with respect to distributed and boundary\ndisturbances. While efficient methods for establishing ISS properties for\ndistributed parameter systems with respect to distributed disturbances have\nbeen developed during the last decades, establishing ISS properties with\nrespect to boundary disturbances remains challenging. One of the well-known\nmethods for well-posedness analysis of systems with boundary inputs is to use\nan adequate lifting operator, which transfers the boundary disturbance to a\ndistributed one. However, the resulting distributed disturbance involves time\nderivatives of the boundary perturbation. Thus, the subsequent ISS estimate\ndepends on its amplitude, and may not be expressed in the strict form of ISS\nproperties. To solve this problem, we show for a clamped-free damped string\nequation that the projection of the original system trajectories in an adequate\nRiesz basis can be used to establish the desired ISS property.\n",
"title": "Input-to-State Stability of a Clamped-Free Damped String in the Presence of Distributed and Boundary Disturbances"
} | null | null | null | null | true | null | 747 | null | Default | null | null |
null | {
"abstract": " The problem of reliable communication over the multiple-access channel (MAC)\nwith states is investigated. We propose a new coding scheme for this problem\nwhich uses quasi-group codes (QGC). We derive a new computable single-letter\ncharacterization of the achievable rate region. As an example, we investigate\nthe problem of doubly-dirty MAC with modulo-$4$ addition. It is shown that the\nsum-rate $R_1+R_2=1$ bits per channel use is achievable using the new scheme.\nWhereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates\ngreater than $0.32$ are not achievable.\n",
"title": "A New Achievable Rate Region for Multiple-Access Channel with States"
} | null | null | null | null | true | null | 748 | null | Default | null | null |
null | {
"abstract": " We present a new paradigm for understanding optical absorption and hot\nelectron dynamics experiments in graphene. Our analysis pivots on assigning\nproper importance to phonon assisted indirect processes and bleaching of direct\nprocesses. We show indirect processes figure in the excess absorption in the UV\nregion. Experiments which were thought to indicate ultrafast relaxation of\nelectrons and holes, reaching a thermal distribution from an extremely\nnon-thermal one in under 5-10 fs, instead are explained by the nascent electron\nand hole distributions produced by indirect transitions. These need no\nrelaxation or ad-hoc energy removal to agree with the observed emission spectra\nand fast pulsed absorption spectra. The fast emission following pulsed\nabsorption is dominated by phonon assisted processes, which vastly outnumber\ndirect ones and are always available, connecting any electron with any hole any\ntime. Calculations are given, including explicitly calculating the magnitude of\nindirect processes, supporting these views.\n",
"title": "Reassessing Graphene Absorption and Emission Spectroscopy"
} | null | null | null | null | true | null | 749 | null | Default | null | null |
null | {
"abstract": " We propose a probabilistic model for interpreting gene expression levels that\nare observed through single-cell RNA sequencing. In the model, each cell has a\nlow-dimensional latent representation. Additional latent variables account for\ntechnical effects that may erroneously set some observations of gene expression\nlevels to zero. Conditional distributions are specified by neural networks,\ngiving the proposed model enough flexibility to fit the data well. We use\nvariational inference and stochastic optimization to approximate the posterior\ndistribution. The inference procedure scales to over one million cells, whereas\ncompeting algorithms do not. Even for smaller datasets, for several tasks, the\nproposed procedure outperforms state-of-the-art methods like ZIFA and\nZINB-WaVE. We also extend our framework to take into account batch effects and\nother confounding factors and propose a natural Bayesian hypothesis framework\nfor differential expression that outperforms tradition DESeq2.\n",
"title": "A deep generative model for single-cell RNA sequencing with application to detecting differentially expressed genes"
} | null | null | null | null | true | null | 750 | null | Default | null | null |
null | {
"abstract": " Macronovae (kilonovae) that arise in binary neutron star mergers are powered\nby radioactive beta decay of hundreds of $r$-process nuclides. We derive, using\nFermi's theory of beta decay, an analytic estimate of the nuclear heating rate.\nWe show that the heating rate evolves as a power law ranging between $t^{-6/5}$\nto $t^{-4/3}$. The overall magnitude of the heating rate is determined by the\nmean values of nuclear quantities, e.g., the nuclear matrix elements of beta\ndecay. These values are specified by using nuclear experimental data. We\ndiscuss the role of higher order beta transitions and the robustness of the\npower law. The robust and simple form of the heating rate suggests that\nobservations of the late-time bolometric light curve $\\propto t^{-\\frac{4}{3}}$\nwould be a direct evidence of a $r$-process driven macronova. Such observations\ncould also enable us to estimate the total amount of $r$-process nuclei\nproduced in the merger.\n",
"title": "Analytic heating rate of neutron star merger ejecta derived from Fermi's theory of beta decay"
} | null | null | null | null | true | null | 751 | null | Default | null | null |
null | {
"abstract": " The calculation of caloric properties such as heat capacity, Joule-Thomson\ncoefficients and the speed of sound by classical force-field-based molecular\nsimulation methodology has received scant attention in the literature,\nparticularly for systems composed of complex molecules whose force fields (FFs)\nare characterized by a combination of intramolecular and intermolecular terms\n(referred to herein as \"flexible FFs\"). The calculation of a thermodynamic\nproperty for a system whose molecules are described by such a FF involves the\ncalculation of the residual property prior to its addition to the corresponding\nideal-gas (IG) property, the latter of which is separately calculated, either\nusing thermochemical compilations or nowadays accurate quantum mechanical\ncalculations. Although the simulation of a volumetric residual property\nproceeds by simply replacing the intermolecular FF in the rigid molecule case\nby the total (intramolecular plus intermolecular) FF, this is not the case for\na caloric property. We discuss the methodology required in performing such\ncalculations, and focus on the example of the molar heat capacity at constant\npressure, $c_P$, one of the most important caloric properties. We also consider\nthree approximations for the calculation procedure, and illustrate their\nconsequences for the examples of the relatively simple molecule 2-propanol,\n${\\rm CH_3CH(OH)CH_3}$, and for monoethanolamine, ${\\rm HO(CH_2)_2NH_2}$, an\nimportant fluid used in carbon capture.\n",
"title": "Molecular Simulation of Caloric Properties of Fluids Modelled by Force Fields with Intramolecular Contributions: Application to Heat Capacities"
} | null | null | null | null | true | null | 752 | null | Default | null | null |
null | {
"abstract": " We study well-posedness of a velocity-vorticity formulation of the\nNavier--Stokes equations, supplemented with no-slip velocity boundary\nconditions, a no-penetration vorticity boundary condition, along with a natural\nvorticity boundary condition depending on a pressure functional. In the\nstationary case we prove existence and uniqueness of a suitable weak solution\nto the system under a small data condition. The topic of the paper is driven by\nrecent developments of vorticity based numerical methods for the Navier--Stokes\nequations.\n",
"title": "On well-posedness of a velocity-vorticity formulation of the Navier-Stokes equations with no-slip boundary conditions"
} | null | null | null | null | true | null | 753 | null | Default | null | null |
null | {
"abstract": " Generative Adversarial Networks (GANs) represent a promising class of\ngenerative networks that combine neural networks with game theory. From\ngenerating realistic images and videos to assisting musical creation, GANs are\ntransforming many fields of arts and sciences. However, their application to\nhealthcare has not been fully realized, more specifically in generating\nelectronic health records (EHR) data. In this paper, we propose a framework for\nexploring the value of GANs in the context of continuous laboratory time series\ndata. We devise an unsupervised evaluation method that measures the predictive\npower of synthetic laboratory test time series. Further, we show that when it\ncomes to predicting the impact of drug exposure on laboratory test data,\nincorporating representation learning of the training cohorts prior to training\nGAN models is beneficial.\n",
"title": "Generative Adversarial Networks for Electronic Health Records: A Framework for Exploring and Evaluating Methods for Predicting Drug-Induced Laboratory Test Trajectories"
} | null | null | null | null | true | null | 754 | null | Default | null | null |
null | {
"abstract": " A database of minima and transition states corresponds to a network where the\nminima represent nodes and the transition states correspond to edges between\nthe pairs of minima they connect via steepest-descent paths. Here we construct\nnetworks for small clusters bound by the Morse potential for a selection of\nphysically relevant parameters, in two and three dimensions. The properties of\nthese unweighted and undirected networks are analysed to examine two features:\nwhether they are small-world, where the shortest path between nodes involves\nonly a small number or edges; and whether they are scale-free, having a degree\ndistribution that follows a power law. Small-world character is present, but\nstatistical tests show that a power law is not a good fit, so the networks are\nnot scale-free. These results for clusters are compared with the corresponding\nproperties for the molecular and atomic structural glass formers\northo-terphenyl and binary Lennard-Jones. These glassy systems do not show\nsmall-world properties, suggesting that such behaviour is linked to the\nstructure-seeking landscapes of the Morse clusters.\n",
"title": "Properties of Kinetic Transition Networks for Atomic Clusters and Glassy Solids"
} | null | null | null | null | true | null | 755 | null | Default | null | null |
null | {
"abstract": " Asynchronous distributed machine learning solutions have proven very\neffective so far, but always assuming perfectly functioning workers. In\npractice, some of the workers can however exhibit Byzantine behavior, caused by\nhardware failures, software bugs, corrupt data, or even malicious attacks. We\nintroduce \\emph{Kardam}, the first distributed asynchronous stochastic gradient\ndescent (SGD) algorithm that copes with Byzantine workers. Kardam consists of\ntwo complementary components: a filtering and a dampening component. The first\nis scalar-based and ensures resilience against $\\frac{1}{3}$ Byzantine workers.\nEssentially, this filter leverages the Lipschitzness of cost functions and acts\nas a self-stabilizer against Byzantine workers that would attempt to corrupt\nthe progress of SGD. The dampening component bounds the convergence rate by\nadjusting to stale information through a generic gradient weighting scheme. We\nprove that Kardam guarantees almost sure convergence in the presence of\nasynchrony and Byzantine behavior, and we derive its convergence rate. We\nevaluate Kardam on the CIFAR-100 and EMNIST datasets and measure its overhead\nwith respect to non Byzantine-resilient solutions. We empirically show that\nKardam does not introduce additional noise to the learning procedure but does\ninduce a slowdown (the cost of Byzantine resilience) that we both theoretically\nand empirically show to be less than $f/n$, where $f$ is the number of\nByzantine failures tolerated and $n$ the total number of workers.\nInterestingly, we also empirically observe that the dampening component is\ninteresting in its own right for it enables to build an SGD algorithm that\noutperforms alternative staleness-aware asynchronous competitors in\nenvironments with honest workers.\n",
"title": "Asynchronous Byzantine Machine Learning (the case of SGD)"
} | null | null | null | null | true | null | 756 | null | Default | null | null |
null | {
"abstract": " This paper describes an English audio and textual dataset of debating\nspeeches, a unique resource for the growing research field of computational\nargumentation and debating technologies. We detail the process of speech\nrecording by professional debaters, the transcription of the speeches with an\nAutomatic Speech Recognition (ASR) system, their consequent automatic\nprocessing to produce a text that is more \"NLP-friendly\", and in parallel --\nthe manual transcription of the speeches in order to produce gold-standard\n\"reference\" transcripts. We release 60 speeches on various controversial\ntopics, each in five formats corresponding to the different stages in the\nproduction of the data. The intention is to allow utilizing this resource for\nmultiple research purposes, be it the addition of in-domain training data for a\ndebate-specific ASR system, or applying argumentation mining on either noisy or\nclean debate transcripts. We intend to make further releases of this data in\nthe future.\n",
"title": "A Recorded Debating Dataset"
} | null | null | null | null | true | null | 757 | null | Default | null | null |
null | {
"abstract": " Deep learning has been demonstrated to achieve excellent results for image\nclassification and object detection. However, the impact of deep learning on\nvideo analysis (e.g. action detection and recognition) has been limited due to\ncomplexity of video data and lack of annotations. Previous convolutional neural\nnetworks (CNN) based video action detection approaches usually consist of two\nmajor steps: frame-level action proposal detection and association of proposals\nacross frames. Also, these methods employ two-stream CNN framework to handle\nspatial and temporal feature separately. In this paper, we propose an\nend-to-end deep network called Tube Convolutional Neural Network (T-CNN) for\naction detection in videos. The proposed architecture is a unified network that\nis able to recognize and localize action based on 3D convolution features. A\nvideo is first divided into equal length clips and for each clip a set of tube\nproposals are generated next based on 3D Convolutional Network (ConvNet)\nfeatures. Finally, the tube proposals of different clips are linked together\nemploying network flow and spatio-temporal action detection is performed using\nthese linked video proposals. Extensive experiments on several video datasets\ndemonstrate the superior performance of T-CNN for classifying and localizing\nactions in both trimmed and untrimmed videos compared to state-of-the-arts.\n",
"title": "Tube Convolutional Neural Network (T-CNN) for Action Detection in Videos"
} | null | null | null | null | true | null | 758 | null | Default | null | null |
null | {
"abstract": " We develop the theoretical foundations of a network distance that has\nrecently been applied to various subfields of topological data analysis, namely\npersistent homology and hierarchical clustering. While this network distance\nhas previously appeared in the context of finite networks, we extend the\nsetting to that of compact networks. The main challenge in this new setting is\nthe lack of an easy notion of sampling from compact networks; we solve this\nproblem in the process of obtaining our results. The generality of our setting\nmeans that we automatically establish results for exotic objects such as\ndirected metric spaces and Finsler manifolds. We identify readily computable\nnetwork invariants and establish their quantitative stability under this\nnetwork distance. We also discuss the computational complexity involved in\nprecisely computing this distance, and develop easily-computable lower bounds\nby using the identified invariants. By constructing a wide range of explicit\nexamples, we show that these lower bounds are effective in distinguishing\nbetween networks. Finally, we provide a simple algorithm that computes a lower\nbound on the distance between two networks in polynomial time and illustrate\nour metric and invariant constructions on a database of random networks and a\ndatabase of simulated hippocampal networks.\n",
"title": "Distances and Isomorphism between Networks and the Stability of Network Invariants"
} | null | null | null | null | true | null | 759 | null | Default | null | null |
null | {
"abstract": " Using the Panama Papers, we show that the beginning of media reporting on\nexpropriations and property confiscations in a country increases the\nprobability that offshore entities are incorporated by agents from the same\ncountry in the same month. This result is robust to the use of country-year\nfixed effects and the exclusion of tax havens. Further analysis shows that the\neffect is driven by countries with non-corrupt and effective governments, which\nsupports the notion that offshore entities are incorporated when reasonably\nwell-intended and well-functioning governments become more serious about\nfighting organized crime by confiscating proceeds of crime.\n",
"title": "Expropriations, Property Confiscations and New Offshore Entities: Evidence from the Panama Papers"
} | null | null | null | null | true | null | 760 | null | Default | null | null |
null | {
"abstract": " Mammography screening for early detection of breast lesions currently suffers\nfrom high amounts of false positive findings, which result in unnecessary\ninvasive biopsies. Diffusion-weighted MR images (DWI) can help to reduce many\nof these false-positive findings prior to biopsy. Current approaches estimate\ntissue properties by means of quantitative parameters taken from generative,\nbiophysical models fit to the q-space encoded signal under certain assumptions\nregarding noise and spatial homogeneity. This process is prone to fitting\ninstability and partial information loss due to model simplicity. We reveal\nunexplored potentials of the signal by integrating all data processing\ncomponents into a convolutional neural network (CNN) architecture that is\ndesigned to propagate clinical target information down to the raw input images.\nThis approach enables simultaneous and target-specific optimization of image\nnormalization, signal exploitation, global representation learning and\nclassification. Using a multicentric data set of 222 patients, we demonstrate\nthat our approach significantly improves clinical decision making with respect\nto the current state of the art.\n",
"title": "Revealing Hidden Potentials of the q-Space Signal in Breast Cancer"
} | null | null | null | null | true | null | 761 | null | Default | null | null |
null | {
"abstract": " Small depth networks arise in a variety of network related applications,\noften in the form of maximum flow and maximum weighted matching. Recent works\nhave generalized such methods to include costs arising from concave functions.\nIn this paper we give an algorithm that takes a depth $D$ network and strictly\nincreasing concave weight functions of flows on the edges and computes a $(1 -\n\\epsilon)$-approximation to the maximum weight flow in time $mD \\epsilon^{-1}$\ntimes an overhead that is logarithmic in the various numerical parameters\nrelated to the magnitudes of gradients and capacities.\nOur approach is based on extending the scaling algorithm for approximate\nmaximum weighted matchings by [Duan-Pettie JACM`14] to the setting of small\ndepth networks, and then generalizing it to concave functions. In this more\nrestricted setting of linear weights in the range $[w_{\\min}, w_{\\max}]$, it\nproduces a $(1 - \\epsilon)$-approximation in time $O(mD \\epsilon^{-1} \\log(\nw_{\\max} /w_{\\min}))$. The algorithm combines a variety of tools and provides a\nunified approach towards several problems involving small depth networks.\n",
"title": "Concave Flow on Small Depth Directed Networks"
} | null | null | null | null | true | null | 762 | null | Default | null | null |
null | {
"abstract": " Knowledge-intensive companies that adopt Agile Software Development (ASD)\nrelay on efficient implementation of Knowledge Management (KM) strategies to\npromotes different Knowledge Processes (KPs) to gain competitive advantage.\nThis study aims to explore how companies that adopt ASD implement KM strategies\nutilizing practices that promote the KPs in the different organizational\nlayers. Through a systematic literature review, we analyzed 32 primary studies,\nselected by automated search and snowballing in the extant literature. To\nanalyze the data, we applied narrative synthesis. Most of the identified KM\npractices implement personalization strategies (81 %), supported by\ncodification (19 %). Our review shows that the primary studies do not report KM\npractices in the strategic layer and two of them in the product portfolio\nlayer; on the other hand, in the project layer, the studies report 33 practices\nthat implement personalization strategy, and seven practices that implement\ncodification. KM strategies in ASD promote mainly the knowledge transfer\nprocess with practices that stimulate social interaction to share tacit\nknowledge in the project layer. As a result of using informal communication, a\nsignificant amount of knowledge can be lost or not properly transferred to\nother individuals and, instead of propagating the knowledge, it remains inside\na few individuals minds.\n",
"title": "Knowledge Management Strategies and Processes in Agile Software Development: A Systematic Literature Review"
} | null | null | null | null | true | null | 763 | null | Default | null | null |
null | {
"abstract": " Recent 60Fe results have suggested that the estimated distances of supernovae\nin the last few million years should be reduced from 100 pc to 50 pc. Two\nevents or series of events are suggested, one about 2.7 million years to 1.7\nmillion years ago, and another may at 6.5 to 8.7 million years ago. We ask what\neffects such supernovae are expected to have on the terrestrial atmosphere and\nbiota. Assuming that the Local Bubble was formed before the event being\nconsidered, and that the supernova and the Earth were both inside a weak,\ndisordered magnetic field at that time, TeV-PeV cosmic rays at Earth will\nincrease by a factor of a few hundred. Tropospheric ionization will increase\nproportionately, and the overall muon radiation load on terrestrial organisms\nwill increase by a factor of 150. All return to pre-burst levels within 10kyr.\nIn the case of an ordered magnetic field, effects depend strongly on the field\norientation. The upper bound in this case is with a largely coherent field\naligned along the line of sight to the supernova, in which case TeV-PeV cosmic\nray flux increases are 10^4; in the case of a transverse field they are below\ncurrent levels. We suggest a substantial increase in the extended effects of\nsupernovae on Earth and in the lethal distance estimate; more work is\nneeded.This paper is an explicit followup to Thomas et al. (2016). We also here\nprovide more detail on the computational procedures used in both works.\n",
"title": "A supernova at 50 pc: Effects on the Earth's atmosphere and biota"
} | null | null | null | null | true | null | 764 | null | Default | null | null |
null | {
"abstract": " The surface tension of flowing soap films is measured with respect to the\nfilm thickness and the concentration of soap solution. We perform this\nmeasurement by measuring the curvature of the nylon wires that bound the soap\nfilm channel and use the measured curvature to parametrize the relation between\nthe surface tension and the tension of the wire. We find the surface tension of\nour soap films increases when the film is relatively thin or made of soap\nsolution of low concentration, otherwise it approaches an asymptotic value 30\nmN/m. A simple adsorption model with only two parameters describes our\nobservations reasonably well. With our measurements, we are also able to\nmeasure Gibbs elasticity for our soap film.\n",
"title": "Surface tension of flowing soap films"
} | null | null | null | null | true | null | 765 | null | Default | null | null |
null | {
"abstract": " Indoor localization based on Visible Light Communication (VLC) has been in\nfavor with both the academia and industry for years. In this paper, we present\na prototyping photodiode-based VLC system towards large-scale localization.\nSpecially, we give in-depth analysis of the design constraints and\nconsiderations for large-scale indoor localization research. After that we\nidentify the key enablers for such systems: 1) distributed architecture, 2)\none-way communication, and 3) random multiple access. Accordingly, we propose\nPlugo -- a photodiode-based VLC system conforming to the aforementioned\ncriteria. We present a compact design of the VLC-compatible LED bulbs featuring\nplug-and-go use-cases. The basic framed slotted Additive Links On-line Hawaii\nArea (ALOHA) is exploited to achieve random multiple access over the shared\noptical medium. We show its effectiveness in beacon broadcasting by\nexperiments, and further demonstrate its scalability to large-scale scenarios\nthrough simulations. Finally, preliminary localization experiments are\nconducted using fingerprinting-based methods in a customized testbed, achieving\nan average accuracy of 0.14 m along with a 90-percentile accuracy of 0.33 m.\n",
"title": "Plugo: a VLC Systematic Perspective of Large-scale Indoor Localization"
} | null | null | null | null | true | null | 766 | null | Default | null | null |
null | {
"abstract": " We show that the output of a (residual) convolutional neural network (CNN)\nwith an appropriate prior over the weights and biases is a Gaussian process\n(GP) in the limit of infinitely many convolutional filters, extending similar\nresults for dense networks. For a CNN, the equivalent kernel can be computed\nexactly and, unlike \"deep kernels\", has very few parameters: only the\nhyperparameters of the original CNN. Further, we show that this kernel has two\nproperties that allow it to be computed efficiently; the cost of evaluating the\nkernel for a pair of images is similar to a single forward pass through the\noriginal CNN with only one filter per layer. The kernel equivalent to a\n32-layer ResNet obtains 0.84% classification error on MNIST, a new record for\nGPs with a comparable number of parameters.\n",
"title": "Deep Convolutional Networks as shallow Gaussian Processes"
} | null | null | null | null | true | null | 767 | null | Default | null | null |
null | {
"abstract": " Detecting attacks in control systems is an important aspect of designing\nsecure and resilient control systems. Recently, a dynamic watermarking approach\nwas proposed for detecting malicious sensor attacks for SISO LTI systems with\npartial state observations and MIMO LTI systems with a full rank input matrix\nand full state observations; however, these previous approaches cannot be\napplied to general LTI systems that are MIMO and have partial state\nobservations. This paper designs a dynamic watermarking approach for detecting\nmalicious sensor attacks for general LTI systems, and we provide a new set of\nasymptotic and statistical tests. We prove these tests can detect attacks that\nfollow a specified attack model (more general than replay attacks), and we also\nshow that these tests simplify to existing tests when the system is SISO or has\nfull rank input matrix and full state observations. The benefit of our approach\nis demonstrated with a simulation analysis of detecting sensor attacks in\nautonomous vehicles. Our approach can distinguish between sensor attacks and\nwind disturbance (through an internal model principle framework), whereas\nimproperly designed tests cannot distinguish between sensor attacks and wind\ndisturbance.\n",
"title": "Dynamic Watermarking for General LTI Systems"
} | null | null | null | null | true | null | 768 | null | Default | null | null |
null | {
"abstract": " For people with visual impairments, tactile graphics are an important means\nto learn and explore information. However, raised line tactile graphics created\nwith traditional materials such as embossing are static. While available\nrefreshable displays can dynamically change the content, they are still too\nexpensive for many users, and are limited in size. These factors limit\nwide-spread adoption and the representation of large graphics or data sets. In\nthis paper, we present FluxMaker, an inexpensive scalable system that renders\ndynamic information on top of static tactile graphics with movable tactile\nmarkers. These dynamic tactile markers can be easily reconfigured and used to\nannotate static raised line tactile graphics, including maps, graphs, and\ndiagrams. We developed a hardware prototype that actuates magnetic tactile\nmarkers driven by low-cost and scalable electromagnetic coil arrays, which can\nbe fabricated with standard printed circuit board manufacturing. We evaluate\nour prototype with six participants with visual impairments and found positive\nresults across four application areas: location finding or navigating on\ntactile maps, data analysis, and physicalization, feature identification for\ntactile graphics, and drawing support. The user study confirms advantages in\napplication domains such as education and data exploration.\n",
"title": "FluxMarker: Enhancing Tactile Graphics with Dynamic Tactile Markers"
} | null | null | null | null | true | null | 769 | null | Default | null | null |
null | {
"abstract": " Very often features come with their own vectorial descriptions which provide\ndetailed information about their properties. We refer to these vectorial\ndescriptions as feature side-information. In the standard learning scenario,\ninput is represented as a vector of features and the feature side-information\nis most often ignored or used only for feature selection prior to model\nfitting. We believe that feature side-information which carries information\nabout features intrinsic property will help improve model prediction if used in\na proper way during learning process. In this paper, we propose a framework\nthat allows for the incorporation of the feature side-information during the\nlearning of very general model families to improve the prediction performance.\nWe control the structures of the learned models so that they reflect features\nsimilarities as these are defined on the basis of the side-information. We\nperform experiments on a number of benchmark datasets which show significant\npredictive performance gains, over a number of baselines, as a result of the\nexploitation of the side-information.\n",
"title": "Regularising Non-linear Models Using Feature Side-information"
} | null | null | null | null | true | null | 770 | null | Default | null | null |
null | {
"abstract": " We give a short proof of the $L^{1}$ criterion for Beurling generalized\nintegers to have a positive asymptotic density. We actually prove the existence\nof density under a weaker hypothesis. We also discuss related sufficient\nconditions for the estimate $m(x)=\\sum_{n_{k}\\leq x} \\mu(n_k)/n_k=o(1)$, with\n$\\mu$ the Beurling analog of the Moebius function.\n",
"title": "On Diamond's $L^1$ criterion for asymptotic density of Beurling generalized integers"
} | null | null | null | null | true | null | 771 | null | Default | null | null |
null | {
"abstract": " Social media users often make explicit predictions about upcoming events.\nSuch statements vary in the degree of certainty the author expresses toward the\noutcome:\"Leonardo DiCaprio will win Best Actor\" vs. \"Leonardo DiCaprio may win\"\nor \"No way Leonardo wins!\". Can popular beliefs on social media predict who\nwill win? To answer this question, we build a corpus of tweets annotated for\nveridicality on which we train a log-linear classifier that detects positive\nveridicality with high precision. We then forecast uncertain outcomes using the\nwisdom of crowds, by aggregating users' explicit predictions. Our method for\nforecasting winners is fully automated, relying only on a set of contenders as\ninput. It requires no training data of past outcomes and outperforms sentiment\nand tweet volume baselines on a broad range of contest prediction tasks. We\nfurther demonstrate how our approach can be used to measure the reliability of\nindividual accounts' predictions and retrospectively identify surprise\noutcomes.\n",
"title": "\"i have a feeling trump will win..................\": Forecasting Winners and Losers from User Predictions on Twitter"
} | null | null | null | null | true | null | 772 | null | Default | null | null |
null | {
"abstract": " Applications involving autonomous navigation and planning of mobile agents\ncan benefit greatly by employing online Simultaneous Localization and Mapping\n(SLAM) techniques, however, their proper implementation still warrants an\nefficient amalgamation with any offline path planning method that may be used\nfor the particular application. In this paper, such a case of amalgamation is\nconsidered for a LiDAR-based indoor mapping system which presents itself as a\n2D coverage path planning problem implemented along with online SLAM. This\npaper shows how classic offline Coverage Path Planning (CPP) can be altered for\nuse with online SLAM by proposing two modifications: (i) performing convex\ndecomposition of the polygonal coverage area to allow for an arbitrary choice\nof an initial point while still tracing the shortest coverage path and (ii)\nusing a new approach to stitch together the different cells within the\npolygonal area to form a continuous coverage path. Furthermore, an alteration\nto the SLAM operation to suit the coverage path planning strategy is also made\nthat evaluates navigation errors in terms of an area coverage cost function.\nThe implementation results show how the combination of the two modified offline\nand online planning strategies allow for an improvement in the total area\ncoverage by the mapping system - the modification thus presents an approach for\nmodifying offline and online navigation strategies for robust operation.\n",
"title": "SLAM-Assisted Coverage Path Planning for Indoor LiDAR Mapping Systems"
} | null | null | null | null | true | null | 773 | null | Default | null | null |
null | {
"abstract": " We apply a method that combines the tight-binding approximation and the\nLowdin down-folding procedure to evaluate the electronic band structure of the\nnewly discovered pressure-induced superconductor CrAs. By integrating out all\nlow-lying arsenic degrees of freedom, we derive an effective Hamiltonian model\ndescribing the Cr d bands near the Fermi level. We calculate and make\npredictions for the energy spectra, the Fermi surface, the density of states\nand transport and magnetic properties of this compound. Our results are\nconsistent with local-density approximation calculations as well as they show\ngood agreement with available experimental data for resistivity and Cr magnetic\nmoment.\n",
"title": "Low energy bands and transport properties of chromium arsenide"
} | null | null | null | null | true | null | 774 | null | Default | null | null |
null | {
"abstract": " In this lecture note, we describe high dynamic range (HDR) imaging systems;\nsuch systems are able to represent luminances of much larger brightness and,\ntypically, also a larger range of colors than conventional standard dynamic\nrange (SDR) imaging systems. The larger luminance range greatly improve the\noverall quality of visual content, making it appears much more realistic and\nappealing to observers. HDR is one of the key technologies of the future\nimaging pipeline, which will change the way the digital visual content is\nrepresented and manipulated today.\n",
"title": "High Dynamic Range Imaging Technology"
} | null | null | null | null | true | null | 775 | null | Default | null | null |
null | {
"abstract": " We classify pro-$p$ Poincaré duality pairs in dimension two. We then use\nthis classification to build a pro-$p$ analogue of the curve complex and\nestablish its basic properties. We conclude with some statements concerning\nseparability properties of the mapping class group.\n",
"title": "Classification of pro-$p$ PD$^2$ pairs and the pro-$p$ curve complex"
} | null | null | [
"Mathematics"
]
| null | true | null | 776 | null | Validated | null | null |
null | {
"abstract": " Sports data analysis is becoming increasingly large-scale, diversified, and\nshared, but difficulty persists in rapidly accessing the most crucial\ninformation. Previous surveys have focused on the methodologies of sports video\nanalysis from the spatiotemporal viewpoint instead of a content-based\nviewpoint, and few of these studies have considered semantics. This study\ndevelops a deeper interpretation of content-aware sports video analysis by\nexamining the insight offered by research into the structure of content under\ndifferent scenarios. On the basis of this insight, we provide an overview of\nthe themes particularly relevant to the research on content-aware systems for\nbroadcast sports. Specifically, we focus on the video content analysis\ntechniques applied in sportscasts over the past decade from the perspectives of\nfundamentals and general review, a content hierarchical model, and trends and\nchallenges. Content-aware analysis methods are discussed with respect to\nobject-, event-, and context-oriented groups. In each group, the gap between\nsensation and content excitement must be bridged using proper strategies. In\nthis regard, a content-aware approach is required to determine user demands.\nFinally, the paper summarizes the future trends and challenges for sports video\nanalysis. We believe that our findings can advance the field of research on\ncontent-aware video analysis for broadcast sports.\n",
"title": "A Survey on Content-Aware Video Analysis for Sports"
} | null | null | null | null | true | null | 777 | null | Default | null | null |
null | {
"abstract": " In kernel methods, temporal information on the data is commonly included by\nusing time-delayed embeddings as inputs. Recently, an alternative formulation\nwas proposed by defining a gamma-filter explicitly in a reproducing kernel\nHilbert space, giving rise to a complex model where multiple kernels operate on\ndifferent temporal combinations of the input signal. In the original\nformulation, the kernels are then simply combined to obtain a single kernel\nmatrix (for instance by averaging), which provides computational benefits but\ndiscards important information on the temporal structure of the signal.\nInspired by works on multiple kernel learning, we overcome this drawback by\nconsidering the different kernels separately. We propose an efficient strategy\nto adaptively combine and select these kernels during the training phase. The\nresulting batch and online algorithms automatically learn to process highly\nnonlinear temporal information extracted from the input signal, which is\nimplicitly encoded in the kernel values. We evaluate our proposal on several\nartificial and real tasks, showing that it can outperform classical approaches\nboth in batch and online settings.\n",
"title": "Recursive Multikernel Filters Exploiting Nonlinear Temporal Structure"
} | null | null | null | null | true | null | 778 | null | Default | null | null |
null | {
"abstract": " We consider the problem of sequential learning from categorical observations\nbounded in [0,1]. We establish an ordering between the Dirichlet posterior over\ncategorical outcomes and a Gaussian posterior under observations with N(0,1)\nnoise. We establish that, conditioned upon identical data with at least two\nobservations, the posterior mean of the categorical distribution will always\nsecond-order stochastically dominate the posterior mean of the Gaussian\ndistribution. These results provide a useful tool for the analysis of\nsequential learning under categorical outcomes.\n",
"title": "Gaussian-Dirichlet Posterior Dominance in Sequential Learning"
} | null | null | null | null | true | null | 779 | null | Default | null | null |
null | {
"abstract": " We develop a new approach to learn the parameters of regression models with\nhidden variables. In a nutshell, we estimate the gradient of the regression\nfunction at a set of random points, and cluster the estimated gradients. The\ncenters of the clusters are used as estimates for the parameters of hidden\nunits. We justify this approach by studying a toy model, whereby the regression\nfunction is a linear combination of sigmoids. We prove that indeed the\nestimated gradients concentrate around the parameter vectors of the hidden\nunits, and provide non-asymptotic bounds on the number of required samples. To\nthe best of our knowledge, no comparable guarantees have been proven for linear\ncombinations of sigmoids.\n",
"title": "Learning Combinations of Sigmoids Through Gradient Estimation"
} | null | null | null | null | true | null | 780 | null | Default | null | null |
null | {
"abstract": " The intricate interplay between optically dark and bright excitons governs\nthe light-matter interaction in transition metal dichalcogenide monolayers. We\nhave performed a detailed investigation of the \"spin-forbidden\" dark excitons\nin WSe2 monolayers by optical spectroscopy in an out-of-plane magnetic field\nBz. In agreement with the theoretical predictions deduced from group theory\nanalysis, magneto-photoluminescence experiments reveal a zero field splitting\n$\\delta=0.6 \\pm 0.1$ meV between two dark exciton states. The low energy state\nbeing strictly dipole forbidden (perfectly dark) at Bz=0 while the upper state\nis partially coupled to light with z polarization (\"grey\" exciton). The first\ndetermination of the dark neutral exciton lifetime $\\tau_D$ in a transition\nmetal dichalcogenide monolayer is obtained by time-resolved photoluminescence.\nWe measure $\\tau_D \\sim 110 \\pm 10$ ps for the grey exciton state, i.e. two\norders of magnitude longer than the radiative lifetime of the bright neutral\nexciton at T=12 K.\n",
"title": "Fine Structure and Lifetime of Dark Excitons in Transition Metal Dichalcogenide Monolayers"
} | null | null | null | null | true | null | 781 | null | Default | null | null |
null | {
"abstract": " In this article, we develop a notion of Quillen bifibration which combines\nthe two notions of Grothendieck bifibration and of Quillen model structure. In\nparticular, given a bifibration $p:\\mathcal E\\to\\mathcal B$, we describe when a\nfamily of model structures on the fibers $\\mathcal E_A$ and on the basis\ncategory $\\mathcal B$ combines into a model structure on the total category\n$\\mathcal E$, such that the functor $p$ preserves cofibrations, fibrations and\nweak equivalences. Using this Grothendieck construction for model structures,\nwe revisit the traditional definition of Reedy model structures, and possible\ngeneralizations, and exhibit their bifibrational nature.\n",
"title": "On bifibrations of model categories"
} | null | null | null | null | true | null | 782 | null | Default | null | null |
null | {
"abstract": " In this paper we define canonical sine and cosine transform, convolution\noperations, prove convolution theorems in space of integrable functions on real\nspace. Further, obtain some results require to construct the spaces of\nintegrable Boehmians then extend this canonical sine and canonical cosine\ntransforms to space of integrable Boehmians and obtain their properties.\n",
"title": "Canonical sine and cosine Transforms For Integrable Boehmians"
} | null | null | null | null | true | null | 783 | null | Default | null | null |
null | {
"abstract": " Compressed sensing (CS) is a sampling theory that allows reconstruction of\nsparse (or compressible) signals from an incomplete number of measurements,\nusing of a sensing mechanism implemented by an appropriate projection matrix.\nThe CS theory is based on random Gaussian projection matrices, which satisfy\nrecovery guarantees with high probability; however, sparse ternary {0, -1, +1}\nprojections are more suitable for hardware implementation. In this paper, we\npresent a deep learning approach to obtain very sparse ternary projections for\ncompressed sensing. Our deep learning architecture jointly learns a pair of a\nprojection matrix and a reconstruction operator in an end-to-end fashion. The\nexperimental results on real images demonstrate the effectiveness of the\nproposed approach compared to state-of-the-art methods, with significant\nadvantage in terms of complexity.\n",
"title": "Deep Learning Sparse Ternary Projections for Compressed Sensing of Images"
} | null | null | null | null | true | null | 784 | null | Default | null | null |
null | {
"abstract": " Predictive models for music are studied by researchers of algorithmic\ncomposition, the cognitive sciences and machine learning. They serve as base\nmodels for composition, can simulate human prediction and provide a\nmultidisciplinary application domain for learning algorithms. A particularly\nwell established and constantly advanced subtask is the prediction of\nmonophonic melodies. As melodies typically involve non-Markovian dependencies\ntheir prediction requires a capable learning algorithm. In this thesis, I apply\nthe recent feature discovery and learning method PULSE to the realm of symbolic\nmusic modeling. PULSE is comprised of a feature generating operation and\nL1-regularized optimization. These are used to iteratively expand and cull the\nfeature set, effectively exploring feature spaces that are too large for common\nfeature selection approaches. I design a general Python framework for PULSE,\npropose task-optimized feature generating operations and various\nmusic-theoretically motivated features that are evaluated on a standard corpus\nof monophonic folk and chorale melodies. The proposed method significantly\noutperforms comparable state-of-the-art models. I further discuss the free\nparameters of the learning algorithm and analyze the feature composition of the\nlearned models. The models learned by PULSE afford an easy inspection and are\nmusicologically interpreted for the first time.\n",
"title": "Learning a Predictive Model for Music Using PULSE"
} | null | null | null | null | true | null | 785 | null | Default | null | null |
null | {
"abstract": " Many real-world data sets, especially in biology, are produced by highly\nmultivariate and nonlinear complex dynamical systems. In this paper, we focus\non brain imaging data, including both calcium imaging and functional MRI data.\nStandard vector-autoregressive models are limited by their linearity\nassumptions, while nonlinear general-purpose, large-scale temporal models, such\nas LSTM networks, typically require large amounts of training data, not always\nreadily available in biological applications; furthermore, such models have\nlimited interpretability. We introduce here a novel approach for learning a\nnonlinear differential equation model aimed at capturing brain dynamics.\nSpecifically, we propose a variable-projection optimization approach to\nestimate the parameters of the multivariate (coupled) van der Pol oscillator,\nand demonstrate that such a model can accurately represent nonlinear dynamics\nof the brain data. Furthermore, in order to improve the predictive accuracy\nwhen forecasting future brain-activity time series, we use this analytical\nmodel as an unlimited source of simulated data for pretraining LSTM; such\nmodel-specific data augmentation approach consistently improves LSTM\nperformance on both calcium and fMRI imaging data.\n",
"title": "Learning Nonlinear Brain Dynamics: van der Pol Meets LSTM"
} | null | null | null | null | true | null | 786 | null | Default | null | null |
null | {
"abstract": " In this research, we propose a deep learning based approach for speeding up\nthe topology optimization methods. The problem we seek to solve is the layout\nproblem. The main novelty of this work is to state the problem as an image\nsegmentation task. We leverage the power of deep learning methods as the\nefficient pixel-wise image labeling technique to perform the topology\noptimization. We introduce convolutional encoder-decoder architecture and the\noverall approach of solving the above-described problem with high performance.\nThe conducted experiments demonstrate the significant acceleration of the\noptimization process. The proposed approach has excellent generalization\nproperties. We demonstrate the ability of the application of the proposed model\nto other problems. The successful results, as well as the drawbacks of the\ncurrent method, are discussed.\n",
"title": "Neural networks for topology optimization"
} | null | null | null | null | true | null | 787 | null | Default | null | null |
null | {
"abstract": " We present and evaluate a technique for computing path-sensitive interference\nconditions during abstract interpretation of concurrent programs. In lieu of\nfixed point computation, we use prime event structures to compactly represent\ncausal dependence and interference between sequences of transformers. Our main\ncontribution is an unfolding algorithm that uses a new notion of independence\nto avoid redundant transformer application, thread-local fixed points to reduce\nthe size of the unfolding, and a novel cutoff criterion based on subsumption to\nguarantee termination of the analysis. Our experiments show that the abstract\nunfolding produces an order of magnitude fewer false alarms than a mature\nabstract interpreter, while being several orders of magnitude faster than\nsolver-based tools that have the same precision.\n",
"title": "Abstract Interpretation with Unfoldings"
} | null | null | null | null | true | null | 788 | null | Default | null | null |
null | {
"abstract": " The next generation of cosmological surveys will operate over unprecedented\nscales, and will therefore provide exciting new opportunities for testing\ngeneral relativity. The standard method for modelling the structures that these\nsurveys will observe is to use cosmological perturbation theory for linear\nstructures on horizon-sized scales, and Newtonian gravity for non-linear\nstructures on much smaller scales. We propose a two-parameter formalism that\ngeneralizes this approach, thereby allowing interactions between large and\nsmall scales to be studied in a self-consistent and well-defined way. This uses\nboth post-Newtonian gravity and cosmological perturbation theory, and can be\nused to model realistic cosmological scenarios including matter, radiation and\na cosmological constant. We find that the resulting field equations can be\nwritten as a hierarchical set of perturbation equations. At leading-order,\nthese equations allow us to recover a standard set of Friedmann equations, as\nwell as a Newton-Poisson equation for the inhomogeneous part of the Newtonian\nenergy density in an expanding background. For the perturbations in the\nlarge-scale cosmology, however, we find that the field equations are sourced by\nboth non-linear and mode-mixing terms, due to the existence of small-scale\nstructures. These extra terms should be expected to give rise to new\ngravitational effects, through the mixing of gravitational modes on small and\nlarge scales - effects that are beyond the scope of standard linear\ncosmological perturbation theory. We expect our formalism to be useful for\naccurately modelling gravitational physics in universes that contain non-linear\nstructures, and for investigating the effects of non-linear gravity in the era\nof ultra-large-scale surveys.\n",
"title": "Perturbation theory for cosmologies with non-linear structure"
} | null | null | null | null | true | null | 789 | null | Default | null | null |
null | {
"abstract": " Playing the game of heads or tails in zero gravity demonstrates that there\nexists a contextual \"measurement\" in classical mechanics. When the coin is\nflipped, its orientation is a continuous variable. However, the \"measurement\"\nthat occurs when the coin is caught by clapping two hands together gives a\ndiscrete value (heads or tails) that depends on the context (orientation of the\nhands). It is then shown that there is a strong analogy with the spin\nmeasurement of the Stern-Gerlach experiment, and in particular with Stern and\nGerlach's sequential measurements. Finally, we clarify the analogy by recalling\nhow the de Broglie-Bohm interpretation simply explains the spin \"measurement\".\n",
"title": "Heads or tails in zero gravity: an example of a classical contextual \"measurement\""
} | null | null | null | null | true | null | 790 | null | Default | null | null |
null | {
"abstract": " The variational autoencoder (VAE) is a popular model for density estimation\nand representation learning. Canonically, the variational principle suggests to\nprefer an expressive inference model so that the variational approximation is\naccurate. However, it is often overlooked that an overly-expressive inference\nmodel can be detrimental to the test set performance of both the amortized\nposterior approximator and, more importantly, the generative density estimator.\nIn this paper, we leverage the fact that VAEs rely on amortized inference and\npropose techniques for amortized inference regularization (AIR) that control\nthe smoothness of the inference model. We demonstrate that, by applying AIR, it\nis possible to improve VAE generalization on both inference and generative\nperformance. Our paper challenges the belief that amortized inference is simply\na mechanism for approximating maximum likelihood training and illustrates that\nregularization of the amortization family provides a new direction for\nunderstanding and improving generalization in VAEs.\n",
"title": "Amortized Inference Regularization"
} | null | null | null | null | true | null | 791 | null | Default | null | null |
null | {
"abstract": " Synchronization on multiplex networks have attracted increasing attention in\nthe past few years. We investigate collective behaviors of Kuramoto oscillators\non single layer and duplex spacial networks with total cost restriction, which\nwas introduced by Li et. al [Li G., Reis S. D., Moreira A. A., Havlin S.,\nStanley H. E. and Jr A. J., {\\it Phys. Rev. Lett.} 104, 018701 (2010)] and\ntermed as the Li network afterwards. In the Li network model, with the increase\nof its spacial exponent, the network's structure will vary from the random type\nto the small-world one, and finally to the regular lattice.We first explore how\nthe spacial exponent influences the synchronizability of Kuramoto oscillators\non single layer Li networks and find that the closer the Li network is to a\nregular lattice, the more difficult for it to evolve into synchronization. Then\nwe investigate synchronizability of duplex Li networks and find that the\nexistence of inter-layer interaction can greatly enhance inter-layer and global\nsynchronizability. When the inter-layer coupling strength is larger than a\ncertain critical value, whatever the intra-layer coupling strength is, the\ninter-layer synchronization will always occur. Furthermore, on single layer Li\nnetworks, nodes with larger degrees more easily reach global synchronization,\nwhile on duplex Li networks, this phenomenon becomes much less obvious.\nFinally, we study the impact of inter-link density on global synchronization\nand obtain that sparse inter-links can lead to the emergence of global\nsynchronization for duplex Li networks just as dense inter-links do. In a word,\ninter-layer interaction plays a vital role in determining synchronizability for\nduplex spacial networks with total cost constraint.\n",
"title": "Phase Synchronization on Spacially Embeded Duplex Networks with Total Cost Constraint"
} | null | null | null | null | true | null | 792 | null | Default | null | null |
null | {
"abstract": " We continue to investigate binary sequence $(f_u)$ over $\\{0,1\\}$ defined by\n$(-1)^{f_u}=\\left(\\frac{(u^w-u^{wp})/p}{p}\\right)$ for integers $u\\ge 0$, where\n$\\left(\\frac{\\cdot}{p}\\right)$ is the Legendre symbol and we restrict\n$\\left(\\frac{0}{p}\\right)=1$. In an earlier work, the linear complexity of\n$(f_u)$ was determined for $w=p-1$ under the assumption of $2^{p-1}\\not\\equiv 1\n\\pmod {p^2}$. In this work, we give possible values on the linear complexity of\n$(f_u)$ for all $1\\le w<p-1$ under the same conditions. We also state that the\ncase of larger $w(\\geq p)$ can be reduced to that of $0\\leq w\\leq p-1$.\n",
"title": "Linear complexity of Legendre-polynomial quotients"
} | null | null | null | null | true | null | 793 | null | Default | null | null |
null | {
"abstract": " A central question in science of science concerns how time affects citations.\nDespite the long-standing interests and its broad impact, we lack systematic\nanswers to this simple yet fundamental question. By reviewing and classifying\nprior studies for the past 50 years, we find a significant lack of consensus in\nthe literature, primarily due to the coexistence of retrospective and\nprospective approaches to measuring citation age distributions. These two\napproaches have been pursued in parallel, lacking any known connections between\nthe two. Here we developed a new theoretical framework that not only allows us\nto connect the two approaches through precise mathematical relationships, it\nalso helps us reconcile the interplay between temporal decay of citations and\nthe growth of science, helping us uncover new functional forms characterizing\ncitation age distributions. We find retrospective distribution follows a\nlognormal distribution with exponential cutoff, while prospective distribution\nis governed by the interplay between a lognormal distribution and the growth in\nthe number of references. Most interestingly, the two approaches can be\nconnected once rescaled by the growth of publications and citations. We further\nvalidate our framework using both large-scale citation datasets and analytical\nmodels capturing citation dynamics. Together this paper presents a\ncomprehensive analysis of the time dimension of science, representing a new\nempirical and theoretical basis for all future studies in this area.\n",
"title": "The Time Dimension of Science: Connecting the Past to the Future"
} | null | null | null | null | true | null | 794 | null | Default | null | null |
null | {
"abstract": " Excited states of a single donor in bulk silicon have previously been studied\nextensively based on effective mass theory. However, a proper theoretical\ndescription of the excited states of a donor cluster is still scarce. Here we\nstudy the excitations of lines of defects within a single-valley spherical band\napproximation, thus mapping the problem to a scaled hydrogen atom array. A\nseries of detailed full configuration-interaction and time-dependent hybrid\ndensity-functional theory calculations have been performed to understand linear\nclusters of up to 10 donors. Our studies illustrate the generic features of\ntheir excited states, addressing the competition between formation of\ninter-donor ionic states and intra-donor atomic excited states. At short\ninter-donor distances, excited states of donor molecules are dominant, at\nintermediate distances ionic states play an important role, and at long\ndistances the intra-donor excitations are predominant as expected. The\ncalculations presented here emphasise the importance of correlations between\ndonor electrons, and are thus complementary to other recent approaches that\ninclude effective mass anisotropy and multi-valley effects. The exchange\nsplittings between relevant excited states have also been estimated for a donor\npair and for a three-donor arrays; the splittings are much larger than those in\nthe ground state in the range of donor separations between 10 and 20 nm. This\nestablishes a solid theoretical basis for the use of excited-state exchange\ninteractions for controllable quantum gate operations in silicon.\n",
"title": "Excited states of defect lines in silicon: A first-principles study based on hydrogen cluster analogues"
} | null | null | [
"Physics"
]
| null | true | null | 795 | null | Validated | null | null |
null | {
"abstract": " We present a statistical study on the [C I]($^{3} \\rm P_{1} \\rightarrow {\\rm\n^3 P}_{0}$), [C I] ($^{3} \\rm P_{2} \\rightarrow {\\rm ^3 P}_{1}$) lines\n(hereafter [C I] (1$-$0) and [C I] (2$-$1), respectively) and the CO (1$-$0)\nline for a sample of (ultra)luminous infrared galaxies [(U)LIRGs]. We explore\nthe correlations between the luminosities of CO (1$-$0) and [C I] lines, and\nfind that $L'_\\mathrm{CO(1-0)}$ correlates almost linearly with both $L'_\n\\mathrm{[CI](1-0)}$ and $L'_\\mathrm{[CI](2-1)}$, suggesting that [C I] lines\ncan trace total molecular gas mass at least for (U)LIRGs. We also investigate\nthe dependence of $L'_\\mathrm{[CI](1-0)}$/$L'_\\mathrm{CO(1-0)}$,\n$L'_\\mathrm{[CI](2-1)}$/$L'_\\mathrm{CO(1-0)}$ and\n$L'_\\mathrm{[CI](2-1)}$/$L'_\\mathrm{[CI](1-0)}$ on the far-infrared color of\n60-to-100 $\\mu$m, and find non-correlation, a weak correlation and a modest\ncorrelation, respectively. Under the assumption that these two carbon\ntransitions are optically thin, we further calculate the [C I] line excitation\ntemperatures, atomic carbon masses, and the mean [C I] line flux-to-H$_2$ mass\nconversion factors for our sample. The resulting $\\mathrm{H_2}$ masses using\nthese [C I]-based conversion factors roughly agree with those derived from\n$L'_\\mathrm{CO(1-0)}$ and CO-to-H$_2$ conversion factor.\n",
"title": "Neutral Carbon Emission in luminous infrared galaxies The \\CI\\ Lines as Total Molecular Gas Tracers"
} | null | null | null | null | true | null | 796 | null | Default | null | null |
null | {
"abstract": " We study large-scale kernel methods for acoustic modeling in speech\nrecognition and compare their performance to deep neural networks (DNNs). We\nperform experiments on four speech recognition datasets, including the TIMIT\nand Broadcast News benchmark tasks, and compare these two types of models on\nframe-level performance metrics (accuracy, cross-entropy), as well as on\nrecognition metrics (word/character error rate). In order to scale kernel\nmethods to these large datasets, we use the random Fourier feature method of\nRahimi and Recht (2007). We propose two novel techniques for improving the\nperformance of kernel acoustic models. First, in order to reduce the number of\nrandom features required by kernel models, we propose a simple but effective\nmethod for feature selection. The method is able to explore a large number of\nnon-linear features while maintaining a compact model more efficiently than\nexisting approaches. Second, we present a number of frame-level metrics which\ncorrelate very strongly with recognition performance when computed on the\nheldout set; we take advantage of these correlations by monitoring these\nmetrics during training in order to decide when to stop learning. This\ntechnique can noticeably improve the recognition performance of both DNN and\nkernel models, while narrowing the gap between them. Additionally, we show that\nthe linear bottleneck method of Sainath et al. (2013) improves the performance\nof our kernel models significantly, in addition to speeding up training and\nmaking the models more compact. Together, these three methods dramatically\nimprove the performance of kernel acoustic models, making their performance\ncomparable to DNNs on the tasks we explored.\n",
"title": "Kernel Approximation Methods for Speech Recognition"
} | null | null | null | null | true | null | 797 | null | Default | null | null |
null | {
"abstract": " We determine the composition factors of the tensor product $S(E)\\otimes S(E)$\nof two copies of the symmetric algebra of the natural module $E$ of a general\nlinear group over an algebraically closed field of positive characteristic. Our\nmain result may be regarded as a substantial generalisation of the tensor\nproduct theorem of Krop and Sullivan, on composition factors of $S(E)$. We\nearlier answered the question of which polynomially injective modules are\ninfinitesimally injective in terms of the \"divisibility index\". We are now able\nto give an explicit description of the divisibility index for polynomial\nmodules for general linear groups of degree at most $3$.\n",
"title": "Composition Factors of Tensor Products of Symmetric Powers"
} | null | null | null | null | true | null | 798 | null | Default | null | null |
null | {
"abstract": " Current understanding of how contractility emerges in disordered actomyosin\nnetworks of non-muscle cells is still largely based on the intuition derived\nfrom earlier works on muscle contractility. This view, however, largely\noverlooks the free energy gain following passive cross-linker binding, which,\neven in the absence of active fluctuations, provides a thermodynamic drive\ntowards highly overlapping filamentous states. In this work, we shed light on\nthis phenomenon, showing that passive cross-linkers, when considered in the\ncontext of two anti-parallel filaments, generate noticeable contractile forces.\nHowever, as binding free energy of cross-linkers is increased, a sharp onset of\nkinetic arrest follows, greatly diminishing effectiveness of this contractility\nmechanism, allowing the network to contract only with weakly resisting tensions\nat its boundary. We have carried out stochastic simulations elucidating this\nmechanism, followed by a mean-field treatment that predicts how contractile\nforces asymptotically scale at small and large binding energies, respectively.\nFurthermore, when considering an active contractile filament pair, based on\nnon-muscle myosin II, we found that the non-processive nature of these motors\nleads to highly inefficient force generation, due to recoil slippage of the\noverlap during periods when the motor is dissociated. However, we discovered\nthat passive cross-linkers can serve as a structural ratchet during these\nunbound motor time spans, resulting in vast force amplification. Our results\nshed light on the non-equilibrium effects of transiently binding proteins in\nbiological active matter, as observed in the non-muscle actin cytoskeleton,\nshowing that highly efficient contractile force dipoles result from synergy of\npassive cross-linker and active motor dynamics, via a ratcheting mechanism on a\nfunneled energy landscape.\n",
"title": "Stochastic Ratcheting on a Funneled Energy Landscape is Necessary for Highly Efficient Contractility of Actomyosin Force Dipoles"
} | null | null | null | null | true | null | 799 | null | Default | null | null |
null | {
"abstract": " This work encompasses Rate-Splitting (RS), providing significant benefits in\nmulti-user settings in the context of huge degrees of freedom promised by\nmassive Multiple-Input Multiple-Output (MIMO). However, the requirement of\nmassive MIMO for cost-efficient implementation makes them more prone to\nhardware imperfections such as phase noise (PN). As a result, we focus on a\nrealistic broadcast channel with a large number of antennas and hampered by the\nunavoidable PN. Moreover, we employ the RS transmission strategy, and we show\nits robustness against PN, since the sum-rate does not saturate at high\nsignal-to-noise ratio (SNR). Although, the analytical results are obtained by\nmeans of the deterministic equivalent analysis, they coincide with simulation\nresults even for finite system dimensions.\n",
"title": "Mitigation of Phase Noise in Massive MIMO Systems: A Rate-Splitting Approach"
} | null | null | null | null | true | null | 800 | null | Default | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.