id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0686 | The momentum budget of clustered supernova feedback in a 3D, magnetised
medium | While the evolution of superbubbles driven by clustered supernovae has been
studied by numerous authors, the resulting radial momentum yield is uncertain
by as much as an order of magnitude depending on the computational methods and
assumed properties of the surrounding interstellar medium (ISM). In this work,
we stu... | astro-ph.GA | while the evolution of superbubbles driven by clustered supernovae has been studied by numerous authors the resulting radial momentum yield is uncertain by as much as an order of magnitude depending on the computational methods and assumed properties of the surrounding interstellar medium ism in this work we study the ... | [['while', 'the', 'evolution', 'of', 'superbubbles', 'driven', 'by', 'clustered', 'supernovae', 'has', 'been', 'studied', 'by', 'numerous', 'authors', 'the', 'resulting', 'radial', 'momentum', 'yield', 'is', 'uncertain', 'by', 'as', 'much', 'as', 'an', 'order', 'of', 'magnitude', 'depending', 'on', 'the', 'computationa... | [-0.10450139052641555, 0.14311395571755436, -0.0283771675244412, 0.07804104800193234, -0.05142886412893461, -0.060803764724728315, 0.04819129684136813, 0.3855584256444909, -0.21580003688557997, -0.31725768602434584, 0.05949502317293571, -0.2604125974652897, -0.017130361713406417, 0.19436602012700394, 0.0096453729675282... |
1,802.06861 | Interpreting DNN output layer activations: A strategy to cope with
unseen data in speech recognition | Unseen data can degrade performance of deep neural net acoustic models. To
cope with unseen data, adaptation techniques are deployed. For unlabeled unseen
data, one must generate some hypothesis given an existing model, which is used
as the label for model adaptation. However, assessing the goodness of the
hypothesis... | cs.CL cs.SD eess.AS | unseen data can degrade performance of deep neural net acoustic models to cope with unseen data adaptation techniques are deployed for unlabeled unseen data one must generate some hypothesis given an existing model which is used as the label for model adaptation however assessing the goodness of the hypothesis can be d... | [['unseen', 'data', 'can', 'degrade', 'performance', 'of', 'deep', 'neural', 'net', 'acoustic', 'models', 'to', 'cope', 'with', 'unseen', 'data', 'adaptation', 'techniques', 'are', 'deployed', 'for', 'unlabeled', 'unseen', 'data', 'one', 'must', 'generate', 'some', 'hypothesis', 'given', 'an', 'existing', 'model', 'whi... | [-0.024928567499669298, 0.03709603931774329, -0.06305616709219321, 0.11836532005380726, -0.12106746966184737, -0.21367307385514836, 0.06925054226864867, 0.4157034171376434, -0.2827974410590522, -0.362743842212228, 0.08570365487895718, -0.23122323482169718, -0.13420733489890388, 0.1773889417769529, -0.11606873496468675,... |
1,802.06862 | Joint Task Assignment and Wireless Resource Allocation for Cooperative
Mobile-Edge Computing | This paper studies a multi-user cooperative mobile-edge computing (MEC)
system, in which a local mobile user can offload intensive computation tasks to
multiple nearby edge devices serving as helpers for remote execution. We focus
on the scenario where the local user has a number of independent tasks that can
be exec... | eess.SP cs.IT math.IT | this paper studies a multiuser cooperative mobileedge computing mec system in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution we focus on the scenario where the local user has a number of independent tasks that can be executed in ... | [['this', 'paper', 'studies', 'a', 'multiuser', 'cooperative', 'mobileedge', 'computing', 'mec', 'system', 'in', 'which', 'a', 'local', 'mobile', 'user', 'can', 'offload', 'intensive', 'computation', 'tasks', 'to', 'multiple', 'nearby', 'edge', 'devices', 'serving', 'as', 'helpers', 'for', 'remote', 'execution', 'we', ... | [-0.20383517252880015, -0.031051183278447882, -0.06365190270755972, 0.009754293639811553, -0.12806565445581716, -0.24421020710752123, 0.15311805848752902, 0.40900181510618755, -0.3363173463027037, -0.32915127443238384, 0.08934466847983588, -0.21829078931893622, -0.1247139054616647, 0.15106227144244172, -0.1328764913465... |
1,802.06863 | Predicting Metamorphic Relation for Matrix Calculation Programs | Matrices often represent important information in scientific applications and
are involved in performing complex calculations. But systematically testing
these applications is hard due to the oracle problem. Metamorphic testing is an
effective approach to test such applications because it uses metamorphic
relations t... | cs.SE | matrices often represent important information in scientific applications and are involved in performing complex calculations but systematically testing these applications is hard due to the oracle problem metamorphic testing is an effective approach to test such applications because it uses metamorphic relations to de... | [['matrices', 'often', 'represent', 'important', 'information', 'in', 'scientific', 'applications', 'and', 'are', 'involved', 'in', 'performing', 'complex', 'calculations', 'but', 'systematically', 'testing', 'these', 'applications', 'is', 'hard', 'due', 'to', 'the', 'oracle', 'problem', 'metamorphic', 'testing', 'is',... | [-0.0042818440604272465, 0.008430212225257562, -0.11975490196273868, 0.1514650314063445, -0.15462132145202798, -0.16892639156928613, 0.06031690792088176, 0.4263983208487052, -0.27364148033199875, -0.3943557899679903, 0.13031659145992364, -0.24211420269526598, -0.2290150297837659, 0.22378088812030966, -0.062373151437500... |
1,802.06864 | The NWRA Classification Infrastructure: Description and Extension to the
Discriminant Analysis Flare Forecasting System (DAFFS) | A classification infrastructure built upon Discriminant Analysis has been
developed at NorthWest Research Associates for examining the statistical
differences between samples of two known populations. Originating to examine
the physical differences between flare-quiet and flare-imminent solar active
regions, we descr... | astro-ph.SR physics.data-an physics.space-ph | a classification infrastructure built upon discriminant analysis has been developed at northwest research associates for examining the statistical differences between samples of two known populations originating to examine the physical differences between flarequiet and flareimminent solar active regions we describe he... | [['a', 'classification', 'infrastructure', 'built', 'upon', 'discriminant', 'analysis', 'has', 'been', 'developed', 'at', 'northwest', 'research', 'associates', 'for', 'examining', 'the', 'statistical', 'differences', 'between', 'samples', 'of', 'two', 'known', 'populations', 'originating', 'to', 'examine', 'the', 'phy... | [-0.03648279783437434, 0.02632121198099491, -0.07177371827029386, 0.11697424478288046, -0.08881238749632554, -0.12243156678076568, 0.07448295653531593, 0.36230168695220294, -0.20529773192746298, -0.3757955237401661, 0.11648364024459505, -0.2877764174778315, -0.14499152075898433, 0.2665589092314165, -0.10442869439258338... |
1,802.06865 | Automated soft tissue lesion detection and segmentation in digital
mammography using a u-net deep learning network | Computer-aided detection or decision support systems aim to improve breast
cancer screening programs by helping radiologists to evaluate digital
mammography (DM) exams. Commonly such methods proceed in two steps: selection
of candidate regions for malignancy, and later classification as either
malignant or not. In th... | cs.CV | computeraided detection or decision support systems aim to improve breast cancer screening programs by helping radiologists to evaluate digital mammography dm exams commonly such methods proceed in two steps selection of candidate regions for malignancy and later classification as either malignant or not in this study ... | [['computeraided', 'detection', 'or', 'decision', 'support', 'systems', 'aim', 'to', 'improve', 'breast', 'cancer', 'screening', 'programs', 'by', 'helping', 'radiologists', 'to', 'evaluate', 'digital', 'mammography', 'dm', 'exams', 'commonly', 'such', 'methods', 'proceed', 'in', 'two', 'steps', 'selection', 'of', 'can... | [-0.013677668766070962, -0.01700515747361351, -0.05848517422987656, 0.09258092258665288, -0.06453222087478604, -0.19447094636125256, 0.06453084828945893, 0.4049566115781834, -0.16630284845913676, -0.4038483820792118, 0.10559335777017458, -0.3136900928125463, -0.1085896488040982, 0.1929234755246646, -0.132159497582523, ... |
1,802.06866 | Expert System for Diagnosis of Chest Diseases Using Neural Networks | This article represents one of the contemporary trends in the application of
the latest methods of information and communication technology for medicine
through an expert system helps the doctor to diagnose some chest diseases which
is important because of the frequent spread of chest diseases nowadays in
addition to... | cs.AI | this article represents one of the contemporary trends in the application of the latest methods of information and communication technology for medicine through an expert system helps the doctor to diagnose some chest diseases which is important because of the frequent spread of chest diseases nowadays in addition to t... | [['this', 'article', 'represents', 'one', 'of', 'the', 'contemporary', 'trends', 'in', 'the', 'application', 'of', 'the', 'latest', 'methods', 'of', 'information', 'and', 'communication', 'technology', 'for', 'medicine', 'through', 'an', 'expert', 'system', 'helps', 'the', 'doctor', 'to', 'diagnose', 'some', 'chest', '... | [-0.04288847907011127, 0.05367788425159845, -0.07811238228726401, 0.13753851145836654, -0.16891388080700814, -0.18862691127790887, 0.07305501196881599, 0.37583736608797147, -0.29349562477877483, -0.2870698342987589, 0.14681922270650932, -0.3082282782540979, -0.19251986326014398, 0.2150665509262096, -0.1750040189096504,... |
1,802.06867 | Almost logarithmic-time space optimal leader election in population
protocols | The model of population protocols refers to a large collection of simple
indistinguishable entities, frequently called {\em agents}. The agents
communicate and perform computation through pairwise interactions. We study
fast and space efficient leader election in population of cardinality $n$
governed by a random sch... | cs.DC | the model of population protocols refers to a large collection of simple indistinguishable entities frequently called em agents the agents communicate and perform computation through pairwise interactions we study fast and space efficient leader election in population of cardinality n governed by a random scheduler whe... | [['the', 'model', 'of', 'population', 'protocols', 'refers', 'to', 'a', 'large', 'collection', 'of', 'simple', 'indistinguishable', 'entities', 'frequently', 'called', 'em', 'agents', 'the', 'agents', 'communicate', 'and', 'perform', 'computation', 'through', 'pairwise', 'interactions', 'we', 'study', 'fast', 'and', 's... | [-0.21128017662611223, 0.1403198360581007, -0.025769003954912096, 0.0347668065810296, -0.0647822638073782, -0.28419615282796157, 0.16124865070993738, 0.3792526728081468, -0.26199481001165803, -0.3521475832160086, 0.017216125567079542, -0.27182964891671463, -0.1065107177806444, 0.08336976154959459, -0.056772944433185715... |
1,802.06868 | Optical and Gamma-Ray Variability Behaviors of 3C 454.3 from 2006 to
2011 | We present our photometric monitoring of a flat spectrum radio quasar (FSRQ)
3C 454.3 at Yunnan observatories from 2006 to 2011. We find that the optical
color of 3C 454.3 shows obvious redder-when-brighter trend, which reaches a
saturation stage when the source is brighter than 15.15 mag at V band. We
perform a simu... | astro-ph.HE | we present our photometric monitoring of a flat spectrum radio quasar fsrq 3c 4543 at yunnan observatories from 2006 to 2011 we find that the optical color of 3c 4543 shows obvious redderwhenbrighter trend which reaches a saturation stage when the source is brighter than 1515 mag at v band we perform a simulation with ... | [['we', 'present', 'our', 'photometric', 'monitoring', 'of', 'a', 'flat', 'spectrum', 'radio', 'quasar', 'fsrq', '3c', '4543', 'at', 'yunnan', 'observatories', 'from', '2006', 'to', '2011', 'we', 'find', 'that', 'the', 'optical', 'color', 'of', '3c', '4543', 'shows', 'obvious', 'redderwhenbrighter', 'trend', 'which', '... | [-0.07054167637199332, 0.08461157187155716, -0.10128089895905842, 0.14469789255472484, -0.10187542415753176, -0.09249440691068726, 0.04914160054282878, 0.49928109906613827, -0.16879167283332208, -0.3694281833403776, 0.06078026083824542, -0.31076096387484786, -0.07865285099767955, 0.22980144387111068, -0.055183896739353... |
1,802.06869 | Invertible Autoencoder for domain adaptation | The unsupervised image-to-image translation aims at finding a mapping between
the source ($A$) and target ($B$) image domains, where in many applications
aligned image pairs are not available at training. This is an ill-posed
learning problem since it requires inferring the joint probability distribution
from margina... | eess.IV cs.CV | the unsupervised imagetoimage translation aims at finding a mapping between the source a and target b image domains where in many applications aligned image pairs are not available at training this is an illposed learning problem since it requires inferring the joint probability distribution from marginals joint learni... | [['the', 'unsupervised', 'imagetoimage', 'translation', 'aims', 'at', 'finding', 'a', 'mapping', 'between', 'the', 'source', 'a', 'and', 'target', 'b', 'image', 'domains', 'where', 'in', 'many', 'applications', 'aligned', 'image', 'pairs', 'are', 'not', 'available', 'at', 'training', 'this', 'is', 'an', 'illposed', 'le... | [-0.06244627599729093, 0.019169678194512516, -0.034361468769213935, 0.04426894308660018, -0.09398797398807085, -0.16966198003799546, 0.029066183521800976, 0.4351155613769051, -0.3062020888007576, -0.33202959119899594, 0.07550617788623153, -0.2585333106603004, -0.14705722619904074, 0.17857966322899158, -0.13524439708580... |
1,802.0687 | Formal Analysis of Galois Field Arithmetics - Parallel Verification and
Reverse Engineering | Galois field (GF) arithmetic circuits find numerous applications in
communications, signal processing, and security engineering. Formal
verification techniques of GF circuits are scarce and limited to circuits with
known bit positions of the primary inputs and outputs. They also require
knowledge of the irreducible p... | cs.SC cs.CR | galois field gf arithmetic circuits find numerous applications in communications signal processing and security engineering formal verification techniques of gf circuits are scarce and limited to circuits with known bit positions of the primary inputs and outputs they also require knowledge of the irreducible polynomia... | [['galois', 'field', 'gf', 'arithmetic', 'circuits', 'find', 'numerous', 'applications', 'in', 'communications', 'signal', 'processing', 'and', 'security', 'engineering', 'formal', 'verification', 'techniques', 'of', 'gf', 'circuits', 'are', 'scarce', 'and', 'limited', 'to', 'circuits', 'with', 'known', 'bit', 'positio... | [-0.1489461769938077, 0.030668699727883858, -0.07082930576181848, 0.008796967435046099, -0.07376593123435189, -0.18930209321766406, 0.031819062210208936, 0.38420574970567895, -0.3192960831067084, -0.31617515235465316, 0.09258846766629415, -0.20456147447571552, -0.1469464125915884, 0.2429874856055616, -0.078780247048646... |
1,802.06871 | A Deterministic Protocol for Sequential Asymptotic Learning | In the classic herding model, agents receive private signals about an
underlying binary state of nature, and act sequentially to choose one of two
possible actions, after observing the actions of their predecessors.
We investigate what types of behaviors lead to asymptotic learning, where
agents will eventually con... | cs.GT cs.DM | in the classic herding model agents receive private signals about an underlying binary state of nature and act sequentially to choose one of two possible actions after observing the actions of their predecessors we investigate what types of behaviors lead to asymptotic learning where agents will eventually converge to ... | [['in', 'the', 'classic', 'herding', 'model', 'agents', 'receive', 'private', 'signals', 'about', 'an', 'underlying', 'binary', 'state', 'of', 'nature', 'and', 'act', 'sequentially', 'to', 'choose', 'one', 'of', 'two', 'possible', 'actions', 'after', 'observing', 'the', 'actions', 'of', 'their', 'predecessors', 'we', '... | [-0.106618237555027, 0.12225049883604515, -0.13090181880816817, 0.05067137647047639, -0.14349928356334568, -0.23104223468899726, 0.11401512632984669, 0.4261753012239933, -0.2844786498248577, -0.2463167127976194, 0.08334768856689334, -0.2540853971838951, -0.1722014402076602, 0.14768384074233473, -0.13904235456883907, -0... |
1,802.06872 | Population Protocols Are Fast | A population protocol describes a set of state change rules for a population
of $n$ indistinguishable finite-state agents (automata), undergoing random
pairwise interactions. Within this very basic framework, it is possible to
resolve a number of fundamental tasks in distributed computing, including:
leader election,... | cs.DC cs.DS | a population protocol describes a set of state change rules for a population of n indistinguishable finitestate agents automata undergoing random pairwise interactions within this very basic framework it is possible to resolve a number of fundamental tasks in distributed computing including leader election aggregate an... | [['a', 'population', 'protocol', 'describes', 'a', 'set', 'of', 'state', 'change', 'rules', 'for', 'a', 'population', 'of', 'n', 'indistinguishable', 'finitestate', 'agents', 'automata', 'undergoing', 'random', 'pairwise', 'interactions', 'within', 'this', 'very', 'basic', 'framework', 'it', 'is', 'possible', 'to', 're... | [-0.16913802829398977, 0.11404821311370764, -0.0704488861519501, 0.053094078094427066, -0.03146177117359408, -0.20114834391670264, 0.14562029639082288, 0.3588292361218703, -0.2870601452703002, -0.30120693531122955, 0.07108032847055246, -0.18786456463527185, -0.09455216063320887, 0.19416968788760217, -0.0711036880247307... |
1,802.06873 | Multi-scale simulations of black hole accretion in barred galaxies:
Self-gravitating disk models | Due to the non-axisymmetric potential of the central bar, barred spiral
galaxies form, in addition to their characteristic arms and bar, a variety of
structures within the thin gas disk, like nuclear rings, inner spirals and
dust-lanes. These structures in the inner kiloparsec are most important to
explain and unders... | astro-ph.GA | due to the nonaxisymmetric potential of the central bar barred spiral galaxies form in addition to their characteristic arms and bar a variety of structures within the thin gas disk like nuclear rings inner spirals and dustlanes these structures in the inner kiloparsec are most important to explain and understand the r... | [['due', 'to', 'the', 'nonaxisymmetric', 'potential', 'of', 'the', 'central', 'bar', 'barred', 'spiral', 'galaxies', 'form', 'in', 'addition', 'to', 'their', 'characteristic', 'arms', 'and', 'bar', 'a', 'variety', 'of', 'structures', 'within', 'the', 'thin', 'gas', 'disk', 'like', 'nuclear', 'rings', 'inner', 'spirals'... | [-0.11673471666106887, 0.06381583166977826, -0.03655133110278093, 0.10921065695846018, -0.0340640198791752, -0.03109252466694326, -0.006308318216454338, 0.35942746342059123, -0.21334836235676832, -0.29165920481790564, 0.10619699063989846, -0.25364411346245186, 0.020186603737382538, 0.1973391146795522, 0.008307992710379... |
1,802.06874 | Landau Damping in a strong magnetic field: Dissociation of Quarkonia | We have investigated the effects of strong magnetic field on the properties
of quarkonia immersed in a thermal medium of quarks and gluons and studied its
quasi-free dissociation due to the Landau-damping. Thermalizing the Schwinger
propagator in the lowest Landau levels for quarks and the Feynman propagator
for gluo... | hep-ph hep-th nucl-th | we have investigated the effects of strong magnetic field on the properties of quarkonia immersed in a thermal medium of quarks and gluons and studied its quasifree dissociation due to the landaudamping thermalizing the schwinger propagator in the lowest landau levels for quarks and the feynman propagator for gluons in... | [['we', 'have', 'investigated', 'the', 'effects', 'of', 'strong', 'magnetic', 'field', 'on', 'the', 'properties', 'of', 'quarkonia', 'immersed', 'in', 'a', 'thermal', 'medium', 'of', 'quarks', 'and', 'gluons', 'and', 'studied', 'its', 'quasifree', 'dissociation', 'due', 'to', 'the', 'landaudamping', 'thermalizing', 'th... | [-0.1289038029600217, 0.25505240810093627, -0.04562856993446335, 0.07888392731085056, -0.006561546975625713, -0.06960687633487816, 0.0325719020161307, 0.36830412480805325, -0.19106099071209773, -0.2959325551904321, -0.001600383107568514, -0.30352775073805255, -0.03177142394193875, 0.1462379045354115, 0.0662931981418762... |
1,802.06875 | LSALSA: Accelerated Source Separation via Learned Sparse Coding | We propose an efficient algorithm for the generalized sparse coding (SC)
inference problem. The proposed framework applies to both the single dictionary
setting, where each data point is represented as a sparse combination of the
columns of one dictionary matrix, as well as the multiple dictionary setting as
given in... | cs.LG stat.ML | we propose an efficient algorithm for the generalized sparse coding sc inference problem the proposed framework applies to both the single dictionary setting where each data point is represented as a sparse combination of the columns of one dictionary matrix as well as the multiple dictionary setting as given in morpho... | [['we', 'propose', 'an', 'efficient', 'algorithm', 'for', 'the', 'generalized', 'sparse', 'coding', 'sc', 'inference', 'problem', 'the', 'proposed', 'framework', 'applies', 'to', 'both', 'the', 'single', 'dictionary', 'setting', 'where', 'each', 'data', 'point', 'is', 'represented', 'as', 'a', 'sparse', 'combination', ... | [-0.06765378582820766, -0.022126018279263155, -0.09181390156193878, 0.06702932892110385, -0.10953926692594147, -0.17017571314476643, 0.01720712920634268, 0.4350964298282892, -0.3512956745776736, -0.2976086072100068, 0.09262373573370476, -0.20152574433825804, -0.20457995543919266, 0.15741087145957552, -0.105872194733457... |
1,802.06876 | Spiro-Conjugated Molecular Junctions: between Jahn-Teller Distortion and
Destructive Quantum Interference | The quest for molecular structures exhibiting strong quantum interference
effects in the transport setting has long been on the forefront of chemical
research. Here, we establish theoretically that the unusual geometry of
spiro-conjugated systems gives rise to complete destructive interference in the
resonant-transpo... | cond-mat.mes-hall physics.chem-ph | the quest for molecular structures exhibiting strong quantum interference effects in the transport setting has long been on the forefront of chemical research here we establish theoretically that the unusual geometry of spiroconjugated systems gives rise to complete destructive interference in the resonanttransport reg... | [['the', 'quest', 'for', 'molecular', 'structures', 'exhibiting', 'strong', 'quantum', 'interference', 'effects', 'in', 'the', 'transport', 'setting', 'has', 'long', 'been', 'on', 'the', 'forefront', 'of', 'chemical', 'research', 'here', 'we', 'establish', 'theoretically', 'that', 'the', 'unusual', 'geometry', 'of', 's... | [-0.20994150469954492, 0.1243486935660864, -0.10389526280447502, 0.07545130178826212, -0.03157965418402896, -0.14472038371869447, 0.05651358571600268, 0.3638895152799898, -0.30693119092646876, -0.28420350165811903, 0.010623890330669272, -0.2475865377434247, -0.22832344664140802, 0.20062533081473896, -0.0160727941494604... |
1,802.06877 | Pairwise Concurrence in Cyclically Symmetric Quantum States | We provide an initial characterization of pairwise concurrence in quantum
states which are invariant under cyclic permutations of party labeling. We
prove that maximal entanglement can be entirely described by adjacent pairs,
then give explicit descriptions of those states in specific subsets of 4 and 5
qubit states ... | quant-ph | we provide an initial characterization of pairwise concurrence in quantum states which are invariant under cyclic permutations of party labeling we prove that maximal entanglement can be entirely described by adjacent pairs then give explicit descriptions of those states in specific subsets of 4 and 5 qubit states x st... | [['we', 'provide', 'an', 'initial', 'characterization', 'of', 'pairwise', 'concurrence', 'in', 'quantum', 'states', 'which', 'are', 'invariant', 'under', 'cyclic', 'permutations', 'of', 'party', 'labeling', 'we', 'prove', 'that', 'maximal', 'entanglement', 'can', 'be', 'entirely', 'described', 'by', 'adjacent', 'pairs'... | [-0.2041435894627077, 0.2544326941570034, -0.039176926783085625, 0.09771547728524649, 0.0626418456388048, -0.23410526812194457, 0.08284098006301571, 0.37506362041340596, -0.22550489546000202, -0.28634300624621634, 0.03318353039743025, -0.3123256125416654, -0.06385159710587203, 0.15118969152268918, -0.0679172978653938, ... |
1,802.06878 | Dynamical structure factor of the triangular antiferromagnet: the
Schwinger boson theory beyond the mean field approach | We compute the zero temperature dynamical structure factor $S({\bf
q},\omega)$ of the triangular lattice Heisenberg model (TLHM) using a Schwinger
boson approach that includes the Gaussian fluctuations ($1/N$ corrections) of
the saddle point solution. While the ground state of this model exhibits a
well-known 120$^{\... | cond-mat.str-el | we compute the zero temperature dynamical structure factor sbf qomega of the triangular lattice heisenberg model tlhm using a schwinger boson approach that includes the gaussian fluctuations 1n corrections of the saddle point solution while the ground state of this model exhibits a wellknown 120circ magnetic ordering e... | [['we', 'compute', 'the', 'zero', 'temperature', 'dynamical', 'structure', 'factor', 'sbf', 'qomega', 'of', 'the', 'triangular', 'lattice', 'heisenberg', 'model', 'tlhm', 'using', 'a', 'schwinger', 'boson', 'approach', 'that', 'includes', 'the', 'gaussian', 'fluctuations', '1n', 'corrections', 'of', 'the', 'saddle', 'p... | [-0.16234848337800167, 0.22344536538730608, -0.10815712792460963, 0.07993220497258584, -0.022979375672427756, -0.0928790768535305, 0.07455571632305845, 0.34291582607738347, -0.22915981201438512, -0.22688331063507142, 0.03788239359690816, -0.31957895656433616, -0.07579385724528569, 0.12241862573768053, 0.053932994075605... |
1,802.06879 | Coverings and the heat equation on graphs: stochastic incompleteness,
the Feller property and uniform transience | We study regular coverings of graphs and manifolds with a focus on properties
of the heat equation. In particular, we look at stochastic incompleteness, the
Feller property and uniform transience; and investigate the connection between
the validity of these properties on the base space and its covering. For both
grap... | math.FA math.PR math.SP | we study regular coverings of graphs and manifolds with a focus on properties of the heat equation in particular we look at stochastic incompleteness the feller property and uniform transience and investigate the connection between the validity of these properties on the base space and its covering for both graphs and ... | [['we', 'study', 'regular', 'coverings', 'of', 'graphs', 'and', 'manifolds', 'with', 'a', 'focus', 'on', 'properties', 'of', 'the', 'heat', 'equation', 'in', 'particular', 'we', 'look', 'at', 'stochastic', 'incompleteness', 'the', 'feller', 'property', 'and', 'uniform', 'transience', 'and', 'investigate', 'the', 'conne... | [-0.1363891838963831, 0.04249904828057403, -0.07459837703278199, 0.12296653754033503, -0.101481398625765, -0.06999534858568084, 0.07547355229811122, 0.4040401907792936, -0.2861868017131374, -0.222706676025631, 0.15675675155389832, -0.2605959055945277, -0.13176767140006027, 0.20574273523830233, -0.07833590210481946, 0.0... |
1,802.0688 | The distribution of inelastic dark matter in the Sun | If dark matter is composed of new particles, these may become captured after
scattering with nuclei in the Sun, thermalise through additional scattering,
and finally annihilate into neutrinos that can be detected on Earth. If dark
matter scatters inelastically into a slightly heavier ($\mathcal{O} (10-100)$
keV) stat... | hep-ph astro-ph.HE | if dark matter is composed of new particles these may become captured after scattering with nuclei in the sun thermalise through additional scattering and finally annihilate into neutrinos that can be detected on earth if dark matter scatters inelastically into a slightly heavier mathcalo 10100 kev state it is unclear ... | [['if', 'dark', 'matter', 'is', 'composed', 'of', 'new', 'particles', 'these', 'may', 'become', 'captured', 'after', 'scattering', 'with', 'nuclei', 'in', 'the', 'sun', 'thermalise', 'through', 'additional', 'scattering', 'and', 'finally', 'annihilate', 'into', 'neutrinos', 'that', 'can', 'be', 'detected', 'on', 'earth... | [-0.06047547342560706, 0.25632754335730007, -0.14353897953816153, 0.15371702036664878, -0.04711766934569664, -0.10563170115261922, 0.034389079624667154, 0.3547262975303402, -0.2696532557026772, -0.33588087076065265, 0.041971954470091874, -0.2845944334856338, -0.01879312337664833, 0.14578226855370538, 0.0277755624704520... |
1,802.06881 | Automated Playtesting with Procedural Personas through MCTS with Evolved
Heuristics | This paper describes a method for generative player modeling and its
application to the automatic testing of game content using archetypal player
models called procedural personas. Theoretically grounded in psychological
decision theory, procedural personas are implemented using a variation of Monte
Carlo Tree Search... | cs.AI | this paper describes a method for generative player modeling and its application to the automatic testing of game content using archetypal player models called procedural personas theoretically grounded in psychological decision theory procedural personas are implemented using a variation of monte carlo tree search mct... | [['this', 'paper', 'describes', 'a', 'method', 'for', 'generative', 'player', 'modeling', 'and', 'its', 'application', 'to', 'the', 'automatic', 'testing', 'of', 'game', 'content', 'using', 'archetypal', 'player', 'models', 'called', 'procedural', 'personas', 'theoretically', 'grounded', 'in', 'psychological', 'decisio... | [-0.011638352898164438, 0.06112044945789071, -0.13265950600683796, 0.13630632474758805, -0.14141261543875608, -0.21358781586138484, 0.061750312916373305, 0.4550573297728522, -0.2684241331313761, -0.3570858180188598, 0.0956127519684975, -0.22278803919471102, -0.2090738247303913, 0.1804648853960829, -0.11137636887183479,... |
1,802.06882 | Theoretical Framework for Estimating Target-Object Shape by Using
Location-Unknown Mobile Distance Sensors | This paper proposes a theoretical framework for estimating a target-object
shape, the location of which is not given, by using mobile distance sensors the
locations of which are also unknown. Typically, mobile sensors are mounted on
vehicles. Each sensor continuously measures the distance from it to the target
object... | eess.SP | this paper proposes a theoretical framework for estimating a targetobject shape the location of which is not given by using mobile distance sensors the locations of which are also unknown typically mobile sensors are mounted on vehicles each sensor continuously measures the distance from it to the target object the pro... | [['this', 'paper', 'proposes', 'a', 'theoretical', 'framework', 'for', 'estimating', 'a', 'targetobject', 'shape', 'the', 'location', 'of', 'which', 'is', 'not', 'given', 'by', 'using', 'mobile', 'distance', 'sensors', 'the', 'locations', 'of', 'which', 'are', 'also', 'unknown', 'typically', 'mobile', 'sensors', 'are',... | [-0.10534019877597915, 0.06368227845594061, -0.08097374519319132, -0.006681635217374247, -0.10600903427411774, -0.15476617777974092, 0.06466293953108658, 0.42804083332532283, -0.2781580953830571, -0.35802847892045975, 0.13060685059771818, -0.2722189556383951, -0.12043085913914679, 0.16087494705006425, -0.12142881883703... |
1,802.06883 | An electronic ratchet is required in nanostructured intermediate band
solar cells | We investigate in this letter the intrinsic properties that have limited the
efficiency of nanostructured intermediate band solar cells. Those devices take
advantage of intra-band transitions, which occur on narrow energy width, and
present low radiative recombination efficiency. We derive the minimum
requirements in... | physics.app-ph physics.optics | we investigate in this letter the intrinsic properties that have limited the efficiency of nanostructured intermediate band solar cells those devices take advantage of intraband transitions which occur on narrow energy width and present low radiative recombination efficiency we derive the minimum requirements in terms ... | [['we', 'investigate', 'in', 'this', 'letter', 'the', 'intrinsic', 'properties', 'that', 'have', 'limited', 'the', 'efficiency', 'of', 'nanostructured', 'intermediate', 'band', 'solar', 'cells', 'those', 'devices', 'take', 'advantage', 'of', 'intraband', 'transitions', 'which', 'occur', 'on', 'narrow', 'energy', 'width... | [-0.1174915843915947, 0.12423697549282424, 0.007992869520508875, 0.0916045714825175, -0.061413165197822535, -0.1464278574344026, 0.0701418365782433, 0.4629628541480673, -0.23716611918923125, -0.3364930047002965, 0.07058554563722381, -0.2705438535019424, -0.14428576593899667, 0.2355229216292883, -0.09577967336860625, 0.... |
1,802.06884 | Weak-value amplification forWeyl-point separation in momentum space | The existence of Weyl nodes in the momentum space is a hallmark of a Weyl
semimetal (WSM). A WSM can be confirmed by observing its Fermi arcs with
separated Weyl nodes. In this paper, we study the spin- orbit interaction of
light on the surface of WSM in the limit that the thickness is ultra-thin and
the incident sur... | cond-mat.mes-hall physics.optics | the existence of weyl nodes in the momentum space is a hallmark of a weyl semimetal wsm a wsm can be confirmed by observing its fermi arcs with separated weyl nodes in this paper we study the spin orbit interaction of light on the surface of wsm in the limit that the thickness is ultrathin and the incident surface does... | [['the', 'existence', 'of', 'weyl', 'nodes', 'in', 'the', 'momentum', 'space', 'is', 'a', 'hallmark', 'of', 'a', 'weyl', 'semimetal', 'wsm', 'a', 'wsm', 'can', 'be', 'confirmed', 'by', 'observing', 'its', 'fermi', 'arcs', 'with', 'separated', 'weyl', 'nodes', 'in', 'this', 'paper', 'we', 'study', 'the', 'spin', 'orbit'... | [-0.2785369759034698, 0.19433171473909688, -0.06652618896415723, -0.013770022731997804, -0.10097068022254721, -0.15531444792369647, 0.09588991261158039, 0.34310582920443267, -0.28061035415157676, -0.2833532540742973, -0.007246958163575202, -0.3004933218055937, -0.16193607956769743, 0.17192064561407147, -0.0071636116024... |
1,802.06885 | The Allen--Uzawa elasticity of substitution for nonhomogeneous
production functions | This note proves that the representation of the Allen elasticity of
substitution obtained by Uzawa for linear homogeneous functions holds true for
nonhomogeneous functions. It is shown that the criticism of the Allen-Uzawa
elasticity of substitution in the works of Blackorby, Primont, Russell is based
on an incorrect... | econ.EM math.OC | this note proves that the representation of the allen elasticity of substitution obtained by uzawa for linear homogeneous functions holds true for nonhomogeneous functions it is shown that the criticism of the allenuzawa elasticity of substitution in the works of blackorby primont russell is based on an incorrect examp... | [['this', 'note', 'proves', 'that', 'the', 'representation', 'of', 'the', 'allen', 'elasticity', 'of', 'substitution', 'obtained', 'by', 'uzawa', 'for', 'linear', 'homogeneous', 'functions', 'holds', 'true', 'for', 'nonhomogeneous', 'functions', 'it', 'is', 'shown', 'that', 'the', 'criticism', 'of', 'the', 'allenuzawa'... | [-0.08852858924681482, 0.053190076149526845, -0.07351859007030725, 0.06223790539155269, -0.038539837640912636, -0.09173881303033103, 0.013780591624748447, 0.28969954359142674, -0.2747551613365826, -0.1817225247581044, 0.09417528949384375, -0.26448164058282325, -0.22397727365403072, 0.19583694513320274, -0.1104960497468... |
1,802.06886 | Plasma-activation of tap water using DBD for agronomy applications:
Identification and quantification of long lifetime chemical species and
production/consumption mechanisms | Cold atmospheric plasmas (CAP) are weakly ionized gases that can be generated
in ambient air. They produce energetic species (e.g. electrons, metastables) as
well as reactive oxygen species, reactive nitrogen species, UV radiations and
local electric field. Their interaction with a liquid such as tap water can
hence ... | physics.app-ph physics.chem-ph physics.plasm-ph | cold atmospheric plasmas cap are weakly ionized gases that can be generated in ambient air they produce energetic species eg electrons metastables as well as reactive oxygen species reactive nitrogen species uv radiations and local electric field their interaction with a liquid such as tap water can hence change its ch... | [['cold', 'atmospheric', 'plasmas', 'cap', 'are', 'weakly', 'ionized', 'gases', 'that', 'can', 'be', 'generated', 'in', 'ambient', 'air', 'they', 'produce', 'energetic', 'species', 'eg', 'electrons', 'metastables', 'as', 'well', 'as', 'reactive', 'oxygen', 'species', 'reactive', 'nitrogen', 'species', 'uv', 'radiations... | [-0.04304005647559999, 0.20463921965427317, 0.013602630771034933, 0.01869928224297142, 0.009836122458333214, -0.14869518635585963, 0.06228111638969824, 0.42320617433623, -0.22703391530022426, -0.33099169783567484, 0.09407984032781083, -0.3149686436830484, -0.05133829939468588, 0.17512102828911258, -0.001883211994227237... |
1,802.06887 | A Multiclass Mean-Field Game for Thwarting Misinformation Spread in the
Internet of Battlefield Things (IoBT) | In this paper, the problem of misinformation propagation is studied for an
Internet of Battlefield Things (IoBT) system in which an attacker seeks to
inject false information in the IoBT nodes in order to compromise the IoBT
operations. In the considered model, each IoBT node seeks to counter the
misinformation attac... | cs.GT | in this paper the problem of misinformation propagation is studied for an internet of battlefield things iobt system in which an attacker seeks to inject false information in the iobt nodes in order to compromise the iobt operations in the considered model each iobt node seeks to counter the misinformation attack by fi... | [['in', 'this', 'paper', 'the', 'problem', 'of', 'misinformation', 'propagation', 'is', 'studied', 'for', 'an', 'internet', 'of', 'battlefield', 'things', 'iobt', 'system', 'in', 'which', 'an', 'attacker', 'seeks', 'to', 'inject', 'false', 'information', 'in', 'the', 'iobt', 'nodes', 'in', 'order', 'to', 'compromise', ... | [-0.15691586300373184, 0.034686346048082586, -0.06514670428603676, 0.051497891333982596, -0.04030277437676115, -0.1749682143535818, 0.11128921871088993, 0.32588815687321376, -0.28019337004748, -0.28937163576483727, 0.08594424278702657, -0.3017500806555717, -0.16092632434626608, 0.11579322244892541, -0.12705365237801985... |
1,802.06888 | Superrational types | We present a formal analysis of Douglas Hofstadter's concept of
\emph{superrationality}. We start by defining superrationally justifiable
actions, and study them in symmetric games. We then model the beliefs of the
players, in a way that leads them to different choices than the usual
assumption of rationality by rest... | cs.AI | we present a formal analysis of douglas hofstadters concept of emphsuperrationality we start by defining superrationally justifiable actions and study them in symmetric games we then model the beliefs of the players in a way that leads them to different choices than the usual assumption of rationality by restricting th... | [['we', 'present', 'a', 'formal', 'analysis', 'of', 'douglas', 'hofstadters', 'concept', 'of', 'emphsuperrationality', 'we', 'start', 'by', 'defining', 'superrationally', 'justifiable', 'actions', 'and', 'study', 'them', 'in', 'symmetric', 'games', 'we', 'then', 'model', 'the', 'beliefs', 'of', 'the', 'players', 'in', ... | [-0.11062833804997706, 0.06890870428954561, -0.140148605652509, 0.11208180347782991, -0.109939864623831, -0.12173600070258622, 0.09121517552768872, 0.38636598133191624, -0.2737653880450194, -0.2873626220470635, 0.05762337804746924, -0.21035982237788298, -0.161085081587155, 0.11343913548626006, -0.14229151778804358, 0.0... |
1,802.06889 | The double-trace spectrum of N=4 SYM at strong coupling | The spectrum of IIB supergravity on AdS${}_5 \times S^5$ contains a number of
bound states described by long double-trace multiplets in $\mathcal{N}=4$ super
Yang-Mills theory at large 't Hooft coupling. At large $N$ these states are
degenerate and to obtain their anomalous dimensions as expansions in
$\tfrac{1}{N^2}... | hep-th | the spectrum of iib supergravity on ads_5 times s5 contains a number of bound states described by long doubletrace multiplets in mathcaln4 super yangmills theory at large t hooft coupling at large n these states are degenerate and to obtain their anomalous dimensions as expansions in tfrac1n2 one has to solve a mixing ... | [['the', 'spectrum', 'of', 'iib', 'supergravity', 'on', 'ads_5', 'times', 's5', 'contains', 'a', 'number', 'of', 'bound', 'states', 'described', 'by', 'long', 'doubletrace', 'multiplets', 'in', 'mathcaln4', 'super', 'yangmills', 'theory', 'at', 'large', 't', 'hooft', 'coupling', 'at', 'large', 'n', 'these', 'states', '... | [-0.1822932601789944, 0.22334082491075746, -0.04109065910765471, 0.10181133688176768, -0.046421310293506116, -0.16110807799626714, -0.04155243613506453, 0.2729077848981923, -0.15659031011343288, -0.2533145463810517, 0.11317575547526268, -0.31836119190064405, -0.15822021942809583, 0.09100522492260027, -0.026151032849716... |
1,802.0689 | Range-Only Localization in n-Dimensional Networks With Arbitrary Anchor
Placement | This paper considers node localization in static sensor networks using
range-only measurements. Similar to state- of-the-art algorithms, such as ECHO
and DILOC, we rely on barycentric coordinates of the nodes to transform the
non-convex node localization problem into a linear system of equations. The
main contributio... | eess.SP | this paper considers node localization in static sensor networks using rangeonly measurements similar to state oftheart algorithms such as echo and diloc we rely on barycentric coordinates of the nodes to transform the nonconvex node localization problem into a linear system of equations the main contribution of this p... | [['this', 'paper', 'considers', 'node', 'localization', 'in', 'static', 'sensor', 'networks', 'using', 'rangeonly', 'measurements', 'similar', 'to', 'state', 'oftheart', 'algorithms', 'such', 'as', 'echo', 'and', 'diloc', 'we', 'rely', 'on', 'barycentric', 'coordinates', 'of', 'the', 'nodes', 'to', 'transform', 'the', ... | [-0.1562700614663242, -0.008763545225197567, -0.042856086704208034, 0.007124535198606362, -0.07516032519832819, -0.18001497610578243, 0.08910135939110164, 0.365827774723308, -0.27942564356129, -0.2774353982185167, 0.08876157084942642, -0.2912173905496263, -0.19629853357460728, 0.15750564544025478, -0.061439049639444375... |
1,802.06891 | Fourier Policy Gradients | We propose a new way of deriving policy gradient updates for reinforcement
learning. Our technique, based on Fourier analysis, recasts integrals that
arise with expected policy gradients as convolutions and turns them into
multiplications. The obtained analytical solutions allow us to capture the low
variance benefit... | cs.LG cs.AI | we propose a new way of deriving policy gradient updates for reinforcement learning our technique based on fourier analysis recasts integrals that arise with expected policy gradients as convolutions and turns them into multiplications the obtained analytical solutions allow us to capture the low variance benefits of e... | [['we', 'propose', 'a', 'new', 'way', 'of', 'deriving', 'policy', 'gradient', 'updates', 'for', 'reinforcement', 'learning', 'our', 'technique', 'based', 'on', 'fourier', 'analysis', 'recasts', 'integrals', 'that', 'arise', 'with', 'expected', 'policy', 'gradients', 'as', 'convolutions', 'and', 'turns', 'them', 'into',... | [-0.054689664153556805, 0.01772949469886953, -0.14596224300112226, 0.08405028603579012, -0.11324532901380735, -0.13876621677991352, 0.08589618710811919, 0.4369766724121291, -0.2868986422672606, -0.2754407396350871, 0.07867446146974544, -0.21425951342098415, -0.17454259113765147, 0.2284794984916516, -0.0793169351600227,... |
1,802.06892 | Real World Evaluation of Approaches to Research Paper Recommendation | In this work, we have identified the need for choosing baseline approaches
for research-paper recommendation systems. Following a literature survey of all
research paper recommendation approaches described over the last four years, we
framed criteria that makes for a well-rounded set of baselines. These are
implement... | cs.IR | in this work we have identified the need for choosing baseline approaches for researchpaper recommendation systems following a literature survey of all research paper recommendation approaches described over the last four years we framed criteria that makes for a wellrounded set of baselines these are implemented on mr... | [['in', 'this', 'work', 'we', 'have', 'identified', 'the', 'need', 'for', 'choosing', 'baseline', 'approaches', 'for', 'researchpaper', 'recommendation', 'systems', 'following', 'a', 'literature', 'survey', 'of', 'all', 'research', 'paper', 'recommendation', 'approaches', 'described', 'over', 'the', 'last', 'four', 'ye... | [-0.07583079339043858, -0.005650647693619249, -0.0989783514291048, 0.056206432492278205, -0.14711404577440892, -0.15099154545071844, 0.07868812428108261, 0.44497302087644736, -0.16436168986450259, -0.33342053783126174, 0.08463201671935773, -0.35435583422270917, -0.16384950651166338, 0.26786051563879787, -0.058581026433... |
1,802.06893 | Learning Word Vectors for 157 Languages | Distributed word representations, or word vectors, have recently been applied
to many tasks in natural language processing, leading to state-of-the-art
performance. A key ingredient to the successful application of these
representations is to train them on very large corpora, and use these
pre-trained models in downs... | cs.CL cs.LG | distributed word representations or word vectors have recently been applied to many tasks in natural language processing leading to stateoftheart performance a key ingredient to the successful application of these representations is to train them on very large corpora and use these pretrained models in downstream tasks... | [['distributed', 'word', 'representations', 'or', 'word', 'vectors', 'have', 'recently', 'been', 'applied', 'to', 'many', 'tasks', 'in', 'natural', 'language', 'processing', 'leading', 'to', 'stateoftheart', 'performance', 'a', 'key', 'ingredient', 'to', 'the', 'successful', 'application', 'of', 'these', 'representatio... | [-0.01957588253675827, 0.019459362706309925, -0.022707658527892024, 0.13071862196675427, -0.1662254549548148, -0.12974527977279476, 0.04168831411516294, 0.4989888778932038, -0.30323424637465485, -0.32395804425080615, 0.057467051849160934, -0.33083133440878654, -0.13526564308244454, 0.2552226321043683, -0.12736330211110... |
1,802.06894 | Learning Hidden Markov Models from Pairwise Co-occurrences with
Application to Topic Modeling | We present a new algorithm for identifying the transition and emission
probabilities of a hidden Markov model (HMM) from the emitted data.
Expectation-maximization becomes computationally prohibitive for long
observation records, which are often required for identification. The new
algorithm is particularly suitable ... | cs.CL cs.LG eess.SP stat.ML | we present a new algorithm for identifying the transition and emission probabilities of a hidden markov model hmm from the emitted data expectationmaximization becomes computationally prohibitive for long observation records which are often required for identification the new algorithm is particularly suitable for case... | [['we', 'present', 'a', 'new', 'algorithm', 'for', 'identifying', 'the', 'transition', 'and', 'emission', 'probabilities', 'of', 'a', 'hidden', 'markov', 'model', 'hmm', 'from', 'the', 'emitted', 'data', 'expectationmaximization', 'becomes', 'computationally', 'prohibitive', 'for', 'long', 'observation', 'records', 'wh... | [-0.011182246812295618, 0.0938113691493314, -0.05242373307519559, 0.1562790896325349, -0.14144071135075487, -0.18020289560700667, 0.055027840053002146, 0.45475434612297844, -0.2823927033104742, -0.3085703526702809, 0.09478825912232913, -0.2738694504055307, -0.12807302045923202, 0.16516875631856262, -0.04092150937158165... |
1,802.06895 | Hierarchical Expertise-Level Modeling for User Specific Robot-Behavior
Explanations | There is a growing interest within the AI research community to develop
autonomous systems capable of explaining their behavior to users. One aspect of
the explanation generation problem that has yet to receive much attention is
the task of explaining plans to users whose level of expertise differ from that
of the ex... | cs.AI | there is a growing interest within the ai research community to develop autonomous systems capable of explaining their behavior to users one aspect of the explanation generation problem that has yet to receive much attention is the task of explaining plans to users whose level of expertise differ from that of the expla... | [['there', 'is', 'a', 'growing', 'interest', 'within', 'the', 'ai', 'research', 'community', 'to', 'develop', 'autonomous', 'systems', 'capable', 'of', 'explaining', 'their', 'behavior', 'to', 'users', 'one', 'aspect', 'of', 'the', 'explanation', 'generation', 'problem', 'that', 'has', 'yet', 'to', 'receive', 'much', '... | [-0.07642269196030475, 0.03171684610185651, -0.06898691600411018, 0.10774564245149298, -0.1360798957305891, -0.14419905141642345, 0.077963756406923, 0.3934222402538906, -0.2635541555242363, -0.35296266279947847, 0.06492496668552257, -0.24294215715976794, -0.21151321999026712, 0.20734457887792543, -0.10357983638497709, ... |
1,802.06896 | Color-dependent interactions in the three coloring model | Since it was first discussed by Baxter in 1970, the three coloring model has
been studied in several contexts, from frustrated magnetism to superconducting
devices and glassiness. In presence of interactions, when the model is no
longer exactly soluble, it was already observed that the phase diagram is
highly non-tri... | cond-mat.stat-mech | since it was first discussed by baxter in 1970 the three coloring model has been studied in several contexts from frustrated magnetism to superconducting devices and glassiness in presence of interactions when the model is no longer exactly soluble it was already observed that the phase diagram is highly nontrivial her... | [['since', 'it', 'was', 'first', 'discussed', 'by', 'baxter', 'in', '1970', 'the', 'three', 'coloring', 'model', 'has', 'been', 'studied', 'in', 'several', 'contexts', 'from', 'frustrated', 'magnetism', 'to', 'superconducting', 'devices', 'and', 'glassiness', 'in', 'presence', 'of', 'interactions', 'when', 'the', 'mode... | [-0.1452038948451961, 0.2332015583541856, -0.019071239902491946, 0.09411579577439923, -0.023616465715580244, -0.2447320591839058, 0.04724161375536403, 0.36340200039905624, -0.22626053383782394, -0.2747228949594854, 0.054433531262529596, -0.33563648932960943, -0.10565939817730505, 0.14577763545180936, 0.0438048726385598... |
1,802.06897 | Machine Learning Methods for Data Association in Multi-Object Tracking | Data association is a key step within the multi-object tracking pipeline that
is notoriously challenging due to its combinatorial nature. A popular and
general way to formulate data association is as the NP-hard multidimensional
assignment problem (MDAP). Over the last few years, data-driven approaches to
assignment ... | cs.CV | data association is a key step within the multiobject tracking pipeline that is notoriously challenging due to its combinatorial nature a popular and general way to formulate data association is as the nphard multidimensional assignment problem mdap over the last few years datadriven approaches to assignment have becom... | [['data', 'association', 'is', 'a', 'key', 'step', 'within', 'the', 'multiobject', 'tracking', 'pipeline', 'that', 'is', 'notoriously', 'challenging', 'due', 'to', 'its', 'combinatorial', 'nature', 'a', 'popular', 'and', 'general', 'way', 'to', 'formulate', 'data', 'association', 'is', 'as', 'the', 'nphard', 'multidime... | [-0.04407074673339551, -0.02658055614420148, -0.08298859105611495, 0.08423375292291302, -0.14809794115740083, -0.16566663196079376, 0.07329150511027682, 0.45719954319471534, -0.3056821757566559, -0.3417867184833212, 0.16675510632087182, -0.2575576387547938, -0.1569189205801822, 0.18226259743231674, -0.09314442368029335... |
1,802.06898 | EV-FlowNet: Self-Supervised Optical Flow Estimation for Event-based
Cameras | Event-based cameras have shown great promise in a variety of situations where
frame based cameras suffer, such as high speed motions and high dynamic range
scenes. However, developing algorithms for event measurements requires a new
class of hand crafted algorithms. Deep learning has shown great success in
providing ... | cs.CV cs.RO | eventbased cameras have shown great promise in a variety of situations where frame based cameras suffer such as high speed motions and high dynamic range scenes however developing algorithms for event measurements requires a new class of hand crafted algorithms deep learning has shown great success in providing model f... | [['eventbased', 'cameras', 'have', 'shown', 'great', 'promise', 'in', 'a', 'variety', 'of', 'situations', 'where', 'frame', 'based', 'cameras', 'suffer', 'such', 'as', 'high', 'speed', 'motions', 'and', 'high', 'dynamic', 'range', 'scenes', 'however', 'developing', 'algorithms', 'for', 'event', 'measurements', 'require... | [-0.04385520332578293, -0.002411214665214401, -0.097086733308271, 0.05377767684180127, -0.11316086293307975, -0.16874080786367626, -0.004678368412861072, 0.45508325133293737, -0.2590703179604297, -0.34314802383768117, 0.09879982208438608, -0.25179753998833593, -0.16286193545273298, 0.2376523798130306, -0.16058774378890... |
1,802.06899 | Hill plot focusing on Ce compounds with high
magnetic-ordering-temperatures and consequent study of Ce2AuP3 | Hill plot is a well-known criterion of the f-electron element interatomic
threshold-distance separating the nonmagnetic state from the magnetic one in
actinides or lanthanides. We have reinvestigated the Hill plot of Ce compounds
using a commercial crystallographic database CRYSTMET, focusing on a
relationship betwee... | cond-mat.mtrl-sci | hill plot is a wellknown criterion of the felectron element interatomic thresholddistance separating the nonmagnetic state from the magnetic one in actinides or lanthanides we have reinvestigated the hill plot of ce compounds using a commercial crystallographic database crystmet focusing on a relationship between the c... | [['hill', 'plot', 'is', 'a', 'wellknown', 'criterion', 'of', 'the', 'felectron', 'element', 'interatomic', 'thresholddistance', 'separating', 'the', 'nonmagnetic', 'state', 'from', 'the', 'magnetic', 'one', 'in', 'actinides', 'or', 'lanthanides', 'we', 'have', 'reinvestigated', 'the', 'hill', 'plot', 'of', 'ce', 'compo... | [-0.16508218669204164, 0.19059419938061825, -0.06814555570770822, 0.054676921097458996, -0.03792379106401794, -0.1370509173002039, 0.1314923832028666, 0.3497105994850726, -0.22691690082908333, -0.3103098561234005, 0.0009761759583317839, -0.3611059423864764, -0.05930546216618763, 0.16498906049117282, 0.0618663622847046,... |
1,802.069 | Exploring the high-pressure materials genome | A thorough in situ characterization of materials at extreme conditions is
challenging, and computational tools such as crystal structural search methods
in combination with ab initio calculations are widely used to guide experiments
by predicting the composition, structure, and properties of high-pressure
compounds. ... | cond-mat.mtrl-sci | a thorough in situ characterization of materials at extreme conditions is challenging and computational tools such as crystal structural search methods in combination with ab initio calculations are widely used to guide experiments by predicting the composition structure and properties of highpressure compounds however... | [['a', 'thorough', 'in', 'situ', 'characterization', 'of', 'materials', 'at', 'extreme', 'conditions', 'is', 'challenging', 'and', 'computational', 'tools', 'such', 'as', 'crystal', 'structural', 'search', 'methods', 'in', 'combination', 'with', 'ab', 'initio', 'calculations', 'are', 'widely', 'used', 'to', 'guide', 'e... | [-0.07826731935229843, 0.11367042695788006, -0.0674452693739866, 0.04926697212779614, -0.08536347245261754, -0.11679572098568002, 0.09469343824136842, 0.4153375542892884, -0.28648168556874126, -0.33744066121477273, 0.1388362522145623, -0.26052664263988845, -0.15387031444728935, 0.22508205926190983, 0.01797952859972914,... |
1,802.06901 | Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative
Refinement | We propose a conditional non-autoregressive neural sequence model based on
iterative refinement. The proposed model is designed based on the principles of
latent variable models and denoising autoencoders, and is generally applicable
to any sequence generation task. We extensively evaluate the proposed model on
machi... | cs.LG cs.CL stat.ML | we propose a conditional nonautoregressive neural sequence model based on iterative refinement the proposed model is designed based on the principles of latent variable models and denoising autoencoders and is generally applicable to any sequence generation task we extensively evaluate the proposed model on machine tra... | [['we', 'propose', 'a', 'conditional', 'nonautoregressive', 'neural', 'sequence', 'model', 'based', 'on', 'iterative', 'refinement', 'the', 'proposed', 'model', 'is', 'designed', 'based', 'on', 'the', 'principles', 'of', 'latent', 'variable', 'models', 'and', 'denoising', 'autoencoders', 'and', 'is', 'generally', 'appl... | [-0.01308524771260896, 0.0025612685962447096, -0.05479779844837529, 0.09490325441916607, -0.09748740254768304, -0.1879950847942382, 0.04211173196589308, 0.48982046714850835, -0.27282045991825205, -0.3123794520007713, 0.09440272542248879, -0.22529054928038802, -0.19492578992753157, 0.19379113554688437, -0.11095241361430... |
1,802.06902 | Caching-Aided Collaborative D2D Operation for Predictive Data
Dissemination in Industrial IoT | Industrial automation deployments constitute challenging environments where
moving IoT machines may produce high-definition video and other heavy sensor
data during surveying and inspection operations. Transporting massive contents
to the edge network infrastructure and then eventually to the remote human
operator re... | cs.NI | industrial automation deployments constitute challenging environments where moving iot machines may produce highdefinition video and other heavy sensor data during surveying and inspection operations transporting massive contents to the edge network infrastructure and then eventually to the remote human operator requir... | [['industrial', 'automation', 'deployments', 'constitute', 'challenging', 'environments', 'where', 'moving', 'iot', 'machines', 'may', 'produce', 'highdefinition', 'video', 'and', 'other', 'heavy', 'sensor', 'data', 'during', 'surveying', 'and', 'inspection', 'operations', 'transporting', 'massive', 'contents', 'to', '... | [-0.20351061105739865, 0.03513800464101932, -0.023155089965640748, 0.005671534033451206, -0.13961844790562894, -0.22504533276125882, 0.16518317533286475, 0.4185054027856146, -0.23264929027232173, -0.31202895592081026, 0.10945456872094546, -0.26908088908911504, -0.16903909863962693, 0.12573670392486988, -0.1524512756340... |
1,802.06903 | Generalization Error Bounds with Probabilistic Guarantee for SGD in
Nonconvex Optimization | The success of deep learning has led to a rising interest in the
generalization property of the stochastic gradient descent (SGD) method, and
stability is one popular approach to study it. Existing works based on
stability have studied nonconvex loss functions, but only considered the
generalization error of the SGD ... | stat.ML cs.LG math.OC | the success of deep learning has led to a rising interest in the generalization property of the stochastic gradient descent sgd method and stability is one popular approach to study it existing works based on stability have studied nonconvex loss functions but only considered the generalization error of the sgd in expe... | [['the', 'success', 'of', 'deep', 'learning', 'has', 'led', 'to', 'a', 'rising', 'interest', 'in', 'the', 'generalization', 'property', 'of', 'the', 'stochastic', 'gradient', 'descent', 'sgd', 'method', 'and', 'stability', 'is', 'one', 'popular', 'approach', 'to', 'study', 'it', 'existing', 'works', 'based', 'on', 'sta... | [-0.0519732462005022, -0.03550540921776175, -0.08141137686493637, 0.1668596798056186, -0.036214029264150176, -0.16346410669257525, 0.05598048152440116, 0.4009185587553858, -0.3237967732539635, -0.2728812004082233, 0.12562503786274354, -0.24006581124878903, -0.18982358919983766, 0.21726514623974855, -0.1925260658286594,... |
1,802.06904 | Eisenstein series arising from Jordan algebras | We describe poles and the corresponding residual automorphic representations
of Eisenstein series attached to maximal parabolic subgroups whose unipotent
radicals admit Jordan algebra structure.
| math.RT | we describe poles and the corresponding residual automorphic representations of eisenstein series attached to maximal parabolic subgroups whose unipotent radicals admit jordan algebra structure | [['we', 'describe', 'poles', 'and', 'the', 'corresponding', 'residual', 'automorphic', 'representations', 'of', 'eisenstein', 'series', 'attached', 'to', 'maximal', 'parabolic', 'subgroups', 'whose', 'unipotent', 'radicals', 'admit', 'jordan', 'algebra', 'structure']] | [-0.24901899136602879, 0.01352033284395778, -0.1582208798499778, 0.01623446187780549, -0.22141718808173513, -0.13445939624216408, -0.07495140157698188, 0.31079131287212175, -0.4348446944107612, -0.07457142261167367, 0.10292224126988003, -0.2653496409766376, -0.14713669296664497, 0.20240118474854776, -0.1432308735481152... |
1,802.06905 | Communication-Optimal Convolutional Neural Nets | Efficiently executing convolutional neural nets (CNNs) is important in many
machine-learning tasks. Since the cost of moving a word of data, either between
levels of a memory hierarchy or between processors over a network, is much
higher than the cost of an arithmetic operation, minimizing data movement is
critical t... | cs.DS cs.CC | efficiently executing convolutional neural nets cnns is important in many machinelearning tasks since the cost of moving a word of data either between levels of a memory hierarchy or between processors over a network is much higher than the cost of an arithmetic operation minimizing data movement is critical to perform... | [['efficiently', 'executing', 'convolutional', 'neural', 'nets', 'cnns', 'is', 'important', 'in', 'many', 'machinelearning', 'tasks', 'since', 'the', 'cost', 'of', 'moving', 'a', 'word', 'of', 'data', 'either', 'between', 'levels', 'of', 'a', 'memory', 'hierarchy', 'or', 'between', 'processors', 'over', 'a', 'network',... | [-0.1144863287652539, 0.046431968663218075, -0.04582258639857173, 0.10571754181443754, -0.08681935377661949, -0.20032167687263017, 0.09809521161767644, 0.43731365644413495, -0.27856498375742533, -0.3576387100974503, 0.12072722382372772, -0.25050843949160795, -0.16128937382777425, 0.267431013708752, -0.1497852609027177,... |
1,802.06906 | Coherent merging of counter-propagating exciton-polariton superfluids | We report the formation of a macroscopic coherent state emerging from
colliding polariton fluids. Four lasers with random relative phases, arranged
in a square, pump resonantly a planar microcavity, creating four coherent
polariton fluids propagating toward each other. When the density (interactions)
increases, the f... | cond-mat.quant-gas cond-mat.other quant-ph | we report the formation of a macroscopic coherent state emerging from colliding polariton fluids four lasers with random relative phases arranged in a square pump resonantly a planar microcavity creating four coherent polariton fluids propagating toward each other when the density interactions increases the four fluids... | [['we', 'report', 'the', 'formation', 'of', 'a', 'macroscopic', 'coherent', 'state', 'emerging', 'from', 'colliding', 'polariton', 'fluids', 'four', 'lasers', 'with', 'random', 'relative', 'phases', 'arranged', 'in', 'a', 'square', 'pump', 'resonantly', 'a', 'planar', 'microcavity', 'creating', 'four', 'coherent', 'pol... | [-0.24779652480501682, 0.3623787701285134, -0.060324628252419646, -0.018727667319277923, 0.007584912283346057, -0.20600327518768607, 0.016557190122936542, 0.3719445104400317, -0.23256774117859702, -0.24001478763918083, -0.0401143238976753, -0.3243170689791441, -0.059676273450410613, 0.13329704089652902, 0.0991296037100... |
1,802.06907 | High-density two-dimensional electron system induced by oxygen vacancies
in ZnO | We realize a two-dimensional electron system (2DES) in ZnO by simply
depositing pure aluminum on its surface in ultra-high vacuum, and characterize
its electronic structure using angle-resolved photoemission spectroscopy. The
aluminum oxidizes into alumina by creating oxygen vacancies that dope the bulk
conduction ba... | cond-mat.mtrl-sci | we realize a twodimensional electron system 2des in zno by simply depositing pure aluminum on its surface in ultrahigh vacuum and characterize its electronic structure using angleresolved photoemission spectroscopy the aluminum oxidizes into alumina by creating oxygen vacancies that dope the bulk conduction band of zno... | [['we', 'realize', 'a', 'twodimensional', 'electron', 'system', '2des', 'in', 'zno', 'by', 'simply', 'depositing', 'pure', 'aluminum', 'on', 'its', 'surface', 'in', 'ultrahigh', 'vacuum', 'and', 'characterize', 'its', 'electronic', 'structure', 'using', 'angleresolved', 'photoemission', 'spectroscopy', 'the', 'aluminum... | [-0.1065650757718984, 0.20315107963521217, -0.0507571196787586, 0.005644003970388201, 0.04056327144966507, -0.15356080453522258, 0.10055220139319779, 0.4148383532940853, -0.22421760019845308, -0.2957742481118404, -0.04274930245792646, -0.3872250671208393, -0.08486107301127288, 0.17316926159269985, 0.06940865137549422, ... |
1,802.06908 | BFKL Spectrum of N=4 SYM: non-Zero Conformal Spin | We developed a general non-perturbative framework for the BFKL spectrum of
planar N=4 SYM, based on the Quantum Spectral Curve (QSC). It allows one to
study the spectrum in the whole generality, extending previously known methods
to arbitrary values of conformal spin $n$. We show how to apply our approach to
reproduc... | hep-th hep-ph math-ph math.MP nucl-th | we developed a general nonperturbative framework for the bfkl spectrum of planar n4 sym based on the quantum spectral curve qsc it allows one to study the spectrum in the whole generality extending previously known methods to arbitrary values of conformal spin n we show how to apply our approach to reproduce all known ... | [['we', 'developed', 'a', 'general', 'nonperturbative', 'framework', 'for', 'the', 'bfkl', 'spectrum', 'of', 'planar', 'n4', 'sym', 'based', 'on', 'the', 'quantum', 'spectral', 'curve', 'qsc', 'it', 'allows', 'one', 'to', 'study', 'the', 'spectrum', 'in', 'the', 'whole', 'generality', 'extending', 'previously', 'known'... | [-0.08503512651738922, 0.047002409194812404, -0.11767933299548035, 0.10249113002514192, -0.10500794267070225, -0.11199149671698581, -0.012205126319630917, 0.3331919863227416, -0.19377358791164376, -0.250380489035954, 0.03927763184434629, -0.2751669855458452, -0.12973530587743715, 0.16958310664896006, 0.0298934079420922... |
1,802.06909 | Canonical $\beta$-extensions | We compare the level zero part of the type of a representation of GL(n) over
a non-archimedean local field with the tame part of its Langlands parameter
restricted to inertia. By normalizing this comparison, we construct canonical
$\beta$-extensions of maximal simple characters.
| math.RT math.NT | we compare the level zero part of the type of a representation of gln over a nonarchimedean local field with the tame part of its langlands parameter restricted to inertia by normalizing this comparison we construct canonical betaextensions of maximal simple characters | [['we', 'compare', 'the', 'level', 'zero', 'part', 'of', 'the', 'type', 'of', 'a', 'representation', 'of', 'gln', 'over', 'a', 'nonarchimedean', 'local', 'field', 'with', 'the', 'tame', 'part', 'of', 'its', 'langlands', 'parameter', 'restricted', 'to', 'inertia', 'by', 'normalizing', 'this', 'comparison', 'we', 'constr... | [-0.17772175407125837, 0.043434414642217145, -0.1310335258798053, 0.05680641619255766, -0.13772815168790875, -0.06881301248046968, 0.01971397778418447, 0.25582855611684774, -0.33145910643395926, -0.19158655192170823, 0.05594294224422248, -0.18094994972593018, -0.11896165722005424, 0.18446271143676268, -0.10361851146444... |
1,802.0691 | Single or Multiple Frames Content Delivery for Next-Generation Networks? | This paper addresses the four enabling technologies, namely multi-user sparse
code multiple access (SCMA), content caching, energy harvesting, and physical
layer security for proposing an energy and spectral efficient resource
allocation algorithm for the access and backhaul links in heterogeneous
cellular networks. ... | cs.IT cs.NI math.IT | this paper addresses the four enabling technologies namely multiuser sparse code multiple access scma content caching energy harvesting and physical layer security for proposing an energy and spectral efficient resource allocation algorithm for the access and backhaul links in heterogeneous cellular networks although e... | [['this', 'paper', 'addresses', 'the', 'four', 'enabling', 'technologies', 'namely', 'multiuser', 'sparse', 'code', 'multiple', 'access', 'scma', 'content', 'caching', 'energy', 'harvesting', 'and', 'physical', 'layer', 'security', 'for', 'proposing', 'an', 'energy', 'and', 'spectral', 'efficient', 'resource', 'allocat... | [-0.20988934820343275, 0.004130036482479227, -0.016605010430339462, 0.04643532359887104, -0.10059155645103601, -0.24761899337318027, 0.11750151918522533, 0.4148433599316377, -0.3195234986487776, -0.3043668321413051, 0.10462534794669409, -0.23575345343306253, -0.13680853486403066, 0.1141893645253731, -0.1356549438969523... |
1,802.06911 | Strong enhancement of the spin Hall effect by spin fluctuations near the
Curie point of FexPt1-x alloys | Robust spin Hall effects (SHE) have recently been observed in non-magnetic
heavy metal systems with strong spin-orbit interactions. These SHE are either
attributed to an intrinsic band-structure effect or to extrinsic spin-dependent
scattering from impurities, namely side-jump or skew scattering. Here we report
on an... | cond-mat.mtrl-sci | robust spin hall effects she have recently been observed in nonmagnetic heavy metal systems with strong spinorbit interactions these she are either attributed to an intrinsic bandstructure effect or to extrinsic spindependent scattering from impurities namely sidejump or skew scattering here we report on an extraordina... | [['robust', 'spin', 'hall', 'effects', 'she', 'have', 'recently', 'been', 'observed', 'in', 'nonmagnetic', 'heavy', 'metal', 'systems', 'with', 'strong', 'spinorbit', 'interactions', 'these', 'she', 'are', 'either', 'attributed', 'to', 'an', 'intrinsic', 'bandstructure', 'effect', 'or', 'to', 'extrinsic', 'spindependen... | [-0.1810822934170978, 0.2292072404287202, -0.026646104995175668, 0.040551075281397106, -0.06285393789962486, -0.167749474796662, 0.05012350946802784, 0.4100504925612498, -0.2904744316122414, -0.28424970167516556, -0.02322736962477067, -0.3398655465528093, -0.14198838057065452, 0.20877769097605328, 0.04557901857126889, ... |
1,802.06912 | Constraining Dark Matter Models with a Light Mediator from PandaX-II
Experiment | We search for nuclear recoil signals of dark matter models with a light
mediator in PandaX-II, a direct detection experiment in China Jinping
underground Laboratory. Using data collected in 2016 and 2017 runs,
corresponding to a total exposure of 54 ton day, we set upper limits on the
zero-momentum dark matter-nucleo... | hep-ph hep-ex | we search for nuclear recoil signals of dark matter models with a light mediator in pandaxii a direct detection experiment in china jinping underground laboratory using data collected in 2016 and 2017 runs corresponding to a total exposure of 54 ton day we set upper limits on the zeromomentum dark matternucleon cross s... | [['we', 'search', 'for', 'nuclear', 'recoil', 'signals', 'of', 'dark', 'matter', 'models', 'with', 'a', 'light', 'mediator', 'in', 'pandaxii', 'a', 'direct', 'detection', 'experiment', 'in', 'china', 'jinping', 'underground', 'laboratory', 'using', 'data', 'collected', 'in', '2016', 'and', '2017', 'runs', 'correspondin... | [-0.04934185383261361, 0.19457426567443467, -0.09145321701081437, 0.13926954435597158, -0.09056509063546464, -0.09470031088169076, 0.06557936388018884, 0.31470247079095426, -0.1687828739002151, -0.4485043344994713, 0.035966192197520286, -0.35574889163437645, 0.054398624142713584, 0.22321293891097108, 0.0758948180979738... |
1,802.06913 | ElasticPath2Path: Automated morphological classification of neurons by
elastic path matching | In the study of neurons, morphology influences function. The complexity in
the structure of neurons poses a challenge in the identification and analysis
of similar and dissimilar neuronal cells. Existing methodologies carry out
structural and geometrical simplifications, which substantially change the
morphological s... | eess.IV q-bio.NC | in the study of neurons morphology influences function the complexity in the structure of neurons poses a challenge in the identification and analysis of similar and dissimilar neuronal cells existing methodologies carry out structural and geometrical simplifications which substantially change the morphological statist... | [['in', 'the', 'study', 'of', 'neurons', 'morphology', 'influences', 'function', 'the', 'complexity', 'in', 'the', 'structure', 'of', 'neurons', 'poses', 'a', 'challenge', 'in', 'the', 'identification', 'and', 'analysis', 'of', 'similar', 'and', 'dissimilar', 'neuronal', 'cells', 'existing', 'methodologies', 'carry', '... | [-0.11559879359346167, 0.05497197768444392, -0.08902084547379571, 0.03783825649669678, -0.08574202733224309, -0.10242493969336566, 0.0783034029817726, 0.3988014138562398, -0.30742503693747697, -0.3074851989953863, 0.020183285388662223, -0.27442894516732647, -0.23443395372628906, 0.15523269797752923, -0.0788959850906394... |
1,802.06914 | A Binary Offset Effect in CCD Readout and Its Impact on Astronomical
Data | We have discovered an anomalous behavior of CCD readout electronics that
affects their use in many astronomical applications. An offset in the
digitization of the CCD output voltage that depends on the binary encoding of
one pixel is added to pixels that are read out one, two and/or three pixels
later. One result of ... | astro-ph.IM physics.ins-det | we have discovered an anomalous behavior of ccd readout electronics that affects their use in many astronomical applications an offset in the digitization of the ccd output voltage that depends on the binary encoding of one pixel is added to pixels that are read out one two andor three pixels later one result of this e... | [['we', 'have', 'discovered', 'an', 'anomalous', 'behavior', 'of', 'ccd', 'readout', 'electronics', 'that', 'affects', 'their', 'use', 'in', 'many', 'astronomical', 'applications', 'an', 'offset', 'in', 'the', 'digitization', 'of', 'the', 'ccd', 'output', 'voltage', 'that', 'depends', 'on', 'the', 'binary', 'encoding',... | [-0.07494552076629757, 0.09834135305127965, -0.08634330111655217, 0.03914295009719389, -0.11764617345422435, -0.14828011596087112, 0.01895360719498464, 0.4176512119694821, -0.19596173384032456, -0.373333190956596, 0.14607166905505403, -0.33421968877794744, -0.10018832403239658, 0.26478211871502033, -0.09897461104731176... |
1,802.06915 | Extinction Maps and Dust-to-Gas Ratios in Nearby Galaxies with LEGUS | We present a study of the dust-to-gas ratios in five nearby galaxies NGC 628
(M74), NGC 6503, NGC 7793, UGC 5139 (Holmberg I), and UGC 4305 (Holmberg II).
Using Hubble Space Telescope broad band WFC3/UVIS UV and optical images from
the Treasury program LEGUS (Legacy ExtraGalactic UV Survey) combined with
archival HST... | astro-ph.GA | we present a study of the dusttogas ratios in five nearby galaxies ngc 628 m74 ngc 6503 ngc 7793 ugc 5139 holmberg i and ugc 4305 holmberg ii using hubble space telescope broad band wfc3uvis uv and optical images from the treasury program legus legacy extragalactic uv survey combined with archival hstacs data we correc... | [['we', 'present', 'a', 'study', 'of', 'the', 'dusttogas', 'ratios', 'in', 'five', 'nearby', 'galaxies', 'ngc', '628', 'm74', 'ngc', '6503', 'ngc', '7793', 'ugc', '5139', 'holmberg', 'i', 'and', 'ugc', '4305', 'holmberg', 'ii', 'using', 'hubble', 'space', 'telescope', 'broad', 'band', 'wfc3uvis', 'uv', 'and', 'optical'... | [0.004443295667489567, -0.026380440875197874, -0.07568786377407002, 0.12624756057343, -0.07644777433435102, -0.07426264256192971, 0.059943415899061527, 0.5214250726793201, -0.11565774190339535, -0.36829937831398757, 0.007576582013517458, -0.3014177772608214, -0.031614072569905755, 0.1895821155308718, -0.066567990888917... |
1,802.06916 | Simplicial Closure and higher-order link prediction | Networks provide a powerful formalism for modeling complex systems by using a
model of pairwise interactions. But much of the structure within these systems
involves interactions that take place among more than two nodes at once; for
example, communication within a group rather than person-to person,
collaboration am... | cs.SI cond-mat.stat-mech math.AT physics.soc-ph stat.ML | networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions but much of the structure within these systems involves interactions that take place among more than two nodes at once for example communication within a group rather than personto person collaboration among a t... | [['networks', 'provide', 'a', 'powerful', 'formalism', 'for', 'modeling', 'complex', 'systems', 'by', 'using', 'a', 'model', 'of', 'pairwise', 'interactions', 'but', 'much', 'of', 'the', 'structure', 'within', 'these', 'systems', 'involves', 'interactions', 'that', 'take', 'place', 'among', 'more', 'than', 'two', 'node... | [-0.14226493531249515, 0.08136112306534347, -0.06621805488560152, 0.13967063883615924, -0.0765641039869041, -0.14238053211873328, 0.049387300744894204, 0.3987300070347609, -0.2435940601474916, -0.36304083269054965, 0.0332076255376537, -0.3098294571337411, -0.20057821908698384, 0.17725051610937548, 0.0374190821042888, -... |
1,802.06917 | Relative Weak Injectivity for Operator Systems | We investigate the notion of relative weak injectivity and its nuclearity
related properties in the category of operator systems. We obtain several
characterizations of the weak expectation property. We show that
(c,max)-nuclearity characterizes Kirchberg and Wasserman's C*-systems. Namioka
and Phelps' test systems, ... | math.OA | we investigate the notion of relative weak injectivity and its nuclearity related properties in the category of operator systems we obtain several characterizations of the weak expectation property we show that cmaxnuclearity characterizes kirchberg and wassermans csystems namioka and phelps test systems which detects ... | [['we', 'investigate', 'the', 'notion', 'of', 'relative', 'weak', 'injectivity', 'and', 'its', 'nuclearity', 'related', 'properties', 'in', 'the', 'category', 'of', 'operator', 'systems', 'we', 'obtain', 'several', 'characterizations', 'of', 'the', 'weak', 'expectation', 'property', 'we', 'show', 'that', 'cmaxnuclearit... | [-0.14848635744669342, 0.06502659765205213, -0.07798146308798876, 0.16442014123479437, -0.03637361321598291, -0.12206320543773472, -0.04678177820917751, 0.41143512757761136, -0.3449152863867182, -0.16618260563617307, 0.133111234077452, -0.2679844668135047, -0.14181469146694456, 0.19785733720636928, -0.1633533380260425,... |
1,802.06918 | Perturbative unitarity and higher-order Lorentz symmetry breaking | We study perturbative unitarity in the scalar sector of the Myers-Pospelov
model. The model introduces a preferred four-vector $n$ which breaks Lorentz
symmetry and couples to a five-dimension operator. When the preferred
four-vector is chosen in the pure timelike or lightlike direction, the model
becomes a higher ti... | hep-th hep-ph | we study perturbative unitarity in the scalar sector of the myerspospelov model the model introduces a preferred fourvector n which breaks lorentz symmetry and couples to a fivedimension operator when the preferred fourvector is chosen in the pure timelike or lightlike direction the model becomes a higher time derivati... | [['we', 'study', 'perturbative', 'unitarity', 'in', 'the', 'scalar', 'sector', 'of', 'the', 'myerspospelov', 'model', 'the', 'model', 'introduces', 'a', 'preferred', 'fourvector', 'n', 'which', 'breaks', 'lorentz', 'symmetry', 'and', 'couples', 'to', 'a', 'fivedimension', 'operator', 'when', 'the', 'preferred', 'fourve... | [-0.19155484899130992, 0.18494253526564294, -0.10034871278269412, 0.09872365487972275, -0.10363489604113918, -0.15324230276195233, 0.023836592085487943, 0.3065750952172828, -0.23375578279557982, -0.21385294376431327, 0.05496722656699651, -0.31046450330728764, -0.10569883426896444, 0.11046477810626751, 0.007652340585819... |
1,802.06919 | A generalization of Birch's theorem and vertex-balanced steady states
for generalized mass-action systems | Mass-action kinetics and its generalizations appear in mathematical models of
(bio-)chemical reaction networks, population dynamics, and epidemiology. The
dynamical systems arising from directed graphs are generally non-linear and
difficult to analyze. One approach to studying them is to find conditions on
the networ... | math.DS | massaction kinetics and its generalizations appear in mathematical models of biochemical reaction networks population dynamics and epidemiology the dynamical systems arising from directed graphs are generally nonlinear and difficult to analyze one approach to studying them is to find conditions on the network which eit... | [['massaction', 'kinetics', 'and', 'its', 'generalizations', 'appear', 'in', 'mathematical', 'models', 'of', 'biochemical', 'reaction', 'networks', 'population', 'dynamics', 'and', 'epidemiology', 'the', 'dynamical', 'systems', 'arising', 'from', 'directed', 'graphs', 'are', 'generally', 'nonlinear', 'and', 'difficult'... | [-0.12183725503028224, 0.0851239966118316, -0.1089603518594231, 0.09207676730492446, -0.04729462449444997, -0.17072166573397177, 0.01869005398552154, 0.28952243245868503, -0.31431141819829417, -0.25371921073191944, 0.12335575794369154, -0.2381644594807815, -0.15557838363211454, 0.17328844904458443, -0.06033114871733185... |
1,802.0692 | Layer-wise synapse optimization for implementing neural networks on
general neuromorphic architectures | Deep artificial neural networks (ANNs) can represent a wide range of complex
functions. Implementing ANNs in Von Neumann computing systems, though, incurs a
high energy cost due to the bottleneck created between CPU and memory.
Implementation on neuromorphic systems may help to reduce energy demand.
Conventional ANNs... | cs.NE | deep artificial neural networks anns can represent a wide range of complex functions implementing anns in von neumann computing systems though incurs a high energy cost due to the bottleneck created between cpu and memory implementation on neuromorphic systems may help to reduce energy demand conventional anns must be ... | [['deep', 'artificial', 'neural', 'networks', 'anns', 'can', 'represent', 'a', 'wide', 'range', 'of', 'complex', 'functions', 'implementing', 'anns', 'in', 'von', 'neumann', 'computing', 'systems', 'though', 'incurs', 'a', 'high', 'energy', 'cost', 'due', 'to', 'the', 'bottleneck', 'created', 'between', 'cpu', 'and', '... | [-0.08016892930651764, 0.004417534342543904, -0.024252862010787173, 0.0369635050564528, -0.07891492636238293, -0.20817934901612561, 0.05349432561807789, 0.4696474334883799, -0.30219494037602734, -0.33120610918168253, 0.06357753240764595, -0.23740213648302527, -0.22390082356201985, 0.21728590501233844, -0.09485545636540... |
1,802.06921 | Frequency-dependent impedance and surface waves on the boundary of a
stratified dielectric medium | We analyse waves that propagate along the interface between a dielectric
half-space and a half-space filled with a Lorentz material. We show that the
corresponding interface condition leads to a generalisation of the classical
Leontovich condition on the boundary of a dielectric half-space. We study when
this conditi... | math-ph math.MP math.SP | we analyse waves that propagate along the interface between a dielectric halfspace and a halfspace filled with a lorentz material we show that the corresponding interface condition leads to a generalisation of the classical leontovich condition on the boundary of a dielectric halfspace we study when this condition supp... | [['we', 'analyse', 'waves', 'that', 'propagate', 'along', 'the', 'interface', 'between', 'a', 'dielectric', 'halfspace', 'and', 'a', 'halfspace', 'filled', 'with', 'a', 'lorentz', 'material', 'we', 'show', 'that', 'the', 'corresponding', 'interface', 'condition', 'leads', 'to', 'a', 'generalisation', 'of', 'the', 'clas... | [-0.20676198107905167, 0.17282097326553708, -0.06570818968290507, 0.020802585791179173, -0.15110458589029, -0.10028997791367908, 0.03555910865001943, 0.3723518366297317, -0.2846691164507552, -0.19886595602038987, 0.08138913092295487, -0.26717864527085494, -0.16751616486066648, 0.18643452553349266, 0.031878731657512656,... |
1,802.06922 | QMCPACK : An open source ab initio Quantum Monte Carlo package for the
electronic structure of atoms, molecules, and solids | QMCPACK is an open source quantum Monte Carlo package for ab-initio
electronic structure calculations. It supports calculations of metallic and
insulating solids, molecules, atoms, and some model Hamiltonians. Implemented
real space quantum Monte Carlo algorithms include variational, diffusion, and
reptation Monte Ca... | physics.comp-ph physics.chem-ph | qmcpack is an open source quantum monte carlo package for abinitio electronic structure calculations it supports calculations of metallic and insulating solids molecules atoms and some model hamiltonians implemented real space quantum monte carlo algorithms include variational diffusion and reptation monte carlo qmcpac... | [['qmcpack', 'is', 'an', 'open', 'source', 'quantum', 'monte', 'carlo', 'package', 'for', 'abinitio', 'electronic', 'structure', 'calculations', 'it', 'supports', 'calculations', 'of', 'metallic', 'and', 'insulating', 'solids', 'molecules', 'atoms', 'and', 'some', 'model', 'hamiltonians', 'implemented', 'real', 'space'... | [-0.10352615101932527, 0.07877005149032938, -0.04047364851351093, 0.09991181560326368, -0.05644291331889584, -0.18026513031541105, 0.01694842440715182, 0.466175830059678, -0.2591308344968758, -0.34882583859356214, 0.05998557828193408, -0.28691550874470795, -0.09591352993989513, 0.2712047344709264, 0.07253058467197987, ... |
1,802.06923 | The sporadic group Co3, Hauptmodul and Belyi map | We calculate the hauptmodul and Belyi map of a genus zero subgroup of the
modular group defined via a canonical homomorphism by the Conway group group
Co3. Our main result is the Belyi map and its field of definition.
| math.NT | we calculate the hauptmodul and belyi map of a genus zero subgroup of the modular group defined via a canonical homomorphism by the conway group group co3 our main result is the belyi map and its field of definition | [['we', 'calculate', 'the', 'hauptmodul', 'and', 'belyi', 'map', 'of', 'a', 'genus', 'zero', 'subgroup', 'of', 'the', 'modular', 'group', 'defined', 'via', 'a', 'canonical', 'homomorphism', 'by', 'the', 'conway', 'group', 'group', 'co3', 'our', 'main', 'result', 'is', 'the', 'belyi', 'map', 'and', 'its', 'field', 'of',... | [-0.21063021522683975, 0.06625296830987701, -0.16392603344642198, 0.057665336653232, -0.08752797276545794, -0.11021501127964793, 0.06086508442576115, 0.3017706819451772, -0.39739611534736097, -0.2540473721157282, 0.06387664111426626, -0.24276347656567127, -0.17269786646685156, 0.18033847728600869, -0.13520793287226787,... |
1,802.06924 | Teaching Categories to Human Learners with Visual Explanations | We study the problem of computer-assisted teaching with explanations.
Conventional approaches for machine teaching typically only provide feedback at
the instance level e.g., the category or label of the instance. However, it is
intuitive that clear explanations from a knowledgeable teacher can
significantly improve ... | cs.CV cs.LG stat.ML | we study the problem of computerassisted teaching with explanations conventional approaches for machine teaching typically only provide feedback at the instance level eg the category or label of the instance however it is intuitive that clear explanations from a knowledgeable teacher can significantly improve a student... | [['we', 'study', 'the', 'problem', 'of', 'computerassisted', 'teaching', 'with', 'explanations', 'conventional', 'approaches', 'for', 'machine', 'teaching', 'typically', 'only', 'provide', 'feedback', 'at', 'the', 'instance', 'level', 'eg', 'the', 'category', 'or', 'label', 'of', 'the', 'instance', 'however', 'it', 'is... | [0.030173169508943276, 0.016570202687007346, -0.09156045976983891, 0.1406648162025676, -0.1891811677875618, -0.2145598585731491, 0.07197200560194413, 0.438007989857755, -0.23827407965732025, -0.3715405814194431, 0.03967337756661105, -0.2645507352991086, -0.20458135529505936, 0.22015823101780066, -0.15447508423081177, 0... |
1,802.06925 | Inexact Non-Convex Newton-Type Methods | For solving large-scale non-convex problems, we propose inexact variants of
trust region and adaptive cubic regularization methods, which, to increase
efficiency, incorporate various approximations. In particular, in addition to
approximate sub-problem solves, both the Hessian and the gradient are suitably
approximat... | math.OC | for solving largescale nonconvex problems we propose inexact variants of trust region and adaptive cubic regularization methods which to increase efficiency incorporate various approximations in particular in addition to approximate subproblem solves both the hessian and the gradient are suitably approximated using rat... | [['for', 'solving', 'largescale', 'nonconvex', 'problems', 'we', 'propose', 'inexact', 'variants', 'of', 'trust', 'region', 'and', 'adaptive', 'cubic', 'regularization', 'methods', 'which', 'to', 'increase', 'efficiency', 'incorporate', 'various', 'approximations', 'in', 'particular', 'in', 'addition', 'to', 'approxima... | [-0.04775076469190973, -0.07988912429014021, -0.0833916753291899, 0.1321736727879683, -0.09904020093958671, -0.148038170823812, 0.06762856357800197, 0.46386195564534793, -0.28978623826949557, -0.32175689386896605, 0.16497053804014586, -0.2231503922337366, -0.1958137878259136, 0.20149447900928125, -0.11408901259073148, ... |
1,802.06926 | Scale Optimization for Full-Image-CNN Vehicle Detection | Many state-of-the-art general object detection methods make use of shared
full-image convolutional features (as in Faster R-CNN). This achieves a
reasonable test-phase computation time while enjoys the discriminative power
provided by large Convolutional Neural Network (CNN) models. Such designs excel
on benchmarks w... | cs.CV cs.AI | many stateoftheart general object detection methods make use of shared fullimage convolutional features as in faster rcnn this achieves a reasonable testphase computation time while enjoys the discriminative power provided by large convolutional neural network cnn models such designs excel on benchmarks which contain n... | [['many', 'stateoftheart', 'general', 'object', 'detection', 'methods', 'make', 'use', 'of', 'shared', 'fullimage', 'convolutional', 'features', 'as', 'in', 'faster', 'rcnn', 'this', 'achieves', 'a', 'reasonable', 'testphase', 'computation', 'time', 'while', 'enjoys', 'the', 'discriminative', 'power', 'provided', 'by',... | [-0.03171850961682919, -0.006830093250606965, -0.06683510856237262, 0.04267124241819054, -0.08752444996831141, -0.19238002624063352, 0.017993130682544708, 0.45932383010429995, -0.2074009923321404, -0.358290273268536, 0.06721960561532926, -0.2571537049786587, -0.14735660815554463, 0.2157023535531765, -0.1223522399120379... |
1,802.06927 | On Lyapunov exponents and adversarial perturbation | In this paper, we would like to disseminate a serendipitous discovery
involving Lyapunov exponents of a 1-D time series and their use in serving as a
filtering defense tool against a specific kind of deep adversarial
perturbation. To this end, we use the state-of-the-art CleverHans library to
generate adversarial per... | cs.CV cs.LG cs.NE | in this paper we would like to disseminate a serendipitous discovery involving lyapunov exponents of a 1d time series and their use in serving as a filtering defense tool against a specific kind of deep adversarial perturbation to this end we use the stateoftheart cleverhans library to generate adversarial perturbation... | [['in', 'this', 'paper', 'we', 'would', 'like', 'to', 'disseminate', 'a', 'serendipitous', 'discovery', 'involving', 'lyapunov', 'exponents', 'of', 'a', '1d', 'time', 'series', 'and', 'their', 'use', 'in', 'serving', 'as', 'a', 'filtering', 'defense', 'tool', 'against', 'a', 'specific', 'kind', 'of', 'deep', 'adversari... | [-0.05573653919607636, -0.004341709544867512, -0.06910508563082049, 0.11586343437455243, -0.09813674197231573, -0.20991317013197938, 0.027793044276630843, 0.42460706916007057, -0.2848965188077702, -0.28954872471375726, 0.1103832291650694, -0.28751096582978847, -0.23477722840258983, 0.18808284793672422, -0.1229654244425... |
1,802.06928 | Memcomputing: Leveraging memory and physics to compute efficiently | It is well known that physical phenomena may be of great help in computing
some difficult problems efficiently. A typical example is prime factorization
that may be solved in polynomial time by exploiting quantum entanglement on a
quantum computer. There are, however, other types of (non-quantum) physical
properties ... | cs.ET cs.CC cs.NE math.DS | it is well known that physical phenomena may be of great help in computing some difficult problems efficiently a typical example is prime factorization that may be solved in polynomial time by exploiting quantum entanglement on a quantum computer there are however other types of nonquantum physical properties that one ... | [['it', 'is', 'well', 'known', 'that', 'physical', 'phenomena', 'may', 'be', 'of', 'great', 'help', 'in', 'computing', 'some', 'difficult', 'problems', 'efficiently', 'a', 'typical', 'example', 'is', 'prime', 'factorization', 'that', 'may', 'be', 'solved', 'in', 'polynomial', 'time', 'by', 'exploiting', 'quantum', 'ent... | [-0.1499093549097465, 0.12407948191790968, -0.09959472006779503, 0.09731398925693198, -0.09352203282273629, -0.19769132976420223, 0.022135714122348212, 0.3614335149729794, -0.3300223045203496, -0.28977313909256325, 0.11829729113685475, -0.2409692931683755, -0.20909866414858366, 0.22237837866499005, -0.07934532760123891... |
1,802.06929 | Thyristor Voltage Equalizing Network for Crowbar Application | Many high voltage applications are realized with series connected thyristors.
Voltage imbalance among series connected thyristors during steady state as well
as in transients is one of the major concerns. This voltage imbalance is
mitigated by using static and dynamic balancing network. Dynamic balancing
networks are... | eess.SP | many high voltage applications are realized with series connected thyristors voltage imbalance among series connected thyristors during steady state as well as in transients is one of the major concerns this voltage imbalance is mitigated by using static and dynamic balancing network dynamic balancing networks are typi... | [['many', 'high', 'voltage', 'applications', 'are', 'realized', 'with', 'series', 'connected', 'thyristors', 'voltage', 'imbalance', 'among', 'series', 'connected', 'thyristors', 'during', 'steady', 'state', 'as', 'well', 'as', 'in', 'transients', 'is', 'one', 'of', 'the', 'major', 'concerns', 'this', 'voltage', 'imbal... | [-0.16048294160418664, 0.06021192441130552, -0.013850329784418136, 0.014477102871751413, -0.0600898951797717, -0.16949399928489584, 0.07767371420368363, 0.41314773610793054, -0.25469518017416704, -0.31826704346531187, 0.1206935975583292, -0.19960697359920232, -0.1744898792408094, 0.23231745718567254, -0.105396442218989... |
1,802.0693 | Small Signal Audiosusceptibility Model for Series Resonant Converter | Models that accurately predict the output voltage ripple magnitude are
essential for applications with stringent performance target for it. Impact of
dc input ripple on the output ripple for a Series Resonant Converter (SRC)
using discrete domain exact discretization modelling method is analysed in this
paper. A nove... | eess.SP | models that accurately predict the output voltage ripple magnitude are essential for applications with stringent performance target for it impact of dc input ripple on the output ripple for a series resonant converter src using discrete domain exact discretization modelling method is analysed in this paper a novel disc... | [['models', 'that', 'accurately', 'predict', 'the', 'output', 'voltage', 'ripple', 'magnitude', 'are', 'essential', 'for', 'applications', 'with', 'stringent', 'performance', 'target', 'for', 'it', 'impact', 'of', 'dc', 'input', 'ripple', 'on', 'the', 'output', 'ripple', 'for', 'a', 'series', 'resonant', 'converter', '... | [-0.08651112894703811, 0.07313304229810948, -0.06325940454533682, 0.05639096582518169, -0.055612352034832176, -0.1312182103629803, 0.023894280528225977, 0.38352627600836864, -0.24005824262024583, -0.32034882636287726, 0.07873580014901571, -0.24598210062915543, -0.12440973977025531, 0.23092801472893706, 0.00257142764809... |
1,802.06931 | Empirical Bayes Matrix Factorization | Matrix factorization methods - including Factor analysis (FA), and Principal
Components Analysis (PCA) - are widely used for inferring and summarizing
structure in multivariate data. Many matrix factorization methods exist,
corresponding to different assumptions on the elements of the underlying matrix
factors. For e... | stat.ME | matrix factorization methods including factor analysis fa and principal components analysis pca are widely used for inferring and summarizing structure in multivariate data many matrix factorization methods exist corresponding to different assumptions on the elements of the underlying matrix factors for example many re... | [['matrix', 'factorization', 'methods', 'including', 'factor', 'analysis', 'fa', 'and', 'principal', 'components', 'analysis', 'pca', 'are', 'widely', 'used', 'for', 'inferring', 'and', 'summarizing', 'structure', 'in', 'multivariate', 'data', 'many', 'matrix', 'factorization', 'methods', 'exist', 'corresponding', 'to'... | [-0.0020312202103472984, -0.018566386829126, -0.11109259356222351, 0.10024048927213962, -0.12157627607795854, -0.15146541793256232, 0.042177091940022164, 0.4301376134009214, -0.27212398955228556, -0.29350085406363985, 0.10708972742339318, -0.2703305358767823, -0.21726847743282582, 0.18821798320467992, -0.05963840582799... |
1,802.06932 | Almost uniform and strong convergences in ergodic theorems for symmetric
spaces | Let $(\Omega,\mu)$ be a $\sigma$-finite measure space, and let $X\subset
L^1(\Omega)+L^\infty(\Omega)$ be a fully symmetric space of measurable
functions on $(\Omega,\mu)$. If $\mu(\Omega)=\infty$, necessary and sufficient
conditions are given for almost uniform convergence in $X$ (in Egorov's sense)
of Ces\`aro aver... | math.FA | let omegamu be a sigmafinite measure space and let xsubset l1omegalinftyomega be a fully symmetric space of measurable functions on omegamu if muomegainfty necessary and sufficient conditions are given for almost uniform convergence in x in egorovs sense of cesaro averages m_ntffrac1nsum_k 0n1tkf for all dunfordschwart... | [['let', 'omegamu', 'be', 'a', 'sigmafinite', 'measure', 'space', 'and', 'let', 'xsubset', 'l1omegalinftyomega', 'be', 'a', 'fully', 'symmetric', 'space', 'of', 'measurable', 'functions', 'on', 'omegamu', 'if', 'muomegainfty', 'necessary', 'and', 'sufficient', 'conditions', 'are', 'given', 'for', 'almost', 'uniform', '... | [-0.14700042218740644, 0.1650321178710966, -0.07986471676515233, 0.032439552849672475, 0.002289198301518443, -0.16376895608444667, -0.01110270962750689, 0.43015700591535405, -0.30406136710153914, -0.05241134842247542, 0.1485963639744354, -0.2946667412788361, -0.05106927856171354, 0.17899618982390939, -0.136090542825377... |
1,802.06933 | AMC and HARQ: How to Increase the Throughput | In this work, we consider transmissions over block fading channels and assume
that adaptive modulation and coding (AMC) and hybrid automatic repeat request
(HARQ) are implemented. Knowing that in high signal-to-noise ratio, the
conventional combination of HARQ with AMC is counterproductive from the
throughput point o... | cs.IT math.IT | in this work we consider transmissions over block fading channels and assume that adaptive modulation and coding amc and hybrid automatic repeat request harq are implemented knowing that in high signaltonoise ratio the conventional combination of harq with amc is counterproductive from the throughput point of view we a... | [['in', 'this', 'work', 'we', 'consider', 'transmissions', 'over', 'block', 'fading', 'channels', 'and', 'assume', 'that', 'adaptive', 'modulation', 'and', 'coding', 'amc', 'and', 'hybrid', 'automatic', 'repeat', 'request', 'harq', 'are', 'implemented', 'knowing', 'that', 'in', 'high', 'signaltonoise', 'ratio', 'the', ... | [-0.225916341586489, 0.0009287727383396975, -0.07452893810255862, 0.007302239896186317, -0.030001072423169163, -0.2743113600436931, 0.15085836524253604, 0.4582288333070957, -0.2660540136644935, -0.24515518453729346, 0.08004421333316714, -0.22297271491786488, -0.19460624891401426, 0.13184384990491094, -0.178125400308186... |
1,802.06934 | Farthest Point Map on a Centrally Symmetric Convex Polyhedron | The farthest point map sends a point in a compact metric space to the set of
points farthest from it. We focus on the case when this metric space is a
convex centrally symmetric polyhedron, so that we can compose the farthest
point map with the antipodal map. The purpose of this work is to study the
properties of thi... | math.MG math.DS | the farthest point map sends a point in a compact metric space to the set of points farthest from it we focus on the case when this metric space is a convex centrally symmetric polyhedron so that we can compose the farthest point map with the antipodal map the purpose of this work is to study the properties of this com... | [['the', 'farthest', 'point', 'map', 'sends', 'a', 'point', 'in', 'a', 'compact', 'metric', 'space', 'to', 'the', 'set', 'of', 'points', 'farthest', 'from', 'it', 'we', 'focus', 'on', 'the', 'case', 'when', 'this', 'metric', 'space', 'is', 'a', 'convex', 'centrally', 'symmetric', 'polyhedron', 'so', 'that', 'we', 'can'... | [-0.14576607348031498, 0.04926669264386874, -0.09555740519135725, 0.024473032107510204, -0.06364071909878735, -0.07906939369526558, 0.11041924515614353, 0.3602817724126258, -0.3255392750662785, -0.16815534670604393, 0.1183904106240204, -0.3485459814879245, -0.17389866398713952, 0.1591216589918726, -0.10938506901480391,... |
1,802.06935 | Non-Local Graph-Based Prediction For Reversible Data Hiding In Images | Reversible data hiding (RDH) is desirable in applications where both the
hidden message and the cover medium need to be recovered without loss. Among
many RDH approaches is prediction-error expansion (PEE), containing two steps:
i) prediction of a target pixel value, and ii) embedding according to the value
of predic... | eess.IV cs.CV | reversible data hiding rdh is desirable in applications where both the hidden message and the cover medium need to be recovered without loss among many rdh approaches is predictionerror expansion pee containing two steps i prediction of a target pixel value and ii embedding according to the value of predictionerror in ... | [['reversible', 'data', 'hiding', 'rdh', 'is', 'desirable', 'in', 'applications', 'where', 'both', 'the', 'hidden', 'message', 'and', 'the', 'cover', 'medium', 'need', 'to', 'be', 'recovered', 'without', 'loss', 'among', 'many', 'rdh', 'approaches', 'is', 'predictionerror', 'expansion', 'pee', 'containing', 'two', 'ste... | [-0.08111538420307446, -0.026583842070027154, -0.06614775432438906, 0.04316295468101618, -0.12053173120945619, -0.1700177411732305, 0.053355027288955456, 0.43488473496101615, -0.30832723796876893, -0.3121332853637966, 0.12865126969549676, -0.2722522477192685, -0.144384039994593, 0.12960930608713017, -0.1103864098116847... |
1,802.06936 | Online Learning with an Unknown Fairness Metric | We consider the problem of online learning in the linear contextual bandits
setting, but in which there are also strong individual fairness constraints
governed by an unknown similarity metric. These constraints demand that we
select similar actions or individuals with approximately equal probability
(arXiv:1104.3913... | cs.LG | we consider the problem of online learning in the linear contextual bandits setting but in which there are also strong individual fairness constraints governed by an unknown similarity metric these constraints demand that we select similar actions or individuals with approximately equal probability arxiv11043913 which ... | [['we', 'consider', 'the', 'problem', 'of', 'online', 'learning', 'in', 'the', 'linear', 'contextual', 'bandits', 'setting', 'but', 'in', 'which', 'there', 'are', 'also', 'strong', 'individual', 'fairness', 'constraints', 'governed', 'by', 'an', 'unknown', 'similarity', 'metric', 'these', 'constraints', 'demand', 'that... | [-0.10899010697884175, 0.05635844579936626, -0.08805352508711319, 0.11906404625081146, -0.16518994408038756, -0.23980395738966764, 0.1291645925398916, 0.4400363123168548, -0.2707245130712787, -0.3194144252811869, 0.05015914523353179, -0.29216351377467314, -0.15715456129206964, 0.12627996711526066, -0.20127515405416488,... |
1,802.06937 | On the structure of the singular set for the kinetic Fokker-Planck
equations in domains with boundaries | In this paper we compute asymptotics of solutions of the kinetic
Fokker-Planck equation with inelastic boundary conditions which indicate that
the solutions are nonunique if $r < r_c$. The nonuniqueness is due to the fact
that different solutions can interact in a different manner with a Dirac mass
which appears at t... | math.AP | in this paper we compute asymptotics of solutions of the kinetic fokkerplanck equation with inelastic boundary conditions which indicate that the solutions are nonunique if r r_c the nonuniqueness is due to the fact that different solutions can interact in a different manner with a dirac mass which appears at the singu... | [['in', 'this', 'paper', 'we', 'compute', 'asymptotics', 'of', 'solutions', 'of', 'the', 'kinetic', 'fokkerplanck', 'equation', 'with', 'inelastic', 'boundary', 'conditions', 'which', 'indicate', 'that', 'the', 'solutions', 'are', 'nonunique', 'if', 'r', 'r_c', 'the', 'nonuniqueness', 'is', 'due', 'to', 'the', 'fact', ... | [-0.13266124281553773, 0.07926823068068388, -0.12393121484991744, 0.08733747884793498, -0.09306237625744228, -0.11578910573547997, -0.045942888284366955, 0.2726783439380313, -0.30816752083360327, -0.2516814823851946, 0.0840887100491331, -0.3060460814291936, -0.1451178181493535, 0.14705667456765786, -0.04028530943489403... |
1,802.06938 | Localized Magnetic States in 2D Semiconductors | We study the formation of magnetic states in localized impurities embedded
into two-dimensional semiconductors. By considering various energy
configurations, we illustrate the interplay of the gap and the bands in the
system magnetization. Finally, we consider finite-temperature effects to show
how increasing $T$ can... | cond-mat.mes-hall | we study the formation of magnetic states in localized impurities embedded into twodimensional semiconductors by considering various energy configurations we illustrate the interplay of the gap and the bands in the system magnetization finally we consider finitetemperature effects to show how increasing t can lead to f... | [['we', 'study', 'the', 'formation', 'of', 'magnetic', 'states', 'in', 'localized', 'impurities', 'embedded', 'into', 'twodimensional', 'semiconductors', 'by', 'considering', 'various', 'energy', 'configurations', 'we', 'illustrate', 'the', 'interplay', 'of', 'the', 'gap', 'and', 'the', 'bands', 'in', 'the', 'system', ... | [-0.1834161334178027, 0.19078609156970153, -0.013149512771918786, 0.088169170507029, 0.035422203697118106, -0.05270499841985749, 0.07175846488269813, 0.3927616820323701, -0.28576311213420885, -0.3139553968520725, 0.03258068828076562, -0.29449931071961627, -0.14845233297377242, 0.1340646823667282, 0.02772913456383143, -... |
1,802.06939 | Estimator of Prediction Error Based on Approximate Message Passing for
Penalized Linear Regression | We propose an estimator of prediction error using an approximate message
passing (AMP) algorithm that can be applied to a broad range of sparse
penalties. Following Stein's lemma, the estimator of the generalized degrees of
freedom, which is a key quantity for the construction of the estimator of the
prediction error... | stat.ML cs.LG | we propose an estimator of prediction error using an approximate message passing amp algorithm that can be applied to a broad range of sparse penalties following steins lemma the estimator of the generalized degrees of freedom which is a key quantity for the construction of the estimator of the prediction error is calc... | [['we', 'propose', 'an', 'estimator', 'of', 'prediction', 'error', 'using', 'an', 'approximate', 'message', 'passing', 'amp', 'algorithm', 'that', 'can', 'be', 'applied', 'to', 'a', 'broad', 'range', 'of', 'sparse', 'penalties', 'following', 'steins', 'lemma', 'the', 'estimator', 'of', 'the', 'generalized', 'degrees', ... | [-0.06800580904637644, 0.006358389890364934, -0.15214556753151603, 0.08026269622231749, -0.04729271922472187, -0.16844858073738295, 0.077298090637468, 0.3711581283986762, -0.2841958083430087, -0.2913461077063308, 0.14131656196573145, -0.25817305194788503, -0.16093455063929032, 0.15582297759980276, -0.13902337358079173,... |
1,802.0694 | Using Automatic Generation of Relaxation Constraints to Improve the
Preimage Attack on 39-step MD4 | In this paper we construct preimage attack on the truncated variant of the
MD4 hash function. Specifically, we study the MD4-39 function defined by the
first 39 steps of the MD4 algorithm. We suggest a new attack on MD4-39, which
develops the ideas proposed by H. Dobbertin in 1998. Namely, the special
relaxation cons... | cs.AI | in this paper we construct preimage attack on the truncated variant of the md4 hash function specifically we study the md439 function defined by the first 39 steps of the md4 algorithm we suggest a new attack on md439 which develops the ideas proposed by h dobbertin in 1998 namely the special relaxation constraints are... | [['in', 'this', 'paper', 'we', 'construct', 'preimage', 'attack', 'on', 'the', 'truncated', 'variant', 'of', 'the', 'md4', 'hash', 'function', 'specifically', 'we', 'study', 'the', 'md439', 'function', 'defined', 'by', 'the', 'first', '39', 'steps', 'of', 'the', 'md4', 'algorithm', 'we', 'suggest', 'a', 'new', 'attack'... | [-0.09459251003122769, 0.00022341573814092992, -0.09358392870396467, 0.05823327879924213, -0.10787303699180484, -0.13289576176085446, 0.06369846387969136, 0.3090275800669069, -0.32132148760959417, -0.31196926275348186, 0.11076925288203053, -0.22868792987228628, -0.16933942798373683, 0.21044466967917294, -0.055382211729... |
1,802.06941 | Distilling Knowledge Using Parallel Data for Far-field Speech
Recognition | In order to improve the performance for far-field speech recognition, this
paper proposes to distill knowledge from the close-talking model to the
far-field model using parallel data. The close-talking model is called the
teacher model. The far-field model is called the student model. The student
model is trained to ... | cs.CL cs.SD eess.AS | in order to improve the performance for farfield speech recognition this paper proposes to distill knowledge from the closetalking model to the farfield model using parallel data the closetalking model is called the teacher model the farfield model is called the student model the student model is trained to imitate the... | [['in', 'order', 'to', 'improve', 'the', 'performance', 'for', 'farfield', 'speech', 'recognition', 'this', 'paper', 'proposes', 'to', 'distill', 'knowledge', 'from', 'the', 'closetalking', 'model', 'to', 'the', 'farfield', 'model', 'using', 'parallel', 'data', 'the', 'closetalking', 'model', 'is', 'called', 'the', 'te... | [0.029378832983740857, 0.03265967341923268, -0.07303060301379344, 0.06848414986128876, -0.11276536105661958, -0.18453169887380622, 0.07284403188811249, 0.40457386627932573, -0.29938851451832, -0.3663428914238194, -0.009708658997709297, -0.3178613144103612, -0.13224462035033746, 0.17567252081592577, -0.1283597978806802,... |
1,802.06942 | Comparison Based Learning from Weak Oracles | There is increasing interest in learning algorithms that involve interaction
between human and machine. Comparison-based queries are among the most natural
ways to get feedback from humans. A challenge in designing comparison-based
interactive learning algorithms is coping with noisy answers. The most common
fix is t... | cs.LG cs.DS stat.ML | there is increasing interest in learning algorithms that involve interaction between human and machine comparisonbased queries are among the most natural ways to get feedback from humans a challenge in designing comparisonbased interactive learning algorithms is coping with noisy answers the most common fix is to submi... | [['there', 'is', 'increasing', 'interest', 'in', 'learning', 'algorithms', 'that', 'involve', 'interaction', 'between', 'human', 'and', 'machine', 'comparisonbased', 'queries', 'are', 'among', 'the', 'most', 'natural', 'ways', 'to', 'get', 'feedback', 'from', 'humans', 'a', 'challenge', 'in', 'designing', 'comparisonba... | [-0.09146445755609096, 0.00688496685906403, -0.07865079270508218, 0.11297566759756622, -0.1238542593836348, -0.21686056327409886, 0.11550096063981823, 0.4149159616927098, -0.26276236537660796, -0.3375380260004783, 0.06105913435572673, -0.2831279555156391, -0.14601559472848977, 0.18528981677696857, -0.1296237947801167, ... |
1,802.06943 | Behavioral Characteristics and CO+CO2 Production Rates of Halley-Type
Comets Observed by NEOWISE | From the entire dataset of comets observed by NEOWISE, we have analyzed 11
different Halley-Type Comets (HTCs) for dust production rates, CO+CO2
production rates, and nucleus sizes. Incorporating HTCs from previous studies
and multiple comet visits we have a total of 21 stacked visits, 13 of which are
active and 8 fo... | astro-ph.EP | from the entire dataset of comets observed by neowise we have analyzed 11 different halleytype comets htcs for dust production rates coco2 production rates and nucleus sizes incorporating htcs from previous studies and multiple comet visits we have a total of 21 stacked visits 13 of which are active and 8 for which we ... | [['from', 'the', 'entire', 'dataset', 'of', 'comets', 'observed', 'by', 'neowise', 'we', 'have', 'analyzed', '11', 'different', 'halleytype', 'comets', 'htcs', 'for', 'dust', 'production', 'rates', 'coco2', 'production', 'rates', 'and', 'nucleus', 'sizes', 'incorporating', 'htcs', 'from', 'previous', 'studies', 'and', ... | [-0.05440063161245968, 0.16120520964895765, -0.06401817225137606, 0.07004448704913468, 0.07102936138248732, -0.08070008056012974, 0.06922976209241297, 0.4178532554219747, -0.18525477852240474, -0.36565823448942075, 0.043263702273120985, -0.36265933731450667, 0.0011495046407705354, 0.15950684033093915, -0.02244015726365... |
1,802.06944 | DeepThin: A Self-Compressing Library for Deep Neural Networks | As the industry deploys increasingly large and complex neural networks to
mobile devices, more pressure is put on the memory and compute resources of
those devices. Deep compression, or compression of deep neural network weight
matrices, is a technique to stretch resources for such scenarios. Existing
compression met... | cs.LG stat.ML | as the industry deploys increasingly large and complex neural networks to mobile devices more pressure is put on the memory and compute resources of those devices deep compression or compression of deep neural network weight matrices is a technique to stretch resources for such scenarios existing compression methods ca... | [['as', 'the', 'industry', 'deploys', 'increasingly', 'large', 'and', 'complex', 'neural', 'networks', 'to', 'mobile', 'devices', 'more', 'pressure', 'is', 'put', 'on', 'the', 'memory', 'and', 'compute', 'resources', 'of', 'those', 'devices', 'deep', 'compression', 'or', 'compression', 'of', 'deep', 'neural', 'network'... | [-0.05828535872361889, 0.005693001338682185, -0.03283485173827983, 0.08098494223279179, -0.06339803524315357, -0.21291613655297884, 0.0745195157997798, 0.4503344432838882, -0.24541809683248017, -0.3413757683639045, 0.09274118282372087, -0.26087467223849325, -0.12385682384797653, 0.22941168422703556, -0.0605374569468762... |
1,802.06945 | Electron emission by long and short wavelength lasers: essentials for
the design of plasmonic photocathodes | Theory of electron emission by metallic photocathodes under the exposure of
long wavelength lasers will be studied. Energy of photons in long wavelength
lasers is less than the work function of the photocathode material, and can
only emit electrons via tunneling through the potential barrier. The optical
resonance ef... | physics.app-ph physics.optics | theory of electron emission by metallic photocathodes under the exposure of long wavelength lasers will be studied energy of photons in long wavelength lasers is less than the work function of the photocathode material and can only emit electrons via tunneling through the potential barrier the optical resonance effect ... | [['theory', 'of', 'electron', 'emission', 'by', 'metallic', 'photocathodes', 'under', 'the', 'exposure', 'of', 'long', 'wavelength', 'lasers', 'will', 'be', 'studied', 'energy', 'of', 'photons', 'in', 'long', 'wavelength', 'lasers', 'is', 'less', 'than', 'the', 'work', 'function', 'of', 'the', 'photocathode', 'material... | [-0.10318297783208148, 0.1856700563762499, -0.046853465454016884, 0.03597573725444197, -0.042342161461597354, -0.1952518390877763, 0.009718685249071114, 0.508198003875228, -0.21818621596889343, -0.3042442701620663, 0.02976021688948272, -0.31019848301188974, -0.06406935676932335, 0.26732573591218123, -0.0439421378712101... |
1,802.06946 | Coupon Advertising in Online Social Systems: Algorithms and Sampling
Techniques | Online social systems have become important platforms for viral marketing
where the advertising of products is carried out with the communication of
users. After adopting the product, the seed buyers may spread the information
to their friends via online messages e.g. posts and tweets. In another issue,
electronic co... | cs.SI | online social systems have become important platforms for viral marketing where the advertising of products is carried out with the communication of users after adopting the product the seed buyers may spread the information to their friends via online messages eg posts and tweets in another issue electronic coupon sys... | [['online', 'social', 'systems', 'have', 'become', 'important', 'platforms', 'for', 'viral', 'marketing', 'where', 'the', 'advertising', 'of', 'products', 'is', 'carried', 'out', 'with', 'the', 'communication', 'of', 'users', 'after', 'adopting', 'the', 'product', 'the', 'seed', 'buyers', 'may', 'spread', 'the', 'infor... | [-0.09848400111048959, 0.03729052506628583, -0.043591717814617764, 0.08466074474371697, -0.13077654929195598, -0.20565007118985237, 0.11673286066663156, 0.4362139203199526, -0.25227835930702164, -0.3000409393230589, 0.10990690769025738, -0.3291734849679193, -0.2063720193893149, 0.1677992236993571, -0.0952985108960647, ... |
1,802.06947 | Entropy Guided Spectrum Based Bug Localization Using Statistical
Language Model | Locating bugs is challenging but one of the most important activities in
software development and maintenance phase because there are no certain rules
to identify all types of bugs. Existing automatic bug localization tools use
various heuristics based on test coverage, pre-determined buggy patterns, or
textual simil... | cs.SE | locating bugs is challenging but one of the most important activities in software development and maintenance phase because there are no certain rules to identify all types of bugs existing automatic bug localization tools use various heuristics based on test coverage predetermined buggy patterns or textual similarity ... | [['locating', 'bugs', 'is', 'challenging', 'but', 'one', 'of', 'the', 'most', 'important', 'activities', 'in', 'software', 'development', 'and', 'maintenance', 'phase', 'because', 'there', 'are', 'no', 'certain', 'rules', 'to', 'identify', 'all', 'types', 'of', 'bugs', 'existing', 'automatic', 'bug', 'localization', 't... | [-0.07968883689932732, -0.002119001777787667, -0.08796262867334816, 0.10285844487888325, -0.12686563182570454, -0.23865022682843523, 0.05622818204121561, 0.4150028873855869, -0.20238705164196694, -0.3418123217454801, 0.13775701739100946, -0.29550539585244323, -0.14744745092656458, 0.2411075471719313, -0.105177961088096... |
1,802.06948 | On the Totik-Widom property for a Quasidisk | Let $K$ be a quasidisk on the complex plane. We construct a sequence of monic
polynomials $p_n=p_n(\cdot,K)$ with zeros on $K$ such that $||p_n||_K \le O(1)
\mathrm{cap}(K)^n$ as $n\to\infty.$
| math.CV | let k be a quasidisk on the complex plane we construct a sequence of monic polynomials p_np_ncdotk with zeros on k such that p_n_k le o1 mathrmcapkn as ntoinfty | [['let', 'k', 'be', 'a', 'quasidisk', 'on', 'the', 'complex', 'plane', 'we', 'construct', 'a', 'sequence', 'of', 'monic', 'polynomials', 'p_np_ncdotk', 'with', 'zeros', 'on', 'k', 'such', 'that', 'p_n_k', 'le', 'o1', 'mathrmcapkn', 'as', 'ntoinfty']] | [-0.24913793898842954, 0.13386568567646598, -0.05782758207405331, -0.033591274741209216, -0.05059172364848631, -0.12863790405983175, 0.035721552459074664, 0.3242098244803923, -0.2795098418438876, -0.19712756028295392, 0.07552434229809377, -0.3282493719900096, -0.13689232803881168, 0.17310770031892592, -0.02295869776841... |
1,802.06949 | Efficient Embedding of MPI Collectives in MXNET DAGs for scaling Deep
Learning | Availability of high performance computing infrastructures such as clusters
of GPUs and CPUs have fueled the growth of distributed learning systems. Deep
Learning frameworks express neural nets as DAGs and execute these DAGs on
computation resources such as GPUs. In this paper, we propose efficient designs
of embeddi... | cs.DC cs.LG | availability of high performance computing infrastructures such as clusters of gpus and cpus have fueled the growth of distributed learning systems deep learning frameworks express neural nets as dags and execute these dags on computation resources such as gpus in this paper we propose efficient designs of embedding mp... | [['availability', 'of', 'high', 'performance', 'computing', 'infrastructures', 'such', 'as', 'clusters', 'of', 'gpus', 'and', 'cpus', 'have', 'fueled', 'the', 'growth', 'of', 'distributed', 'learning', 'systems', 'deep', 'learning', 'frameworks', 'express', 'neural', 'nets', 'as', 'dags', 'and', 'execute', 'these', 'da... | [-0.1308057493571738, 0.03991390343541932, -0.0415569816265184, 0.0429508042370509, -0.09269340107644534, -0.17703632751307719, 0.07143837931361287, 0.45190117425421716, -0.2827280202560174, -0.4117823325684828, 0.11108395323872115, -0.2290964422668338, -0.12320584524719483, 0.23045029050884117, -0.0973455564287242, 0.... |
1,802.0695 | TAP-DLND 1.0 : A Corpus for Document Level Novelty Detection | Detecting novelty of an entire document is an Artificial Intelligence (AI)
frontier problem that has widespread NLP applications, such as extractive
document summarization, tracking development of news events, predicting impact
of scholarly articles, etc. Important though the problem is, we are unaware of
any benchma... | cs.CL | detecting novelty of an entire document is an artificial intelligence ai frontier problem that has widespread nlp applications such as extractive document summarization tracking development of news events predicting impact of scholarly articles etc important though the problem is we are unaware of any benchmark documen... | [['detecting', 'novelty', 'of', 'an', 'entire', 'document', 'is', 'an', 'artificial', 'intelligence', 'ai', 'frontier', 'problem', 'that', 'has', 'widespread', 'nlp', 'applications', 'such', 'as', 'extractive', 'document', 'summarization', 'tracking', 'development', 'of', 'news', 'events', 'predicting', 'impact', 'of',... | [-0.09192608940904423, 0.007321480972646988, -0.019323113141581416, 0.08829896856529512, -0.13467088770279187, -0.09547775926589334, 0.06159354589082364, 0.41749069381947235, -0.24815577753203905, -0.3468604588376011, 0.08145616556245486, -0.3222092120450432, -0.17031516643414685, 0.2157598736427598, -0.116181034752625... |
1,802.06951 | Adoption of e-government in the Republic of Kazakhstan | This paper identifies factors that influence Kazakhstan's e-Government portal
usage. It determines challenges encountered by citizens while using the portal.
Targeted respondents for the web-based questionnaire survey were the citizens
of Kazakhstan. The technology acceptance model was used as a methodology to
measur... | cs.CY | this paper identifies factors that influence kazakhstans egovernment portal usage it determines challenges encountered by citizens while using the portal targeted respondents for the webbased questionnaire survey were the citizens of kazakhstan the technology acceptance model was used as a methodology to measure attitu... | [['this', 'paper', 'identifies', 'factors', 'that', 'influence', 'kazakhstans', 'egovernment', 'portal', 'usage', 'it', 'determines', 'challenges', 'encountered', 'by', 'citizens', 'while', 'using', 'the', 'portal', 'targeted', 'respondents', 'for', 'the', 'webbased', 'questionnaire', 'survey', 'were', 'the', 'citizens... | [-0.06301679271965058, 0.07212496143546414, -0.05456233275818058, 0.09459540791441753, -0.16726951946612392, -0.13063729174124697, 0.12686872860143447, 0.36608051319701085, -0.2139798647557905, -0.39731611852682586, 0.11541652150259799, -0.30787607197028893, -0.16173784998987895, 0.16857290706779485, -0.119116702733228... |
1,802.06952 | 64-Qubit Quantum Circuit Simulation | Classical simulations of quantum circuits are limited in both space and time
when the qubit count is above 50, the realm where quantum supremacy reigns.
However, recently, for the low depth circuit with more than 50 qubits, there
are several methods of simulation proposed by teams at Google and IBM. Here, we
present ... | quant-ph | classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50 the realm where quantum supremacy reigns however recently for the low depth circuit with more than 50 qubits there are several methods of simulation proposed by teams at google and ibm here we present a scheme ... | [['classical', 'simulations', 'of', 'quantum', 'circuits', 'are', 'limited', 'in', 'both', 'space', 'and', 'time', 'when', 'the', 'qubit', 'count', 'is', 'above', '50', 'the', 'realm', 'where', 'quantum', 'supremacy', 'reigns', 'however', 'recently', 'for', 'the', 'low', 'depth', 'circuit', 'with', 'more', 'than', '50'... | [-0.10750849697260971, 0.1333445246120008, -0.052904233981328284, 0.022676830661734322, -0.009449367612097902, -0.189917211016444, 0.1005596818148134, 0.38412719313055277, -0.20580304042577105, -0.38139989094710663, 0.10968361142563242, -0.2552398803680645, -0.11668498151342838, 0.3130041569690404, -0.03549116839330006... |
1,802.06953 | Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly
Coloring with Fewer Colors) | We examine the problem of almost-uniform sampling proper $q$-colorings of a
graph whose maximum degree is $\Delta$. A famous result, discovered
independently by Jerrum(1995) and Salas and Sokal(1997), is that, assuming $q >
(2+\delta) \Delta$, the Glauber dynamics (a.k.a. single-site dynamics) for this
problem has mi... | cs.DS | we examine the problem of almostuniform sampling proper qcolorings of a graph whose maximum degree is delta a famous result discovered independently by jerrum1995 and salas and sokal1997 is that assuming q 2delta delta the glauber dynamics aka singlesite dynamics for this problem has mixing time on log n where n is the... | [['we', 'examine', 'the', 'problem', 'of', 'almostuniform', 'sampling', 'proper', 'qcolorings', 'of', 'a', 'graph', 'whose', 'maximum', 'degree', 'is', 'delta', 'a', 'famous', 'result', 'discovered', 'independently', 'by', 'jerrum1995', 'and', 'salas', 'and', 'sokal1997', 'is', 'that', 'assuming', 'q', '2delta', 'delta... | [-0.17319132520807098, 0.1655586343559148, -0.0798141568105759, 0.023131191329119484, -0.057831273607545246, -0.20965050279932176, 0.09901956771854716, 0.3967793526968149, -0.2764963330559271, -0.33905881410464644, 0.061412475877643924, -0.24309793839474086, -0.1164616879943819, 0.12972934564737523, -0.0741522257337751... |
1,802.06954 | Stochastic dominance and weak concentration for sums of independent
symmetric random vectors | Kwapien and Woyczynski asked in their monograph (1992) whether their notion
of superstrong domination is inherited when taking sums of independent
symmetric random vectors (one vector dominates another if, essentially, tail
probabilities of any norm of the two vectors compare up to some scaling
constants). We answer ... | math.PR math.FA | kwapien and woyczynski asked in their monograph 1992 whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors one vector dominates another if essentially tail probabilities of any norm of the two vectors compare up to some scaling constants we answer this ques... | [['kwapien', 'and', 'woyczynski', 'asked', 'in', 'their', 'monograph', '1992', 'whether', 'their', 'notion', 'of', 'superstrong', 'domination', 'is', 'inherited', 'when', 'taking', 'sums', 'of', 'independent', 'symmetric', 'random', 'vectors', 'one', 'vector', 'dominates', 'another', 'if', 'essentially', 'tail', 'proba... | [-0.1464605010052522, 0.20097361230601868, -0.06144306001913113, 0.07900441215528796, -0.07709711037576199, -0.1312656556776104, 0.0922727183625102, 0.3381992461284002, -0.3499421783909202, -0.1993629418934385, 0.08589645371306688, -0.2670194806655248, -0.13461215722064176, 0.14669002197682857, -0.07278681057194869, -0... |
1,802.06955 | Recurrent Residual Convolutional Neural Network based on U-Net (R2U-Net)
for Medical Image Segmentation | Deep learning (DL) based semantic segmentation methods have been providing
state-of-the-art performance in the last few years. More specifically, these
techniques have been successfully applied to medical image classification,
segmentation, and detection tasks. One deep learning technique, U-Net, has
become one of th... | cs.CV | deep learning dl based semantic segmentation methods have been providing stateoftheart performance in the last few years more specifically these techniques have been successfully applied to medical image classification segmentation and detection tasks one deep learning technique unet has become one of the most popular ... | [['deep', 'learning', 'dl', 'based', 'semantic', 'segmentation', 'methods', 'have', 'been', 'providing', 'stateoftheart', 'performance', 'in', 'the', 'last', 'few', 'years', 'more', 'specifically', 'these', 'techniques', 'have', 'been', 'successfully', 'applied', 'to', 'medical', 'image', 'classification', 'segmentatio... | [0.04400660015143203, -0.09874050113386981, -0.02698429689954947, 0.04732457242141251, -0.08675794325373257, -0.2509099503790892, -0.06109136298064799, 0.5216219169135963, -0.2233516899295817, -0.3177509559984946, 0.0781253710494092, -0.2661777353264817, -0.2574666785655321, 0.2199647299404898, -0.1880619061406258, 0.1... |
1,802.06956 | On the evolution process of two-component dark matter in the Sun | We introduce dark matter (DM) evolution process in the Sun under a
two-component DM (2DM) scenario. Both DM species $\chi$ and $\xi$ with masses
heavier than 1 GeV are considered. In this picture, both species could be
captured by the Sun through DM-nucleus scattering and DM self-scatterings, e.g.
$\chi\chi$ and $\xi... | hep-ph | we introduce dark matter dm evolution process in the sun under a twocomponent dm 2dm scenario both dm species chi and xi with masses heavier than 1 gev are considered in this picture both species could be captured by the sun through dmnucleus scattering and dm selfscatterings eg chichi and xixi collisions in addition t... | [['we', 'introduce', 'dark', 'matter', 'dm', 'evolution', 'process', 'in', 'the', 'sun', 'under', 'a', 'twocomponent', 'dm', '2dm', 'scenario', 'both', 'dm', 'species', 'chi', 'and', 'xi', 'with', 'masses', 'heavier', 'than', '1', 'gev', 'are', 'considered', 'in', 'this', 'picture', 'both', 'species', 'could', 'be', 'c... | [-0.12861243818932855, 0.22914093686846196, -0.07183282440188428, 0.14902090605445106, -0.03756475169790087, -0.11897422107781128, -0.03124142415034845, 0.3391024664995949, -0.24452602385213565, -0.3409270503506157, 0.005642506583906155, -0.25002645071225693, -0.04208077253739101, 0.14650111008285088, 0.054334432787626... |
1,802.06957 | MIMO Transmit Beampattern Matching Under Waveform Constraints | In this paper, the multiple-input multiple-output (MIMO) transmit beampattern
matching problem is considered. The problem is formulated to approximate a
desired transmit beampattern (i.e., an energy distribution in space and
frequency) and to minimize the cross-correlation of signals reflected back to
the array by co... | math.OC cs.IT cs.SY math.IT | in this paper the multipleinput multipleoutput mimo transmit beampattern matching problem is considered the problem is formulated to approximate a desired transmit beampattern ie an energy distribution in space and frequency and to minimize the crosscorrelation of signals reflected back to the array by considering diff... | [['in', 'this', 'paper', 'the', 'multipleinput', 'multipleoutput', 'mimo', 'transmit', 'beampattern', 'matching', 'problem', 'is', 'considered', 'the', 'problem', 'is', 'formulated', 'to', 'approximate', 'a', 'desired', 'transmit', 'beampattern', 'ie', 'an', 'energy', 'distribution', 'in', 'space', 'and', 'frequency', ... | [-0.14780843451289116, -0.045023083010659035, -0.045647348562092745, 0.0303833752370991, -0.09778303217178988, -0.1420216525484383, 0.021277842103973828, 0.38561460036712075, -0.31976539287173633, -0.31341001702454485, 0.1214002960980915, -0.22856308746793605, -0.1883194232992466, 0.17447796246959169, -0.10163502466471... |
1,802.06958 | Deep Reinforcement Learning for Dynamic Multichannel Access in Wireless
Networks | We consider a dynamic multichannel access problem, where multiple correlated
channels follow an unknown joint Markov model. A user at each time slot selects
a channel to transmit data and receives a reward based on the success or
failure of the transmission. The objective is to find a policy that maximizes
the expect... | cs.NI | we consider a dynamic multichannel access problem where multiple correlated channels follow an unknown joint markov model a user at each time slot selects a channel to transmit data and receives a reward based on the success or failure of the transmission the objective is to find a policy that maximizes the expected lo... | [['we', 'consider', 'a', 'dynamic', 'multichannel', 'access', 'problem', 'where', 'multiple', 'correlated', 'channels', 'follow', 'an', 'unknown', 'joint', 'markov', 'model', 'a', 'user', 'at', 'each', 'time', 'slot', 'selects', 'a', 'channel', 'to', 'transmit', 'data', 'and', 'receives', 'a', 'reward', 'based', 'on', ... | [-0.10805996321788472, 0.004759113963636348, -0.08186234147381978, 0.0677928286278727, -0.11967849600448678, -0.19953034354157445, 0.11243542225330579, 0.4646029859743636, -0.3029212182707558, -0.3026157847039444, 0.1132633744967123, -0.21297379262096278, -0.2109831458232789, 0.16152966747794187, -0.12480027108048113, ... |
1,802.06959 | On the automorphism groups of distance-regular graphs and rank-4
primitive coherent configurations | The minimal degree of a permutation group $G$ is the minimum number of points
not fixed by non-identity elements of $G$. Lower bounds on the minimal degree
have strong structural consequences on $G$. In 2014 Babai proved that the
automorphism group of a strongly regular graph with $n$ vertices has minimal
degree $\ge... | math.CO | the minimal degree of a permutation group g is the minimum number of points not fixed by nonidentity elements of g lower bounds on the minimal degree have strong structural consequences on g in 2014 babai proved that the automorphism group of a strongly regular graph with n vertices has minimal degree geq c n with know... | [['the', 'minimal', 'degree', 'of', 'a', 'permutation', 'group', 'g', 'is', 'the', 'minimum', 'number', 'of', 'points', 'not', 'fixed', 'by', 'nonidentity', 'elements', 'of', 'g', 'lower', 'bounds', 'on', 'the', 'minimal', 'degree', 'have', 'strong', 'structural', 'consequences', 'on', 'g', 'in', '2014', 'babai', 'prov... | [-0.1993531393928057, 0.1471932481808385, -0.03332088435400683, 0.016233744031731223, -0.09208672004060285, -0.161027108485082, 0.05641208097596865, 0.36094203206138814, -0.27083881893702366, -0.31727491857686846, 0.06469893231319429, -0.29007508836244, -0.15405911661795166, 0.14425927150929993, -0.13968996394720704, 0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.