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,803.06467 | Optimizing Information Freshness in Wireless Networks under General
Interference Constraints | Age of information (AoI) is a recently proposed metric for measuring
information freshness. AoI measures the time that elapsed since the last
received update was generated. We consider the problem of minimizing average
and peak AoI in a wireless networks, consisting of a set of source-destination
links, under general... | cs.IT cs.NI math.IT | age of information aoi is a recently proposed metric for measuring information freshness aoi measures the time that elapsed since the last received update was generated we consider the problem of minimizing average and peak aoi in a wireless networks consisting of a set of sourcedestination links under general interfer... | [['age', 'of', 'information', 'aoi', 'is', 'a', 'recently', 'proposed', 'metric', 'for', 'measuring', 'information', 'freshness', 'aoi', 'measures', 'the', 'time', 'that', 'elapsed', 'since', 'the', 'last', 'received', 'update', 'was', 'generated', 'we', 'consider', 'the', 'problem', 'of', 'minimizing', 'average', 'and... | [-0.19871361006445543, 0.09411649990005867, -0.10517477236139627, 0.05536696478864464, -0.07274547033868958, -0.17594833225811735, 0.13096768796969593, 0.4365180702708616, -0.29873873299113446, -0.28566374606881406, 0.13629367012399152, -0.24875039792693923, -0.0951267497505467, 0.1751765291623634, -0.13007366569409937... |
1,803.06468 | Rings additively generated by idempotents and nilpotents | A ring R is a strongly 2-nil-clean if every element in R is the sum of two
idempotents and a nilpotent that commute. A ring R is feebly clean if every
element in R is the sum of two orthogonal idempotents and a unit. In this
paper, strongly 2-nil-clean rings are studied with an emphasis on their
relations with feebly... | math.RA | a ring r is a strongly 2nilclean if every element in r is the sum of two idempotents and a nilpotent that commute a ring r is feebly clean if every element in r is the sum of two orthogonal idempotents and a unit in this paper strongly 2nilclean rings are studied with an emphasis on their relations with feebly clean ri... | [['a', 'ring', 'r', 'is', 'a', 'strongly', '2nilclean', 'if', 'every', 'element', 'in', 'r', 'is', 'the', 'sum', 'of', 'two', 'idempotents', 'and', 'a', 'nilpotent', 'that', 'commute', 'a', 'ring', 'r', 'is', 'feebly', 'clean', 'if', 'every', 'element', 'in', 'r', 'is', 'the', 'sum', 'of', 'two', 'orthogonal', 'idempot... | [-0.2704797740167889, 0.1249222266321196, -0.08177538044554622, -0.01712001316972371, -0.04648704780801812, -0.20971673772988939, -0.09111691921747192, 0.4000250382446929, -0.3372637184618629, -0.0843356559788318, 0.105770184231101, -0.32583942710372965, -0.10861296684628255, 0.16941800189057463, -0.05831841896533182, ... |
1,803.06469 | Distributed Scheduling Algorithms for Optimizing Information Freshness
in Wireless Networks | Age of Information (AoI), measures the time elapsed since the last received
information packet was generated at the source. We consider the problem of AoI
minimization for single-hop flows in a wireless network, under pairwise
interference constraints and time varying channel. We consider simple, yet
broad, class of ... | cs.IT cs.NI math.IT | age of information aoi measures the time elapsed since the last received information packet was generated at the source we consider the problem of aoi minimization for singlehop flows in a wireless network under pairwise interference constraints and time varying channel we consider simple yet broad class of distributed... | [['age', 'of', 'information', 'aoi', 'measures', 'the', 'time', 'elapsed', 'since', 'the', 'last', 'received', 'information', 'packet', 'was', 'generated', 'at', 'the', 'source', 'we', 'consider', 'the', 'problem', 'of', 'aoi', 'minimization', 'for', 'singlehop', 'flows', 'in', 'a', 'wireless', 'network', 'under', 'pai... | [-0.2144680038586052, 0.041125217833285675, -0.08667290064557973, 0.07573116505712581, -0.0700029252588542, -0.20456211490090936, 0.1397742777976587, 0.44784371536742484, -0.3442645170467181, -0.2934090907909666, 0.11537192461374043, -0.22688968976338705, -0.1622388568163539, 0.11784064001403749, -0.11782446180263327, ... |
1,803.0647 | Twisted Alexander Polynomials of $(-2,3,2n+1)$-Pretzel Knots | We calculate the twisted Alexander polynomials of $(-2,3,2n+1)$-pretzel knots
associated to their holonomy representations. As a corollary, we obtain new
supporting evidences of Dunfield, Friedl and Jackson's conjecture, that is, the
twisted Alexander polynomials of hyperbolic knots associated to their holonomy
repre... | math.GT | we calculate the twisted alexander polynomials of 232n1pretzel knots associated to their holonomy representations as a corollary we obtain new supporting evidences of dunfield friedl and jacksons conjecture that is the twisted alexander polynomials of hyperbolic knots associated to their holonomy representations determ... | [['we', 'calculate', 'the', 'twisted', 'alexander', 'polynomials', 'of', '232n1pretzel', 'knots', 'associated', 'to', 'their', 'holonomy', 'representations', 'as', 'a', 'corollary', 'we', 'obtain', 'new', 'supporting', 'evidences', 'of', 'dunfield', 'friedl', 'and', 'jacksons', 'conjecture', 'that', 'is', 'the', 'twist... | [-0.30828120056539776, 0.07349907375872135, -0.15036469962447882, 0.13223877880023793, -0.16088438004255295, -0.1360293239261955, -0.015796105689369143, 0.3459461257047951, -0.28224524229764936, -0.2393758003413677, 0.07104732790961861, -0.21026791721116753, -0.21074029898270966, 0.21450741618871688, -0.163722343277186... |
1,803.06471 | Optimizing Age of Information in Wireless Networks with Perfect Channel
State Information | Age of information (AoI), defined as the time elapsed since the last received
update was generated, is a newly proposed metric to measure the timeliness of
information updates in a network. We consider AoI minimization problem for a
network with general interference constraints, and time varying channels. We
propose ... | cs.IT cs.NI math.IT | age of information aoi defined as the time elapsed since the last received update was generated is a newly proposed metric to measure the timeliness of information updates in a network we consider aoi minimization problem for a network with general interference constraints and time varying channels we propose two polic... | [['age', 'of', 'information', 'aoi', 'defined', 'as', 'the', 'time', 'elapsed', 'since', 'the', 'last', 'received', 'update', 'was', 'generated', 'is', 'a', 'newly', 'proposed', 'metric', 'to', 'measure', 'the', 'timeliness', 'of', 'information', 'updates', 'in', 'a', 'network', 'we', 'consider', 'aoi', 'minimization',... | [-0.16181674056031087, 0.035493039389796276, -0.08776969755827277, 0.031026273228538532, -0.08243729459397771, -0.19576758121105808, 0.1522516393188939, 0.4407583480355916, -0.3044653512916907, -0.30742974388930533, 0.1574302581846024, -0.2345197928448518, -0.0979458429247003, 0.1304500630573818, -0.11295564293309494, ... |
1,803.06472 | Transversely holomorphic branched Cartan geometry | Earlier we introduced and studied the concept of holomorphic {\it branched
Cartan geometry}. We define here a foliated version of this notion; this is
done in terms of Atiyah bundle. We show that any complex compact manifold of
algebraic dimension $d$ admits, away from a closed analytic subset of positive
codimension... | math.DG math.CV | earlier we introduced and studied the concept of holomorphic it branched cartan geometry we define here a foliated version of this notion this is done in terms of atiyah bundle we show that any complex compact manifold of algebraic dimension d admits away from a closed analytic subset of positive codimension a nonsingu... | [['earlier', 'we', 'introduced', 'and', 'studied', 'the', 'concept', 'of', 'holomorphic', 'it', 'branched', 'cartan', 'geometry', 'we', 'define', 'here', 'a', 'foliated', 'version', 'of', 'this', 'notion', 'this', 'is', 'done', 'in', 'terms', 'of', 'atiyah', 'bundle', 'we', 'show', 'that', 'any', 'complex', 'compact', ... | [-0.2541222578419425, 0.08160579430862008, -0.054590072844038225, 0.08606556198389974, -0.16069114898879813, -0.21355219818564636, -0.0883579113168172, 0.3941394581903364, -0.283829858613627, -0.07989224916646065, 0.07325172177450644, -0.21073598923405337, -0.21561079038411518, 0.18332140588105839, -0.18314286099015692... |
1,803.06473 | Variational Inference as an alternative to MCMC for parameter estimation
and model selection | Most applications of Bayesian Inference for parameter estimation and model
selection in astrophysics involve the use of Monte Carlo techniques such as
Markov Chain Monte Carlo (MCMC) and nested sampling. However, these techniques
are time consuming and their convergence to the posterior could be difficult to
determin... | astro-ph.IM hep-ex physics.data-an | most applications of bayesian inference for parameter estimation and model selection in astrophysics involve the use of monte carlo techniques such as markov chain monte carlo mcmc and nested sampling however these techniques are time consuming and their convergence to the posterior could be difficult to determine in t... | [['most', 'applications', 'of', 'bayesian', 'inference', 'for', 'parameter', 'estimation', 'and', 'model', 'selection', 'in', 'astrophysics', 'involve', 'the', 'use', 'of', 'monte', 'carlo', 'techniques', 'such', 'as', 'markov', 'chain', 'monte', 'carlo', 'mcmc', 'and', 'nested', 'sampling', 'however', 'these', 'techni... | [-0.02523639219243339, 0.03650747549955924, -0.11192067885334729, 0.15219343349682132, -0.1403596369428526, -0.13338789527881004, 0.06288393496918653, 0.4208026477869177, -0.2744729933635956, -0.37059476977937444, 0.12740145184162785, -0.2260564287251114, -0.08938360538234723, 0.2483621603918463, -0.03148975813225758, ... |
1,803.06474 | Finite-size scaling with respect to interaction and disorder strength at
the many-body localization transition | We present a finite-size scaling for both interaction and disorder strengths
in the critical regime of the many-body localization (MBL) transition for a
spin-1/2 XXZ spin chain with a random field by studying level statistics. We
show how the dynamical transition from the thermal to MBL phase depends on
interaction t... | cond-mat.dis-nn cond-mat.stat-mech quant-ph | we present a finitesize scaling for both interaction and disorder strengths in the critical regime of the manybody localization mbl transition for a spin12 xxz spin chain with a random field by studying level statistics we show how the dynamical transition from the thermal to mbl phase depends on interaction together w... | [['we', 'present', 'a', 'finitesize', 'scaling', 'for', 'both', 'interaction', 'and', 'disorder', 'strengths', 'in', 'the', 'critical', 'regime', 'of', 'the', 'manybody', 'localization', 'mbl', 'transition', 'for', 'a', 'spin12', 'xxz', 'spin', 'chain', 'with', 'a', 'random', 'field', 'by', 'studying', 'level', 'statis... | [-0.19525597717414503, 0.24167936281255756, -0.043135354486217754, 0.04090452669989928, 0.007805231360329285, -0.17832905364883148, 0.07204924062367712, 0.33628350958899883, -0.22507342529773225, -0.27327309143166517, 0.0406284054224074, -0.31077381024961587, -0.15073963575691107, 0.10913728162279872, 0.067764135619594... |
1,803.06475 | Magneto-optical trapping of optically pumped metastable europium | We demonstrate laser cooling and magneto-optical trapping of europium. The
atoms are optically pumped to a metastable state and then loaded from an
atomic-beam source via conventional Zeeman slowing and magneto-optical trapping
techniques using a $J=13/2\leftrightarrow J=15/2$ quasi-cyclic transition. The
trapped pop... | cond-mat.quant-gas physics.atom-ph | we demonstrate laser cooling and magnetooptical trapping of europium the atoms are optically pumped to a metastable state and then loaded from an atomicbeam source via conventional zeeman slowing and magnetooptical trapping techniques using a j132leftrightarrow j152 quasicyclic transition the trapped populations contai... | [['we', 'demonstrate', 'laser', 'cooling', 'and', 'magnetooptical', 'trapping', 'of', 'europium', 'the', 'atoms', 'are', 'optically', 'pumped', 'to', 'a', 'metastable', 'state', 'and', 'then', 'loaded', 'from', 'an', 'atomicbeam', 'source', 'via', 'conventional', 'zeeman', 'slowing', 'and', 'magnetooptical', 'trapping'... | [-0.06175462360988604, 0.252018939620181, 0.004381782237032894, 0.01165460503398208, 0.07754873632802628, -0.167652504251843, 0.15136221938882954, 0.432433890857889, -0.24975150858517736, -0.2656374496218632, 0.015950184761701774, -0.3296265801182017, 0.03209220987628214, 0.14212608222927278, 0.031203280027208773, 0.04... |
1,803.06476 | PT-Symmetry and Supersymmetry: Interconnection of Broken and Unbroken
Phases | The broken and unbroken phases of PT and supersymmetry in optical systems are
explored for a complex refractive index profile in the form of a Scarf
potential, under the framework of supersymmetric quantum mechanics. The
transition from unbroken to the broken phases of PT-symmetry, with the merger
of eigenfunctions n... | quant-ph math-ph math.MP | the broken and unbroken phases of pt and supersymmetry in optical systems are explored for a complex refractive index profile in the form of a scarf potential under the framework of supersymmetric quantum mechanics the transition from unbroken to the broken phases of ptsymmetry with the merger of eigenfunctions near th... | [['the', 'broken', 'and', 'unbroken', 'phases', 'of', 'pt', 'and', 'supersymmetry', 'in', 'optical', 'systems', 'are', 'explored', 'for', 'a', 'complex', 'refractive', 'index', 'profile', 'in', 'the', 'form', 'of', 'a', 'scarf', 'potential', 'under', 'the', 'framework', 'of', 'supersymmetric', 'quantum', 'mechanics', '... | [-0.1608849352468615, 0.15651808773031492, -0.07003495649156964, 0.06348530075625626, -0.08652140829070061, -0.19154434125893605, 0.00016368015218086495, 0.38574916172934615, -0.24092055780824667, -0.25639915737028446, 0.091393364502279, -0.24466063894956194, -0.1743548836990011, 0.09865813830763287, -0.024934770776572... |
1,803.06477 | On the homotopy types of $\mathrm{Sp}(n)$ gauge groups | Let $\mathcal{G}_{k,n}$ be the gauge group of the principal
$\mathrm{Sp}(n)$-bundle over $S^4$ corresponding to
$k\in\mathbb{Z}\cong\pi_3(\mathrm{Sp}(n))$. We refine the result of Sutherland
on the homotopy types of $\mathcal{G}_{k,n}$ and relate it with the order of a
certain Samelson product in $\mathrm{Sp}(n)$. Th... | math.AT | let mathcalg_kn be the gauge group of the principal mathrmspnbundle over s4 corresponding to kinmathbbzcongpi_3mathrmspn we refine the result of sutherland on the homotopy types of mathcalg_kn and relate it with the order of a certain samelson product in mathrmspn then we classify the plocal homotopy types of mathcalg_... | [['let', 'mathcalg_kn', 'be', 'the', 'gauge', 'group', 'of', 'the', 'principal', 'mathrmspnbundle', 'over', 's4', 'corresponding', 'to', 'kinmathbbzcongpi_3mathrmspn', 'we', 'refine', 'the', 'result', 'of', 'sutherland', 'on', 'the', 'homotopy', 'types', 'of', 'mathcalg_kn', 'and', 'relate', 'it', 'with', 'the', 'order... | [-0.13223678677589917, 0.07269137343914457, -0.08619485875325543, 0.031186471769244085, -0.060380209189820656, -0.0820258897729218, -0.006577331268665742, 0.31136277884396973, -0.2853298207022706, -0.23633495509168323, 0.12054976711420304, -0.22559650782115606, -0.12841804352189815, 0.17417719677014618, -0.108397112817... |
1,803.06478 | Exploring physics beyond the Standard Electroweak Model in the light of
supersymmetry | In this thesis we try to discuss certain phenomenological aspects of an
R-parity violating non-minimal supersymmetric model, called $\mu\nu$SSM. We
show that $\mu\nu$SSM can provide a solution to the $\mu$-problem of
supersymmetry and can simultaneously accommodate the existing three flavour
global data from neutrino... | hep-ph hep-ex | in this thesis we try to discuss certain phenomenological aspects of an rparity violating nonminimal supersymmetric model called munussm we show that munussm can provide a solution to the muproblem of supersymmetry and can simultaneously accommodate the existing three flavour global data from neutrino experiments even ... | [['in', 'this', 'thesis', 'we', 'try', 'to', 'discuss', 'certain', 'phenomenological', 'aspects', 'of', 'an', 'rparity', 'violating', 'nonminimal', 'supersymmetric', 'model', 'called', 'munussm', 'we', 'show', 'that', 'munussm', 'can', 'provide', 'a', 'solution', 'to', 'the', 'muproblem', 'of', 'supersymmetry', 'and', ... | [-0.07892853236557279, 0.2612702558519272, -0.01813576346588733, 0.20757823936610056, -0.10225414589989142, -0.18054932946526206, 0.029780925861371554, 0.3307586921141812, -0.2291430591841031, -0.32982730693755097, 0.06268723313194668, -0.27495270479664374, -0.060566708957949536, 0.13038555589170442, 0.0325193953385306... |
1,803.06479 | On the definition of a solution to a rough differential equation | We give an elementary proof that Davie's definition of a solution to a rough
differential equation and the notion of solution given by Bailleul in (Flows
driven by rough paths) coincide. This provides an alternative point on view on
the deep algebraic insights of Cass and Weidner in their work (Tree algebras
over top... | math.CA | we give an elementary proof that davies definition of a solution to a rough differential equation and the notion of solution given by bailleul in flows driven by rough paths coincide this provides an alternative point on view on the deep algebraic insights of cass and weidner in their work tree algebras over topologica... | [['we', 'give', 'an', 'elementary', 'proof', 'that', 'davies', 'definition', 'of', 'a', 'solution', 'to', 'a', 'rough', 'differential', 'equation', 'and', 'the', 'notion', 'of', 'solution', 'given', 'by', 'bailleul', 'in', 'flows', 'driven', 'by', 'rough', 'paths', 'coincide', 'this', 'provides', 'an', 'alternative', '... | [-0.14053469947223568, 0.09447183015300513, -0.17559700181423607, 0.08349215528746215, -0.13695285115706718, -0.08019704417467623, 0.07641147475460765, 0.3362078755399433, -0.332889533262321, -0.25774353044896814, 0.06206623364784518, -0.28360381721069056, -0.1891052653486209, 0.21836935615135453, -0.1585768951829207, ... |
1,803.0648 | Queuing Theory Guided Intelligent Traffic Scheduling through Video
Analysis using Dirichlet Process Mixture Model | Accurate prediction of traffic signal duration for roadway junction is a
challenging problem due to the dynamic nature of traffic flows. Though
supervised learning can be used, parameters may vary across roadway junctions.
In this paper, we present a computer vision guided expert system that can learn
the departure r... | cs.CV eess.IV | accurate prediction of traffic signal duration for roadway junction is a challenging problem due to the dynamic nature of traffic flows though supervised learning can be used parameters may vary across roadway junctions in this paper we present a computer vision guided expert system that can learn the departure rate of... | [['accurate', 'prediction', 'of', 'traffic', 'signal', 'duration', 'for', 'roadway', 'junction', 'is', 'a', 'challenging', 'problem', 'due', 'to', 'the', 'dynamic', 'nature', 'of', 'traffic', 'flows', 'though', 'supervised', 'learning', 'can', 'be', 'used', 'parameters', 'may', 'vary', 'across', 'roadway', 'junctions',... | [-0.12109071977344381, 0.04955442671052879, -0.09757626325881574, 0.06994868299296779, -0.08843341464671539, -0.21597931737536177, 0.04550321242383385, 0.43303212042277056, -0.25267879297219525, -0.33920270546514075, 0.10765362214624474, -0.26172038710258977, -0.14237604150578895, 0.23711886659778733, -0.11630617540504... |
1,803.06481 | The density of visible points in the Ammann-Beenker point set | The relative density of visible points of the integer lattice $\mathbb{Z}^d$
is known to be $1/\zeta(d)$ for $d\geq 2$, where $\zeta$ is Riemann's zeta
function. In this paper we prove that the relative density of visible points in
the Ammann-Beenker point set is given by $2(\sqrt{2}-1)/\zeta_K(2)$, where
$\zeta_K$ i... | math.NT | the relative density of visible points of the integer lattice mathbbzd is known to be 1zetad for dgeq 2 where zeta is riemanns zeta function in this paper we prove that the relative density of visible points in the ammannbeenker point set is given by 2sqrt21zeta_k2 where zeta_k is dedekinds zeta function over kmathbbqs... | [['the', 'relative', 'density', 'of', 'visible', 'points', 'of', 'the', 'integer', 'lattice', 'mathbbzd', 'is', 'known', 'to', 'be', '1zetad', 'for', 'dgeq', '2', 'where', 'zeta', 'is', 'riemanns', 'zeta', 'function', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'relative', 'density', 'of', 'visible', 'points',... | [-0.1911572271446679, 0.11807033326476812, -0.10993637853101187, 0.030337565758849914, -0.014978061320588869, -0.10932075100786545, 0.04783626352025963, 0.32349278602529974, -0.29780923688382493, -0.1998418516424649, 0.06874534799306489, -0.2752080083477731, -0.18729933296494625, 0.14328973187024102, -0.075594605604077... |
1,803.06482 | Asynchronous Distributed Method of Multipliers for Constrained Nonconvex
Optimization | This paper addresses a class of constrained optimization problems over
networks in which local cost functions and constraints can be nonconvex. We
propose an asynchronous distributed optimization algorithm, relying on the
centralized Method of Multipliers, in which each node wakes up in an
uncoordinated fashion and p... | math.OC | this paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex we propose an asynchronous distributed optimization algorithm relying on the centralized method of multipliers in which each node wakes up in an uncoordinated fashion and perfor... | [['this', 'paper', 'addresses', 'a', 'class', 'of', 'constrained', 'optimization', 'problems', 'over', 'networks', 'in', 'which', 'local', 'cost', 'functions', 'and', 'constraints', 'can', 'be', 'nonconvex', 'we', 'propose', 'an', 'asynchronous', 'distributed', 'optimization', 'algorithm', 'relying', 'on', 'the', 'cent... | [-0.15938653307966888, 0.01982443149873606, -0.09237280195917595, 0.01671498049770228, -0.06783090562340945, -0.15112412415063856, 0.036661958700278774, 0.4102022923021154, -0.3714402282723423, -0.26565398207766877, 0.09962407975002531, -0.18116257863419544, -0.18012619246270112, 0.14955852445828813, -0.102235319015259... |
1,803.06483 | Products of $H$-separable spaces in the Laver model | We prove that in the Laver model for the consistency of the Borel's
conjecture, the product of any two $H$-separable spaces is $M$-separable.
| math.GN math.LO | we prove that in the laver model for the consistency of the borels conjecture the product of any two hseparable spaces is mseparable | [['we', 'prove', 'that', 'in', 'the', 'laver', 'model', 'for', 'the', 'consistency', 'of', 'the', 'borels', 'conjecture', 'the', 'product', 'of', 'any', 'two', 'hseparable', 'spaces', 'is', 'mseparable']] | [-0.1851026357405565, 0.07867973039604047, -0.11507064377127046, 0.13561893595827065, 0.003126071427356113, -0.08887994340197607, -0.025386922019110483, 0.306136390702291, -0.2722614761441946, -0.1949997814372182, 0.12541272837816822, -0.24212662993125955, -0.10838404077697884, 0.18579556233122607, -0.12269531402059576... |
1,803.06484 | Linearized Einstein's Equation around pure BTZ from Entanglement
Thermodynamics | It is known that the linearized Einstein's equation around the pure $AdS$ can
be obtained from the constraint $ \Delta S = \Delta\left< H \right> $, known as
the first law of entanglement, on the boundary $CFT$. The corresponding dual
state in the boundary $CFT$ is the vacuum state around which the linear
perturbatio... | hep-th | it is known that the linearized einsteins equation around the pure ads can be obtained from the constraint delta s deltaleft h right known as the first law of entanglement on the boundary cft the corresponding dual state in the boundary cft is the vacuum state around which the linear perturbation is taken in this paper... | [['it', 'is', 'known', 'that', 'the', 'linearized', 'einsteins', 'equation', 'around', 'the', 'pure', 'ads', 'can', 'be', 'obtained', 'from', 'the', 'constraint', 'delta', 's', 'deltaleft', 'h', 'right', 'known', 'as', 'the', 'first', 'law', 'of', 'entanglement', 'on', 'the', 'boundary', 'cft', 'the', 'corresponding', ... | [-0.12007657959910593, 0.11039604258716224, -0.1294369226116247, 0.04664459511890685, -0.052351286055476176, -0.12262665034880436, -0.0226699879207817, 0.25191049860775705, -0.2412320536993972, -0.23658651412706674, 0.1246294313931735, -0.31687991134089044, -0.11082280631081795, 0.12419329250898711, -0.0602712887522625... |
1,803.06485 | Impact of Dzyaloshinsky-Moriya Interactions and Tilts of the g Tensors
on the Magnetization Process of a Spherical Kagome Cluster in {W72V30} | In order to clarify why the experimental magnetization curve of the spherical
kagome cluster in {W72V30} at 0.5 K shows no sign of staircase behavior up to
50 T, we study the effects of Dzyaloshinsky-Moriya (DM) interactions and tilts
of the g tensors, both of which lead to the breaking of the total-S z
conservation,... | cond-mat.str-el | in order to clarify why the experimental magnetization curve of the spherical kagome cluster in w72v30 at 05 k shows no sign of staircase behavior up to 50 t we study the effects of dzyaloshinskymoriya dm interactions and tilts of the g tensors both of which lead to the breaking of the totals z conservation by using th... | [['in', 'order', 'to', 'clarify', 'why', 'the', 'experimental', 'magnetization', 'curve', 'of', 'the', 'spherical', 'kagome', 'cluster', 'in', 'w72v30', 'at', '05', 'k', 'shows', 'no', 'sign', 'of', 'staircase', 'behavior', 'up', 'to', '50', 't', 'we', 'study', 'the', 'effects', 'of', 'dzyaloshinskymoriya', 'dm', 'inte... | [-0.19804886239748315, 0.1697219662927761, -0.024803750634464775, 0.037574866157830795, -0.07012157033117179, -0.07174253775637678, 0.0420787520103639, 0.3868772104757724, -0.28060668499188884, -0.3239537574645641, 0.035679180809068865, -0.2680857956355853, -0.10188027558406051, 0.16024815670856135, 0.04725310239348754... |
1,803.06486 | Rotating accretion flows in $D$ dimensions: sonic points, critical
points and photon spheres | We give the formulation and the general analysis of the rotational accretion
problem on $D$-dimensional spherical spacetime and investigate sonic points and
critical points. First, we construct the simple two-dimensional rotating
accretion flow model in general $D$-dimensional static spherically symmetric
spacetime a... | gr-qc | we give the formulation and the general analysis of the rotational accretion problem on ddimensional spherical spacetime and investigate sonic points and critical points first we construct the simple twodimensional rotating accretion flow model in general ddimensional static spherically symmetric spacetime and formulat... | [['we', 'give', 'the', 'formulation', 'and', 'the', 'general', 'analysis', 'of', 'the', 'rotational', 'accretion', 'problem', 'on', 'ddimensional', 'spherical', 'spacetime', 'and', 'investigate', 'sonic', 'points', 'and', 'critical', 'points', 'first', 'we', 'construct', 'the', 'simple', 'twodimensional', 'rotating', '... | [-0.1503741902180333, 0.1003949691571216, -0.09859027099012932, 0.03995805409083024, -0.04218504155188442, -0.1061099079373154, 0.01773577449320657, 0.3322766085472354, -0.22481300730624812, -0.22765117469169396, 0.09923050713606496, -0.2636176044458246, -0.08806316071051232, 0.16946213751748956, -0.038892296336695276,... |
1,803.06487 | Magnetic Fields of Extrasolar Planets: Planetary Interiors and
Habitability | Jupiter's radio emission has been linked to its planetary-scale magnetic
field, and spacecraft investigations have revealed that most planets, and some
moons, have or had a global magnetic field. Generated by internal dynamos,
magnetic fields are one of the few remote sensing means of constraining the
properties of p... | astro-ph.EP astro-ph.SR | jupiters radio emission has been linked to its planetaryscale magnetic field and spacecraft investigations have revealed that most planets and some moons have or had a global magnetic field generated by internal dynamos magnetic fields are one of the few remote sensing means of constraining the properties of planetary ... | [['jupiters', 'radio', 'emission', 'has', 'been', 'linked', 'to', 'its', 'planetaryscale', 'magnetic', 'field', 'and', 'spacecraft', 'investigations', 'have', 'revealed', 'that', 'most', 'planets', 'and', 'some', 'moons', 'have', 'or', 'had', 'a', 'global', 'magnetic', 'field', 'generated', 'by', 'internal', 'dynamos',... | [-0.13079297972238052, 0.20804808267595493, -0.022680738817483014, 0.04568679787585309, -0.19642719527986383, -0.026249974862300823, 0.027958648606237275, 0.3312314704176367, -0.1579551248518036, -0.3839999671272663, 0.08032215691782013, -0.2389211987478205, -0.14884129865818846, 0.26818857589311934, -0.095908628752541... |
1,803.06488 | An extended type system with lambda-typed lambda-expressions (extended
version) | We present the type system $\mathtt{d}$, an extended type system with
lambda-typed lambda-expressions. It is related to type systems originating from
the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an
existential abstraction operator as well as propositional operators.
$\beta$-reduction is... | cs.LO | we present the type system mathttd an extended type system with lambdatyped lambdaexpressions it is related to type systems originating from the automath project mathttd extends existing lambdatyped systems by an existential abstraction operator as well as propositional operators betareduction is extended to also norma... | [['we', 'present', 'the', 'type', 'system', 'mathttd', 'an', 'extended', 'type', 'system', 'with', 'lambdatyped', 'lambdaexpressions', 'it', 'is', 'related', 'to', 'type', 'systems', 'originating', 'from', 'the', 'automath', 'project', 'mathttd', 'extends', 'existing', 'lambdatyped', 'systems', 'by', 'an', 'existential... | [-0.08018816634095656, 0.0335740242490293, -0.054690219755348275, 0.1205151114670228, -0.14150456806536355, -0.18987197857605267, 0.04292385273434426, 0.32899325775390825, -0.32117831672554553, -0.28100044805913754, 0.14630038363696396, -0.25642556547544487, -0.1119362482109764, 0.19458938562247444, -0.1350133260675149... |
1,803.06489 | Experimental evidences of trions and Fermi edge singularity in single
barrier GaAs/AlAs/GaAs heterostructure using photocapacitance spectroscopy | In this paper, we show how photocapacitance spectra can probe two dimensional
excitonic complexes and Fermi edge singularity as a function of applied bias
around 100 K. In lower density regimes (<1x1011cm^-2), the appearance of two
distinct peaks in the spectra are identified as a signature of coexistence of
both exc... | cond-mat.mes-hall cond-mat.quant-gas | in this paper we show how photocapacitance spectra can probe two dimensional excitonic complexes and fermi edge singularity as a function of applied bias around 100 k in lower density regimes 1x1011cm2 the appearance of two distinct peaks in the spectra are identified as a signature of coexistence of both excitons and ... | [['in', 'this', 'paper', 'we', 'show', 'how', 'photocapacitance', 'spectra', 'can', 'probe', 'two', 'dimensional', 'excitonic', 'complexes', 'and', 'fermi', 'edge', 'singularity', 'as', 'a', 'function', 'of', 'applied', 'bias', 'around', '100', 'k', 'in', 'lower', 'density', 'regimes', '1x1011cm2', 'the', 'appearance',... | [-0.11054152413528166, 0.18583165188251502, -0.07168599925911595, 0.11568716688791528, 0.013417183595461835, -0.1656871483268618, 0.04177197837898526, 0.43997934374812186, -0.2659648720622428, -0.31921118879051624, 0.016886128061314058, -0.3217049863043369, -0.11669060406383519, 0.1502833928497435, 0.018543036815803954... |
1,803.0649 | Robust event-stream pattern tracking based on correlative filter | Object tracking based on retina-inspired and event-based dynamic vision
sensor (DVS) is challenging for the noise events, rapid change of event-stream
shape, chaos of complex background textures, and occlusion. To address these
challenges, this paper presents a robust event-stream pattern tracking method
based on cor... | cs.CV | object tracking based on retinainspired and eventbased dynamic vision sensor dvs is challenging for the noise events rapid change of eventstream shape chaos of complex background textures and occlusion to address these challenges this paper presents a robust eventstream pattern tracking method based on correlative filt... | [['object', 'tracking', 'based', 'on', 'retinainspired', 'and', 'eventbased', 'dynamic', 'vision', 'sensor', 'dvs', 'is', 'challenging', 'for', 'the', 'noise', 'events', 'rapid', 'change', 'of', 'eventstream', 'shape', 'chaos', 'of', 'complex', 'background', 'textures', 'and', 'occlusion', 'to', 'address', 'these', 'ch... | [-0.10895704734575702, 0.0016049106227001176, -0.08426410843005953, 0.03710802424757276, -0.1009627145511331, -0.19453374379809246, -0.04663496948269312, 0.4706801219843328, -0.2807014599908143, -0.3327142702997662, 0.08851566500889022, -0.23674730836355593, -0.25660867262631654, 0.18258724679762964, -0.244825964962365... |
1,803.06491 | Solutions of the $U_q(\widehat{\mathfrak{sl}}_N)$ reflection equations | We find the complete set of invertible solutions of the untwisted and twisted
reflection equations for the Bazhanov-Jimbo R-matrix of type ${\mathrm
A}^{(1)}_{N-1}$. We also show that all invertible solutions can be obtained by
an appropriate affinization procedure from solutions of the constant untwisted
and twisted... | math-ph hep-th math.MP nlin.SI | we find the complete set of invertible solutions of the untwisted and twisted reflection equations for the bazhanovjimbo rmatrix of type mathrm a1_n1 we also show that all invertible solutions can be obtained by an appropriate affinization procedure from solutions of the constant untwisted and twisted reflection equati... | [['we', 'find', 'the', 'complete', 'set', 'of', 'invertible', 'solutions', 'of', 'the', 'untwisted', 'and', 'twisted', 'reflection', 'equations', 'for', 'the', 'bazhanovjimbo', 'rmatrix', 'of', 'type', 'mathrm', 'a1_n1', 'we', 'also', 'show', 'that', 'all', 'invertible', 'solutions', 'can', 'be', 'obtained', 'by', 'an'... | [-0.16364233733645264, 0.07651604853968007, -0.020678466760573236, 0.04502822270002613, -0.0916001377330023, -0.15762548144668975, -0.015759605835092828, 0.3542108701423128, -0.31787569725767095, -0.19718937397478742, 0.15827341488701233, -0.2233978047015819, -0.1472049892899838, 0.21311368904215225, -0.059779496096877... |
1,803.06492 | Evolving Deep Convolutional Neural Networks by Variable-length Particle
Swarm Optimization for Image Classification | Convolutional neural networks (CNNs) are one of the most effective deep
learning methods to solve image classification problems, but the best
architecture of a CNN to solve a specific problem can be extremely complicated
and hard to design. This paper focuses on utilising Particle Swarm Optimisation
(PSO) to automati... | cs.NE cs.CV | convolutional neural networks cnns are one of the most effective deep learning methods to solve image classification problems but the best architecture of a cnn to solve a specific problem can be extremely complicated and hard to design this paper focuses on utilising particle swarm optimisation pso to automatically se... | [['convolutional', 'neural', 'networks', 'cnns', 'are', 'one', 'of', 'the', 'most', 'effective', 'deep', 'learning', 'methods', 'to', 'solve', 'image', 'classification', 'problems', 'but', 'the', 'best', 'architecture', 'of', 'a', 'cnn', 'to', 'solve', 'a', 'specific', 'problem', 'can', 'be', 'extremely', 'complicated'... | [-0.0390496247626606, -0.028298351915951057, -0.05996140021518849, 0.05960387342135786, -0.12225608414635786, -0.21656806646304846, -0.0017095598142404219, 0.44884144197878184, -0.2805227358284117, -0.36656564645903206, 0.09247896483550029, -0.2314926846290812, -0.20393669320433175, 0.2126850739185861, -0.1141379835644... |
1,803.06493 | Actin filaments growing against an elastic membrane: Effect of membrane
tension | We study the force generation by a set of parallel actin filaments growing
against an elastic membrane. The elastic membrane tries to stay flat and any
deformation from this flat state, either caused by thermal fluctuations or due
to protrusive polymerization force exerted by the filaments, costs energy. We
study two... | physics.bio-ph cond-mat.soft cond-mat.stat-mech | we study the force generation by a set of parallel actin filaments growing against an elastic membrane the elastic membrane tries to stay flat and any deformation from this flat state either caused by thermal fluctuations or due to protrusive polymerization force exerted by the filaments costs energy we study two latti... | [['we', 'study', 'the', 'force', 'generation', 'by', 'a', 'set', 'of', 'parallel', 'actin', 'filaments', 'growing', 'against', 'an', 'elastic', 'membrane', 'the', 'elastic', 'membrane', 'tries', 'to', 'stay', 'flat', 'and', 'any', 'deformation', 'from', 'this', 'flat', 'state', 'either', 'caused', 'by', 'thermal', 'flu... | [-0.13206544298070122, 0.15434718023621768, -0.06093073818105388, 0.001436385607153949, -0.015778270466587103, -0.13014297929603563, 0.01215852380997364, 0.37516068701390676, -0.31386766495160845, -0.26104917008693207, 0.04842039027095464, -0.2812495655101906, -0.12684101828066002, 0.14453827109896536, -0.0171000782133... |
1,803.06494 | Attack Trees in Isabelle | In this paper, we present a proof theory for attack trees. Attack trees are a
well established and useful model for the construction of attacks on systems
since they allow a stepwise exploration of high level attacks in application
scenarios. Using the expressiveness of Higher Order Logic in Isabelle, we
succeed in d... | cs.CR cs.LO | in this paper we present a proof theory for attack trees attack trees are a well established and useful model for the construction of attacks on systems since they allow a stepwise exploration of high level attacks in application scenarios using the expressiveness of higher order logic in isabelle we succeed in develop... | [['in', 'this', 'paper', 'we', 'present', 'a', 'proof', 'theory', 'for', 'attack', 'trees', 'attack', 'trees', 'are', 'a', 'well', 'established', 'and', 'useful', 'model', 'for', 'the', 'construction', 'of', 'attacks', 'on', 'systems', 'since', 'they', 'allow', 'a', 'stepwise', 'exploration', 'of', 'high', 'level', 'at... | [-0.14728336749164778, -0.007000268767655328, -0.11115629925473552, 0.11160001228900923, -0.09725592804033363, -0.17357181328470292, 0.13446033123772647, 0.31236371225879894, -0.22216174779189884, -0.29743839950179274, 0.13129981485046988, -0.21436733543458208, -0.17454018796443183, 0.2077598799192144, -0.1289979213025... |
1,803.06495 | Superior mechanical flexibility and strained-engineered direct-indirect
band gap transition of green phosphorene | Most recently, a brand new phosphorus allotrope called green phosphorus has
been predicted, which has a direct band gap up to 2.4 eV, and its single-layer
form termed green phosphorene shows high stability. Here the mechanical
properties and the uniaxial strain effect on the electronic band structure of
green phospho... | cond-mat.mtrl-sci | most recently a brand new phosphorus allotrope called green phosphorus has been predicted which has a direct band gap up to 24 ev and its singlelayer form termed green phosphorene shows high stability here the mechanical properties and the uniaxial strain effect on the electronic band structure of green phosphorene alo... | [['most', 'recently', 'a', 'brand', 'new', 'phosphorus', 'allotrope', 'called', 'green', 'phosphorus', 'has', 'been', 'predicted', 'which', 'has', 'a', 'direct', 'band', 'gap', 'up', 'to', '24', 'ev', 'and', 'its', 'singlelayer', 'form', 'termed', 'green', 'phosphorene', 'shows', 'high', 'stability', 'here', 'the', 'me... | [-0.1829621819646454, 0.11454777034615235, -0.03858314172033495, -0.020348104831900124, -0.05069788022790317, -0.14269290134723253, 0.09022056216049014, 0.5037196109058873, -0.26652121988059513, -0.27059953234427225, 0.027699432552217088, -0.29175681209866733, -0.19651671639024812, 0.18125768131638983, 0.08008074524988... |
1,803.06496 | A simple iterative algorithm for maxcut | We propose a simple iterative (SI) algorithm for the maxcut problem through
fully using an equivalent continuous formulation. It does not need rounding at
all and has advantages that all subproblems have explicit analytic solutions,
the cut values are monotonically updated and the iteration points converge to a
local... | math.OC cs.NA math.CO math.NA | we propose a simple iterative si algorithm for the maxcut problem through fully using an equivalent continuous formulation it does not need rounding at all and has advantages that all subproblems have explicit analytic solutions the cut values are monotonically updated and the iteration points converge to a local optim... | [['we', 'propose', 'a', 'simple', 'iterative', 'si', 'algorithm', 'for', 'the', 'maxcut', 'problem', 'through', 'fully', 'using', 'an', 'equivalent', 'continuous', 'formulation', 'it', 'does', 'not', 'need', 'rounding', 'at', 'all', 'and', 'has', 'advantages', 'that', 'all', 'subproblems', 'have', 'explicit', 'analytic... | [-0.05793272254155263, 0.003848054403645444, -0.09741661497779812, 0.034467678337374276, -0.07295299799737047, -0.1737271650947565, 0.11673676841810607, 0.4280358645738217, -0.2521199362899847, -0.3244744588972249, 0.13300342488882802, -0.2701929868321474, -0.1268722756057079, 0.17050678935718902, -0.06698892341126084,... |
1,803.06497 | Variational Bayesian Line Spectral Estimation with Multiple Measurement
Vectors | In this paper, the line spectral estimation (LSE) problem with multiple
measurement vectors (MMVs) is studied utilizing the Bayesian methods. Motivated
by the recently proposed variational line spectral estimation (VALSE) method,
we develop the multisnapshot VALSE (MVALSE) for multi snapshot scenarios, which
is espec... | cs.IT math.IT | in this paper the line spectral estimation lse problem with multiple measurement vectors mmvs is studied utilizing the bayesian methods motivated by the recently proposed variational line spectral estimation valse method we develop the multisnapshot valse mvalse for multi snapshot scenarios which is especially importan... | [['in', 'this', 'paper', 'the', 'line', 'spectral', 'estimation', 'lse', 'problem', 'with', 'multiple', 'measurement', 'vectors', 'mmvs', 'is', 'studied', 'utilizing', 'the', 'bayesian', 'methods', 'motivated', 'by', 'the', 'recently', 'proposed', 'variational', 'line', 'spectral', 'estimation', 'valse', 'method', 'we'... | [-0.06322250176410846, -0.010241372569429653, -0.06974859341151185, 0.035048948557771464, -0.06179618543807279, -0.14092714133612053, 0.022081216196184632, 0.40769731283739763, -0.26996570303346273, -0.3090553412972777, 0.1571665048814827, -0.233027618088656, -0.1429551009502676, 0.19985948022006564, -0.075367521361827... |
1,803.06498 | Insight on confinement using scalar field interactions | The scalar field plays an fundamental role in the investigation of
confinement property characterising many particle physics models. This is
achieved by coupling this particle directly with gauge fields at the lagrangian
level. We have adopted the same approach {[}10{]} to determine a potential as a
perturbative seri... | hep-ph | the scalar field plays an fundamental role in the investigation of confinement property characterising many particle physics models this is achieved by coupling this particle directly with gauge fields at the lagrangian level we have adopted the same approach 10 to determine a potential as a perturbative series in term... | [['the', 'scalar', 'field', 'plays', 'an', 'fundamental', 'role', 'in', 'the', 'investigation', 'of', 'confinement', 'property', 'characterising', 'many', 'particle', 'physics', 'models', 'this', 'is', 'achieved', 'by', 'coupling', 'this', 'particle', 'directly', 'with', 'gauge', 'fields', 'at', 'the', 'lagrangian', 'l... | [-0.11406991149420913, 0.15541582168161855, -0.08870674347396469, 0.07917630926421075, -0.04579726070418809, -0.10719742935639127, -0.020951281193173625, 0.31843354600002466, -0.21929125843831854, -0.3409253773143859, 0.03662879963052794, -0.22473949915503413, -0.11960442664409146, 0.14910126194918474, 0.01421794296215... |
1,803.06499 | K\"ahler submanifolds of the symmetrized polydisc | This paper proves the non-existence of common K\"ahler submanifolds of the
complex Euclidean space and the symmetrized polydisc endowed with their
canonical metrics.
| math.CV math.DG | this paper proves the nonexistence of common kahler submanifolds of the complex euclidean space and the symmetrized polydisc endowed with their canonical metrics | [['this', 'paper', 'proves', 'the', 'nonexistence', 'of', 'common', 'kahler', 'submanifolds', 'of', 'the', 'complex', 'euclidean', 'space', 'and', 'the', 'symmetrized', 'polydisc', 'endowed', 'with', 'their', 'canonical', 'metrics']] | [-0.2257916196046964, 0.006652207883155864, -0.006421392095153747, 0.1394483049997412, -0.10678462878517482, -0.08182315342128277, -0.07099463948068897, 0.3481594537911208, -0.2355962432111087, -0.1412698179078491, 0.06859969440847635, -0.27143959939965734, -0.23161814726241256, 0.12612780843577956, -0.2265519303796084... |
1,803.065 | Argumentation theory for mathematical argument | To adequately model mathematical arguments the analyst must be able to
represent the mathematical objects under discussion and the relationships
between them, as well as inferences drawn about these objects and relationships
as the discourse unfolds. We introduce a framework with these properties, which
has been used... | cs.CL cs.AI | to adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them as well as inferences drawn about these objects and relationships as the discourse unfolds we introduce a framework with these properties which has been used to a... | [['to', 'adequately', 'model', 'mathematical', 'arguments', 'the', 'analyst', 'must', 'be', 'able', 'to', 'represent', 'the', 'mathematical', 'objects', 'under', 'discussion', 'and', 'the', 'relationships', 'between', 'them', 'as', 'well', 'as', 'inferences', 'drawn', 'about', 'these', 'objects', 'and', 'relationships'... | [-0.0008491212445956638, 0.02469218081974408, -0.13929923610065312, 0.17567652206020157, -0.18127607760068618, -0.11625839384240017, 0.06838081880031448, 0.40367514803482774, -0.28580330540589466, -0.3649143329096484, 0.06577255858696605, -0.25182187214101615, -0.18964778752834127, 0.16128864385118186, -0.1088421462663... |
1,803.06501 | Implications of dilaton couplings on the axion potential | In particle physics and cosmology, the dilaton is an hypothetical scalar
field which can explain many physical phenomena. In this framework, we
investigate an extended lagrangian of QCD which involves dilatonic degrees of
freedom. Our approach is based on the relationship between the massive dilaton
and the nonpertur... | hep-th | in particle physics and cosmology the dilaton is an hypothetical scalar field which can explain many physical phenomena in this framework we investigate an extended lagrangian of qcd which involves dilatonic degrees of freedom our approach is based on the relationship between the massive dilaton and the nonperturbative... | [['in', 'particle', 'physics', 'and', 'cosmology', 'the', 'dilaton', 'is', 'an', 'hypothetical', 'scalar', 'field', 'which', 'can', 'explain', 'many', 'physical', 'phenomena', 'in', 'this', 'framework', 'we', 'investigate', 'an', 'extended', 'lagrangian', 'of', 'qcd', 'which', 'involves', 'dilatonic', 'degrees', 'of', ... | [-0.15106006422138307, 0.19291673330053527, -0.14081998373148963, 0.12065007635283109, -0.11959082492103335, -0.12251525395549834, -0.027471709148812806, 0.26648725289851427, -0.18631897493833094, -0.2966993658337742, 0.01143345652599237, -0.22925386056886055, -0.17003079707501456, 0.11443836048238154, -0.0051322590443... |
1,803.06502 | Analysing Developers Affectiveness through Markov chain Models | In this paper, we present an analysis of more than 500K comments from
open-source repositories of software systems. Our aim is to empirically
determine how developers interact with each other under certain psychological
conditions generated by politeness, sentiment and emotion expressed in
developers' comments. Devel... | cs.SE | in this paper we present an analysis of more than 500k comments from opensource repositories of software systems our aim is to empirically determine how developers interact with each other under certain psychological conditions generated by politeness sentiment and emotion expressed in developers comments developers in... | [['in', 'this', 'paper', 'we', 'present', 'an', 'analysis', 'of', 'more', 'than', '500k', 'comments', 'from', 'opensource', 'repositories', 'of', 'software', 'systems', 'our', 'aim', 'is', 'to', 'empirically', 'determine', 'how', 'developers', 'interact', 'with', 'each', 'other', 'under', 'certain', 'psychological', 'c... | [-0.120104638881606, 0.10425830558032968, -0.05383922502978192, 0.0807830828241874, -0.13225912226587344, -0.18943714841485157, 0.07928418234995642, 0.4124828844654317, -0.21247141964600555, -0.33545486234622646, 0.12219263224539403, -0.33338345971067757, -0.17662126378765644, 0.16638200513707302, -0.11300143838280394,... |
1,803.06503 | Weakly Supervised Salient Object Detection Using Image Labels | Deep learning based salient object detection has recently achieved great
success with its performance greatly outperforms any other unsupervised
methods. However, annotating per-pixel saliency masks is a tedious and
inefficient procedure. In this paper, we note that superior salient object
detection can be obtained b... | cs.CV | deep learning based salient object detection has recently achieved great success with its performance greatly outperforms any other unsupervised methods however annotating perpixel saliency masks is a tedious and inefficient procedure in this paper we note that superior salient object detection can be obtained by itera... | [['deep', 'learning', 'based', 'salient', 'object', 'detection', 'has', 'recently', 'achieved', 'great', 'success', 'with', 'its', 'performance', 'greatly', 'outperforms', 'any', 'other', 'unsupervised', 'methods', 'however', 'annotating', 'perpixel', 'saliency', 'masks', 'is', 'a', 'tedious', 'and', 'inefficient', 'pr... | [0.02292642587533919, -0.06471017393516376, -0.05854492745711468, 0.050037257269141266, -0.14356484418734908, -0.22004471938940695, 0.04219239125552122, 0.5205208783270792, -0.27075792554300276, -0.34646161573851714, 0.06514051553211175, -0.2435563990729861, -0.2128491143521387, 0.1472248062142171, -0.17895865849684925... |
1,803.06504 | Superconductivity without inversion and time-reversal symmetries | The traditional symmetries that protect superconductivity are time-reversal
and inversion. Here, we examine the minimal symmetries protecting
superconductivity in two dimensions and find that time-reversal symmetry and
inversion symmetry are not required, and having a combination of either
symmetry with a mirror oper... | cond-mat.supr-con | the traditional symmetries that protect superconductivity are timereversal and inversion here we examine the minimal symmetries protecting superconductivity in two dimensions and find that timereversal symmetry and inversion symmetry are not required and having a combination of either symmetry with a mirror operation o... | [['the', 'traditional', 'symmetries', 'that', 'protect', 'superconductivity', 'are', 'timereversal', 'and', 'inversion', 'here', 'we', 'examine', 'the', 'minimal', 'symmetries', 'protecting', 'superconductivity', 'in', 'two', 'dimensions', 'and', 'find', 'that', 'timereversal', 'symmetry', 'and', 'inversion', 'symmetry... | [-0.18782847902015548, 0.19477711739903433, 0.02987203677420062, 0.06692581832634681, -0.08179430229909192, -0.2306843502917374, 0.038092070456707115, 0.41083535684667755, -0.2585699980269478, -0.28291151095934286, 0.12480592668159968, -0.27363411171568763, -0.16251628522319023, 0.11738768338479778, -0.0190872034467192... |
1,803.06505 | A simulated annealing procedure based on the ABC Shadow algorithm for
statistical inference of point processes | Recently a new algorithm for sampling posteriors of unnormalised probability
densities, called ABC Shadow, was proposed in [8]. This talk introduces a
global optimisation procedure based on the ABC Shadow simulation dynamics.
First the general method is explained, and then results on simulated and real
data are prese... | stat.CO math.ST stat.TH | recently a new algorithm for sampling posteriors of unnormalised probability densities called abc shadow was proposed in 8 this talk introduces a global optimisation procedure based on the abc shadow simulation dynamics first the general method is explained and then results on simulated and real data are presented the ... | [['recently', 'a', 'new', 'algorithm', 'for', 'sampling', 'posteriors', 'of', 'unnormalised', 'probability', 'densities', 'called', 'abc', 'shadow', 'was', 'proposed', 'in', '8', 'this', 'talk', 'introduces', 'a', 'global', 'optimisation', 'procedure', 'based', 'on', 'the', 'abc', 'shadow', 'simulation', 'dynamics', 'f... | [-0.05588773487162002, 0.059359565173918515, -0.11879291104047861, 0.10531191860528952, -0.05559806260739414, -0.12377475566742285, 0.02555208011779567, 0.4195544117353332, -0.2257566021781572, -0.3133458041390863, 0.10723941986003077, -0.21433385621762874, -0.2126827488430369, 0.22503155909321257, -0.10779672028155814... |
1,803.06506 | Learning Unsupervised Visual Grounding Through Semantic Self-Supervision | Localizing natural language phrases in images is a challenging problem that
requires joint understanding of both the textual and visual modalities. In the
unsupervised setting, lack of supervisory signals exacerbate this difficulty.
In this paper, we propose a novel framework for unsupervised visual grounding
which u... | cs.CV | localizing natural language phrases in images is a challenging problem that requires joint understanding of both the textual and visual modalities in the unsupervised setting lack of supervisory signals exacerbate this difficulty in this paper we propose a novel framework for unsupervised visual grounding which uses co... | [['localizing', 'natural', 'language', 'phrases', 'in', 'images', 'is', 'a', 'challenging', 'problem', 'that', 'requires', 'joint', 'understanding', 'of', 'both', 'the', 'textual', 'and', 'visual', 'modalities', 'in', 'the', 'unsupervised', 'setting', 'lack', 'of', 'supervisory', 'signals', 'exacerbate', 'this', 'diffi... | [-0.03946572737537113, -0.04222300040027034, -0.07494964833694992, 0.07700270657998952, -0.14460644099517916, -0.07545162739020818, 0.06408158077359702, 0.4161646514866792, -0.2619598914822894, -0.3634161879143394, 0.04609298345910266, -0.28178572745544583, -0.17899191059198574, 0.19713467551917102, -0.1917400225197751... |
1,803.06507 | Covering Arrays for Equivalence Classes of Words | Covering arrays for words of length $t$ over a $d$ letter alphabet are $k
\times n$ arrays with entries from the alphabet so that for each choice of $t$
columns, each of the $d^t$ $t$-letter words appears at least once among the
rows of the selected columns. We study two schemes in which all words are not
considered ... | math.CO | covering arrays for words of length t over a d letter alphabet are k times n arrays with entries from the alphabet so that for each choice of t columns each of the dt tletter words appears at least once among the rows of the selected columns we study two schemes in which all words are not considered to be different in ... | [['covering', 'arrays', 'for', 'words', 'of', 'length', 't', 'over', 'a', 'd', 'letter', 'alphabet', 'are', 'k', 'times', 'n', 'arrays', 'with', 'entries', 'from', 'the', 'alphabet', 'so', 'that', 'for', 'each', 'choice', 'of', 't', 'columns', 'each', 'of', 'the', 'dt', 'tletter', 'words', 'appears', 'at', 'least', 'on... | [-0.13349974394028108, 0.1648215801490597, 0.01637175309834844, 0.034340003071258125, -0.02466708091403342, -0.15160393650580387, 0.07384111498747913, 0.38965868208581045, -0.2650404902277672, -0.2567138111542405, 0.12507601679890748, -0.3220517753733922, -0.07701106921382943, 0.1786846088909473, -0.02926740871142533, ... |
1,803.06508 | MergeNet: A Deep Net Architecture for Small Obstacle Discovery | We present here, a novel network architecture called MergeNet for discovering
small obstacles for on-road scenes in the context of autonomous driving. The
basis of the architecture rests on the central consideration of training with
less amount of data since the physical setup and the annotation process for
small obs... | cs.CV cs.RO | we present here a novel network architecture called mergenet for discovering small obstacles for onroad scenes in the context of autonomous driving the basis of the architecture rests on the central consideration of training with less amount of data since the physical setup and the annotation process for small obstacle... | [['we', 'present', 'here', 'a', 'novel', 'network', 'architecture', 'called', 'mergenet', 'for', 'discovering', 'small', 'obstacles', 'for', 'onroad', 'scenes', 'in', 'the', 'context', 'of', 'autonomous', 'driving', 'the', 'basis', 'of', 'the', 'architecture', 'rests', 'on', 'the', 'central', 'consideration', 'of', 'tr... | [-0.027158215799211682, 0.02397781912261596, -0.05420019404279286, 0.04267848167663552, -0.08351297351961061, -0.15095584346555996, 0.054835749637371825, 0.42478542327397056, -0.2174137083196698, -0.38484376835237655, 0.09658620458598212, -0.2761177077763578, -0.13553247355868098, 0.22868154805256416, -0.11515100708823... |
1,803.06509 | Explosive shock tube of xenon non-ideal plasma for proton radiography | A high explosive shock tube of non-ideal gaseous plasma for proton
radiography is described. The gas dynamic flow in the shock compressed xenon at
initial pressure of 7 bar was investigated in the tube. The velocity of the
shock wave in xenon and the associated particle velocity were measured by a
high-speed rotating... | physics.plasm-ph | a high explosive shock tube of nonideal gaseous plasma for proton radiography is described the gas dynamic flow in the shock compressed xenon at initial pressure of 7 bar was investigated in the tube the velocity of the shock wave in xenon and the associated particle velocity were measured by a highspeed rotating mirro... | [['a', 'high', 'explosive', 'shock', 'tube', 'of', 'nonideal', 'gaseous', 'plasma', 'for', 'proton', 'radiography', 'is', 'described', 'the', 'gas', 'dynamic', 'flow', 'in', 'the', 'shock', 'compressed', 'xenon', 'at', 'initial', 'pressure', 'of', '7', 'bar', 'was', 'investigated', 'in', 'the', 'tube', 'the', 'velocity... | [-0.09054425109701697, 0.23618994459509848, -0.06510715230833738, 0.0363856859866064, 0.010721917813643813, -0.08443718910391908, -0.044806727804243565, 0.3580448902677745, -0.23225844225846232, -0.2936241501569748, 0.07890030431444757, -0.2628833692986518, 0.050362907969392835, 0.19708234603167513, 0.04072969294153154... |
1,803.0651 | Hidden Integrality and Semi-random Robustness of SDP Relaxation for
Sub-Gaussian Mixture Model | We consider the problem of estimating the discrete clustering structures
under the Sub-Gaussian Mixture Model. Our main results establish a hidden
integrality property of a semidefinite programming (SDP) relaxation for this
problem: while the optimal solution to the SDP is not integer-valued in
general, its estimatio... | stat.ML cs.IT cs.LG math.IT math.OC math.ST stat.TH | we consider the problem of estimating the discrete clustering structures under the subgaussian mixture model our main results establish a hidden integrality property of a semidefinite programming sdp relaxation for this problem while the optimal solution to the sdp is not integervalued in general its estimation error c... | [['we', 'consider', 'the', 'problem', 'of', 'estimating', 'the', 'discrete', 'clustering', 'structures', 'under', 'the', 'subgaussian', 'mixture', 'model', 'our', 'main', 'results', 'establish', 'a', 'hidden', 'integrality', 'property', 'of', 'a', 'semidefinite', 'programming', 'sdp', 'relaxation', 'for', 'this', 'prob... | [-0.11331592745006648, 0.02673429345623479, -0.09942059375649964, 0.0920781364160742, -0.05857431250661463, -0.15933575550376242, 0.07323335569196072, 0.3237150208931787, -0.32005207728876534, -0.3135373772222148, 0.1404023152225061, -0.22725705067864602, -0.17337649012637507, 0.18086307981808436, -0.07801236644891867,... |
1,803.06511 | On discretization of the Euler top | Application of the intersection theory to construction of n-point
finite-difference equations associated with classical integrable systems is
discussed. As an example, we present a few new discretizations of motion of the
Euler top sharing the integrals of motion with the continuous time system and
the Poisson bracke... | nlin.SI math-ph math.DS math.MP | application of the intersection theory to construction of npoint finitedifference equations associated with classical integrable systems is discussed as an example we present a few new discretizations of motion of the euler top sharing the integrals of motion with the continuous time system and the poisson bracket up t... | [['application', 'of', 'the', 'intersection', 'theory', 'to', 'construction', 'of', 'npoint', 'finitedifference', 'equations', 'associated', 'with', 'classical', 'integrable', 'systems', 'is', 'discussed', 'as', 'an', 'example', 'we', 'present', 'a', 'few', 'new', 'discretizations', 'of', 'motion', 'of', 'the', 'euler'... | [-0.20029323701834623, 0.06729833332998546, -0.07736481458194694, 0.0344155957715867, -0.0778519388920856, -0.10555575682588343, -0.023726745717280177, 0.3080280036929081, -0.34446411952376366, -0.2825219017225054, 0.10890335185708092, -0.24744065901492987, -0.16228605750596747, 0.1999331779145407, -0.03866800266968192... |
1,803.06512 | Quantum engineering of transistors based on 2D materials
heterostructures | Quantum engineering entails atom by atom design and fabrication of electronic
devices. This innovative technology that unifies materials science and device
engineering has been fostered by the recent progress in the fabrication of
vertical and lateral heterostructures of two-dimensional materials and by the
assessmen... | cond-mat.mtrl-sci cond-mat.mes-hall | quantum engineering entails atom by atom design and fabrication of electronic devices this innovative technology that unifies materials science and device engineering has been fostered by the recent progress in the fabrication of vertical and lateral heterostructures of twodimensional materials and by the assessment of... | [['quantum', 'engineering', 'entails', 'atom', 'by', 'atom', 'design', 'and', 'fabrication', 'of', 'electronic', 'devices', 'this', 'innovative', 'technology', 'that', 'unifies', 'materials', 'science', 'and', 'device', 'engineering', 'has', 'been', 'fostered', 'by', 'the', 'recent', 'progress', 'in', 'the', 'fabricati... | [-0.12394513308794962, 0.09443307233353455, -0.011869059263349132, -0.06829338960513404, -0.03531421450553117, -0.18777749953032644, 0.03613848572734881, 0.42621802853213414, -0.2357515293458063, -0.31973671335037107, 0.09164784257990066, -0.26555198138855673, -0.21438606027168808, 0.2943740478268376, -0.06141637894152... |
1,803.06513 | Two-color electromagnetically induced transparency via modulated
coupling between a mechanical resonator and a qubit | We discuss level splitting and sideband transitions induced by a modulated
coupling between a superconducting quantum circuit and a nanomechanical
resonator. First, we show how to achieve an unconventional time-dependent
longitudinal coupling between a flux (transmon) qubit and the resonator.
Considering a sinusoidal... | quant-ph | we discuss level splitting and sideband transitions induced by a modulated coupling between a superconducting quantum circuit and a nanomechanical resonator first we show how to achieve an unconventional timedependent longitudinal coupling between a flux transmon qubit and the resonator considering a sinusoidal modulat... | [['we', 'discuss', 'level', 'splitting', 'and', 'sideband', 'transitions', 'induced', 'by', 'a', 'modulated', 'coupling', 'between', 'a', 'superconducting', 'quantum', 'circuit', 'and', 'a', 'nanomechanical', 'resonator', 'first', 'we', 'show', 'how', 'to', 'achieve', 'an', 'unconventional', 'timedependent', 'longitudi... | [-0.21496612647765437, 0.2550761055157904, -0.014676826391826195, 0.018184391358878716, -0.04365009385978152, -0.17821875713662777, 0.09457069133876886, 0.4942445822425781, -0.25386699517057537, -0.26884600804101655, -0.01896031338512966, -0.19999005274984277, -0.13021665833536192, 0.23712583534430964, 0.02058786619883... |
1,803.06514 | On weak universality of three-dimensional Larger than Life cellular
automaton | Larger than Life cellular automaton (LtL) is a class of cellular automata and
is a generalization of the game of Life by extending its neighborhood radius.
We have studied the three-dimensional extension of LtL. In this paper, we show
a radius-4 three-dimensional LtL rule is a candidate for weakly universal one.
| nlin.CG | larger than life cellular automaton ltl is a class of cellular automata and is a generalization of the game of life by extending its neighborhood radius we have studied the threedimensional extension of ltl in this paper we show a radius4 threedimensional ltl rule is a candidate for weakly universal one | [['larger', 'than', 'life', 'cellular', 'automaton', 'ltl', 'is', 'a', 'class', 'of', 'cellular', 'automata', 'and', 'is', 'a', 'generalization', 'of', 'the', 'game', 'of', 'life', 'by', 'extending', 'its', 'neighborhood', 'radius', 'we', 'have', 'studied', 'the', 'threedimensional', 'extension', 'of', 'ltl', 'in', 'th... | [-0.12989064602705183, 0.10502184376120567, -0.03758671731688082, 0.12075806489679962, -0.08928853280842304, -0.15150503146462144, 0.0873243764624931, 0.3733477511256933, -0.27062556467950344, -0.2224995655566454, 0.12048053609440103, -0.23347671158611774, -0.156410924308002, 0.17435847528278828, -0.10121634631883353, ... |
1,803.06515 | From nonholonomic quantum constraint to canonical variables of photons
I: true intrinsic degree of freedom | We report that the true intrinsic degree of freedom of the photon is neither
the polarization nor the spin. It describes a local property in momentum space
and is represented in the local representation by the Pauli matrices. This
result is achieved by treating the transversality condition on the vector
wavefunction ... | quant-ph math.RT physics.optics | we report that the true intrinsic degree of freedom of the photon is neither the polarization nor the spin it describes a local property in momentum space and is represented in the local representation by the pauli matrices this result is achieved by treating the transversality condition on the vector wavefunction as a... | [['we', 'report', 'that', 'the', 'true', 'intrinsic', 'degree', 'of', 'freedom', 'of', 'the', 'photon', 'is', 'neither', 'the', 'polarization', 'nor', 'the', 'spin', 'it', 'describes', 'a', 'local', 'property', 'in', 'momentum', 'space', 'and', 'is', 'represented', 'in', 'the', 'local', 'representation', 'by', 'the', '... | [-0.1947347326664093, 0.19907856945891256, -0.06621057136030292, 0.03569552292874842, -0.09374424686115006, -0.12607533518903324, 0.026254679398312244, 0.32699675887915086, -0.29128533064813156, -0.26968017454190113, 0.033215049338055615, -0.2240337677253985, -0.13061103358703816, 0.13627685214116894, -0.04523934054843... |
1,803.06516 | Presentation Proposal: Towards Efficient Data-flow Test Data Generation
Using KLEE | Dataflow coverage, one of the white-box testing criteria, focuses on the
relations between variable definitions and their uses.Several empirical studies
have proved data-flow testing is more effective than control-flow testing.
However, data-flow testing still cannot find its adoption in practice, due to
the lack of ... | cs.SE | dataflow coverage one of the whitebox testing criteria focuses on the relations between variable definitions and their usesseveral empirical studies have proved dataflow testing is more effective than controlflow testing however dataflow testing still cannot find its adoption in practice due to the lack of effective to... | [['dataflow', 'coverage', 'one', 'of', 'the', 'whitebox', 'testing', 'criteria', 'focuses', 'on', 'the', 'relations', 'between', 'variable', 'definitions', 'and', 'their', 'usesseveral', 'empirical', 'studies', 'have', 'proved', 'dataflow', 'testing', 'is', 'more', 'effective', 'than', 'controlflow', 'testing', 'howeve... | [-0.06429851543343364, -0.02079743156448389, -0.10415019477472807, 0.09144087405039523, -0.13580035711064015, -0.2045124347279899, 0.08313428511461005, 0.42287797135754657, -0.2117295756768913, -0.37102463913078493, 0.11757617721853492, -0.22461165875817338, -0.10812097509057285, 0.24145684452005065, -0.094322617350814... |
1,803.06517 | Optimal Designs for the Generalized Partial Credit Model | Analyzing ordinal data becomes increasingly important in psychology,
especially in the context of item response theory. The generalized partial
credit model (GPCM) is probably the most widely used ordinal model and finds
application in many large scale educational assessment studies such as PISA. In
the present paper... | math.ST stat.ME stat.TH | analyzing ordinal data becomes increasingly important in psychology especially in the context of item response theory the generalized partial credit model gpcm is probably the most widely used ordinal model and finds application in many large scale educational assessment studies such as pisa in the present paper optima... | [['analyzing', 'ordinal', 'data', 'becomes', 'increasingly', 'important', 'in', 'psychology', 'especially', 'in', 'the', 'context', 'of', 'item', 'response', 'theory', 'the', 'generalized', 'partial', 'credit', 'model', 'gpcm', 'is', 'probably', 'the', 'most', 'widely', 'used', 'ordinal', 'model', 'and', 'finds', 'appl... | [-0.03750066705062195, 0.0598625883511785, -0.04919107604038083, 0.1274574643060932, -0.10650453571291321, -0.18081054128494792, 0.036220160927952764, 0.39777920414891205, -0.23461986835305157, -0.29135764294746097, 0.14582497499621683, -0.22493856431413065, -0.18243589683087788, 0.18768450844388532, -0.105950226005392... |
1,803.06518 | Provable Convex Co-clustering of Tensors | Cluster analysis is a fundamental tool for pattern discovery of complex
heterogeneous data. Prevalent clustering methods mainly focus on vector or
matrix-variate data and are not applicable to general-order tensors, which
arise frequently in modern scientific and business applications. Moreover,
there is a gap betwee... | stat.ME stat.AP stat.CO stat.ML | cluster analysis is a fundamental tool for pattern discovery of complex heterogeneous data prevalent clustering methods mainly focus on vector or matrixvariate data and are not applicable to generalorder tensors which arise frequently in modern scientific and business applications moreover there is a gap between statis... | [['cluster', 'analysis', 'is', 'a', 'fundamental', 'tool', 'for', 'pattern', 'discovery', 'of', 'complex', 'heterogeneous', 'data', 'prevalent', 'clustering', 'methods', 'mainly', 'focus', 'on', 'vector', 'or', 'matrixvariate', 'data', 'and', 'are', 'not', 'applicable', 'to', 'generalorder', 'tensors', 'which', 'arise'... | [-0.07902371923384421, -0.016257350843892817, -0.10714099858339657, 0.10280490128652138, -0.14687693565262153, -0.1404625690131284, 0.08849245394436259, 0.3953518942436751, -0.27343009364352944, -0.3155752282315756, 0.13572319477029582, -0.28063019719796584, -0.19406639084302107, 0.18899637982934056, -0.108525658446802... |
1,803.06519 | Signal detection via Phi-divergences for general mixtures | In this paper we are interested in testing whether there are any signals
hidden in high dimensional noise data. Therefore we study the family of
goodness-of-fit tests based on $\Phi$-divergences including the test of Berk
and Jones as well as Tukey's higher criticism test. The optimality of this
family is already kno... | math.ST stat.TH | in this paper we are interested in testing whether there are any signals hidden in high dimensional noise data therefore we study the family of goodnessoffit tests based on phidivergences including the test of berk and jones as well as tukeys higher criticism test the optimality of this family is already known for the ... | [['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'testing', 'whether', 'there', 'are', 'any', 'signals', 'hidden', 'in', 'high', 'dimensional', 'noise', 'data', 'therefore', 'we', 'study', 'the', 'family', 'of', 'goodnessoffit', 'tests', 'based', 'on', 'phidivergences', 'including', 'the', 'test', 'of', 'berk'... | [-0.049976027287180244, 0.03778685699394755, -0.0809232074205714, 0.10296586602179775, -0.06397908949470929, -0.13597436442985447, 0.04521910531023332, 0.3612418124409577, -0.22094093761220496, -0.3023314664659325, 0.1516944465648653, -0.24401538155062963, -0.16881020317024742, 0.19151721122312068, -0.07840051949255254... |
1,803.0652 | Analysis of Triplet Motifs in Biological Signed Oriented Graphs Suggests
a Relationship Between Fine Topology and Function | Background: Networks in different domains are characterized by similar global
characteristics while differing in local structures. To further extend this
concept, we investigated network regularities on a fine scale in order to
examine the functional impact of recurring motifs in signed oriented biological
networks. ... | q-bio.MN cs.LG | background networks in different domains are characterized by similar global characteristics while differing in local structures to further extend this concept we investigated network regularities on a fine scale in order to examine the functional impact of recurring motifs in signed oriented biological networks in thi... | [['background', 'networks', 'in', 'different', 'domains', 'are', 'characterized', 'by', 'similar', 'global', 'characteristics', 'while', 'differing', 'in', 'local', 'structures', 'to', 'further', 'extend', 'this', 'concept', 'we', 'investigated', 'network', 'regularities', 'on', 'a', 'fine', 'scale', 'in', 'order', 'to... | [-0.11272818525739305, 0.06223080652070385, -0.025220332851924224, 0.1195473419185551, -0.10276414522015045, -0.1593342706853846, 0.08473120851919054, 0.4396401049828605, -0.25049019531339, -0.313908394323937, 0.06798794079829353, -0.2703163814298683, -0.20274895774485457, 0.14465760167212646, -0.060552157482273786, 0.... |
1,803.06521 | Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their
Applications | We introduce the problem of learning mixtures of $k$ subcubes over
$\{0,1\}^n$, which contains many classic learning theory problems as a special
case (and is itself a special case of others). We give a surprising $n^{O(\log
k)}$-time learning algorithm based on higher-order multilinear moments. It is
not possible to... | cs.LG cs.CC cs.DS stat.ML | we introduce the problem of learning mixtures of k subcubes over 01n which contains many classic learning theory problems as a special case and is itself a special case of others we give a surprising nolog ktime learning algorithm based on higherorder multilinear moments it is not possible to learn the parameters becau... | [['we', 'introduce', 'the', 'problem', 'of', 'learning', 'mixtures', 'of', 'k', 'subcubes', 'over', '01n', 'which', 'contains', 'many', 'classic', 'learning', 'theory', 'problems', 'as', 'a', 'special', 'case', 'and', 'is', 'itself', 'a', 'special', 'case', 'of', 'others', 'we', 'give', 'a', 'surprising', 'nolog', 'kti... | [-0.06897672271525318, 0.0830974976699376, -0.07509930134750903, 0.0838956459294158, -0.09889625638892705, -0.16881053343415262, 0.09965238265248692, 0.37685209374197504, -0.2915477536622943, -0.33368738428943534, 0.07646029421424662, -0.2394114071554081, -0.17746096070855855, 0.1757663234511115, -0.07977465566163036, ... |
1,803.06522 | Fragment Distribution in Reactions of $^{78,86}$Kr+$^{181}$Ta | Within the framework of the isospin-dependent quantum molecular dynamics
model along with the GEMINI model, the reaction of $^{86}$Kr+$^{181}$Ta at
80,120 and 160 MeV/nucleon and the reaction of $^{78}$Kr+$^{181}$Ta at 160
MeV/nucleon are studied, and the production cross sections of the generated
fragments are calcu... | nucl-th | within the framework of the isospindependent quantum molecular dynamics model along with the gemini model the reaction of 86kr181ta at 80120 and 160 mevnucleon and the reaction of 78kr181ta at 160 mevnucleon are studied and the production cross sections of the generated fragments are calculated more intermediate and la... | [['within', 'the', 'framework', 'of', 'the', 'isospindependent', 'quantum', 'molecular', 'dynamics', 'model', 'along', 'with', 'the', 'gemini', 'model', 'the', 'reaction', 'of', '86kr181ta', 'at', '80120', 'and', '160', 'mevnucleon', 'and', 'the', 'reaction', 'of', '78kr181ta', 'at', '160', 'mevnucleon', 'are', 'studie... | [-0.030819596182650972, 0.22163450852343716, -0.03839558491947792, 0.07432437469203447, 0.0831068198090976, -0.08476226429752622, 0.0022469486863611592, 0.3547931553546301, -0.22908024615896194, -0.3301648605499685, -0.05637455209561614, -0.372328195538487, 0.04701702099907951, 0.1744666640435528, 0.12964763444579525, ... |
1,803.06523 | Stochastic model-based minimization of weakly convex functions | We consider a family of algorithms that successively sample and minimize
simple stochastic models of the objective function. We show that under
reasonable conditions on approximation quality and regularity of the models,
any such algorithm drives a natural stationarity measure to zero at the rate
$O(k^{-1/4})$. As a ... | math.OC cs.LG | we consider a family of algorithms that successively sample and minimize simple stochastic models of the objective function we show that under reasonable conditions on approximation quality and regularity of the models any such algorithm drives a natural stationarity measure to zero at the rate ok14 as a consequence we... | [['we', 'consider', 'a', 'family', 'of', 'algorithms', 'that', 'successively', 'sample', 'and', 'minimize', 'simple', 'stochastic', 'models', 'of', 'the', 'objective', 'function', 'we', 'show', 'that', 'under', 'reasonable', 'conditions', 'on', 'approximation', 'quality', 'and', 'regularity', 'of', 'the', 'models', 'an... | [-0.09513134034695449, -0.02680739989683153, -0.10666818610151056, 0.12150641166329108, -0.05816197991888556, -0.1250955226900125, 0.07641071408159203, 0.4012113741357569, -0.3487237891527238, -0.24247817840703106, 0.11629217887314519, -0.20190772648568747, -0.15887595629492016, 0.22036884260812292, -0.1219909633337347... |
1,803.06524 | SeqFace: Make full use of sequence information for face recognition | Deep convolutional neural networks (CNNs) have greatly improved the Face
Recognition (FR) performance in recent years. Almost all CNNs in FR are trained
on the carefully labeled datasets containing plenty of identities. However,
such high-quality datasets are very expensive to collect, which restricts many
researcher... | cs.CV | deep convolutional neural networks cnns have greatly improved the face recognition fr performance in recent years almost all cnns in fr are trained on the carefully labeled datasets containing plenty of identities however such highquality datasets are very expensive to collect which restricts many researchers to achiev... | [['deep', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'greatly', 'improved', 'the', 'face', 'recognition', 'fr', 'performance', 'in', 'recent', 'years', 'almost', 'all', 'cnns', 'in', 'fr', 'are', 'trained', 'on', 'the', 'carefully', 'labeled', 'datasets', 'containing', 'plenty', 'of', 'identities', 'however... | [-0.029909367289704582, -0.05986352970115452, -0.025392859590550265, 0.05647198015435909, -0.1362877995427698, -0.22932410035903256, -0.025472238272583735, 0.5017064937669784, -0.2514925868685047, -0.3485337348965307, 0.07853196296220025, -0.33122652865946295, -0.1741093053870524, 0.21179055832326413, -0.20329078375361... |
1,803.06525 | A Benchmark Study on Sentiment Analysis for Software Engineering
Research | A recent research trend has emerged to identify developers' emotions, by
applying sentiment analysis to the content of communication traces left in
collaborative development environments. Trying to overcome the limitations
posed by using off-the-shelf sentiment analysis tools, researchers recently
started to develop ... | cs.SE | a recent research trend has emerged to identify developers emotions by applying sentiment analysis to the content of communication traces left in collaborative development environments trying to overcome the limitations posed by using offtheshelf sentiment analysis tools researchers recently started to develop their ow... | [['a', 'recent', 'research', 'trend', 'has', 'emerged', 'to', 'identify', 'developers', 'emotions', 'by', 'applying', 'sentiment', 'analysis', 'to', 'the', 'content', 'of', 'communication', 'traces', 'left', 'in', 'collaborative', 'development', 'environments', 'trying', 'to', 'overcome', 'the', 'limitations', 'posed',... | [-0.05854469511948366, -0.048274215711380845, -0.09109262708431831, 0.07231756773907491, -0.17287528497837884, -0.1582392448038664, 0.0914211078829843, 0.4333751244891074, -0.24811008255127617, -0.359106606964062, 0.14834146627966033, -0.3188917689245715, -0.17967599249815427, 0.216436349105851, -0.11267320745654645, 0... |
1,803.06526 | Titanium diboride ceramics for solar thermal absorbers | Titanium diboride (TiB2) is a low-density refractory material belonging to
the family of ultra-high temperature ceramics (UHTCs). This paper reports on
the production and microstructural and optical characterization of nearly fully
dense TiB2, with particular interest to its potential utilization as novel
thermal sol... | physics.app-ph cond-mat.mtrl-sci | titanium diboride tib2 is a lowdensity refractory material belonging to the family of ultrahigh temperature ceramics uhtcs this paper reports on the production and microstructural and optical characterization of nearly fully dense tib2 with particular interest to its potential utilization as novel thermal solar absorbe... | [['titanium', 'diboride', 'tib2', 'is', 'a', 'lowdensity', 'refractory', 'material', 'belonging', 'to', 'the', 'family', 'of', 'ultrahigh', 'temperature', 'ceramics', 'uhtcs', 'this', 'paper', 'reports', 'on', 'the', 'production', 'and', 'microstructural', 'and', 'optical', 'characterization', 'of', 'nearly', 'fully', ... | [-0.03327247322836922, 0.17964262164087366, -0.04341371020823086, -0.10209901233586499, -0.005154904421079525, -0.09335964139140511, 0.05356370769658173, 0.40273272752035727, -0.25025566640483626, -0.3342826514212825, 0.057243014014941654, -0.3127481311054553, -0.06012407164049919, 0.19128650902786246, -0.0426056750979... |
1,803.06527 | Presence of horizon makes particle motion chaotic | We analyze the motion of a {\it massless} and {\it chargeless} particle very
near to the event horizon. It reveals that the radial motion has exponential
growing nature which indicates that there is a possibility of inducing chaos in
the particle motion of an integrable system when it comes under the influence
of the... | gr-qc astro-ph.GA hep-th nlin.CD | we analyze the motion of a it massless and it chargeless particle very near to the event horizon it reveals that the radial motion has exponential growing nature which indicates that there is a possibility of inducing chaos in the particle motion of an integrable system when it comes under the influence of the horizon ... | [['we', 'analyze', 'the', 'motion', 'of', 'a', 'it', 'massless', 'and', 'it', 'chargeless', 'particle', 'very', 'near', 'to', 'the', 'event', 'horizon', 'it', 'reveals', 'that', 'the', 'radial', 'motion', 'has', 'exponential', 'growing', 'nature', 'which', 'indicates', 'that', 'there', 'is', 'a', 'possibility', 'of', '... | [-0.18895155348177972, 0.14155333473910206, -0.11973352871427778, 0.0889284621694565, -0.04756374562930432, -0.14230349083663896, -0.020240725254148453, 0.3135900410785932, -0.2098371375112846, -0.24759958702553478, 0.1113265383222218, -0.2975394529510393, -0.1392675677392011, 0.19307098189407648, -0.03495834907678525,... |
1,803.06528 | Optical properties of dense zirconium and tantalum diborides for solar
thermal absorbers | Ultra-high temperature ceramics (UHTCs) are interesting materials for a large
variety of applications under extreme conditions. This paper reports on the
production and extensive characterization of highly dense, pure zirconium and
tantalum diborides, with particular interest to their potential utilization in
the the... | cond-mat.mtrl-sci | ultrahigh temperature ceramics uhtcs are interesting materials for a large variety of applications under extreme conditions this paper reports on the production and extensive characterization of highly dense pure zirconium and tantalum diborides with particular interest to their potential utilization in the thermal sol... | [['ultrahigh', 'temperature', 'ceramics', 'uhtcs', 'are', 'interesting', 'materials', 'for', 'a', 'large', 'variety', 'of', 'applications', 'under', 'extreme', 'conditions', 'this', 'paper', 'reports', 'on', 'the', 'production', 'and', 'extensive', 'characterization', 'of', 'highly', 'dense', 'pure', 'zirconium', 'and'... | [-0.044484085849931104, 0.17455409464190466, -0.03348670880755048, -0.018838165383507955, 0.002509352168130841, -0.11830514418169745, 0.02313293501432401, 0.4792177316579801, -0.21028860940584052, -0.313979480471184, 0.10641697330796507, -0.28829638793397305, -0.0937561633937589, 0.23596882830902155, -0.020934858852858... |
1,803.06529 | Connecting Coronal Mass Ejections to their Solar Active Region Sources:
Combining Results from the HELCATS and FLARECAST Projects | Coronal mass ejections (CMEs) and other solar eruptive phenomena can be
physically linked by combining data from a multitude of ground-based and
space-based instruments alongside models, however this can be challenging for
automated operational systems. The EU Framework Package 7 HELCATS project
provides catalogues o... | astro-ph.SR | coronal mass ejections cmes and other solar eruptive phenomena can be physically linked by combining data from a multitude of groundbased and spacebased instruments alongside models however this can be challenging for automated operational systems the eu framework package 7 helcats project provides catalogues of cme ob... | [['coronal', 'mass', 'ejections', 'cmes', 'and', 'other', 'solar', 'eruptive', 'phenomena', 'can', 'be', 'physically', 'linked', 'by', 'combining', 'data', 'from', 'a', 'multitude', 'of', 'groundbased', 'and', 'spacebased', 'instruments', 'alongside', 'models', 'however', 'this', 'can', 'be', 'challenging', 'for', 'aut... | [-0.05764423356477862, 0.14140353441401995, -0.03908366912078383, 0.11954665487686608, -0.11471173167416465, -0.05076621239066064, 0.006507407193214843, 0.42791413313769283, -0.17664172512013465, -0.42632801888037414, 0.09812435670286387, -0.25867192736346156, -0.09605888274522693, 0.2741023417115831, -0.06160753952715... |
1,803.0653 | Designing Quantum Router in IBM Quantum Computer | Quantum router is an essential ingredient in a quantum network. Here, we
propose a new quantum circuit for designing quantum router by using IBM's
five-qubit quantum computer. We design an equivalent quantum circuit, by the
means of single-qubit and two-qubit quantum gates, which can perform the
operation of a quantu... | quant-ph | quantum router is an essential ingredient in a quantum network here we propose a new quantum circuit for designing quantum router by using ibms fivequbit quantum computer we design an equivalent quantum circuit by the means of singlequbit and twoqubit quantum gates which can perform the operation of a quantum router he... | [['quantum', 'router', 'is', 'an', 'essential', 'ingredient', 'in', 'a', 'quantum', 'network', 'here', 'we', 'propose', 'a', 'new', 'quantum', 'circuit', 'for', 'designing', 'quantum', 'router', 'by', 'using', 'ibms', 'fivequbit', 'quantum', 'computer', 'we', 'design', 'an', 'equivalent', 'quantum', 'circuit', 'by', 't... | [-0.17715919005377706, 0.16769255548129922, -0.06561850823237803, 0.0028254527687413093, 0.013356386354756484, -0.213953865568418, 0.0788929002204289, 0.4102557324286964, -0.2751742200466034, -0.29080125374753996, 0.07986102454122845, -0.26317052642906796, -0.15349648307066088, 0.24121868313738593, -0.05596846804586181... |
1,803.06531 | Topology Estimation using Graphical Models in Multi-Phase Power
Distribution Grids | Distribution grid is the medium and low voltage part of a large power system.
Structurally, the majority of distribution networks operate radially, such that
energized lines form a collection of trees, i.e. forest, with a substation
being at the root of any tree. The operational topology/forest may change from
time t... | cs.SY math.OC stat.ML | distribution grid is the medium and low voltage part of a large power system structurally the majority of distribution networks operate radially such that energized lines form a collection of trees ie forest with a substation being at the root of any tree the operational topologyforest may change from time to time howe... | [['distribution', 'grid', 'is', 'the', 'medium', 'and', 'low', 'voltage', 'part', 'of', 'a', 'large', 'power', 'system', 'structurally', 'the', 'majority', 'of', 'distribution', 'networks', 'operate', 'radially', 'such', 'that', 'energized', 'lines', 'form', 'a', 'collection', 'of', 'trees', 'ie', 'forest', 'with', 'a'... | [-0.15153348746460368, 0.07525546623893627, -0.0564079683017775, 0.01612213881694848, -0.0498555631805552, -0.15893725846701007, 0.07708266916757212, 0.38447373785879235, -0.27381033810684685, -0.31432263114739484, 0.10986082675148415, -0.25730965878223866, -0.08208637991522598, 0.20829355430671456, -0.1154538473964771... |
1,803.06532 | Highly charged ions: optical clocks and applications in fundamental
physics | Recent developments in frequency metrology and optical clocks have been based
on electronic transitions in atoms and singly charged ions as references. These
systems have enabled relative frequency uncertainties at a level of a few parts
in $10^{-18}$. This accomplishment not only allows for extremely accurate time
a... | physics.atom-ph | recent developments in frequency metrology and optical clocks have been based on electronic transitions in atoms and singly charged ions as references these systems have enabled relative frequency uncertainties at a level of a few parts in 1018 this accomplishment not only allows for extremely accurate time and frequen... | [['recent', 'developments', 'in', 'frequency', 'metrology', 'and', 'optical', 'clocks', 'have', 'been', 'based', 'on', 'electronic', 'transitions', 'in', 'atoms', 'and', 'singly', 'charged', 'ions', 'as', 'references', 'these', 'systems', 'have', 'enabled', 'relative', 'frequency', 'uncertainties', 'at', 'a', 'level', ... | [-0.0875688475694377, 0.19300418567448738, -0.004609209567794018, 0.04097889548852489, -0.0359067154272753, -0.14954961995605076, 0.05887584911717341, 0.3743632787001475, -0.22017646046488543, -0.3462572274131679, 0.0808783612827361, -0.2717950950379068, -0.06274079217426913, 0.21234817931053485, -0.018507514929884488,... |
1,803.06533 | Moduli of quiver representations for exceptional collections on surfaces | Suppose $S$ is a smooth projective surface over an algebraically closed field
$k$, $\mathcal{L}=\{L_1,\ldots,L_n\}$ is a full strong exceptional collection
of line bundles on $S$. Let $Q$ be the quiver associated to this collection.
One might hope that $S$ is the moduli space of representations of $Q$ with
dimension ... | math.AG | suppose s is a smooth projective surface over an algebraically closed field k mathcalll_1ldotsl_n is a full strong exceptional collection of line bundles on s let q be the quiver associated to this collection one might hope that s is the moduli space of representations of q with dimension vector 1ldots1 for a suitably ... | [['suppose', 's', 'is', 'a', 'smooth', 'projective', 'surface', 'over', 'an', 'algebraically', 'closed', 'field', 'k', 'mathcalll_1ldotsl_n', 'is', 'a', 'full', 'strong', 'exceptional', 'collection', 'of', 'line', 'bundles', 'on', 's', 'let', 'q', 'be', 'the', 'quiver', 'associated', 'to', 'this', 'collection', 'one', ... | [-0.21244498622337624, 0.1024878989059722, -0.09617596485518984, 0.01649037616970461, -0.07583779269119813, -0.16904190305975222, 0.008091482403688132, 0.3557317481154487, -0.3359533170504229, -0.19003153989712399, 0.05848352426602062, -0.24667775423842528, -0.1369849898408921, 0.19449180365495738, -0.14796894717784154... |
1,803.06534 | LoRa Throughput Analysis with Imperfect Spreading Factor Orthogonality | LoRa is one of the promising techniques for enabling Low Power Wide Area
Networks (LPWANs) for future Internet-of-Things (IoT) devices. Although LoRa
allows flexible adaptations of coverage and data rates, it is subject to
intrinsic types of interferences: co-SF interferences where end-devices with
the same Spreading... | cs.NI | lora is one of the promising techniques for enabling low power wide area networks lpwans for future internetofthings iot devices although lora allows flexible adaptations of coverage and data rates it is subject to intrinsic types of interferences cosf interferences where enddevices with the same spreading factors sfs ... | [['lora', 'is', 'one', 'of', 'the', 'promising', 'techniques', 'for', 'enabling', 'low', 'power', 'wide', 'area', 'networks', 'lpwans', 'for', 'future', 'internetofthings', 'iot', 'devices', 'although', 'lora', 'allows', 'flexible', 'adaptations', 'of', 'coverage', 'and', 'data', 'rates', 'it', 'is', 'subject', 'to', '... | [-0.20776525056406633, 0.02152918163450685, -0.032467732821076886, 0.05282816522165702, -0.05041276494305191, -0.16615582754793787, 0.06840501612733438, 0.398630687355328, -0.21767677592700904, -0.2822919816174892, 0.0537193715337789, -0.2741232371400154, -0.13817962167225084, 0.19054177940698036, -0.09904593449614163,... |
1,803.06535 | Dear Sir or Madam, May I introduce the GYAFC Dataset: Corpus, Benchmarks
and Metrics for Formality Style Transfer | Style transfer is the task of automatically transforming a piece of text in
one particular style into another. A major barrier to progress in this field
has been a lack of training and evaluation datasets, as well as benchmarks and
automatic metrics. In this work, we create the largest corpus for a particular
stylist... | cs.CL | style transfer is the task of automatically transforming a piece of text in one particular style into another a major barrier to progress in this field has been a lack of training and evaluation datasets as well as benchmarks and automatic metrics in this work we create the largest corpus for a particular stylistic tra... | [['style', 'transfer', 'is', 'the', 'task', 'of', 'automatically', 'transforming', 'a', 'piece', 'of', 'text', 'in', 'one', 'particular', 'style', 'into', 'another', 'a', 'major', 'barrier', 'to', 'progress', 'in', 'this', 'field', 'has', 'been', 'a', 'lack', 'of', 'training', 'and', 'evaluation', 'datasets', 'as', 'we... | [-0.0556630772124562, -0.01599605962128183, -0.06962204986700306, 0.08803150901013272, -0.139848392393532, -0.11785002222951547, 0.02923420460227831, 0.4461220760404328, -0.2572798819890545, -0.34042108576905766, 0.1216084274339754, -0.2745528786247711, -0.1672216294632282, 0.2549770010382305, -0.12436463112402478, 0.0... |
1,803.06536 | Optimal Design of Experiments for Nonlinear Response Surface Models | Many chemical and biological experiments involve multiple treatment factors
and often it is convenient to fit a nonlinear model in these factors. This
nonlinear model can be mechanistic, empirical or a hybrid of the two. Motivated
by experiments in chemical engineering, we focus on D-optimal design for
multifactor no... | stat.CO stat.AP | many chemical and biological experiments involve multiple treatment factors and often it is convenient to fit a nonlinear model in these factors this nonlinear model can be mechanistic empirical or a hybrid of the two motivated by experiments in chemical engineering we focus on doptimal design for multifactor nonlinear... | [['many', 'chemical', 'and', 'biological', 'experiments', 'involve', 'multiple', 'treatment', 'factors', 'and', 'often', 'it', 'is', 'convenient', 'to', 'fit', 'a', 'nonlinear', 'model', 'in', 'these', 'factors', 'this', 'nonlinear', 'model', 'can', 'be', 'mechanistic', 'empirical', 'or', 'a', 'hybrid', 'of', 'the', 't... | [-0.047948749831822866, 0.017515008427797497, -0.06253809963564287, 0.07332200990004677, -0.10629794672679375, -0.191354403886631, 0.02979192738773442, 0.4530735213716491, -0.24496110181222444, -0.30253041733619795, 0.1138481624080103, -0.21814243727903657, -0.2671466286571994, 0.2638445778636403, -0.056919017010329274... |
1,803.06537 | Renormalization of the Hutchinson Operator | One of the easiest and common ways of generating fractal sets in ${\mathbb
R}^D$ is as attractors of affine iterated function systems (IFS). The classic
theory of IFS's requires that they are made with contractive functions. In this
paper, we relax this hypothesis considering a new operator $H_\rho$ obtained by
renor... | math.DS | one of the easiest and common ways of generating fractal sets in mathbb rd is as attractors of affine iterated function systems ifs the classic theory of ifss requires that they are made with contractive functions in this paper we relax this hypothesis considering a new operator h_rho obtained by renormalizing the usua... | [['one', 'of', 'the', 'easiest', 'and', 'common', 'ways', 'of', 'generating', 'fractal', 'sets', 'in', 'mathbb', 'rd', 'is', 'as', 'attractors', 'of', 'affine', 'iterated', 'function', 'systems', 'ifs', 'the', 'classic', 'theory', 'of', 'ifss', 'requires', 'that', 'they', 'are', 'made', 'with', 'contractive', 'function... | [-0.10750949171420138, 0.07805953103695186, -0.0930928975077612, 0.08108881881684307, -0.0768635414764527, -0.12201419611032084, 0.03692086584421552, 0.35465667355660496, -0.31305990209984413, -0.22425141115975264, 0.12616415517389556, -0.27711455716884564, -0.17251572290635003, 0.22713627991744306, -0.0921719860415542... |
1,803.06538 | Interaction between stimulated current injection and polariton
condensate | In this paper, we see a strong effect of the injected current on the light
emission from the polariton condensate in an n-i-n structure, when we monitor
the luminescence intensity under applied bias at various pump powers. We
present here three thresholds for nonlinear increase of the intensity. We show
that small ch... | cond-mat.mes-hall | in this paper we see a strong effect of the injected current on the light emission from the polariton condensate in an nin structure when we monitor the luminescence intensity under applied bias at various pump powers we present here three thresholds for nonlinear increase of the intensity we show that small changes of... | [['in', 'this', 'paper', 'we', 'see', 'a', 'strong', 'effect', 'of', 'the', 'injected', 'current', 'on', 'the', 'light', 'emission', 'from', 'the', 'polariton', 'condensate', 'in', 'an', 'nin', 'structure', 'when', 'we', 'monitor', 'the', 'luminescence', 'intensity', 'under', 'applied', 'bias', 'at', 'various', 'pump',... | [-0.12391177770431812, 0.18027430167013536, -0.06537555162681312, 0.03898703373355291, 0.009026035922011587, -0.08405771463109953, 0.04643029987772291, 0.4432736385341098, -0.29394005959081215, -0.23620831076532783, 0.009882735954484016, -0.2963666527009592, -0.13666364145692347, 0.25186781252439067, -0.023236413929248... |
1,803.06539 | The Graph Structure of Chebyshev Polynomials over Finite Fields and
Applications | We completely describe the functional graph associated to iterations of
Chebyshev polynomials over finite fields. Then, we use our structural results
to obtain estimates for the average rho length, average number of connected
components and the expected value for the period and preperiod of iterating
Chebyshev polyno... | cs.DM math.CO | we completely describe the functional graph associated to iterations of chebyshev polynomials over finite fields then we use our structural results to obtain estimates for the average rho length average number of connected components and the expected value for the period and preperiod of iterating chebyshev polynomials | [['we', 'completely', 'describe', 'the', 'functional', 'graph', 'associated', 'to', 'iterations', 'of', 'chebyshev', 'polynomials', 'over', 'finite', 'fields', 'then', 'we', 'use', 'our', 'structural', 'results', 'to', 'obtain', 'estimates', 'for', 'the', 'average', 'rho', 'length', 'average', 'number', 'of', 'connecte... | [-0.1714058856658162, 0.10367545728234852, -0.09809085463193502, 0.025217495224577315, -0.07287796186481385, -0.056456133822335844, 0.09088183792823172, 0.34813008199822393, -0.3254308778634097, -0.24228383353019647, 0.10925247993795796, -0.26399852335453033, -0.1281996470271669, 0.20635626865848106, -0.043900718555805... |
1,803.0654 | Learning over Knowledge-Base Embeddings for Recommendation | State-of-the-art recommendation algorithms -- especially the collaborative
filtering (CF) based approaches with shallow or deep models -- usually work
with various unstructured information sources for recommendation, such as
textual reviews, visual images, and various implicit or explicit feedbacks.
Though structured... | cs.IR | stateoftheart recommendation algorithms especially the collaborative filtering cf based approaches with shallow or deep models usually work with various unstructured information sources for recommendation such as textual reviews visual images and various implicit or explicit feedbacks though structured knowledge bases ... | [['stateoftheart', 'recommendation', 'algorithms', 'especially', 'the', 'collaborative', 'filtering', 'cf', 'based', 'approaches', 'with', 'shallow', 'or', 'deep', 'models', 'usually', 'work', 'with', 'various', 'unstructured', 'information', 'sources', 'for', 'recommendation', 'such', 'as', 'textual', 'reviews', 'visu... | [-0.031703826647413814, -0.04928909933558949, -0.034145125203680446, 0.0616266132660822, -0.21310770875720333, -0.16958534728695193, 0.055218422903503844, 0.4812788868093512, -0.24227260813063037, -0.3633329731084357, 0.07055422325839937, -0.32365919091791623, -0.19024136509737316, 0.1941747629839549, -0.11164663842505... |
1,803.06541 | Adaptive strategy for superpixel-based region-growing image segmentation | This work presents a region-growing image segmentation approach based on
superpixel decomposition. From an initial contour-constrained over-segmentation
of the input image, the image segmentation is achieved by iteratively merging
similar superpixels into regions. This approach raises two key issues: (1) how
to compu... | cs.CV | this work presents a regiongrowing image segmentation approach based on superpixel decomposition from an initial contourconstrained oversegmentation of the input image the image segmentation is achieved by iteratively merging similar superpixels into regions this approach raises two key issues 1 how to compute the simi... | [['this', 'work', 'presents', 'a', 'regiongrowing', 'image', 'segmentation', 'approach', 'based', 'on', 'superpixel', 'decomposition', 'from', 'an', 'initial', 'contourconstrained', 'oversegmentation', 'of', 'the', 'input', 'image', 'the', 'image', 'segmentation', 'is', 'achieved', 'by', 'iteratively', 'merging', 'simi... | [-0.015407566047071603, -0.02256196460820572, -0.11493430624600971, 0.07302417192986688, -0.08540274886167552, -0.1161990589630532, 0.05252528915754014, 0.45796092622071866, -0.2510878542053839, -0.3484815115232514, 0.08242553625261434, -0.2546830641692932, -0.13507806642418616, 0.13554071896451425, -0.1131991035526222... |
1,803.06542 | Convolutional Point-set Representation: A Convolutional Bridge Between a
Densely Annotated Image and 3D Face Alignment | We present a robust method for estimating the facial pose and shape
information from a densely annotated facial image. The method relies on
Convolutional Point-set Representation (CPR), a carefully designed matrix
representation to summarize different layers of information encoded in the set
of detected points in the... | cs.CV cs.GR | we present a robust method for estimating the facial pose and shape information from a densely annotated facial image the method relies on convolutional pointset representation cpr a carefully designed matrix representation to summarize different layers of information encoded in the set of detected points in the annota... | [['we', 'present', 'a', 'robust', 'method', 'for', 'estimating', 'the', 'facial', 'pose', 'and', 'shape', 'information', 'from', 'a', 'densely', 'annotated', 'facial', 'image', 'the', 'method', 'relies', 'on', 'convolutional', 'pointset', 'representation', 'cpr', 'a', 'carefully', 'designed', 'matrix', 'representation'... | [-0.06553889303032462, -0.002856813898454393, -0.03259482168271179, 0.05034227222639915, -0.0723258979694798, -0.1621490861534288, 0.034246483648860314, 0.4499083843057681, -0.27667364948401935, -0.3493286265245481, 0.06270986017961687, -0.2644071576991581, -0.17516059775929355, 0.1695363052565147, -0.1628382089629508,... |
1,803.06543 | The parametrix method for parabolic SPDEs | We consider the Cauchy problem for a linear stochastic partial differential
equation. By extending the parametrix method for PDEs whose coefficients are
only measurable with respect to the time variable, we prove existence,
regularity in H\"older classes and estimates from above and below of the
fundamental solution.... | math.PR math.AP | we consider the cauchy problem for a linear stochastic partial differential equation by extending the parametrix method for pdes whose coefficients are only measurable with respect to the time variable we prove existence regularity in holder classes and estimates from above and below of the fundamental solution this re... | [['we', 'consider', 'the', 'cauchy', 'problem', 'for', 'a', 'linear', 'stochastic', 'partial', 'differential', 'equation', 'by', 'extending', 'the', 'parametrix', 'method', 'for', 'pdes', 'whose', 'coefficients', 'are', 'only', 'measurable', 'with', 'respect', 'to', 'the', 'time', 'variable', 'we', 'prove', 'existence'... | [-0.08968185874206634, 0.05835013946518302, -0.07908541681865851, 0.03475393045693636, -0.11971641346812248, -0.11685206249977152, 0.028185667428188024, 0.2886964107801517, -0.3774998383969069, -0.2230271876238597, 0.17479441239653776, -0.2913823051253955, -0.13371203149358432, 0.2278623649974664, -0.08048360977321863,... |
1,803.06544 | Long ligands reinforce biological adhesion under shear flow | In this work the computer modeling has been used to show that longer ligands
allow biological cells (e.g., blood platelets) to withstand stronger flows
after their adhesion to solid walls. Mechanistic model of polymer-mediated
ligand-receptor adhesion between a microparticle (cell) and a flat wall has
been developed.... | cond-mat.soft physics.bio-ph q-bio.CB | in this work the computer modeling has been used to show that longer ligands allow biological cells eg blood platelets to withstand stronger flows after their adhesion to solid walls mechanistic model of polymermediated ligandreceptor adhesion between a microparticle cell and a flat wall has been developed theoretical ... | [['in', 'this', 'work', 'the', 'computer', 'modeling', 'has', 'been', 'used', 'to', 'show', 'that', 'longer', 'ligands', 'allow', 'biological', 'cells', 'eg', 'blood', 'platelets', 'to', 'withstand', 'stronger', 'flows', 'after', 'their', 'adhesion', 'to', 'solid', 'walls', 'mechanistic', 'model', 'of', 'polymermediate... | [-0.043795333890353935, 0.12907092781080043, -0.09958845850847223, 0.021573984240839148, -0.06067097622572499, -0.18237285307772896, 0.05229021864669288, 0.4241367138483945, -0.21142559273113662, -0.28591467575854895, 0.037561127177768334, -0.21149060056572233, -0.24504699175629546, 0.20923902466619276, -0.086629024115... |
1,803.06545 | Improving Vulnerability Inspection Efficiency Using Active Learning | Software engineers can find vulnerabilities with less effort if they are
directed towards code that might contain more vulnerabilities. HARMLESS is an
incremental support vector machine tool that builds a vulnerability prediction
model from the sourcecode inspected to date, then suggests what source code
files should... | cs.SE | software engineers can find vulnerabilities with less effort if they are directed towards code that might contain more vulnerabilities harmless is an incremental support vector machine tool that builds a vulnerability prediction model from the sourcecode inspected to date then suggests what source code files should be ... | [['software', 'engineers', 'can', 'find', 'vulnerabilities', 'with', 'less', 'effort', 'if', 'they', 'are', 'directed', 'towards', 'code', 'that', 'might', 'contain', 'more', 'vulnerabilities', 'harmless', 'is', 'an', 'incremental', 'support', 'vector', 'machine', 'tool', 'that', 'builds', 'a', 'vulnerability', 'predic... | [-0.11125474963969087, 0.05396970050145124, -0.017706391031958944, 0.10441933900203033, -0.09555124945880605, -0.21882823341189075, 0.14605122685508534, 0.3436485993809969, -0.219183337312112, -0.41674173131027054, 0.1301656816818784, -0.32508811426388845, -0.08547789655111238, 0.21795629571076003, -0.10831142111986397... |
1,803.06546 | Microscale resolution thermal mapping using a flexible platform of
patterned quantum sensors | Temperature sensors with micro- and nanoscale spatial resolution have long
been explored for their potential to investigate the details of physical
systems at an unprecedented scale. In particular, the rapid miniaturization of
transistor technology, with the associated steep boost in power density, calls
for sensors ... | physics.app-ph cond-mat.mes-hall | temperature sensors with micro and nanoscale spatial resolution have long been explored for their potential to investigate the details of physical systems at an unprecedented scale in particular the rapid miniaturization of transistor technology with the associated steep boost in power density calls for sensors that ac... | [['temperature', 'sensors', 'with', 'micro', 'and', 'nanoscale', 'spatial', 'resolution', 'have', 'long', 'been', 'explored', 'for', 'their', 'potential', 'to', 'investigate', 'the', 'details', 'of', 'physical', 'systems', 'at', 'an', 'unprecedented', 'scale', 'in', 'particular', 'the', 'rapid', 'miniaturization', 'of'... | [-0.09361728690661646, 0.14203520763224403, -0.01632087202802396, -0.03522732266141341, -0.03862197633283452, -0.1564499555265334, 0.02074549211195121, 0.46806368846088076, -0.23009201406071392, -0.3523493352680443, 0.08712473457517962, -0.2795232167298262, -0.09000455369562424, 0.24848508097616454, -0.0218097796791997... |
1,803.06547 | Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms | We introduce Meta-F*, a tactics and metaprogramming framework for the F*
program verifier. The main novelty of Meta-F* is allowing the use of tactics
and metaprogramming to discharge assertions not solvable by SMT, or to just
simplify them into well-behaved SMT fragments. Plus, Meta-F* can be used to
generate verifie... | cs.PL cs.LO | we introduce metaf a tactics and metaprogramming framework for the f program verifier the main novelty of metaf is allowing the use of tactics and metaprogramming to discharge assertions not solvable by smt or to just simplify them into wellbehaved smt fragments plus metaf can be used to generate verified code automati... | [['we', 'introduce', 'metaf', 'a', 'tactics', 'and', 'metaprogramming', 'framework', 'for', 'the', 'f', 'program', 'verifier', 'the', 'main', 'novelty', 'of', 'metaf', 'is', 'allowing', 'the', 'use', 'of', 'tactics', 'and', 'metaprogramming', 'to', 'discharge', 'assertions', 'not', 'solvable', 'by', 'smt', 'or', 'to', ... | [-0.10057832407536077, 0.013678376972374742, -0.08770696973794552, 0.08327024269536076, -0.13141056990678437, -0.21230062155709525, 0.05329423832905586, 0.3713979875271926, -0.26635333859804466, -0.3499306935023089, 0.09720475721214974, -0.19623747335166716, -0.05798234710790461, 0.23595949274976355, -0.079371289205050... |
1,803.06548 | Perpetual emulation threshold of PT-symmetric Hamiltonians | We describe a technique to emulate a two-level \PT-symmetric spin
Hamiltonian, replete with gain and loss, using only the unitary dynamics of a
larger quantum system. This we achieve by embedding the two-level system in
question in a subspace of a four-level Hamiltonian. Using an \textit{amplitude
recycling} scheme t... | quant-ph cond-mat.quant-gas | we describe a technique to emulate a twolevel ptsymmetric spin hamiltonian replete with gain and loss using only the unitary dynamics of a larger quantum system this we achieve by embedding the twolevel system in question in a subspace of a fourlevel hamiltonian using an textitamplitude recycling scheme that couples th... | [['we', 'describe', 'a', 'technique', 'to', 'emulate', 'a', 'twolevel', 'ptsymmetric', 'spin', 'hamiltonian', 'replete', 'with', 'gain', 'and', 'loss', 'using', 'only', 'the', 'unitary', 'dynamics', 'of', 'a', 'larger', 'quantum', 'system', 'this', 'we', 'achieve', 'by', 'embedding', 'the', 'twolevel', 'system', 'in', ... | [-0.1570874281514819, 0.1719560425296898, -0.04339079679399033, 0.0211563681722314, -0.015166662737866429, -0.18428248865529895, 0.023783402293311242, 0.4040257502173152, -0.2565889849771406, -0.2645914999541835, 0.007820467982510819, -0.23486973923221927, -0.15800011399959293, 0.15040206223308483, -0.03812459258310427... |
1,803.06549 | Low-Order Control Design using a Reduced-Order Model with a Stability
Constraint on the Full-Order Model | We consider low-order controller design for large-scale linear time-invariant
dynamical systems with inputs and outputs. Model order reduction is a popular
technique, but controllers designed for reduced-order models may result in
unstable closed-loop plants when applied to the full-order system. We introduce
a new m... | math.OC | we consider loworder controller design for largescale linear timeinvariant dynamical systems with inputs and outputs model order reduction is a popular technique but controllers designed for reducedorder models may result in unstable closedloop plants when applied to the fullorder system we introduce a new method to de... | [['we', 'consider', 'loworder', 'controller', 'design', 'for', 'largescale', 'linear', 'timeinvariant', 'dynamical', 'systems', 'with', 'inputs', 'and', 'outputs', 'model', 'order', 'reduction', 'is', 'a', 'popular', 'technique', 'but', 'controllers', 'designed', 'for', 'reducedorder', 'models', 'may', 'result', 'in', ... | [-0.0943412363154908, -0.04314870656691963, -0.07232855874444565, 0.061123514274589105, -0.08375787575245847, -0.21467142225069266, -0.022843082806779238, 0.3766527989749573, -0.31930104636033124, -0.29807017891685467, 0.17152768283009623, -0.19835801502281528, -0.17563411952998442, 0.23021504367978748, -0.109776384279... |
1,803.0655 | On Mahalanobis distance in functional settings | Mahalanobis distance is a classical tool in multivariate analysis. We suggest
here an extension of this concept to the case of functional data. More
precisely, the proposed definition concerns those statistical problems where
the sample data are real functions defined on a compact interval of the real
line. The obvio... | stat.ME | mahalanobis distance is a classical tool in multivariate analysis we suggest here an extension of this concept to the case of functional data more precisely the proposed definition concerns those statistical problems where the sample data are real functions defined on a compact interval of the real line the obvious dif... | [['mahalanobis', 'distance', 'is', 'a', 'classical', 'tool', 'in', 'multivariate', 'analysis', 'we', 'suggest', 'here', 'an', 'extension', 'of', 'this', 'concept', 'to', 'the', 'case', 'of', 'functional', 'data', 'more', 'precisely', 'the', 'proposed', 'definition', 'concerns', 'those', 'statistical', 'problems', 'wher... | [-0.06619601523290562, 0.02431339649289536, -0.10902876927422643, 0.11648768727839827, -0.10113465915944449, -0.10300319302711362, -2.175707522632375e-05, 0.38899521855900515, -0.2788249620967834, -0.24968015878214, 0.13554166889082545, -0.2948019873156175, -0.17533982011139668, 0.23769571727909947, -0.1120635218231670... |
1,803.06551 | A new elliptical-beam method based on time-domain thermoreflectance
(TDTR) to measure the in-plane anisotropic thermal conductivity and its
comparison with the beam-offset method | Materials lacking in-plane symmetry are ubiquitous in a wide range of
applications such as electronics, thermoelectrics, and high-temperature
superconductors, in all of which the thermal properties of the materials play a
critical part. However, very few experimental techniques can be used to measure
in-plane anisotr... | physics.app-ph | materials lacking inplane symmetry are ubiquitous in a wide range of applications such as electronics thermoelectrics and hightemperature superconductors in all of which the thermal properties of the materials play a critical part however very few experimental techniques can be used to measure inplane anisotropic therm... | [['materials', 'lacking', 'inplane', 'symmetry', 'are', 'ubiquitous', 'in', 'a', 'wide', 'range', 'of', 'applications', 'such', 'as', 'electronics', 'thermoelectrics', 'and', 'hightemperature', 'superconductors', 'in', 'all', 'of', 'which', 'the', 'thermal', 'properties', 'of', 'the', 'materials', 'play', 'a', 'critica... | [-0.1335699556276445, 0.1391629318645121, -0.10272316084952053, -0.011548812484899276, -0.0964029884537259, -0.12252870808722845, 0.0304005679950875, 0.47354353888635614, -0.2529880734683716, -0.28004924698818134, 0.09574982331438636, -0.26717902648733904, -0.07777972813172496, 0.26678548937578095, 0.004929743890847224... |
1,803.06552 | Generators of semigroups on Banach spaces inducing holomorphic semiflows | Let $A$ be the generator of a $C_0$-semigroup $T$ on a Banach space of
analytic functions on the open unit disc. If $T$ consists of composition
operators, then there exists a holomorphic function $G:{\mathbb D}\to{\mathbb
C}$ such that $Af=Gf'$ with maximal domain. The aim of the paper is the study
of the reciprocal ... | math.FA | let a be the generator of a c_0semigroup t on a banach space of analytic functions on the open unit disc if t consists of composition operators then there exists a holomorphic function gmathbb dtomathbb c such that afgf with maximal domain the aim of the paper is the study of the reciprocal implication | [['let', 'a', 'be', 'the', 'generator', 'of', 'a', 'c_0semigroup', 't', 'on', 'a', 'banach', 'space', 'of', 'analytic', 'functions', 'on', 'the', 'open', 'unit', 'disc', 'if', 't', 'consists', 'of', 'composition', 'operators', 'then', 'there', 'exists', 'a', 'holomorphic', 'function', 'gmathbb', 'dtomathbb', 'c', 'such... | [-0.17886343001629468, 0.11075804499840294, -0.054356125627506385, 0.008286349744863671, -0.08138286569414453, -0.06463140044016419, 0.04206041714254146, 0.3560655608911205, -0.3087564157666983, -0.11936695354611233, 0.12683460844197758, -0.27473461667627647, -0.13359717848814195, 0.2020887538480262, -0.049276444258996... |
1,803.06553 | Search for additional neutral MSSM Higgs bosons in the $\tau\tau$ final
state in proton-proton collisions at $\sqrt{s}=$ 13 TeV | A search is presented for additional neutral Higgs bosons in the $\tau\tau$
final state in proton-proton collisions at the LHC. The search is performed in
the context of the minimal supersymmetric extension of the standard model
(MSSM), using the data collected with the CMS detector in 2016 at a
center-of-mass energy... | hep-ex | a search is presented for additional neutral higgs bosons in the tautau final state in protonproton collisions at the lhc the search is performed in the context of the minimal supersymmetric extension of the standard model mssm using the data collected with the cms detector in 2016 at a centerofmass energy of 13 tev co... | [['a', 'search', 'is', 'presented', 'for', 'additional', 'neutral', 'higgs', 'bosons', 'in', 'the', 'tautau', 'final', 'state', 'in', 'protonproton', 'collisions', 'at', 'the', 'lhc', 'the', 'search', 'is', 'performed', 'in', 'the', 'context', 'of', 'the', 'minimal', 'supersymmetric', 'extension', 'of', 'the', 'standar... | [-0.03543553916882699, 0.24735550667717898, 0.031043563577948154, 0.15960607589717, -0.0042618706830637116, -0.1528661892032333, 0.11175448542323779, 0.31506567538419195, -0.15354038352420785, -0.3477981828763026, -0.0021401667200951976, -0.34193491979411483, 0.17717201774630828, 0.13024268438627498, 0.1130212713228703... |
1,803.06554 | Fusion of an Ensemble of Augmented Image Detectors for Robust Object
Detection | A significant challenge in object detection is accurate identification of an
object's position in image space, whereas one algorithm with one set of
parameters is usually not enough, and the fusion of multiple algorithms and/or
parameters can lead to more robust results. Herein, a new computational
intelligence fusio... | cs.CV cs.AI eess.IV | a significant challenge in object detection is accurate identification of an objects position in image space whereas one algorithm with one set of parameters is usually not enough and the fusion of multiple algorithms andor parameters can lead to more robust results herein a new computational intelligence fusion approa... | [['a', 'significant', 'challenge', 'in', 'object', 'detection', 'is', 'accurate', 'identification', 'of', 'an', 'objects', 'position', 'in', 'image', 'space', 'whereas', 'one', 'algorithm', 'with', 'one', 'set', 'of', 'parameters', 'is', 'usually', 'not', 'enough', 'and', 'the', 'fusion', 'of', 'multiple', 'algorithms'... | [-0.05705810321478566, 0.007817228745125249, -0.055617480604269076, 0.026691967919191484, -0.08171977050369605, -0.1578971261260449, 0.02239569956327614, 0.43765658934717067, -0.20404929177675513, -0.34941325652334854, 0.11376069563266356, -0.2643457542435499, -0.17557878650404746, 0.25756243890646147, -0.1348129376419... |
1,803.06555 | Tell Me Why Is It So? Explaining Knowledge Graph Relationships by
Finding Descriptive Support Passages | We address the problem of finding descriptive explanations of facts stored in
a knowledge graph. This is important in high-risk domains such as healthcare,
intelligence, etc. where users need additional information for decision making
and is especially crucial for applications that rely on automatically
constructed k... | cs.AI cs.IR | we address the problem of finding descriptive explanations of facts stored in a knowledge graph this is important in highrisk domains such as healthcare intelligence etc where users need additional information for decision making and is especially crucial for applications that rely on automatically constructed knowledg... | [['we', 'address', 'the', 'problem', 'of', 'finding', 'descriptive', 'explanations', 'of', 'facts', 'stored', 'in', 'a', 'knowledge', 'graph', 'this', 'is', 'important', 'in', 'highrisk', 'domains', 'such', 'as', 'healthcare', 'intelligence', 'etc', 'where', 'users', 'need', 'additional', 'information', 'for', 'decisio... | [-0.04815726674315955, 0.01014200152294114, -0.07033100288039704, 0.09453616669341225, -0.17971719511225148, -0.12934999775958897, 0.1033271200043692, 0.3944344745694304, -0.26318798413191985, -0.37123857711930924, 0.10381080211381422, -0.29598584491592034, -0.17483092648506487, 0.2042015998158604, -0.09240788136602199... |
1,803.06556 | Linearization of third-order ordinary differential equations
u'''=f(x,u,u',u'') via point transformations | The linearization problem by use of the Cartan equivalence method for scalar
third-order ODEs via point transformations was solved partially in [1,2]. In
order to solve this problem completely, the Cartan equivalence method is
applied to provide an invariant characterization of the linearizable
third-order ordinary d... | math.CA math.DG | the linearization problem by use of the cartan equivalence method for scalar thirdorder odes via point transformations was solved partially in 12 in order to solve this problem completely the cartan equivalence method is applied to provide an invariant characterization of the linearizable thirdorder ordinary differenti... | [['the', 'linearization', 'problem', 'by', 'use', 'of', 'the', 'cartan', 'equivalence', 'method', 'for', 'scalar', 'thirdorder', 'odes', 'via', 'point', 'transformations', 'was', 'solved', 'partially', 'in', '12', 'in', 'order', 'to', 'solve', 'this', 'problem', 'completely', 'the', 'cartan', 'equivalence', 'method', '... | [-0.10639409758756316, 0.03067259990436979, -0.10575842031663875, 0.07971675849019937, -0.13364397002217487, -0.13680183520631456, -0.017595036174889986, 0.3258232495679361, -0.3165026569826059, -0.2625265917475752, 0.09649038842190208, -0.21848189363604395, -0.19240903896771797, 0.1820988057908125, -0.0705499589231198... |
1,803.06557 | Estimation of treatment effects under endogeneous heteroskedasticity | The empirical literature on program evaluation limits its scope almost
exclusively to models where treatment effects are homogenous for
observationally identical individuals. This paper considers a treatment effect
model in which treatment effects may be heterogeneous, even among
observationally identical individuals... | stat.ME | the empirical literature on program evaluation limits its scope almost exclusively to models where treatment effects are homogenous for observationally identical individuals this paper considers a treatment effect model in which treatment effects may be heterogeneous even among observationally identical individuals spe... | [['the', 'empirical', 'literature', 'on', 'program', 'evaluation', 'limits', 'its', 'scope', 'almost', 'exclusively', 'to', 'models', 'where', 'treatment', 'effects', 'are', 'homogenous', 'for', 'observationally', 'identical', 'individuals', 'this', 'paper', 'considers', 'a', 'treatment', 'effect', 'model', 'in', 'whic... | [-0.041110595991160945, 0.05836254064117826, -0.10857663268624748, 0.11332007857278834, -0.06654666646419721, -0.15180416473120614, 0.09011130530042419, 0.3856623379194605, -0.1980056557598529, -0.3037709778853955, 0.11122754252083518, -0.26702036918526856, -0.14842032915938297, 0.18224606127606818, -0.1036178559677171... |
1,803.06558 | Insensitivity of bulk properties to the twisted boundary condition | The symmetry and the locality are the two major sources of various nontrivial
statements in quantum many-body systems. We demonstrate that, in gapped phases
of a U(1) symmetric Hamiltonian with finite-range interactions, the bulk
properties such as the expectation value of local operators, the ground state
energy and... | cond-mat.stat-mech cond-mat.str-el | the symmetry and the locality are the two major sources of various nontrivial statements in quantum manybody systems we demonstrate that in gapped phases of a u1 symmetric hamiltonian with finiterange interactions the bulk properties such as the expectation value of local operators the ground state energy and the excit... | [['the', 'symmetry', 'and', 'the', 'locality', 'are', 'the', 'two', 'major', 'sources', 'of', 'various', 'nontrivial', 'statements', 'in', 'quantum', 'manybody', 'systems', 'we', 'demonstrate', 'that', 'in', 'gapped', 'phases', 'of', 'a', 'u1', 'symmetric', 'hamiltonian', 'with', 'finiterange', 'interactions', 'the', '... | [-0.19639917695686954, 0.20803822276086845, -0.0775081272778542, 0.07506686131611266, -0.02563485952019359, -0.10368317778193159, 0.011084388053859584, 0.33054287914585856, -0.2457139388352516, -0.25970230444467496, 0.10030131221823727, -0.2956316095909902, -0.12507860903653117, 0.1296794689021356, 0.04235983930993825,... |
1,803.06559 | Improving Bitcoin's Resilience to Churn | Efficient and reliable block propagation on the Bitcoin network is vital for
ensuring the scalability of this peer-to-peer network. To this end, several
schemes have been proposed over the last few years to speed up the block
propagation, most notably the compact block protocol (BIP 152). Despite this,
we show experi... | cs.CR | efficient and reliable block propagation on the bitcoin network is vital for ensuring the scalability of this peertopeer network to this end several schemes have been proposed over the last few years to speed up the block propagation most notably the compact block protocol bip 152 despite this we show experimental evid... | [['efficient', 'and', 'reliable', 'block', 'propagation', 'on', 'the', 'bitcoin', 'network', 'is', 'vital', 'for', 'ensuring', 'the', 'scalability', 'of', 'this', 'peertopeer', 'network', 'to', 'this', 'end', 'several', 'schemes', 'have', 'been', 'proposed', 'over', 'the', 'last', 'few', 'years', 'to', 'speed', 'up', '... | [-0.18993684305747546, 0.04590619509810172, -0.0262822373976483, 0.027948470097726386, -0.10505367041553688, -0.1961623158960167, 0.1281812671230092, 0.4362917634528838, -0.26028390527965173, -0.2991703512571469, 0.1220031651105331, -0.24993318958278699, -0.18219684766122152, 0.17039762188082183, -0.09188317081336922, ... |
1,803.0656 | Leading Pomeron Contributions and the TOTEM Data at 13 TeV | The recent data by the TOTEM Collaboration on $\sigma_{tot}$ and $\rho$ at 13
TeV, have shown agreement with a leading Odderon contribution at the highest
energies, as demonstrated in the very recent analysis by Martynov and Nicolescu
(MN). In order to investigate the same dataset by means of Pomeron dominance,
we in... | hep-ph hep-ex | the recent data by the totem collaboration on sigma_tot and rho at 13 tev have shown agreement with a leading odderon contribution at the highest energies as demonstrated in the very recent analysis by martynov and nicolescu mn in order to investigate the same dataset by means of pomeron dominance we introduce a genera... | [['the', 'recent', 'data', 'by', 'the', 'totem', 'collaboration', 'on', 'sigma_tot', 'and', 'rho', 'at', '13', 'tev', 'have', 'shown', 'agreement', 'with', 'a', 'leading', 'odderon', 'contribution', 'at', 'the', 'highest', 'energies', 'as', 'demonstrated', 'in', 'the', 'very', 'recent', 'analysis', 'by', 'martynov', 'a... | [-0.09143505679303265, 0.12885190400896976, -0.08841728917142963, 0.14395539462373422, -0.04365436534155469, -0.12013348985401635, 0.028475520604943537, 0.35340088916021445, -0.2084266062342248, -0.33069356779943515, 0.041420315527825075, -0.334594394502266, -0.05112947508929431, 0.18233144020749184, 0.0413938113639403... |
1,803.06561 | AutoML from Service Provider's Perspective: Multi-device, Multi-tenant
Model Selection with GP-EI | AutoML has become a popular service that is provided by most leading cloud
service providers today. In this paper, we focus on the AutoML problem from the
\emph{service provider's perspective}, motivated by the following practical
consideration: When an AutoML service needs to serve {\em multiple users} with
{\em mul... | cs.LG cs.DC stat.ML | automl has become a popular service that is provided by most leading cloud service providers today in this paper we focus on the automl problem from the emphservice providers perspective motivated by the following practical consideration when an automl service needs to serve em multiple users with em multiple devices a... | [['automl', 'has', 'become', 'a', 'popular', 'service', 'that', 'is', 'provided', 'by', 'most', 'leading', 'cloud', 'service', 'providers', 'today', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'automl', 'problem', 'from', 'the', 'emphservice', 'providers', 'perspective', 'motivated', 'by', 'the', 'following', 'p... | [-0.15056320234323528, 0.025706467827245002, -0.04170357143206887, 0.034966813897639136, -0.10941080994033558, -0.19709687943841755, 0.11473248797485221, 0.4122324508881599, -0.2506364370197825, -0.34680046257211933, 0.0834703446780074, -0.2797099012241233, -0.15541809719130772, 0.21803621946478347, -0.1043045042667961... |
1,803.06562 | Nanoscale domain patterns and a concept for an energy harvester | The current work employs a phase-field model to test the stability of
nanoscale periodic domain patterns, and to explore the application of one
pattern in an energy harvester device. At first, the stability of several
periodic domain patterns with in-plane polarizations is tested under
stress-free and electric field-... | physics.app-ph | the current work employs a phasefield model to test the stability of nanoscale periodic domain patterns and to explore the application of one pattern in an energy harvester device at first the stability of several periodic domain patterns with inplane polarizations is tested under stressfree and electric fieldfree cond... | [['the', 'current', 'work', 'employs', 'a', 'phasefield', 'model', 'to', 'test', 'the', 'stability', 'of', 'nanoscale', 'periodic', 'domain', 'patterns', 'and', 'to', 'explore', 'the', 'application', 'of', 'one', 'pattern', 'in', 'an', 'energy', 'harvester', 'device', 'at', 'first', 'the', 'stability', 'of', 'several',... | [-0.18145292654030454, 0.16502827491316704, -0.07599855088781504, -0.01493695673413188, -0.08012984156013146, -0.13169076140776603, 0.04701703394218628, 0.43741580243400535, -0.2876689350919523, -0.28372322761865915, 0.09017662079292324, -0.2431933633827915, -0.10338667805606876, 0.21701706477563035, -0.027753465256750... |
1,803.06563 | Viewpoint: Artificial Intelligence and Labour | The welfare of modern societies has been intrinsically linked to wage labour.
With some exceptions, the modern human has to sell her labour-power to be able
reproduce biologically and socially. Thus, a lingering fear of technological
unemployment features predominately as a theme among Artificial Intelligence
researc... | cs.CY cs.AI | the welfare of modern societies has been intrinsically linked to wage labour with some exceptions the modern human has to sell her labourpower to be able reproduce biologically and socially thus a lingering fear of technological unemployment features predominately as a theme among artificial intelligence researchers in... | [['the', 'welfare', 'of', 'modern', 'societies', 'has', 'been', 'intrinsically', 'linked', 'to', 'wage', 'labour', 'with', 'some', 'exceptions', 'the', 'modern', 'human', 'has', 'to', 'sell', 'her', 'labourpower', 'to', 'be', 'able', 'reproduce', 'biologically', 'and', 'socially', 'thus', 'a', 'lingering', 'fear', 'of'... | [-0.06408726930180017, 0.13150503723060383, -0.11511823464842404, 0.12861946681514383, -0.16330696339445078, -0.16307336545604117, 0.04695914349902202, 0.4172746521037291, -0.28389952985898537, -0.2989935486166574, 0.12252686091780882, -0.31846708810669094, -0.2010870587105541, 0.17662886163110242, -0.21429401563809197... |
1,803.06564 | Nanoscale periodic domain patterns in tetragonal ferroelectrics: A
phase-field study | Ferroelectrics form domain patterns that minimize their energy subject to
imposed boundary conditions. In a linear, constrained theory, that neglects
domain wall energy, periodic domain patterns in the form of multi-rank
laminates can be identified as minimum-energy states. However, when these
laminates (formed in a ... | cond-mat.mtrl-sci | ferroelectrics form domain patterns that minimize their energy subject to imposed boundary conditions in a linear constrained theory that neglects domain wall energy periodic domain patterns in the form of multirank laminates can be identified as minimumenergy states however when these laminates formed in a macroscopic... | [['ferroelectrics', 'form', 'domain', 'patterns', 'that', 'minimize', 'their', 'energy', 'subject', 'to', 'imposed', 'boundary', 'conditions', 'in', 'a', 'linear', 'constrained', 'theory', 'that', 'neglects', 'domain', 'wall', 'energy', 'periodic', 'domain', 'patterns', 'in', 'the', 'form', 'of', 'multirank', 'laminate... | [-0.16175522192482963, 0.1960650391801057, -0.06612382553810925, 0.04074273990386823, -0.09075542666292205, -0.0815144053761975, 0.014774591741766686, 0.40580112843533156, -0.2899939351819153, -0.3032577549235016, 0.10421495133571251, -0.23138291335329036, -0.13384788252678015, 0.17320238937136864, -0.00314543532860006... |
1,803.06565 | Effect of Electron-RBM Phonon Interaction on Conductance of carbon
nanotubes | We use the energy analysis as a perturbative method to study the effect of
electron-radial breathing mode (RBM) phonon interaction on the electrical
conductivity of long metallic zigzag carbon nanotubes (CNTs). The band
structure of zigzag CNTs is calculated by exerting zone-folding method on
relations derived by usi... | cond-mat.mes-hall cond-mat.mtrl-sci | we use the energy analysis as a perturbative method to study the effect of electronradial breathing mode rbm phonon interaction on the electrical conductivity of long metallic zigzag carbon nanotubes cnts the band structure of zigzag cnts is calculated by exerting zonefolding method on relations derived by using the ne... | [['we', 'use', 'the', 'energy', 'analysis', 'as', 'a', 'perturbative', 'method', 'to', 'study', 'the', 'effect', 'of', 'electronradial', 'breathing', 'mode', 'rbm', 'phonon', 'interaction', 'on', 'the', 'electrical', 'conductivity', 'of', 'long', 'metallic', 'zigzag', 'carbon', 'nanotubes', 'cnts', 'the', 'band', 'stru... | [-0.10893534494865706, 0.10875428586940714, -0.07133653159409387, 0.01495955629318474, -0.0308670901603003, -0.16463811506449594, 0.09452093445485218, 0.45841636610680453, -0.27520924955918635, -0.2752655431753097, 0.018179061799180076, -0.2815761108389749, -0.1340624059826219, 0.17213166590946513, 0.04046014117794996,... |
1,803.06566 | Computing the Best Approximation Over the Intersection of a Polyhedral
Set and the Doubly Nonnegative Cone | This paper introduces an efficient algorithm for computing the best
approximation of a given matrix onto the intersection of linear equalities,
inequalities and the doubly nonnegative cone (the cone of all positive
semidefinite matrices whose elements are nonnegative). In contrast to directly
applying the block coord... | math.OC | this paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities inequalities and the doubly nonnegative cone the cone of all positive semidefinite matrices whose elements are nonnegative in contrast to directly applying the block coordinate ... | [['this', 'paper', 'introduces', 'an', 'efficient', 'algorithm', 'for', 'computing', 'the', 'best', 'approximation', 'of', 'a', 'given', 'matrix', 'onto', 'the', 'intersection', 'of', 'linear', 'equalities', 'inequalities', 'and', 'the', 'doubly', 'nonnegative', 'cone', 'the', 'cone', 'of', 'all', 'positive', 'semidefi... | [-0.10997049563723191, -0.044244172529618854, -0.07453588809991299, 0.05231066933984673, -0.09741727162925021, -0.19766949639698966, -0.00023953490818366986, 0.35103875340879426, -0.3670900301978916, -0.25515561966634315, 0.15019044837672552, -0.23094026794451353, -0.1910931028302961, 0.18487090512012788, -0.0745742448... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.