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.0736 | Comparison of the Magnetic properties of Mn3Fe2Si3O12 as a crystalline
garnet and as a glass | The crystalline garnet Mn3Fe2Si3O12 and an amorphous phase of the same
nominal composition are synthesized at high pressure. The magnetic properties
of the two forms are reported. Both phases order antiferromagnetically. The
crystalline phase exhibits a Curie-Weiss theta of -47.2 K, with a sharp
ordering transition a... | cond-mat.mtrl-sci | the crystalline garnet mn3fe2si3o12 and an amorphous phase of the same nominal composition are synthesized at high pressure the magnetic properties of the two forms are reported both phases order antiferromagnetically the crystalline phase exhibits a curieweiss theta of 472 k with a sharp ordering transition at 12 k th... | [['the', 'crystalline', 'garnet', 'mn3fe2si3o12', 'and', 'an', 'amorphous', 'phase', 'of', 'the', 'same', 'nominal', 'composition', 'are', 'synthesized', 'at', 'high', 'pressure', 'the', 'magnetic', 'properties', 'of', 'the', 'two', 'forms', 'are', 'reported', 'both', 'phases', 'order', 'antiferromagnetically', 'the', ... | [-0.20376257862877642, 0.31891129036842014, -0.07416459931133007, -0.04596534306612951, -0.028175068187337476, -0.14492693763606032, 0.06691048149634334, 0.39793645684580203, -0.24948204631546458, -0.3467072806167371, 0.040211255899494855, -0.3447370760287475, -0.07473902718742713, 0.08278299376223851, 0.10053714038126... |
1,802.07361 | Fault Detection Effectiveness of Source Test Case Generation Strategies
for Metamorphic Testing | Metamorphic testing is a well known approach to tackle the oracle problem in
software testing. This technique requires the use of source test cases that
serve as seeds for the generation of follow-up test cases. Systematic design of
test cases is crucial for the test quality. Thus, source test case generation
strateg... | cs.SE | metamorphic testing is a well known approach to tackle the oracle problem in software testing this technique requires the use of source test cases that serve as seeds for the generation of followup test cases systematic design of test cases is crucial for the test quality thus source test case generation strategy can m... | [['metamorphic', 'testing', 'is', 'a', 'well', 'known', 'approach', 'to', 'tackle', 'the', 'oracle', 'problem', 'in', 'software', 'testing', 'this', 'technique', 'requires', 'the', 'use', 'of', 'source', 'test', 'cases', 'that', 'serve', 'as', 'seeds', 'for', 'the', 'generation', 'of', 'followup', 'test', 'cases', 'sys... | [-0.0579618763496712, -0.03785386361356935, -0.03489683470273815, 0.08071405207911174, -0.06918516765708232, -0.17024324223915538, 0.0895605986824923, 0.399674369211281, -0.17881733875192637, -0.359694187773742, 0.146099431397587, -0.2313310489805397, -0.11820063694313371, 0.29239013370605976, -0.05431950789193927, 0.1... |
1,802.07362 | Statistical Software for Psychology: Comparing Development Practices
Between CRAN and Other Communities | Different communities rely heavily on software, but use quite different
software development practices. {\bf Objective}: We wanted to measure the state
of the practice in the area of statistical software for psychology to
understand how it compares to best practices. {\bf Method}: We compared and
ranked 30 software t... | cs.SE | different communities rely heavily on software but use quite different software development practices bf objective we wanted to measure the state of the practice in the area of statistical software for psychology to understand how it compares to best practices bf method we compared and ranked 30 software tools with res... | [['different', 'communities', 'rely', 'heavily', 'on', 'software', 'but', 'use', 'quite', 'different', 'software', 'development', 'practices', 'bf', 'objective', 'we', 'wanted', 'to', 'measure', 'the', 'state', 'of', 'the', 'practice', 'in', 'the', 'area', 'of', 'statistical', 'software', 'for', 'psychology', 'to', 'un... | [-0.03770054603269923, -0.0006637809166152562, -0.06653040761261114, 0.08615692098974251, -0.16535686123949875, -0.18776466815314571, 0.0734676986134478, 0.480932961085013, -0.21387141532530743, -0.36395658206602094, 0.08256604200661448, -0.2773708445585466, -0.12449603519510544, 0.24149517478820468, -0.150295374455994... |
1,802.07363 | Mean Field Approximations to a Queueing System with Threshold-Based
Workload Control Scheme | In this paper, motivated by considerations of server utilization and energy
consumptions in cloud computing, we investigate a homogeneous queueing system
with a threshold-based workload control scheme. In this system, a virtual
machine will be turned off when there are no tasks in its buffer upon the
completion of a ... | math.PR | in this paper motivated by considerations of server utilization and energy consumptions in cloud computing we investigate a homogeneous queueing system with a thresholdbased workload control scheme in this system a virtual machine will be turned off when there are no tasks in its buffer upon the completion of a service... | [['in', 'this', 'paper', 'motivated', 'by', 'considerations', 'of', 'server', 'utilization', 'and', 'energy', 'consumptions', 'in', 'cloud', 'computing', 'we', 'investigate', 'a', 'homogeneous', 'queueing', 'system', 'with', 'a', 'thresholdbased', 'workload', 'control', 'scheme', 'in', 'this', 'system', 'a', 'virtual',... | [-0.1593515406867475, 0.018274463029895584, -0.1008479929820613, 0.008722391578489702, -0.0027932980673686237, -0.13531780178224995, 0.152552361448139, 0.3852846058554777, -0.258838590890354, -0.33138845043384846, 0.1300671131755332, -0.23982834703473815, -0.1280388067128094, 0.22587190553517514, -0.11621424675926224, ... |
1,802.07364 | Controlling stability and transport of magnetic microswimmers by an
external field | We investigate the hydrodynamic stability and transport of magnetic
microswimmers in an external field using a kinetic theory framework. Combining
linear stability analysis and nonlinear 3D continuum simulations, we show that
for sufficiently large activity and magnetic field strengths, a homogeneous
polar steady sta... | cond-mat.soft cond-mat.stat-mech nlin.PS | we investigate the hydrodynamic stability and transport of magnetic microswimmers in an external field using a kinetic theory framework combining linear stability analysis and nonlinear 3d continuum simulations we show that for sufficiently large activity and magnetic field strengths a homogeneous polar steady state is... | [['we', 'investigate', 'the', 'hydrodynamic', 'stability', 'and', 'transport', 'of', 'magnetic', 'microswimmers', 'in', 'an', 'external', 'field', 'using', 'a', 'kinetic', 'theory', 'framework', 'combining', 'linear', 'stability', 'analysis', 'and', 'nonlinear', '3d', 'continuum', 'simulations', 'we', 'show', 'that', '... | [-0.2215448910378166, 0.2017575899680955, -0.057992574567367776, 0.041235345796766604, -0.027506193854222614, -0.11455637004903772, -0.018838288147033245, 0.344293409619819, -0.284279403569223, -0.2761597652252848, 0.04964230215650298, -0.20845466243749686, -0.1297384115659501, 0.13556270210133972, 0.03550710184268715,... |
1,802.07365 | Lorentz-violating contributions to the nuclear Schiff moment and nuclear
EDM | In the context of an atom endowed with nuclear electric dipole moment (EDM),
we consider the effects on the Schiff moment of $CPT$-even Lorentz-violating
(LV) terms that modify the Coulomb potential. First, we study the modifications
on the Schiff moment when the nucleus interacts with the electronic cloud by
means o... | hep-ph hep-th nucl-th | in the context of an atom endowed with nuclear electric dipole moment edm we consider the effects on the schiff moment of cpteven lorentzviolating lv terms that modify the coulomb potential first we study the modifications on the schiff moment when the nucleus interacts with the electronic cloud by means of a coulomb p... | [['in', 'the', 'context', 'of', 'an', 'atom', 'endowed', 'with', 'nuclear', 'electric', 'dipole', 'moment', 'edm', 'we', 'consider', 'the', 'effects', 'on', 'the', 'schiff', 'moment', 'of', 'cpteven', 'lorentzviolating', 'lv', 'terms', 'that', 'modify', 'the', 'coulomb', 'potential', 'first', 'we', 'study', 'the', 'mod... | [-0.10261936419675606, 0.16452836469908283, 0.0363087121609237, 0.11041916633692028, -0.05715890269754315, -0.053161866657102284, 0.04918053972147363, 0.2743325247203431, -0.23988024990852755, -0.2851773909946431, 0.00962272393013309, -0.33783295196689556, -0.08022102005970873, 0.1405362419283657, 0.037147498050176385,... |
1,802.07366 | Free complete Wasserstein algebras | We present an algebraic account of the Wasserstein distances $W_p$ on
complete metric spaces, for $p \geq 1$. This is part of a program of a
quantitative algebraic theory of effects in programming languages. In
particular, we give axioms, parametric in $p$, for algebras over metric spaces
equipped with probabilistic ... | cs.LO | we present an algebraic account of the wasserstein distances w_p on complete metric spaces for p geq 1 this is part of a program of a quantitative algebraic theory of effects in programming languages in particular we give axioms parametric in p for algebras over metric spaces equipped with probabilistic choice operatio... | [['we', 'present', 'an', 'algebraic', 'account', 'of', 'the', 'wasserstein', 'distances', 'w_p', 'on', 'complete', 'metric', 'spaces', 'for', 'p', 'geq', '1', 'this', 'is', 'part', 'of', 'a', 'program', 'of', 'a', 'quantitative', 'algebraic', 'theory', 'of', 'effects', 'in', 'programming', 'languages', 'in', 'particula... | [-0.1509369403306936, 0.06553524231419273, -0.1299099801864443, 0.12025587293060704, -0.07619472761821543, -0.09627287759660529, 0.027636959568724737, 0.3601785679208513, -0.3430058030236481, -0.20548008853628333, 0.05859642192566147, -0.28942756512417245, -0.12477681362348744, 0.18148380663627997, -0.14498604357672426... |
1,802.07367 | Strain Fields in Repulsive Colloidal Crystals | The concept of a local linear elastic strain field is commonly used in the
metallurgical research community to approximate the collective effect of atomic
displacements around crystalline defects. Here we show that the elastic strain
field approximation is a useful tool in colloidal systems. For colloidal
crystals wi... | cond-mat.soft | the concept of a local linear elastic strain field is commonly used in the metallurgical research community to approximate the collective effect of atomic displacements around crystalline defects here we show that the elastic strain field approximation is a useful tool in colloidal systems for colloidal crystals with r... | [['the', 'concept', 'of', 'a', 'local', 'linear', 'elastic', 'strain', 'field', 'is', 'commonly', 'used', 'in', 'the', 'metallurgical', 'research', 'community', 'to', 'approximate', 'the', 'collective', 'effect', 'of', 'atomic', 'displacements', 'around', 'crystalline', 'defects', 'here', 'we', 'show', 'that', 'the', '... | [-0.1178998996284071, 0.23847126601097302, -0.09081352330466005, 0.04826231985977601, -0.018658464297470524, -0.1365376413171369, -0.011736939594005727, 0.3807578752862244, -0.2988801194407894, -0.27323415110690324, -0.008314005734315672, -0.28102473582602977, -0.12423876678851259, 0.14848080331107555, 0.04402702180592... |
1,802.07368 | Gaussian Random Number Generator: Implemented in FPGA for Quantum Key
Distribution | Quantum Key Distribution is the process of using quantum communication to
establish a shared key between two parties. It has been demonstrated the
unconditional security and effective communication of quantum communication
system can be guaranteed by an excellent Gaussian random number generator with
high speed and a... | eess.SP | quantum key distribution is the process of using quantum communication to establish a shared key between two parties it has been demonstrated the unconditional security and effective communication of quantum communication system can be guaranteed by an excellent gaussian random number generator with high speed and an e... | [['quantum', 'key', 'distribution', 'is', 'the', 'process', 'of', 'using', 'quantum', 'communication', 'to', 'establish', 'a', 'shared', 'key', 'between', 'two', 'parties', 'it', 'has', 'been', 'demonstrated', 'the', 'unconditional', 'security', 'and', 'effective', 'communication', 'of', 'quantum', 'communication', 'sy... | [-0.15011732589615429, 0.10263531871529741, -0.08216711943564207, 0.04402961280091246, -0.03532704181321289, -0.2281438619789222, 0.07606978062843985, 0.43903010701355727, -0.2592708555495609, -0.3288895705309899, 0.0921252468864069, -0.19354251038445078, -0.16068451827310998, 0.22681979520813278, -0.08924379821299859,... |
1,802.07369 | On the Statistical Challenges of Echo State Networks and Some Potential
Remedies | Echo state networks are powerful recurrent neural networks. However, they are
often unstable and shaky, making the process of finding an good ESN for a
specific dataset quite hard. Obtaining a superb accuracy by using the Echo
State Network is a challenging task. We create, develop and implement a family
of predictab... | stat.ML cs.LG | echo state networks are powerful recurrent neural networks however they are often unstable and shaky making the process of finding an good esn for a specific dataset quite hard obtaining a superb accuracy by using the echo state network is a challenging task we create develop and implement a family of predictably optim... | [['echo', 'state', 'networks', 'are', 'powerful', 'recurrent', 'neural', 'networks', 'however', 'they', 'are', 'often', 'unstable', 'and', 'shaky', 'making', 'the', 'process', 'of', 'finding', 'an', 'good', 'esn', 'for', 'a', 'specific', 'dataset', 'quite', 'hard', 'obtaining', 'a', 'superb', 'accuracy', 'by', 'using',... | [-0.07070512331513144, 0.059434554081371126, -0.11284036038483938, 0.0875435218360892, -0.05696090608141067, -0.18363641376855858, 0.03762759129670073, 0.43639432092093117, -0.2690284629287314, -0.3243141779173542, 0.12688578999751704, -0.2535269232958509, -0.15035225482084874, 0.19415867968421915, -0.06771064872176659... |
1,802.0737 | SufiSent - Universal Sentence Representations Using Suffix Encodings | Computing universal distributed representations of sentences is a fundamental
task in natural language processing. We propose a method to learn such
representations by encoding the suffixes of word sequences in a sentence and
training on the Stanford Natural Language Inference (SNLI) dataset. We
demonstrate the effec... | cs.CL cs.AI | computing universal distributed representations of sentences is a fundamental task in natural language processing we propose a method to learn such representations by encoding the suffixes of word sequences in a sentence and training on the stanford natural language inference snli dataset we demonstrate the effectivene... | [['computing', 'universal', 'distributed', 'representations', 'of', 'sentences', 'is', 'a', 'fundamental', 'task', 'in', 'natural', 'language', 'processing', 'we', 'propose', 'a', 'method', 'to', 'learn', 'such', 'representations', 'by', 'encoding', 'the', 'suffixes', 'of', 'word', 'sequences', 'in', 'a', 'sentence', '... | [-0.0423013065046689, -0.03639245954400394, -0.04895384169140016, 0.09220667310182762, -0.1275680250764708, -0.11743425561871845, 0.07210839601611951, 0.4508121318940539, -0.2975091368862195, -0.34907018931698985, 0.03289879802832729, -0.27282729919534177, -0.16950532459304668, 0.2779615214676596, -0.14332356154045556,... |
1,802.07371 | Gravitational Wave Opacity from Gauge Field Dark Energy | We show that astrophysical gravitational waves can undergo an anomalous
modulation when propagating through cosmic gauge field dark energy. A
sufficiently strong effect, dependent on the gauge field energy density, would
appear as a redshift-dependent opacity, thereby impacting the use of
gravitational wave standard ... | gr-qc astro-ph.CO | we show that astrophysical gravitational waves can undergo an anomalous modulation when propagating through cosmic gauge field dark energy a sufficiently strong effect dependent on the gauge field energy density would appear as a redshiftdependent opacity thereby impacting the use of gravitational wave standard sirens ... | [['we', 'show', 'that', 'astrophysical', 'gravitational', 'waves', 'can', 'undergo', 'an', 'anomalous', 'modulation', 'when', 'propagating', 'through', 'cosmic', 'gauge', 'field', 'dark', 'energy', 'a', 'sufficiently', 'strong', 'effect', 'dependent', 'on', 'the', 'gauge', 'field', 'energy', 'density', 'would', 'appear... | [-0.13795907587821907, 0.22632543432630176, -0.06663640203057891, 0.16063508027744117, -0.1252583876096954, -0.0723573322692472, -0.02713833612506278, 0.34097986872721875, -0.22656386485970062, -0.34465432579680866, 0.03277550565124127, -0.27487469461306724, -0.03729128713570794, 0.20052516543041243, 0.0602622236457743... |
1,802.07372 | Stochastic Variance-Reduced Cubic Regularization for Nonconvex
Optimization | Cubic regularization (CR) is an optimization method with emerging popularity
due to its capability to escape saddle points and converge to second-order
stationary solutions for nonconvex optimization. However, CR encounters a high
sample complexity issue for finite-sum problems with a large data size.
%Various inexac... | math.OC cs.LG stat.ML | cubic regularization cr is an optimization method with emerging popularity due to its capability to escape saddle points and converge to secondorder stationary solutions for nonconvex optimization however cr encounters a high sample complexity issue for finitesum problems with a large data size various inexact variants... | [['cubic', 'regularization', 'cr', 'is', 'an', 'optimization', 'method', 'with', 'emerging', 'popularity', 'due', 'to', 'its', 'capability', 'to', 'escape', 'saddle', 'points', 'and', 'converge', 'to', 'secondorder', 'stationary', 'solutions', 'for', 'nonconvex', 'optimization', 'however', 'cr', 'encounters', 'a', 'hig... | [-0.07760229198511963, -0.03752477750210191, -0.061052607210557455, 0.06545400173863306, -0.05813940305535386, -0.13515602687385114, 0.10651220614764918, 0.3786825357039073, -0.2638043039705513, -0.3373730376521807, 0.10340059983541212, -0.24895859680638263, -0.14195844929284848, 0.20284006400488136, -0.130349618662432... |
1,802.07373 | Polynomial convolutions in max-plus algebra | Recently, in a work that grew out of their exploration of interlacing
polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain
combinatorial polynomial convolutions. These convolutions preserve
real-rootedness and capture expectations of characteristic polynomials of
unitarily invariant random mat... | math.RA | recently in a work that grew out of their exploration of interlacing polynomials marcus spielman and srivastava and then marcus studied certain combinatorial polynomial convolutions these convolutions preserve realrootedness and capture expectations of characteristic polynomials of unitarily invariant random matrices t... | [['recently', 'in', 'a', 'work', 'that', 'grew', 'out', 'of', 'their', 'exploration', 'of', 'interlacing', 'polynomials', 'marcus', 'spielman', 'and', 'srivastava', 'and', 'then', 'marcus', 'studied', 'certain', 'combinatorial', 'polynomial', 'convolutions', 'these', 'convolutions', 'preserve', 'realrootedness', 'and',... | [-0.1140220153346573, 0.06961902788197304, -0.07978029555471783, 0.08806221673624928, -0.07390226839872246, -0.09151131283407184, 0.013011336963708427, 0.29239119023761967, -0.3101280850569972, -0.26010139229792084, 0.08043495500566099, -0.25156432566317644, -0.2114615453237837, 0.16988194864878262, -0.1346063437617637... |
1,802.07374 | On the scaling of polynomial features for representation matching | In many neural models, new features as polynomial functions of existing ones
are used to augment representations. Using the natural language inference task
as an example, we investigate the use of scaled polynomials of degree 2 and
above as matching features. We find that scaling degree 2 features has the
highest imp... | cs.CL cs.AI | in many neural models new features as polynomial functions of existing ones are used to augment representations using the natural language inference task as an example we investigate the use of scaled polynomials of degree 2 and above as matching features we find that scaling degree 2 features has the highest impact on... | [['in', 'many', 'neural', 'models', 'new', 'features', 'as', 'polynomial', 'functions', 'of', 'existing', 'ones', 'are', 'used', 'to', 'augment', 'representations', 'using', 'the', 'natural', 'language', 'inference', 'task', 'as', 'an', 'example', 'we', 'investigate', 'the', 'use', 'of', 'scaled', 'polynomials', 'of', ... | [-0.04185941414759746, 0.00489985175076909, -0.030652488478355937, 0.1064044722237639, -0.07040003864538102, -0.12862658117424755, -0.0038669825797634466, 0.3915155983663031, -0.29481265785556937, -0.36161436213712606, 0.09356386178646177, -0.2900047131060135, -0.19666644321044996, 0.22529667553802332, -0.0757394871999... |
1,802.07375 | Periodicity in Data Streams with Wildcards | We investigate the problem of detecting periodic trends within a string $S$
of length $n$, arriving in the streaming model, containing at most $k$ wildcard
characters, where $k=o(n)$. A wildcard character is a special character that
can be assigned any other character. We say $S$ has wildcard-period $p$ if
there exis... | cs.DS | we investigate the problem of detecting periodic trends within a string s of length n arriving in the streaming model containing at most k wildcard characters where kon a wildcard character is a special character that can be assigned any other character we say s has wildcardperiod p if there exists an assignment to eac... | [['we', 'investigate', 'the', 'problem', 'of', 'detecting', 'periodic', 'trends', 'within', 'a', 'string', 's', 'of', 'length', 'n', 'arriving', 'in', 'the', 'streaming', 'model', 'containing', 'at', 'most', 'k', 'wildcard', 'characters', 'where', 'kon', 'a', 'wildcard', 'character', 'is', 'a', 'special', 'character', ... | [-0.2087921285242946, 0.14985333551777769, -0.0714420111677437, 0.034577079362632636, -0.07639291532924054, -0.19593436847337417, 0.07888919135762586, 0.3547451555797899, -0.3457138620429086, -0.25348238420771885, 0.036471732863638966, -0.30266194605199553, -0.11954805582278856, 0.16466627362425681, -0.0469367758629636... |
1,802.07376 | Core Emergence in a Massive Infrared Dark Cloud: A Comparison Between
Mid-IR Extinction and 1.3 mm Emission | Stars are born from dense cores in molecular clouds. Observationally, it is
crucial to capture the formation of cores in order to understand the necessary
conditions and rate of the star formation process. The {\it Atacama Large
Mm/sub-mm Array} (ALMA) is extremely powerful for identifying dense gas
structures, inclu... | astro-ph.GA | stars are born from dense cores in molecular clouds observationally it is crucial to capture the formation of cores in order to understand the necessary conditions and rate of the star formation process the it atacama large mmsubmm array alma is extremely powerful for identifying dense gas structures including cores at... | [['stars', 'are', 'born', 'from', 'dense', 'cores', 'in', 'molecular', 'clouds', 'observationally', 'it', 'is', 'crucial', 'to', 'capture', 'the', 'formation', 'of', 'cores', 'in', 'order', 'to', 'understand', 'the', 'necessary', 'conditions', 'and', 'rate', 'of', 'the', 'star', 'formation', 'process', 'the', 'it', 'at... | [-0.0789292091599271, 0.07169114169847969, -0.050330252822076205, 0.056251267457588, -0.011483509725364964, 0.009136385678932185, 0.07032737744757052, 0.4096601119136992, -0.18558924350681366, -0.32855041508868565, 0.0822642519656846, -0.22193563039302835, -0.03471778272091276, 0.10486941248132271, 0.006402327521914751... |
1,802.07377 | C*-Algebras for partial product systems over N | We define partial product systems over N. They generalise product systems
over N and Fell bundles over Z. We define Toeplitz C*-algebras and relative
Cuntz-Pimsner algebras for them and show that the section C*-algebra of a Fell
bundle over Z is a relative Cuntz-Pimsner algebra. We describe the
gauge-invariant ideals... | math.OA | we define partial product systems over n they generalise product systems over n and fell bundles over z we define toeplitz calgebras and relative cuntzpimsner algebras for them and show that the section calgebra of a fell bundle over z is a relative cuntzpimsner algebra we describe the gaugeinvariant ideals in the toep... | [['we', 'define', 'partial', 'product', 'systems', 'over', 'n', 'they', 'generalise', 'product', 'systems', 'over', 'n', 'and', 'fell', 'bundles', 'over', 'z', 'we', 'define', 'toeplitz', 'calgebras', 'and', 'relative', 'cuntzpimsner', 'algebras', 'for', 'them', 'and', 'show', 'that', 'the', 'section', 'calgebra', 'of'... | [-0.18765623222484631, 0.09877176754741447, -0.034198970499413985, 0.051841522060351926, -0.03955266548803559, -0.09882683484573607, -0.04531447713573774, 0.44511954872696485, -0.395492358788572, -0.11250299560251059, 0.09147112943982291, -0.2698171095991576, -0.08813835945221837, 0.1489809781519903, -0.201725625950429... |
1,802.07378 | Perturbation theories behind thermal mode spectroscopy for high-accuracy
measurement of thermal diffusivity of solids | Thermal mode spectroscopy (TMS) has been recently proposed for accurately
measuring thermal diffusivity of solids from a temperature decay rate of a
specific thermal mode selected by three- dimensional (anti)nodal information
[Phys. Rev. Lett., 117, 195901 (2016)]. In this paper, we find out the
following advantages ... | cond-mat.mtrl-sci | thermal mode spectroscopy tms has been recently proposed for accurately measuring thermal diffusivity of solids from a temperature decay rate of a specific thermal mode selected by three dimensional antinodal information phys rev lett 117 195901 2016 in this paper we find out the following advantages of tms by use of p... | [['thermal', 'mode', 'spectroscopy', 'tms', 'has', 'been', 'recently', 'proposed', 'for', 'accurately', 'measuring', 'thermal', 'diffusivity', 'of', 'solids', 'from', 'a', 'temperature', 'decay', 'rate', 'of', 'a', 'specific', 'thermal', 'mode', 'selected', 'by', 'three', 'dimensional', 'antinodal', 'information', 'phy... | [-0.08605475013311474, 0.2062482758386371, -0.07806765359157744, -0.04722662924308306, -0.03608640422447561, -0.12931541116752973, 0.08165015431362778, 0.31995573681062806, -0.24654484812755328, -0.2956690263743393, 0.05280447918966484, -0.29316918458789587, -0.06557017359404992, 0.1912951602552755, -0.0267395960564056... |
1,802.07379 | Scalable Label Propagation for Multi-relational Learning on the Tensor
Product of Graphs | Multi-relational learning on knowledge graphs infers high-order relations
among the entities across the graphs. This learning task can be solved by label
propagation on the tensor product of the knowledge graphs to learn the
high-order relations as a tensor. In this paper, we generalize a widely used
label propagatio... | cs.LG | multirelational learning on knowledge graphs infers highorder relations among the entities across the graphs this learning task can be solved by label propagation on the tensor product of the knowledge graphs to learn the highorder relations as a tensor in this paper we generalize a widely used label propagation model ... | [['multirelational', 'learning', 'on', 'knowledge', 'graphs', 'infers', 'highorder', 'relations', 'among', 'the', 'entities', 'across', 'the', 'graphs', 'this', 'learning', 'task', 'can', 'be', 'solved', 'by', 'label', 'propagation', 'on', 'the', 'tensor', 'product', 'of', 'the', 'knowledge', 'graphs', 'to', 'learn', '... | [-0.0860964207711078, 0.04893421665467243, -0.022230702560865186, 0.06536067965343251, -0.12674301291151352, -0.11392089233787965, 0.028151511952158932, 0.42712944314263546, -0.30762839263748126, -0.36062396401810703, 0.04347017786445241, -0.2663768314783579, -0.17101804751567135, 0.11587557818591414, -0.05809984887140... |
1,802.0738 | Fast Nonconvex Deconvolution of Calcium Imaging Data | Calcium imaging data promises to transform the field of neuroscience by
making it possible to record from large populations of neurons simultaneously.
However, determining the exact moment in time at which a neuron spikes, from a
calcium imaging data set, amounts to a non-trivial deconvolution problem which
is of cri... | stat.ME q-bio.NC stat.AP | calcium imaging data promises to transform the field of neuroscience by making it possible to record from large populations of neurons simultaneously however determining the exact moment in time at which a neuron spikes from a calcium imaging data set amounts to a nontrivial deconvolution problem which is of critical i... | [['calcium', 'imaging', 'data', 'promises', 'to', 'transform', 'the', 'field', 'of', 'neuroscience', 'by', 'making', 'it', 'possible', 'to', 'record', 'from', 'large', 'populations', 'of', 'neurons', 'simultaneously', 'however', 'determining', 'the', 'exact', 'moment', 'in', 'time', 'at', 'which', 'a', 'neuron', 'spike... | [-0.04883681236270943, 0.027173974676806406, -0.06755936551866505, 0.03750404114715125, -0.08521484051986288, -0.129141338069138, 0.03481976260816594, 0.3947682832185106, -0.22580374811556847, -0.35818551098568335, 0.1378941234519623, -0.28465933958981554, -0.16250753531337478, 0.23777865134544818, -0.09478428594621957... |
1,802.07381 | How to Subvert Backdoored Encryption: Security Against Adversaries that
Decrypt All Ciphertexts | We study secure and undetectable communication in a world where governments
can read all encrypted communications of citizens. We consider a world where
the only permitted communication method is via a government-mandated encryption
scheme, using government-mandated keys. Citizens caught trying to communicate
otherwi... | cs.CR | we study secure and undetectable communication in a world where governments can read all encrypted communications of citizens we consider a world where the only permitted communication method is via a governmentmandated encryption scheme using governmentmandated keys citizens caught trying to communicate otherwise eg b... | [['we', 'study', 'secure', 'and', 'undetectable', 'communication', 'in', 'a', 'world', 'where', 'governments', 'can', 'read', 'all', 'encrypted', 'communications', 'of', 'citizens', 'we', 'consider', 'a', 'world', 'where', 'the', 'only', 'permitted', 'communication', 'method', 'is', 'via', 'a', 'governmentmandated', 'e... | [-0.2111899552565608, 0.0355246808955149, -0.12675287487109962, 0.10232843384086103, -0.0883678831833027, -0.34293208888569177, 0.14502585949428157, 0.38093044626834666, -0.29869906806675234, -0.29233933534978657, 0.09167611749529438, -0.2869914753923407, -0.09114681871618287, 0.1724545165725904, -0.21518623597658548, ... |
1,802.07382 | Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic
Regression, Sigmoid and more | Coreset (or core-set) is a small weighted \emph{subset} $Q$ of an input set
$P$ with respect to a given \emph{monotonic} function
$f:\mathbb{R}\to\mathbb{R}$ that \emph{provably} approximates its fitting loss
$\sum_{p\in P}f(p\cdot x)$ to \emph{any} given $x\in\mathbb{R}^d$. Using $Q$ we
can obtain approximation of $... | cs.LG cs.DS | coreset or coreset is a small weighted emphsubset q of an input set p with respect to a given emphmonotonic function fmathbbrtomathbbr that emphprovably approximates its fitting loss sum_pin pfpcdot x to emphany given xinmathbbrd using q we can obtain approximation of x that minimizes this loss by running emphexisting ... | [['coreset', 'or', 'coreset', 'is', 'a', 'small', 'weighted', 'emphsubset', 'q', 'of', 'an', 'input', 'set', 'p', 'with', 'respect', 'to', 'a', 'given', 'emphmonotonic', 'function', 'fmathbbrtomathbbr', 'that', 'emphprovably', 'approximates', 'its', 'fitting', 'loss', 'sum_pin', 'pfpcdot', 'x', 'to', 'emphany', 'given'... | [-0.10893406477221783, 0.07646999173190408, -0.0838256628658781, 0.11493752387117806, -0.04332715526540229, -0.2101494254319803, 0.08945803326333325, 0.38974721824208686, -0.24804064039312673, -0.28685503498467796, 0.03624986645481582, -0.2565562888147666, -0.16898029695714142, 0.2156595546010789, -0.09414318665954555,... |
1,802.07383 | Artinian algebras and Jordan type | The Jordan type of an element $\ell$ of the maximal ideal of an Artinian
k-algebra A acting on an A-module M of k-dimension n, is the partition of n
given by the Jordan block decomposition of the multiplication map $m_\ell$ on
M. In general the Jordan type has more information than whether the pair
$(\ell,M)$ is stro... | math.AC | the jordan type of an element ell of the maximal ideal of an artinian kalgebra a acting on an amodule m of kdimension n is the partition of n given by the jordan block decomposition of the multiplication map m_ell on m in general the jordan type has more information than whether the pair ellm is strong or weak lefschet... | [['the', 'jordan', 'type', 'of', 'an', 'element', 'ell', 'of', 'the', 'maximal', 'ideal', 'of', 'an', 'artinian', 'kalgebra', 'a', 'acting', 'on', 'an', 'amodule', 'm', 'of', 'kdimension', 'n', 'is', 'the', 'partition', 'of', 'n', 'given', 'by', 'the', 'jordan', 'block', 'decomposition', 'of', 'the', 'multiplication', ... | [-0.15968048708491053, 0.030911465896666688, -0.03523882577348858, 0.054144757316600886, -0.08077763659841292, -0.16872558415522926, -0.04236901084866936, 0.3228127123622147, -0.34084909641477346, -0.18618230700926625, 0.11085736511230519, -0.24079413316999992, -0.14413725052105442, 0.20354696207086567, -0.093183226944... |
1,802.07384 | Interpreting Neural Network Judgments via Minimal, Stable, and Symbolic
Corrections | We present a new algorithm to generate minimal, stable, and symbolic
corrections to an input that will cause a neural network with ReLU activations
to change its output. We argue that such a correction is a useful way to
provide feedback to a user when the network's output is different from a
desired output. Our algo... | cs.LG cs.AI stat.ML | we present a new algorithm to generate minimal stable and symbolic corrections to an input that will cause a neural network with relu activations to change its output we argue that such a correction is a useful way to provide feedback to a user when the networks output is different from a desired output our algorithm g... | [['we', 'present', 'a', 'new', 'algorithm', 'to', 'generate', 'minimal', 'stable', 'and', 'symbolic', 'corrections', 'to', 'an', 'input', 'that', 'will', 'cause', 'a', 'neural', 'network', 'with', 'relu', 'activations', 'to', 'change', 'its', 'output', 'we', 'argue', 'that', 'such', 'a', 'correction', 'is', 'a', 'usefu... | [-0.07533130189308469, 0.03436330517266827, -0.1354056366520827, 0.10441670820620827, -0.12111351755065997, -0.22572810763538984, 0.06714824189958697, 0.3803035557750979, -0.307725915723465, -0.299694751450395, 0.09189359366618952, -0.2541759494371468, -0.19712968558439467, 0.20958629263885564, -0.09613787235318087, 0.... |
1,802.07385 | Universal Growth in Production Economies | We consider a simple variant of the von Neumann model of an expanding
economy, in which multiple producers make goods according to their production
function. The players trade their goods at the market and then use the bundles
acquired for the production in the next round. We study a simple decentralized
dynamic---kn... | cs.GT | we consider a simple variant of the von neumann model of an expanding economy in which multiple producers make goods according to their production function the players trade their goods at the market and then use the bundles acquired for the production in the next round we study a simple decentralized dynamicknown as p... | [['we', 'consider', 'a', 'simple', 'variant', 'of', 'the', 'von', 'neumann', 'model', 'of', 'an', 'expanding', 'economy', 'in', 'which', 'multiple', 'producers', 'make', 'goods', 'according', 'to', 'their', 'production', 'function', 'the', 'players', 'trade', 'their', 'goods', 'at', 'the', 'market', 'and', 'then', 'use... | [-0.11467451224809573, 0.09911101186932478, -0.09690707345162669, 0.057332406296164436, -0.06900810232005453, -0.16429936494590636, 0.10819115631735474, 0.3666102700673985, -0.3176877859088602, -0.2624078480707061, 0.1263287164657677, -0.2834306444712384, -0.14725672876993093, 0.12815963296984542, -0.09475348178755431,... |
1,802.07386 | Subspace Methods for 3-Parameter Eigenvalue Problems | We propose subspace methods for 3-parameter eigenvalue problems. Such
problems arise when separation of variables is applied to separable boundary
value problems; a particular example is the Helmholtz equation in ellipsoidal
and paraboloidal coordinates. While several subspace methods for 2-parameter
eigenvalue probl... | math.NA | we propose subspace methods for 3parameter eigenvalue problems such problems arise when separation of variables is applied to separable boundary value problems a particular example is the helmholtz equation in ellipsoidal and paraboloidal coordinates while several subspace methods for 2parameter eigenvalue problems exi... | [['we', 'propose', 'subspace', 'methods', 'for', '3parameter', 'eigenvalue', 'problems', 'such', 'problems', 'arise', 'when', 'separation', 'of', 'variables', 'is', 'applied', 'to', 'separable', 'boundary', 'value', 'problems', 'a', 'particular', 'example', 'is', 'the', 'helmholtz', 'equation', 'in', 'ellipsoidal', 'an... | [-0.07786900143740544, 0.026541924048372797, -0.0795876745095787, 0.0750012171571143, -0.11994330019127422, -0.2036007929093709, -0.00040284307518353063, 0.40622965049988125, -0.2928545778306822, -0.2593646213800336, 0.15642523244653905, -0.27058917133059973, -0.15320228864487337, 0.22275863823791345, -0.07626158155799... |
1,802.07387 | Dynamics of Viscous Entrapped Saturated Zones in Partially Wetted Porous
Media | As a typical multiphase fluid flow process, drainage in porous media is of
fundamental interest in nature and industrial applications. During drainage
processes in unsaturated soils and porous media in general, saturated clusters,
in which a liquid phase fully occupies the pore space between solid grains,
affect the ... | cond-mat.soft | as a typical multiphase fluid flow process drainage in porous media is of fundamental interest in nature and industrial applications during drainage processes in unsaturated soils and porous media in general saturated clusters in which a liquid phase fully occupies the pore space between solid grains affect the relativ... | [['as', 'a', 'typical', 'multiphase', 'fluid', 'flow', 'process', 'drainage', 'in', 'porous', 'media', 'is', 'of', 'fundamental', 'interest', 'in', 'nature', 'and', 'industrial', 'applications', 'during', 'drainage', 'processes', 'in', 'unsaturated', 'soils', 'and', 'porous', 'media', 'in', 'general', 'saturated', 'clu... | [-0.059480636417604635, 0.20166707025231875, -0.07508715676909714, 0.020694889360469308, -0.016528986433573138, -0.08909498317554489, 0.005045961953099016, 0.38884092277246657, -0.2939637403708891, -0.29296958053519373, 0.0893678727965567, -0.26355567326438484, -0.12342503155955922, 0.12183654272959298, -0.046550927942... |
1,802.07388 | Canonical heights on hyper-K\"ahler varieties and the
Kawaguchi-Silverman conjecture | The Kawaguchi--Silverman conjecture predicts that if $f\colon X
\dashrightarrow X$ is a dominant rational-self map of a projective variety over
$\overline{\mathbb{Q}}$, and $P$ is a $\overline{\mathbb{Q}}$-point of $X$ with
Zariski-dense orbit, then the dynamical and arithmetic degrees of $f$ coincide:
$\lambda_1(f) ... | math.AG math.DS math.NT | the kawaguchisilverman conjecture predicts that if fcolon x dashrightarrow x is a dominant rationalself map of a projective variety over overlinemathbbq and p is a overlinemathbbqpoint of x with zariskidense orbit then the dynamical and arithmetic degrees of f coincide lambda_1f alpha_fp we prove this conjecture in sev... | [['the', 'kawaguchisilverman', 'conjecture', 'predicts', 'that', 'if', 'fcolon', 'x', 'dashrightarrow', 'x', 'is', 'a', 'dominant', 'rationalself', 'map', 'of', 'a', 'projective', 'variety', 'over', 'overlinemathbbq', 'and', 'p', 'is', 'a', 'overlinemathbbqpoint', 'of', 'x', 'with', 'zariskidense', 'orbit', 'then', 'th... | [-0.24283121221084544, 0.055754884483015285, -0.06116547420660549, 0.04886370453057177, -0.028829501877400153, -0.17472954535425858, -0.020311133010917283, 0.3463689876284371, -0.31281516308638646, -0.15548369132893833, 0.04763357052604291, -0.2483070929227595, -0.1270453794760273, 0.23748456494526027, -0.1614950038690... |
1,802.07389 | 3LC: Lightweight and Effective Traffic Compression for Distributed
Machine Learning | The performance and efficiency of distributed machine learning (ML) depends
significantly on how long it takes for nodes to exchange state changes.
Overly-aggressive attempts to reduce communication often sacrifice final model
accuracy and necessitate additional ML techniques to compensate for this loss,
limiting the... | cs.LG cs.DC stat.ML | the performance and efficiency of distributed machine learning ml depends significantly on how long it takes for nodes to exchange state changes overlyaggressive attempts to reduce communication often sacrifice final model accuracy and necessitate additional ml techniques to compensate for this loss limiting their gene... | [['the', 'performance', 'and', 'efficiency', 'of', 'distributed', 'machine', 'learning', 'ml', 'depends', 'significantly', 'on', 'how', 'long', 'it', 'takes', 'for', 'nodes', 'to', 'exchange', 'state', 'changes', 'overlyaggressive', 'attempts', 'to', 'reduce', 'communication', 'often', 'sacrifice', 'final', 'model', 'a... | [-0.11695822101632902, 8.525494151486608e-06, -0.045677719997454014, 0.05175495501482179, -0.10499727109748268, -0.2210147810993928, 0.13426897882115832, 0.45080192607944597, -0.27897938820784407, -0.3785372276171417, 0.06655502060294419, -0.22232341905071157, -0.12316463713417064, 0.18366861188488673, -0.1641761788559... |
1,802.0739 | Quantum contextuality implies a logic that does not obey the principle
of bivalence | In the paper, a value assignment for projection operators relating to a
quantum system is equated with assignment of truth-values to the propositions
associated with these operators. In consequence, the Kochen-Specker theorem
(its localized variant, to be exact) can be treated as the statement that a
logic of those p... | quant-ph | in the paper a value assignment for projection operators relating to a quantum system is equated with assignment of truthvalues to the propositions associated with these operators in consequence the kochenspecker theorem its localized variant to be exact can be treated as the statement that a logic of those projection ... | [['in', 'the', 'paper', 'a', 'value', 'assignment', 'for', 'projection', 'operators', 'relating', 'to', 'a', 'quantum', 'system', 'is', 'equated', 'with', 'assignment', 'of', 'truthvalues', 'to', 'the', 'propositions', 'associated', 'with', 'these', 'operators', 'in', 'consequence', 'the', 'kochenspecker', 'theorem', '... | [-0.1255045301384396, 0.07116571614622241, -0.13186239472512776, 0.10081439706522764, -0.1356259873751292, -0.1586280753577335, 0.07573747239479821, 0.31089581838912433, -0.31248213244705564, -0.24870956407135558, 0.12746219767399858, -0.26072467395311427, -0.09754821877059941, 0.13538649760044386, -0.1607239347585063,... |
1,802.07391 | Glassy, Gardner-like Phenomenology in Minimally Polydisperse Crystalline
Systems | We report on a non-equilibrium phase of matter, the minimally disordered
crystal phase, which we find exists between the maximally amorphous glasses and
the ideal crystal. Even though these near crystals appear highly ordered, they
display glassy and jamming features akin to those observed in amorphous solids.
Struct... | cond-mat.soft cond-mat.mtrl-sci | we report on a nonequilibrium phase of matter the minimally disordered crystal phase which we find exists between the maximally amorphous glasses and the ideal crystal even though these near crystals appear highly ordered they display glassy and jamming features akin to those observed in amorphous solids structurally t... | [['we', 'report', 'on', 'a', 'nonequilibrium', 'phase', 'of', 'matter', 'the', 'minimally', 'disordered', 'crystal', 'phase', 'which', 'we', 'find', 'exists', 'between', 'the', 'maximally', 'amorphous', 'glasses', 'and', 'the', 'ideal', 'crystal', 'even', 'though', 'these', 'near', 'crystals', 'appear', 'highly', 'orde... | [-0.12657633489300688, 0.3177173891430342, -0.13759658873323502, 0.02694966096707385, 0.013841164663691468, -0.16455703571711372, 0.03778378214077585, 0.43442894413128375, -0.25626994521126184, -0.2637917471063376, 0.05228640470933926, -0.30722638176436107, -0.18861358152225433, 0.12478563112274903, -0.0001558365124728... |
1,802.07392 | Chromospheric heating due to cancellation of quiet Sun internetwork
fields | The heating of the solar chromosphere remains one of the most important
questions in solar physics. Our current understanding is that small-scale
internetwork (IN) magnetic fields play an important role as a heating agent.
Indeed, cancellations of IN magnetic elements in the photosphere can produce
transient brighten... | astro-ph.SR | the heating of the solar chromosphere remains one of the most important questions in solar physics our current understanding is that smallscale internetwork in magnetic fields play an important role as a heating agent indeed cancellations of in magnetic elements in the photosphere can produce transient brightenings in ... | [['the', 'heating', 'of', 'the', 'solar', 'chromosphere', 'remains', 'one', 'of', 'the', 'most', 'important', 'questions', 'in', 'solar', 'physics', 'our', 'current', 'understanding', 'is', 'that', 'smallscale', 'internetwork', 'in', 'magnetic', 'fields', 'play', 'an', 'important', 'role', 'as', 'a', 'heating', 'agent'... | [-0.11907107601462699, 0.19744325981006083, 0.03480803949341174, 0.13806183637949412, -0.05734091414580857, -0.026934488306698555, 0.03427240189542493, 0.40056924559097706, -0.23184116540352928, -0.41017331485930014, 0.10271236373986188, -0.26700461207215964, -0.10331063438598223, 0.18204281689254803, -0.03490570622842... |
1,802.07393 | A lateral-type spin-photodiode based on Fe/x-AlOx/p-InGaAs junctions
with a refracting-facet side window | A lateral-type spin-photodiode having a refracting facet on a side edge of
the device is proposed and demonstrated at room temperature. The light shed
horizontally on the side of the device is refracted and introduced directly
into a thin InGaAs active layer under the spin-detecting Fe contact in which
spin-polarized... | physics.app-ph | a lateraltype spinphotodiode having a refracting facet on a side edge of the device is proposed and demonstrated at room temperature the light shed horizontally on the side of the device is refracted and introduced directly into a thin ingaas active layer under the spindetecting fe contact in which spinpolarized carrie... | [['a', 'lateraltype', 'spinphotodiode', 'having', 'a', 'refracting', 'facet', 'on', 'a', 'side', 'edge', 'of', 'the', 'device', 'is', 'proposed', 'and', 'demonstrated', 'at', 'room', 'temperature', 'the', 'light', 'shed', 'horizontally', 'on', 'the', 'side', 'of', 'the', 'device', 'is', 'refracted', 'and', 'introduced'... | [-0.11863525930216144, 0.15255095363796786, -0.051599782585215415, -0.04570430324958196, -0.006451521445629432, -0.18790287204625966, 0.07911705443678473, 0.4031232815039785, -0.25538183618827087, -0.2948272294658971, 0.009028120650327764, -0.33828863007090004, -0.05511064184400694, 0.22564048273948414, 0.0491700620958... |
1,802.07394 | The "quantum" Turan problem for operator systems | Let V be a linear subspace of M_n(C) which contains the identity matrix and
is stable under Hermitian transpose. A "quantum k-clique" for V is a rank k
orthogonal projection P in M_n(C) for which dim(PVP) = k^2, and a "quantum
k-anticlique" is a rank k orthogonal projection for which dim(PVP) = 1. We give
upper and l... | math.OA math.CO math.FA math.RA quant-ph | let v be a linear subspace of m_nc which contains the identity matrix and is stable under hermitian transpose a quantum kclique for v is a rank k orthogonal projection p in m_nc for which dimpvp k2 and a quantum kanticlique is a rank k orthogonal projection for which dimpvp 1 we give upper and lower bounds both for the... | [['let', 'v', 'be', 'a', 'linear', 'subspace', 'of', 'm_nc', 'which', 'contains', 'the', 'identity', 'matrix', 'and', 'is', 'stable', 'under', 'hermitian', 'transpose', 'a', 'quantum', 'kclique', 'for', 'v', 'is', 'a', 'rank', 'k', 'orthogonal', 'projection', 'p', 'in', 'm_nc', 'for', 'which', 'dimpvp', 'k2', 'and', 'a... | [-0.18047741335955844, 0.14580168522795361, -0.07038916474550791, -0.015473276014097205, -0.053186354687672924, -0.21942200924366198, 0.05284980169615184, 0.2776250298531062, -0.26176259585324374, -0.19411474898800082, 0.11540490204612885, -0.27233962277913915, -0.11156864407547247, 0.16165749354009656, -0.017066424209... |
1,802.07395 | A Mixed Mimetic Spectral Element Model of the Rotating Shallow Water
Equations on the Cubed Sphere | In a previous article [J. Comp. Phys. $\mathbf{357}$ (2018) 282-304], the
mixed mimetic spectral element method was used to solve the rotating shallow
water equations in an idealized geometry. Here the method is extended to a
smoothly varying, non-affine, cubed sphere geometry. The differential operators
are encoded ... | math.NA | in a previous article j comp phys mathbf357 2018 282304 the mixed mimetic spectral element method was used to solve the rotating shallow water equations in an idealized geometry here the method is extended to a smoothly varying nonaffine cubed sphere geometry the differential operators are encoded topologically via inc... | [['in', 'a', 'previous', 'article', 'j', 'comp', 'phys', 'mathbf357', '2018', '282304', 'the', 'mixed', 'mimetic', 'spectral', 'element', 'method', 'was', 'used', 'to', 'solve', 'the', 'rotating', 'shallow', 'water', 'equations', 'in', 'an', 'idealized', 'geometry', 'here', 'the', 'method', 'is', 'extended', 'to', 'a',... | [-0.1039716045154219, 0.07750097475378322, -0.06247450139188598, 0.0569285729450854, -0.06351216745245805, -0.08247076990809424, -0.04388014774056191, 0.3569654351272059, -0.2875693772542984, -0.262439940777419, 0.11852578349173704, -0.2583127671865918, -0.13642976327852102, 0.1338435878006226, -0.10611703128435035, 0.... |
1,802.07396 | Galois representations and ordinary reduction | We provide conditions on the p-adic Galois representation of a smooth proper
variety over a complete nonarchimedean extension of Q_p to have (potentially)
good ordinary reduction.
| math.AG math.NT | we provide conditions on the padic galois representation of a smooth proper variety over a complete nonarchimedean extension of q_p to have potentially good ordinary reduction | [['we', 'provide', 'conditions', 'on', 'the', 'padic', 'galois', 'representation', 'of', 'a', 'smooth', 'proper', 'variety', 'over', 'a', 'complete', 'nonarchimedean', 'extension', 'of', 'q_p', 'to', 'have', 'potentially', 'good', 'ordinary', 'reduction']] | [-0.2047399036013163, -0.06706812042886248, -0.2679152919266086, 0.06645021981631334, -0.20846827341637647, -0.025967110700618763, -0.005364966471321308, 0.32391351099627524, -0.3287988147483422, -0.24208731720080742, 0.03880050273325581, -0.1504280581497229, -0.08198787507493623, 0.32934639796328086, -0.20859974628994... |
1,802.07397 | PTL-separability and closures for WQOs on words | We introduce a flexible class of well-quasi-orderings (WQOs) on words that
generalizes the ordering of (not necessarily contiguous) subwords. Each such
WQO induces a class of piecewise testable languages (PTLs) as Boolean
combinations of upward closed sets. In this way, a range of regular language
classes arises as P... | cs.FL | we introduce a flexible class of wellquasiorderings wqos on words that generalizes the ordering of not necessarily contiguous subwords each such wqo induces a class of piecewise testable languages ptls as boolean combinations of upward closed sets in this way a range of regular language classes arises as ptls moreover ... | [['we', 'introduce', 'a', 'flexible', 'class', 'of', 'wellquasiorderings', 'wqos', 'on', 'words', 'that', 'generalizes', 'the', 'ordering', 'of', 'not', 'necessarily', 'contiguous', 'subwords', 'each', 'such', 'wqo', 'induces', 'a', 'class', 'of', 'piecewise', 'testable', 'languages', 'ptls', 'as', 'boolean', 'combinat... | [-0.11062607899549659, 0.07522648095187766, -0.021065823840161348, 0.11284159215233278, -0.13464068334814114, -0.15278054581506662, 0.061047337489363585, 0.3727145241113541, -0.34556735047271453, -0.25045767784431966, 0.08170811637781883, -0.2270559416566458, -0.10887629419844022, 0.20889133538362387, -0.11389298590452... |
1,802.07398 | Investigating Rumor News Using Agreement-Aware Search | Recent years have witnessed a widespread increase of rumor news generated by
humans and machines. Therefore, tools for investigating rumor news have become
an urgent necessity. One useful function of such tools is to see ways a
specific topic or event is represented by presenting different points of view
from multipl... | cs.IR | recent years have witnessed a widespread increase of rumor news generated by humans and machines therefore tools for investigating rumor news have become an urgent necessity one useful function of such tools is to see ways a specific topic or event is represented by presenting different points of view from multiple sou... | [['recent', 'years', 'have', 'witnessed', 'a', 'widespread', 'increase', 'of', 'rumor', 'news', 'generated', 'by', 'humans', 'and', 'machines', 'therefore', 'tools', 'for', 'investigating', 'rumor', 'news', 'have', 'become', 'an', 'urgent', 'necessity', 'one', 'useful', 'function', 'of', 'such', 'tools', 'is', 'to', 's... | [-0.0676216095592381, 0.038831634110195724, -0.04857627120042781, 0.10644919614020165, -0.12134971024923062, -0.15170944594047323, 0.08532634134455606, 0.3997421409025717, -0.2635945389802015, -0.34892638422477473, 0.06949083079387874, -0.34475360202500555, -0.15732461129511266, 0.19689813100857634, -0.0964139814661141... |
1,802.07399 | Arbitrary helicity control of circularly polarized light from
lateral-type spin-polarized light-emitting diodes at room temperature | We demonstrate arbitrary helicity control of circularly polarized light (CPL)
emitted at room temperature from the cleaved side-facet of a lateral-type
spin-polarized light-emitting diode (spin-LED) with two ferromagnetic
electrodes in an anti-parallel magnetization configuration. Driving alternate
currents through t... | physics.optics physics.app-ph | we demonstrate arbitrary helicity control of circularly polarized light cpl emitted at room temperature from the cleaved sidefacet of a lateraltype spinpolarized lightemitting diode spinled with two ferromagnetic electrodes in an antiparallel magnetization configuration driving alternate currents through the two electr... | [['we', 'demonstrate', 'arbitrary', 'helicity', 'control', 'of', 'circularly', 'polarized', 'light', 'cpl', 'emitted', 'at', 'room', 'temperature', 'from', 'the', 'cleaved', 'sidefacet', 'of', 'a', 'lateraltype', 'spinpolarized', 'lightemitting', 'diode', 'spinled', 'with', 'two', 'ferromagnetic', 'electrodes', 'in', '... | [-0.1631274308213809, 0.19188960740226926, 0.00053580114520931, -0.07283827871075725, -0.051381347429317735, -0.20119728068918144, 0.06491002625261899, 0.4845347903125609, -0.23660330879404987, -0.3225439435336739, -0.0338446038828503, -0.2636717660643626, -0.017447088490977574, 0.27032973179787706, 0.03010806094001357... |
1,802.074 | Direct Learning to Rank and Rerank | Learning-to-rank techniques have proven to be extremely useful for
prioritization problems, where we rank items in order of their estimated
probabilities, and dedicate our limited resources to the top-ranked items. This
work exposes a serious problem with the state of learning-to-rank algorithms,
which is that they a... | stat.ML cs.IR cs.LG | learningtorank techniques have proven to be extremely useful for prioritization problems where we rank items in order of their estimated probabilities and dedicate our limited resources to the topranked items this work exposes a serious problem with the state of learningtorank algorithms which is that they are based on... | [['learningtorank', 'techniques', 'have', 'proven', 'to', 'be', 'extremely', 'useful', 'for', 'prioritization', 'problems', 'where', 'we', 'rank', 'items', 'in', 'order', 'of', 'their', 'estimated', 'probabilities', 'and', 'dedicate', 'our', 'limited', 'resources', 'to', 'the', 'topranked', 'items', 'this', 'work', 'ex... | [-0.04281329255802243, -0.023712067523274018, -0.12071823471047904, 0.1313899357102058, -0.12650225347619545, -0.17045448591744297, 0.1321248230942933, 0.3920101766275723, -0.2666397075106003, -0.3080948871152287, 0.1466164263998671, -0.2645141786916621, -0.1568186270345128, 0.18747112072292674, -0.12707170599213477, 0... |
1,802.07401 | A Study into the similarity in generator and discriminator in GAN
architecture | One popular generative model that has high-quality results is the Generative
Adversarial Networks(GAN). This type of architecture consists of two separate
networks that play against each other. The generator creates an output from the
input noise that is given to it. The discriminator has the task of determining
if t... | cs.LG stat.ML | one popular generative model that has highquality results is the generative adversarial networksgan this type of architecture consists of two separate networks that play against each other the generator creates an output from the input noise that is given to it the discriminator has the task of determining if the input... | [['one', 'popular', 'generative', 'model', 'that', 'has', 'highquality', 'results', 'is', 'the', 'generative', 'adversarial', 'networksgan', 'this', 'type', 'of', 'architecture', 'consists', 'of', 'two', 'separate', 'networks', 'that', 'play', 'against', 'each', 'other', 'the', 'generator', 'creates', 'an', 'output', '... | [-0.07183707046881319, 0.030066486858879218, -0.08642077568918466, 0.050628489077091214, -0.08715045095607639, -0.16611017560213803, -0.00042599283996969464, 0.4223242536485195, -0.27935065603256226, -0.31109156524483117, 0.030563758507370947, -0.2886141850948334, -0.22581353628076614, 0.16038419892266392, -0.092057559... |
1,802.07402 | Microwave device characterisation using a widefield diamond microscope | Devices relying on microwave circuitry form a cornerstone of many classical
and emerging quantum technologies. A capability to provide in-situ, noninvasive
and direct imaging of the microwave fields above such devices would be a
powerful tool for their function and failure analysis. In this work, we build
on recent a... | quant-ph cond-mat.mes-hall physics.app-ph | devices relying on microwave circuitry form a cornerstone of many classical and emerging quantum technologies a capability to provide insitu noninvasive and direct imaging of the microwave fields above such devices would be a powerful tool for their function and failure analysis in this work we build on recent achievem... | [['devices', 'relying', 'on', 'microwave', 'circuitry', 'form', 'a', 'cornerstone', 'of', 'many', 'classical', 'and', 'emerging', 'quantum', 'technologies', 'a', 'capability', 'to', 'provide', 'insitu', 'noninvasive', 'and', 'direct', 'imaging', 'of', 'the', 'microwave', 'fields', 'above', 'such', 'devices', 'would', '... | [-0.11784762581673396, 0.09898290517936831, -0.02928678468314876, -0.04289818276575876, -0.07344296667724848, -0.13222336118034198, 0.07595500552869293, 0.4304523369954789, -0.23565427164944328, -0.3532060517224154, 0.08282992222024511, -0.2562957266174421, -0.12430332734605626, 0.3137336355250548, -0.03813311284038184... |
1,802.07403 | Stability conditions for restrictions of vector bundles on projective
surfaces | Using Bridgeland stability conditions we give sufficient criteria for a
stable vector bundle on a surface to remain stable when restricted to a curve.
We give a stronger criterion when the vector bundle is a general vector bundle
on the plane. As an application, we compute the cohomology of such bundles for
curves th... | math.AG | using bridgeland stability conditions we give sufficient criteria for a stable vector bundle on a surface to remain stable when restricted to a curve we give a stronger criterion when the vector bundle is a general vector bundle on the plane as an application we compute the cohomology of such bundles for curves that li... | [['using', 'bridgeland', 'stability', 'conditions', 'we', 'give', 'sufficient', 'criteria', 'for', 'a', 'stable', 'vector', 'bundle', 'on', 'a', 'surface', 'to', 'remain', 'stable', 'when', 'restricted', 'to', 'a', 'curve', 'we', 'give', 'a', 'stronger', 'criterion', 'when', 'the', 'vector', 'bundle', 'is', 'a', 'gener... | [-0.22645801570146315, 0.04020119332750666, -0.11155416726345016, 0.1068129620999248, -0.14150798930260802, -0.1540336862521907, 0.05833881756951732, 0.39849735964690486, -0.262497027254393, -0.17570085622250073, 0.1597325928911056, -0.16158173361703032, -0.17203285652137693, 0.24507418965485187, -0.14641965504345153, ... |
1,802.07404 | Where and how is entropy generated in solar energy conversion systems? | The hotness of the sun and the coldness of the outer space are inexhaustible
thermodynamic resources for human beings. From a thermodynamic point of view,
any energy conversion systems that receive energy from the sun and/or dissipate
energy to the universe are heat engines with photons as the "working fluid" and
can... | physics.app-ph | the hotness of the sun and the coldness of the outer space are inexhaustible thermodynamic resources for human beings from a thermodynamic point of view any energy conversion systems that receive energy from the sun andor dissipate energy to the universe are heat engines with photons as the working fluid and can be ana... | [['the', 'hotness', 'of', 'the', 'sun', 'and', 'the', 'coldness', 'of', 'the', 'outer', 'space', 'are', 'inexhaustible', 'thermodynamic', 'resources', 'for', 'human', 'beings', 'from', 'a', 'thermodynamic', 'point', 'of', 'view', 'any', 'energy', 'conversion', 'systems', 'that', 'receive', 'energy', 'from', 'the', 'sun... | [-0.08093622922121237, 0.13685884568840265, -0.05743316112514419, 0.09572834473968084, -0.048763158110280834, -0.09669935735347238, 0.098226963335626, 0.3598801657213785, -0.26726904192141127, -0.3471965681495411, 0.07174998370852942, -0.27965308433243385, -0.09834288165549793, 0.2386969120008871, -0.05933725393288547,... |
1,802.07405 | Extracting the multi-timescale activity patterns of online financial
markets | Online financial markets can be represented as complex systems where trading
dynamics can be captured and characterized at different resolutions and time
scales. In this work, we develop a methodology based on non-negative tensor
factorization (NTF) aimed at extracting and revealing the multi-timescale
trading dynami... | q-fin.TR | online financial markets can be represented as complex systems where trading dynamics can be captured and characterized at different resolutions and time scales in this work we develop a methodology based on nonnegative tensor factorization ntf aimed at extracting and revealing the multitimescale trading dynamics gover... | [['online', 'financial', 'markets', 'can', 'be', 'represented', 'as', 'complex', 'systems', 'where', 'trading', 'dynamics', 'can', 'be', 'captured', 'and', 'characterized', 'at', 'different', 'resolutions', 'and', 'time', 'scales', 'in', 'this', 'work', 'we', 'develop', 'a', 'methodology', 'based', 'on', 'nonnegative',... | [-0.0860084254037085, 0.07208450521643063, -0.13494394935846124, 0.11119317572981706, -0.07678554975746633, -0.1071527440783453, 0.0737111544258867, 0.4151522501791215, -0.29023082023295127, -0.31642723455387234, 0.17692622100003064, -0.2937688369061543, -0.2394145345506705, 0.18562573330374818, -0.10545443712689033, -... |
1,802.07406 | Differential Bandpass Filters Based on Dumbbell-Shaped Defected Ground
Resonators | This letter presents a dumbbell-shaped defected ground resonator and its
application in the design of differential filters. The operation principle of
the dumbbell-shaped resonator (DSR) coupled to differential microstrip lines is
studied through a circuit model analysis. The proposed circuit model is
validated throu... | eess.SP | this letter presents a dumbbellshaped defected ground resonator and its application in the design of differential filters the operation principle of the dumbbellshaped resonator dsr coupled to differential microstrip lines is studied through a circuit model analysis the proposed circuit model is validated through the c... | [['this', 'letter', 'presents', 'a', 'dumbbellshaped', 'defected', 'ground', 'resonator', 'and', 'its', 'application', 'in', 'the', 'design', 'of', 'differential', 'filters', 'the', 'operation', 'principle', 'of', 'the', 'dumbbellshaped', 'resonator', 'dsr', 'coupled', 'to', 'differential', 'microstrip', 'lines', 'is',... | [-0.14072464122772985, 0.00585599247001342, -0.04466006200287741, -0.0248280250930621, -0.07389516930681528, -0.22176859930119255, -0.002210566829217924, 0.4538968559738594, -0.19508765998402053, -0.3200321141438386, 0.07189747742881288, -0.24427822097348645, -0.18360467850153825, 0.21520275952409684, -0.05295678854622... |
1,802.07407 | Third-Party Data Providers Ruin Simple Mechanisms | Motivated by the growing prominence of third-party data providers in online
marketplaces, this paper studies the impact of the presence of third-party data
providers on mechanism design. When no data provider is present, it has been
shown that simple mechanisms are "good enough" -- they can achieve a constant
fractio... | cs.GT | motivated by the growing prominence of thirdparty data providers in online marketplaces this paper studies the impact of the presence of thirdparty data providers on mechanism design when no data provider is present it has been shown that simple mechanisms are good enough they can achieve a constant fraction of the rev... | [['motivated', 'by', 'the', 'growing', 'prominence', 'of', 'thirdparty', 'data', 'providers', 'in', 'online', 'marketplaces', 'this', 'paper', 'studies', 'the', 'impact', 'of', 'the', 'presence', 'of', 'thirdparty', 'data', 'providers', 'on', 'mechanism', 'design', 'when', 'no', 'data', 'provider', 'is', 'present', 'it... | [-0.12356407630220143, 0.014570004643408905, -0.06572716693205873, 0.07236888578616328, -0.10895728472698953, -0.18929627710000171, 0.16400498793607451, 0.4084641647604655, -0.2688583706378797, -0.2964908047535505, 0.10567844860027738, -0.2896706999843599, -0.11470473630729836, 0.1582553958905065, -0.10726643014948448,... |
1,802.07408 | Physics and Human-Based Information Fusion for Improved Resident Space
Object Tracking | Maintaining a catalog of Resident Space Objects (RSOs) can be cast in a
typical Bayesian multi-object estimation problem, where the various sources of
uncertainty in the problem - the orbital mechanics, the kinematic states of the
identified objects, the data sources, etc. - are modeled as random variables
with assoc... | stat.AP | maintaining a catalog of resident space objects rsos can be cast in a typical bayesian multiobject estimation problem where the various sources of uncertainty in the problem the orbital mechanics the kinematic states of the identified objects the data sources etc are modeled as random variables with associated probabil... | [['maintaining', 'a', 'catalog', 'of', 'resident', 'space', 'objects', 'rsos', 'can', 'be', 'cast', 'in', 'a', 'typical', 'bayesian', 'multiobject', 'estimation', 'problem', 'where', 'the', 'various', 'sources', 'of', 'uncertainty', 'in', 'the', 'problem', 'the', 'orbital', 'mechanics', 'the', 'kinematic', 'states', 'o... | [-0.09788510849133931, 0.05413481896477086, -0.07857947348550494, 0.09291495237571543, -0.12472528763824985, -0.11050023419250335, 0.06902650301178385, 0.41075045928536424, -0.26344635921219983, -0.3554813468030521, 0.14878396708629138, -0.2813496144133664, -0.09796240826447805, 0.18758273746685258, -0.1171559360388311... |
1,802.07409 | Metastable state en route to traveling-wave synchronization state | The Kuramoto model with mixed signs of couplings is known to produce a
traveling-wave synchronized state. Here, we consider an abrupt synchronization
transition from the incoherent state to the traveling-wave state through a
long-lasting metastable state with large fluctuations. Our explanation of the
metastability i... | cond-mat.stat-mech cond-mat.dis-nn nlin.CD physics.bio-ph | the kuramoto model with mixed signs of couplings is known to produce a travelingwave synchronized state here we consider an abrupt synchronization transition from the incoherent state to the travelingwave state through a longlasting metastable state with large fluctuations our explanation of the metastability is that t... | [['the', 'kuramoto', 'model', 'with', 'mixed', 'signs', 'of', 'couplings', 'is', 'known', 'to', 'produce', 'a', 'travelingwave', 'synchronized', 'state', 'here', 'we', 'consider', 'an', 'abrupt', 'synchronization', 'transition', 'from', 'the', 'incoherent', 'state', 'to', 'the', 'travelingwave', 'state', 'through', 'a'... | [-0.19940938819515502, 0.2294896891138613, -0.09227692794648662, 0.024954103807338746, -0.03441576034785643, -0.12063174860520383, 0.09896666634733141, 0.3471833993207221, -0.2970202934170552, -0.2534366299998078, 0.11617904594089142, -0.25712309165273683, -0.18203252224819894, 0.11461143116506164, -0.0290989203092946,... |
1,802.0741 | Reduced Transmission in Multi-Server Coded Caching | Coded caching has been widely used in the wireless network for shifting the
some transmissions during the peak traffic times to the off-peak traffic times.
Multi-server coded caching, which can share responsibility for the total amount
of transmission in the wireless network during the peak traffic times by means
of ... | cs.IT math.IT | coded caching has been widely used in the wireless network for shifting the some transmissions during the peak traffic times to the offpeak traffic times multiserver coded caching which can share responsibility for the total amount of transmission in the wireless network during the peak traffic times by means of the co... | [['coded', 'caching', 'has', 'been', 'widely', 'used', 'in', 'the', 'wireless', 'network', 'for', 'shifting', 'the', 'some', 'transmissions', 'during', 'the', 'peak', 'traffic', 'times', 'to', 'the', 'offpeak', 'traffic', 'times', 'multiserver', 'coded', 'caching', 'which', 'can', 'share', 'responsibility', 'for', 'the... | [-0.2278245835130395, 0.06470439308313357, -0.028780170609814307, -0.0022690607957489227, -0.027103614439871512, -0.24098990319454866, 0.14852395501341406, 0.38268467249735344, -0.2562562050429647, -0.3238340330311264, 0.1016776215039053, -0.31166734811322727, -0.0704360850817603, 0.13305972719879136, -0.14767386056351... |
1,802.07411 | Design of Chern Insulating Phases in Honeycomb Lattices | The search for robust examples of the magnetic version of topological
insulators, referred to as quantum anomalous Hall insulators or simply Chern
insulators, so far lacks success. Our groups have explored two distinct
possibilities based on multiorbital 3d oxide honeycomb lattices. Each has a
Chern insulating phase ... | cond-mat.mtrl-sci cond-mat.str-el | the search for robust examples of the magnetic version of topological insulators referred to as quantum anomalous hall insulators or simply chern insulators so far lacks success our groups have explored two distinct possibilities based on multiorbital 3d oxide honeycomb lattices each has a chern insulating phase near t... | [['the', 'search', 'for', 'robust', 'examples', 'of', 'the', 'magnetic', 'version', 'of', 'topological', 'insulators', 'referred', 'to', 'as', 'quantum', 'anomalous', 'hall', 'insulators', 'or', 'simply', 'chern', 'insulators', 'so', 'far', 'lacks', 'success', 'our', 'groups', 'have', 'explored', 'two', 'distinct', 'po... | [-0.17276268871707132, 0.22744680154837865, -0.003816749263900967, 0.06005907441400606, -0.09587387112523038, -0.24867136832903577, 0.080311472526395, 0.402744463438877, -0.20478121818463624, -0.3202766648501949, 0.05955761392802758, -0.30588980432830554, -0.18025882099961152, 0.13756399818663115, -0.01577130283550483,... |
1,802.07412 | Density-aware Single Image De-raining using a Multi-stream Dense Network | Single image rain streak removal is an extremely challenging problem due to
the presence of non-uniform rain densities in images. We present a novel
density-aware multi-stream densely connected convolutional neural network-based
algorithm, called DID-MDN, for joint rain density estimation and de-raining.
The proposed... | cs.CV | single image rain streak removal is an extremely challenging problem due to the presence of nonuniform rain densities in images we present a novel densityaware multistream densely connected convolutional neural networkbased algorithm called didmdn for joint rain density estimation and deraining the proposed method enab... | [['single', 'image', 'rain', 'streak', 'removal', 'is', 'an', 'extremely', 'challenging', 'problem', 'due', 'to', 'the', 'presence', 'of', 'nonuniform', 'rain', 'densities', 'in', 'images', 'we', 'present', 'a', 'novel', 'densityaware', 'multistream', 'densely', 'connected', 'convolutional', 'neural', 'networkbased', '... | [-0.03117034825636378, 0.018585529654123974, -0.06751450738607863, 0.05077023751154128, -0.06556776504251449, -0.12537365326706587, -0.01575957413525412, 0.44819536091747625, -0.26956420078313625, -0.33436923699903914, 0.06280016925968109, -0.2518225847652145, -0.21039472379739962, 0.19292236947655386, -0.1337911574644... |
1,802.07413 | Dysprosium-doped ZBLAN fiber laser tunable from 2.8 {\mu}m to 3.4
{\mu}m, pumped at 1.7 {\mu}m | We demonstrate a mid-infrared dysprosium-doped fluoride fiber laser with a
continuously tunable output range of 573 nm, pumped by a 1.7 {\mu}m Raman fiber
laser. To the best of our knowledge, this represents the largest tuning range
achieved to date from any rare-earth-doped fiber laser and, critically, spans
the 2.8... | physics.optics | we demonstrate a midinfrared dysprosiumdoped fluoride fiber laser with a continuously tunable output range of 573 nm pumped by a 17 mum raman fiber laser to the best of our knowledge this represents the largest tuning range achieved to date from any rareearthdoped fiber laser and critically spans the 2834 mum spectral ... | [['we', 'demonstrate', 'a', 'midinfrared', 'dysprosiumdoped', 'fluoride', 'fiber', 'laser', 'with', 'a', 'continuously', 'tunable', 'output', 'range', 'of', '573', 'nm', 'pumped', 'by', 'a', '17', 'mum', 'raman', 'fiber', 'laser', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'represents', 'the', 'largest', 't... | [-0.08086643561872901, 0.12592862330897406, 0.00870398858239, -0.08168298453662773, -0.010661166503417249, -0.15430373829618402, 0.09434143237161394, 0.5256025868525006, -0.2107161260970241, -0.3348250591899363, 0.0140353325393279, -0.2875262583149787, -0.030842453179576873, 0.25386488317911116, -0.02534043772546432, 0... |
1,802.07414 | Tunable Lifshitz Transitions and Multiband Transport in Tetralayer
Graphene | As the Fermi level and band structure of two-dimensional materials are
readily tunable, they constitute an ideal platform for exploring Lifshitz
transition, a change in the topology of a material's Fermi surface. Using
tetralayer graphene that host two intersecting massive Dirac bands, we
demonstrate multiple Lifshit... | cond-mat.mes-hall | as the fermi level and band structure of twodimensional materials are readily tunable they constitute an ideal platform for exploring lifshitz transition a change in the topology of a materials fermi surface using tetralayer graphene that host two intersecting massive dirac bands we demonstrate multiple lifshitz transi... | [['as', 'the', 'fermi', 'level', 'and', 'band', 'structure', 'of', 'twodimensional', 'materials', 'are', 'readily', 'tunable', 'they', 'constitute', 'an', 'ideal', 'platform', 'for', 'exploring', 'lifshitz', 'transition', 'a', 'change', 'in', 'the', 'topology', 'of', 'a', 'materials', 'fermi', 'surface', 'using', 'tetr... | [-0.22262646764799765, 0.2317965570573851, -0.03812418599860578, 0.0280480023497079, -0.04540962883848933, -0.22716583226088294, 0.09359915393899797, 0.3704380885804001, -0.24314604321188188, -0.32209139369145223, -0.043642452612955455, -0.3351064119723779, -0.20012973551343702, 0.16420492360109015, 0.08230165394518195... |
1,802.07415 | Stationary distribution of a 2-island 2-allele Wright-Fisher diffusion
model with slow mutation and migration rates | The stationary distribution of the diffusion limit of the 2-island, 2-allele
Wright-Fisher with small but otherwise arbitrary mutation and migration rates
is investigated. Following a method developed by Burden and Tang (2016, 2017)
for approximating the forward Kolmogorov equation, the stationary distribution
is obt... | q-bio.PE | the stationary distribution of the diffusion limit of the 2island 2allele wrightfisher with small but otherwise arbitrary mutation and migration rates is investigated following a method developed by burden and tang 2016 2017 for approximating the forward kolmogorov equation the stationary distribution is obtained to le... | [['the', 'stationary', 'distribution', 'of', 'the', 'diffusion', 'limit', 'of', 'the', '2island', '2allele', 'wrightfisher', 'with', 'small', 'but', 'otherwise', 'arbitrary', 'mutation', 'and', 'migration', 'rates', 'is', 'investigated', 'following', 'a', 'method', 'developed', 'by', 'burden', 'and', 'tang', '2016', '2... | [-0.05571784769223693, 0.10793593549363625, -0.05634622162130351, 0.08060221946992291, -0.01632238905876875, -0.10569225728007343, 0.09942749328135202, 0.3291235240952422, -0.22120671098430952, -0.2839699073539426, 0.13261174803289275, -0.29674668348549554, -0.05546766489666576, 0.17722460133954882, -0.0074916323918538... |
1,802.07416 | Angle constrained path to cluster multiple manifolds | In this paper, we propose a method to cluster multiple intersected manifolds.
The algorithm chooses several landmark nodes randomly and then checks whether
there is an angle constrained path between each landmark node and every other
node in the neighborhood graph. When the points lie on different manifolds with
inte... | cs.CV | in this paper we propose a method to cluster multiple intersected manifolds the algorithm chooses several landmark nodes randomly and then checks whether there is an angle constrained path between each landmark node and every other node in the neighborhood graph when the points lie on different manifolds with intersect... | [['in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'to', 'cluster', 'multiple', 'intersected', 'manifolds', 'the', 'algorithm', 'chooses', 'several', 'landmark', 'nodes', 'randomly', 'and', 'then', 'checks', 'whether', 'there', 'is', 'an', 'angle', 'constrained', 'path', 'between', 'each', 'landmark', 'node', 'an... | [-0.09212363234185961, 0.007719734952191704, -0.09289555440642941, 0.057239180197070506, -0.11560342383376364, -0.204261891700244, 0.06977924839471843, 0.4318795139665034, -0.2810129290029629, -0.2941115114893486, 0.10700169555780326, -0.2837698787256186, -0.17691082501811767, 0.2110829759222358, -0.12670994782125328, ... |
1,802.07417 | Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient
Algorithms | Mixture-of-Experts (MoE) is a widely popular model for ensemble learning and
is a basic building block of highly successful modern neural networks as well
as a component in Gated Recurrent Units (GRU) and Attention networks. However,
present algorithms for learning MoE including the EM algorithm, and gradient
descent... | cs.LG | mixtureofexperts moe is a widely popular model for ensemble learning and is a basic building block of highly successful modern neural networks as well as a component in gated recurrent units gru and attention networks however present algorithms for learning moe including the em algorithm and gradient descent are known ... | [['mixtureofexperts', 'moe', 'is', 'a', 'widely', 'popular', 'model', 'for', 'ensemble', 'learning', 'and', 'is', 'a', 'basic', 'building', 'block', 'of', 'highly', 'successful', 'modern', 'neural', 'networks', 'as', 'well', 'as', 'a', 'component', 'in', 'gated', 'recurrent', 'units', 'gru', 'and', 'attention', 'networ... | [-0.04152020042058884, 0.017668860459080407, -0.06335734956595859, 0.08621925611014916, -0.0965457712799804, -0.19526283977208786, 0.04769477823517417, 0.4385724641535788, -0.29591838121159025, -0.33063716166381635, 0.10546578456473336, -0.21010982502064748, -0.21485311711062444, 0.19146228135674, -0.09983806297997412,... |
1,802.07418 | Limits for Partial Maxima of Gaussian Random Vectors | We obtain almost sure limit theorems for partial maxima of norms of a
sequence of Banach-valued Gaussian random variables.
| math.PR | we obtain almost sure limit theorems for partial maxima of norms of a sequence of banachvalued gaussian random variables | [['we', 'obtain', 'almost', 'sure', 'limit', 'theorems', 'for', 'partial', 'maxima', 'of', 'norms', 'of', 'a', 'sequence', 'of', 'banachvalued', 'gaussian', 'random', 'variables']] | [-0.12956351806458674, 0.10514006033343704, -0.14347497417934632, 0.14308583559958557, 0.05490426988782067, -0.05573095489097269, 0.14198650675213062, 0.36830900413425344, -0.2749853706673572, -0.11608362491977842, 0.20223439036329327, -0.28133089232601616, -0.12395267443437326, 0.14424759776968704, -0.1022101588498212... |
1,802.07419 | Approximate low-weight check codes and circuit lower bounds for noisy
ground states | The No Low-Energy Trivial States (NLTS) conjecture of Freedman and Hastings
(Quantum Information and Computation 2014), which asserts the existence of
local Hamiltonians whose low energy states cannot be generated by constant
depth quantum circuits, identifies a fundamental obstacle to resolving the
quantum PCP conje... | quant-ph | the no lowenergy trivial states nlts conjecture of freedman and hastings quantum information and computation 2014 which asserts the existence of local hamiltonians whose low energy states cannot be generated by constant depth quantum circuits identifies a fundamental obstacle to resolving the quantum pcp conjecture pro... | [['the', 'no', 'lowenergy', 'trivial', 'states', 'nlts', 'conjecture', 'of', 'freedman', 'and', 'hastings', 'quantum', 'information', 'and', 'computation', '2014', 'which', 'asserts', 'the', 'existence', 'of', 'local', 'hamiltonians', 'whose', 'low', 'energy', 'states', 'can', 'not', 'be', 'generated', 'by', 'constant'... | [-0.1456031598131969, 0.1062188470358638, -0.08399511786789415, 0.06979822664890123, -0.02488580315416171, -0.22452959851631202, 0.07807950862329299, 0.2872883101217141, -0.2586884359282649, -0.32344492103073225, 0.0929287691323533, -0.23223369255034668, -0.12705675418265472, 0.21586130859093616, -0.12598876123882458, ... |
1,802.0742 | Sequence-based Multi-lingual Low Resource Speech Recognition | Techniques for multi-lingual and cross-lingual speech recognition can help in
low resource scenarios, to bootstrap systems and enable analysis of new
languages and domains. End-to-end approaches, in particular sequence-based
techniques, are attractive because of their simplicity and elegance. While it
is possible to ... | cs.CL cs.SD eess.AS | techniques for multilingual and crosslingual speech recognition can help in low resource scenarios to bootstrap systems and enable analysis of new languages and domains endtoend approaches in particular sequencebased techniques are attractive because of their simplicity and elegance while it is possible to integrate tr... | [['techniques', 'for', 'multilingual', 'and', 'crosslingual', 'speech', 'recognition', 'can', 'help', 'in', 'low', 'resource', 'scenarios', 'to', 'bootstrap', 'systems', 'and', 'enable', 'analysis', 'of', 'new', 'languages', 'and', 'domains', 'endtoend', 'approaches', 'in', 'particular', 'sequencebased', 'techniques', ... | [-0.04403787450396321, 0.002547529014358268, -0.03143426245839903, 0.13638324250610628, -0.10095321638919648, -0.21908959845350412, 0.05456191323237763, 0.4792873276948179, -0.26280989788425796, -0.3374445238051813, 0.0644933278935979, -0.23612503083598502, -0.14364753385900325, 0.2681353042318058, -0.16527333755760729... |
1,802.07421 | Conditional Adversarial Synthesis of 3D Facial Action Units | Employing deep learning-based approaches for fine-grained facial expression
analysis, such as those involving the estimation of Action Unit (AU)
intensities, is difficult due to the lack of a large-scale dataset of real
faces with sufficiently diverse AU labels for training. In this paper, we
consider how AU-level fa... | cs.CV | employing deep learningbased approaches for finegrained facial expression analysis such as those involving the estimation of action unit au intensities is difficult due to the lack of a largescale dataset of real faces with sufficiently diverse au labels for training in this paper we consider how aulevel facial image s... | [['employing', 'deep', 'learningbased', 'approaches', 'for', 'finegrained', 'facial', 'expression', 'analysis', 'such', 'as', 'those', 'involving', 'the', 'estimation', 'of', 'action', 'unit', 'au', 'intensities', 'is', 'difficult', 'due', 'to', 'the', 'lack', 'of', 'a', 'largescale', 'dataset', 'of', 'real', 'faces', ... | [0.024567903423994262, -0.061760102786898134, -0.037175349285531366, 0.036915816063845315, -0.09832748748020187, -0.1822588274939151, -0.01162789665277505, 0.46073562621221514, -0.2498022712342724, -0.3757613301630827, 0.04254401203825527, -0.2932637784423018, -0.21367460511671968, 0.19604605250797363, -0.1764499545215... |
1,802.07422 | Blockchain: Data Malls, Coin Economies and Keyless Payments | We discuss several uses of blockchain (and, more generally, distributed
ledger) technologies outside of cryptocurrencies with a pragmatic view. We
mostly focus on three areas: the role of coin economies for what we refer to as
data malls (specialized data marketplaces); data provenance (a historical
record of data an... | q-fin.GN cs.CR q-fin.EC | we discuss several uses of blockchain and more generally distributed ledger technologies outside of cryptocurrencies with a pragmatic view we mostly focus on three areas the role of coin economies for what we refer to as data malls specialized data marketplaces data provenance a historical record of data and its origin... | [['we', 'discuss', 'several', 'uses', 'of', 'blockchain', 'and', 'more', 'generally', 'distributed', 'ledger', 'technologies', 'outside', 'of', 'cryptocurrencies', 'with', 'a', 'pragmatic', 'view', 'we', 'mostly', 'focus', 'on', 'three', 'areas', 'the', 'role', 'of', 'coin', 'economies', 'for', 'what', 'we', 'refer', '... | [-0.14323624623350306, 0.03160350683358419, -0.05509417000260339, 0.12848000818616653, -0.17039823151720934, -0.19766187693654413, 0.1500872449433229, 0.4006879952433239, -0.2676446250000273, -0.31676588209376794, 0.1758822210929749, -0.35872752703053046, -0.10560844262433519, 0.20381644291870565, -0.16717328295582928,... |
1,802.07423 | Calabi-Yau algebras and the shifted noncommutative symplectic structure | In this paper we show that for a Koszul Calabi-Yau algebra, there is a
shifted bi-symplectic structure in the sense of
Crawley-Boevey-Etingof-Ginzburg, on the cobar construction of its co-unitalized
Koszul dual coalgebra, and hence its DG representation schemes, in the sense of
Berest-Khachatryan-Ramadoss, have a shi... | math.RA | in this paper we show that for a koszul calabiyau algebra there is a shifted bisymplectic structure in the sense of crawleyboeveyetingofginzburg on the cobar construction of its counitalized koszul dual coalgebra and hence its dg representation schemes in the sense of berestkhachatryanramadoss have a shifted symplectic... | [['in', 'this', 'paper', 'we', 'show', 'that', 'for', 'a', 'koszul', 'calabiyau', 'algebra', 'there', 'is', 'a', 'shifted', 'bisymplectic', 'structure', 'in', 'the', 'sense', 'of', 'crawleyboeveyetingofginzburg', 'on', 'the', 'cobar', 'construction', 'of', 'its', 'counitalized', 'koszul', 'dual', 'coalgebra', 'and', 'h... | [-0.16857329208403826, -0.022426038086414336, -0.13618159551173448, 0.06488149512559176, -0.0973765478655696, -0.10057217418216169, -0.019378389751072974, 0.4001073598861694, -0.403532828502357, -0.1457731518894434, 0.09393337937537581, -0.13896541394293307, -0.2249400826357305, 0.14209383441135287, -0.2190382919646799... |
1,802.07424 | On the vibron-polaron damping in quasi 1D macromolecular chains | The properties of the intramolecular vibrational excitation (vibron) in a
quasi 1D macromolecular structure are studied. It is supposed that due to the
vibron interaction with optical phonon modes, a vibron might form partially
dressed small polaron states. The properties of these states are investigated
in dependenc... | cond-mat.mes-hall cond-mat.soft cond-mat.stat-mech hep-th | the properties of the intramolecular vibrational excitation vibron in a quasi 1d macromolecular structure are studied it is supposed that due to the vibron interaction with optical phonon modes a vibron might form partially dressed small polaron states the properties of these states are investigated in dependence on th... | [['the', 'properties', 'of', 'the', 'intramolecular', 'vibrational', 'excitation', 'vibron', 'in', 'a', 'quasi', '1d', 'macromolecular', 'structure', 'are', 'studied', 'it', 'is', 'supposed', 'that', 'due', 'to', 'the', 'vibron', 'interaction', 'with', 'optical', 'phonon', 'modes', 'a', 'vibron', 'might', 'form', 'part... | [-0.1830023617086032, 0.2577475960355964, -0.05463554722706923, 0.07661351494519632, -0.011602624424136756, -0.12669223563724688, 0.04321161250510577, 0.38166073106982734, -0.27023260048433634, -0.21960190386417205, 0.00605031808058658, -0.25632171698040174, -0.11821236597960082, 0.1600822378996383, 0.09500420289218761... |
1,802.07425 | Inapproximability of Matrix $p\rightarrow q$ Norms | We study the problem of computing the $p\rightarrow q$ norm of a matrix $A
\in R^{m \times n}$, defined as \[ \|A\|_{p\rightarrow q} ~:=~ \max_{x \,\in\,
R^n \setminus \{0\}} \frac{\|Ax\|_q}{\|x\|_p} \] This problem generalizes the
spectral norm of a matrix ($p=q=2$) and the Grothendieck problem ($p=\infty$,
$q=1$), ... | cs.CC | we study the problem of computing the prightarrow q norm of a matrix a in rm times n defined as a_prightarrow q max_x in rn setminus 0 fracax_qx_p this problem generalizes the spectral norm of a matrix pq2 and the grothendieck problem pinfty q1 and has been widely studied in various regimes when p geq q the problem exh... | [['we', 'study', 'the', 'problem', 'of', 'computing', 'the', 'prightarrow', 'q', 'norm', 'of', 'a', 'matrix', 'a', 'in', 'rm', 'times', 'n', 'defined', 'as', 'a_prightarrow', 'q', 'max_x', 'in', 'rn', 'setminus', '0', 'fracax_qx_p', 'this', 'problem', 'generalizes', 'the', 'spectral', 'norm', 'of', 'a', 'matrix', 'pq2'... | [-0.13227214795273645, 0.09326798349074499, -0.05410631313091418, 0.08574381356319304, -0.0045586051641936035, -0.20016465892138727, 0.022350225739715183, 0.34697533755816573, -0.30083000061773313, -0.2820958593048785, 0.05988868458542343, -0.26671470141017756, -0.1212365792316097, 0.17525619367348982, -0.0645067233083... |
1,802.07426 | Generalization in Machine Learning via Analytical Learning Theory | This paper introduces a novel measure-theoretic theory for machine learning
that does not require statistical assumptions. Based on this theory, a new
regularization method in deep learning is derived and shown to outperform
previous methods in CIFAR-10, CIFAR-100, and SVHN. Moreover, the proposed
theory provides a t... | stat.ML cs.AI cs.LG cs.NE | this paper introduces a novel measuretheoretic theory for machine learning that does not require statistical assumptions based on this theory a new regularization method in deep learning is derived and shown to outperform previous methods in cifar10 cifar100 and svhn moreover the proposed theory provides a theoretical ... | [['this', 'paper', 'introduces', 'a', 'novel', 'measuretheoretic', 'theory', 'for', 'machine', 'learning', 'that', 'does', 'not', 'require', 'statistical', 'assumptions', 'based', 'on', 'this', 'theory', 'a', 'new', 'regularization', 'method', 'in', 'deep', 'learning', 'is', 'derived', 'and', 'shown', 'to', 'outperform... | [0.03141027646656227, -0.021000531601711666, -0.1635113092498475, 0.09282754272739482, -0.12340494605191683, -0.20364222366962645, 0.057029300872473265, 0.3974259578922795, -0.2742342562809334, -0.30917406064789676, 0.03349154645486309, -0.23673896208184503, -0.25363309799014766, 0.257565118396118, -0.1693576229262655,... |
1,802.07427 | Active Learning with Partial Feedback | While many active learning papers assume that the learner can simply ask for
a label and receive it, real annotation often presents a mismatch between the
form of a label (say, one among many classes), and the form of an annotation
(typically yes/no binary feedback). To annotate examples corpora for multiclass
classi... | cs.LG | while many active learning papers assume that the learner can simply ask for a label and receive it real annotation often presents a mismatch between the form of a label say one among many classes and the form of an annotation typically yesno binary feedback to annotate examples corpora for multiclass classification we... | [['while', 'many', 'active', 'learning', 'papers', 'assume', 'that', 'the', 'learner', 'can', 'simply', 'ask', 'for', 'a', 'label', 'and', 'receive', 'it', 'real', 'annotation', 'often', 'presents', 'a', 'mismatch', 'between', 'the', 'form', 'of', 'a', 'label', 'say', 'one', 'among', 'many', 'classes', 'and', 'the', 'f... | [-0.020724544304423033, 0.09475541258015437, 0.01320749663747847, 0.09928192869434133, -0.1884825939303264, -0.2544724315535277, 0.13078324713837355, 0.42166836334019897, -0.2825122043439187, -0.37206933420186394, 0.05328170083742589, -0.3196713991984725, -0.12051797215966507, 0.14927688431367278, -0.1422056566029787, ... |
1,802.07428 | Writing and Erasing of Temporal Kerr Cavity Solitons via Intensity
Modulation of the Cavity Driving Field | We experimentally and numerically study the use of intensity modulation for
the controlled addressing of temporal Kerr cavity solitons. Using a coherently
driven fiber ring resonator, we demonstrate that a single temporally broad
intensity modulation pulse applied on the cavity driving field permits
systematic and ef... | physics.optics | we experimentally and numerically study the use of intensity modulation for the controlled addressing of temporal kerr cavity solitons using a coherently driven fiber ring resonator we demonstrate that a single temporally broad intensity modulation pulse applied on the cavity driving field permits systematic and effici... | [['we', 'experimentally', 'and', 'numerically', 'study', 'the', 'use', 'of', 'intensity', 'modulation', 'for', 'the', 'controlled', 'addressing', 'of', 'temporal', 'kerr', 'cavity', 'solitons', 'using', 'a', 'coherently', 'driven', 'fiber', 'ring', 'resonator', 'we', 'demonstrate', 'that', 'a', 'single', 'temporally', ... | [-0.17915712892621136, 0.10607722786386521, -0.07840570142397131, 0.031192121609376792, -0.07213397863774727, -0.15945324664099667, 0.037439840130854204, 0.4879718369637162, -0.25608425783829236, -0.2250712941854428, 0.05247958298199452, -0.17731322353789344, -0.13161574434250212, 0.25060899341061044, 0.011469666307302... |
1,802.07429 | PABO: Mitigating Congestion via Packet Bounce in Data Center Networks | In today's data center, a diverse mix of throughput-sensitive long flows and
delay-sensitive short flows are commonly presented in shallow-buffered
switches. Long flows could potentially block the transmission of
delay-sensitive short flows, leading to degraded performance. Congestion can
also be caused by the synchr... | cs.NI | in todays data center a diverse mix of throughputsensitive long flows and delaysensitive short flows are commonly presented in shallowbuffered switches long flows could potentially block the transmission of delaysensitive short flows leading to degraded performance congestion can also be caused by the synchronization o... | [['in', 'todays', 'data', 'center', 'a', 'diverse', 'mix', 'of', 'throughputsensitive', 'long', 'flows', 'and', 'delaysensitive', 'short', 'flows', 'are', 'commonly', 'presented', 'in', 'shallowbuffered', 'switches', 'long', 'flows', 'could', 'potentially', 'block', 'the', 'transmission', 'of', 'delaysensitive', 'short... | [-0.23238976957332907, 0.07270410333294422, -0.03953884675760161, 0.04628633578999363, -0.08847394996728601, -0.2150100076006669, 0.07280824858003832, 0.4113755914805965, -0.3058415455687227, -0.3033126887470258, 0.1384572124447335, -0.23914391806800708, -0.16737869294134505, 0.19295699866206356, -0.15243454605736065, ... |
1,802.0743 | Extreme conditions in the molecular gas of lensed star-forming galaxies
at z~3 | Atomic Carbon can be an efficient tracer of the molecular gas mass, and when
combined to the detection of high-J and low-J CO lines it yields also a
sensitive probe of the power sources in the molecular gas of high redshift
galaxies. The recently installed SEPIA5 receiver at the focus of the APEX
telescope has opened... | astro-ph.GA astro-ph.CO | atomic carbon can be an efficient tracer of the molecular gas mass and when combined to the detection of highj and lowj co lines it yields also a sensitive probe of the power sources in the molecular gas of high redshift galaxies the recently installed sepia5 receiver at the focus of the apex telescope has opened up a ... | [['atomic', 'carbon', 'can', 'be', 'an', 'efficient', 'tracer', 'of', 'the', 'molecular', 'gas', 'mass', 'and', 'when', 'combined', 'to', 'the', 'detection', 'of', 'highj', 'and', 'lowj', 'co', 'lines', 'it', 'yields', 'also', 'a', 'sensitive', 'probe', 'of', 'the', 'power', 'sources', 'in', 'the', 'molecular', 'gas', ... | [-0.06098756924178237, 0.08808018657984265, 0.0070604049956880955, 0.048623254553528616, 0.0024531420560613753, -0.09816676137479631, 0.06905406958440723, 0.4313829551141898, -0.12978154358406838, -0.3213523825338703, 0.04851160126709817, -0.2959077226970139, 0.027173895584118944, 0.16905101886006235, 0.068809253900753... |
1,802.07431 | Monitoring spin coherence of single nitrogen-vacancy centers in
nanodiamonds during pH changes in aqueous buffer solutions | We report on sensing stability of nanodiamond (ND) quantum sensors in various
pH aqueous buffer solutions for the two detection schemes of quantum
decoherence spectroscopy and thermometry. The electron spin properties of
single nitrogen-vacancy (NV) centers in 25-nm-sized NDs have been characterized
by a spin-measure... | cond-mat.mes-hall quant-ph | we report on sensing stability of nanodiamond nd quantum sensors in various ph aqueous buffer solutions for the two detection schemes of quantum decoherence spectroscopy and thermometry the electron spin properties of single nitrogenvacancy nv centers in 25nmsized nds have been characterized by a spinmeasurement compat... | [['we', 'report', 'on', 'sensing', 'stability', 'of', 'nanodiamond', 'nd', 'quantum', 'sensors', 'in', 'various', 'ph', 'aqueous', 'buffer', 'solutions', 'for', 'the', 'two', 'detection', 'schemes', 'of', 'quantum', 'decoherence', 'spectroscopy', 'and', 'thermometry', 'the', 'electron', 'spin', 'properties', 'of', 'sin... | [-0.1134205861543951, 0.17702250507231937, -0.009231734674179206, -0.040372237855446164, 0.0819368337920058, -0.14842430516112134, 0.06037295428036719, 0.42099278635025894, -0.24649759843931907, -0.29963189921253464, 0.1302426577567796, -0.3068572634994222, -0.05342157406011855, 0.18088653609734437, -0.0521468611529273... |
1,802.07432 | Enhanced global signal of neutral hydrogen due to excess radiation at
cosmic dawn | We revisit the global 21cm signal calculation incorporating a possible radio
background at early times, and find that the global 21cm signal shows a much
stronger absorption feature, which could enhance detection prospects for future
21 cm experiments. In light of recent reports of a possible low-frequency
excess rad... | astro-ph.CO | we revisit the global 21cm signal calculation incorporating a possible radio background at early times and find that the global 21cm signal shows a much stronger absorption feature which could enhance detection prospects for future 21 cm experiments in light of recent reports of a possible lowfrequency excess radio bac... | [['we', 'revisit', 'the', 'global', '21cm', 'signal', 'calculation', 'incorporating', 'a', 'possible', 'radio', 'background', 'at', 'early', 'times', 'and', 'find', 'that', 'the', 'global', '21cm', 'signal', 'shows', 'a', 'much', 'stronger', 'absorption', 'feature', 'which', 'could', 'enhance', 'detection', 'prospects'... | [-0.1181583465076983, 0.07130368610160076, -0.03397913397202501, 0.07852283896500012, -0.10844856343464926, -0.09296214977803174, 0.03433725718059577, 0.398926546680741, -0.1380586056111497, -0.28311211922118673, 0.10773087292000127, -0.29897265848558163, -0.14358416536924778, 0.17578114643038134, 0.0626499661084381, 0... |
1,802.07433 | Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via
Pebbling | Pebble games were originally formulated to study time-space tradeoffs in
computation, modeled by games played on directed acyclic graphs (DAGs). Close
connections between pebbling and cryptography have been known for decades. A
series of recent research starting with (Alwen and Serbinenko, STOC 2015) has
deepened our... | cs.CR cs.CC | pebble games were originally formulated to study timespace tradeoffs in computation modeled by games played on directed acyclic graphs dags close connections between pebbling and cryptography have been known for decades a series of recent research starting with alwen and serbinenko stoc 2015 has deepened our understand... | [['pebble', 'games', 'were', 'originally', 'formulated', 'to', 'study', 'timespace', 'tradeoffs', 'in', 'computation', 'modeled', 'by', 'games', 'played', 'on', 'directed', 'acyclic', 'graphs', 'dags', 'close', 'connections', 'between', 'pebbling', 'and', 'cryptography', 'have', 'been', 'known', 'for', 'decades', 'a', ... | [-0.10796840610225329, 0.046767450801773774, -0.0868663517290791, 0.0959848618138452, -0.11790715407357195, -0.18066092074801965, 0.08812941081011057, 0.38572209994182793, -0.2743613382524534, -0.3540090326270139, 0.06576037053180621, -0.21579344268209746, -0.18743839946981794, 0.17316884588554474, -0.16262967132863906... |
1,802.07434 | Nonparametric Bayesian Sparse Graph Linear Dynamical Systems | A nonparametric Bayesian sparse graph linear dynamical system (SGLDS) is
proposed to model sequentially observed multivariate data. SGLDS uses the
Bernoulli-Poisson link together with a gamma process to generate an infinite
dimensional sparse random graph to model state transitions. Depending on the
sparsity pattern ... | stat.ML stat.ME | a nonparametric bayesian sparse graph linear dynamical system sglds is proposed to model sequentially observed multivariate data sglds uses the bernoullipoisson link together with a gamma process to generate an infinite dimensional sparse random graph to model state transitions depending on the sparsity pattern of the ... | [['a', 'nonparametric', 'bayesian', 'sparse', 'graph', 'linear', 'dynamical', 'system', 'sglds', 'is', 'proposed', 'to', 'model', 'sequentially', 'observed', 'multivariate', 'data', 'sglds', 'uses', 'the', 'bernoullipoisson', 'link', 'together', 'with', 'a', 'gamma', 'process', 'to', 'generate', 'an', 'infinite', 'dime... | [-0.07346480157167658, 0.12433617421085341, -0.0909396995914968, 0.045595698349715115, -0.08960036858989615, -0.1634872057676814, 0.048250904438767846, 0.3822502325193619, -0.3101180713095768, -0.28432137424522264, 0.1261836896232498, -0.2607077627816773, -0.1180163846079876, 0.11905855711505521, -0.03032925042991094, ... |
1,802.07435 | Playing with Repetitions in Data Words Using Energy Games | We introduce two-player games which build words over infinite alphabets, and
we study the problem of checking the existence of winning strategies. These
games are played by two players, who take turns in choosing valuations for
variables ranging over an infinite data domain, thus generating
multi-attributed data word... | cs.LO | we introduce twoplayer games which build words over infinite alphabets and we study the problem of checking the existence of winning strategies these games are played by two players who take turns in choosing valuations for variables ranging over an infinite data domain thus generating multiattributed data words the wi... | [['we', 'introduce', 'twoplayer', 'games', 'which', 'build', 'words', 'over', 'infinite', 'alphabets', 'and', 'we', 'study', 'the', 'problem', 'of', 'checking', 'the', 'existence', 'of', 'winning', 'strategies', 'these', 'games', 'are', 'played', 'by', 'two', 'players', 'who', 'take', 'turns', 'in', 'choosing', 'valuat... | [-0.11094571589570996, 0.0872324929210039, -0.09066605138039027, 0.12290705450425815, -0.09239660961112538, -0.20135185705803801, 0.12175688005371946, 0.39418069971050473, -0.2928613767045852, -0.3038340082756527, 0.11247363274777533, -0.28326453308682836, -0.0876393700265978, 0.15030351795305627, -0.14425628093499543,... |
1,802.07436 | Time-resolved optical emission spectroscopic studies of picosecond laser
produced Cr plasma | Time-resolved optical emission spectroscopic measurements of a plasma
generated by irradiating a Cr target using 60 picosecond (ps) and 300 ps laser
pulses is carried out to investigate the variation in the linewidth
($\delta\lambda$) of emission from neutrals and ions for increasing ambient
pressures. Measurements r... | physics.plasm-ph | timeresolved optical emission spectroscopic measurements of a plasma generated by irradiating a cr target using 60 picosecond ps and 300 ps laser pulses is carried out to investigate the variation in the linewidth deltalambda of emission from neutrals and ions for increasing ambient pressures measurements ranging from ... | [['timeresolved', 'optical', 'emission', 'spectroscopic', 'measurements', 'of', 'a', 'plasma', 'generated', 'by', 'irradiating', 'a', 'cr', 'target', 'using', '60', 'picosecond', 'ps', 'and', '300', 'ps', 'laser', 'pulses', 'is', 'carried', 'out', 'to', 'investigate', 'the', 'variation', 'in', 'the', 'linewidth', 'delt... | [-0.0757095143825295, 0.21685272668864802, -0.00040734462625189135, 0.0412711649336607, 0.03424162096861336, -0.1483551009356627, 0.05657292773255436, 0.43750314672248797, -0.24363848561154167, -0.3147717050293036, 0.006439115678515742, -0.30973858673435944, 0.03321426132781028, 0.19060524587372416, 0.01899397921066306... |
1,802.07437 | Binary Constrained Deep Hashing Network for Image Retrieval without
Manual Annotation | Learning compact binary codes for image retrieval task using deep neural
networks has attracted increasing attention recently. However, training deep
hashing networks for the task is challenging due to the binary constraints on
the hash codes, the similarity preserving property, and the requirement for a
vast amount ... | cs.CV | learning compact binary codes for image retrieval task using deep neural networks has attracted increasing attention recently however training deep hashing networks for the task is challenging due to the binary constraints on the hash codes the similarity preserving property and the requirement for a vast amount of lab... | [['learning', 'compact', 'binary', 'codes', 'for', 'image', 'retrieval', 'task', 'using', 'deep', 'neural', 'networks', 'has', 'attracted', 'increasing', 'attention', 'recently', 'however', 'training', 'deep', 'hashing', 'networks', 'for', 'the', 'task', 'is', 'challenging', 'due', 'to', 'the', 'binary', 'constraints',... | [-0.05833148818255636, -0.04527544410576795, -0.04119748701518004, 0.07306738865674337, -0.10742614305439135, -0.16084828749916988, 0.03886552069444315, 0.4757665142624405, -0.2913439927062117, -0.3581311102400388, 0.052122113618214054, -0.2676292943759376, -0.1815824511425649, 0.183620579141276, -0.1571774219992566, 0... |
1,802.07438 | Magnetic fields in multiple bright-rimmed clouds in different directions
of H$~$II region IC1396 - II | Bright-rimmed clouds form on the edges of H II regions affected by the high
energy radiation from a central ionizing source. The UV radiation from the
ionizing source results in compression and ionization causing either cloud
disruption or further star formation. In this work, we present R-band
polarization measureme... | astro-ph.GA | brightrimmed clouds form on the edges of h ii regions affected by the high energy radiation from a central ionizing source the uv radiation from the ionizing source results in compression and ionization causing either cloud disruption or further star formation in this work we present rband polarization measurements tow... | [['brightrimmed', 'clouds', 'form', 'on', 'the', 'edges', 'of', 'h', 'ii', 'regions', 'affected', 'by', 'the', 'high', 'energy', 'radiation', 'from', 'a', 'central', 'ionizing', 'source', 'the', 'uv', 'radiation', 'from', 'the', 'ionizing', 'source', 'results', 'in', 'compression', 'and', 'ionization', 'causing', 'eith... | [-0.10644582039883786, 0.07333948322091108, -0.02253331939326757, 0.042187113959590856, -0.027393892269297424, -0.031111685781131923, 0.03346233240770713, 0.42045004066362013, -0.19116293497075784, -0.34710964960661733, 0.04971779141894747, -0.25429165559441985, -0.05094115601623652, 0.15827730526433373, -0.04377265551... |
1,802.07439 | Constant Factor Approximation Algorithm for Weighted Flow Time on a
Single Machine in Pseudo-polynomial time | In the weighted flow-time problem on a single machine, we are given a set of
n jobs, where each job has a processing requirement p_j, release date r_j and
weight w_j. The goal is to find a preemptive schedule which minimizes the sum
of weighted flow-time of jobs, where the flow-time of a job is the difference
between... | cs.DS | in the weighted flowtime problem on a single machine we are given a set of n jobs where each job has a processing requirement p_j release date r_j and weight w_j the goal is to find a preemptive schedule which minimizes the sum of weighted flowtime of jobs where the flowtime of a job is the difference between its compl... | [['in', 'the', 'weighted', 'flowtime', 'problem', 'on', 'a', 'single', 'machine', 'we', 'are', 'given', 'a', 'set', 'of', 'n', 'jobs', 'where', 'each', 'job', 'has', 'a', 'processing', 'requirement', 'p_j', 'release', 'date', 'r_j', 'and', 'weight', 'w_j', 'the', 'goal', 'is', 'to', 'find', 'a', 'preemptive', 'schedule... | [-0.14600226901482444, 0.04428199878785499, -0.06920118551528039, 0.03749786410589031, -0.11538101506181235, -0.13485276959836484, 0.1320845362622031, 0.38219021929557934, -0.30787789263264387, -0.35200622058148645, 0.11131833049761088, -0.26722187356113697, -0.13193232541427363, 0.17815111843100206, -0.088333753461754... |
1,802.0744 | Max-size popular matchings and extensions | We consider the max-size popular matching problem in a roommates instance G =
(V,E) with strict preference lists. A matching M is popular if there is no
matching M' in G such that the vertices that prefer M' to M outnumber those
that prefer M to M'. We show it is NP-hard to compute a max-size popular
matching in G. T... | cs.DS | we consider the maxsize popular matching problem in a roommates instance g ve with strict preference lists a matching m is popular if there is no matching m in g such that the vertices that prefer m to m outnumber those that prefer m to m we show it is nphard to compute a maxsize popular matching in g this is in contra... | [['we', 'consider', 'the', 'maxsize', 'popular', 'matching', 'problem', 'in', 'a', 'roommates', 'instance', 'g', 've', 'with', 'strict', 'preference', 'lists', 'a', 'matching', 'm', 'is', 'popular', 'if', 'there', 'is', 'no', 'matching', 'm', 'in', 'g', 'such', 'that', 'the', 'vertices', 'that', 'prefer', 'm', 'to', 'm... | [-0.1597284505517236, 0.05989823140034648, -0.049576225364344376, 0.08068262546696714, -0.11384508286503517, -0.17926662011889902, 0.036086273496630156, 0.43712791070568985, -0.29123641602070954, -0.3315106148306791, 0.09261208266518575, -0.30363998019850347, -0.17306638606185765, 0.09160298734624411, -0.10038484285968... |
1,802.07441 | Nucleon radius effects on neutron stars in quark mean field model | We study the effects of free space nucleon radius on nuclear matter and
neutron stars within the framework of quark mean field model. The nucleon
radius is treated self-consistently with this model, where quark confinement is
adjusted to fit different values of nucleon radius. Corrections due to
center-of-mass motion... | nucl-th astro-ph.HE astro-ph.SR | we study the effects of free space nucleon radius on nuclear matter and neutron stars within the framework of quark mean field model the nucleon radius is treated selfconsistently with this model where quark confinement is adjusted to fit different values of nucleon radius corrections due to centerofmass motion quarkpi... | [['we', 'study', 'the', 'effects', 'of', 'free', 'space', 'nucleon', 'radius', 'on', 'nuclear', 'matter', 'and', 'neutron', 'stars', 'within', 'the', 'framework', 'of', 'quark', 'mean', 'field', 'model', 'the', 'nucleon', 'radius', 'is', 'treated', 'selfconsistently', 'with', 'this', 'model', 'where', 'quark', 'confine... | [-0.053485458811009, 0.2135388417860433, -0.1242310878309992, 0.10949246122336556, -0.06762516653585819, -0.02245664123385664, 0.02663546431689493, 0.34751975584414696, -0.16805799090934376, -0.31507559139882363, -0.029250861046415184, -0.29947702837807516, -0.006552716152321908, 0.1270530054976623, 0.03431003824206850... |
1,802.07442 | Learning to Play with Intrinsically-Motivated Self-Aware Agents | Infants are experts at playing, with an amazing ability to generate novel
structured behaviors in unstructured environments that lack clear extrinsic
reward signals. We seek to mathematically formalize these abilities using a
neural network that implements curiosity-driven intrinsic motivation. Using a
simple but eco... | cs.LG cs.AI cs.CV stat.ML | infants are experts at playing with an amazing ability to generate novel structured behaviors in unstructured environments that lack clear extrinsic reward signals we seek to mathematically formalize these abilities using a neural network that implements curiositydriven intrinsic motivation using a simple but ecologica... | [['infants', 'are', 'experts', 'at', 'playing', 'with', 'an', 'amazing', 'ability', 'to', 'generate', 'novel', 'structured', 'behaviors', 'in', 'unstructured', 'environments', 'that', 'lack', 'clear', 'extrinsic', 'reward', 'signals', 'we', 'seek', 'to', 'mathematically', 'formalize', 'these', 'abilities', 'using', 'a'... | [-0.07425000041388394, 0.054720028040811594, -0.10056814969042473, 0.06099571534720239, -0.167109836217309, -0.18946012311217406, 0.05409933355364823, 0.48420411878882835, -0.25658532569111, -0.3222803527939269, 0.03735320296810856, -0.26014805357424825, -0.22580997220677418, 0.12910565207555388, -0.15562706743367016, ... |
1,802.07443 | Space Elevator Propulsion with Mechanical Waves | The current preferred envisioned method for transmitting power to a space
elevator climber is a laser/photovoltaic (PV) system. In this, a ground-based
laser beam would transmit megawatts of optical power through the atmosphere to
an arrangement of PV panels mounted on the ascending climber. Although this
technique h... | physics.pop-ph | the current preferred envisioned method for transmitting power to a space elevator climber is a laserphotovoltaic pv system in this a groundbased laser beam would transmit megawatts of optical power through the atmosphere to an arrangement of pv panels mounted on the ascending climber although this technique has been s... | [['the', 'current', 'preferred', 'envisioned', 'method', 'for', 'transmitting', 'power', 'to', 'a', 'space', 'elevator', 'climber', 'is', 'a', 'laserphotovoltaic', 'pv', 'system', 'in', 'this', 'a', 'groundbased', 'laser', 'beam', 'would', 'transmit', 'megawatts', 'of', 'optical', 'power', 'through', 'the', 'atmosphere... | [-0.1512818341534358, 0.1384118650123621, -0.050751060520947945, -0.013681763279453014, -0.08511573402309727, -0.16328538279838356, 0.05545955497655086, 0.37768703394458963, -0.2592078481324341, -0.310060411151025, 0.09047707491574052, -0.283361213873693, -0.07443626408891404, 0.27320191008729416, -0.09653237950988114,... |
1,802.07444 | Scaling-up Split-Merge MCMC with Locality Sensitive Sampling (LSS) | Split-Merge MCMC (Monte Carlo Markov Chain) is one of the essential and
popular variants of MCMC for problems when an MCMC state consists of an unknown
number of components. It is well known that state-of-the-art methods for
split-merge MCMC do not scale well. Strategies for rapid mixing requires smart
and informativ... | cs.LG cs.AI cs.DS stat.ME stat.ML | splitmerge mcmc monte carlo markov chain is one of the essential and popular variants of mcmc for problems when an mcmc state consists of an unknown number of components it is well known that stateoftheart methods for splitmerge mcmc do not scale well strategies for rapid mixing requires smart and informative proposals... | [['splitmerge', 'mcmc', 'monte', 'carlo', 'markov', 'chain', 'is', 'one', 'of', 'the', 'essential', 'and', 'popular', 'variants', 'of', 'mcmc', 'for', 'problems', 'when', 'an', 'mcmc', 'state', 'consists', 'of', 'an', 'unknown', 'number', 'of', 'components', 'it', 'is', 'well', 'known', 'that', 'stateoftheart', 'method... | [-0.054923486566586494, 0.09907041897888264, -0.046927511315409315, 0.12669685356919289, -0.10583990100227918, -0.1832772442345124, 0.08775736687262085, 0.4398193267886253, -0.26178786144409255, -0.3693174351746897, 0.12837077861032037, -0.2671923193140138, -0.09705277116211387, 0.24099236188568265, -0.0958218410378322... |
1,802.07445 | A compactness result for non-local unregularized gradient flow lines | We prove an abstract compactness result for gradient flow lines of a
non-local unregularized gradient flow equation on a scale Hilbert space. This
is the first step towards Floer theory on scale Hilbert spaces.
| math.FA math.SG | we prove an abstract compactness result for gradient flow lines of a nonlocal unregularized gradient flow equation on a scale hilbert space this is the first step towards floer theory on scale hilbert spaces | [['we', 'prove', 'an', 'abstract', 'compactness', 'result', 'for', 'gradient', 'flow', 'lines', 'of', 'a', 'nonlocal', 'unregularized', 'gradient', 'flow', 'equation', 'on', 'a', 'scale', 'hilbert', 'space', 'this', 'is', 'the', 'first', 'step', 'towards', 'floer', 'theory', 'on', 'scale', 'hilbert', 'spaces']] | [-0.1413769040886751, 0.0543245123600868, -0.183808274950613, 0.12522513764526913, -0.09866652161102085, -0.0565601072191973, -0.07247379519771237, 0.3785876500803758, -0.3754633250920212, -0.18324173669166424, 0.13177723742966704, -0.22196177324718414, -0.09904493711313561, 0.14984880234388745, -0.1320600682467343, 0.... |
1,802.07446 | Distributed Compression of Graphical Data | In contrast to time series, graphical data is data indexed by the vertices
and edges of a graph. Modern applications such as the internet, social
networks, genomics and proteomics generate graphical data, often at large
scale. The large scale argues for the need to compress such data for storage
and subsequent proces... | cs.IT math.IT | in contrast to time series graphical data is data indexed by the vertices and edges of a graph modern applications such as the internet social networks genomics and proteomics generate graphical data often at large scale the large scale argues for the need to compress such data for storage and subsequent processing sin... | [['in', 'contrast', 'to', 'time', 'series', 'graphical', 'data', 'is', 'data', 'indexed', 'by', 'the', 'vertices', 'and', 'edges', 'of', 'a', 'graph', 'modern', 'applications', 'such', 'as', 'the', 'internet', 'social', 'networks', 'genomics', 'and', 'proteomics', 'generate', 'graphical', 'data', 'often', 'at', 'large'... | [-0.10888411203506954, 0.0716194253106932, -0.059663763066994085, 0.06935552024640523, -0.04733126859245722, -0.11429248229470304, 0.04314041668636805, 0.3667935624027685, -0.2938430072571982, -0.3281184071324445, 0.1346125021916113, -0.27489105102315703, -0.14479021623577942, 0.18417723803600716, -0.08248221362792006,... |
1,802.07447 | Load Balanced GANs for Multi-view Face Image Synthesis | Multi-view face synthesis from a single image is an ill-posed problem and
often suffers from serious appearance distortion. Producing photo-realistic and
identity preserving multi-view results is still a not well defined synthesis
problem. This paper proposes Load Balanced Generative Adversarial Networks
(LB-GAN) to ... | cs.CV | multiview face synthesis from a single image is an illposed problem and often suffers from serious appearance distortion producing photorealistic and identity preserving multiview results is still a not well defined synthesis problem this paper proposes load balanced generative adversarial networks lbgan to precisely r... | [['multiview', 'face', 'synthesis', 'from', 'a', 'single', 'image', 'is', 'an', 'illposed', 'problem', 'and', 'often', 'suffers', 'from', 'serious', 'appearance', 'distortion', 'producing', 'photorealistic', 'and', 'identity', 'preserving', 'multiview', 'results', 'is', 'still', 'a', 'not', 'well', 'defined', 'synthesi... | [-0.05465987041633859, -0.01064261111771228, -0.03131686444776336, 0.05698332696625538, -0.12307042383022984, -0.1947284852507483, -0.0026776588137285146, 0.4538915436007554, -0.33140205631999275, -0.3377768051047232, 0.09870949208506537, -0.2531704794338468, -0.1896189970474195, 0.14638138389954627, -0.234385036456669... |
1,802.07448 | The asymptotic expansion of the regular discretization error of It\^o
integrals | We study a Edgeworth-type refinement of the central limit theorem for the
discretizacion error of It\^o integrals. Towards this end, we introduce a new
approach, based on the anticipating It\^o formula. This alternative technique
allows us to compute explicitly the terms of the corresponding expansion
formula.
| math.PR | we study a edgeworthtype refinement of the central limit theorem for the discretizacion error of ito integrals towards this end we introduce a new approach based on the anticipating ito formula this alternative technique allows us to compute explicitly the terms of the corresponding expansion formula | [['we', 'study', 'a', 'edgeworthtype', 'refinement', 'of', 'the', 'central', 'limit', 'theorem', 'for', 'the', 'discretizacion', 'error', 'of', 'ito', 'integrals', 'towards', 'this', 'end', 'we', 'introduce', 'a', 'new', 'approach', 'based', 'on', 'the', 'anticipating', 'ito', 'formula', 'this', 'alternative', 'techniq... | [-0.08724385776246588, -0.02850658820890304, -0.19742480429510276, 0.09414106674181918, -0.09793114454175035, -0.052416860920170116, 0.14696005094382497, 0.2930396651228269, -0.23488389444020058, -0.259495634585619, 0.08930263281282451, -0.1983510360176701, -0.19200255448619524, 0.22113865713278452, -0.1238743275700269... |
1,802.07449 | An iterated graph construction and periodic orbits of Hamiltonian delay
equations | According to the Arnold conjectures and Floer's proofs, there are non-trivial
lower bounds for the number of periodic solutions of Hamiltonian differential
equations on a closed symplectic manifold whose symplectic form vanishes on
spheres. We use an iterated graph construction and Lagrangian Floer homology to
show t... | math.DS math.SG | according to the arnold conjectures and floers proofs there are nontrivial lower bounds for the number of periodic solutions of hamiltonian differential equations on a closed symplectic manifold whose symplectic form vanishes on spheres we use an iterated graph construction and lagrangian floer homology to show that th... | [['according', 'to', 'the', 'arnold', 'conjectures', 'and', 'floers', 'proofs', 'there', 'are', 'nontrivial', 'lower', 'bounds', 'for', 'the', 'number', 'of', 'periodic', 'solutions', 'of', 'hamiltonian', 'differential', 'equations', 'on', 'a', 'closed', 'symplectic', 'manifold', 'whose', 'symplectic', 'form', 'vanishe... | [-0.24601667133678698, 0.0764174152008899, -0.0913698053673694, 0.1277356008149422, -0.12508691540151312, -0.19105546049397895, -0.0021295208144900307, 0.27650280662795956, -0.2516073886991331, -0.288571909523422, 0.0934922945146498, -0.25367046338751126, -0.2191193609890577, 0.23191867441984645, -0.14817631154794964, ... |
1,802.0745 | Umbilical Cord Blood Banking and its Therapeutic Uses | Umbilical cord blood (UBC) can be viewed as the most promising source of stem
cells, in which collection cost is minimal and its benefits are immense. The
cord blood is used to treat malignant and nonmalignant diseases; this is due to
its progenitor characteristics know as stem cells.Its properties of being,
immunolo... | q-bio.CB q-bio.TO | umbilical cord blood ubc can be viewed as the most promising source of stem cells in which collection cost is minimal and its benefits are immense the cord blood is used to treat malignant and nonmalignant diseases this is due to its progenitor characteristics know as stem cellsits properties of being immunologically i... | [['umbilical', 'cord', 'blood', 'ubc', 'can', 'be', 'viewed', 'as', 'the', 'most', 'promising', 'source', 'of', 'stem', 'cells', 'in', 'which', 'collection', 'cost', 'is', 'minimal', 'and', 'its', 'benefits', 'are', 'immense', 'the', 'cord', 'blood', 'is', 'used', 'to', 'treat', 'malignant', 'and', 'nonmalignant', 'dis... | [-0.018003951115216212, 0.12220451204815287, -0.03900639898810451, 0.06233909320375956, -0.0877930830756668, -0.16538516950359652, 0.0417180553393502, 0.3888351722456388, -0.20977467906182443, -0.2661411878801697, 0.15690530768717342, -0.34149788560303435, -0.17051723901055416, 0.21851512982869858, -0.19830998826460638... |
1,802.07451 | A two-class queueing system with constant retrial policy and general
class dependent service times | A single server retrial queueing system with two-classes of orbiting
customers, and general class dependent service times is considered. If an
arriving customer finds the server unavailable, it enters a virtual queue,
called the orbit, according to its type. The customers from the orbits retry
independently to access... | math.PR | a single server retrial queueing system with twoclasses of orbiting customers and general class dependent service times is considered if an arriving customer finds the server unavailable it enters a virtual queue called the orbit according to its type the customers from the orbits retry independently to access the serv... | [['a', 'single', 'server', 'retrial', 'queueing', 'system', 'with', 'twoclasses', 'of', 'orbiting', 'customers', 'and', 'general', 'class', 'dependent', 'service', 'times', 'is', 'considered', 'if', 'an', 'arriving', 'customer', 'finds', 'the', 'server', 'unavailable', 'it', 'enters', 'a', 'virtual', 'queue', 'called',... | [-0.21629272696382107, 0.02845156639877965, -0.0855813346756231, 0.038854943754683645, -0.0885852547205922, -0.1998601872865267, 0.15511408783182376, 0.3295644120305401, -0.26571316732007605, -0.2740603741101858, 0.11643522275228273, -0.2876449311973856, -0.059913544301256665, 0.17387153447151749, -0.1289282391403465, ... |
1,802.07452 | Spatial Morphing Kernel Regression For Feature Interpolation | In recent years, geotagged social media has become popular as a novel source
for geographic knowledge discovery. Ground-level images and videos provide a
different perspective than overhead imagery and can be applied to a range of
applications such as land use mapping, activity detection, pollution mapping,
etc. The ... | cs.CV | in recent years geotagged social media has become popular as a novel source for geographic knowledge discovery groundlevel images and videos provide a different perspective than overhead imagery and can be applied to a range of applications such as land use mapping activity detection pollution mapping etc the sparse an... | [['in', 'recent', 'years', 'geotagged', 'social', 'media', 'has', 'become', 'popular', 'as', 'a', 'novel', 'source', 'for', 'geographic', 'knowledge', 'discovery', 'groundlevel', 'images', 'and', 'videos', 'provide', 'a', 'different', 'perspective', 'than', 'overhead', 'imagery', 'and', 'can', 'be', 'applied', 'to', 'a... | [-0.026228950940178217, 0.024677035607771573, -0.09818033162002446, 0.08587281156004348, -0.12544296294820648, -0.10413936902735885, 0.039926962362245674, 0.47213007340617213, -0.3101966103492635, -0.3096697708981521, 0.1401256430392147, -0.27863002095886685, -0.20792331252616983, 0.19684745450933458, -0.12497993892389... |
1,802.07453 | Hamiltonian delay equations -- examples and a lower bound for the number
of periodic solutions | We describe a variational approach to a notion of Hamiltonian delay
equations. Our delay Hamiltonians are of product form. We consider several
examples. For closed symplectically aspherical symplectic manifolds
$(M,\omega)$ we prove that for generic delay Hamiltonians the number of
1-periodic solutions of the Hamilto... | math.DS math.SG | we describe a variational approach to a notion of hamiltonian delay equations our delay hamiltonians are of product form we consider several examples for closed symplectically aspherical symplectic manifolds momega we prove that for generic delay hamiltonians the number of 1periodic solutions of the hamiltonian delay e... | [['we', 'describe', 'a', 'variational', 'approach', 'to', 'a', 'notion', 'of', 'hamiltonian', 'delay', 'equations', 'our', 'delay', 'hamiltonians', 'are', 'of', 'product', 'form', 'we', 'consider', 'several', 'examples', 'for', 'closed', 'symplectically', 'aspherical', 'symplectic', 'manifolds', 'momega', 'we', 'prove'... | [-0.2935320829174348, 0.06841453764853733, -0.04512461500375398, 0.05980463511077687, -0.0683297867753676, -0.1588771265133151, -0.0016364084157560552, 0.312203670998237, -0.26658186140869344, -0.2639871832881389, 0.04315681230343346, -0.2748559766814911, -0.16698346166605396, 0.2171085889284898, -0.10576144124248198, ... |
1,802.07454 | Narrowband Bandpass Frequency Selective Surface with Miniaturized
Elements | This article presents a bandpass frequency selective surface (FSS) with a
narrowband frequency response. The designed FSS is made of miniaturized
elements unit cell. The operation principle of the FSS is explained by using an
equivalent circuit model, where the passband bandwidth can be controlled by the
values of th... | eess.SP | this article presents a bandpass frequency selective surface fss with a narrowband frequency response the designed fss is made of miniaturized elements unit cell the operation principle of the fss is explained by using an equivalent circuit model where the passband bandwidth can be controlled by the values of the circu... | [['this', 'article', 'presents', 'a', 'bandpass', 'frequency', 'selective', 'surface', 'fss', 'with', 'a', 'narrowband', 'frequency', 'response', 'the', 'designed', 'fss', 'is', 'made', 'of', 'miniaturized', 'elements', 'unit', 'cell', 'the', 'operation', 'principle', 'of', 'the', 'fss', 'is', 'explained', 'by', 'using... | [-0.1618192103736463, 0.10412692549023202, 0.019450078064936302, -0.05788235401550698, -0.05166880394862865, -0.16874264828580363, 0.10720192015130994, 0.43560639876992474, -0.2468931077308552, -0.28952785325486974, 0.10973306886866808, -0.20789925844198273, -0.1294447662664317, 0.22111148236730005, -0.0753707699077103... |
1,802.07455 | Asymptotic efficiency of restart and checkpointing | Many tasks are subject to failure before completion. Two of the most common
failure recovery strategies are restart and checkpointing. Under restart, once
a failure occurs, it is restarted from the beginning. Under checkpointing, the
task is resumed from the preceding checkpoint after the failure. We study
asymptotic... | math.PR cs.PF | many tasks are subject to failure before completion two of the most common failure recovery strategies are restart and checkpointing under restart once a failure occurs it is restarted from the beginning under checkpointing the task is resumed from the preceding checkpoint after the failure we study asymptotic efficien... | [['many', 'tasks', 'are', 'subject', 'to', 'failure', 'before', 'completion', 'two', 'of', 'the', 'most', 'common', 'failure', 'recovery', 'strategies', 'are', 'restart', 'and', 'checkpointing', 'under', 'restart', 'once', 'a', 'failure', 'occurs', 'it', 'is', 'restarted', 'from', 'the', 'beginning', 'under', 'checkpoi... | [-0.14251493918709457, 0.10894550042470048, -0.09312495728227077, 0.02524519044527551, -0.021674530687353883, -0.11285910483032542, 0.09926218995315139, 0.3818380491284188, -0.273185454423583, -0.2561082220636308, 0.16741462138270435, -0.23209631209715553, -0.11749446046875771, 0.1595572328842536, -0.1247402785399269, ... |
1,802.07456 | Communication Using Eigenvalues of Higher Multiplicity of the Nonlinear
Fourier Transform | A generalized Nonlinear Fourier Transform (GNFT), which includes eigenvalues
of higher multiplicity, is considered for information transmission over fiber
optic channels. Numerical algorithms are developed to compute the direct and
inverse GNFTs. For closely-spaced eigenvalues, examples suggest that the GNFT
is more ... | cs.IT math.AP math.IT | a generalized nonlinear fourier transform gnft which includes eigenvalues of higher multiplicity is considered for information transmission over fiber optic channels numerical algorithms are developed to compute the direct and inverse gnfts for closelyspaced eigenvalues examples suggest that the gnft is more robust tha... | [['a', 'generalized', 'nonlinear', 'fourier', 'transform', 'gnft', 'which', 'includes', 'eigenvalues', 'of', 'higher', 'multiplicity', 'is', 'considered', 'for', 'information', 'transmission', 'over', 'fiber', 'optic', 'channels', 'numerical', 'algorithms', 'are', 'developed', 'to', 'compute', 'the', 'direct', 'and', '... | [-0.1389210935583553, 0.04726953014062765, -0.07797008045972922, 0.08278948074738042, -0.08765610578493813, -0.20595131124942923, -0.05121764094413569, 0.4218541939193622, -0.2457466770011263, -0.20803698104543564, 0.15729851039269796, -0.3008064442099287, -0.16977612122606772, 0.26312139586438066, -0.05433915416972759... |
1,802.07457 | The Security of the United Kingdom Electricity Imports under Conditions
of High European Demand | Energy policy in Europe has been driven by the three goals of security of
supply, economic competitiveness and environmental sustainability, referred to
as the energy trilemma. Although there are clear conflicts within the trilemma,
member countries have acted to facilitate a fully integrated European
electricity mar... | econ.EM q-fin.GN | energy policy in europe has been driven by the three goals of security of supply economic competitiveness and environmental sustainability referred to as the energy trilemma although there are clear conflicts within the trilemma member countries have acted to facilitate a fully integrated european electricity market in... | [['energy', 'policy', 'in', 'europe', 'has', 'been', 'driven', 'by', 'the', 'three', 'goals', 'of', 'security', 'of', 'supply', 'economic', 'competitiveness', 'and', 'environmental', 'sustainability', 'referred', 'to', 'as', 'the', 'energy', 'trilemma', 'although', 'there', 'are', 'clear', 'conflicts', 'within', 'the',... | [-0.10344719316810369, 0.10562209846859333, -0.06791093701089267, 0.10458778806671035, -0.08324634026619605, -0.11811704842373728, 0.07710989313130995, 0.3955478112027049, -0.22385036690728158, -0.33631724550388753, 0.18001213792565976, -0.2953624616745219, -0.09543165828450582, 0.1772482629161095, -0.15885032961843534... |
1,802.07458 | Non-Asymptotic Bounds and a General Formula for the Rate-Distortion
Region of the Successive Refinement Problem | In the successive refinement problem, a fixed-length sequence emitted from an
information source is encoded into two codewords by two encoders in order to
give two reconstructions of the sequence. One of two reconstructions is
obtained by one of two codewords, and the other reconstruction is obtained by
all two codew... | cs.IT math.IT | in the successive refinement problem a fixedlength sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence one of two reconstructions is obtained by one of two codewords and the other reconstruction is obtained by all two codewords f... | [['in', 'the', 'successive', 'refinement', 'problem', 'a', 'fixedlength', 'sequence', 'emitted', 'from', 'an', 'information', 'source', 'is', 'encoded', 'into', 'two', 'codewords', 'by', 'two', 'encoders', 'in', 'order', 'to', 'give', 'two', 'reconstructions', 'of', 'the', 'sequence', 'one', 'of', 'two', 'reconstructio... | [-0.17669201940866827, 0.09123108670471382, -0.04724944921437907, 0.0891582932434745, -0.012055317302525953, -0.16853025293276283, 0.0659326842456402, 0.3580053418817866, -0.298225057887212, -0.2533556126513099, 0.10060008171099799, -0.30557853558975206, -0.11031841099233801, 0.20976262044815616, -0.07650223893037009, ... |
1,802.07459 | Matching Article Pairs with Graphical Decomposition and Convolutions | Identifying the relationship between two articles, e.g., whether two articles
published from different sources describe the same breaking news, is critical
to many document understanding tasks. Existing approaches for modeling and
matching sentence pairs do not perform well in matching longer documents, which
embody ... | cs.CL cs.IR | identifying the relationship between two articles eg whether two articles published from different sources describe the same breaking news is critical to many document understanding tasks existing approaches for modeling and matching sentence pairs do not perform well in matching longer documents which embody more comp... | [['identifying', 'the', 'relationship', 'between', 'two', 'articles', 'eg', 'whether', 'two', 'articles', 'published', 'from', 'different', 'sources', 'describe', 'the', 'same', 'breaking', 'news', 'is', 'critical', 'to', 'many', 'document', 'understanding', 'tasks', 'existing', 'approaches', 'for', 'modeling', 'and', ... | [-0.10477383201435694, 0.02613739664342778, -0.047782194358513615, 0.09812479142912357, -0.13742952489999835, -0.09451874644460839, 0.054641293302490755, 0.43394747776737125, -0.24529936848358708, -0.37147925771564616, 0.031158141243728513, -0.34919699134814164, -0.1366016344335046, 0.18967816441374838, -0.050729940243... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.