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.02167 | Dissipation induced $W$ state in a Rydberg-atom-cavity system | A dissipative scheme is proposed to prepare tripartite $W$ state in a
Rydberg-atom-cavity system. It is an organic combination of quantum Zeno
dynamics, Rydberg antiblockade and atomic spontaneous emission to turn the
tripartite $W$ state into the unique steady state of the whole system. The
robustness against the loss of cavity and the feasibility of the scheme are
demonstrated thoroughly by the current experimental parameters, which leads to
a high fidelity above $98\%$.
| quant-ph | a dissipative scheme is proposed to prepare tripartite w state in a rydbergatomcavity system it is an organic combination of quantum zeno dynamics rydberg antiblockade and atomic spontaneous emission to turn the tripartite w state into the unique steady state of the whole system the robustness against the loss of cavity and the feasibility of the scheme are demonstrated thoroughly by the current experimental parameters which leads to a high fidelity above 98 | [['a', 'dissipative', 'scheme', 'is', 'proposed', 'to', 'prepare', 'tripartite', 'w', 'state', 'in', 'a', 'rydbergatomcavity', 'system', 'it', 'is', 'an', 'organic', 'combination', 'of', 'quantum', 'zeno', 'dynamics', 'rydberg', 'antiblockade', 'and', 'atomic', 'spontaneous', 'emission', 'to', 'turn', 'the', 'tripartite', 'w', 'state', 'into', 'the', 'unique', 'steady', 'state', 'of', 'the', 'whole', 'system', 'the', 'robustness', 'against', 'the', 'loss', 'of', 'cavity', 'and', 'the', 'feasibility', 'of', 'the', 'scheme', 'are', 'demonstrated', 'thoroughly', 'by', 'the', 'current', 'experimental', 'parameters', 'which', 'leads', 'to', 'a', 'high', 'fidelity', 'above', '98']] | [-0.14671162295885615, 0.15211594349258956, -0.05040225059061936, -0.01344655918863232, 0.04277749132518083, -0.18114669797686886, 0.09095399066716535, 0.3548747168930426, -0.2553445816499321, -0.26784949331250907, 0.04518685767136846, -0.24027140848402392, -0.051120296197190676, 0.19487193652926244, -0.010943179337741577, 0.13856138879662916, 0.08660367341737633, 0.002392460445375883, -0.003267024892497144, -0.24470162693704542, 0.2993769050154784, 0.06524467848285982, 0.35155560055824175, 0.06158922184641435, 0.14061166155981283, -0.06963173437334137, 0.11127648571480626, -0.043568430800143984, -0.06783598869375579, 0.060377499005718996, 0.19508540769720017, 0.11303078393413596, 0.2820355327264087, -0.35933757239110664, -0.2117692324243588, 0.07067875783533266, 0.0870769669745143, 0.1894737035976978, -0.01093013280977125, -0.3842021778532087, 0.015914426465863236, -0.22108274140739687, -0.10949137577889105, -0.12392848814926939, 0.0019800568299291475, -0.041073852945884615, -0.26377437518884056, 0.08760088147621041, 0.07164962478906987, -0.020591064802791974, -0.03954525436721232, -0.019929049903373807, -0.0601072529739898, 0.07578340116633128, -0.08346439586084796, 0.023200261550126215, 0.1595716928897349, -0.1442484586939777, -0.14685707326264005, 0.36535331509905317, -0.08381557614185324, -0.17387016217083964, 0.20985999674064248, -0.12650802466788724, -0.018051941936503942, 0.16633493537466004, 0.125881275267353, 0.07869053408120798, -0.13632170671010263, 0.013734715638286753, -0.022847447132895868, 0.21656896608996473, 0.013031950226844582, 0.12563386504273832, 0.16921768809368912, 0.17889197614707358, 0.05608714477012368, 0.22488591407285366, -0.08248177987255462, -0.14249533437804818, -0.2772191686887447, -0.19384314238782718, -0.2148239492081514, 0.08576755628806271, -0.016689855356187215, -0.10670946313910289, 0.4382123221831248, 0.1342344982166813, 0.17208663164956928, -0.06014359698228997, 0.3111412667745903, 0.11313979182239264, -0.006998139191163729, 0.02219351160352769, 0.2824245962786348, 0.16620206591443554, 0.07100217746034877, -0.3545760722218515, 0.08269840254996942, -0.0034159132700464496] |
1,803.02168 | Central accumulation of magnetic flux in massive Seyfert galaxies as a
possible engine to trigger ultrahigh energy cosmic rays | In the present paper we investigate the production of ultrahigh energy cosmic
rays (UHECRs) from Seyferts. We discuss the UHECR luminosities obtained by two
possible engine trigger models: pure radiative transfer and the energy
extraction from poloidal magnetic flux. The first case is modeled by Kerr slim
disk or Bondi accretion mechanisms. Since it is assumed that the broadband
spectra of Seyferts indicate that at least the outer portions of their
accretion disks are cold and geometrically thin, and since our results point
that the consequent radiative energy transfer is inefficient, we build the
second approach based on massive Seyferts with sufficient central poloidal
magnetic field to trigger an outflow of magnetically driven charged particles
capable to explain the observed UHECRs and gamma rays in Earth experiments from
a given Seyfert source.
| astro-ph.HE | in the present paper we investigate the production of ultrahigh energy cosmic rays uhecrs from seyferts we discuss the uhecr luminosities obtained by two possible engine trigger models pure radiative transfer and the energy extraction from poloidal magnetic flux the first case is modeled by kerr slim disk or bondi accretion mechanisms since it is assumed that the broadband spectra of seyferts indicate that at least the outer portions of their accretion disks are cold and geometrically thin and since our results point that the consequent radiative energy transfer is inefficient we build the second approach based on massive seyferts with sufficient central poloidal magnetic field to trigger an outflow of magnetically driven charged particles capable to explain the observed uhecrs and gamma rays in earth experiments from a given seyfert source | [['in', 'the', 'present', 'paper', 'we', 'investigate', 'the', 'production', 'of', 'ultrahigh', 'energy', 'cosmic', 'rays', 'uhecrs', 'from', 'seyferts', 'we', 'discuss', 'the', 'uhecr', 'luminosities', 'obtained', 'by', 'two', 'possible', 'engine', 'trigger', 'models', 'pure', 'radiative', 'transfer', 'and', 'the', 'energy', 'extraction', 'from', 'poloidal', 'magnetic', 'flux', 'the', 'first', 'case', 'is', 'modeled', 'by', 'kerr', 'slim', 'disk', 'or', 'bondi', 'accretion', 'mechanisms', 'since', 'it', 'is', 'assumed', 'that', 'the', 'broadband', 'spectra', 'of', 'seyferts', 'indicate', 'that', 'at', 'least', 'the', 'outer', 'portions', 'of', 'their', 'accretion', 'disks', 'are', 'cold', 'and', 'geometrically', 'thin', 'and', 'since', 'our', 'results', 'point', 'that', 'the', 'consequent', 'radiative', 'energy', 'transfer', 'is', 'inefficient', 'we', 'build', 'the', 'second', 'approach', 'based', 'on', 'massive', 'seyferts', 'with', 'sufficient', 'central', 'poloidal', 'magnetic', 'field', 'to', 'trigger', 'an', 'outflow', 'of', 'magnetically', 'driven', 'charged', 'particles', 'capable', 'to', 'explain', 'the', 'observed', 'uhecrs', 'and', 'gamma', 'rays', 'in', 'earth', 'experiments', 'from', 'a', 'given', 'seyfert', 'source']] | [-0.060517018399850436, 0.167830254068659, 0.007468543036586859, 0.15710148821623685, -0.06657134826210412, -0.06616971544766177, -0.006542835946399437, 0.4397192429680603, -0.2087665775236956, -0.34289315554567357, 0.034082052722982495, -0.28942856864975486, 0.00910559354992019, 0.21739673268607337, 0.015584918551515633, -0.019631134247350874, 0.036867077935091926, -0.07514702285654053, 0.0042783011392175194, -0.17617239516623545, 0.3503034512025558, 0.16404298846751, 0.20221620842560448, 0.02620337885155371, 0.09814034503396021, -0.09939304015874355, -0.0542567990694696, -0.05867933618807883, -0.1372321909989709, 0.07022832241791273, 0.22174157982703258, 0.08767888659724232, 0.17305016696142653, -0.4391045688076481, -0.2273842446350803, 0.09909161851938927, 0.15422844610557976, 0.028886282361451198, -0.10938260292680228, -0.21633010118966922, 0.07443525936369869, -0.19798425143358833, -0.12235519458596228, 0.016951237651731142, -0.02344175328228933, 0.02704609231317811, -0.24969739679495848, 0.09847771179347271, 0.09533282365141944, 0.02329361033943397, -0.1570165343035831, -0.046533038122685284, -0.07007151193895632, 0.040761000520874266, 0.13077491420412887, 0.03428144818595187, 0.24892670174030532, -0.1312515909437824, -0.11828495752574368, 0.39549919577654113, -0.03742632764448045, -0.06549996490039947, 0.22248175170600668, -0.22274014715521567, -0.11302047047876951, 0.2070024135755375, 0.17645748923391555, 0.14534922718215085, -0.14128892685314923, 0.02214149403505761, -0.029386212788240024, 0.17737885225836758, 0.019144625362418028, 0.00096351492825444, 0.34243249414827337, 0.12751051994873155, 0.015364066596234668, 0.13882732952443996, -0.17667866097304574, -0.020131660325921875, -0.28542452023336384, -0.10460395806920574, -0.17914190144581493, 0.13119091844595404, -0.08957769508627032, -0.10732535151129757, 0.331272171909046, 0.10530580753093642, 0.21023787511512637, -0.022562463627874615, 0.33705671800822584, 0.07324508670937961, 0.03800382616287662, 0.21483262746848844, 0.35247452425855125, 0.1371878204835494, 0.14942318325781592, -0.24707671052403218, 0.03127931546292861, 0.04366437620553894] |
1,803.02169 | Electric structure of shallow D-wave states in Halo EFT | We compute the electric form factors of one-neutron halo nuclei with shallow
D-wave states up to next-to-leading order and the E2 transition from the S-wave
to the D-wave state up to leading order in Halo Effective Field Theory (Halo
EFT). The relevant degrees of freedom are the core and the halo neutron. The
EFT expansion is carried out in powers of $R_{core}/R_{halo}$, where $R_{core}$
and $R_{halo}$ denote the length scales of the core and the halo, respectively.
We propose a power counting scenario for weakly-bound states in one-neutron
Halo EFT and discuss its implications for higher partial waves in terms of
universality. The scenario is applied to the $\frac{5}{2}^+$ first excited
state and the $\frac{1}{2}^+$ ground state of $^{15}\text{C}$. We obtain
several universal correlations between electric observables and use data for
the E2 transition $\frac{5}{2}^+\to \frac{1}{2}^+$ together with ab initio
results from the No-Core Shell Model to predict the quadrupole moment.
| nucl-th hep-ph | we compute the electric form factors of oneneutron halo nuclei with shallow dwave states up to nexttoleading order and the e2 transition from the swave to the dwave state up to leading order in halo effective field theory halo eft the relevant degrees of freedom are the core and the halo neutron the eft expansion is carried out in powers of r_corer_halo where r_core and r_halo denote the length scales of the core and the halo respectively we propose a power counting scenario for weaklybound states in oneneutron halo eft and discuss its implications for higher partial waves in terms of universality the scenario is applied to the frac52 first excited state and the frac12 ground state of 15textc we obtain several universal correlations between electric observables and use data for the e2 transition frac52to frac12 together with ab initio results from the nocore shell model to predict the quadrupole moment | [['we', 'compute', 'the', 'electric', 'form', 'factors', 'of', 'oneneutron', 'halo', 'nuclei', 'with', 'shallow', 'dwave', 'states', 'up', 'to', 'nexttoleading', 'order', 'and', 'the', 'e2', 'transition', 'from', 'the', 'swave', 'to', 'the', 'dwave', 'state', 'up', 'to', 'leading', 'order', 'in', 'halo', 'effective', 'field', 'theory', 'halo', 'eft', 'the', 'relevant', 'degrees', 'of', 'freedom', 'are', 'the', 'core', 'and', 'the', 'halo', 'neutron', 'the', 'eft', 'expansion', 'is', 'carried', 'out', 'in', 'powers', 'of', 'r_corer_halo', 'where', 'r_core', 'and', 'r_halo', 'denote', 'the', 'length', 'scales', 'of', 'the', 'core', 'and', 'the', 'halo', 'respectively', 'we', 'propose', 'a', 'power', 'counting', 'scenario', 'for', 'weaklybound', 'states', 'in', 'oneneutron', 'halo', 'eft', 'and', 'discuss', 'its', 'implications', 'for', 'higher', 'partial', 'waves', 'in', 'terms', 'of', 'universality', 'the', 'scenario', 'is', 'applied', 'to', 'the', 'frac52', 'first', 'excited', 'state', 'and', 'the', 'frac12', 'ground', 'state', 'of', '15textc', 'we', 'obtain', 'several', 'universal', 'correlations', 'between', 'electric', 'observables', 'and', 'use', 'data', 'for', 'the', 'e2', 'transition', 'frac52to', 'frac12', 'together', 'with', 'ab', 'initio', 'results', 'from', 'the', 'nocore', 'shell', 'model', 'to', 'predict', 'the', 'quadrupole', 'moment']] | [-0.12894347257249608, 0.16612624503740878, -0.06801437362856638, 0.09983317694789261, -0.043298316206908063, -0.04770855857809418, 0.043419486748901566, 0.31231049699521307, -0.18984275940030612, -0.3078047682081143, -0.037398301677515844, -0.34148037195480707, -0.02232527925364123, 0.1018420955363111, 0.12339043987902419, 0.049319888283451706, -0.03281615199771203, 0.07278169714689454, -0.09865142946325292, -0.17264970413631064, 0.33915933402530196, 0.04436579978893567, 0.20091755683346332, 0.08827973522820928, 0.04421610323377829, -0.03433700828913024, 0.06632250866183899, -0.06636600604362086, -0.1491034022538654, 0.09707677292390633, 0.2633105561593485, 0.05477982593212752, 0.167553599011278, -0.45204140077776356, -0.1504851088002824, 0.07091062793808195, 0.17166320042178385, 0.13966766881737733, -0.0034717859172155993, -0.31045277842364255, 0.07702794056948299, -0.2661607545181709, -0.16862430653828603, -0.12682137861472847, 0.03543800529445703, 0.01596022278520485, -0.2854407624054025, 0.12330727081573194, 0.017354809021227213, 0.0041564311847815776, -0.07908192492987111, -0.19760072450762953, 0.0008142211211957787, 0.07471489066870621, 0.06592081613985559, 0.07453419077178876, 0.1534934536703931, -0.16047647393827372, -0.08593720278933945, 0.40444354176671315, -0.041678740450762364, -0.09379217786958204, 0.07498073220196737, -0.18443014580856434, -0.1191137773578599, 0.10991170294832864, 0.12944870382616133, 0.11873861796014798, -0.07878312507281768, 0.1041944242936509, 0.023605185807776333, 0.18883478291482733, 0.035024131395097746, 0.022526875147658505, 0.20771005392487116, 0.11067186827277577, 0.03952099242553915, 0.10427128308571425, -0.15457398926639218, -0.12395351573249838, -0.3125688208910893, -0.08274987574991764, -0.13833134944219416, 0.019866782443710422, -0.08759194871146254, -0.1146546451690538, 0.4047997461916291, 0.12986565479343046, 0.20559619360872164, 0.03556107125876334, 0.27008371985823715, 0.10964279177742417, 0.05433481096933852, 0.08255361548028012, 0.27324740256764146, 0.2268143345690926, 0.00639932992361836, -0.30933029891223013, 0.0003921929871875968, 0.04010847017744044] |
1,803.0217 | Flux driven and geometry controlled spin filtering for arbitrary spins
in aperiodic quantum networks | We demonstrate that an aperiodic array of certain quantum networks comprising
magnetic and non-magnetic atoms can act as perfect spin filters for particles
with arbitrary spin state. This can be achieved by introducing minimal
quasi-one dimensionality in the basic structural units building up the array,
along with an appropriate tuning of the potential of the non-magnetic atoms,
the tunnel hopping integral between the non-magnetic atoms and the backbone,
and, in some cases, by tuning an external magnetic field. This latter result
opens up the interesting possibility of designing a flux controlled spin
demultiplexer using quantum networks. The proposed networks have close
resemblance with a family of recently developed photonic lattices, and the
scheme for spin filtering can thus be linked, in principle, to a possibility of
suppressing any one of the two states of polarization of a single photon,
almost at will. We use transfer matrices and a real space renormalization group
scheme to unravel the conditions under which any aperiodic arrangement of such
topologically different structures will filter out any given spin projection.
Our results are analytically exact, and corroborated by extensive numerical
calculations of the spin polarized transmission and the density of states of
such systems.
| cond-mat.dis-nn | we demonstrate that an aperiodic array of certain quantum networks comprising magnetic and nonmagnetic atoms can act as perfect spin filters for particles with arbitrary spin state this can be achieved by introducing minimal quasione dimensionality in the basic structural units building up the array along with an appropriate tuning of the potential of the nonmagnetic atoms the tunnel hopping integral between the nonmagnetic atoms and the backbone and in some cases by tuning an external magnetic field this latter result opens up the interesting possibility of designing a flux controlled spin demultiplexer using quantum networks the proposed networks have close resemblance with a family of recently developed photonic lattices and the scheme for spin filtering can thus be linked in principle to a possibility of suppressing any one of the two states of polarization of a single photon almost at will we use transfer matrices and a real space renormalization group scheme to unravel the conditions under which any aperiodic arrangement of such topologically different structures will filter out any given spin projection our results are analytically exact and corroborated by extensive numerical calculations of the spin polarized transmission and the density of states of such systems | [['we', 'demonstrate', 'that', 'an', 'aperiodic', 'array', 'of', 'certain', 'quantum', 'networks', 'comprising', 'magnetic', 'and', 'nonmagnetic', 'atoms', 'can', 'act', 'as', 'perfect', 'spin', 'filters', 'for', 'particles', 'with', 'arbitrary', 'spin', 'state', 'this', 'can', 'be', 'achieved', 'by', 'introducing', 'minimal', 'quasione', 'dimensionality', 'in', 'the', 'basic', 'structural', 'units', 'building', 'up', 'the', 'array', 'along', 'with', 'an', 'appropriate', 'tuning', 'of', 'the', 'potential', 'of', 'the', 'nonmagnetic', 'atoms', 'the', 'tunnel', 'hopping', 'integral', 'between', 'the', 'nonmagnetic', 'atoms', 'and', 'the', 'backbone', 'and', 'in', 'some', 'cases', 'by', 'tuning', 'an', 'external', 'magnetic', 'field', 'this', 'latter', 'result', 'opens', 'up', 'the', 'interesting', 'possibility', 'of', 'designing', 'a', 'flux', 'controlled', 'spin', 'demultiplexer', 'using', 'quantum', 'networks', 'the', 'proposed', 'networks', 'have', 'close', 'resemblance', 'with', 'a', 'family', 'of', 'recently', 'developed', 'photonic', 'lattices', 'and', 'the', 'scheme', 'for', 'spin', 'filtering', 'can', 'thus', 'be', 'linked', 'in', 'principle', 'to', 'a', 'possibility', 'of', 'suppressing', 'any', 'one', 'of', 'the', 'two', 'states', 'of', 'polarization', 'of', 'a', 'single', 'photon', 'almost', 'at', 'will', 'we', 'use', 'transfer', 'matrices', 'and', 'a', 'real', 'space', 'renormalization', 'group', 'scheme', 'to', 'unravel', 'the', 'conditions', 'under', 'which', 'any', 'aperiodic', 'arrangement', 'of', 'such', 'topologically', 'different', 'structures', 'will', 'filter', 'out', 'any', 'given', 'spin', 'projection', 'our', 'results', 'are', 'analytically', 'exact', 'and', 'corroborated', 'by', 'extensive', 'numerical', 'calculations', 'of', 'the', 'spin', 'polarized', 'transmission', 'and', 'the', 'density', 'of', 'states', 'of', 'such', 'systems']] | [-0.17200714704989822, 0.18849116962864898, -0.027956344142575005, -0.0034602150130508976, -0.022061315077037146, -0.15769143917861234, 0.05369356952635854, 0.4244214137287039, -0.2807975889423467, -0.30003028562188977, 0.05888805217215453, -0.25582033599611614, -0.15319392116766217, 0.2086095162373356, 0.03234521864979255, 0.056322384164715654, 0.041981763037090954, -0.010838340280572836, -0.09442808315971622, -0.22917812784623373, 0.31100389392425615, 0.051066842845010785, 0.2767535452307625, 0.037475018473659555, 0.11477207461832975, 0.0340233636723662, 0.040988886090362386, 0.01957748306382439, -0.08885477458890745, 0.12313444852873665, 0.23021641563073816, -0.002329660090382653, 0.21655304544026766, -0.45005937770827475, -0.22567169189058017, 0.08176425474018535, 0.13387041913599454, 0.16801797398210225, -0.060037225343738544, -0.31940543516586073, 0.06315209348380302, -0.16254056267078137, -0.14939525428303338, -0.1200595063985222, -0.03191638814527636, 0.02441798804229069, -0.2675983154572396, 0.00853523640714661, 0.06650227130945734, 0.05381506099685353, -0.04309369669168849, -0.08351785094110352, -0.038947260808058534, 0.10776370776243357, -0.015800262854798054, 0.002327418060634624, 0.122081215909654, -0.1089843789625894, -0.16650389843253474, 0.3318669569376983, -0.05279079430520234, -0.1951075386034908, 0.17875575379708386, -0.11235104244192969, -0.08229553932088869, 0.13428669740361246, 0.12149125565727702, 0.08904665121291247, -0.1262883311243389, 0.06993892927438895, -0.04996942011745308, 0.17163513796498078, 0.06304145880593834, 0.07280469453667826, 0.25175468439019916, 0.16541359180847953, 0.08725181773523659, 0.1658550001412743, -0.10072576034240274, -0.0666327687418982, -0.2547263342115765, -0.1790587513976862, -0.22193119677508044, 0.07908138802811278, -0.10902989227296796, -0.1530483968936923, 0.4029575896608062, 0.13631178654766773, 0.17597190565852958, -0.034258764296549025, 0.24771652867808241, 0.10317940093962608, 0.09161475901915268, 0.04505246345334771, 0.20626547014545954, 0.17359333424570245, 0.047565223595052206, -0.2597378696446693, 0.01589262328637444, 0.0020115520261848965] |
1,803.02171 | Kinetic models for optimal control of wealth inequalities | We introduce and discuss optimal control strategies for kinetic models for
wealth distribution in a simple market economy, acting to minimize the variance
of the wealth density among the population. Our analysis is based on a finite
time horizon approximation, or model predictive control, of the corresponding
control problem for the microscopic agents' dynamic and results in an
alternative theoretical approach to the taxation and redistribution policy at a
global level. It is shown that in general the control is able to modify the
Pareto index of the stationary solution of the corresponding Boltzmann kinetic
equation, and that this modification can be exactly quantified. Connections
between previous Fokker-Planck based models and taxation-redistribution
policies and the present approach are also discussed.
| physics.soc-ph econ.GN math.OC q-fin.EC q-fin.GN | we introduce and discuss optimal control strategies for kinetic models for wealth distribution in a simple market economy acting to minimize the variance of the wealth density among the population our analysis is based on a finite time horizon approximation or model predictive control of the corresponding control problem for the microscopic agents dynamic and results in an alternative theoretical approach to the taxation and redistribution policy at a global level it is shown that in general the control is able to modify the pareto index of the stationary solution of the corresponding boltzmann kinetic equation and that this modification can be exactly quantified connections between previous fokkerplanck based models and taxationredistribution policies and the present approach are also discussed | [['we', 'introduce', 'and', 'discuss', 'optimal', 'control', 'strategies', 'for', 'kinetic', 'models', 'for', 'wealth', 'distribution', 'in', 'a', 'simple', 'market', 'economy', 'acting', 'to', 'minimize', 'the', 'variance', 'of', 'the', 'wealth', 'density', 'among', 'the', 'population', 'our', 'analysis', 'is', 'based', 'on', 'a', 'finite', 'time', 'horizon', 'approximation', 'or', 'model', 'predictive', 'control', 'of', 'the', 'corresponding', 'control', 'problem', 'for', 'the', 'microscopic', 'agents', 'dynamic', 'and', 'results', 'in', 'an', 'alternative', 'theoretical', 'approach', 'to', 'the', 'taxation', 'and', 'redistribution', 'policy', 'at', 'a', 'global', 'level', 'it', 'is', 'shown', 'that', 'in', 'general', 'the', 'control', 'is', 'able', 'to', 'modify', 'the', 'pareto', 'index', 'of', 'the', 'stationary', 'solution', 'of', 'the', 'corresponding', 'boltzmann', 'kinetic', 'equation', 'and', 'that', 'this', 'modification', 'can', 'be', 'exactly', 'quantified', 'connections', 'between', 'previous', 'fokkerplanck', 'based', 'models', 'and', 'taxationredistribution', 'policies', 'and', 'the', 'present', 'approach', 'are', 'also', 'discussed']] | [-0.05116225989093268, 0.056702078029659125, -0.14889649234461685, 0.10918200647794962, -0.08778513355978898, -0.12766051259940536, 0.07992954303005695, 0.3736584672406942, -0.30538411422030015, -0.2977435537731322, 0.09103679327265371, -0.2549056996192251, -0.14314545275635643, 0.18115512632663136, -0.0655593577255847, 0.06900495587370727, 0.002448712181135574, 0.031241432912334676, -0.00022747312445475275, -0.2172853843594643, 0.30559407978537767, 0.08439105360166115, 0.3262917828127867, 0.04763836402659052, 0.1504328129226107, -0.007723139833752848, -0.014870200700423986, 0.04287217705346206, -0.15311983461991174, 0.13989839303608545, 0.23876343229512867, 0.13603644981244659, 0.3301052106974819, -0.4299042699623759, -0.22051038632111647, 0.10804145663835797, 0.09620513732177245, 0.11377475283719099, -0.034284858077083626, -0.21916051475065096, 0.06166454965733931, -0.20139164919182345, -0.1285645719358361, -0.09178769495338202, 0.0004464144301952935, 0.06018076744713202, -0.313141858686513, 0.08523319452436555, 0.024538158321706187, 0.00231574393198395, -0.13339719456863128, -0.10064588810274173, -0.02997814867246364, 0.1224936418560091, 0.04519721872012812, -0.028406516330643408, 0.12089773573904854, -0.13134277052590387, -0.15815986314115404, 0.3528611912008594, -0.04899548486407314, -0.2441491505381565, 0.150669690773298, -0.09660527948681422, -0.09166003661934569, 0.10128107675578163, 0.21235311365522005, 0.11449623248782478, -0.19418260612438956, 0.06677661138927142, -0.03840045245587356, 0.15807967303524248, -0.004909288650769897, -0.0006285412838690358, 0.15898216878917037, 0.19621711599977076, 0.1382429944273053, 0.10733450924245906, -0.025893005098807115, -0.19045043257339037, -0.31159284059740916, -0.11348708139873352, -0.15826325822903328, 0.019416405170756792, -0.11161337029350288, -0.13720599099472283, 0.3936791897696607, 0.1805464676972635, 0.14650824152621902, 0.10695315272148166, 0.2950588819422141, 0.1832651238342622, -0.0031403684323387487, 0.11951614656884756, 0.218006944881083, 0.07966531614162528, 0.09577960729552042, -0.2726790442663644, 0.10659923957770362, 0.04615276075210892] |
1,803.02172 | Compactness of iso-resonant potentials for Schr\"odinger operators in
dimensions one and three | We prove compactness of a restricted set of real-valued, compactly supported
potentials $V$ for which the corresponding Schr\"odinger operators $H_V$ have
the same resonances, including multiplicities. More specifically, let $B_R(0)$
be the ball of radius $R > 0$ about the origin in $R^d$, for $d=1,3$. Let
$\mathcal{I}_R (V_0)$ be the set of real-valued potentials in $C_0^\infty(
\overline{B}_R(0); R)$ so that the corresponding Schr\"odinger operators have
the same resonances, including multiplicities, as $H_{V_0}$. We prove that the
set $\mathcal{I}_R (V_0)$ is a compact subset of $C_0^\infty
(\overline{B}_R(0))$ in the $C^\infty$-topology. An extension to Sobolev spaces
of less regular potentials is discussed.
| math.SP | we prove compactness of a restricted set of realvalued compactly supported potentials v for which the corresponding schrodinger operators h_v have the same resonances including multiplicities more specifically let b_r0 be the ball of radius r 0 about the origin in rd for d13 let mathcali_r v_0 be the set of realvalued potentials in c_0infty overlineb_r0 r so that the corresponding schrodinger operators have the same resonances including multiplicities as h_v_0 we prove that the set mathcali_r v_0 is a compact subset of c_0infty overlineb_r0 in the cinftytopology an extension to sobolev spaces of less regular potentials is discussed | [['we', 'prove', 'compactness', 'of', 'a', 'restricted', 'set', 'of', 'realvalued', 'compactly', 'supported', 'potentials', 'v', 'for', 'which', 'the', 'corresponding', 'schrodinger', 'operators', 'h_v', 'have', 'the', 'same', 'resonances', 'including', 'multiplicities', 'more', 'specifically', 'let', 'b_r0', 'be', 'the', 'ball', 'of', 'radius', 'r', '0', 'about', 'the', 'origin', 'in', 'rd', 'for', 'd13', 'let', 'mathcali_r', 'v_0', 'be', 'the', 'set', 'of', 'realvalued', 'potentials', 'in', 'c_0infty', 'overlineb_r0', 'r', 'so', 'that', 'the', 'corresponding', 'schrodinger', 'operators', 'have', 'the', 'same', 'resonances', 'including', 'multiplicities', 'as', 'h_v_0', 'we', 'prove', 'that', 'the', 'set', 'mathcali_r', 'v_0', 'is', 'a', 'compact', 'subset', 'of', 'c_0infty', 'overlineb_r0', 'in', 'the', 'cinftytopology', 'an', 'extension', 'to', 'sobolev', 'spaces', 'of', 'less', 'regular', 'potentials', 'is', 'discussed']] | [-0.12944963717382052, 0.0958639089793299, -0.06918759643303929, 0.0515104154983419, -0.061379596353314504, -0.13398783567633168, -0.06316188096146409, 0.3604763667487229, -0.2535287543044736, -0.13486997924822694, 0.0978149016215563, -0.32477183716643293, -0.05649223749060184, 0.18189189811285664, -0.05855574746722899, 0.02747564285042851, 0.051124245874234475, 0.13544041899149306, -0.06019184860148622, -0.21293878465075977, 0.3766597622015979, -0.07718204252887517, 0.09855213959720761, 0.06431801253347658, 0.03483980195596814, -0.004674979208478665, 0.049995013988033556, -0.006760721769145069, -0.1523122071528936, 0.11797958135139197, 0.2155848375017134, 0.09308989652102657, 0.2969101992493961, -0.3643812543499128, -0.18854507600190118, 0.22494366976510113, 0.15788166965648998, -0.03106080070938333, -0.007335430620666254, -0.34242922463454306, 0.14860975664729872, -0.11204024299513549, -0.20326327434061872, -0.06096149435810124, 0.17325161360107208, 0.07927696434004854, -0.35057826541985077, 0.04722786997444928, 0.0607037526157607, 0.05562779045188412, -0.11802538666840216, -0.1720650133987268, -0.07357380022343325, 0.03223295219868305, -0.04841967055593462, 0.10601920360932127, 0.06608808688664188, -0.060905257150200974, -0.07790406807544059, 0.37978876087193686, -0.07357579220236705, -0.2817661026492715, 0.09847660270315828, -0.2252179398201406, -0.08188608143245801, 0.08159131413412979, 0.16352759991423227, 0.142655756722282, -0.10629224323201925, 0.241930260672234, -0.07559506480053339, 0.10702464541585262, 0.13097119800174065, 0.060736540355719626, 0.11304799093644154, 0.08209069321552913, 0.12186479259495779, 0.09348964030990221, 3.066515394796928e-05, -0.004294779949001774, -0.3903646908972102, -0.1077141087983667, -0.2002025827920685, 0.1058670375496149, -0.13174138170628188, -0.18189520029894388, 0.3716486226306491, 0.07560853068813837, 0.2546099788499608, 0.094931720810564, 0.13798589874447012, 0.142396045788549, 0.06577382515085144, 0.09917490398705316, 0.12270187582665433, 0.16009791430163509, 0.04545108561069355, -0.15116464246724112, -0.048502855973007776, 0.12196879625116708] |
1,803.02173 | Braiding Majorana zero modes in spin space: from worldline to
worldribbon | We propose a scheme to braid Majorana zero modes (MZMs) through steering the
spin degree of freedom, without moving, measuring, or more generically fusing
the modes. For a spinful Majorana system, we show that braiding two MZMs is
achieved by adiabatically reversing the Majorana spins, which topologically
corresponds to twisting two associated worldribbons, the extention of
worldlines that track the braiding history of MZMs. We demonstrate the
feasibility of applying the current scheme to the
superconductor/2D-topological-insulator/ferromagnetic-insulator (SC/2DTI/FI)
hybrid system which is currently under construction in experiment. A single
braiding of two MZMs is precisely achieved by adiabatically reversing the FI
magnetization, not relying on details of the reversing path, and the braiding
operation is shown to be stable against local imperfections such as the static
and dynamical disorder effects. The stability is a consequence of the intrinsic
connection of the current scheme to topological charge pumping. The proposed
device involves no auxiliary MZMs, rendering a minimal scheme for observing
non-Abelian braiding and having advantages with minimized errors for the
experimental demonstration.
| cond-mat.mes-hall cond-mat.supr-con | we propose a scheme to braid majorana zero modes mzms through steering the spin degree of freedom without moving measuring or more generically fusing the modes for a spinful majorana system we show that braiding two mzms is achieved by adiabatically reversing the majorana spins which topologically corresponds to twisting two associated worldribbons the extention of worldlines that track the braiding history of mzms we demonstrate the feasibility of applying the current scheme to the superconductor2dtopologicalinsulatorferromagneticinsulator sc2dtifi hybrid system which is currently under construction in experiment a single braiding of two mzms is precisely achieved by adiabatically reversing the fi magnetization not relying on details of the reversing path and the braiding operation is shown to be stable against local imperfections such as the static and dynamical disorder effects the stability is a consequence of the intrinsic connection of the current scheme to topological charge pumping the proposed device involves no auxiliary mzms rendering a minimal scheme for observing nonabelian braiding and having advantages with minimized errors for the experimental demonstration | [['we', 'propose', 'a', 'scheme', 'to', 'braid', 'majorana', 'zero', 'modes', 'mzms', 'through', 'steering', 'the', 'spin', 'degree', 'of', 'freedom', 'without', 'moving', 'measuring', 'or', 'more', 'generically', 'fusing', 'the', 'modes', 'for', 'a', 'spinful', 'majorana', 'system', 'we', 'show', 'that', 'braiding', 'two', 'mzms', 'is', 'achieved', 'by', 'adiabatically', 'reversing', 'the', 'majorana', 'spins', 'which', 'topologically', 'corresponds', 'to', 'twisting', 'two', 'associated', 'worldribbons', 'the', 'extention', 'of', 'worldlines', 'that', 'track', 'the', 'braiding', 'history', 'of', 'mzms', 'we', 'demonstrate', 'the', 'feasibility', 'of', 'applying', 'the', 'current', 'scheme', 'to', 'the', 'superconductor2dtopologicalinsulatorferromagneticinsulator', 'sc2dtifi', 'hybrid', 'system', 'which', 'is', 'currently', 'under', 'construction', 'in', 'experiment', 'a', 'single', 'braiding', 'of', 'two', 'mzms', 'is', 'precisely', 'achieved', 'by', 'adiabatically', 'reversing', 'the', 'fi', 'magnetization', 'not', 'relying', 'on', 'details', 'of', 'the', 'reversing', 'path', 'and', 'the', 'braiding', 'operation', 'is', 'shown', 'to', 'be', 'stable', 'against', 'local', 'imperfections', 'such', 'as', 'the', 'static', 'and', 'dynamical', 'disorder', 'effects', 'the', 'stability', 'is', 'a', 'consequence', 'of', 'the', 'intrinsic', 'connection', 'of', 'the', 'current', 'scheme', 'to', 'topological', 'charge', 'pumping', 'the', 'proposed', 'device', 'involves', 'no', 'auxiliary', 'mzms', 'rendering', 'a', 'minimal', 'scheme', 'for', 'observing', 'nonabelian', 'braiding', 'and', 'having', 'advantages', 'with', 'minimized', 'errors', 'for', 'the', 'experimental', 'demonstration']] | [-0.23804952980191002, 0.22966973344972802, -0.06267842159251727, 0.02631650402275097, -0.07171394701505224, -0.203401294605144, 0.06832839057616573, 0.3636758631854762, -0.25250666601849453, -0.2947335798470747, 0.05189376632014977, -0.22476599900428915, -0.1265815008207158, 0.21179199103027627, -0.04443884498184724, 0.053256984795596166, 0.05141848053539261, 0.030144893223353262, -0.08698134182209503, -0.2410462979972917, 0.31347414393349027, 0.007240253607354437, 0.35232558102524353, 0.02284903622092402, 0.11111240354477472, 0.00482687825569883, 0.020617253275954033, -0.001922880284837447, -0.06515019632630963, 0.06371494236823526, 0.18028499999283149, 0.015994854994849966, 0.18308382744656965, -0.43602306660752566, -0.1720907142691777, 0.09241015223856916, 0.1560867186912912, 0.16706644872846527, -0.05748425231849112, -0.33633286564699594, 0.10826665751491896, -0.1959086111712947, -0.12263024202270788, -0.11961953512980558, -0.021141778896673628, -0.0592809488078631, -0.25188125500599634, 0.04281299705395386, 0.0867319483789158, 0.059623779562701075, 0.00982256349275953, -0.0203387876182595, -0.08168653301185086, 0.11307506376206652, 0.013947168541129767, -0.013531030754425697, 0.1577835816008571, -0.12716917877384862, -0.19136337122403174, 0.32051217726915465, -0.04803991102034204, -0.23605065953285834, 0.16285051860835492, -0.08608616306723672, -0.04649614500037084, 0.0908895245063052, 0.01968912866764835, 0.07988382941333666, -0.11784657251943524, 0.05029687643435041, -0.00884296593721956, 0.13609851586685787, 0.041891645340781124, 0.08227744126634207, 0.2818576667963758, 0.15758399353806107, 0.13301579304416442, 0.14854769167210352, -0.10179926743183473, -0.0836367383765589, -0.3254823535680771, -0.1853055168676725, -0.24510418759503713, 0.06267213835001582, -0.013990401788457044, -0.15319687688887434, 0.47770728574193655, 0.16798272282037596, 0.1451335300378213, 0.0018674072468586797, 0.32477985111819135, 0.09786235738560901, 0.07994041179439851, 0.05039171692589575, 0.220492755373319, 0.13982069379528098, 0.004031599155582842, -0.32809110062399194, 0.005395067173854581, 0.08280485394754492] |
1,803.02174 | Radio Imaging With Information Field Theory | Data from radio interferometers provide a substantial challenge for
statisticians. It is incomplete, noise-dominated and originates from a
non-trivial measurement process. The signal is not only corrupted by imperfect
measurement devices but also from effects like fluctuations in the ionosphere
that act as a distortion screen. In this paper we focus on the imaging part of
data reduction in radio astronomy and present RESOLVE, a Bayesian imaging
algorithm for radio interferometry in its new incarnation. It is formulated in
the language of information field theory. Solely by algorithmic advances the
inference could be sped up significantly and behaves noticeably more stable
now. This is one more step towards a fully user-friendly version of RESOLVE
which can be applied routinely by astronomers.
| astro-ph.IM stat.AP | data from radio interferometers provide a substantial challenge for statisticians it is incomplete noisedominated and originates from a nontrivial measurement process the signal is not only corrupted by imperfect measurement devices but also from effects like fluctuations in the ionosphere that act as a distortion screen in this paper we focus on the imaging part of data reduction in radio astronomy and present resolve a bayesian imaging algorithm for radio interferometry in its new incarnation it is formulated in the language of information field theory solely by algorithmic advances the inference could be sped up significantly and behaves noticeably more stable now this is one more step towards a fully userfriendly version of resolve which can be applied routinely by astronomers | [['data', 'from', 'radio', 'interferometers', 'provide', 'a', 'substantial', 'challenge', 'for', 'statisticians', 'it', 'is', 'incomplete', 'noisedominated', 'and', 'originates', 'from', 'a', 'nontrivial', 'measurement', 'process', 'the', 'signal', 'is', 'not', 'only', 'corrupted', 'by', 'imperfect', 'measurement', 'devices', 'but', 'also', 'from', 'effects', 'like', 'fluctuations', 'in', 'the', 'ionosphere', 'that', 'act', 'as', 'a', 'distortion', 'screen', 'in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'imaging', 'part', 'of', 'data', 'reduction', 'in', 'radio', 'astronomy', 'and', 'present', 'resolve', 'a', 'bayesian', 'imaging', 'algorithm', 'for', 'radio', 'interferometry', 'in', 'its', 'new', 'incarnation', 'it', 'is', 'formulated', 'in', 'the', 'language', 'of', 'information', 'field', 'theory', 'solely', 'by', 'algorithmic', 'advances', 'the', 'inference', 'could', 'be', 'sped', 'up', 'significantly', 'and', 'behaves', 'noticeably', 'more', 'stable', 'now', 'this', 'is', 'one', 'more', 'step', 'towards', 'a', 'fully', 'userfriendly', 'version', 'of', 'resolve', 'which', 'can', 'be', 'applied', 'routinely', 'by', 'astronomers']] | [-0.07512669690138052, 0.0917436435764794, -0.11202907229558187, 0.08844877509378901, -0.12115963870921165, -0.1599837112132737, 0.03393530775023209, 0.3754659859571329, -0.28999601073624676, -0.32787444483304073, 0.17356131262673172, -0.25007059193824316, -0.1539589127646913, 0.2355919513526211, -0.09097561430256568, -0.019773238716158277, 0.1014897094506478, -0.03643884422225793, -0.015109772121433692, -0.19131151732242058, 0.2543351122385953, 0.1175635909769407, 0.2731655744878067, 0.018464800162810432, 0.0769353682186824, 0.00016363189471038905, -0.07402101640728079, 0.031003773955181856, -0.03685616167515472, 0.10681161353718643, 0.32398765157785053, 0.16504433271975433, 0.28305108378033256, -0.4383934647583764, -0.23287935073926183, 0.07625580022557954, 0.1550633609910642, 0.14566333098856593, -0.07237430582662914, -0.3034216056323864, 0.036761222899822164, -0.17418348545993656, -0.0789233608081627, -0.0537497673091317, -0.011345796097524095, -0.04942679501808256, -0.2371546661958468, 0.0727670377229575, 0.035708487153145646, 0.06191676644192747, -0.004593678809387786, -0.06648029906536676, 0.06296448124772754, 0.12633373028471728, -0.005826793880199952, 0.0998454078837598, 0.1145528844482658, -0.14990175314524695, -0.1100862472248841, 0.3864061573120065, -0.06217796897153901, -0.1725833686915311, 0.13647506948491203, -0.13716952875641383, -0.1768587450573821, 0.1440284447590551, 0.1805514427063571, 0.10303687802438956, -0.17660479758258077, 0.062475433617864916, 0.0005287046396088871, 0.19951704595515057, 0.05115865661631808, 0.04060865235553423, 0.24243817264445064, 0.17654415414753286, 0.10081702821372339, 0.12676320489580659, -0.11425245628876934, -0.03181989287788218, -0.23697721063782853, -0.11806629886773747, -0.21836291097897328, 0.057567605079264256, -0.024842986417188663, -0.13384275266146364, 0.34590119385152807, 0.1968766637261926, 0.14818157538509935, -0.007152842849392967, 0.3846642035559928, 0.08819054703570686, 0.11668437812092507, 0.05836015804848742, 0.2645657449529683, 0.11813619104598856, 0.13674435426273251, -0.1366818072639929, 0.0901297954342151, -0.035764853327635154] |
1,803.02175 | Coherent dynamics in stochastic systems revealed by full counting
statistics | Stochastic systems feature, in general, both coherent dynamics and incoherent
transitions between different states. We propose a method to identify the
coherent part in the full counting statistics for the transitions. The proposal
is illustrated for electron transfer through a quantum-dot spin valve, which
combines quantum-coherent spin precession with electron tunneling. We show that
by counting the number of transferred electrons as a function of time, it is
possible to distill out the coherent dynamics from the counting statistics even
in transport regimes, in which other tools such as the frequency-dependent
current noise and the waiting-time distribution fail.
| cond-mat.mes-hall cond-mat.stat-mech quant-ph | stochastic systems feature in general both coherent dynamics and incoherent transitions between different states we propose a method to identify the coherent part in the full counting statistics for the transitions the proposal is illustrated for electron transfer through a quantumdot spin valve which combines quantumcoherent spin precession with electron tunneling we show that by counting the number of transferred electrons as a function of time it is possible to distill out the coherent dynamics from the counting statistics even in transport regimes in which other tools such as the frequencydependent current noise and the waitingtime distribution fail | [['stochastic', 'systems', 'feature', 'in', 'general', 'both', 'coherent', 'dynamics', 'and', 'incoherent', 'transitions', 'between', 'different', 'states', 'we', 'propose', 'a', 'method', 'to', 'identify', 'the', 'coherent', 'part', 'in', 'the', 'full', 'counting', 'statistics', 'for', 'the', 'transitions', 'the', 'proposal', 'is', 'illustrated', 'for', 'electron', 'transfer', 'through', 'a', 'quantumdot', 'spin', 'valve', 'which', 'combines', 'quantumcoherent', 'spin', 'precession', 'with', 'electron', 'tunneling', 'we', 'show', 'that', 'by', 'counting', 'the', 'number', 'of', 'transferred', 'electrons', 'as', 'a', 'function', 'of', 'time', 'it', 'is', 'possible', 'to', 'distill', 'out', 'the', 'coherent', 'dynamics', 'from', 'the', 'counting', 'statistics', 'even', 'in', 'transport', 'regimes', 'in', 'which', 'other', 'tools', 'such', 'as', 'the', 'frequencydependent', 'current', 'noise', 'and', 'the', 'waitingtime', 'distribution', 'fail']] | [-0.11079754099031264, 0.17382572978088745, -0.08475521816016764, 0.10656740884439145, 0.014568827504634249, -0.14212008680178956, 0.04254081353013005, 0.3454631311362799, -0.3082068121935032, -0.2939599363551456, 0.01306598096116617, -0.27309736774816196, -0.12048956020545139, 0.24329728355669245, 0.010793253187831415, 0.05258531319167541, 0.02261724391457986, -0.012163202249806146, -0.03656156421508355, -0.1429524653572209, 0.3158504883568658, 0.015748825185571094, 0.3292129892257175, 0.02985931194995587, 0.1266025564645486, 0.06839722728983937, 0.01584899104770501, -0.007054873777800525, -0.07629098066840646, 0.06041538086422833, 0.2817872896486399, 0.05111880374274084, 0.2245476691100428, -0.44388496678094475, -0.22637404621179616, 0.048350579428429505, 0.13352215592333647, 0.18061656357806025, -0.02734030663434948, -0.27208953575060074, -0.013521010345988432, -0.18632381640336648, -0.07668411218067062, -0.1268972732715917, -0.005153465569399449, 0.048982570194924364, -0.2637134645257753, 0.09884531212476444, 0.07510087692311831, -0.0050463547207871265, 0.0058148211219861195, -0.04493986834101949, -0.004817668997150447, 0.14430151971019045, 0.003944878252603265, -0.016921440742871895, 0.16657772017832922, -0.14526446051515488, -0.18220197072737299, 0.3275358680996816, -0.07008924685912776, -0.1976909754816823, 0.18279297267590477, -0.18731512721837024, -0.08267917335318516, 0.1577011463517437, 0.12356111584516356, 0.13716927922463842, -0.14992710275157373, 0.01309696903656598, -0.014160643759354646, 0.13994068648827698, 0.032593112391400704, 0.07652820702178917, 0.2413710553237066, 0.18009815964941647, 0.059447054390092284, 0.15921706724401127, -0.16459869930273568, -0.13241022484132317, -0.2700417055178206, -0.1287442793290378, -0.22299207360673773, 0.09873027968391472, -0.002415360578475995, -0.14457112254945523, 0.44117583976868463, 0.18155987896215248, 0.18542721591965886, 0.007490908460957664, 0.33471683925968043, 0.14624569178036206, 0.02942707875211324, 0.043242243736298105, 0.19600993985956422, 0.14239001572987406, 0.08901961848415359, -0.2972085640019718, 0.04673779489263436, 0.002398880920848068] |
1,803.02176 | Quantum Walks via Quantum Cellular Automata | Very much as its classical counterpart, quantum cellular automata are
expected to be a great tool for simulating complex quantum systems. Here we
introduce a partitioned model of quantum cellular automata and show how it can
simulate, with the same amount of resources (in terms of effective Hilbert
space dimension), various models of quantum walks. All the algorithms developed
within quantum walk models are thus directly inherited by the quantum cellular
automata. The latter, however, has its structure based on local interactions
between qubits, and as such it can be more suitable for present (and future)
experimental implementations.
| quant-ph cond-mat.quant-gas nlin.CG physics.comp-ph | very much as its classical counterpart quantum cellular automata are expected to be a great tool for simulating complex quantum systems here we introduce a partitioned model of quantum cellular automata and show how it can simulate with the same amount of resources in terms of effective hilbert space dimension various models of quantum walks all the algorithms developed within quantum walk models are thus directly inherited by the quantum cellular automata the latter however has its structure based on local interactions between qubits and as such it can be more suitable for present and future experimental implementations | [['very', 'much', 'as', 'its', 'classical', 'counterpart', 'quantum', 'cellular', 'automata', 'are', 'expected', 'to', 'be', 'a', 'great', 'tool', 'for', 'simulating', 'complex', 'quantum', 'systems', 'here', 'we', 'introduce', 'a', 'partitioned', 'model', 'of', 'quantum', 'cellular', 'automata', 'and', 'show', 'how', 'it', 'can', 'simulate', 'with', 'the', 'same', 'amount', 'of', 'resources', 'in', 'terms', 'of', 'effective', 'hilbert', 'space', 'dimension', 'various', 'models', 'of', 'quantum', 'walks', 'all', 'the', 'algorithms', 'developed', 'within', 'quantum', 'walk', 'models', 'are', 'thus', 'directly', 'inherited', 'by', 'the', 'quantum', 'cellular', 'automata', 'the', 'latter', 'however', 'has', 'its', 'structure', 'based', 'on', 'local', 'interactions', 'between', 'qubits', 'and', 'as', 'such', 'it', 'can', 'be', 'more', 'suitable', 'for', 'present', 'and', 'future', 'experimental', 'implementations']] | [-0.09252476102876839, 0.17809557198185702, -0.05629934316883529, 0.10582899193431498, -0.017550473776170795, -0.2070018256805381, 0.04267261268295424, 0.37689034758629847, -0.2979297793793435, -0.25513148905082167, 0.10826971205497844, -0.216376779425167, -0.2007174101154491, 0.24966124787080882, -0.03791509136529069, 0.10021329875346463, 0.07278921132508133, 0.03731784993801646, -0.01915951819178097, -0.264604932937429, 0.27174535087233753, 0.08247720369622491, 0.2814085820252646, 0.015998625712070082, 0.06886164330858358, -0.0115230039655402, 0.012240979996300777, 0.05790269398575943, -0.07272638323953214, 0.15160912765684176, 0.28718195387914514, 0.14953006859346085, 0.24615373481682748, -0.49425503782623886, -0.2884946765131032, 0.15801544177669044, 0.155723540504387, 0.15336987258134677, -0.007436457595684594, -0.31424409595831315, 0.09232780182133049, -0.19327288269949128, -0.0626647907323489, -0.13056064241302048, 0.021283498606454506, 0.01603142797652328, -0.1719358836529938, -0.008263333535774573, 0.045613249439546574, 0.06353568057624662, 0.006410319365237897, -0.06266935298941573, 0.006203754675546091, 0.15623195762437178, -0.09729221279908694, -0.008470228219841967, 0.13420929479868893, -0.1280851692569499, -0.2184921484440565, 0.4551022221115703, -0.015238071439611934, -0.2424997293452105, 0.2505715043231731, -0.08393425223113475, -0.1155914187678421, 0.0461302863609768, 0.15960527719853787, 0.07851879110521807, -0.14529253350516155, 0.13608033194180522, -0.03371746410444683, 0.14683183083044632, -0.01997542121134014, 0.12979578809356507, 0.20762034759818748, 0.18429369804430373, 0.07259123003091283, 0.14000837854347287, -0.03204258677920289, -0.1922426988270932, -0.2418171598941886, -0.20100194884806263, -0.19995577803133435, 0.08399836562231791, -0.0687588104089943, -0.1644912478775356, 0.37466977540004465, 0.16301988286016109, 0.15845156762254786, 0.09175179753100918, 0.2894950338772365, 0.13657637028622308, 0.09936898789007445, 0.059521666229037304, 0.14382066419205572, 0.1354013628882299, 0.0833347962969648, -0.18836854231942976, 0.07345349778782348, 0.07506739669384396] |
1,803.02177 | Homeomorphic Changes of Variable and Fourier Multipliers | We consider the algebras $M_p$ of Fourier multipliers and show that every
bounded continuous function $f$ on $\mathbb R^d$ can be transformed by an
appropriate homeomorphic change of variable into a function that belongs to
$M_p(\mathbb R^d)$ for all $p$, $1<p<\infty$. Moreover, under certain
assumptions on a family $K$ of continuous functions, one change of variable
will suffice for all $f\in K$. A similar result holds for functions on the
torus $\mathbb T^d$. This may be contrasted with the known result on the Wiener
algebra, related to Luzin's rearrangement problem.
| math.CA | we consider the algebras m_p of fourier multipliers and show that every bounded continuous function f on mathbb rd can be transformed by an appropriate homeomorphic change of variable into a function that belongs to m_pmathbb rd for all p 1pinfty moreover under certain assumptions on a family k of continuous functions one change of variable will suffice for all fin k a similar result holds for functions on the torus mathbb td this may be contrasted with the known result on the wiener algebra related to luzins rearrangement problem | [['we', 'consider', 'the', 'algebras', 'm_p', 'of', 'fourier', 'multipliers', 'and', 'show', 'that', 'every', 'bounded', 'continuous', 'function', 'f', 'on', 'mathbb', 'rd', 'can', 'be', 'transformed', 'by', 'an', 'appropriate', 'homeomorphic', 'change', 'of', 'variable', 'into', 'a', 'function', 'that', 'belongs', 'to', 'm_pmathbb', 'rd', 'for', 'all', 'p', '1pinfty', 'moreover', 'under', 'certain', 'assumptions', 'on', 'a', 'family', 'k', 'of', 'continuous', 'functions', 'one', 'change', 'of', 'variable', 'will', 'suffice', 'for', 'all', 'fin', 'k', 'a', 'similar', 'result', 'holds', 'for', 'functions', 'on', 'the', 'torus', 'mathbb', 'td', 'this', 'may', 'be', 'contrasted', 'with', 'the', 'known', 'result', 'on', 'the', 'wiener', 'algebra', 'related', 'to', 'luzins', 'rearrangement', 'problem']] | [-0.13381181088056457, 0.11907248702989184, -0.07518785494494806, 0.03562969770256346, -0.06601353858210397, -0.1424966952240283, -0.005891579203307629, 0.372714286398017, -0.3337035931939824, -0.13725611142123514, 0.12656394303828644, -0.2536389781214464, -0.11607183080710722, 0.23401864406684142, -0.11558482250763794, 0.04698790236784334, 0.019807165530457926, 0.07859260061222097, -0.12176191908820125, -0.26324298852541894, 0.36403218811649957, -0.10234173081993136, 0.1732318683140231, 0.019422372810286206, 0.06998395110909524, 0.05660715719078029, 0.0188812893197945, -0.014923579279291495, -0.19347976267764874, 0.050692720827254144, 0.2233037959072697, 0.12213942352054494, 0.2889161417940945, -0.3686509810769381, -0.2067175348880544, 0.2108310599918634, 0.1254183487689353, -0.09645650814695472, -0.005551066328091233, -0.25036022054774454, 0.10643190097618388, -0.09552527867843595, -0.15023865624529759, -0.051854118432724076, 0.0857335896508538, 0.05725334221601821, -0.37100244794836207, 0.030424042814149614, 0.14469934702233483, 0.01929776001658835, -0.1358834731345473, -0.15125131416082216, -0.050472466222774445, 0.060444652720281246, -0.01995879817319762, 0.17958297721748606, 0.10454018128901103, -0.0023184520940641674, -0.09925421880913919, 0.3646610579002136, -0.09041201728500761, -0.2828400001934405, 0.14266493565957533, -0.20546960744554219, -0.19597284243117724, 0.1185929745728715, 0.13705296341455384, 0.1573905177895775, -0.07609805194765665, 0.19886725198077249, -0.11616507361988339, 0.14054802134423777, 0.08238897645280938, 0.0256851040915157, 0.11440394727481801, 0.06290043330636252, 0.17935204230709356, 0.14334981582615408, 0.04117924756150734, -0.007893121476923481, -0.37511379673574746, -0.15175325781358093, -0.19512566055819977, 0.1236337406503225, -0.12095636176190658, -0.15422315313742402, 0.3473670619770131, 0.10451146544956634, 0.1898828854344869, 0.09948874500892753, 0.1520195704455791, 0.1594437573738187, 0.08453044825850912, 0.04808280125176639, 0.09184404270032819, 0.10375533074309286, 0.016509721599770395, -0.15168748959229233, 0.06499590369966927, 0.12962465376506188] |
1,803.02178 | A Joint Central Limit Theorem for the Sum-of-Digits Function, and
Asymptotic Divisibility of Catalan-like Sequences | We prove a central limit theorem for the joint distribution of $s_q(A_jn)$,
$1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and
the $A_j$'s are positive integers relatively prime to $q$. We do this in fact
within the framework of quasi-additive functions. As application, we show that
most elements of "Catalan-like" sequences - by which we mean integer sequences
defined by products/quotients of factorials - are divisible by any given
positive integer.
| math.NT math.CO | we prove a central limit theorem for the joint distribution of s_qa_jn 1le j le d where s_q denotes the sumofdigits function in baseq and the a_js are positive integers relatively prime to q we do this in fact within the framework of quasiadditive functions as application we show that most elements of catalanlike sequences by which we mean integer sequences defined by productsquotients of factorials are divisible by any given positive integer | [['we', 'prove', 'a', 'central', 'limit', 'theorem', 'for', 'the', 'joint', 'distribution', 'of', 's_qa_jn', '1le', 'j', 'le', 'd', 'where', 's_q', 'denotes', 'the', 'sumofdigits', 'function', 'in', 'baseq', 'and', 'the', 'a_js', 'are', 'positive', 'integers', 'relatively', 'prime', 'to', 'q', 'we', 'do', 'this', 'in', 'fact', 'within', 'the', 'framework', 'of', 'quasiadditive', 'functions', 'as', 'application', 'we', 'show', 'that', 'most', 'elements', 'of', 'catalanlike', 'sequences', 'by', 'which', 'we', 'mean', 'integer', 'sequences', 'defined', 'by', 'productsquotients', 'of', 'factorials', 'are', 'divisible', 'by', 'any', 'given', 'positive', 'integer']] | [-0.18434682588132334, 0.14671388982047498, -0.055435650640095153, 0.05651372011823081, 0.016964280741735244, -0.14483356581423695, 0.023939214633699035, 0.3259137305627826, -0.2835959425330503, -0.24516274466297777, 0.04413599216930148, -0.2982011297586518, -0.15553619599127225, 0.16108768337740706, -0.10443373805921997, 0.03750616993958419, -0.022781498454721043, 0.06261417750452816, -0.04192725537200524, -0.25453963590471046, 0.3404311012266807, -0.0778995092669633, 0.14093849824907087, 0.04467169534985606, 0.10412505214286208, 0.06884063472401541, -0.004117487588713707, -0.0035570418990125328, -0.19456698365468927, 0.09481557815427512, 0.2921514835366061, 0.15001990340164745, 0.3092403599703816, -0.3281801758124165, -0.12060575353794954, 0.22332284225701865, 0.17161087792130633, -0.032086466040632776, -0.015351556205439945, -0.19040552718223822, 0.19786365516483784, -0.1662273197106912, -0.11300052077391408, -0.06336824761205156, 0.13682361768925905, 0.1156726975820329, -0.36311635291728545, 0.06966532913731857, 0.13165065668470843, 0.0980874978360051, -0.02677690962814844, -0.2515329223545924, 0.012907754544588462, 0.09900825706795907, 0.006271290763373107, 0.04035052896844564, 0.039098117257875036, -0.06697376291136402, -0.11274688162276862, 0.30351520832103324, -0.07744794941021943, -0.22989574620421505, 0.05745669662899954, -0.22665670489839895, -0.16697041510643673, 0.06716101195558276, 0.10661008377546366, 0.18874112990173236, -0.011856042320879412, 0.17662974757808064, -0.11292940895007529, 0.13609528488440203, 0.11296144142602636, 0.021946719985350336, 0.17043811758704694, -0.0005950411178276573, 0.04832180932698719, 0.13964825284234444, -0.012439416682111546, -0.02378789544053061, -0.35518836912135004, -0.15834183044547975, -0.27825323353901926, 0.12235741679307441, -0.11646166219499822, -0.13849396730812502, 0.29054439534813586, 0.06653319396944322, 0.18770333683826554, 0.15539243707308728, 0.18734394598909668, 0.1389007006302922, 0.03770368997807759, 0.09960260894149542, 0.060096779221695075, 0.1329069832523524, -0.012672273423293159, -0.12124548304143926, 0.028622178780570835, 0.14950416223998642] |
1,803.02179 | The Impact of Semantic Context Cues on the User Acceptance of Tag
Recommendations: An Online Study | In this paper, we present the results of an online study with the aim to shed
light on the impact that semantic context cues have on the user acceptance of
tag recommendations. Therefore, we conducted a work-integrated social
bookmarking scenario with 17 university employees in order to compare the user
acceptance of a context-aware tag recommendation algorithm called 3Layers with
the user acceptance of a simple popularity-based baseline. In this scenario, we
validated and verified the hypothesis that semantic context cues have a higher
impact on the user acceptance of tag recommendations in a collaborative tagging
setting than in an individual tagging setting. With this paper, we contribute
to the sparse line of research presenting online recommendation studies.
| cs.IR cs.HC | in this paper we present the results of an online study with the aim to shed light on the impact that semantic context cues have on the user acceptance of tag recommendations therefore we conducted a workintegrated social bookmarking scenario with 17 university employees in order to compare the user acceptance of a contextaware tag recommendation algorithm called 3layers with the user acceptance of a simple popularitybased baseline in this scenario we validated and verified the hypothesis that semantic context cues have a higher impact on the user acceptance of tag recommendations in a collaborative tagging setting than in an individual tagging setting with this paper we contribute to the sparse line of research presenting online recommendation studies | [['in', 'this', 'paper', 'we', 'present', 'the', 'results', 'of', 'an', 'online', 'study', 'with', 'the', 'aim', 'to', 'shed', 'light', 'on', 'the', 'impact', 'that', 'semantic', 'context', 'cues', 'have', 'on', 'the', 'user', 'acceptance', 'of', 'tag', 'recommendations', 'therefore', 'we', 'conducted', 'a', 'workintegrated', 'social', 'bookmarking', 'scenario', 'with', '17', 'university', 'employees', 'in', 'order', 'to', 'compare', 'the', 'user', 'acceptance', 'of', 'a', 'contextaware', 'tag', 'recommendation', 'algorithm', 'called', '3layers', 'with', 'the', 'user', 'acceptance', 'of', 'a', 'simple', 'popularitybased', 'baseline', 'in', 'this', 'scenario', 'we', 'validated', 'and', 'verified', 'the', 'hypothesis', 'that', 'semantic', 'context', 'cues', 'have', 'a', 'higher', 'impact', 'on', 'the', 'user', 'acceptance', 'of', 'tag', 'recommendations', 'in', 'a', 'collaborative', 'tagging', 'setting', 'than', 'in', 'an', 'individual', 'tagging', 'setting', 'with', 'this', 'paper', 'we', 'contribute', 'to', 'the', 'sparse', 'line', 'of', 'research', 'presenting', 'online', 'recommendation', 'studies']] | [-0.0718346558407777, 0.004976144422922268, -0.07866449647485557, 0.05435176076801319, -0.16771840729997453, -0.14358866323406497, 0.11558516431026734, 0.4554601183049699, -0.16881308526310146, -0.33624960335656107, 0.010236092812767746, -0.3144026689955758, -0.15175567502872303, 0.12497192947591981, -0.12249718717116322, 0.017576517744196787, 0.10699806909642032, 0.092099233243901, -0.026290180786457073, -0.31044118298997736, 0.32762855695735693, 0.1271470664228257, 0.3186327462347272, 0.09896627846412742, 0.06876748939180094, 0.021579732676633656, -0.13496189335217842, 0.0034764309962972617, -0.11822277562691269, 0.1651630260082137, 0.3483182657908043, 0.24137801210929313, 0.3586533923243356, -0.34729389066242766, -0.15513636430518496, 0.04904672025870054, 0.14195714481811747, 0.04036845001750267, -0.14107042761881733, -0.38139967768429184, 0.12886031760543618, -0.26770278786778706, -0.01471974713425351, -0.028804141217166096, -0.061988218790955014, 0.01765350302339046, -0.285023481800006, -0.03445575273253469, 0.04846036651482185, 0.1198011151013466, -0.024988425012009267, -0.10016556408924934, 0.0959725463603679, 0.17276665481189504, 0.08216441810353954, 0.009216221353898827, 0.13891458657418942, -0.17878593997353226, -0.1919299373562392, 0.4019925794603988, -0.04036485140461128, -0.22081013785229406, 0.18460452060700736, -0.0918631919592014, -0.19991422864871147, 0.06261073085519238, 0.3126079427301247, 0.09664736198595701, -0.18935799800878406, -0.016320411611893654, -0.08240482450013137, 0.1916711830880302, 0.04904923853902226, -0.0021173968218649044, 0.15592731446680477, 0.27748805151567757, 0.0377804453118553, 0.10652831707619385, -0.07187456232654807, -0.05132148582408698, -0.2107690502770054, -0.16328879001622015, -0.10526059412707885, -0.031252636453720124, -0.07099694088009349, -0.08993209473406658, 0.409599891394122, 0.24297743764632326, 0.19299182490571043, 0.06812750484444137, 0.32818237306056625, 0.03286296509535392, 0.048935272961727574, 0.06014487110715137, 0.158266245546695, -0.036079124149540044, 0.21977406420593715, -0.18083969560953286, 0.12949932464517844, 0.029290146361558866] |
1,803.0218 | Probabilistic team semantics | Team semantics is a semantical framework for the study of dependence and
independence concepts ubiquitous in many areas such as databases and
statistics. In recent works team semantics has been generalised to accommodate
also multisets and probabilistic dependencies. In this article we study a
variant of probabilistic team semantics and relate this framework to a Tarskian
two-sorted logic. We also show that very simple quantifier-free formulae of our
logic give rise to NP-hard model checking problems.
| cs.LO | team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics in recent works team semantics has been generalised to accommodate also multisets and probabilistic dependencies in this article we study a variant of probabilistic team semantics and relate this framework to a tarskian twosorted logic we also show that very simple quantifierfree formulae of our logic give rise to nphard model checking problems | [['team', 'semantics', 'is', 'a', 'semantical', 'framework', 'for', 'the', 'study', 'of', 'dependence', 'and', 'independence', 'concepts', 'ubiquitous', 'in', 'many', 'areas', 'such', 'as', 'databases', 'and', 'statistics', 'in', 'recent', 'works', 'team', 'semantics', 'has', 'been', 'generalised', 'to', 'accommodate', 'also', 'multisets', 'and', 'probabilistic', 'dependencies', 'in', 'this', 'article', 'we', 'study', 'a', 'variant', 'of', 'probabilistic', 'team', 'semantics', 'and', 'relate', 'this', 'framework', 'to', 'a', 'tarskian', 'twosorted', 'logic', 'we', 'also', 'show', 'that', 'very', 'simple', 'quantifierfree', 'formulae', 'of', 'our', 'logic', 'give', 'rise', 'to', 'nphard', 'model', 'checking', 'problems']] | [-0.06934532932446975, -0.0028614663302792714, -0.13183361180065395, 0.16909793293023923, -0.1999140128395275, -0.15691840075765198, 0.050763489985624084, 0.3767281875357424, -0.30929586477577686, -0.34296361126593855, 0.04928647070712606, -0.22116808448673078, -0.1814404815300613, 0.1552975898283828, -0.17959364634129757, 0.04949797864537686, 0.034615551090897305, 0.032089501380381226, -0.013313347102283794, -0.22994251446308275, 0.28682329679692264, 0.0034543469450191446, 0.26190121573592096, 0.0795884199170886, 0.08190012783865984, 0.02952121853166701, -0.01866981352520126, 0.12888088005159884, -0.1347773124523787, 0.14211434055285185, 0.37861486023144897, 0.2716915907283117, 0.30227645800301906, -0.439675655436555, -0.1489444237147262, 0.11208085547274861, 0.06421560849948467, 0.1251716357900908, 0.015192136548361495, -0.29440490881863396, 0.050420823065858135, -0.2520685357678878, -0.020915232119334274, -0.16274858304103346, 0.08940183709522612, 0.005881656298266822, -0.24204637767060808, -0.06136637250356695, 0.1912281531595478, 0.12316109584399353, -0.026302510425203332, -0.07883920671271258, 0.07720280179331128, 0.05037491509421287, 0.012931792801138823, -0.003381309222037855, 0.06906720220209345, -0.08963159088805121, -0.23940906083015234, 0.3455959495745207, -0.026956298413049234, -0.1528338219382261, 0.18047470512407782, -0.05622861407831997, -0.29292473634459865, 0.02002139111343575, 0.15474618951741018, 0.1348609710112214, -0.18830327689034962, 0.13693049912475735, -0.11893553776960623, 0.19136455118362056, 0.10776070063002408, 0.06640481018142677, 0.19559166950516796, 0.2183241421650899, 0.027932755654451046, 0.17074742142454183, 0.056207216442807725, -0.14379791337016382, -0.2806230904779544, -0.1467914750418889, -0.06577474189811926, -0.11166154746713705, -0.0656480025186044, -0.202040534564539, 0.38693247519825635, 0.23431895112336956, 0.14441966187012822, 0.18964374158531427, 0.28934010802032917, 0.08108358329627663, 0.06003733491525054, 0.017667203740290318, 0.11547925359551109, 0.17503028995308437, 0.14312995355373315, -0.11042403139933747, 0.13264479368195967, 0.07112731987389882] |
1,803.02181 | 2^B3^C: 2 Box 3 Crop of Facial Image for Gender Classification with
Convolutional Networks | In this paper, we tackle the classification of gender in facial images with
deep learning. Our convolutional neural networks (CNN) use the VGG-16
architecture [1] and are pretrained on ImageNet for image classification. Our
proposed method (2^B3^C) first detects the face in the facial image, increases
the margin of a detected face by 50%, cropping the face with two boxes three
crop schemes (Left, Middle, and Right crop) and extracts the CNN predictions on
the cropped schemes. The CNNs of our method is fine-tuned on the Adience and
LFW with gender annotations. We show the effectiveness of our method by
achieving 90.8% classification on Adience and achieving competitive 95.3%
classification accuracy on LFW dataset. In addition, to check the true ability
of our method, our gender classification system has a frame rate of 7-10 fps
(frames per seconds) on a GPU considering real-time scenarios.
| cs.CV | in this paper we tackle the classification of gender in facial images with deep learning our convolutional neural networks cnn use the vgg16 architecture 1 and are pretrained on imagenet for image classification our proposed method 2b3c first detects the face in the facial image increases the margin of a detected face by 50 cropping the face with two boxes three crop schemes left middle and right crop and extracts the cnn predictions on the cropped schemes the cnns of our method is finetuned on the adience and lfw with gender annotations we show the effectiveness of our method by achieving 908 classification on adience and achieving competitive 953 classification accuracy on lfw dataset in addition to check the true ability of our method our gender classification system has a frame rate of 710 fps frames per seconds on a gpu considering realtime scenarios | [['in', 'this', 'paper', 'we', 'tackle', 'the', 'classification', 'of', 'gender', 'in', 'facial', 'images', 'with', 'deep', 'learning', 'our', 'convolutional', 'neural', 'networks', 'cnn', 'use', 'the', 'vgg16', 'architecture', '1', 'and', 'are', 'pretrained', 'on', 'imagenet', 'for', 'image', 'classification', 'our', 'proposed', 'method', '2b3c', 'first', 'detects', 'the', 'face', 'in', 'the', 'facial', 'image', 'increases', 'the', 'margin', 'of', 'a', 'detected', 'face', 'by', '50', 'cropping', 'the', 'face', 'with', 'two', 'boxes', 'three', 'crop', 'schemes', 'left', 'middle', 'and', 'right', 'crop', 'and', 'extracts', 'the', 'cnn', 'predictions', 'on', 'the', 'cropped', 'schemes', 'the', 'cnns', 'of', 'our', 'method', 'is', 'finetuned', 'on', 'the', 'adience', 'and', 'lfw', 'with', 'gender', 'annotations', 'we', 'show', 'the', 'effectiveness', 'of', 'our', 'method', 'by', 'achieving', '908', 'classification', 'on', 'adience', 'and', 'achieving', 'competitive', '953', 'classification', 'accuracy', 'on', 'lfw', 'dataset', 'in', 'addition', 'to', 'check', 'the', 'true', 'ability', 'of', 'our', 'method', 'our', 'gender', 'classification', 'system', 'has', 'a', 'frame', 'rate', 'of', '710', 'fps', 'frames', 'per', 'seconds', 'on', 'a', 'gpu', 'considering', 'realtime', 'scenarios']] | [-0.022757835360569554, -0.09765455591772403, 0.00014239062361380125, 0.010011237726865949, -0.01618305803439417, -0.20634210229870845, 0.020252362778166087, 0.4791109468918163, -0.18345378188846204, -0.36344856500521405, 0.09534694919024002, -0.3076931723634471, -0.1631644379699251, 0.22515580359963583, -0.2247400167365591, 0.07910631976735133, 0.20793021550252253, 0.10059568313621245, -0.06603828877156886, -0.4170805061613763, 0.27496068572977206, 0.014270620360128725, 0.35513953391749126, 0.07080025127860945, 0.17558979598635976, -0.07630532447141238, -0.030930244311742433, -0.061753721582097604, -0.010596262705447217, 0.19502517444706827, 0.26578427646699904, 0.1844154251934765, 0.3018679613299616, -0.3376909289386944, -0.17023286772761625, 0.040129533235864025, 0.11308485245774988, 0.09638904974880544, -0.024408827293208323, -0.421808961463011, 0.14968824015044563, -0.17677714653521567, 0.08887372100139623, -0.12587289468522048, -0.03448827822539643, -0.06232770465939612, -0.27559570853526777, 0.0939793618154953, 0.09498130649953455, 0.12059643889217267, -0.09589286191206607, -0.13693298180375926, 0.008621583027615362, 0.18718727630191853, 0.007404680440358661, 0.08217854110419855, 0.16182673744241857, -0.25358994682058955, -0.14860749184284228, 0.36391859363367246, -0.06555139024455386, -0.20384599943156842, 0.19142970097270776, -0.03233158748948595, -0.14050517613870106, 0.07831494826041943, 0.250997006911068, 0.1499162914529174, -0.09021354255663765, -0.043287998427216846, -0.09832341547312957, 0.2263978031281564, 0.11455459354552798, -0.07619035611306871, 0.15280866794535644, 0.31071847716307305, -0.01135729237661495, 0.13403107746263276, -0.27814138075336814, 0.006300334694919052, -0.18501911706362778, -0.09520053383210426, -0.19531578656572562, -0.0814357858615841, -0.16165357631730107, -0.10016428780826656, 0.4765206659277836, 0.24231076635863188, 0.20359256221437372, 0.17269764225148446, 0.36012305167073816, -0.05146787229801652, 0.1622404377106447, 0.08337519366710962, 0.1909633456384177, -0.04879855036644356, 0.11511794548038837, -0.19120795881844588, 0.05723125709467437, 0.10979099907436883] |
1,803.02182 | Input-Output Performance of Linear-Quadratic Saddle-Point Algorithms
with Application to Distributed Resource Allocation Problems | Saddle-point or primal-dual methods have recently attracted renewed interest
as a systematic technique to design distributed algorithms which solve convex
optimization problems. When implemented online for streaming data or as dynamic
feedback controllers, these algorithms become subject to disturbances and
noise; convergence rates provide incomplete performance information, and
quantifying input-output performance becomes more important. We analyze the
input-output performance of the continuous-time saddle-point method applied to
linearly constrained quadratic programs, providing explicit expressions for the
saddle-point H2 norm under a relevant input-output configuration. We then
proceed to derive analogous results for regularized and augmented versions of
the saddle-point algorithm. We observe some rather peculiar effects -- a modest
amount of regularization significantly improves the transient performance,
while augmentation does not necessarily offer improvement. We then propose a
distributed dual version of the algorithm which overcomes some of the
performance limitations imposed by augmentation. Finally, we apply our results
to a resource allocation problem to compare the input-output performance of
various centralized and distributed saddle-point implementations and show that
distributed algorithms may perform as well as their centralized counterparts.
| math.OC | saddlepoint or primaldual methods have recently attracted renewed interest as a systematic technique to design distributed algorithms which solve convex optimization problems when implemented online for streaming data or as dynamic feedback controllers these algorithms become subject to disturbances and noise convergence rates provide incomplete performance information and quantifying inputoutput performance becomes more important we analyze the inputoutput performance of the continuoustime saddlepoint method applied to linearly constrained quadratic programs providing explicit expressions for the saddlepoint h2 norm under a relevant inputoutput configuration we then proceed to derive analogous results for regularized and augmented versions of the saddlepoint algorithm we observe some rather peculiar effects a modest amount of regularization significantly improves the transient performance while augmentation does not necessarily offer improvement we then propose a distributed dual version of the algorithm which overcomes some of the performance limitations imposed by augmentation finally we apply our results to a resource allocation problem to compare the inputoutput performance of various centralized and distributed saddlepoint implementations and show that distributed algorithms may perform as well as their centralized counterparts | [['saddlepoint', 'or', 'primaldual', 'methods', 'have', 'recently', 'attracted', 'renewed', 'interest', 'as', 'a', 'systematic', 'technique', 'to', 'design', 'distributed', 'algorithms', 'which', 'solve', 'convex', 'optimization', 'problems', 'when', 'implemented', 'online', 'for', 'streaming', 'data', 'or', 'as', 'dynamic', 'feedback', 'controllers', 'these', 'algorithms', 'become', 'subject', 'to', 'disturbances', 'and', 'noise', 'convergence', 'rates', 'provide', 'incomplete', 'performance', 'information', 'and', 'quantifying', 'inputoutput', 'performance', 'becomes', 'more', 'important', 'we', 'analyze', 'the', 'inputoutput', 'performance', 'of', 'the', 'continuoustime', 'saddlepoint', 'method', 'applied', 'to', 'linearly', 'constrained', 'quadratic', 'programs', 'providing', 'explicit', 'expressions', 'for', 'the', 'saddlepoint', 'h2', 'norm', 'under', 'a', 'relevant', 'inputoutput', 'configuration', 'we', 'then', 'proceed', 'to', 'derive', 'analogous', 'results', 'for', 'regularized', 'and', 'augmented', 'versions', 'of', 'the', 'saddlepoint', 'algorithm', 'we', 'observe', 'some', 'rather', 'peculiar', 'effects', 'a', 'modest', 'amount', 'of', 'regularization', 'significantly', 'improves', 'the', 'transient', 'performance', 'while', 'augmentation', 'does', 'not', 'necessarily', 'offer', 'improvement', 'we', 'then', 'propose', 'a', 'distributed', 'dual', 'version', 'of', 'the', 'algorithm', 'which', 'overcomes', 'some', 'of', 'the', 'performance', 'limitations', 'imposed', 'by', 'augmentation', 'finally', 'we', 'apply', 'our', 'results', 'to', 'a', 'resource', 'allocation', 'problem', 'to', 'compare', 'the', 'inputoutput', 'performance', 'of', 'various', 'centralized', 'and', 'distributed', 'saddlepoint', 'implementations', 'and', 'show', 'that', 'distributed', 'algorithms', 'may', 'perform', 'as', 'well', 'as', 'their', 'centralized', 'counterparts']] | [-0.10868124954341937, -0.029850745538123332, -0.07392633336054892, 0.09395727529953428, -0.12271386074786217, -0.1953973325527152, 0.08527419558005397, 0.4238092462179688, -0.3036577428656888, -0.29339980022155676, 0.15061828934477042, -0.20972109286346088, -0.18053346581094093, 0.2178190863588667, -0.13968930567225368, 0.1346460136737527, 0.09737802368962327, 0.0002547835138308063, -0.11078867175840604, -0.29958314575731104, 0.24635423304142146, 0.07826766106799918, 0.3073248134578689, 0.012934986665373994, 0.10002506786686405, 0.0029806432782509234, -0.02022442077996872, 0.07415435973378583, -0.09689214687991268, 0.13351688675364048, 0.30163118602592226, 0.19708424647691222, 0.3510762937893133, -0.4399108803268038, -0.18055850316952562, 0.12644265922138961, 0.17951250262130947, 0.11991656504013697, -0.081841466094431, -0.26783846539845113, 0.07552035137916267, -0.16844913830170355, -0.07210148493154238, -0.1504592178336813, -0.06878139104925643, 0.03759038941829676, -0.3430773438333328, 0.051699192744632395, 0.04678379050929541, 0.020150720289155925, -0.060544393054935766, -0.15125495375207715, 0.06332408051640533, 0.09035560072187235, 0.04128002344517532, -0.008482224614777744, 0.16728493095885982, -0.1041660263146521, -0.17339235039146375, 0.35849658194087486, -0.030871498959183712, -0.2267525291608352, 0.17888475899810846, 0.0030011721560468446, -0.15302026270767727, 0.13720861915038574, 0.23867007412837218, 0.12153193829475907, -0.16618960671362634, 0.07996763178182892, 0.003291408453757564, 0.15104124947624692, 0.01948285497867076, 0.08745334820958686, 0.10075096646981514, 0.15387335210107267, 0.14544955746660082, 0.20323233686961065, -0.03930922385599822, -0.15964022908086156, -0.21933707974503858, -0.0807723055112223, -0.1414169231337616, 0.00023704787164118856, -0.08733526866389425, -0.17721938584157723, 0.3380547697566407, 0.19376112071936688, 0.16106595765893994, 0.13021374020415047, 0.3703581449065336, 0.11423321111893313, 0.04235160670744381, 0.145353812423119, 0.21028615032766004, 0.08757338264699246, 0.11814577855553877, -0.24583799239132278, 0.06785524779230903, 0.053320208123732504] |
1,803.02183 | Completed tensor products and a global approach to $p$-adic analytic
differential operators | Ardakov-Wadsley defined the sheaf D-cap of $p$-adic analytic differential
operators on a smooth rigid analytic variety $X$ by restricting to the case
where $X$ is affinoid and the tangent sheaf admits a smooth Lie lattice. We
generalize their results by dropping the assumption of a smooth Lie lattice
throughout, which allows us to describe the sections of D-cap for arbitrary
affinoid subdomains and not just on a suitable base of the topology. The
structural results concerning D-cap and coadmissible D-cap-modules can then be
generalized in a natural way. The main ingredient for our proofs is a study of
completed tensor products over normed $K$-algebras, for $K$ a discretely valued
field of mixed characteristic. Given a normed right module $U$ over a normed
$K$-algebra $A$, we provide several exactness criteria for the functor
$U\widehat{\otimes}_A-$ applied to complexes of strict morphisms, including a
necessary and sufficient condition in the case of short exact sequences.
| math.NT math.RA | ardakovwadsley defined the sheaf dcap of padic analytic differential operators on a smooth rigid analytic variety x by restricting to the case where x is affinoid and the tangent sheaf admits a smooth lie lattice we generalize their results by dropping the assumption of a smooth lie lattice throughout which allows us to describe the sections of dcap for arbitrary affinoid subdomains and not just on a suitable base of the topology the structural results concerning dcap and coadmissible dcapmodules can then be generalized in a natural way the main ingredient for our proofs is a study of completed tensor products over normed kalgebras for k a discretely valued field of mixed characteristic given a normed right module u over a normed kalgebra a we provide several exactness criteria for the functor uwidehatotimes_a applied to complexes of strict morphisms including a necessary and sufficient condition in the case of short exact sequences | [['ardakovwadsley', 'defined', 'the', 'sheaf', 'dcap', 'of', 'padic', 'analytic', 'differential', 'operators', 'on', 'a', 'smooth', 'rigid', 'analytic', 'variety', 'x', 'by', 'restricting', 'to', 'the', 'case', 'where', 'x', 'is', 'affinoid', 'and', 'the', 'tangent', 'sheaf', 'admits', 'a', 'smooth', 'lie', 'lattice', 'we', 'generalize', 'their', 'results', 'by', 'dropping', 'the', 'assumption', 'of', 'a', 'smooth', 'lie', 'lattice', 'throughout', 'which', 'allows', 'us', 'to', 'describe', 'the', 'sections', 'of', 'dcap', 'for', 'arbitrary', 'affinoid', 'subdomains', 'and', 'not', 'just', 'on', 'a', 'suitable', 'base', 'of', 'the', 'topology', 'the', 'structural', 'results', 'concerning', 'dcap', 'and', 'coadmissible', 'dcapmodules', 'can', 'then', 'be', 'generalized', 'in', 'a', 'natural', 'way', 'the', 'main', 'ingredient', 'for', 'our', 'proofs', 'is', 'a', 'study', 'of', 'completed', 'tensor', 'products', 'over', 'normed', 'kalgebras', 'for', 'k', 'a', 'discretely', 'valued', 'field', 'of', 'mixed', 'characteristic', 'given', 'a', 'normed', 'right', 'module', 'u', 'over', 'a', 'normed', 'kalgebra', 'a', 'we', 'provide', 'several', 'exactness', 'criteria', 'for', 'the', 'functor', 'uwidehatotimes_a', 'applied', 'to', 'complexes', 'of', 'strict', 'morphisms', 'including', 'a', 'necessary', 'and', 'sufficient', 'condition', 'in', 'the', 'case', 'of', 'short', 'exact', 'sequences']] | [-0.18173100306176032, 0.02640442228845216, -0.10535247528937873, 0.0722394160454513, -0.1165838154350463, -0.12066668901123748, 0.01473955203631017, 0.37042319467476265, -0.3347113339341437, -0.1342787832724831, 0.09934296483784569, -0.16397735677454822, -0.11157354792357971, 0.23025081349561446, -0.13199703507002022, 9.253758949455836e-05, 0.03521452077497907, 0.10846091680932599, -0.09714460784001955, -0.28317203867443475, 0.40599562740878553, -0.05474323537339463, 0.21137862692013482, 0.05515640928095441, 0.15402716595913893, 0.0470351545164818, -0.011311922806765367, 0.011864996123565546, -0.1788262013690577, 0.14108605257895412, 0.3206243839065563, 0.07692442565696894, 0.23932698044451015, -0.4028549380353744, -0.1374148640986717, 0.18447239887869812, 0.09066564408100106, -0.004019352000681622, 0.005668988186150592, -0.2843954173619828, 0.15044408871342016, -0.1511692792756964, -0.13229551765179595, -0.10555967268231788, 0.048580073428475944, 0.051029154173536415, -0.31810407203912044, -0.021158974463527172, 0.11367440680797453, 0.12783632188147268, -0.12366440593433067, -0.07414329385952345, -0.06525623439872848, 0.05483371616088298, -0.058844816972754455, 0.07384635355486997, 0.11125943711372895, -0.05943753536241684, -0.08219548794194217, 0.3712716470256645, -0.06996648610008276, -0.24536245137095353, 0.13720197185553265, -0.16733027995866262, -0.11845983886807565, 0.13760789276550936, 0.08034108025916167, 0.18547304505667347, -0.05045591943607425, 0.22384796525808112, -0.13186584192864745, 0.06998850365742942, 0.09598754862452925, -0.0037568117374714638, 0.13188682279753072, 0.10678321741126626, 0.10153843571481276, 0.1138675846922711, 0.030302998424809893, -0.06814068071667524, -0.3950939846058555, -0.19471302754569503, -0.09008581820483758, 0.14212565155046844, -0.1045594319530812, -0.1753977986225328, 0.4007361907117217, 0.062259842256170435, 0.2331164146388807, 0.12457748820514893, 0.2283046203441856, 0.0445021390934191, 0.05099094156400876, -0.0024546233656513967, 0.08913303177729742, 0.2577327310033636, 0.01236825373790085, -0.07416048156874662, -0.006375926318547584, 0.16533078009645077] |
1,803.02184 | Submanifolds in metallic Riemannian manifolds | The aim of our paper is to focus on some properties of submanifolds in Riemannian manifolds endowed with endomorphisms that generalize the Golden Riemannian structure, named metallic Riemannian structures. We focus on the properties of the structure induced on submanifolds, named by us $\Sigma$-metallic Riemannian structures, especialy regarding the normality of this types of structure. Examples of structures induced on a sphere of codimension 1 by some metallic Riemannian structures defined on an Euclidean space are given. | math.DG | the aim of our paper is to focus on some properties of submanifolds in riemannian manifolds endowed with endomorphisms that generalize the golden riemannian structure named metallic riemannian structures we focus on the properties of the structure induced on submanifolds named by us sigmametallic riemannian structures especialy regarding the normality of this types of structure examples of structures induced on a sphere of codimension 1 by some metallic riemannian structures defined on an euclidean space are given | [['the', 'aim', 'of', 'our', 'paper', 'is', 'to', 'focus', 'on', 'some', 'properties', 'of', 'submanifolds', 'in', 'riemannian', 'manifolds', 'endowed', 'with', 'endomorphisms', 'that', 'generalize', 'the', 'golden', 'riemannian', 'structure', 'named', 'metallic', 'riemannian', 'structures', 'we', 'focus', 'on', 'the', 'properties', 'of', 'the', 'structure', 'induced', 'on', 'submanifolds', 'named', 'by', 'us', 'sigmametallic', 'riemannian', 'structures', 'especialy', 'regarding', 'the', 'normality', 'of', 'this', 'types', 'of', 'structure', 'examples', 'of', 'structures', 'induced', 'on', 'a', 'sphere', 'of', 'codimension', '1', 'by', 'some', 'metallic', 'riemannian', 'structures', 'defined', 'on', 'an', 'euclidean', 'space', 'are', 'given']] | [-0.18044420428574084, 0.0704852056086141, -0.036915507614612576, 0.07610530890524388, -0.13268220220382015, -0.0742954444574813, -0.06114581127806256, 0.39917362824082375, -0.24848532284299532, -0.21127166980256637, 0.10894508329375337, -0.30260129281630116, -0.21719386669496696, 0.18994510419045885, -0.15021099619567393, -0.0008007719932356849, 0.060912224079171816, 0.0728662862504522, -0.14105978379336495, -0.25331196446282167, 0.545655907044808, 0.032229105619092785, 0.24204979555060466, 0.04685316739293436, 0.1109415734745562, -0.03178751383597652, 0.024535679072141648, 0.06732054468981612, -0.2178882108167939, 0.18423678985486427, 0.17372791821757952, 0.06246027305101355, 0.18055071416931848, -0.4248544308543205, -0.2203144126633803, 0.09789310979967315, 0.06945242369547486, -0.05885746012131373, -0.0303530615211154, -0.35766039106373987, 0.0773561371738712, -0.036616796255111696, -0.14706551832457385, -0.101599810483555, -0.04281390738983949, -0.011925565774242083, -0.13466319161700085, -0.03160496642813086, 0.16268861368608972, 0.11019793615986903, -0.10405329530437787, -0.1110389205813408, -0.027168033430352807, 0.07592235560839375, -0.007121170501535138, -0.0033594071430464584, 0.11431701232368748, -0.036223018787180386, -0.15165234964340926, 0.3747577239076296, -0.046931264859934645, -0.3263413242747386, 0.1382511585081617, -0.12956343938906986, -0.17329249352837603, 0.08600084534535805, 0.21702761298666398, 0.19933157237246632, -0.08022074149533485, 0.17556047450130186, -0.038750430941581725, 0.053951910510659215, 0.08043343774353465, 0.018905976967265207, 0.14486629692216715, 0.18873663323620954, 0.13624490538612008, 0.14687968482573827, -0.04303169901482761, -0.08179397435858846, -0.30504547044634817, -0.19928061921149492, -0.17305843114852906, 0.15946401947488387, -0.11295395886525511, -0.22844458340356746, 0.42586423192794126, -0.0013322991008559862, 0.2656370054185391, 0.06241003644963106, 0.23509855908652147, -0.07698575108467291, 0.034082260529200235, 0.08925614594792326, 0.18125984643042709, 0.2524439169528584, -0.003730162400752306, -0.1221876420887808, 0.01431729585553209, 0.13775604902456204] |
1,803.02185 | Obscured Star Formation in the Host Galaxies of Superluminous Supernovae | We present the results of 3 GHz radio continuum observations of the 8 host
galaxies of super-luminous supernovae (SLSNe) at $0.1 < z < 0.3$ by using the
Karl G. Jansky Very Large Array. Four host galaxies are detected significantly,
and two of them are found to have high star-formation rates (SFRs $>$ 20
$M_{\odot}$ yr$^{-1}$) derived from radio emission, making them the most
intensely star-forming host galaxies among SLSN host galaxies. We compare radio
SFRs and optical SFRs, and find that three host galaxies have an excess in
radio SFRs by a factor of $>$2, suggesting the existence of dust-obscured star
formation, which cannot be traced by optical studies. Two of the three host
galaxies, which are located in the galaxy main sequence based on optical SFRs,
are found to be above the main sequence based on their radio SFRs. This
suggests a higher fraction of starburst galaxies in SLSN hosts than estimated
in previous studies. We calculate extinction from the ratio between radio SFRs
and dust-uncorrected optical SFRs and find that the hosts are on the trend of
increasing extinction with metallicity, which is consistent with the relation
in local star-forming galaxies. We also place a constraint on a pulsar-driven
SN model, which predicts quasi-steady synchrotron radio emission.
| astro-ph.GA | we present the results of 3 ghz radio continuum observations of the 8 host galaxies of superluminous supernovae slsne at 01 z 03 by using the karl g jansky very large array four host galaxies are detected significantly and two of them are found to have high starformation rates sfrs 20 m_odot yr1 derived from radio emission making them the most intensely starforming host galaxies among slsn host galaxies we compare radio sfrs and optical sfrs and find that three host galaxies have an excess in radio sfrs by a factor of 2 suggesting the existence of dustobscured star formation which cannot be traced by optical studies two of the three host galaxies which are located in the galaxy main sequence based on optical sfrs are found to be above the main sequence based on their radio sfrs this suggests a higher fraction of starburst galaxies in slsn hosts than estimated in previous studies we calculate extinction from the ratio between radio sfrs and dustuncorrected optical sfrs and find that the hosts are on the trend of increasing extinction with metallicity which is consistent with the relation in local starforming galaxies we also place a constraint on a pulsardriven sn model which predicts quasisteady synchrotron radio emission | [['we', 'present', 'the', 'results', 'of', '3', 'ghz', 'radio', 'continuum', 'observations', 'of', 'the', '8', 'host', 'galaxies', 'of', 'superluminous', 'supernovae', 'slsne', 'at', '01', 'z', '03', 'by', 'using', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'four', 'host', 'galaxies', 'are', 'detected', 'significantly', 'and', 'two', 'of', 'them', 'are', 'found', 'to', 'have', 'high', 'starformation', 'rates', 'sfrs', '20', 'm_odot', 'yr1', 'derived', 'from', 'radio', 'emission', 'making', 'them', 'the', 'most', 'intensely', 'starforming', 'host', 'galaxies', 'among', 'slsn', 'host', 'galaxies', 'we', 'compare', 'radio', 'sfrs', 'and', 'optical', 'sfrs', 'and', 'find', 'that', 'three', 'host', 'galaxies', 'have', 'an', 'excess', 'in', 'radio', 'sfrs', 'by', 'a', 'factor', 'of', '2', 'suggesting', 'the', 'existence', 'of', 'dustobscured', 'star', 'formation', 'which', 'can', 'not', 'be', 'traced', 'by', 'optical', 'studies', 'two', 'of', 'the', 'three', 'host', 'galaxies', 'which', 'are', 'located', 'in', 'the', 'galaxy', 'main', 'sequence', 'based', 'on', 'optical', 'sfrs', 'are', 'found', 'to', 'be', 'above', 'the', 'main', 'sequence', 'based', 'on', 'their', 'radio', 'sfrs', 'this', 'suggests', 'a', 'higher', 'fraction', 'of', 'starburst', 'galaxies', 'in', 'slsn', 'hosts', 'than', 'estimated', 'in', 'previous', 'studies', 'we', 'calculate', 'extinction', 'from', 'the', 'ratio', 'between', 'radio', 'sfrs', 'and', 'dustuncorrected', 'optical', 'sfrs', 'and', 'find', 'that', 'the', 'hosts', 'are', 'on', 'the', 'trend', 'of', 'increasing', 'extinction', 'with', 'metallicity', 'which', 'is', 'consistent', 'with', 'the', 'relation', 'in', 'local', 'starforming', 'galaxies', 'we', 'also', 'place', 'a', 'constraint', 'on', 'a', 'pulsardriven', 'sn', 'model', 'which', 'predicts', 'quasisteady', 'synchrotron', 'radio', 'emission']] | [-0.0530962116496924, 0.09136076254470446, -0.00475920553778381, 0.12351494041593888, -0.08665069060113567, -0.08086831869038108, 0.07497968257386954, 0.5527412130479485, -0.057366799424926285, -0.3220919959041147, 0.062472371106336, -0.3062554416828789, -0.03190246447159622, 0.22085290679667827, -0.012297527276936867, -0.1052834873726869, 0.02471333870898189, -0.15656011515014912, -0.03411835329741454, -0.31891295013841814, 0.2970228074521471, 0.04411483876174316, 0.21318812422508088, -0.049077723296180084, 0.04135729888926457, -0.18882946404091155, -0.1144869032745751, -0.059012247974841066, -0.1669043992703267, 0.030658438801765442, 0.2724484956561355, 0.13630003004576652, 0.2082534583303361, -0.326883075114053, -0.2101562191875508, 0.09427348429408784, 0.2086405002113539, 0.01839570625228449, -0.09380259224305448, -0.2586324730576822, 0.1004905535664875, -0.2174354022141555, -0.11830874431941013, 0.16305390135116446, 0.02436587379242365, 0.07693428324105647, -0.18230317087503722, 0.19993504059549685, -0.05362227992848672, 0.115710119681003, -0.11777309510216583, -0.07787209143134532, -0.08826078105014928, 0.061734693039817594, -0.0032546628706488544, 0.10033440434423167, 0.2132121502609852, -0.14111929688526567, -0.029768867941479236, 0.4226378089582655, -0.04611429557700411, 0.08862601382581768, 0.27258723935833234, -0.26087647599454683, -0.22084314247387318, 0.1357900349629255, 0.1462447788210109, 0.0884899317665818, -0.18696385141244648, -0.059451671661148654, -0.00766419503690066, 0.2125010677980474, -0.003957803287238886, 0.12185382487957842, 0.3527607958374294, 0.08830955747152285, 0.03919299417332066, 0.0752612874449159, -0.21728707103829947, 0.04389003108595856, -0.1765431810546523, -0.03366225890260047, -0.1488617542115837, 0.1850932473384651, -0.16308915168862698, -0.035009872616053775, 0.33095347165530814, 0.07943763666284773, 0.2519034293677228, 0.163287698880035, 0.2881942964987292, 0.09678855471373446, 0.18159760976357994, 0.14415348766935773, 0.3530694271590059, 0.17798940591008153, 0.023971791293521304, -0.22895630311596996, 0.06855901431453486, 0.013298341420103008] |
1,803.02186 | Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs | We introduce a definition of algorithmic symmetry able to capture essential
aspects of geometric symmetry. We review, study and apply a method for
approximating the algorithmic complexity (also known as Kolmogorov-Chaitin
complexity) of graphs and networks based on the concept of Algorithmic
Probability (AP). AP is a concept (and method) capable of recursively
enumeration all properties of computable (causal) nature beyond statistical
regularities. We explore the connections of algorithmic complexity---both
theoretical and numerical---with geometric properties mainly symmetry and
topology from an (algorithmic) information-theoretic perspective. We show that
approximations to algorithmic complexity by lossless compression and an
Algorithmic Probability-based method can characterize properties of
polyominoes, polytopes, regular and quasi-regular polyhedra as well as
polyhedral networks, thereby demonstrating its profiling capabilities.
| cs.CC cs.CG cs.DM cs.IT math.IT | we introduce a definition of algorithmic symmetry able to capture essential aspects of geometric symmetry we review study and apply a method for approximating the algorithmic complexity also known as kolmogorovchaitin complexity of graphs and networks based on the concept of algorithmic probability ap ap is a concept and method capable of recursively enumeration all properties of computable causal nature beyond statistical regularities we explore the connections of algorithmic complexityboth theoretical and numericalwith geometric properties mainly symmetry and topology from an algorithmic informationtheoretic perspective we show that approximations to algorithmic complexity by lossless compression and an algorithmic probabilitybased method can characterize properties of polyominoes polytopes regular and quasiregular polyhedra as well as polyhedral networks thereby demonstrating its profiling capabilities | [['we', 'introduce', 'a', 'definition', 'of', 'algorithmic', 'symmetry', 'able', 'to', 'capture', 'essential', 'aspects', 'of', 'geometric', 'symmetry', 'we', 'review', 'study', 'and', 'apply', 'a', 'method', 'for', 'approximating', 'the', 'algorithmic', 'complexity', 'also', 'known', 'as', 'kolmogorovchaitin', 'complexity', 'of', 'graphs', 'and', 'networks', 'based', 'on', 'the', 'concept', 'of', 'algorithmic', 'probability', 'ap', 'ap', 'is', 'a', 'concept', 'and', 'method', 'capable', 'of', 'recursively', 'enumeration', 'all', 'properties', 'of', 'computable', 'causal', 'nature', 'beyond', 'statistical', 'regularities', 'we', 'explore', 'the', 'connections', 'of', 'algorithmic', 'complexityboth', 'theoretical', 'and', 'numericalwith', 'geometric', 'properties', 'mainly', 'symmetry', 'and', 'topology', 'from', 'an', 'algorithmic', 'informationtheoretic', 'perspective', 'we', 'show', 'that', 'approximations', 'to', 'algorithmic', 'complexity', 'by', 'lossless', 'compression', 'and', 'an', 'algorithmic', 'probabilitybased', 'method', 'can', 'characterize', 'properties', 'of', 'polyominoes', 'polytopes', 'regular', 'and', 'quasiregular', 'polyhedra', 'as', 'well', 'as', 'polyhedral', 'networks', 'thereby', 'demonstrating', 'its', 'profiling', 'capabilities']] | [-0.08322992014030042, 0.011025098242257666, -0.1185702576309952, 0.12549060562916067, -0.12075498676659842, -0.12081128298344775, 0.11748782281652412, 0.380149187392786, -0.3417996022945795, -0.2888475657066601, 0.09384295046050897, -0.22277403021884015, -0.2552446542849016, 0.17359197950866231, -0.15249158853553554, 0.09766550931997964, 0.008252039186568914, 0.005505505439817396, -0.08775487431309098, -0.22246314216062874, 0.2969202352807117, 0.060518859065750726, 0.3021208763253899, 0.07440635583627896, 0.11052529834624794, -0.0009819112089263578, -0.032936163923233494, 0.07670979882375552, -0.18894371737629767, 0.19959157917839596, 0.2664158742309699, 0.24790383546024114, 0.2568052100061447, -0.415047594704307, -0.19538105068540274, 0.07814638049124828, 0.1584897957370083, 0.09747295438025433, -0.05787482828500832, -0.2524758275025166, 0.0975031222935177, -0.12576022113745028, -0.1159653117463319, -0.17090144304709876, -0.016395477920324884, 0.03599079398032373, -0.19600410187123424, -0.007433925922731193, 0.14545703689770725, 0.10139490311376305, -0.016750837717022207, -0.10857273151095097, 0.032786621308177076, 0.12026548758149147, 0.009583461453091417, -0.02691190003250272, 0.09388376770314211, -0.10634326602682535, -0.22409127265788042, 0.3878301962529524, 0.05026869062318379, -0.1996130241264199, 0.1924767430780185, -0.05553706597365662, -0.20599182126008803, 0.11193761728210454, 0.20236948571908167, 0.11362455773334472, -0.1320697764197412, 0.12392747615967503, -0.024998359413992647, 0.14343909186939907, 0.07177745156053804, 0.10020665881824958, 0.13680922417925337, 0.18878822584296218, 0.09265289415852127, 0.2099812232897195, -0.009161441982922774, -0.10364721349090274, -0.248747416644588, -0.1284905151885926, -0.19470083210358602, 0.018843492053242192, -0.15158162581145815, -0.19248118569963, 0.40542189015123326, 0.1536380533192657, 0.14922345029412815, 0.15086364983202905, 0.3152100406587124, -0.002355078761625048, -0.011248146506169667, 0.08079710009937677, 0.13974962746286684, 0.181041734939855, 0.032781485233328536, -0.18343560228275502, 0.0963751399794068, 0.1609415938783214] |
1,803.02187 | Quantized spin pump on helical edge states of a topological insulator | We report a theoretical study of the quantized spin pump in a traditional
two-parameter quantum pump device that is based on the helical edge states of a
quantum spin Hall insulator. By introducing two time-dependent magnetizations
out of phase as the pumping parameters, we found that when the Fermi energy
resides in the energy gap opened by magnetization, an integer number of charges
or spins can be pumped out in a pumping cycle and ascribed to the possible
topological interface state born in between the two pumping potentials. The
quantized pump current can be fully spin-polarized, spin-unpolarized, or pure
spin current while its direction can be abruptly reversed by some system
parameters such as the pumping phase and local gate voltage. Our findings may
shed light on generation of a quantized spin pump.
| cond-mat.mes-hall | we report a theoretical study of the quantized spin pump in a traditional twoparameter quantum pump device that is based on the helical edge states of a quantum spin hall insulator by introducing two timedependent magnetizations out of phase as the pumping parameters we found that when the fermi energy resides in the energy gap opened by magnetization an integer number of charges or spins can be pumped out in a pumping cycle and ascribed to the possible topological interface state born in between the two pumping potentials the quantized pump current can be fully spinpolarized spinunpolarized or pure spin current while its direction can be abruptly reversed by some system parameters such as the pumping phase and local gate voltage our findings may shed light on generation of a quantized spin pump | [['we', 'report', 'a', 'theoretical', 'study', 'of', 'the', 'quantized', 'spin', 'pump', 'in', 'a', 'traditional', 'twoparameter', 'quantum', 'pump', 'device', 'that', 'is', 'based', 'on', 'the', 'helical', 'edge', 'states', 'of', 'a', 'quantum', 'spin', 'hall', 'insulator', 'by', 'introducing', 'two', 'timedependent', 'magnetizations', 'out', 'of', 'phase', 'as', 'the', 'pumping', 'parameters', 'we', 'found', 'that', 'when', 'the', 'fermi', 'energy', 'resides', 'in', 'the', 'energy', 'gap', 'opened', 'by', 'magnetization', 'an', 'integer', 'number', 'of', 'charges', 'or', 'spins', 'can', 'be', 'pumped', 'out', 'in', 'a', 'pumping', 'cycle', 'and', 'ascribed', 'to', 'the', 'possible', 'topological', 'interface', 'state', 'born', 'in', 'between', 'the', 'two', 'pumping', 'potentials', 'the', 'quantized', 'pump', 'current', 'can', 'be', 'fully', 'spinpolarized', 'spinunpolarized', 'or', 'pure', 'spin', 'current', 'while', 'its', 'direction', 'can', 'be', 'abruptly', 'reversed', 'by', 'some', 'system', 'parameters', 'such', 'as', 'the', 'pumping', 'phase', 'and', 'local', 'gate', 'voltage', 'our', 'findings', 'may', 'shed', 'light', 'on', 'generation', 'of', 'a', 'quantized', 'spin', 'pump']] | [-0.224116928787916, 0.2695086998708548, -0.057314612356511724, -0.015789028755179083, -0.02539895962279542, -0.1974329427654918, 0.10409152232236545, 0.38322358431392595, -0.2928959110338605, -0.28854442293986793, 0.03027907748097428, -0.2475332023393839, -0.08074995845948395, 0.22036924844439654, 0.008902622668660785, 0.029696861024214222, -0.023675039746707545, -0.032129180514344706, -0.06415419323637703, -0.17248355084680078, 0.2771367819705598, -0.018108041615652524, 0.2968828770370552, 0.06699317828857136, 0.06041521766342055, -0.013519961768551204, 0.10427034047215168, 0.026451028057170988, -0.07139313807485614, 0.018588114683463806, 0.23837263872356793, -0.08222303779697732, 0.2075831588441716, -0.5138071034999943, -0.1983752149451328, 0.02585477426760179, 0.12986813043069123, 0.1811540942565587, -0.07575940593895047, -0.3000373825066744, 0.00554836957358328, -0.1801048582909923, -0.09996162398711295, -0.08764659738014068, -0.013604332197499567, 0.00513322443589288, -0.2289101028765895, 0.07016839830667004, 0.08345094942522788, 0.030161283182022266, -0.04543620806022834, -0.09184075419570466, -0.1273194098463492, 0.062241456533967746, 0.004394912810407971, 0.06353806508740031, 0.19872799064724223, -0.1729365623927206, -0.19262582918320945, 0.30601234163710833, -0.08965822150037953, -0.16328523187772057, 0.09710673937623046, -0.1862300320220341, -0.015895882400831108, 0.11246033297165443, 0.0986443666314104, 0.09439369644689605, -0.10167163439478841, 0.023845603394574186, -0.02084249258041382, 0.19870437016444548, 0.044798270634662615, 0.0714091765064102, 0.34825358808712853, 0.1525563364971037, 0.09849168426406227, 0.1787138856164901, -0.13690854908979, -0.0915624216917545, -0.26749054182853016, -0.16548322833710372, -0.2588889635434108, 0.13367655553287805, -0.006547573834606901, -0.10152044215176563, 0.48806514294776027, 0.15781126354901553, 0.15528930275862043, -0.05887282336536879, 0.29923686103657227, 0.2056994965060131, 0.05545685970122905, 0.055649546958870234, 0.2882077636425226, 0.162848299213412, 0.09693497251474152, -0.3227149660465364, 0.03489155912967889, 0.008133405686489173] |
1,803.02188 | DenseReg: Fully Convolutional Dense Shape Regression In-the-Wild | In this work we use deep learning to establish dense correspondences between
a 3D object model and an image "in the wild". We introduce "DenseReg", a
fully-convolutional neural network (F-CNN) that densely regresses at every
foreground pixel a pair of U-V template coordinates in a single feedforward
pass. To train DenseReg we construct a supervision signal by combining 3D
deformable model fitting and 2D landmark annotations. We define the regression
task in terms of the intrinsic, U-V coordinates of a 3D deformable model that
is brought into correspondence with image instances at training time. A host of
other object-related tasks (e.g. part segmentation, landmark localization) are
shown to be by-products of this task, and to largely improve thanks to its
introduction. We obtain highly-accurate regression results by combining ideas
from semantic segmentation with regression networks, yielding a 'quantized
regression' architecture that first obtains a quantized estimate of position
through classification, and refines it through regression of the residual. We
show that such networks can boost the performance of existing state-of-the-art
systems for pose estimation. Firstly, we show that our system can serve as an
initialization for Statistical Deformable Models, as well as an element of
cascaded architectures that jointly localize landmarks and estimate dense
correspondences. We also show that the obtained dense correspondence can act as
a source of 'privileged information' that complements and extends the pure
landmark-level annotations, accelerating and improving the training of pose
estimation networks. We report state-of-the-art performance on the challenging
300W benchmark for facial landmark localization and on the MPII and LSP
datasets for human pose estimation.
| cs.CV | in this work we use deep learning to establish dense correspondences between a 3d object model and an image in the wild we introduce densereg a fullyconvolutional neural network fcnn that densely regresses at every foreground pixel a pair of uv template coordinates in a single feedforward pass to train densereg we construct a supervision signal by combining 3d deformable model fitting and 2d landmark annotations we define the regression task in terms of the intrinsic uv coordinates of a 3d deformable model that is brought into correspondence with image instances at training time a host of other objectrelated tasks eg part segmentation landmark localization are shown to be byproducts of this task and to largely improve thanks to its introduction we obtain highlyaccurate regression results by combining ideas from semantic segmentation with regression networks yielding a quantized regression architecture that first obtains a quantized estimate of position through classification and refines it through regression of the residual we show that such networks can boost the performance of existing stateoftheart systems for pose estimation firstly we show that our system can serve as an initialization for statistical deformable models as well as an element of cascaded architectures that jointly localize landmarks and estimate dense correspondences we also show that the obtained dense correspondence can act as a source of privileged information that complements and extends the pure landmarklevel annotations accelerating and improving the training of pose estimation networks we report stateoftheart performance on the challenging 300w benchmark for facial landmark localization and on the mpii and lsp datasets for human pose estimation | [['in', 'this', 'work', 'we', 'use', 'deep', 'learning', 'to', 'establish', 'dense', 'correspondences', 'between', 'a', '3d', 'object', 'model', 'and', 'an', 'image', 'in', 'the', 'wild', 'we', 'introduce', 'densereg', 'a', 'fullyconvolutional', 'neural', 'network', 'fcnn', 'that', 'densely', 'regresses', 'at', 'every', 'foreground', 'pixel', 'a', 'pair', 'of', 'uv', 'template', 'coordinates', 'in', 'a', 'single', 'feedforward', 'pass', 'to', 'train', 'densereg', 'we', 'construct', 'a', 'supervision', 'signal', 'by', 'combining', '3d', 'deformable', 'model', 'fitting', 'and', '2d', 'landmark', 'annotations', 'we', 'define', 'the', 'regression', 'task', 'in', 'terms', 'of', 'the', 'intrinsic', 'uv', 'coordinates', 'of', 'a', '3d', 'deformable', 'model', 'that', 'is', 'brought', 'into', 'correspondence', 'with', 'image', 'instances', 'at', 'training', 'time', 'a', 'host', 'of', 'other', 'objectrelated', 'tasks', 'eg', 'part', 'segmentation', 'landmark', 'localization', 'are', 'shown', 'to', 'be', 'byproducts', 'of', 'this', 'task', 'and', 'to', 'largely', 'improve', 'thanks', 'to', 'its', 'introduction', 'we', 'obtain', 'highlyaccurate', 'regression', 'results', 'by', 'combining', 'ideas', 'from', 'semantic', 'segmentation', 'with', 'regression', 'networks', 'yielding', 'a', 'quantized', 'regression', 'architecture', 'that', 'first', 'obtains', 'a', 'quantized', 'estimate', 'of', 'position', 'through', 'classification', 'and', 'refines', 'it', 'through', 'regression', 'of', 'the', 'residual', 'we', 'show', 'that', 'such', 'networks', 'can', 'boost', 'the', 'performance', 'of', 'existing', 'stateoftheart', 'systems', 'for', 'pose', 'estimation', 'firstly', 'we', 'show', 'that', 'our', 'system', 'can', 'serve', 'as', 'an', 'initialization', 'for', 'statistical', 'deformable', 'models', 'as', 'well', 'as', 'an', 'element', 'of', 'cascaded', 'architectures', 'that', 'jointly', 'localize', 'landmarks', 'and', 'estimate', 'dense', 'correspondences', 'we', 'also', 'show', 'that', 'the', 'obtained', 'dense', 'correspondence', 'can', 'act', 'as', 'a', 'source', 'of', 'privileged', 'information', 'that', 'complements', 'and', 'extends', 'the', 'pure', 'landmarklevel', 'annotations', 'accelerating', 'and', 'improving', 'the', 'training', 'of', 'pose', 'estimation', 'networks', 'we', 'report', 'stateoftheart', 'performance', 'on', 'the', 'challenging', '300w', 'benchmark', 'for', 'facial', 'landmark', 'localization', 'and', 'on', 'the', 'mpii', 'and', 'lsp', 'datasets', 'for', 'human', 'pose', 'estimation']] | [-0.026793609873409598, -0.03878093731904161, -0.05372414550332066, 0.02539790463857711, -0.068596974592835, -0.19165647835291635, 0.002597432784163035, 0.4643674951745197, -0.264260531652074, -0.3247976917666025, 0.07725983959837601, -0.26400113080699855, -0.2095449049173532, 0.18494343993415197, -0.17641335418985155, 0.08593249708893172, 0.16923437024950264, 0.03880654569410791, -0.09210450362532775, -0.25007900038214687, 0.2852643273752899, 0.022889491210830434, 0.2956412969560076, 0.005481573289188628, 0.17100112459514863, 0.004125119709015752, -0.03398454423205784, -0.003080398922947307, -0.047068540975138046, 0.19568687377569194, 0.288295089876094, 0.1692759958239129, 0.2637332397007133, -0.39816003246445547, -0.2529626386678921, 0.07507737468068416, 0.15791151384177143, 0.1121165518604707, -0.033411645655779955, -0.370178063961122, 0.0773932045352502, -0.15715076736031244, 0.01165791597808353, -0.1303753530427527, -0.028510968572943687, -0.01912340313876764, -0.3077496169063334, 0.0637326796385773, 0.07769585134989869, 0.05020016173993309, -0.07588669186684106, -0.06921479838962953, -0.007138159426932152, 0.20447829448474714, -0.007464917193059451, 0.08024959175157934, 0.1414188258383477, -0.2377947023908536, -0.13199073980571344, 0.35438972452583795, -0.07376479903720723, -0.22757353990947685, 0.20819886976924654, -0.03157231220796418, -0.16449457056945763, 0.09495898862929048, 0.2403979804044446, 0.11237848416561834, -0.13299560083362919, 0.0126984490751056, -0.0794251061437535, 0.17967550992392578, 0.05344042700307909, -0.027252935131008807, 0.2096487098516753, 0.2507672134697294, 0.0520430213785193, 0.1532139521206353, -0.20853417550231546, 0.0057827694113187205, -0.2543804580166649, -0.1307276888132597, -0.20625261508662684, -0.03286858180251259, -0.10519490297116975, -0.1679988378357778, 0.40134543479921725, 0.22811131426670517, 0.26022236221649037, 0.1263387730703331, 0.3442790612247056, 0.02203591323788994, 0.09585820394993509, 0.069152368023508, 0.2131304400659596, 0.029914380142536875, 0.061406217936354764, -0.14365591585295848, 0.028502267204189243, 0.11548395561985672] |
1,803.02189 | Possible scheme for observing acceleration (Unruh) radiation | In an FEL the electrons traveling through the undulator are surrounded in
their own reference frame by Unruh radiation at a temperature of order 8,000
Kelvin. When these virtual photons scatter from the beam electrons they become
real and can be detected. Because of the microbunching of the FEL electron beam
this process proceeds coherently for a fraction of the electrons in the
microbunch. This enhances the Unruh radiation which is still dominated by the
copious spontaneous radiation in the same energy range. We discuss the
particular case of the Stanford LCLS, as well as the case of extreme
acceleration, when the x-ray beam is brought into collision with the 14 GeV
electron beam.
| physics.gen-ph | in an fel the electrons traveling through the undulator are surrounded in their own reference frame by unruh radiation at a temperature of order 8000 kelvin when these virtual photons scatter from the beam electrons they become real and can be detected because of the microbunching of the fel electron beam this process proceeds coherently for a fraction of the electrons in the microbunch this enhances the unruh radiation which is still dominated by the copious spontaneous radiation in the same energy range we discuss the particular case of the stanford lcls as well as the case of extreme acceleration when the xray beam is brought into collision with the 14 gev electron beam | [['in', 'an', 'fel', 'the', 'electrons', 'traveling', 'through', 'the', 'undulator', 'are', 'surrounded', 'in', 'their', 'own', 'reference', 'frame', 'by', 'unruh', 'radiation', 'at', 'a', 'temperature', 'of', 'order', '8000', 'kelvin', 'when', 'these', 'virtual', 'photons', 'scatter', 'from', 'the', 'beam', 'electrons', 'they', 'become', 'real', 'and', 'can', 'be', 'detected', 'because', 'of', 'the', 'microbunching', 'of', 'the', 'fel', 'electron', 'beam', 'this', 'process', 'proceeds', 'coherently', 'for', 'a', 'fraction', 'of', 'the', 'electrons', 'in', 'the', 'microbunch', 'this', 'enhances', 'the', 'unruh', 'radiation', 'which', 'is', 'still', 'dominated', 'by', 'the', 'copious', 'spontaneous', 'radiation', 'in', 'the', 'same', 'energy', 'range', 'we', 'discuss', 'the', 'particular', 'case', 'of', 'the', 'stanford', 'lcls', 'as', 'well', 'as', 'the', 'case', 'of', 'extreme', 'acceleration', 'when', 'the', 'xray', 'beam', 'is', 'brought', 'into', 'collision', 'with', 'the', '14', 'gev', 'electron', 'beam']] | [-0.07314191560930851, 0.2614549689308644, -0.052862696310305116, 0.07985865597860092, -0.0006792356276459861, -0.09884326431181348, 0.005116611988724847, 0.41502394590510483, -0.26061016002163423, -0.31327090003903496, 0.019332444728270434, -0.32253157955251244, 0.04631096100957509, 0.25401687642902526, -0.0009349386836810593, 0.020467070702324508, 0.04232916260023781, 0.0015142958431521006, 0.007594774336260008, -0.18145697644356182, 0.3022872091989899, 0.1969718770369103, 0.2770628835556604, 0.08704873084564481, 0.1250640056667882, 0.03393300293266708, 0.02131204068530024, -0.04895405069998417, -0.0323822278133185, 0.0179465387017556, 0.22351896530834206, 0.07433300721867565, 0.259475178142454, -0.43408178616511195, -0.2179389794177392, 0.06210696903923363, 0.16718055202070167, 0.11695108353875153, -0.08502624152849118, -0.26872222081006486, 0.0011844268771247905, -0.17843211409962623, -0.14373938753187918, 0.051433317714550515, -0.04015395392892523, 0.04392161767259894, -0.21292248737524477, 0.04064721626376635, 0.052037605955551396, 0.004236830733389708, -0.055037820499325006, -0.03773746146052553, -0.022806498238392044, 0.04041481771140784, 0.1047609091055755, 0.06769249986514057, 0.1998522173155818, -0.14509665908438987, -0.06944447596508421, 0.4329836793047817, -0.024651797720141252, -0.08452134146436788, 0.15614497195520813, -0.24771315825024717, -0.002312377272909017, 0.22663748198752537, 0.14654606852063648, 0.10634160422916084, -0.12191056076711934, 0.025667624474041525, -0.0085996645747831, 0.15688929474185498, 0.16439362564287557, 0.04280687643933976, 0.26886559481601835, 0.14802971458483258, 0.006136804802768063, 0.18207265384262428, -0.14414976186347767, -0.012544962328352165, -0.3061349544053276, -0.12675601706774742, -0.16858694243975997, 0.06905758365980562, -0.036719891407987586, -0.09552500894080782, 0.40796077403795433, 0.10948059822661443, 0.15043172819270312, -0.061700042172768074, 0.3627996780958615, 0.1464023895555568, 0.026687679896049463, 0.09076482632703949, 0.3216668506348996, 0.08337531913186244, 0.14233452326254592, -0.25902002126493145, -0.004916507423778265, -0.026345491025335434] |
1,803.0219 | Impact of the electron to ion mass ratio on unstable systems in
particle-in-cell simulations | The evolution of the Buneman and two-stream instabilities driven by a cold
dilute mildly relativistic electron beam is studied as a function of the
ion\'\s charge-to-mass ratio. The growth rates of both instabilities are
comparable for the selected parameters if the charge-to-mass ratio of protons
is used and the Buneman instability outgrows the two-stream instability for a
larger ratio. Particle-in-cell (PIC) simulations show that both instabilities
grow independently during their linear growth phase. The much lower saturation
amplitude of the Buneman instability implies that it saturates first even if
the linear growth rates of both instabilities are equal. The electron phase
space holes it drives coalesce. Their spatial size increases in time and they
start interacting with the two-stream mode, which triggers the onset of
electrostatic turbulence. A reduced charge-to-mass ratio results in stronger
turbulence and ion heating and in an increased energy loss of the relativistic
electron beam compared to that in a simulation with the correct ratio.
| physics.plasm-ph | the evolution of the buneman and twostream instabilities driven by a cold dilute mildly relativistic electron beam is studied as a function of the ions chargetomass ratio the growth rates of both instabilities are comparable for the selected parameters if the chargetomass ratio of protons is used and the buneman instability outgrows the twostream instability for a larger ratio particleincell pic simulations show that both instabilities grow independently during their linear growth phase the much lower saturation amplitude of the buneman instability implies that it saturates first even if the linear growth rates of both instabilities are equal the electron phase space holes it drives coalesce their spatial size increases in time and they start interacting with the twostream mode which triggers the onset of electrostatic turbulence a reduced chargetomass ratio results in stronger turbulence and ion heating and in an increased energy loss of the relativistic electron beam compared to that in a simulation with the correct ratio | [['the', 'evolution', 'of', 'the', 'buneman', 'and', 'twostream', 'instabilities', 'driven', 'by', 'a', 'cold', 'dilute', 'mildly', 'relativistic', 'electron', 'beam', 'is', 'studied', 'as', 'a', 'function', 'of', 'the', 'ions', 'chargetomass', 'ratio', 'the', 'growth', 'rates', 'of', 'both', 'instabilities', 'are', 'comparable', 'for', 'the', 'selected', 'parameters', 'if', 'the', 'chargetomass', 'ratio', 'of', 'protons', 'is', 'used', 'and', 'the', 'buneman', 'instability', 'outgrows', 'the', 'twostream', 'instability', 'for', 'a', 'larger', 'ratio', 'particleincell', 'pic', 'simulations', 'show', 'that', 'both', 'instabilities', 'grow', 'independently', 'during', 'their', 'linear', 'growth', 'phase', 'the', 'much', 'lower', 'saturation', 'amplitude', 'of', 'the', 'buneman', 'instability', 'implies', 'that', 'it', 'saturates', 'first', 'even', 'if', 'the', 'linear', 'growth', 'rates', 'of', 'both', 'instabilities', 'are', 'equal', 'the', 'electron', 'phase', 'space', 'holes', 'it', 'drives', 'coalesce', 'their', 'spatial', 'size', 'increases', 'in', 'time', 'and', 'they', 'start', 'interacting', 'with', 'the', 'twostream', 'mode', 'which', 'triggers', 'the', 'onset', 'of', 'electrostatic', 'turbulence', 'a', 'reduced', 'chargetomass', 'ratio', 'results', 'in', 'stronger', 'turbulence', 'and', 'ion', 'heating', 'and', 'in', 'an', 'increased', 'energy', 'loss', 'of', 'the', 'relativistic', 'electron', 'beam', 'compared', 'to', 'that', 'in', 'a', 'simulation', 'with', 'the', 'correct', 'ratio']] | [-0.15778527209101795, 0.2729588164106845, -0.029651813094838046, 0.1134886979755108, 0.02942873904212091, -0.12651226245183148, -0.04490393066321904, 0.2957971851669439, -0.2551266136198486, -0.26179337033741296, 0.0553706402292932, -0.2633667707259462, -0.04946656734389751, 0.19369516039044601, 0.05621836375468557, 0.031169312176186265, 0.05648505500131199, -0.05031712498785284, -0.05244952282185941, -0.20128280344366464, 0.2809658908334988, 0.20771688143810574, 0.31333012101035446, 0.0251471260591826, 0.06090296808126494, -0.05966834951069136, 0.048245734286219255, 0.03000161885529165, -0.16565478406182993, -0.01284929827066525, 0.1518908414313183, 0.06214184278209325, 0.2924570627276253, -0.4865019902024629, -0.23416221708882273, 0.028520180931631126, 0.19947830656742524, 0.1189711422933289, -0.0987087529741664, -0.16217038331922354, 0.04470792063658342, -0.18901152597775436, -0.12813157872619024, 0.03733914520491922, 0.03580811388978043, 0.0760528867615463, -0.3227576435889182, 0.13816478233140125, 0.0920431218315033, -0.0037038636059974726, -0.09068277188845465, -0.06828221894285214, -0.09613279933871338, 0.02279247011500264, 0.09551445111257476, 0.06370296139407715, 0.17974898806310394, -0.1820627536812106, -0.04088978175331587, 0.3770047187711458, -0.06625974694934655, -0.17084652509938622, 0.23630693406686656, -0.22113511359330806, -0.019049933339277306, 0.23729111523654475, 0.19227780452665855, 0.10254729860725831, -0.03703291302088519, -0.010242298926715885, 0.01176610939005542, 0.18644473601968498, 0.12650737483288693, 0.02209609773876907, 0.21319788710782364, 0.1781471927837709, 0.013929454065015856, 0.12518491656323616, -0.10338858925772584, -0.06313214913367897, -0.23684767247821972, -0.10198419211936072, -0.13129310242508818, 0.0035001040061455476, -0.09722032760218322, -0.1380569779331673, 0.3510738994674347, 0.13159501712488117, 0.18017827305168868, -0.00403678195577396, 0.3124037138344956, 0.16973535086792665, 0.049351054873411196, 0.12091614972542292, 0.3407232336020507, 0.15662287009598794, 0.11761932357349111, -0.32380335290517964, 0.07033345255409162, 0.06348060625868868] |
1,803.02191 | Magnetically charged black hole in framework of nonlinear
electrodynamics model | A model of nonlinear electrodynamics is proposed and investigated in general
relativity. We consider the magnetic black hole and find a regular solution
which gives corrections into the Reissner-Nordstr\"{o}m solution. At
$r\rightarrow\infty$ the asymptotic spacetime becomes flat. The magnetic mass
of the black hole is calculated and the metric function is obtained. At some
values of the model parameter there can be one, two or no horizons.
Thermodynamics of black holes is studied and we calculate the Hawking
temperature and heat capacity of black holes. It is demonstrated that there is
a phase transition of second order. At some parameters of the model black holes
are thermodynamically stable.
| physics.gen-ph | a model of nonlinear electrodynamics is proposed and investigated in general relativity we consider the magnetic black hole and find a regular solution which gives corrections into the reissnernordstrom solution at rrightarrowinfty the asymptotic spacetime becomes flat the magnetic mass of the black hole is calculated and the metric function is obtained at some values of the model parameter there can be one two or no horizons thermodynamics of black holes is studied and we calculate the hawking temperature and heat capacity of black holes it is demonstrated that there is a phase transition of second order at some parameters of the model black holes are thermodynamically stable | [['a', 'model', 'of', 'nonlinear', 'electrodynamics', 'is', 'proposed', 'and', 'investigated', 'in', 'general', 'relativity', 'we', 'consider', 'the', 'magnetic', 'black', 'hole', 'and', 'find', 'a', 'regular', 'solution', 'which', 'gives', 'corrections', 'into', 'the', 'reissnernordstrom', 'solution', 'at', 'rrightarrowinfty', 'the', 'asymptotic', 'spacetime', 'becomes', 'flat', 'the', 'magnetic', 'mass', 'of', 'the', 'black', 'hole', 'is', 'calculated', 'and', 'the', 'metric', 'function', 'is', 'obtained', 'at', 'some', 'values', 'of', 'the', 'model', 'parameter', 'there', 'can', 'be', 'one', 'two', 'or', 'no', 'horizons', 'thermodynamics', 'of', 'black', 'holes', 'is', 'studied', 'and', 'we', 'calculate', 'the', 'hawking', 'temperature', 'and', 'heat', 'capacity', 'of', 'black', 'holes', 'it', 'is', 'demonstrated', 'that', 'there', 'is', 'a', 'phase', 'transition', 'of', 'second', 'order', 'at', 'some', 'parameters', 'of', 'the', 'model', 'black', 'holes', 'are', 'thermodynamically', 'stable']] | [-0.17162697193971663, 0.1153399682823672, -0.0584408850107273, 0.14136359137827875, -0.035364679224720155, -0.17471632788699396, 0.003614116981798024, 0.3096596543823748, -0.15814371804568778, -0.2694947571629503, 0.09676979999467558, -0.3652932718396187, -0.09439769592049911, 0.19505713410951472, -0.01624343075134136, 0.030292314493568416, -0.04269537304234863, 0.09188539653809534, -0.1041389992482167, -0.20119466387054505, 0.373732391731917, 0.07806772268937763, 0.2345535805431643, 0.02949875342245731, 0.12208340348054965, -0.060377231868052925, 0.06203899685621123, 0.10064296614102743, -0.18880512269842492, 0.0073818285104439215, 0.19666135363729187, 0.09642137620701557, 0.21080074588664705, -0.37460639189790795, -0.24724570159041495, 0.0725778846384923, 0.08575359562894812, 0.17103219129192573, -0.12633110760900848, -0.2207770828606078, 0.089349795393732, -0.19685112646160027, -0.15141484578554001, -0.05517460908568292, 0.050177706914298514, -0.0804492706708886, -0.2550980185451745, 0.11916957223891383, 0.08318740817614728, -0.10630052309069368, -0.14478746053107358, -0.04582074363241662, -0.08078271193921359, 0.08664043535504283, 0.13853430945891887, 0.01965996776966171, 0.15516353270073455, -0.07797832691748799, -0.07869964288720102, 0.37176479219838426, -0.02072452431807674, -0.1860274591103748, 0.13170583613208253, -0.2720792713031794, -0.06568815446937354, 0.11956412509769304, 0.1158785130613035, 0.2204235028303056, -0.1578502985217643, 0.15800054651346593, 0.02159021737019497, 0.17943266639270372, 0.10517015515533448, 0.03949696540183612, 0.364226931249033, 0.15344283623724347, 0.004445882289911862, 0.18185533542526644, -0.04654654028773722, -0.11471410324210646, -0.29270369226664855, -0.16400587080796766, -0.17041459614066062, 0.07455507157956837, -0.19250286445040493, -0.20551267633628514, 0.33190532746138396, 0.1016978604796653, 0.1668907378722603, 0.014787652660204374, 0.24925564531410296, 0.1618138343759778, 0.011283572569179038, 0.13415216518290066, 0.35446129167825413, 0.13405866659444723, 0.13669516682124663, -0.2203592169209043, -0.025666738015220122, 0.11328950513119775] |
1,803.02192 | Lunar Crater Identification via Deep Learning | Crater counting on the Moon and other bodies is crucial to constrain the
dynamical history of the Solar System. This has traditionally been done by
visual inspection of images, thus limiting the scope, efficiency, and/or
accuracy of retrieval. In this paper we demonstrate the viability of using
convolutional neural networks (CNNs) to determine the positions and sizes of
craters from Lunar digital elevation maps (DEMs). We recover 92% of craters
from the human-generated test set and almost double the total number of crater
detections. Of these new craters, 15% are smaller in diameter than the minimum
crater size in the ground-truth dataset. Our median fractional longitude,
latitude and radius errors are 11% or less, representing good agreement with
the human-generated datasets. From a manual inspection of 361 new craters we
estimate the false positive rate of new craters to be 11%. Moreover, our
Moon-trained CNN performs well when tested on DEM images of Mercury, detecting
a large fraction of craters in each map. Our results suggest that deep learning
will be a useful tool for rapidly and automatically extracting craters on
various Solar System bodies. We make our code and data publicly available at
https://github.com/silburt/DeepMoon.git and
https://doi.org/10.5281/zenodo.1133969 .
| astro-ph.EP | crater counting on the moon and other bodies is crucial to constrain the dynamical history of the solar system this has traditionally been done by visual inspection of images thus limiting the scope efficiency andor accuracy of retrieval in this paper we demonstrate the viability of using convolutional neural networks cnns to determine the positions and sizes of craters from lunar digital elevation maps dems we recover 92 of craters from the humangenerated test set and almost double the total number of crater detections of these new craters 15 are smaller in diameter than the minimum crater size in the groundtruth dataset our median fractional longitude latitude and radius errors are 11 or less representing good agreement with the humangenerated datasets from a manual inspection of 361 new craters we estimate the false positive rate of new craters to be 11 moreover our moontrained cnn performs well when tested on dem images of mercury detecting a large fraction of craters in each map our results suggest that deep learning will be a useful tool for rapidly and automatically extracting craters on various solar system bodies we make our code and data publicly available at httpsgithubcomsilburtdeepmoongit and httpsdoiorg105281zenodo1133969 | [['crater', 'counting', 'on', 'the', 'moon', 'and', 'other', 'bodies', 'is', 'crucial', 'to', 'constrain', 'the', 'dynamical', 'history', 'of', 'the', 'solar', 'system', 'this', 'has', 'traditionally', 'been', 'done', 'by', 'visual', 'inspection', 'of', 'images', 'thus', 'limiting', 'the', 'scope', 'efficiency', 'andor', 'accuracy', 'of', 'retrieval', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'viability', 'of', 'using', 'convolutional', 'neural', 'networks', 'cnns', 'to', 'determine', 'the', 'positions', 'and', 'sizes', 'of', 'craters', 'from', 'lunar', 'digital', 'elevation', 'maps', 'dems', 'we', 'recover', '92', 'of', 'craters', 'from', 'the', 'humangenerated', 'test', 'set', 'and', 'almost', 'double', 'the', 'total', 'number', 'of', 'crater', 'detections', 'of', 'these', 'new', 'craters', '15', 'are', 'smaller', 'in', 'diameter', 'than', 'the', 'minimum', 'crater', 'size', 'in', 'the', 'groundtruth', 'dataset', 'our', 'median', 'fractional', 'longitude', 'latitude', 'and', 'radius', 'errors', 'are', '11', 'or', 'less', 'representing', 'good', 'agreement', 'with', 'the', 'humangenerated', 'datasets', 'from', 'a', 'manual', 'inspection', 'of', '361', 'new', 'craters', 'we', 'estimate', 'the', 'false', 'positive', 'rate', 'of', 'new', 'craters', 'to', 'be', '11', 'moreover', 'our', 'moontrained', 'cnn', 'performs', 'well', 'when', 'tested', 'on', 'dem', 'images', 'of', 'mercury', 'detecting', 'a', 'large', 'fraction', 'of', 'craters', 'in', 'each', 'map', 'our', 'results', 'suggest', 'that', 'deep', 'learning', 'will', 'be', 'a', 'useful', 'tool', 'for', 'rapidly', 'and', 'automatically', 'extracting', 'craters', 'on', 'various', 'solar', 'system', 'bodies', 'we', 'make', 'our', 'code', 'and', 'data', 'publicly', 'available', 'at', 'httpsgithubcomsilburtdeepmoongit', 'and', 'httpsdoiorg105281zenodo1133969']] | [-0.041470091230687255, 0.06765421929519586, -0.06986747864278552, 0.08433929181564119, -0.06150378865734722, -0.0718854554243549, 0.04441964322732301, 0.37100664682604717, -0.1978171488951853, -0.39106298864041406, 0.11124226362108416, -0.3131220994790843, -0.13766360028254435, 0.25546323789221226, -0.15388297066140497, 0.07494339163021482, 0.1493140147679687, 0.0034416729617940704, -0.0231353597122619, -0.29617010135402827, 0.2705715802202923, 0.09447626401679278, 0.2194475454815961, 0.014409907314609545, 0.09147360662095753, -0.07263790806887441, -0.06970244204294243, -0.006801866023734058, -0.14827656156771857, 0.13930422337317705, 0.22329642624022997, 0.19140891594087378, 0.21964907545845994, -0.3974231525309883, -0.19209814205532894, 0.06722150126606533, 0.12114053163989495, 0.06897358844585096, -0.030511580378215608, -0.32900784569960473, 0.10725553682540212, -0.16900524137344825, -0.09335540443690032, -0.025806568330153823, 0.06379682488004994, 0.035686867489220245, -0.23264148504714502, 0.07011409571451932, 0.0009181697634780856, 0.14586069836094015, -0.07142698694471769, -0.185305484298127, -0.03254387620656473, 0.1805069512447892, 0.025714513182054397, 0.04112977888519136, 0.17439729601298412, -0.12733610450366953, -0.04789381715128217, 0.37152449087691064, -0.04724665949237833, -0.1202489870742021, 0.1992222896858704, -0.1790789541255529, -0.10433504348092702, 0.1707583551040668, 0.23528740873659923, 0.10022974164842043, -0.15573121838131498, -0.024565408949334577, -0.057901840467970894, 0.22073353248523528, 0.12210477837937471, -0.009100838099012557, 0.24766393636890985, 0.2080582352919197, 0.04007281278519286, 0.12530681040148808, -0.25154597372339904, -0.017728931056311566, -0.21576849892963512, -0.12649029678156234, -0.1897772809312938, 0.0017766715951513538, -0.15628232254075744, -0.1419795637729172, 0.3720549324517782, 0.2048707014938682, 0.19770179238871277, 0.10782580554530927, 0.3129917568498358, -0.026065905339528024, 0.1385113980342663, 0.08563084503126897, 0.2348221849911779, 0.02641779428573575, 0.09549252917094771, -0.15364840605473817, 0.09677476981251511, 0.027600903926926098] |
1,803.02193 | Klein vs Mehrtens: restoring the reputation of a great modern | Historian Herbert Mehrtens sought to portray the history of
turn-of-the-century mathematics as a struggle of modern vs countermodern, led
respectively by David Hilbert and Felix Klein. Some of Mehrtens' conclusions
have been picked up by both historians (Jeremy Gray) and mathematicians (Frank
Quinn).
We argue that Klein and Hilbert, both at Goettingen, were not adversaries but
rather modernist allies in a bid to broaden the scope of mathematics beyond a
narrow focus on arithmetized analysis as practiced by the Berlin school.
Klein's Goettingen lecture and other texts shed light on Klein's modernism.
Hilbert's views on intuition are closer to Klein's views than Mehrtens is
willing to allow. Klein and Hilbert were equally interested in the
axiomatisation of physics. Among Klein's credits is helping launch the career
of Abraham Fraenkel, and advancing the careers of Sophus Lie, Emmy Noether, and
Ernst Zermelo, all four surely of impeccable modernist credentials.
Mehrtens' unsourced claim that Hilbert was interested in production rather
than meaning appears to stem from Mehrtens' marxist leanings. Mehrtens' claim
that [the future SS-Brigadefuehrer] "Theodor Vahlen ... cited Klein's racist
distinctions within mathematics, and sharpened them into open antisemitism"
fabricates a spurious continuity between the two figures mentioned and is thus
an odious misrepresentation of Klein's position.
Keywords: arithmetized analysis; axiomatisation of geometry; axiomatisation
of physics; formalism; intuition; mathematical realism; modernism; Felix Klein;
David Hilbert; Karl Weierstrass
| math.HO | historian herbert mehrtens sought to portray the history of turnofthecentury mathematics as a struggle of modern vs countermodern led respectively by david hilbert and felix klein some of mehrtens conclusions have been picked up by both historians jeremy gray and mathematicians frank quinn we argue that klein and hilbert both at goettingen were not adversaries but rather modernist allies in a bid to broaden the scope of mathematics beyond a narrow focus on arithmetized analysis as practiced by the berlin school kleins goettingen lecture and other texts shed light on kleins modernism hilberts views on intuition are closer to kleins views than mehrtens is willing to allow klein and hilbert were equally interested in the axiomatisation of physics among kleins credits is helping launch the career of abraham fraenkel and advancing the careers of sophus lie emmy noether and ernst zermelo all four surely of impeccable modernist credentials mehrtens unsourced claim that hilbert was interested in production rather than meaning appears to stem from mehrtens marxist leanings mehrtens claim that the future ssbrigadefuehrer theodor vahlen cited kleins racist distinctions within mathematics and sharpened them into open antisemitism fabricates a spurious continuity between the two figures mentioned and is thus an odious misrepresentation of kleins position keywords arithmetized analysis axiomatisation of geometry axiomatisation of physics formalism intuition mathematical realism modernism felix klein david hilbert karl weierstrass | [['historian', 'herbert', 'mehrtens', 'sought', 'to', 'portray', 'the', 'history', 'of', 'turnofthecentury', 'mathematics', 'as', 'a', 'struggle', 'of', 'modern', 'vs', 'countermodern', 'led', 'respectively', 'by', 'david', 'hilbert', 'and', 'felix', 'klein', 'some', 'of', 'mehrtens', 'conclusions', 'have', 'been', 'picked', 'up', 'by', 'both', 'historians', 'jeremy', 'gray', 'and', 'mathematicians', 'frank', 'quinn', 'we', 'argue', 'that', 'klein', 'and', 'hilbert', 'both', 'at', 'goettingen', 'were', 'not', 'adversaries', 'but', 'rather', 'modernist', 'allies', 'in', 'a', 'bid', 'to', 'broaden', 'the', 'scope', 'of', 'mathematics', 'beyond', 'a', 'narrow', 'focus', 'on', 'arithmetized', 'analysis', 'as', 'practiced', 'by', 'the', 'berlin', 'school', 'kleins', 'goettingen', 'lecture', 'and', 'other', 'texts', 'shed', 'light', 'on', 'kleins', 'modernism', 'hilberts', 'views', 'on', 'intuition', 'are', 'closer', 'to', 'kleins', 'views', 'than', 'mehrtens', 'is', 'willing', 'to', 'allow', 'klein', 'and', 'hilbert', 'were', 'equally', 'interested', 'in', 'the', 'axiomatisation', 'of', 'physics', 'among', 'kleins', 'credits', 'is', 'helping', 'launch', 'the', 'career', 'of', 'abraham', 'fraenkel', 'and', 'advancing', 'the', 'careers', 'of', 'sophus', 'lie', 'emmy', 'noether', 'and', 'ernst', 'zermelo', 'all', 'four', 'surely', 'of', 'impeccable', 'modernist', 'credentials', 'mehrtens', 'unsourced', 'claim', 'that', 'hilbert', 'was', 'interested', 'in', 'production', 'rather', 'than', 'meaning', 'appears', 'to', 'stem', 'from', 'mehrtens', 'marxist', 'leanings', 'mehrtens', 'claim', 'that', 'the', 'future', 'ssbrigadefuehrer', 'theodor', 'vahlen', 'cited', 'kleins', 'racist', 'distinctions', 'within', 'mathematics', 'and', 'sharpened', 'them', 'into', 'open', 'antisemitism', 'fabricates', 'a', 'spurious', 'continuity', 'between', 'the', 'two', 'figures', 'mentioned', 'and', 'is', 'thus', 'an', 'odious', 'misrepresentation', 'of', 'kleins', 'position', 'keywords', 'arithmetized', 'analysis', 'axiomatisation', 'of', 'geometry', 'axiomatisation', 'of', 'physics', 'formalism', 'intuition', 'mathematical', 'realism', 'modernism', 'felix', 'klein', 'david', 'hilbert', 'karl', 'weierstrass']] | [-0.06167911798233987, 0.0725047793074478, -0.13822325351413067, 0.1408721671750504, -0.20457510526052788, -0.18127442187621096, 0.05103815444894648, 0.279549172447157, -0.20719050195862734, -0.32128048090289835, 0.084564235373806, -0.331904021644999, -0.14498669563975813, 0.2020046885649742, -0.20184175251585798, -0.03244361532859397, 0.0022511123081481238, -0.0043025053364711754, -0.01852380364509556, -0.344349253926973, 0.2794317857697691, 0.06841711100844246, 0.2596210427026888, 0.05865231133226322, 0.06138456478553937, 0.05535352320480801, -0.095532212726539, -0.04195137858153705, -0.09779305923756168, 0.11534262530800968, 0.32867541135109346, 0.18371744170131316, 0.3461781337754716, -0.4121879899293321, -0.11157341807367228, 0.02682864157816207, 0.08789905341162663, 0.04070410722708586, 0.009379374848597537, -0.3616753562119653, -0.02998708427265295, -0.13643998917781774, -0.12514061509597396, -0.0453208451618685, 0.07039936669085414, -0.04392903751999123, -0.0661758980163749, 0.02518867644099006, 0.09722480938317032, 0.14631047741367925, -0.0146034525599493, -0.1454311407175462, -0.03278734766474472, 0.08018041112878864, 0.020233145742751913, 0.048011749081416144, 0.08588780798744239, -0.10304278678312243, -0.1827557155875267, 0.39573628172585995, 0.033462177476110876, -0.12315879053748084, 0.14017169809432428, -0.15526465059112793, -0.09916030317801264, 0.043795928164116114, 0.09015961608971221, 0.05918579100665355, -0.1187892482325503, 0.12373713587828349, -0.07666631581885484, 0.08496845063300582, 0.20992304512338048, -0.03729737167238095, 0.19249718198381843, 0.06012927357335959, -0.04335986506813334, 0.02337400728052721, 0.029961687464500914, -0.1216228199453059, -0.27320896538717826, -0.20192976447596675, -0.13283237418717356, 0.09215867137671245, 0.02289896821043798, -0.11596051433738834, 0.35440660146900255, 0.14394117872457132, 0.08238424269755909, 0.01629686460044201, 0.20071108806707444, -0.008135443357344922, 0.03188813167278134, 0.07616182902524539, 0.20855710625505916, 0.1165281503451689, 0.15902272071219434, -0.09586760807043335, 0.04858734974970853, 0.1316345398236331] |
1,803.02194 | Bidding Machine: Learning to Bid for Directly Optimizing Profits in
Display Advertising | Real-time bidding (RTB) based display advertising has become one of the key
technological advances in computational advertising. RTB enables advertisers to
buy individual ad impressions via an auction in real-time and facilitates the
evaluation and the bidding of individual impressions across multiple
advertisers. In RTB, the advertisers face three main challenges when optimizing
their bidding strategies, namely (i) estimating the utility (e.g., conversions,
clicks) of the ad impression, (ii) forecasting the market value (thus the cost)
of the given ad impression, and (iii) deciding the optimal bid for the given
auction based on the first two. Previous solutions assume the first two are
solved before addressing the bid optimization problem. However, these
challenges are strongly correlated and dealing with any individual problem
independently may not be globally optimal. In this paper, we propose Bidding
Machine, a comprehensive learning to bid framework, which consists of three
optimizers dealing with each challenge above, and as a whole, jointly optimizes
these three parts. We show that such a joint optimization would largely
increase the campaign effectiveness and the profit. From the learning
perspective, we show that the bidding machine can be updated smoothly with both
offline periodical batch or online sequential training schemes. Our extensive
offline empirical study and online A/B testing verify the high effectiveness of
the proposed bidding machine.
| cs.GT cs.CY cs.IR cs.LG | realtime bidding rtb based display advertising has become one of the key technological advances in computational advertising rtb enables advertisers to buy individual ad impressions via an auction in realtime and facilitates the evaluation and the bidding of individual impressions across multiple advertisers in rtb the advertisers face three main challenges when optimizing their bidding strategies namely i estimating the utility eg conversions clicks of the ad impression ii forecasting the market value thus the cost of the given ad impression and iii deciding the optimal bid for the given auction based on the first two previous solutions assume the first two are solved before addressing the bid optimization problem however these challenges are strongly correlated and dealing with any individual problem independently may not be globally optimal in this paper we propose bidding machine a comprehensive learning to bid framework which consists of three optimizers dealing with each challenge above and as a whole jointly optimizes these three parts we show that such a joint optimization would largely increase the campaign effectiveness and the profit from the learning perspective we show that the bidding machine can be updated smoothly with both offline periodical batch or online sequential training schemes our extensive offline empirical study and online ab testing verify the high effectiveness of the proposed bidding machine | [['realtime', 'bidding', 'rtb', 'based', 'display', 'advertising', 'has', 'become', 'one', 'of', 'the', 'key', 'technological', 'advances', 'in', 'computational', 'advertising', 'rtb', 'enables', 'advertisers', 'to', 'buy', 'individual', 'ad', 'impressions', 'via', 'an', 'auction', 'in', 'realtime', 'and', 'facilitates', 'the', 'evaluation', 'and', 'the', 'bidding', 'of', 'individual', 'impressions', 'across', 'multiple', 'advertisers', 'in', 'rtb', 'the', 'advertisers', 'face', 'three', 'main', 'challenges', 'when', 'optimizing', 'their', 'bidding', 'strategies', 'namely', 'i', 'estimating', 'the', 'utility', 'eg', 'conversions', 'clicks', 'of', 'the', 'ad', 'impression', 'ii', 'forecasting', 'the', 'market', 'value', 'thus', 'the', 'cost', 'of', 'the', 'given', 'ad', 'impression', 'and', 'iii', 'deciding', 'the', 'optimal', 'bid', 'for', 'the', 'given', 'auction', 'based', 'on', 'the', 'first', 'two', 'previous', 'solutions', 'assume', 'the', 'first', 'two', 'are', 'solved', 'before', 'addressing', 'the', 'bid', 'optimization', 'problem', 'however', 'these', 'challenges', 'are', 'strongly', 'correlated', 'and', 'dealing', 'with', 'any', 'individual', 'problem', 'independently', 'may', 'not', 'be', 'globally', 'optimal', 'in', 'this', 'paper', 'we', 'propose', 'bidding', 'machine', 'a', 'comprehensive', 'learning', 'to', 'bid', 'framework', 'which', 'consists', 'of', 'three', 'optimizers', 'dealing', 'with', 'each', 'challenge', 'above', 'and', 'as', 'a', 'whole', 'jointly', 'optimizes', 'these', 'three', 'parts', 'we', 'show', 'that', 'such', 'a', 'joint', 'optimization', 'would', 'largely', 'increase', 'the', 'campaign', 'effectiveness', 'and', 'the', 'profit', 'from', 'the', 'learning', 'perspective', 'we', 'show', 'that', 'the', 'bidding', 'machine', 'can', 'be', 'updated', 'smoothly', 'with', 'both', 'offline', 'periodical', 'batch', 'or', 'online', 'sequential', 'training', 'schemes', 'our', 'extensive', 'offline', 'empirical', 'study', 'and', 'online', 'ab', 'testing', 'verify', 'the', 'high', 'effectiveness', 'of', 'the', 'proposed', 'bidding', 'machine']] | [-0.08998897587004707, 0.004132311172858671, -0.03865932959127624, 0.06346479161170422, -0.15411342160750624, -0.2082184071614142, 0.1382064175073254, 0.4630586310469229, -0.2838037199505771, -0.3300534551792325, 0.13805023362163726, -0.3037229615134543, -0.15921322113531, 0.16311655829365818, -0.13004844678506317, 0.07518584420050092, 0.0784045534631357, 0.034980779534543295, -0.00014712079134427967, -0.3383036292582075, 0.2863022676447979, 0.02886652088736893, 0.3427127343388872, 0.02924279017809676, 0.07863709903824134, 0.042255222486062914, -0.05719293072529205, -0.017587617052496847, -0.0874635454937052, 0.15642826487801526, 0.34323244699097555, 0.23061228330127484, 0.4253693332536778, -0.4226403557342998, -0.1295014337546816, 0.13599592294445723, 0.13268652086811292, 0.014121419848946838, -0.07467091181678612, -0.24939896665094846, 0.04680071091877484, -0.1952574664573057, 0.029188820353170875, -0.09201986198804828, -0.051701591883085395, 0.03189526516634441, -0.33405365173143137, -0.050957207372540246, 0.0017008374267847304, 0.018879270304951373, -0.12204080948994897, -0.11686988967821138, 0.013184871576905866, 0.18888976284179412, 0.10195759191698985, -0.03662246246629933, 0.17075207194210876, -0.16482878036245943, -0.22419688519872213, 0.40800837347916236, -0.0005090691623440303, -0.1337587995136396, 0.13546526158621552, -0.0410144028836998, -0.14613135557604628, 0.11628054731756175, 0.21377635272134335, 0.1268001889773653, -0.18030517454262568, 0.026010982727753682, -0.04150829172838445, 0.16333122619795143, 0.033903921885979835, -0.01565722393196657, 0.19314992131554273, 0.20947360567248707, 0.10176690752455674, 0.10531714677900383, -0.016307076472370383, -0.14135256828633436, -0.21598369082454122, -0.13749388863926396, -0.15829985544572525, 0.011890683616653039, -0.11963846972977173, -0.1413788000771075, 0.40252459279919434, 0.18009409123076844, 0.1449934545212314, 0.0855738743812587, 0.3609776634791302, 0.08563941093538183, 0.0023367338452847043, 0.1334619157212795, 0.2243448398324315, -0.14582091478904316, 0.18707367110732567, -0.20612478901102388, 0.1442394864258416, 0.020378555941241664] |
1,803.02195 | Thermodynamic approach to holographic dark energy and the R\'{e}nyi
entropy | Using the first law of thermodynamics, we propose a relation between the
system entropy ($S$) and its IR ($L$) and UV ($\Lambda$) cutoffs. In addition,
applying this relation to the apparent horizon of flat FRW universe, whose
entropy meets the R\'{e}nyi entropy, a new holographic dark energy model is
addressed. Thereinafter, the evolution of the flat FRW universe, filled by a
pressureless source and the obtained dark energy candidate, is studied. In our
model, there is no mutual interaction between the cosmos sectors. We find out
that the obtained model is theoretically powerful to explain the current
accelerated phase of the universe. This result emphasizes that the generalized
entropy formalism is suitable for describing systems including the long-range
interactions such as gravity.
| physics.gen-ph | using the first law of thermodynamics we propose a relation between the system entropy s and its ir l and uv lambda cutoffs in addition applying this relation to the apparent horizon of flat frw universe whose entropy meets the renyi entropy a new holographic dark energy model is addressed thereinafter the evolution of the flat frw universe filled by a pressureless source and the obtained dark energy candidate is studied in our model there is no mutual interaction between the cosmos sectors we find out that the obtained model is theoretically powerful to explain the current accelerated phase of the universe this result emphasizes that the generalized entropy formalism is suitable for describing systems including the longrange interactions such as gravity | [['using', 'the', 'first', 'law', 'of', 'thermodynamics', 'we', 'propose', 'a', 'relation', 'between', 'the', 'system', 'entropy', 's', 'and', 'its', 'ir', 'l', 'and', 'uv', 'lambda', 'cutoffs', 'in', 'addition', 'applying', 'this', 'relation', 'to', 'the', 'apparent', 'horizon', 'of', 'flat', 'frw', 'universe', 'whose', 'entropy', 'meets', 'the', 'renyi', 'entropy', 'a', 'new', 'holographic', 'dark', 'energy', 'model', 'is', 'addressed', 'thereinafter', 'the', 'evolution', 'of', 'the', 'flat', 'frw', 'universe', 'filled', 'by', 'a', 'pressureless', 'source', 'and', 'the', 'obtained', 'dark', 'energy', 'candidate', 'is', 'studied', 'in', 'our', 'model', 'there', 'is', 'no', 'mutual', 'interaction', 'between', 'the', 'cosmos', 'sectors', 'we', 'find', 'out', 'that', 'the', 'obtained', 'model', 'is', 'theoretically', 'powerful', 'to', 'explain', 'the', 'current', 'accelerated', 'phase', 'of', 'the', 'universe', 'this', 'result', 'emphasizes', 'that', 'the', 'generalized', 'entropy', 'formalism', 'is', 'suitable', 'for', 'describing', 'systems', 'including', 'the', 'longrange', 'interactions', 'such', 'as', 'gravity']] | [-0.14506945023923867, 0.1190709316049565, -0.13783922824544878, 0.14075638778168006, -0.04146109528641109, -0.14124612091872535, -0.008808388610439161, 0.3219586341321224, -0.23657658918317956, -0.2925147160364803, 0.009701216583842502, -0.29577543987266597, -0.06882186078267996, 0.11877694577703894, -0.011328694506044516, 0.00658406666050604, -0.04107202742187703, 0.03162863079771461, -0.03791807166331249, -0.2251557870624877, 0.3460775152827827, 0.10233467313571695, 0.2668558344279309, 0.04762392004066315, 0.12687945741106618, -0.030510579165239193, -0.034506588494863176, 0.06757673636445256, -0.20585879250241113, 0.08018085468974591, 0.187441161546005, 0.12584157730834405, 0.20886089086731072, -0.38128226812257143, -0.2706717257800638, 0.14741113735362887, 0.10979284685425704, 0.0922697890114772, -0.061434969977765784, -0.2624500827772207, 0.010259648346052062, -0.2156475468340223, -0.15004512959648472, -0.03248397973137068, 0.030313676971270413, -0.06230036085605102, -0.18758885044467133, 0.16805999980644, 0.04161562716405167, -0.02671352076677216, -0.10244222200708464, -0.01873531504667776, -0.054508640676103226, 0.05504427035339177, 0.07534426680029385, 0.030776777226462593, 0.10283210120911969, -0.14540928176634746, -0.064615766956761, 0.3743057345330227, -0.11427308126451967, -0.13930210167853177, 0.15860131899559046, -0.12221510857763532, -0.10517467293491373, 0.06113886287183974, 0.06404915543608979, 0.10284169968037501, -0.18702850198434268, 0.16610316793886623, 0.004842872879292327, 0.1755537700488186, 0.048965675573124263, 0.04225423486548339, 0.313697568102755, 0.15238765493172723, -0.0038073287559215164, 0.17526551960112496, -0.04317729192374171, -0.1345351197428574, -0.39809224674417104, -0.18558264721820603, -0.20151349995905518, 0.03418757055445238, -0.13525063657837816, -0.14123192366182072, 0.3343835806504625, 0.12936926790483042, 0.16122504729075265, 0.05081255003985506, 0.2717514084079532, 0.10553309339724604, 0.011889990312276317, 0.10523009670852515, 0.3011048828465406, 0.12273746572022677, 0.14296621642815957, -0.25126408969174274, -0.014950915430596129, 0.0715939487277179] |
1,803.02196 | Some Relations on Paratopisms and An Intuitive Interpretation on the Parastrophes of a Latin Square | This paper will present some intuitive interpretation of the parastrophe transformations of arbitrary Latin square. With this trick, we can generate the parastrophes of arbitrary Latin square directly from the original one without generating the orthogonal array. The relations of isotopisms and parastrophe transformations in composition will also be shown. It will solve the problem that when F1*I1=I2*F2 how can we obtain I2 and F2 from I1 and F1, where I1 and I2 are isotopisms while F1 and F2 are parastrophe transformations and "{*}" is the composition of transformations. These methods could distinctly simplify the computation on a computer for the issues related to main classes of Latin squares. This will improve the efficiency apparently in computation for some related problems. | math.CO | this paper will present some intuitive interpretation of the parastrophe transformations of arbitrary latin square with this trick we can generate the parastrophes of arbitrary latin square directly from the original one without generating the orthogonal array the relations of isotopisms and parastrophe transformations in composition will also be shown it will solve the problem that when f1i1i2f2 how can we obtain i2 and f2 from i1 and f1 where i1 and i2 are isotopisms while f1 and f2 are parastrophe transformations and is the composition of transformations these methods could distinctly simplify the computation on a computer for the issues related to main classes of latin squares this will improve the efficiency apparently in computation for some related problems | [['this', 'paper', 'will', 'present', 'some', 'intuitive', 'interpretation', 'of', 'the', 'parastrophe', 'transformations', 'of', 'arbitrary', 'latin', 'square', 'with', 'this', 'trick', 'we', 'can', 'generate', 'the', 'parastrophes', 'of', 'arbitrary', 'latin', 'square', 'directly', 'from', 'the', 'original', 'one', 'without', 'generating', 'the', 'orthogonal', 'array', 'the', 'relations', 'of', 'isotopisms', 'and', 'parastrophe', 'transformations', 'in', 'composition', 'will', 'also', 'be', 'shown', 'it', 'will', 'solve', 'the', 'problem', 'that', 'when', 'f1i1i2f2', 'how', 'can', 'we', 'obtain', 'i2', 'and', 'f2', 'from', 'i1', 'and', 'f1', 'where', 'i1', 'and', 'i2', 'are', 'isotopisms', 'while', 'f1', 'and', 'f2', 'are', 'parastrophe', 'transformations', 'and', 'is', 'the', 'composition', 'of', 'transformations', 'these', 'methods', 'could', 'distinctly', 'simplify', 'the', 'computation', 'on', 'a', 'computer', 'for', 'the', 'issues', 'related', 'to', 'main', 'classes', 'of', 'latin', 'squares', 'this', 'will', 'improve', 'the', 'efficiency', 'apparently', 'in', 'computation', 'for', 'some', 'related', 'problems']] | [-0.0887963264748188, 0.14709413286392428, -0.05120118519588679, 0.06619615584197101, -0.07351917795203, -0.12084369710842226, 0.005931305251976459, 0.37774911864089367, -0.2939713452668751, -0.28220564117576896, 0.16305238065826355, -0.28438671236122104, -0.19285810511058368, 0.1791797217427745, -0.08473396936368917, 0.020969291831984992, 0.055351867993017896, 0.04451293713107955, -0.13345340836769706, -0.29185147495635105, 0.29329343550220255, -0.008621934957864905, 0.23996460811086312, 0.04486824890027339, 0.08090946694225573, -0.015490043313563372, -0.03571435598218266, -0.018317192667672615, -0.09420507951443204, 0.14080908331734387, 0.2412436333985827, 0.1787176233747614, 0.20121584785710864, -0.3890084646673513, -0.10011713776518316, 0.12339895726142436, 0.17814668856498575, 0.0890034936356726, 0.024558409534887794, -0.25658823338438985, 0.05670059318928158, -0.11625545955959614, -0.11731003469811017, -0.09945206632915915, -0.0032565535795522713, 0.050095593061752056, -0.2781268751968731, 0.027650040611301885, 0.08900575324141678, 0.04038421163225875, -0.005722578560166499, -0.2011394314859219, 0.03146580647004126, 0.1519763313476955, 0.014466503019710737, 0.05364316320751144, 0.04346769901937531, -0.09954702727713802, -0.12479707114828922, 0.39412253299931516, -0.010421636119140546, -0.24674601058530457, 0.15327548895798185, -0.11049827636696961, -0.16630230351750339, 0.07512133980968169, 0.13837617743729042, 0.05947689735917609, -0.13943052989836222, 0.06638899118494743, -0.061766897774293644, 0.15948239856344812, 0.11541714219517317, 0.012160567556969634, 0.16847327093695516, 0.06943097375010476, 0.06382600692327783, 0.18114748698397062, -0.04990439437904019, -0.06037212664089283, -0.30756317534554406, -0.15785819878253868, -0.11340214168367234, 0.05377807904880087, -0.05746126286181653, -0.11012987778282396, 0.36863516342333136, 0.16411772017961979, 0.14407848056499697, 0.05300622203332536, 0.26856278442237685, 0.08400530713226866, 0.07907683615956236, 0.0338052208300586, 0.15752474723644005, 0.11606371117865338, 0.05729517189418005, -0.2085168914352896, 0.02928419171699456, 0.07108211259263716] |
1,803.02197 | The origins of the Malagasy people, some certainties and a few mysteries | The Malagasy language belongs to the Greater Barito East group of the
Austronesian family, the language most closely connected to Malagasy dialects
is Maanyan (Kalimantan), but Malay as well other Indonesian and Philippine
languages are also related. The African contribution is very high in the
Malagasy genetic make-up (about 50%) but negligible in the language. Because of
the linguistic link, it is widely accepted that the island was settled by
Indonesian sailors after a maritime trek but date and place of landing are
still debated. The 50% Indonesian genetic contribution to present Malagasy
points in a different direction then Maanyan for the Asian ancestry, therefore,
the ethnic composition of the Austronesian settlers is also still debated. In
this talk I mainly review the joint research of Filippo Petroni, Dima
Volchenkov, S\"oren Wichmann and myself which tries to shed new light on these
problems. The key point is the application of a new quantitative methodology
which is able to find out the kinship relations among languages (or dialects).
New techniques are also introduced in order to extract the maximum information
from these relations concerning time and space patterns.
| q-bio.PE | the malagasy language belongs to the greater barito east group of the austronesian family the language most closely connected to malagasy dialects is maanyan kalimantan but malay as well other indonesian and philippine languages are also related the african contribution is very high in the malagasy genetic makeup about 50 but negligible in the language because of the linguistic link it is widely accepted that the island was settled by indonesian sailors after a maritime trek but date and place of landing are still debated the 50 indonesian genetic contribution to present malagasy points in a different direction then maanyan for the asian ancestry therefore the ethnic composition of the austronesian settlers is also still debated in this talk i mainly review the joint research of filippo petroni dima volchenkov soren wichmann and myself which tries to shed new light on these problems the key point is the application of a new quantitative methodology which is able to find out the kinship relations among languages or dialects new techniques are also introduced in order to extract the maximum information from these relations concerning time and space patterns | [['the', 'malagasy', 'language', 'belongs', 'to', 'the', 'greater', 'barito', 'east', 'group', 'of', 'the', 'austronesian', 'family', 'the', 'language', 'most', 'closely', 'connected', 'to', 'malagasy', 'dialects', 'is', 'maanyan', 'kalimantan', 'but', 'malay', 'as', 'well', 'other', 'indonesian', 'and', 'philippine', 'languages', 'are', 'also', 'related', 'the', 'african', 'contribution', 'is', 'very', 'high', 'in', 'the', 'malagasy', 'genetic', 'makeup', 'about', '50', 'but', 'negligible', 'in', 'the', 'language', 'because', 'of', 'the', 'linguistic', 'link', 'it', 'is', 'widely', 'accepted', 'that', 'the', 'island', 'was', 'settled', 'by', 'indonesian', 'sailors', 'after', 'a', 'maritime', 'trek', 'but', 'date', 'and', 'place', 'of', 'landing', 'are', 'still', 'debated', 'the', '50', 'indonesian', 'genetic', 'contribution', 'to', 'present', 'malagasy', 'points', 'in', 'a', 'different', 'direction', 'then', 'maanyan', 'for', 'the', 'asian', 'ancestry', 'therefore', 'the', 'ethnic', 'composition', 'of', 'the', 'austronesian', 'settlers', 'is', 'also', 'still', 'debated', 'in', 'this', 'talk', 'i', 'mainly', 'review', 'the', 'joint', 'research', 'of', 'filippo', 'petroni', 'dima', 'volchenkov', 'soren', 'wichmann', 'and', 'myself', 'which', 'tries', 'to', 'shed', 'new', 'light', 'on', 'these', 'problems', 'the', 'key', 'point', 'is', 'the', 'application', 'of', 'a', 'new', 'quantitative', 'methodology', 'which', 'is', 'able', 'to', 'find', 'out', 'the', 'kinship', 'relations', 'among', 'languages', 'or', 'dialects', 'new', 'techniques', 'are', 'also', 'introduced', 'in', 'order', 'to', 'extract', 'the', 'maximum', 'information', 'from', 'these', 'relations', 'concerning', 'time', 'and', 'space', 'patterns']] | [-0.06480181470286805, 0.09834030032459949, -0.07225256227263614, 0.14006163314601558, -0.1401394096882762, -0.1313615512379722, 0.0759928363841027, 0.3464130950235837, -0.2626260955717314, -0.299653213463623, 0.12517698215433976, -0.3111182499223867, -0.15744500533627295, 0.1901404720429029, -0.14056587530350362, -0.041028769308625646, 0.0285392856143566, 0.046401179273537284, 0.014467866658988233, -0.2687386424507241, 0.28436375783403983, 0.044959326435786644, 0.2889894731443476, 0.0680148796706989, 0.061893725015122344, -0.07067465055985628, -0.08269240513972535, -0.041170916291161416, -0.09386994896249726, 0.15172031489515525, 0.3070475401608525, 0.19797437301257978, 0.280172122274903, -0.36201325385151684, -0.1281847026249444, 0.04806787319280006, 0.10808806100992385, 0.061473411675290884, -0.004625719353380437, -0.28243773700291847, 0.06082487005891429, -0.1557653518746028, -0.07202629590834919, 0.006984604688713679, 0.06956340546713437, -0.0027454201119473656, -0.14636597622160774, 0.04551803615979372, 0.06060374939147182, 0.12285712895461837, -0.011781585512280061, -0.1802978521489815, -0.008914938801899553, 0.16341899533605053, 0.08596674566333358, 0.07975581537844059, 0.08497145800171672, -0.09622736995775454, -0.11646675030272957, 0.4032173042799145, 0.006396825227735413, -0.1295619972399436, 0.21711666080597283, -0.13376374359311838, -0.18690002719569648, 0.06372187065615041, 0.15183840019540307, 0.1003059847123065, -0.205324362762071, 0.048417327946958105, -0.06354246804541028, 0.18724436603464514, 0.09516814587939833, -0.02270563288365264, 0.21699850057704828, 0.16972895071399713, 0.016631461033673103, 0.0959746973818747, -0.06871052558936581, -0.11027129276882153, -0.19976461252600358, -0.1457149906234967, -0.09999397387476386, -0.022963063119331727, -0.02436673287648355, -0.1505739164614194, 0.3950816953227528, 0.1707195615427367, 0.11370106872888534, 0.02866573167989987, 0.23577192520622064, -0.0012696283252758753, 0.10927549078557137, 0.08118059797589258, 0.1737220073766956, 0.07025717957624913, 0.13426394394120655, -0.15762939916615298, 0.16114491476249454, 0.03504816088601286] |
1,803.02198 | Hubble Expansion as an Einstein Curvature | Extending the spacetime manifold of general relativity (GR) to incorporate
the Hubble expansion of space as a specific curvature, generates a modified
solution with three additional non-zero Christoffel symbols and a reformulated
Ricci tensor and curvature. The observational consequences of this
reformulation are compared with the $\Lambda$CDM model for luminosity distance
using the extensive type~Ia supernovae (SNe~1a) data with redshift corrected to
the CMB, and for angular diameter distance using the recent baryonic acoustic
oscillation (BAO) data. For the SNe~1a data, the modified GR and $\Lambda$CDM
models differ by $^{+0.11}_{-0.15}~\mu_B$~mag. over $z_{cmb}=0.01-1.3$, with
overall weighted RMS errors of $\pm0.136$ $\mu_B$~mag for modified GR and
$\pm0.151$ $\mu_B$~mag for $\Lambda$CDM respectively. The BAO measures span a
range $z=0.106-2.36$, with weighted RMS errors of $\pm0.034$~Mpc with
$H_0=67.6\pm0.25$ for the modified GR model, and $\pm0.085$~Mpc with
$H_0=70.0\pm0.25$ for the $\Lambda$CDM model. The derived GR metric for this
new solution describes both the SNe~1a and the BAO observations with comparable
accuracy to the $w'\Lambda$CDM model. By incorporating the Hubble expansion of
space within general relativity as a specific curvature term, these
observations may be described without requiring additional parameters for
either dark matter or accelerating dark energy.
| physics.gen-ph | extending the spacetime manifold of general relativity gr to incorporate the hubble expansion of space as a specific curvature generates a modified solution with three additional nonzero christoffel symbols and a reformulated ricci tensor and curvature the observational consequences of this reformulation are compared with the lambdacdm model for luminosity distance using the extensive typeia supernovae sne1a data with redshift corrected to the cmb and for angular diameter distance using the recent baryonic acoustic oscillation bao data for the sne1a data the modified gr and lambdacdm models differ by 011_015mu_bmag over z_cmb00113 with overall weighted rms errors of pm0136 mu_bmag for modified gr and pm0151 mu_bmag for lambdacdm respectively the bao measures span a range z0106236 with weighted rms errors of pm0034mpc with h_0676pm025 for the modified gr model and pm0085mpc with h_0700pm025 for the lambdacdm model the derived gr metric for this new solution describes both the sne1a and the bao observations with comparable accuracy to the wlambdacdm model by incorporating the hubble expansion of space within general relativity as a specific curvature term these observations may be described without requiring additional parameters for either dark matter or accelerating dark energy | [['extending', 'the', 'spacetime', 'manifold', 'of', 'general', 'relativity', 'gr', 'to', 'incorporate', 'the', 'hubble', 'expansion', 'of', 'space', 'as', 'a', 'specific', 'curvature', 'generates', 'a', 'modified', 'solution', 'with', 'three', 'additional', 'nonzero', 'christoffel', 'symbols', 'and', 'a', 'reformulated', 'ricci', 'tensor', 'and', 'curvature', 'the', 'observational', 'consequences', 'of', 'this', 'reformulation', 'are', 'compared', 'with', 'the', 'lambdacdm', 'model', 'for', 'luminosity', 'distance', 'using', 'the', 'extensive', 'typeia', 'supernovae', 'sne1a', 'data', 'with', 'redshift', 'corrected', 'to', 'the', 'cmb', 'and', 'for', 'angular', 'diameter', 'distance', 'using', 'the', 'recent', 'baryonic', 'acoustic', 'oscillation', 'bao', 'data', 'for', 'the', 'sne1a', 'data', 'the', 'modified', 'gr', 'and', 'lambdacdm', 'models', 'differ', 'by', '011_015mu_bmag', 'over', 'z_cmb00113', 'with', 'overall', 'weighted', 'rms', 'errors', 'of', 'pm0136', 'mu_bmag', 'for', 'modified', 'gr', 'and', 'pm0151', 'mu_bmag', 'for', 'lambdacdm', 'respectively', 'the', 'bao', 'measures', 'span', 'a', 'range', 'z0106236', 'with', 'weighted', 'rms', 'errors', 'of', 'pm0034mpc', 'with', 'h_0676pm025', 'for', 'the', 'modified', 'gr', 'model', 'and', 'pm0085mpc', 'with', 'h_0700pm025', 'for', 'the', 'lambdacdm', 'model', 'the', 'derived', 'gr', 'metric', 'for', 'this', 'new', 'solution', 'describes', 'both', 'the', 'sne1a', 'and', 'the', 'bao', 'observations', 'with', 'comparable', 'accuracy', 'to', 'the', 'wlambdacdm', 'model', 'by', 'incorporating', 'the', 'hubble', 'expansion', 'of', 'space', 'within', 'general', 'relativity', 'as', 'a', 'specific', 'curvature', 'term', 'these', 'observations', 'may', 'be', 'described', 'without', 'requiring', 'additional', 'parameters', 'for', 'either', 'dark', 'matter', 'or', 'accelerating', 'dark', 'energy']] | [-0.06392050610027379, 0.06396189512629967, -0.07583456920822047, 0.1264322380367149, -0.15206931015838765, -0.1447058667247701, -0.030917645659711626, 0.32325818904468584, -0.23410493567999865, -0.3381548232812848, 0.05746771506447759, -0.28426534993195673, -0.03129891009820211, 0.20395607688955755, -0.02427594321395898, 0.02853894148332377, 0.07012002767296507, 0.0033643448447239484, -0.11549171220127998, -0.25237622005580407, 0.33499968053980006, 0.13557884980303544, 0.2148348706700037, -0.06700684690537552, 0.11829081479809248, -0.05208182287428321, -0.09235105419324505, 0.07981560303241066, -0.20263356586607795, 0.08704643196736774, 0.17584031864626012, 0.15690999440331427, 0.19290672643110157, -0.36231407237290925, -0.3027830838277522, 0.11849240527695251, 0.11582363557018753, 0.14285763402003795, -0.027921570762474503, -0.3331368300753335, 0.03651246847326143, -0.16898166752394495, -0.11507149057740915, -0.03270318270402236, -0.02167763725026614, -0.010640783703679012, -0.25224244798171436, 0.20407024134183302, -0.014514258832463788, -0.007665928453207016, -0.11246295717493114, -0.14176985600885625, -0.01862878234177414, 0.02540561943185619, 0.06464870749558839, 0.08233139004231715, 0.06864281553361151, -0.12153269828348938, -0.05066716710053798, 0.4360649862119721, -0.15899500931199226, -0.17884915748921534, 0.08234700789907948, -0.13826522504807345, -0.078384159042293, 0.03423486535126964, 0.1338603835966852, 0.03664090870362189, -0.12567965964295177, 0.10723600255413557, 0.05264565476940738, 0.17015797077781625, 0.10117984380857604, 0.032999714906974176, 0.254534236393455, 0.12202115348126326, 0.0447844450827688, 0.028993037601079172, -0.12000058884732426, -0.03856262305441002, -0.36278353615974385, -0.09461452603443629, -0.1710220149381914, 0.049998024344030355, -0.23589601557024353, -0.16623134882603255, 0.3782891183315466, 0.08583836206833237, 0.19433587375776065, 0.1506507321105649, 0.3118252818058762, 0.05506287835822958, 0.08649672760576424, 0.06326651275157928, 0.31058653787606294, 0.121246900750945, 0.0992915808274928, -0.2148427218108231, -0.010724951851362777, 0.04539962990675121] |
1,803.02199 | A Note on the Classification of Permutation Matrix | This paper is concentrated on the classification of permutation matrix with
the permutation similarity relation, mainly about the canonical form of a
permutational similar equivalence class, the cycle matrix decomposition of a
permutation matrix and the cycle factorization of a permutation matrix or
monomial matrix.
| math.GM | this paper is concentrated on the classification of permutation matrix with the permutation similarity relation mainly about the canonical form of a permutational similar equivalence class the cycle matrix decomposition of a permutation matrix and the cycle factorization of a permutation matrix or monomial matrix | [['this', 'paper', 'is', 'concentrated', 'on', 'the', 'classification', 'of', 'permutation', 'matrix', 'with', 'the', 'permutation', 'similarity', 'relation', 'mainly', 'about', 'the', 'canonical', 'form', 'of', 'a', 'permutational', 'similar', 'equivalence', 'class', 'the', 'cycle', 'matrix', 'decomposition', 'of', 'a', 'permutation', 'matrix', 'and', 'the', 'cycle', 'factorization', 'of', 'a', 'permutation', 'matrix', 'or', 'monomial', 'matrix']] | [-0.13715571839776303, 0.13656240550594198, -0.056439560362034374, 0.03208373263478279, -0.054683084247840776, -0.1100755592290726, 0.0562267231159947, 0.34306836128234863, -0.36521749016311433, -0.21885350408653417, 0.1407335336992724, -0.24710568280683623, -0.20913640913139614, 0.03216137852933672, -0.07301701288670301, 0.07066258502503237, 0.11692367450127171, 0.140586983702249, -0.23505465118214489, -0.21482689881490336, 0.37957295775413513, 0.009769572897089853, 0.3042454837304023, -0.052739161904901265, 0.09716356791969803, 0.028282756968918774, -0.09749914593994617, -0.02119737486872408, -0.0017292568460106849, 0.15458241167685224, 0.21464753242002593, 0.20914885102667743, 0.16366837229062287, -0.3673354679925574, -0.07254622797999118, 0.22922582676013312, 0.10120099387649033, 0.027289931020802922, -0.023803367344145145, -0.20255474183294508, 0.13487375635724877, -0.2293254379596975, -0.05133768421494299, -0.007798038086750441, 0.07905663069751527, -0.052903559431433676, -0.2908224647657739, 0.049587940859297915, 0.1431360031167666, 0.13412726980944475, 0.0868294888900386, -0.1802148742808236, 0.08741174108452267, 0.05599021441303194, 0.013198075127891368, 0.012542270734492275, 0.12622779860264724, -0.07374693519021902, -0.06906220639745395, 0.40953317284584045, 0.0027012382944424946, -0.2049101586971018, 0.09711850324852599, -0.13791350070387126, -0.21286912703265745, 0.09018735703494814, 0.11425873430756231, 0.098546513211396, -0.11346283739225732, 0.08907143678386799, -0.2017797221740087, 0.15226966850459575, 0.09467541836202145, -0.040517911397748525, 0.12494795166162981, 0.10034576185668508, 0.07186730988323689, 0.13476597581886582, 0.03682188208007978, -0.06973896145613658, -0.2846249733120203, -0.19459157512626715, -0.2139190762096809, 0.1481732595918907, -0.22415588898551908, -0.23073448605007596, 0.5170172795808564, 0.027221490763541724, 0.1646225536863009, 0.13539088409807948, 0.19551305173792774, 0.11532639442529115, 0.07060426863220831, -0.003378352781550752, 0.08699457463290956, 0.3237390467897058, -0.04002814293942518, -0.22996802258615692, 0.07129394207149745, 0.2475005810873376] |
1,803.022 | Electrohydrodynamic channeling effects in narrow fractures and pores | In low-permeability rock, fluid and mineral transport occur in pores and
fracture apertures at the scale of micrometers and below. At this scale, the
presence of surface charge, and a resultant electrical double layer, may
considerably alter transport properties. However, due to the inherent
non-linearity of the governing equations, numerical and theoretical studies of
the coupling between electric double layers and flow have mostly been limited
to two-dimensional or axisymmetric geometries. Here, we present comprehensive
three-dimensional simulations of electrohydrodynamic flow in an idealized
fracture geometry consisting of a sinusoidally undulated bottom surface and a
flat top surface. We investigate the effects of varying the amplitude and the
Debye length (relative to the fracture aperture) and quantify their impact on
flow channeling. The results indicate that channeling can be significantly
increased in the plane of flow. Local flow in the narrow regions can be slowed
down by up to $5 \%$ compared to the same geometry without charge, for the
highest amplitude considered. This indicates that electrohydrodynamics may have
consequences for transport phenomena and surface growth in geophysical systems.
| physics.flu-dyn physics.chem-ph | in lowpermeability rock fluid and mineral transport occur in pores and fracture apertures at the scale of micrometers and below at this scale the presence of surface charge and a resultant electrical double layer may considerably alter transport properties however due to the inherent nonlinearity of the governing equations numerical and theoretical studies of the coupling between electric double layers and flow have mostly been limited to twodimensional or axisymmetric geometries here we present comprehensive threedimensional simulations of electrohydrodynamic flow in an idealized fracture geometry consisting of a sinusoidally undulated bottom surface and a flat top surface we investigate the effects of varying the amplitude and the debye length relative to the fracture aperture and quantify their impact on flow channeling the results indicate that channeling can be significantly increased in the plane of flow local flow in the narrow regions can be slowed down by up to 5 compared to the same geometry without charge for the highest amplitude considered this indicates that electrohydrodynamics may have consequences for transport phenomena and surface growth in geophysical systems | [['in', 'lowpermeability', 'rock', 'fluid', 'and', 'mineral', 'transport', 'occur', 'in', 'pores', 'and', 'fracture', 'apertures', 'at', 'the', 'scale', 'of', 'micrometers', 'and', 'below', 'at', 'this', 'scale', 'the', 'presence', 'of', 'surface', 'charge', 'and', 'a', 'resultant', 'electrical', 'double', 'layer', 'may', 'considerably', 'alter', 'transport', 'properties', 'however', 'due', 'to', 'the', 'inherent', 'nonlinearity', 'of', 'the', 'governing', 'equations', 'numerical', 'and', 'theoretical', 'studies', 'of', 'the', 'coupling', 'between', 'electric', 'double', 'layers', 'and', 'flow', 'have', 'mostly', 'been', 'limited', 'to', 'twodimensional', 'or', 'axisymmetric', 'geometries', 'here', 'we', 'present', 'comprehensive', 'threedimensional', 'simulations', 'of', 'electrohydrodynamic', 'flow', 'in', 'an', 'idealized', 'fracture', 'geometry', 'consisting', 'of', 'a', 'sinusoidally', 'undulated', 'bottom', 'surface', 'and', 'a', 'flat', 'top', 'surface', 'we', 'investigate', 'the', 'effects', 'of', 'varying', 'the', 'amplitude', 'and', 'the', 'debye', 'length', 'relative', 'to', 'the', 'fracture', 'aperture', 'and', 'quantify', 'their', 'impact', 'on', 'flow', 'channeling', 'the', 'results', 'indicate', 'that', 'channeling', 'can', 'be', 'significantly', 'increased', 'in', 'the', 'plane', 'of', 'flow', 'local', 'flow', 'in', 'the', 'narrow', 'regions', 'can', 'be', 'slowed', 'down', 'by', 'up', 'to', '5', 'compared', 'to', 'the', 'same', 'geometry', 'without', 'charge', 'for', 'the', 'highest', 'amplitude', 'considered', 'this', 'indicates', 'that', 'electrohydrodynamics', 'may', 'have', 'consequences', 'for', 'transport', 'phenomena', 'and', 'surface', 'growth', 'in', 'geophysical', 'systems']] | [-0.11276102113395424, 0.17695202010278893, -0.05138635989521909, 0.014790186128384397, -0.025598250129549516, -0.08024598691496725, 0.008486756522176881, 0.36201479014188137, -0.2978216490503085, -0.32095716376381134, 0.08569490316976389, -0.2607979523228471, -0.12346593867645383, 0.21243711427711792, -0.018780956188174713, 0.060685853602754025, 0.020985551257380993, -0.05902651821047404, -0.07534416210127332, -0.1633259154488543, 0.2764424353503848, 0.07021301119761952, 0.3246991570570669, 0.1314572667667516, 0.057720190587606135, -0.034922246373979386, 0.0013535240767681498, 0.08545981180238521, -0.17965184456557312, 0.06756716855606959, 0.18229614745820266, -0.05748017432068154, 0.19461989524842654, -0.5179351696502522, -0.2866931766124263, 0.017649937663122086, 0.15754245132691946, 0.11978111275087643, -0.03638168393422476, -0.22196365753451816, 0.09205839865299015, -0.12828334311738948, -0.14539335535886555, -0.01118371946379374, 0.0178926925879961, 0.03957087382257227, -0.20912512349448886, 0.12019845979067229, 0.04867314826323037, 0.08878263051747896, -0.07117192125826612, -0.08363619307384926, -0.08538544427940233, 0.11865300060536628, 0.07216541171810553, -0.01464877238593822, 0.20047332150440683, -0.17645072725522856, -0.041056508595639536, 0.39657751710803935, -0.04663023478969784, -0.21102518135665962, 0.20776410893100383, -0.19601880835591537, -0.018789655892020564, 0.19607100678781458, 0.2515215726518651, 0.08687090963825037, -0.11239577276569049, 0.03760365143057885, -0.009692576250829602, 0.16444250704499624, 0.1134365510753235, -0.014936752306918303, 0.2441359894444882, 0.2025214355270573, 0.030009061326983118, 0.12605060050053532, -0.14613919290135177, -0.08234736776060957, -0.2584540858433324, -0.14601941860549278, -0.11908866916349063, 0.050784119628475045, -0.09545075038292097, -0.17001329117986022, 0.37921604450981494, 0.1117952608327134, 0.17804334956776394, -0.03645645132903957, 0.2556622362002404, 0.0652791059024811, 0.08600404022108911, 0.07563931249229416, 0.305027645673224, 0.1649357705701953, 0.12772656567552584, -0.272948599156087, 0.07061571596811216, 0.006625477474519593] |
1,803.02201 | The origins of post-starburst galaxies at z<0.05 | Post-starburst galaxies can be identified via the presence of prominent
Hydrogen Balmer absorption lines in their spectra. We present a comprehensive
study of the origin of strong Balmer lines in a volume-limited sample of 189
galaxies with $0.01<z<0.05$, $\log(\mbox{M}_{\star}/\mbox{M}_{\odot})>9.5$ and
projected axis ratio $b/a>0.32$. We explore their structural properties,
environments, emission lines and star formation histories, and compare them to
control samples of star-forming and quiescent galaxies, and simulated galaxy
mergers. Excluding contaminants, in which the strong Balmer lines are most
likely caused by dust-star geometry, we find evidence for three different
pathways through the post-starburst phase, with most events occurring in
intermediate-density environments: (1) a significant disruptive event, such as
a gas-rich major merger, causing a starburst and growth of a spheroidal
component, followed by quenching of the star formation (70% of post-starburst
galaxies at $9.5<\log(\mbox{M}_{\star}/\mbox{M}_{\odot})<10.5$ and 60% at
$\log(\mbox{M}_{\star}/\mbox{M}_{\odot})>10.5$); (2) at
$9.5<\log(\mbox{M}_{\star}/\mbox{M}_{\odot})<10.5$, stochastic star formation
in blue-sequence galaxies, causing a weak burst and subsequent return to the
blue sequence (30%); (3) at $\log(\mbox{M}_{\star}/\mbox{M}_{\odot})>10.5$,
cyclic evolution of quiescent galaxies which gradually move towards the
high-mass end of the red sequence through weak starbursts, possibly as a result
of a merger with a smaller gas-rich companion (40%). Our analysis suggests that
AGN are `on' for $50%$ of the duration of the post-starburst phase, meaning
that traditional samples of post-starburst galaxies with strict emission line
cuts will be at least $50%$ incomplete due to the exclusion of narrow-line AGN.
| astro-ph.GA | poststarburst galaxies can be identified via the presence of prominent hydrogen balmer absorption lines in their spectra we present a comprehensive study of the origin of strong balmer lines in a volumelimited sample of 189 galaxies with 001z005 logmboxm_starmboxm_odot95 and projected axis ratio ba032 we explore their structural properties environments emission lines and star formation histories and compare them to control samples of starforming and quiescent galaxies and simulated galaxy mergers excluding contaminants in which the strong balmer lines are most likely caused by duststar geometry we find evidence for three different pathways through the poststarburst phase with most events occurring in intermediatedensity environments 1 a significant disruptive event such as a gasrich major merger causing a starburst and growth of a spheroidal component followed by quenching of the star formation 70 of poststarburst galaxies at 95logmboxm_starmboxm_odot105 and 60 at logmboxm_starmboxm_odot105 2 at 95logmboxm_starmboxm_odot105 stochastic star formation in bluesequence galaxies causing a weak burst and subsequent return to the blue sequence 30 3 at logmboxm_starmboxm_odot105 cyclic evolution of quiescent galaxies which gradually move towards the highmass end of the red sequence through weak starbursts possibly as a result of a merger with a smaller gasrich companion 40 our analysis suggests that agn are on for 50 of the duration of the poststarburst phase meaning that traditional samples of poststarburst galaxies with strict emission line cuts will be at least 50 incomplete due to the exclusion of narrowline agn | [['poststarburst', 'galaxies', 'can', 'be', 'identified', 'via', 'the', 'presence', 'of', 'prominent', 'hydrogen', 'balmer', 'absorption', 'lines', 'in', 'their', 'spectra', 'we', 'present', 'a', 'comprehensive', 'study', 'of', 'the', 'origin', 'of', 'strong', 'balmer', 'lines', 'in', 'a', 'volumelimited', 'sample', 'of', '189', 'galaxies', 'with', '001z005', 'logmboxm_starmboxm_odot95', 'and', 'projected', 'axis', 'ratio', 'ba032', 'we', 'explore', 'their', 'structural', 'properties', 'environments', 'emission', 'lines', 'and', 'star', 'formation', 'histories', 'and', 'compare', 'them', 'to', 'control', 'samples', 'of', 'starforming', 'and', 'quiescent', 'galaxies', 'and', 'simulated', 'galaxy', 'mergers', 'excluding', 'contaminants', 'in', 'which', 'the', 'strong', 'balmer', 'lines', 'are', 'most', 'likely', 'caused', 'by', 'duststar', 'geometry', 'we', 'find', 'evidence', 'for', 'three', 'different', 'pathways', 'through', 'the', 'poststarburst', 'phase', 'with', 'most', 'events', 'occurring', 'in', 'intermediatedensity', 'environments', '1', 'a', 'significant', 'disruptive', 'event', 'such', 'as', 'a', 'gasrich', 'major', 'merger', 'causing', 'a', 'starburst', 'and', 'growth', 'of', 'a', 'spheroidal', 'component', 'followed', 'by', 'quenching', 'of', 'the', 'star', 'formation', '70', 'of', 'poststarburst', 'galaxies', 'at', '95logmboxm_starmboxm_odot105', 'and', '60', 'at', 'logmboxm_starmboxm_odot105', '2', 'at', '95logmboxm_starmboxm_odot105', 'stochastic', 'star', 'formation', 'in', 'bluesequence', 'galaxies', 'causing', 'a', 'weak', 'burst', 'and', 'subsequent', 'return', 'to', 'the', 'blue', 'sequence', '30', '3', 'at', 'logmboxm_starmboxm_odot105', 'cyclic', 'evolution', 'of', 'quiescent', 'galaxies', 'which', 'gradually', 'move', 'towards', 'the', 'highmass', 'end', 'of', 'the', 'red', 'sequence', 'through', 'weak', 'starbursts', 'possibly', 'as', 'a', 'result', 'of', 'a', 'merger', 'with', 'a', 'smaller', 'gasrich', 'companion', '40', 'our', 'analysis', 'suggests', 'that', 'agn', 'are', 'on', 'for', '50', 'of', 'the', 'duration', 'of', 'the', 'poststarburst', 'phase', 'meaning', 'that', 'traditional', 'samples', 'of', 'poststarburst', 'galaxies', 'with', 'strict', 'emission', 'line', 'cuts', 'will', 'be', 'at', 'least', '50', 'incomplete', 'due', 'to', 'the', 'exclusion', 'of', 'narrowline', 'agn']] | [-0.0669201512837076, 0.09649970167485097, -0.04484479290087996, 0.10747305849358312, -0.06888213441233158, -0.04223145418429089, 0.0709567110331183, 0.4643757740569558, -0.11535969854770067, -0.32272317720946436, 0.040128737324266694, -0.3035036719841722, -0.02560118561538322, 0.1511752632695475, -0.005389062894217768, -0.09158216304836217, 0.04743065492948517, -0.14149946374778538, -0.03766158866447172, -0.2933138695099905, 0.31708119365442866, 0.048023782867199646, 0.1442358146566127, -0.06462693126101432, 0.04537264233282446, -0.1043748244706437, -0.09116256592899626, -0.03603166625142531, -0.136552628738204, -0.019331089827103604, 0.28168065902317374, 0.1349719811495843, 0.29628991131702886, -0.35757896370752607, -0.17817846055750752, 0.09306083251029687, 0.22684797962781508, 0.05283272053766895, -0.1267431778778073, -0.27861561534870094, 0.08709111847866584, -0.17283128816453772, -0.1382977713405251, 0.11074405624972784, 0.042376789632444026, 0.04193187625662239, -0.1963922322069391, 0.1756025212455605, 0.07367812632482723, 0.12834170917129337, -0.060308478284398385, -0.035789403592734116, -0.10741141056421148, 0.05261583571073374, 0.01482742685916962, 0.06764810900946533, 0.2545355390125067, -0.15035436922836856, -0.062226721999869714, 0.41488206998148036, -0.048805738086731915, 0.09092264285648306, 0.2934685312853805, -0.21476896549524851, -0.2026208771978794, 0.20374692549363504, 0.16047526615800273, 0.10459715996041959, -0.12484776277641027, -0.07618672637056143, 0.05245776608253123, 0.18659183164809606, 0.03181786231013167, 0.06532016909709612, 0.3517848651330308, 0.09309297783806085, 0.03757231003516514, 0.12773026449802524, -0.192937375754966, -0.03077099121633339, -0.22612869132817964, -0.08914239489240572, -0.09371140847285679, 0.12362623426928747, -0.15714377440775118, -0.11781391124883346, 0.36316097198166597, 0.036507304020076466, 0.28632779748094717, 0.05227680456702164, 0.28960650292142887, 0.06940915557337074, 0.12617132250934132, 0.09222222737373849, 0.2790889287255062, 0.17600370168581542, 0.05347884686238229, -0.2373425286455915, 0.10601097018736945, -0.013817413826473057] |
1,803.02202 | Braids, normed division algebras, and Standard Model symmetries | This paper represents a first attempt at unifying two promising models that
attempt to explain the origin of the internal symmetries of leptons and quarks.
It is shown that each of the four normed division algebras over the reals
admits a representation of a circular braid group. For the complex numbers and
the quaternions, the represented circular braid groups are $B_2$ and $B_3^c$,
precisely those used to construct leptons and quarks as framed braids in the
Helon model of Bilson-Thompson. It is then shown that these framed braids
coincide with the states that span the minimal left ideals of the complex
(chained) octonions, shown by Furey to describe one generation of leptons and
quarks with unbroken $SU(3)_{c}$ and $U(1)_{em}$ symmetry.
The identification of basis states of minimal ideals with certain framed
braids is possible because the braiding in $B_2$ and $B_3^c$ in the Helon model
are interchangeable. It is shown that the framed braids in the Helon model can
be written as pure braid words in $B_3^c$ with trivial braiding in $B_2$,
something which is not possible for framed braids in general.
| physics.gen-ph | this paper represents a first attempt at unifying two promising models that attempt to explain the origin of the internal symmetries of leptons and quarks it is shown that each of the four normed division algebras over the reals admits a representation of a circular braid group for the complex numbers and the quaternions the represented circular braid groups are b_2 and b_3c precisely those used to construct leptons and quarks as framed braids in the helon model of bilsonthompson it is then shown that these framed braids coincide with the states that span the minimal left ideals of the complex chained octonions shown by furey to describe one generation of leptons and quarks with unbroken su3_c and u1_em symmetry the identification of basis states of minimal ideals with certain framed braids is possible because the braiding in b_2 and b_3c in the helon model are interchangeable it is shown that the framed braids in the helon model can be written as pure braid words in b_3c with trivial braiding in b_2 something which is not possible for framed braids in general | [['this', 'paper', 'represents', 'a', 'first', 'attempt', 'at', 'unifying', 'two', 'promising', 'models', 'that', 'attempt', 'to', 'explain', 'the', 'origin', 'of', 'the', 'internal', 'symmetries', 'of', 'leptons', 'and', 'quarks', 'it', 'is', 'shown', 'that', 'each', 'of', 'the', 'four', 'normed', 'division', 'algebras', 'over', 'the', 'reals', 'admits', 'a', 'representation', 'of', 'a', 'circular', 'braid', 'group', 'for', 'the', 'complex', 'numbers', 'and', 'the', 'quaternions', 'the', 'represented', 'circular', 'braid', 'groups', 'are', 'b_2', 'and', 'b_3c', 'precisely', 'those', 'used', 'to', 'construct', 'leptons', 'and', 'quarks', 'as', 'framed', 'braids', 'in', 'the', 'helon', 'model', 'of', 'bilsonthompson', 'it', 'is', 'then', 'shown', 'that', 'these', 'framed', 'braids', 'coincide', 'with', 'the', 'states', 'that', 'span', 'the', 'minimal', 'left', 'ideals', 'of', 'the', 'complex', 'chained', 'octonions', 'shown', 'by', 'furey', 'to', 'describe', 'one', 'generation', 'of', 'leptons', 'and', 'quarks', 'with', 'unbroken', 'su3_c', 'and', 'u1_em', 'symmetry', 'the', 'identification', 'of', 'basis', 'states', 'of', 'minimal', 'ideals', 'with', 'certain', 'framed', 'braids', 'is', 'possible', 'because', 'the', 'braiding', 'in', 'b_2', 'and', 'b_3c', 'in', 'the', 'helon', 'model', 'are', 'interchangeable', 'it', 'is', 'shown', 'that', 'the', 'framed', 'braids', 'in', 'the', 'helon', 'model', 'can', 'be', 'written', 'as', 'pure', 'braid', 'words', 'in', 'b_3c', 'with', 'trivial', 'braiding', 'in', 'b_2', 'something', 'which', 'is', 'not', 'possible', 'for', 'framed', 'braids', 'in', 'general']] | [-0.13300788666260588, 0.21619471735758347, -0.06105271282281665, 0.13003341860661427, -0.07485604762917807, -0.1771009747757067, -0.02897240838630238, 0.35309693921943974, -0.3085171741006371, -0.24745036400494408, 0.04617350826680516, -0.23811951078180588, -0.12929291556748815, 0.12723810552556367, -0.08796838447400138, 0.0040202589489478436, 0.04523347614709936, 0.09178461349512661, -0.06306083544893241, -0.25848420610386386, 0.3119375653312804, -0.03673330456846862, 0.23318153869834066, -0.0011207705379067535, 0.09106706488795208, -0.033676201213300436, -0.021210563242389145, -0.04138569175188548, -0.080643584699351, 0.11101822775096545, 0.2784115161565404, 0.0668661315585821, 0.10685297458828813, -0.415336683317916, -0.10429224723600139, 0.15603359608051692, 0.18474634861810266, 0.021085536735806387, 0.00577591151225468, -0.2650472409431488, 0.09125175382118693, -0.21418833676005267, -0.1261413989303047, -0.09029291190453985, 0.04132138848695801, -0.04799838311640926, -0.22398966323013175, 0.00943284209763621, 0.07522406123413895, 0.0681871232262797, -0.025560886184916476, -0.12109578964724951, -0.09489995207205333, 0.10335306746844017, 0.060755705262163846, 0.039845358186564796, 0.07445431207673295, -0.13048151541676228, -0.20939776405836172, 0.42397641604611885, -0.021923778359958315, -0.2903578282997671, 0.1430219431917147, -0.15341741484409785, -0.18112824938532726, 0.09676119184265561, 0.05397436023080073, 0.09541353907497878, -0.0924765701992283, 0.12903694893768602, -0.16461184251930008, 0.0897814588060407, 0.10156705178505643, -0.002176849093373083, 0.21898824121875082, 0.10728379848634423, 0.03673379855919938, 0.12231949253138978, 0.008161164241333528, -0.07462831187121138, -0.3436667849592741, -0.21236563115303522, -0.11475167791384853, 0.09003864944076682, -0.044135947844984126, -0.1740212180164195, 0.4268193205005556, 0.08678513675547354, 0.16005898044233657, 0.07206504160695251, 0.21712760764395417, 0.031825372989119666, 0.13345106031992654, 0.06286153504213328, 0.16710012391671406, 0.20055945461116814, 0.0022532215691814764, -0.1521707833191452, -0.006889006631057812, 0.15999767978711682] |
1,803.02203 | Practical sample-and-hold stabilization of nonlinear systems under
approximate optimizers | It is a known fact that not all controllable systems can be asymptotically
stabilized by a continuous static feedback. Several approaches have been
developed throughout the last decades, including time-varying, dynamical and
even discontinuous feedbacks. In the latter case, the sample-and-hold framework
is widely used, in which the control input is held constant during sampling
periods. Consequently, only practical stability can be achieved at best.
Existing approaches often require solving optimization problems for finding
stabilizing control actions exactly. In practice, each optimization routine has
a finite accuracy which might influence the state convergence. This work shows,
what bounds on optimization accuracy are required to achieve prescribed
stability margins. Simulation studies support the claim that optimization
accuracy has high influence on the state convergence.
| math.OC math.DS | it is a known fact that not all controllable systems can be asymptotically stabilized by a continuous static feedback several approaches have been developed throughout the last decades including timevarying dynamical and even discontinuous feedbacks in the latter case the sampleandhold framework is widely used in which the control input is held constant during sampling periods consequently only practical stability can be achieved at best existing approaches often require solving optimization problems for finding stabilizing control actions exactly in practice each optimization routine has a finite accuracy which might influence the state convergence this work shows what bounds on optimization accuracy are required to achieve prescribed stability margins simulation studies support the claim that optimization accuracy has high influence on the state convergence | [['it', 'is', 'a', 'known', 'fact', 'that', 'not', 'all', 'controllable', 'systems', 'can', 'be', 'asymptotically', 'stabilized', 'by', 'a', 'continuous', 'static', 'feedback', 'several', 'approaches', 'have', 'been', 'developed', 'throughout', 'the', 'last', 'decades', 'including', 'timevarying', 'dynamical', 'and', 'even', 'discontinuous', 'feedbacks', 'in', 'the', 'latter', 'case', 'the', 'sampleandhold', 'framework', 'is', 'widely', 'used', 'in', 'which', 'the', 'control', 'input', 'is', 'held', 'constant', 'during', 'sampling', 'periods', 'consequently', 'only', 'practical', 'stability', 'can', 'be', 'achieved', 'at', 'best', 'existing', 'approaches', 'often', 'require', 'solving', 'optimization', 'problems', 'for', 'finding', 'stabilizing', 'control', 'actions', 'exactly', 'in', 'practice', 'each', 'optimization', 'routine', 'has', 'a', 'finite', 'accuracy', 'which', 'might', 'influence', 'the', 'state', 'convergence', 'this', 'work', 'shows', 'what', 'bounds', 'on', 'optimization', 'accuracy', 'are', 'required', 'to', 'achieve', 'prescribed', 'stability', 'margins', 'simulation', 'studies', 'support', 'the', 'claim', 'that', 'optimization', 'accuracy', 'has', 'high', 'influence', 'on', 'the', 'state', 'convergence']] | [-0.1152855725050336, 0.07126005692786075, -0.09628511005747549, 0.051600266355884876, -0.08179828898254328, -0.18602183757338492, 0.03414888848073599, 0.42109688906741094, -0.2584522729815264, -0.3266170165298991, 0.1978074483899021, -0.20120919061700693, -0.1331776316217109, 0.21833672650476418, -0.10259526196443211, 0.1260658661963615, 0.09451995111104645, 0.03706367083492015, -0.07291530754523186, -0.33586288123236346, 0.2167747256845781, 0.05888779526500682, 0.3217159119260505, 0.0357452203307634, 0.10413173645461732, -0.03289530220502094, 0.03785524014913576, 0.05674174074386436, -0.08318442748861891, 0.06867579453268914, 0.3096888545688575, 0.12783652744483112, 0.3760433627398518, -0.3881784184283115, -0.28313071194400147, 0.13645264733775814, 0.17624964990569808, 0.11471380312109321, -0.06638156393414166, -0.22581871844850843, 0.08764660293312092, -0.14979248696832154, -0.07818752810040988, -0.11811806235795583, -0.02820401367299804, 0.016225287527685567, -0.2954834910314076, 0.028043783909633635, 0.049710355347686835, 0.04320632994962417, -0.07888168391461174, -0.11431980339788483, 0.0160685860934266, 0.15047019968808786, 0.03651949307290701, 0.035138312132832236, 0.14133292542603926, -0.08050997045867872, -0.15368327303842558, 0.34956401139800625, -0.016030275258159917, -0.2551156271578426, 0.2009588200523238, -0.07581314846979288, -0.1451954132862147, 0.163787054395818, 0.1927756857944698, 0.1480295567288692, -0.13562400149071696, 0.09384513099259523, -0.00020834304982932602, 0.1966588805217629, 0.06762745998784657, -0.010231448878814293, 0.16054532504299793, 0.18044921975370828, 0.1298626714245969, 0.08978409788995315, 0.011636895527003137, -0.17206310335834457, -0.2318041912333025, -0.05241899728032995, -0.16490131481910292, 9.854888456884953e-05, -0.061313536718399717, -0.13564021510499855, 0.36706274617614787, 0.16565253054798862, 0.11711193978544174, 0.04608531599879507, 0.34311564913307263, 0.133931806848604, 0.049334834967702024, 0.10615160244676035, 0.30518696399602463, 0.07984230162933605, 0.09903031658301721, -0.20814029932234104, 0.17883955100664822, 0.04241190927587753] |
1,803.02204 | SModelS extension with the CMS supersymmetry search results from Run 2 | We present the update of the SModelS database with the simplified model
results from CMS searches for supersymmetry at Run 2 with 36 fb$^{-1}$ of data.
The constraining power of these new results is compared to that of the 8 TeV
results within the context of a full model, the pMSSM. The new database,
v1.1.2, is publicly available and can readily be employed for physics studies
with SModelS.
| hep-ph hep-ex | we present the update of the smodels database with the simplified model results from cms searches for supersymmetry at run 2 with 36 fb1 of data the constraining power of these new results is compared to that of the 8 tev results within the context of a full model the pmssm the new database v112 is publicly available and can readily be employed for physics studies with smodels | [['we', 'present', 'the', 'update', 'of', 'the', 'smodels', 'database', 'with', 'the', 'simplified', 'model', 'results', 'from', 'cms', 'searches', 'for', 'supersymmetry', 'at', 'run', '2', 'with', '36', 'fb1', 'of', 'data', 'the', 'constraining', 'power', 'of', 'these', 'new', 'results', 'is', 'compared', 'to', 'that', 'of', 'the', '8', 'tev', 'results', 'within', 'the', 'context', 'of', 'a', 'full', 'model', 'the', 'pmssm', 'the', 'new', 'database', 'v112', 'is', 'publicly', 'available', 'and', 'can', 'readily', 'be', 'employed', 'for', 'physics', 'studies', 'with', 'smodels']] | [0.006016768515110016, 0.07243061909000115, -0.06393522630883929, 0.0756078317987404, -0.09011690562029424, -0.12458724147119724, 0.01301557237542618, 0.3271318879800246, -0.21148100533687017, -0.39866547774085226, 0.15628840459633947, -0.31405359371017444, 0.01494246392565615, 0.23879229790284573, 0.021594290775657797, 0.07220163357937161, 0.15295292291899815, -0.006623179271735032, -0.04207608721780536, -0.2927909090375418, 0.24932216342045543, 0.11476473004885894, 0.20315771071952493, 0.035739344455685246, 0.03427510037299191, -0.01248744610861382, -0.08195658565005835, -0.035697007647660726, -0.16183189260621422, 0.17382832100916215, 0.2572369759573656, 0.1863216787631459, 0.1407522626412923, -0.3930338534033474, -0.14021265012321665, 0.08714619703481302, 0.11504834634936689, 0.11737411315826808, -0.06482797087964547, -0.32855447455692816, 0.14685681629720526, -0.23009370061267606, -0.09530752013875719, -0.054544596391839575, -0.04732062336166992, -0.029292508959770203, -0.30702352084849466, 0.06246457003084395, -0.042770793606691504, 0.08282560985432663, -0.06179479222833727, -0.17626934929969995, -0.06402835034190074, 0.04713164072702913, 0.029988235044156146, 0.024204282227027064, 0.1021022763555212, -0.15144296725937986, -0.21050698675989063, 0.37486388961620193, -0.08086514186716694, -0.14097763858187726, 0.1993607554160168, -0.12471503312425579, -0.18209916657275138, 0.11881716428872417, 0.21995151131961713, 0.07470239579732366, -0.21380067064755542, 0.13192131887241404, -0.0707654155763414, 0.23369481178986676, -0.042256400011383984, -0.0018594567937886015, 0.17684386019006043, 0.2660808854133767, -0.023059700239066255, 0.11003751655088682, -0.15493816964205026, -0.0638978807563784, -0.41898748797693236, -0.09117937618044808, -0.1290653028032359, -0.04741527756456943, -0.08361222964060075, -0.007572592510020032, 0.4152767853811383, 0.21089356897316655, 0.19968382186968536, 0.0730759376704501, 0.2873788104283021, 0.04989651932983714, 0.1302382105084903, 0.0836867110338062, 0.2749764261808356, 0.009626113549422692, 0.1419415047583992, -0.14079961048863718, -0.01579569744439248, -0.0018672850119936116] |
1,803.02205 | Code Review Comments: Language Matters | Recent research provides evidence that effective communication in
collaborative software development has significant impact on the software
development lifecycle. Although related qualitative and quantitative studies
point out textual characteristics of well-formed messages, the underlying
semantics of the intertwined linguistic structures still remain largely
misinterpreted or ignored. Especially, regarding quality of code reviews the
importance of thorough feedback, and explicit rationale is often mentioned but
rarely linked with related linguistic features. As a first step towards
addressing this shortcoming, we propose grounding these studies on theories of
linguistics. We particularly focus on linguistic structures of coherent speech
and explain how they can be exploited in practice. We reflect on related
approaches and examine through a preliminary study on four open source
projects, possible links between existing findings and the directions we
suggest for detecting textual features of useful code reviews.
| cs.SE cs.CL | recent research provides evidence that effective communication in collaborative software development has significant impact on the software development lifecycle although related qualitative and quantitative studies point out textual characteristics of wellformed messages the underlying semantics of the intertwined linguistic structures still remain largely misinterpreted or ignored especially regarding quality of code reviews the importance of thorough feedback and explicit rationale is often mentioned but rarely linked with related linguistic features as a first step towards addressing this shortcoming we propose grounding these studies on theories of linguistics we particularly focus on linguistic structures of coherent speech and explain how they can be exploited in practice we reflect on related approaches and examine through a preliminary study on four open source projects possible links between existing findings and the directions we suggest for detecting textual features of useful code reviews | [['recent', 'research', 'provides', 'evidence', 'that', 'effective', 'communication', 'in', 'collaborative', 'software', 'development', 'has', 'significant', 'impact', 'on', 'the', 'software', 'development', 'lifecycle', 'although', 'related', 'qualitative', 'and', 'quantitative', 'studies', 'point', 'out', 'textual', 'characteristics', 'of', 'wellformed', 'messages', 'the', 'underlying', 'semantics', 'of', 'the', 'intertwined', 'linguistic', 'structures', 'still', 'remain', 'largely', 'misinterpreted', 'or', 'ignored', 'especially', 'regarding', 'quality', 'of', 'code', 'reviews', 'the', 'importance', 'of', 'thorough', 'feedback', 'and', 'explicit', 'rationale', 'is', 'often', 'mentioned', 'but', 'rarely', 'linked', 'with', 'related', 'linguistic', 'features', 'as', 'a', 'first', 'step', 'towards', 'addressing', 'this', 'shortcoming', 'we', 'propose', 'grounding', 'these', 'studies', 'on', 'theories', 'of', 'linguistics', 'we', 'particularly', 'focus', 'on', 'linguistic', 'structures', 'of', 'coherent', 'speech', 'and', 'explain', 'how', 'they', 'can', 'be', 'exploited', 'in', 'practice', 'we', 'reflect', 'on', 'related', 'approaches', 'and', 'examine', 'through', 'a', 'preliminary', 'study', 'on', 'four', 'open', 'source', 'projects', 'possible', 'links', 'between', 'existing', 'findings', 'and', 'the', 'directions', 'we', 'suggest', 'for', 'detecting', 'textual', 'features', 'of', 'useful', 'code', 'reviews']] | [-0.11971389202622147, 0.02848284075492256, -0.060143603145969, 0.11862562892945122, -0.14896978546610679, -0.1408273880403462, 0.06896327834964978, 0.4523990798821981, -0.23785429272345074, -0.3020477716952542, 0.10138677366969022, -0.26755613478222234, -0.2068743251662755, 0.2124106023685082, -0.11698606811927244, 0.030087736629539258, 0.09275253968005129, 0.009816049656783827, -0.04015472415196475, -0.23676170603030447, 0.33251123776887176, 0.0918704475269472, 0.3425149496899342, 0.11376652191058069, 0.027089848203195942, -0.04422494423703002, -0.17684180545788125, -0.009709855815456015, -0.12223525458500635, 0.16970020710371717, 0.3777435063283971, 0.24517907462545113, 0.31999401069453937, -0.46168908156561766, -0.21741292336218648, 0.00747976939549013, 0.1894766306854272, 0.10508098682093857, -0.07350146682118903, -0.31163560818853997, 0.03646585571859367, -0.14289356148031226, -0.04895959377792168, -0.11932464244711823, -0.018593316626393325, -0.0018096544632407387, -0.11618359338009743, 0.018614968017586206, 0.09968969498370714, 0.15201248510291787, -0.028070145151360134, -0.1526179150577715, 0.0405881327071073, 0.18743434298461933, 0.10173299368772415, 0.01736628686131494, 0.12294363682727805, -0.16756924505265122, -0.16686998379396664, 0.3901791059606367, -0.007742652234038432, -0.183272561220881, 0.23572527260264958, -0.05195247860610311, -0.22750056189947204, 0.05348609823217656, 0.21640573004796673, 0.05262261017044778, -0.16817946041257475, 0.02468015418660981, 0.0035856583159041707, 0.21639980807110648, 0.0506383625140561, 0.0660202476445572, 0.28159429995249285, 0.20469673432027854, -0.03679247475865719, 0.12389160131804458, 0.012988860821083402, -0.10604158607721932, -0.2583803271191369, -0.11936212624691213, -0.10463232230964592, 0.005183232867782064, -0.026785998644869233, -0.14341751543349393, 0.4048429213785868, 0.24846067005205605, 0.15168974199499802, -0.020741863417432463, 0.30729558736943513, 0.007798131311809805, 0.0727873859096238, 0.041159346130200856, 0.17736643840049615, 0.03556794566001824, 0.128180874983961, -0.1716006827597647, 0.18632549080552144, -0.010349991948001687] |
1,803.02206 | Exploring and Experimenting with Shaping Designs for Next-Generation
Optical Communications | A class of circular 64-QAM that combines 'geometric' and 'probabilistic'
shaping aspects is presented. It is compared to square 64-QAM in back-to-back,
single-channel, and WDM transmission experiments. First, for the linear AWGN
channel model, it permits to operate close to the Shannon limits for a wide
range of signal-to-noise ratios. Second, WDM simulations over several hundreds
of kilometers show that the obtained signal-to-noise ratios are equivalent to -
or slightly exceed - those of probabilistic shaped 64-QAM. Third, for real-life
validation purpose, an experimental comparison with unshaped 64-QAM is
performed where 28% distance gains are recorded when using 19 channels at 54.2
GBd. This again is in line - or slightly exceeds - the gains generally obtained
with probabilistic shaping. Depending upon implementation requirements (core
forward-error correcting scheme for example), the investigated modulation
schemes may be key alternatives for next-generation optical systems.
| cs.IT math.IT | a class of circular 64qam that combines geometric and probabilistic shaping aspects is presented it is compared to square 64qam in backtoback singlechannel and wdm transmission experiments first for the linear awgn channel model it permits to operate close to the shannon limits for a wide range of signaltonoise ratios second wdm simulations over several hundreds of kilometers show that the obtained signaltonoise ratios are equivalent to or slightly exceed those of probabilistic shaped 64qam third for reallife validation purpose an experimental comparison with unshaped 64qam is performed where 28 distance gains are recorded when using 19 channels at 542 gbd this again is in line or slightly exceeds the gains generally obtained with probabilistic shaping depending upon implementation requirements core forwarderror correcting scheme for example the investigated modulation schemes may be key alternatives for nextgeneration optical systems | [['a', 'class', 'of', 'circular', '64qam', 'that', 'combines', 'geometric', 'and', 'probabilistic', 'shaping', 'aspects', 'is', 'presented', 'it', 'is', 'compared', 'to', 'square', '64qam', 'in', 'backtoback', 'singlechannel', 'and', 'wdm', 'transmission', 'experiments', 'first', 'for', 'the', 'linear', 'awgn', 'channel', 'model', 'it', 'permits', 'to', 'operate', 'close', 'to', 'the', 'shannon', 'limits', 'for', 'a', 'wide', 'range', 'of', 'signaltonoise', 'ratios', 'second', 'wdm', 'simulations', 'over', 'several', 'hundreds', 'of', 'kilometers', 'show', 'that', 'the', 'obtained', 'signaltonoise', 'ratios', 'are', 'equivalent', 'to', 'or', 'slightly', 'exceed', 'those', 'of', 'probabilistic', 'shaped', '64qam', 'third', 'for', 'reallife', 'validation', 'purpose', 'an', 'experimental', 'comparison', 'with', 'unshaped', '64qam', 'is', 'performed', 'where', '28', 'distance', 'gains', 'are', 'recorded', 'when', 'using', '19', 'channels', 'at', '542', 'gbd', 'this', 'again', 'is', 'in', 'line', 'or', 'slightly', 'exceeds', 'the', 'gains', 'generally', 'obtained', 'with', 'probabilistic', 'shaping', 'depending', 'upon', 'implementation', 'requirements', 'core', 'forwarderror', 'correcting', 'scheme', 'for', 'example', 'the', 'investigated', 'modulation', 'schemes', 'may', 'be', 'key', 'alternatives', 'for', 'nextgeneration', 'optical', 'systems']] | [-0.13590890839628444, 0.06666098883558162, -0.021148910167276103, 0.044146927329205464, -0.01383842014964076, -0.22894041379913688, 0.034035985226459474, 0.4210989663336912, -0.22109502078830331, -0.3168266988089443, 0.10934873780681063, -0.2464571193744685, -0.08780882470444709, 0.2948576066275195, -0.07063793544522554, 0.07959474884125445, 0.08908371980288539, -0.0028969593265134354, -0.08069123717132902, -0.281216265451487, 0.2297276547651036, 0.145067456488808, 0.3096807046584191, 0.007463113555812912, 0.08692705965654897, 0.006424846991886507, -0.0374252830726513, -0.026117942694142676, -0.09689874337714897, 0.05451545729327178, 0.2596740465378389, 0.10215311373948403, 0.2117220513333661, -0.3495490826713596, -0.23056826957811913, 0.09597755521805822, 0.16666570929068047, 0.07224215124058875, -0.019382116688496393, -0.25044140544976445, 0.1471027358160084, -0.21671983421496724, -0.054595283843387944, -0.0015036833398314059, -0.006997464130214159, 0.06294885436342894, -0.3284686503609629, 0.05227890447080743, -0.0037335844649730816, 0.06773391705802709, -0.01934080000669844, -0.19489087673255068, 0.057166333867075, 0.07197596014673868, -0.06057675268781115, -0.02138730440967028, 0.12352347552465896, -0.06908112407182816, -0.12013116185350911, 0.3804362063849534, -0.05938388428488827, -0.14903471119317185, 0.16881064340797847, -0.09662326187759206, -0.07167045591041392, 0.19280165363190885, 0.17380933974029333, 0.07274768299733599, -0.1266608884349504, -0.014785761191624391, -0.00942902612049416, 0.24008222562058465, 0.13174197504101187, 0.08766605776896619, 0.18220595107624726, 0.185172929052277, 0.03272751493352479, 0.1188534845900047, -0.14776795167489437, -0.13905547273621988, -0.24502113130132575, -0.07183097507399709, -0.14727613738859477, -0.0062117560098514605, -0.0986444382804726, -0.06316373068219273, 0.3188304891194792, 0.1519717729331561, 0.15765135782176926, 0.11035538661509645, 0.335321046769673, 0.12403314279905264, 0.061684179097832435, 0.0633314273968015, 0.2735902836805284, 0.13717884712336262, 0.0949648170035157, -0.14644472782379456, 0.02437470651879583, -0.011945050970678205] |
1,803.02207 | Quantum Ground State Energies for Very Flat Potentials | An infinite sequence of potential well functions is considered. A trial
wavefunction is used with the Schr$\ddot{\text{o}}$dinger equation to obtain an
approximate ground state energy for each potential well function. We obtain an
expression that is exactly correct for the harmonic potential, has an
intuitively correct form for all of our potential well functions and can be
understood to be a partitioning of the ground state energy into two parts, one
kinetic and one potential.
| quant-ph | an infinite sequence of potential well functions is considered a trial wavefunction is used with the schrddottextodinger equation to obtain an approximate ground state energy for each potential well function we obtain an expression that is exactly correct for the harmonic potential has an intuitively correct form for all of our potential well functions and can be understood to be a partitioning of the ground state energy into two parts one kinetic and one potential | [['an', 'infinite', 'sequence', 'of', 'potential', 'well', 'functions', 'is', 'considered', 'a', 'trial', 'wavefunction', 'is', 'used', 'with', 'the', 'schrddottextodinger', 'equation', 'to', 'obtain', 'an', 'approximate', 'ground', 'state', 'energy', 'for', 'each', 'potential', 'well', 'function', 'we', 'obtain', 'an', 'expression', 'that', 'is', 'exactly', 'correct', 'for', 'the', 'harmonic', 'potential', 'has', 'an', 'intuitively', 'correct', 'form', 'for', 'all', 'of', 'our', 'potential', 'well', 'functions', 'and', 'can', 'be', 'understood', 'to', 'be', 'a', 'partitioning', 'of', 'the', 'ground', 'state', 'energy', 'into', 'two', 'parts', 'one', 'kinetic', 'and', 'one', 'potential']] | [-0.07925613418221474, 0.08009520772301282, -0.11162882796178261, 0.12454009951247523, -0.042373083451141914, -0.11432803920159737, -0.0026470637305950127, 0.3545715179045995, -0.27899427205324173, -0.2828916281461716, 0.07414116533473133, -0.27613843540350597, -0.11205250442028046, 0.18502635945177948, 0.02185032264639934, 0.06550861052703112, 0.037433673587317265, 0.11232184449831645, -0.019403569794570405, -0.20566490394373735, 0.3086454285805424, 0.030050948734084766, 0.21340827914575736, 0.107047333791852, 0.1204522246432801, 0.010405544731765986, 0.10953478705137969, 0.00022557374089956283, -0.08392859503985771, 0.059438088983297346, 0.22955803520977497, 0.13782094045852622, 0.28317124417051676, -0.4211264818658431, -0.21023385618696921, 0.13720211565494536, 0.1525857974588871, 0.16855389140546323, -0.03365551281409959, -0.27304983167598645, 0.04053248777985573, -0.19497453447896987, -0.1975802350292603, -0.13170396023740372, 0.00401507510493199, 0.051880045058205725, -0.31076980736106635, 0.06599271414180596, -0.01346591358849158, -0.03781050842255354, -0.15988086610411603, -0.16528639633208514, -0.024926866870373487, 0.20375887447347243, 0.010925996021057168, 0.11731196813906232, 0.04243075661982099, -0.13490226092437904, -0.0859646066185087, 0.3723744136095047, -0.06725130741794905, -0.29269271669288477, 0.15124610082556805, -0.06453586413835485, -0.06253043126314878, 0.11486499934146802, 0.09447050215055545, 0.10222854817907015, -0.1857759677246213, 0.055048317622082926, 0.009188623875379562, 0.17733926448971032, 0.011342845546702543, 0.020932756854842107, 0.19053257723649342, 0.1217876248434186, 0.10453011114150286, 0.17353626580598452, -0.033133493040998774, -0.10394694147631527, -0.32192987178762755, -0.2047981812308232, -0.25246590475396563, 0.040401826351881026, -0.059170290293404836, -0.21240187366803487, 0.4449508875204871, 0.06287631067757805, 0.2260800290107727, 0.026692001732687154, 0.2951011281212171, 0.24854995912096153, 0.047100643118222554, 0.03803482416085899, 0.2037323054485023, 0.09509080743106703, 0.012524307171503702, -0.1653004291684677, 0.03366793361182014, 0.07519607972353697] |
1,803.02208 | Discovering Underlying Plans Based on Shallow Models | Plan recognition aims to discover target plans (i.e., sequences of actions)
behind observed actions, with history plan libraries or domain models in hand.
Previous approaches either discover plans by maximally "matching" observed
actions to plan libraries, assuming target plans are from plan libraries, or
infer plans by executing domain models to best explain the observed actions,
assuming that complete domain models are available. In real world applications,
however, target plans are often not from plan libraries, and complete domain
models are often not available, since building complete sets of plans and
complete domain models are often difficult or expensive. In this paper we view
plan libraries as corpora and learn vector representations of actions using the
corpora, we then discover target plans based on the vector representations.
Specifically, we propose two approaches, DUP and RNNPlanner, to discover target
plans based on vector representations of actions. DUP explores the EM-style
framework to capture local contexts of actions and discover target plans by
optimizing the probability of target plans, while RNNPlanner aims to leverage
long-short term contexts of actions based on RNNs (recurrent neural networks)
framework to help recognize target plans. In the experiments, we empirically
show that our approaches are capable of discovering underlying plans that are
not from plan libraries, without requiring domain models provided. We
demonstrate the effectiveness of our approaches by comparing its performance to
traditional plan recognition approaches in three planning domains. We also
compare DUP and RNNPlanner to see their advantages and disadvantages.
| cs.AI | plan recognition aims to discover target plans ie sequences of actions behind observed actions with history plan libraries or domain models in hand previous approaches either discover plans by maximally matching observed actions to plan libraries assuming target plans are from plan libraries or infer plans by executing domain models to best explain the observed actions assuming that complete domain models are available in real world applications however target plans are often not from plan libraries and complete domain models are often not available since building complete sets of plans and complete domain models are often difficult or expensive in this paper we view plan libraries as corpora and learn vector representations of actions using the corpora we then discover target plans based on the vector representations specifically we propose two approaches dup and rnnplanner to discover target plans based on vector representations of actions dup explores the emstyle framework to capture local contexts of actions and discover target plans by optimizing the probability of target plans while rnnplanner aims to leverage longshort term contexts of actions based on rnns recurrent neural networks framework to help recognize target plans in the experiments we empirically show that our approaches are capable of discovering underlying plans that are not from plan libraries without requiring domain models provided we demonstrate the effectiveness of our approaches by comparing its performance to traditional plan recognition approaches in three planning domains we also compare dup and rnnplanner to see their advantages and disadvantages | [['plan', 'recognition', 'aims', 'to', 'discover', 'target', 'plans', 'ie', 'sequences', 'of', 'actions', 'behind', 'observed', 'actions', 'with', 'history', 'plan', 'libraries', 'or', 'domain', 'models', 'in', 'hand', 'previous', 'approaches', 'either', 'discover', 'plans', 'by', 'maximally', 'matching', 'observed', 'actions', 'to', 'plan', 'libraries', 'assuming', 'target', 'plans', 'are', 'from', 'plan', 'libraries', 'or', 'infer', 'plans', 'by', 'executing', 'domain', 'models', 'to', 'best', 'explain', 'the', 'observed', 'actions', 'assuming', 'that', 'complete', 'domain', 'models', 'are', 'available', 'in', 'real', 'world', 'applications', 'however', 'target', 'plans', 'are', 'often', 'not', 'from', 'plan', 'libraries', 'and', 'complete', 'domain', 'models', 'are', 'often', 'not', 'available', 'since', 'building', 'complete', 'sets', 'of', 'plans', 'and', 'complete', 'domain', 'models', 'are', 'often', 'difficult', 'or', 'expensive', 'in', 'this', 'paper', 'we', 'view', 'plan', 'libraries', 'as', 'corpora', 'and', 'learn', 'vector', 'representations', 'of', 'actions', 'using', 'the', 'corpora', 'we', 'then', 'discover', 'target', 'plans', 'based', 'on', 'the', 'vector', 'representations', 'specifically', 'we', 'propose', 'two', 'approaches', 'dup', 'and', 'rnnplanner', 'to', 'discover', 'target', 'plans', 'based', 'on', 'vector', 'representations', 'of', 'actions', 'dup', 'explores', 'the', 'emstyle', 'framework', 'to', 'capture', 'local', 'contexts', 'of', 'actions', 'and', 'discover', 'target', 'plans', 'by', 'optimizing', 'the', 'probability', 'of', 'target', 'plans', 'while', 'rnnplanner', 'aims', 'to', 'leverage', 'longshort', 'term', 'contexts', 'of', 'actions', 'based', 'on', 'rnns', 'recurrent', 'neural', 'networks', 'framework', 'to', 'help', 'recognize', 'target', 'plans', 'in', 'the', 'experiments', 'we', 'empirically', 'show', 'that', 'our', 'approaches', 'are', 'capable', 'of', 'discovering', 'underlying', 'plans', 'that', 'are', 'not', 'from', 'plan', 'libraries', 'without', 'requiring', 'domain', 'models', 'provided', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approaches', 'by', 'comparing', 'its', 'performance', 'to', 'traditional', 'plan', 'recognition', 'approaches', 'in', 'three', 'planning', 'domains', 'we', 'also', 'compare', 'dup', 'and', 'rnnplanner', 'to', 'see', 'their', 'advantages', 'and', 'disadvantages']] | [0.000706139267591933, 0.03615104640374028, -0.06827832457914888, 0.11110483419276428, -0.14681440217397834, -0.1293783379315214, 0.07026236316684996, 0.5188718622301512, -0.259913848984519, -0.34627963767880915, 0.11873591533222948, -0.2750240842725041, -0.13779677531629167, 0.19407665705815455, -0.14484897601231556, 0.07610155531909385, 0.1403603191536508, 0.05093370108235522, -0.062226010680666216, -0.28052030143380796, 0.3138304747818302, 0.023938105328513783, 0.3212044012444358, -0.01486883920557073, 0.11410491012398771, -0.01170645525272717, -0.09644597523745813, -0.0299745263109504, -0.06899997621850909, 0.16677482110949662, 0.3341821951610835, 0.27155095901644716, 0.261016018497324, -0.4608927018759463, -0.18113756472780276, 0.10693907686452633, 0.09266193412425305, 0.09402786042477167, -0.007748838477798168, -0.33358457305577965, 0.0826072666213399, -0.16309253522760503, -0.05463178772177653, -0.16502034909804522, -0.007328236190911368, 0.045447211542217675, -0.27682290943377175, -0.04482599400629116, 0.0753858708927355, 0.05264065123581693, -0.10951351776515485, -0.127966528553855, 0.00469892340625527, 0.20284429199801313, 0.05442193386343832, 0.05386623225235173, 0.14360565491970856, -0.1853967106463727, -0.24477389906033467, 0.3822189036357077, -0.001333829607467661, -0.24753877025890364, 0.22905354142124926, -0.09776600988709974, -0.10796326460592026, 0.06554732412412793, 0.2386937748522004, 0.17688420551040998, -0.20918009270676355, 0.050534887831546894, 0.027468767945620757, 0.1659473548075354, 0.042769485169282626, -0.03052378293156986, 0.23152945101589176, 0.21695380462597497, 0.03705978599143203, 0.10033740060072135, -0.0394745289285852, -0.0814130529534493, -0.23949268068137922, -0.06046062761442623, -0.10682772779139701, -0.05253271349718246, -0.004521112259430716, -0.09294120986694479, 0.3666946704618195, 0.2415538979769658, 0.14788039431149358, 0.12202033032861119, 0.3225170019203382, -0.03029687172471195, 0.11020892818867481, 0.1133919005519767, 0.1133574324665659, -0.045708644375401106, 0.09590814818547065, -0.15408913210988318, 0.1067406048909629, 0.03385871793011482] |
1,803.02209 | Fully Convolutional Grasp Detection Network with Oriented Anchor Box | In this paper, we present a real-time approach to predict multiple grasping
poses for a parallel-plate robotic gripper using RGB images. A model with
oriented anchor box mechanism is proposed and a new matching strategy is used
during the training process. An end-to-end fully convolutional neural network
is employed in our work. The network consists of two parts: the feature
extractor and multi-grasp predictor. The feature extractor is a deep
convolutional neural network. The multi-grasp predictor regresses grasp
rectangles from predefined oriented rectangles, called oriented anchor boxes,
and classifies the rectangles into graspable and ungraspable. On the standard
Cornell Grasp Dataset, our model achieves an accuracy of 97.74% and 96.61% on
image-wise split and object-wise split respectively, and outperforms the latest
state-of-the-art approach by 1.74% on image-wise split and 0.51% on object-wise
split.
| cs.RO cs.CV | in this paper we present a realtime approach to predict multiple grasping poses for a parallelplate robotic gripper using rgb images a model with oriented anchor box mechanism is proposed and a new matching strategy is used during the training process an endtoend fully convolutional neural network is employed in our work the network consists of two parts the feature extractor and multigrasp predictor the feature extractor is a deep convolutional neural network the multigrasp predictor regresses grasp rectangles from predefined oriented rectangles called oriented anchor boxes and classifies the rectangles into graspable and ungraspable on the standard cornell grasp dataset our model achieves an accuracy of 9774 and 9661 on imagewise split and objectwise split respectively and outperforms the latest stateoftheart approach by 174 on imagewise split and 051 on objectwise split | [['in', 'this', 'paper', 'we', 'present', 'a', 'realtime', 'approach', 'to', 'predict', 'multiple', 'grasping', 'poses', 'for', 'a', 'parallelplate', 'robotic', 'gripper', 'using', 'rgb', 'images', 'a', 'model', 'with', 'oriented', 'anchor', 'box', 'mechanism', 'is', 'proposed', 'and', 'a', 'new', 'matching', 'strategy', 'is', 'used', 'during', 'the', 'training', 'process', 'an', 'endtoend', 'fully', 'convolutional', 'neural', 'network', 'is', 'employed', 'in', 'our', 'work', 'the', 'network', 'consists', 'of', 'two', 'parts', 'the', 'feature', 'extractor', 'and', 'multigrasp', 'predictor', 'the', 'feature', 'extractor', 'is', 'a', 'deep', 'convolutional', 'neural', 'network', 'the', 'multigrasp', 'predictor', 'regresses', 'grasp', 'rectangles', 'from', 'predefined', 'oriented', 'rectangles', 'called', 'oriented', 'anchor', 'boxes', 'and', 'classifies', 'the', 'rectangles', 'into', 'graspable', 'and', 'ungraspable', 'on', 'the', 'standard', 'cornell', 'grasp', 'dataset', 'our', 'model', 'achieves', 'an', 'accuracy', 'of', '9774', 'and', '9661', 'on', 'imagewise', 'split', 'and', 'objectwise', 'split', 'respectively', 'and', 'outperforms', 'the', 'latest', 'stateoftheart', 'approach', 'by', '174', 'on', 'imagewise', 'split', 'and', '051', 'on', 'objectwise', 'split']] | [-0.0627864422634817, -0.04781625603052537, -0.05582285175959651, 0.005355868482799381, -0.08470421439717309, -0.20884277812885838, 0.02778116004147495, 0.4883335039592706, -0.2260067020363819, -0.3330769621086522, 0.03420749673655687, -0.2655581844272092, -0.15862516566681173, 0.15225026400473254, -0.15523407183936797, 0.060554595563847284, 0.1298541263426439, 0.024535706941969694, -0.0031363640088014877, -0.28273558454820885, 0.30718198960217147, 0.005053846242327171, 0.3464406289805013, -0.014261868443841544, 0.21106135178930485, 0.005676751318745888, -0.011182878907017696, -0.003955418189378598, -0.035516087986672155, 0.18224632519189843, 0.24381307816813486, 0.15163461945664425, 0.2704731977473085, -0.39098259434103966, -0.1528788854238183, 0.01890508675804505, 0.13454180968065674, 0.060913265826037295, 0.006909393028427775, -0.3595784003094125, 0.09369993241360554, -0.16087317832817252, 0.04055181366678041, -0.0648729272509137, -0.04564491710536039, -0.058351437862102805, -0.3180570598548422, -0.012367144631795012, 0.08239260759258356, 0.045734177981145104, -0.07702427389315114, -0.11782013801947379, 0.016569272915904338, 0.1620366950197002, -0.08870536343109471, 0.1373136967134017, 0.14457710846685445, -0.1500530836620153, -0.12927641486749053, 0.3425696815435703, -0.04502072549926547, -0.19820100862819415, 0.14850659100338817, 0.03568984812210636, -0.11311005161931882, 0.10556586826435076, 0.24487877336975475, 0.13417183835632526, -0.14949394482402847, -0.0042638778399962645, -0.08030233086050989, 0.18984837148051995, 0.05093984661193995, -0.08733901805602587, 0.2056800867932347, 0.3058800168478718, 0.023472891085279675, 0.1764557525204369, -0.20257792555941986, -0.04269848746749071, -0.23775629068483026, -0.09957768676014474, -0.1877631926909089, -0.06710435575805604, -0.12261099978976954, -0.16091279310819048, 0.42726042934048636, 0.17821189435198903, 0.25743780004648636, 0.14097179803424156, 0.36160544642748743, -0.019221942547637108, 0.15531169694239416, 0.10988242712874825, 0.18585785131973143, -0.0026954707958234043, 0.05883589609461174, -0.13079064015764744, 0.05707059461050309, 0.13853557127742813] |
1,803.0221 | Special solutions to a non-linear coarsening model with local
interactions | We consider a class of mass transfer models on a one-dimensional lattice with
nearest-neighbour interactions. The evolution is given by the discrete backward
fast diffusion equation, with exponent $\beta$ in the regime $(-\infty,0) \cup
(0,1]$. Sites with mass zero are deleted from the system, which leads to a
coarsening of the mass distribution. The rate of coarsening suggested by
scaling is $t^\frac{1}{1-\beta}$ if $\beta \neq 1$ and exponential if $\beta =
1$. We prove that such solutions actually exist by an analysis of the
time-reversed evolution. In particular we establish positivity estimates and
long-time equililibrium properties for discrete parabolic equations with
bounded initial data.
| math-ph math.AP math.MP | we consider a class of mass transfer models on a onedimensional lattice with nearestneighbour interactions the evolution is given by the discrete backward fast diffusion equation with exponent beta in the regime infty0 cup 01 sites with mass zero are deleted from the system which leads to a coarsening of the mass distribution the rate of coarsening suggested by scaling is tfrac11beta if beta neq 1 and exponential if beta 1 we prove that such solutions actually exist by an analysis of the timereversed evolution in particular we establish positivity estimates and longtime equililibrium properties for discrete parabolic equations with bounded initial data | [['we', 'consider', 'a', 'class', 'of', 'mass', 'transfer', 'models', 'on', 'a', 'onedimensional', 'lattice', 'with', 'nearestneighbour', 'interactions', 'the', 'evolution', 'is', 'given', 'by', 'the', 'discrete', 'backward', 'fast', 'diffusion', 'equation', 'with', 'exponent', 'beta', 'in', 'the', 'regime', 'infty0', 'cup', '01', 'sites', 'with', 'mass', 'zero', 'are', 'deleted', 'from', 'the', 'system', 'which', 'leads', 'to', 'a', 'coarsening', 'of', 'the', 'mass', 'distribution', 'the', 'rate', 'of', 'coarsening', 'suggested', 'by', 'scaling', 'is', 'tfrac11beta', 'if', 'beta', 'neq', '1', 'and', 'exponential', 'if', 'beta', '1', 'we', 'prove', 'that', 'such', 'solutions', 'actually', 'exist', 'by', 'an', 'analysis', 'of', 'the', 'timereversed', 'evolution', 'in', 'particular', 'we', 'establish', 'positivity', 'estimates', 'and', 'longtime', 'equililibrium', 'properties', 'for', 'discrete', 'parabolic', 'equations', 'with', 'bounded', 'initial', 'data']] | [-0.12170899806700942, 0.1826497888952404, -0.0652503177165146, 0.046417005558378334, -0.00503454670496746, -0.17351750705372726, 0.018765870028747116, 0.344959769988119, -0.3234850703784735, -0.2285301414419814, 0.12068654523037448, -0.2926050439698271, -0.09129187188083583, 0.15148835142355155, 0.007800223029190951, 0.06670733457338987, 0.059603859107978274, 0.03048584633967885, -0.07943196549301616, -0.21371028827973595, 0.35859957601215764, -0.020903231525369506, 0.22109238027899278, 0.02088145505968887, 0.09003441713607437, -0.011525567125363073, 0.00851393581856743, -0.039907824118981264, -0.23627439106500184, 0.02357480519708813, 0.14880772816677293, 0.05764725295098332, 0.2697027038118922, -0.3717303714982354, -0.19259439783152377, 0.13100844120957178, 0.17339281591651315, 0.05685546088129245, -0.07900949349825151, -0.24235729082017252, 0.08695328905071953, -0.15177041519027534, -0.18763345323668995, -0.011994012668359987, 0.07189025921691762, 0.10379072948183754, -0.3371340949641596, 0.1488986770428791, 0.09610424601094852, 0.018817718670989324, -0.07785831509609845, -0.07258611809033531, -0.038291351454756636, 0.07953316936416939, 0.06176315669067167, 0.010480910931520237, 0.06674065790830715, -0.12316314129177297, -0.09407840322905986, 0.3467540867755761, -0.08785307813795412, -0.2468254974868038, 0.15863007419549002, -0.20261031116063863, -0.11564404072037132, 0.12059501049081141, 0.11377876371895608, 0.11157935890507432, -0.12207184599177671, 0.1388326123492829, -0.03422868387349466, 0.17728987434564278, 0.0481238077800389, -0.03692046918509768, 0.13872033887828636, 0.1581767256680581, 0.10014217168480011, 0.09659183464280449, -0.06442864039580863, -0.13104874126170532, -0.31529500313324504, -0.12550801134640627, -0.18189434987483638, 0.13550859565344076, -0.1316675490715269, -0.17232880102802473, 0.3362244293554732, 0.09232597957171573, 0.22010325082568544, 0.11365235351731466, 0.18404800006382094, 0.18819211356775226, 0.004273593508739873, 0.0975891700599286, 0.16998260391710124, 0.1270213264967361, 0.08686179576423203, -0.23905621146458192, 0.06556812742964761, 0.12261118548550519] |
1,803.02211 | PIV of swirling flow in a conical pipe with vibrating wall | Swirling flows in conical pipe can be found in a number of industrial
processes, such as hydrocylone, separator and rotating machinery. It has been
found that wall oscillations can reduce the drag in water channel and pipe
flows, but there is no study of a swirling flow combined with a vibrating wall
in conical pipes, though there are many applications of such combination in
engineering processes. A two-dimensional particle image velocimetry (PIV) is
used to measure the swirling flow field in a water conical pipe subjected to a
periodic vibrating wall for a Reynolds number 3800. The flow velocity
statistics are studied under different vibration frequencies corresponding to
Strouhal numbers from 60 to 242. The instantaneous axial and vertical velocity
in one vibrating period, the mean velocities, and Reynolds stresses were
obtained. The results show the existence of an intermediary recirculation cell
in the middle of the pipe. They also show that the vibration improves the
symmetry for the swirling flow while decreasing dramatically the velocity
fluctuation.
| physics.flu-dyn physics.app-ph | swirling flows in conical pipe can be found in a number of industrial processes such as hydrocylone separator and rotating machinery it has been found that wall oscillations can reduce the drag in water channel and pipe flows but there is no study of a swirling flow combined with a vibrating wall in conical pipes though there are many applications of such combination in engineering processes a twodimensional particle image velocimetry piv is used to measure the swirling flow field in a water conical pipe subjected to a periodic vibrating wall for a reynolds number 3800 the flow velocity statistics are studied under different vibration frequencies corresponding to strouhal numbers from 60 to 242 the instantaneous axial and vertical velocity in one vibrating period the mean velocities and reynolds stresses were obtained the results show the existence of an intermediary recirculation cell in the middle of the pipe they also show that the vibration improves the symmetry for the swirling flow while decreasing dramatically the velocity fluctuation | [['swirling', 'flows', 'in', 'conical', 'pipe', 'can', 'be', 'found', 'in', 'a', 'number', 'of', 'industrial', 'processes', 'such', 'as', 'hydrocylone', 'separator', 'and', 'rotating', 'machinery', 'it', 'has', 'been', 'found', 'that', 'wall', 'oscillations', 'can', 'reduce', 'the', 'drag', 'in', 'water', 'channel', 'and', 'pipe', 'flows', 'but', 'there', 'is', 'no', 'study', 'of', 'a', 'swirling', 'flow', 'combined', 'with', 'a', 'vibrating', 'wall', 'in', 'conical', 'pipes', 'though', 'there', 'are', 'many', 'applications', 'of', 'such', 'combination', 'in', 'engineering', 'processes', 'a', 'twodimensional', 'particle', 'image', 'velocimetry', 'piv', 'is', 'used', 'to', 'measure', 'the', 'swirling', 'flow', 'field', 'in', 'a', 'water', 'conical', 'pipe', 'subjected', 'to', 'a', 'periodic', 'vibrating', 'wall', 'for', 'a', 'reynolds', 'number', '3800', 'the', 'flow', 'velocity', 'statistics', 'are', 'studied', 'under', 'different', 'vibration', 'frequencies', 'corresponding', 'to', 'strouhal', 'numbers', 'from', '60', 'to', '242', 'the', 'instantaneous', 'axial', 'and', 'vertical', 'velocity', 'in', 'one', 'vibrating', 'period', 'the', 'mean', 'velocities', 'and', 'reynolds', 'stresses', 'were', 'obtained', 'the', 'results', 'show', 'the', 'existence', 'of', 'an', 'intermediary', 'recirculation', 'cell', 'in', 'the', 'middle', 'of', 'the', 'pipe', 'they', 'also', 'show', 'that', 'the', 'vibration', 'improves', 'the', 'symmetry', 'for', 'the', 'swirling', 'flow', 'while', 'decreasing', 'dramatically', 'the', 'velocity', 'fluctuation']] | [-0.18108803797015324, 0.21353124519987157, -0.0943075803863109, 0.0005410246604335416, -0.037771009615656125, -0.09241120546708355, -0.04711880816002264, 0.36571238150663044, -0.2822601383675383, -0.2777366585333843, 0.11668998927596104, -0.24580381437504933, -0.06508458654833846, 0.2506465795176407, -0.08443188023226089, 0.09369344359084246, 0.09363043238128345, 0.04443110528974289, 0.018639357019277537, -0.1169330792400582, 0.21228606840427292, 0.0015387583779260874, 0.3464942874039063, 0.05081512466253971, 0.08359626972071647, -0.07828746578685153, -0.0016195521031082776, 0.10433135909120922, -0.1879994093651914, 0.023820515144167536, 0.20136936779515482, -0.007625980701028223, 0.23060169664817493, -0.4606420397534069, -0.2532752209444003, 0.04318192497972982, 0.16627189477187504, 0.10934056399724269, -0.055862086771774185, -0.22658984057313528, 0.07541567143277232, -0.15453509616115726, -0.169505809400096, -0.007733565345630947, 0.05784661845228332, 0.07814506708233371, -0.22643221428348537, 0.12232493405094993, 0.04860936803743243, 0.15013174882091312, -0.05631912130924189, -0.06595562032637108, -0.10416381054905703, 0.1226304789040103, 0.10633499778846436, 0.037256104297969626, 0.20833136180152062, -0.18435558807721966, -0.05037596682507365, 0.40717717493513983, -0.06903942907509585, -0.23656489145212684, 0.20714082234821013, -0.17481010950854922, -0.03603052864614201, 0.2024691778302462, 0.19353598673794284, 0.04900137978572264, -0.09468820261353829, -0.0379057009942852, -0.10090152833453682, 0.15126145547550418, 0.18705058506274796, -0.08805766998487244, 0.21523392666131258, 0.15564629987600337, 0.08653777542472144, 0.16072189378873333, -0.17337695239897233, -0.07228983713717885, -0.2656626239158101, -0.16057569421659482, -0.14143827717459526, 0.0369424390752452, -0.06213480730068376, -0.17117311000397586, 0.34740729226607336, 0.06544082704931498, 0.1812945303159306, -0.02234896809333958, 0.2908246108521539, 0.0606641901274077, 0.0899193230684158, 0.13741703630716162, 0.28398718886184, 0.18936994200970708, 0.19093172668047384, -0.24741406486711903, -0.006139856578041631, 0.03814144240950335] |
1,803.02212 | Heavy neutral fermions at the high-luminosity LHC | Long-lived light particles (LLLPs) appear in many extensions of the standard
model. LLLPs are usually motivated by the observed small neutrino masses, by
dark matter or both. Typical examples for fermionic LLLPs (a.k.a. heavy neutral
fermions, HNFs) are sterile neutrinos or the lightest neutralino in R-parity
violating supersymmetry. The high luminosity LHC is expected to deliver up to
3/ab of data. Searches for LLLPs in dedicated experiments at the LHC could then
probe the parameter space of LLLP models with unprecedented sensitivity. Here,
we compare the prospects of several recent experimental proposals, FASER,
CODEX-b and MATHUSLA, to search for HNFs and discuss their relative merits.
| hep-ph | longlived light particles lllps appear in many extensions of the standard model lllps are usually motivated by the observed small neutrino masses by dark matter or both typical examples for fermionic lllps aka heavy neutral fermions hnfs are sterile neutrinos or the lightest neutralino in rparity violating supersymmetry the high luminosity lhc is expected to deliver up to 3ab of data searches for lllps in dedicated experiments at the lhc could then probe the parameter space of lllp models with unprecedented sensitivity here we compare the prospects of several recent experimental proposals faser codexb and mathusla to search for hnfs and discuss their relative merits | [['longlived', 'light', 'particles', 'lllps', 'appear', 'in', 'many', 'extensions', 'of', 'the', 'standard', 'model', 'lllps', 'are', 'usually', 'motivated', 'by', 'the', 'observed', 'small', 'neutrino', 'masses', 'by', 'dark', 'matter', 'or', 'both', 'typical', 'examples', 'for', 'fermionic', 'lllps', 'aka', 'heavy', 'neutral', 'fermions', 'hnfs', 'are', 'sterile', 'neutrinos', 'or', 'the', 'lightest', 'neutralino', 'in', 'rparity', 'violating', 'supersymmetry', 'the', 'high', 'luminosity', 'lhc', 'is', 'expected', 'to', 'deliver', 'up', 'to', '3ab', 'of', 'data', 'searches', 'for', 'lllps', 'in', 'dedicated', 'experiments', 'at', 'the', 'lhc', 'could', 'then', 'probe', 'the', 'parameter', 'space', 'of', 'lllp', 'models', 'with', 'unprecedented', 'sensitivity', 'here', 'we', 'compare', 'the', 'prospects', 'of', 'several', 'recent', 'experimental', 'proposals', 'faser', 'codexb', 'and', 'mathusla', 'to', 'search', 'for', 'hnfs', 'and', 'discuss', 'their', 'relative', 'merits']] | [-0.048722702387469605, 0.28200703759928447, -0.004423420746416713, 0.1801227252055049, -0.07546253840868863, -0.1727485732273915, 0.02262879254598934, 0.3314079073763703, -0.1782954052860777, -0.37244798165137094, 0.06800336117269651, -0.33402191336230874, 0.02611345811209713, 0.181423172700586, 0.024223987550403062, 0.10343691588003331, 0.053050761681963474, -0.017919943632128146, -0.06860411425049488, -0.2691817549348343, 0.24229579088009465, 0.08908508075042985, 0.1707780862628939, 0.07042137919835603, 0.03657029907089264, -0.0565365611904641, -0.07398101998170695, -0.09083077137368561, -0.09466300208049898, 0.07498627801676495, 0.21273243098336864, 0.11877996241897702, 0.13300711409717153, -0.4081701516238704, -0.15928459544934762, 0.22173478558229712, 0.1639951108798134, 0.07376828205843385, -0.12206814818693182, -0.3580492946337192, 0.06974110352950028, -0.2163601481857208, -0.13542716632274768, -0.09542914656720733, -0.03556264990989943, -0.0386161588898036, -0.2634901067850968, 0.06395104966045786, -0.0880838925028841, -0.020281562345469586, -0.017437425282528587, -0.16887050029338121, -0.034651923490365825, -0.054412314316813044, 0.14343271487282785, -0.04892689494926554, 0.15348055012873374, -0.217835859529889, -0.18465401262241918, 0.41428418063487, -0.09613324890960939, -0.11873214385167767, 0.23114425800695942, -0.15378756001770783, -0.15583423932548612, 0.11593932777087992, 0.19501187446383902, 0.07257270542546533, -0.14527507720944974, 0.14485997155805727, -0.046169841104599, 0.12702349247410893, 0.04759963665184422, 0.10228319694467175, 0.3226163053455261, 0.24290331253387892, 0.047145054616871324, 0.02775382435020919, -0.1208593591663185, -0.053871186320275925, -0.3530503053155441, -0.12772864226896602, -0.09048748018596178, -0.01868762704096018, -0.03749491740885647, -0.03225429183266197, 0.3716804747617481, 0.16160112175230795, 0.2234571925095784, 0.014567015564982565, 0.2933395381909437, 0.011286225671378465, 0.06506492979063366, -0.002063144511059643, 0.33030834877326226, 0.08680567918746909, 0.10269980374813223, -0.21228817481404313, -0.030774287829654686, 0.008660111244982826] |
1,803.02213 | On the Complexity of Two Dimensional Commuting Local Hamiltonians | The complexity of the commuting local Hamiltonians (CLH) problem still
remains a mystery after two decades of research of quantum Hamiltonian
complexity; it is only known to be contained in NP for few low parameters. Of
particular interest is the tightly related question of understanding whether
groundstates of CLHs can be generated by efficient quantum circuits. The two
problems touch upon conceptual, physical and computational questions, including
the centrality of non-commutation in quantum mechanics, quantum PCP and the
area law. It is natural to try to address first the more physical case of CLHs
embedded on a 2D lattice but this problem too remained open, apart from some
very specific cases. Here we consider a wide class of two dimensional CLH
instances; these are $k$-local CLHs, for any constant $k$; they are defined on
qubits set on the edges of any surface complex, where we require that this
surface complex is not too far from being "Euclidean". Each vertex and each
face can be associated with an arbitrary term (as long as the terms commute).
We show that this class is in NP, and moreover that the groundstates have an
efficient quantum circuit that prepares them. This result subsumes that of
Schuch [2011] which regarded the special case of $4$-local Hamiltonians on a
grid with qubits, and by that it removes the mysterious feature of Schuch's
proof which showed containment in NP without providing a quantum circuit for
the groundstate and considerably generalizes it. We believe this work and the
tools we develop make a significant step towards showing that 2D CLHs are in
NP.
| quant-ph | the complexity of the commuting local hamiltonians clh problem still remains a mystery after two decades of research of quantum hamiltonian complexity it is only known to be contained in np for few low parameters of particular interest is the tightly related question of understanding whether groundstates of clhs can be generated by efficient quantum circuits the two problems touch upon conceptual physical and computational questions including the centrality of noncommutation in quantum mechanics quantum pcp and the area law it is natural to try to address first the more physical case of clhs embedded on a 2d lattice but this problem too remained open apart from some very specific cases here we consider a wide class of two dimensional clh instances these are klocal clhs for any constant k they are defined on qubits set on the edges of any surface complex where we require that this surface complex is not too far from being euclidean each vertex and each face can be associated with an arbitrary term as long as the terms commute we show that this class is in np and moreover that the groundstates have an efficient quantum circuit that prepares them this result subsumes that of schuch 2011 which regarded the special case of 4local hamiltonians on a grid with qubits and by that it removes the mysterious feature of schuchs proof which showed containment in np without providing a quantum circuit for the groundstate and considerably generalizes it we believe this work and the tools we develop make a significant step towards showing that 2d clhs are in np | [['the', 'complexity', 'of', 'the', 'commuting', 'local', 'hamiltonians', 'clh', 'problem', 'still', 'remains', 'a', 'mystery', 'after', 'two', 'decades', 'of', 'research', 'of', 'quantum', 'hamiltonian', 'complexity', 'it', 'is', 'only', 'known', 'to', 'be', 'contained', 'in', 'np', 'for', 'few', 'low', 'parameters', 'of', 'particular', 'interest', 'is', 'the', 'tightly', 'related', 'question', 'of', 'understanding', 'whether', 'groundstates', 'of', 'clhs', 'can', 'be', 'generated', 'by', 'efficient', 'quantum', 'circuits', 'the', 'two', 'problems', 'touch', 'upon', 'conceptual', 'physical', 'and', 'computational', 'questions', 'including', 'the', 'centrality', 'of', 'noncommutation', 'in', 'quantum', 'mechanics', 'quantum', 'pcp', 'and', 'the', 'area', 'law', 'it', 'is', 'natural', 'to', 'try', 'to', 'address', 'first', 'the', 'more', 'physical', 'case', 'of', 'clhs', 'embedded', 'on', 'a', '2d', 'lattice', 'but', 'this', 'problem', 'too', 'remained', 'open', 'apart', 'from', 'some', 'very', 'specific', 'cases', 'here', 'we', 'consider', 'a', 'wide', 'class', 'of', 'two', 'dimensional', 'clh', 'instances', 'these', 'are', 'klocal', 'clhs', 'for', 'any', 'constant', 'k', 'they', 'are', 'defined', 'on', 'qubits', 'set', 'on', 'the', 'edges', 'of', 'any', 'surface', 'complex', 'where', 'we', 'require', 'that', 'this', 'surface', 'complex', 'is', 'not', 'too', 'far', 'from', 'being', 'euclidean', 'each', 'vertex', 'and', 'each', 'face', 'can', 'be', 'associated', 'with', 'an', 'arbitrary', 'term', 'as', 'long', 'as', 'the', 'terms', 'commute', 'we', 'show', 'that', 'this', 'class', 'is', 'in', 'np', 'and', 'moreover', 'that', 'the', 'groundstates', 'have', 'an', 'efficient', 'quantum', 'circuit', 'that', 'prepares', 'them', 'this', 'result', 'subsumes', 'that', 'of', 'schuch', '2011', 'which', 'regarded', 'the', 'special', 'case', 'of', '4local', 'hamiltonians', 'on', 'a', 'grid', 'with', 'qubits', 'and', 'by', 'that', 'it', 'removes', 'the', 'mysterious', 'feature', 'of', 'schuchs', 'proof', 'which', 'showed', 'containment', 'in', 'np', 'without', 'providing', 'a', 'quantum', 'circuit', 'for', 'the', 'groundstate', 'and', 'considerably', 'generalizes', 'it', 'we', 'believe', 'this', 'work', 'and', 'the', 'tools', 'we', 'develop', 'make', 'a', 'significant', 'step', 'towards', 'showing', 'that', '2d', 'clhs', 'are', 'in', 'np']] | [-0.10426982754942755, 0.1385478081852811, -0.030825298153333194, 0.05607722172485167, -0.06306277676698759, -0.19814590715895627, 0.030603621081819667, 0.3696445202995234, -0.2725678625328196, -0.30010773687275083, 0.09199197510504413, -0.24857357761001514, -0.15676912782404515, 0.2247459267042595, -0.08944515633383168, 0.06297741422584309, 0.06894225339900226, 0.038482467223577316, -0.04931155784999355, -0.2676956001762478, 0.32475141932626206, -0.0043273306840973845, 0.207704245516291, 0.08015423019675232, 0.07784869122311815, -0.007485793245412438, 0.026543310823635275, 0.04302798120802123, -0.1003045878135757, 0.12408637421633088, 0.2865958545420973, 0.1312733965700151, 0.25891372643300964, -0.4277599815577837, -0.2133695784110206, 0.12153828034189863, 0.12943469115731995, 0.14129068859664454, -0.029728749601931562, -0.2349140960954215, 0.08318694244860493, -0.13000213892113788, -0.10222613963988104, -0.06822856961401137, 0.041391548775278654, -0.03554933825472213, -0.1959097658178257, 0.028457563588189544, 0.12404030042643595, 0.03447994271662968, -0.007119647476942996, -0.1076452937430368, 0.039574872294462195, 0.13237352141326664, 0.001102049085436005, 0.045423181719974906, 0.07923334254172297, -0.13115269217573178, -0.13329448459229168, 0.40955089425085156, 0.02523657294143105, -0.21094497251733144, 0.20184117817063993, -0.10664201301046228, -0.1775251819560205, 0.08703469677396361, 0.11649106559699103, 0.12192865354795998, -0.13375822467487733, 0.14009471926498246, -0.08062893588749961, 0.16837804472493365, 0.05232642143644847, 0.06152790732759954, 0.18377343788280912, 0.12594398416184202, 0.11383321666370239, 0.14273121991623122, -0.01617717933305628, -0.12322365832052955, -0.2970199260206623, -0.17073598318429573, -0.21342160097565074, 0.10454319348610548, -0.04297727760944368, -0.18407790683110364, 0.40422017225739726, 0.1372443995639466, 0.21088038653469438, 0.033269753008689874, 0.2546994145177589, 0.1072688056720898, 0.07110119429381408, 0.08466159025089857, 0.2119345910131144, 0.0944116845183103, 0.044699691010297825, -0.19211566440746872, 0.06417700989378033, 0.054414592214099326] |
1,803.02214 | Sampled-data reachability analysis using sensitivity and
mixed-monotonicity | This paper over-approximates the reachable sets of a continuous-time
uncertain system using the sensitivity of its trajectories with respect to
initial conditions and uncertain parameters. We first prove the equivalence
between an existing over-approximation result based on the sign-stability of
the sensitivity matrices and a discrete-time approach relying on a
mixed-monotonicity property. We then present a new over-approximation result
which scales at worst linearly with the state dimension and is applicable to
any continuous-time system with bounded sensitivity. Finally, we provide a
simulation-based approach to estimate these bounds through sampling and
falsification. The results are illustrated with numerical examples on traffic
networks and satellite orbits.
| cs.SY | this paper overapproximates the reachable sets of a continuoustime uncertain system using the sensitivity of its trajectories with respect to initial conditions and uncertain parameters we first prove the equivalence between an existing overapproximation result based on the signstability of the sensitivity matrices and a discretetime approach relying on a mixedmonotonicity property we then present a new overapproximation result which scales at worst linearly with the state dimension and is applicable to any continuoustime system with bounded sensitivity finally we provide a simulationbased approach to estimate these bounds through sampling and falsification the results are illustrated with numerical examples on traffic networks and satellite orbits | [['this', 'paper', 'overapproximates', 'the', 'reachable', 'sets', 'of', 'a', 'continuoustime', 'uncertain', 'system', 'using', 'the', 'sensitivity', 'of', 'its', 'trajectories', 'with', 'respect', 'to', 'initial', 'conditions', 'and', 'uncertain', 'parameters', 'we', 'first', 'prove', 'the', 'equivalence', 'between', 'an', 'existing', 'overapproximation', 'result', 'based', 'on', 'the', 'signstability', 'of', 'the', 'sensitivity', 'matrices', 'and', 'a', 'discretetime', 'approach', 'relying', 'on', 'a', 'mixedmonotonicity', 'property', 'we', 'then', 'present', 'a', 'new', 'overapproximation', 'result', 'which', 'scales', 'at', 'worst', 'linearly', 'with', 'the', 'state', 'dimension', 'and', 'is', 'applicable', 'to', 'any', 'continuoustime', 'system', 'with', 'bounded', 'sensitivity', 'finally', 'we', 'provide', 'a', 'simulationbased', 'approach', 'to', 'estimate', 'these', 'bounds', 'through', 'sampling', 'and', 'falsification', 'the', 'results', 'are', 'illustrated', 'with', 'numerical', 'examples', 'on', 'traffic', 'networks', 'and', 'satellite', 'orbits']] | [-0.1047341882591494, 0.05672896583690509, -0.08918891789373727, 0.03599098217339885, -0.04773448743015671, -0.11742521050977163, 0.10185771962838211, 0.35907408992688244, -0.27109656448010355, -0.2869580243294387, 0.1747292215788128, -0.24760028189764574, -0.14485239544536363, 0.24496139908352724, -0.09022426026953886, 0.11869796268281509, 0.11369818990799384, 0.02919858630411909, -0.08620842664430921, -0.2649672814967254, 0.3487917127248903, 0.044597761472687125, 0.2230079633994207, 0.026361600616767716, 0.15814074159537156, -0.013783031143248081, -0.019594838874092184, 0.030688537096676346, -0.14592061528058436, 0.14353790495974514, 0.2106891632899463, 0.15690442722272843, 0.26172646194194943, -0.39187517047573167, -0.15027747969053543, 0.13432422357324797, 0.08348157615042649, 0.11273618610553407, -0.018519104513241194, -0.3487825767996793, 0.09194852848752187, -0.16479115033199868, -0.13113603941746987, -0.06887134066514242, -0.026613318242687874, 0.045972208017841555, -0.33135556399177474, 0.03199847607174888, 0.05619732013124471, 0.0708942159365576, -0.056530199619233966, -0.09003755420249385, -0.006519694355889582, 0.08646899033136343, 0.02032211821194953, -0.020829685139828004, 0.1015544247168761, -0.049128631082847, -0.1538665734305351, 0.33709267053591946, -0.05742872821429046, -0.23947564116679132, 0.2288775734733253, -0.09511269284513009, -0.14061981408695617, 0.0878942813186978, 0.20734043414883602, 0.14023912637136304, -0.13667803262181294, 0.08538534945546417, -0.04419317035577618, 0.19153358656778716, 0.0018325752462260425, 0.04569426655339507, 0.1300832304987125, 0.21987707698896813, 0.1678279289492191, 0.1441671499342192, -0.058181226891555034, -0.1077854537769991, -0.3097305696977016, -0.08913565084311323, -0.1678913566104781, 0.019189032499875445, -0.10408059132770667, -0.14135214448973643, 0.3706747982292794, 0.20464825787796423, 0.21053771952238792, 0.1738168754841004, 0.33168133447627324, 0.13114986413543542, -0.03843960624922497, 0.09446905619160344, 0.2009283777935287, 0.11366456077219202, 0.05844046425325079, -0.18836765837757133, 0.08608691839841552, 0.06589305752375087] |
1,803.02215 | Infrared and visible scintillation of Ho$^{3+}$-doped YAG and YLF
crystals | In our effort to develop a new kind of detector for low-energy, low-rate
energy deposition events we have investigated the cathodo- and
radioluminescence of Ho:YAG and Ho:YLF single crystals in an extended
wavelength range from $200\,$nm to $2200\,$nm. The emission spectra of both
crystals show a much more intense emission in the infrared range than in the
visible one. We estimate an infrared light yield of $40\,$photons/keV when
exciting the crystals with X-rays of energy $\approx 30\,$keV. The main reason
of this high value is due to the Ho$^{3+}$ ions energy levels scheme that
allows efficient cross relaxation processes to occur even at low dopant
concentration.
| physics.atom-ph | in our effort to develop a new kind of detector for lowenergy lowrate energy deposition events we have investigated the cathodo and radioluminescence of hoyag and hoylf single crystals in an extended wavelength range from 200nm to 2200nm the emission spectra of both crystals show a much more intense emission in the infrared range than in the visible one we estimate an infrared light yield of 40photonskev when exciting the crystals with xrays of energy approx 30kev the main reason of this high value is due to the ho3 ions energy levels scheme that allows efficient cross relaxation processes to occur even at low dopant concentration | [['in', 'our', 'effort', 'to', 'develop', 'a', 'new', 'kind', 'of', 'detector', 'for', 'lowenergy', 'lowrate', 'energy', 'deposition', 'events', 'we', 'have', 'investigated', 'the', 'cathodo', 'and', 'radioluminescence', 'of', 'hoyag', 'and', 'hoylf', 'single', 'crystals', 'in', 'an', 'extended', 'wavelength', 'range', 'from', '200nm', 'to', '2200nm', 'the', 'emission', 'spectra', 'of', 'both', 'crystals', 'show', 'a', 'much', 'more', 'intense', 'emission', 'in', 'the', 'infrared', 'range', 'than', 'in', 'the', 'visible', 'one', 'we', 'estimate', 'an', 'infrared', 'light', 'yield', 'of', '40photonskev', 'when', 'exciting', 'the', 'crystals', 'with', 'xrays', 'of', 'energy', 'approx', '30kev', 'the', 'main', 'reason', 'of', 'this', 'high', 'value', 'is', 'due', 'to', 'the', 'ho3', 'ions', 'energy', 'levels', 'scheme', 'that', 'allows', 'efficient', 'cross', 'relaxation', 'processes', 'to', 'occur', 'even', 'at', 'low', 'dopant', 'concentration']] | [-0.05410493220749664, 0.18623811455733974, -0.050143369129922205, 0.05823110247446785, -0.0029884806395625895, -0.11336712324901403, 0.04543271640460323, 0.4352365930392904, -0.22301999408100703, -0.3398076175956182, 0.029958220447404583, -0.2981749597273697, -0.016766659283074685, 0.21560439823457556, -0.015088916376450108, 0.0067986577875839855, 0.008356122231083804, -0.046094135394844325, -0.024161442327629595, -0.16296213302191673, 0.23648550335625276, 0.13839522854185402, 0.28523238661509115, 0.10346202027884502, 0.08401695149724633, 0.002881735550845494, 0.0564486862011073, -0.05885440155465915, -0.12974575682560455, 0.10295471433070895, 0.27760521036310537, 0.007242091325590912, 0.2218911063708184, -0.41705717263942205, -0.23671118994198234, 0.09056827876698768, 0.13664224737513703, 0.10636771112246421, -0.09998176308663548, -0.2023978868264307, 0.06915979535721278, -0.13698683530137448, -0.13327562312134406, -0.015197410763612071, -0.008392071952699746, 0.005486340551338728, -0.26256367115719803, 0.05521964295586408, 0.014916213163744333, 0.05257897429819246, -0.08962256703311035, -0.11315982561847827, -0.015883374911760097, 0.025284092343532145, 0.05601727084066827, 0.01700405908626441, 0.15876385190714043, -0.13235264896975776, -0.0693402687648257, 0.37411529968664486, -0.06731702018039215, -0.04562404809194138, 0.19705951385634038, -0.210346798086991, -0.09853556550342987, 0.2801630359088767, 0.1649327019536958, 0.16128264671390496, -0.1452089723147897, 0.011530746571613404, 0.03465727124096446, 0.23536973254917895, 0.08883168953425676, 0.12328257061342157, 0.20278605332290664, 0.18198703325046137, 0.045005472822259494, 0.12946983365323936, -0.16901906577472403, -0.015556359706555032, -0.23246142347750154, -0.15794156834560003, -0.14888570844693091, 0.06553295421531623, -0.05328151899660051, -0.11991176179619235, 0.3864614307210095, 0.14943189136186633, 0.1769666595031842, -0.017561461930208414, 0.25962918517134576, 0.12590737316816214, 0.09706193016326616, 0.038061294383685856, 0.29188294158073014, 0.10439052017749224, 0.13208063289486957, -0.21683390194875668, 0.011675664883794136, -0.038229340357362356] |
1,803.02216 | On Simple Back-Off in Unreliable Radio Networks | In this paper, we study local and global broadcast in the dual graph model,
which describes communication in a radio network with both reliable and
unreliable links. Existing work proved that efficient solutions to these
problems are impossible in the dual graph model under standard assumptions. In
real networks, however, simple back-off strategies tend to perform well for
solving these basic communication tasks. We address this apparent paradox by
introducing a new set of constraints to the dual graph model that better
generalize the slow/fast fading behavior common in real networks. We prove that
in the context of these new constraints, simple back-off strategies now provide
efficient solutions to local and global broadcast in the dual graph model. We
also precisely characterize how this efficiency degrades as the new constraints
are reduced down to non-existent, and prove new lower bounds that establish
this degradation as near optimal for a large class of natural algorithms. We
conclude with a preliminary investigation of the performance of these
strategies when we include additional generality to the model. These results
provide theoretical foundations for the practical observation that simple
back-off algorithms tend to work well even amid the complicated link dynamics
of real radio networks.
| cs.DC | in this paper we study local and global broadcast in the dual graph model which describes communication in a radio network with both reliable and unreliable links existing work proved that efficient solutions to these problems are impossible in the dual graph model under standard assumptions in real networks however simple backoff strategies tend to perform well for solving these basic communication tasks we address this apparent paradox by introducing a new set of constraints to the dual graph model that better generalize the slowfast fading behavior common in real networks we prove that in the context of these new constraints simple backoff strategies now provide efficient solutions to local and global broadcast in the dual graph model we also precisely characterize how this efficiency degrades as the new constraints are reduced down to nonexistent and prove new lower bounds that establish this degradation as near optimal for a large class of natural algorithms we conclude with a preliminary investigation of the performance of these strategies when we include additional generality to the model these results provide theoretical foundations for the practical observation that simple backoff algorithms tend to work well even amid the complicated link dynamics of real radio networks | [['in', 'this', 'paper', 'we', 'study', 'local', 'and', 'global', 'broadcast', 'in', 'the', 'dual', 'graph', 'model', 'which', 'describes', 'communication', 'in', 'a', 'radio', 'network', 'with', 'both', 'reliable', 'and', 'unreliable', 'links', 'existing', 'work', 'proved', 'that', 'efficient', 'solutions', 'to', 'these', 'problems', 'are', 'impossible', 'in', 'the', 'dual', 'graph', 'model', 'under', 'standard', 'assumptions', 'in', 'real', 'networks', 'however', 'simple', 'backoff', 'strategies', 'tend', 'to', 'perform', 'well', 'for', 'solving', 'these', 'basic', 'communication', 'tasks', 'we', 'address', 'this', 'apparent', 'paradox', 'by', 'introducing', 'a', 'new', 'set', 'of', 'constraints', 'to', 'the', 'dual', 'graph', 'model', 'that', 'better', 'generalize', 'the', 'slowfast', 'fading', 'behavior', 'common', 'in', 'real', 'networks', 'we', 'prove', 'that', 'in', 'the', 'context', 'of', 'these', 'new', 'constraints', 'simple', 'backoff', 'strategies', 'now', 'provide', 'efficient', 'solutions', 'to', 'local', 'and', 'global', 'broadcast', 'in', 'the', 'dual', 'graph', 'model', 'we', 'also', 'precisely', 'characterize', 'how', 'this', 'efficiency', 'degrades', 'as', 'the', 'new', 'constraints', 'are', 'reduced', 'down', 'to', 'nonexistent', 'and', 'prove', 'new', 'lower', 'bounds', 'that', 'establish', 'this', 'degradation', 'as', 'near', 'optimal', 'for', 'a', 'large', 'class', 'of', 'natural', 'algorithms', 'we', 'conclude', 'with', 'a', 'preliminary', 'investigation', 'of', 'the', 'performance', 'of', 'these', 'strategies', 'when', 'we', 'include', 'additional', 'generality', 'to', 'the', 'model', 'these', 'results', 'provide', 'theoretical', 'foundations', 'for', 'the', 'practical', 'observation', 'that', 'simple', 'backoff', 'algorithms', 'tend', 'to', 'work', 'well', 'even', 'amid', 'the', 'complicated', 'link', 'dynamics', 'of', 'real', 'radio', 'networks']] | [-0.11703324761352878, 0.026412177110433727, -0.05726273422736434, 0.10653147611312976, -0.11832411596040049, -0.19498206919235228, 0.09284045744226291, 0.3989259453620113, -0.2925925301573244, -0.2985086725247631, 0.12057614545059848, -0.20391078701993423, -0.22961724682280155, 0.18168251768370802, -0.13624457051208363, 0.07414413753442874, 0.08762107126933721, 0.006360667119143225, -0.049116846442741544, -0.2665842625327566, 0.2995007238785194, 0.06383060029503977, 0.29100510431685256, 0.05961425081376144, 0.05032481308516801, -0.007300618843671249, -0.02925323934030177, 0.037781243728571084, -0.14904743580085217, 0.131592033831727, 0.2670222162801902, 0.17232025240893148, 0.2676946703015609, -0.4671201727617143, -0.23489004005495556, 0.15154308171488753, 0.15412996540226004, 0.10793359101670609, -0.033818020846750306, -0.2479525690907566, 0.12776360408268608, -0.170200370949466, -0.09513654407873676, -0.0969193351897527, -0.029949480308618267, 0.029119251901747203, -0.2953501588234039, 0.032847101495349876, 0.06888811850331872, 0.028421918083149107, -0.03880681519614375, -0.07834360399630977, 0.0616331319150918, 0.13805990186777656, 0.025341893464618764, -0.011096051007981843, 0.07048382208826233, -0.13418931864660733, -0.16376882924730726, 0.36250560586595565, -0.041485628852764356, -0.19606424275489143, 0.22439579768523352, -0.07665544889278858, -0.19773932031717206, 0.08524092750169744, 0.22351456139310824, 0.10693297062801262, -0.1714735561446779, 0.0441627596164428, -0.06040703620882103, 0.11444457682933826, 0.02357878570736789, 0.08070018946364596, 0.14478812477115857, 0.19156565269876957, 0.11876075511881665, 0.14587291391434343, -0.014583155735794325, -0.11930046773941919, -0.2708937068567125, -0.1079693572443391, -0.15164576600964844, 0.031110913563399248, -0.12529739067890908, -0.1329316801417026, 0.3885972607621358, 0.1988065876506862, 0.18307863304968366, 0.14287194178326157, 0.3378041972735183, 0.08211928539376866, 0.03697904389796417, 0.12158764400681601, 0.23205118580485012, 0.0813809900199392, 0.10743463944773472, -0.16712197682713692, 0.0541416187492658, 0.01919881184122048] |
1,803.02217 | A quantum probabilistic approach to Hecke algebras for
$\mathfrak{p}$-adic ${\rm PGL}_2$ | The subject of the present paper is an application of quantum probability to
$p$-adic objects. We give a quantum-probabilistic interpretation of the
spherical Hecke algebra for ${\rm PGL}_2(F)$, where $F$ is a $p$-adic field. As
a byproduct, we obtain a new proof of the Fourier inversion formula for ${\rm
PGL}_2(F)$.
| math.RT math-ph math.MP math.NT math.OA | the subject of the present paper is an application of quantum probability to padic objects we give a quantumprobabilistic interpretation of the spherical hecke algebra for rm pgl_2f where f is a padic field as a byproduct we obtain a new proof of the fourier inversion formula for rm pgl_2f | [['the', 'subject', 'of', 'the', 'present', 'paper', 'is', 'an', 'application', 'of', 'quantum', 'probability', 'to', 'padic', 'objects', 'we', 'give', 'a', 'quantumprobabilistic', 'interpretation', 'of', 'the', 'spherical', 'hecke', 'algebra', 'for', 'rm', 'pgl_2f', 'where', 'f', 'is', 'a', 'padic', 'field', 'as', 'a', 'byproduct', 'we', 'obtain', 'a', 'new', 'proof', 'of', 'the', 'fourier', 'inversion', 'formula', 'for', 'rm', 'pgl_2f']] | [-0.16812533231414095, 0.035781128325188365, -0.17246105415480478, 0.06345149527341888, -0.11935628090547967, -0.06554393025533277, 0.011559913669028605, 0.26809919070528476, -0.2652879029474392, -0.23125045315115428, 0.09855648449489049, -0.17543607516860477, -0.15220288403940443, 0.2543326470126607, -0.11899623834665826, -0.0053171119415106214, -0.0035963125612434683, 0.13473365150335037, -0.09591124335075824, -0.19868601193385466, 0.3351196365392938, 0.005381136408018671, 0.18525632655210034, 0.04212958243086326, 0.09429071119473297, 0.03730043464777421, 0.014638408144213716, -0.10156101980531702, -0.19194207515339462, 0.1545229572802782, 0.2813971495749999, 0.10287880711257458, 0.24149212412232038, -0.37928946932055513, -0.09579174122678077, 0.15125078821972926, 0.1556004839759244, 0.0806233364784596, -0.10462735161869502, -0.26508916484914263, 0.0872759661846319, -0.20819469719973147, -0.15289396009578995, -0.07301444012899788, 0.08303776215429284, -0.012398257946633563, -0.337807741358268, 0.061005205438681404, 0.10500862515930619, 0.18435574201296787, -0.0794062069427146, -0.1118740793697688, 0.04346250985958138, 0.04802930453906254, -0.003811119540062334, 0.08288193131055759, 0.08649330906218336, -0.09715499876219096, -0.10629586826021574, 0.379534369220539, -0.06758415463323496, -0.17909292698058546, 0.10519500182257319, -0.12489679176360369, -0.17893256152010695, 0.060137140203495414, 0.12431245529073842, 0.17084587593467868, -0.04801344453376167, 0.1917296492076498, -0.15708961109725797, 0.10498868172266046, 0.05454963457067402, 0.006071854268713873, 0.15972473004794852, 0.07247708912710754, 0.09543749775585471, 0.213629687204957, -0.0847573724613354, 0.0006127100513905895, -0.4088987384219559, -0.28242078872055426, -0.17126631635070153, 0.13860653566994838, -0.07006276563422907, -0.19907377363771808, 0.37394034609730753, 0.09302668723904965, 0.21513002569673165, 0.14735433881228066, 0.21503860366587735, 0.1937159459482004, 0.03325031738614245, -0.013571571321131624, 0.09254564991106792, 0.24524790588386206, 0.005500702120895896, -0.12755331221245686, -0.05808445529974237, 0.1721850010680453] |
1,803.02218 | Relative Pairwise Relationship Constrained Non-negative Matrix
Factorisation | Non-negative Matrix Factorisation (NMF) has been extensively used in machine
learning and data analytics applications. Most existing variations of NMF only
consider how each row/column vector of factorised matrices should be shaped,
and ignore the relationship among pairwise rows or columns. In many cases, such
pairwise relationship enables better factorisation, for example, image
clustering and recommender systems. In this paper, we propose an algorithm
named, Relative Pairwise Relationship constrained Non-negative Matrix
Factorisation (RPR-NMF), which places constraints over relative pairwise
distances amongst features by imposing penalties in a triplet form. Two
distance measures, squared Euclidean distance and Symmetric divergence, are
used, and exponential and hinge loss penalties are adopted for the two measures
respectively. It is well known that the so-called "multiplicative update rules"
result in a much faster convergence than gradient descend for matrix
factorisation. However, applying such update rules to RPR-NMF and also proving
its convergence is not straightforward. Thus, we use reasonable approximations
to relax the complexity brought by the penalties, which are practically
verified. Experiments on both synthetic datasets and real datasets demonstrate
that our algorithms have advantages on gaining close approximation, satisfying
a high proportion of expected constraints, and achieving superior performance
compared with other algorithms.
| cs.LG | nonnegative matrix factorisation nmf has been extensively used in machine learning and data analytics applications most existing variations of nmf only consider how each rowcolumn vector of factorised matrices should be shaped and ignore the relationship among pairwise rows or columns in many cases such pairwise relationship enables better factorisation for example image clustering and recommender systems in this paper we propose an algorithm named relative pairwise relationship constrained nonnegative matrix factorisation rprnmf which places constraints over relative pairwise distances amongst features by imposing penalties in a triplet form two distance measures squared euclidean distance and symmetric divergence are used and exponential and hinge loss penalties are adopted for the two measures respectively it is well known that the socalled multiplicative update rules result in a much faster convergence than gradient descend for matrix factorisation however applying such update rules to rprnmf and also proving its convergence is not straightforward thus we use reasonable approximations to relax the complexity brought by the penalties which are practically verified experiments on both synthetic datasets and real datasets demonstrate that our algorithms have advantages on gaining close approximation satisfying a high proportion of expected constraints and achieving superior performance compared with other algorithms | [['nonnegative', 'matrix', 'factorisation', 'nmf', 'has', 'been', 'extensively', 'used', 'in', 'machine', 'learning', 'and', 'data', 'analytics', 'applications', 'most', 'existing', 'variations', 'of', 'nmf', 'only', 'consider', 'how', 'each', 'rowcolumn', 'vector', 'of', 'factorised', 'matrices', 'should', 'be', 'shaped', 'and', 'ignore', 'the', 'relationship', 'among', 'pairwise', 'rows', 'or', 'columns', 'in', 'many', 'cases', 'such', 'pairwise', 'relationship', 'enables', 'better', 'factorisation', 'for', 'example', 'image', 'clustering', 'and', 'recommender', 'systems', 'in', 'this', 'paper', 'we', 'propose', 'an', 'algorithm', 'named', 'relative', 'pairwise', 'relationship', 'constrained', 'nonnegative', 'matrix', 'factorisation', 'rprnmf', 'which', 'places', 'constraints', 'over', 'relative', 'pairwise', 'distances', 'amongst', 'features', 'by', 'imposing', 'penalties', 'in', 'a', 'triplet', 'form', 'two', 'distance', 'measures', 'squared', 'euclidean', 'distance', 'and', 'symmetric', 'divergence', 'are', 'used', 'and', 'exponential', 'and', 'hinge', 'loss', 'penalties', 'are', 'adopted', 'for', 'the', 'two', 'measures', 'respectively', 'it', 'is', 'well', 'known', 'that', 'the', 'socalled', 'multiplicative', 'update', 'rules', 'result', 'in', 'a', 'much', 'faster', 'convergence', 'than', 'gradient', 'descend', 'for', 'matrix', 'factorisation', 'however', 'applying', 'such', 'update', 'rules', 'to', 'rprnmf', 'and', 'also', 'proving', 'its', 'convergence', 'is', 'not', 'straightforward', 'thus', 'we', 'use', 'reasonable', 'approximations', 'to', 'relax', 'the', 'complexity', 'brought', 'by', 'the', 'penalties', 'which', 'are', 'practically', 'verified', 'experiments', 'on', 'both', 'synthetic', 'datasets', 'and', 'real', 'datasets', 'demonstrate', 'that', 'our', 'algorithms', 'have', 'advantages', 'on', 'gaining', 'close', 'approximation', 'satisfying', 'a', 'high', 'proportion', 'of', 'expected', 'constraints', 'and', 'achieving', 'superior', 'performance', 'compared', 'with', 'other', 'algorithms']] | [-0.06071184452145709, 0.021992343181060425, -0.09083008172103402, 0.12167952429048125, -0.09543471991771249, -0.19445489876259195, 0.02641124417593778, 0.45075181241128404, -0.29818413214290024, -0.2868537474720565, 0.11729883037994361, -0.2984570603573112, -0.16904365915729844, 0.15874235323428015, -0.08474177227007469, 0.10710693751208983, 0.10061527877890815, 0.029172037826319497, -0.1434493399686133, -0.30595333839653793, 0.2898457587962368, 0.014141960967934191, 0.30476717997196534, 0.04527530162989143, 0.11907586457285409, 0.005272543285926333, -0.04813976150542272, 0.035508040527552895, -0.055548655755322245, 0.13653086162656733, 0.269126973714623, 0.21383952037925183, 0.29670149198206464, -0.40310817329016646, -0.16829301440686156, 0.17283381113748422, 0.16826851991701383, 0.024973727969806687, -0.033167891600639605, -0.25402422297529575, 0.08824603231576732, -0.16642661725001578, -0.02448639631356028, -0.15139524892532277, -0.0017936220674803762, 0.0338989241634298, -0.3191182405495019, 0.050715125230407915, 0.05822860055482262, 0.037248397262465927, -0.020814270949381583, -0.21687287218972212, 0.05773536974065608, 0.09939472443974492, 0.08148806652164726, 0.01806293393607543, 0.10250686062588074, -0.0986275024291109, -0.1369608512819707, 0.3771368513880956, -0.04384177101511717, -0.25243088193567037, 0.2066401983834709, -0.04799668016758832, -0.13310987241519145, 0.08453731911699053, 0.18876757799892338, 0.10659813716763047, -0.15079842445163075, 0.07667280816810554, -0.032828045566801474, 0.1394960225172896, 0.07780589280541836, 0.05524585557445376, 0.12513579493223906, 0.1295894830478261, 0.10159799810259361, 0.09411281655628394, -0.03636157726445659, -0.12426579222341792, -0.20763737419878858, -0.08629922800452797, -0.20622470467868778, -0.018247799081136967, -0.16974967997925383, -0.15061735382510555, 0.3408982190338782, 0.1553815898269114, 0.2340055965866089, 0.12060958900985148, 0.33136662555331686, 0.07825330400079808, 0.11260657337543582, 0.10057540302766185, 0.20056003683030305, 0.13995465087719647, 0.033299027318299534, -0.1604413279071168, 0.11643654610867603, 0.07061757844863366] |
1,803.02219 | Sparse Active Rectangular Array with Few Closely Spaced Elements | Sparse sensor arrays offer a cost effective alternative to uniform arrays. By
utilizing the co-array, a sparse array can match the performance of a filled
array, despite having significantly fewer sensors. However, even sparse arrays
can have many closely spaced elements, which may deteriorate the array
performance in the presence of mutual coupling. This paper proposes a novel
sparse planar array configuration with few unit inter-element spacings. This
Concentric Rectangular Array (CRA) is designed for active sensing tasks, such
as microwave or ultra-sound imaging, in which the same elements are used for
both transmission and reception. The properties of the CRA are compared to two
well-known sparse geometries: the Boundary Array and the Minimum-Redundancy
Array (MRA). Numerical searches reveal that the CRA is the MRA with the fewest
unit element displacements for certain array dimensions.
| eess.SP | sparse sensor arrays offer a cost effective alternative to uniform arrays by utilizing the coarray a sparse array can match the performance of a filled array despite having significantly fewer sensors however even sparse arrays can have many closely spaced elements which may deteriorate the array performance in the presence of mutual coupling this paper proposes a novel sparse planar array configuration with few unit interelement spacings this concentric rectangular array cra is designed for active sensing tasks such as microwave or ultrasound imaging in which the same elements are used for both transmission and reception the properties of the cra are compared to two wellknown sparse geometries the boundary array and the minimumredundancy array mra numerical searches reveal that the cra is the mra with the fewest unit element displacements for certain array dimensions | [['sparse', 'sensor', 'arrays', 'offer', 'a', 'cost', 'effective', 'alternative', 'to', 'uniform', 'arrays', 'by', 'utilizing', 'the', 'coarray', 'a', 'sparse', 'array', 'can', 'match', 'the', 'performance', 'of', 'a', 'filled', 'array', 'despite', 'having', 'significantly', 'fewer', 'sensors', 'however', 'even', 'sparse', 'arrays', 'can', 'have', 'many', 'closely', 'spaced', 'elements', 'which', 'may', 'deteriorate', 'the', 'array', 'performance', 'in', 'the', 'presence', 'of', 'mutual', 'coupling', 'this', 'paper', 'proposes', 'a', 'novel', 'sparse', 'planar', 'array', 'configuration', 'with', 'few', 'unit', 'interelement', 'spacings', 'this', 'concentric', 'rectangular', 'array', 'cra', 'is', 'designed', 'for', 'active', 'sensing', 'tasks', 'such', 'as', 'microwave', 'or', 'ultrasound', 'imaging', 'in', 'which', 'the', 'same', 'elements', 'are', 'used', 'for', 'both', 'transmission', 'and', 'reception', 'the', 'properties', 'of', 'the', 'cra', 'are', 'compared', 'to', 'two', 'wellknown', 'sparse', 'geometries', 'the', 'boundary', 'array', 'and', 'the', 'minimumredundancy', 'array', 'mra', 'numerical', 'searches', 'reveal', 'that', 'the', 'cra', 'is', 'the', 'mra', 'with', 'the', 'fewest', 'unit', 'element', 'displacements', 'for', 'certain', 'array', 'dimensions']] | [-0.18214243793066728, 0.10460415285563579, 0.04360229625394654, -0.03624805824969102, -0.07774619083782588, -0.18485829797055986, -0.016285358511635827, 0.46485494836061086, -0.24734551632535404, -0.29869152544307764, 0.1752408161914597, -0.2760287250047205, -0.18009951539613583, 0.1566305594018626, -0.06219171913107857, 0.08181495112237624, 0.11638137026069065, -0.01426554501608566, -0.038900593432373606, -0.19251772560954258, 0.17836911570263544, 0.11755324701468149, 0.3169483967884271, -0.05255387791742881, 0.0807370157692478, 0.00960279035164233, -0.004289870071052401, 0.07232118803766314, -0.015046858348014886, 0.1622201996411335, 0.31728427211443583, 0.08283435319101921, 0.22127015968715702, -0.4589559467026481, -0.21777777860148084, 0.07923902092432535, 0.15247783922348862, 0.04263011762544651, -0.06689381423854718, -0.2686630979439037, 0.07801244851822654, -0.12974497618464131, -0.10119971761962882, -0.010901852160761201, -0.050086201851566634, 0.08220692565233481, -0.3465819708502817, -0.014078915044363519, 0.011667152338971695, 0.01523323009411494, -0.007249384395847166, -0.1737834755264447, 0.09935054683850872, 0.11864142262859753, -0.06441029413534259, 0.0014667852471272151, 0.10050063721007771, -0.051893082726746795, -0.09410575772463171, 0.34005165723738845, -0.012141966805965812, -0.2300742759403807, 0.23737955467292557, -0.1457087817463886, -0.09438847848386676, 0.17391200334834003, 0.18420639506161765, 0.06183090270669372, -0.13026915124996943, 0.07374082049613612, -0.06569545772530276, 0.2345719415280554, 0.14791681210303473, 0.10308588730231687, 0.2595616145990789, 0.2011211865098664, 0.11126831711131942, 0.18834077182777778, -0.17641276731155814, -0.024154105404159056, -0.1955123365468656, -0.09534663394809252, -0.22972449479210708, -0.004094178792675612, -0.1479565966699738, -0.21609006690344326, 0.36757744149891314, 0.10799702968603621, 0.15706092996039875, 0.03359571095314567, 0.3442094553261995, 0.018390693480183407, 0.13293308061375111, 0.032490187690213876, 0.2121701356747912, 0.14608744006362503, 0.07785356445237994, -0.19624288374282145, -0.01747989200607494, 0.026715403143316507] |
1,803.0222 | Continuous wavelet transforms on $n$-dimensional spheres | In this paper, we are concerned with $n$-dimensional spherical wavelets
derived from the theory of approximate identities. For nonzonal bilinear
wavelets introduced by Ebert \emph{et al.} in 2009 we prove isometry and
Euclidean limit property. Further, we develop a theory of linear wavelets. In
the end, we discuss the relationship to other wavelet constructions.
| math.FA math-ph math.MP | in this paper we are concerned with ndimensional spherical wavelets derived from the theory of approximate identities for nonzonal bilinear wavelets introduced by ebert emphet al in 2009 we prove isometry and euclidean limit property further we develop a theory of linear wavelets in the end we discuss the relationship to other wavelet constructions | [['in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'ndimensional', 'spherical', 'wavelets', 'derived', 'from', 'the', 'theory', 'of', 'approximate', 'identities', 'for', 'nonzonal', 'bilinear', 'wavelets', 'introduced', 'by', 'ebert', 'emphet', 'al', 'in', '2009', 'we', 'prove', 'isometry', 'and', 'euclidean', 'limit', 'property', 'further', 'we', 'develop', 'a', 'theory', 'of', 'linear', 'wavelets', 'in', 'the', 'end', 'we', 'discuss', 'the', 'relationship', 'to', 'other', 'wavelet', 'constructions']] | [-0.0919159703405091, 0.09130883488062493, -0.11886045774789872, 0.0792187657444393, -0.08673186013819995, -0.07170641200489761, -0.005177694732857937, 0.3815454419667798, -0.2922543918851901, -0.20149527369412007, 0.09840219069694824, -0.2614474916589205, -0.3043821297577341, 0.14394616708159447, -0.16162253535218984, 0.12046905867410479, -0.01931639061809552, -0.008142760821135232, -0.13670307896272452, -0.216800829943235, 0.31529186067550824, 0.04413249232392344, 0.2789742958352522, -0.034428132939393875, 0.07484901884432744, 0.04213872732146195, -0.11707493766314453, -0.021064046770334244, -0.20889092697244552, 0.17975692192299497, 0.26592957093897795, 0.11723482396229412, 0.2236851135234314, -0.4495296850800514, -0.19744665525784647, 0.10622975828677968, 0.11875708621098763, 0.08007750584295502, -0.0634088315181779, -0.3133758971536601, 0.10398652307102801, -0.1671768987413358, -0.1771410007495433, -0.0831582569344728, 0.02511993264434514, 0.012729729517121558, -0.2853750464402967, 0.11624549048590577, 0.13712597845329177, 0.07697633648920735, -0.0825990459157361, -0.07207455648178304, 0.035451729092057106, -0.005385105403278161, 0.009478151522300861, 0.009525510999891493, 0.008788448094424826, -0.012397195070257617, -0.14580684106288203, 0.3249671360546792, -0.0472266909028231, -0.25961045858760673, 0.1552060187526944, -0.11266967931900311, -0.192826470881873, 0.003415490500628948, 0.21501793491619606, 0.1170054637413058, -0.1190907644038951, 0.20506653379265186, -0.10815628190283422, 0.0869696007920774, 0.14859509513782407, 0.0310438324921523, 0.07547271486880534, 0.041163787711411715, 0.045855686215131926, 0.2009615541825985, -0.0219505942573219, -0.0709794049670799, -0.2846042870854338, -0.1203309321017177, -0.18462851074420744, 0.041028461789850285, -0.08080829441934367, -0.15127254575835886, 0.38304954806894614, 0.12049944290063447, 0.16675221102519167, 0.12769402818823303, 0.18544675470588523, 0.11520175960052896, -0.013337848535566419, 0.1044771959832697, 0.2501523910711209, 0.21697649634356989, 0.06535358278563728, -0.08694515333735142, -0.09596978033099461, 0.24577031948569197] |
1,803.02221 | Position and momentum cannot both be lazy: Quantum reciprocity relation
with Lipschitz constants | We propose a trade-off between the Lipschitz constants of the position and
momentum probability distributions for arbitrary quantum states. We refer to
the trade-off as a quantum reciprocity relation. The Lipschitz constant of a
function may be considered to quantify the extent of fluctuations of that
function, and is, in general, independent of its spread. The spreads of the
position and momentum distributions are used to obtain the celebrated
Heisenberg quantum uncertainty relations. We find that the product of the
Lipschitz constants of position and momentum probability distributions is
bounded below by a number that is of the order of the inverse square of the
Planck's constant.
| quant-ph | we propose a tradeoff between the lipschitz constants of the position and momentum probability distributions for arbitrary quantum states we refer to the tradeoff as a quantum reciprocity relation the lipschitz constant of a function may be considered to quantify the extent of fluctuations of that function and is in general independent of its spread the spreads of the position and momentum distributions are used to obtain the celebrated heisenberg quantum uncertainty relations we find that the product of the lipschitz constants of position and momentum probability distributions is bounded below by a number that is of the order of the inverse square of the plancks constant | [['we', 'propose', 'a', 'tradeoff', 'between', 'the', 'lipschitz', 'constants', 'of', 'the', 'position', 'and', 'momentum', 'probability', 'distributions', 'for', 'arbitrary', 'quantum', 'states', 'we', 'refer', 'to', 'the', 'tradeoff', 'as', 'a', 'quantum', 'reciprocity', 'relation', 'the', 'lipschitz', 'constant', 'of', 'a', 'function', 'may', 'be', 'considered', 'to', 'quantify', 'the', 'extent', 'of', 'fluctuations', 'of', 'that', 'function', 'and', 'is', 'in', 'general', 'independent', 'of', 'its', 'spread', 'the', 'spreads', 'of', 'the', 'position', 'and', 'momentum', 'distributions', 'are', 'used', 'to', 'obtain', 'the', 'celebrated', 'heisenberg', 'quantum', 'uncertainty', 'relations', 'we', 'find', 'that', 'the', 'product', 'of', 'the', 'lipschitz', 'constants', 'of', 'position', 'and', 'momentum', 'probability', 'distributions', 'is', 'bounded', 'below', 'by', 'a', 'number', 'that', 'is', 'of', 'the', 'order', 'of', 'the', 'inverse', 'square', 'of', 'the', 'plancks', 'constant']] | [-0.14861099177397022, 0.17179734462645846, -0.09308350544039891, 0.09440578074547001, -0.06532890515001578, -0.07189418563062203, 0.06622138800682657, 0.3496892368682077, -0.33095910163404785, -0.27078726601098213, 0.05339401135782528, -0.2665061390149259, -0.09112011686524499, 0.16570107329845707, -0.059523346546654386, 0.0805404406888454, -0.019847247553728173, 0.061947584813721826, -0.10368836082400597, -0.2109949521929304, 0.35925159493687553, 0.053437518183289914, 0.2507922824441725, 0.09077332179479858, 0.1494504802938655, 0.02067391049099442, -0.003017808258463846, 0.007699297297154075, -0.19190339948518242, 0.13372910503791993, 0.20212669606607792, 0.10475765711188079, 0.26765921748913474, -0.3347066317066968, -0.1652567767424979, 0.1281471391530516, 0.11208272762335489, 0.07841892736728921, 0.010229183648164584, -0.23831741383003296, 0.033596588398773816, -0.1582703754375471, -0.16266596809064396, -0.03147550379840013, 0.04246153235087328, 0.08083172303528707, -0.27321974329963744, 0.14219092206907608, 0.06750657450773309, 0.012187373006246357, -0.050809008381590595, -0.09754471956843633, -0.028206399206733592, 0.18705639542541772, 0.029321461204421993, 0.04737927403875461, 0.10102761818409384, -0.12644587106410868, -0.11419680679791441, 0.3727101009234647, -0.06558226710120128, -0.27872505479396503, 0.09619435475960757, -0.18603854573758266, -0.042976365437748555, 0.05226747651375552, 0.168565852654593, 0.09435190050645131, -0.10795976864130488, 0.11270679366148173, -0.04379688590660552, 0.17697959372373384, 0.055799310265335245, 0.07624235663782787, 0.15105507843126761, 0.06229666934705505, 0.11735488773784905, 0.15264435934890758, -0.10357737984664947, -0.13681422318462458, -0.36052457078699474, -0.18431612135511694, -0.22777894548375474, 0.09036370352015038, -0.13749891924660948, -0.16620025320727133, 0.3607652706450948, 0.10792472641197007, 0.24805453072397787, 0.10374669075691115, 0.23497110688797782, 0.17157926967815784, 0.03837242536681974, 0.059267711847428683, 0.2562462780798707, 0.1794652995744842, 0.054730239332975626, -0.21991908725429432, 0.11122507603281986, 0.03906133579931801] |
1,803.02222 | Multi-class Active Learning: A Hybrid Informative and Representative
Criterion Inspired Approach | Labeling each instance in a large dataset is extremely labor- and time-
consuming . One way to alleviate this problem is active learning, which aims to
which discover the most valuable instances for labeling to construct a powerful
classifier. Considering both informativeness and representativeness provides a
promising way to design a practical active learning. However, most existing
active learning methods select instances favoring either informativeness or
representativeness. Meanwhile, many are designed based on the binary class, so
that they may present suboptimal solutions on the datasets with multiple
classes. In this paper, a hybrid informative and representative criterion based
multi-class active learning approach is proposed. We combine the informative
informativeness and representativeness into one formula, which can be solved
under a unified framework. The informativeness is measured by the margin
minimum while the representative information is measured by the maximum mean
discrepancy. By minimizing the upper bound for the true risk, we generalize the
empirical risk minimization principle to the active learning setting.
Simultaneously, our proposed method makes full use of the label information,
and the proposed active learning is designed based on multiple classes. So the
proposed method is not suitable to the binary class but also the multiple
classes. We conduct our experiments on twelve benchmark UCI data sets, and the
experimental results demonstrate that the proposed method performs better than
some state-of-the-art methods.
| cs.LG cs.CV stat.ML | labeling each instance in a large dataset is extremely labor and time consuming one way to alleviate this problem is active learning which aims to which discover the most valuable instances for labeling to construct a powerful classifier considering both informativeness and representativeness provides a promising way to design a practical active learning however most existing active learning methods select instances favoring either informativeness or representativeness meanwhile many are designed based on the binary class so that they may present suboptimal solutions on the datasets with multiple classes in this paper a hybrid informative and representative criterion based multiclass active learning approach is proposed we combine the informative informativeness and representativeness into one formula which can be solved under a unified framework the informativeness is measured by the margin minimum while the representative information is measured by the maximum mean discrepancy by minimizing the upper bound for the true risk we generalize the empirical risk minimization principle to the active learning setting simultaneously our proposed method makes full use of the label information and the proposed active learning is designed based on multiple classes so the proposed method is not suitable to the binary class but also the multiple classes we conduct our experiments on twelve benchmark uci data sets and the experimental results demonstrate that the proposed method performs better than some stateoftheart methods | [['labeling', 'each', 'instance', 'in', 'a', 'large', 'dataset', 'is', 'extremely', 'labor', 'and', 'time', 'consuming', 'one', 'way', 'to', 'alleviate', 'this', 'problem', 'is', 'active', 'learning', 'which', 'aims', 'to', 'which', 'discover', 'the', 'most', 'valuable', 'instances', 'for', 'labeling', 'to', 'construct', 'a', 'powerful', 'classifier', 'considering', 'both', 'informativeness', 'and', 'representativeness', 'provides', 'a', 'promising', 'way', 'to', 'design', 'a', 'practical', 'active', 'learning', 'however', 'most', 'existing', 'active', 'learning', 'methods', 'select', 'instances', 'favoring', 'either', 'informativeness', 'or', 'representativeness', 'meanwhile', 'many', 'are', 'designed', 'based', 'on', 'the', 'binary', 'class', 'so', 'that', 'they', 'may', 'present', 'suboptimal', 'solutions', 'on', 'the', 'datasets', 'with', 'multiple', 'classes', 'in', 'this', 'paper', 'a', 'hybrid', 'informative', 'and', 'representative', 'criterion', 'based', 'multiclass', 'active', 'learning', 'approach', 'is', 'proposed', 'we', 'combine', 'the', 'informative', 'informativeness', 'and', 'representativeness', 'into', 'one', 'formula', 'which', 'can', 'be', 'solved', 'under', 'a', 'unified', 'framework', 'the', 'informativeness', 'is', 'measured', 'by', 'the', 'margin', 'minimum', 'while', 'the', 'representative', 'information', 'is', 'measured', 'by', 'the', 'maximum', 'mean', 'discrepancy', 'by', 'minimizing', 'the', 'upper', 'bound', 'for', 'the', 'true', 'risk', 'we', 'generalize', 'the', 'empirical', 'risk', 'minimization', 'principle', 'to', 'the', 'active', 'learning', 'setting', 'simultaneously', 'our', 'proposed', 'method', 'makes', 'full', 'use', 'of', 'the', 'label', 'information', 'and', 'the', 'proposed', 'active', 'learning', 'is', 'designed', 'based', 'on', 'multiple', 'classes', 'so', 'the', 'proposed', 'method', 'is', 'not', 'suitable', 'to', 'the', 'binary', 'class', 'but', 'also', 'the', 'multiple', 'classes', 'we', 'conduct', 'our', 'experiments', 'on', 'twelve', 'benchmark', 'uci', 'data', 'sets', 'and', 'the', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'method', 'performs', 'better', 'than', 'some', 'stateoftheart', 'methods']] | [-0.02827241131208009, 0.005383058958169487, -0.08578438228927553, 0.12119879544492708, -0.1513824030591382, -0.1863355442095134, 0.09379948761883296, 0.40859492080803544, -0.24502335810309483, -0.3658650334572626, 0.09144063573641081, -0.2670528496656981, -0.16114387536214458, 0.230775308600407, -0.11794556620220344, 0.08513666695708202, 0.11536491595933007, 0.052298377189371324, -0.04027281997880588, -0.30581416681822804, 0.30159157637817163, 0.05532681432656116, 0.3561779265354077, 0.013449371750207825, 0.12731292967836555, -0.0166506022028625, -0.04354508369126254, 0.04118814844638109, -0.0788503330116186, 0.20821583539506214, 0.32212170584334265, 0.22026631196417534, 0.37094567929704986, -0.35153483665988056, -0.2128861908821596, 0.14779758427699563, 0.11703432685747328, 0.08769127104230898, -0.06807530859485268, -0.2950102701586568, 0.09874513372364971, -0.13729631477759943, -0.009107530009415415, -0.14156514945957396, -0.03544014707621601, -0.019829926795274434, -0.31763683201331233, 0.03015864927929619, 0.049187473382076456, 0.01025987822859962, -0.07066085786144767, -0.14365882102089625, 0.05198530499719911, 0.14410007327381108, 0.05887240742281493, 0.026604001611057256, 0.1232931347294814, -0.10711364221862621, -0.1430810938641015, 0.35906475111842157, -0.03626212381376212, -0.22287915088236332, 0.22299118070656226, -0.02457031617561976, -0.14867280925572332, 0.10528872153411309, 0.21569832294765445, 0.17016023704368208, -0.18259189824728916, -0.009954939171568387, -0.07913622448841731, 0.1758784347358677, 0.005690262672077451, 0.005301966869996654, 0.16998986403975222, 0.2436462761844612, 0.07423396812777759, 0.16137625107800382, -0.1412633050647047, -0.07515044750645757, -0.22936143063914238, -0.09454930194058558, -0.20471126122089725, -0.04198149845721976, -0.11186513289563461, -0.1183050719400247, 0.38183936027396054, 0.20228473389986903, 0.18904728239660876, 0.10327244355601983, 0.34665607523587016, 0.027430875811518894, 0.10706289898811115, 0.12013904086883283, 0.21317211854853668, 0.009971654140907856, 0.05254547292470104, -0.19083884950727226, 0.12271728198354442, 0.07263709066642655] |
1,803.02223 | Review of the Onsager "Ideal Turbulence" Theory | In his famous undergraduate physics lectures, Richard Feynman remarked about
the problem of fluid turbulence: "Nobody in physics has really been able to
analyze it mathematically satisfactorily in spite of its importance to the
sister sciences". This statement was already false when Feynman made it.
Unbeknownst to him, Lars Onsager decades earlier had made an exact mathematical
analysis of the high Reynolds-number limit of incompressible fluid turbulence,
using a method that would now be described as a non-perturbative
renormalization group analysis and discovering the first "conservation-law
anomaly" in theoretical physics. Onsager's results were only cryptically
announced in 1949 and he never published any of his detailed calculations.
Onsager's analysis was finally rescued from oblivion and reproduced by this
author in 1992. The ideas have subsequently been intensively developed in the
mathematical PDE community, where deep connections emerged with John Nash's
work on isometric embeddings. Furthermore, Onsager's method has more recently
been successfully applied to new physics problems, such as compressible fluid
turbulence and relativistic fluid turbulence, yielding many novel testable
predictions. This note will explain Onsager's exact analysis of incompressible
turbulence using modern ideas on renormalization group and conservation-law
anomalies, and it will also very briefly review subsequent developments.
| physics.flu-dyn cond-mat.other hep-th | in his famous undergraduate physics lectures richard feynman remarked about the problem of fluid turbulence nobody in physics has really been able to analyze it mathematically satisfactorily in spite of its importance to the sister sciences this statement was already false when feynman made it unbeknownst to him lars onsager decades earlier had made an exact mathematical analysis of the high reynoldsnumber limit of incompressible fluid turbulence using a method that would now be described as a nonperturbative renormalization group analysis and discovering the first conservationlaw anomaly in theoretical physics onsagers results were only cryptically announced in 1949 and he never published any of his detailed calculations onsagers analysis was finally rescued from oblivion and reproduced by this author in 1992 the ideas have subsequently been intensively developed in the mathematical pde community where deep connections emerged with john nashs work on isometric embeddings furthermore onsagers method has more recently been successfully applied to new physics problems such as compressible fluid turbulence and relativistic fluid turbulence yielding many novel testable predictions this note will explain onsagers exact analysis of incompressible turbulence using modern ideas on renormalization group and conservationlaw anomalies and it will also very briefly review subsequent developments | [['in', 'his', 'famous', 'undergraduate', 'physics', 'lectures', 'richard', 'feynman', 'remarked', 'about', 'the', 'problem', 'of', 'fluid', 'turbulence', 'nobody', 'in', 'physics', 'has', 'really', 'been', 'able', 'to', 'analyze', 'it', 'mathematically', 'satisfactorily', 'in', 'spite', 'of', 'its', 'importance', 'to', 'the', 'sister', 'sciences', 'this', 'statement', 'was', 'already', 'false', 'when', 'feynman', 'made', 'it', 'unbeknownst', 'to', 'him', 'lars', 'onsager', 'decades', 'earlier', 'had', 'made', 'an', 'exact', 'mathematical', 'analysis', 'of', 'the', 'high', 'reynoldsnumber', 'limit', 'of', 'incompressible', 'fluid', 'turbulence', 'using', 'a', 'method', 'that', 'would', 'now', 'be', 'described', 'as', 'a', 'nonperturbative', 'renormalization', 'group', 'analysis', 'and', 'discovering', 'the', 'first', 'conservationlaw', 'anomaly', 'in', 'theoretical', 'physics', 'onsagers', 'results', 'were', 'only', 'cryptically', 'announced', 'in', '1949', 'and', 'he', 'never', 'published', 'any', 'of', 'his', 'detailed', 'calculations', 'onsagers', 'analysis', 'was', 'finally', 'rescued', 'from', 'oblivion', 'and', 'reproduced', 'by', 'this', 'author', 'in', '1992', 'the', 'ideas', 'have', 'subsequently', 'been', 'intensively', 'developed', 'in', 'the', 'mathematical', 'pde', 'community', 'where', 'deep', 'connections', 'emerged', 'with', 'john', 'nashs', 'work', 'on', 'isometric', 'embeddings', 'furthermore', 'onsagers', 'method', 'has', 'more', 'recently', 'been', 'successfully', 'applied', 'to', 'new', 'physics', 'problems', 'such', 'as', 'compressible', 'fluid', 'turbulence', 'and', 'relativistic', 'fluid', 'turbulence', 'yielding', 'many', 'novel', 'testable', 'predictions', 'this', 'note', 'will', 'explain', 'onsagers', 'exact', 'analysis', 'of', 'incompressible', 'turbulence', 'using', 'modern', 'ideas', 'on', 'renormalization', 'group', 'and', 'conservationlaw', 'anomalies', 'and', 'it', 'will', 'also', 'very', 'briefly', 'review', 'subsequent', 'developments']] | [-0.044557428142088795, 0.0986056199467706, -0.17505824988245766, 0.11024660031097198, -0.14412138064514207, -0.16929930926187697, 0.013569348073103513, 0.28583910445579225, -0.24193398118009696, -0.3463597861259724, 0.10994583689854621, -0.2618290626142889, -0.18425531090105499, 0.18695663975203655, -0.09068593209858683, 0.07907410870003985, 0.052552747624253646, -0.013370378692545475, -0.022240069258553586, -0.28617088122980083, 0.22751612006216262, 0.12252213499809243, 0.28306498692131066, 0.0757686968453242, 0.0821287404841948, -0.022157091304608103, -0.09269168690279728, 0.041468460611396966, -0.18403198464904857, 0.06973614310786937, 0.30875252333065173, 0.08572864630934988, 0.30694483739389766, -0.45624856265130065, -0.27093703089978055, 0.027126475408993135, 0.14693792976881143, 0.13471671513451094, -0.05590444045693136, -0.3057271578311544, 0.020653071996580688, -0.1961713471459319, -0.14317851344028235, -0.0993743642877712, 0.06129210720349084, -0.05962272440882945, -0.13427382211831182, 0.06638245303710015, 0.0695989585053552, 0.1170192261451295, -0.02184989492907518, -0.13105857245167812, 0.03674108680864476, 0.08551491609015478, 0.10837053736634177, 0.03697860762335812, 0.07185424498818589, -0.11940759714490574, -0.1288123732677313, 0.37402095743649016, -0.019829001956480564, -0.14028151364214458, 0.20420831938231873, -0.1389047410056898, -0.21496745327492292, 0.10451489301737059, 0.10874971166850453, 0.05948888459666209, -0.1886999896543619, 0.10999186859867269, -0.12084598896814501, 0.10925850973727953, 0.09924954274960916, -0.09711799649974434, 0.18657826142141012, 0.1414215147855099, -0.07035855889570843, 0.04953066870685422, 0.001463144314428321, -0.11320806551028532, -0.28869046096812295, -0.17277329645091385, -0.18165909709183103, 0.07201756134445807, 0.020186870044180794, -0.10737541541833469, 0.32739372798147603, 0.16942885878726352, 0.07141965701752766, -0.013093958137265284, 0.25260537245188547, 0.07481126815422834, 0.018463353375960705, 0.09738534024559112, 0.3162299044820659, 0.21670088040491922, 0.19881611186164347, -0.11797711202249195, 0.053508233054390536, 0.1433683514913704] |
1,803.02224 | New transiting hot Jupiters discovered by WASP-South, Euler/CORALIE and
TRAPPIST-South | We report the discovery of eight hot-Jupiter exoplanets from the WASP-South
transit survey. WASP-144b has a mass of 0.44 Mj, a radius of 0.85 Rj, and is in
a 2.27-d orbit around a V = 12.9, K2 star which shows a 21-d rotational
modulation. WASP-145Ab is a 0.89 Mj planet in a 1.77-d orbit with a grazing
transit, which means that the planetary radius is not well constrained. The
host is a V = 11.5, K2 star with a companion 5 arcsecs away and 1.4 mags
fainter. WASP-158b is a relatively massive planet at 2.8 Mj with a radius of
1.1 Rj and a 3.66-d orbit. It transits a V = 12.1, F6 star. WASP-159b is a
bloated hot Jupiter (1.4 Rj and 0.55 Mj) in a 3.8-d orbit around a V = 12.9, F9
star. WASP-162b is a massive planet in a relatively long and highly eccentric
orbit (5.2 Mj, P = 9.6 d, e = 0.43). It transits a V = 12.2, K0 star. WASP-168b
is a bloated hot Jupiter (0.42 Mj, 1.5 Rj) in a 4.15-d orbit with a grazing
transit. The host is a V = 12.1, F9 star. WASP-172b is a bloated hot Jupiter
(0.5 Mj; 1.6 Rj) in a 5.48-d orbit around a V = 11.0, F1 star. It is likely to
be the best planet of those reported here for atmospheric characterisation.
WASP-173Ab is a massive planet (3.7 Mj) with a 1.2 Rj radius in a circular
orbit with a period of 1.39 d. The host is a V = 11.3, G3 star, being the
brighter component of the double-star system WDS23366-3437, with a companion 6
arcsecs away and 0.8 mags fainter. One of the two stars shows a rotational
modulation of 7.9 d.
| astro-ph.EP | we report the discovery of eight hotjupiter exoplanets from the waspsouth transit survey wasp144b has a mass of 044 mj a radius of 085 rj and is in a 227d orbit around a v 129 k2 star which shows a 21d rotational modulation wasp145ab is a 089 mj planet in a 177d orbit with a grazing transit which means that the planetary radius is not well constrained the host is a v 115 k2 star with a companion 5 arcsecs away and 14 mags fainter wasp158b is a relatively massive planet at 28 mj with a radius of 11 rj and a 366d orbit it transits a v 121 f6 star wasp159b is a bloated hot jupiter 14 rj and 055 mj in a 38d orbit around a v 129 f9 star wasp162b is a massive planet in a relatively long and highly eccentric orbit 52 mj p 96 d e 043 it transits a v 122 k0 star wasp168b is a bloated hot jupiter 042 mj 15 rj in a 415d orbit with a grazing transit the host is a v 121 f9 star wasp172b is a bloated hot jupiter 05 mj 16 rj in a 548d orbit around a v 110 f1 star it is likely to be the best planet of those reported here for atmospheric characterisation wasp173ab is a massive planet 37 mj with a 12 rj radius in a circular orbit with a period of 139 d the host is a v 113 g3 star being the brighter component of the doublestar system wds233663437 with a companion 6 arcsecs away and 08 mags fainter one of the two stars shows a rotational modulation of 79 d | [['we', 'report', 'the', 'discovery', 'of', 'eight', 'hotjupiter', 'exoplanets', 'from', 'the', 'waspsouth', 'transit', 'survey', 'wasp144b', 'has', 'a', 'mass', 'of', '044', 'mj', 'a', 'radius', 'of', '085', 'rj', 'and', 'is', 'in', 'a', '227d', 'orbit', 'around', 'a', 'v', '129', 'k2', 'star', 'which', 'shows', 'a', '21d', 'rotational', 'modulation', 'wasp145ab', 'is', 'a', '089', 'mj', 'planet', 'in', 'a', '177d', 'orbit', 'with', 'a', 'grazing', 'transit', 'which', 'means', 'that', 'the', 'planetary', 'radius', 'is', 'not', 'well', 'constrained', 'the', 'host', 'is', 'a', 'v', '115', 'k2', 'star', 'with', 'a', 'companion', '5', 'arcsecs', 'away', 'and', '14', 'mags', 'fainter', 'wasp158b', 'is', 'a', 'relatively', 'massive', 'planet', 'at', '28', 'mj', 'with', 'a', 'radius', 'of', '11', 'rj', 'and', 'a', '366d', 'orbit', 'it', 'transits', 'a', 'v', '121', 'f6', 'star', 'wasp159b', 'is', 'a', 'bloated', 'hot', 'jupiter', '14', 'rj', 'and', '055', 'mj', 'in', 'a', '38d', 'orbit', 'around', 'a', 'v', '129', 'f9', 'star', 'wasp162b', 'is', 'a', 'massive', 'planet', 'in', 'a', 'relatively', 'long', 'and', 'highly', 'eccentric', 'orbit', '52', 'mj', 'p', '96', 'd', 'e', '043', 'it', 'transits', 'a', 'v', '122', 'k0', 'star', 'wasp168b', 'is', 'a', 'bloated', 'hot', 'jupiter', '042', 'mj', '15', 'rj', 'in', 'a', '415d', 'orbit', 'with', 'a', 'grazing', 'transit', 'the', 'host', 'is', 'a', 'v', '121', 'f9', 'star', 'wasp172b', 'is', 'a', 'bloated', 'hot', 'jupiter', '05', 'mj', '16', 'rj', 'in', 'a', '548d', 'orbit', 'around', 'a', 'v', '110', 'f1', 'star', 'it', 'is', 'likely', 'to', 'be', 'the', 'best', 'planet', 'of', 'those', 'reported', 'here', 'for', 'atmospheric', 'characterisation', 'wasp173ab', 'is', 'a', 'massive', 'planet', '37', 'mj', 'with', 'a', '12', 'rj', 'radius', 'in', 'a', 'circular', 'orbit', 'with', 'a', 'period', 'of', '139', 'd', 'the', 'host', 'is', 'a', 'v', '113', 'g3', 'star', 'being', 'the', 'brighter', 'component', 'of', 'the', 'doublestar', 'system', 'wds233663437', 'with', 'a', 'companion', '6', 'arcsecs', 'away', 'and', '08', 'mags', 'fainter', 'one', 'of', 'the', 'two', 'stars', 'shows', 'a', 'rotational', 'modulation', 'of', '79', 'd']] | [-0.19375910770434934, 0.16647537862829698, -0.09940714993399014, -0.008008047040161234, -0.0938895997532019, -0.15089987208264485, 0.1280238911411847, 0.3336157956394308, -0.10414962066435134, -0.37763307865862544, 0.10439483136362013, -0.3436178523447183, -0.043260914912754286, 0.1807067315896436, -0.13780536314765557, -0.028260458961882617, 0.16632395961552104, 0.029492725411513716, -0.07405559776642112, -0.2563287303835321, 0.1587559305923234, -0.005279881952937399, -0.03923403802728943, -0.023382380991923007, 0.02916152458611792, -0.03881318376147561, 0.02548890084140299, -0.10309081201438097, -0.21193026599473924, 0.03980204653280895, 0.14735250582583667, 0.06253692768566478, 0.24467130757012398, -0.15478060634332372, -0.1625552333975106, 0.01591725583442867, 0.11627046605537224, -0.04385192269565754, -0.026860232246962937, -0.2485537894823578, 0.180106214774347, -0.28120076276138706, -0.21084079003896328, 0.16465267185679872, 0.23782240584068007, -0.042375296056061315, -0.290362631213199, 0.11519744685041798, 0.09090457530910226, 0.1847269310762457, -0.12650760389037766, -0.165378394185684, -0.12454369448889256, -0.04122244639929091, -0.0701644744049088, 0.19095938523345338, 0.1371553211284571, -0.016423302313682626, 0.00609596053091286, 0.44537165247196897, -0.1478942637096337, -0.00021723811584437608, 0.2215302483796069, -0.24089762579984544, -0.08774985020198904, 0.2220707167962859, 0.09671629045319077, 0.1857211101444417, -0.1779619574892136, 0.011562432598912119, -0.00989501226563896, 0.2468453736906899, 0.11377197133607408, -0.005280861342395569, 0.4436959728113749, 0.16982817685943138, 0.09307856949775267, 0.009906296811436307, -0.283789265925267, 0.03271411507292773, -0.11852599849945374, -0.10094981070796258, -0.14579075829135532, 0.13700615898327778, -0.12679692210853258, -0.05513926187848667, 0.359331153294818, 0.015536868409340859, 0.24543627723092248, 0.008140578750025634, 0.2273947071154996, 0.069379985086578, 0.06810715823062156, 0.15845616009916538, 0.3195601418677173, 0.22962603473526597, 0.08051021903324244, -0.19568894306208226, -0.04754333770642064, -0.032832478604729425] |
1,803.02225 | Subspace Tracking and Least Squares Approaches to Channel Estimation in
Millimeter Wave Multiuser MIMO | The problem of MIMO channel estimation at millimeter wave frequencies, both
in a single-user and in a multi-user setting, is tackled in this paper. Using a
subspace approach, we develop a protocol enabling the estimation of the right
(resp. left) singular vectors at the transmitter (resp. receiver) side; then,
we adapt the projection approximation subspace tracking with deflation and the
orthogonal Oja algorithms to our framework and obtain two channel estimation
algorithms. We also present an alternative algorithm based on the least squares
approach. The hybrid analog/digital nature of the beamformer is also explicitly
taken into account at the algorithm design stage. In order to limit the system
complexity, a fixed analog beamformer is used at both sides of the
communication links. The obtained numerical results, showing the accuracy in
the estimation of the channel matrix dominant singular vectors, the system
achievable spectral efficiency, and the system bit-error-rate, prove that the
proposed algorithms are effective, and that they compare favorably, in terms of
the performance-complexity trade-off, with respect to several competing
alternatives.
| cs.IT math.IT | the problem of mimo channel estimation at millimeter wave frequencies both in a singleuser and in a multiuser setting is tackled in this paper using a subspace approach we develop a protocol enabling the estimation of the right resp left singular vectors at the transmitter resp receiver side then we adapt the projection approximation subspace tracking with deflation and the orthogonal oja algorithms to our framework and obtain two channel estimation algorithms we also present an alternative algorithm based on the least squares approach the hybrid analogdigital nature of the beamformer is also explicitly taken into account at the algorithm design stage in order to limit the system complexity a fixed analog beamformer is used at both sides of the communication links the obtained numerical results showing the accuracy in the estimation of the channel matrix dominant singular vectors the system achievable spectral efficiency and the system biterrorrate prove that the proposed algorithms are effective and that they compare favorably in terms of the performancecomplexity tradeoff with respect to several competing alternatives | [['the', 'problem', 'of', 'mimo', 'channel', 'estimation', 'at', 'millimeter', 'wave', 'frequencies', 'both', 'in', 'a', 'singleuser', 'and', 'in', 'a', 'multiuser', 'setting', 'is', 'tackled', 'in', 'this', 'paper', 'using', 'a', 'subspace', 'approach', 'we', 'develop', 'a', 'protocol', 'enabling', 'the', 'estimation', 'of', 'the', 'right', 'resp', 'left', 'singular', 'vectors', 'at', 'the', 'transmitter', 'resp', 'receiver', 'side', 'then', 'we', 'adapt', 'the', 'projection', 'approximation', 'subspace', 'tracking', 'with', 'deflation', 'and', 'the', 'orthogonal', 'oja', 'algorithms', 'to', 'our', 'framework', 'and', 'obtain', 'two', 'channel', 'estimation', 'algorithms', 'we', 'also', 'present', 'an', 'alternative', 'algorithm', 'based', 'on', 'the', 'least', 'squares', 'approach', 'the', 'hybrid', 'analogdigital', 'nature', 'of', 'the', 'beamformer', 'is', 'also', 'explicitly', 'taken', 'into', 'account', 'at', 'the', 'algorithm', 'design', 'stage', 'in', 'order', 'to', 'limit', 'the', 'system', 'complexity', 'a', 'fixed', 'analog', 'beamformer', 'is', 'used', 'at', 'both', 'sides', 'of', 'the', 'communication', 'links', 'the', 'obtained', 'numerical', 'results', 'showing', 'the', 'accuracy', 'in', 'the', 'estimation', 'of', 'the', 'channel', 'matrix', 'dominant', 'singular', 'vectors', 'the', 'system', 'achievable', 'spectral', 'efficiency', 'and', 'the', 'system', 'biterrorrate', 'prove', 'that', 'the', 'proposed', 'algorithms', 'are', 'effective', 'and', 'that', 'they', 'compare', 'favorably', 'in', 'terms', 'of', 'the', 'performancecomplexity', 'tradeoff', 'with', 'respect', 'to', 'several', 'competing', 'alternatives']] | [-0.17485365775132247, -0.02004948913769155, -0.08324300196173406, 0.023970359273905985, -0.01954117660318653, -0.20884927053906044, 0.049025321508579085, 0.3887928742685269, -0.26657103534874527, -0.2413609064184806, 0.14269001236548215, -0.257248362441355, -0.1886112078114651, 0.15552965238917793, -0.07775964957748562, 0.09252789697534036, 0.0725627118710775, 0.03253299669162262, -0.09660533843034078, -0.2569716481578558, 0.27845429247759584, 0.08575277454436345, 0.31818670591577713, -0.005828740333780906, 0.15385375502735896, 0.009418007616511395, -0.01320555800745307, -0.025166048442262636, -0.11232429345825018, 0.1100271908203573, 0.29592998798389725, 0.1646164411335079, 0.2737212523298208, -0.38087661318524285, -0.16949445455941523, 0.10947278187458598, 0.19059232111917376, 0.08631858046350697, -0.003998595413746486, -0.28042205984617563, 0.10583723705467703, -0.1845736504656934, -0.04837656660319501, -0.012271218479686785, -0.10846894945906, -0.010770027192213389, -0.34204595717926356, 0.025635268011767968, 0.03689626302721715, -0.005966088176856554, -0.06576309979590046, -0.17309045674736873, 0.07531547548958685, 0.11353542460541534, 0.016075174193585638, 0.01276246864324284, 0.060467601909442954, -0.08604870329145342, -0.12977103136383744, 0.34705287199819373, -0.040873059000532945, -0.26335113350339884, 0.16825959579660396, -0.10620865520349769, -0.08544487782569905, 0.15126670034450673, 0.21788749203822294, 0.08554255401277049, -0.12125021843699911, 0.06735466472665119, -0.012440975954357485, 0.1497340782675459, 0.05224399207576806, 0.0815268930719169, 0.12219843639299101, 0.1739518897253262, 0.1275733515273693, 0.14786297432282333, -0.12680009608854118, -0.08351780130625377, -0.25148928294304845, -0.12910033488608247, -0.21698344942333914, -0.06395628932033676, -0.12945092227646668, -0.0957486649506812, 0.39898284256111743, 0.1815528066309039, 0.14825341241910708, 0.12834640233073558, 0.40809130748777195, 0.12494011062568292, 0.006069720879760246, 0.1370534405862198, 0.21667465836562347, 0.1343683409396299, 0.08355487029468857, -0.251284335470531, 0.03374298883407095, 0.07776734702354081] |
1,803.02226 | Epitaxial UN and $\alpha$-U$_2$N$_3$ Thin Films | Single crystal epitaxial thin films of UN and U$_2$N$_3$ have been grown for
the first time by reactive DC magnetron sputtering. These films provide ideal
samples for fundamental research into the potential accident tolerant fuel, UN,
and U$_2$N$_3$, its intermediate oxidation product. Films were characterised
using x-ray diffraction (XRD) and x-ray photoelectron spectroscopy (XPS), with
XRD analysis showing both thin films to be [001] oriented and composed of a
single domain. The specular lattice parameters of the UN and U$_2$N$_3$ films
were found to be 4.895\,\AA{} and 10.72\,\AA{}, respectively, with the UN film
having a miscut of 2.6\,$^\circ$. XPS showed significant differences in the
N-1s peak between the two films, with area analysis showing both films to be
stoichiometric.
| cond-mat.mtrl-sci | single crystal epitaxial thin films of un and u_2n_3 have been grown for the first time by reactive dc magnetron sputtering these films provide ideal samples for fundamental research into the potential accident tolerant fuel un and u_2n_3 its intermediate oxidation product films were characterised using xray diffraction xrd and xray photoelectron spectroscopy xps with xrd analysis showing both thin films to be 001 oriented and composed of a single domain the specular lattice parameters of the un and u_2n_3 films were found to be 4895aa and 1072aa respectively with the un film having a miscut of 26circ xps showed significant differences in the n1s peak between the two films with area analysis showing both films to be stoichiometric | [['single', 'crystal', 'epitaxial', 'thin', 'films', 'of', 'un', 'and', 'u_2n_3', 'have', 'been', 'grown', 'for', 'the', 'first', 'time', 'by', 'reactive', 'dc', 'magnetron', 'sputtering', 'these', 'films', 'provide', 'ideal', 'samples', 'for', 'fundamental', 'research', 'into', 'the', 'potential', 'accident', 'tolerant', 'fuel', 'un', 'and', 'u_2n_3', 'its', 'intermediate', 'oxidation', 'product', 'films', 'were', 'characterised', 'using', 'xray', 'diffraction', 'xrd', 'and', 'xray', 'photoelectron', 'spectroscopy', 'xps', 'with', 'xrd', 'analysis', 'showing', 'both', 'thin', 'films', 'to', 'be', '001', 'oriented', 'and', 'composed', 'of', 'a', 'single', 'domain', 'the', 'specular', 'lattice', 'parameters', 'of', 'the', 'un', 'and', 'u_2n_3', 'films', 'were', 'found', 'to', 'be', '4895aa', 'and', '1072aa', 'respectively', 'with', 'the', 'un', 'film', 'having', 'a', 'miscut', 'of', '26circ', 'xps', 'showed', 'significant', 'differences', 'in', 'the', 'n1s', 'peak', 'between', 'the', 'two', 'films', 'with', 'area', 'analysis', 'showing', 'both', 'films', 'to', 'be', 'stoichiometric']] | [-0.050852845498543776, 0.16226243774325022, -0.08443326698456946, -0.08196990717695947, 0.013092425182207018, -0.14452213645538586, 0.07924618258371822, 0.5032877764768071, -0.24446166342355183, -0.3414971660026628, 0.09183001001146582, -0.3662562439393284, -0.03206106770632423, 0.21883202421242118, -0.009615237856458904, 0.09112077623727119, -0.038446531710652716, -0.16914918872455142, -0.0893326778633721, -0.23714908546744248, 0.23583345393735805, 0.04059170935955694, 0.37398245422225285, 0.07141196902475169, 0.036273447142985575, 0.013076011652154768, 0.09061762844371554, 0.026428391074395586, -0.1336312990428673, 0.060595467696603164, 0.29980812274898666, -0.09916219263512673, 0.1262111595680571, -0.511498001913548, -0.24477037470728064, -0.022613593611993596, 0.09908737882207601, 0.01346844134446329, -0.13805796553153926, -0.24772949596373445, 0.11775474025346498, -0.07843052768685783, -0.047491299201392084, -0.06210200541103498, -0.06331396375138026, 0.015882721568784144, -0.22758408723116463, 0.05404146554537563, 0.00982686137366626, 0.1616621890511268, -0.14015058546354914, -0.15116849230228263, -0.17209255062919268, 0.0534682851523543, 0.05194248510604231, 0.06410303485428548, 0.2089859994335307, -0.04076182132220676, -0.09476429610672352, 0.32011797978009426, -0.02385167607989831, -0.043453097534485355, 0.13643136591865465, -0.21153030614169616, -0.10118613342762503, 0.17927823087566683, 0.06671911659879355, 0.14187824632176477, -0.13682575636885613, 0.05419980711801153, 0.0010865302836028938, 0.2808123194318042, 0.20094361164185226, -0.007247882162849618, 0.20479021340799639, 0.22939631561191481, -0.04840156309501642, 0.14531254465592244, -0.1461411039902168, 0.07561874602181025, -0.12308524067426084, -0.2405661959360298, -0.12471691730161572, 0.08495681435387167, -0.09210625347909199, -0.22251154246748003, 0.3212356668196491, 0.019403955966839168, 0.10454842667931165, -0.05535346824520578, 0.22040768723107046, 0.0402742629377251, 0.031055362509070043, -0.017913017429920852, 0.21896896707928842, 0.17606180903708768, 0.13375280050458346, -0.23473043868748042, 0.1435264086462239, -0.0284619777996698] |
1,803.02227 | Multifield Polygonal Bounces | We propose a new approach for computing tunneling rates in quantum or thermal
field theory with multiple scalar fields. It is based on exact analytical
solutions of piecewise linear potentials with many segments that describes any
given potential to arbitrary precision. The method is first developed for the
single field case in 3 and 4 space-time dimensions and demonstrated on examples
of classical potentials as well as the calculation of quantum fluctuations. A
systematic expansion of the potential beyond the linear order is considered,
taking into account higher order corrections, which paves the way for multiple
scalar fields. We thereby provide a fast semi-analytical tool for evaluating
the bounce action for theories with an extended scalar sector.
| hep-th gr-qc hep-ph | we propose a new approach for computing tunneling rates in quantum or thermal field theory with multiple scalar fields it is based on exact analytical solutions of piecewise linear potentials with many segments that describes any given potential to arbitrary precision the method is first developed for the single field case in 3 and 4 spacetime dimensions and demonstrated on examples of classical potentials as well as the calculation of quantum fluctuations a systematic expansion of the potential beyond the linear order is considered taking into account higher order corrections which paves the way for multiple scalar fields we thereby provide a fast semianalytical tool for evaluating the bounce action for theories with an extended scalar sector | [['we', 'propose', 'a', 'new', 'approach', 'for', 'computing', 'tunneling', 'rates', 'in', 'quantum', 'or', 'thermal', 'field', 'theory', 'with', 'multiple', 'scalar', 'fields', 'it', 'is', 'based', 'on', 'exact', 'analytical', 'solutions', 'of', 'piecewise', 'linear', 'potentials', 'with', 'many', 'segments', 'that', 'describes', 'any', 'given', 'potential', 'to', 'arbitrary', 'precision', 'the', 'method', 'is', 'first', 'developed', 'for', 'the', 'single', 'field', 'case', 'in', '3', 'and', '4', 'spacetime', 'dimensions', 'and', 'demonstrated', 'on', 'examples', 'of', 'classical', 'potentials', 'as', 'well', 'as', 'the', 'calculation', 'of', 'quantum', 'fluctuations', 'a', 'systematic', 'expansion', 'of', 'the', 'potential', 'beyond', 'the', 'linear', 'order', 'is', 'considered', 'taking', 'into', 'account', 'higher', 'order', 'corrections', 'which', 'paves', 'the', 'way', 'for', 'multiple', 'scalar', 'fields', 'we', 'thereby', 'provide', 'a', 'fast', 'semianalytical', 'tool', 'for', 'evaluating', 'the', 'bounce', 'action', 'for', 'theories', 'with', 'an', 'extended', 'scalar', 'sector']] | [-0.12262848631725606, 0.10406118646996895, -0.07688083128733003, 0.0679250537391959, -0.04692545691186674, -0.1611830993857967, -0.007880359558730872, 0.32571793099244434, -0.19636934123232833, -0.28910189690307164, 0.06636866290245651, -0.23456728295622092, -0.15899260705695129, 0.23343429916625857, 0.030790987086251505, 0.0838288945169785, -0.01001266079644362, 0.05779480776360505, -0.046906143981111675, -0.24241531122889784, 0.32070034660765123, 0.039870756767833464, 0.23417970765696472, 0.059175779020143114, 0.11047831586060616, 0.050610720386935606, -0.015530813986865373, 0.04212711246696134, -0.1096340197233138, 0.12340941905784301, 0.19710522417265636, 0.07580526856084664, 0.2565440077446083, -0.44981827340128583, -0.2628186838661567, 0.08113071109112512, 0.15216342565945834, 0.2001689065906466, -0.08890003887498672, -0.27548350806897265, 0.07348182521617183, -0.18146760625223446, -0.17486202193057945, -0.1468126607230968, 0.007409211186469238, -0.025963119573445402, -0.3148808586689779, 0.07121753618399748, 0.01646245474843547, 0.032050994177086234, -0.07624838268782339, -0.09102168884207933, 0.05725354957394302, 0.12217954193783176, 0.027328099304726586, 0.040384624579236805, 0.09568203014767386, -0.1509345814279225, -0.14715281108286804, 0.4011332286983474, -0.12567318797023952, -0.22381777598116642, 0.15717533032776007, -0.126593852455481, -0.09414860132174233, 0.10536304782502927, 0.15926734450607535, 0.13682781240274, -0.15197356088230243, 0.14897143388959047, 0.06713035135951817, 0.12770151146130365, 0.05354122861296448, 0.018429077099053524, 0.22661159031936884, 0.12764052549997965, 0.052619290485894546, 0.13567911931432974, -0.04776584271453003, -0.14681821009223786, -0.35231333712422347, -0.17373631347336957, -0.13862142689191762, 0.04231225535209872, -0.13282831845398094, -0.1968749306268162, 0.40986718375108433, 0.13011682989686713, 0.1575422127587864, 0.07620685109490545, 0.3196237033320607, 0.16189000058847552, 0.07342967841551344, 0.054769981943039045, 0.21347405201492783, 0.15110409036915526, 0.07495873858833797, -0.18009528561702204, -0.0402587080000239, 0.08115473514995895] |
1,803.02228 | A lower bound for the Bogomolny-Schmit constant for random monochromatic
plane waves | This note deals with nodal domains of random monochromatic plane waves. It
was shown by Nazarov and Sodin that the expected number of such nodal domains
included in a disk of radius $R$ is proportional to $\pi R^2$ in the large $R$
limit. However, very little is known on the value of the proportionality
constant from a mathematical point of view. The aim of this note is to obtain a
lower bound on the value of this constant my elementary means.
| math-ph math.MP math.PR math.SP | this note deals with nodal domains of random monochromatic plane waves it was shown by nazarov and sodin that the expected number of such nodal domains included in a disk of radius r is proportional to pi r2 in the large r limit however very little is known on the value of the proportionality constant from a mathematical point of view the aim of this note is to obtain a lower bound on the value of this constant my elementary means | [['this', 'note', 'deals', 'with', 'nodal', 'domains', 'of', 'random', 'monochromatic', 'plane', 'waves', 'it', 'was', 'shown', 'by', 'nazarov', 'and', 'sodin', 'that', 'the', 'expected', 'number', 'of', 'such', 'nodal', 'domains', 'included', 'in', 'a', 'disk', 'of', 'radius', 'r', 'is', 'proportional', 'to', 'pi', 'r2', 'in', 'the', 'large', 'r', 'limit', 'however', 'very', 'little', 'is', 'known', 'on', 'the', 'value', 'of', 'the', 'proportionality', 'constant', 'from', 'a', 'mathematical', 'point', 'of', 'view', 'the', 'aim', 'of', 'this', 'note', 'is', 'to', 'obtain', 'a', 'lower', 'bound', 'on', 'the', 'value', 'of', 'this', 'constant', 'my', 'elementary', 'means']] | [-0.17851608762852444, 0.08590228436514735, -0.06243067127824933, 0.04769823939344029, -0.09519415291279186, -0.08848606323087473, 0.06208614181773162, 0.28754642056473706, -0.24635385073445462, -0.2831606375467446, 0.11354816207995662, -0.30324816737714927, -0.11895645000572305, 0.20042962962646543, -0.10829245239312266, 0.02919141633183132, 0.0045354945792092215, 0.07401698285046919, -0.026375282368979153, -0.24052771967030878, 0.3242971463514101, 0.04454852976364854, 0.22917302475989232, 0.08254407336475489, 0.04558854619684963, -0.011799903615251368, -0.03732421023219272, 0.030989032089250322, -0.19785241724358782, 0.13367453426766543, 0.22555737323300154, 0.07637593654892695, 0.2638047000933669, -0.3572800419534798, -0.1593934714127286, 0.09305378014112559, 0.12286785801435694, 0.07643505261763987, -0.010553250310620592, -0.21013376983687465, 0.09035142162745749, -0.12444273493379171, -0.18238176326669844, 0.03571763658827102, 0.09807709886772949, 0.026683989778609463, -0.232791425694746, 0.049909358389997556, 0.10735283038912365, 0.07332070268414638, -0.011599259002617112, -0.1560945845393027, 0.019706733812244585, 0.0623450585997399, 0.1074517685316365, 0.1277746410155094, 0.04842215061279727, -0.09249225913340019, -0.035017594056962816, 0.37971099914500006, -0.0967264485625941, -0.18896436555610027, 0.1647769216445194, -0.1823856894352278, -0.08921857938791315, 0.13173543438775304, 0.11767869403896232, 0.15803004944995966, -0.100994645755876, 0.16182227782189362, -0.1023812365680818, 0.1904863923070176, 0.08842294357349108, -0.01739043807955804, 0.19998961602004223, 0.11495986069196168, 0.11596565737308544, 0.13512180554738015, -0.0454927529035895, -0.06894949676445973, -0.3316294178366661, -0.1307392283033775, -0.25927256115131586, 0.1116965983816089, -0.08907832556966848, -0.17099207841013672, 0.3584022328349543, 0.0915537311574789, 0.2290149454464331, 0.05843532969025366, 0.24451543404548257, 0.12279136526041928, 0.03446857489208564, 0.07242519937938562, 0.2470606653491196, 0.14364199360752086, 0.08916760499899586, -0.16981029354918312, 0.061487453202084624, 0.06489359513844972] |
1,803.02229 | A Microscopic Model of the Stokes-Einstein Relation in Arbitrary
Dimension | The Stokes-Einstein relation (SER) is one of the most robust and widely
employed results from the theory of liquids. Yet sizable deviations can be
observed for self-solvation, which cannot be explained by the standard
hydrodynamic derivation. Here, we revisit the work of Masters and Madden [J.
Chem. Phys. 74, 2450-2459 (1981)], who first solved a statistical mechanics
model of the SER using the projection operator formalism. By generalizing their
analysis to all spatial dimensions and to partially structured solvents, we
identify a potential microscopic origin of some of these deviations. We also
reproduce the SER-like result from the exact dynamics of infinite-dimensional
fluids.
| cond-mat.stat-mech | the stokeseinstein relation ser is one of the most robust and widely employed results from the theory of liquids yet sizable deviations can be observed for selfsolvation which cannot be explained by the standard hydrodynamic derivation here we revisit the work of masters and madden j chem phys 74 24502459 1981 who first solved a statistical mechanics model of the ser using the projection operator formalism by generalizing their analysis to all spatial dimensions and to partially structured solvents we identify a potential microscopic origin of some of these deviations we also reproduce the serlike result from the exact dynamics of infinitedimensional fluids | [['the', 'stokeseinstein', 'relation', 'ser', 'is', 'one', 'of', 'the', 'most', 'robust', 'and', 'widely', 'employed', 'results', 'from', 'the', 'theory', 'of', 'liquids', 'yet', 'sizable', 'deviations', 'can', 'be', 'observed', 'for', 'selfsolvation', 'which', 'can', 'not', 'be', 'explained', 'by', 'the', 'standard', 'hydrodynamic', 'derivation', 'here', 'we', 'revisit', 'the', 'work', 'of', 'masters', 'and', 'madden', 'j', 'chem', 'phys', '74', '24502459', '1981', 'who', 'first', 'solved', 'a', 'statistical', 'mechanics', 'model', 'of', 'the', 'ser', 'using', 'the', 'projection', 'operator', 'formalism', 'by', 'generalizing', 'their', 'analysis', 'to', 'all', 'spatial', 'dimensions', 'and', 'to', 'partially', 'structured', 'solvents', 'we', 'identify', 'a', 'potential', 'microscopic', 'origin', 'of', 'some', 'of', 'these', 'deviations', 'we', 'also', 'reproduce', 'the', 'serlike', 'result', 'from', 'the', 'exact', 'dynamics', 'of', 'infinitedimensional', 'fluids']] | [-0.038694716399849054, 0.07383249737184015, -0.1265939022575754, 0.06199831904331683, -0.039835075601142377, -0.1537704798070216, 0.05557816157735294, 0.2857508644793588, -0.2406826638213202, -0.3168415061686889, 0.05588641594910976, -0.25268946455256774, -0.2064050842203473, 0.15459384604375626, -0.08762295680157471, 0.0212398292179828, -0.0018471987032801797, -0.049438224360807845, -0.05108851203141679, -0.21656136618152555, 0.23372362769384047, 0.07952464711253006, 0.23358542893899115, 0.0596302097460421, 0.070508871483386, 0.004382421716697293, -0.03843979957965341, 0.057848623536508714, -0.16594067143534522, 0.1077803067821493, 0.25673986014928485, 0.07570414956875772, 0.20648813395216914, -0.4185179311339513, -0.22305701183394924, 0.09144511930690617, 0.10811811084640074, 0.15529318255174093, 0.03049706631699706, -0.29369514369138394, 0.05671325114804624, -0.19560921395031533, -0.15501068228634424, -0.10086739800944186, 0.04508690071283, -0.0028343647487904175, -0.23489408848327722, 0.15572605619298083, 0.09359753742297687, 0.06962788376108844, -0.056557589295864255, -0.1320791365809296, -0.0015806643854789804, 0.09173107277694167, 0.052894701534596335, 0.027968401969917636, 0.09262745419867557, -0.08576611414699271, -0.14107299271491494, 0.39963121371491267, -0.05205330478562282, -0.18142617552882373, 0.22875868385233503, -0.1498052585491966, -0.1344023800528802, 0.09183444902485255, 0.13808574543177787, 0.12093005192899468, -0.2247204466072824, 0.10686897931592816, -0.07752181009601543, 0.14235868373664445, 0.07427108479838929, -0.009449951971378547, 0.18268187369893094, 0.10173107953373306, -0.07800339500760974, 0.05940903738224049, -0.07455830942230797, -0.14467842379898424, -0.30190127772638703, -0.15283656411543908, -0.20856003392381722, 0.07718472920331095, -0.046856585207267314, -0.09196681226834212, 0.3801855036140521, 0.16743262098309133, 0.14947804427788694, 0.048404302483765725, 0.2050592072012991, 0.12814294925826317, 0.020040375261226356, 0.10819409908911232, 0.28855289336170603, 0.19258405222548264, 0.08439530440523188, -0.21965600019505266, 0.038840506795222066, 0.09365440077507997] |
1,803.0223 | Non-fringe subtrees in conditioned Galton--Watson trees | We study $S(\mathcal T_{n})$, the number of subtrees in a conditioned
Galton--Watson tree of size $n$. With two very different methods, we show that
$\log(S(\mathcal T_{n}))$ has a Central Limit Law and that the moments of
$S(\mathcal T_{n})$ are of exponential scale.
| math.CO math.PR | we study smathcal t_n the number of subtrees in a conditioned galtonwatson tree of size n with two very different methods we show that logsmathcal t_n has a central limit law and that the moments of smathcal t_n are of exponential scale | [['we', 'study', 'smathcal', 't_n', 'the', 'number', 'of', 'subtrees', 'in', 'a', 'conditioned', 'galtonwatson', 'tree', 'of', 'size', 'n', 'with', 'two', 'very', 'different', 'methods', 'we', 'show', 'that', 'logsmathcal', 't_n', 'has', 'a', 'central', 'limit', 'law', 'and', 'that', 'the', 'moments', 'of', 'smathcal', 't_n', 'are', 'of', 'exponential', 'scale']] | [-0.16582988029936466, 0.2661284122661483, -0.08722900263056522, 0.03111427986040348, -0.01763310733183128, -0.06302471307288038, 0.0916544057701419, 0.3823764131563466, -0.23991957134226474, -0.25016112162209136, 0.09458421264695595, -0.3480658396715071, -0.09767411632758634, 0.12693996111885075, -0.016669965246919452, 0.03842473382175696, 0.02242760975822443, 0.13913494902776508, -0.008210478384592912, -0.27002671644909354, 0.299508523167588, -0.013153943210476783, 0.24534677523301868, 0.01221894883982292, 0.11361318499576754, -0.025044551414505737, 0.05859077853582254, 0.08671807051386411, -0.14308093366867625, 0.08341654766032972, 0.23511201656627945, 0.09446624875432108, 0.24940772254656002, -0.3498821803709356, -0.10818108779991545, 0.15855408839245394, 0.1698150001807002, 0.05371548276303745, 0.0003459504237625657, -0.2042195072636099, 0.16578558132779309, -0.10777649994394402, -0.11142329517297628, -0.04876913091667542, 0.05746683555587036, 0.08889712170107154, -0.2919629251629841, 0.07385911129233313, 0.21661518882142333, 0.08372013476427372, 0.028569345305696492, -0.1925017389400703, -0.03182715963481403, 0.11809132317444537, 0.0798951185694555, 0.017130977241322398, 0.08975751437928255, -0.11090623960608798, -0.13132408692887643, 0.287612716531063, -0.09469716414445783, -0.08430313950449955, 0.1586666605321736, -0.24980565951001354, -0.23660824471721198, 0.12083850831656558, 0.13193024206543114, 0.14823895074209203, -0.12302450551764994, 0.20410514968055551, -0.08844664629276205, 0.17685940016697094, 0.10634179639334722, 0.0019102292362509704, 0.15339809983241848, 0.2059171653647975, 0.10077087567528574, 0.18256036519277385, -0.07191838760201524, -0.06529016349828098, -0.2904884275503275, -0.1258770359634626, -0.2545901605314234, 0.08385212528632909, -0.23748792256988166, -0.21533701625629897, 0.30412578978007887, 0.17096851604831656, 0.33768741718334394, 0.18425689596773648, 0.1388483334605287, 0.1412785201924058, 0.0409347352390064, 0.08625499288911403, 0.040294562080284445, 0.1771398909935137, 0.048622287179502406, -0.22047646632190884, 0.04093531010354438, 0.13131533769845236] |
1,803.02231 | Controlling quantum random walk with a step-dependent coin | We report on the possibility of controlling quantum random walks with a
step-dependent coin. The coin is characterized by a (single) rotation angle.
Considering different rotation angles, one can find diverse probability
distributions for this walk including: complete localization, Gaussian and
asymmetric likes. In addition, we explore the entropy of walk in two contexts;
for probability density distributions over position space and walker's internal
degrees of freedom space (coin space). We show that entropy of position space
can decrease for a step-dependent coin with the step-number, quite in contrast
to a walk with step-independent coin. For entropy of coin space, a damped
oscillation is found for walk with step-independent coin while for a
step-dependent coin case, the behavior of entropy depends on rotation angle. In
general, we demonstrate that quantum walks with simple initiatives may exhibit
a quite complex and varying behavior if step-dependent coins are applied. This
provides the possibility of controlling quantum random walk with a
step-dependent coin.
| quant-ph | we report on the possibility of controlling quantum random walks with a stepdependent coin the coin is characterized by a single rotation angle considering different rotation angles one can find diverse probability distributions for this walk including complete localization gaussian and asymmetric likes in addition we explore the entropy of walk in two contexts for probability density distributions over position space and walkers internal degrees of freedom space coin space we show that entropy of position space can decrease for a stepdependent coin with the stepnumber quite in contrast to a walk with stepindependent coin for entropy of coin space a damped oscillation is found for walk with stepindependent coin while for a stepdependent coin case the behavior of entropy depends on rotation angle in general we demonstrate that quantum walks with simple initiatives may exhibit a quite complex and varying behavior if stepdependent coins are applied this provides the possibility of controlling quantum random walk with a stepdependent coin | [['we', 'report', 'on', 'the', 'possibility', 'of', 'controlling', 'quantum', 'random', 'walks', 'with', 'a', 'stepdependent', 'coin', 'the', 'coin', 'is', 'characterized', 'by', 'a', 'single', 'rotation', 'angle', 'considering', 'different', 'rotation', 'angles', 'one', 'can', 'find', 'diverse', 'probability', 'distributions', 'for', 'this', 'walk', 'including', 'complete', 'localization', 'gaussian', 'and', 'asymmetric', 'likes', 'in', 'addition', 'we', 'explore', 'the', 'entropy', 'of', 'walk', 'in', 'two', 'contexts', 'for', 'probability', 'density', 'distributions', 'over', 'position', 'space', 'and', 'walkers', 'internal', 'degrees', 'of', 'freedom', 'space', 'coin', 'space', 'we', 'show', 'that', 'entropy', 'of', 'position', 'space', 'can', 'decrease', 'for', 'a', 'stepdependent', 'coin', 'with', 'the', 'stepnumber', 'quite', 'in', 'contrast', 'to', 'a', 'walk', 'with', 'stepindependent', 'coin', 'for', 'entropy', 'of', 'coin', 'space', 'a', 'damped', 'oscillation', 'is', 'found', 'for', 'walk', 'with', 'stepindependent', 'coin', 'while', 'for', 'a', 'stepdependent', 'coin', 'case', 'the', 'behavior', 'of', 'entropy', 'depends', 'on', 'rotation', 'angle', 'in', 'general', 'we', 'demonstrate', 'that', 'quantum', 'walks', 'with', 'simple', 'initiatives', 'may', 'exhibit', 'a', 'quite', 'complex', 'and', 'varying', 'behavior', 'if', 'stepdependent', 'coins', 'are', 'applied', 'this', 'provides', 'the', 'possibility', 'of', 'controlling', 'quantum', 'random', 'walk', 'with', 'a', 'stepdependent', 'coin']] | [-0.14883225318637622, 0.2671450005227308, -0.10307644876491302, 0.014250173500389051, -0.03401357430229141, -0.23337115157561697, 0.07294269662593628, 0.4164131602901182, -0.2348899372681311, -0.24659578263712156, 0.07147174148529672, -0.26225562013424697, -0.13092055420278553, 0.19200688603209556, -0.1201048361339197, 0.03921714442882948, 0.043958462353582216, 0.051383455587954374, -0.05549741117432001, -0.226226929160707, 0.3051110255134523, 0.012462583172526567, 0.25849432853246285, -0.03092404203430103, 0.13949138255327181, 0.06507792256128897, 0.014693337360657989, 0.027417119428371585, -0.12983339295952778, 0.05670568788910558, 0.131977798132475, 0.05911095556951347, 0.2561025539128359, -0.34751295830437523, -0.18485623989906755, 0.13486717236791826, 0.1454684405919805, 0.16613328336310948, -0.0776851131643056, -0.3063351593742586, -0.03603099906375145, -0.13692526630523383, -0.15253511558703567, -0.05592227167788015, 0.04611102163578105, 0.004652166145536337, -0.2674548167877706, 0.06938945148496112, -0.00034397018325936263, 0.056753431033650055, 0.04295241423425781, -0.05774837574894855, -0.007855863126504953, 0.13077968073961366, -0.020587028843605783, 0.0050955664562610135, 0.14683582589837016, -0.11021419709761905, -0.20444423427129058, 0.39779340905866994, -0.04871369900098842, -0.25278636566049995, 0.11030048884119198, -0.22895869229783772, -0.1382012363511381, 0.044678540431722334, 0.15404343983502525, 0.1090009868186513, -0.07900802966112354, 0.061404110388133294, -0.04736342226306368, 0.12178529479843415, 0.07885696641970308, 0.06721411996549233, 0.20050680446052913, 0.10596221093396851, 0.14859706882956872, 0.17647603427054018, -0.0994703354088554, -0.20391139878363462, -0.2637038661617857, -0.15338926432968658, -0.23795818448493813, 0.11891048697600509, -0.16099466979891064, -0.17501225196115025, 0.4289203409230111, 0.12324395058024082, 0.24541764403248478, 0.09716328183058531, 0.23201345315997957, 0.10389554893277633, -0.004235237282196618, 0.07355044220995371, 0.14717822531416158, 0.08711927719443895, 0.09072958410845085, -0.2038141132798046, 0.15718310951866257, 0.03621780002418502] |
1,803.02232 | Optimal Stochastic Package Delivery Planning with Deadline: A
Cardinality Minimization in Routing | Vehicle Routing Problem with Private fleet and common Carrier (VRPPC) has
been proposed to help a supplier manage package delivery services from a single
depot to multiple customers. Most of the existing VRPPC works consider
deterministic parameters which may not be practical and uncertainty has to be
taken into account. In this paper, we propose the Optimal Stochastic Delivery
Planning with Deadline (ODPD) to help a supplier plan and optimize the package
delivery. The aim of ODPD is to service all customers within a given deadline
while considering the randomness in customer demands and traveling time. We
formulate the ODPD as a stochastic integer programming, and use the cardinality
minimization approach for calculating the deadline violation probability. To
accelerate computation, the L-shaped decomposition method is adopted. We
conduct extensive performance evaluation based on real customer locations and
traveling time from Google Map.
| cs.AI math.OC | vehicle routing problem with private fleet and common carrier vrppc has been proposed to help a supplier manage package delivery services from a single depot to multiple customers most of the existing vrppc works consider deterministic parameters which may not be practical and uncertainty has to be taken into account in this paper we propose the optimal stochastic delivery planning with deadline odpd to help a supplier plan and optimize the package delivery the aim of odpd is to service all customers within a given deadline while considering the randomness in customer demands and traveling time we formulate the odpd as a stochastic integer programming and use the cardinality minimization approach for calculating the deadline violation probability to accelerate computation the lshaped decomposition method is adopted we conduct extensive performance evaluation based on real customer locations and traveling time from google map | [['vehicle', 'routing', 'problem', 'with', 'private', 'fleet', 'and', 'common', 'carrier', 'vrppc', 'has', 'been', 'proposed', 'to', 'help', 'a', 'supplier', 'manage', 'package', 'delivery', 'services', 'from', 'a', 'single', 'depot', 'to', 'multiple', 'customers', 'most', 'of', 'the', 'existing', 'vrppc', 'works', 'consider', 'deterministic', 'parameters', 'which', 'may', 'not', 'be', 'practical', 'and', 'uncertainty', 'has', 'to', 'be', 'taken', 'into', 'account', 'in', 'this', 'paper', 'we', 'propose', 'the', 'optimal', 'stochastic', 'delivery', 'planning', 'with', 'deadline', 'odpd', 'to', 'help', 'a', 'supplier', 'plan', 'and', 'optimize', 'the', 'package', 'delivery', 'the', 'aim', 'of', 'odpd', 'is', 'to', 'service', 'all', 'customers', 'within', 'a', 'given', 'deadline', 'while', 'considering', 'the', 'randomness', 'in', 'customer', 'demands', 'and', 'traveling', 'time', 'we', 'formulate', 'the', 'odpd', 'as', 'a', 'stochastic', 'integer', 'programming', 'and', 'use', 'the', 'cardinality', 'minimization', 'approach', 'for', 'calculating', 'the', 'deadline', 'violation', 'probability', 'to', 'accelerate', 'computation', 'the', 'lshaped', 'decomposition', 'method', 'is', 'adopted', 'we', 'conduct', 'extensive', 'performance', 'evaluation', 'based', 'on', 'real', 'customer', 'locations', 'and', 'traveling', 'time', 'from', 'google', 'map']] | [-0.15134607922961332, -0.0007522157213034135, -0.06169169478800515, 0.030923969598493577, -0.14248056157859385, -0.1918215506323154, 0.14368775036287637, 0.40922638235784226, -0.2872057788108449, -0.3196626930025367, 0.12572093212872115, -0.27175402734756576, -0.0887317042928976, 0.13807179570250527, -0.13634334922859176, 0.12797285096054162, 0.06975950526965546, 0.03448686734724029, 0.005652576198487405, -0.28612224112468126, 0.22054704251489274, 0.0640692371599586, 0.30119590805581126, 0.08547725316471565, 0.09863084857680009, 0.045334184784966876, -0.02113531746542488, -0.0053726026778516, -0.1090917589952907, 0.10494972692235228, 0.34204178442522676, 0.2663825510322234, 0.3421750089914446, -0.46028940235330185, -0.19120794884912984, 0.12637568979760186, 0.11003847487072434, 0.04153167852610481, -0.025255092826317733, -0.2727629036026102, 0.07412881852934321, -0.22679111711733357, -0.05645691259669035, -0.029158653625824923, -0.008543812496010477, 0.05278347643759613, -0.3138442330855981, -0.04187865851735565, -0.07064538319188525, -0.007949937213684472, -0.08631942403489645, -0.10520677215708288, 0.025707117026068375, 0.18783431364433237, 0.08577303636432167, 0.031003586347805152, 0.13012360694365654, -0.0555762550350882, -0.15542449932676597, 0.4509754405212654, -0.004624730146581858, -0.20175978399462288, 0.10584682340464804, -0.03421529478550902, -0.15159803946194253, 0.12818907506757377, 0.28145673229526336, 0.08169012390483747, -0.23658672936054104, 0.021284765735248918, -0.013058248553162729, 0.14554804366108187, 0.07373528302037223, -0.012662756601086175, 0.1769038951959015, 0.2223299146124857, 0.149882090064815, 0.14261649871527046, -0.04536915999963473, -0.12038526189854552, -0.2087581831216648, -0.1631929025227781, -0.17651990206967907, 0.020144310737341072, -0.08208531409466777, -0.1068797668730709, 0.38280046295741915, 0.18982801339703834, 0.11021441596389657, 0.12384756324684877, 0.39360121811385934, 0.11784137226559195, 0.03314630137953225, 0.16875120142514122, 0.10218865877840484, -0.03160113351777012, 0.154731163628806, -0.2099858606398158, 0.1545397694563677, 0.05364680703250613] |
1,803.02233 | Predictability of sequences and subsequences with spectrum degeneracy at
periodically located points | The paper established sufficient conditions of predictability with degeneracy
for the spectrum at $M$-periodically located isolated points on the unit
circle. It is also shown that $m$-periodic subsequences of these sequences are
also predictable if $m$ is a divisor of $M$. The predictability can be achieved
for finite horizon with linear predictors defined by convolutions with certain
kernels. As an example of applications, it is shown that there exists a class
of sequences that is everywhere dense in the class of all square-summable
sequences and such that its members can be recovered from their periodic
subsequences. This recoverability is associated with certain spectrum
degeneracy of a new kind.
| cs.IT math.IT math.SP | the paper established sufficient conditions of predictability with degeneracy for the spectrum at mperiodically located isolated points on the unit circle it is also shown that mperiodic subsequences of these sequences are also predictable if m is a divisor of m the predictability can be achieved for finite horizon with linear predictors defined by convolutions with certain kernels as an example of applications it is shown that there exists a class of sequences that is everywhere dense in the class of all squaresummable sequences and such that its members can be recovered from their periodic subsequences this recoverability is associated with certain spectrum degeneracy of a new kind | [['the', 'paper', 'established', 'sufficient', 'conditions', 'of', 'predictability', 'with', 'degeneracy', 'for', 'the', 'spectrum', 'at', 'mperiodically', 'located', 'isolated', 'points', 'on', 'the', 'unit', 'circle', 'it', 'is', 'also', 'shown', 'that', 'mperiodic', 'subsequences', 'of', 'these', 'sequences', 'are', 'also', 'predictable', 'if', 'm', 'is', 'a', 'divisor', 'of', 'm', 'the', 'predictability', 'can', 'be', 'achieved', 'for', 'finite', 'horizon', 'with', 'linear', 'predictors', 'defined', 'by', 'convolutions', 'with', 'certain', 'kernels', 'as', 'an', 'example', 'of', 'applications', 'it', 'is', 'shown', 'that', 'there', 'exists', 'a', 'class', 'of', 'sequences', 'that', 'is', 'everywhere', 'dense', 'in', 'the', 'class', 'of', 'all', 'squaresummable', 'sequences', 'and', 'such', 'that', 'its', 'members', 'can', 'be', 'recovered', 'from', 'their', 'periodic', 'subsequences', 'this', 'recoverability', 'is', 'associated', 'with', 'certain', 'spectrum', 'degeneracy', 'of', 'a', 'new', 'kind']] | [-0.16741133903188057, 0.1366725723602141, -0.07113569809959452, 0.06936466585514005, -0.027569873016936895, -0.12333179794896011, 0.015106096011847606, 0.39506706390007634, -0.3207236694119801, -0.23975173874853928, 0.16568001526708184, -0.27741044918162244, -0.18492445508975572, 0.2260929078612233, -0.1046666446594504, 0.050483050912283535, 0.11056325511591265, 0.10726352180049659, -0.05547358099997879, -0.27355111458243053, 0.35489528964787165, 0.004870144442533291, 0.21760042303537724, 0.01589587307317513, 0.106433306585684, -0.04262472345780964, 0.03459644397485688, 0.05278275813907385, -0.10172845317169406, 0.09518251342646708, 0.25482215786300527, 0.13764255341995402, 0.27264162309676687, -0.3233516874470722, -0.19443447775181347, 0.1795411744964457, 0.1331147202377634, 0.006437412637207552, -0.0465782040688775, -0.24601588283326023, 0.1683556355751407, -0.10519528677948167, -0.14732939788688706, -0.07531756885071224, 0.060428732993063804, 0.07568755746322954, -0.3001387549790545, 0.03106801535566468, 0.10423273629743919, 0.05401653041801999, -0.02541208538448734, -0.06357812282202818, -0.057091357447555134, 0.14151086863217371, 0.0685378438923682, 0.03377878094509801, 0.046747029389071965, -0.07206513837771926, -0.07976058028882073, 0.37059883411242583, -0.0529129809621617, -0.23089831634032948, 0.18953652712124808, -0.17427044459749189, -0.1459142492070063, 0.14599287339320807, 0.0851030569332086, 0.13392658407199326, -0.12812417720348757, 0.11513181433688727, -0.10147254958435475, 0.15416707605924282, 0.11898592210627187, 0.07242411951682418, 0.23205343734311967, 0.11235647628553838, 0.13696783314955152, 0.12345087010126178, -0.05446102385568023, -0.035299724981919904, -0.32248541093039734, -0.12614572311046524, -0.22008731211078675, 0.07088852372068355, -0.09137695023741586, -0.2064359335541055, 0.3629097004777917, 0.07157503292356208, 0.2074943110346794, 0.11405761568659098, 0.1888975362134575, 0.14651373600223858, 0.08189487415170035, 0.07765151872343132, 0.14274074025147498, 0.09428685868733397, 0.026847541261525287, -0.15508424537909157, 0.058483413555528795, 0.07375769272759974] |
1,803.02234 | Dynamics of defect-induced dark solitons in an exciton-polariton
condensate | We study theoretically the emission of dark solitons induced by a moving
defect in a nonresonantly pumped exciton-polariton condensate. The number of
created dark solitons per unit of time is found to be strongly dependent on the
pump power. We relate the observed dynamics of this process to the oscillations
of the drag force experienced by the condensate. We investigate the stability
of the polariton quantum fluid and present various types of dynamics depending
on the condensate and moving obstacle parameters. Furthermore, we provide
analytical expressions for dark soliton dynamics using the variational method
adapted to the non-equilibrium polariton system. The determined dynamical
equations are found to be in excellent agreement with the results of numerical
simulations.
| cond-mat.quant-gas | we study theoretically the emission of dark solitons induced by a moving defect in a nonresonantly pumped excitonpolariton condensate the number of created dark solitons per unit of time is found to be strongly dependent on the pump power we relate the observed dynamics of this process to the oscillations of the drag force experienced by the condensate we investigate the stability of the polariton quantum fluid and present various types of dynamics depending on the condensate and moving obstacle parameters furthermore we provide analytical expressions for dark soliton dynamics using the variational method adapted to the nonequilibrium polariton system the determined dynamical equations are found to be in excellent agreement with the results of numerical simulations | [['we', 'study', 'theoretically', 'the', 'emission', 'of', 'dark', 'solitons', 'induced', 'by', 'a', 'moving', 'defect', 'in', 'a', 'nonresonantly', 'pumped', 'excitonpolariton', 'condensate', 'the', 'number', 'of', 'created', 'dark', 'solitons', 'per', 'unit', 'of', 'time', 'is', 'found', 'to', 'be', 'strongly', 'dependent', 'on', 'the', 'pump', 'power', 'we', 'relate', 'the', 'observed', 'dynamics', 'of', 'this', 'process', 'to', 'the', 'oscillations', 'of', 'the', 'drag', 'force', 'experienced', 'by', 'the', 'condensate', 'we', 'investigate', 'the', 'stability', 'of', 'the', 'polariton', 'quantum', 'fluid', 'and', 'present', 'various', 'types', 'of', 'dynamics', 'depending', 'on', 'the', 'condensate', 'and', 'moving', 'obstacle', 'parameters', 'furthermore', 'we', 'provide', 'analytical', 'expressions', 'for', 'dark', 'soliton', 'dynamics', 'using', 'the', 'variational', 'method', 'adapted', 'to', 'the', 'nonequilibrium', 'polariton', 'system', 'the', 'determined', 'dynamical', 'equations', 'are', 'found', 'to', 'be', 'in', 'excellent', 'agreement', 'with', 'the', 'results', 'of', 'numerical', 'simulations']] | [-0.1689388025392834, 0.1715157894282323, -0.1226427205082061, 0.04484201796944206, -0.01134299530655655, -0.0943171266420609, 0.011570862401376327, 0.3697834595814984, -0.22643655608607155, -0.29630198454261464, 0.030921552113344908, -0.25282064295158935, -0.09733347451855612, 0.20084842688077661, 0.03813216513675502, 0.06379925192166598, 0.029149108136502597, 0.011464631008073831, 0.006792589066884456, -0.2311056266657204, 0.32083916727803713, 0.0077230557829189375, 0.28600661686629564, 0.0829749404747262, 0.10394201721820949, -0.037586075705515906, 0.013648231203357378, 0.005200113520089887, -0.22517314735458244, 0.08284306865679021, 0.16027561905316245, 0.0032180226049744166, 0.2183294509175337, -0.48655544066976786, -0.23063452371483684, 0.08584574708699161, 0.1937474182400948, 0.16731828291956177, -0.09306268020867346, -0.33344060628332645, 0.014165382497967819, -0.14586443464375204, -0.17619865019527128, -0.06728672563634677, -0.002097068083846671, 0.09638128912426595, -0.2232411874888035, 0.11343301528603093, 0.009730769900165291, 0.016234048737738378, -0.10012529510606685, -0.017215258572210804, -0.053013749241542354, 0.055800277049728855, 0.029592493218399633, -0.014673979461400045, 0.18448610038647795, -0.16672850019919375, -0.09305457445657533, 0.4040083556284762, -0.15767743151224992, -0.1902411680349694, 0.1608175292221081, -0.14376465340829495, -0.023671731086145353, 0.1478462789235557, 0.1727388128399467, 0.11628433751961233, -0.1187912442554266, 0.00951499171837623, -0.04302337624005273, 0.17335018566530994, 0.08317980711133434, 0.04630911887694761, 0.2587736788022722, 0.20310975483650517, 0.008768577120688736, 0.1745305622442283, -0.07055005913306925, -0.14762146767372122, -0.2776885684579611, -0.11645748073824196, -0.18290919142687678, 0.025266400577190023, -0.05051788365698229, -0.1263942519027708, 0.4232257510511539, 0.13441433296260288, 0.16659987626326644, -0.0022552786494454, 0.296156382586202, 0.19024963710759568, -0.00043249824362942297, 0.04497432251038969, 0.2913013394348897, 0.1628066440208409, 0.0967883720723355, -0.34859560549649227, -0.03355738172769292, 0.028163663591218427] |
1,803.02235 | Generalized Designs on Graphs: Sampling, Spectra, Symmetries | Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$
with the property that the average of certain (low-degree) polynomials in these
points coincides with the global average of the polynomial on $\mathbb{S}^{d}$.
They are evenly distributed and often exhibit a great degree of regularity and
symmetry. We point out that a spectral definition of spherical designs easily
transfers to finite graphs -- these 'graphical designs' are subsets of vertices
that are evenly spaced and capture the symmetries of the underlying graph
(should they exist). Our main result states that good graphical designs either
consist of many vertices or their neighborhoods have exponential volume growth.
We show several examples, describe ways to find them and discuss problems.
| math.CO cs.NA math.FA math.NA math.SP | spherical designs are finite sets of points on the sphere mathbbsd with the property that the average of certain lowdegree polynomials in these points coincides with the global average of the polynomial on mathbbsd they are evenly distributed and often exhibit a great degree of regularity and symmetry we point out that a spectral definition of spherical designs easily transfers to finite graphs these graphical designs are subsets of vertices that are evenly spaced and capture the symmetries of the underlying graph should they exist our main result states that good graphical designs either consist of many vertices or their neighborhoods have exponential volume growth we show several examples describe ways to find them and discuss problems | [['spherical', 'designs', 'are', 'finite', 'sets', 'of', 'points', 'on', 'the', 'sphere', 'mathbbsd', 'with', 'the', 'property', 'that', 'the', 'average', 'of', 'certain', 'lowdegree', 'polynomials', 'in', 'these', 'points', 'coincides', 'with', 'the', 'global', 'average', 'of', 'the', 'polynomial', 'on', 'mathbbsd', 'they', 'are', 'evenly', 'distributed', 'and', 'often', 'exhibit', 'a', 'great', 'degree', 'of', 'regularity', 'and', 'symmetry', 'we', 'point', 'out', 'that', 'a', 'spectral', 'definition', 'of', 'spherical', 'designs', 'easily', 'transfers', 'to', 'finite', 'graphs', 'these', 'graphical', 'designs', 'are', 'subsets', 'of', 'vertices', 'that', 'are', 'evenly', 'spaced', 'and', 'capture', 'the', 'symmetries', 'of', 'the', 'underlying', 'graph', 'should', 'they', 'exist', 'our', 'main', 'result', 'states', 'that', 'good', 'graphical', 'designs', 'either', 'consist', 'of', 'many', 'vertices', 'or', 'their', 'neighborhoods', 'have', 'exponential', 'volume', 'growth', 'we', 'show', 'several', 'examples', 'describe', 'ways', 'to', 'find', 'them', 'and', 'discuss', 'problems']] | [-0.16028297522988838, 0.1161417324318845, -0.08289450325039971, 0.07598350858952627, -0.06430482098625766, -0.11930989712062809, 0.01429004963232666, 0.43809026021621805, -0.26107129914702004, -0.2754617591396484, 0.13027623418965337, -0.303652942698035, -0.15164866252467993, 0.17549937289868855, -0.10246875914088331, 0.04768072793053256, 0.07297760381116572, 0.031616341255000256, -0.07095898750524682, -0.3112554243364288, 0.33036723823991054, -0.021429778976190802, 0.27470317701848906, -0.004345486048035896, 0.0702752360684049, -0.029428435029968437, -0.013759870010499772, 0.044311790002716914, -0.1346914974236801, 0.14232624400731447, 0.2587173050786886, 0.13431938264805537, 0.24543122101861697, -0.43067494025215125, -0.17923526184904015, 0.1818780228833899, 0.12034987563537991, 0.04676160745672945, -0.014412361939445648, -0.21737048348300478, 0.11867743047177155, -0.08951331353952818, -0.1539404652415751, -0.09803685172496793, -0.00929590641385597, 0.12135362158913532, -0.24318699034042338, -0.003534444313273471, 0.11153643874403758, 0.08772298914945534, 0.0018529408575537114, -0.16461729156808594, -0.04317900355563013, 0.12035121649511668, 0.012095810021631993, -0.03961360418341226, 0.09700598151514578, -0.056657608007439055, -0.12466460109477401, 0.3577442123498927, 0.07053665304158488, -0.23698580702846375, 0.2229428961773554, -0.1592634679753588, -0.1326744420071825, 0.12718976078093305, 0.17712085275377473, 0.10791273654685316, -0.07104321175979243, 0.1001683027169102, -0.10062647675378965, 0.1209986683662332, 0.13176674084363776, 0.05758867419969577, 0.20944243425933215, 0.05485718421494731, 0.11549263071561328, 0.13141261687070432, -0.020717553828960348, -0.1304353355254946, -0.3275649509527999, -0.10640864771528122, -0.18925868333755141, 0.02663028759197292, -0.17655445360648248, -0.223204541617097, 0.39847453168601304, 0.06962777973494978, 0.22112912563288695, 0.08638750609312938, 0.2201802521609725, 0.0665126262505292, 0.09379561647621548, 0.12679416367018737, 0.1493573022297878, 0.10292569286404894, -0.00763423702854695, -0.13506488826346752, 0.014209155082845917, 0.053494241474689834] |
1,803.02236 | Hybrid Wired-Wireless Backhaul Solutions for Heterogeneous Ultra-Dense
Networks | Wireless networks are becoming extremely pervasive while traffic demand is
ever increasing. In order to cope with the forecast increase in traffic volume
for the upcoming years, as well as the number of connected devices, new
technologies, practices and spectrum rearrangements are required. In this
context, a key question arises: how to provide extensive backhaul connectivity
and capacity for pervasive ultra dense networks? The answer is rather complex,
if feasible. To shed some light into this issue we overview potential
technologies, either wired or wireless, and identify technical challenges.
Moreover, we evaluate an illustrative scenario of a ultra-dense network that
operates with hybrid wired-wireless backhaul. We assume multiple radio access
technologies at small and macro base stations (BSs), and we discuss optimal
traffic splitting and routing solutions for different topologies and traffic
profiles.
| cs.NI | wireless networks are becoming extremely pervasive while traffic demand is ever increasing in order to cope with the forecast increase in traffic volume for the upcoming years as well as the number of connected devices new technologies practices and spectrum rearrangements are required in this context a key question arises how to provide extensive backhaul connectivity and capacity for pervasive ultra dense networks the answer is rather complex if feasible to shed some light into this issue we overview potential technologies either wired or wireless and identify technical challenges moreover we evaluate an illustrative scenario of a ultradense network that operates with hybrid wiredwireless backhaul we assume multiple radio access technologies at small and macro base stations bss and we discuss optimal traffic splitting and routing solutions for different topologies and traffic profiles | [['wireless', 'networks', 'are', 'becoming', 'extremely', 'pervasive', 'while', 'traffic', 'demand', 'is', 'ever', 'increasing', 'in', 'order', 'to', 'cope', 'with', 'the', 'forecast', 'increase', 'in', 'traffic', 'volume', 'for', 'the', 'upcoming', 'years', 'as', 'well', 'as', 'the', 'number', 'of', 'connected', 'devices', 'new', 'technologies', 'practices', 'and', 'spectrum', 'rearrangements', 'are', 'required', 'in', 'this', 'context', 'a', 'key', 'question', 'arises', 'how', 'to', 'provide', 'extensive', 'backhaul', 'connectivity', 'and', 'capacity', 'for', 'pervasive', 'ultra', 'dense', 'networks', 'the', 'answer', 'is', 'rather', 'complex', 'if', 'feasible', 'to', 'shed', 'some', 'light', 'into', 'this', 'issue', 'we', 'overview', 'potential', 'technologies', 'either', 'wired', 'or', 'wireless', 'and', 'identify', 'technical', 'challenges', 'moreover', 'we', 'evaluate', 'an', 'illustrative', 'scenario', 'of', 'a', 'ultradense', 'network', 'that', 'operates', 'with', 'hybrid', 'wiredwireless', 'backhaul', 'we', 'assume', 'multiple', 'radio', 'access', 'technologies', 'at', 'small', 'and', 'macro', 'base', 'stations', 'bss', 'and', 'we', 'discuss', 'optimal', 'traffic', 'splitting', 'and', 'routing', 'solutions', 'for', 'different', 'topologies', 'and', 'traffic', 'profiles']] | [-0.246890305776037, 0.09095930976583536, 0.030040769494677846, 0.0766943449505055, -0.0976086681204519, -0.19977718250146767, 0.10638649711609446, 0.41730187127464696, -0.2633772395215088, -0.30348500647210985, 0.138711853908669, -0.28865150538014067, -0.17935780732353268, 0.1729810744702564, -0.13097856261004182, 0.03724478054231495, 0.08381732263430756, -0.00015318612598716035, 0.030581737213761062, -0.2311697890465603, 0.31486760652659085, 0.06562807187227938, 0.3830266462400892, 0.12113002365931197, 0.03585030224972537, -0.061171621325796934, -0.06541479917862837, 0.0013804631088895345, -0.06809722060273984, 0.14300284250044173, 0.3745438244221802, 0.19947014170999927, 0.29710659883300167, -0.5184538492414736, -0.294280933706384, 0.13028998250015697, 0.17784798027828505, 0.02750764942826017, -0.05689214556600506, -0.259405097679088, 0.13668126493860455, -0.23987615060173256, -0.1280765538855545, -0.061907649958415197, -0.006734011974885948, 0.07863971591652266, -0.2847291354748203, -0.033263208279368656, -0.07376249939206764, 0.030307699833415393, -0.032983111793239234, -0.05923302863073304, 0.030171629882599683, 0.16889896660279902, 0.027004241427197196, -0.011368515789228723, 0.12264915372252017, -0.1636127793921934, -0.09958736585887303, 0.38939114420191573, 0.026421176804460697, -0.13482887740071892, 0.19224926392911912, -0.050029092494580416, -0.16133482011273168, 0.08070200332090315, 0.2616668748144144, 0.02699264321700299, -0.17711325357423016, 0.012025945046583988, 0.03225085923546239, 0.14130778286494033, 0.062156465427978036, 0.12363641814913433, 0.20802691587267963, 0.28973239311542276, 0.18213567387354665, 0.0910882793600615, -0.09111276727617908, -0.10663410024787474, -0.19605846982142938, -0.11723893342532665, -0.16499841129897455, 0.061275074433507326, -0.07889673336073354, -0.09883413320281227, 0.33674921899249677, 0.15672627078103168, 0.16249889518393384, 0.061806351286044024, 0.40877994224149033, 0.027604482281967102, 0.07814816098408144, 0.1434170953943429, 0.13702593969793456, 0.06498891379180036, 0.23355245656908064, -0.1368167230761365, 0.05088138002272051, -0.05059783478596605] |
1,803.02237 | Robust Odometry using Sensor Consensus Analysis | Odometry forms an important component of many manned and autonomous systems.
In the rail industry in particular, having precise and robust odometry is
crucial for the correct operation of the Automatic Train Protection systems
that ensure the safety of high-speed trains in operation around the world. Two
problems commonly encountered in such odometry systems are miscalibration of
the wheel encoders and slippage of the wheels under acceleration and braking,
resulting in incorrect velocity estimates. This paper introduces an odometry
system that addresses these problems. It comprises of an Extended Kalman Filter
that tracks the calibration of the wheel encoders as state variables, and a
measurement pre-processing stage called Sensor Consensus Analysis (SCA) that
scales the uncertainty of a measurement based on how consistent it is with the
measurements from the other sensors. SCA uses the statistical z-test to
determine when an individual measurement is inconsistent with the other
measurements, and scales the uncertainty until the z-test passes. This system
is demonstrated on data from German Intercity-Express high-speed trains and it
is shown to successfully deal with errors due to miscalibration and wheel slip.
| cs.RO | odometry forms an important component of many manned and autonomous systems in the rail industry in particular having precise and robust odometry is crucial for the correct operation of the automatic train protection systems that ensure the safety of highspeed trains in operation around the world two problems commonly encountered in such odometry systems are miscalibration of the wheel encoders and slippage of the wheels under acceleration and braking resulting in incorrect velocity estimates this paper introduces an odometry system that addresses these problems it comprises of an extended kalman filter that tracks the calibration of the wheel encoders as state variables and a measurement preprocessing stage called sensor consensus analysis sca that scales the uncertainty of a measurement based on how consistent it is with the measurements from the other sensors sca uses the statistical ztest to determine when an individual measurement is inconsistent with the other measurements and scales the uncertainty until the ztest passes this system is demonstrated on data from german intercityexpress highspeed trains and it is shown to successfully deal with errors due to miscalibration and wheel slip | [['odometry', 'forms', 'an', 'important', 'component', 'of', 'many', 'manned', 'and', 'autonomous', 'systems', 'in', 'the', 'rail', 'industry', 'in', 'particular', 'having', 'precise', 'and', 'robust', 'odometry', 'is', 'crucial', 'for', 'the', 'correct', 'operation', 'of', 'the', 'automatic', 'train', 'protection', 'systems', 'that', 'ensure', 'the', 'safety', 'of', 'highspeed', 'trains', 'in', 'operation', 'around', 'the', 'world', 'two', 'problems', 'commonly', 'encountered', 'in', 'such', 'odometry', 'systems', 'are', 'miscalibration', 'of', 'the', 'wheel', 'encoders', 'and', 'slippage', 'of', 'the', 'wheels', 'under', 'acceleration', 'and', 'braking', 'resulting', 'in', 'incorrect', 'velocity', 'estimates', 'this', 'paper', 'introduces', 'an', 'odometry', 'system', 'that', 'addresses', 'these', 'problems', 'it', 'comprises', 'of', 'an', 'extended', 'kalman', 'filter', 'that', 'tracks', 'the', 'calibration', 'of', 'the', 'wheel', 'encoders', 'as', 'state', 'variables', 'and', 'a', 'measurement', 'preprocessing', 'stage', 'called', 'sensor', 'consensus', 'analysis', 'sca', 'that', 'scales', 'the', 'uncertainty', 'of', 'a', 'measurement', 'based', 'on', 'how', 'consistent', 'it', 'is', 'with', 'the', 'measurements', 'from', 'the', 'other', 'sensors', 'sca', 'uses', 'the', 'statistical', 'ztest', 'to', 'determine', 'when', 'an', 'individual', 'measurement', 'is', 'inconsistent', 'with', 'the', 'other', 'measurements', 'and', 'scales', 'the', 'uncertainty', 'until', 'the', 'ztest', 'passes', 'this', 'system', 'is', 'demonstrated', 'on', 'data', 'from', 'german', 'intercityexpress', 'highspeed', 'trains', 'and', 'it', 'is', 'shown', 'to', 'successfully', 'deal', 'with', 'errors', 'due', 'to', 'miscalibration', 'and', 'wheel', 'slip']] | [-0.12978958179803238, 0.08699069336308729, -0.07723356005070466, -0.001375877304171509, -0.05637877106994063, -0.17058600710991484, -0.013793859845104084, 0.3802219576888032, -0.27154747077652797, -0.32242104247887876, 0.16110818156560597, -0.2830124086377999, -0.13446141407661305, 0.23376282328576015, -0.16745892111570215, 0.10382503724483015, 0.14447434243597704, 0.03714144459393408, -0.009017409150396566, -0.19595032963347825, 0.2625330782720594, 0.07553797896828625, 0.2938826202906177, -0.023002050877459206, 0.17695243919721118, 0.031184284342708743, -0.04119595254715123, -0.0015990204525763517, -0.05272301872709259, 0.09561043304319565, 0.2600221531502429, 0.14235252319006148, 0.2627413422841538, -0.4089180909475864, -0.18094662831492395, 0.0680668403530125, 0.11371409385158056, 0.09035052040049417, -0.019767235349198536, -0.30698407747895345, 0.047306468491544844, -0.16528774873906193, -0.07235369324213364, -0.051161729147309785, 0.028041984189997662, 0.030404766827084862, -0.2894104379309203, 0.03759384925053762, 0.0590253804610776, 0.05366636471372548, -0.04886986227363225, -0.08020506903227255, 0.005669118211589303, 0.16811055043705223, 0.03853353022234412, 0.03039671974717179, 0.15420261508232536, -0.13335884952211527, -0.11380830662744632, 0.3900812888542122, -0.009588602187040333, -0.18272994002432863, 0.18142017165511068, -0.05970189075118729, -0.15300310339399992, 0.11598172399169346, 0.19676203989925292, 0.08090773100995428, -0.17893520722609937, -0.021386759869938533, 0.016455129273798684, 0.21452424610110388, 0.047116329260221634, -0.0014936806286101813, 0.1688274788250635, 0.2020366361536147, 0.1321912207176965, 0.09538379479468298, -0.1562927636486775, -0.08521825261094229, -0.2633589997652222, -0.11869890306971374, -0.1485525021165773, -0.048261647866808574, -0.07025533836465431, -0.1555567003003319, 0.36111815224125327, 0.23848220242755386, 0.16374500621951973, 0.02233179685772284, 0.40404723810062715, 0.08331391632948378, 0.09556770899363763, 0.09081922727381135, 0.2712799643593646, 0.10052108709383142, 0.12342653207411826, -0.2035500767594715, 0.11949992945909009, 0.016356515571485264] |
1,803.02238 | Precise but Natural Specification for Robot Tasks | We present Flipper, a natural language interface for describing high-level
task specifications for robots that are compiled into robot actions. Flipper
starts with a formal core language for task planning that allows expressing
rich temporal specifications and uses a semantic parser to provide a natural
language interface. Flipper provides immediate visual feedback by executing an
automatically constructed plan of the task in a graphical user interface. This
allows the user to resolve potentially ambiguous interpretations. Flipper
extends itself via naturalization: its users can add definitions for
utterances, from which Flipper induces new rules and adds them to the core
language, gradually growing a more and more natural task specification
language. Flipper improves the naturalization by generalizing the definition
provided by users. Unlike other task-specification systems, Flipper enables
natural language interactions while maintaining the expressive power and formal
precision of a programming language. We show through an initial user study that
natural language interactions and generalization can considerably ease the
description of tasks. Moreover, over time, users employ more and more concepts
outside of the initial core language. Such extensions are available to the
Flipper community, and users can use concepts that others have defined.
| cs.RO cs.CL cs.SY | we present flipper a natural language interface for describing highlevel task specifications for robots that are compiled into robot actions flipper starts with a formal core language for task planning that allows expressing rich temporal specifications and uses a semantic parser to provide a natural language interface flipper provides immediate visual feedback by executing an automatically constructed plan of the task in a graphical user interface this allows the user to resolve potentially ambiguous interpretations flipper extends itself via naturalization its users can add definitions for utterances from which flipper induces new rules and adds them to the core language gradually growing a more and more natural task specification language flipper improves the naturalization by generalizing the definition provided by users unlike other taskspecification systems flipper enables natural language interactions while maintaining the expressive power and formal precision of a programming language we show through an initial user study that natural language interactions and generalization can considerably ease the description of tasks moreover over time users employ more and more concepts outside of the initial core language such extensions are available to the flipper community and users can use concepts that others have defined | [['we', 'present', 'flipper', 'a', 'natural', 'language', 'interface', 'for', 'describing', 'highlevel', 'task', 'specifications', 'for', 'robots', 'that', 'are', 'compiled', 'into', 'robot', 'actions', 'flipper', 'starts', 'with', 'a', 'formal', 'core', 'language', 'for', 'task', 'planning', 'that', 'allows', 'expressing', 'rich', 'temporal', 'specifications', 'and', 'uses', 'a', 'semantic', 'parser', 'to', 'provide', 'a', 'natural', 'language', 'interface', 'flipper', 'provides', 'immediate', 'visual', 'feedback', 'by', 'executing', 'an', 'automatically', 'constructed', 'plan', 'of', 'the', 'task', 'in', 'a', 'graphical', 'user', 'interface', 'this', 'allows', 'the', 'user', 'to', 'resolve', 'potentially', 'ambiguous', 'interpretations', 'flipper', 'extends', 'itself', 'via', 'naturalization', 'its', 'users', 'can', 'add', 'definitions', 'for', 'utterances', 'from', 'which', 'flipper', 'induces', 'new', 'rules', 'and', 'adds', 'them', 'to', 'the', 'core', 'language', 'gradually', 'growing', 'a', 'more', 'and', 'more', 'natural', 'task', 'specification', 'language', 'flipper', 'improves', 'the', 'naturalization', 'by', 'generalizing', 'the', 'definition', 'provided', 'by', 'users', 'unlike', 'other', 'taskspecification', 'systems', 'flipper', 'enables', 'natural', 'language', 'interactions', 'while', 'maintaining', 'the', 'expressive', 'power', 'and', 'formal', 'precision', 'of', 'a', 'programming', 'language', 'we', 'show', 'through', 'an', 'initial', 'user', 'study', 'that', 'natural', 'language', 'interactions', 'and', 'generalization', 'can', 'considerably', 'ease', 'the', 'description', 'of', 'tasks', 'moreover', 'over', 'time', 'users', 'employ', 'more', 'and', 'more', 'concepts', 'outside', 'of', 'the', 'initial', 'core', 'language', 'such', 'extensions', 'are', 'available', 'to', 'the', 'flipper', 'community', 'and', 'users', 'can', 'use', 'concepts', 'that', 'others', 'have', 'defined']] | [-0.10019603995799324, 0.029143183430749682, -0.07868179607801043, 0.0881036150726427, -0.24767724147674072, -0.19455966256906332, 0.0707263807088156, 0.3975338170923464, -0.2811669919885927, -0.36098153120476195, 0.004136060651058785, -0.2509066623786689, -0.12884083143170016, 0.2067306218234523, -0.12865206758356582, 0.017062617465552096, 0.10661025225532295, 0.07222780912955909, -0.04527235017616514, -0.19370570551565428, 0.2844551302187405, 0.04872914439385728, 0.249053569955732, 0.03849106450767831, 0.11300196209162416, 0.038736105558747146, -0.04049201408845078, -0.007433136480551579, -0.06599500881634059, 0.1776216917410686, 0.36964956206062066, 0.2798651092410705, 0.306342686644099, -0.4454316942339734, -0.168864857882546, -0.002832108958976565, 0.11847584746015581, 0.0966077747813865, -0.027264018216438188, -0.342753634426183, 0.09529724775649452, -0.22442330533899174, 0.007524670135480752, -0.13037568024827717, 0.026897002226875737, -0.03088620706953383, -0.2653762383906441, -0.04953642570717656, 0.1543670260043419, 0.1250520021255204, -0.017756704727207053, -0.05473071032739365, -0.019680589742697967, 0.1917648850119832, 0.015194850269261111, 0.030109418306374258, 0.17014212166610623, -0.1400621460782065, -0.16138839859930423, 0.41242157324299294, -0.008728032309195229, -0.21795515022650747, 0.2632370954198483, -0.030086667428922312, -0.15185115694604004, 0.06722902695267158, 0.1594815254187298, 0.07145762042784243, -0.1884875404431335, 0.07484176495369436, -0.016974137869176162, 0.23102408272293853, 0.09696847968614163, 0.00764940021447403, 0.24397722832916469, 0.20758420910319517, 0.061306016110704124, 0.16502769054498745, 0.04083940648420115, -0.08353018799767747, -0.2244539432797021, -0.16036173994315142, -0.09215560860430021, -0.05948442148064007, -0.07966164209365113, -0.11637332465094297, 0.4014342813680209, 0.21518963017534715, 0.13862405482868403, 0.15024203871566214, 0.32342163151023917, 0.05910843175020397, 0.12058271311098044, 0.06220667855693462, 0.06823250428059288, 0.025724577145660635, 0.18441240120392022, -0.1376035762694423, 0.11941877467475755, 0.0322166859314637] |
1,803.02239 | Description of limiting vorticities for the magnetic 2D Ginzburg-Landau
equations | Let $\Omega$ be a bounded open set in $\mathbb{R}^2$. The aim of this article
is to describe the functions $h$ in $H^1(\Omega)$ and the Radon measures $\mu$
which satisfy $-\Delta h+h=\mu$ and $ div(T_h)=0$ in $\Omega$, where $T_h$ is a
$2\times 2$ matrix given by $(T_h)_{ij}=2\partial_ih\partial_jh- (|\nabla
h|^2+h^2)\delta_{ij}$ for $i,j=1,2$. These equations arise as equilibrium
conditions satisfied by limiting vorticities and limiting induced magnetic
fields of solutions of the magnetic Ginzburg-Landau equations as shown by
Sandier-Serfaty. Let us recall that they obtained that $|\nabla h|$ is
continuous in $\Omega$. We prove that if $x_0$ in $ \Omega$ belongs to $\supp
\mu$ and is such that $|\nabla h(x_0)|\neq 0$ then $\mu$ is absolutely
continuous with respect to the 1D-Hausdorff measure restricted to a
$\mathcal{C}^1$-curve near $x_0$ whereas $\mu_{\lfloor \{| \nabla
h|=0\}}=h_{|\{ |\nabla h|=0\}}$. We also prove that if $\Omega$ is smooth
bounded and star-shaped and if $h=0$ on $\partial \Omega$ then $h \equiv 0$ in
$\Omega$. This rules out the possibility of having critical points of the
Ginzburg-Landau energy with a number of vortices much larger than the applied
magnetic field $h_{ex}$ in that case.
| math.AP math-ph math.MP | let omega be a bounded open set in mathbbr2 the aim of this article is to describe the functions h in h1omega and the radon measures mu which satisfy delta hhmu and divt_h0 in omega where t_h is a 2times 2 matrix given by t_h_ij2partial_ihpartial_jh nabla h2h2delta_ij for ij12 these equations arise as equilibrium conditions satisfied by limiting vorticities and limiting induced magnetic fields of solutions of the magnetic ginzburglandau equations as shown by sandierserfaty let us recall that they obtained that nabla h is continuous in omega we prove that if x_0 in omega belongs to supp mu and is such that nabla hx_0neq 0 then mu is absolutely continuous with respect to the 1dhausdorff measure restricted to a mathcalc1curve near x_0 whereas mu_lfloor nabla h0h_ nabla h0 we also prove that if omega is smooth bounded and starshaped and if h0 on partial omega then h equiv 0 in omega this rules out the possibility of having critical points of the ginzburglandau energy with a number of vortices much larger than the applied magnetic field h_ex in that case | [['let', 'omega', 'be', 'a', 'bounded', 'open', 'set', 'in', 'mathbbr2', 'the', 'aim', 'of', 'this', 'article', 'is', 'to', 'describe', 'the', 'functions', 'h', 'in', 'h1omega', 'and', 'the', 'radon', 'measures', 'mu', 'which', 'satisfy', 'delta', 'hhmu', 'and', 'divt_h0', 'in', 'omega', 'where', 't_h', 'is', 'a', '2times', '2', 'matrix', 'given', 'by', 't_h_ij2partial_ihpartial_jh', 'nabla', 'h2h2delta_ij', 'for', 'ij12', 'these', 'equations', 'arise', 'as', 'equilibrium', 'conditions', 'satisfied', 'by', 'limiting', 'vorticities', 'and', 'limiting', 'induced', 'magnetic', 'fields', 'of', 'solutions', 'of', 'the', 'magnetic', 'ginzburglandau', 'equations', 'as', 'shown', 'by', 'sandierserfaty', 'let', 'us', 'recall', 'that', 'they', 'obtained', 'that', 'nabla', 'h', 'is', 'continuous', 'in', 'omega', 'we', 'prove', 'that', 'if', 'x_0', 'in', 'omega', 'belongs', 'to', 'supp', 'mu', 'and', 'is', 'such', 'that', 'nabla', 'hx_0neq', '0', 'then', 'mu', 'is', 'absolutely', 'continuous', 'with', 'respect', 'to', 'the', '1dhausdorff', 'measure', 'restricted', 'to', 'a', 'mathcalc1curve', 'near', 'x_0', 'whereas', 'mu_lfloor', 'nabla', 'h0h_', 'nabla', 'h0', 'we', 'also', 'prove', 'that', 'if', 'omega', 'is', 'smooth', 'bounded', 'and', 'starshaped', 'and', 'if', 'h0', 'on', 'partial', 'omega', 'then', 'h', 'equiv', '0', 'in', 'omega', 'this', 'rules', 'out', 'the', 'possibility', 'of', 'having', 'critical', 'points', 'of', 'the', 'ginzburglandau', 'energy', 'with', 'a', 'number', 'of', 'vortices', 'much', 'larger', 'than', 'the', 'applied', 'magnetic', 'field', 'h_ex', 'in', 'that', 'case']] | [-0.16903883076291856, 0.1659617254071934, -0.027654535384837885, 0.011128543060527421, -0.07628254346998928, -0.15712764596588216, 0.023017178040517623, 0.3369556039268541, -0.3107926014399286, -0.17771622268273224, 0.0823468204356221, -0.29581298284925694, -0.07167342583767983, 0.1590591665732317, -0.05688147374353003, 0.024162883883840296, 0.007582506370665722, 0.13490985639306696, -0.06279768536563118, -0.1756635671501795, 0.35387358799316854, -0.11900097920645981, 0.17607360606915642, 0.06459727280686588, 0.08718221507652468, -0.06962047225178414, 0.07851858611548926, 0.03304675881761711, -0.2407405852260803, 0.027178587631571518, 0.22685474415477583, 0.09056029229717286, 0.28512717748797217, -0.3721135090711678, -0.15760379598129454, 0.22790429410849547, 0.16428752068083646, -0.0788278091207504, 0.02615927588830832, -0.312943049510237, 0.16641717754726754, -0.05242086426073382, -0.17586668720671927, -0.06830140946129727, 0.1229123545730714, 0.05894969255381892, -0.3679447309709652, 0.09850376933731199, 0.08430154261322757, 0.02951037410516725, -0.09002461475536747, -0.13455795796133233, -0.0768297165754078, 0.008501525158820631, 0.044031219015461066, 0.18791300182360723, 0.06540178212196414, -0.09836984701389663, -0.013211361891969085, 0.37619800860776975, -0.1189898129564955, -0.2807490359775202, 0.09861634593446154, -0.2485068294170264, -0.12495292494138487, 0.09135372885286289, 0.10678937791326884, 0.15184506854627194, -0.09414956612961886, 0.2294084131372497, -0.04467459060089273, 0.1278271351766307, 0.1140147697134485, -0.014401399887838336, 0.09563765347952857, 0.0869124109780979, 0.16086206325535599, 0.09638897678476412, -0.04193924810009099, -0.011646214355498032, -0.3771739719262303, -0.13797215215298672, -0.16826144465905896, 0.16699419507951757, -0.06297527051017739, -0.136956442115513, 0.28379967968997566, 0.11851369016424775, 0.20870444610282415, 0.05935208320815311, 0.1976103288890404, 0.1596433420180442, 0.006520905728901325, 0.10577867812271295, 0.12003859183020067, 0.18968262805787542, 0.09088476933809647, -0.20583733596005152, -0.013346590769076504, 0.052798547806877504] |
1,803.0224 | Spectroscopic size and thickness metrics for liquid-exfoliated h-BN | For many 2D materials, optical and Raman spectra are richly structured, and
convey information on a range of parameters including nanosheet size and defect
content. By contrast, the equivalent spectra for h-BN are relatively simple,
with both the absorption and Raman spectra consisting of a single feature each,
disclosing relatively little information. Here, the ability to size-select
liquid-exfoliated h-BN nanosheets has allowed us to comprehensively study the
dependence of h-BN optical spectra on nanosheet dimensions. We find the optical
extinction coefficient spectrum to vary systematically with nanosheet lateral
size due to the presence of light scattering. Conversely, once light scattering
has been decoupled to give the optical absorbance spectra, we find the size
dependence to be mostly removed save for a weak but well-defined variation in
energy of peak absorbance with nanosheet thickness. This finding is
corroborated by our ab initio GW and Bethe-Salpeter equation calculations,
which include electron correlations and quasiparticle self-consistency (QSGW).
In addition, while we find the position of the sole h-BN Raman line to be
invariant with nanosheet dimensions, the linewidth appears to vary weakly with
nanosheet thickness. These size-dependent spectroscopic properties can be used
as metrics to estimate nanosheet thickness from spectroscopic data.
| cond-mat.mes-hall physics.app-ph | for many 2d materials optical and raman spectra are richly structured and convey information on a range of parameters including nanosheet size and defect content by contrast the equivalent spectra for hbn are relatively simple with both the absorption and raman spectra consisting of a single feature each disclosing relatively little information here the ability to sizeselect liquidexfoliated hbn nanosheets has allowed us to comprehensively study the dependence of hbn optical spectra on nanosheet dimensions we find the optical extinction coefficient spectrum to vary systematically with nanosheet lateral size due to the presence of light scattering conversely once light scattering has been decoupled to give the optical absorbance spectra we find the size dependence to be mostly removed save for a weak but welldefined variation in energy of peak absorbance with nanosheet thickness this finding is corroborated by our ab initio gw and bethesalpeter equation calculations which include electron correlations and quasiparticle selfconsistency qsgw in addition while we find the position of the sole hbn raman line to be invariant with nanosheet dimensions the linewidth appears to vary weakly with nanosheet thickness these sizedependent spectroscopic properties can be used as metrics to estimate nanosheet thickness from spectroscopic data | [['for', 'many', '2d', 'materials', 'optical', 'and', 'raman', 'spectra', 'are', 'richly', 'structured', 'and', 'convey', 'information', 'on', 'a', 'range', 'of', 'parameters', 'including', 'nanosheet', 'size', 'and', 'defect', 'content', 'by', 'contrast', 'the', 'equivalent', 'spectra', 'for', 'hbn', 'are', 'relatively', 'simple', 'with', 'both', 'the', 'absorption', 'and', 'raman', 'spectra', 'consisting', 'of', 'a', 'single', 'feature', 'each', 'disclosing', 'relatively', 'little', 'information', 'here', 'the', 'ability', 'to', 'sizeselect', 'liquidexfoliated', 'hbn', 'nanosheets', 'has', 'allowed', 'us', 'to', 'comprehensively', 'study', 'the', 'dependence', 'of', 'hbn', 'optical', 'spectra', 'on', 'nanosheet', 'dimensions', 'we', 'find', 'the', 'optical', 'extinction', 'coefficient', 'spectrum', 'to', 'vary', 'systematically', 'with', 'nanosheet', 'lateral', 'size', 'due', 'to', 'the', 'presence', 'of', 'light', 'scattering', 'conversely', 'once', 'light', 'scattering', 'has', 'been', 'decoupled', 'to', 'give', 'the', 'optical', 'absorbance', 'spectra', 'we', 'find', 'the', 'size', 'dependence', 'to', 'be', 'mostly', 'removed', 'save', 'for', 'a', 'weak', 'but', 'welldefined', 'variation', 'in', 'energy', 'of', 'peak', 'absorbance', 'with', 'nanosheet', 'thickness', 'this', 'finding', 'is', 'corroborated', 'by', 'our', 'ab', 'initio', 'gw', 'and', 'bethesalpeter', 'equation', 'calculations', 'which', 'include', 'electron', 'correlations', 'and', 'quasiparticle', 'selfconsistency', 'qsgw', 'in', 'addition', 'while', 'we', 'find', 'the', 'position', 'of', 'the', 'sole', 'hbn', 'raman', 'line', 'to', 'be', 'invariant', 'with', 'nanosheet', 'dimensions', 'the', 'linewidth', 'appears', 'to', 'vary', 'weakly', 'with', 'nanosheet', 'thickness', 'these', 'sizedependent', 'spectroscopic', 'properties', 'can', 'be', 'used', 'as', 'metrics', 'to', 'estimate', 'nanosheet', 'thickness', 'from', 'spectroscopic', 'data']] | [-0.04246553043518121, 0.10676772457158647, -0.057710585966209885, -0.011887975193106281, -0.05623198777607401, -0.15553965744075512, 0.06719106575237767, 0.4863227620947785, -0.25871220728746486, -0.3230382845179192, 0.01580813634067509, -0.3464068476072877, -0.10908990780152807, 0.18445013829525844, 0.01461157745204223, 0.045633530218229836, 0.02787024696590379, -0.07215182467595424, -0.04873058763049013, -0.21334201721580898, 0.28300702033049147, 0.06607125314699515, 0.30117015294532107, 0.11159605549194562, 0.0057189321720991565, 0.015023041182069987, 0.012272490335032723, 0.029855903096232317, -0.17734396586733572, 0.11610966533195549, 0.24152484120621445, -0.04991396649995923, 0.18641937875099063, -0.3922943707820274, -0.2639519471561697, 0.016141971185576493, 0.16610792296646673, 0.13737409543730603, -0.04899795215900723, -0.2392375636698092, 0.06607187518301576, -0.10023556852259385, -0.1195731416101175, -0.08577869356904465, 0.029056941648516188, 0.014369631404480259, -0.22283606311344178, 0.08165985080744446, -0.04035328224840276, 0.07272822253708462, -0.10866346544595577, -0.11900901998071765, -0.11540771979066841, 0.10288560733454406, 0.03266107078362729, -0.013962068579627703, 0.2029439810531091, -0.09114532460438485, -0.03376062664434994, 0.38509603528315345, -0.08941530704564477, -0.11040590563316258, 0.16988014420234424, -0.16932513384647233, -0.06560758651390218, 0.1987743597113655, 0.12981001304245085, 0.09790800097114809, -0.157274121172764, 0.04567196953912156, -0.02405133556933875, 0.27090667433053406, 0.11106520868970204, 0.14346225342599836, 0.19835526627597166, 0.15972744139871053, 0.001449613128422386, 0.10934740279004602, -0.1458251635652735, 0.015137152717954617, -0.18266412615776062, -0.1272915874189475, -0.1928877272113666, 0.0930789574510347, -0.10049691629849568, -0.20704729835382252, 0.40173830087225754, 0.11627712621008457, 0.21256718831018634, 0.01114664275966216, 0.25990477525321815, 0.12425412157512634, 0.11635398314225719, 0.012589498309579296, 0.28542792657390237, 0.17426141581691915, 0.09055579497909107, -0.2432309642636813, 0.05749765798912814, -0.03464758857082443] |
1,803.02241 | On the weak-hash metric for boundedly finite integer-valued measures | It is known that the space of boundedly finite integer-valued measures on a
complete separable metric space becomes itself a complete separable metric
space when endowed with the weak-hash metric. It is also known that convergence
under this topology can be characterised in a way that is similar to the weak
convergence of totally finite measures. However, the original proofs of these
two fundamental results assume that a certain term is monotonic, which is not
the case as we give a counterexample. We manage to clarify these original
proofs by addressing specifically the parts that rely on this assumption and
finding alternative arguments.
| math.PR math.FA | it is known that the space of boundedly finite integervalued measures on a complete separable metric space becomes itself a complete separable metric space when endowed with the weakhash metric it is also known that convergence under this topology can be characterised in a way that is similar to the weak convergence of totally finite measures however the original proofs of these two fundamental results assume that a certain term is monotonic which is not the case as we give a counterexample we manage to clarify these original proofs by addressing specifically the parts that rely on this assumption and finding alternative arguments | [['it', 'is', 'known', 'that', 'the', 'space', 'of', 'boundedly', 'finite', 'integervalued', 'measures', 'on', 'a', 'complete', 'separable', 'metric', 'space', 'becomes', 'itself', 'a', 'complete', 'separable', 'metric', 'space', 'when', 'endowed', 'with', 'the', 'weakhash', 'metric', 'it', 'is', 'also', 'known', 'that', 'convergence', 'under', 'this', 'topology', 'can', 'be', 'characterised', 'in', 'a', 'way', 'that', 'is', 'similar', 'to', 'the', 'weak', 'convergence', 'of', 'totally', 'finite', 'measures', 'however', 'the', 'original', 'proofs', 'of', 'these', 'two', 'fundamental', 'results', 'assume', 'that', 'a', 'certain', 'term', 'is', 'monotonic', 'which', 'is', 'not', 'the', 'case', 'as', 'we', 'give', 'a', 'counterexample', 'we', 'manage', 'to', 'clarify', 'these', 'original', 'proofs', 'by', 'addressing', 'specifically', 'the', 'parts', 'that', 'rely', 'on', 'this', 'assumption', 'and', 'finding', 'alternative', 'arguments']] | [-0.11730047230330277, 0.11770849619471632, -0.143394325403314, 0.12288526855477624, -0.12182193154505655, -0.14460809208799666, 0.03680767429371675, 0.37691063141705944, -0.28127267766816944, -0.20250692717073596, 0.13592313050507002, -0.24608221648297474, -0.18798087719900936, 0.1929735108369998, -0.1227697000984906, -0.014924502479569876, 0.06473737388995349, 0.08394754422353763, -0.09676007006740239, -0.2971640721913062, 0.3967706051257932, -0.0018841228995691327, 0.26135176253121567, 0.0649745036070646, 0.11665261608055409, -0.0013037504098725086, -0.02859785174037896, 0.07858388444925796, -0.13105353466002556, 0.10877386288370426, 0.23635137922532273, 0.1515197704075927, 0.28632443255799656, -0.358380720220214, -0.1953409480469703, 0.1788443843400398, 0.10959432120252327, 0.06640612607817258, -0.02300329087530354, -0.27133623450108824, 0.12765859835324625, -0.11493305379853529, -0.1234189494850808, -0.13387963368429565, 0.01614014644577515, 0.002099429996793761, -0.25179327639532, 0.0036908253892119426, 0.17177596536474118, 0.017880412348199124, -0.0633254490739109, -0.03056654547268123, 0.002122572340144246, 0.0828968921813808, 0.05389287626580792, 0.08289243092796966, 0.06357601439744673, -0.03464283977918254, -0.0938297792020546, 0.3707043817266822, -0.052972318508717066, -0.2964855131884927, 0.21462498431769655, -0.12628207113091633, -0.13484091421260552, 0.07743328115469136, 0.0959350667693013, 0.13421963665214384, -0.12937639288301236, 0.1384878613633405, -0.12464074154073994, 0.15769386432115354, 0.04705728801405605, 0.0698097687095915, 0.12254903904235392, 0.1089932848619498, 0.16847988658164645, 0.14512022811230088, 0.04330757698135487, -0.11368756810677987, -0.351444180287859, -0.13655850268197336, -0.19922669217282651, 0.09838588387199207, -0.09723708116921355, -0.21526157706245488, 0.34894821691034617, 0.10027049412932612, 0.19356086175870515, 0.09520454094950657, 0.3092615138374123, 0.11144608940944012, 0.04759153021001896, 0.08028054518132087, 0.2089633843815867, 0.1090533294025626, 0.030672782173782002, -0.1308607402892199, 0.10705394449862926, 0.10368131591445383] |
1,803.02242 | Early Start Intention Detection of Cyclists Using Motion History Images
and a Deep Residual Network | In this article, we present a novel approach to detect starting motions of
cyclists in real world traffic scenarios based on Motion History Images (MHIs).
The method uses a deep Convolutional Neural Network (CNN) with a residual
network architecture (ResNet), which is commonly used in image classification
and detection tasks. By combining MHIs with a ResNet classifier and performing
a frame by frame classification of the MHIs, we are able to detect starting
motions in image sequences. The detection is performed using a wide angle
stereo camera system at an urban intersection. We compare our algorithm to an
existing method to detect movement transitions of pedestrians that uses MHIs in
combination with a Histograms of Oriented Gradients (HOG) like descriptor and a
Support Vector Machine (SVM), which we adapted to cyclists. To train and
evaluate the methods a dataset containing MHIs of 394 cyclist starting motions
was created. The results show that both methods can be used to detect starting
motions of cyclists. Using the SVM approach, we were able to safely detect
starting motions 0.506 s on average after the bicycle starts moving with an
F1-score of 97.7%. The ResNet approach achieved an F1-score of 100% at an
average detection time of 0.144 s. The ResNet approach outperformed the SVM
approach in both robustness against false positive detections and detection
time.
| cs.CV cs.LG | in this article we present a novel approach to detect starting motions of cyclists in real world traffic scenarios based on motion history images mhis the method uses a deep convolutional neural network cnn with a residual network architecture resnet which is commonly used in image classification and detection tasks by combining mhis with a resnet classifier and performing a frame by frame classification of the mhis we are able to detect starting motions in image sequences the detection is performed using a wide angle stereo camera system at an urban intersection we compare our algorithm to an existing method to detect movement transitions of pedestrians that uses mhis in combination with a histograms of oriented gradients hog like descriptor and a support vector machine svm which we adapted to cyclists to train and evaluate the methods a dataset containing mhis of 394 cyclist starting motions was created the results show that both methods can be used to detect starting motions of cyclists using the svm approach we were able to safely detect starting motions 0506 s on average after the bicycle starts moving with an f1score of 977 the resnet approach achieved an f1score of 100 at an average detection time of 0144 s the resnet approach outperformed the svm approach in both robustness against false positive detections and detection time | [['in', 'this', 'article', 'we', 'present', 'a', 'novel', 'approach', 'to', 'detect', 'starting', 'motions', 'of', 'cyclists', 'in', 'real', 'world', 'traffic', 'scenarios', 'based', 'on', 'motion', 'history', 'images', 'mhis', 'the', 'method', 'uses', 'a', 'deep', 'convolutional', 'neural', 'network', 'cnn', 'with', 'a', 'residual', 'network', 'architecture', 'resnet', 'which', 'is', 'commonly', 'used', 'in', 'image', 'classification', 'and', 'detection', 'tasks', 'by', 'combining', 'mhis', 'with', 'a', 'resnet', 'classifier', 'and', 'performing', 'a', 'frame', 'by', 'frame', 'classification', 'of', 'the', 'mhis', 'we', 'are', 'able', 'to', 'detect', 'starting', 'motions', 'in', 'image', 'sequences', 'the', 'detection', 'is', 'performed', 'using', 'a', 'wide', 'angle', 'stereo', 'camera', 'system', 'at', 'an', 'urban', 'intersection', 'we', 'compare', 'our', 'algorithm', 'to', 'an', 'existing', 'method', 'to', 'detect', 'movement', 'transitions', 'of', 'pedestrians', 'that', 'uses', 'mhis', 'in', 'combination', 'with', 'a', 'histograms', 'of', 'oriented', 'gradients', 'hog', 'like', 'descriptor', 'and', 'a', 'support', 'vector', 'machine', 'svm', 'which', 'we', 'adapted', 'to', 'cyclists', 'to', 'train', 'and', 'evaluate', 'the', 'methods', 'a', 'dataset', 'containing', 'mhis', 'of', '394', 'cyclist', 'starting', 'motions', 'was', 'created', 'the', 'results', 'show', 'that', 'both', 'methods', 'can', 'be', 'used', 'to', 'detect', 'starting', 'motions', 'of', 'cyclists', 'using', 'the', 'svm', 'approach', 'we', 'were', 'able', 'to', 'safely', 'detect', 'starting', 'motions', '0506', 's', 'on', 'average', 'after', 'the', 'bicycle', 'starts', 'moving', 'with', 'an', 'f1score', 'of', '977', 'the', 'resnet', 'approach', 'achieved', 'an', 'f1score', 'of', '100', 'at', 'an', 'average', 'detection', 'time', 'of', '0144', 's', 'the', 'resnet', 'approach', 'outperformed', 'the', 'svm', 'approach', 'in', 'both', 'robustness', 'against', 'false', 'positive', 'detections', 'and', 'detection', 'time']] | [-0.05722458385807349, 0.001731746996606612, -0.10033631318318029, 0.010534595791984618, -0.058648304434845575, -0.17756088058304814, 0.04242693546145781, 0.4712410638662609, -0.23301144295816753, -0.33400467485357244, 0.0640723820595356, -0.2911147808169459, -0.1558029454407022, 0.18467215735638076, -0.13684066365733072, 0.07392008079064859, 0.14609924663982546, 0.07172147446754598, -0.049629358677529135, -0.27190436377727034, 0.22780663580402966, 0.039564826295932394, 0.31418059513325225, -0.027813415903061092, 0.16493381875743335, -0.039850941667257736, -0.03940243277277143, 0.02781865960784122, -0.029273143392971292, 0.14903459417201612, 0.26221955946210335, 0.17281775148417633, 0.26610346497162374, -0.3704440584322354, -0.2042489492099497, 0.07204099063056747, 0.11467115531532883, 0.09801713726378407, 0.001615500158361822, -0.4120072333167332, 0.10658983463056486, -0.15416158367418223, -0.057723072957381744, -0.11385425278363195, 0.0007290320711101296, -0.0015046465428764219, -0.270067911180311, 0.06409005041292927, 0.026883828504061378, 0.1010942860707842, -0.0869097716011409, -0.08326676559082845, 0.020938707910989923, 0.14457168771050502, -0.013062450772587646, 0.11044201981968473, 0.1699366891098016, -0.15348366767071425, -0.18708323091394394, 0.38280528620397253, -0.13864129754664326, -0.16860637842753046, 0.2097778153209318, -0.0067333239508239, -0.12756020066051468, 0.13455735131791952, 0.26925893742087725, 0.13880825969956917, -0.1606534789735871, -0.0772551016314144, -0.026631320364194345, 0.17209396861401294, 0.07380100836566238, -0.09183879111692109, 0.186789039967095, 0.2516507161697289, 0.032149243713901925, 0.11985169352307026, -0.2591917141587826, -0.02308319194183626, -0.22115071831682176, -0.10386309910605993, -0.1692219573274456, -0.015482570907323377, -0.07109972144452685, -0.12650275786264656, 0.3995379561742952, 0.24182261684951414, 0.20831883606828144, 0.12256877948234822, 0.3294535401646417, 0.011148688220314111, 0.12404199026216678, 0.11612639596438254, 0.1988099641124676, 0.030630077288888797, 0.12091481067693315, -0.15122905174723347, 0.03908055806993968, 0.09718207907359544] |
1,803.02243 | Achieving Low Latency Two-Way Communication by Downlink and Uplink
Decoupled Access | In many scenarios, low latency wireless communication assumes two-way
connection, such that the node that receives information can swiftly send
acknowledgment or other response. In this paper, we address the problem of low
latency two-way communication and address it through proposal of a base station
(BS) cooperation scheme. The scheme is based on downlink (DL) and uplink (UL)
decoupled access (DUDA). To the best of our knowledge, this is the first time
that the idea of decoupled access is used to reduce latency. We derive the
analytical expression for the average latency and verify that the latency
expression is valid with outage probability based on stochastic geometry
analysis. Both analytical and simulation results show that, with DUDA, the
latency can be reduced by approximately 30-60% compared to the traditional
coupled access.
| cs.IT cs.NI math.IT | in many scenarios low latency wireless communication assumes twoway connection such that the node that receives information can swiftly send acknowledgment or other response in this paper we address the problem of low latency twoway communication and address it through proposal of a base station bs cooperation scheme the scheme is based on downlink dl and uplink ul decoupled access duda to the best of our knowledge this is the first time that the idea of decoupled access is used to reduce latency we derive the analytical expression for the average latency and verify that the latency expression is valid with outage probability based on stochastic geometry analysis both analytical and simulation results show that with duda the latency can be reduced by approximately 3060 compared to the traditional coupled access | [['in', 'many', 'scenarios', 'low', 'latency', 'wireless', 'communication', 'assumes', 'twoway', 'connection', 'such', 'that', 'the', 'node', 'that', 'receives', 'information', 'can', 'swiftly', 'send', 'acknowledgment', 'or', 'other', 'response', 'in', 'this', 'paper', 'we', 'address', 'the', 'problem', 'of', 'low', 'latency', 'twoway', 'communication', 'and', 'address', 'it', 'through', 'proposal', 'of', 'a', 'base', 'station', 'bs', 'cooperation', 'scheme', 'the', 'scheme', 'is', 'based', 'on', 'downlink', 'dl', 'and', 'uplink', 'ul', 'decoupled', 'access', 'duda', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'that', 'the', 'idea', 'of', 'decoupled', 'access', 'is', 'used', 'to', 'reduce', 'latency', 'we', 'derive', 'the', 'analytical', 'expression', 'for', 'the', 'average', 'latency', 'and', 'verify', 'that', 'the', 'latency', 'expression', 'is', 'valid', 'with', 'outage', 'probability', 'based', 'on', 'stochastic', 'geometry', 'analysis', 'both', 'analytical', 'and', 'simulation', 'results', 'show', 'that', 'with', 'duda', 'the', 'latency', 'can', 'be', 'reduced', 'by', 'approximately', '3060', 'compared', 'to', 'the', 'traditional', 'coupled', 'access']] | [-0.24154943933591375, 0.004420583474961685, -0.03253071875318544, 0.025096172575291446, -0.081428587748598, -0.2453963448122883, 0.17626781972882316, 0.35560125665639647, -0.25546138734158613, -0.2924712294613132, 0.08955674456212072, -0.23256456785131502, -0.18309994736323773, 0.15983905236482024, -0.1270799417055802, 0.043088921765220986, 0.05809238718783497, 0.06603380391473761, -0.01701478257185232, -0.2620209215834509, 0.25499303508123367, 0.11709567948550213, 0.38570117680995747, 0.05661764548991928, 0.08255602495801699, 0.021958446972612435, -0.04933930198015034, -0.047466264607541206, -0.06956315454490392, 0.09293821831109386, 0.3212584742266713, 0.2158019633622456, 0.25390698539647666, -0.4791082022356168, -0.24578728213309103, 0.052667507321932816, 0.17333749016610914, 0.058401781823912646, -0.015032223260513585, -0.24698065495018967, 0.12947214549791267, -0.2716446104637198, -0.03130294949185985, -0.0017226532151396494, -0.06635226815483952, 0.05114653580359944, -0.3326220893308179, 0.03201606189334438, -0.012473644148416192, -0.013368947118634487, -0.05144948154716319, -0.05676797806740319, 0.031249457744540264, 0.17778912028262236, 0.035233263054308094, 0.025587285082353604, 0.08177974552826117, -0.07732711101434271, -0.11790350068694706, 0.36679842094855225, -0.027667156553948084, -0.23997533557232725, 0.17707876096620004, -0.07290629291451955, -0.09448140901904412, 0.14713850863391661, 0.23766959823298317, 0.038314500325963695, -0.18449103718851018, 0.04806186382717432, -0.002144285865156478, 0.19885425940191528, 0.08860165817762604, 0.10028980658140801, 0.1256133264200833, 0.20407239067233132, 0.12320538849049098, 0.10241099316333527, -0.11005541537390695, -0.13588319690222675, -0.22152105059815955, -0.11958828299725784, -0.22357621276395695, 0.02397241727146853, -0.0920353762850784, -0.03209747583072149, 0.3357272791653007, 0.1807289458264753, 0.13041287248257463, 0.1643833216050469, 0.43641320431164204, 0.14703593727019934, 0.03984098503622049, 0.17008235889223924, 0.1824468884550218, 0.07492576332101669, 0.14045392235257584, -0.23888203578482148, 0.08580893023430107, -0.002038623037470775] |
1,803.02244 | Cage occupancies of methane hydrates: Results from synchrotron X-ray
diffraction and Raman spectroscopy | An accurate knowledge of cage occupancy of methane is central for
understanding the physical-chemical properties of gas hydrates, the actual
inventory of natural gas in hydrate deposits and the description of gas
exchange processes. Here we report the absolute cage occupancies, the cage
occupancy ratios and hydration numbers of the synthetic CH4-H2O and CH4-D2O
hydrates formed from the ice-gas system under different pressures and
temperatures. The results were obtained from Rietveld refinement using
high-resolution synchrotron X-ray powder diffraction patterns and from Raman
spectroscopic measurements. The small-cage occupancies of methane in the
deuterated hydrates are found to be slightly higher than in the hydrogenated
form, likely due to their different lattice constants. The CH4 occupancy in the
small cages agrees fairly well with the predictions of CSMGem at the formation
pressure of 3.5 MPa, but with the increasing formation pressure the
disagreement grows up to 11 percent. While some deficiency of the prediction
model cannot be excluded, the observed discrepancy may well be due to
experimental difficulties of reaching true equilibrium at higher pressures. The
experimentally determined large-to-small cage occupancy ratios of the synthetic
and natural CH4 hydrates formed from the water-gas system are consistently
higher than the results of CSMGem calculations. Possible reasons for these
discrepancies will be discussed.
| physics.chem-ph cond-mat.other | an accurate knowledge of cage occupancy of methane is central for understanding the physicalchemical properties of gas hydrates the actual inventory of natural gas in hydrate deposits and the description of gas exchange processes here we report the absolute cage occupancies the cage occupancy ratios and hydration numbers of the synthetic ch4h2o and ch4d2o hydrates formed from the icegas system under different pressures and temperatures the results were obtained from rietveld refinement using highresolution synchrotron xray powder diffraction patterns and from raman spectroscopic measurements the smallcage occupancies of methane in the deuterated hydrates are found to be slightly higher than in the hydrogenated form likely due to their different lattice constants the ch4 occupancy in the small cages agrees fairly well with the predictions of csmgem at the formation pressure of 35 mpa but with the increasing formation pressure the disagreement grows up to 11 percent while some deficiency of the prediction model cannot be excluded the observed discrepancy may well be due to experimental difficulties of reaching true equilibrium at higher pressures the experimentally determined largetosmall cage occupancy ratios of the synthetic and natural ch4 hydrates formed from the watergas system are consistently higher than the results of csmgem calculations possible reasons for these discrepancies will be discussed | [['an', 'accurate', 'knowledge', 'of', 'cage', 'occupancy', 'of', 'methane', 'is', 'central', 'for', 'understanding', 'the', 'physicalchemical', 'properties', 'of', 'gas', 'hydrates', 'the', 'actual', 'inventory', 'of', 'natural', 'gas', 'in', 'hydrate', 'deposits', 'and', 'the', 'description', 'of', 'gas', 'exchange', 'processes', 'here', 'we', 'report', 'the', 'absolute', 'cage', 'occupancies', 'the', 'cage', 'occupancy', 'ratios', 'and', 'hydration', 'numbers', 'of', 'the', 'synthetic', 'ch4h2o', 'and', 'ch4d2o', 'hydrates', 'formed', 'from', 'the', 'icegas', 'system', 'under', 'different', 'pressures', 'and', 'temperatures', 'the', 'results', 'were', 'obtained', 'from', 'rietveld', 'refinement', 'using', 'highresolution', 'synchrotron', 'xray', 'powder', 'diffraction', 'patterns', 'and', 'from', 'raman', 'spectroscopic', 'measurements', 'the', 'smallcage', 'occupancies', 'of', 'methane', 'in', 'the', 'deuterated', 'hydrates', 'are', 'found', 'to', 'be', 'slightly', 'higher', 'than', 'in', 'the', 'hydrogenated', 'form', 'likely', 'due', 'to', 'their', 'different', 'lattice', 'constants', 'the', 'ch4', 'occupancy', 'in', 'the', 'small', 'cages', 'agrees', 'fairly', 'well', 'with', 'the', 'predictions', 'of', 'csmgem', 'at', 'the', 'formation', 'pressure', 'of', '35', 'mpa', 'but', 'with', 'the', 'increasing', 'formation', 'pressure', 'the', 'disagreement', 'grows', 'up', 'to', '11', 'percent', 'while', 'some', 'deficiency', 'of', 'the', 'prediction', 'model', 'can', 'not', 'be', 'excluded', 'the', 'observed', 'discrepancy', 'may', 'well', 'be', 'due', 'to', 'experimental', 'difficulties', 'of', 'reaching', 'true', 'equilibrium', 'at', 'higher', 'pressures', 'the', 'experimentally', 'determined', 'largetosmall', 'cage', 'occupancy', 'ratios', 'of', 'the', 'synthetic', 'and', 'natural', 'ch4', 'hydrates', 'formed', 'from', 'the', 'watergas', 'system', 'are', 'consistently', 'higher', 'than', 'the', 'results', 'of', 'csmgem', 'calculations', 'possible', 'reasons', 'for', 'these', 'discrepancies', 'will', 'be', 'discussed']] | [-0.03301908542798805, 0.19060498814035526, -0.018805589195729677, 0.05287590745251029, 0.0246911578296313, -0.08038627731984535, 0.10813437994271155, 0.3930698116716829, -0.2566256749430147, -0.33570736109559396, 0.07073378413960844, -0.31604425506259415, -0.044771551911818606, 0.14661861900991796, -0.0039624813424188245, 0.020793996443881572, 0.048870833469690414, -0.024303739555055746, -0.06404252534362632, -0.23825923153154047, 0.24228596342139813, 0.13787304437990544, 0.24843561179366289, 0.11365758682328765, 0.02262563082317198, -0.10155796982744682, 0.018056874746655665, 0.009783318028920919, -0.16629069378414163, 0.09849459886804078, 0.2413413984400392, 0.026509620903683737, 0.15582697617920857, -0.453872644374129, -0.2064307378564743, 0.03536961237149476, 0.10091066642243922, 0.10896844854205395, -0.04085744344301576, -0.2305168727372131, 0.04687601842836124, -0.1572266133452395, -0.14336834833007847, -0.06461740222542538, -0.016672787676990323, 0.0407894408996354, -0.24133889741508416, 0.1446036062117449, 0.0002654329376313293, 0.1309330400361132, -0.17824035298400806, -0.2118536179819714, -0.10310758197526403, 0.095613164985462, 0.03352685040145552, -0.01912065159113517, 0.22601853692293783, -0.0944387239304561, -0.049941791596741066, 0.4729060293401329, -0.05296142126088261, -0.06058101805062056, 0.2519117924836871, -0.23660668887387853, -0.13229046664053792, 0.23000003162599666, 0.09525660458371242, 0.1017959089895334, -0.12492340900573554, -0.015824061806553307, -0.013519670314707079, 0.18145766144491804, 0.12822279495976016, 0.0175766188061335, 0.24987863889783485, 0.16871888950202632, -0.004886867764442074, 0.1143494871223472, -0.1232815759563909, -0.07544276263882424, -0.1854849564526411, -0.15522789106557644, -0.13949020736561454, 0.03046213887871788, -0.10064546087741495, -0.11260341773870926, 0.286571282087554, 0.10936232056136433, 0.19587889490920363, 0.01135147868393405, 0.2694357509958757, 0.08179623246372641, 0.09426887605895369, 0.0026095045065887053, 0.23453683908014372, 0.14108669749366173, 0.10994528272433333, -0.2712925736887326, 0.15245391426520938, -0.016289672078519554] |
1,803.02245 | CliNER 2.0: Accessible and Accurate Clinical Concept Extraction | Clinical notes often describe important aspects of a patient's stay and are
therefore critical to medical research. Clinical concept extraction (CCE) of
named entities - such as problems, tests, and treatments - aids in forming an
understanding of notes and provides a foundation for many downstream clinical
decision-making tasks. Historically, this task has been posed as a standard
named entity recognition (NER) sequence tagging problem, and solved with
feature-based methods using handengineered domain knowledge. Recent advances,
however, have demonstrated the efficacy of LSTM-based models for NER tasks,
including CCE. This work presents CliNER 2.0, a simple-to-install, open-source
tool for extracting concepts from clinical text. CliNER 2.0 uses a word- and
character- level LSTM model, and achieves state-of-the-art performance. For
ease of use, the tool also includes pre-trained models available for public
use.
| cs.CL | clinical notes often describe important aspects of a patients stay and are therefore critical to medical research clinical concept extraction cce of named entities such as problems tests and treatments aids in forming an understanding of notes and provides a foundation for many downstream clinical decisionmaking tasks historically this task has been posed as a standard named entity recognition ner sequence tagging problem and solved with featurebased methods using handengineered domain knowledge recent advances however have demonstrated the efficacy of lstmbased models for ner tasks including cce this work presents cliner 20 a simpletoinstall opensource tool for extracting concepts from clinical text cliner 20 uses a word and character level lstm model and achieves stateoftheart performance for ease of use the tool also includes pretrained models available for public use | [['clinical', 'notes', 'often', 'describe', 'important', 'aspects', 'of', 'a', 'patients', 'stay', 'and', 'are', 'therefore', 'critical', 'to', 'medical', 'research', 'clinical', 'concept', 'extraction', 'cce', 'of', 'named', 'entities', 'such', 'as', 'problems', 'tests', 'and', 'treatments', 'aids', 'in', 'forming', 'an', 'understanding', 'of', 'notes', 'and', 'provides', 'a', 'foundation', 'for', 'many', 'downstream', 'clinical', 'decisionmaking', 'tasks', 'historically', 'this', 'task', 'has', 'been', 'posed', 'as', 'a', 'standard', 'named', 'entity', 'recognition', 'ner', 'sequence', 'tagging', 'problem', 'and', 'solved', 'with', 'featurebased', 'methods', 'using', 'handengineered', 'domain', 'knowledge', 'recent', 'advances', 'however', 'have', 'demonstrated', 'the', 'efficacy', 'of', 'lstmbased', 'models', 'for', 'ner', 'tasks', 'including', 'cce', 'this', 'work', 'presents', 'cliner', '20', 'a', 'simpletoinstall', 'opensource', 'tool', 'for', 'extracting', 'concepts', 'from', 'clinical', 'text', 'cliner', '20', 'uses', 'a', 'word', 'and', 'character', 'level', 'lstm', 'model', 'and', 'achieves', 'stateoftheart', 'performance', 'for', 'ease', 'of', 'use', 'the', 'tool', 'also', 'includes', 'pretrained', 'models', 'available', 'for', 'public', 'use']] | [0.015367538994544839, -0.026538322931664308, -0.04637126839448383, 0.07145776153234105, -0.14698169912820255, -0.19314839857755098, 0.01119126620112119, 0.4249325401377021, -0.20456190983302833, -0.3448122214877934, 0.0937065439437164, -0.2899851267240707, -0.1594302097966117, 0.2758664836810066, -0.13188606725389682, 0.10720707462297561, 0.20209870116572504, 0.07003314024952101, -0.035087510052423075, -0.25773638306555935, 0.260669099223822, 0.058858579017339256, 0.3860003343658654, 0.08256525003926932, 0.14807272220661086, -0.009922732980408537, -0.08605467313973922, -0.05287082757668819, -0.06630617835720283, 0.18246589323018098, 0.4402950013826503, 0.26366336332582757, 0.3987680579660328, -0.39513647658970413, -0.2670307618760189, 0.023154774820065404, 0.15157436835579574, 0.11217809391141993, -0.05551305451470713, -0.33238103006064423, 0.06316170845488746, -0.19252191562715215, -0.011194995166293867, -0.1561193227067619, 0.002609863932295812, -0.030474606847324535, -0.2615336002846153, 0.07590319431275973, 0.0968655269431669, 0.16915887704955077, -0.056562753117415966, -0.16805098971029317, 0.09333584870497777, 0.22666140926239176, 0.054444779300013575, 0.09824592386684967, 0.1592602894694625, -0.2033780378538851, -0.2246341074131224, 0.3988906181468738, -0.0077814615471838555, -0.19495291696168393, 0.21406916581372928, 0.05116337019854819, -0.1897689000608062, 0.02882434395471896, 0.22445103126453367, 0.11704198128771125, -0.20155181618422036, 0.022440825094923553, 0.011155280574934381, 0.201944283250074, 0.07406348166950634, -0.018496975013032907, 0.19948374167796018, 0.31864741641852096, -0.08830794643135888, 0.12482136694025102, -0.09071586192695527, -0.0532477108924833, -0.1830160099881019, -0.14027036159797976, -0.12135991596939467, -0.02654399296752815, -0.026581356700878283, -0.17449538395043432, 0.383099109783226, 0.23420550902997414, 0.1204687564113126, 0.04996082152232645, 0.3245308892654739, -0.022210947129743423, 0.09405244430747088, 0.05965023415161326, 0.09848495466748297, 0.014556629795903765, 0.1646694990253538, -0.11642611868070864, 0.09793996149545726, 0.07636001160162992] |
1,803.02246 | Rest-Katyusha: Exploiting the Solution's Structure via Scheduled Restart
Schemes | We propose a structure-adaptive variant of the state-of-the-art stochastic
variance-reduced gradient algorithm Katyusha for regularized empirical risk
minimization. The proposed method is able to exploit the intrinsic
low-dimensional structure of the solution, such as sparsity or low rank which
is enforced by a non-smooth regularization, to achieve even faster convergence
rate. This provable algorithmic improvement is done by restarting the Katyusha
algorithm according to restricted strong-convexity constants. We demonstrate
the effectiveness of our approach via numerical experiments.
| math.OC | we propose a structureadaptive variant of the stateoftheart stochastic variancereduced gradient algorithm katyusha for regularized empirical risk minimization the proposed method is able to exploit the intrinsic lowdimensional structure of the solution such as sparsity or low rank which is enforced by a nonsmooth regularization to achieve even faster convergence rate this provable algorithmic improvement is done by restarting the katyusha algorithm according to restricted strongconvexity constants we demonstrate the effectiveness of our approach via numerical experiments | [['we', 'propose', 'a', 'structureadaptive', 'variant', 'of', 'the', 'stateoftheart', 'stochastic', 'variancereduced', 'gradient', 'algorithm', 'katyusha', 'for', 'regularized', 'empirical', 'risk', 'minimization', 'the', 'proposed', 'method', 'is', 'able', 'to', 'exploit', 'the', 'intrinsic', 'lowdimensional', 'structure', 'of', 'the', 'solution', 'such', 'as', 'sparsity', 'or', 'low', 'rank', 'which', 'is', 'enforced', 'by', 'a', 'nonsmooth', 'regularization', 'to', 'achieve', 'even', 'faster', 'convergence', 'rate', 'this', 'provable', 'algorithmic', 'improvement', 'is', 'done', 'by', 'restarting', 'the', 'katyusha', 'algorithm', 'according', 'to', 'restricted', 'strongconvexity', 'constants', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach', 'via', 'numerical', 'experiments']] | [-0.05000609297353726, -0.05909258239696939, -0.09343701383921427, 0.10374981834698323, -0.10823855187755997, -0.15659331962127576, 0.08805285867110088, 0.42189310573331723, -0.3272886222784782, -0.2909706646830521, 0.13919891695213782, -0.1946457831745411, -0.21076322772975575, 0.17150703499202508, -0.12201441744003784, 0.13608608709333778, 0.08729708265337803, 0.0036364481421550373, -0.1012140396746577, -0.3256120367743704, 0.24138779933685317, 0.09738855391692419, 0.3175970079232152, 0.025459256609780836, 0.17633427001608462, -0.023564922683811808, 0.014606361277401447, 0.040231957011791886, -0.07584255193541577, 0.18622044645636887, 0.2496825408117918, 0.19032930279174795, 0.3929139585929693, -0.38957320407710294, -0.19028500492031408, 0.10806026566144708, 0.15556938444262722, 0.08669858160217038, -0.0800615578297187, -0.2566132851537656, 0.13484505981104086, -0.1540966070704646, -0.07003649838825131, -0.22215397150388785, -0.14423208648502198, 0.022728189402683216, -0.35467676022286565, 0.11715132479749427, 0.07121695919784826, 0.007977577603676102, -0.05522247111612278, -0.14210189302609144, 0.07573474964501893, 0.022913725057907113, 0.09865320561296463, 0.06774102555370176, 0.1250441010206841, -0.06029465024710282, -0.17108160263387026, 0.3394128423087396, -0.10462544830636931, -0.23423106514836672, 0.17821860930265546, -0.009010855876538274, -0.10120441311934068, 0.1456501680583536, 0.211786394007504, 0.1828107076652451, -0.11708248808281496, 0.07703240439877845, -0.03867723152960663, 0.15321835142548207, 0.027328026731946058, -0.02852266114326073, 0.02233071644962826, 0.21014905098051606, 0.16778618785516394, 0.1602186282080683, -0.058256733582004325, -0.10739785746078599, -0.22237452147407577, -0.0994609366171062, -0.20918730278378472, -0.006936060881556629, -0.1542171777842881, -0.13172088985561164, 0.3679092037189123, 0.1861100166721584, 0.18381147362388572, 0.1400278772109539, 0.3758763676726973, 0.10446097472585834, 0.04682529194570788, 0.13442598328042726, 0.2286222724776183, 0.09557082820018488, 0.0558118539160819, -0.28899500511175436, 0.1189050288907216, 0.16388499850479812] |
1,803.02247 | MIMO Graph Filters for Convolutional Neural Networks | Superior performance and ease of implementation have fostered the adoption of
Convolutional Neural Networks (CNNs) for a wide array of inference and
reconstruction tasks. CNNs implement three basic blocks: convolution, pooling
and pointwise nonlinearity. Since the two first operations are well-defined
only on regular-structured data such as audio or images, application of CNNs to
contemporary datasets where the information is defined in irregular domains is
challenging. This paper investigates CNNs architectures to operate on signals
whose support can be modeled using a graph. Architectures that replace the
regular convolution with a so-called linear shift-invariant graph filter have
been recently proposed. This paper goes one step further and, under the
framework of multiple-input multiple-output (MIMO) graph filters, imposes
additional structure on the adopted graph filters, to obtain three new (more
parsimonious) architectures. The proposed architectures result in a lower
number of model parameters, reducing the computational complexity, facilitating
the training, and mitigating the risk of overfitting. Simulations show that the
proposed simpler architectures achieve similar performance as more complex
models.
| cs.LG eess.SP stat.ML | superior performance and ease of implementation have fostered the adoption of convolutional neural networks cnns for a wide array of inference and reconstruction tasks cnns implement three basic blocks convolution pooling and pointwise nonlinearity since the two first operations are welldefined only on regularstructured data such as audio or images application of cnns to contemporary datasets where the information is defined in irregular domains is challenging this paper investigates cnns architectures to operate on signals whose support can be modeled using a graph architectures that replace the regular convolution with a socalled linear shiftinvariant graph filter have been recently proposed this paper goes one step further and under the framework of multipleinput multipleoutput mimo graph filters imposes additional structure on the adopted graph filters to obtain three new more parsimonious architectures the proposed architectures result in a lower number of model parameters reducing the computational complexity facilitating the training and mitigating the risk of overfitting simulations show that the proposed simpler architectures achieve similar performance as more complex models | [['superior', 'performance', 'and', 'ease', 'of', 'implementation', 'have', 'fostered', 'the', 'adoption', 'of', 'convolutional', 'neural', 'networks', 'cnns', 'for', 'a', 'wide', 'array', 'of', 'inference', 'and', 'reconstruction', 'tasks', 'cnns', 'implement', 'three', 'basic', 'blocks', 'convolution', 'pooling', 'and', 'pointwise', 'nonlinearity', 'since', 'the', 'two', 'first', 'operations', 'are', 'welldefined', 'only', 'on', 'regularstructured', 'data', 'such', 'as', 'audio', 'or', 'images', 'application', 'of', 'cnns', 'to', 'contemporary', 'datasets', 'where', 'the', 'information', 'is', 'defined', 'in', 'irregular', 'domains', 'is', 'challenging', 'this', 'paper', 'investigates', 'cnns', 'architectures', 'to', 'operate', 'on', 'signals', 'whose', 'support', 'can', 'be', 'modeled', 'using', 'a', 'graph', 'architectures', 'that', 'replace', 'the', 'regular', 'convolution', 'with', 'a', 'socalled', 'linear', 'shiftinvariant', 'graph', 'filter', 'have', 'been', 'recently', 'proposed', 'this', 'paper', 'goes', 'one', 'step', 'further', 'and', 'under', 'the', 'framework', 'of', 'multipleinput', 'multipleoutput', 'mimo', 'graph', 'filters', 'imposes', 'additional', 'structure', 'on', 'the', 'adopted', 'graph', 'filters', 'to', 'obtain', 'three', 'new', 'more', 'parsimonious', 'architectures', 'the', 'proposed', 'architectures', 'result', 'in', 'a', 'lower', 'number', 'of', 'model', 'parameters', 'reducing', 'the', 'computational', 'complexity', 'facilitating', 'the', 'training', 'and', 'mitigating', 'the', 'risk', 'of', 'overfitting', 'simulations', 'show', 'that', 'the', 'proposed', 'simpler', 'architectures', 'achieve', 'similar', 'performance', 'as', 'more', 'complex', 'models']] | [-0.11247229859942481, -0.022798002586655673, -0.04064600543296408, 0.05008807658062627, -0.11599211685825139, -0.20245043613249436, -0.016302974956315233, 0.4398631093236396, -0.2666380169768153, -0.30582197297570973, 0.13039838136146067, -0.20976312661964802, -0.24958672013045066, 0.20674228989186563, -0.13346965637035846, 0.131735116758916, 0.14926722898547137, 0.0017429274933723111, -0.07703724708629861, -0.3102484894438281, 0.2898912661004856, 0.06198746181048807, 0.35794000911188223, -0.027888582491695638, 0.11370567796499624, -0.049822533331323596, -0.01604449247991267, -0.03036700233462311, -0.04163042057371058, 0.16337781697179057, 0.29976924675007205, 0.19420326457475312, 0.34358298661148484, -0.4606884495532584, -0.2671057655610466, 0.11878126485611401, 0.16201872546489107, 0.045597722538981804, -0.01107238761133409, -0.31004715412633405, 0.09122294635467586, -0.19279278198484376, 0.018159762662391932, -0.11290126101535168, -0.04404816353746269, 0.007914868649095297, -0.305624560402066, -0.006283057681728332, 0.08953276911883482, 0.05885359393903941, 0.0063306503607669755, -0.15363664298950294, 0.015524527221541143, 0.1311546185523704, -0.02333851498787269, 0.02359511346522985, 0.10428246835501687, -0.16546683269968657, -0.13869839446020446, 0.32620433753445033, -0.01910919721454515, -0.24191252626423237, 0.21345229671541824, -0.027909677012801348, -0.15863411987915502, 0.09430085840202602, 0.26570245659067515, 0.0767443548954491, -0.16761860401692547, 0.060002667849836315, -0.01449737677328466, 0.17405546248136533, 0.09805211664587703, 0.0840076255429137, 0.13896504571173518, 0.3051322327644032, 0.08238567789972183, 0.1563834952747649, -0.12318514873567481, -0.06554416414846423, -0.17271093606853224, -0.10662203233888638, -0.22536374967257006, -0.028004461045687396, -0.13251267483835927, -0.1674810129306501, 0.4222168673184656, 0.20199546581854866, 0.17660674678682836, 0.14306076578317775, 0.3657517584118371, 0.05861762904844779, 0.18344910848619683, 0.09978868969760481, 0.16962405774531708, 0.10498749805958055, 0.10840456004509524, -0.128224771758098, 0.05568863294458771, 0.030429484264286225] |
1,803.02248 | Evolution of Magnetic Excitations Across the Metal-Insulator Transition
in a Pyrochlore Iridate Eu$_{2}$Ir$_{2}$O$_{7}$ | We report Resonant Inelastic X-ray Scattering (RIXS) study of the magnetic
excitation spectrum in a highly insulating Eu$_{2}$Ir$_{2}$O$_{7}$ single
crystal that exhibits a metal-insulator transition at $T_{MI}$ = 111(7) K. A
propagating magnon mode with 20 meV bandwidth and 28 meV magnon gap is found in
the excitation spectrum at 7 K, which is expected in the all-in-all-out (AIAO)
magnetically ordered state. This magnetic excitation exhibits substantial
softening as temperature is raised towards $T_{MI}$, and turns into highly
damped excitation in the paramagnetic phase. Remarkably, the softening occurs
throughout the whole Brillouin zone including the zone boundary. This
observation is inconsistent with magnon renormalization expected in a local
moment system, and indicates that the strength of electron correlation in
Eu$_{2}$Ir$_{2}$O$_{7}$ is only moderate, so that electron itinerancy should be
taken into account in describing its magnetism.
| cond-mat.str-el | we report resonant inelastic xray scattering rixs study of the magnetic excitation spectrum in a highly insulating eu_2ir_2o_7 single crystal that exhibits a metalinsulator transition at t_mi 1117 k a propagating magnon mode with 20 mev bandwidth and 28 mev magnon gap is found in the excitation spectrum at 7 k which is expected in the allinallout aiao magnetically ordered state this magnetic excitation exhibits substantial softening as temperature is raised towards t_mi and turns into highly damped excitation in the paramagnetic phase remarkably the softening occurs throughout the whole brillouin zone including the zone boundary this observation is inconsistent with magnon renormalization expected in a local moment system and indicates that the strength of electron correlation in eu_2ir_2o_7 is only moderate so that electron itinerancy should be taken into account in describing its magnetism | [['we', 'report', 'resonant', 'inelastic', 'xray', 'scattering', 'rixs', 'study', 'of', 'the', 'magnetic', 'excitation', 'spectrum', 'in', 'a', 'highly', 'insulating', 'eu_2ir_2o_7', 'single', 'crystal', 'that', 'exhibits', 'a', 'metalinsulator', 'transition', 'at', 't_mi', '1117', 'k', 'a', 'propagating', 'magnon', 'mode', 'with', '20', 'mev', 'bandwidth', 'and', '28', 'mev', 'magnon', 'gap', 'is', 'found', 'in', 'the', 'excitation', 'spectrum', 'at', '7', 'k', 'which', 'is', 'expected', 'in', 'the', 'allinallout', 'aiao', 'magnetically', 'ordered', 'state', 'this', 'magnetic', 'excitation', 'exhibits', 'substantial', 'softening', 'as', 'temperature', 'is', 'raised', 'towards', 't_mi', 'and', 'turns', 'into', 'highly', 'damped', 'excitation', 'in', 'the', 'paramagnetic', 'phase', 'remarkably', 'the', 'softening', 'occurs', 'throughout', 'the', 'whole', 'brillouin', 'zone', 'including', 'the', 'zone', 'boundary', 'this', 'observation', 'is', 'inconsistent', 'with', 'magnon', 'renormalization', 'expected', 'in', 'a', 'local', 'moment', 'system', 'and', 'indicates', 'that', 'the', 'strength', 'of', 'electron', 'correlation', 'in', 'eu_2ir_2o_7', 'is', 'only', 'moderate', 'so', 'that', 'electron', 'itinerancy', 'should', 'be', 'taken', 'into', 'account', 'in', 'describing', 'its', 'magnetism']] | [-0.20620986472608316, 0.2758309864033772, -0.05241181841637525, 0.014676009107346613, -0.0435345022986574, -0.1172164753700296, 0.11028081928767884, 0.40812091423129593, -0.24160770593831937, -0.2799429820781505, 0.002262098046399101, -0.3547011346211312, -0.052163606730324254, 0.14168959861897207, 0.10251720401471108, -0.04281474787578056, -0.008946608860666554, -0.005787326707677157, -0.07317407307284021, -0.11680875104351866, 0.2566752683328189, 0.051971436949032876, 0.3091539493813697, 0.12002744581550359, 0.011060774043478348, 0.0076800328558655805, 0.13921573587727767, -0.01886648492956603, -0.11749367241966495, -0.0255017029914867, 0.316381454081447, -0.11839418477568499, 0.19895208421404714, -0.3793379917965029, -0.22052266381818939, -0.009612723831432286, 0.19445698860756777, 0.1155370106437692, -0.05085561917059951, -0.26019817581055343, 0.01821382842199118, -0.13091283758619318, -0.1446359566171412, -0.07449801201345745, 0.0011558279153649454, -0.08753930362872779, -0.2391806506862243, 0.1418640226194704, 0.08327591446642246, 0.08886975777676087, -0.13998319383244962, -0.11827350094034854, -0.11526034913129277, -0.0005115418285303922, 0.06721919701020751, 0.08593909616099188, 0.15216609971356337, -0.07762155899502061, -0.05662501114808644, 0.3587142708375015, -0.060033212717691506, 0.024494913839562624, 0.14024216053765956, -0.2558635385638034, -0.08372299761200945, 0.29857312387062446, 0.08169741552210999, 0.0688630903829579, -0.10614776612017994, 0.06527691093247591, -0.017315786400016537, 0.23677150856151624, 0.0465925022304334, 0.07807584660282979, 0.2681517080714305, 0.2103104092396313, 0.031840712418434794, 0.16297085550613702, -0.1643443083744151, -0.03788353451700122, -0.2167085475995447, -0.09136839506466425, -0.20344579929412618, 0.08235104270279407, -0.04496181054370633, -0.1774761358310503, 0.38349075759933504, 0.12022855862699174, 0.21041619878400256, -0.0737392424804124, 0.22453870669921377, 0.1736857633209891, 0.06252588838752773, 0.07766086919647124, 0.30925598988240516, 0.16561289893946163, 0.14658605804045996, -0.32159428361423864, 0.04110324602160189, -0.020562650608243766] |
1,803.02249 | A Term Structure Model for Dividends and Interest Rates | Over the last decade, dividends have become a standalone asset class instead
of a mere side product of an equity investment. We introduce a framework based
on polynomial jump-diffusions to jointly price the term structures of dividends
and interest rates. Prices for dividend futures, bonds, and the dividend paying
stock are given in closed form. We present an efficient moment based
approximation method for option pricing. In a calibration exercise we show that
a parsimonious model specification has a good fit with Euribor interest rate
swaps and swaptions, Euro Stoxx 50 index dividend futures and dividend options,
and Euro Stoxx 50 index options.
| q-fin.MF q-fin.PR | over the last decade dividends have become a standalone asset class instead of a mere side product of an equity investment we introduce a framework based on polynomial jumpdiffusions to jointly price the term structures of dividends and interest rates prices for dividend futures bonds and the dividend paying stock are given in closed form we present an efficient moment based approximation method for option pricing in a calibration exercise we show that a parsimonious model specification has a good fit with euribor interest rate swaps and swaptions euro stoxx 50 index dividend futures and dividend options and euro stoxx 50 index options | [['over', 'the', 'last', 'decade', 'dividends', 'have', 'become', 'a', 'standalone', 'asset', 'class', 'instead', 'of', 'a', 'mere', 'side', 'product', 'of', 'an', 'equity', 'investment', 'we', 'introduce', 'a', 'framework', 'based', 'on', 'polynomial', 'jumpdiffusions', 'to', 'jointly', 'price', 'the', 'term', 'structures', 'of', 'dividends', 'and', 'interest', 'rates', 'prices', 'for', 'dividend', 'futures', 'bonds', 'and', 'the', 'dividend', 'paying', 'stock', 'are', 'given', 'in', 'closed', 'form', 'we', 'present', 'an', 'efficient', 'moment', 'based', 'approximation', 'method', 'for', 'option', 'pricing', 'in', 'a', 'calibration', 'exercise', 'we', 'show', 'that', 'a', 'parsimonious', 'model', 'specification', 'has', 'a', 'good', 'fit', 'with', 'euribor', 'interest', 'rate', 'swaps', 'and', 'swaptions', 'euro', 'stoxx', '50', 'index', 'dividend', 'futures', 'and', 'dividend', 'options', 'and', 'euro', 'stoxx', '50', 'index', 'options']] | [-0.05912756212694826, -0.0006450501646659355, -0.11425971442504841, 0.1645026244953567, -0.11068288711648361, -0.17408515084717496, 0.17732583855646297, 0.4873851680142038, -0.28413135888894986, -0.21183295682638736, 0.19127453591528476, -0.30321543109740184, -0.0751027058234767, 0.1896851411906491, -0.15965847515811524, 0.02087289462432119, 0.0256584722128715, -0.038774731696820726, 0.05472827421766067, -0.33394622546848934, 0.18587084562864667, 0.10566445846366239, 0.3063738576100007, 0.03915424236466231, 0.15182243192604944, 0.02206310613181296, -0.029286869760493144, -0.052522087990141963, -0.20293651218333467, 0.15005878916959844, 0.3042771719674598, 0.10682818805057026, 0.40086451340831963, -0.4224192985863078, -0.12254630061158654, 0.1677805955071509, -0.02925256290473044, -0.008555663564680693, -0.05062705791194686, -0.18344880331663743, -0.06236141426922461, -0.37548100414192853, -0.07822957583566141, -0.044192263729842925, 0.08877298505246348, 0.020082042566226685, -0.3734773796910018, 0.0300266263400451, -0.050555208681936505, 0.02713735589036243, -0.07159917074365213, -0.17563194997937365, -0.013698634312615967, 0.06952379334389287, 0.178187019592288, -0.07909624043888613, 0.11666272350075636, -0.11079737238184202, -0.23439771526803574, 0.3558367180784105, -0.13234328795292907, -0.15411304639579326, -0.002279785575856473, -0.12376601106085468, -0.10604883204944723, 0.13321331537821712, 0.2061904802023634, 0.0522652898513365, -0.17810599846473218, 0.08784806856819355, -0.06101017880856114, 0.18894670634557875, 0.12518254751978697, -0.055620695194959935, 0.21510255372827397, 0.20783002664992475, 0.1506176655176187, 0.1221609528367088, -0.04194167186277827, -0.20777051837420932, -0.27312009450043645, -0.16557965224937482, -0.08080208132741973, 0.06026674233897425, -0.14535320445586467, -0.19154986824986397, 0.4000150091083282, 0.09467307559451928, 0.05195596887314619, 0.16023939399633044, 0.2308233927241435, 0.16377814611255684, -0.02587465757467583, 0.12125450842009455, 0.11947019404603862, -0.04294645796329075, 0.13364355834360764, -0.08195762060851991, 0.22102876736179872, 0.02216561198891962] |
1,803.0225 | CF4CF: Recommending Collaborative Filtering algorithms using
Collaborative Filtering | Automatic solutions which enable the selection of the best algorithms for a
new problem are commonly found in the literature. One research area which has
recently received considerable efforts is Collaborative Filtering. Existing
work includes several approaches using Metalearning, which relate the
characteristics of datasets with the performance of the algorithms. This work
explores an alternative approach to tackle this problem. Since, in essence,
both are recommendation problems, this work uses Collaborative Filtering
algorithms to select Collaborative Filtering algorithms. Our approach
integrates subsampling landmarkers, which are a data characterization approach
commonly used in Metalearning, with a standard Collaborative Filtering method.
The experimental results show that CF4CF competes with standard Metalearning
strategies in the problem of Collaborative Filtering algorithm selection.
| cs.IR | automatic solutions which enable the selection of the best algorithms for a new problem are commonly found in the literature one research area which has recently received considerable efforts is collaborative filtering existing work includes several approaches using metalearning which relate the characteristics of datasets with the performance of the algorithms this work explores an alternative approach to tackle this problem since in essence both are recommendation problems this work uses collaborative filtering algorithms to select collaborative filtering algorithms our approach integrates subsampling landmarkers which are a data characterization approach commonly used in metalearning with a standard collaborative filtering method the experimental results show that cf4cf competes with standard metalearning strategies in the problem of collaborative filtering algorithm selection | [['automatic', 'solutions', 'which', 'enable', 'the', 'selection', 'of', 'the', 'best', 'algorithms', 'for', 'a', 'new', 'problem', 'are', 'commonly', 'found', 'in', 'the', 'literature', 'one', 'research', 'area', 'which', 'has', 'recently', 'received', 'considerable', 'efforts', 'is', 'collaborative', 'filtering', 'existing', 'work', 'includes', 'several', 'approaches', 'using', 'metalearning', 'which', 'relate', 'the', 'characteristics', 'of', 'datasets', 'with', 'the', 'performance', 'of', 'the', 'algorithms', 'this', 'work', 'explores', 'an', 'alternative', 'approach', 'to', 'tackle', 'this', 'problem', 'since', 'in', 'essence', 'both', 'are', 'recommendation', 'problems', 'this', 'work', 'uses', 'collaborative', 'filtering', 'algorithms', 'to', 'select', 'collaborative', 'filtering', 'algorithms', 'our', 'approach', 'integrates', 'subsampling', 'landmarkers', 'which', 'are', 'a', 'data', 'characterization', 'approach', 'commonly', 'used', 'in', 'metalearning', 'with', 'a', 'standard', 'collaborative', 'filtering', 'method', 'the', 'experimental', 'results', 'show', 'that', 'cf4cf', 'competes', 'with', 'standard', 'metalearning', 'strategies', 'in', 'the', 'problem', 'of', 'collaborative', 'filtering', 'algorithm', 'selection']] | [-0.006322445602625864, -0.06922658949055108, -0.10058357872259922, 0.03619181851331049, -0.15808360838593963, -0.17251975184433863, 0.008895144909301884, 0.45289793640820897, -0.24846666074222606, -0.35646619361180526, 0.07240188448554558, -0.2662022546666045, -0.2409398261234801, 0.2060656422892442, -0.13125526824663591, 0.1261589982204585, 0.10561950521495862, -0.0005352837391770803, -0.07476941373549466, -0.31514466180601436, 0.2742728773667676, 0.052438221680812344, 0.39890730521108353, -0.012211602559297258, 0.08857647628169188, 0.010559533117737016, -0.12851400871146232, 0.006414034348140415, -0.10339396080017363, 0.1688955722697095, 0.3716409339541649, 0.22081465801844993, 0.4317679461569358, -0.33702778422202057, -0.24491151130129385, 0.0802203686350686, 0.17722976091914835, 0.1489931190612529, -0.08597456903443632, -0.30261332356235665, 0.05876761270113862, -0.17902356910003892, 0.004345065062372093, -0.0908459168450875, -0.07458690562659603, 0.00022708273564393705, -0.3292673047687699, 0.027268901387723084, 0.08762601400829023, 0.0018216637122389088, -0.016853647951323252, -0.1701816260520146, 0.14085040009544733, 0.10339239537795512, 0.07943013680374457, 0.020221928785292383, 0.130249086735595, -0.10895081956345493, -0.2786323686217905, 0.3728504189505027, -0.015750293619930744, -0.20818759167057455, 0.19444710760512668, 0.049247076010538474, -0.20153120210648984, 0.11521013334998463, 0.211269428089866, 0.16199885713111642, -0.22239240000231397, 0.06765924808847854, -0.05798437904057085, 0.1304942813908888, 0.0010978535920158666, -0.003475612574694758, 0.12081749729501705, 0.28062692758205354, 0.1273731387132763, 0.10347009150701392, -0.058281837293925956, -0.10758147533569071, -0.15864372467542562, -0.10734363361142385, -0.1661619320193417, -0.10778461119685417, -0.05594668695384748, -0.16979306709502912, 0.38241502719843745, 0.2814663914151681, 0.1626608275099952, 0.042540559259593554, 0.392037902186569, 0.06460536428643629, 0.10431429502578118, 0.08851424975989339, 0.19257734364901596, 0.02129379919387846, 0.1604332705306956, -0.1886038953780682, 0.0665829394860432, 0.04886718672246505] |
1,803.02251 | Deep Information Networks | We describe a novel classifier with a tree structure, designed using
information theory concepts. This Information Network is made of information
nodes, that compress the input data, and multiplexers, that connect two or more
input nodes to an output node. Each information node is trained, independently
of the others, to minimize a local cost function that minimizes the mutual
information between its input and output with the constraint of keeping a given
mutual information between its output and the target (information bottleneck).
We show that the system is able to provide good results in terms of accuracy,
while it shows many advantages in terms of modularity and reduced complexity.
| cs.LG | we describe a novel classifier with a tree structure designed using information theory concepts this information network is made of information nodes that compress the input data and multiplexers that connect two or more input nodes to an output node each information node is trained independently of the others to minimize a local cost function that minimizes the mutual information between its input and output with the constraint of keeping a given mutual information between its output and the target information bottleneck we show that the system is able to provide good results in terms of accuracy while it shows many advantages in terms of modularity and reduced complexity | [['we', 'describe', 'a', 'novel', 'classifier', 'with', 'a', 'tree', 'structure', 'designed', 'using', 'information', 'theory', 'concepts', 'this', 'information', 'network', 'is', 'made', 'of', 'information', 'nodes', 'that', 'compress', 'the', 'input', 'data', 'and', 'multiplexers', 'that', 'connect', 'two', 'or', 'more', 'input', 'nodes', 'to', 'an', 'output', 'node', 'each', 'information', 'node', 'is', 'trained', 'independently', 'of', 'the', 'others', 'to', 'minimize', 'a', 'local', 'cost', 'function', 'that', 'minimizes', 'the', 'mutual', 'information', 'between', 'its', 'input', 'and', 'output', 'with', 'the', 'constraint', 'of', 'keeping', 'a', 'given', 'mutual', 'information', 'between', 'its', 'output', 'and', 'the', 'target', 'information', 'bottleneck', 'we', 'show', 'that', 'the', 'system', 'is', 'able', 'to', 'provide', 'good', 'results', 'in', 'terms', 'of', 'accuracy', 'while', 'it', 'shows', 'many', 'advantages', 'in', 'terms', 'of', 'modularity', 'and', 'reduced', 'complexity']] | [-0.11611898839067873, 0.023985904437589134, -0.07985459019455614, 0.06341483662067272, -0.10339639180365505, -0.1742651545177769, 0.09092991709721984, 0.38273586877920757, -0.3335548905707007, -0.3361004526564561, 0.05629434252644829, -0.323690579776917, -0.18123279078521792, 0.12811606053042401, -0.1110707121055334, 0.06412261509904724, 0.1090062658095288, 0.14061962182814075, -0.060287033483800434, -0.281564646564988, 0.2973884406997267, 0.08235394629145708, 0.3199899836460453, 0.028242508496303078, 0.189708464822749, 0.03517656134005739, -0.028803876071416455, 0.024871398497227613, -0.0851179792798325, 0.16861664945550195, 0.287126034402092, 0.23418256005596952, 0.30405045126633157, -0.4290961652071378, -0.19867707612078397, 0.1008314546240374, 0.08278922939143323, 0.10436773347377845, 0.010136790154261489, -0.25045590049698263, 0.11530493569363831, -0.15334925989389692, -0.020531882455042744, -0.06016955208759584, -0.03395266960793679, 0.034374988885113644, -0.2932873008363675, -0.0044287316663481225, 0.05702223430532928, 0.008463179367944735, -0.0032272303002724135, -0.06970518917473324, -0.08656469823946374, 0.22842200200603163, -0.011400870233346972, 0.06710559032417389, 0.1279049198305525, -0.15132636493370963, -0.11901991242765013, 0.32909383906752143, -0.03946072311747238, -0.2492031188310047, 0.14935871305097953, -0.06229482360884821, -0.10205563477137972, 0.11268873007780095, 0.17453697834744913, 0.019325467394750325, -0.17017681656646705, -0.006251567865747514, -0.000326243827307443, 0.23765298789110753, 0.050013184878513764, 0.11700357868413039, 0.16678951515435933, 0.17811345616184654, 0.09061579590389898, 0.18185678310051492, -0.08725913386036847, -0.07805760182897398, -0.23835132306082807, -0.14376386085422624, -0.2540967604658062, -0.0596426684375203, -0.1317625849015387, -0.11942954023727514, 0.40038001598841555, 0.17854841617405962, 0.25709596125477363, 0.09391923983305812, 0.3606685310892692, 0.07041387318061032, 0.08172430576961659, 0.1408013659358503, 0.16754186962978965, 0.10134079096488519, 0.07911444642717753, -0.19089131175600196, 0.10680462009008598, 0.015569265722510738] |
1,803.02252 | A novel method for lepton energy calibration at Hadron Collider
Experiments | This report is to provide a novel method for the lepton energy calibration at
Hadron Collider Experiments. The method improves the classic lepton energy
calibration procedure widely used at hadron collider experiments. The classic
method parameterizes the potential bias in the lepton en- ergy calibration, and
determines the value of the parameter by the invariant mass of
$Z/\gamma^*\rightarrow \ell^+\ell^-$ events. The precision of the calibration
is dominated by the number of parameters or terms consid- ered in the
parameterization, for example, a polynomial extension. With one physics
constraint of the reconstructed Z boson mass, the classic procedure can use and
determine one parameter. The novel method improves the precision of lepton
calibration by introducing more terms in the parameterization. To precisely
determine the values of multiple parameters, the method first ac- quires more
constraints by separating the $Z/\gamma^*\rightarrow \ell^+\ell^-$ samples
according to the decay kinematics, and then reduces the correlation between
multiple parameters. Since the new method is still using the reconstructed Z
boson masses as the only constraints, it is much faster and easier than
detailed study of detector simulations.
| hep-ex | this report is to provide a novel method for the lepton energy calibration at hadron collider experiments the method improves the classic lepton energy calibration procedure widely used at hadron collider experiments the classic method parameterizes the potential bias in the lepton en ergy calibration and determines the value of the parameter by the invariant mass of zgammarightarrow ellell events the precision of the calibration is dominated by the number of parameters or terms consid ered in the parameterization for example a polynomial extension with one physics constraint of the reconstructed z boson mass the classic procedure can use and determine one parameter the novel method improves the precision of lepton calibration by introducing more terms in the parameterization to precisely determine the values of multiple parameters the method first ac quires more constraints by separating the zgammarightarrow ellell samples according to the decay kinematics and then reduces the correlation between multiple parameters since the new method is still using the reconstructed z boson masses as the only constraints it is much faster and easier than detailed study of detector simulations | [['this', 'report', 'is', 'to', 'provide', 'a', 'novel', 'method', 'for', 'the', 'lepton', 'energy', 'calibration', 'at', 'hadron', 'collider', 'experiments', 'the', 'method', 'improves', 'the', 'classic', 'lepton', 'energy', 'calibration', 'procedure', 'widely', 'used', 'at', 'hadron', 'collider', 'experiments', 'the', 'classic', 'method', 'parameterizes', 'the', 'potential', 'bias', 'in', 'the', 'lepton', 'en', 'ergy', 'calibration', 'and', 'determines', 'the', 'value', 'of', 'the', 'parameter', 'by', 'the', 'invariant', 'mass', 'of', 'zgammarightarrow', 'ellell', 'events', 'the', 'precision', 'of', 'the', 'calibration', 'is', 'dominated', 'by', 'the', 'number', 'of', 'parameters', 'or', 'terms', 'consid', 'ered', 'in', 'the', 'parameterization', 'for', 'example', 'a', 'polynomial', 'extension', 'with', 'one', 'physics', 'constraint', 'of', 'the', 'reconstructed', 'z', 'boson', 'mass', 'the', 'classic', 'procedure', 'can', 'use', 'and', 'determine', 'one', 'parameter', 'the', 'novel', 'method', 'improves', 'the', 'precision', 'of', 'lepton', 'calibration', 'by', 'introducing', 'more', 'terms', 'in', 'the', 'parameterization', 'to', 'precisely', 'determine', 'the', 'values', 'of', 'multiple', 'parameters', 'the', 'method', 'first', 'ac', 'quires', 'more', 'constraints', 'by', 'separating', 'the', 'zgammarightarrow', 'ellell', 'samples', 'according', 'to', 'the', 'decay', 'kinematics', 'and', 'then', 'reduces', 'the', 'correlation', 'between', 'multiple', 'parameters', 'since', 'the', 'new', 'method', 'is', 'still', 'using', 'the', 'reconstructed', 'z', 'boson', 'masses', 'as', 'the', 'only', 'constraints', 'it', 'is', 'much', 'faster', 'and', 'easier', 'than', 'detailed', 'study', 'of', 'detector', 'simulations']] | [-0.034532655186138184, 0.139416777559695, -0.07714843306206784, 0.099776915510607, -0.07032757455699187, -0.15068597229743036, 0.04863008160082345, 0.28425218131990065, -0.2410962791053465, -0.36268103189859024, 0.037144071177466265, -0.2560956455479011, -0.037966542869538725, 0.2220586795431886, 0.019638809068025558, 0.09579788417324168, 0.08241729977288546, -0.0068226566456852595, -0.10205247273761264, -0.22978362008846925, 0.2842649035155773, 0.11249928907053905, 0.255266646795407, 0.03450992840306206, 0.11371156180184849, 0.04791509529359598, -0.08241193383526589, -0.03594882610979656, -0.1445867888300129, 0.0589338391263537, 0.1953151947561425, 0.12518671328634107, 0.1974870191825276, -0.31881578021183693, -0.13313250511226074, 0.13753018414123158, 0.13210696192941943, 0.07728363761552275, -0.037615115940345716, -0.26398836505388357, 0.09547072546865318, -0.18313487893027042, -0.11000825586157609, -0.06196813003381313, -0.0460463286742815, -0.026761412394145576, -0.3420982054378117, 0.10279442267286597, -0.020887520467831613, 0.015698617334523914, 0.0059314948475780735, -0.15703190190110417, -0.024388078101061656, 0.05136358029355722, 0.07621820107390538, 0.04626006599340732, 0.15263483483982349, -0.15600923382553647, -0.1152685690637117, 0.3853036563390691, -0.048811902579332406, -0.21181631597396994, 0.13279670981165453, -0.14454781565588812, -0.13807421999350603, 0.13716840402683686, 0.1924521599340546, 0.10579037792641073, -0.18361460371714763, 0.11786962664192183, -0.014705730905725481, 0.16020601037992627, 0.04508521012930992, 0.007170959478707274, 0.1812971226076045, 0.20618005337203898, 0.07292120531201363, 0.07507039561805968, -0.13330417998953212, -0.020921464062048874, -0.33871631300172034, -0.13838756183218287, -0.1495717962257029, -0.004962909268215299, -0.09211195587632066, -0.09037256812244572, 0.42067716675115885, 0.14735418016049825, 0.2524577353756813, 0.028757706773338727, 0.3528914340920952, 0.11080888971539718, 0.07769255465294043, 0.030216388937403596, 0.27366389090308496, 0.12401790000776149, 0.10019035128495805, -0.2585578432965262, 0.07810835994121448, 0.09710718632948415] |
1,803.02253 | Influence maximization in noisy networks | We consider the problem of identifying the most influential nodes for a
spreading process on a network when prior knowledge about structure and
dynamics of the system is incomplete or erroneous. Specifically, we perform a
numerical analysis where the set of top spreaders is determined on the basis of
prior information that is artificially altered by a certain level of noise. We
then measure the optimality of the chosen set by measuring its spreading impact
in the true system. Whereas we find that the identification of top spreaders is
optimal when prior knowledge is complete and free of mistakes, we also find
that the quality of the top spreaders identified using noisy information
doesn't necessarily decrease as the noise level increases. For instance, we
show that it is generally possible to compensate for erroneous information
about dynamical parameters by adding synthetic errors in the structure of the
network. Further, we show that, in some dynamical regimes, even completely
losing prior knowledge on network structure may be better than relying on
certain but incomplete information.
| physics.soc-ph cs.SI | we consider the problem of identifying the most influential nodes for a spreading process on a network when prior knowledge about structure and dynamics of the system is incomplete or erroneous specifically we perform a numerical analysis where the set of top spreaders is determined on the basis of prior information that is artificially altered by a certain level of noise we then measure the optimality of the chosen set by measuring its spreading impact in the true system whereas we find that the identification of top spreaders is optimal when prior knowledge is complete and free of mistakes we also find that the quality of the top spreaders identified using noisy information doesnt necessarily decrease as the noise level increases for instance we show that it is generally possible to compensate for erroneous information about dynamical parameters by adding synthetic errors in the structure of the network further we show that in some dynamical regimes even completely losing prior knowledge on network structure may be better than relying on certain but incomplete information | [['we', 'consider', 'the', 'problem', 'of', 'identifying', 'the', 'most', 'influential', 'nodes', 'for', 'a', 'spreading', 'process', 'on', 'a', 'network', 'when', 'prior', 'knowledge', 'about', 'structure', 'and', 'dynamics', 'of', 'the', 'system', 'is', 'incomplete', 'or', 'erroneous', 'specifically', 'we', 'perform', 'a', 'numerical', 'analysis', 'where', 'the', 'set', 'of', 'top', 'spreaders', 'is', 'determined', 'on', 'the', 'basis', 'of', 'prior', 'information', 'that', 'is', 'artificially', 'altered', 'by', 'a', 'certain', 'level', 'of', 'noise', 'we', 'then', 'measure', 'the', 'optimality', 'of', 'the', 'chosen', 'set', 'by', 'measuring', 'its', 'spreading', 'impact', 'in', 'the', 'true', 'system', 'whereas', 'we', 'find', 'that', 'the', 'identification', 'of', 'top', 'spreaders', 'is', 'optimal', 'when', 'prior', 'knowledge', 'is', 'complete', 'and', 'free', 'of', 'mistakes', 'we', 'also', 'find', 'that', 'the', 'quality', 'of', 'the', 'top', 'spreaders', 'identified', 'using', 'noisy', 'information', 'doesnt', 'necessarily', 'decrease', 'as', 'the', 'noise', 'level', 'increases', 'for', 'instance', 'we', 'show', 'that', 'it', 'is', 'generally', 'possible', 'to', 'compensate', 'for', 'erroneous', 'information', 'about', 'dynamical', 'parameters', 'by', 'adding', 'synthetic', 'errors', 'in', 'the', 'structure', 'of', 'the', 'network', 'further', 'we', 'show', 'that', 'in', 'some', 'dynamical', 'regimes', 'even', 'completely', 'losing', 'prior', 'knowledge', 'on', 'network', 'structure', 'may', 'be', 'better', 'than', 'relying', 'on', 'certain', 'but', 'incomplete', 'information']] | [-0.10293130776256151, 0.06319108316353683, -0.07512190469390788, 0.07938718434526117, -0.09295344936939749, -0.13275896463323728, 0.12085919035598636, 0.3740395740873512, -0.2740593373744706, -0.31816075364898505, 0.140486548441307, -0.27409602904253394, -0.19553859116129535, 0.15691206661914742, -0.06421913070090372, 0.027772154739653776, 0.10958433823376337, 0.10123039417814506, -0.048512221250118386, -0.26410981800524924, 0.38693948902575104, 0.08282151655561623, 0.2711686084980959, 0.03933107658642633, 0.08432206783133249, 0.02482567550935622, -0.06338853013953301, 0.028408124361818807, -0.09793161485989306, 0.10530548562475041, 0.21202086473028336, 0.16350381919075788, 0.29692065398256967, -0.4075904046238839, -0.25186099917306726, 0.10729784439264357, 0.12507904236654527, 0.1499097740663023, -0.007214661274806479, -0.279477244433037, 0.133097645442601, -0.129510356105286, -0.06839954868713714, -0.08234938958809636, -0.0060359122333298815, -0.005854016395376717, -0.29463468741487725, 0.07744663372356846, 0.09316456756901113, 0.04507037519809158, -0.025487688685842287, -0.11930667030780266, -0.05657592160231166, 0.18369575959647705, 0.013435577100441234, -0.0007930674450338187, 0.1689673755639072, -0.16520391165375195, -0.08390645546926956, 0.35269852792951223, -0.04434075239209803, -0.2429078595220023, 0.14556200207939007, -0.13777248367356756, -0.11794637905814466, 0.1225103348006505, 0.18023874375155602, 0.09905421084606614, -0.15140106212050017, 0.013963147617164657, -0.03474033165765905, 0.2204861960088802, 0.05992582307702958, 0.03049286454648379, 0.15563491200118315, 0.1878944658540489, 0.09176991385910874, 0.12033557664835826, -0.06533022659520309, -0.07889386789435682, -0.26786766443187476, -0.1147023173632507, -0.19531339068693676, 0.05705427217910109, -0.09096839622813196, -0.15155751170890255, 0.3856654219950239, 0.20001883497200745, 0.21623444797112554, 0.009605625328532923, 0.292811236621266, 0.06982738525026623, 0.037113975554881294, 0.09341410310181586, 0.2301751848789609, 0.04269676879262445, 0.04207954219416662, -0.17804405471208323, 0.17936940366487908, -0.00944441533814741] |
1,803.02254 | Proximity force approximation and specular reflection: Application of
the WKB limit of Mie scattering to the Casimir effect | The electromagnetic Casimir interaction between two spheres is studied within
the scattering approach using the plane-wave basis. It is demonstrated that the
proximity force approximation (PFA) corresponds to the specular-reflection
limit of Mie scattering. Using the leading-order semiclassical WKB
approximation for the direct reflection term in the Debye expansion for the
scattering amplitudes, we prove that PFA provides the correct leading-order
divergence for arbitrary materials and temperatures in the sphere-sphere and
the plane-sphere geometry. Our derivation implies that only a small section
around the points of closest approach between the interacting spherical
surfaces contributes in the PFA regime. The corresponding characteristic length
scale is estimated from the width of the Gaussian integrand obtained within the
saddle-point approximation. At low temperatures, the area relevant for the
thermal corrections is much larger than the area contributing to the
zero-temperature result.
| quant-ph | the electromagnetic casimir interaction between two spheres is studied within the scattering approach using the planewave basis it is demonstrated that the proximity force approximation pfa corresponds to the specularreflection limit of mie scattering using the leadingorder semiclassical wkb approximation for the direct reflection term in the debye expansion for the scattering amplitudes we prove that pfa provides the correct leadingorder divergence for arbitrary materials and temperatures in the spheresphere and the planesphere geometry our derivation implies that only a small section around the points of closest approach between the interacting spherical surfaces contributes in the pfa regime the corresponding characteristic length scale is estimated from the width of the gaussian integrand obtained within the saddlepoint approximation at low temperatures the area relevant for the thermal corrections is much larger than the area contributing to the zerotemperature result | [['the', 'electromagnetic', 'casimir', 'interaction', 'between', 'two', 'spheres', 'is', 'studied', 'within', 'the', 'scattering', 'approach', 'using', 'the', 'planewave', 'basis', 'it', 'is', 'demonstrated', 'that', 'the', 'proximity', 'force', 'approximation', 'pfa', 'corresponds', 'to', 'the', 'specularreflection', 'limit', 'of', 'mie', 'scattering', 'using', 'the', 'leadingorder', 'semiclassical', 'wkb', 'approximation', 'for', 'the', 'direct', 'reflection', 'term', 'in', 'the', 'debye', 'expansion', 'for', 'the', 'scattering', 'amplitudes', 'we', 'prove', 'that', 'pfa', 'provides', 'the', 'correct', 'leadingorder', 'divergence', 'for', 'arbitrary', 'materials', 'and', 'temperatures', 'in', 'the', 'spheresphere', 'and', 'the', 'planesphere', 'geometry', 'our', 'derivation', 'implies', 'that', 'only', 'a', 'small', 'section', 'around', 'the', 'points', 'of', 'closest', 'approach', 'between', 'the', 'interacting', 'spherical', 'surfaces', 'contributes', 'in', 'the', 'pfa', 'regime', 'the', 'corresponding', 'characteristic', 'length', 'scale', 'is', 'estimated', 'from', 'the', 'width', 'of', 'the', 'gaussian', 'integrand', 'obtained', 'within', 'the', 'saddlepoint', 'approximation', 'at', 'low', 'temperatures', 'the', 'area', 'relevant', 'for', 'the', 'thermal', 'corrections', 'is', 'much', 'larger', 'than', 'the', 'area', 'contributing', 'to', 'the', 'zerotemperature', 'result']] | [-0.11983622092605177, 0.1148007328620356, -0.11930623542233977, 0.1203842418457287, -0.008790815335131534, -0.07319689621183806, 0.02523526564102107, 0.31801937567745, -0.22519045851895234, -0.2439143985638098, -0.002713834089935636, -0.32018043432870635, -0.11016603958273334, 0.19948903983458877, 0.04142564784463806, 0.04341947466499456, 0.008610647651738069, 0.05387797404124496, -0.08868434207270974, -0.17695948864211855, 0.3040075937582963, 0.07675600730463107, 0.2801934897602684, 0.11643650406293328, 0.07099448924924692, 0.06912205925049342, 0.02013717317764742, 0.021248244650095054, -0.12998961094690722, 0.10089580536536548, 0.2186383212417992, -0.04071351386559452, 0.18554387354305474, -0.4134770115378542, -0.18298147142648805, 0.025897587666395997, 0.12139503610703378, 0.14009845465678128, 0.025841683120655733, -0.24033529712629598, 0.036410763002662126, -0.1420940687927161, -0.19832788150676567, -0.041745746916537915, 0.03536500244914298, -0.04355858251169, -0.25520980548100086, 0.10648076494048903, 0.040324005289037, 0.01568681030007808, -0.07005392536318497, -0.13328683458984006, 0.042105615899925106, 0.09606000236775455, 0.07314037870399762, 0.03770927593796986, 0.14926700670258614, -0.12081977499790651, -0.032759633534452944, 0.3839573280706975, -0.08918875317729122, -0.1705017628450203, 0.1575380862771493, -0.19280913400639227, -0.021112738713703078, 0.23021264847341008, 0.1097407166633512, 0.12090970356307545, -0.15730249424181555, 0.15904753937396943, -0.006911768542562166, 0.1385180769079918, 0.1366379478764113, -0.0006539936757821968, 0.16848820101037837, 0.15325143474721067, 0.021334032021948824, 0.13546156393283088, -0.13906678737924044, -0.12604600735737578, -0.35661420184255077, -0.09733219751818241, -0.21424323305541623, 0.028994306898338422, -0.15180129097743833, -0.19646892618333947, 0.3013641376156306, 0.16001687059178948, 0.15408711457807248, 0.08964599486595641, 0.331298616161381, 0.17180468724531028, 0.0945063486519823, 0.07549870508744894, 0.33406218540841254, 0.16655102380014875, 0.04841923658260266, -0.2639780997980278, 0.017248840789999, 0.12311333308225848] |
1,803.02255 | Optimizing searches for electromagnetic counterparts of gravitational
wave triggers | With the detection of a binary neutron star system and its corresponding
electromagnetic counterparts, a new window of transient astronomy has opened.
Due to the size of the error regions, which can span hundreds to thousands of
square degrees, there are significant benefits to optimizing tilings for these
large sky areas. The rich science promised by gravitational-wave astronomy has
led to the proposal for a variety of tiling and time allocation schemes, and
for the first time, we make a systematic comparison of some of these methods.
We find that differences of a factor of 2 or more in efficiency are possible,
depending on the algorithm employed. For this reason, for future surveys
searching for electromagnetic counterparts, care should be taken when selecting
tiling, time allocation, and scheduling algorithms to maximize the probability
of counterpart detection.
| astro-ph.IM astro-ph.HE | with the detection of a binary neutron star system and its corresponding electromagnetic counterparts a new window of transient astronomy has opened due to the size of the error regions which can span hundreds to thousands of square degrees there are significant benefits to optimizing tilings for these large sky areas the rich science promised by gravitationalwave astronomy has led to the proposal for a variety of tiling and time allocation schemes and for the first time we make a systematic comparison of some of these methods we find that differences of a factor of 2 or more in efficiency are possible depending on the algorithm employed for this reason for future surveys searching for electromagnetic counterparts care should be taken when selecting tiling time allocation and scheduling algorithms to maximize the probability of counterpart detection | [['with', 'the', 'detection', 'of', 'a', 'binary', 'neutron', 'star', 'system', 'and', 'its', 'corresponding', 'electromagnetic', 'counterparts', 'a', 'new', 'window', 'of', 'transient', 'astronomy', 'has', 'opened', 'due', 'to', 'the', 'size', 'of', 'the', 'error', 'regions', 'which', 'can', 'span', 'hundreds', 'to', 'thousands', 'of', 'square', 'degrees', 'there', 'are', 'significant', 'benefits', 'to', 'optimizing', 'tilings', 'for', 'these', 'large', 'sky', 'areas', 'the', 'rich', 'science', 'promised', 'by', 'gravitationalwave', 'astronomy', 'has', 'led', 'to', 'the', 'proposal', 'for', 'a', 'variety', 'of', 'tiling', 'and', 'time', 'allocation', 'schemes', 'and', 'for', 'the', 'first', 'time', 'we', 'make', 'a', 'systematic', 'comparison', 'of', 'some', 'of', 'these', 'methods', 'we', 'find', 'that', 'differences', 'of', 'a', 'factor', 'of', '2', 'or', 'more', 'in', 'efficiency', 'are', 'possible', 'depending', 'on', 'the', 'algorithm', 'employed', 'for', 'this', 'reason', 'for', 'future', 'surveys', 'searching', 'for', 'electromagnetic', 'counterparts', 'care', 'should', 'be', 'taken', 'when', 'selecting', 'tiling', 'time', 'allocation', 'and', 'scheduling', 'algorithms', 'to', 'maximize', 'the', 'probability', 'of', 'counterpart', 'detection']] | [-0.12199229374099933, 0.057834100918947064, -0.05206269328482449, 0.06682490802845945, -0.12178852497976657, -0.08903075072243262, 0.09494980767040569, 0.4159224263721091, -0.2511807395460303, -0.35023389816770384, 0.14948852622782235, -0.27394546330405695, -0.10261240638689795, 0.24510197028319133, -0.041172327484031594, 0.06388216957694727, 0.0816137727096622, 0.015504213751923731, -0.07367235267156502, -0.27433312295761425, 0.25371850549195457, 0.10533631499171914, 0.2405216588813346, 0.01584040732225677, 0.08015487989434726, -0.010175360063251848, -0.07617178933544304, 0.024234576389276567, -0.10891122074960602, 0.11781747431001242, 0.29701928761513796, 0.19023462650640047, 0.3103215609033428, -0.39315791342147244, -0.20861488073954687, 0.15258498550803565, 0.1321997532299172, 0.08595081619312302, -0.06806491399391448, -0.27637553736755816, 0.0865228979712222, -0.1701486804325695, -0.10395963883424617, -0.05885588467422435, 0.06106312329168705, 0.04805908704806557, -0.24320015388623098, 0.020507731429140277, 0.014961599413415088, 0.015866367913344327, -0.06452246048737674, -0.1415227564618416, 0.05892974521060858, 0.15604461575554418, 0.04368388948119793, 0.0446872481430439, 0.07574514591696617, -0.16456374601180226, -0.1593627045478891, 0.42420253627385723, -0.0035645192581475436, -0.14781238780329553, 0.18756255183903062, -0.16013156151166186, -0.1544233399361153, 0.178013223944136, 0.2121016657089486, 0.10462897168198491, -0.13940099609541956, 0.01886101521599545, 0.02878918278250186, 0.17903430221314706, 0.08390587867538937, 0.09562840414753951, 0.27382541374604713, 0.19440886905752397, 0.09946074794382131, 0.13805552623970846, -0.16306554079432423, -0.07270592077239758, -0.2431589416159755, -0.1315079307087752, -0.16512268192737417, 0.048630378277534074, -0.09256711932389675, -0.1226853180115166, 0.3998609728878364, 0.14435144836384364, 0.11380920485552291, 0.04797018997230813, 0.26631062976358566, 0.08245741467073779, 0.10912812251583948, 0.06573335311087944, 0.24185133638371448, 0.05158395085078048, 0.08130993393099155, -0.17962388887227623, 0.026363299057051977, -0.011098020497764297] |
1,803.02256 | Depth Information Guided Crowd Counting for Complex Crowd Scenes | It is important to monitor and analyze crowd events for the sake of city
safety. In an EDOF (extended depth of field) image with a crowded scene, the
distribution of people is highly imbalanced. People far away from the camera
look much smaller and often occlude each other heavily, while people close to
the camera look larger. In such a case, it is difficult to accurately estimate
the number of people by using one technique. In this paper, we propose a Depth
Information Guided Crowd Counting (DigCrowd) method to deal with crowded EDOF
scenes. DigCrowd first uses the depth information of an image to segment the
scene into a far-view region and a near-view region. Then Digcrowd maps the
far-view region to its crowd density map and uses a detection method to count
the people in the near-view region. In addition, we introduce a new crowd
dataset that contains 1000 images. Experimental results demonstrate the
effectiveness of our DigCrowd method
| cs.CV | it is important to monitor and analyze crowd events for the sake of city safety in an edof extended depth of field image with a crowded scene the distribution of people is highly imbalanced people far away from the camera look much smaller and often occlude each other heavily while people close to the camera look larger in such a case it is difficult to accurately estimate the number of people by using one technique in this paper we propose a depth information guided crowd counting digcrowd method to deal with crowded edof scenes digcrowd first uses the depth information of an image to segment the scene into a farview region and a nearview region then digcrowd maps the farview region to its crowd density map and uses a detection method to count the people in the nearview region in addition we introduce a new crowd dataset that contains 1000 images experimental results demonstrate the effectiveness of our digcrowd method | [['it', 'is', 'important', 'to', 'monitor', 'and', 'analyze', 'crowd', 'events', 'for', 'the', 'sake', 'of', 'city', 'safety', 'in', 'an', 'edof', 'extended', 'depth', 'of', 'field', 'image', 'with', 'a', 'crowded', 'scene', 'the', 'distribution', 'of', 'people', 'is', 'highly', 'imbalanced', 'people', 'far', 'away', 'from', 'the', 'camera', 'look', 'much', 'smaller', 'and', 'often', 'occlude', 'each', 'other', 'heavily', 'while', 'people', 'close', 'to', 'the', 'camera', 'look', 'larger', 'in', 'such', 'a', 'case', 'it', 'is', 'difficult', 'to', 'accurately', 'estimate', 'the', 'number', 'of', 'people', 'by', 'using', 'one', 'technique', 'in', 'this', 'paper', 'we', 'propose', 'a', 'depth', 'information', 'guided', 'crowd', 'counting', 'digcrowd', 'method', 'to', 'deal', 'with', 'crowded', 'edof', 'scenes', 'digcrowd', 'first', 'uses', 'the', 'depth', 'information', 'of', 'an', 'image', 'to', 'segment', 'the', 'scene', 'into', 'a', 'farview', 'region', 'and', 'a', 'nearview', 'region', 'then', 'digcrowd', 'maps', 'the', 'farview', 'region', 'to', 'its', 'crowd', 'density', 'map', 'and', 'uses', 'a', 'detection', 'method', 'to', 'count', 'the', 'people', 'in', 'the', 'nearview', 'region', 'in', 'addition', 'we', 'introduce', 'a', 'new', 'crowd', 'dataset', 'that', 'contains', '1000', 'images', 'experimental', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'digcrowd', 'method']] | [-0.032411267040768944, 0.05049685117493154, -0.09938261086486658, 0.07328159939586126, -0.10794079221808646, -0.12123792390987466, 0.03945791948943316, 0.3992686910861278, -0.22461509026433754, -0.3448596364417691, 0.08254190086891074, -0.31697066775464183, -0.14386165315135016, 0.19021333278675528, -0.18736364871714428, 0.021410917937298764, 0.09216743110844135, 0.09700989285248178, 0.03123685898100132, -0.22851531495431532, 0.2761758391309199, 0.02260881796172714, 0.2955546480547519, 0.034055427033631014, 0.1364613223520308, 0.007430360026958198, -0.0540402572118689, 0.02758216487738905, -0.08568114664611337, 0.1599096472336781, 0.2958959865478115, 0.16867034859908156, 0.289159050087527, -0.3976177049423509, -0.2140454696896604, 0.0924040018963993, 0.14886193855111546, 0.10368860488215202, -0.02793325762901031, -0.3874998017777158, 0.09913103269925931, -0.14744708021584002, -0.09326587081150021, -0.04256071618321953, 0.0061907227625598825, -0.026718842334635673, -0.2444085999085462, 0.029020013062200874, 0.002152146565244545, 0.07029848227489598, -0.030300905443934274, -0.04387459533784208, 0.03820814812832948, 0.20287955854135223, 0.02499273451357561, 0.055020517819189714, 0.1710444595841573, -0.24486649577793979, -0.0278317384522031, 0.3849806937895998, -0.010286151252825497, -0.17850413286610495, 0.1870680890175738, -0.15114949906209507, -0.11098477209305178, 0.168474469345676, 0.20566955267133402, 0.1655690093182876, -0.15918965589349407, -0.016116503377067798, -0.09449050571147612, 0.19199150986380026, 0.039707453108003624, -0.02677705710388343, 0.18968168396320007, 0.20608957092383806, 0.10934132403587993, 0.1647516294059055, -0.20633355157944974, -0.04093076719878878, -0.19797883020961493, -0.13208424634686258, -0.17011529662870342, -0.034303715034046126, -0.08181311399933788, -0.13065306708509364, 0.39410134772858524, 0.26216978885091935, 0.23016972919554698, 0.047392368965039525, 0.3602179872738551, 0.032537360520166925, 0.08540114875635298, 0.07039454529250536, 0.1436714298118354, 0.0166409341279488, 0.14312756643704244, -0.1272105406874001, 0.032425307945784514, 0.04991945957829822] |
1,803.02257 | Methodology to analyze the accuracy of 3D objects reconstructed with
collaborative robot based monocular LSD-SLAM | SLAM systems are mainly applied for robot navigation while research on
feasibility for motion planning with SLAM for tasks like bin-picking, is
scarce. Accurate 3D reconstruction of objects and environments is important for
planning motion and computing optimal gripper pose to grasp objects. In this
work, we propose the methods to analyze the accuracy of a 3D environment
reconstructed using a LSD-SLAM system with a monocular camera mounted onto the
gripper of a collaborative robot. We discuss and propose a solution to the pose
space conversion problem. Finally, we present several criteria to analyze the
3D reconstruction accuracy. These could be used as guidelines to improve the
accuracy of 3D reconstructions with monocular LSD-SLAM and other SLAM based
solutions.
| cs.CV cs.RO | slam systems are mainly applied for robot navigation while research on feasibility for motion planning with slam for tasks like binpicking is scarce accurate 3d reconstruction of objects and environments is important for planning motion and computing optimal gripper pose to grasp objects in this work we propose the methods to analyze the accuracy of a 3d environment reconstructed using a lsdslam system with a monocular camera mounted onto the gripper of a collaborative robot we discuss and propose a solution to the pose space conversion problem finally we present several criteria to analyze the 3d reconstruction accuracy these could be used as guidelines to improve the accuracy of 3d reconstructions with monocular lsdslam and other slam based solutions | [['slam', 'systems', 'are', 'mainly', 'applied', 'for', 'robot', 'navigation', 'while', 'research', 'on', 'feasibility', 'for', 'motion', 'planning', 'with', 'slam', 'for', 'tasks', 'like', 'binpicking', 'is', 'scarce', 'accurate', '3d', 'reconstruction', 'of', 'objects', 'and', 'environments', 'is', 'important', 'for', 'planning', 'motion', 'and', 'computing', 'optimal', 'gripper', 'pose', 'to', 'grasp', 'objects', 'in', 'this', 'work', 'we', 'propose', 'the', 'methods', 'to', 'analyze', 'the', 'accuracy', 'of', 'a', '3d', 'environment', 'reconstructed', 'using', 'a', 'lsdslam', 'system', 'with', 'a', 'monocular', 'camera', 'mounted', 'onto', 'the', 'gripper', 'of', 'a', 'collaborative', 'robot', 'we', 'discuss', 'and', 'propose', 'a', 'solution', 'to', 'the', 'pose', 'space', 'conversion', 'problem', 'finally', 'we', 'present', 'several', 'criteria', 'to', 'analyze', 'the', '3d', 'reconstruction', 'accuracy', 'these', 'could', 'be', 'used', 'as', 'guidelines', 'to', 'improve', 'the', 'accuracy', 'of', '3d', 'reconstructions', 'with', 'monocular', 'lsdslam', 'and', 'other', 'slam', 'based', 'solutions']] | [-0.06610992237873681, -0.052449661933136084, -0.04623898146908824, -0.010026860391298513, -0.10889807320004251, -0.17360987380037413, -0.01324659991938965, 0.48341312275088133, -0.23190377134156703, -0.3908275500127748, 0.1408752208221469, -0.23479549884952666, -0.15749836254457966, 0.21845332030969977, -0.21240864417265257, 0.15841958381879676, 0.19313026009765336, 0.0016618492062195759, -0.10042768549330595, -0.17960819296397956, 0.2557621709376323, 0.01330079564809048, 0.2700559706544551, -0.0022216720091758155, 0.19269708087746085, 0.03102693512073147, 0.010979847904263424, 0.027197393842829987, -0.09679057245815814, 0.2030145503852532, 0.30980613842379584, 0.19265537273467465, 0.2402607127398002, -0.4188355172694731, -0.20522656187634258, 0.039226498779598155, 0.16748790818211787, 0.09887295207908738, -0.08899034426191493, -0.41012777760624886, 0.06879267540267285, -0.13951114671570913, -0.058814000596581886, -0.12140835297172654, -0.003661488769810741, -0.01897807074994428, -0.28358809344133973, -0.003909935290385194, -0.012547619586043498, 0.0805138030613796, -0.1457438377992195, -0.062255689679613695, 0.06035962932109207, 0.24699423293888317, -0.022656249841127324, 0.07431669053112884, 0.1936290959999779, -0.2188844788377369, -0.13387251119011967, 0.4719324206792507, 0.02093203558279358, -0.27122548275760244, 0.240809347545102, -0.05593030587496126, -0.13157062431672165, 0.10275954323108583, 0.2768559603904914, 0.1687322664505043, -0.17125869635492563, 0.021100621735051023, 0.00017442047877722427, 0.14018530679177962, -0.004687289398226167, -0.032100825476608856, 0.19409500892829745, 0.2538691853493953, 0.1275760821147994, 0.12944254912034914, -0.19242978819739856, -0.031996911430747066, -0.17756471704660343, -0.15555574741894906, -0.1468531727446478, -0.0501968458474872, -0.04509380318081601, -0.12959585520008407, 0.3698654536807424, 0.29495352949994075, 0.185457083670532, 0.0880417073509429, 0.42233605318147094, 0.02641850830732743, 0.019114464101450814, 0.06119676960334808, 0.2209770915669804, -0.03217888685498981, 0.13414144819160187, -0.2136991754675112, 0.04372772159634017, 0.12134327951763921] |
1,803.02258 | Optical nanofiber temperature monitoring via double heterodyne detection | Tapered optical fibers (nanofibers) whose diameters are smaller than the
optical wavelength are very fragile and can be easily destroyed if excessively
heated by energy dissipated from the transmitted light. We present a technique
for monitoring the nanofiber temperature using two-stage heterodyne detection.
The phase of the heterodyne output signal is determined by that of the
transmitted optical field, which, in turn, depends on the temperature through
the refractive index. From the phase data, by numerically solving the heat
exchange equations, the temperature distribution along the nanofiber is
determined. The technique is applied to the controlled heating of the nanofiber
by a laser in order to remove rubidium atoms adsorbed on its surface that
substantially degrade its transmission. Almost 90% of the nanofiber's original
transmission is recovered.
| physics.optics | tapered optical fibers nanofibers whose diameters are smaller than the optical wavelength are very fragile and can be easily destroyed if excessively heated by energy dissipated from the transmitted light we present a technique for monitoring the nanofiber temperature using twostage heterodyne detection the phase of the heterodyne output signal is determined by that of the transmitted optical field which in turn depends on the temperature through the refractive index from the phase data by numerically solving the heat exchange equations the temperature distribution along the nanofiber is determined the technique is applied to the controlled heating of the nanofiber by a laser in order to remove rubidium atoms adsorbed on its surface that substantially degrade its transmission almost 90 of the nanofibers original transmission is recovered | [['tapered', 'optical', 'fibers', 'nanofibers', 'whose', 'diameters', 'are', 'smaller', 'than', 'the', 'optical', 'wavelength', 'are', 'very', 'fragile', 'and', 'can', 'be', 'easily', 'destroyed', 'if', 'excessively', 'heated', 'by', 'energy', 'dissipated', 'from', 'the', 'transmitted', 'light', 'we', 'present', 'a', 'technique', 'for', 'monitoring', 'the', 'nanofiber', 'temperature', 'using', 'twostage', 'heterodyne', 'detection', 'the', 'phase', 'of', 'the', 'heterodyne', 'output', 'signal', 'is', 'determined', 'by', 'that', 'of', 'the', 'transmitted', 'optical', 'field', 'which', 'in', 'turn', 'depends', 'on', 'the', 'temperature', 'through', 'the', 'refractive', 'index', 'from', 'the', 'phase', 'data', 'by', 'numerically', 'solving', 'the', 'heat', 'exchange', 'equations', 'the', 'temperature', 'distribution', 'along', 'the', 'nanofiber', 'is', 'determined', 'the', 'technique', 'is', 'applied', 'to', 'the', 'controlled', 'heating', 'of', 'the', 'nanofiber', 'by', 'a', 'laser', 'in', 'order', 'to', 'remove', 'rubidium', 'atoms', 'adsorbed', 'on', 'its', 'surface', 'that', 'substantially', 'degrade', 'its', 'transmission', 'almost', '90', 'of', 'the', 'nanofibers', 'original', 'transmission', 'is', 'recovered']] | [-0.12543390994876857, 0.2292316647715808, -0.06955843998529897, -0.0529884125883361, -0.017068843049268555, -0.18605002551156236, 0.06266306218504172, 0.4464010627588301, -0.27323239374040503, -0.26584570035045074, 0.10426671946912593, -0.2774192204819919, -0.0744722426949641, 0.25019791580032646, -0.02242240120150794, 0.019344048309653236, 0.028162311867070126, -0.027992614339597113, -0.0010662805985688693, -0.20854743903018827, 0.2362557816755496, 0.10106588645258874, 0.3157019317608444, 0.03970588303095932, 0.08648925621564844, 0.014690572088840968, 0.009636953139428313, -0.0055597565452179575, -0.11231837924957132, 0.10846017610545702, 0.20831440552137792, 0.0284740200383574, 0.1918744931261488, -0.4376347301065863, -0.24425048073002056, 0.0913266042672743, 0.15697504002481744, 0.09964411216146335, -0.03206192926269054, -0.2823352559861969, 0.03826178303795067, -0.07713388660409319, -0.13596916020715857, -0.01987756100138576, -0.0515173110243769, 0.03797720616140703, -0.2248636011591577, 0.0445029523267638, -0.0028166820269488677, 0.06618292831383117, -0.04169273132634327, -0.040122921299922655, -0.08255478860553736, 0.04861699433366614, -0.03485326340429368, 0.01016734942141187, 0.25426550808098664, -0.0995204109069708, 0.019288352908801258, 0.35962478568828776, -0.12059604375285493, -0.12502720027448844, 0.1113227169748073, -0.1373995544680387, 0.039145866520776174, 0.2680532650318085, 0.15474211737718874, 0.12060358734731745, -0.1442559341768052, 0.0038591025018602553, 0.014120708722034542, 0.25214963085311426, 0.15682049623257885, 0.044573496513831336, 0.23302842564440854, 0.15698245986626946, 0.03330313998428503, 0.20516618508313908, -0.15727194827430382, -0.0199167309448079, -0.20224054663819738, -0.125873484747763, -0.25570742854129846, 0.039039908358313904, -0.105454875094982, -0.11259674011384994, 0.3889105947849553, 0.14804174077484433, 0.15749555788970898, 0.0029194208831841667, 0.38435964532724515, 0.14785171889765994, 0.10320862012825481, 0.026580971366850527, 0.33620872042750516, 0.18208221038143466, 0.11373843311279, -0.269837235045568, 0.07335563065249502, 0.01620402399406541] |
1,803.02259 | The EDGE-CALIFA survey: validating stellar dynamical mass models with CO
kinematics | Deriving circular velocities of galaxies from stellar kinematics can provide
an estimate of their total dynamical mass, provided a contribution from the
velocity dispersion of the stars is taken into account. Molecular gas (e.g.,
CO) on the other hand, is a dynamically cold tracer and hence acts as an
independent circular velocity estimate without needing such a correction. In
this paper we test the underlying assumptions of three commonly used dynamical
models, deriving circular velocities from stellar kinematics of 54 galaxies
(S0-Sd) that have observations of both stellar kinematics from the CALIFA
survey, and CO kinematics from the EDGE survey. We test the Asymmetric Drift
Correction (ADC) method, as well as Jeans, and Schwarzschild models. The three
methods each reproduce the CO circular velocity at 1Re to within 10%. All three
methods show larger scatter (up to 20%) in the inner regions (R < 0.4Re) which
may be due to an increasingly spherical mass distribution (which is not
captured by the thin disk assumption in ADC), or non-constant stellar M/L
ratios (for both the JAM and Schwarzschild models). This homogeneous analysis
of stellar and gaseous kinematics validates that all three models can recover
Mdyn at 1Re to better than 20%, but users should be mindful of scatter in the
inner regions where some assumptions may break down.
| astro-ph.GA | deriving circular velocities of galaxies from stellar kinematics can provide an estimate of their total dynamical mass provided a contribution from the velocity dispersion of the stars is taken into account molecular gas eg co on the other hand is a dynamically cold tracer and hence acts as an independent circular velocity estimate without needing such a correction in this paper we test the underlying assumptions of three commonly used dynamical models deriving circular velocities from stellar kinematics of 54 galaxies s0sd that have observations of both stellar kinematics from the califa survey and co kinematics from the edge survey we test the asymmetric drift correction adc method as well as jeans and schwarzschild models the three methods each reproduce the co circular velocity at 1re to within 10 all three methods show larger scatter up to 20 in the inner regions r 04re which may be due to an increasingly spherical mass distribution which is not captured by the thin disk assumption in adc or nonconstant stellar ml ratios for both the jam and schwarzschild models this homogeneous analysis of stellar and gaseous kinematics validates that all three models can recover mdyn at 1re to better than 20 but users should be mindful of scatter in the inner regions where some assumptions may break down | [['deriving', 'circular', 'velocities', 'of', 'galaxies', 'from', 'stellar', 'kinematics', 'can', 'provide', 'an', 'estimate', 'of', 'their', 'total', 'dynamical', 'mass', 'provided', 'a', 'contribution', 'from', 'the', 'velocity', 'dispersion', 'of', 'the', 'stars', 'is', 'taken', 'into', 'account', 'molecular', 'gas', 'eg', 'co', 'on', 'the', 'other', 'hand', 'is', 'a', 'dynamically', 'cold', 'tracer', 'and', 'hence', 'acts', 'as', 'an', 'independent', 'circular', 'velocity', 'estimate', 'without', 'needing', 'such', 'a', 'correction', 'in', 'this', 'paper', 'we', 'test', 'the', 'underlying', 'assumptions', 'of', 'three', 'commonly', 'used', 'dynamical', 'models', 'deriving', 'circular', 'velocities', 'from', 'stellar', 'kinematics', 'of', '54', 'galaxies', 's0sd', 'that', 'have', 'observations', 'of', 'both', 'stellar', 'kinematics', 'from', 'the', 'califa', 'survey', 'and', 'co', 'kinematics', 'from', 'the', 'edge', 'survey', 'we', 'test', 'the', 'asymmetric', 'drift', 'correction', 'adc', 'method', 'as', 'well', 'as', 'jeans', 'and', 'schwarzschild', 'models', 'the', 'three', 'methods', 'each', 'reproduce', 'the', 'co', 'circular', 'velocity', 'at', '1re', 'to', 'within', '10', 'all', 'three', 'methods', 'show', 'larger', 'scatter', 'up', 'to', '20', 'in', 'the', 'inner', 'regions', 'r', '04re', 'which', 'may', 'be', 'due', 'to', 'an', 'increasingly', 'spherical', 'mass', 'distribution', 'which', 'is', 'not', 'captured', 'by', 'the', 'thin', 'disk', 'assumption', 'in', 'adc', 'or', 'nonconstant', 'stellar', 'ml', 'ratios', 'for', 'both', 'the', 'jam', 'and', 'schwarzschild', 'models', 'this', 'homogeneous', 'analysis', 'of', 'stellar', 'and', 'gaseous', 'kinematics', 'validates', 'that', 'all', 'three', 'models', 'can', 'recover', 'mdyn', 'at', '1re', 'to', 'better', 'than', '20', 'but', 'users', 'should', 'be', 'mindful', 'of', 'scatter', 'in', 'the', 'inner', 'regions', 'where', 'some', 'assumptions', 'may', 'break', 'down']] | [-0.029149174516165065, 0.08397579461107366, -0.0954423017756537, 0.08622919966975703, -0.07847003855114412, -0.09387039730953442, -0.01857338407520898, 0.3933815531259359, -0.20367760982277783, -0.3665155879200198, 0.08514581872475181, -0.26049958300711806, -0.017217698907053238, 0.20925753397412253, -0.020809638788544596, 0.0065655573336190955, 0.025199712672119224, -0.05212197259574761, -0.08628980902478445, -0.22689114079897313, 0.3052537888613378, 0.05223194447909157, 0.1658181616754899, -0.023396640615321176, 0.06728718207152777, -0.076523575518107, -0.07385840343722944, 0.015339708319583605, -0.14606108059490716, 0.039919516695446744, 0.19765815340438694, 0.11009907452304994, 0.22089345831164095, -0.39405524699060723, -0.19649642674728882, 0.05161542327164911, 0.22656298584844864, 0.0978291023966618, -0.03470473360151139, -0.2528539187610583, 0.06713374142296785, -0.18472878933386055, -0.18007608716007928, 0.02837842077904836, 0.021264193007765813, 0.023814575050870868, -0.25113249688522976, 0.12071792677228967, 0.06507741101438093, 0.08893798215011525, -0.10694434159803529, -0.13245174692467201, -0.0947620575565325, 0.11576413221678934, 0.031005853482083484, 0.03385492518630832, 0.21828795410367813, -0.12401802699449797, 0.0065662505018503165, 0.4250368209512428, -0.07901291805624062, -0.14856622692110927, 0.21886797836050392, -0.19300786463197234, -0.12544713877791236, 0.12799714584618288, 0.19490109630968683, 0.09671766149464908, -0.18375310900859362, 0.023368128827437325, -0.05313466838236119, 0.21138291847567225, 0.07727396195472847, 0.012661590782362361, 0.2989404460350268, 0.07639299127338238, 0.0525321803066533, 0.05048478815222679, -0.20982301258861066, -0.05987029030139363, -0.24318466455090879, -0.10559208248200458, -0.11025956247846574, 0.04939993718418369, -0.14621493995675633, -0.10895335956714874, 0.30491786478303895, 0.1368220774467688, 0.2510199201466559, 0.07375322880939483, 0.34827869671808426, 0.08518418275837808, 0.11593969453581024, 0.1304916243924391, 0.2691928192005265, 0.15362152210869934, 0.0551209735630627, -0.22156976051885785, 0.07871082686117938, -0.001472151290008062] |
1,803.0226 | On some discrete random variables arising from recent study on
statistical analysis of compressive sensing | The recent paper [27] provides a statistical analysis for efficient detection
of signal components when missing data samples are present. Here we focus our
attention to some complex-valued discrete random variables $X_l(m,N)$ ($0\le
l\le N-1$, $1\le M\le N$), which are closely related to the random variables
investigated by LJ. Stankovi\'c, S. Stankovi\'c and M. Amin in \cite{ssa}. In
particular, by using a combinatorial approach, we prove that for $l\not=0$ the
expected value of $X_l(m,N)$ is equal to zero, and we deduce the expression for
the variance of the random variables $X_l(m,N)$. The same results are also
deduced for the real part $U_l(m,N)$ and the imaginary part $V_l(m,N)$ of
$X_l(m,N)$, as well as the facts that the $k$th moments of $U_l(m,N)$ and
$V_l(m,N)$ are equal to zero for every positive integer $k$ which is not
divisible by $N/\gcd(N,l)$. Moreover, some additional assertions and examples
concerning the random variables $X_l(m,N)$, $U_l(m,N)$ and $V_l(m,N)$ are also
presented.
| math.ST stat.TH | the recent paper 27 provides a statistical analysis for efficient detection of signal components when missing data samples are present here we focus our attention to some complexvalued discrete random variables x_lmn 0le lle n1 1le mle n which are closely related to the random variables investigated by lj stankovic s stankovic and m amin in citessa in particular by using a combinatorial approach we prove that for lnot0 the expected value of x_lmn is equal to zero and we deduce the expression for the variance of the random variables x_lmn the same results are also deduced for the real part u_lmn and the imaginary part v_lmn of x_lmn as well as the facts that the kth moments of u_lmn and v_lmn are equal to zero for every positive integer k which is not divisible by ngcdnl moreover some additional assertions and examples concerning the random variables x_lmn u_lmn and v_lmn are also presented | [['the', 'recent', 'paper', '27', 'provides', 'a', 'statistical', 'analysis', 'for', 'efficient', 'detection', 'of', 'signal', 'components', 'when', 'missing', 'data', 'samples', 'are', 'present', 'here', 'we', 'focus', 'our', 'attention', 'to', 'some', 'complexvalued', 'discrete', 'random', 'variables', 'x_lmn', '0le', 'lle', 'n1', '1le', 'mle', 'n', 'which', 'are', 'closely', 'related', 'to', 'the', 'random', 'variables', 'investigated', 'by', 'lj', 'stankovic', 's', 'stankovic', 'and', 'm', 'amin', 'in', 'citessa', 'in', 'particular', 'by', 'using', 'a', 'combinatorial', 'approach', 'we', 'prove', 'that', 'for', 'lnot0', 'the', 'expected', 'value', 'of', 'x_lmn', 'is', 'equal', 'to', 'zero', 'and', 'we', 'deduce', 'the', 'expression', 'for', 'the', 'variance', 'of', 'the', 'random', 'variables', 'x_lmn', 'the', 'same', 'results', 'are', 'also', 'deduced', 'for', 'the', 'real', 'part', 'u_lmn', 'and', 'the', 'imaginary', 'part', 'v_lmn', 'of', 'x_lmn', 'as', 'well', 'as', 'the', 'facts', 'that', 'the', 'kth', 'moments', 'of', 'u_lmn', 'and', 'v_lmn', 'are', 'equal', 'to', 'zero', 'for', 'every', 'positive', 'integer', 'k', 'which', 'is', 'not', 'divisible', 'by', 'ngcdnl', 'moreover', 'some', 'additional', 'assertions', 'and', 'examples', 'concerning', 'the', 'random', 'variables', 'x_lmn', 'u_lmn', 'and', 'v_lmn', 'are', 'also', 'presented']] | [-0.11000626171804279, 0.13592328229845552, -0.052302987946524424, 0.055951321293832734, -0.07242472818439924, -0.1524466536326432, 0.021052529323098593, 0.3304582260009882, -0.2261333770584315, -0.25585224992277, 0.13425597510343468, -0.3216639368696825, -0.16288111019591606, 0.1780319438196449, -0.05680120600644793, 0.0489518290789994, 0.0019341639065379767, 0.07839077744574752, -0.023436004592296836, -0.29321917599851366, 0.2896406574383084, -0.024338171275111994, 0.18952667545588492, 0.00802699818680259, 0.09489928740214582, 0.038712727134273005, -0.04425053065374653, 0.005757632861404042, -0.13635642642370122, 0.09362060359777197, 0.25080969393418756, 0.11384435723027166, 0.2512185943962418, -0.34604300762198126, -0.1619982979762809, 0.1441466855314119, 0.1304990818454443, 0.03102565306624839, -0.007434521286517051, -0.24720725311750644, 0.14318296121506902, -0.09987332165933606, -0.11802992160818049, -0.09557836456224322, 0.08486613641664582, 0.08001990671772019, -0.3304719403232938, 0.07601291369332773, 0.11449614670020405, 0.0734644343059412, -0.05994107294214988, -0.24395764681915016, 0.002676483819653329, 0.09267249048666838, 0.06697892162360643, 0.01588644503269614, 0.05722685886451616, -0.05560444200014708, -0.11296464775468369, 0.3317993130706447, -0.04596325539291444, -0.212804838512583, 0.12082790130577785, -0.1448359239638146, -0.15724821789741614, 0.09484391441525843, 0.12324312797404434, 0.12665600522948234, -0.11128830992799378, 0.11013462654342507, -0.07517355407808761, 0.11964542019536327, 0.0393282967974971, 0.01575919896315195, 0.11103677361174241, 0.044966975793757136, 0.04407271801138497, 0.14578200129969782, -0.04867483480407636, -0.05986229107580393, -0.33793567569534244, -0.15298665344322981, -0.2551031829942459, 0.07146218868585588, -0.13315887438798918, -0.13197345461307314, 0.33338538368575665, 0.13973341492543878, 0.2147553331252359, 0.1234438688613744, 0.2572394170197903, 0.12342744608835537, -0.009535114097448777, 0.0773035203333405, 0.12567378962481407, 0.17159458434080557, 0.066374404764869, -0.15286076252155717, 0.05371498183338094, 0.06342334698542561] |
1,803.02261 | User-Centric 5G Cellular Networks: Resource Allocation and Comparison
with the Cell-Free Massive MIMO Approach | Recently, the so-called cell-free (CF) Massive MIMO architecture has been
introduced, wherein a very large number of distributed access points (APs)
simultaneously and jointly serve a much smaller number of mobile stations
(MSs). The paper extends the CF approach to the case in which both the APs and
the MSs are equipped with multiple antennas, proposing a beamfoming scheme
that, relying on the channel hardening effect, does not require channel
estimation at the MSs. We contrast the CF massive MIMO approach with a
user-centric (UC) approach wherein each MS is served only by a limited number
of APs. Since far APs experience a bad SINR, it turns out that they are quite
unhelpful in serving far users, and so, the UC approach, while requiring less
backhaul overhead with respect to the CF approach, is shown here to achieve
better performance results, in terms of achievable rate-per-user, for the vast
majority of the MSs in the network. Furthermore, in the paper we propose two
power allocation strategy for the uplink and downlink, one aimed at maximizing
the overall data-rate and another aimed at maximizing system fairness.
| cs.IT cs.NI math.IT | recently the socalled cellfree cf massive mimo architecture has been introduced wherein a very large number of distributed access points aps simultaneously and jointly serve a much smaller number of mobile stations mss the paper extends the cf approach to the case in which both the aps and the mss are equipped with multiple antennas proposing a beamfoming scheme that relying on the channel hardening effect does not require channel estimation at the mss we contrast the cf massive mimo approach with a usercentric uc approach wherein each ms is served only by a limited number of aps since far aps experience a bad sinr it turns out that they are quite unhelpful in serving far users and so the uc approach while requiring less backhaul overhead with respect to the cf approach is shown here to achieve better performance results in terms of achievable rateperuser for the vast majority of the mss in the network furthermore in the paper we propose two power allocation strategy for the uplink and downlink one aimed at maximizing the overall datarate and another aimed at maximizing system fairness | [['recently', 'the', 'socalled', 'cellfree', 'cf', 'massive', 'mimo', 'architecture', 'has', 'been', 'introduced', 'wherein', 'a', 'very', 'large', 'number', 'of', 'distributed', 'access', 'points', 'aps', 'simultaneously', 'and', 'jointly', 'serve', 'a', 'much', 'smaller', 'number', 'of', 'mobile', 'stations', 'mss', 'the', 'paper', 'extends', 'the', 'cf', 'approach', 'to', 'the', 'case', 'in', 'which', 'both', 'the', 'aps', 'and', 'the', 'mss', 'are', 'equipped', 'with', 'multiple', 'antennas', 'proposing', 'a', 'beamfoming', 'scheme', 'that', 'relying', 'on', 'the', 'channel', 'hardening', 'effect', 'does', 'not', 'require', 'channel', 'estimation', 'at', 'the', 'mss', 'we', 'contrast', 'the', 'cf', 'massive', 'mimo', 'approach', 'with', 'a', 'usercentric', 'uc', 'approach', 'wherein', 'each', 'ms', 'is', 'served', 'only', 'by', 'a', 'limited', 'number', 'of', 'aps', 'since', 'far', 'aps', 'experience', 'a', 'bad', 'sinr', 'it', 'turns', 'out', 'that', 'they', 'are', 'quite', 'unhelpful', 'in', 'serving', 'far', 'users', 'and', 'so', 'the', 'uc', 'approach', 'while', 'requiring', 'less', 'backhaul', 'overhead', 'with', 'respect', 'to', 'the', 'cf', 'approach', 'is', 'shown', 'here', 'to', 'achieve', 'better', 'performance', 'results', 'in', 'terms', 'of', 'achievable', 'rateperuser', 'for', 'the', 'vast', 'majority', 'of', 'the', 'mss', 'in', 'the', 'network', 'furthermore', 'in', 'the', 'paper', 'we', 'propose', 'two', 'power', 'allocation', 'strategy', 'for', 'the', 'uplink', 'and', 'downlink', 'one', 'aimed', 'at', 'maximizing', 'the', 'overall', 'datarate', 'and', 'another', 'aimed', 'at', 'maximizing', 'system', 'fairness']] | [-0.21834783493882834, 0.02764570778083947, -0.03423977168226291, 6.458884593524525e-05, -0.07328810966472425, -0.23440468397862074, 0.15117803682780662, 0.3586999252666314, -0.19508304151341968, -0.32192871624346997, 0.057984844026656865, -0.24840799660381416, -0.16504992295496934, 0.13888122946461764, -0.132723091876276, 0.03656364584331522, 0.03787758486325164, 0.06918192145024912, -0.006556358173838817, -0.2867595521763534, 0.2896562442607398, 0.13956294643044795, 0.380242178102692, -0.005271052498795578, 0.07206190542732972, -0.0008289646838143792, -0.03754031153474226, 0.005230331013318273, -0.03178873017555895, 0.09609460097651565, 0.32038480152993504, 0.16197623026623068, 0.3317529279941126, -0.3857308265894813, -0.23596199103264118, 0.08499495994866542, 0.20017472810982523, 0.02568024373296952, -0.03909728399277968, -0.23665649769701186, 0.17626696837175151, -0.23340286156694082, -0.03200823946795224, 0.02669694592781446, -0.07554667818349907, 0.03678131275512936, -0.3432555298153918, -0.003427990418656365, 0.00320363191270229, 0.03383291123748716, -0.028806576304107337, -0.156902670372485, 0.02718474314821398, 0.14876674257633885, 0.045409859919859824, 0.010530181270872203, 0.06163033698280544, -0.10471675175358541, -0.05933961232380091, 0.38888221124754, 0.024457009615498067, -0.24575104854454327, 0.2166278439367686, -0.10747266686065933, -0.11361549032406638, 0.15331964676126675, 0.19161469218765295, 0.09531812305541952, -0.18940663617863523, 0.023732936560523027, -0.02883573034879468, 0.15932292653672883, 0.07885542341334614, 0.11104373055517815, 0.17953873151608327, 0.2253907274849632, 0.14061581083755617, 0.0977115141374626, -0.1300771991664078, -0.11908976444797388, -0.19326708460531614, -0.11203292847621134, -0.22097759961616248, -0.013476877924957713, -0.038359837558069244, -0.05258170318958709, 0.34936384223951594, 0.1209280363704159, 0.15520603975038166, 0.1063325848087476, 0.3798794988403603, 0.09075589641060619, 0.10486688488416131, 0.1577001099193813, 0.2076941956816565, 0.05617382075845102, 0.167374144782788, -0.20296723012174683, 0.015435119984549996, -0.007222091890466602] |
1,803.02262 | Equilibrium configurations of charged fluid around Kerr black hole | Equilibrium configurations of electrically charged perfect fluid surrounding
a central rotating black hole endowed with a test electric charge and embedded
in a large-scale asymptotically uniform magnetic field are presented. Following
our previous studies considering the central black hole non-rotating, we show
that in the rotating case, conditions for the configurations existence change
according to the spin of the black hole. We focus our attention on the charged
fluid in rigid rotation which can form toroidal configurations centered in the
equatorial plane or the ones hovering above the black hole, along the symmetry
axis. We conclude that a non-zero value of spin changes the existence
conditions and the morphology of the solutions significantly. In the case of
fast rotation, the morphology of the structures is close to an oblate shape.
| astro-ph.HE | equilibrium configurations of electrically charged perfect fluid surrounding a central rotating black hole endowed with a test electric charge and embedded in a largescale asymptotically uniform magnetic field are presented following our previous studies considering the central black hole nonrotating we show that in the rotating case conditions for the configurations existence change according to the spin of the black hole we focus our attention on the charged fluid in rigid rotation which can form toroidal configurations centered in the equatorial plane or the ones hovering above the black hole along the symmetry axis we conclude that a nonzero value of spin changes the existence conditions and the morphology of the solutions significantly in the case of fast rotation the morphology of the structures is close to an oblate shape | [['equilibrium', 'configurations', 'of', 'electrically', 'charged', 'perfect', 'fluid', 'surrounding', 'a', 'central', 'rotating', 'black', 'hole', 'endowed', 'with', 'a', 'test', 'electric', 'charge', 'and', 'embedded', 'in', 'a', 'largescale', 'asymptotically', 'uniform', 'magnetic', 'field', 'are', 'presented', 'following', 'our', 'previous', 'studies', 'considering', 'the', 'central', 'black', 'hole', 'nonrotating', 'we', 'show', 'that', 'in', 'the', 'rotating', 'case', 'conditions', 'for', 'the', 'configurations', 'existence', 'change', 'according', 'to', 'the', 'spin', 'of', 'the', 'black', 'hole', 'we', 'focus', 'our', 'attention', 'on', 'the', 'charged', 'fluid', 'in', 'rigid', 'rotation', 'which', 'can', 'form', 'toroidal', 'configurations', 'centered', 'in', 'the', 'equatorial', 'plane', 'or', 'the', 'ones', 'hovering', 'above', 'the', 'black', 'hole', 'along', 'the', 'symmetry', 'axis', 'we', 'conclude', 'that', 'a', 'nonzero', 'value', 'of', 'spin', 'changes', 'the', 'existence', 'conditions', 'and', 'the', 'morphology', 'of', 'the', 'solutions', 'significantly', 'in', 'the', 'case', 'of', 'fast', 'rotation', 'the', 'morphology', 'of', 'the', 'structures', 'is', 'close', 'to', 'an', 'oblate', 'shape']] | [-0.19823892670683563, 0.12219036963439206, -0.03564591937376043, 0.0539351522967291, -0.04933025308060818, -0.08922464422917423, -0.01424017535128559, 0.35722869107356436, -0.168375741590101, -0.2825151491928129, 0.08816570496598546, -0.26898795591371777, -0.055720095383003355, 0.16476923140804642, -0.0443649838391978, -0.00262517650396778, 0.00898520988591302, 0.04890656786469313, -0.11640563274626262, -0.17123142229393123, 0.3389583046046587, 0.05713284151771894, 0.2929379185518393, -0.02658758731558919, 0.0504153659961258, 0.0010453988045740585, 0.07837999732806705, 0.08514606910528248, -0.16985460749095252, 0.05942478007597786, 0.15021742834136464, 0.04710536730260803, 0.16999837017367378, -0.4284834178021321, -0.17885736047935027, 0.05720758168026805, 0.13462017691121078, 0.15636254189661347, -0.15882164863959097, -0.2570875751391913, 0.09531253533652768, -0.17815140570478083, -0.23339002759983907, -0.000915858715486068, 0.06311059483559803, 0.04449976790123261, -0.2311600402302037, 0.10255714856320992, 0.13418472012540755, -0.019872437310046873, -0.17033390363033574, -0.04698104255904372, -0.10121045573256336, 0.08739280967364231, 0.1179747456863809, 0.050695537406807906, 0.23033377405059022, -0.13203262182740638, -0.08697116271807598, 0.3507438901525277, -0.03513820158460965, -0.257983465005572, 0.18110761997791436, -0.2545662865508348, -0.09125807581541057, 0.13503057512526329, 0.17602950133419093, 0.21113119857529036, -0.08618103229225828, 0.07474155478949587, -0.06763712180635104, 0.16329467896587, 0.10539034101037452, -0.025872398114118438, 0.4008899804168882, 0.12889423495015273, 0.057373578746158345, 0.18725049190509777, -0.11107124420276915, -0.1370113667029028, -0.2594049612991512, -0.12019950028222341, -0.12582870910230737, 0.08419315741898922, -0.1398556729955509, -0.18758820622640018, 0.3667658640555321, 0.08237593396423527, 0.19349209695624617, -0.03886062560800033, 0.26805945932865144, 0.025970670998168105, 0.019179027647568056, 0.12997197019151197, 0.3357485645110361, 0.15910351094431602, 0.1238267166683307, -0.26719164547080604, -0.0204647084698081, 0.02872122233160413] |
1,803.02263 | Quantum theory within the probability calculus: a there-you-go theorem
and partially exchangeable models | "Ever since the advent of modern quantum mechanics in the late 1920's, the
idea has been prevalent that the classical laws of probability cease, in some
sense, to be valid in the new theory. [...] The primary object of this
presentation is to show that the thesis in question is entirely without
validity and is the product of a confused view of the laws of probability"
(Koopman, 1957). The secondary objects are: to show that quantum inferences are
cases of partially exchangeable statistical models with particular prior
constraints; to wonder about such constraints; and to plead for a dialogue
between quantum theory and the theory of exchangeable models.
| quant-ph math.PR | ever since the advent of modern quantum mechanics in the late 1920s the idea has been prevalent that the classical laws of probability cease in some sense to be valid in the new theory the primary object of this presentation is to show that the thesis in question is entirely without validity and is the product of a confused view of the laws of probability koopman 1957 the secondary objects are to show that quantum inferences are cases of partially exchangeable statistical models with particular prior constraints to wonder about such constraints and to plead for a dialogue between quantum theory and the theory of exchangeable models | [['ever', 'since', 'the', 'advent', 'of', 'modern', 'quantum', 'mechanics', 'in', 'the', 'late', '1920s', 'the', 'idea', 'has', 'been', 'prevalent', 'that', 'the', 'classical', 'laws', 'of', 'probability', 'cease', 'in', 'some', 'sense', 'to', 'be', 'valid', 'in', 'the', 'new', 'theory', 'the', 'primary', 'object', 'of', 'this', 'presentation', 'is', 'to', 'show', 'that', 'the', 'thesis', 'in', 'question', 'is', 'entirely', 'without', 'validity', 'and', 'is', 'the', 'product', 'of', 'a', 'confused', 'view', 'of', 'the', 'laws', 'of', 'probability', 'koopman', '1957', 'the', 'secondary', 'objects', 'are', 'to', 'show', 'that', 'quantum', 'inferences', 'are', 'cases', 'of', 'partially', 'exchangeable', 'statistical', 'models', 'with', 'particular', 'prior', 'constraints', 'to', 'wonder', 'about', 'such', 'constraints', 'and', 'to', 'plead', 'for', 'a', 'dialogue', 'between', 'quantum', 'theory', 'and', 'the', 'theory', 'of', 'exchangeable', 'models']] | [-0.0676511001183486, 0.13118580655656129, -0.14459757722270128, 0.09925989323909282, -0.09050372521889126, -0.1152959808230696, 0.03468557691232031, 0.30946367971216127, -0.27726086748276496, -0.3072518936105978, 0.09482914778930526, -0.26272392376526216, -0.15230116007466601, 0.18387529564690647, -0.1445745879340325, 0.059990557552550304, 0.06218756613469569, 0.07626008567896402, -0.045000483318902204, -0.2459440094692998, 0.33550490544364725, 0.062111047554595795, 0.2748664794054544, 0.018438295831155277, 0.08701028254304177, -0.016499426368206182, -0.03611503664630456, 0.004166479917823432, -0.08545731030567495, 0.14866574366890312, 0.2889530963390749, 0.1898044199382486, 0.30344589883200473, -0.422902023393626, -0.24741252859027307, 0.10363440426223189, 0.09415581870484645, 0.12009016004016745, -0.0031564152129342623, -0.28573001049911584, 0.11348737751908392, -0.18919497513795427, -0.12793370854179156, -0.022048315407586432, 0.0418678683709684, -0.006934763158662854, -0.20871410803938997, 0.06107537766100369, 0.12396110403220927, 0.03929079674558592, -0.020266253253114277, -0.058568710348107546, 0.010996619717078718, 0.14258839245276334, 0.07315250662172858, 0.002651894254018074, 0.08073750787379795, -0.16919007265252697, -0.14398195929760027, 0.3906352588227976, -8.516691659934053e-05, -0.16715884638654294, 0.21157825645929743, -0.1691385799274719, -0.1999553285917772, 0.05328934301108679, 0.1189700123249057, 0.09881499300005837, -0.1581375275969192, 0.12959905003391153, -0.036566943226155835, 0.13508713363765557, 0.04597152236231089, 0.04509247620111314, 0.2654723380909902, 0.11235258807906899, 0.02439254612463883, 0.07522218676053301, -0.011924075278253338, -0.17481303888712532, -0.29203649157675626, -0.18143109183445155, -0.18241893188488262, 0.06455794887652046, -0.03353032818737018, -0.1666206951975544, 0.31829907673750524, 0.19274483556874428, 0.16477256932374196, 0.05301132298588196, 0.25543316471103195, 0.1265022448029056, 0.020852393366257164, 0.03132015953458428, 0.25592458928488065, 0.16853568055362345, 0.07967447823731699, -0.12970364724381644, 0.08204073523754411, 0.058958097652610494] |
1,803.02264 | Aging rate of spin glasses from simulations matches experiments | Experiments on spin glasses can now make precise measurements of the exponent
$z(T)$ governing the growth of glassy domains, while our computational
capabilities allow us to make quantitative predictions for experimental scales.
However, experimental and numerical values for $z(T)$ have differed. We use new
simulations on the Janus II computer to resolve this discrepancy, finding a
time-dependent $z(T, t_w)$, which leads to the experimental value through mild
extrapolations. Furthermore, theoretical insight is gained by studying a
crossover between the $T = T_c$ and $T = 0$ fixed points.
| cond-mat.dis-nn cond-mat.stat-mech | experiments on spin glasses can now make precise measurements of the exponent zt governing the growth of glassy domains while our computational capabilities allow us to make quantitative predictions for experimental scales however experimental and numerical values for zt have differed we use new simulations on the janus ii computer to resolve this discrepancy finding a timedependent zt t_w which leads to the experimental value through mild extrapolations furthermore theoretical insight is gained by studying a crossover between the t t_c and t 0 fixed points | [['experiments', 'on', 'spin', 'glasses', 'can', 'now', 'make', 'precise', 'measurements', 'of', 'the', 'exponent', 'zt', 'governing', 'the', 'growth', 'of', 'glassy', 'domains', 'while', 'our', 'computational', 'capabilities', 'allow', 'us', 'to', 'make', 'quantitative', 'predictions', 'for', 'experimental', 'scales', 'however', 'experimental', 'and', 'numerical', 'values', 'for', 'zt', 'have', 'differed', 'we', 'use', 'new', 'simulations', 'on', 'the', 'janus', 'ii', 'computer', 'to', 'resolve', 'this', 'discrepancy', 'finding', 'a', 'timedependent', 'zt', 't_w', 'which', 'leads', 'to', 'the', 'experimental', 'value', 'through', 'mild', 'extrapolations', 'furthermore', 'theoretical', 'insight', 'is', 'gained', 'by', 'studying', 'a', 'crossover', 'between', 'the', 't', 't_c', 'and', 't', '0', 'fixed', 'points']] | [-0.07275144592317384, 0.13151997832992915, -0.11933836157347054, 0.008172663740900367, -0.10027846767158291, -0.17248106567557295, 0.11662649648767615, 0.3713253582232134, -0.26448027150120673, -0.30648658173375354, 0.05687509959043805, -0.3048869762569666, -0.09655125771086057, 0.2671711950584553, 0.02160009741783142, 0.1150989526773459, 0.0887089501254174, -0.037179867441895914, -0.1199619828528443, -0.2312527411335776, 0.22717338809093765, 0.06932504510853527, 0.27014580156740753, 0.11966328584415795, 0.04697197694385554, -0.06069925958074109, 0.025974985222916965, 0.04826322721512338, -0.26894197137593184, 0.10364235178459176, 0.2626996087746256, 0.035874633524610205, 0.24916739623213924, -0.4295493336394429, -0.21380153816020073, 0.055947825661860406, 0.12454790523652053, 0.08360697461297563, -0.0627848673747246, -0.23451010958659788, 0.09155007260634976, -0.09190357376030799, -0.11441697831114017, -0.16287972604812578, 0.04065533003737327, -0.012835147632231807, -0.3215326524507471, 0.10434433151588797, 0.00011119804464193971, 0.09907138551217179, -0.031696013272415065, -0.1665807917259287, 0.04439356144745076, 0.12895272893771573, 0.08393562341184724, 0.030072976385654752, 0.16689281989712007, -0.14166739217254745, -0.11630227344197243, 0.3284346880607827, -0.01674205927059141, -0.1286185435127727, 0.2220221116305004, -0.19128652233197246, -0.1235462541009711, 0.1327767412199877, 0.11556358598605838, 0.06676988525121191, -0.10232182654963676, 0.08246721104626696, -0.024723479838305435, 0.19311602309963471, 0.04266009164356822, -0.005165050228581179, 0.20626295373103645, 0.1960209482241162, 0.031539400132524584, 0.10557177613034498, -0.05416707487419507, -0.13449705989089208, -0.2681565703390989, -0.15787802175293827, -0.18307566490609112, 0.10965570217799829, -0.13578289707677255, -0.09107167515795418, 0.35235711314910373, 0.24380581219935096, 0.24961946955557132, 0.09509742576331116, 0.2093053953938706, 0.10430056862208213, 0.05794034846300303, -0.004695641423770508, 0.2368523893163128, 0.12641307812043315, 0.161388696071172, -0.28468178139544675, 0.09949323777542558, 0.015588491911415097] |
1,803.02265 | On stochastic imitation dynamics in large-scale networks | We consider a broad class of stochastic imitation dynamics over networks,
encompassing several well known learning models such as the replicator
dynamics. In the considered models, players have no global information about
the game structure: they only know their own current utility and the one of
neighbor players contacted through pairwise interactions in a network. In
response to this information, players update their state according to some
stochastic rules. For potential population games and complete interaction
networks, we prove convergence and long-lasting permanence close to the
evolutionary stable strategies of the game. These results refine and extend the
ones known for deterministic imitation dynamics as they account for new
emerging behaviors including meta-stability of the equilibria. Finally, we
discuss extensions of our results beyond the fully mixed case, studying
imitation dynamics where agents interact on complex communication networks.
| cs.SY cs.GT math.DS | we consider a broad class of stochastic imitation dynamics over networks encompassing several well known learning models such as the replicator dynamics in the considered models players have no global information about the game structure they only know their own current utility and the one of neighbor players contacted through pairwise interactions in a network in response to this information players update their state according to some stochastic rules for potential population games and complete interaction networks we prove convergence and longlasting permanence close to the evolutionary stable strategies of the game these results refine and extend the ones known for deterministic imitation dynamics as they account for new emerging behaviors including metastability of the equilibria finally we discuss extensions of our results beyond the fully mixed case studying imitation dynamics where agents interact on complex communication networks | [['we', 'consider', 'a', 'broad', 'class', 'of', 'stochastic', 'imitation', 'dynamics', 'over', 'networks', 'encompassing', 'several', 'well', 'known', 'learning', 'models', 'such', 'as', 'the', 'replicator', 'dynamics', 'in', 'the', 'considered', 'models', 'players', 'have', 'no', 'global', 'information', 'about', 'the', 'game', 'structure', 'they', 'only', 'know', 'their', 'own', 'current', 'utility', 'and', 'the', 'one', 'of', 'neighbor', 'players', 'contacted', 'through', 'pairwise', 'interactions', 'in', 'a', 'network', 'in', 'response', 'to', 'this', 'information', 'players', 'update', 'their', 'state', 'according', 'to', 'some', 'stochastic', 'rules', 'for', 'potential', 'population', 'games', 'and', 'complete', 'interaction', 'networks', 'we', 'prove', 'convergence', 'and', 'longlasting', 'permanence', 'close', 'to', 'the', 'evolutionary', 'stable', 'strategies', 'of', 'the', 'game', 'these', 'results', 'refine', 'and', 'extend', 'the', 'ones', 'known', 'for', 'deterministic', 'imitation', 'dynamics', 'as', 'they', 'account', 'for', 'new', 'emerging', 'behaviors', 'including', 'metastability', 'of', 'the', 'equilibria', 'finally', 'we', 'discuss', 'extensions', 'of', 'our', 'results', 'beyond', 'the', 'fully', 'mixed', 'case', 'studying', 'imitation', 'dynamics', 'where', 'agents', 'interact', 'on', 'complex', 'communication', 'networks']] | [-0.09814087900778522, 0.04370495079058236, -0.08076012359495086, 0.15347569653396562, -0.06156961775411838, -0.19974022883705903, 0.09721960665226198, 0.407234672780918, -0.3237942288076316, -0.27391544242214033, 0.09492459463080445, -0.26879184993415856, -0.20108682428068225, 0.09723644976949562, -0.07363885352759203, 0.005256848247802775, 0.06870901116601907, 0.061804237164745944, 0.04035160650897339, -0.2760074507804466, 0.32464668734093616, -8.154093740049048e-05, 0.21906068684884172, -0.003287726959240609, 0.0929268341936657, 0.021606221461020734, 0.001597772811310015, 0.040936641613107116, -0.14650376090455963, 0.07883217485041182, 0.26569593666346814, 0.1763151465608077, 0.36039325122660754, -0.46423860148027324, -0.24172870932734045, 0.1542412374333978, 0.14494285251957068, 0.13665552044530277, -0.02049256205698813, -0.33363119941845915, 0.013173034945266672, -0.1826347704652859, -0.08583056899310643, -0.12197499013627353, -0.026206524871404457, 0.08729150297417157, -0.2714411819634615, -0.01893592461525206, 0.07299309703470815, 0.05114590379652446, -0.08878433155368312, -0.11841210776575557, -0.015003961966494504, 0.20208111980700513, 0.01563910489937331, -0.07086634008126144, 0.14868170600485706, -0.21295865783906556, -0.21280303217160204, 0.3553377077712313, -0.05684670282779194, -0.17551383687912123, 0.24444471644170152, -0.08763207014704096, -0.13767938985340838, 0.07899726226763881, 0.21342248166742586, 0.14523017436495403, -0.15289147354812577, 0.020575057166844497, -0.04266940822581882, 0.11240443157831854, -0.0010454792164913986, 0.061578467895742506, 0.17483296119135575, 0.2140949838558563, 0.10911900353233289, 0.08125934935093898, 0.02212971639676033, -0.2811343545647527, -0.23216737797686263, -0.09141445468665789, -0.12170202392355903, 0.040602820233671344, -0.0941435561200732, -0.13172358331402115, 0.39726143655623647, 0.16897406658846076, 0.1603121598442237, 0.13851602570882635, 0.2687597419034042, 0.025515102065148076, 0.0334686524592394, 0.08883458167395514, 0.24917334446154596, 0.12843287855629687, 0.14557425621340214, -0.20761328676641258, 0.1362699920790729, 0.0038332638450547297] |
1,803.02266 | ExpandNet: A Deep Convolutional Neural Network for High Dynamic Range
Expansion from Low Dynamic Range Content | High dynamic range (HDR) imaging provides the capability of handling real
world lighting as opposed to the traditional low dynamic range (LDR) which
struggles to accurately represent images with higher dynamic range. However,
most imaging content is still available only in LDR. This paper presents a
method for generating HDR content from LDR content based on deep Convolutional
Neural Networks (CNNs) termed ExpandNet. ExpandNet accepts LDR images as input
and generates images with an expanded range in an end-to-end fashion. The model
attempts to reconstruct missing information that was lost from the original
signal due to quantization, clipping, tone mapping or gamma correction. The
added information is reconstructed from learned features, as the network is
trained in a supervised fashion using a dataset of HDR images. The approach is
fully automatic and data driven; it does not require any heuristics or human
expertise. ExpandNet uses a multiscale architecture which avoids the use of
upsampling layers to improve image quality. The method performs well compared
to expansion/inverse tone mapping operators quantitatively on multiple metrics,
even for badly exposed inputs.
| cs.CV cs.GR | high dynamic range hdr imaging provides the capability of handling real world lighting as opposed to the traditional low dynamic range ldr which struggles to accurately represent images with higher dynamic range however most imaging content is still available only in ldr this paper presents a method for generating hdr content from ldr content based on deep convolutional neural networks cnns termed expandnet expandnet accepts ldr images as input and generates images with an expanded range in an endtoend fashion the model attempts to reconstruct missing information that was lost from the original signal due to quantization clipping tone mapping or gamma correction the added information is reconstructed from learned features as the network is trained in a supervised fashion using a dataset of hdr images the approach is fully automatic and data driven it does not require any heuristics or human expertise expandnet uses a multiscale architecture which avoids the use of upsampling layers to improve image quality the method performs well compared to expansioninverse tone mapping operators quantitatively on multiple metrics even for badly exposed inputs | [['high', 'dynamic', 'range', 'hdr', 'imaging', 'provides', 'the', 'capability', 'of', 'handling', 'real', 'world', 'lighting', 'as', 'opposed', 'to', 'the', 'traditional', 'low', 'dynamic', 'range', 'ldr', 'which', 'struggles', 'to', 'accurately', 'represent', 'images', 'with', 'higher', 'dynamic', 'range', 'however', 'most', 'imaging', 'content', 'is', 'still', 'available', 'only', 'in', 'ldr', 'this', 'paper', 'presents', 'a', 'method', 'for', 'generating', 'hdr', 'content', 'from', 'ldr', 'content', 'based', 'on', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'termed', 'expandnet', 'expandnet', 'accepts', 'ldr', 'images', 'as', 'input', 'and', 'generates', 'images', 'with', 'an', 'expanded', 'range', 'in', 'an', 'endtoend', 'fashion', 'the', 'model', 'attempts', 'to', 'reconstruct', 'missing', 'information', 'that', 'was', 'lost', 'from', 'the', 'original', 'signal', 'due', 'to', 'quantization', 'clipping', 'tone', 'mapping', 'or', 'gamma', 'correction', 'the', 'added', 'information', 'is', 'reconstructed', 'from', 'learned', 'features', 'as', 'the', 'network', 'is', 'trained', 'in', 'a', 'supervised', 'fashion', 'using', 'a', 'dataset', 'of', 'hdr', 'images', 'the', 'approach', 'is', 'fully', 'automatic', 'and', 'data', 'driven', 'it', 'does', 'not', 'require', 'any', 'heuristics', 'or', 'human', 'expertise', 'expandnet', 'uses', 'a', 'multiscale', 'architecture', 'which', 'avoids', 'the', 'use', 'of', 'upsampling', 'layers', 'to', 'improve', 'image', 'quality', 'the', 'method', 'performs', 'well', 'compared', 'to', 'expansioninverse', 'tone', 'mapping', 'operators', 'quantitatively', 'on', 'multiple', 'metrics', 'even', 'for', 'badly', 'exposed', 'inputs']] | [-0.01969955032914982, -0.013026289281923334, -0.05728042830705201, 0.07721646553849917, -0.12052192897299084, -0.18050265816990074, -0.003084450056460702, 0.4642384525725229, -0.2732171411001213, -0.37458636802963197, 0.07961667684830283, -0.2754914498872171, -0.19143002362932357, 0.16709981964885304, -0.18863053750746625, 0.08450170403338526, 0.10474341262216116, 0.043211802171995745, -0.0659513430338416, -0.21589945862595897, 0.27978958368648665, 0.07133448476318432, 0.35105461370193997, -0.013144966905494616, 0.16892388828774904, 0.010765711694040288, -0.059172532659965846, -0.019733612131627307, 8.488009283569047e-06, 0.13817007267764786, 0.3341561264903048, 0.2022208242932345, 0.2724607138905022, -0.39670386658402657, -0.25592777787544635, 0.060659643519133076, 0.15026331986011254, 0.09898657239657843, -0.04207730198168527, -0.3098927171911392, 0.09165176354338136, -0.1474841155195977, 0.02858863707295077, -0.12735365057432507, -0.07447477167808993, -0.040324036363777994, -0.3287314752269389, 0.06591245058087349, 0.027885794919115716, 0.06751010279528966, -0.07467925928054261, -0.08135852992197888, 0.006140416091450064, 0.2080423776691748, -0.020850948591474548, 0.1127468923298842, 0.15627655835156617, -0.21593202545806123, -0.06206171531203903, 0.3963306474651994, -0.05988839035787972, -0.22341476818796585, 0.19648916858753537, -0.03923973220132165, -0.08339713867701128, 0.17219168333847096, 0.21468004069717253, 0.1161771572818506, -0.17043226507313466, 0.011083572163242626, -0.01358009398109832, 0.24944763820050125, 0.06757656750558629, 0.012660164065069734, 0.15529994430917574, 0.22747728580544507, 0.02620484972225323, 0.13187291510245305, -0.16939735642271275, -0.00041372697842491547, -0.18047469290200946, -0.0577551494904999, -0.22832441969648382, -0.00945064457556651, -0.06668872768463867, -0.18318908761971037, 0.3927543693311555, 0.24151011376436485, 0.24739701665101288, 0.1125831073834061, 0.399203680105781, 0.017553220904895268, 0.17775492286039937, 0.04494255941655845, 0.13296106410091796, 0.011394749206127756, 0.19582179592630305, -0.09650843801360977, 0.0906035941946557, 0.05293762310287037] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.