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.00667 | Can cut generating functions be good and efficient? | Making cut generating functions (CGFs) computationally viable is a central
question in modern integer programming research. One would like to find CGFs
that are simultaneously good, i.e., there are good guarantees for the cutting
planes they generate, and efficient, meaning that the values of the CGFs can be
computed cheaply (with procedures that have some hope of being implemented in
current solvers). We investigate in this paper to what extent this balance can
be struck. We propose a family of CGFs which, in a sense, achieves this harmony
between good and efficient. In particular, we provide a parameterized family of
$b+\Z^n$ free sets to derive CGFs from and show that our proposed CGFs give a
good approximation of the closure given by CGFs obtained from all maximal
$b+\Z^n$ free sets and their so-called trivial liftings, and simultaneously,
show that these CGFs can be computed with explicit, efficient procedures. We
provide a constructive framework to identify these sets as well as computing
their trivial lifting. We follow it up with computational experiments to
demonstrate this and to evaluate their practical use. Our proposed family of
cuts seem to give some tangible improvement on randomly generated instances
compared to GMI cuts; however, in MIPLIB 3.0 instances, and vertex cover and
stable problems on random graph instances, their performance is poor.
| math.OC | making cut generating functions cgfs computationally viable is a central question in modern integer programming research one would like to find cgfs that are simultaneously good ie there are good guarantees for the cutting planes they generate and efficient meaning that the values of the cgfs can be computed cheaply with procedures that have some hope of being implemented in current solvers we investigate in this paper to what extent this balance can be struck we propose a family of cgfs which in a sense achieves this harmony between good and efficient in particular we provide a parameterized family of bzn free sets to derive cgfs from and show that our proposed cgfs give a good approximation of the closure given by cgfs obtained from all maximal bzn free sets and their socalled trivial liftings and simultaneously show that these cgfs can be computed with explicit efficient procedures we provide a constructive framework to identify these sets as well as computing their trivial lifting we follow it up with computational experiments to demonstrate this and to evaluate their practical use our proposed family of cuts seem to give some tangible improvement on randomly generated instances compared to gmi cuts however in miplib 30 instances and vertex cover and stable problems on random graph instances their performance is poor | [['making', 'cut', 'generating', 'functions', 'cgfs', 'computationally', 'viable', 'is', 'a', 'central', 'question', 'in', 'modern', 'integer', 'programming', 'research', 'one', 'would', 'like', 'to', 'find', 'cgfs', 'that', 'are', 'simultaneously', 'good', 'ie', 'there', 'are', 'good', 'guarantees', 'for', 'the', 'cutting', 'planes', 'they', 'generate', 'and', 'efficient', 'meaning', 'that', 'the', 'values', 'of', 'the', 'cgfs', 'can', 'be', 'computed', 'cheaply', 'with', 'procedures', 'that', 'have', 'some', 'hope', 'of', 'being', 'implemented', 'in', 'current', 'solvers', 'we', 'investigate', 'in', 'this', 'paper', 'to', 'what', 'extent', 'this', 'balance', 'can', 'be', 'struck', 'we', 'propose', 'a', 'family', 'of', 'cgfs', 'which', 'in', 'a', 'sense', 'achieves', 'this', 'harmony', 'between', 'good', 'and', 'efficient', 'in', 'particular', 'we', 'provide', 'a', 'parameterized', 'family', 'of', 'bzn', 'free', 'sets', 'to', 'derive', 'cgfs', 'from', 'and', 'show', 'that', 'our', 'proposed', 'cgfs', 'give', 'a', 'good', 'approximation', 'of', 'the', 'closure', 'given', 'by', 'cgfs', 'obtained', 'from', 'all', 'maximal', 'bzn', 'free', 'sets', 'and', 'their', 'socalled', 'trivial', 'liftings', 'and', 'simultaneously', 'show', 'that', 'these', 'cgfs', 'can', 'be', 'computed', 'with', 'explicit', 'efficient', 'procedures', 'we', 'provide', 'a', 'constructive', 'framework', 'to', 'identify', 'these', 'sets', 'as', 'well', 'as', 'computing', 'their', 'trivial', 'lifting', 'we', 'follow', 'it', 'up', 'with', 'computational', 'experiments', 'to', 'demonstrate', 'this', 'and', 'to', 'evaluate', 'their', 'practical', 'use', 'our', 'proposed', 'family', 'of', 'cuts', 'seem', 'to', 'give', 'some', 'tangible', 'improvement', 'on', 'randomly', 'generated', 'instances', 'compared', 'to', 'gmi', 'cuts', 'however', 'in', 'miplib', '30', 'instances', 'and', 'vertex', 'cover', 'and', 'stable', 'problems', 'on', 'random', 'graph', 'instances', 'their', 'performance', 'is', 'poor']] | [-0.08123029108424115, 0.053144740126065806, -0.0880641968399628, 0.10966386988122495, -0.10130959057244857, -0.1426466498224902, 0.07790527849323586, 0.42658684665866947, -0.28814087023663787, -0.324669077456288, 0.09316555806542448, -0.24544802633831875, -0.14363849769109313, 0.23550957008670811, -0.1133784166352456, 0.05053893042843919, 0.0979585215372435, 0.014293549751377997, -0.07914400366340538, -0.2864701473481212, 0.2730314296610448, 0.02136735976545499, 0.2543221791958385, 0.05639551814705338, 0.09663503555676563, -0.025854839926260875, -0.007042840793632705, 0.06371486829081123, -0.13198497727887257, 0.15282304502314453, 0.3200699266979744, 0.16491624454480655, 0.2427921601199468, -0.40619154975518856, -0.15154526372431615, 0.12722654607458844, 0.13949744071418402, 0.09936580892039223, -0.058779340217086494, -0.2210242308616433, 0.1415437910569097, -0.15178052791172142, -0.08771507679954718, -0.1723001859889904, -0.018693133682405595, 0.020292797795798064, -0.284656966997977, -0.00016514024880945409, 0.04117866450709231, 0.025235748187630275, 0.003396136669117376, -0.14645228251695222, 0.009321296998778136, 0.12781460967060143, 0.01272096846961852, 0.03663289272696327, 0.06926328852054996, -0.09172972468303495, -0.13836719240585274, 0.3829669221029339, -0.013542259437749761, -0.2196035671663052, 0.19604507922152176, -0.09774829528226149, -0.13911420853654727, 0.09279462461650304, 0.14852632124536594, 0.11956508619253686, -0.12841520693693567, 0.05877063547073086, -0.08330640325978518, 0.11568706019177025, 0.09298674922346761, 0.029158800165382547, 0.18473027278177884, 0.1103078016740005, 0.09568032714508372, 0.1595589281321469, 0.0023592908806893804, -0.07962221123594278, -0.2874712781439142, -0.11832609414037557, -0.13845834729994366, 0.021964418991263786, -0.08601452858633694, -0.18460729872859125, 0.3670748015182144, 0.1926468956527736, 0.203858058758661, 0.10733187580192803, 0.2692025957475288, 0.09876549818527398, 0.07259559978884773, 0.12128880245337656, 0.2073950810764314, 0.051145246679629754, 0.02349764843916717, -0.1623659634860147, 0.06644659194296414, 0.0508899546747412] |
1,803.00668 | Electron Scattering in Time-Dependent Density Functional Theory | It was recently shown [Y. Suzuki, L. Lacombe, K. Watanabe, and N. T. Maitra,
Phys. Rev. Lett. 119, 263401 (2017)] that peak and valley structures in the
exact exchange-correlation potential of time-dependent density functional
theory are crucial for accurately capturing time-resolved dynamics of electron
scattering in a model one-dimensional system. Approximate functionals used
today miss these structures and con- sequently underestimate the scattering
probability. The dynamics can vary significantly depending on the choice of the
initial Kohn-Sham state, and, with a judicious choice, a recently-proposed
non-adiabatic ap- proximation provides extremely accurate dynamics on approach
to the target but this ultimately also fails to capture reflection accurately.
Here we provide more details, using a model of electron-He + as illustration,
in both the inelastic and elastic regimes. In the elastic case, the
time-resolved picture is contrasted with the time-independent picture of
scattering, where the linear response theory of TDDFT can be used to extract
transmission and reflection coefficients. Although the exact functional yields
identical scattering probabil- ities when used in this way as it does in the
time-resolved picture, we show that the currently-available approximate
functionals do not, even when they have the correct asymptotic behavior.
| physics.chem-ph | it was recently shown y suzuki l lacombe k watanabe and n t maitra phys rev lett 119 263401 2017 that peak and valley structures in the exact exchangecorrelation potential of timedependent density functional theory are crucial for accurately capturing timeresolved dynamics of electron scattering in a model onedimensional system approximate functionals used today miss these structures and con sequently underestimate the scattering probability the dynamics can vary significantly depending on the choice of the initial kohnsham state and with a judicious choice a recentlyproposed nonadiabatic ap proximation provides extremely accurate dynamics on approach to the target but this ultimately also fails to capture reflection accurately here we provide more details using a model of electronhe as illustration in both the inelastic and elastic regimes in the elastic case the timeresolved picture is contrasted with the timeindependent picture of scattering where the linear response theory of tddft can be used to extract transmission and reflection coefficients although the exact functional yields identical scattering probabil ities when used in this way as it does in the timeresolved picture we show that the currentlyavailable approximate functionals do not even when they have the correct asymptotic behavior | [['it', 'was', 'recently', 'shown', 'y', 'suzuki', 'l', 'lacombe', 'k', 'watanabe', 'and', 'n', 't', 'maitra', 'phys', 'rev', 'lett', '119', '263401', '2017', 'that', 'peak', 'and', 'valley', 'structures', 'in', 'the', 'exact', 'exchangecorrelation', 'potential', 'of', 'timedependent', 'density', 'functional', 'theory', 'are', 'crucial', 'for', 'accurately', 'capturing', 'timeresolved', 'dynamics', 'of', 'electron', 'scattering', 'in', 'a', 'model', 'onedimensional', 'system', 'approximate', 'functionals', 'used', 'today', 'miss', 'these', 'structures', 'and', 'con', 'sequently', 'underestimate', 'the', 'scattering', 'probability', 'the', 'dynamics', 'can', 'vary', 'significantly', 'depending', 'on', 'the', 'choice', 'of', 'the', 'initial', 'kohnsham', 'state', 'and', 'with', 'a', 'judicious', 'choice', 'a', 'recentlyproposed', 'nonadiabatic', 'ap', 'proximation', 'provides', 'extremely', 'accurate', 'dynamics', 'on', 'approach', 'to', 'the', 'target', 'but', 'this', 'ultimately', 'also', 'fails', 'to', 'capture', 'reflection', 'accurately', 'here', 'we', 'provide', 'more', 'details', 'using', 'a', 'model', 'of', 'electronhe', 'as', 'illustration', 'in', 'both', 'the', 'inelastic', 'and', 'elastic', 'regimes', 'in', 'the', 'elastic', 'case', 'the', 'timeresolved', 'picture', 'is', 'contrasted', 'with', 'the', 'timeindependent', 'picture', 'of', 'scattering', 'where', 'the', 'linear', 'response', 'theory', 'of', 'tddft', 'can', 'be', 'used', 'to', 'extract', 'transmission', 'and', 'reflection', 'coefficients', 'although', 'the', 'exact', 'functional', 'yields', 'identical', 'scattering', 'probabil', 'ities', 'when', 'used', 'in', 'this', 'way', 'as', 'it', 'does', 'in', 'the', 'timeresolved', 'picture', 'we', 'show', 'that', 'the', 'currentlyavailable', 'approximate', 'functionals', 'do', 'not', 'even', 'when', 'they', 'have', 'the', 'correct', 'asymptotic', 'behavior']] | [-0.07576121049108527, 0.08343126310955995, -0.14238014723438633, 0.09616249500140839, -0.044817689842602704, -0.1478101082931668, 0.05351682415948744, 0.37690775127945625, -0.22886179383241748, -0.30329181949976675, 0.003020274296432035, -0.2841875601152424, -0.18355624069590704, 0.1802900263240493, -0.020197394200901424, 0.06854115420234545, 0.029407337329757866, 0.007634427066326073, -0.06051723380672532, -0.21748722863170164, 0.22228013630350082, 0.08546041162723365, 0.28859443525531486, 0.05806447728355124, 0.04679758260560144, 0.09915844805679323, 0.007399931930801055, 0.007037790574637863, -0.14437973358182413, 0.08515670970155043, 0.2660499070431494, 0.03808762135304278, 0.2096521792021425, -0.4633064479761136, -0.23778283632357974, 0.04878261352617604, 0.1380610191378461, 0.13409109114824483, 0.008315016279918078, -0.2615574519331858, 0.03472881469375958, -0.17696272024234835, -0.13480091227393132, -0.15017257891061794, 0.06277458954233832, 0.041174362710511524, -0.2793727851267249, 0.12559034736341346, 0.024407871063885977, -0.008723375290477028, -0.08049070684379937, -0.0814483156082133, -0.03639368258639782, 0.05879738401351157, 0.003553492833210233, 0.03361693506303709, 0.12223305330674823, -0.08159854772263013, -0.05543369650573974, 0.3599924653438696, -0.07981590860435972, -0.19319541843166613, 0.19156732653452005, -0.14885861181392102, -0.10813028835157941, 0.13380966673745812, 0.13310939384973608, 0.15313972586833793, -0.15023459922743618, 0.12797959572647719, -0.03080458527256269, 0.16289993296823013, 0.06828888094848178, 0.03868367607052884, 0.14505515946560385, 0.12259432391086496, 0.00942970495816553, 0.035160758163328865, -0.0961865985179126, -0.09957541491409454, -0.2825991724724493, -0.10353173042850965, -0.16861195125238737, 0.09107648978056204, -0.03300515032318193, -0.16540074167596686, 0.3561651911683536, 0.16290282416836513, 0.19834334928358052, 0.009940178249962628, 0.2478862092733228, 0.15335716414241082, -0.0005011764709100438, 0.0851642281365154, 0.23522946346110984, 0.15491311720203763, 0.08461509452778652, -0.2557592402905963, 0.0878297597252337, 0.03186473732300025] |
1,803.00669 | Vertices of modules and decomposition numbers of $C_2 \wr S_n$ | Given $n \in \mathbf{N},$ consider the imprimitive wreath product $C_2 \wr
S_n.$ We study the structure of modules whose ordinary characters form an
involution model of $FC_2 \wr S_n,$ where $F$ is a field of odd prime
characteristic. We classify the vertices of these modules in this case. We then
use this classification of the vertices to describe certain columns of the
decomposition matrix of $C_2 \wr S_n.$
| math.RT | given n in mathbfn consider the imprimitive wreath product c_2 wr s_n we study the structure of modules whose ordinary characters form an involution model of fc_2 wr s_n where f is a field of odd prime characteristic we classify the vertices of these modules in this case we then use this classification of the vertices to describe certain columns of the decomposition matrix of c_2 wr s_n | [['given', 'n', 'in', 'mathbfn', 'consider', 'the', 'imprimitive', 'wreath', 'product', 'c_2', 'wr', 's_n', 'we', 'study', 'the', 'structure', 'of', 'modules', 'whose', 'ordinary', 'characters', 'form', 'an', 'involution', 'model', 'of', 'fc_2', 'wr', 's_n', 'where', 'f', 'is', 'a', 'field', 'of', 'odd', 'prime', 'characteristic', 'we', 'classify', 'the', 'vertices', 'of', 'these', 'modules', 'in', 'this', 'case', 'we', 'then', 'use', 'this', 'classification', 'of', 'the', 'vertices', 'to', 'describe', 'certain', 'columns', 'of', 'the', 'decomposition', 'matrix', 'of', 'c_2', 'wr', 's_n']] | [-0.2286823742529925, 0.10797930229369633, -0.03607434476725757, -0.0009784046509166194, -0.0708528583362589, -0.14234022268176297, 0.02226079343852368, 0.39179831762414646, -0.3248277025516419, -0.18037360990146065, 0.05471033727928229, -0.2661688344772248, -0.13416581494418686, 0.05610962022910826, -0.08908614709370714, -0.10641774284886196, 0.0666421952568378, 0.18768162512466968, -0.05617911593221566, -0.3258585578433293, 0.37152925263816383, -0.08252700588063282, 0.16412997385144562, -0.07397763222209452, 0.03340568590005312, 0.024084151729338747, -0.026135209167157027, -0.07964579133755144, -0.16948279241264305, 0.08458532083793269, 0.26699921505197005, 0.12515923923210187, 0.15134619662935353, -0.34969637392307906, -0.06649631438502933, 0.2566046211046769, 0.18952421052381396, -0.05084425053449676, -0.005230473792728256, -0.20334495722850346, 0.10929588278111838, -0.2641308351200731, -0.129118578385233, 0.0022135251167449445, 0.090742875898928, 0.027292641629601884, -0.28354591170671695, -0.00445332337061272, 0.10890027762883726, 0.12918932648266063, -0.02954181457650574, -0.19591731152853326, -0.010720065966084161, 0.10384796098942924, 0.0013214348651030485, -0.010595326144111288, 0.061911535086384153, -0.14351710602504147, -0.10069585981203572, 0.4162751692621147, -0.03459999050178072, -0.16261089553453906, 0.08212055444635231, -0.22032464776352487, -0.2164244907497264, 0.11658432631862953, 0.10919560669914491, 0.20230393767055563, -0.0488396576641689, 0.13950131718507586, -0.19334033306907206, 0.10385545738972723, 0.10120567003853947, -0.03268298566998804, 0.12343513260609196, 0.04422032592735965, 0.011621404042029205, 0.19244870788636892, -0.010905295795322779, 0.0766240655006293, -0.34687129851868925, -0.20790529577061534, -0.1508271335726878, 0.1691101735101684, -0.1688165434375953, -0.1913660401067532, 0.4152178742155871, 0.07399402375278227, 0.20390173381747445, 0.06326450033606414, 0.175397431875086, 0.059440046083182096, 0.0764363064595005, 0.06235812078589601, 0.019408519872847724, 0.27615785089266653, -0.12427993643969411, -0.19946001020862775, -0.022982097990975222, 0.20970288355259553] |
1,803.0067 | Vacuum energy for Yang-Mills fields in $R^d\times S^1$: One-loop,
two-loop, and beyond | The vacuum energy is calculated for Yang-Mills (YM) system defined in $D$
dimensional space-time of $S^1\times R^d$ ($D=d+1$), where the possibility of
the YM fields to acquire the vacuum expectation values on $S^1$ is taken into
account. The vacuum energy has already been obtained to the order of one-loop
in many people. Here we calculate the vacuum energy in $D$ dimensions to
two-loop order. With an intention to reach higher loops, an approximation
method is proposed, which is especially effective in higher dimensions. By this
method, we can treat the higher-loop contributions of YM interactions as easily
as we treat one-loop effect. As a check, we show reproduction of the two-loop
contribution ($D$-dependence of the coefficient as well as the functional form)
when the coupling constant is small. This approximation method is useful not
only for the Kaluza-Klein theories but also for the finite temperature-density
system (as a quark-gluon plasma).
| hep-th | the vacuum energy is calculated for yangmills ym system defined in d dimensional spacetime of s1times rd dd1 where the possibility of the ym fields to acquire the vacuum expectation values on s1 is taken into account the vacuum energy has already been obtained to the order of oneloop in many people here we calculate the vacuum energy in d dimensions to twoloop order with an intention to reach higher loops an approximation method is proposed which is especially effective in higher dimensions by this method we can treat the higherloop contributions of ym interactions as easily as we treat oneloop effect as a check we show reproduction of the twoloop contribution ddependence of the coefficient as well as the functional form when the coupling constant is small this approximation method is useful not only for the kaluzaklein theories but also for the finite temperaturedensity system as a quarkgluon plasma | [['the', 'vacuum', 'energy', 'is', 'calculated', 'for', 'yangmills', 'ym', 'system', 'defined', 'in', 'd', 'dimensional', 'spacetime', 'of', 's1times', 'rd', 'dd1', 'where', 'the', 'possibility', 'of', 'the', 'ym', 'fields', 'to', 'acquire', 'the', 'vacuum', 'expectation', 'values', 'on', 's1', 'is', 'taken', 'into', 'account', 'the', 'vacuum', 'energy', 'has', 'already', 'been', 'obtained', 'to', 'the', 'order', 'of', 'oneloop', 'in', 'many', 'people', 'here', 'we', 'calculate', 'the', 'vacuum', 'energy', 'in', 'd', 'dimensions', 'to', 'twoloop', 'order', 'with', 'an', 'intention', 'to', 'reach', 'higher', 'loops', 'an', 'approximation', 'method', 'is', 'proposed', 'which', 'is', 'especially', 'effective', 'in', 'higher', 'dimensions', 'by', 'this', 'method', 'we', 'can', 'treat', 'the', 'higherloop', 'contributions', 'of', 'ym', 'interactions', 'as', 'easily', 'as', 'we', 'treat', 'oneloop', 'effect', 'as', 'a', 'check', 'we', 'show', 'reproduction', 'of', 'the', 'twoloop', 'contribution', 'ddependence', 'of', 'the', 'coefficient', 'as', 'well', 'as', 'the', 'functional', 'form', 'when', 'the', 'coupling', 'constant', 'is', 'small', 'this', 'approximation', 'method', 'is', 'useful', 'not', 'only', 'for', 'the', 'kaluzaklein', 'theories', 'but', 'also', 'for', 'the', 'finite', 'temperaturedensity', 'system', 'as', 'a', 'quarkgluon', 'plasma']] | [-0.1017418503543983, 0.17690886032010894, -0.06577232648502104, 0.11296906104621787, -0.034907472330766416, -0.10336978469664852, -0.011100338092073798, 0.3299774410078923, -0.1761350097018294, -0.29278402831405403, 0.06656163030304015, -0.2660705056786537, -0.11942792219420274, 0.1401267076904575, 0.0023240161687135695, 0.03339480350967885, -0.019940799066486457, 0.08685347583144903, -0.048676277840568216, -0.2808541248862942, 0.3177304473379627, 0.04285814787571629, 0.2358805866384258, 0.12745754543226212, 0.10605965202053388, -0.018523309462082884, 0.009618469750663886, 0.046750334507475295, -0.10491284842321572, 0.05065131794040402, 0.23691739534027875, 0.0412147583491848, 0.21513659444948038, -0.3939973806589842, -0.21212461152424414, 0.08146896487101912, 0.1688165563174213, 0.15777971194048102, 0.014481393094950666, -0.2481389964868625, 0.07386499416083098, -0.20081517294670145, -0.1700867965912524, -0.11595914935072263, 0.006684488908698162, -0.09958590370292465, -0.297072375047331, 0.06117648752910706, -0.02096694988392604, -0.005578171921273072, -0.06262297322818389, -0.13580400933666775, -0.03619671568274498, 0.13143067748848505, 0.11188221760404607, 0.0754588807246182, 0.09703175114933402, -0.1824822159273026, -0.0929475585417822, 0.41865351820985475, -0.1074121727181288, -0.218814776558429, 0.13247597900219263, -0.1846263308233271, -0.11619782964078089, 0.12575596117724974, 0.15898489523058137, 0.13280498304219995, -0.1522395197407847, 0.1803347960393876, -3.950199422736963e-05, 0.1444636955841755, 0.07465938460081815, 0.02889621005859226, 0.1659285717519621, 0.12771345130342523, 0.030275042792394135, 0.13359799253443877, -0.024642967077282567, -0.07326895144768059, -0.3739615118627747, -0.166262524202466, -0.16517695911228658, 0.07445519930692777, -0.11147749277452627, -0.17878104953328147, 0.33301240743913996, 0.14970380282145926, 0.17125934082393846, 0.0312549041529807, 0.3061337536503561, 0.17364834537225154, 0.08977934195504834, 0.046746579948812726, 0.2581328752543777, 0.14470128281818082, 0.08763252929396306, -0.24640913592030605, -0.023945796395807215, 0.13794244310818612] |
1,803.00671 | On the Classification of Topological Quandles | We investigate the classification of topological quandles on some simple
manifolds. Precisely we classify all Alexander quandle structures, up to
isomorphism, on the real line and the unit circle. For the closed unit interval
$[0, 1]$, we conjecture that there exists only one topological quandle
structure on it, i.e. the trivial one. Some evidences are provided to support
our conjecture.
| math.GT | we investigate the classification of topological quandles on some simple manifolds precisely we classify all alexander quandle structures up to isomorphism on the real line and the unit circle for the closed unit interval 0 1 we conjecture that there exists only one topological quandle structure on it ie the trivial one some evidences are provided to support our conjecture | [['we', 'investigate', 'the', 'classification', 'of', 'topological', 'quandles', 'on', 'some', 'simple', 'manifolds', 'precisely', 'we', 'classify', 'all', 'alexander', 'quandle', 'structures', 'up', 'to', 'isomorphism', 'on', 'the', 'real', 'line', 'and', 'the', 'unit', 'circle', 'for', 'the', 'closed', 'unit', 'interval', '0', '1', 'we', 'conjecture', 'that', 'there', 'exists', 'only', 'one', 'topological', 'quandle', 'structure', 'on', 'it', 'ie', 'the', 'trivial', 'one', 'some', 'evidences', 'are', 'provided', 'to', 'support', 'our', 'conjecture']] | [-0.2513164412851135, 0.054589470801875, -0.011392233489702145, 0.10175039148889482, -0.1284714338912939, -0.1756236879931142, 0.053062357908735674, 0.4374925541381041, -0.32205938659608363, -0.2223574568827947, 0.12951440170872958, -0.2974364047171548, -0.18996933601641405, 0.21051162748287122, -0.08922183766456632, 0.007219931219394008, 0.03189800910962125, 0.12372590805559108, -0.0533808413388518, -0.34132999457651747, 0.400992133282125, -0.1210561903193593, 0.18523973571136593, 0.11908058723590026, 0.07959178736588607, -0.05012785194752117, 0.017832674955328306, -0.001051929119663934, -0.22458626407957732, 0.09680002381404242, 0.22819166413197914, 0.0943350559178119, 0.15078431725269184, -0.3474227555392038, -0.14585816589339326, 0.159968071229135, 0.08652534980792552, -0.012927819334436208, -0.04604237633563268, -0.27275742432878664, 0.20125459969664614, -0.14152149780032536, -0.12425608757572869, -0.12923602507604906, 0.07003248914455375, -0.04429385628706465, -0.1307190910418285, -0.04337739245966077, 0.11689225571850935, 0.10241113045873741, -0.08517291932366788, -0.04642875034672519, -0.052545024776676046, 0.15819731118778388, -0.008211862746005256, 0.07877348337012033, 0.06933434700282912, -0.05986032980338981, -0.18194256909191608, 0.3794286746531725, 0.014339420692219088, -0.2312960671260953, 0.16736824649075668, -0.19782814068797355, -0.2548378922433282, 0.1296269648708403, 0.04386102839683493, 0.09968755170702934, 0.0370172641230359, 0.12393282273454437, -0.17218872475593042, 0.12826847517862916, 0.13357848794354746, -0.04813555172101284, 0.17604211882377666, 0.07597694279005131, 0.09776719982425372, 0.12823587968790282, -0.010368107752098392, -0.04571143851305048, -0.3237318862540027, -0.2225864523400863, -0.14904688984970563, 0.12295168135315179, -0.09631684095729724, -0.19778698598966002, 0.42361970034738383, 0.11113938050111756, 0.19267270107132692, 0.13063029817615945, 0.2548531379453683, 0.037095398030942306, 0.08012074735015631, 0.08735129565466196, 0.1346110848603227, 0.17901277172689636, -0.03066149780837198, -0.1062597254368787, -0.06104297621641308, 0.16123499407743414] |
1,803.00672 | Mass-dimension-one spinors in the context of non-linear cosmology | The RIM spinors (Restricted Inomata McKinley spinors) constitutes a very
particular class of solutions of the non-linear Heisenberg equation. As a
matter of fact, a free linear massive or even mass-less Dirac field can be
decomposed into a combination of RIM spinors and such a procedure shows up to
be useful to describe neutrino physics and neutrinos oscillation. In this paper
we show that not only Dirac spinors but also mass-dimension-one spinors can be
decomposed into a combination of non-linear Heisenberg spinors. In order to
extend the analysis carried out, shedding light to explore mass-dimension-one
fermions within Spinor Theory of Gravity scenario.
| hep-th | the rim spinors restricted inomata mckinley spinors constitutes a very particular class of solutions of the nonlinear heisenberg equation as a matter of fact a free linear massive or even massless dirac field can be decomposed into a combination of rim spinors and such a procedure shows up to be useful to describe neutrino physics and neutrinos oscillation in this paper we show that not only dirac spinors but also massdimensionone spinors can be decomposed into a combination of nonlinear heisenberg spinors in order to extend the analysis carried out shedding light to explore massdimensionone fermions within spinor theory of gravity scenario | [['the', 'rim', 'spinors', 'restricted', 'inomata', 'mckinley', 'spinors', 'constitutes', 'a', 'very', 'particular', 'class', 'of', 'solutions', 'of', 'the', 'nonlinear', 'heisenberg', 'equation', 'as', 'a', 'matter', 'of', 'fact', 'a', 'free', 'linear', 'massive', 'or', 'even', 'massless', 'dirac', 'field', 'can', 'be', 'decomposed', 'into', 'a', 'combination', 'of', 'rim', 'spinors', 'and', 'such', 'a', 'procedure', 'shows', 'up', 'to', 'be', 'useful', 'to', 'describe', 'neutrino', 'physics', 'and', 'neutrinos', 'oscillation', 'in', 'this', 'paper', 'we', 'show', 'that', 'not', 'only', 'dirac', 'spinors', 'but', 'also', 'massdimensionone', 'spinors', 'can', 'be', 'decomposed', 'into', 'a', 'combination', 'of', 'nonlinear', 'heisenberg', 'spinors', 'in', 'order', 'to', 'extend', 'the', 'analysis', 'carried', 'out', 'shedding', 'light', 'to', 'explore', 'massdimensionone', 'fermions', 'within', 'spinor', 'theory', 'of', 'gravity', 'scenario']] | [-0.13618095404352062, 0.19795047278515995, -0.10627945830579848, 0.09565553249674849, -0.1558586579374969, -0.17098925127647818, 0.0003923412272706628, 0.30390854289755226, -0.23796322891488672, -0.26550416424870493, 0.04776786331087351, -0.23213027052581311, -0.14484229271067306, 0.17079362127697095, 0.02432214396307245, -0.032573046670877376, 0.05573042895644903, 0.023504134882241488, -0.11142511790618301, -0.24836682735010981, 0.3160814246209338, -0.0017188644781708717, 0.21736897789873183, 0.01738447026349604, 0.11952249430119992, -0.02967387448530644, 0.014764862461015582, 0.020442794141126798, -0.03303664258950448, 0.07824313996359705, 0.2547509770048782, 0.06389306397177279, 0.18303371363203041, -0.4417566280066967, -0.23977478876244276, 0.11111815875396132, 0.2324124641995877, 0.09516147030517459, -0.009457057253457605, -0.32805033412761986, 0.015958945371676237, -0.1787989371456206, -0.1868853084836155, -0.12787278374191374, -0.07833073104615323, -0.10016616745851933, -0.2180299875838682, 0.09096690432837931, 0.05404956493934151, -0.013795196497812866, -0.06514488529181107, -0.11516433883458375, -0.03966345807071775, 0.0186617718427442, 0.0792096044588834, -0.007530809841118753, 0.08334329049801453, -0.1355211398168467, -0.09895345842465758, 0.45501569036394357, -0.10261569094727747, -0.26830028829630465, 0.12348796842852608, -0.15518777870573103, -0.11215725888265297, 0.07037236432544887, 0.18771972393151373, 0.11074920155573637, -0.17396829470759256, 0.12582768030348235, -0.10316741234157234, 0.1488033487275243, 0.0819189047627151, 0.008251517760800197, 0.31074316829734017, 0.1274460659385659, 0.08282110427506267, 0.10839430348598399, -0.014306918594520539, -0.07628370934631676, -0.35295837235637006, -0.223950960082002, -0.12939875461161138, 0.12162520641824813, -0.042888997839472726, -0.16136036008596422, 0.418281673733145, 0.09099701891420409, 0.14786369369365274, -0.016738764503970743, 0.21359874294139444, 0.12041697522508912, 0.08459904869552702, 0.06783368580974639, 0.27347799472045153, 0.19404041450936346, 0.05807504251366481, -0.1991173745971173, -0.13151628863997758, 0.08473681472241879] |
1,803.00673 | An efficient algorithm to test forcibly-connectedness of graphical
degree sequences | We present an algorithm to test whether a given graphical degree sequence is
forcibly connected or not and prove its correctness. We also outline the
extensions of the algorithm to test whether a given graphical degree sequence
is forcibly $k$-connected or not for every fixed $k\ge 2$. We show through
experimental evaluations that the algorithm is efficient on average, though its
worst case run time is probably exponential. We also adapt Ruskey et al's
classic algorithm to enumerate zero-free graphical degree sequences of length
$n$ and Barnes and Savage's classic algorithm to enumerate graphical partitions
of even integer $n$ by incorporating our testing algorithm into theirs and then
obtain some enumerative results about forcibly connected graphical degree
sequences of given length $n$ and forcibly connected graphical partitions of
given even integer $n$. Based on these enumerative results we make some
conjectures such as: when $n$ is large, (1) almost all zero-free graphical
degree sequences of length $n$ are forcibly connected; (2) almost none of the
graphical partitions of even $n$ are forcibly connected.
| math.CO cs.DS | we present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness we also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly kconnected or not for every fixed kge 2 we show through experimental evaluations that the algorithm is efficient on average though its worst case run time is probably exponential we also adapt ruskey et als classic algorithm to enumerate zerofree graphical degree sequences of length n and barnes and savages classic algorithm to enumerate graphical partitions of even integer n by incorporating our testing algorithm into theirs and then obtain some enumerative results about forcibly connected graphical degree sequences of given length n and forcibly connected graphical partitions of given even integer n based on these enumerative results we make some conjectures such as when n is large 1 almost all zerofree graphical degree sequences of length n are forcibly connected 2 almost none of the graphical partitions of even n are forcibly connected | [['we', 'present', 'an', 'algorithm', 'to', 'test', 'whether', 'a', 'given', 'graphical', 'degree', 'sequence', 'is', 'forcibly', 'connected', 'or', 'not', 'and', 'prove', 'its', 'correctness', 'we', 'also', 'outline', 'the', 'extensions', 'of', 'the', 'algorithm', 'to', 'test', 'whether', 'a', 'given', 'graphical', 'degree', 'sequence', 'is', 'forcibly', 'kconnected', 'or', 'not', 'for', 'every', 'fixed', 'kge', '2', 'we', 'show', 'through', 'experimental', 'evaluations', 'that', 'the', 'algorithm', 'is', 'efficient', 'on', 'average', 'though', 'its', 'worst', 'case', 'run', 'time', 'is', 'probably', 'exponential', 'we', 'also', 'adapt', 'ruskey', 'et', 'als', 'classic', 'algorithm', 'to', 'enumerate', 'zerofree', 'graphical', 'degree', 'sequences', 'of', 'length', 'n', 'and', 'barnes', 'and', 'savages', 'classic', 'algorithm', 'to', 'enumerate', 'graphical', 'partitions', 'of', 'even', 'integer', 'n', 'by', 'incorporating', 'our', 'testing', 'algorithm', 'into', 'theirs', 'and', 'then', 'obtain', 'some', 'enumerative', 'results', 'about', 'forcibly', 'connected', 'graphical', 'degree', 'sequences', 'of', 'given', 'length', 'n', 'and', 'forcibly', 'connected', 'graphical', 'partitions', 'of', 'given', 'even', 'integer', 'n', 'based', 'on', 'these', 'enumerative', 'results', 'we', 'make', 'some', 'conjectures', 'such', 'as', 'when', 'n', 'is', 'large', '1', 'almost', 'all', 'zerofree', 'graphical', 'degree', 'sequences', 'of', 'length', 'n', 'are', 'forcibly', 'connected', '2', 'almost', 'none', 'of', 'the', 'graphical', 'partitions', 'of', 'even', 'n', 'are', 'forcibly', 'connected']] | [-0.17049577934236798, 0.0944012606233349, -0.05815366325049386, 0.08247504899657811, -0.1221987464898562, -0.24697625648090346, 0.04324335346504443, 0.40109539119731313, -0.2765968847061599, -0.34393609215564636, 0.08861633606868759, -0.24735317370622834, -0.18391245314070814, 0.15996423054411146, -0.08560075488673642, 0.026545488496978548, 0.07976076318317152, 0.0963739140895922, 0.014056786310702906, -0.3898270164180353, 0.25350895533764445, -0.019781255962682424, 0.15442150192485982, 0.03862001931542434, 0.05602054793328434, 0.07287486004670059, -0.037934167507088425, 0.036680774021919986, -0.1562067808496656, 0.09114427490676673, 0.2707483071855382, 0.23437117430703805, 0.23496051932647394, -0.38657636564366943, -0.08965194427052976, 0.16694003237529814, 0.17616497542558715, 0.05517496647194803, 0.02291911040739603, -0.2218811654343103, 0.17719354417385005, -0.08788183519478437, -0.12124426851878105, -0.02952761867358161, 0.06542830113819505, 0.04271186766553821, -0.3209241190171569, -0.013950530430026127, 0.13244002723711074, 0.09719358907065037, 0.06212806438009734, -0.1902328738835075, 0.01415911928287605, 0.11061383476376539, -0.0223821570270431, 0.04598411399537342, 0.01853519497201051, -0.07920680393672123, -0.158833155626528, 0.2974883052735789, 0.02473423939542791, -0.20651917556042357, 0.1448055766159507, -0.09499081494717326, -0.19736161483505557, 0.12673797024510844, 0.12754758104488167, 0.15341729020721392, -0.042106384109060355, 0.11205221891687171, -0.12531885130578554, 0.1989257319310863, 0.13854716553465823, -0.03383469909181915, 0.13816680111908866, 0.11149243630248128, 0.07759051645616058, 0.17393468740003215, 0.009727712203829274, -0.04207606651050421, -0.287485122928299, -0.1644575560500447, -0.22816109898395168, 0.043364272541884664, -0.1825424118173232, -0.19122485397248987, 0.36841802251110706, 0.14323693295574688, 0.19275679090464046, 0.20720580407563663, 0.2669055694283519, 0.034449644556344416, 0.0005747672766608568, 0.17397998513146998, 0.015422614018440872, 0.14617913212651398, -0.03451193940847294, -0.11332187092879173, 0.11791670924278698, 0.10176013712098315] |
1,803.00674 | Fractal solutions of dispersive partial differential equations on the
torus | We use exponential sums to study the fractal dimension of the graphs of
solutions to linear dispersive PDE. Our techniques apply to Schr\"odinger,
Airy, Boussinesq, the fractional Schr\"odinger, and the gravity and
gravity-capillary water wave equations. We also discuss applications to certain
nonlinear dispersive equations. In particular, we obtain bounds for the
dimension of the graph of the solution to cubic nonlinear Schr\"odinger and
Korteweg-de Vries equations along oblique lines in space-time.
| math.AP math.NT | we use exponential sums to study the fractal dimension of the graphs of solutions to linear dispersive pde our techniques apply to schrodinger airy boussinesq the fractional schrodinger and the gravity and gravitycapillary water wave equations we also discuss applications to certain nonlinear dispersive equations in particular we obtain bounds for the dimension of the graph of the solution to cubic nonlinear schrodinger and kortewegde vries equations along oblique lines in spacetime | [['we', 'use', 'exponential', 'sums', 'to', 'study', 'the', 'fractal', 'dimension', 'of', 'the', 'graphs', 'of', 'solutions', 'to', 'linear', 'dispersive', 'pde', 'our', 'techniques', 'apply', 'to', 'schrodinger', 'airy', 'boussinesq', 'the', 'fractional', 'schrodinger', 'and', 'the', 'gravity', 'and', 'gravitycapillary', 'water', 'wave', 'equations', 'we', 'also', 'discuss', 'applications', 'to', 'certain', 'nonlinear', 'dispersive', 'equations', 'in', 'particular', 'we', 'obtain', 'bounds', 'for', 'the', 'dimension', 'of', 'the', 'graph', 'of', 'the', 'solution', 'to', 'cubic', 'nonlinear', 'schrodinger', 'and', 'kortewegde', 'vries', 'equations', 'along', 'oblique', 'lines', 'in', 'spacetime']] | [-0.14754563338485444, 0.03165847511910316, -0.03972263877383537, 0.08365228515402931, -0.18321001907396647, -0.1425100797916659, -0.08373594897178312, 0.29050481541910106, -0.2932643119452728, -0.17001456185890776, 0.1354585652879905, -0.3355866742397969, -0.20573424361646175, 0.19233575049373838, -0.004876002035517659, 0.18673515270671082, 0.028857332098090813, -0.02797247174506386, -0.08383993294814394, -0.24805368723213583, 0.3717403813368744, -0.05397607466309435, 0.19040988989743507, 0.03895714351286491, 0.1271762696495797, -0.027939634843884658, 0.014568906316223243, -0.024886849232845835, -0.2439643675332061, 0.09722370871653159, 0.2593987921007081, 0.018666366949522246, 0.2323769953282964, -0.48218771453118986, -0.2853142781726395, 0.07088323819657995, 0.16519136164182177, 0.19007960739286822, 0.01775884418748319, -0.34318490683411557, -0.009293531688551107, -0.07079488045484242, -0.28752113336748963, -0.052106016884661384, 0.018571307132434513, 0.1188962295515618, -0.24909781638739836, 0.13819529657767918, 0.08231097603371988, -0.04080486412082488, -0.12295668816012847, -0.05160382725039704, -0.051571543228217505, -0.039813341291543715, 0.04193947524052217, -0.08344695566726539, -0.019087133385861915, -0.15228913439204916, -0.10090166894305083, 0.4169018597005763, -0.14105252556328196, -0.2922862073303097, 0.14832418312370363, -0.15550163026071256, -0.10194468188112499, 0.12868168498648125, 0.2624107796841094, 0.11846891790628433, -0.13047635021050358, 0.14600022255924866, -0.05449448335740373, 0.15092848329287437, 0.18828275872187483, 0.016094732424891036, 0.026722436900147133, 0.1132782306748494, 0.12361137667903677, 0.15225281372760138, -0.0052546508571443456, -0.10259970816938828, -0.3136043900675658, -0.16021886467933655, -0.11737341538537294, 0.08987802672325212, -0.18683881766567842, -0.23555317652870952, 0.42194660080389845, 0.15174616433473098, 0.06038557660455505, 0.08701865477228744, 0.20424986561475736, 0.25726237746453584, -0.015147883768400384, 0.07404380763697797, 0.2020748778062019, 0.24832067507668398, 0.1832233734021429, -0.2692455098585924, -0.13041819501409513, 0.2293742456111229] |
1,803.00675 | Nematic phase in a two-dimensional Hubbard model at weak coupling and
finite temperature | We apply the self-consistent renormalized perturbation theory to the Hubbard
model on the square lattice, at finite temperatures in order to study the
evolution of the Fermi-surface (FS) as a function of temperature and doping.
Previously, a nematic phase for the same model has been reported to appear at
weak coupling near a Lifshitz transition from closed to open FS at zero
temperature where the self-consistent renormalized perturbation theory was
shown to be sensitive to small deformations of the FS. We find that the
competition with the superconducting order leads to a maximal nematic order
appearing at non-zero temperature. We explicitly observe the two competing
phases near the onset of nematic instability and, by comparing the grand
canonical potentials, we find that the transitions are first-order. We explain
the origin of the interaction-driven spontaneous symmetry breaking to a nematic
phase in a system with several symmetry-related Van Hove points and discuss the
required conditions.
| cond-mat.str-el cond-mat.mes-hall | we apply the selfconsistent renormalized perturbation theory to the hubbard model on the square lattice at finite temperatures in order to study the evolution of the fermisurface fs as a function of temperature and doping previously a nematic phase for the same model has been reported to appear at weak coupling near a lifshitz transition from closed to open fs at zero temperature where the selfconsistent renormalized perturbation theory was shown to be sensitive to small deformations of the fs we find that the competition with the superconducting order leads to a maximal nematic order appearing at nonzero temperature we explicitly observe the two competing phases near the onset of nematic instability and by comparing the grand canonical potentials we find that the transitions are firstorder we explain the origin of the interactiondriven spontaneous symmetry breaking to a nematic phase in a system with several symmetryrelated van hove points and discuss the required conditions | [['we', 'apply', 'the', 'selfconsistent', 'renormalized', 'perturbation', 'theory', 'to', 'the', 'hubbard', 'model', 'on', 'the', 'square', 'lattice', 'at', 'finite', 'temperatures', 'in', 'order', 'to', 'study', 'the', 'evolution', 'of', 'the', 'fermisurface', 'fs', 'as', 'a', 'function', 'of', 'temperature', 'and', 'doping', 'previously', 'a', 'nematic', 'phase', 'for', 'the', 'same', 'model', 'has', 'been', 'reported', 'to', 'appear', 'at', 'weak', 'coupling', 'near', 'a', 'lifshitz', 'transition', 'from', 'closed', 'to', 'open', 'fs', 'at', 'zero', 'temperature', 'where', 'the', 'selfconsistent', 'renormalized', 'perturbation', 'theory', 'was', 'shown', 'to', 'be', 'sensitive', 'to', 'small', 'deformations', 'of', 'the', 'fs', 'we', 'find', 'that', 'the', 'competition', 'with', 'the', 'superconducting', 'order', 'leads', 'to', 'a', 'maximal', 'nematic', 'order', 'appearing', 'at', 'nonzero', 'temperature', 'we', 'explicitly', 'observe', 'the', 'two', 'competing', 'phases', 'near', 'the', 'onset', 'of', 'nematic', 'instability', 'and', 'by', 'comparing', 'the', 'grand', 'canonical', 'potentials', 'we', 'find', 'that', 'the', 'transitions', 'are', 'firstorder', 'we', 'explain', 'the', 'origin', 'of', 'the', 'interactiondriven', 'spontaneous', 'symmetry', 'breaking', 'to', 'a', 'nematic', 'phase', 'in', 'a', 'system', 'with', 'several', 'symmetryrelated', 'van', 'hove', 'points', 'and', 'discuss', 'the', 'required', 'conditions']] | [-0.18351172242697641, 0.19454347801261715, -0.07211783918394864, 0.06705080084623648, -0.019413311223426908, -0.11476420049930548, 0.06441891642496014, 0.3418340617216301, -0.2560711904102332, -0.25458828184161, 0.04190772341023042, -0.31932993244089475, -0.1391324234805856, 0.09219551141156102, 0.04849090427160263, 0.034480890467787136, -0.09365146198043865, 0.03184660516230257, -0.17005763325217338, -0.21731592407571032, 0.33139097807904727, 0.020891588903939377, 0.28036385890725374, 0.0986601657479058, 0.04978274272198414, -0.04791329310399589, 0.12460851741882113, 0.032082499613435095, -0.20361009424950327, -0.0029531568659215486, 0.24999134210785004, -0.08477251383917431, 0.21956180181889492, -0.420970490855443, -0.22794298061423682, 0.06089219465615929, 0.10447193871330857, 0.18129393530634608, -0.01561482001701521, -0.26945089598718497, 0.06817407937644446, -0.1556726443164002, -0.19660027071458663, -0.10835792902590972, -0.02491590931146805, -0.010758783458127313, -0.26738690208740434, 0.11318954197665701, 0.03751399716386547, 0.06514517842132792, -0.07535587608898905, -0.06147653952939436, -0.06003843241389357, 0.06840404970631875, 0.0751302702119574, 0.08450216315263374, 0.1005640789577677, -0.10677183991035011, -0.08198682781249926, 0.3714020695573614, -0.07525557377330305, -0.0724804542294262, 0.1843780624383891, -0.2020492051054713, -0.09364075218811148, 0.1923688011948479, 0.10295181128789078, 0.07233613452801553, -0.10423923259927564, 0.08299204951806853, 0.025063704475518558, 0.15842005532830591, 0.056640174050887976, 0.01504741053931512, 0.2511468363696008, 0.1573960609498204, 0.04374876136698022, 0.1416864973098318, -0.10114979579917747, -0.1334629538529492, -0.3342300724818722, -0.099656111184302, -0.18420770184693303, 0.01862920706111986, -0.06691023464552384, -0.2011835577528449, 0.42292954839233843, 0.168556234671571, 0.21363385641560345, -0.008033231801849294, 0.19912693537197185, 0.1346199170061895, 0.07256188941514724, 0.03114542950476919, 0.27334124885209193, 0.12536332485350696, 0.06752511517631567, -0.31247938972710354, 0.005052375895585018, 0.09600771542989298] |
1,803.00676 | Meta-Learning for Semi-Supervised Few-Shot Classification | In few-shot classification, we are interested in learning algorithms that
train a classifier from only a handful of labeled examples. Recent progress in
few-shot classification has featured meta-learning, in which a parameterized
model for a learning algorithm is defined and trained on episodes representing
different classification problems, each with a small labeled training set and
its corresponding test set. In this work, we advance this few-shot
classification paradigm towards a scenario where unlabeled examples are also
available within each episode. We consider two situations: one where all
unlabeled examples are assumed to belong to the same set of classes as the
labeled examples of the episode, as well as the more challenging situation
where examples from other distractor classes are also provided. To address this
paradigm, we propose novel extensions of Prototypical Networks (Snell et al.,
2017) that are augmented with the ability to use unlabeled examples when
producing prototypes. These models are trained in an end-to-end way on
episodes, to learn to leverage the unlabeled examples successfully. We evaluate
these methods on versions of the Omniglot and miniImageNet benchmarks, adapted
to this new framework augmented with unlabeled examples. We also propose a new
split of ImageNet, consisting of a large set of classes, with a hierarchical
structure. Our experiments confirm that our Prototypical Networks can learn to
improve their predictions due to unlabeled examples, much like a
semi-supervised algorithm would.
| cs.LG cs.CV stat.ML | in fewshot classification we are interested in learning algorithms that train a classifier from only a handful of labeled examples recent progress in fewshot classification has featured metalearning in which a parameterized model for a learning algorithm is defined and trained on episodes representing different classification problems each with a small labeled training set and its corresponding test set in this work we advance this fewshot classification paradigm towards a scenario where unlabeled examples are also available within each episode we consider two situations one where all unlabeled examples are assumed to belong to the same set of classes as the labeled examples of the episode as well as the more challenging situation where examples from other distractor classes are also provided to address this paradigm we propose novel extensions of prototypical networks snell et al 2017 that are augmented with the ability to use unlabeled examples when producing prototypes these models are trained in an endtoend way on episodes to learn to leverage the unlabeled examples successfully we evaluate these methods on versions of the omniglot and miniimagenet benchmarks adapted to this new framework augmented with unlabeled examples we also propose a new split of imagenet consisting of a large set of classes with a hierarchical structure our experiments confirm that our prototypical networks can learn to improve their predictions due to unlabeled examples much like a semisupervised algorithm would | [['in', 'fewshot', 'classification', 'we', 'are', 'interested', 'in', 'learning', 'algorithms', 'that', 'train', 'a', 'classifier', 'from', 'only', 'a', 'handful', 'of', 'labeled', 'examples', 'recent', 'progress', 'in', 'fewshot', 'classification', 'has', 'featured', 'metalearning', 'in', 'which', 'a', 'parameterized', 'model', 'for', 'a', 'learning', 'algorithm', 'is', 'defined', 'and', 'trained', 'on', 'episodes', 'representing', 'different', 'classification', 'problems', 'each', 'with', 'a', 'small', 'labeled', 'training', 'set', 'and', 'its', 'corresponding', 'test', 'set', 'in', 'this', 'work', 'we', 'advance', 'this', 'fewshot', 'classification', 'paradigm', 'towards', 'a', 'scenario', 'where', 'unlabeled', 'examples', 'are', 'also', 'available', 'within', 'each', 'episode', 'we', 'consider', 'two', 'situations', 'one', 'where', 'all', 'unlabeled', 'examples', 'are', 'assumed', 'to', 'belong', 'to', 'the', 'same', 'set', 'of', 'classes', 'as', 'the', 'labeled', 'examples', 'of', 'the', 'episode', 'as', 'well', 'as', 'the', 'more', 'challenging', 'situation', 'where', 'examples', 'from', 'other', 'distractor', 'classes', 'are', 'also', 'provided', 'to', 'address', 'this', 'paradigm', 'we', 'propose', 'novel', 'extensions', 'of', 'prototypical', 'networks', 'snell', 'et', 'al', '2017', 'that', 'are', 'augmented', 'with', 'the', 'ability', 'to', 'use', 'unlabeled', 'examples', 'when', 'producing', 'prototypes', 'these', 'models', 'are', 'trained', 'in', 'an', 'endtoend', 'way', 'on', 'episodes', 'to', 'learn', 'to', 'leverage', 'the', 'unlabeled', 'examples', 'successfully', 'we', 'evaluate', 'these', 'methods', 'on', 'versions', 'of', 'the', 'omniglot', 'and', 'miniimagenet', 'benchmarks', 'adapted', 'to', 'this', 'new', 'framework', 'augmented', 'with', 'unlabeled', 'examples', 'we', 'also', 'propose', 'a', 'new', 'split', 'of', 'imagenet', 'consisting', 'of', 'a', 'large', 'set', 'of', 'classes', 'with', 'a', 'hierarchical', 'structure', 'our', 'experiments', 'confirm', 'that', 'our', 'prototypical', 'networks', 'can', 'learn', 'to', 'improve', 'their', 'predictions', 'due', 'to', 'unlabeled', 'examples', 'much', 'like', 'a', 'semisupervised', 'algorithm', 'would']] | [0.0017340611248152144, 0.024376751661557176, 0.0034101374721501295, 0.06852660127421559, -0.14021402577470457, -0.17981847017414834, 0.04515494701192509, 0.4433037737844052, -0.26521010256827976, -0.36267970293534524, 0.07071408952860508, -0.29129156506584064, -0.20503476306542076, 0.23742378567559877, -0.15563549141339747, 0.034234579773246836, 0.14240105509822504, 0.06692598087741344, -0.062464964194314, -0.33595676822345943, 0.32897190597045406, -0.015971424551962904, 0.26889851362468653, -0.01897586914569591, 0.11923033708920178, -0.08585009332222146, -0.01086541148934723, 0.02126625183016239, -0.08258375732599958, 0.17670211246745152, 0.31664363729326345, 0.18852268412378637, 0.3288148888517816, -0.3762415263678846, -0.2259561839052103, 0.13692459362071185, 0.11796569943531855, 0.1512743020969447, -0.06214535949648171, -0.34771484938889613, 0.10315108150183283, -0.19779117811658697, -0.01312110356551099, -0.15503627221700755, -0.02977860824344075, 0.007121982996339922, -0.30066679370840527, -0.009529369879837523, 0.07328592976847527, 0.026873039214738777, -0.0581404267073492, -0.10011998198732927, 0.031684364221417606, 0.12224630913276374, 0.03351106854091152, 0.027713535194289245, 0.07844901089133187, -0.16195257771852828, -0.1853898762023778, 0.3579915335313195, -0.022403938222063696, -0.20508399770143582, 0.26564318827228434, -0.01642600153028578, -0.20134335056802025, 0.06345585580749913, 0.27034093833324857, 0.17641458585828107, -0.14028875662768067, 0.023124988766606833, -0.11031105295952523, 0.13715819998249185, 0.03664758625275, -0.045457610727420876, 0.16125526725620967, 0.24643403895146887, -0.006698432036784369, 0.19175271480671813, -0.10210270282824511, -0.06972770295655194, -0.28316773259326883, -0.060612317073880595, -0.2035754721831466, -0.010100305075878157, -0.0634039724828374, -0.16168980680174774, 0.3956724148308173, 0.20051173707752518, 0.28304967653103075, 0.10403153239457073, 0.30681859563181413, -0.002114031233802615, 0.08778695649370648, 0.11413582042464382, 0.15481802286656807, 0.029210101496589518, 0.08915639358060636, -0.09692968283195323, 0.06191636345931833, 0.05593978568863172] |
1,803.00677 | Probing the Type-II Seesaw Mechanism through the Production of Higgs
Bosons at a Lepton Collider | We investigate the production and decays of doubly-charged Higgs bosons for
the Type-II seesaw mechanism at an $e^{+} e^{-}$ collider with two center of
mass energies, $\sqrt{s}=380$ GeV and 3 TeV, and analyze the fully hadronic
final states in detail. Lower mass ranges can be probed during the 380 GeV run
of the collider, while high mass ranges, which are beyond the 13 TeV Large
Hadron Collider discovery reach, can be probed with $\sqrt{s}=3$ TeV. For such
a heavy Higgs boson, the final decay products are collimated, resulting in
fat-jets. We perform a substructure analysis to reduce the background and find
that a doubly-charged Higgs boson in the mass range 800-1120 GeV can be
discovered during the 3 TeV run, with integrated luminosity $\mathcal{L} \sim
95\, \rm{fb}^{-1}$ of data. For 380 GeV center of mass energy, we find that for
the doubly-charged Higgs boson in the range 160-172 GeV, a $5\sigma$
significance can be achieved with only integrated luminosity $\mathcal{L} \sim
24 \, \rm{fb}^{-1}$. Therefore, a light Higgs boson can be discovered
immediately during the run of a future $e^{+} e^{-}$ collider.
| hep-ph hep-ex | we investigate the production and decays of doublycharged higgs bosons for the typeii seesaw mechanism at an e e collider with two center of mass energies sqrts380 gev and 3 tev and analyze the fully hadronic final states in detail lower mass ranges can be probed during the 380 gev run of the collider while high mass ranges which are beyond the 13 tev large hadron collider discovery reach can be probed with sqrts3 tev for such a heavy higgs boson the final decay products are collimated resulting in fatjets we perform a substructure analysis to reduce the background and find that a doublycharged higgs boson in the mass range 8001120 gev can be discovered during the 3 tev run with integrated luminosity mathcall sim 95 rmfb1 of data for 380 gev center of mass energy we find that for the doublycharged higgs boson in the range 160172 gev a 5sigma significance can be achieved with only integrated luminosity mathcall sim 24 rmfb1 therefore a light higgs boson can be discovered immediately during the run of a future e e collider | [['we', 'investigate', 'the', 'production', 'and', 'decays', 'of', 'doublycharged', 'higgs', 'bosons', 'for', 'the', 'typeii', 'seesaw', 'mechanism', 'at', 'an', 'e', 'e', 'collider', 'with', 'two', 'center', 'of', 'mass', 'energies', 'sqrts380', 'gev', 'and', '3', 'tev', 'and', 'analyze', 'the', 'fully', 'hadronic', 'final', 'states', 'in', 'detail', 'lower', 'mass', 'ranges', 'can', 'be', 'probed', 'during', 'the', '380', 'gev', 'run', 'of', 'the', 'collider', 'while', 'high', 'mass', 'ranges', 'which', 'are', 'beyond', 'the', '13', 'tev', 'large', 'hadron', 'collider', 'discovery', 'reach', 'can', 'be', 'probed', 'with', 'sqrts3', 'tev', 'for', 'such', 'a', 'heavy', 'higgs', 'boson', 'the', 'final', 'decay', 'products', 'are', 'collimated', 'resulting', 'in', 'fatjets', 'we', 'perform', 'a', 'substructure', 'analysis', 'to', 'reduce', 'the', 'background', 'and', 'find', 'that', 'a', 'doublycharged', 'higgs', 'boson', 'in', 'the', 'mass', 'range', '8001120', 'gev', 'can', 'be', 'discovered', 'during', 'the', '3', 'tev', 'run', 'with', 'integrated', 'luminosity', 'mathcall', 'sim', '95', 'rmfb1', 'of', 'data', 'for', '380', 'gev', 'center', 'of', 'mass', 'energy', 'we', 'find', 'that', 'for', 'the', 'doublycharged', 'higgs', 'boson', 'in', 'the', 'range', '160172', 'gev', 'a', '5sigma', 'significance', 'can', 'be', 'achieved', 'with', 'only', 'integrated', 'luminosity', 'mathcall', 'sim', '24', 'rmfb1', 'therefore', 'a', 'light', 'higgs', 'boson', 'can', 'be', 'discovered', 'immediately', 'during', 'the', 'run', 'of', 'a', 'future', 'e', 'e', 'collider']] | [-0.05855683636134804, 0.2923443317054437, -0.027322574999978703, 0.18903482196789778, -0.053725313248761584, -0.18533057440072298, -0.00017057151044457314, 0.36622179045310516, -0.20789486616117397, -0.36891165776753776, 0.04088159990523094, -0.2991417393590627, 0.14649003691803875, 0.1988018789548385, 0.11365529818864528, 0.07325892095987717, 0.15922391542306777, -0.015356525184921501, -0.056905613550288454, -0.2579957083694302, 0.2316182614958144, 0.10306840418482179, 0.15140342734115764, 0.1265765173662208, 0.07032102924245776, -0.0019021249268978333, 0.023264278635824767, -0.12449564070576864, -0.11354800883778358, 0.060196954120942024, 0.2214334268918198, 0.09229037589315074, 0.14287326328477332, -0.26496673484196825, -0.08355019355109067, 0.2209779389040398, 0.19190482075817966, 0.010085576248559264, -0.06231310082536735, -0.33896472427491725, 0.16744153323064015, -0.2725310332188906, -0.13595980466500426, 0.02423631596729536, -0.008751845104996575, -0.11861431172275863, -0.3221579547579076, 0.09638983093652079, -0.11703732884959893, 0.044892071899330095, -0.004419601795765875, -0.18026555129823935, -0.12749784196000363, -0.1041944825896219, 0.0845410673211334, 0.05071240119515719, 0.22679495021407858, -0.1633649397840242, -0.208030094089133, 0.3517594964641115, -0.08657607766328736, -0.05767541711370387, 0.18253069207480366, -0.21310082865941726, -0.15557888936083974, 0.1846553291863856, 0.3168009273875295, 0.021833055686686982, -0.2026031898175042, 0.1773358386865388, -0.006448894499126152, 0.2040267825124032, 0.06759306386092238, 0.07000828245811666, 0.30984255475295563, 0.2309649442492597, 0.02786703543015494, 0.021749782289006862, -0.17805069246528188, 0.039815978798492066, -0.44919147840544077, -0.11597165297402927, -0.04294927036285066, 0.09436256116324136, -0.05478127126819376, 0.025013862690480237, 0.3882040721625927, 0.09904073930758815, 0.3440796322492736, 0.01988481628915211, 0.2122890018809618, 0.12660950159109877, 0.10123714931855983, 0.11057481789023595, 0.403928304865454, 0.09013954209414927, 0.17085085655307514, -0.16364808221284843, -0.07430712135673469, 0.015097097479319723] |
1,803.00678 | Mirror-Prox SCA Algorithm for Multicast Beamforming and Antenna
Selection | This paper considers the (NP-)hard problem of joint multicast beamforming and
antenna selection. Prior work has focused on using Semi-Definite relaxation
(SDR) techniques in an attempt to obtain a high quality sub-optimal solution.
However, SDR suffers from the drawback of having high computational complexity,
as SDR lifts the problem to higher dimensional space, effectively squaring the
number of variables. This paper proposes a high performance, low complexity
Successive Convex Approximation (SCA) algorithm for max-min SNR "fair" joint
multicast beamforming and antenna selection under a sum power constraint. The
proposed approach relies on iteratively approximating the non-convex objective
with a series of non-smooth convex subproblems, and then, a first order-based
method called Saddle Point Mirror-Prox (SP-MP) is used to compute optimal
solutions for each SCA subproblem. Simulations reveal that the SP-MP SCA
algorithm provides a higher quality and lower complexity solution compared to
the one obtained using SDR.
| cs.IT math.IT math.OC | this paper considers the nphard problem of joint multicast beamforming and antenna selection prior work has focused on using semidefinite relaxation sdr techniques in an attempt to obtain a high quality suboptimal solution however sdr suffers from the drawback of having high computational complexity as sdr lifts the problem to higher dimensional space effectively squaring the number of variables this paper proposes a high performance low complexity successive convex approximation sca algorithm for maxmin snr fair joint multicast beamforming and antenna selection under a sum power constraint the proposed approach relies on iteratively approximating the nonconvex objective with a series of nonsmooth convex subproblems and then a first orderbased method called saddle point mirrorprox spmp is used to compute optimal solutions for each sca subproblem simulations reveal that the spmp sca algorithm provides a higher quality and lower complexity solution compared to the one obtained using sdr | [['this', 'paper', 'considers', 'the', 'nphard', 'problem', 'of', 'joint', 'multicast', 'beamforming', 'and', 'antenna', 'selection', 'prior', 'work', 'has', 'focused', 'on', 'using', 'semidefinite', 'relaxation', 'sdr', 'techniques', 'in', 'an', 'attempt', 'to', 'obtain', 'a', 'high', 'quality', 'suboptimal', 'solution', 'however', 'sdr', 'suffers', 'from', 'the', 'drawback', 'of', 'having', 'high', 'computational', 'complexity', 'as', 'sdr', 'lifts', 'the', 'problem', 'to', 'higher', 'dimensional', 'space', 'effectively', 'squaring', 'the', 'number', 'of', 'variables', 'this', 'paper', 'proposes', 'a', 'high', 'performance', 'low', 'complexity', 'successive', 'convex', 'approximation', 'sca', 'algorithm', 'for', 'maxmin', 'snr', 'fair', 'joint', 'multicast', 'beamforming', 'and', 'antenna', 'selection', 'under', 'a', 'sum', 'power', 'constraint', 'the', 'proposed', 'approach', 'relies', 'on', 'iteratively', 'approximating', 'the', 'nonconvex', 'objective', 'with', 'a', 'series', 'of', 'nonsmooth', 'convex', 'subproblems', 'and', 'then', 'a', 'first', 'orderbased', 'method', 'called', 'saddle', 'point', 'mirrorprox', 'spmp', 'is', 'used', 'to', 'compute', 'optimal', 'solutions', 'for', 'each', 'sca', 'subproblem', 'simulations', 'reveal', 'that', 'the', 'spmp', 'sca', 'algorithm', 'provides', 'a', 'higher', 'quality', 'and', 'lower', 'complexity', 'solution', 'compared', 'to', 'the', 'one', 'obtained', 'using', 'sdr']] | [-0.15540005429808434, -0.10351089178333621, -0.07391768888217108, 0.04499482605204885, -0.11578106473135794, -0.21119110822549153, 0.1216647185658201, 0.36927118877527015, -0.3003216547538237, -0.28273820707510255, 0.11117865545594872, -0.20198684394488048, -0.20656472194682934, 0.1474482368485167, -0.136017503493048, 0.1325177817220061, 0.04639086996301495, -0.04224186552335219, -0.11133224793934617, -0.2841536593777509, 0.25315856665758224, 0.09609376905357529, 0.34810811431500416, 0.007217137532806474, 0.1815187354018141, 0.03138352762586598, 0.00902308200742921, 0.030375327294941284, -0.06868916780648729, 0.13230718753364837, 0.349452824314157, 0.2639220183586766, 0.3710768388776944, -0.39523137060861135, -0.16864210357568388, 0.08399874426520847, 0.17600276396641956, 0.05882122818027334, -0.057120705121357376, -0.1745559973128397, 0.11387670090229347, -0.1612580622646733, -0.010215980289825078, -0.04669120372754747, -0.11410133914443954, -0.0072186537881799295, -0.3629070769995451, 0.03286937518237994, -0.004330629653072563, -0.01711678793172127, -0.07648069216420167, -0.1964132907993064, 0.08105744415380317, 0.0451506227559956, 0.06927420906501758, 0.0835542973901691, 0.07428405191428189, -0.020215889494233877, -0.14911681336896687, 0.3728360486891751, -0.019666652416746165, -0.2711377058049728, 0.17359571230180304, -0.05191926932411975, -0.15403803410329694, 0.24128780262223606, 0.24878431871404935, 0.1512098928849245, -0.16853618748357585, 0.07604304374825883, -0.02656105040925844, 0.15319223699163934, 0.08802271093530901, 0.01858966132497479, 0.08823911867682532, 0.21617904291327658, 0.23618945024650673, 0.19852154715436285, -0.0763520008691683, -0.07038608573312903, -0.1800662253051996, -0.09178154493906888, -0.25971179575466646, 0.0007501448408283036, -0.14913428495437356, -0.1220043189117107, 0.377563233599709, 0.09997278341887005, 0.13205339034922936, 0.18186265726027817, 0.42651515186860645, 0.15436123024977358, 0.0064703565379925845, 0.13215514113805418, 0.1924282632840412, 0.09740985502842171, 0.09077693468987427, -0.2690036563564028, 0.047088020490803593, 0.132324299697989] |
1,803.00679 | Matrices with Gaussian noise: optimal estimates for singular subspace
perturbation | The Davis-Kahan-Wedin $\sin \Theta$ theorem describes how the singular
subspaces of a matrix change when subjected to a small perturbation. This
classic result is sharp in the worst case scenario. In this paper, we prove a
stochastic version of the Davis-Kahan-Wedin $\sin \Theta$ theorem when the
perturbation is a Gaussian random matrix. Under certain structural assumptions,
we obtain an optimal bound that significantly improves upon the classic
Davis-Kahan-Wedin $\sin \Theta$ theorem. One of our key tools is a new
perturbation bound for the singular values, which may be of independent
interest.
| stat.ML cs.IT cs.LG math.IT math.PR | the daviskahanwedin sin theta theorem describes how the singular subspaces of a matrix change when subjected to a small perturbation this classic result is sharp in the worst case scenario in this paper we prove a stochastic version of the daviskahanwedin sin theta theorem when the perturbation is a gaussian random matrix under certain structural assumptions we obtain an optimal bound that significantly improves upon the classic daviskahanwedin sin theta theorem one of our key tools is a new perturbation bound for the singular values which may be of independent interest | [['the', 'daviskahanwedin', 'sin', 'theta', 'theorem', 'describes', 'how', 'the', 'singular', 'subspaces', 'of', 'a', 'matrix', 'change', 'when', 'subjected', 'to', 'a', 'small', 'perturbation', 'this', 'classic', 'result', 'is', 'sharp', 'in', 'the', 'worst', 'case', 'scenario', 'in', 'this', 'paper', 'we', 'prove', 'a', 'stochastic', 'version', 'of', 'the', 'daviskahanwedin', 'sin', 'theta', 'theorem', 'when', 'the', 'perturbation', 'is', 'a', 'gaussian', 'random', 'matrix', 'under', 'certain', 'structural', 'assumptions', 'we', 'obtain', 'an', 'optimal', 'bound', 'that', 'significantly', 'improves', 'upon', 'the', 'classic', 'daviskahanwedin', 'sin', 'theta', 'theorem', 'one', 'of', 'our', 'key', 'tools', 'is', 'a', 'new', 'perturbation', 'bound', 'for', 'the', 'singular', 'values', 'which', 'may', 'be', 'of', 'independent', 'interest']] | [-0.15223438695206173, 0.11909985777318789, -0.10489017658631553, 0.03203833682058318, -0.050407638149028954, -0.1649747056078043, 0.07055628152978657, 0.2557063153279679, -0.29357063085618584, -0.208326511658155, 0.12150164702549003, -0.22773388429329947, -0.21751925042206113, 0.19213325933522576, -0.1529913082780255, 0.050426982253806533, 0.053840937261766454, 0.061088299844413996, -0.10686351533129729, -0.2369626686591041, 0.3362405523248426, -0.005929985881916114, 0.24335340950842743, 0.04434602152604794, 0.045650621758425956, 0.05004563405700437, 0.03395357427115624, -0.03275231101069149, -0.1787570613353407, 0.09137490059116057, 0.21346917429140636, 0.09674474819629532, 0.3136223189604397, -0.3452880593160024, -0.1647091806753651, 0.12804894978794587, 0.10142947226004154, 0.10980806066168493, 0.013365336118143174, -0.24285903873669168, 0.10695971571072772, -0.13777964924472375, -0.21128493794086542, -0.04409368191385171, 0.0030065057031646533, -0.005420237447002104, -0.3703497231293183, 0.0907297294003541, 0.1591538552266474, 0.002511311020538375, -0.004620221028984576, -0.1311138452281459, 0.046854546649258706, 0.04759535773025293, 0.05862812264975938, 0.058090444339521145, 0.11211756311848269, -0.05875836165908437, -0.050748661232109256, 0.3303641853700545, -0.11321416326317486, -0.23779828109072296, 0.08701009931718255, -0.11304109179220356, -0.18392313696484971, 0.08229811175388622, 0.13162037644248742, 0.15877113910903642, -0.10453508447012659, 0.14551026640193804, -0.11832815300222936, 0.17451304915760243, 0.10644286964088678, 0.0026261953708644095, 0.09823663758912257, 0.10262788530019532, 0.1565835209215408, 0.12756940895297492, -0.049683737430394025, -0.07848041409314456, -0.31838820060039613, -0.11918414136072478, -0.19436082520501707, 0.10783251364725632, -0.19073551198836047, -0.18722719961142803, 0.3675306966671577, 0.12242095282552047, 0.21303834765381946, 0.08291857077735015, 0.27370654701915376, 0.1597271765598894, -0.015764871274458837, 0.050275484657754284, 0.22300371585751547, 0.17184873027624664, 0.060020929376420736, -0.13502182369376278, 0.08394960430386773, 0.10438273356367762] |
1,803.0068 | A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and
Open Problems | The use of flying platforms such as unmanned aerial vehicles (UAVs),
popularly known as drones, is rapidly growing. In particular, with their
inherent attributes such as mobility, flexibility, and adaptive altitude, UAVs
admit several key potential applications in wireless systems. On the one hand,
UAVs can be used as aerial base stations to enhance coverage, capacity,
reliability, and energy efficiency of wireless networks. On the other hand,
UAVs can operate as flying mobile terminals within a cellular network. Such
cellular-connected UAVs can enable several applications ranging from real-time
video streaming to item delivery. In this paper, a comprehensive tutorial on
the potential benefits and applications of UAVs in wireless communications is
presented. Moreover, the important challenges and the fundamental tradeoffs in
UAV-enabled wireless networks are thoroughly investigated. In particular, the
key UAV challenges such as three-dimensional deployment, performance analysis,
channel modeling, and energy efficiency are explored along with representative
results. Then, open problems and potential research directions pertaining to
UAV communications are introduced. Finally, various analytical frameworks and
mathematical tools such as optimization theory, machine learning, stochastic
geometry, transport theory, and game theory are described. The use of such
tools for addressing unique UAV problems is also presented. In a nutshell, this
tutorial provides key guidelines on how to analyze, optimize, and design
UAV-based wireless communication systems.
| cs.IT math.IT | the use of flying platforms such as unmanned aerial vehicles uavs popularly known as drones is rapidly growing in particular with their inherent attributes such as mobility flexibility and adaptive altitude uavs admit several key potential applications in wireless systems on the one hand uavs can be used as aerial base stations to enhance coverage capacity reliability and energy efficiency of wireless networks on the other hand uavs can operate as flying mobile terminals within a cellular network such cellularconnected uavs can enable several applications ranging from realtime video streaming to item delivery in this paper a comprehensive tutorial on the potential benefits and applications of uavs in wireless communications is presented moreover the important challenges and the fundamental tradeoffs in uavenabled wireless networks are thoroughly investigated in particular the key uav challenges such as threedimensional deployment performance analysis channel modeling and energy efficiency are explored along with representative results then open problems and potential research directions pertaining to uav communications are introduced finally various analytical frameworks and mathematical tools such as optimization theory machine learning stochastic geometry transport theory and game theory are described the use of such tools for addressing unique uav problems is also presented in a nutshell this tutorial provides key guidelines on how to analyze optimize and design uavbased wireless communication systems | [['the', 'use', 'of', 'flying', 'platforms', 'such', 'as', 'unmanned', 'aerial', 'vehicles', 'uavs', 'popularly', 'known', 'as', 'drones', 'is', 'rapidly', 'growing', 'in', 'particular', 'with', 'their', 'inherent', 'attributes', 'such', 'as', 'mobility', 'flexibility', 'and', 'adaptive', 'altitude', 'uavs', 'admit', 'several', 'key', 'potential', 'applications', 'in', 'wireless', 'systems', 'on', 'the', 'one', 'hand', 'uavs', 'can', 'be', 'used', 'as', 'aerial', 'base', 'stations', 'to', 'enhance', 'coverage', 'capacity', 'reliability', 'and', 'energy', 'efficiency', 'of', 'wireless', 'networks', 'on', 'the', 'other', 'hand', 'uavs', 'can', 'operate', 'as', 'flying', 'mobile', 'terminals', 'within', 'a', 'cellular', 'network', 'such', 'cellularconnected', 'uavs', 'can', 'enable', 'several', 'applications', 'ranging', 'from', 'realtime', 'video', 'streaming', 'to', 'item', 'delivery', 'in', 'this', 'paper', 'a', 'comprehensive', 'tutorial', 'on', 'the', 'potential', 'benefits', 'and', 'applications', 'of', 'uavs', 'in', 'wireless', 'communications', 'is', 'presented', 'moreover', 'the', 'important', 'challenges', 'and', 'the', 'fundamental', 'tradeoffs', 'in', 'uavenabled', 'wireless', 'networks', 'are', 'thoroughly', 'investigated', 'in', 'particular', 'the', 'key', 'uav', 'challenges', 'such', 'as', 'threedimensional', 'deployment', 'performance', 'analysis', 'channel', 'modeling', 'and', 'energy', 'efficiency', 'are', 'explored', 'along', 'with', 'representative', 'results', 'then', 'open', 'problems', 'and', 'potential', 'research', 'directions', 'pertaining', 'to', 'uav', 'communications', 'are', 'introduced', 'finally', 'various', 'analytical', 'frameworks', 'and', 'mathematical', 'tools', 'such', 'as', 'optimization', 'theory', 'machine', 'learning', 'stochastic', 'geometry', 'transport', 'theory', 'and', 'game', 'theory', 'are', 'described', 'the', 'use', 'of', 'such', 'tools', 'for', 'addressing', 'unique', 'uav', 'problems', 'is', 'also', 'presented', 'in', 'a', 'nutshell', 'this', 'tutorial', 'provides', 'key', 'guidelines', 'on', 'how', 'to', 'analyze', 'optimize', 'and', 'design', 'uavbased', 'wireless', 'communication', 'systems']] | [-0.2001622355469848, 0.023724307737437673, 0.031564916893925675, 0.03327945631677671, -0.0901826068904886, -0.2184902368443868, 0.036797405704469655, 0.4241168580653976, -0.28471471299739204, -0.3337420028449822, 0.13543040912755894, -0.25371694494433666, -0.24619512820577738, 0.22456033755316987, -0.18948334065579256, 0.13258466472171143, 0.08078861761460518, 0.024014829454110927, 0.03765555855191489, -0.21007290727690653, 0.23680182594123558, 0.08418530834815142, 0.35896826856490655, 0.1131233793773478, 0.0692770654112444, 0.012630738809378603, -0.007157564882622508, -0.003183961969860379, -0.13719969436800974, 0.15501109045642655, 0.4236533082045254, 0.2090673887810331, 0.31703048805418654, -0.4869129307362066, -0.31491845386094214, 0.0654705290340342, 0.20963938901303358, 0.025575156016747386, -0.07717932497842177, -0.31166880534026203, 0.07733265868031897, -0.2612587023796814, -0.10197747053260903, -0.06017630654794898, -0.02535783614714368, 0.14369860027802997, -0.2502491471190263, -0.0962792281829913, -0.07476690588390222, 0.08204899637741016, -0.06409952579675594, -0.08275886431383613, 0.021738888645943786, 0.2347822215017532, 0.05966558468137537, -0.013995079368713402, 0.16107825047555402, -0.137112854694527, -0.16445219212089351, 0.4520238508611986, 0.054573530203304445, -0.2075254466274135, 0.21250935181495756, 0.029694564748890182, -0.13718481335900554, 0.05779352268066755, 0.3070381395003763, 0.08635693731876562, -0.18735194604303088, 0.04711500458902285, 0.028839872552356618, 0.09167334055989414, 0.06558056519268089, 0.10529948937253863, 0.1974052651313215, 0.27260777621834714, 0.18000251902825273, 0.07060515898476195, -0.10121995318801172, -0.14925137011244172, -0.19255874808534362, -0.14131422337221866, -0.2059358450571238, 0.01117431499280705, -0.0635281343946919, -0.07015309432115886, 0.35706598988051785, 0.18730368517330645, 0.08356976350619187, 0.04119948961038125, 0.4355978046164071, 0.029276574251144345, 0.041999718649656195, 0.09971260484350923, 0.16504995904493786, 0.06918270159984857, 0.21504520634318003, -0.13405647878062993, 0.028638978106772295, -0.021784507866931677] |
1,803.00681 | Reedy Model Structures in Families | Given a family of model categories $\cal E \to \cal R$ over a Reedy category,
we outline a set of conditions which lead to the existence of a Reedy model
structure on the category of sections ${\sf Sect}(\cal R, \cal E)$. We prove
that for a wide class of examples, this model structure serves as a
strictification of the $(\infty,1)$-category of sections of the
higher-categorical family associated to $\cal E \to \cal R$.
| math.CT math.AG math.AT | given a family of model categories cal e to cal r over a reedy category we outline a set of conditions which lead to the existence of a reedy model structure on the category of sections sf sectcal r cal e we prove that for a wide class of examples this model structure serves as a strictification of the infty1category of sections of the highercategorical family associated to cal e to cal r | [['given', 'a', 'family', 'of', 'model', 'categories', 'cal', 'e', 'to', 'cal', 'r', 'over', 'a', 'reedy', 'category', 'we', 'outline', 'a', 'set', 'of', 'conditions', 'which', 'lead', 'to', 'the', 'existence', 'of', 'a', 'reedy', 'model', 'structure', 'on', 'the', 'category', 'of', 'sections', 'sf', 'sectcal', 'r', 'cal', 'e', 'we', 'prove', 'that', 'for', 'a', 'wide', 'class', 'of', 'examples', 'this', 'model', 'structure', 'serves', 'as', 'a', 'strictification', 'of', 'the', 'infty1category', 'of', 'sections', 'of', 'the', 'highercategorical', 'family', 'associated', 'to', 'cal', 'e', 'to', 'cal', 'r']] | [-0.15357536445501158, -0.00421080047575136, -0.03717106341436091, 0.04202268646945918, -0.04398512475179612, -0.11382728710304946, -0.00381872362534826, 0.337996842727686, -0.2981140621834331, -0.2306748611671436, 0.02195312941330485, -0.22408926119613978, -0.10412942731959952, 0.1406760662179699, -0.10409285469601552, -0.025476454498453274, 0.042649249649710126, 0.10179705365024144, -0.058623274747434256, -0.19223968342541614, 0.3426319988987719, 0.007610922233046343, 0.18437727887390387, 0.02357638300681073, 0.0826323937637628, -0.02277182827674551, 0.04610887340580424, 0.04487467391623391, -0.20997321643244504, 0.17381678645809492, 0.26075886549531585, 0.15754065357678984, 0.17985901113974656, -0.3037554045958031, -0.12371054484133816, 0.18695162825234649, 0.06240267199205442, 0.01844556581636425, 0.03239272241383636, -0.28255162439826464, 0.1542083342663116, -0.29346887001560795, -0.10351946646308836, -0.06551663378357059, 0.15372855591380763, -0.03540896193590015, -0.3500448598270951, -0.05831929633859545, 0.09947236847235924, 0.05101656292875608, -0.03508587476648649, -0.08077814945459573, -0.1186402421800368, -0.002780458999849442, -0.0399983494409955, 0.05121310823435326, 0.1061641554438716, -0.1270301924572171, -0.0927626811252493, 0.39851492755082696, -0.08659748555833681, -0.18634732145195207, 0.15475161052907221, -0.12940779931118918, -0.14665248515343088, 0.11426463179911177, 0.15970819416300705, 0.19126471628745398, -0.04672670927539002, 0.23084585367339766, -0.1385326669506968, 0.09219268314902568, 0.036363694790957704, 0.04791860728033094, 0.16211285115019158, 0.1656581852779103, 0.03370130877010524, 0.12566912171637845, -0.03215287739375425, -0.04059765225974843, -0.46134947550793487, -0.16311210727629563, -0.036012344838430486, 0.15909500477007693, -0.05376647615210257, -0.2216848339109371, 0.4194008866325021, 0.08769542656631933, 0.2935476062508921, 0.11473184075212986, 0.12494960971849246, 0.028672714882809994, 0.051256331563409835, 0.017387027968652546, 0.13013727140302458, 0.192717986052028, -0.020974944040062837, -0.125960208203954, -0.012346041556965146, 0.1618600506335497] |
1,803.00682 | Learning Decorrelated Hashing Codes for Multimodal Retrieval | In social networks, heterogeneous multimedia data correlate to each other,
such as videos and their corresponding tags in YouTube and image-text pairs in
Facebook. Nearest neighbor retrieval across multiple modalities on large data
sets becomes a hot yet challenging problem. Hashing is expected to be an
efficient solution, since it represents data as binary codes. As the bit-wise
XOR operations can be fast handled, the retrieval time is greatly reduced. Few
existing multimodal hashing methods consider the correlation among hashing
bits. The correlation has negative impact on hashing codes. When the hashing
code length becomes longer, the retrieval performance improvement becomes
slower. In this paper, we propose a minimum correlation regularization (MCR)
for multimodal hashing. First, the sigmoid function is used to embed the data
matrices. Then, the MCR is applied on the output of sigmoid function. As the
output of sigmoid function approximates a binary code matrix, the proposed MCR
can efficiently decorrelate the hashing codes. Experiments show the superiority
of the proposed method becomes greater as the code length increases.
| cs.IR | in social networks heterogeneous multimedia data correlate to each other such as videos and their corresponding tags in youtube and imagetext pairs in facebook nearest neighbor retrieval across multiple modalities on large data sets becomes a hot yet challenging problem hashing is expected to be an efficient solution since it represents data as binary codes as the bitwise xor operations can be fast handled the retrieval time is greatly reduced few existing multimodal hashing methods consider the correlation among hashing bits the correlation has negative impact on hashing codes when the hashing code length becomes longer the retrieval performance improvement becomes slower in this paper we propose a minimum correlation regularization mcr for multimodal hashing first the sigmoid function is used to embed the data matrices then the mcr is applied on the output of sigmoid function as the output of sigmoid function approximates a binary code matrix the proposed mcr can efficiently decorrelate the hashing codes experiments show the superiority of the proposed method becomes greater as the code length increases | [['in', 'social', 'networks', 'heterogeneous', 'multimedia', 'data', 'correlate', 'to', 'each', 'other', 'such', 'as', 'videos', 'and', 'their', 'corresponding', 'tags', 'in', 'youtube', 'and', 'imagetext', 'pairs', 'in', 'facebook', 'nearest', 'neighbor', 'retrieval', 'across', 'multiple', 'modalities', 'on', 'large', 'data', 'sets', 'becomes', 'a', 'hot', 'yet', 'challenging', 'problem', 'hashing', 'is', 'expected', 'to', 'be', 'an', 'efficient', 'solution', 'since', 'it', 'represents', 'data', 'as', 'binary', 'codes', 'as', 'the', 'bitwise', 'xor', 'operations', 'can', 'be', 'fast', 'handled', 'the', 'retrieval', 'time', 'is', 'greatly', 'reduced', 'few', 'existing', 'multimodal', 'hashing', 'methods', 'consider', 'the', 'correlation', 'among', 'hashing', 'bits', 'the', 'correlation', 'has', 'negative', 'impact', 'on', 'hashing', 'codes', 'when', 'the', 'hashing', 'code', 'length', 'becomes', 'longer', 'the', 'retrieval', 'performance', 'improvement', 'becomes', 'slower', 'in', 'this', 'paper', 'we', 'propose', 'a', 'minimum', 'correlation', 'regularization', 'mcr', 'for', 'multimodal', 'hashing', 'first', 'the', 'sigmoid', 'function', 'is', 'used', 'to', 'embed', 'the', 'data', 'matrices', 'then', 'the', 'mcr', 'is', 'applied', 'on', 'the', 'output', 'of', 'sigmoid', 'function', 'as', 'the', 'output', 'of', 'sigmoid', 'function', 'approximates', 'a', 'binary', 'code', 'matrix', 'the', 'proposed', 'mcr', 'can', 'efficiently', 'decorrelate', 'the', 'hashing', 'codes', 'experiments', 'show', 'the', 'superiority', 'of', 'the', 'proposed', 'method', 'becomes', 'greater', 'as', 'the', 'code', 'length', 'increases']] | [-0.10392463078646552, 0.03358654325787685, -0.03382009117279288, 0.1428773722237079, -0.06383478764896715, -0.21888946915088697, 0.026754817789350096, 0.46319198829452185, -0.3263625902676045, -0.2818795266252574, 0.08646290918113664, -0.3370005437551976, -0.1547906409954479, 0.18938062704428163, -0.09232847495437708, 0.10184836117171704, 0.11431517401239076, 0.07065034590574891, -0.1352216945175991, -0.35209102749548377, 0.2865364532552248, 0.10865628572592381, 0.3337474869195978, 0.02426046495011813, 0.06905860547517795, 0.03632635684943823, -0.051057327425020727, -0.03621899956826467, -0.011384544027245029, 0.0995769148650525, 0.3191294904884904, 0.2512926850278407, 0.3026911617191725, -0.352775932175952, -0.23680966626988117, 0.09621014526292551, 0.16886618335157372, 0.10817655642397789, -0.034750063043713114, -0.2436186311195258, 0.0816599826151126, -0.1940820813585116, 0.07397289320469162, -0.08527790667248218, 0.0182570576110075, 0.005044266428571021, -0.3391453139917102, 0.028773268872904482, 0.018516885698772967, 0.011419810051488321, -0.00280509548171066, -0.12072487676862714, 0.024712997737752145, 0.14386268785351286, 0.027077050900579495, 0.11694001311539175, 0.12711511138924073, -0.12030711197321368, -0.1209490764524035, 0.36979266118019993, -0.06571271587271503, -0.20322816634312446, 0.15524317773037352, -0.030546457839718218, -0.10393255265774125, 0.11951294677808534, 0.24363461797136468, 0.1464166875609175, -0.12328285187238158, 0.012880604938187008, -0.07019837833074637, 0.2539042623247951, 0.06178456657907254, 0.06553591075245031, 0.13346350490965686, 0.21324332681522423, 0.06304859549489392, 0.19760625774675689, -0.133011829661311, -0.08002066326078547, -0.14922283058965763, -0.11965241413942516, -0.2607209665787428, -0.04187836305259965, -0.15618299773801525, -0.1885574586028883, 0.3631314159056908, 0.17405844673915052, 0.21108709775496187, 0.08362359484386235, 0.3507931609313155, 0.04243143820298598, 0.189001559982412, 0.12731221334488932, 0.13310606610354817, 0.052115184340225315, 0.12573116773409163, -0.18815418927277827, 0.14531659694474128, 0.08133763003401286] |
1,803.00683 | Decentralized Computation Offloading and Resource Allocation in
Heterogeneous Networks with Mobile Edge Computing | We consider a heterogeneous network with mobile edge computing, where a user
can offload its computation to one among multiple servers. In particular, we
minimize the system-wide computation overhead by jointly optimizing the
individual computation decisions, transmit power of the users, and computation
resource at the servers. The crux of the problem lies in the combinatorial
nature of multi-user offloading decisions, the complexity of the optimization
objective, and the existence of inter-cell interference. Then, we decompose the
underlying problem into two subproblems: i) the offloading decision, which
includes two phases of user association and subchannel assignment, and ii)
joint resource allocation, which can be further decomposed into the problems of
transmit power and computation resource allocation. To enable distributed
computation offloading, we sequentially apply a many-to-one matching game for
user association and a one-to-one matching game for subchannel assignment.
Moreover, the transmit power of offloading users is found using a bisection
method with approximate inter-cell interference, and the computation resources
allocated to offloading users is achieved via the duality approach. The
proposed algorithm is shown to converge and is stable. Finally, we provide
simulations to validate the performance of the proposed algorithm as well as
comparisons with the existing frameworks.
| cs.NI | we consider a heterogeneous network with mobile edge computing where a user can offload its computation to one among multiple servers in particular we minimize the systemwide computation overhead by jointly optimizing the individual computation decisions transmit power of the users and computation resource at the servers the crux of the problem lies in the combinatorial nature of multiuser offloading decisions the complexity of the optimization objective and the existence of intercell interference then we decompose the underlying problem into two subproblems i the offloading decision which includes two phases of user association and subchannel assignment and ii joint resource allocation which can be further decomposed into the problems of transmit power and computation resource allocation to enable distributed computation offloading we sequentially apply a manytoone matching game for user association and a onetoone matching game for subchannel assignment moreover the transmit power of offloading users is found using a bisection method with approximate intercell interference and the computation resources allocated to offloading users is achieved via the duality approach the proposed algorithm is shown to converge and is stable finally we provide simulations to validate the performance of the proposed algorithm as well as comparisons with the existing frameworks | [['we', 'consider', 'a', 'heterogeneous', 'network', 'with', 'mobile', 'edge', 'computing', 'where', 'a', 'user', 'can', 'offload', 'its', 'computation', 'to', 'one', 'among', 'multiple', 'servers', 'in', 'particular', 'we', 'minimize', 'the', 'systemwide', 'computation', 'overhead', 'by', 'jointly', 'optimizing', 'the', 'individual', 'computation', 'decisions', 'transmit', 'power', 'of', 'the', 'users', 'and', 'computation', 'resource', 'at', 'the', 'servers', 'the', 'crux', 'of', 'the', 'problem', 'lies', 'in', 'the', 'combinatorial', 'nature', 'of', 'multiuser', 'offloading', 'decisions', 'the', 'complexity', 'of', 'the', 'optimization', 'objective', 'and', 'the', 'existence', 'of', 'intercell', 'interference', 'then', 'we', 'decompose', 'the', 'underlying', 'problem', 'into', 'two', 'subproblems', 'i', 'the', 'offloading', 'decision', 'which', 'includes', 'two', 'phases', 'of', 'user', 'association', 'and', 'subchannel', 'assignment', 'and', 'ii', 'joint', 'resource', 'allocation', 'which', 'can', 'be', 'further', 'decomposed', 'into', 'the', 'problems', 'of', 'transmit', 'power', 'and', 'computation', 'resource', 'allocation', 'to', 'enable', 'distributed', 'computation', 'offloading', 'we', 'sequentially', 'apply', 'a', 'manytoone', 'matching', 'game', 'for', 'user', 'association', 'and', 'a', 'onetoone', 'matching', 'game', 'for', 'subchannel', 'assignment', 'moreover', 'the', 'transmit', 'power', 'of', 'offloading', 'users', 'is', 'found', 'using', 'a', 'bisection', 'method', 'with', 'approximate', 'intercell', 'interference', 'and', 'the', 'computation', 'resources', 'allocated', 'to', 'offloading', 'users', 'is', 'achieved', 'via', 'the', 'duality', 'approach', 'the', 'proposed', 'algorithm', 'is', 'shown', 'to', 'converge', 'and', 'is', 'stable', 'finally', 'we', 'provide', 'simulations', 'to', 'validate', 'the', 'performance', 'of', 'the', 'proposed', 'algorithm', 'as', 'well', 'as', 'comparisons', 'with', 'the', 'existing', 'frameworks']] | [-0.20464601638435853, -0.04203933271230199, -0.053104208479635415, 0.03214182502357289, -0.116566663577687, -0.24465178657555953, 0.18063103687833063, 0.4104060368612409, -0.32949040268547836, -0.3262937452993356, 0.08082531649153679, -0.23092427153605968, -0.1598165796615649, 0.07826969935558736, -0.10807070108494372, 0.07299629707558779, 0.06711648555006831, 0.039232559282245345, 0.0047581294662450094, -0.30367437114589846, 0.27569847628532446, 0.08151701596099883, 0.3590763128048275, 0.043381146873580294, 0.05788805009040516, 0.028047645209589973, -0.053562571117654445, -0.007738371892482974, -0.053696396017912776, 0.15032232712139376, 0.3594938472181093, 0.2563315683044493, 0.34708631661720574, -0.4359678932186216, -0.16850815791636706, 0.10704536125063896, 0.18712762884562836, 0.0003443937364500016, -0.014320010733790696, -0.24163540658715646, 0.1413564609037712, -0.20972902401350438, 0.044015828857664016, -0.026442704824730753, -0.06671862357616191, 0.023590658539906145, -0.3936653327383101, -0.030244449987076222, -0.06704950088693294, -0.028835913998045727, -0.05666970614285674, -0.09746482829912566, 0.02137298447894864, 0.20404202129051555, 0.03682536580483429, -0.033395249655004594, 0.13448937763692811, -0.11218075846554712, -0.1979945095882158, 0.4165472187800333, 0.08004392949020257, -0.21988870272412897, 0.13502010500989856, 0.0021234999747684925, -0.1397120205569081, 0.13806359702117332, 0.2346526563493535, 0.07543183363974094, -0.14340303109260277, 0.04041899702511728, -0.02385531836654991, 0.13875297349877655, 0.07273037587059662, 0.07954871106427162, 0.16532507348572836, 0.20728327633696608, 0.16544381816871465, 0.17322118437325115, -0.07140145329991356, -0.15128545660991222, -0.2112325632062857, -0.1523809204529971, -0.2290102986607235, -0.007274190125754103, -0.09881731381581631, -0.06441591229333427, 0.38538532754871996, 0.12166261095728259, 0.12213635831838474, 0.16532395809539593, 0.42765497700078414, 0.14886102714459412, 0.04818448561476543, 0.1863472313527018, 0.12470331269782037, 0.07476579428301193, 0.1182377555500716, -0.29889038190012795, 0.04941992990206927, 0.021773300049826503] |
1,803.00684 | Autostacker: A Compositional Evolutionary Learning System | We introduce an automatic machine learning (AutoML) modeling architecture
called Autostacker, which combines an innovative hierarchical stacking
architecture and an Evolutionary Algorithm (EA) to perform efficient parameter
search. Neither prior domain knowledge about the data nor feature preprocessing
is needed. Using EA, Autostacker quickly evolves candidate pipelines with high
predictive accuracy. These pipelines can be used as is or as a starting point
for human experts to build on. Autostacker finds innovative combinations and
structures of machine learning models, rather than selecting a single model and
optimizing its hyperparameters. Compared with other AutoML systems on fifteen
datasets, Autostacker achieves state-of-art or competitive performance both in
terms of test accuracy and time cost.
| cs.LG cs.NE stat.ML | we introduce an automatic machine learning automl modeling architecture called autostacker which combines an innovative hierarchical stacking architecture and an evolutionary algorithm ea to perform efficient parameter search neither prior domain knowledge about the data nor feature preprocessing is needed using ea autostacker quickly evolves candidate pipelines with high predictive accuracy these pipelines can be used as is or as a starting point for human experts to build on autostacker finds innovative combinations and structures of machine learning models rather than selecting a single model and optimizing its hyperparameters compared with other automl systems on fifteen datasets autostacker achieves stateofart or competitive performance both in terms of test accuracy and time cost | [['we', 'introduce', 'an', 'automatic', 'machine', 'learning', 'automl', 'modeling', 'architecture', 'called', 'autostacker', 'which', 'combines', 'an', 'innovative', 'hierarchical', 'stacking', 'architecture', 'and', 'an', 'evolutionary', 'algorithm', 'ea', 'to', 'perform', 'efficient', 'parameter', 'search', 'neither', 'prior', 'domain', 'knowledge', 'about', 'the', 'data', 'nor', 'feature', 'preprocessing', 'is', 'needed', 'using', 'ea', 'autostacker', 'quickly', 'evolves', 'candidate', 'pipelines', 'with', 'high', 'predictive', 'accuracy', 'these', 'pipelines', 'can', 'be', 'used', 'as', 'is', 'or', 'as', 'a', 'starting', 'point', 'for', 'human', 'experts', 'to', 'build', 'on', 'autostacker', 'finds', 'innovative', 'combinations', 'and', 'structures', 'of', 'machine', 'learning', 'models', 'rather', 'than', 'selecting', 'a', 'single', 'model', 'and', 'optimizing', 'its', 'hyperparameters', 'compared', 'with', 'other', 'automl', 'systems', 'on', 'fifteen', 'datasets', 'autostacker', 'achieves', 'stateofart', 'or', 'competitive', 'performance', 'both', 'in', 'terms', 'of', 'test', 'accuracy', 'and', 'time', 'cost']] | [-0.04047816605140854, -0.03480726004909229, -0.09818291179752643, 0.05131756818030096, -0.14697506206825242, -0.20726426001887635, 0.057178077225606624, 0.4723307962329792, -0.23595930983511998, -0.3961445154189797, 0.08850604471977672, -0.25511698361619245, -0.12892462854194622, 0.20351188805320167, -0.071637519261068, 0.08638365601187356, 0.12143220968677529, 0.031090519233008047, -0.06803022465308979, -0.2796200476233415, 0.24498803543870704, 0.11454111810806873, 0.33408543072749, -0.07347460227486279, 0.13828025037530875, -0.015332621944773044, -0.048766485675254705, -0.04019617891208327, -0.04432876351347659, 0.16056305337198346, 0.30543580632096173, 0.24759259424172342, 0.3285658777458593, -0.3777109341878843, -0.19531423575244844, 0.11042955370378747, 0.1787812061790776, 0.0667571630517289, -0.04632621252156761, -0.2712274144370375, 0.06563466843467072, -0.16479244474820526, -0.02776823927602631, -0.20684350751564903, -0.0379226521306139, -0.01620079983175466, -0.32173628074815497, 0.030693807585131645, 0.047395762694317715, 0.0733670442215433, -0.05828513822572339, -0.1803336265397125, 0.020801002719963435, 0.13118451218802615, -0.01949678720744227, 0.11113886406279302, 0.17762756856557513, -0.17060812689929403, -0.20893965313942836, 0.3538637264032981, -0.06128253888644914, -0.19954595202164324, 0.2522162259639507, 0.05938641936518252, -0.14381731302793405, 0.09867390472209081, 0.23772762959353194, 0.11741286197710517, -0.1709562415999244, 0.016306037829573534, 0.05579468267803479, 0.24967760882204207, 0.011428356736100145, -0.028355246451350728, 0.17697347456331564, 0.33306895116610186, 0.04007885299506597, 0.09872081519850846, -0.11041317972038607, -0.0761597833729216, -0.15951526290570786, -0.11960783830103797, -0.1688091782603546, -0.0341253862218634, -0.11753141423676945, -0.17660783805019623, 0.3645459847591285, 0.2086102913724192, 0.17439005716836878, 0.09737907023996481, 0.34850299403270973, 0.028772417541144284, 0.12056436719389499, 0.12261959452631085, 0.1694248700805474, -0.046143881124277995, 0.09730703943361212, -0.14749917588570888, 0.10709483063796402, 0.01972746635354789] |
1,803.00685 | Diagram uniqueness of even plats | Every knot has a plat projection, obtained by closing up a braid with
bridges. The plat projection is determined by the number of strands and the
number of rows of twist regions in the braid, and an integer number of
crossings in each twist region. In recent work, we showed that under certain
restrictions, including that the number of rows is odd, a minimal width plat
projection is unique. In this paper we extend the results to even plats. Using
new arguments, we show that if each of their twist regions contains at least
three crossings, and their length is sufficiently long with respect to their
width, then the projection is unique. This essentially "doubles" the set of
knots for which such diagrams classify the links.
| math.GT | every knot has a plat projection obtained by closing up a braid with bridges the plat projection is determined by the number of strands and the number of rows of twist regions in the braid and an integer number of crossings in each twist region in recent work we showed that under certain restrictions including that the number of rows is odd a minimal width plat projection is unique in this paper we extend the results to even plats using new arguments we show that if each of their twist regions contains at least three crossings and their length is sufficiently long with respect to their width then the projection is unique this essentially doubles the set of knots for which such diagrams classify the links | [['every', 'knot', 'has', 'a', 'plat', 'projection', 'obtained', 'by', 'closing', 'up', 'a', 'braid', 'with', 'bridges', 'the', 'plat', 'projection', 'is', 'determined', 'by', 'the', 'number', 'of', 'strands', 'and', 'the', 'number', 'of', 'rows', 'of', 'twist', 'regions', 'in', 'the', 'braid', 'and', 'an', 'integer', 'number', 'of', 'crossings', 'in', 'each', 'twist', 'region', 'in', 'recent', 'work', 'we', 'showed', 'that', 'under', 'certain', 'restrictions', 'including', 'that', 'the', 'number', 'of', 'rows', 'is', 'odd', 'a', 'minimal', 'width', 'plat', 'projection', 'is', 'unique', 'in', 'this', 'paper', 'we', 'extend', 'the', 'results', 'to', 'even', 'plats', 'using', 'new', 'arguments', 'we', 'show', 'that', 'if', 'each', 'of', 'their', 'twist', 'regions', 'contains', 'at', 'least', 'three', 'crossings', 'and', 'their', 'length', 'is', 'sufficiently', 'long', 'with', 'respect', 'to', 'their', 'width', 'then', 'the', 'projection', 'is', 'unique', 'this', 'essentially', 'doubles', 'the', 'set', 'of', 'knots', 'for', 'which', 'such', 'diagrams', 'classify', 'the', 'links']] | [-0.19005456508418161, 0.15793144402321935, -0.05320270458191988, 0.006598942453921255, -0.049986456446940934, -0.11695989118223744, 0.048437836883951806, 0.367413105698125, -0.2995975758429498, -0.3025425354019731, 0.09389619467436292, -0.26113110323924393, -0.13247858875593732, 0.16905122475757722, -0.08033972025314431, -0.007155629957745236, 0.0691117871670969, 0.0767106574235691, -0.08848063836968134, -0.25899749338009675, 0.32006225628512247, -0.010862222200052606, 0.19302737230198488, 0.03238663195756205, 0.07445637753514188, 0.003802342222260204, -0.035998076133962185, 0.060197472143622616, -0.14220634713626443, 0.107002972946724, 0.19021254210429828, 0.08385149392461966, 0.23192429070967058, -0.39209667640800094, -0.11777663271179394, 0.11027272455837756, 0.15038514392735022, 0.05740752302032585, -0.001013901446842485, -0.23138718817028261, 0.13618111400495445, -0.13396050137216373, -0.14978733597811134, -0.020798700421841607, 0.06118341031972142, 0.01577399954724584, -0.213659960554824, -0.022987749306522014, 0.060710018733516335, 0.061822024536215596, 0.025174718492919402, -0.13528810619720302, -0.027151661538814622, 0.15204807157657804, 0.05625336195364417, 0.050966238873707694, 0.06531533571135711, -0.1548646667411843, -0.1210687963609835, 0.3382636739148034, -0.012617238834204654, -0.2166150417222756, 0.16941563717813957, -0.1843252199820228, -0.15978979077633648, 0.20010340081930664, 0.05255183245661476, 0.07116528779696969, -0.047580309064378816, 0.09734473222846328, -0.15326061980828407, 0.1488183307995473, 0.12954431549010295, -0.007870699105311244, 0.1669450574258845, 0.10239182890111966, 0.11804695738597758, 0.1744799094278336, -0.11722854798704031, -0.022216741838270708, -0.3314465607242984, -0.20803730138799265, -0.16778736378228853, 0.024015987232800514, -0.07422459534970426, -0.17240874860287894, 0.424734242851772, 0.06540844137115139, 0.24011623937824172, 0.08817645616456127, 0.2554448542613832, 0.06837293943161578, 0.11269461912923448, 0.11939355335244539, 0.14351137189771093, 0.13975126519595968, -0.027370915990248913, -0.1862720682448338, 0.03693994602081292, 0.12462664666467362] |
1,803.00686 | Constrained Neural Style Transfer for Decorated Logo Generation | Making decorated logos requires image editing skills, without sufficient
skills, it could be a time-consuming task. While there are many on-line web
services to make new logos, they have limited designs and duplicates can be
made. We propose using neural style transfer with clip art and text for the
creation of new and genuine logos. We introduce a new loss function based on
distance transform of the input image, which allows the preservation of the
silhouettes of text and objects. The proposed method constrains style transfer
only around the designated area. We demonstrate the characteristics of proposed
method. Finally, we show the results of logo generation with various input
images.
| cs.CV | making decorated logos requires image editing skills without sufficient skills it could be a timeconsuming task while there are many online web services to make new logos they have limited designs and duplicates can be made we propose using neural style transfer with clip art and text for the creation of new and genuine logos we introduce a new loss function based on distance transform of the input image which allows the preservation of the silhouettes of text and objects the proposed method constrains style transfer only around the designated area we demonstrate the characteristics of proposed method finally we show the results of logo generation with various input images | [['making', 'decorated', 'logos', 'requires', 'image', 'editing', 'skills', 'without', 'sufficient', 'skills', 'it', 'could', 'be', 'a', 'timeconsuming', 'task', 'while', 'there', 'are', 'many', 'online', 'web', 'services', 'to', 'make', 'new', 'logos', 'they', 'have', 'limited', 'designs', 'and', 'duplicates', 'can', 'be', 'made', 'we', 'propose', 'using', 'neural', 'style', 'transfer', 'with', 'clip', 'art', 'and', 'text', 'for', 'the', 'creation', 'of', 'new', 'and', 'genuine', 'logos', 'we', 'introduce', 'a', 'new', 'loss', 'function', 'based', 'on', 'distance', 'transform', 'of', 'the', 'input', 'image', 'which', 'allows', 'the', 'preservation', 'of', 'the', 'silhouettes', 'of', 'text', 'and', 'objects', 'the', 'proposed', 'method', 'constrains', 'style', 'transfer', 'only', 'around', 'the', 'designated', 'area', 'we', 'demonstrate', 'the', 'characteristics', 'of', 'proposed', 'method', 'finally', 'we', 'show', 'the', 'results', 'of', 'logo', 'generation', 'with', 'various', 'input', 'images']] | [-0.04243353935254907, 0.01095001301728189, -0.07915594343265349, 0.07439082569696687, -0.16111935941841116, -0.14776800373907795, 0.04356907232325863, 0.47188999872993337, -0.267853344485841, -0.37805783386257563, 0.08512575128539042, -0.2521670402896813, -0.1790365532590923, 0.22647862555459142, -0.16560761937236582, 0.07648475577800788, 0.13962162989509208, 0.03161134906113148, -0.05495531772030517, -0.2815824945414947, 0.333490540004674, -0.004721736484630541, 0.32281185735694384, 0.04432257051494989, 0.14643334488553758, 0.0073384503032271325, -0.0760352751472965, -0.03793806467967277, -0.04842008805241097, 0.20125954560829665, 0.2804068787256256, 0.26251086861487816, 0.28815674811432307, -0.4136325992347503, -0.17518429828977042, 0.07444914794019, 0.1330707830271091, 0.1259595343620855, -0.08690228524131023, -0.3450432739559222, 0.10675686091523279, -0.17227221876806156, 0.01943466525990516, -0.14839302729153794, -0.0179828355289911, 0.012070753369797868, -0.27061528583819217, -0.003624980477616191, 0.062142679332332175, 0.06703243007544767, -0.033471539534564894, -0.10018694566520439, 0.007241069249258461, 0.20558749661907894, -0.008679701019586487, 0.022708582010289486, 0.1340994308739689, -0.20146909961476922, -0.13080985277510163, 0.3853683784434741, -0.018314879178598694, -0.2051501032557677, 0.20032258876387707, -0.03836021503772248, -0.1181279250970957, 0.09801377731544728, 0.18047656689040278, 0.14001085863194682, -0.14662489071541296, -0.001679249353368174, -0.025374854465057564, 0.2203146719797091, 0.08960038731297985, 0.030520085600966758, 0.21791839123788206, 0.2070013074373657, 0.021391750844089653, 0.19182440919632263, -0.12737386157863181, -0.0044743009186773135, -0.2230491508983753, -0.1670018506363373, -0.18972710598768158, -0.015205151867121458, -0.08263770588409071, -0.15280177356167274, 0.3833343781022863, 0.21912293176336045, 0.1980079580267722, 0.06089275495509024, 0.316657815518027, 0.0283242466409733, 0.13907339784147388, 0.08245916893991473, 0.12935041621412066, -0.024295971481214193, 0.15467513136523353, -0.11928021157245067, 0.09132967015982352, 0.06883967702663292] |
1,803.00687 | Geometrical pluripotential theory on Sasaki manifolds | We extend profound results in pluripotential theory on Kahler manifolds to
Sasaki setting via its transverse Kahler structure. As in Kahler case, these
results form a very important piece to solve the existence of Sasaki metrics
with constant scalar curvature (cscs) in terms of properness of K-energy. One
main result is to generalize T. Darvas' theory on the geometric structure of
the space of Kahler potentials in Sasaki setting. Along the way we extend most
of corresponding results in pluripotential theory to Sasaki setting via its
transverse Kahler structure.
| math.DG math.AP math.CV | we extend profound results in pluripotential theory on kahler manifolds to sasaki setting via its transverse kahler structure as in kahler case these results form a very important piece to solve the existence of sasaki metrics with constant scalar curvature cscs in terms of properness of kenergy one main result is to generalize t darvas theory on the geometric structure of the space of kahler potentials in sasaki setting along the way we extend most of corresponding results in pluripotential theory to sasaki setting via its transverse kahler structure | [['we', 'extend', 'profound', 'results', 'in', 'pluripotential', 'theory', 'on', 'kahler', 'manifolds', 'to', 'sasaki', 'setting', 'via', 'its', 'transverse', 'kahler', 'structure', 'as', 'in', 'kahler', 'case', 'these', 'results', 'form', 'a', 'very', 'important', 'piece', 'to', 'solve', 'the', 'existence', 'of', 'sasaki', 'metrics', 'with', 'constant', 'scalar', 'curvature', 'cscs', 'in', 'terms', 'of', 'properness', 'of', 'kenergy', 'one', 'main', 'result', 'is', 'to', 'generalize', 't', 'darvas', 'theory', 'on', 'the', 'geometric', 'structure', 'of', 'the', 'space', 'of', 'kahler', 'potentials', 'in', 'sasaki', 'setting', 'along', 'the', 'way', 'we', 'extend', 'most', 'of', 'corresponding', 'results', 'in', 'pluripotential', 'theory', 'to', 'sasaki', 'setting', 'via', 'its', 'transverse', 'kahler', 'structure']] | [-0.16604248970600494, 0.02123393974753536, -0.10059738893773448, 0.09862263748301926, -0.17447451811304757, -0.1278388882631415, -0.04604047644795756, 0.3625503907168514, -0.22690787199450385, -0.23836036145770817, 0.04989770028002435, -0.25500825852197545, -0.22299206771709945, 0.1749554877090948, -0.15775635995473083, 0.009253128164897808, 0.05280133327626194, 0.05823328195851338, -0.07549996791260966, -0.31624414975064274, 0.4786755153961647, 0.03943664354031508, 0.21113228252199426, 0.1540870122242656, 0.07991771501478519, -0.009869387394256806, 0.013196798083320093, 0.028114771161403696, -0.17201794647308213, 0.15296407674407858, 0.23625866365043469, 0.042520742999452556, 0.2152235576480083, -0.3794250863949569, -0.24042441407113932, 0.13299898124101123, 0.05619284255806817, 0.05468490632418334, -0.028410662742582766, -0.27592053044367626, 0.10817832508113946, -0.060916866636259503, -0.22112525503538297, -0.15354541476732225, -0.037757936990662905, -0.03522919679029186, -0.15095712750394086, 0.04139167997787257, 0.09566485634847974, -0.02118716738448384, -0.11696049656844541, -0.11398854435766849, -0.06931692051565212, 0.036766093051626106, 0.10758399510405581, 0.117952144840795, 0.14474338871751274, -0.08450500742372732, -0.15637274233106357, 0.3656254888216578, -0.18636609655752612, -0.27527986538041843, 0.08809194518148564, -0.14496489549369623, -0.18138010626700654, 0.06299705863040819, 0.17795320592946215, 0.20627287511577766, -0.051506039494873555, 0.21692682070176253, -0.054251995764337896, 0.01195104206713398, 0.1504398472188564, 0.01658307656834132, 0.07696729478834385, 0.10873859027777327, 0.15663038716348035, 0.11074025449447669, 0.057163742428457134, -0.17195347078625908, -0.36528347281927476, -0.17278915136173534, -0.1121858794430501, 0.1815498417787505, -0.1635377258637899, -0.16948702108910244, 0.41195084169517493, 0.020235771391791908, 0.23859770543705883, 0.09206506779176717, 0.24083644555609549, -0.05723427998535126, 0.04928107133587781, 0.07223892805239793, 0.2393837205756958, 0.31621094152666207, 0.13666902473091744, -0.11448354532502675, -0.07073680259119929, 0.15846751577984752] |
1,803.00688 | Continuum excitation and pseudospin wave in quantum spin-liquid and
quadrupole ordered states of Tb$_{2+x}$Ti$_{2-x}$O$_{7+y}$ | The ground states of the frustrated pyrochlore oxide
Tb$_{2+x}$Ti$_{2-x}$O$_{7+y}$ have been studied by inelastic neutron scattering
experiments. Three single-crystal samples are investigated; one shows no phase
transition ($x=-0.007<x_{\text{c}}\sim -0.0025$), being a putative quantum
spin-liquid (QSL), and the other two ($x=0.000, 0.003$) show electric
quadrupole ordering (QO) below $T_{\text{c}} \sim 0.5$ K. The QSL sample shows
continuum excitation spectra with an energy scale 0.1 meV as well as
energy-resolution limited (nominally) elastic scattering. As $x$ is increased,
pseudospin wave of the QO state emerges from this continuum excitation, which
agrees with that of powder samples and consequently verifies good $x$ control
for the present single crystal samples.
| cond-mat.str-el cond-mat.other | the ground states of the frustrated pyrochlore oxide tb_2xti_2xo_7y have been studied by inelastic neutron scattering experiments three singlecrystal samples are investigated one shows no phase transition x0007x_textcsim 00025 being a putative quantum spinliquid qsl and the other two x0000 0003 show electric quadrupole ordering qo below t_textc sim 05 k the qsl sample shows continuum excitation spectra with an energy scale 01 mev as well as energyresolution limited nominally elastic scattering as x is increased pseudospin wave of the qo state emerges from this continuum excitation which agrees with that of powder samples and consequently verifies good x control for the present single crystal samples | [['the', 'ground', 'states', 'of', 'the', 'frustrated', 'pyrochlore', 'oxide', 'tb_2xti_2xo_7y', 'have', 'been', 'studied', 'by', 'inelastic', 'neutron', 'scattering', 'experiments', 'three', 'singlecrystal', 'samples', 'are', 'investigated', 'one', 'shows', 'no', 'phase', 'transition', 'x0007x_textcsim', '00025', 'being', 'a', 'putative', 'quantum', 'spinliquid', 'qsl', 'and', 'the', 'other', 'two', 'x0000', '0003', 'show', 'electric', 'quadrupole', 'ordering', 'qo', 'below', 't_textc', 'sim', '05', 'k', 'the', 'qsl', 'sample', 'shows', 'continuum', 'excitation', 'spectra', 'with', 'an', 'energy', 'scale', '01', 'mev', 'as', 'well', 'as', 'energyresolution', 'limited', 'nominally', 'elastic', 'scattering', 'as', 'x', 'is', 'increased', 'pseudospin', 'wave', 'of', 'the', 'qo', 'state', 'emerges', 'from', 'this', 'continuum', 'excitation', 'which', 'agrees', 'with', 'that', 'of', 'powder', 'samples', 'and', 'consequently', 'verifies', 'good', 'x', 'control', 'for', 'the', 'present', 'single', 'crystal', 'samples']] | [-0.1374779679463245, 0.2684161163556732, -0.004864857097765287, 0.04013972604074157, -0.005867170075082238, -0.14646679359765796, 0.09258391092925404, 0.40356215833722114, -0.21803347341595397, -0.324906243584477, 0.029741251062100325, -0.40272027124256754, -0.007753592880012898, 0.16592393164039373, 0.11460141458799346, 0.0568852956729153, -0.01829666017035309, 0.002658201047989468, -0.10344147404360299, -0.15104984077557815, 0.23501824051401435, 0.02982858075135762, 0.32599022157955915, 0.04898309357276258, 0.0826548623544323, 0.002515642686585824, 0.1696347752087884, -0.023144091058594104, -0.13386910735852536, -0.01024050994769473, 0.2863240946048441, -0.06868255218768564, 0.1214279519716421, -0.3822223820469354, -0.24561748189108373, 0.0065503759117116435, 0.144148739202557, 0.09900436355495074, -0.07287135704133946, -0.2875064577764043, 0.03087902071778304, -0.13683752587083012, -0.12348756049477043, -0.11485288638729028, -0.039713914452407226, -0.01967883999280345, -0.22915304316512236, 0.13243440964232342, 0.036092871163138904, 0.11909425476243576, -0.11819480373882331, -0.2152426548261876, -0.07882037743155916, 0.01004444521207076, 0.05522039458110857, 0.12400917413805683, 0.15496252555077752, -0.0819302146802119, -0.12464192163091727, 0.35724612056779176, -0.02306808352183837, -0.005918659642562629, 0.1384937502622891, -0.22538550061066276, -0.09280187270689147, 0.2485464866219375, 0.0427259363806605, 0.11022614943571031, -0.12407582773504636, 0.07235197468924945, -0.065027436426065, 0.27589412132622854, 0.037332199610178717, 0.08732235198840499, 0.23938927713495034, 0.23967118659773126, -0.016579928456429534, 0.14926171114348108, -0.1853760925363391, -0.025377837511209343, -0.2279226141399704, -0.12027492045756215, -0.24855249024067932, 0.1323584524578529, -0.06955948728556485, -0.15028743458410296, 0.27981562764706236, 0.07334856448533873, 0.20045710411026307, -0.040110390829235815, 0.22587610970591554, 0.07603423928398675, 0.03091753979186671, 0.014420591622743254, 0.30287211014029497, 0.20738928614390226, 0.09801005635997101, -0.2796534593687214, 0.05939980766001659, -0.0542352251493587] |
1,803.00689 | Measuring the microlensing parallax from various space observatories | A few observational methods allow the measurement of the mass and distance of
the lens-star for a microlensing event. A first estimate can be obtained by
measuring the microlensing parallax effect produced by either the motion of the
Earth (annual parallax) or the contemporaneous observation of the lensing event
from two (or more) observatories (space or terrestrial parallax) sufficiently
separated from each other. Further developing ideas originally outlined by
Gould (2013) and Mogavero & Beaulieu (2016), we review the possibility of
measuring systematically the microlensing parallax using a telescope based on
the Moon surface and other space-based observing platforms including the
upcoming WFIRST space-telescope. We first generalize the Fisher matrix
formulation and present results demonstrating the advantage for each observing
scenario. We conclude by outlining the limitation of the Fisher matrix analysis
when submitted to a practical data modeling process. By considering a
lunar-based parallax observation we find that parameter correlations introduce
a significant loss in detection efficiency of the probed lunar parallax effect.
| astro-ph.EP | a few observational methods allow the measurement of the mass and distance of the lensstar for a microlensing event a first estimate can be obtained by measuring the microlensing parallax effect produced by either the motion of the earth annual parallax or the contemporaneous observation of the lensing event from two or more observatories space or terrestrial parallax sufficiently separated from each other further developing ideas originally outlined by gould 2013 and mogavero beaulieu 2016 we review the possibility of measuring systematically the microlensing parallax using a telescope based on the moon surface and other spacebased observing platforms including the upcoming wfirst spacetelescope we first generalize the fisher matrix formulation and present results demonstrating the advantage for each observing scenario we conclude by outlining the limitation of the fisher matrix analysis when submitted to a practical data modeling process by considering a lunarbased parallax observation we find that parameter correlations introduce a significant loss in detection efficiency of the probed lunar parallax effect | [['a', 'few', 'observational', 'methods', 'allow', 'the', 'measurement', 'of', 'the', 'mass', 'and', 'distance', 'of', 'the', 'lensstar', 'for', 'a', 'microlensing', 'event', 'a', 'first', 'estimate', 'can', 'be', 'obtained', 'by', 'measuring', 'the', 'microlensing', 'parallax', 'effect', 'produced', 'by', 'either', 'the', 'motion', 'of', 'the', 'earth', 'annual', 'parallax', 'or', 'the', 'contemporaneous', 'observation', 'of', 'the', 'lensing', 'event', 'from', 'two', 'or', 'more', 'observatories', 'space', 'or', 'terrestrial', 'parallax', 'sufficiently', 'separated', 'from', 'each', 'other', 'further', 'developing', 'ideas', 'originally', 'outlined', 'by', 'gould', '2013', 'and', 'mogavero', 'beaulieu', '2016', 'we', 'review', 'the', 'possibility', 'of', 'measuring', 'systematically', 'the', 'microlensing', 'parallax', 'using', 'a', 'telescope', 'based', 'on', 'the', 'moon', 'surface', 'and', 'other', 'spacebased', 'observing', 'platforms', 'including', 'the', 'upcoming', 'wfirst', 'spacetelescope', 'we', 'first', 'generalize', 'the', 'fisher', 'matrix', 'formulation', 'and', 'present', 'results', 'demonstrating', 'the', 'advantage', 'for', 'each', 'observing', 'scenario', 'we', 'conclude', 'by', 'outlining', 'the', 'limitation', 'of', 'the', 'fisher', 'matrix', 'analysis', 'when', 'submitted', 'to', 'a', 'practical', 'data', 'modeling', 'process', 'by', 'considering', 'a', 'lunarbased', 'parallax', 'observation', 'we', 'find', 'that', 'parameter', 'correlations', 'introduce', 'a', 'significant', 'loss', 'in', 'detection', 'efficiency', 'of', 'the', 'probed', 'lunar', 'parallax', 'effect']] | [-0.09647504039853236, 0.09924569989290134, -0.11097825943480855, 0.06528246366707646, -0.129318037972912, -0.07009878664789146, 0.07604729033716276, 0.3282496154015125, -0.22983030378739464, -0.36474973112804654, 0.12425590739053685, -0.30736588290605094, -0.12551149988387436, 0.24112117859782123, -0.047256667704470914, 0.039451063719842534, 0.16282432902328395, -0.06503780521481171, -0.08168641947760293, -0.2403959334608064, 0.2722942590020758, 0.11975198629869861, 0.17722949887270878, 0.010767085309554305, 0.10718319971002294, 0.019848482901759355, -0.15858277687687933, 0.03271250461532165, -0.14889889547802015, 0.10529868655125207, 0.21108865513204722, 0.18834992747949322, 0.23091893310854097, -0.35436026066725634, -0.23548015320305654, 0.08837959781881238, 0.07585931630204375, 0.07079652337289852, -0.06855594865569233, -0.40464669513734586, -0.008290669084584087, -0.21192657744603943, -0.11750033675307799, 0.002054121468883054, 0.04048997535726723, 0.010432935133001503, -0.23582640950234585, 0.07030254725458814, 0.00648126600383505, 0.09528516654936987, -0.08990464291972235, -0.12300054328573615, 0.01650193527004578, 0.09677144220579605, 0.013267437111619389, 0.02715392156653566, 0.11452798632169027, -0.08194395047210065, -0.12373186356135081, 0.3871972375767834, -0.10222232337310956, -0.0948530715363126, 0.12552265890913133, -0.19425548438592183, -0.13458483037251381, 0.07252769309877889, 0.1781195184290639, 0.11059260380132423, -0.1906887346151591, 0.007986048933544002, 0.03961154388229328, 0.1730765660615339, 0.07819647101949855, 0.02093685740162331, 0.3061917318192161, 0.16413486790182183, 0.07643295338610546, 0.07812692648386238, -0.25708686687874344, -0.02754135108495384, -0.25970113570629444, -0.1204955508841926, -0.202967697168114, 0.053979541340348436, -0.07977099966704788, -0.06096339985055642, 0.3424186254075418, 0.20398153825433074, 0.17917702435285865, 0.03002440782600186, 0.34238665196239765, 0.0469028704661738, 0.07174227793016874, 0.016121490098202577, 0.3462003025321152, 0.07762434356702193, 0.08106463641996486, -0.21060402910110115, 0.10621340282801768, 0.050106885411811096] |
1,803.0069 | Throughput Maximization for Laser-Powered UAV Wireless Communication
Systems | Laser power has become a viable solution to provide convenient and
sustainable energy supply to unmanned aerial vehicles (UAVs). In this paper, we
study a laser-powered UAV wireless communication system, where a laser
transmitter sends laser beams to charge a fixed-wing UAV in flight, and the UAV
uses the harvested laser energy to communicate with a ground station. To
maintain the UAV's sustainable operation, its total energy consumption cannot
exceed that harvested from the laser transmitter. Under such a laser energy
harvesting constraint, we maximize the downlink communication throughput from
the UAV to the ground station over a finite time duration, by jointly
optimizing the UAV's trajectory and its transmit power allocation. However, due
to the complicated UAV energy consumption model, this problem is non-convex and
difficult to be solved. To tackle the problem, we first consider a special case
with a double-circular UAV trajectory which balances the tradeoff between
maximizing the performance of laser energy harvesting versus wireless
communication at the UAV. Next, based on the obtained double-circular
trajectory, we propose an efficient solution to the general problem, by
applying the techniques of alternating optimization and sequential convex
programming (SCP). Finally, numerical results are provided to validate the
communication throughput performance of the proposed design.
| cs.IT math.IT | laser power has become a viable solution to provide convenient and sustainable energy supply to unmanned aerial vehicles uavs in this paper we study a laserpowered uav wireless communication system where a laser transmitter sends laser beams to charge a fixedwing uav in flight and the uav uses the harvested laser energy to communicate with a ground station to maintain the uavs sustainable operation its total energy consumption cannot exceed that harvested from the laser transmitter under such a laser energy harvesting constraint we maximize the downlink communication throughput from the uav to the ground station over a finite time duration by jointly optimizing the uavs trajectory and its transmit power allocation however due to the complicated uav energy consumption model this problem is nonconvex and difficult to be solved to tackle the problem we first consider a special case with a doublecircular uav trajectory which balances the tradeoff between maximizing the performance of laser energy harvesting versus wireless communication at the uav next based on the obtained doublecircular trajectory we propose an efficient solution to the general problem by applying the techniques of alternating optimization and sequential convex programming scp finally numerical results are provided to validate the communication throughput performance of the proposed design | [['laser', 'power', 'has', 'become', 'a', 'viable', 'solution', 'to', 'provide', 'convenient', 'and', 'sustainable', 'energy', 'supply', 'to', 'unmanned', 'aerial', 'vehicles', 'uavs', 'in', 'this', 'paper', 'we', 'study', 'a', 'laserpowered', 'uav', 'wireless', 'communication', 'system', 'where', 'a', 'laser', 'transmitter', 'sends', 'laser', 'beams', 'to', 'charge', 'a', 'fixedwing', 'uav', 'in', 'flight', 'and', 'the', 'uav', 'uses', 'the', 'harvested', 'laser', 'energy', 'to', 'communicate', 'with', 'a', 'ground', 'station', 'to', 'maintain', 'the', 'uavs', 'sustainable', 'operation', 'its', 'total', 'energy', 'consumption', 'can', 'not', 'exceed', 'that', 'harvested', 'from', 'the', 'laser', 'transmitter', 'under', 'such', 'a', 'laser', 'energy', 'harvesting', 'constraint', 'we', 'maximize', 'the', 'downlink', 'communication', 'throughput', 'from', 'the', 'uav', 'to', 'the', 'ground', 'station', 'over', 'a', 'finite', 'time', 'duration', 'by', 'jointly', 'optimizing', 'the', 'uavs', 'trajectory', 'and', 'its', 'transmit', 'power', 'allocation', 'however', 'due', 'to', 'the', 'complicated', 'uav', 'energy', 'consumption', 'model', 'this', 'problem', 'is', 'nonconvex', 'and', 'difficult', 'to', 'be', 'solved', 'to', 'tackle', 'the', 'problem', 'we', 'first', 'consider', 'a', 'special', 'case', 'with', 'a', 'doublecircular', 'uav', 'trajectory', 'which', 'balances', 'the', 'tradeoff', 'between', 'maximizing', 'the', 'performance', 'of', 'laser', 'energy', 'harvesting', 'versus', 'wireless', 'communication', 'at', 'the', 'uav', 'next', 'based', 'on', 'the', 'obtained', 'doublecircular', 'trajectory', 'we', 'propose', 'an', 'efficient', 'solution', 'to', 'the', 'general', 'problem', 'by', 'applying', 'the', 'techniques', 'of', 'alternating', 'optimization', 'and', 'sequential', 'convex', 'programming', 'scp', 'finally', 'numerical', 'results', 'are', 'provided', 'to', 'validate', 'the', 'communication', 'throughput', 'performance', 'of', 'the', 'proposed', 'design']] | [-0.2415469429985273, 0.047909923416620016, -0.024634109157155835, 0.0018453238875486468, -0.09207558806519955, -0.23267802802672355, 0.11934961002450162, 0.4217288984241439, -0.31571695475163414, -0.32543126153120516, 0.07070614289213885, -0.24743721270865268, -0.1147198634879554, 0.18493549229335224, -0.17785146127468632, 0.10261575895414103, 0.0885089599703183, 0.03899215490288471, 0.023892682866312052, -0.21480962890542715, 0.21945720502659313, 0.15647006839029856, 0.34497458705285966, 0.05064735093066131, 0.16018263132119662, 0.01958235543947119, 0.0783175661539038, -0.06396398911587597, -0.14088727494801753, 0.1247164526544557, 0.36569665348517943, 0.21450620286130145, 0.31451499242764697, -0.4771225861794151, -0.25501890527312737, 0.1302363593456582, 0.1124825433305209, 0.027340704576893, -0.05547114107677914, -0.27482593176754044, 0.07746486661284614, -0.24752724586470126, -0.04981256529287088, 0.027234013240291354, -0.07148897513637648, 0.11401393092477091, -0.33879245853955475, -0.0921129162187058, -0.10080348487541664, 0.020398488491956218, -0.14355438232636444, -0.02972142173972565, -0.013125848530691262, 0.16099188950223228, 0.07441062389361654, 0.0185155195809499, 0.13272843684535474, -0.08682210909376177, -0.08971166466674321, 0.4234254350132473, 0.045157749885773084, -0.2094330504872179, 0.10571012657258988, -0.04045131422040582, -0.05216518774236023, 0.17778815066398523, 0.26469811824134404, 0.10899068608505688, -0.17738985143117972, 0.018525968824784893, 0.034423932166057915, 0.1643333698545272, 0.10576652198705785, 0.04689993943212161, 0.17546489406445556, 0.24229790678923474, 0.272134360151968, 0.14423170863643892, -0.125589377718165, -0.13122136857561476, -0.19834794156600302, -0.12343683515620582, -0.2530362193322028, 0.04001354425582024, -0.029100819718758643, -0.010906315156984526, 0.39210181318533915, 0.1309954230365453, 0.0785048746369213, 0.12189552530831219, 0.4701586033436744, 0.14070418512781935, 0.0019707343924571484, 0.13392455767333397, 0.21925881604935663, 0.05019337438958852, 0.19645125514259287, -0.2622686118205927, 0.012034004816657626, -0.01118092326556935] |
1,803.00691 | No Evidence for Periodic Variability in the Light Curve of Active Galaxy
J0045+41 | Dorn-Wallenstein, Levesque, & Ruan recently presented the identification of a
z=0.215 active galaxy located behind M31 and claimed the detection of multiple
periodic variations in the object's light curve with as many as nine different
periods. They interpreted these results as evidence for the presence of a
binary supermassive black hole with an orbital separation of just a few hundred
AU, and estimated the gravitational-wave signal implied by such a system. We
demonstrate that the claimed periodicities are based on a misinterpretation of
the null hypothesis test simulations and an error in the method used to
calculate the false alarm probabilities. There is no evidence for periodicity
in the data.
| astro-ph.GA astro-ph.HE | dornwallenstein levesque ruan recently presented the identification of a z0215 active galaxy located behind m31 and claimed the detection of multiple periodic variations in the objects light curve with as many as nine different periods they interpreted these results as evidence for the presence of a binary supermassive black hole with an orbital separation of just a few hundred au and estimated the gravitationalwave signal implied by such a system we demonstrate that the claimed periodicities are based on a misinterpretation of the null hypothesis test simulations and an error in the method used to calculate the false alarm probabilities there is no evidence for periodicity in the data | [['dornwallenstein', 'levesque', 'ruan', 'recently', 'presented', 'the', 'identification', 'of', 'a', 'z0215', 'active', 'galaxy', 'located', 'behind', 'm31', 'and', 'claimed', 'the', 'detection', 'of', 'multiple', 'periodic', 'variations', 'in', 'the', 'objects', 'light', 'curve', 'with', 'as', 'many', 'as', 'nine', 'different', 'periods', 'they', 'interpreted', 'these', 'results', 'as', 'evidence', 'for', 'the', 'presence', 'of', 'a', 'binary', 'supermassive', 'black', 'hole', 'with', 'an', 'orbital', 'separation', 'of', 'just', 'a', 'few', 'hundred', 'au', 'and', 'estimated', 'the', 'gravitationalwave', 'signal', 'implied', 'by', 'such', 'a', 'system', 'we', 'demonstrate', 'that', 'the', 'claimed', 'periodicities', 'are', 'based', 'on', 'a', 'misinterpretation', 'of', 'the', 'null', 'hypothesis', 'test', 'simulations', 'and', 'an', 'error', 'in', 'the', 'method', 'used', 'to', 'calculate', 'the', 'false', 'alarm', 'probabilities', 'there', 'is', 'no', 'evidence', 'for', 'periodicity', 'in', 'the', 'data']] | [-0.15696967510227985, 0.04250412790140651, -0.07107404959779755, 0.1343630972398863, -0.04054746712192406, -0.10253934431211831, 0.07921217398056499, 0.3497026825724083, -0.1853947958247475, -0.3533699740177003, 0.13102497470404117, -0.2794397745086163, -0.13016654083627127, 0.26299912706191575, -0.06311410976243075, 0.06292653461987867, 0.06822871073925972, 0.03673438102694524, -0.06274267322074831, -0.23338854810762627, 0.26193363240824263, 0.07183486818788555, 0.1923657316087841, -0.01919148670439826, 0.10011223156253207, 0.0019498276045528528, -0.050324795271539796, -0.010779207415669878, -0.0859979682139727, 0.07840861630338793, 0.2197409887389045, 0.15845697899686312, 0.25359279811643415, -0.37871126151669804, -0.2290533431675111, 0.07642538346367601, 0.1440724959710143, 0.0900440247833868, -0.11836430960156406, -0.33204186093780236, 0.0994306732682842, -0.1939232846695895, -0.14963976838234289, 0.011031898400076082, 0.07591204054949578, 0.02228647870855911, -0.22268139981777868, 0.10784895906973387, 0.06906842562222035, 0.07104395940099086, -0.09606544110297321, -0.09329419673059275, -0.01591558819070946, 0.0960003787827913, 0.1130945736033163, 0.03307281760934079, 0.13093714933476855, -0.0603834449653035, -0.1653644898405873, 0.35511533332831946, -0.0798061631824473, -0.12033503548303079, 0.2302917906879578, -0.15538513377552557, -0.1414566643353308, 0.15087701825895042, 0.14113241927611214, 0.13156936295922392, -0.14382340349082914, -0.026912511384580284, -0.03451030874172243, 0.22229813126342318, 0.10368550539225618, 0.03411873273029771, 0.3337938462462381, 0.1224272032660023, 0.007258932123060782, 0.08823704241914239, -0.22045436004289887, -0.044898809042593864, -0.2963197522662867, -0.12323208707254206, -0.17302731115579884, 0.03313858436951501, -0.09158000826934096, -0.16150235748092565, 0.34358682908187405, 0.13558066113706174, 0.22536984457042522, 0.005816914389240686, 0.24202582518195856, 0.07615383672767327, 0.06260583821301148, 0.07969056166029562, 0.32218582467524176, 0.10695856562859127, 0.05588909572590943, -0.1846402764416117, 0.08999604156684722, 0.010581898794587806] |
1,803.00692 | Insights into exfoliation possibility of MAX phases to MXenes | Chemical exfoliation of MAX phases into two-dimensional (2D) MXenes can be
considered as a major breakthrough in the synthesis of novel 2D systems. To
gain insight into the exfoliation possibility of MAX phases and to identify
which MAX phases are promising candidates for successful exfoliation into 2D
MXenes, we perform extensive electronic structure and phonon calculations, and
determine the force constants, bond strengths, and static exfoliation energies
of MAX phases to MXenes for 82 different experimentally synthesized crystalline
MAX phases. Our results show a clear correlation between the force constants
and the bond strengths. As the total force constant of an "A" atom contributed
from the neighboring atoms is smaller, the exfoliation energy becomes smaller,
thus making exfoliation easier. We propose 37 MAX phases for successful
exfoliation into 2D Ti$_2$C, Ti$_3$C$_2$, Ti$_4$C$_3, $Ti$_5$C$_4$, Ti$_2$N,
Zr$_2$C, Hf$_2$C, V$_2$C, V$_3$C$_2$, V$_4$C$_3$, Nb$_2$C, Nb$_5$C$_4$,
Ta$_2$C, Ta$_5$C$_4$, Cr$_2$C, Cr$_2$N, and Mo$_2$C MXenes. In addition, we
explore the effect of charge injection on MAX phases. We find that the injected
charges, both electrons and holes, are mainly received by the transition
metals. This is due to the electronic property of MAX phases that the states
near the Fermi energy are mainly dominated by $d$ orbitals of the transition
metals. For negatively charged MAX phases, the electrons injected cause
swelling of the structure and elongation of the bond distances along the $c$
axis, which hence weakens the binding. For positively charged MAX phases, on
the other hand, the bonds become shorter and stronger. Therefore, we predict
that the electron injection by electrochemistry or gating techniques can
significantly facilitate the exfoliation possibility of MAX phases to 2D
MXenes.
| cond-mat.mtrl-sci | chemical exfoliation of max phases into twodimensional 2d mxenes can be considered as a major breakthrough in the synthesis of novel 2d systems to gain insight into the exfoliation possibility of max phases and to identify which max phases are promising candidates for successful exfoliation into 2d mxenes we perform extensive electronic structure and phonon calculations and determine the force constants bond strengths and static exfoliation energies of max phases to mxenes for 82 different experimentally synthesized crystalline max phases our results show a clear correlation between the force constants and the bond strengths as the total force constant of an a atom contributed from the neighboring atoms is smaller the exfoliation energy becomes smaller thus making exfoliation easier we propose 37 max phases for successful exfoliation into 2d ti_2c ti_3c_2 ti_4c_3 ti_5c_4 ti_2n zr_2c hf_2c v_2c v_3c_2 v_4c_3 nb_2c nb_5c_4 ta_2c ta_5c_4 cr_2c cr_2n and mo_2c mxenes in addition we explore the effect of charge injection on max phases we find that the injected charges both electrons and holes are mainly received by the transition metals this is due to the electronic property of max phases that the states near the fermi energy are mainly dominated by d orbitals of the transition metals for negatively charged max phases the electrons injected cause swelling of the structure and elongation of the bond distances along the c axis which hence weakens the binding for positively charged max phases on the other hand the bonds become shorter and stronger therefore we predict that the electron injection by electrochemistry or gating techniques can significantly facilitate the exfoliation possibility of max phases to 2d mxenes | [['chemical', 'exfoliation', 'of', 'max', 'phases', 'into', 'twodimensional', '2d', 'mxenes', 'can', 'be', 'considered', 'as', 'a', 'major', 'breakthrough', 'in', 'the', 'synthesis', 'of', 'novel', '2d', 'systems', 'to', 'gain', 'insight', 'into', 'the', 'exfoliation', 'possibility', 'of', 'max', 'phases', 'and', 'to', 'identify', 'which', 'max', 'phases', 'are', 'promising', 'candidates', 'for', 'successful', 'exfoliation', 'into', '2d', 'mxenes', 'we', 'perform', 'extensive', 'electronic', 'structure', 'and', 'phonon', 'calculations', 'and', 'determine', 'the', 'force', 'constants', 'bond', 'strengths', 'and', 'static', 'exfoliation', 'energies', 'of', 'max', 'phases', 'to', 'mxenes', 'for', '82', 'different', 'experimentally', 'synthesized', 'crystalline', 'max', 'phases', 'our', 'results', 'show', 'a', 'clear', 'correlation', 'between', 'the', 'force', 'constants', 'and', 'the', 'bond', 'strengths', 'as', 'the', 'total', 'force', 'constant', 'of', 'an', 'a', 'atom', 'contributed', 'from', 'the', 'neighboring', 'atoms', 'is', 'smaller', 'the', 'exfoliation', 'energy', 'becomes', 'smaller', 'thus', 'making', 'exfoliation', 'easier', 'we', 'propose', '37', 'max', 'phases', 'for', 'successful', 'exfoliation', 'into', '2d', 'ti_2c', 'ti_3c_2', 'ti_4c_3', 'ti_5c_4', 'ti_2n', 'zr_2c', 'hf_2c', 'v_2c', 'v_3c_2', 'v_4c_3', 'nb_2c', 'nb_5c_4', 'ta_2c', 'ta_5c_4', 'cr_2c', 'cr_2n', 'and', 'mo_2c', 'mxenes', 'in', 'addition', 'we', 'explore', 'the', 'effect', 'of', 'charge', 'injection', 'on', 'max', 'phases', 'we', 'find', 'that', 'the', 'injected', 'charges', 'both', 'electrons', 'and', 'holes', 'are', 'mainly', 'received', 'by', 'the', 'transition', 'metals', 'this', 'is', 'due', 'to', 'the', 'electronic', 'property', 'of', 'max', 'phases', 'that', 'the', 'states', 'near', 'the', 'fermi', 'energy', 'are', 'mainly', 'dominated', 'by', 'd', 'orbitals', 'of', 'the', 'transition', 'metals', 'for', 'negatively', 'charged', 'max', 'phases', 'the', 'electrons', 'injected', 'cause', 'swelling', 'of', 'the', 'structure', 'and', 'elongation', 'of', 'the', 'bond', 'distances', 'along', 'the', 'c', 'axis', 'which', 'hence', 'weakens', 'the', 'binding', 'for', 'positively', 'charged', 'max', 'phases', 'on', 'the', 'other', 'hand', 'the', 'bonds', 'become', 'shorter', 'and', 'stronger', 'therefore', 'we', 'predict', 'that', 'the', 'electron', 'injection', 'by', 'electrochemistry', 'or', 'gating', 'techniques', 'can', 'significantly', 'facilitate', 'the', 'exfoliation', 'possibility', 'of', 'max', 'phases', 'to', '2d', 'mxenes']] | [-0.09259820316757005, 0.23427675913335405, -0.03630406185215039, 0.02228603992508187, 0.00515644049558502, -0.16685704891838563, 0.09704581682185212, 0.376373321040032, -0.288896922449147, -0.2977542567066848, 0.003644366382370488, -0.33131790356061314, -0.1042190957630877, 0.14722718750484862, 0.06092725977516518, 0.02318388905483656, -0.002652259600850252, -0.1030648834085486, -0.12309705229865638, -0.19097519794908854, 0.24870883559521575, 0.059256917120029146, 0.330035203252919, 0.10270832882001392, 0.019693231956961637, -0.026659336991052933, 0.0966426850314467, 0.034103538341360734, -0.17129624521383868, 0.09336500933389358, 0.21213545765763578, -0.021416589646385265, 0.20736320453982512, -0.49347842250449153, -0.20800727241797945, 0.04745569043219663, 0.11752308996824118, 0.12175914655941036, -0.09239552326482506, -0.24568547921550746, 0.06655471798462363, -0.1395492342309668, -0.05715896102886361, -0.09373945029309162, 0.06517469488585798, 0.014644093967329424, -0.21624693681279986, 0.09415566063880061, 0.034065257416715705, 0.013926749805166484, -0.11399718537890854, -0.1793294419234511, -0.10919500087262489, 0.09569379846440056, 0.032806565869563764, 0.0416888108333716, 0.18447849390795454, -0.14007639028378224, -0.08345265424510356, 0.4375654943054542, -0.008222728319322834, -0.07656706152304721, 0.1706316470902843, -0.11715326582483472, -0.10781971045675723, 0.16366841079076178, 0.12408598842067967, 0.10965204233160386, -0.09488994799903594, 0.01321115551780587, 0.04874946013487016, 0.16248377113459775, 0.06562616930773052, 0.04048314468639616, 0.25859021950119104, 0.14416851590280064, 0.05366754343446631, 0.12852351458882016, -0.10799338271160824, -0.04807325689493714, -0.15858392405072944, -0.22955238324446747, -0.19553215896818213, 0.050137979571277705, -0.06984444713312908, -0.14536588640095524, 0.4140068190602156, 0.09465290051884949, 0.1713067469391927, -0.03510382510184382, 0.24199221608876262, 0.06327494847937487, 0.07815321932027403, 0.02332561445565751, 0.3122317194719262, 0.12591508291751288, 0.0716339310666976, -0.23177851249705642, 0.08510387023337758, 0.07077468771290464] |
1,803.00693 | Accelerating E-Commerce Search Engine Ranking by Contextual Factor
Selection | In industrial large-scale search systems, such as Taobao.com search for
commodities, the quality of the ranking result is getting continually improved
by introducing more factors from complex procedures, e.g., deep neural networks
for extracting image factors. Meanwhile, the increasing of the factors demands
more computation resource and raises the system response latency. It has been
observed that a search instance usually requires only a small set of effective
factors, instead of all factors. Therefore, removing ineffective factors
significantly improves the system efficiency. This paper studies the
\emph{Contextual Factor Selection} (CFS), which selects only a subset of
effective factors for every search instance, for a well balance between the
search quality and the response latency. We inject CFS into the search engine
ranking score to accelerate the engine, considering both ranking effectiveness
and efficiency. The learning of the CFS model involves a combinatorial
optimization, which is transformed as a sequential decision-making problem.
Solving the problem by reinforcement learning, we propose the RankCFS, which
has been assessed in an off-line environment as well as a real-world on-line
environment (Taobao.com). The empirical results show that, the proposed CFS
approach outperforms several existing supervised/unsupervised methods for
feature selection in the off-line environment, and also achieves significant
real-world performance improvement, in term of service latency, in daily test
as well as Singles' Day Shopping Festival in $2017$.
| cs.IR | in industrial largescale search systems such as taobaocom search for commodities the quality of the ranking result is getting continually improved by introducing more factors from complex procedures eg deep neural networks for extracting image factors meanwhile the increasing of the factors demands more computation resource and raises the system response latency it has been observed that a search instance usually requires only a small set of effective factors instead of all factors therefore removing ineffective factors significantly improves the system efficiency this paper studies the emphcontextual factor selection cfs which selects only a subset of effective factors for every search instance for a well balance between the search quality and the response latency we inject cfs into the search engine ranking score to accelerate the engine considering both ranking effectiveness and efficiency the learning of the cfs model involves a combinatorial optimization which is transformed as a sequential decisionmaking problem solving the problem by reinforcement learning we propose the rankcfs which has been assessed in an offline environment as well as a realworld online environment taobaocom the empirical results show that the proposed cfs approach outperforms several existing supervisedunsupervised methods for feature selection in the offline environment and also achieves significant realworld performance improvement in term of service latency in daily test as well as singles day shopping festival in 2017 | [['in', 'industrial', 'largescale', 'search', 'systems', 'such', 'as', 'taobaocom', 'search', 'for', 'commodities', 'the', 'quality', 'of', 'the', 'ranking', 'result', 'is', 'getting', 'continually', 'improved', 'by', 'introducing', 'more', 'factors', 'from', 'complex', 'procedures', 'eg', 'deep', 'neural', 'networks', 'for', 'extracting', 'image', 'factors', 'meanwhile', 'the', 'increasing', 'of', 'the', 'factors', 'demands', 'more', 'computation', 'resource', 'and', 'raises', 'the', 'system', 'response', 'latency', 'it', 'has', 'been', 'observed', 'that', 'a', 'search', 'instance', 'usually', 'requires', 'only', 'a', 'small', 'set', 'of', 'effective', 'factors', 'instead', 'of', 'all', 'factors', 'therefore', 'removing', 'ineffective', 'factors', 'significantly', 'improves', 'the', 'system', 'efficiency', 'this', 'paper', 'studies', 'the', 'emphcontextual', 'factor', 'selection', 'cfs', 'which', 'selects', 'only', 'a', 'subset', 'of', 'effective', 'factors', 'for', 'every', 'search', 'instance', 'for', 'a', 'well', 'balance', 'between', 'the', 'search', 'quality', 'and', 'the', 'response', 'latency', 'we', 'inject', 'cfs', 'into', 'the', 'search', 'engine', 'ranking', 'score', 'to', 'accelerate', 'the', 'engine', 'considering', 'both', 'ranking', 'effectiveness', 'and', 'efficiency', 'the', 'learning', 'of', 'the', 'cfs', 'model', 'involves', 'a', 'combinatorial', 'optimization', 'which', 'is', 'transformed', 'as', 'a', 'sequential', 'decisionmaking', 'problem', 'solving', 'the', 'problem', 'by', 'reinforcement', 'learning', 'we', 'propose', 'the', 'rankcfs', 'which', 'has', 'been', 'assessed', 'in', 'an', 'offline', 'environment', 'as', 'well', 'as', 'a', 'realworld', 'online', 'environment', 'taobaocom', 'the', 'empirical', 'results', 'show', 'that', 'the', 'proposed', 'cfs', 'approach', 'outperforms', 'several', 'existing', 'supervisedunsupervised', 'methods', 'for', 'feature', 'selection', 'in', 'the', 'offline', 'environment', 'and', 'also', 'achieves', 'significant', 'realworld', 'performance', 'improvement', 'in', 'term', 'of', 'service', 'latency', 'in', 'daily', 'test', 'as', 'well', 'as', 'singles', 'day', 'shopping', 'festival', 'in', '2017']] | [-0.09400593731063311, 0.015681156140742038, -0.05401641645439003, 0.07396870290065295, -0.08784246039640618, -0.13696679827591327, 0.10537578550020667, 0.4080309701666712, -0.24502376158249706, -0.38235995531524425, 0.09394413702291986, -0.2568823038246887, -0.1705879040751351, 0.22186662352933084, -0.06978138625931705, 0.07852676399179721, 0.1073734940972698, 0.029203895032916167, -0.03615127654039045, -0.2939420189819039, 0.27172638167580376, 0.11127668606278436, 0.34124414959165467, 0.037589575141162256, 0.09095006747826186, 0.020893620159136785, -0.04650641102545797, 0.02622005342586672, -0.013074930183513443, 0.12322156183149445, 0.3077462750176589, 0.21729441476798697, 0.3569244604247312, -0.3577598212471553, -0.21795886929134187, 0.11036688879878605, 0.14567780574552713, 0.044536985395812176, -0.06954672793418139, -0.2948542155121287, 0.059741063546878394, -0.191612389525792, -0.008260264371832212, -0.1249200886234505, 0.01065972318115844, 0.0006123900171114158, -0.31111699440750423, 0.039634159721086464, 0.05909612532396754, 0.026332919309383522, -0.05527647835687313, -0.14947332304978922, 0.03969542627524772, 0.16623799378460605, 0.06444056319619304, 0.045652691154745004, 0.18880412248298142, -0.2130605315579076, -0.17376956555457598, 0.4146133262374902, -0.032598919170849096, -0.17123615338900827, 0.18057076439907835, -0.016709938371069218, -0.14392552762313587, 0.12129653526308466, 0.2456183054560974, 0.09656892690412087, -0.19475098673177704, 0.023476921253705815, -0.038182441883010274, 0.1754906910533281, 0.05054022485526389, 0.012628590548836274, 0.13073050098697822, 0.2680710054504511, 0.07470971405650723, 0.14859075682794837, -0.06492713198797208, -0.07755382731982154, -0.193136930879265, -0.14973502516848583, -0.15737522352374156, -0.0031351968624786426, -0.11609895516279448, -0.14284176770257487, 0.3915341420600948, 0.17067666362851994, 0.17905263753276165, 0.05731749561345247, 0.3381533422018295, 0.10448800215821077, 0.10832456019855866, 0.11687712703584842, 0.20395282706560475, -0.03385810583795859, 0.11898422519996396, -0.19812871112337244, 0.13595042066844223, 0.048601824248030986] |
1,803.00694 | Deep-neural-network based sinogram synthesis for sparse-view CT image
reconstruction | Recently, a number of approaches to low-dose computed tomography (CT) have
been developed and deployed in commercialized CT scanners. Tube current
reduction is perhaps the most actively explored technology with advanced image
reconstruction algorithms. Sparse data sampling is another viable option to the
low-dose CT, and sparse-view CT has been particularly of interest among the
researchers in CT community. Since analytic image reconstruction algorithms
would lead to severe image artifacts, various iterative algorithms have been
developed for reconstructing images from sparsely view-sampled projection data.
However, iterative algorithms take much longer computation time than the
analytic algorithms, and images are usually prone to different types of image
artifacts that heavily depend on the reconstruction parameters. Interpolation
methods have also been utilized to fill the missing data in the sinogram of
sparse-view CT thus providing synthetically full data for analytic image
reconstruction. In this work, we introduce a deep-neural-network-enabled
sinogram synthesis method for sparse-view CT, and show its outperformance to
the existing interpolation methods and also to the iterative image
reconstruction approach.
| physics.med-ph cs.CV eess.IV | recently a number of approaches to lowdose computed tomography ct have been developed and deployed in commercialized ct scanners tube current reduction is perhaps the most actively explored technology with advanced image reconstruction algorithms sparse data sampling is another viable option to the lowdose ct and sparseview ct has been particularly of interest among the researchers in ct community since analytic image reconstruction algorithms would lead to severe image artifacts various iterative algorithms have been developed for reconstructing images from sparsely viewsampled projection data however iterative algorithms take much longer computation time than the analytic algorithms and images are usually prone to different types of image artifacts that heavily depend on the reconstruction parameters interpolation methods have also been utilized to fill the missing data in the sinogram of sparseview ct thus providing synthetically full data for analytic image reconstruction in this work we introduce a deepneuralnetworkenabled sinogram synthesis method for sparseview ct and show its outperformance to the existing interpolation methods and also to the iterative image reconstruction approach | [['recently', 'a', 'number', 'of', 'approaches', 'to', 'lowdose', 'computed', 'tomography', 'ct', 'have', 'been', 'developed', 'and', 'deployed', 'in', 'commercialized', 'ct', 'scanners', 'tube', 'current', 'reduction', 'is', 'perhaps', 'the', 'most', 'actively', 'explored', 'technology', 'with', 'advanced', 'image', 'reconstruction', 'algorithms', 'sparse', 'data', 'sampling', 'is', 'another', 'viable', 'option', 'to', 'the', 'lowdose', 'ct', 'and', 'sparseview', 'ct', 'has', 'been', 'particularly', 'of', 'interest', 'among', 'the', 'researchers', 'in', 'ct', 'community', 'since', 'analytic', 'image', 'reconstruction', 'algorithms', 'would', 'lead', 'to', 'severe', 'image', 'artifacts', 'various', 'iterative', 'algorithms', 'have', 'been', 'developed', 'for', 'reconstructing', 'images', 'from', 'sparsely', 'viewsampled', 'projection', 'data', 'however', 'iterative', 'algorithms', 'take', 'much', 'longer', 'computation', 'time', 'than', 'the', 'analytic', 'algorithms', 'and', 'images', 'are', 'usually', 'prone', 'to', 'different', 'types', 'of', 'image', 'artifacts', 'that', 'heavily', 'depend', 'on', 'the', 'reconstruction', 'parameters', 'interpolation', 'methods', 'have', 'also', 'been', 'utilized', 'to', 'fill', 'the', 'missing', 'data', 'in', 'the', 'sinogram', 'of', 'sparseview', 'ct', 'thus', 'providing', 'synthetically', 'full', 'data', 'for', 'analytic', 'image', 'reconstruction', 'in', 'this', 'work', 'we', 'introduce', 'a', 'deepneuralnetworkenabled', 'sinogram', 'synthesis', 'method', 'for', 'sparseview', 'ct', 'and', 'show', 'its', 'outperformance', 'to', 'the', 'existing', 'interpolation', 'methods', 'and', 'also', 'to', 'the', 'iterative', 'image', 'reconstruction', 'approach']] | [0.03274196965642096, -0.04187396130596642, -0.10055756736186422, 0.11889814115697629, -0.08157212908069293, -0.16970453686337264, -0.0017789108928159944, 0.4856097768947837, -0.25129678132569616, -0.3371095400458823, 0.20192357428216687, -0.26596762251713135, -0.13308334342131967, 0.23759666506555818, -0.15276138462563504, 0.1550706580999845, 0.11557288002430662, -0.024724931334189716, -0.1236450247857387, -0.28498972275355344, 0.22675878744173264, 0.07187539047750068, 0.3481145674332289, 0.0004305786431013119, 0.09769509379873939, -0.014058674304535435, -0.1043875322343194, 0.023053333588731698, -0.0697613356462517, 0.13285611221189833, 0.358331046003427, 0.22641429295375323, 0.275120961743856, -0.46002492244311033, -0.25215342806630014, 0.13494586252186092, 0.19590129486944838, 0.12053600204290844, -0.1166028947246516, -0.28811455083390075, 0.0975448781253016, -0.1054645309354999, 0.03633805598448297, -0.14087173530493774, -0.0163738521292717, -0.05532572580116158, -0.28377130486478563, 0.06368560901908149, -0.01717931864203863, 0.05282068978496162, -0.07286470620324724, -0.14951545599060842, 0.044049957298002915, 0.1450213288272997, 0.04860980589486038, 0.11530165368458256, 0.1354427168761114, -0.19070151207796743, -0.11729704013088763, 0.32521820395430995, 0.06715016686896325, -0.21779905193086183, 0.18079401983413845, -0.10289011637879801, -0.1455178503002528, 0.23800088481013, 0.18384005655423694, 0.137693186866229, -0.16693897059580887, 0.07213405438891468, 0.016619683941826224, 0.13518082970819836, 0.04569354278473405, -0.01486792336245777, 0.10379860314008381, 0.1843134622488703, 0.01846144641707984, 0.10989897101050398, -0.2009072734245343, -0.0009678041526404698, -0.13340123471183082, -0.1266068975410668, -0.22285333355622633, -0.041271236819392515, -0.043857948385699445, -0.1931347617314064, 0.3967080355921228, 0.22639665845642976, 0.17695062944576853, -0.01593225088990515, 0.4423960524755308, 0.05573385688919751, 0.15088007874908813, 0.02693597507840466, 0.1964374096451571, 0.04646390819522951, 0.12970793236690087, -0.14107827008895887, 0.0871014072839725, 0.08380198172415562] |
1,803.00695 | Low resolution spectroscopy of selected Algol systems | The analysis of spectroscopic data for 30 Algol-type binaries is presented.
All these systems are short period Algols having primaries with spectral types
B and A. Dominant spectral lines were identified for the spectra collected and
their equivalent widths were calculated. All the spectra were examined to
understand presence of mass transfer, a disk or circumstellar matter and
chromospheric emission. We also present first spectroscopic and period study
for few Algols and conclude that high resolution spectra within and outside the
primary minimum are needed for better understanding of these Algol type close
binaries.
| astro-ph.SR | the analysis of spectroscopic data for 30 algoltype binaries is presented all these systems are short period algols having primaries with spectral types b and a dominant spectral lines were identified for the spectra collected and their equivalent widths were calculated all the spectra were examined to understand presence of mass transfer a disk or circumstellar matter and chromospheric emission we also present first spectroscopic and period study for few algols and conclude that high resolution spectra within and outside the primary minimum are needed for better understanding of these algol type close binaries | [['the', 'analysis', 'of', 'spectroscopic', 'data', 'for', '30', 'algoltype', 'binaries', 'is', 'presented', 'all', 'these', 'systems', 'are', 'short', 'period', 'algols', 'having', 'primaries', 'with', 'spectral', 'types', 'b', 'and', 'a', 'dominant', 'spectral', 'lines', 'were', 'identified', 'for', 'the', 'spectra', 'collected', 'and', 'their', 'equivalent', 'widths', 'were', 'calculated', 'all', 'the', 'spectra', 'were', 'examined', 'to', 'understand', 'presence', 'of', 'mass', 'transfer', 'a', 'disk', 'or', 'circumstellar', 'matter', 'and', 'chromospheric', 'emission', 'we', 'also', 'present', 'first', 'spectroscopic', 'and', 'period', 'study', 'for', 'few', 'algols', 'and', 'conclude', 'that', 'high', 'resolution', 'spectra', 'within', 'and', 'outside', 'the', 'primary', 'minimum', 'are', 'needed', 'for', 'better', 'understanding', 'of', 'these', 'algol', 'type', 'close', 'binaries']] | [-0.09795340759174383, 0.11198153582084527, -0.0074553668023423945, 0.1326021704627102, -0.06781519978416171, -0.13364131394971876, 0.02401930745443369, 0.4421952303295876, -0.16266171269594354, -0.3858392032586593, 0.09694289311548655, -0.33016059337124387, -0.02673387019449171, 0.2212102570387713, -0.02334584891449343, 0.022608671411673758, 0.1465530196759612, -0.023289089735121803, -0.06202295893757416, -0.22488914183440042, 0.31894404835939566, 0.05125323301577504, 0.12244545149200774, -0.02557374421133105, -0.013320770995205943, -0.02734480808152163, -0.1075882713088736, -0.03825574968644279, -0.1501678498738174, 0.07616138095878303, 0.22883394006837873, 0.13411047718824542, 0.17406840104253052, -0.3142606174038287, -0.2193602240307534, 0.05157236906481867, 0.18024863810972014, 0.023629623217547826, -0.02527536365124298, -0.20797525044094692, 0.1580160240880511, -0.1749076304085394, -0.13980543828430644, -0.04368685863595059, 0.07945842641663362, 0.07492567496399019, -0.2033560415234496, 0.07921002187210066, 0.015082071796604531, 0.16175655170561784, -0.17238129031636376, -0.16432679554526794, -0.0684626217426217, 0.13817866180746002, 0.026591697180187925, -0.020434059987855243, 0.08841354138851959, -0.0557536591597377, -0.056827566447727226, 0.37725954094624264, -0.06783388721499037, -0.016011607674683664, 0.24972617111981232, -0.20070728131550106, -0.138716509154542, 0.18921889116036447, 0.15971202995291256, 0.14935116948896743, -0.18588809937639955, -0.05421337874561667, 0.037477215464682655, 0.21085782872545136, 0.07128770355422526, 0.10929054024064556, 0.32663648484393637, 0.09953148228096519, -0.06897810171358287, 0.07801360504496149, -0.21267556131599433, -0.044953999510827534, -0.25796231055914604, -0.10020632624745052, -0.10113569528627347, 0.057831973638732305, -0.05440663908109158, -0.12305643030521558, 0.38071476117252034, 0.05589168112071112, 0.2191182360043155, 0.027944223719966063, 0.25205052978894177, 0.1052295559165167, 0.07314522336503401, 0.0937912383740966, 0.3048938286114246, 0.1897411538198828, 0.12663660673028293, -0.2258538678536152, 0.03416535258293152, -0.020188841428805854] |
1,803.00696 | Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics | In this paper, we show that a qutrit version of ZX-calculus, with rules
significantly different from that of the qubit version, is complete for pure
qutrit stabilizer quantum mechanics, where state preparations and measurements
are based on the three dimensional computational basis, and unitary operations
are required to be in the generalized Clifford group. This means that any
equation of diagrams that holds true under the standard interpretation in
Hilbert spaces can be derived diagrammatically. In contrast to the qubit case,
the situation here is more complicated due to the richer structure of this
qutrit ZX-calculus.
| quant-ph | in this paper we show that a qutrit version of zxcalculus with rules significantly different from that of the qubit version is complete for pure qutrit stabilizer quantum mechanics where state preparations and measurements are based on the three dimensional computational basis and unitary operations are required to be in the generalized clifford group this means that any equation of diagrams that holds true under the standard interpretation in hilbert spaces can be derived diagrammatically in contrast to the qubit case the situation here is more complicated due to the richer structure of this qutrit zxcalculus | [['in', 'this', 'paper', 'we', 'show', 'that', 'a', 'qutrit', 'version', 'of', 'zxcalculus', 'with', 'rules', 'significantly', 'different', 'from', 'that', 'of', 'the', 'qubit', 'version', 'is', 'complete', 'for', 'pure', 'qutrit', 'stabilizer', 'quantum', 'mechanics', 'where', 'state', 'preparations', 'and', 'measurements', 'are', 'based', 'on', 'the', 'three', 'dimensional', 'computational', 'basis', 'and', 'unitary', 'operations', 'are', 'required', 'to', 'be', 'in', 'the', 'generalized', 'clifford', 'group', 'this', 'means', 'that', 'any', 'equation', 'of', 'diagrams', 'that', 'holds', 'true', 'under', 'the', 'standard', 'interpretation', 'in', 'hilbert', 'spaces', 'can', 'be', 'derived', 'diagrammatically', 'in', 'contrast', 'to', 'the', 'qubit', 'case', 'the', 'situation', 'here', 'is', 'more', 'complicated', 'due', 'to', 'the', 'richer', 'structure', 'of', 'this', 'qutrit', 'zxcalculus']] | [-0.0787855646076423, 0.15845142644441998, -0.08767462188067536, 0.05837570364989612, -0.04262847998082483, -0.1860924873762997, 0.04138108886521271, 0.3498413992541221, -0.2327399413237193, -0.23834525741403922, 0.06633732638996055, -0.21434309465500215, -0.15748555835064812, 0.2338687669932066, -0.10936338354076724, 0.04556515378499171, 0.1048119157809803, 0.051502387150928065, -0.1451121091886307, -0.2778539397719821, 0.3666142906489161, -0.005233662865066435, 0.27685361706244294, -0.03281533253721136, 0.0603306847527468, 0.043154759531413824, 0.05453693560169389, 0.02761597285280004, -0.06960386220362125, 0.1286487322922767, 0.28130920848828583, 0.14605826868501026, 0.1862979973690623, -0.4574346811665843, -0.17087255473597907, 0.13077904649496, 0.09374206210486591, 0.15923457276464129, 0.0286585999909524, -0.3015686082968993, 0.05949274106145216, -0.19268813234521076, -0.08888366651566078, -0.1319328513830745, 0.0002298092246443654, -0.10523345268059832, -0.24296087870425254, 0.07476587956140672, 0.09339431290330442, 0.05925842660750883, -0.02190240809189466, -0.0598946028330829, -0.012161531424984181, 0.08004293201762873, -0.10071386956769857, 0.005595195034402423, 0.11204574655857868, -0.1088869571331846, -0.16608073617195865, 0.3943951885448769, -0.020852010434585583, -0.2860976778223024, 0.14328655252757017, -0.16118547725879276, -0.16775851517134774, 0.046634521471181266, 0.07117127737728879, 0.0963847472400327, -0.14800432473869782, 0.1221456305635608, -0.08283668031799607, 0.19427729801585278, 0.0525938251550239, 0.10060947010060772, 0.09516108134266688, 0.09657670074375346, 0.06619100135867484, 0.1783947367099851, -0.0068420899551711045, -0.14936003967098563, -0.362952085910365, -0.22755201668284522, -0.18064883369030818, 0.10543860056592773, -0.05069627230932383, -0.12328000758619358, 0.38889179528147605, 0.13727664994742858, 0.11922570078483356, 0.025840480496602442, 0.2880659019962574, 0.14137934962127474, 0.06281407406398405, 0.06033488597798472, 0.20159247431729455, 0.18150711824030927, 0.011507437608088367, -0.17433158771746093, 0.03645248577474073, 0.07704565887494634] |
1,803.00697 | Common Denominator for Value and Expectation No-go Theorems: Extended
Abstract | Hidden-variable (HV) theories allege that a quantum state describes an
ensemble of systems distinguished by the values of hidden variables. No-go
theorems assert that HV theories cannot match the predictions of quantum
theory. The present work started with repairing flaws in the literature on
no-go theorems asserting that HV theories cannot predict the expectation values
of measurements. That literature gives one an impression that expectation no-go
theorems subsume the time-honored no-go theorems asserting that HV theories
cannot predict the possible values of measurements. But the two approaches
speak about different kinds of measurement. This hinders comparing them to each
other. Only projection measurements are common to both. Here, we sharpen the
results of both approaches so that only projection measurements are used. This
allows us to clarify the similarities and differences between the two
approaches. Neither one dominates the other.
| quant-ph cs.LO | hiddenvariable hv theories allege that a quantum state describes an ensemble of systems distinguished by the values of hidden variables nogo theorems assert that hv theories cannot match the predictions of quantum theory the present work started with repairing flaws in the literature on nogo theorems asserting that hv theories cannot predict the expectation values of measurements that literature gives one an impression that expectation nogo theorems subsume the timehonored nogo theorems asserting that hv theories cannot predict the possible values of measurements but the two approaches speak about different kinds of measurement this hinders comparing them to each other only projection measurements are common to both here we sharpen the results of both approaches so that only projection measurements are used this allows us to clarify the similarities and differences between the two approaches neither one dominates the other | [['hiddenvariable', 'hv', 'theories', 'allege', 'that', 'a', 'quantum', 'state', 'describes', 'an', 'ensemble', 'of', 'systems', 'distinguished', 'by', 'the', 'values', 'of', 'hidden', 'variables', 'nogo', 'theorems', 'assert', 'that', 'hv', 'theories', 'can', 'not', 'match', 'the', 'predictions', 'of', 'quantum', 'theory', 'the', 'present', 'work', 'started', 'with', 'repairing', 'flaws', 'in', 'the', 'literature', 'on', 'nogo', 'theorems', 'asserting', 'that', 'hv', 'theories', 'can', 'not', 'predict', 'the', 'expectation', 'values', 'of', 'measurements', 'that', 'literature', 'gives', 'one', 'an', 'impression', 'that', 'expectation', 'nogo', 'theorems', 'subsume', 'the', 'timehonored', 'nogo', 'theorems', 'asserting', 'that', 'hv', 'theories', 'can', 'not', 'predict', 'the', 'possible', 'values', 'of', 'measurements', 'but', 'the', 'two', 'approaches', 'speak', 'about', 'different', 'kinds', 'of', 'measurement', 'this', 'hinders', 'comparing', 'them', 'to', 'each', 'other', 'only', 'projection', 'measurements', 'are', 'common', 'to', 'both', 'here', 'we', 'sharpen', 'the', 'results', 'of', 'both', 'approaches', 'so', 'that', 'only', 'projection', 'measurements', 'are', 'used', 'this', 'allows', 'us', 'to', 'clarify', 'the', 'similarities', 'and', 'differences', 'between', 'the', 'two', 'approaches', 'neither', 'one', 'dominates', 'the', 'other']] | [-0.08897176924863384, 0.10780743295576876, -0.13599951755793266, 0.0885347360638495, -0.08662145214916116, -0.2115031706634909, 0.06972477741418144, 0.31707606754514955, -0.216705864844647, -0.2874152645875346, 0.07850427578882196, -0.3019706168898396, -0.10406737948741607, 0.1886494896656663, -0.12713646704108048, 0.0165931771284512, 0.061341212035163344, 0.007553919303742513, -0.11596731418082949, -0.2553808571685525, 0.3102675512839686, -0.028648292312962592, 0.30631329565190935, 0.03609695149139619, 0.062483714161355466, -0.002739955011991338, -0.03515824773283282, 0.04725934996541826, -0.11339615489712639, 0.10918555290825192, 0.25715086330712156, 0.14660535874435496, 0.25029621968163884, -0.445367546857033, -0.21989341028375733, 0.1497580297389658, 0.09175205971179924, 0.14788558664338164, 0.02961857978526739, -0.26261372601901983, 0.0817802097012197, -0.1314663642461569, -0.12557299521876317, -0.11346340867441515, -0.03189981914728775, -0.03249157665782726, -0.2110705454407496, 0.06548445844288234, 0.11280627538036869, 0.0028916497937810253, -0.06828494968661764, -0.12569298379022373, 0.0027258108684819348, 0.13302001273128347, 0.08585432782100225, -0.011704555159257593, 0.14133437369084378, -0.1331714766204987, -0.2314914792487529, 0.31448689768169547, -0.04863678212736694, -0.17444798773733414, 0.2360762626959116, -0.137176202388782, -0.19800164829939604, 0.037421259491271536, 0.017929280763754333, 0.11433543266833458, -0.1317435257121655, 0.0613557105096103, -0.07868392752404783, 0.1639563653873883, 0.07762855588143665, 0.06381832173710662, 0.21958954869703928, 0.014660192824060649, 0.021443061766700005, 0.042362526691236704, -0.04496814931671522, -0.14809250865749765, -0.35781334652106317, -0.14537145713882021, -0.14039258105831195, 0.04569199654207283, -0.07030994592807961, -0.12627197628919506, 0.3367615513549462, 0.26167578366585076, 0.18936229529003548, 0.06678716894927841, 0.2737968927774001, 0.09574216315981893, 0.09183546904110494, 0.02851339344355002, 0.3091219079575803, 0.1800035533288651, 0.0728526605706347, -0.14459630016329317, 0.10266832480515341, 0.06191282352091561] |
1,803.00698 | Next Steps for the Colorado Risk-Limiting Audit (CORLA) Program | Colorado conducted risk-limiting tabulation audits (RLAs) across the state in
2017, including both ballot-level comparison audits and ballot-polling audits.
Those audits only covered contests restricted to a single county; methods to
efficiently audit contests that cross county boundaries and combine ballot
polling and ballot-level comparisons have not been available.
Colorado's current audit software (RLATool) needs to be improved to audit
these contests that cross county lines and to audit small contests efficiently.
This paper addresses these needs. It presents extremely simple but
inefficient methods, more efficient methods that combine ballot polling and
ballot-level comparisons using stratified samples, and methods that combine
ballot-level comparison and variable-size batch comparison audits in a way that
does not require stratified sampling.
We conclude with some recommendations, and illustrate our recommended method
using examples that compare them to existing approaches. Exemplar open-source
code and interactive Jupyter notebooks are provided that implement the methods
and allow further exploration.
| stat.AP stat.ME | colorado conducted risklimiting tabulation audits rlas across the state in 2017 including both ballotlevel comparison audits and ballotpolling audits those audits only covered contests restricted to a single county methods to efficiently audit contests that cross county boundaries and combine ballot polling and ballotlevel comparisons have not been available colorados current audit software rlatool needs to be improved to audit these contests that cross county lines and to audit small contests efficiently this paper addresses these needs it presents extremely simple but inefficient methods more efficient methods that combine ballot polling and ballotlevel comparisons using stratified samples and methods that combine ballotlevel comparison and variablesize batch comparison audits in a way that does not require stratified sampling we conclude with some recommendations and illustrate our recommended method using examples that compare them to existing approaches exemplar opensource code and interactive jupyter notebooks are provided that implement the methods and allow further exploration | [['colorado', 'conducted', 'risklimiting', 'tabulation', 'audits', 'rlas', 'across', 'the', 'state', 'in', '2017', 'including', 'both', 'ballotlevel', 'comparison', 'audits', 'and', 'ballotpolling', 'audits', 'those', 'audits', 'only', 'covered', 'contests', 'restricted', 'to', 'a', 'single', 'county', 'methods', 'to', 'efficiently', 'audit', 'contests', 'that', 'cross', 'county', 'boundaries', 'and', 'combine', 'ballot', 'polling', 'and', 'ballotlevel', 'comparisons', 'have', 'not', 'been', 'available', 'colorados', 'current', 'audit', 'software', 'rlatool', 'needs', 'to', 'be', 'improved', 'to', 'audit', 'these', 'contests', 'that', 'cross', 'county', 'lines', 'and', 'to', 'audit', 'small', 'contests', 'efficiently', 'this', 'paper', 'addresses', 'these', 'needs', 'it', 'presents', 'extremely', 'simple', 'but', 'inefficient', 'methods', 'more', 'efficient', 'methods', 'that', 'combine', 'ballot', 'polling', 'and', 'ballotlevel', 'comparisons', 'using', 'stratified', 'samples', 'and', 'methods', 'that', 'combine', 'ballotlevel', 'comparison', 'and', 'variablesize', 'batch', 'comparison', 'audits', 'in', 'a', 'way', 'that', 'does', 'not', 'require', 'stratified', 'sampling', 'we', 'conclude', 'with', 'some', 'recommendations', 'and', 'illustrate', 'our', 'recommended', 'method', 'using', 'examples', 'that', 'compare', 'them', 'to', 'existing', 'approaches', 'exemplar', 'opensource', 'code', 'and', 'interactive', 'jupyter', 'notebooks', 'are', 'provided', 'that', 'implement', 'the', 'methods', 'and', 'allow', 'further', 'exploration']] | [-0.00871124091142501, -0.006806274640823921, -0.10868112951354593, 0.1214785317369993, -0.15296113591066143, -0.22785075939566696, 0.15185607368229645, 0.46599798204514803, -0.17008344250287386, -0.34843897939528395, 0.13623693961831398, -0.32454307203887395, -0.1024142721489747, 0.22383411192403943, -0.13542802914377028, 0.06966669917819183, 0.16854118086685171, -0.09726419769408769, 0.020667994074560953, -0.36450902078278835, 0.23706986081330167, 0.06660814974894559, 0.31108801113129064, 0.005653964243079192, 0.04534288968003336, 0.013419863561265196, -0.12726443976901422, 0.051629639124410265, -0.14072664608355984, 0.14977159705513077, 0.38464778809551925, 0.21364187427183876, 0.3345525705836863, -0.4414771767895694, -0.11999521071978864, 0.036558262864752805, 0.14912217087112367, 0.08423813424954478, -0.039996707413971405, -0.2775950436917877, 0.04899848594045854, -0.2673955103194954, -0.023225394783904087, -0.17092799947240808, -0.05250110686834802, 0.04656447441904687, -0.28386055102459334, 0.0030565022787035464, -0.012034914945408502, 0.08460872368762057, -0.015387929740030594, -0.1675712324385125, 0.025428729489658203, 0.15542232621720548, 0.014876269972914417, -0.009177410134408098, 0.13911361993921784, -0.0668135919739436, -0.17958099067511174, 0.32274068501971714, 0.015998885340226077, -0.1527456464863151, 0.24200025678381024, -0.020582262792268255, -0.16472672464188515, 0.07931898840122556, 0.20826274554101412, 0.13226999355880106, -0.1512105924283598, 0.0152814013331866, -0.04657537318397338, 0.1909329448389077, 0.046788507822475976, -0.08412401990233702, 0.11944196042456295, 0.1282085867086113, 0.03330303202133201, 0.08327433712047606, -0.04381074552481288, -0.1296114953096695, -0.21568816939006316, -0.11849683088925511, -0.11512078628906568, -0.038509627090237294, -0.016239056862764147, -0.17022525565386218, 0.2848887631307112, 0.25571056235981665, 0.1106037270346494, 0.06476935817553012, 0.37392812719781127, -0.040876220442173414, 0.08852023772595313, 0.15031227917604198, 0.13701913541830582, -0.018220101573798282, 0.13053245108649636, -0.10965757261674176, 0.1252328963378357, -0.010768266515251586] |
1,803.00699 | QWIRE Practice: Formal Verification of Quantum Circuits in Coq | We describe an embedding of the QWIRE quantum circuit language in the Coq
proof assistant. This allows programmers to write quantum circuits using
high-level abstractions and to prove properties of those circuits using Coq's
theorem proving features. The implementation uses higher-order abstract syntax
to represent variable binding and provides a type-checking algorithm for linear
wire types, ensuring that quantum circuits are well-formed. We formalize a
denotational semantics that interprets QWIRE circuits as superoperators on
density matrices, and prove the correctness of some simple quantum programs.
| cs.LO cs.ET cs.PL | we describe an embedding of the qwire quantum circuit language in the coq proof assistant this allows programmers to write quantum circuits using highlevel abstractions and to prove properties of those circuits using coqs theorem proving features the implementation uses higherorder abstract syntax to represent variable binding and provides a typechecking algorithm for linear wire types ensuring that quantum circuits are wellformed we formalize a denotational semantics that interprets qwire circuits as superoperators on density matrices and prove the correctness of some simple quantum programs | [['we', 'describe', 'an', 'embedding', 'of', 'the', 'qwire', 'quantum', 'circuit', 'language', 'in', 'the', 'coq', 'proof', 'assistant', 'this', 'allows', 'programmers', 'to', 'write', 'quantum', 'circuits', 'using', 'highlevel', 'abstractions', 'and', 'to', 'prove', 'properties', 'of', 'those', 'circuits', 'using', 'coqs', 'theorem', 'proving', 'features', 'the', 'implementation', 'uses', 'higherorder', 'abstract', 'syntax', 'to', 'represent', 'variable', 'binding', 'and', 'provides', 'a', 'typechecking', 'algorithm', 'for', 'linear', 'wire', 'types', 'ensuring', 'that', 'quantum', 'circuits', 'are', 'wellformed', 'we', 'formalize', 'a', 'denotational', 'semantics', 'that', 'interprets', 'qwire', 'circuits', 'as', 'superoperators', 'on', 'density', 'matrices', 'and', 'prove', 'the', 'correctness', 'of', 'some', 'simple', 'quantum', 'programs']] | [-0.13223194811931427, 0.01647529326095109, -0.12188216113649747, 0.11969526569386396, -0.1522965122233419, -0.22197345785577507, 0.05004843753926894, 0.3703746147275738, -0.3060354217339088, -0.2877250672537176, 0.003935650269062642, -0.2305737444283509, -0.1447452973560704, 0.22517133866546346, -0.12352419066078522, 0.11030490859685575, 0.047679536756785476, 0.0037043758722789147, -0.04434699027470368, -0.22150030256632497, 0.25222557314178523, -0.04106370178325211, 0.21852073478786385, 0.04200915547416491, 0.10586615826058036, 0.02836151043062701, 0.0380693379077403, -0.03654249181340942, -0.08124175426526242, 0.174197567955536, 0.3811843378633699, 0.2526501666042296, 0.26204199002069584, -0.5011515403851209, -0.08851112062659333, -0.0038980967091286883, 0.07077235031106016, 0.190228487397818, 0.014499780928770847, -0.32900551775579945, 0.10763235606034012, -0.1693780718919109, -0.06852910884053391, -0.18600520996020778, -0.007987823123660158, 0.004587264471303891, -0.18377690695308369, -0.09234991176053882, 0.21353556702790014, 0.12539842947769692, 0.023206543850520737, -0.06520235396319014, 0.015100616139962393, 0.09176910907399896, -0.15874122773461483, -0.03730350257280995, 0.18347069324706408, -0.07238627106006093, -0.2386537696070531, 0.31685997466830645, -0.02069298448588918, -0.18369215096840086, 0.17758078594856402, 0.03357218128683812, -0.17921408073264447, 0.023973744192763286, 0.12165391350931981, 0.0624229684307733, -0.16168414752053864, 0.1686405353665845, -0.005585835859015145, 0.2697730252847952, 0.11585427230388365, 0.10911540038719335, 0.1511208218686721, 0.1618254679309971, 0.030067060833029888, 0.2052037779132233, 0.08555597594172201, -0.11001192115466385, -0.34641136115088184, -0.25735557563602923, -0.13081624014577006, 0.03349698067040128, -0.08266683204376879, -0.24591114523765795, 0.3837923197185292, 0.19012315674849292, 0.09006602229440913, 0.22169768034535295, 0.3118087085073485, 0.13078327117460398, 0.10957200477338012, 0.11226750580210458, 0.07292156002402087, 0.202757975327618, 0.10555112424909192, -0.15674234854386132, 0.12038846326827565, 0.14942080077496084] |
1,803.007 | Double Dilation $\neq$ Double Mixing (extended abstract) | Density operators are one of the key ingredients of quantum theory. They can
be constructed in two ways: via a convex sum of 'doubled kets' (i.e. mixing),
and by tracing out part of a 'doubled' two-system ket (i.e. dilation). Both
constructions can be iterated, yielding new mathematical species that have
already found applications outside physics. However, as we show in this paper,
the iterated constructions no longer yield the same mathematical species.
Hence, the constructions 'mixing' and 'dilation' themselves are by no means
equivalent. Concretely, when applying the Choi-Jamiolkowski isomorphism to the
second iteration, dilation produces arbitrary symmetric bipartite states, while
mixing only yields the disentangled ones. All results are proven using
diagrams, and hence they hold not only for quantum theory, but also for a much
more general class of process theories.
| quant-ph math.CT | density operators are one of the key ingredients of quantum theory they can be constructed in two ways via a convex sum of doubled kets ie mixing and by tracing out part of a doubled twosystem ket ie dilation both constructions can be iterated yielding new mathematical species that have already found applications outside physics however as we show in this paper the iterated constructions no longer yield the same mathematical species hence the constructions mixing and dilation themselves are by no means equivalent concretely when applying the choijamiolkowski isomorphism to the second iteration dilation produces arbitrary symmetric bipartite states while mixing only yields the disentangled ones all results are proven using diagrams and hence they hold not only for quantum theory but also for a much more general class of process theories | [['density', 'operators', 'are', 'one', 'of', 'the', 'key', 'ingredients', 'of', 'quantum', 'theory', 'they', 'can', 'be', 'constructed', 'in', 'two', 'ways', 'via', 'a', 'convex', 'sum', 'of', 'doubled', 'kets', 'ie', 'mixing', 'and', 'by', 'tracing', 'out', 'part', 'of', 'a', 'doubled', 'twosystem', 'ket', 'ie', 'dilation', 'both', 'constructions', 'can', 'be', 'iterated', 'yielding', 'new', 'mathematical', 'species', 'that', 'have', 'already', 'found', 'applications', 'outside', 'physics', 'however', 'as', 'we', 'show', 'in', 'this', 'paper', 'the', 'iterated', 'constructions', 'no', 'longer', 'yield', 'the', 'same', 'mathematical', 'species', 'hence', 'the', 'constructions', 'mixing', 'and', 'dilation', 'themselves', 'are', 'by', 'no', 'means', 'equivalent', 'concretely', 'when', 'applying', 'the', 'choijamiolkowski', 'isomorphism', 'to', 'the', 'second', 'iteration', 'dilation', 'produces', 'arbitrary', 'symmetric', 'bipartite', 'states', 'while', 'mixing', 'only', 'yields', 'the', 'disentangled', 'ones', 'all', 'results', 'are', 'proven', 'using', 'diagrams', 'and', 'hence', 'they', 'hold', 'not', 'only', 'for', 'quantum', 'theory', 'but', 'also', 'for', 'a', 'much', 'more', 'general', 'class', 'of', 'process', 'theories']] | [-0.07801969210758168, 0.21131394969131378, -0.08755597134673954, 0.10616672034618539, -0.03354712481666496, -0.18535082376933187, 0.014454543745474316, 0.35151554916502165, -0.26250583274444017, -0.2724311875662577, 0.1162706620052905, -0.23252692192624835, -0.16376930991488797, 0.21118875882147173, -0.06208642241474997, 0.017695231500599897, 0.053955049516591136, 0.044641146772450076, -0.1033776759106974, -0.27262772545148445, 0.31473213801846694, -0.0009535114312390412, 0.2329071900506217, 0.023910449901805783, 0.06431665530960474, -0.009317242673465185, -0.06386105308337207, 0.055183156897643006, -0.07928289957476922, 0.10619288378113292, 0.275545705864346, 0.13037531479686118, 0.22084308853302909, -0.4165440994293842, -0.2092674684717803, 0.1256971430572632, 0.1644630518153702, 0.12801583492918348, -0.03253418432526322, -0.2579641226062873, 0.04929587215577301, -0.15593370092206432, -0.10525856844912794, -0.114750928956231, 0.007078347860702446, -0.03259755669755133, -0.2618464845358709, 0.03199151423702864, 0.11616237006146685, 0.044918463430612496, 0.0015507852473721623, -0.11153154991675672, -0.04506972919855463, 0.13293854083408096, 0.0010563515936798254, -0.007006140597360699, 0.09903618872263714, -0.09663702325573317, -0.1536282929451786, 0.3827122471442348, -0.03520845042198504, -0.2308857332971087, 0.18136083229954347, -0.12123531298501823, -0.1643517343835079, 0.11920934154203904, 0.05810063420571702, 0.1320212904601953, -0.1497184274131931, 0.10211950695164908, -0.0678738400986054, 0.1323102648344584, 0.1315189745186135, 0.08081299208036337, 0.17087777317466593, 0.04395952197036853, 0.09729861709835443, 0.11235856653464243, 0.047363410926164876, -0.1662001399449388, -0.3227711274407636, -0.15155243000393748, -0.1402456812513292, 0.07173495591432993, -0.07251845185237471, -0.14782052853624372, 0.35807709348268973, 0.0797274213685143, 0.15810544185644135, 0.09373407132391419, 0.25565615418206034, 0.12325404831505891, 0.11774677704998705, 0.06886859913181542, 0.23289433944641255, 0.15616628888791384, 0.017409559425064607, -0.1366100255353989, 0.0762864187048202, 0.11595504352633834] |
1,803.00701 | CLX: Towards verifiable PBE data transformation | Effective data analytics on data collected from the real world usually begins
with a notoriously expensive pre-processing step of data transformation and
wrangling. Programming By Example (PBE) systems have been proposed to
automatically infer transformations using simple examples that users provide as
hints. However, an important usability issue - verification - limits the
effective use of such PBE data transformation systems, since the verification
process is often effort-consuming and unreliable. We propose a data
transformation paradigm design CLX (pronounced "clicks") with a focus on
facilitating verification for end users in a PBE-like data transformation. CLX
performs pattern clustering in both input and output data, which allows the
user to verify at the pattern level, rather than the data instance level,
without having to write any regular expressions, thereby significantly reducing
user verification effort. Thereafter, CLX automatically generates
transformation programs as regular-expression replace operations that are easy
for average users to verify. We experimentally compared the CLX prototype with
both FlashFill, a state-of-the-art PBE data transformation tool, and Trifacta,
an influential system supporting interactive data transformation. The results
show improvements over the state of the art tools in saving user verification
effort, without loss of efficiency or expressive power. In a user effort study
on data sets of various sizes, when the data size grew by a factor of 30, the
user verification time required by the CLX prototype grew by 1.3x whereas that
required by FlashFill grew by 11.4x. In another test assessing the users'
understanding of the transformation logic - a key ingredient in effective
verification - CLX users achieved a success rate about twice that of FlashFill
users.
| cs.DB | effective data analytics on data collected from the real world usually begins with a notoriously expensive preprocessing step of data transformation and wrangling programming by example pbe systems have been proposed to automatically infer transformations using simple examples that users provide as hints however an important usability issue verification limits the effective use of such pbe data transformation systems since the verification process is often effortconsuming and unreliable we propose a data transformation paradigm design clx pronounced clicks with a focus on facilitating verification for end users in a pbelike data transformation clx performs pattern clustering in both input and output data which allows the user to verify at the pattern level rather than the data instance level without having to write any regular expressions thereby significantly reducing user verification effort thereafter clx automatically generates transformation programs as regularexpression replace operations that are easy for average users to verify we experimentally compared the clx prototype with both flashfill a stateoftheart pbe data transformation tool and trifacta an influential system supporting interactive data transformation the results show improvements over the state of the art tools in saving user verification effort without loss of efficiency or expressive power in a user effort study on data sets of various sizes when the data size grew by a factor of 30 the user verification time required by the clx prototype grew by 13x whereas that required by flashfill grew by 114x in another test assessing the users understanding of the transformation logic a key ingredient in effective verification clx users achieved a success rate about twice that of flashfill users | [['effective', 'data', 'analytics', 'on', 'data', 'collected', 'from', 'the', 'real', 'world', 'usually', 'begins', 'with', 'a', 'notoriously', 'expensive', 'preprocessing', 'step', 'of', 'data', 'transformation', 'and', 'wrangling', 'programming', 'by', 'example', 'pbe', 'systems', 'have', 'been', 'proposed', 'to', 'automatically', 'infer', 'transformations', 'using', 'simple', 'examples', 'that', 'users', 'provide', 'as', 'hints', 'however', 'an', 'important', 'usability', 'issue', 'verification', 'limits', 'the', 'effective', 'use', 'of', 'such', 'pbe', 'data', 'transformation', 'systems', 'since', 'the', 'verification', 'process', 'is', 'often', 'effortconsuming', 'and', 'unreliable', 'we', 'propose', 'a', 'data', 'transformation', 'paradigm', 'design', 'clx', 'pronounced', 'clicks', 'with', 'a', 'focus', 'on', 'facilitating', 'verification', 'for', 'end', 'users', 'in', 'a', 'pbelike', 'data', 'transformation', 'clx', 'performs', 'pattern', 'clustering', 'in', 'both', 'input', 'and', 'output', 'data', 'which', 'allows', 'the', 'user', 'to', 'verify', 'at', 'the', 'pattern', 'level', 'rather', 'than', 'the', 'data', 'instance', 'level', 'without', 'having', 'to', 'write', 'any', 'regular', 'expressions', 'thereby', 'significantly', 'reducing', 'user', 'verification', 'effort', 'thereafter', 'clx', 'automatically', 'generates', 'transformation', 'programs', 'as', 'regularexpression', 'replace', 'operations', 'that', 'are', 'easy', 'for', 'average', 'users', 'to', 'verify', 'we', 'experimentally', 'compared', 'the', 'clx', 'prototype', 'with', 'both', 'flashfill', 'a', 'stateoftheart', 'pbe', 'data', 'transformation', 'tool', 'and', 'trifacta', 'an', 'influential', 'system', 'supporting', 'interactive', 'data', 'transformation', 'the', 'results', 'show', 'improvements', 'over', 'the', 'state', 'of', 'the', 'art', 'tools', 'in', 'saving', 'user', 'verification', 'effort', 'without', 'loss', 'of', 'efficiency', 'or', 'expressive', 'power', 'in', 'a', 'user', 'effort', 'study', 'on', 'data', 'sets', 'of', 'various', 'sizes', 'when', 'the', 'data', 'size', 'grew', 'by', 'a', 'factor', 'of', '30', 'the', 'user', 'verification', 'time', 'required', 'by', 'the', 'clx', 'prototype', 'grew', 'by', '13x', 'whereas', 'that', 'required', 'by', 'flashfill', 'grew', 'by', '114x', 'in', 'another', 'test', 'assessing', 'the', 'users', 'understanding', 'of', 'the', 'transformation', 'logic', 'a', 'key', 'ingredient', 'in', 'effective', 'verification', 'clx', 'users', 'achieved', 'a', 'success', 'rate', 'about', 'twice', 'that', 'of', 'flashfill', 'users']] | [-0.10275488768908844, -0.004925952179980937, -0.07276799302384131, 0.07743523179210295, -0.12135124158830325, -0.1791136634260924, 0.1003503201416496, 0.37117091895947163, -0.2236240102846006, -0.3768265189431104, 0.12710809536193582, -0.2803802148176725, -0.11925139079914626, 0.21538396037243673, -0.07191403852123061, 0.08897105768008975, 0.10306546792509669, 0.03238948097174271, -0.07215830771592939, -0.2867119482446772, 0.2773024562550497, 0.10086103885745008, 0.3515474907277773, -0.00311451874211233, 0.07085525513111586, 0.03690686780310264, -0.05569908114116653, -0.02125108804620774, -0.05964375259744967, 0.1175375589677556, 0.33647243305908475, 0.2293666316483833, 0.30835759736047214, -0.43070620049327385, -0.15377543810852026, 0.028562455279990736, 0.11447244879408655, 0.08450041041280863, -0.07860980434766547, -0.2988242488222154, 0.09891529878509711, -0.18622015572371753, -0.05448289654238827, -0.12034199880894669, 0.012581631780476804, -0.022433192936163818, -0.2820706450112277, -0.012374749950002737, 0.05782630055645396, 0.10795749237612737, -0.0006739904428920427, -0.07589190641804387, -0.00983843946067447, 0.14775084444221592, 0.03700964918673642, 0.039021714488405974, 0.16025551697274557, -0.12680554111791548, -0.13036098222690987, 0.3868986968317944, -0.039503013917386524, -0.17548782933524557, 0.16569158329123942, -0.050764415097849756, -0.13806195353214262, 0.14893546141595862, 0.19165534371418427, 0.07423965751072639, -0.16655575245501744, 0.04651542424107902, 0.012631438309185658, 0.2480328390868663, 0.06730037483573666, -0.011515373425826318, 0.1610266001909181, 0.2098296428280953, 0.04224695668248883, 0.13358084527223554, -0.013121930968654024, -0.05071624461870118, -0.22415081780292728, -0.14898748663218805, -0.1627577388038238, -0.006306008470181207, -0.09629275087354472, -0.09169072968440807, 0.3640537689348231, 0.1749791051437514, 0.18006694164818549, 0.10188526591214626, 0.34865369632219273, 0.07093046817339421, 0.12178833137802554, 0.08208541061674512, 0.1292839621047747, 0.012598913041239774, 0.14804590197066622, -0.17351002005439528, 0.11855175542631045, 0.005294020961159593] |
1,803.00702 | Raw Multi-Channel Audio Source Separation using Multi-Resolution
Convolutional Auto-Encoders | Supervised multi-channel audio source separation requires extracting useful
spectral, temporal, and spatial features from the mixed signals. The success of
many existing systems is therefore largely dependent on the choice of features
used for training. In this work, we introduce a novel multi-channel,
multi-resolution convolutional auto-encoder neural network that works on raw
time-domain signals to determine appropriate multi-resolution features for
separating the singing-voice from stereo music. Our experimental results show
that the proposed method can achieve multi-channel audio source separation
without the need for hand-crafted features or any pre- or post-processing.
| cs.SD cs.CV cs.LG cs.MM | supervised multichannel audio source separation requires extracting useful spectral temporal and spatial features from the mixed signals the success of many existing systems is therefore largely dependent on the choice of features used for training in this work we introduce a novel multichannel multiresolution convolutional autoencoder neural network that works on raw timedomain signals to determine appropriate multiresolution features for separating the singingvoice from stereo music our experimental results show that the proposed method can achieve multichannel audio source separation without the need for handcrafted features or any pre or postprocessing | [['supervised', 'multichannel', 'audio', 'source', 'separation', 'requires', 'extracting', 'useful', 'spectral', 'temporal', 'and', 'spatial', 'features', 'from', 'the', 'mixed', 'signals', 'the', 'success', 'of', 'many', 'existing', 'systems', 'is', 'therefore', 'largely', 'dependent', 'on', 'the', 'choice', 'of', 'features', 'used', 'for', 'training', 'in', 'this', 'work', 'we', 'introduce', 'a', 'novel', 'multichannel', 'multiresolution', 'convolutional', 'autoencoder', 'neural', 'network', 'that', 'works', 'on', 'raw', 'timedomain', 'signals', 'to', 'determine', 'appropriate', 'multiresolution', 'features', 'for', 'separating', 'the', 'singingvoice', 'from', 'stereo', 'music', 'our', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'method', 'can', 'achieve', 'multichannel', 'audio', 'source', 'separation', 'without', 'the', 'need', 'for', 'handcrafted', 'features', 'or', 'any', 'pre', 'or', 'postprocessing']] | [-0.04531962666143146, 0.00030269885642660987, -0.13071598500634232, 0.06105143292936393, -0.13399049948073097, -0.20277820289031498, -0.016196291324579053, 0.4570664644655254, -0.29997482961561117, -0.30361388027668, 0.06752413334713007, -0.23643425739266807, -0.19868010214736892, 0.20003201181793379, -0.1064360675919387, 0.12530258347914142, 0.17268918849941756, 0.029150854164941443, -0.10677170249012609, -0.18507876092981962, 0.34588263984769585, 0.04416780084785488, 0.3751958686961896, -0.018591327033936976, 0.11745877232299083, 0.028952736591195894, -0.10617728423741128, -0.07811553141024584, -0.0049520069815722914, 0.16640009521765428, 0.3537031761888001, 0.2066218654715663, 0.26882839884815946, -0.43530056023349367, -0.3134716423642304, 0.07396226424930824, 0.1522104483615193, 0.11745349302008334, -0.05527470655635827, -0.3744655556950925, 0.10095043907769852, -0.09136321092697067, 0.06131824413055761, -0.1472851642407477, -0.06471347229348288, 0.006383532772047652, -0.3361125921002693, 0.06822928230588635, 0.0999046291942553, 0.06320685794990924, -0.050371914579429564, -0.10828324487018916, 0.06524819499140398, 0.18024237952647834, -0.05943881044836922, 0.04397321231275176, 0.11670653125167721, -0.1528009606913353, -0.11068430181799663, 0.31178620813621416, -0.08063168598132, -0.21284864342370485, 0.21673739658435806, 0.022071840238964392, -0.1741224205431839, 0.13094714981400304, 0.20733335755972399, 0.09359656271214287, -0.17469625268131495, -0.034781998174083936, 0.0023924692074716505, 0.2715731461377194, 0.0673472826472587, 0.059503029379993674, 0.1873603790377577, 0.22955848418900537, -0.01677339728986327, 0.12815257558443893, -0.21201465103464823, 0.017344211497240598, -0.23602550577553402, -0.03997104839525289, -0.2499029812299543, -0.056551557387380554, -0.1089112070025294, -0.15025713458243345, 0.4373393196095195, 0.2489544964240243, 0.1932916640304029, 0.06768705454499771, 0.38821950260963706, 0.023333956866473375, 0.11502338273243772, 0.06275237172117663, 0.17010030571060877, 0.0026147390922738444, 0.17760703878270256, -0.18116832508498595, 0.08364516170178023, 0.06813168139714333] |
1,803.00703 | Structures and Physical Properties of CsV$_2$Se$_{2-x}$O and
V$_2$Se$_2$O | By using solid-state reactions, we successfully synthesize new oxyselenides
CsV$_2$Se$_{2-x}$O (x = 0, 0.5). These compounds containing V$_2$O planar
layers with a square lattice crystallize in the CeCr$_2$Si$_2$C structure with
the space group of $P4/mmm$. Another new compound V$_2$Se$_2$O which
crystallizes in space group $I4/mmm$ is fabricated by topochemical
deintercalation of cesium from CsV$_2$Se$_2$O powder with iodine in
tetrahydrofuran(THF). Resistivity measurements show a semiconducting behavior
for CsV$_2$Se$_2$O, while a metallic behavior for CsV$_2$Se$_{1.5}$O, and an
insulating feature for V$_2$Se$_2$O. A charge- or spin-density wave-like
anomaly has been observed at 168 K for CsV$_2$Se$_2$O and 150 K for
CsV$_2$Se$_{1.5}$O, respectively. And these anomalies are also confirmed by the
magnetic susceptibility measurements. The resistivity in V$_2$Se$_2$O exhibits
an anomalous log(1/$T$) temperature dependence, which is similar to the case in
parent phase or very underdoped cuprates indicating the involvement of strong
correlation. Magnetic susceptibility measurements show that the magnetic moment
per V-site in V$_2$Se$_2$O is much larger than that of CsV$_2$Se$_{2-x}$O,
which again suggests the correlation induced localization effect in the former.
| cond-mat.mtrl-sci | by using solidstate reactions we successfully synthesize new oxyselenides csv_2se_2xo x 0 05 these compounds containing v_2o planar layers with a square lattice crystallize in the cecr_2si_2c structure with the space group of p4mmm another new compound v_2se_2o which crystallizes in space group i4mmm is fabricated by topochemical deintercalation of cesium from csv_2se_2o powder with iodine in tetrahydrofuranthf resistivity measurements show a semiconducting behavior for csv_2se_2o while a metallic behavior for csv_2se_15o and an insulating feature for v_2se_2o a charge or spindensity wavelike anomaly has been observed at 168 k for csv_2se_2o and 150 k for csv_2se_15o respectively and these anomalies are also confirmed by the magnetic susceptibility measurements the resistivity in v_2se_2o exhibits an anomalous log1t temperature dependence which is similar to the case in parent phase or very underdoped cuprates indicating the involvement of strong correlation magnetic susceptibility measurements show that the magnetic moment per vsite in v_2se_2o is much larger than that of csv_2se_2xo which again suggests the correlation induced localization effect in the former | [['by', 'using', 'solidstate', 'reactions', 'we', 'successfully', 'synthesize', 'new', 'oxyselenides', 'csv_2se_2xo', 'x', '0', '05', 'these', 'compounds', 'containing', 'v_2o', 'planar', 'layers', 'with', 'a', 'square', 'lattice', 'crystallize', 'in', 'the', 'cecr_2si_2c', 'structure', 'with', 'the', 'space', 'group', 'of', 'p4mmm', 'another', 'new', 'compound', 'v_2se_2o', 'which', 'crystallizes', 'in', 'space', 'group', 'i4mmm', 'is', 'fabricated', 'by', 'topochemical', 'deintercalation', 'of', 'cesium', 'from', 'csv_2se_2o', 'powder', 'with', 'iodine', 'in', 'tetrahydrofuranthf', 'resistivity', 'measurements', 'show', 'a', 'semiconducting', 'behavior', 'for', 'csv_2se_2o', 'while', 'a', 'metallic', 'behavior', 'for', 'csv_2se_15o', 'and', 'an', 'insulating', 'feature', 'for', 'v_2se_2o', 'a', 'charge', 'or', 'spindensity', 'wavelike', 'anomaly', 'has', 'been', 'observed', 'at', '168', 'k', 'for', 'csv_2se_2o', 'and', '150', 'k', 'for', 'csv_2se_15o', 'respectively', 'and', 'these', 'anomalies', 'are', 'also', 'confirmed', 'by', 'the', 'magnetic', 'susceptibility', 'measurements', 'the', 'resistivity', 'in', 'v_2se_2o', 'exhibits', 'an', 'anomalous', 'log1t', 'temperature', 'dependence', 'which', 'is', 'similar', 'to', 'the', 'case', 'in', 'parent', 'phase', 'or', 'very', 'underdoped', 'cuprates', 'indicating', 'the', 'involvement', 'of', 'strong', 'correlation', 'magnetic', 'susceptibility', 'measurements', 'show', 'that', 'the', 'magnetic', 'moment', 'per', 'vsite', 'in', 'v_2se_2o', 'is', 'much', 'larger', 'than', 'that', 'of', 'csv_2se_2xo', 'which', 'again', 'suggests', 'the', 'correlation', 'induced', 'localization', 'effect', 'in', 'the', 'former']] | [-0.1289073686581105, 0.22846341105778264, -0.04176440375413222, -0.037575126387673664, -0.037855131737160264, -0.13333790304604917, 0.0799373983656551, 0.39608915207209067, -0.23336443451698868, -0.2859518029901665, 0.02246738097965135, -0.3763232446159236, -0.11163209948717849, 0.1632485140609788, 0.0586612743063597, -0.008123499747443929, -0.052019902742176785, 0.04223585307772737, -0.15129705171275418, -0.1959459813311696, 0.25090596911613827, 0.021886474546045066, 0.3034433661377989, 0.04725828949012793, 0.055143969165510495, -0.02418896195013076, 0.12491672816395294, 0.05353634373714158, -0.1060334086480907, 0.011515875706390944, 0.25678518114145843, -0.08886816245576483, 0.1514435020784731, -0.38679892976069824, -0.243053762584168, 0.014819485129555688, 0.12012095871032216, 0.06457429856818635, -0.10352713035827037, -0.2820102805373608, 0.08506568867014722, -0.10362248376914067, -0.09607434708668734, -0.11578365246132308, 0.009879191877553239, -0.04905274766242655, -0.26889106349444775, 0.13370239048945223, 0.04515416022913996, 0.15473927409657334, -0.10643237918266095, -0.17564328375883634, -0.049346100582624786, 0.030501266641658732, 0.04212363235565135, 0.0905561915889848, 0.12628962337621488, -0.08585639157681726, -0.08278329858076176, 0.35812056938302705, -0.06152397180458138, -0.02850275615346618, 0.12238009324209997, -0.25654031164303887, -0.14297724444768392, 0.22811829046549975, 0.08988295691087841, 0.10171284531825223, -0.14404290319107532, 0.053407976647213216, -0.05841471094317967, 0.2152358795166947, 0.04449161104421364, 0.044603408400143964, 0.19364834836742376, 0.19480588555743453, 0.015573298913659528, 0.1462913363822736, -0.13779675532132388, 0.0066300311358645555, -0.18144553709262254, -0.19483735613212047, -0.17414696954074316, 0.06829509251547279, -0.08096979229567296, -0.17041570139772375, 0.32386874193616677, 0.1114097036086605, 0.20367764991242437, -0.059884763904119606, 0.19889541559969076, 0.045682113376824415, 0.1315918272564886, 0.04907609658075671, 0.22903983814030654, 0.159661798387242, 0.11814345480670455, -0.2691568980837474, 0.1224220739066368, 0.010599184237071313] |
1,803.00704 | Extension of PCA to Higher Order Data Structures: An Introduction to
Tensors, Tensor Decompositions, and Tensor PCA | The widespread use of multisensor technology and the emergence of big data
sets have brought the necessity to develop more versatile tools to represent
higher-order data with multiple aspects and high dimensionality. Data in the
form of multidimensional arrays, also referred to as tensors, arises in a
variety of applications including chemometrics, hyperspectral imaging, high
resolution videos, neuroimaging, biometrics, and social network analysis. Early
multiway data analysis approaches reformatted such tensor data as large vectors
or matrices and then resorted to dimensionality reduction methods developed for
classical two-way analysis such as PCA. However, one cannot discover hidden
components within multiway data using conventional PCA. To this end, tensor
decomposition methods which are flexible in the choice of the constraints and
that extract more general latent components have been proposed. In this paper,
we review the major tensor decomposition methods with a focus on problems
targeted by classical PCA. In particular, we present tensor methods that aim to
solve three important challenges typically addressed by PCA: dimensionality
reduction, i.e. low-rank tensor approximation, supervised learning, i.e.
learning linear subspaces for feature extraction, and robust low-rank tensor
recovery. We also provide experimental results to compare different tensor
models for both dimensionality reduction and supervised learning applications.
| eess.SP | the widespread use of multisensor technology and the emergence of big data sets have brought the necessity to develop more versatile tools to represent higherorder data with multiple aspects and high dimensionality data in the form of multidimensional arrays also referred to as tensors arises in a variety of applications including chemometrics hyperspectral imaging high resolution videos neuroimaging biometrics and social network analysis early multiway data analysis approaches reformatted such tensor data as large vectors or matrices and then resorted to dimensionality reduction methods developed for classical twoway analysis such as pca however one cannot discover hidden components within multiway data using conventional pca to this end tensor decomposition methods which are flexible in the choice of the constraints and that extract more general latent components have been proposed in this paper we review the major tensor decomposition methods with a focus on problems targeted by classical pca in particular we present tensor methods that aim to solve three important challenges typically addressed by pca dimensionality reduction ie lowrank tensor approximation supervised learning ie learning linear subspaces for feature extraction and robust lowrank tensor recovery we also provide experimental results to compare different tensor models for both dimensionality reduction and supervised learning applications | [['the', 'widespread', 'use', 'of', 'multisensor', 'technology', 'and', 'the', 'emergence', 'of', 'big', 'data', 'sets', 'have', 'brought', 'the', 'necessity', 'to', 'develop', 'more', 'versatile', 'tools', 'to', 'represent', 'higherorder', 'data', 'with', 'multiple', 'aspects', 'and', 'high', 'dimensionality', 'data', 'in', 'the', 'form', 'of', 'multidimensional', 'arrays', 'also', 'referred', 'to', 'as', 'tensors', 'arises', 'in', 'a', 'variety', 'of', 'applications', 'including', 'chemometrics', 'hyperspectral', 'imaging', 'high', 'resolution', 'videos', 'neuroimaging', 'biometrics', 'and', 'social', 'network', 'analysis', 'early', 'multiway', 'data', 'analysis', 'approaches', 'reformatted', 'such', 'tensor', 'data', 'as', 'large', 'vectors', 'or', 'matrices', 'and', 'then', 'resorted', 'to', 'dimensionality', 'reduction', 'methods', 'developed', 'for', 'classical', 'twoway', 'analysis', 'such', 'as', 'pca', 'however', 'one', 'can', 'not', 'discover', 'hidden', 'components', 'within', 'multiway', 'data', 'using', 'conventional', 'pca', 'to', 'this', 'end', 'tensor', 'decomposition', 'methods', 'which', 'are', 'flexible', 'in', 'the', 'choice', 'of', 'the', 'constraints', 'and', 'that', 'extract', 'more', 'general', 'latent', 'components', 'have', 'been', 'proposed', 'in', 'this', 'paper', 'we', 'review', 'the', 'major', 'tensor', 'decomposition', 'methods', 'with', 'a', 'focus', 'on', 'problems', 'targeted', 'by', 'classical', 'pca', 'in', 'particular', 'we', 'present', 'tensor', 'methods', 'that', 'aim', 'to', 'solve', 'three', 'important', 'challenges', 'typically', 'addressed', 'by', 'pca', 'dimensionality', 'reduction', 'ie', 'lowrank', 'tensor', 'approximation', 'supervised', 'learning', 'ie', 'learning', 'linear', 'subspaces', 'for', 'feature', 'extraction', 'and', 'robust', 'lowrank', 'tensor', 'recovery', 'we', 'also', 'provide', 'experimental', 'results', 'to', 'compare', 'different', 'tensor', 'models', 'for', 'both', 'dimensionality', 'reduction', 'and', 'supervised', 'learning', 'applications']] | [-0.03595416565019382, 0.007469370169108551, -0.05749892958727501, 0.06754353522624382, -0.13835482981841207, -0.18741030089686142, -0.03847685602879353, 0.37221118503058437, -0.31013984212140533, -0.2732726230979988, 0.17226386759898113, -0.2662772705468039, -0.21051808973824532, 0.16379483368626668, -0.07841822064673419, 0.09929146194304385, 0.1207770523124411, -0.016739291550823276, -0.08504344028986845, -0.2376909495117919, 0.3311955303903304, 0.039739144523171524, 0.383648819609673, -0.009013165502955079, 0.1107868148417979, 0.038866532128760775, -0.10775309220394667, 0.036831530609382684, -0.048472245071239095, 0.2076668639167431, 0.410401910246358, 0.24023159096752494, 0.3160637862313831, -0.44476073713717507, -0.2536545185299188, 0.1221251477825218, 0.14923271089655293, 0.11226515896908264, -0.01764585455099472, -0.2733357731097688, 0.08960344193174559, -0.1733059173737488, -0.034143636076181545, -0.23777225200890326, -0.01801809083953427, -0.051925015250590685, -0.25778371427783414, 0.06482632945071422, 0.056233613848841436, 0.07326807185788364, -0.06702735780980255, -0.17899378626173654, 0.07411686613968592, 0.09845018488304763, 0.07963560952567587, -0.017767628869407026, 0.10306540880165081, -0.14244266132385852, -0.1534367177735868, 0.364725753792799, -0.06312344196068771, -0.2166181212044595, 0.22841565703114897, -0.01356097872542473, -0.2142241759826064, 0.08573571584237666, 0.26259039797963957, 0.0798082138650238, -0.15285715535191782, 0.04577283540257828, -0.0009046716363895137, 0.1560245666552481, 0.03048509176633339, 0.025438095188720207, 0.11486767018419307, 0.20063961550990558, 0.05467732322758107, 0.123263945327113, -0.12904505787403597, -0.052200215334510976, -0.19661628560182484, -0.10552710954410334, -0.21315813283025123, -0.005954619663052475, -0.1569373946216479, -0.17335945113982057, 0.35487975492301926, 0.17775928726883186, 0.20855540417188403, 0.01747373598410894, 0.37912800632344157, 0.04009981696121851, 0.11726402262067102, 0.07865615220461954, 0.17513223851896256, 0.1525117249579589, 0.1383989873231222, -0.13869310880088995, 0.025035517544750415, 0.03359572839119709] |
1,803.00705 | On the Structure of Abstract H*-Algebras | Previously we have shown that the topos approach to quantum theory of Doering
and Isham can be generalised to a class of categories typically studied within
the monoidal approach to quantum theory of Abramsky and Coecke. In the monoidal
approach to quantum theory H*-algebras provide an axiomatisation of states and
observables. Here we show that H*-algebras naturally correspond with the
notions of states and observables in the generalised topos approach to quantum
theory. We then combine these results with the dagger-kernel approach to
quantum logic of Heunen and Jacobs, which we use to prove a structure theorem
for H*-algebras. This structure theorem is a generalisation of the structure
theorem of Ambrose for H*-algebras the category of Hilbert spaces.
| cs.LO quant-ph | previously we have shown that the topos approach to quantum theory of doering and isham can be generalised to a class of categories typically studied within the monoidal approach to quantum theory of abramsky and coecke in the monoidal approach to quantum theory halgebras provide an axiomatisation of states and observables here we show that halgebras naturally correspond with the notions of states and observables in the generalised topos approach to quantum theory we then combine these results with the daggerkernel approach to quantum logic of heunen and jacobs which we use to prove a structure theorem for halgebras this structure theorem is a generalisation of the structure theorem of ambrose for halgebras the category of hilbert spaces | [['previously', 'we', 'have', 'shown', 'that', 'the', 'topos', 'approach', 'to', 'quantum', 'theory', 'of', 'doering', 'and', 'isham', 'can', 'be', 'generalised', 'to', 'a', 'class', 'of', 'categories', 'typically', 'studied', 'within', 'the', 'monoidal', 'approach', 'to', 'quantum', 'theory', 'of', 'abramsky', 'and', 'coecke', 'in', 'the', 'monoidal', 'approach', 'to', 'quantum', 'theory', 'halgebras', 'provide', 'an', 'axiomatisation', 'of', 'states', 'and', 'observables', 'here', 'we', 'show', 'that', 'halgebras', 'naturally', 'correspond', 'with', 'the', 'notions', 'of', 'states', 'and', 'observables', 'in', 'the', 'generalised', 'topos', 'approach', 'to', 'quantum', 'theory', 'we', 'then', 'combine', 'these', 'results', 'with', 'the', 'daggerkernel', 'approach', 'to', 'quantum', 'logic', 'of', 'heunen', 'and', 'jacobs', 'which', 'we', 'use', 'to', 'prove', 'a', 'structure', 'theorem', 'for', 'halgebras', 'this', 'structure', 'theorem', 'is', 'a', 'generalisation', 'of', 'the', 'structure', 'theorem', 'of', 'ambrose', 'for', 'halgebras', 'the', 'category', 'of', 'hilbert', 'spaces']] | [-0.054199277812368274, 0.0705897893815582, -0.16946314793462172, 0.1092057983056666, -0.05583636962577828, -0.11949426156635849, 0.01900856882437236, 0.3322452999289251, -0.3315759315055946, -0.25924908113466877, 0.00983508574601231, -0.20715915142661995, -0.18381606271036732, 0.17873504376782673, -0.15009952130186188, 0.014016878261811968, 0.021142961043450568, 0.05043415863163427, -0.061511065313417435, -0.23323028231572965, 0.3875278889661273, 0.007210013479527691, 0.260569623993853, 0.0692397790730127, 0.11965274595472421, 0.017193886921064466, 0.024414688726871185, 0.04997967035533526, -0.16128988409552694, 0.1920671800089777, 0.3198455907404423, 0.14175090701000875, 0.24490512253091726, -0.40552980709088665, -0.15321697629828993, 0.06294858952363332, 0.03292394808939316, 0.14214083354056486, 0.05019750628564666, -0.37970828817377233, 0.11085867930530037, -0.2519467369470204, -0.11235541829632388, -0.14007638165185976, 0.01898020587097376, -0.058491863648638, -0.22953948613731828, 0.0069118621898417035, 0.1390942480478786, 0.04581333594555911, -0.07396568564905061, -0.02700699303442469, -0.006092925934105093, 0.0515542842182092, -0.05839912728088088, 0.008265615787166052, 0.08572065657100235, -0.08613489483658256, -0.2378793950829432, 0.3353220312895938, -0.042637105935161665, -0.18632365715427276, 0.13783433629422742, -0.1081444297093325, -0.20688945683849674, 0.01174348451069787, 0.0651453418784544, 0.14883561017644456, -0.08057987093915527, 0.17606225828431213, -0.10842315836722015, 0.1016729665426617, 0.07740238685614596, 0.10597594080763495, 0.12852402813095823, 0.09816600203625539, 0.01795869952855775, 0.12297647823002508, 0.00802084733135043, -0.18514218604198107, -0.32956036263042027, -0.19527245269945034, -0.10517588490222254, 0.10985155827087215, -0.020751071285280302, -0.2010620524756049, 0.35080599705648857, 0.17431722508950365, 0.14031524827273992, 0.10484312183490326, 0.20853932887618232, 0.08763152873243055, 0.06776840110437778, 0.020576592865121417, 0.19025655657562435, 0.2904342951842098, 0.02653883399370198, -0.1233446270498073, -0.04039160738914059, 0.18700555662831497] |
1,803.00706 | Information Theoretically Secure Hypothesis Test for Temporally
Unstructured Quantum Computation (Extended Abstract) | The efficient certification of classically intractable quantum devices has
been a central research question for some time. However, to observe a "quantum
advantage", it is believed that one does not need to build a large scale
universal quantum computer, a task which has proven extremely challenging.
Intermediate quantum models that are easier to implement, but which also
exhibit this quantum advantage over classical computers, have been proposed. In
this work, we present a certification technique for such a sub-universal
quantum server which only performs commuting gates and requires very limited
quantum memory. By allowing a verifying client to manipulate single qubits, we
exploit properties of measurement based blind quantum computing to give them
the tools to test the "quantum superiority" of the server.
| quant-ph | the efficient certification of classically intractable quantum devices has been a central research question for some time however to observe a quantum advantage it is believed that one does not need to build a large scale universal quantum computer a task which has proven extremely challenging intermediate quantum models that are easier to implement but which also exhibit this quantum advantage over classical computers have been proposed in this work we present a certification technique for such a subuniversal quantum server which only performs commuting gates and requires very limited quantum memory by allowing a verifying client to manipulate single qubits we exploit properties of measurement based blind quantum computing to give them the tools to test the quantum superiority of the server | [['the', 'efficient', 'certification', 'of', 'classically', 'intractable', 'quantum', 'devices', 'has', 'been', 'a', 'central', 'research', 'question', 'for', 'some', 'time', 'however', 'to', 'observe', 'a', 'quantum', 'advantage', 'it', 'is', 'believed', 'that', 'one', 'does', 'not', 'need', 'to', 'build', 'a', 'large', 'scale', 'universal', 'quantum', 'computer', 'a', 'task', 'which', 'has', 'proven', 'extremely', 'challenging', 'intermediate', 'quantum', 'models', 'that', 'are', 'easier', 'to', 'implement', 'but', 'which', 'also', 'exhibit', 'this', 'quantum', 'advantage', 'over', 'classical', 'computers', 'have', 'been', 'proposed', 'in', 'this', 'work', 'we', 'present', 'a', 'certification', 'technique', 'for', 'such', 'a', 'subuniversal', 'quantum', 'server', 'which', 'only', 'performs', 'commuting', 'gates', 'and', 'requires', 'very', 'limited', 'quantum', 'memory', 'by', 'allowing', 'a', 'verifying', 'client', 'to', 'manipulate', 'single', 'qubits', 'we', 'exploit', 'properties', 'of', 'measurement', 'based', 'blind', 'quantum', 'computing', 'to', 'give', 'them', 'the', 'tools', 'to', 'test', 'the', 'quantum', 'superiority', 'of', 'the', 'server']] | [-0.12519676906692728, 0.09465207459359634, -0.1244182135849222, 0.07081655675178106, -0.114393910165967, -0.2906735209517211, 0.06488362491335266, 0.36960987925408334, -0.24452950452204522, -0.3216362314647048, 0.09877660677472992, -0.1912211662128083, -0.1359846700830915, 0.2819229273155816, -0.09122854984191255, 0.15941844947969283, 0.08489329966799758, 0.021071650436132905, -0.045178951987072946, -0.30444485567722135, 0.22506682018794846, 0.04401661109130042, 0.31053547398376513, 0.06087786884887553, 0.12036644180714176, -0.01846366990509072, 0.017418779285361504, -0.0020002966549822953, -0.056719090858293596, 0.1353032889102048, 0.3453523468814955, 0.14010977754142226, 0.33521183409039085, -0.44934837975940567, -0.19436515922037265, 0.12669759201892933, 0.15001160187298448, 0.18804743994364317, -0.08081958009066378, -0.2753615748455248, 0.11595262917197817, -0.19027855817788863, -0.05700754987753121, -0.16519498972721944, 0.02607055332859963, -0.07979533691962469, -0.21228454572080477, -0.011638151665598654, 0.07305384370521074, 0.03195413941805198, 0.10658258138206973, -0.0023567035029513563, 0.10898031755464106, 0.17716198456208637, -0.057779660526042186, 0.01314032493098601, 0.1465629263084412, -0.12616879681250218, -0.2029767712366169, 0.3873493670357194, 0.026282060543090346, -0.18484158250616817, 0.21288686016540428, -0.06358203368367461, -0.1763037390575358, 0.06058502281501102, 0.12460541795717733, 0.1106288604962647, -0.16329543770298482, 0.12697827698221825, -0.02879970304940532, 0.22316566608255592, 0.015892028884311033, 0.10888035164585685, 0.19787839077019354, 0.126865246802629, 0.0720477857252174, 0.16569157969585158, -0.0576689051053907, -0.1895723072963396, -0.21940004130507387, -0.2228640625499401, -0.2609072323108652, 0.11893492161565578, 0.0074828691986186914, -0.19647581947634254, 0.348683515904335, 0.22053512075879966, 0.15469725506486204, 0.04800605954416853, 0.3558876270625165, 0.08573641756178463, 0.15569865064339605, 0.11695863564292393, 0.20905770844239477, 0.1098778438356864, 0.12173999229169685, -0.19304430625605873, 0.10307635695908249, 0.0077465210283625624] |
1,803.00707 | A Shortcut from Categorical Quantum Theory to Convex Operational
Theories | This paper charts a very direct path between the categorical approach to
quantum mechanics, due to Abramsky and Coecke, and the older convex-operational
approach based on ordered vector spaces (recently reincarnated as "generalized
probabilistic theories"). In the former, the objects of a symmetric monoidal
category C are understood to represent physical systems and morphisms, physical
processes. Elements of the monoid C(I,I) are interpreted somewhat
metaphorically as probabilities. Any monoid homomorphism from the scalars of a
symmetric monoidal category C gives rise to a covariant functor V_o from C to a
category of dual-pairs of ordered vector spaces. Specifying a natural
transformation u from V_o to 1 (where 1 is the trivial such functor) allows us
to identify normalized states, and, thus, to regard the image category V_o(C)
as consisting of concrete operational models. In this case, if A and B are
objects in C, then V_o(A x B) defines a non-signaling composite of V_o(A) and
V_o(B). Provided either that C satisfies a "local tomography" condition, or
that C is compact closed, this defines a symmetric monoidal structure on the
image category, and makes V_o a (strict) monoidal functor.
| quant-ph math-ph math.MP | this paper charts a very direct path between the categorical approach to quantum mechanics due to abramsky and coecke and the older convexoperational approach based on ordered vector spaces recently reincarnated as generalized probabilistic theories in the former the objects of a symmetric monoidal category c are understood to represent physical systems and morphisms physical processes elements of the monoid cii are interpreted somewhat metaphorically as probabilities any monoid homomorphism from the scalars of a symmetric monoidal category c gives rise to a covariant functor v_o from c to a category of dualpairs of ordered vector spaces specifying a natural transformation u from v_o to 1 where 1 is the trivial such functor allows us to identify normalized states and thus to regard the image category v_oc as consisting of concrete operational models in this case if a and b are objects in c then v_oa x b defines a nonsignaling composite of v_oa and v_ob provided either that c satisfies a local tomography condition or that c is compact closed this defines a symmetric monoidal structure on the image category and makes v_o a strict monoidal functor | [['this', 'paper', 'charts', 'a', 'very', 'direct', 'path', 'between', 'the', 'categorical', 'approach', 'to', 'quantum', 'mechanics', 'due', 'to', 'abramsky', 'and', 'coecke', 'and', 'the', 'older', 'convexoperational', 'approach', 'based', 'on', 'ordered', 'vector', 'spaces', 'recently', 'reincarnated', 'as', 'generalized', 'probabilistic', 'theories', 'in', 'the', 'former', 'the', 'objects', 'of', 'a', 'symmetric', 'monoidal', 'category', 'c', 'are', 'understood', 'to', 'represent', 'physical', 'systems', 'and', 'morphisms', 'physical', 'processes', 'elements', 'of', 'the', 'monoid', 'cii', 'are', 'interpreted', 'somewhat', 'metaphorically', 'as', 'probabilities', 'any', 'monoid', 'homomorphism', 'from', 'the', 'scalars', 'of', 'a', 'symmetric', 'monoidal', 'category', 'c', 'gives', 'rise', 'to', 'a', 'covariant', 'functor', 'v_o', 'from', 'c', 'to', 'a', 'category', 'of', 'dualpairs', 'of', 'ordered', 'vector', 'spaces', 'specifying', 'a', 'natural', 'transformation', 'u', 'from', 'v_o', 'to', '1', 'where', '1', 'is', 'the', 'trivial', 'such', 'functor', 'allows', 'us', 'to', 'identify', 'normalized', 'states', 'and', 'thus', 'to', 'regard', 'the', 'image', 'category', 'v_oc', 'as', 'consisting', 'of', 'concrete', 'operational', 'models', 'in', 'this', 'case', 'if', 'a', 'and', 'b', 'are', 'objects', 'in', 'c', 'then', 'v_oa', 'x', 'b', 'defines', 'a', 'nonsignaling', 'composite', 'of', 'v_oa', 'and', 'v_ob', 'provided', 'either', 'that', 'c', 'satisfies', 'a', 'local', 'tomography', 'condition', 'or', 'that', 'c', 'is', 'compact', 'closed', 'this', 'defines', 'a', 'symmetric', 'monoidal', 'structure', 'on', 'the', 'image', 'category', 'and', 'makes', 'v_o', 'a', 'strict', 'monoidal', 'functor']] | [-0.11450853704981465, 0.0769181232234197, -0.06711973171491831, 0.0958762945304113, -0.11442596548502999, -0.1842208430657143, 0.04609223066222762, 0.3818720980575513, -0.370719068361303, -0.21248074255085417, 0.03628834939861138, -0.20113099420476438, -0.10967615007417747, 0.12517349475804093, -0.1566829228348989, -0.050537813667228426, 0.026309071670306827, 0.08548877268753291, -0.09889525856444059, -0.16600562149024273, 0.4091762846673501, -0.0273893813738231, 0.2405905382308577, 0.01310216857294378, 0.10710627517335444, -0.026105616584543016, -0.005516798325026264, 0.01991098801922667, -0.09321661711298505, 0.13193581261573575, 0.29741122106507634, 0.14049337402108933, 0.19129751640778792, -0.3614936554497415, -0.1083761584064872, 0.1298171073188084, 0.07973663905471727, 0.04602426095804261, -0.006512267836164888, -0.3507436703683317, 0.10785597515200357, -0.2202847314126032, -0.04839058997682654, -0.06136771408165549, 0.12204292632772454, -0.040230581777395455, -0.314018559098758, -0.015619772033460322, 0.10371658023111624, 0.07931674121889276, -0.07616748834434375, -0.06872842686537367, -0.10385225656452579, 0.08414910654511794, -0.05955356942070136, 0.09357227932579898, 0.1553361328973711, -0.11001438629214785, -0.12196757873663536, 0.42645853105932474, -0.05294781653915729, -0.21108129559657896, 0.19697016137933543, -0.10255319869227625, -0.13136620120053272, 0.11952614573669712, 0.0553358821582131, 0.1440837468317413, -0.08267409724450753, 0.18503882997230484, -0.11711595994471521, 0.10341082444314711, 0.07941560762688764, 0.057097265134811157, 0.194065881858378, 0.10162414034194016, 0.02497307782747097, 0.13818784886050028, 0.011662548750761774, -0.08683606451390065, -0.3518006630692181, -0.20653517165599944, -0.08534084159655722, 0.1219302190820799, -0.03964769945198166, -0.20302264531562617, 0.3493035576577493, 0.1091410684665399, 0.2052917566641674, 0.08979073994675303, 0.24643401908278875, 0.03556551475392573, 0.061534390633204275, 0.013630991087776127, 0.12428792775512652, 0.24502678928579522, 0.05513152056360863, -0.07522493464345174, 0.04795053933624301, 0.14389377310462706] |
1,803.00708 | Uniqueness of Composition in Quantum Theory and Linguistics | We derive a uniqueness result for non-Cartesian composition of systems in a
large class of process theories, with important implications for quantum theory
and linguistics. Specifically, we consider theories of wavefunctions valued in
commutative involutive semirings -- as modelled by categories of free
finite-dimensional modules -- and we prove that the only bilinear
compact-closed symmetric monoidal structure is the canonical one (up to linear
monoidal equivalence). Our results apply to conventional quantum theory and
other toy theories of interest in the literature, such as real quantum theory,
relational quantum theory, hyperbolic quantum theory and modal quantum theory.
In computational linguistics they imply that linear models for categorical
compositional distributional semantics (DisCoCat) -- such as vector spaces,
sets and relations, and sets and histograms -- admit an (essentially) unique
compatible pregroup grammar.
| quant-ph math.CT | we derive a uniqueness result for noncartesian composition of systems in a large class of process theories with important implications for quantum theory and linguistics specifically we consider theories of wavefunctions valued in commutative involutive semirings as modelled by categories of free finitedimensional modules and we prove that the only bilinear compactclosed symmetric monoidal structure is the canonical one up to linear monoidal equivalence our results apply to conventional quantum theory and other toy theories of interest in the literature such as real quantum theory relational quantum theory hyperbolic quantum theory and modal quantum theory in computational linguistics they imply that linear models for categorical compositional distributional semantics discocat such as vector spaces sets and relations and sets and histograms admit an essentially unique compatible pregroup grammar | [['we', 'derive', 'a', 'uniqueness', 'result', 'for', 'noncartesian', 'composition', 'of', 'systems', 'in', 'a', 'large', 'class', 'of', 'process', 'theories', 'with', 'important', 'implications', 'for', 'quantum', 'theory', 'and', 'linguistics', 'specifically', 'we', 'consider', 'theories', 'of', 'wavefunctions', 'valued', 'in', 'commutative', 'involutive', 'semirings', 'as', 'modelled', 'by', 'categories', 'of', 'free', 'finitedimensional', 'modules', 'and', 'we', 'prove', 'that', 'the', 'only', 'bilinear', 'compactclosed', 'symmetric', 'monoidal', 'structure', 'is', 'the', 'canonical', 'one', 'up', 'to', 'linear', 'monoidal', 'equivalence', 'our', 'results', 'apply', 'to', 'conventional', 'quantum', 'theory', 'and', 'other', 'toy', 'theories', 'of', 'interest', 'in', 'the', 'literature', 'such', 'as', 'real', 'quantum', 'theory', 'relational', 'quantum', 'theory', 'hyperbolic', 'quantum', 'theory', 'and', 'modal', 'quantum', 'theory', 'in', 'computational', 'linguistics', 'they', 'imply', 'that', 'linear', 'models', 'for', 'categorical', 'compositional', 'distributional', 'semantics', 'discocat', 'such', 'as', 'vector', 'spaces', 'sets', 'and', 'relations', 'and', 'sets', 'and', 'histograms', 'admit', 'an', 'essentially', 'unique', 'compatible', 'pregroup', 'grammar']] | [-0.06710228724552998, 0.0997971129495815, -0.06168996302100519, 0.15518647840296276, -0.10306731157655281, -0.1633409626397585, -0.005507567017856572, 0.3539894850895045, -0.36411312528301976, -0.22227001569736454, 0.041537748366531485, -0.23553028284137356, -0.1992524283763025, 0.19353331390598286, -0.1274399180445702, 0.06843804013693616, 0.04027639588134156, 0.09097818385011383, -0.10393485485387612, -0.2280129714839397, 0.3780363308014496, -0.03038693658660151, 0.26964900141793474, 0.004925810391940768, 0.12570713240549797, 0.026990823789558832, -0.010965775461897018, 0.0698861493433397, -0.13022378931944129, 0.1463201615501136, 0.3756099179536827, 0.16327338528797208, 0.22481118686985047, -0.4371811221205881, -0.19725341458124893, 0.08484244945141235, 0.06730563219429718, 0.08894840240227206, -0.03633210963074354, -0.31591655243010747, 0.09511503868513198, -0.23435361496734594, -0.08001801103819162, -0.15488625437738227, 0.041077304491034104, -0.030554776316479085, -0.23198161982156942, 0.02710098713924665, 0.12753848565210188, 0.14274909557212914, -0.0951026176806495, -0.08487791623176438, 0.00020768689841682474, 0.08393170442875653, -0.03773236260790976, -0.015314095069669069, 0.10541697427822602, -0.11923748159795881, -0.2325693136903398, 0.39099591840354225, -0.06866630829782003, -0.23599341106674973, 0.18761238269507885, -0.09642012385902779, -0.20537929912097752, 0.009278966217405267, 0.10162718010888923, 0.12780225937003417, -0.07968993733742363, 0.23954151082637956, -0.10576336604676076, 0.1273920379074601, 0.07114940739813305, 0.09952688712390169, 0.20306708092435397, 0.09294760860650549, 0.027075624078630456, 0.1122274958839943, 0.07394716809577649, -0.19646436672811102, -0.34135309797489927, -0.17292988195549697, -0.08294429057203824, 0.07939748401709255, -0.12283754912641598, -0.2438556748250174, 0.31413534098851775, 0.1376630181321017, 0.12207256151466733, 0.13598377297314565, 0.2209018533162418, 0.10937014593057232, 0.06020290209423928, 0.006468940073520773, 0.12977208450643551, 0.26024269374153974, 0.05803664007394146, -0.09013250033326801, -0.01693090983474302, 0.14975110008307393] |
1,803.00709 | Spectral Presheaves, Kochen-Specker Contextuality, and Quantale-Valued
Relations | In the topos approach to quantum theory of Doering and Isham the
Kochen-Specker Theorem, which asserts the contextual nature of quantum theory,
can be reformulated in terms of the global sections of a presheaf characterised
by the Gelfand spectrum of a commutative C*-algebra. In previous work we showed
how this topos perspective can be generalised to a class of categories
typically studied within the monoidal approach to quantum theory of Abramsky
and Coecke, and in particular how one can generalise the Gelfand spectrum. Here
we study the Gelfand spectrum presheaf for categories of quantale-valued
relations, and by considering its global sections we give a non-contextuality
result for these categories. We also show that the Gelfand spectrum comes
equipped with a topology which has a natural interpretation when thinking of
these structures as representing physical theories.
| cs.LO quant-ph | in the topos approach to quantum theory of doering and isham the kochenspecker theorem which asserts the contextual nature of quantum theory can be reformulated in terms of the global sections of a presheaf characterised by the gelfand spectrum of a commutative calgebra in previous work we showed how this topos perspective can be generalised to a class of categories typically studied within the monoidal approach to quantum theory of abramsky and coecke and in particular how one can generalise the gelfand spectrum here we study the gelfand spectrum presheaf for categories of quantalevalued relations and by considering its global sections we give a noncontextuality result for these categories we also show that the gelfand spectrum comes equipped with a topology which has a natural interpretation when thinking of these structures as representing physical theories | [['in', 'the', 'topos', 'approach', 'to', 'quantum', 'theory', 'of', 'doering', 'and', 'isham', 'the', 'kochenspecker', 'theorem', 'which', 'asserts', 'the', 'contextual', 'nature', 'of', 'quantum', 'theory', 'can', 'be', 'reformulated', 'in', 'terms', 'of', 'the', 'global', 'sections', 'of', 'a', 'presheaf', 'characterised', 'by', 'the', 'gelfand', 'spectrum', 'of', 'a', 'commutative', 'calgebra', 'in', 'previous', 'work', 'we', 'showed', 'how', 'this', 'topos', 'perspective', 'can', 'be', 'generalised', 'to', 'a', 'class', 'of', 'categories', 'typically', 'studied', 'within', 'the', 'monoidal', 'approach', 'to', 'quantum', 'theory', 'of', 'abramsky', 'and', 'coecke', 'and', 'in', 'particular', 'how', 'one', 'can', 'generalise', 'the', 'gelfand', 'spectrum', 'here', 'we', 'study', 'the', 'gelfand', 'spectrum', 'presheaf', 'for', 'categories', 'of', 'quantalevalued', 'relations', 'and', 'by', 'considering', 'its', 'global', 'sections', 'we', 'give', 'a', 'noncontextuality', 'result', 'for', 'these', 'categories', 'we', 'also', 'show', 'that', 'the', 'gelfand', 'spectrum', 'comes', 'equipped', 'with', 'a', 'topology', 'which', 'has', 'a', 'natural', 'interpretation', 'when', 'thinking', 'of', 'these', 'structures', 'as', 'representing', 'physical', 'theories']] | [-0.07493299298781764, 0.07008535308004529, -0.1413658202453344, 0.15042827677378362, -0.06917401966121461, -0.12638466081202582, 0.014442100309490882, 0.31617657538434424, -0.32633079853150304, -0.2792713264003396, 0.015560769572578095, -0.21264226800865596, -0.1577787050632415, 0.1707546917721629, -0.18328876958780543, -0.022884316535890792, 0.0333228247102212, 0.06095811696723104, -0.04067137688366024, -0.21127138616586172, 0.4184944143415325, 0.03680303227932503, 0.2448408522453435, 0.04743704560764686, 0.05771039403906023, 0.03904082886529742, -0.015887443262531803, 0.061368527532451686, -0.12460364864441713, 0.18223814639625036, 0.3325260939421477, 0.16264990458644374, 0.2286097229492885, -0.3959854974238961, -0.19058869680113816, 0.09989196437721451, 0.09586448457557709, 0.05546231074431152, 0.023380206180391487, -0.36660803895857597, 0.08693446538893988, -0.24540810897532436, -0.07953899197832302, -0.1017823519392146, 0.03438220063431396, -0.040199494280817885, -0.2163500083817376, 0.015808114041876115, 0.13751729560188122, 0.07390200803401294, -0.08081053470313135, -0.006673475096209182, -0.031209765909308636, 0.07294642924162974, -0.022142989084952408, -0.023244989930686577, 0.10525456031404988, -0.09792945253731752, -0.21351159873453004, 0.3864128235175654, -0.05279528919124493, -0.17428056618405713, 0.1366875807547735, -0.13566076135331834, -0.18087764979098683, 0.04277288671238003, 0.049767581946044054, 0.1292462838434235, -0.09454423006229465, 0.19129713888763003, -0.14380499927533996, 0.10678496086556051, 0.09332104872532741, 0.1028408472702183, 0.16218928443612876, 0.12474719594681152, 0.0035103177858723535, 0.12240292505292152, 0.023367398445218526, -0.12482749282003001, -0.33362791770034367, -0.1723301803279254, -0.11825727656725105, 0.14530432376734637, -0.02745602613409843, -0.1502265235469504, 0.3823163300338719, 0.12060281690899972, 0.17773320344039584, 0.07715006048653136, 0.2332022432030903, 0.10750244681257755, 0.041260490725377436, 0.015369316814812245, 0.19534706758266246, 0.24705298515036703, 0.0607816184732925, -0.10751321022053835, -0.025390900778411715, 0.18511983985771183] |
1,803.0071 | Reinforcement Learning to Rank in E-Commerce Search Engine:
Formalization, Analysis, and Application | In e-commerce platforms such as Amazon and TaoBao, ranking items in a search
session is a typical multi-step decision-making problem. Learning to rank (LTR)
methods have been widely applied to ranking problems. However, such methods
often consider different ranking steps in a session to be independent, which
conversely may be highly correlated to each other. For better utilizing the
correlation between different ranking steps, in this paper, we propose to use
reinforcement learning (RL) to learn an optimal ranking policy which maximizes
the expected accumulative rewards in a search session. Firstly, we formally
define the concept of search session Markov decision process (SSMDP) to
formulate the multi-step ranking problem. Secondly, we analyze the property of
SSMDP and theoretically prove the necessity of maximizing accumulative rewards.
Lastly, we propose a novel policy gradient algorithm for learning an optimal
ranking policy, which is able to deal with the problem of high reward variance
and unbalanced reward distribution of an SSMDP. Experiments are conducted in
simulation and TaoBao search engine. The results demonstrate that our algorithm
performs much better than online LTR methods, with more than 40% and 30% growth
of total transaction amount in the simulation and the real application,
respectively.
| cs.LG | in ecommerce platforms such as amazon and taobao ranking items in a search session is a typical multistep decisionmaking problem learning to rank ltr methods have been widely applied to ranking problems however such methods often consider different ranking steps in a session to be independent which conversely may be highly correlated to each other for better utilizing the correlation between different ranking steps in this paper we propose to use reinforcement learning rl to learn an optimal ranking policy which maximizes the expected accumulative rewards in a search session firstly we formally define the concept of search session markov decision process ssmdp to formulate the multistep ranking problem secondly we analyze the property of ssmdp and theoretically prove the necessity of maximizing accumulative rewards lastly we propose a novel policy gradient algorithm for learning an optimal ranking policy which is able to deal with the problem of high reward variance and unbalanced reward distribution of an ssmdp experiments are conducted in simulation and taobao search engine the results demonstrate that our algorithm performs much better than online ltr methods with more than 40 and 30 growth of total transaction amount in the simulation and the real application respectively | [['in', 'ecommerce', 'platforms', 'such', 'as', 'amazon', 'and', 'taobao', 'ranking', 'items', 'in', 'a', 'search', 'session', 'is', 'a', 'typical', 'multistep', 'decisionmaking', 'problem', 'learning', 'to', 'rank', 'ltr', 'methods', 'have', 'been', 'widely', 'applied', 'to', 'ranking', 'problems', 'however', 'such', 'methods', 'often', 'consider', 'different', 'ranking', 'steps', 'in', 'a', 'session', 'to', 'be', 'independent', 'which', 'conversely', 'may', 'be', 'highly', 'correlated', 'to', 'each', 'other', 'for', 'better', 'utilizing', 'the', 'correlation', 'between', 'different', 'ranking', 'steps', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'reinforcement', 'learning', 'rl', 'to', 'learn', 'an', 'optimal', 'ranking', 'policy', 'which', 'maximizes', 'the', 'expected', 'accumulative', 'rewards', 'in', 'a', 'search', 'session', 'firstly', 'we', 'formally', 'define', 'the', 'concept', 'of', 'search', 'session', 'markov', 'decision', 'process', 'ssmdp', 'to', 'formulate', 'the', 'multistep', 'ranking', 'problem', 'secondly', 'we', 'analyze', 'the', 'property', 'of', 'ssmdp', 'and', 'theoretically', 'prove', 'the', 'necessity', 'of', 'maximizing', 'accumulative', 'rewards', 'lastly', 'we', 'propose', 'a', 'novel', 'policy', 'gradient', 'algorithm', 'for', 'learning', 'an', 'optimal', 'ranking', 'policy', 'which', 'is', 'able', 'to', 'deal', 'with', 'the', 'problem', 'of', 'high', 'reward', 'variance', 'and', 'unbalanced', 'reward', 'distribution', 'of', 'an', 'ssmdp', 'experiments', 'are', 'conducted', 'in', 'simulation', 'and', 'taobao', 'search', 'engine', 'the', 'results', 'demonstrate', 'that', 'our', 'algorithm', 'performs', 'much', 'better', 'than', 'online', 'ltr', 'methods', 'with', 'more', 'than', '40', 'and', '30', 'growth', 'of', 'total', 'transaction', 'amount', 'in', 'the', 'simulation', 'and', 'the', 'real', 'application', 'respectively']] | [-0.04098603340630986, 0.016707630750437116, -0.0836921275813301, 0.10972510894089968, -0.13427536888867056, -0.17609573615745328, 0.09250001763414835, 0.48416530292003823, -0.29531180180010186, -0.34115720617505324, 0.09522826061291555, -0.2832565358067727, -0.173051800716893, 0.1686516479897926, -0.10482925532301467, 0.08328694792642216, 0.06020854273986483, 0.050565312045565504, -0.0486833830545399, -0.31958742033170734, 0.28806131964446463, 0.08291374368302935, 0.3185738862010103, 0.0025714714052015213, 0.12014357907341877, 0.012153101958633967, -0.033481512813075404, 0.021862592618332136, -0.07825621631922669, 0.12999828343060868, 0.364245154391787, 0.2276157686201579, 0.4034192461763794, -0.36980628265751214, -0.14996254617750795, 0.15749269837382526, 0.11695937750786169, 0.07746444115047835, -0.053208819877525355, -0.2835976235737004, 0.07795344232043354, -0.19853370874914242, 0.026572564787619827, -0.09077054272983785, -0.02139256562015051, 0.0026110518807381505, -0.3438111721168286, 0.001948586576173653, 0.01684604767223249, 0.02439900038848121, -0.039712904451705104, -0.11076696425086664, 0.05554600903909448, 0.12309879164946214, 0.07106876285116646, 0.028891615567251516, 0.15498961245023352, -0.1325776504490749, -0.2397937185330499, 0.3616674731593186, -0.04329452201581897, -0.16989807046987304, 0.16610392041027022, -0.015582209207286039, -0.15726993807671058, 0.09365011806671165, 0.2735086022899603, 0.1649411149949231, -0.18104283546036737, -0.03773127659633475, -0.045642389052421156, 0.16948801666105062, 0.01981288490784191, -0.017210702332270206, 0.11019226222359879, 0.23519327564062037, 0.1387813734019353, 0.15803198234164087, -0.04561666247783575, -0.13550407220913688, -0.20289921031705568, -0.16465108280056087, -0.1696258516720117, -0.012646985321010851, -0.12585948875607414, -0.14027480218635846, 0.35589349003574205, 0.2362211406466097, 0.18430471628548661, 0.12719303724793576, 0.31581830723917853, 0.09217782878087619, 0.04078248368304728, 0.1188587696167486, 0.17584386255812068, -0.01591299037828143, 0.13881171965297667, -0.18556884686280062, 0.1529275142405201, 0.03764685796545678] |
1,803.00711 | Performance of a Relay-Assisted Hybrid FSO/RF Communication System | This paper investigates performance of a relay assisted hybrid Free Space
Optical / Radio Frequency (FSO/RF) communication system. The proposed structure
is particularly recommended anywhere that direct RF communication between
mobile users and base station is not possible due to atmospheric conditions. In
this system, a multiuser RF link connects mobile users to relay and a FSO link
connects relay to the base station. It is the first time that effect of number
of users within the cell, on the performance of such structure, is
investigated. Also it is the first time that performance of a dual hop hybrid
FSO / RF system is investigated in Negative Exponential atmospheric turbulence.
Considering wide range of atmospheric turbulence regimes, from moderate to
saturated, for the first time, closed-form expressions are derived for Bit
Error Rate (BER) and outage probability (P_out) of the proposed structure.
MATLAB simulations verified accuracy of the derived expressions. Considering
fixed and adaptive gain amplify and forward protocols at relay, it is shown
that adaptive gain relay is less sensitive to the number of users within the
cell. It is also shown that fixed gain relay, despite its low complexity, has
better performance; because its gain is adjusted such that the performance be
favorable even at the worst case scenario.
| eess.SP | this paper investigates performance of a relay assisted hybrid free space optical radio frequency fsorf communication system the proposed structure is particularly recommended anywhere that direct rf communication between mobile users and base station is not possible due to atmospheric conditions in this system a multiuser rf link connects mobile users to relay and a fso link connects relay to the base station it is the first time that effect of number of users within the cell on the performance of such structure is investigated also it is the first time that performance of a dual hop hybrid fso rf system is investigated in negative exponential atmospheric turbulence considering wide range of atmospheric turbulence regimes from moderate to saturated for the first time closedform expressions are derived for bit error rate ber and outage probability p_out of the proposed structure matlab simulations verified accuracy of the derived expressions considering fixed and adaptive gain amplify and forward protocols at relay it is shown that adaptive gain relay is less sensitive to the number of users within the cell it is also shown that fixed gain relay despite its low complexity has better performance because its gain is adjusted such that the performance be favorable even at the worst case scenario | [['this', 'paper', 'investigates', 'performance', 'of', 'a', 'relay', 'assisted', 'hybrid', 'free', 'space', 'optical', 'radio', 'frequency', 'fsorf', 'communication', 'system', 'the', 'proposed', 'structure', 'is', 'particularly', 'recommended', 'anywhere', 'that', 'direct', 'rf', 'communication', 'between', 'mobile', 'users', 'and', 'base', 'station', 'is', 'not', 'possible', 'due', 'to', 'atmospheric', 'conditions', 'in', 'this', 'system', 'a', 'multiuser', 'rf', 'link', 'connects', 'mobile', 'users', 'to', 'relay', 'and', 'a', 'fso', 'link', 'connects', 'relay', 'to', 'the', 'base', 'station', 'it', 'is', 'the', 'first', 'time', 'that', 'effect', 'of', 'number', 'of', 'users', 'within', 'the', 'cell', 'on', 'the', 'performance', 'of', 'such', 'structure', 'is', 'investigated', 'also', 'it', 'is', 'the', 'first', 'time', 'that', 'performance', 'of', 'a', 'dual', 'hop', 'hybrid', 'fso', 'rf', 'system', 'is', 'investigated', 'in', 'negative', 'exponential', 'atmospheric', 'turbulence', 'considering', 'wide', 'range', 'of', 'atmospheric', 'turbulence', 'regimes', 'from', 'moderate', 'to', 'saturated', 'for', 'the', 'first', 'time', 'closedform', 'expressions', 'are', 'derived', 'for', 'bit', 'error', 'rate', 'ber', 'and', 'outage', 'probability', 'p_out', 'of', 'the', 'proposed', 'structure', 'matlab', 'simulations', 'verified', 'accuracy', 'of', 'the', 'derived', 'expressions', 'considering', 'fixed', 'and', 'adaptive', 'gain', 'amplify', 'and', 'forward', 'protocols', 'at', 'relay', 'it', 'is', 'shown', 'that', 'adaptive', 'gain', 'relay', 'is', 'less', 'sensitive', 'to', 'the', 'number', 'of', 'users', 'within', 'the', 'cell', 'it', 'is', 'also', 'shown', 'that', 'fixed', 'gain', 'relay', 'despite', 'its', 'low', 'complexity', 'has', 'better', 'performance', 'because', 'its', 'gain', 'is', 'adjusted', 'such', 'that', 'the', 'performance', 'be', 'favorable', 'even', 'at', 'the', 'worst', 'case', 'scenario']] | [-0.24400262382554344, 0.05413311942253244, -0.019310080911964178, 0.04101812354602036, -0.07802414579866186, -0.24904184068138732, 0.13333970816242263, 0.4096696196685425, -0.25330199045908935, -0.26067556360732036, 0.0645832627082609, -0.21423463874750517, -0.17640512172159467, 0.2005087571579553, -0.08955829503888077, 0.034427801685733055, 0.06551977584548473, 0.07509241242777182, -0.011268628383797268, -0.26440071922718017, 0.25185190254831286, 0.19808508324632912, 0.36584071028291393, 0.04519642259854306, 0.1087324165440561, -0.029057495698163457, 0.002029303376647559, -0.02662662662909384, -0.10213745545556058, 0.02338028167771024, 0.31717860561006805, 0.14883413279215185, 0.2588006649355729, -0.38443450407797924, -0.2617193559567894, 0.06750085336517132, 0.17116223774186412, 0.03183072420398585, -0.035577580460311585, -0.23827838445746263, 0.1482300486428993, -0.25226783962545996, -0.04292284337242254, 0.04123961014682026, -0.057677454622596075, 0.05739595173273001, -0.33064048630647747, 0.0014071537259159584, -0.02149223623369513, 0.06369974478660374, -0.03833533420325502, -0.09198867956579676, -0.0148460819045055, 0.19333789398967238, 0.0332736133989927, -0.010053329729546378, 0.10488934124236186, -0.10208523292406395, -0.05584321447322813, 0.3742225151999216, -0.0010956529155819181, -0.2172545215012461, 0.18736912802966874, -0.13114678665870827, -0.060041248299288405, 0.1942662854888365, 0.21133116798744978, 0.044724910624735235, -0.16413397982557254, 0.037455710328298815, -0.0032028724488459134, 0.1898524300663166, 0.1069440454462962, 0.10169874079543295, 0.14088189894774636, 0.21446878136398548, 0.1322308821363027, 0.12466137351091666, -0.1289561327388644, -0.11911605745833868, -0.2176856398916665, -0.1406427710258589, -0.23120191298496495, 0.007424650030418379, -0.09486298916676766, -0.06214247427576636, 0.35497669661061115, 0.13897714332224018, 0.08020667521880147, 0.09096384913945775, 0.406633984350987, 0.13939519757605448, 0.03396855628465494, 0.11907879849538651, 0.23567539173664087, 0.11643255231723759, 0.14030779891928133, -0.24354070540334868, 0.09222399570609323, 0.0021449966160090347] |
1,803.00712 | A Factoid Question Answering System for Vietnamese | In this paper, we describe the development of an end-to-end factoid question
answering system for the Vietnamese language. This system combines both
statistical models and ontology-based methods in a chain of processing modules
to provide high-quality mappings from natural language text to entities. We
present the challenges in the development of such an intelligent user interface
for an isolating language like Vietnamese and show that techniques developed
for inflectional languages cannot be applied "as is". Our question answering
system can answer a wide range of general knowledge questions with promising
accuracy on a test set.
| cs.CL | in this paper we describe the development of an endtoend factoid question answering system for the vietnamese language this system combines both statistical models and ontologybased methods in a chain of processing modules to provide highquality mappings from natural language text to entities we present the challenges in the development of such an intelligent user interface for an isolating language like vietnamese and show that techniques developed for inflectional languages cannot be applied as is our question answering system can answer a wide range of general knowledge questions with promising accuracy on a test set | [['in', 'this', 'paper', 'we', 'describe', 'the', 'development', 'of', 'an', 'endtoend', 'factoid', 'question', 'answering', 'system', 'for', 'the', 'vietnamese', 'language', 'this', 'system', 'combines', 'both', 'statistical', 'models', 'and', 'ontologybased', 'methods', 'in', 'a', 'chain', 'of', 'processing', 'modules', 'to', 'provide', 'highquality', 'mappings', 'from', 'natural', 'language', 'text', 'to', 'entities', 'we', 'present', 'the', 'challenges', 'in', 'the', 'development', 'of', 'such', 'an', 'intelligent', 'user', 'interface', 'for', 'an', 'isolating', 'language', 'like', 'vietnamese', 'and', 'show', 'that', 'techniques', 'developed', 'for', 'inflectional', 'languages', 'can', 'not', 'be', 'applied', 'as', 'is', 'our', 'question', 'answering', 'system', 'can', 'answer', 'a', 'wide', 'range', 'of', 'general', 'knowledge', 'questions', 'with', 'promising', 'accuracy', 'on', 'a', 'test', 'set']] | [-0.08077061529426525, -0.02953994879574869, -0.02634328793161937, 0.08636494207469998, -0.13110982402577065, -0.15758173596987035, 0.019591266112305068, 0.3839482295540317, -0.31814908277010545, -0.3395951646574152, 0.06263600854072138, -0.2704683374904562, -0.16123636590782553, 0.2766780790795262, -0.14299248616346935, 0.0776916193717625, 0.13306530032423325, 0.03294175982622013, -0.011370638014341239, -0.25309835174509016, 0.34218448598888546, 0.019513875799020752, 0.2914452842184498, 0.09254688503763948, 0.12031123907460521, -0.006860312872352854, -0.00308152038390593, -0.022060851469480742, -0.10078118572505446, 0.19610873438068666, 0.39935108604235364, 0.2739014168958723, 0.3225985123717692, -0.38875967778343085, -0.20357098502669638, 0.034060173777106684, 0.17167206203642613, 0.12567427937756293, -0.06464257098681021, -0.3107878457036956, 0.11189494993838404, -0.18861332598802014, -0.009271634388521003, -0.14329989629428988, 0.013887410527483249, -0.018282721100452665, -0.26228654195559403, -0.051493395236320794, 0.15686257342167664, 0.14636672823689878, -0.05691669033937311, -0.06019148900910901, 0.10588672956509981, 0.19132632162897303, -0.011915365636250877, 0.07981394915138178, 0.10843012876769838, -0.15111228598107118, -0.19660868474359935, 0.4035907138604671, -0.07026288573251804, -0.22927418405500552, 0.2499272475639979, -0.03383466175485713, -0.209638747672822, 0.01736359768741143, 0.23255981081335145, 0.0943679509194529, -0.20808950113132596, 0.08281472054053059, -0.053338296963678054, 0.237430722937764, 0.04161627087402545, -0.021671141771245555, 0.2535476068830273, 0.2709649108001031, 0.015320696499353895, 0.12503089940946666, 0.00522533666662639, -0.009830500838385584, -0.21608674404948638, -0.21182884861870357, -0.12119732514596156, -0.012802880616163748, -0.04118613942379549, -0.1854986931818227, 0.4024983227524596, 0.2520171600344933, 0.1613485493386785, 0.082928654087785, 0.2774689013119011, 0.04450983472042935, 0.04338543466292322, 0.07867004088135825, 0.08694392167793315, -0.0009129691267541299, 0.15840959863271564, -0.1162125635855773, 0.06357220525872738, 0.04936943006274911] |
1,803.00713 | Formation of the active star forming region LHA 120-N 44 triggered by
tidally-driven colliding HI flows | N44 is the second active site of high mass star formation next to R136 in the
Large Magellanic Cloud (LMC). We carried out a detailed analysis of HI at 60
arcsec resolution by using the ATCA & Parkes data. We presented decomposition
of the HI emission into two velocity components (the L- and D-components) with
the velocity separation of 60 km s$^{-1}$. In addition, we newly defined the
I-component whose velocity is intermediate between the L- and D-components. The
D-component was used to derive the rotation curve of the LMC disk, which is
consistent with the stellar rotation curve (Alves et al. 2000). Toward the
active cluster forming region of LHA 120-N 44, the three velocity components of
HI gas show signatures of dynamical interaction including bridges and
complementary spatial distributions. We hypothesize that the L- and
D-components have been colliding with each other since 5 Myrs ago and the
interaction triggered formation of the O and early B stars ionizing N44. In the
hypothesis the I-component is interpreted as decelerated gas in terms of
momentum exchange in the collisional interaction of the L- and D-components. In
the N44 region the Planck sub-mm dust optical depth is correlated with the HI
intensity, which is well approximated by a linear regression. We found that the
N44 region shows a significantly steeper regression line than in the Bar region
indicating less dust abundance in the N44 region, which is ascribed to the
tidal interaction between the LMC with the SMC 0.2 Gyrs ago.
| astro-ph.GA | n44 is the second active site of high mass star formation next to r136 in the large magellanic cloud lmc we carried out a detailed analysis of hi at 60 arcsec resolution by using the atca parkes data we presented decomposition of the hi emission into two velocity components the l and dcomponents with the velocity separation of 60 km s1 in addition we newly defined the icomponent whose velocity is intermediate between the l and dcomponents the dcomponent was used to derive the rotation curve of the lmc disk which is consistent with the stellar rotation curve alves et al 2000 toward the active cluster forming region of lha 120n 44 the three velocity components of hi gas show signatures of dynamical interaction including bridges and complementary spatial distributions we hypothesize that the l and dcomponents have been colliding with each other since 5 myrs ago and the interaction triggered formation of the o and early b stars ionizing n44 in the hypothesis the icomponent is interpreted as decelerated gas in terms of momentum exchange in the collisional interaction of the l and dcomponents in the n44 region the planck submm dust optical depth is correlated with the hi intensity which is well approximated by a linear regression we found that the n44 region shows a significantly steeper regression line than in the bar region indicating less dust abundance in the n44 region which is ascribed to the tidal interaction between the lmc with the smc 02 gyrs ago | [['n44', 'is', 'the', 'second', 'active', 'site', 'of', 'high', 'mass', 'star', 'formation', 'next', 'to', 'r136', 'in', 'the', 'large', 'magellanic', 'cloud', 'lmc', 'we', 'carried', 'out', 'a', 'detailed', 'analysis', 'of', 'hi', 'at', '60', 'arcsec', 'resolution', 'by', 'using', 'the', 'atca', 'parkes', 'data', 'we', 'presented', 'decomposition', 'of', 'the', 'hi', 'emission', 'into', 'two', 'velocity', 'components', 'the', 'l', 'and', 'dcomponents', 'with', 'the', 'velocity', 'separation', 'of', '60', 'km', 's1', 'in', 'addition', 'we', 'newly', 'defined', 'the', 'icomponent', 'whose', 'velocity', 'is', 'intermediate', 'between', 'the', 'l', 'and', 'dcomponents', 'the', 'dcomponent', 'was', 'used', 'to', 'derive', 'the', 'rotation', 'curve', 'of', 'the', 'lmc', 'disk', 'which', 'is', 'consistent', 'with', 'the', 'stellar', 'rotation', 'curve', 'alves', 'et', 'al', '2000', 'toward', 'the', 'active', 'cluster', 'forming', 'region', 'of', 'lha', '120n', '44', 'the', 'three', 'velocity', 'components', 'of', 'hi', 'gas', 'show', 'signatures', 'of', 'dynamical', 'interaction', 'including', 'bridges', 'and', 'complementary', 'spatial', 'distributions', 'we', 'hypothesize', 'that', 'the', 'l', 'and', 'dcomponents', 'have', 'been', 'colliding', 'with', 'each', 'other', 'since', '5', 'myrs', 'ago', 'and', 'the', 'interaction', 'triggered', 'formation', 'of', 'the', 'o', 'and', 'early', 'b', 'stars', 'ionizing', 'n44', 'in', 'the', 'hypothesis', 'the', 'icomponent', 'is', 'interpreted', 'as', 'decelerated', 'gas', 'in', 'terms', 'of', 'momentum', 'exchange', 'in', 'the', 'collisional', 'interaction', 'of', 'the', 'l', 'and', 'dcomponents', 'in', 'the', 'n44', 'region', 'the', 'planck', 'submm', 'dust', 'optical', 'depth', 'is', 'correlated', 'with', 'the', 'hi', 'intensity', 'which', 'is', 'well', 'approximated', 'by', 'a', 'linear', 'regression', 'we', 'found', 'that', 'the', 'n44', 'region', 'shows', 'a', 'significantly', 'steeper', 'regression', 'line', 'than', 'in', 'the', 'bar', 'region', 'indicating', 'less', 'dust', 'abundance', 'in', 'the', 'n44', 'region', 'which', 'is', 'ascribed', 'to', 'the', 'tidal', 'interaction', 'between', 'the', 'lmc', 'with', 'the', 'smc', '02', 'gyrs', 'ago']] | [-0.10482986579136923, 0.1057575471252203, -0.06287230846332387, 0.055524947659578175, -0.03664276932226494, -0.06760365917161107, 0.02190397025598213, 0.3935367902778089, -0.19120860936772077, -0.3266113170608878, 0.0492597826262936, -0.2644786064354703, -0.027040639149956407, 0.1346969652296975, -0.002237378891208209, -0.04244715629820712, 0.021193140753544868, -0.06882405399624258, -0.03857592603191733, -0.24152955399872736, 0.2754829282797873, 0.081154689617455, 0.16686458742804824, -0.008957024886738508, 0.08365925370203331, -0.08840847244602629, -0.09620377735793591, -0.019824474416673184, -0.1499171323592891, 0.08437828718451783, 0.19302865282446147, 0.0808904798082076, 0.19767076165042818, -0.3420490687573329, -0.19936107475031167, 0.04516985906288028, 0.21381334759294987, 0.0223395981346257, -0.0044815877303481105, -0.29074835393950343, 0.035125395776703955, -0.20640915897488593, -0.19426304995268584, 0.09189507476123981, 0.10856291468814015, 0.023991655256599187, -0.23140375808405225, 0.15058673736499623, 0.010251749716582707, 0.11714271642081439, -0.08312471741903574, -0.11485518918000162, -0.10259334995597601, 0.037120723051950334, 0.0157039257613942, 0.11382531859166921, 0.17484784636087716, -0.11540258256997914, -0.00044660608097910883, 0.3764295351784676, -0.09410023500976968, -0.03136076263338328, 0.22701908370107413, -0.21741075472254306, -0.15756567026954144, 0.17365704513527452, 0.11363128759106621, 0.07928363702259958, -0.12284623805433512, 0.05458999975514598, -0.0586570244692266, 0.19740894830413164, 0.0758459343649447, 0.028225938275456428, 0.27999927653709894, 0.10206685380544514, 0.032756757269089574, 0.12149057434895076, -0.25889125363435594, -0.0989800233405549, -0.255500178117305, -0.11291988052427769, -0.11599252868536859, 0.041780764065217225, -0.1313206276312121, -0.07358461260795593, 0.29897990632988514, 0.08125771854911, 0.2599641541633755, 0.022427897594403477, 0.28446667462959885, 0.07352969569666311, 0.12854409400490113, 0.15154972953442483, 0.3013668777653947, 0.19066485965065658, 0.10211762617714704, -0.25507201410701963, 0.05253104480169714, 0.03817871590331197] |
1,803.00714 | Interference in spin-orbit coupled transverse magnetic focusing;
emergent phase due to in-plane magnetic fields | Spin-orbit (SO) interactions in two dimensional systems split the Fermi
surface, and allow for the spatial separation of spin-states via transverse
magnetic focusing (TMF). In this work, we consider the case of combined Rashba
and Zeeman interactions, which leads to a Fermi surface without cylindrical
symmetry. While the classical trajectories are effectively unchanged, we
predict an additional contribution to the phase, linear in the applied in-plane
magnetic field. We show that this term is unique to TMF, and vanishes for
magnetic (Shubnikov de Haas) oscillations. Finally we propose some experimental
signatures of this phase.
| cond-mat.mes-hall | spinorbit so interactions in two dimensional systems split the fermi surface and allow for the spatial separation of spinstates via transverse magnetic focusing tmf in this work we consider the case of combined rashba and zeeman interactions which leads to a fermi surface without cylindrical symmetry while the classical trajectories are effectively unchanged we predict an additional contribution to the phase linear in the applied inplane magnetic field we show that this term is unique to tmf and vanishes for magnetic shubnikov de haas oscillations finally we propose some experimental signatures of this phase | [['spinorbit', 'so', 'interactions', 'in', 'two', 'dimensional', 'systems', 'split', 'the', 'fermi', 'surface', 'and', 'allow', 'for', 'the', 'spatial', 'separation', 'of', 'spinstates', 'via', 'transverse', 'magnetic', 'focusing', 'tmf', 'in', 'this', 'work', 'we', 'consider', 'the', 'case', 'of', 'combined', 'rashba', 'and', 'zeeman', 'interactions', 'which', 'leads', 'to', 'a', 'fermi', 'surface', 'without', 'cylindrical', 'symmetry', 'while', 'the', 'classical', 'trajectories', 'are', 'effectively', 'unchanged', 'we', 'predict', 'an', 'additional', 'contribution', 'to', 'the', 'phase', 'linear', 'in', 'the', 'applied', 'inplane', 'magnetic', 'field', 'we', 'show', 'that', 'this', 'term', 'is', 'unique', 'to', 'tmf', 'and', 'vanishes', 'for', 'magnetic', 'shubnikov', 'de', 'haas', 'oscillations', 'finally', 'we', 'propose', 'some', 'experimental', 'signatures', 'of', 'this', 'phase']] | [-0.2501594679519296, 0.20010222002824873, -0.06722435262673436, 0.07559278786945295, -0.09360923370386058, -0.13217512945684187, 0.013188863853042193, 0.3705731229262149, -0.2863633950250818, -0.30454808808466854, -0.012476683161444367, -0.2454852210456862, -0.15303263850411045, 0.18049087435839342, 0.003140245769866445, -0.005572905324949348, -0.0003737567408763348, -0.00905543285610273, -0.10351951027219679, -0.21244395516832618, 0.363234980725386, 0.02099399452910144, 0.2986815864705738, 0.07609497621516756, 0.06815723260242908, 0.04655692574290678, 0.0708753765421979, 0.050330225883566955, -0.12245259816104118, 0.036280936799309355, 0.20740986235707284, -0.09065198991571534, 0.17436028361578096, -0.4527047343274697, -0.19063235107967827, 0.06114177116034354, 0.15017962161986592, 0.20512258880796466, -0.060620965728377725, -0.29946423585259135, 0.00586014435418505, -0.1317402890665417, -0.12918253356907913, -0.12213261084670717, -0.028894975061894968, -0.03784998097182053, -0.2349595244716298, 0.10527197916080501, 0.10613259580977102, 0.09276362599686105, -0.10820319722010259, -0.06404331304563923, -0.03815733677053705, 0.0750811568986466, 0.09003670583107568, 0.06818418211719775, 0.09794288605917245, -0.106401288350366, -0.09630536803222717, 0.34001456732623914, -0.11922914881142788, -0.16960919411615172, 0.18098411619653332, -0.1889895510839972, -0.12399899446593717, 0.136726778386993, 0.15944547976981452, 0.06758946783721764, -0.0932349919519843, 0.1285653940551825, 0.01930500313322595, 0.15532535320380703, 0.04045851361700036, 0.025906253588742555, 0.2494372249422397, 0.12376697815117485, 0.07920112431128608, 0.15602288756301588, -0.17550087861340255, -0.0326368021283378, -0.2597580737870266, -0.17497263961729217, -0.15897689854845087, 0.05279007884971005, -0.0036383271609009443, -0.1910624343634365, 0.428290951164796, 0.166704687863301, 0.21463873687180432, -0.02855339497352574, 0.28368763050975954, 0.08807794239181292, 0.05410053337765659, 0.028163409559056163, 0.2752259130099853, 0.1544000990242955, 0.11929896274987767, -0.32153460158015346, -0.03273646547855373, 0.027453848507572362] |
1,803.00715 | Robust Multivariate Nonparametric Tests via Projection-Averaging | In this work, we generalize the Cram\'er-von Mises statistic via
projection-averaging to obtain a robust test for the multivariate two-sample
problem. The proposed test is consistent against all fixed alternatives, robust
to heavy-tailed data and minimax rate optimal against a certain class of
alternatives. Our test statistic is completely free of tuning parameters and is
computationally efficient even in high dimensions. When the dimension tends to
infinity, the proposed test is shown to have comparable power to the existing
high-dimensional mean tests under certain location models. As a by-product of
our approach, we introduce a new metric called the angular distance which can
be thought of as a robust alternative to the Euclidean distance. Using the
angular distance, we connect the proposed method to the reproducing kernel
Hilbert space approach. In addition to the Cram\'er-von Mises statistic, we
demonstrate that the projection-averaging technique can be used to define
robust, multivariate tests in many other problems.
| math.ST stat.ME stat.TH | in this work we generalize the cramervon mises statistic via projectionaveraging to obtain a robust test for the multivariate twosample problem the proposed test is consistent against all fixed alternatives robust to heavytailed data and minimax rate optimal against a certain class of alternatives our test statistic is completely free of tuning parameters and is computationally efficient even in high dimensions when the dimension tends to infinity the proposed test is shown to have comparable power to the existing highdimensional mean tests under certain location models as a byproduct of our approach we introduce a new metric called the angular distance which can be thought of as a robust alternative to the euclidean distance using the angular distance we connect the proposed method to the reproducing kernel hilbert space approach in addition to the cramervon mises statistic we demonstrate that the projectionaveraging technique can be used to define robust multivariate tests in many other problems | [['in', 'this', 'work', 'we', 'generalize', 'the', 'cramervon', 'mises', 'statistic', 'via', 'projectionaveraging', 'to', 'obtain', 'a', 'robust', 'test', 'for', 'the', 'multivariate', 'twosample', 'problem', 'the', 'proposed', 'test', 'is', 'consistent', 'against', 'all', 'fixed', 'alternatives', 'robust', 'to', 'heavytailed', 'data', 'and', 'minimax', 'rate', 'optimal', 'against', 'a', 'certain', 'class', 'of', 'alternatives', 'our', 'test', 'statistic', 'is', 'completely', 'free', 'of', 'tuning', 'parameters', 'and', 'is', 'computationally', 'efficient', 'even', 'in', 'high', 'dimensions', 'when', 'the', 'dimension', 'tends', 'to', 'infinity', 'the', 'proposed', 'test', 'is', 'shown', 'to', 'have', 'comparable', 'power', 'to', 'the', 'existing', 'highdimensional', 'mean', 'tests', 'under', 'certain', 'location', 'models', 'as', 'a', 'byproduct', 'of', 'our', 'approach', 'we', 'introduce', 'a', 'new', 'metric', 'called', 'the', 'angular', 'distance', 'which', 'can', 'be', 'thought', 'of', 'as', 'a', 'robust', 'alternative', 'to', 'the', 'euclidean', 'distance', 'using', 'the', 'angular', 'distance', 'we', 'connect', 'the', 'proposed', 'method', 'to', 'the', 'reproducing', 'kernel', 'hilbert', 'space', 'approach', 'in', 'addition', 'to', 'the', 'cramervon', 'mises', 'statistic', 'we', 'demonstrate', 'that', 'the', 'projectionaveraging', 'technique', 'can', 'be', 'used', 'to', 'define', 'robust', 'multivariate', 'tests', 'in', 'many', 'other', 'problems']] | [-0.023183363279041656, 0.02635151318737056, -0.14781944387671508, 0.1506725104481554, -0.07850496848745368, -0.1900035296140689, 0.028325716884246743, 0.3651872295155829, -0.2583240361464228, -0.2685155293088577, 0.10777193627752413, -0.22318572875148818, -0.1438306444963696, 0.24016067336063857, -0.1435282956930547, 0.14688473361623444, 0.041816574892674395, 0.021437658496152343, -0.07409750588437591, -0.28888557277151133, 0.29938843623077604, 0.11548152166035246, 0.362853063380017, -0.025383629280315966, 0.10505295342429438, -0.012719705935226741, -0.025847520867934803, 0.06811139278788747, -0.1254967006163164, 0.10794294692098096, 0.2512017535893416, 0.175766440170811, 0.3233814248510825, -0.3343526173894312, -0.1929690373964072, 0.16847335394423188, 0.10764220513683422, 0.08296375132540204, 0.006489455821662167, -0.270377371028017, 0.11059256814103695, -0.16928107190414582, -0.1410180210524689, -0.13976350844551633, -0.03318093065248522, 0.008201795745811431, -0.36243930552459136, 0.1034922387657894, 0.04399596126384887, -0.0007953111940593112, -0.03407826811209126, -0.10739357042083748, 0.0540379492042501, 0.07002465020780743, 0.08513730400381914, 0.02663671412791302, 0.09362334658196227, -0.04823880594716791, -0.12239862136920196, 0.346345233466184, -0.06316509875172165, -0.2815784432444405, 0.22065471223817248, -0.11957151540768107, -0.11692068996090516, 0.041945383637486136, 0.2026760202522079, 0.15874816606649095, -0.14452225618641534, 0.04855308749521261, -0.05080257651998716, 0.13176759337592456, 0.05439353182765783, -0.00038796524803330694, 0.1474363537097435, 0.14093403048582034, 0.11140427124965023, 0.17927930103439924, -0.15218446835619853, -0.06671767685489327, -0.29928281146034696, -0.1650637887247832, -0.23170182153086477, 0.004287772897168312, -0.1550639185571687, -0.1904430375287988, 0.38261869814843424, 0.22334279681805497, 0.20226749790576742, 0.12375968008140845, 0.2939335079300613, 0.08337479427736862, 0.07366609301880683, 0.07782105746636399, 0.21792017153214688, 0.11269062430311749, -0.0032942083670325526, -0.17065001684971445, 0.08112353897878742, 0.0686780347038377] |
1,803.00716 | Anisotropic exciton transport in transition-metal dichalcogenides | Due to the Coulomb interaction exciton eignestates in monolayer transitional
metal dichalcogenides are coherent superposition of two valleys. The exciton
band which couples to the transverse electric mode of light has parabolic
dispersion for the center of mass momentum, whereas the one which couples to
the transverse magnetic mode has both parabolic and linear components. In this
work we present an experimental proposal to observe the signatures of linear
component of the dispersion. In particular, it is demonstrated that by pumping
the system with linearly polarized light the exciton transport is anisotropic
compared to circularly polarized pump. We show that the results persist for
moderate level of disorder present in realistic systems. Finally, we
demonstrate that similar effects can be obtained for positively detuned
exciton-polaritons, in less stringent experimental requirements compared to
bare exciton case.
| cond-mat.mes-hall | due to the coulomb interaction exciton eignestates in monolayer transitional metal dichalcogenides are coherent superposition of two valleys the exciton band which couples to the transverse electric mode of light has parabolic dispersion for the center of mass momentum whereas the one which couples to the transverse magnetic mode has both parabolic and linear components in this work we present an experimental proposal to observe the signatures of linear component of the dispersion in particular it is demonstrated that by pumping the system with linearly polarized light the exciton transport is anisotropic compared to circularly polarized pump we show that the results persist for moderate level of disorder present in realistic systems finally we demonstrate that similar effects can be obtained for positively detuned excitonpolaritons in less stringent experimental requirements compared to bare exciton case | [['due', 'to', 'the', 'coulomb', 'interaction', 'exciton', 'eignestates', 'in', 'monolayer', 'transitional', 'metal', 'dichalcogenides', 'are', 'coherent', 'superposition', 'of', 'two', 'valleys', 'the', 'exciton', 'band', 'which', 'couples', 'to', 'the', 'transverse', 'electric', 'mode', 'of', 'light', 'has', 'parabolic', 'dispersion', 'for', 'the', 'center', 'of', 'mass', 'momentum', 'whereas', 'the', 'one', 'which', 'couples', 'to', 'the', 'transverse', 'magnetic', 'mode', 'has', 'both', 'parabolic', 'and', 'linear', 'components', 'in', 'this', 'work', 'we', 'present', 'an', 'experimental', 'proposal', 'to', 'observe', 'the', 'signatures', 'of', 'linear', 'component', 'of', 'the', 'dispersion', 'in', 'particular', 'it', 'is', 'demonstrated', 'that', 'by', 'pumping', 'the', 'system', 'with', 'linearly', 'polarized', 'light', 'the', 'exciton', 'transport', 'is', 'anisotropic', 'compared', 'to', 'circularly', 'polarized', 'pump', 'we', 'show', 'that', 'the', 'results', 'persist', 'for', 'moderate', 'level', 'of', 'disorder', 'present', 'in', 'realistic', 'systems', 'finally', 'we', 'demonstrate', 'that', 'similar', 'effects', 'can', 'be', 'obtained', 'for', 'positively', 'detuned', 'excitonpolaritons', 'in', 'less', 'stringent', 'experimental', 'requirements', 'compared', 'to', 'bare', 'exciton', 'case']] | [-0.13191643715210594, 0.20688166844568637, -0.04617618177252919, 0.03477150742259961, -0.036442826303945325, -0.16877202982249767, 0.0027741627027489135, 0.43721949019983636, -0.2488702010717799, -0.2583164299469886, -0.029082671635777258, -0.2960882872732273, -0.092497450071943, 0.22818156854256488, 0.027256635165384124, 0.012432106893506151, 0.03749569455759405, -0.0553579536186698, -0.02037683314011335, -0.19047226809284915, 0.3324417071764483, 0.002764488931800892, 0.3273133497629593, 0.09852789802852073, 0.06677615977545727, 0.007449823975521348, 0.07100019273139647, -0.011171818099248765, -0.08368882309525306, 0.08407849131443941, 0.22900934686316107, -0.08725370999092041, 0.22531845164137768, -0.4157131925336461, -0.19702309289723008, 0.051336585307744015, 0.1684378997682083, 0.19074921506463982, -0.07783486822675635, -0.273985856085835, 0.04652160048526503, -0.14883428266091245, -0.15143601403488263, -0.06251610172634471, 0.013722551006601373, 0.014805485800242246, -0.267053333548968, 0.09211334039860253, 0.041474538582026155, 0.008501486943117273, -0.08057912000812896, -0.0936464166630115, -0.11233307316781146, 0.028089281908278144, 0.08401834595003235, 0.03055985407567576, 0.14952472045864743, -0.14223866385265269, -0.10803320307506999, 0.3932968536252851, -0.1283372686276692, -0.15370678930863071, 0.1745529591953799, -0.20953554769547017, -0.040104343152757904, 0.16774927052919433, 0.18337986454951452, 0.10726717055024607, -0.08951124103058741, 0.03551906848338488, -0.058540133165139986, 0.18718378285098988, 0.04505255235595378, 0.11978536651386365, 0.22071648806111135, 0.1733903245663326, 0.05599739497527263, 0.14300321836333804, -0.11548845776454059, -0.06856402675899219, -0.22292684680267946, -0.14387043662119045, -0.17313545428471877, 0.05893853918732658, -0.015932580025118617, -0.12198587805171733, 0.4391994550192134, 0.13352924504720454, 0.17084812460668775, -0.009614080350512444, 0.2966166655255009, 0.1767287178507158, 0.07216633646401452, 0.03555981515439352, 0.35305990782434316, 0.1667322270301129, 0.09187463624750389, -0.2948062866648187, -0.015800414309809125, -0.04606174067038098] |
1,803.00717 | Nonlinear uniaxial pressure dependence of $T_c$ in iron-based
superconductors | We have systematically studied the effects of in-plane uniaxial pressure $p$
on the superconducting transition temperature $T_c$ in many iron-based
superconductors. The change of $T_c$ with $p$ is composed of linear and
nonlinear components. The latter can be described as a quadratic term plus a
much smaller fourth-order term. In contrast to the linear component, the
nonlinear $p$ dependence of $T_c$ displays a pronounced in-plane anisotropy,
which is similar to the anisotropic response of the resistivity to $p$. As a
result, it can be attributed to the coupling between the superconducting and
nematic orders, in accordance with the expectations of a phenomenological
Landau theory. Our results provide direct evidences for the interplay between
nematic fluctuations and superconductivity, which may be a common behavior in
iron-based superconductors.
| cond-mat.supr-con | we have systematically studied the effects of inplane uniaxial pressure p on the superconducting transition temperature t_c in many ironbased superconductors the change of t_c with p is composed of linear and nonlinear components the latter can be described as a quadratic term plus a much smaller fourthorder term in contrast to the linear component the nonlinear p dependence of t_c displays a pronounced inplane anisotropy which is similar to the anisotropic response of the resistivity to p as a result it can be attributed to the coupling between the superconducting and nematic orders in accordance with the expectations of a phenomenological landau theory our results provide direct evidences for the interplay between nematic fluctuations and superconductivity which may be a common behavior in ironbased superconductors | [['we', 'have', 'systematically', 'studied', 'the', 'effects', 'of', 'inplane', 'uniaxial', 'pressure', 'p', 'on', 'the', 'superconducting', 'transition', 'temperature', 't_c', 'in', 'many', 'ironbased', 'superconductors', 'the', 'change', 'of', 't_c', 'with', 'p', 'is', 'composed', 'of', 'linear', 'and', 'nonlinear', 'components', 'the', 'latter', 'can', 'be', 'described', 'as', 'a', 'quadratic', 'term', 'plus', 'a', 'much', 'smaller', 'fourthorder', 'term', 'in', 'contrast', 'to', 'the', 'linear', 'component', 'the', 'nonlinear', 'p', 'dependence', 'of', 't_c', 'displays', 'a', 'pronounced', 'inplane', 'anisotropy', 'which', 'is', 'similar', 'to', 'the', 'anisotropic', 'response', 'of', 'the', 'resistivity', 'to', 'p', 'as', 'a', 'result', 'it', 'can', 'be', 'attributed', 'to', 'the', 'coupling', 'between', 'the', 'superconducting', 'and', 'nematic', 'orders', 'in', 'accordance', 'with', 'the', 'expectations', 'of', 'a', 'phenomenological', 'landau', 'theory', 'our', 'results', 'provide', 'direct', 'evidences', 'for', 'the', 'interplay', 'between', 'nematic', 'fluctuations', 'and', 'superconductivity', 'which', 'may', 'be', 'a', 'common', 'behavior', 'in', 'ironbased', 'superconductors']] | [-0.19287577943713774, 0.21295620253612657, -0.09184099244515574, 0.021257971285931057, -0.09188295011630371, -0.1415464369883199, 0.03941264630956871, 0.31482855685421135, -0.26089094219625825, -0.2781863696134043, -0.020768305142631845, -0.3444343215031993, -0.12144091436158984, 0.16964763935862315, 0.047858989220999536, 0.02468399773351848, -0.10376160467664401, 0.016370375437656463, -0.14107870506695547, -0.2405422174830049, 0.29226533158327495, 0.008535445150401857, 0.3113579569155321, 0.07542987021854118, 0.013534717498317597, -0.02528134787765642, 0.12918123083987407, 0.09324389554205395, -0.14833997049930667, 0.028055821364331577, 0.3191698718749519, -0.12379847432575411, 0.21671905157910215, -0.40151754222692004, -0.2511861291519987, 0.050746178562154194, 0.11097750479414586, 0.1116566103273293, -0.01143144412309907, -0.2323221526485646, 0.043191768216072686, -0.13929713362207016, -0.14173962483237984, -0.10301086434444028, -0.004345537680718634, -0.01894184222836639, -0.28791704837469356, 0.16238306363719324, 0.115494861241637, 0.10624112708434935, -0.06538402874924479, -0.13523249057978984, -0.043467875546036615, -0.020895000872394397, 0.132699829936471, 0.09500409192627385, 0.11023819327930964, -0.12069729210010596, -0.0874656815347927, 0.3768423308899242, -0.07577644693406506, -0.10066286565011574, 0.139021860369082, -0.14459423374916827, -0.07575143954627925, 0.1452146112985377, 0.14465578030683987, 0.04943879049581786, -0.1055077669868571, 0.0712739589078641, -0.016554870546632815, 0.19706460327974387, 0.02926141106420093, 0.06377261992551327, 0.23104898046909106, 0.19143404191662927, 0.016442225845879413, 0.14141467607872088, -0.061869096151360915, -0.04005583796635388, -0.27808290252846385, -0.13652698046690415, -0.17309319934186837, 0.04517103033047908, -0.09504384624932076, -0.1935612926969216, 0.390729636412173, 0.13366027893073532, 0.21712363457735923, -0.050800621726675814, 0.2227867813078716, 0.15798421174062358, 0.10296472071463035, 0.027406700315796548, 0.268598585356293, 0.1873607595584222, 0.12311277042202179, -0.32348367646484383, 0.1149747421750651, 0.004356700173091321] |
1,803.00718 | Smoothed Variable Sample-size Accelerated Proximal Methods for Nonsmooth
Stochastic Convex Programs | We consider minimizing $f(x) = \mathbb{E}[f(x,\omega)]$ when $f(x,\omega)$ is
possibly nonsmooth and either strongly convex or convex in $x$. (I) Strongly
convex. When $f(x,\omega)$ is $\mu-$strongly convex in $x$, we propose a
variable sample-size accelerated proximal scheme (VS-APM) and apply it on
$f_{\eta}(x)$, the ($\eta$-)Moreau smoothed variant of
$\mathbb{E}[f(x,\omega)]$; we term such a scheme as (m-VS-APM). We consider
three settings. (a) Bounded domains. In this setting, VS-APM displays linear
convergence in inexact gradient steps, each of which requires utilizing an
inner (SSG) scheme. Specifically, mVS-APM achieves an optimal oracle complexity
in SSG steps; (b) Unbounded domains. In this regime, under a weaker assumption
of suitable state-dependent bounds on subgradients, an unaccelerated variant
mVS-PM is linearly convergent; (c) Smooth ill-conditioned $f$. When $f$ is
$L$-smooth and $\kappa = L/\mu \ggg 1$, we employ mVS-APM where increasingly
accurate gradients $\nabla_x f_{\eta}(x)$ are obtained by VS-APM. Notably,
mVS-APM displays linear convergence and near-optimal complexity in inner
proximal evaluations (upto a log factor) compared to VS-APM. But, unlike a
direct application of VS-APM, this scheme is characterized by larger
steplengths and better empirical behavior; (II) Convex. When $f(x,\omega)$ is
merely convex but smoothable, by suitable choices of the smoothing, steplength,
and batch-size sequences, smoothed VS-APM (or sVS-APM) produces sequences for
which expected sub-optimality diminishes at the rate of $\mathcal{O}(1/k)$ with
an optimal oracle complexity of $\mathcal{O}(1/\epsilon^2)$. Finally, sVS-APM
and VS-APM produce sequences that converge almost surely to a solution of the
original problem.
| math.OC | we consider minimizing fx mathbbefxomega when fxomega is possibly nonsmooth and either strongly convex or convex in x i strongly convex when fxomega is mustrongly convex in x we propose a variable samplesize accelerated proximal scheme vsapm and apply it on f_etax the etamoreau smoothed variant of mathbbefxomega we term such a scheme as mvsapm we consider three settings a bounded domains in this setting vsapm displays linear convergence in inexact gradient steps each of which requires utilizing an inner ssg scheme specifically mvsapm achieves an optimal oracle complexity in ssg steps b unbounded domains in this regime under a weaker assumption of suitable statedependent bounds on subgradients an unaccelerated variant mvspm is linearly convergent c smooth illconditioned f when f is lsmooth and kappa lmu ggg 1 we employ mvsapm where increasingly accurate gradients nabla_x f_etax are obtained by vsapm notably mvsapm displays linear convergence and nearoptimal complexity in inner proximal evaluations upto a log factor compared to vsapm but unlike a direct application of vsapm this scheme is characterized by larger steplengths and better empirical behavior ii convex when fxomega is merely convex but smoothable by suitable choices of the smoothing steplength and batchsize sequences smoothed vsapm or svsapm produces sequences for which expected suboptimality diminishes at the rate of mathcalo1k with an optimal oracle complexity of mathcalo1epsilon2 finally svsapm and vsapm produce sequences that converge almost surely to a solution of the original problem | [['we', 'consider', 'minimizing', 'fx', 'mathbbefxomega', 'when', 'fxomega', 'is', 'possibly', 'nonsmooth', 'and', 'either', 'strongly', 'convex', 'or', 'convex', 'in', 'x', 'i', 'strongly', 'convex', 'when', 'fxomega', 'is', 'mustrongly', 'convex', 'in', 'x', 'we', 'propose', 'a', 'variable', 'samplesize', 'accelerated', 'proximal', 'scheme', 'vsapm', 'and', 'apply', 'it', 'on', 'f_etax', 'the', 'etamoreau', 'smoothed', 'variant', 'of', 'mathbbefxomega', 'we', 'term', 'such', 'a', 'scheme', 'as', 'mvsapm', 'we', 'consider', 'three', 'settings', 'a', 'bounded', 'domains', 'in', 'this', 'setting', 'vsapm', 'displays', 'linear', 'convergence', 'in', 'inexact', 'gradient', 'steps', 'each', 'of', 'which', 'requires', 'utilizing', 'an', 'inner', 'ssg', 'scheme', 'specifically', 'mvsapm', 'achieves', 'an', 'optimal', 'oracle', 'complexity', 'in', 'ssg', 'steps', 'b', 'unbounded', 'domains', 'in', 'this', 'regime', 'under', 'a', 'weaker', 'assumption', 'of', 'suitable', 'statedependent', 'bounds', 'on', 'subgradients', 'an', 'unaccelerated', 'variant', 'mvspm', 'is', 'linearly', 'convergent', 'c', 'smooth', 'illconditioned', 'f', 'when', 'f', 'is', 'lsmooth', 'and', 'kappa', 'lmu', 'ggg', '1', 'we', 'employ', 'mvsapm', 'where', 'increasingly', 'accurate', 'gradients', 'nabla_x', 'f_etax', 'are', 'obtained', 'by', 'vsapm', 'notably', 'mvsapm', 'displays', 'linear', 'convergence', 'and', 'nearoptimal', 'complexity', 'in', 'inner', 'proximal', 'evaluations', 'upto', 'a', 'log', 'factor', 'compared', 'to', 'vsapm', 'but', 'unlike', 'a', 'direct', 'application', 'of', 'vsapm', 'this', 'scheme', 'is', 'characterized', 'by', 'larger', 'steplengths', 'and', 'better', 'empirical', 'behavior', 'ii', 'convex', 'when', 'fxomega', 'is', 'merely', 'convex', 'but', 'smoothable', 'by', 'suitable', 'choices', 'of', 'the', 'smoothing', 'steplength', 'and', 'batchsize', 'sequences', 'smoothed', 'vsapm', 'or', 'svsapm', 'produces', 'sequences', 'for', 'which', 'expected', 'suboptimality', 'diminishes', 'at', 'the', 'rate', 'of', 'mathcalo1k', 'with', 'an', 'optimal', 'oracle', 'complexity', 'of', 'mathcalo1epsilon2', 'finally', 'svsapm', 'and', 'vsapm', 'produce', 'sequences', 'that', 'converge', 'almost', 'surely', 'to', 'a', 'solution', 'of', 'the', 'original', 'problem']] | [-0.11869084702776216, 0.05153732923165525, -0.06985149016262207, 0.07012192783501064, -0.03682548187339605, -0.21704318708898784, 0.049051687974807114, 0.4136726237410541, -0.3112743618658146, -0.20209970604628325, 0.12354089793551909, -0.25634763648278003, -0.13050171278425243, 0.1977000392741609, -0.142511123347027, 0.06372010549652395, 0.04637833522749896, 0.01406273346467505, -0.11362835275940597, -0.29881715711499013, 0.27071743711101937, 0.0019033896130830961, 0.21660091994456362, -0.011076827090504013, 0.12528430149935219, 0.008997744121629436, 0.03907534407907243, 0.0520402304596226, -0.11684298569323952, 0.09088210710389799, 0.24198044167209304, 0.13974576037962755, 0.35608270295308986, -0.36418228075782644, -0.12481402022068645, 0.13227628119794171, 0.1600577789297791, 0.018640600483433453, -0.04639998424440362, -0.2034275837539488, 0.09823446154114526, -0.08653446747392708, -0.08764922464425029, -0.08568774188531147, -0.010595751838864327, 0.04902172194413564, -0.3947565959172738, 0.09489835302577268, 0.10021067295207207, 0.042532975076266674, -0.03384372047107976, -0.1412654939993675, 0.036366483239318736, 0.0031577727485928016, 0.049375422722883686, 0.11243428279519667, 0.11849730886218005, -0.06694705246268531, -0.08056083041107014, 0.3188267786983059, -0.09135892045380158, -0.22844660675811976, 0.16306291398994918, -0.0990756156968205, -0.1172831495146076, 0.15913284118144924, 0.1624573931386735, 0.21652607944098556, -0.09872442818786664, 0.14778202723769682, -0.04853735237248144, 0.16841583879101274, 0.06950983898632847, 0.02035875103688559, 0.041563489642116244, 0.13286375817329335, 0.2093332359184995, 0.16340675221666628, -0.02493441126240198, -0.09884648775787593, -0.2821009538490244, -0.11968703447645641, -0.1829121317078998, 0.0392681497258976, -0.14428439440187138, -0.1802154099141699, 0.29264513955279464, 0.05449249888729613, 0.18755086113782152, 0.14596985441817614, 0.2949689901942249, 0.11978173013151253, 0.0007229377129257507, 0.1457400172277797, 0.15065420487911876, 0.06439098866867903, 0.04600267585058896, -0.22566189063005312, 0.10456176120742106, 0.11673149849433304] |
1,803.00719 | RankDCG: Rank-Ordering Evaluation Measure | Ranking is used for a wide array of problems, most notably information
retrieval (search). There are a number of popular approaches to the evaluation
of ranking such as Kendall's $\tau$, Average Precision, and nDCG. When dealing
with problems such as user ranking or recommendation systems, all these
measures suffer from various problems, including an inability to deal with
elements of the same rank, inconsistent and ambiguous lower bound scores, and
an inappropriate cost function. We propose a new measure, rankDCG, that
addresses these problems. This is a modification of the popular nDCG algorithm.
We provide a number of criteria for any effective ranking algorithm and show
that only rankDCG satisfies all of them. Results are presented on constructed
and real data sets. We release a publicly available rankDCG evaluation package.
| cs.IR cs.SI | ranking is used for a wide array of problems most notably information retrieval search there are a number of popular approaches to the evaluation of ranking such as kendalls tau average precision and ndcg when dealing with problems such as user ranking or recommendation systems all these measures suffer from various problems including an inability to deal with elements of the same rank inconsistent and ambiguous lower bound scores and an inappropriate cost function we propose a new measure rankdcg that addresses these problems this is a modification of the popular ndcg algorithm we provide a number of criteria for any effective ranking algorithm and show that only rankdcg satisfies all of them results are presented on constructed and real data sets we release a publicly available rankdcg evaluation package | [['ranking', 'is', 'used', 'for', 'a', 'wide', 'array', 'of', 'problems', 'most', 'notably', 'information', 'retrieval', 'search', 'there', 'are', 'a', 'number', 'of', 'popular', 'approaches', 'to', 'the', 'evaluation', 'of', 'ranking', 'such', 'as', 'kendalls', 'tau', 'average', 'precision', 'and', 'ndcg', 'when', 'dealing', 'with', 'problems', 'such', 'as', 'user', 'ranking', 'or', 'recommendation', 'systems', 'all', 'these', 'measures', 'suffer', 'from', 'various', 'problems', 'including', 'an', 'inability', 'to', 'deal', 'with', 'elements', 'of', 'the', 'same', 'rank', 'inconsistent', 'and', 'ambiguous', 'lower', 'bound', 'scores', 'and', 'an', 'inappropriate', 'cost', 'function', 'we', 'propose', 'a', 'new', 'measure', 'rankdcg', 'that', 'addresses', 'these', 'problems', 'this', 'is', 'a', 'modification', 'of', 'the', 'popular', 'ndcg', 'algorithm', 'we', 'provide', 'a', 'number', 'of', 'criteria', 'for', 'any', 'effective', 'ranking', 'algorithm', 'and', 'show', 'that', 'only', 'rankdcg', 'satisfies', 'all', 'of', 'them', 'results', 'are', 'presented', 'on', 'constructed', 'and', 'real', 'data', 'sets', 'we', 'release', 'a', 'publicly', 'available', 'rankdcg', 'evaluation', 'package']] | [-0.07569801040137043, 0.0004785524629719126, -0.03697575589355368, 0.11393867175614175, -0.10102725481847301, -0.185213846878077, 0.04620975218355083, 0.41274082536558404, -0.2422821275361527, -0.3498051745494684, 0.11882045678794384, -0.3301187494339851, -0.1413005409260782, 0.24420329314799835, -0.09267900212166401, 0.1020789240513785, 0.12671978466857511, 0.057893941564207824, -0.08462674460740975, -0.29959256317054567, 0.31124149959695596, 0.029575020082903882, 0.28042498087653744, 0.07102779549761461, 0.10884101371227119, 0.01536975703202188, -0.08817693171127197, 0.06812051237345888, -0.10849178312044107, 0.15967009397796714, 0.29781294322501006, 0.2636593474325939, 0.30974161067547706, -0.30670435905743104, -0.16816848496046777, 0.132687910581724, 0.08305946395983203, 0.07699518585577607, -0.06410945417950503, -0.26330781306784884, 0.0956928538158536, -0.17989846637759072, -0.023508548432101425, -0.1146259358815419, 0.0033600910862263004, 0.037472542733527146, -0.32108481044236287, 0.044916016804367805, 0.010435373317271185, 0.06006763110188051, -0.043032943362441775, -0.1947823820205835, 0.051100405265326394, 0.14104010258340097, 0.051724082313907835, 0.03031009956657027, 0.09691699541245516, -0.1455235111939076, -0.17388304083679731, 0.4091435146303131, -0.04235980873390172, -0.20324988823312407, 0.21540423094366606, -0.023612614807028035, -0.16600653579673516, 0.08615388973938444, 0.21918442559500154, 0.1272704260390198, -0.14150882606056536, 0.01764559504853633, -0.05228199106999315, 0.19210080089620674, 0.0410334576637699, 0.03183635325672535, 0.1361448523803399, 0.15733677649404854, 0.09055220419541002, 0.12231904270951278, -0.06018864905412416, -0.04200670484883281, -0.2667517826677515, -0.13528452956771406, -0.1938185559818521, -0.008710546784389478, -0.12639941231363291, -0.21407035481399642, 0.35234582939973247, 0.19603522719385533, 0.18814903154539375, 0.09230252733507838, 0.3123504095352613, 0.08237021543049755, 0.0721565749887724, 0.10084451150793869, 0.13403962122168966, 0.029059451598172577, 0.06792111988179386, -0.13875866773618886, 0.08986183130719627, 0.044748735123385605] |
1,803.0072 | Model Predictive Climate Control of Connected and Automated Vehicles for
Improved Energy Efficiency | This paper considers an application of model predictive control to automotive
air conditioning (A/C) system in future connected and automated vehicles (CAVs)
with battery electric or hybrid electric powertrains. A control-oriented
prediction model for A/C system is proposed, identified, and validated against
a higher fidelity simulation model (CoolSim). Based on the developed prediction
model, a nonlinear model predictive control (NMPC) problem is formulated and
solved online to minimize the energy consumption of the A/C system. Simulation
results illustrate the desirable characteristics of the proposed NMPC solution
such as being able to enforce physical constraints of the A/C system and
maintain cabin temperature within a specified range. Moreover, it is shown that
by utilizing the vehicle speed preview and through coordinated adjustment of
the cabin temperature constraints, energy efficiency improvements of up to 9%
can be achieved.
| cs.SY math.OC | this paper considers an application of model predictive control to automotive air conditioning ac system in future connected and automated vehicles cavs with battery electric or hybrid electric powertrains a controloriented prediction model for ac system is proposed identified and validated against a higher fidelity simulation model coolsim based on the developed prediction model a nonlinear model predictive control nmpc problem is formulated and solved online to minimize the energy consumption of the ac system simulation results illustrate the desirable characteristics of the proposed nmpc solution such as being able to enforce physical constraints of the ac system and maintain cabin temperature within a specified range moreover it is shown that by utilizing the vehicle speed preview and through coordinated adjustment of the cabin temperature constraints energy efficiency improvements of up to 9 can be achieved | [['this', 'paper', 'considers', 'an', 'application', 'of', 'model', 'predictive', 'control', 'to', 'automotive', 'air', 'conditioning', 'ac', 'system', 'in', 'future', 'connected', 'and', 'automated', 'vehicles', 'cavs', 'with', 'battery', 'electric', 'or', 'hybrid', 'electric', 'powertrains', 'a', 'controloriented', 'prediction', 'model', 'for', 'ac', 'system', 'is', 'proposed', 'identified', 'and', 'validated', 'against', 'a', 'higher', 'fidelity', 'simulation', 'model', 'coolsim', 'based', 'on', 'the', 'developed', 'prediction', 'model', 'a', 'nonlinear', 'model', 'predictive', 'control', 'nmpc', 'problem', 'is', 'formulated', 'and', 'solved', 'online', 'to', 'minimize', 'the', 'energy', 'consumption', 'of', 'the', 'ac', 'system', 'simulation', 'results', 'illustrate', 'the', 'desirable', 'characteristics', 'of', 'the', 'proposed', 'nmpc', 'solution', 'such', 'as', 'being', 'able', 'to', 'enforce', 'physical', 'constraints', 'of', 'the', 'ac', 'system', 'and', 'maintain', 'cabin', 'temperature', 'within', 'a', 'specified', 'range', 'moreover', 'it', 'is', 'shown', 'that', 'by', 'utilizing', 'the', 'vehicle', 'speed', 'preview', 'and', 'through', 'coordinated', 'adjustment', 'of', 'the', 'cabin', 'temperature', 'constraints', 'energy', 'efficiency', 'improvements', 'of', 'up', 'to', '9', 'can', 'be', 'achieved']] | [-0.13444961509545708, 0.015972867358841677, -0.020904836937726073, -0.007105158576559373, -0.06568438147973102, -0.1835631782244613, 0.08873363715725076, 0.3749055001161881, -0.26432797521241563, -0.38020089602639984, 0.1308742146107191, -0.23925094425664353, -0.11485784064540501, 0.24619737647320908, -0.10827648056386066, 0.13656874533409058, 0.05664625661291266, 0.032875648988132826, -0.0021352863335398153, -0.2193488476036895, 0.18907603059561728, 0.09062282171155979, 0.3529613978896679, 0.07430140562515156, 0.16663804287507908, -0.008997159316760503, 0.013459097600538534, 0.07490811897302742, -0.0559282981784195, 0.10617938163645092, 0.265918807759047, 0.11754105161917187, 0.2804726164009589, -0.44889872080521354, -0.26101345348575, 0.08050717152794128, 0.1038980325753453, 0.042671968653075286, -0.034013032719472064, -0.27654954672916165, 0.10895535333990815, -0.25408153418006735, -0.11527024272745892, -0.10770710279605587, -0.0574838112876403, 0.048816292042802294, -0.33973225888990755, 0.026356420021003753, 0.006856280655266523, 0.04056905525555806, -0.12895434173241035, -0.07453858667164485, -0.04166675661343025, 0.12289046402499358, 0.028462745350917605, 0.01939985910152544, 0.1891080876056508, -0.11451529684900515, -0.12533958999043915, 0.38392363631500126, -0.03914263702706614, -0.20423736687360414, 0.13785225935732084, -0.024461888558745606, -0.0649830626233467, 0.09168182659213112, 0.2315246692229646, 0.08276330153874831, -0.22182004736152602, 0.017118701498882512, 0.03214672326419586, 0.19101531886228068, 0.008768276276706314, -0.04343701230792968, 0.1897890355912343, 0.27079666640831906, 0.12303879772618746, 0.1350908915541802, -0.04706448774763953, -0.11212880991454889, -0.2426598470930858, -0.10157075102802422, -0.14654200385783367, -0.02069603177586765, -0.05418571418986583, -0.09548077202786921, 0.40296282161916813, 0.2191353925858249, 0.10453142339030086, 0.06410311339701068, 0.3909595453861489, 0.1494337166807225, 0.04431343170643286, 0.09600402831461337, 0.22937492647037994, 0.08053568196343953, 0.14114054735861162, -0.28727412566111715, 0.07985601043537148, 0.006864185799469254] |
1,803.00721 | Age Group Classification with Speech and Metadata Multimodality Fusion | Children comprise a significant proportion of TV viewers and it is worthwhile
to customize the experience for them. However, identifying who is a child in
the audience can be a challenging task. Identifying gender and age from audio
commands is a well-studied problem but is still very challenging to get good
accuracy when the utterances are typically only a couple of seconds long. We
present initial studies of a novel method which combines utterances with user
metadata. In particular, we develop an ensemble of different machine learning
techniques on different subsets of data to improve child detection. Our initial
results show a 9.2\% absolute improvement over the baseline, leading to a
state-of-the-art performance.
| cs.CL cs.SD eess.AS | children comprise a significant proportion of tv viewers and it is worthwhile to customize the experience for them however identifying who is a child in the audience can be a challenging task identifying gender and age from audio commands is a wellstudied problem but is still very challenging to get good accuracy when the utterances are typically only a couple of seconds long we present initial studies of a novel method which combines utterances with user metadata in particular we develop an ensemble of different machine learning techniques on different subsets of data to improve child detection our initial results show a 92 absolute improvement over the baseline leading to a stateoftheart performance | [['children', 'comprise', 'a', 'significant', 'proportion', 'of', 'tv', 'viewers', 'and', 'it', 'is', 'worthwhile', 'to', 'customize', 'the', 'experience', 'for', 'them', 'however', 'identifying', 'who', 'is', 'a', 'child', 'in', 'the', 'audience', 'can', 'be', 'a', 'challenging', 'task', 'identifying', 'gender', 'and', 'age', 'from', 'audio', 'commands', 'is', 'a', 'wellstudied', 'problem', 'but', 'is', 'still', 'very', 'challenging', 'to', 'get', 'good', 'accuracy', 'when', 'the', 'utterances', 'are', 'typically', 'only', 'a', 'couple', 'of', 'seconds', 'long', 'we', 'present', 'initial', 'studies', 'of', 'a', 'novel', 'method', 'which', 'combines', 'utterances', 'with', 'user', 'metadata', 'in', 'particular', 'we', 'develop', 'an', 'ensemble', 'of', 'different', 'machine', 'learning', 'techniques', 'on', 'different', 'subsets', 'of', 'data', 'to', 'improve', 'child', 'detection', 'our', 'initial', 'results', 'show', 'a', '92', 'absolute', 'improvement', 'over', 'the', 'baseline', 'leading', 'to', 'a', 'stateoftheart', 'performance']] | [-0.07098805011596233, 0.035022733717733394, -0.09265815572137326, 0.07536090544911217, -0.16260311733601632, -0.18977205945071723, 0.07610558541862508, 0.43962013390146, -0.2196461472380082, -0.37456211651081994, 0.06867830556471198, -0.2953542408624054, -0.1073881040566263, 0.22012293843997527, -0.16863704136102997, 0.02378554715552425, 0.18517246068480003, 0.11647151688328095, -0.05604804427964629, -0.33985987066629186, 0.24837856441200504, 0.030034943908222218, 0.30211757290778696, 0.0393947469857645, 0.11021564150150799, -0.03599338604351588, -0.038536153844994515, -0.011972181143577053, -0.03458251406962003, 0.13445575108527066, 0.3645150518720656, 0.19571177865403283, 0.37834260508879625, -0.35098799120272156, -0.18551498957275026, 0.08520476735172282, 0.1251714052591242, 0.14344082285126722, -0.04133444261815465, -0.3250931938368399, 0.1208857093717227, -0.20115346704667383, -0.011501408561207025, -0.07606008645163569, 0.025881649229873335, -0.0029843666691712176, -0.28905684611784804, 0.06316803619821877, 0.03567914851009846, 0.09473086697197791, -0.039238784754797154, -0.12015507798806756, 0.05351092780330342, 0.21301436103984459, 0.10085645982113757, 0.07270202536828223, 0.11105747068861285, -0.18384537601068748, -0.10836812479223694, 0.3929565260949157, -0.03831324690491357, -0.1883369233516927, 0.23656651720536492, -0.052949277951950785, -0.12930534935795365, 0.09951249981480362, 0.2416251739270705, 0.13180886608789535, -0.18297510855252735, -0.032239477538536676, -0.04729881018103488, 0.22816386262564797, 0.06192122106347645, -0.007648887236363593, 0.19522957742189478, 0.24991549891460918, 0.03703352887455407, 0.11885651394794901, -0.068595179204419, -0.02963340034774315, -0.18767554298109185, -0.13127773326813383, -0.14962666875278924, 0.013299833018893162, -0.05968761083487611, -0.1326826635781115, 0.428076902585747, 0.21905621624576438, 0.19239311758634856, 0.07554507350437838, 0.31316136664595556, 0.017542752121014735, 0.09814221624993777, 0.08037689677903231, 0.16576572231210734, -0.004724708953934137, 0.11253887429252366, -0.14945801763807678, 0.10236613853809844, -0.01749294122631571] |
1,803.00722 | Proceedings 6th International Workshop on Theorem proving components for
Educational software | The 6th International Workshop on Theorem proving components for Educational
software (ThEdu'17) was held in Gothenburg, Sweden, on 6 Aug 2017. It was
associated to the conference CADE26. Topics of interest include: methods of
automated deduction applied to checking students' input; methods of automated
deduction applied to prove post-conditions for particular problem solutions;
combinations of deduction and computation enabling systems to propose next
steps; automated provers specific for dynamic geometry systems; proof and
proving in mathematics education.
ThEdu'17 was a vibrant workshop, with one invited talk and eight
contributions. It triggered the post-proceedings at hand.
| cs.AI cs.CY | the 6th international workshop on theorem proving components for educational software thedu17 was held in gothenburg sweden on 6 aug 2017 it was associated to the conference cade26 topics of interest include methods of automated deduction applied to checking students input methods of automated deduction applied to prove postconditions for particular problem solutions combinations of deduction and computation enabling systems to propose next steps automated provers specific for dynamic geometry systems proof and proving in mathematics education thedu17 was a vibrant workshop with one invited talk and eight contributions it triggered the postproceedings at hand | [['the', '6th', 'international', 'workshop', 'on', 'theorem', 'proving', 'components', 'for', 'educational', 'software', 'thedu17', 'was', 'held', 'in', 'gothenburg', 'sweden', 'on', '6', 'aug', '2017', 'it', 'was', 'associated', 'to', 'the', 'conference', 'cade26', 'topics', 'of', 'interest', 'include', 'methods', 'of', 'automated', 'deduction', 'applied', 'to', 'checking', 'students', 'input', 'methods', 'of', 'automated', 'deduction', 'applied', 'to', 'prove', 'postconditions', 'for', 'particular', 'problem', 'solutions', 'combinations', 'of', 'deduction', 'and', 'computation', 'enabling', 'systems', 'to', 'propose', 'next', 'steps', 'automated', 'provers', 'specific', 'for', 'dynamic', 'geometry', 'systems', 'proof', 'and', 'proving', 'in', 'mathematics', 'education', 'thedu17', 'was', 'a', 'vibrant', 'workshop', 'with', 'one', 'invited', 'talk', 'and', 'eight', 'contributions', 'it', 'triggered', 'the', 'postproceedings', 'at', 'hand']] | [-0.06581033919634216, 0.03643992480963631, -0.1089237614929595, 0.06061105516172298, -0.15140477332043584, -0.1795220180217217, 0.0447248096841023, 0.2893760369270635, -0.18188618406471188, -0.4127938433388329, 0.1620636495404735, -0.29643025269995077, -0.09705663460645945, 0.23129688226364795, -0.12859041648682804, 0.05115767540005238, 0.10200836277647835, 0.0073994506029007225, -0.011239429115844161, -0.3632783295951136, 0.2517284205304864, 0.02139141684924455, 0.30587903813094547, 0.1011183109076228, 0.12523275241761914, 0.07280454641390267, -0.13716534993601154, -0.046065363111784274, -0.06823116871680174, 0.16629767280107405, 0.44748916468866495, 0.20650529791221386, 0.3434441085378437, -0.42109046228553937, -0.06920678412501255, -0.004364963552570375, 0.053554027665244495, 0.08495904908151082, 0.005672887954658464, -0.3156156589317581, -0.002073265581756182, -0.20431340627534234, -0.13698991559162413, -0.04587084173386836, 0.06508606674311601, 0.0017348440849910612, -0.1856658176680946, -0.039794765422930534, 0.12200402501089823, 0.19506794208174813, -0.026224088450164898, -0.13154191043956773, 0.034077385610030236, 0.1376481329779104, 0.03231444907293696, 0.06005418480313181, 0.12465829556079014, -0.08940451475538556, -0.22396544172711993, 0.38381079021011194, 0.027706236277362736, -0.07761385144017961, 0.21150725654771793, -0.05228632509343974, -0.27556956337724364, 0.04737168528347114, 0.26091981524824287, 0.09543394132893097, -0.17720006648501704, 0.09635463375509615, 0.0839745162571173, 0.2383160694633894, 0.14979718552659388, -0.10623404749102243, 0.23150004242020455, 0.16726893663112802, 0.02312218562537569, 0.09678815580074392, 0.03845535235355466, -0.09681231475880613, -0.2988763067709363, -0.13897043936531586, -0.07325909155137512, -0.0567482380100283, 0.06886888512093245, -0.13140121920277242, 0.342469616357804, 0.16041872640530724, -0.01832603630812272, 0.011093612502167083, 0.27147531966962246, 0.07391316215153379, 0.060864406157001526, 0.08859021879945193, 0.19465637287667842, 0.13444934421947793, 0.23396766064853064, -0.0815616510403545, 0.06257222813513616, 0.18693923517876893] |
1,803.00723 | Chiral electric separation effect in Weyl semimetals | We study the chiral electric separation effect (CESE) in Weyl semimetals
(WSM). Within the model based on the kinetic equation we show that there is a
non-zero chirality current in external electric and magnetic fields. We
distinguish longitudinal, in-plane transverse, Hall, and anomalous Hall
components of the CESE. It is shown that the first two components are quadratic
in electric field and linear in magnetic field, while the Hall component is
quadratic in both the electric and magnetic fields. All three are due to the
chiral anomaly. In WSMs the chirality current can be associated with the spin
current, which can be experimentally observed.
| cond-mat.mes-hall | we study the chiral electric separation effect cese in weyl semimetals wsm within the model based on the kinetic equation we show that there is a nonzero chirality current in external electric and magnetic fields we distinguish longitudinal inplane transverse hall and anomalous hall components of the cese it is shown that the first two components are quadratic in electric field and linear in magnetic field while the hall component is quadratic in both the electric and magnetic fields all three are due to the chiral anomaly in wsms the chirality current can be associated with the spin current which can be experimentally observed | [['we', 'study', 'the', 'chiral', 'electric', 'separation', 'effect', 'cese', 'in', 'weyl', 'semimetals', 'wsm', 'within', 'the', 'model', 'based', 'on', 'the', 'kinetic', 'equation', 'we', 'show', 'that', 'there', 'is', 'a', 'nonzero', 'chirality', 'current', 'in', 'external', 'electric', 'and', 'magnetic', 'fields', 'we', 'distinguish', 'longitudinal', 'inplane', 'transverse', 'hall', 'and', 'anomalous', 'hall', 'components', 'of', 'the', 'cese', 'it', 'is', 'shown', 'that', 'the', 'first', 'two', 'components', 'are', 'quadratic', 'in', 'electric', 'field', 'and', 'linear', 'in', 'magnetic', 'field', 'while', 'the', 'hall', 'component', 'is', 'quadratic', 'in', 'both', 'the', 'electric', 'and', 'magnetic', 'fields', 'all', 'three', 'are', 'due', 'to', 'the', 'chiral', 'anomaly', 'in', 'wsms', 'the', 'chirality', 'current', 'can', 'be', 'associated', 'with', 'the', 'spin', 'current', 'which', 'can', 'be', 'experimentally', 'observed']] | [-0.2529850239818468, 0.264816004655306, -0.02919786372345138, 0.00565567775517523, -0.11055599584226282, -0.12048095202771947, -0.06241085931945305, 0.3935075517063244, -0.26519358501984525, -0.29520117885504776, 0.01507604420140314, -0.2652510773712912, -0.1679533143984512, 0.17384698540375282, 0.05408304757572925, -0.00462436586475143, -0.09895140407248758, 0.047542192050828956, -0.03983245246882479, -0.20238677525104812, 0.2993761895922944, -0.06862849431882541, 0.33429131227043957, 0.10543494020105125, 0.08583654743135692, -0.02459881729625452, 0.06483864243357228, 0.13174377954027688, -0.025074721632615996, 0.00340588021880159, 0.20374223940934127, -0.10990676199211381, 0.14080546374540204, -0.45347414310806644, -0.15790167526127055, 0.06132154963247908, 0.10510698085328421, 0.16017553869460244, -0.0718403865298919, -0.27147933647323114, 0.08876043925500618, -0.15173738213399282, -0.10140257111141601, -0.12139521450556529, 0.014511566718843264, -0.021348715270085868, -0.2877557639507219, 0.11318107626329248, 0.06264309245922889, 0.0891267703487896, -0.13385571568505839, -0.1394640072651852, -0.0705380380476037, 0.044132498755621224, 0.1268254447596309, 0.07858991346886167, 0.15366070594441575, -0.1934699009378584, -0.18392931189065656, 0.3432528048467178, -0.09630528228500715, -0.2056823094160511, 0.12991704326123, -0.23410691033439854, -0.07791364443927215, 0.10090923183955826, 0.15459945099428296, 0.062354403937486216, -0.14179797086399049, 0.11488723555857387, -0.029229886991043504, 0.06673704037362208, -0.002521041077740777, 0.01667208685271012, 0.3240837015551873, 0.08946913606912578, 0.060405461434269316, 0.11957091630140965, -0.1470849210594539, -0.032603044604631856, -0.285975551752087, -0.19184937562721854, -0.2140595236661074, 0.06236187778547621, -0.03482602867062759, -0.16380899927053877, 0.45546394898645726, 0.2109073627561184, 0.15703562126817325, -0.09028096109418235, 0.31957670173142105, 0.17901961027214733, 0.12892808989048576, 0.07663083399305694, 0.3198435835970136, 0.2171001244479647, 0.12847558477705417, -0.3286640558418675, 0.030035581556148827, 0.007244622706471441] |
1,803.00724 | Transformation representations of sandwich semigroups | Let $a$ be an element of a semigroup $S$. The local subsemigroup of $S$ with
respect to $a$ is the subsemigroup $aSa$ of $S$. The variant of $S$ with
respect to $a$ is the semigroup with underlying set $S$ and operation $\star_a$
defined by $x\star_ay=xay$ for $x,y\in S$. We show that the following classes
contain precisely the same semigroups, up to isomorphism: all local
subsemigroups of all finite full transformation semigroups; and all variants of
all finite full transformation semigroups. This result was discovered as a
result of some experiments (and accidents) when working with the Semigroups
package for GAP.
| math.GR math.RA | let a be an element of a semigroup s the local subsemigroup of s with respect to a is the subsemigroup asa of s the variant of s with respect to a is the semigroup with underlying set s and operation star_a defined by xstar_ayxay for xyin s we show that the following classes contain precisely the same semigroups up to isomorphism all local subsemigroups of all finite full transformation semigroups and all variants of all finite full transformation semigroups this result was discovered as a result of some experiments and accidents when working with the semigroups package for gap | [['let', 'a', 'be', 'an', 'element', 'of', 'a', 'semigroup', 's', 'the', 'local', 'subsemigroup', 'of', 's', 'with', 'respect', 'to', 'a', 'is', 'the', 'subsemigroup', 'asa', 'of', 's', 'the', 'variant', 'of', 's', 'with', 'respect', 'to', 'a', 'is', 'the', 'semigroup', 'with', 'underlying', 'set', 's', 'and', 'operation', 'star_a', 'defined', 'by', 'xstar_ayxay', 'for', 'xyin', 's', 'we', 'show', 'that', 'the', 'following', 'classes', 'contain', 'precisely', 'the', 'same', 'semigroups', 'up', 'to', 'isomorphism', 'all', 'local', 'subsemigroups', 'of', 'all', 'finite', 'full', 'transformation', 'semigroups', 'and', 'all', 'variants', 'of', 'all', 'finite', 'full', 'transformation', 'semigroups', 'this', 'result', 'was', 'discovered', 'as', 'a', 'result', 'of', 'some', 'experiments', 'and', 'accidents', 'when', 'working', 'with', 'the', 'semigroups', 'package', 'for', 'gap']] | [-0.09912948119407049, 0.12432729279533654, -0.03508013527783932, 0.03322714221583811, -0.057361179755793676, -0.103539997170858, 0.0436298698527889, 0.34040751172737643, -0.36472812834938967, -0.22697844454016763, 0.13017651349343737, -0.3609240607269146, -0.04489225104469994, 0.2102646464011585, -0.053752679476570905, 0.03958862138244164, 0.05646998697252135, 0.08849691600077833, -0.13186461494228982, -0.24463592916068555, 0.32856435656095995, -0.005000195296650583, 0.1908588314033819, 0.02745906871301357, 0.11029411896691667, -0.023356811712599464, -0.041239719842607624, 0.02433181346883301, -0.13628601148582564, 0.07265282930298285, 0.2852819237124288, 0.1361068303348741, 0.26375578658072035, -0.36784778030194115, -0.16585220428738706, 0.19997160993351817, 0.050063748458268664, -0.015090516211013452, -0.00661857470616021, -0.25380695289508864, 0.18319464656477324, -0.18377181599763306, -0.12607143455269662, -0.06999808614041698, 0.1327883361302542, 0.04712543465347603, -0.3195699090467333, -0.04004996249928772, 0.15055283661051289, 0.09480683151820693, 0.0006303561620903436, -0.06202046389249389, -0.04920585779708368, 0.08146940276521784, -0.019702529539401183, 0.04777918171814897, 0.06282460532913153, -0.022579143973857616, -0.1365499165276009, 0.38937601608910943, -0.05868551192918059, -0.1610235914004722, 0.14720082151317837, -0.1802801790252102, -0.1070519895151709, 0.13665318266827275, 0.029803494779355448, 0.1447918835905089, -0.12444468254456885, 0.1994629227773832, -0.1277078975913952, 0.10420902183919091, 0.05554446276757076, -0.0008897152588222966, 0.09003383846426702, 0.13437639488932687, 0.11190172548245902, 0.14204187438978502, 0.0545350425756734, 0.028481316621029616, -0.38546369784521034, -0.1662563731225979, -0.1426260042206544, 0.09084211755308765, -0.07238453640229177, -0.19036144717135514, 0.42132952636239507, 0.10026853604035245, 0.18211761657901185, 0.08524527235310572, 0.1549859366784192, 0.07508859965692138, 0.059764900780988464, 0.1138593904542351, 0.020244223974948523, 0.1898285733898067, -0.036627429866730565, -0.221930166207856, 0.042233497285368765, 0.17711273545277012] |
1,803.00725 | An uncertainty estimation module for turbulence model predictions in SU2 | With the advent of improved computational resources, aerospace design has
testing-based process to a simulation-driven procedure, wherein uncertainties
in design and operating conditions are explicitly accounted for in the design
under uncertainty methodology. A key source of such uncertainties in design are
the closure models used to account for fluid turbulence. In spite of their
importance, no reliable and extensively tested modules are available to
estimate this epistemic uncertainty. In this article, we outline the EQUiPS
uncertainty estimation module developed for the SU2 CFD suite that focuses on
uncertainty due to turbulence models. The theoretical foundations underlying
this uncertainty estimation and its computational implementation are detailed.
Thence, the performance of this module is presented for a range of test cases,
including both benchmark problems and flows relevant to aerospace design.
Across the range of test cases, the uncertainty estimates of the module were
able to account for a significant portion of the discrepancy between RANS
predictions and high fidelity data.
| physics.flu-dyn | with the advent of improved computational resources aerospace design has testingbased process to a simulationdriven procedure wherein uncertainties in design and operating conditions are explicitly accounted for in the design under uncertainty methodology a key source of such uncertainties in design are the closure models used to account for fluid turbulence in spite of their importance no reliable and extensively tested modules are available to estimate this epistemic uncertainty in this article we outline the equips uncertainty estimation module developed for the su2 cfd suite that focuses on uncertainty due to turbulence models the theoretical foundations underlying this uncertainty estimation and its computational implementation are detailed thence the performance of this module is presented for a range of test cases including both benchmark problems and flows relevant to aerospace design across the range of test cases the uncertainty estimates of the module were able to account for a significant portion of the discrepancy between rans predictions and high fidelity data | [['with', 'the', 'advent', 'of', 'improved', 'computational', 'resources', 'aerospace', 'design', 'has', 'testingbased', 'process', 'to', 'a', 'simulationdriven', 'procedure', 'wherein', 'uncertainties', 'in', 'design', 'and', 'operating', 'conditions', 'are', 'explicitly', 'accounted', 'for', 'in', 'the', 'design', 'under', 'uncertainty', 'methodology', 'a', 'key', 'source', 'of', 'such', 'uncertainties', 'in', 'design', 'are', 'the', 'closure', 'models', 'used', 'to', 'account', 'for', 'fluid', 'turbulence', 'in', 'spite', 'of', 'their', 'importance', 'no', 'reliable', 'and', 'extensively', 'tested', 'modules', 'are', 'available', 'to', 'estimate', 'this', 'epistemic', 'uncertainty', 'in', 'this', 'article', 'we', 'outline', 'the', 'equips', 'uncertainty', 'estimation', 'module', 'developed', 'for', 'the', 'su2', 'cfd', 'suite', 'that', 'focuses', 'on', 'uncertainty', 'due', 'to', 'turbulence', 'models', 'the', 'theoretical', 'foundations', 'underlying', 'this', 'uncertainty', 'estimation', 'and', 'its', 'computational', 'implementation', 'are', 'detailed', 'thence', 'the', 'performance', 'of', 'this', 'module', 'is', 'presented', 'for', 'a', 'range', 'of', 'test', 'cases', 'including', 'both', 'benchmark', 'problems', 'and', 'flows', 'relevant', 'to', 'aerospace', 'design', 'across', 'the', 'range', 'of', 'test', 'cases', 'the', 'uncertainty', 'estimates', 'of', 'the', 'module', 'were', 'able', 'to', 'account', 'for', 'a', 'significant', 'portion', 'of', 'the', 'discrepancy', 'between', 'rans', 'predictions', 'and', 'high', 'fidelity', 'data']] | [-0.07957993517629802, 0.020407445516320878, -0.04749285256548319, 0.08357283768824572, -0.06652845476492075, -0.10547305633954238, 0.013816270983079448, 0.3810120867216028, -0.24813180119381287, -0.36435947080608455, 0.14896307652670657, -0.20195138276321814, -0.08184372889700171, 0.25491967125562953, -0.11982763989071828, 0.12904484108985342, 0.1162653793951904, -0.030540305469185115, -0.0600765590541414, -0.20577977788270801, 0.27904896254476624, 0.1141317472953233, 0.3292158605370787, 0.050321274077214186, 0.11895611251602531, -0.02571353405874106, -0.06640160759416176, 0.010908871748119964, -0.14376450143195144, 0.1625286242160655, 0.31388434106106616, 0.13864967109111603, 0.3039047427766491, -0.4059622659930028, -0.25136719054426065, 0.09556864491860324, 0.09000900441315025, 0.08548661364256986, -0.021328262423776324, -0.2577657623158302, 0.05633339187479578, -0.2176374598639086, -0.07827635220601223, -0.09066282616113312, 0.019843453637440688, -0.006278461180045269, -0.2821239984506974, 0.05138266943686176, 0.008660908657475375, 0.08399717209395022, -0.04454290032663266, -0.13831538726226428, 0.013441706809680909, 0.16550310877501034, 0.027468942048108146, -0.01273699528992438, 0.13832029617624358, -0.13713507942156866, -0.10231228924858442, 0.4299759763525799, 0.00828980878868606, -0.23027035732520745, 0.1613366856283392, -0.09598672678112052, -0.16511384672703572, 0.09579406322736758, 0.23349806720361813, 0.02351866030367091, -0.16191592780523933, 0.06532046002503193, 0.02563548788166372, 0.15270691437181086, -0.019622950330085587, 0.01360535086641903, 0.17432951461232732, 0.24030907895066775, 0.0020360555117804324, 0.11238915786379948, -0.09550591221632203, -0.11748485938951489, -0.3283498141063319, -0.13916836479766062, -0.11276397484180052, -0.04082586866134079, -0.06541326937103804, -0.12178707485436462, 0.38014678881736474, 0.2515255993916071, 0.10191678601622697, 0.05655309329431475, 0.3375719427363947, 0.051889085944276304, 0.045579079048184215, 0.07158681747096125, 0.24818450920283794, 0.1368749233079143, 0.08021997732721502, -0.19675563605560456, 0.10436937059275805, -0.0073475714511005204] |
1,803.00726 | Pentagram maps and refactorization in Poisson-Lie groups | The pentagram map was introduced by R. Schwartz in 1992 and is now one of the
most renowned discrete integrable systems. In the present paper we prove that
this map, as well as all its known integrable multidimensional generalizations,
can be seen as refactorization-type mappings in the Poisson-Lie group of
pseudo-difference operators. This brings the pentagram map into the rich
framework of Poisson-Lie groups, both describing new structures and simplifying
and revealing the origin of its known properties. In particular, for
multidimensional pentagram maps the Poisson-Lie group setting provides new Lax
forms with a spectral parameter and, more importantly, invariant Poisson
structures in all dimensions, the existence of which has been an open problem
since the introduction of those maps. Furthermore, for the classical pentagram
map our approach naturally yields its combinatorial description in terms of
weighted directed networks and cluster algebras.
| nlin.SI math-ph math.MP math.SG | the pentagram map was introduced by r schwartz in 1992 and is now one of the most renowned discrete integrable systems in the present paper we prove that this map as well as all its known integrable multidimensional generalizations can be seen as refactorizationtype mappings in the poissonlie group of pseudodifference operators this brings the pentagram map into the rich framework of poissonlie groups both describing new structures and simplifying and revealing the origin of its known properties in particular for multidimensional pentagram maps the poissonlie group setting provides new lax forms with a spectral parameter and more importantly invariant poisson structures in all dimensions the existence of which has been an open problem since the introduction of those maps furthermore for the classical pentagram map our approach naturally yields its combinatorial description in terms of weighted directed networks and cluster algebras | [['the', 'pentagram', 'map', 'was', 'introduced', 'by', 'r', 'schwartz', 'in', '1992', 'and', 'is', 'now', 'one', 'of', 'the', 'most', 'renowned', 'discrete', 'integrable', 'systems', 'in', 'the', 'present', 'paper', 'we', 'prove', 'that', 'this', 'map', 'as', 'well', 'as', 'all', 'its', 'known', 'integrable', 'multidimensional', 'generalizations', 'can', 'be', 'seen', 'as', 'refactorizationtype', 'mappings', 'in', 'the', 'poissonlie', 'group', 'of', 'pseudodifference', 'operators', 'this', 'brings', 'the', 'pentagram', 'map', 'into', 'the', 'rich', 'framework', 'of', 'poissonlie', 'groups', 'both', 'describing', 'new', 'structures', 'and', 'simplifying', 'and', 'revealing', 'the', 'origin', 'of', 'its', 'known', 'properties', 'in', 'particular', 'for', 'multidimensional', 'pentagram', 'maps', 'the', 'poissonlie', 'group', 'setting', 'provides', 'new', 'lax', 'forms', 'with', 'a', 'spectral', 'parameter', 'and', 'more', 'importantly', 'invariant', 'poisson', 'structures', 'in', 'all', 'dimensions', 'the', 'existence', 'of', 'which', 'has', 'been', 'an', 'open', 'problem', 'since', 'the', 'introduction', 'of', 'those', 'maps', 'furthermore', 'for', 'the', 'classical', 'pentagram', 'map', 'our', 'approach', 'naturally', 'yields', 'its', 'combinatorial', 'description', 'in', 'terms', 'of', 'weighted', 'directed', 'networks', 'and', 'cluster', 'algebras']] | [-0.09466721378976863, 0.028804555913563058, -0.09146798521623756, 0.10036928223772965, -0.08248577299461772, -0.13044773173643975, -0.027850523756995323, 0.3347602557499913, -0.3319339802239341, -0.25248698787829765, 0.12142554265430448, -0.23132598335385746, -0.23795180157461066, 0.2023277508478004, -0.11160637478918788, 0.03063669806661692, 0.041295604671331795, 0.03493871886269949, -0.10880992695409929, -0.2495337386255595, 0.359752677823582, 0.05258131207706711, 0.21753793022040516, 0.0021225749217766397, 0.12931658948130959, 0.013263922145074986, -0.04958693894676547, -0.0016280948547712454, -0.1136922338544098, 0.13872537140301858, 0.2615417219592747, 0.11768956355922294, 0.19281259886524144, -0.3521474603603178, -0.224412482423404, 0.12136170562482208, 0.1515895573963933, 0.06964057642167289, -0.019697155021250756, -0.33505708889388447, 0.03602832763667172, -0.13845168012821824, -0.14424117106997164, -0.10365323633936412, 0.0535430118824679, 0.0257160386569296, -0.2089600821045485, 0.051241759382558205, 0.13031213718932122, 0.06284469772515824, -0.07654020401293327, -0.09117036329331339, -0.06777938387970975, 0.12211090219636442, -0.03382006117988193, 0.048957965202986245, 0.06554732893111435, -0.09678759324159605, -0.15569362141429743, 0.41031714195900776, -0.024202292368925633, -0.2090095284771412, 0.17434857194543096, -0.14159411996114232, -0.23434455123241224, 0.08362094093285871, 0.09658911664712619, 0.09299709686203629, -0.15571625053829757, 0.17783785593681076, -0.1269855321011777, 0.07065524774065228, 0.081737153768764, 0.05072826917195719, 0.1478476677757047, 0.1314385055699749, 0.10536650331453123, 0.19298820885093157, -0.011266470071859658, -0.12140215972293142, -0.27326104984658356, -0.15882329345542065, -0.10404665426496443, 0.06370512222217277, -0.10555466222822425, -0.1758896901870001, 0.4235557876923617, 0.08617631472599303, 0.20467375304156926, 0.08605469674687727, 0.1811560569595255, 0.10970467931577764, 0.08401826324051986, 0.051355450493382644, 0.14591416530311108, 0.21770272422614936, 0.06547395426595042, -0.10642405208002062, -0.028155107328549346, 0.1528146147632192] |
1,803.00727 | Study of the $\gamma p\to \pi^0\eta p$ reaction with the A2 setup at
MAMI | The data available from the A2 Collaboration at MAMI were analyzed to select
the $\gamma p\to \pi^0\eta p$ reaction on an event-by-event basis, which allows
for partial-wave analyses of three-body final states to obtain more reliable
results, compared to fits to measured distributions. These data provide the
world's best statistical accuracy in the energy range from threshold to
$E_{\gamma}=1.45$ GeV, allowing a finer energy binning in the measurement of
all observables needed for understanding the reaction dynamics. The results
obtained for the measured observables are compared to existing models, and the
impact from the new data is checked by the fit with the revised Mainz model.
| nucl-ex | the data available from the a2 collaboration at mami were analyzed to select the gamma pto pi0eta p reaction on an eventbyevent basis which allows for partialwave analyses of threebody final states to obtain more reliable results compared to fits to measured distributions these data provide the worlds best statistical accuracy in the energy range from threshold to e_gamma145 gev allowing a finer energy binning in the measurement of all observables needed for understanding the reaction dynamics the results obtained for the measured observables are compared to existing models and the impact from the new data is checked by the fit with the revised mainz model | [['the', 'data', 'available', 'from', 'the', 'a2', 'collaboration', 'at', 'mami', 'were', 'analyzed', 'to', 'select', 'the', 'gamma', 'pto', 'pi0eta', 'p', 'reaction', 'on', 'an', 'eventbyevent', 'basis', 'which', 'allows', 'for', 'partialwave', 'analyses', 'of', 'threebody', 'final', 'states', 'to', 'obtain', 'more', 'reliable', 'results', 'compared', 'to', 'fits', 'to', 'measured', 'distributions', 'these', 'data', 'provide', 'the', 'worlds', 'best', 'statistical', 'accuracy', 'in', 'the', 'energy', 'range', 'from', 'threshold', 'to', 'e_gamma145', 'gev', 'allowing', 'a', 'finer', 'energy', 'binning', 'in', 'the', 'measurement', 'of', 'all', 'observables', 'needed', 'for', 'understanding', 'the', 'reaction', 'dynamics', 'the', 'results', 'obtained', 'for', 'the', 'measured', 'observables', 'are', 'compared', 'to', 'existing', 'models', 'and', 'the', 'impact', 'from', 'the', 'new', 'data', 'is', 'checked', 'by', 'the', 'fit', 'with', 'the', 'revised', 'mainz', 'model']] | [-0.010101043125836267, 0.09291986249778088, -0.13492727276170627, 0.11166569448320106, -0.02224513479907598, -0.11090549442118831, 0.06228032399501119, 0.3317951936097372, -0.2049377454888253, -0.3448858680902049, 0.01176792904512868, -0.3339869213580165, 0.05565199443981761, 0.22783312545424061, 0.04362774673139765, 0.15104204628261783, 0.144919402555873, 0.03818864635042181, -0.049064858408556095, -0.18294287556338878, 0.28581190830362696, 0.16348854948633484, 0.27953986071404957, 0.05394949240698701, 0.02427762271725528, 0.01551799296977974, -0.09889779273597966, -0.05582508647016116, -0.20654206386811677, 0.11041439297287503, 0.2796116554216063, 0.11918368516489863, 0.12279676855763509, -0.39010565790037316, -0.17036377915314266, 0.09349339764033045, 0.10752020860977826, 0.0973630141145328, 0.004921259314592351, -0.30892345287526646, 0.07228340962458224, -0.17111347268912055, -0.11628075553924733, -0.125834140332327, -0.007258777302645502, 0.00617501051830394, -0.3412636147368522, 0.06227541516224543, -0.05623096468015796, 0.05325448099701177, -0.08688170808156775, -0.22680733339594944, -0.046059180725188484, 0.13322430552382555, 0.05089721392862322, 0.06447715879739484, 0.12039827928390531, -0.08827419106105697, -0.12576504640414246, 0.4030489892299686, -0.028656553543571914, -0.1756438614512306, 0.14007417703590666, -0.19133757661939377, -0.14209040286729024, 0.1628795247791069, 0.200714868023282, 0.046848330850757305, -0.20254330207216775, 0.02543041737073855, 0.01036423376894423, 0.18482542442423958, 0.05693214322839465, -0.005383007270505741, 0.09855883792042733, 0.1741751764036183, -0.015007668130454562, 0.06305306746535713, -0.11797681333985002, -0.07024344246213635, -0.33231805118599106, -0.03801314363344794, -0.13206689102087346, 0.02811351974295186, -0.06799782963588812, -0.03126567188827764, 0.37462898544257595, 0.12908991562158223, 0.2573221196121137, 0.04387961387789498, 0.3057878333454331, 0.08411774000574258, 0.0758276362637324, 0.04871498006174252, 0.3015665938013366, 0.11196420390957168, 0.12516920588289698, -0.1945919898405139, 0.07055188901278944, -0.0031934068848689396] |
1,803.00728 | Accurate determination of halo velocity bias in simulations and its
cosmological implications | A long-standing issue in peculiar velocity cosmology is whether the
halo/galaxy velocity bias $b_v=1$ at large scale. The resolution of this
important issue must resort to high precision cosmological simulations.
However, this is hampered by another long-standing `sampling artifact' problem
in volume weighted velocity measurement. We circumvent this problem with a
hybrid approach. We first measure statistics free of sampling artifact, then
link them to volume weighted statistics in theory, finally solve for the
velocity bias. $b_v$ determined by our method is not only free of sampling
artifact, but also free of cosmic variance. We apply this method to a
$\Lambda$CDM N-body simulation of $3072^3$ particles and $1200 Mpc/{\rm h}$ box
size. For the first time, we determine the halo velocity bias to $0.1\%$-$1\%$
accuracy. Our major findings are as follows: (1) $b_v\neq 1$ at $k>0.1 h/{\rm
Mpc}$. The deviation from unity ($|b_v-1|$) increases with $k$. Depending on
halo mass and redshift, it may reach $\mathcal{O}(0.01)$ at $k=0.2 h/{\rm Mpc}$
and $\mathcal{O}(0.05)$ at $k\sim 0.3 h/{\rm Mpc}$. The discovered $b_v\neq 1$
has statistically significant impact on structure growth rate measurement by
spectroscopic redshift surveys, including DESI, Euclid and SKA. (2) Both the
sign and the amplitude of $b_v-1$ depend on mass and redshift. These results
disagree with the peak model prediction in that $b_v$ has much weaker deviation
from unity, varies with redshift, and can be bigger than unity. (3) Most of the
mass and redshift dependences can be compressed into a single dependence on the
halo density bias. Based on this finding, we provide an approximate
two-parameter fitting formula.
| astro-ph.CO | a longstanding issue in peculiar velocity cosmology is whether the halogalaxy velocity bias b_v1 at large scale the resolution of this important issue must resort to high precision cosmological simulations however this is hampered by another longstanding sampling artifact problem in volume weighted velocity measurement we circumvent this problem with a hybrid approach we first measure statistics free of sampling artifact then link them to volume weighted statistics in theory finally solve for the velocity bias b_v determined by our method is not only free of sampling artifact but also free of cosmic variance we apply this method to a lambdacdm nbody simulation of 30723 particles and 1200 mpcrm h box size for the first time we determine the halo velocity bias to 011 accuracy our major findings are as follows 1 b_vneq 1 at k01 hrm mpc the deviation from unity b_v1 increases with k depending on halo mass and redshift it may reach mathcalo001 at k02 hrm mpc and mathcalo005 at ksim 03 hrm mpc the discovered b_vneq 1 has statistically significant impact on structure growth rate measurement by spectroscopic redshift surveys including desi euclid and ska 2 both the sign and the amplitude of b_v1 depend on mass and redshift these results disagree with the peak model prediction in that b_v has much weaker deviation from unity varies with redshift and can be bigger than unity 3 most of the mass and redshift dependences can be compressed into a single dependence on the halo density bias based on this finding we provide an approximate twoparameter fitting formula | [['a', 'longstanding', 'issue', 'in', 'peculiar', 'velocity', 'cosmology', 'is', 'whether', 'the', 'halogalaxy', 'velocity', 'bias', 'b_v1', 'at', 'large', 'scale', 'the', 'resolution', 'of', 'this', 'important', 'issue', 'must', 'resort', 'to', 'high', 'precision', 'cosmological', 'simulations', 'however', 'this', 'is', 'hampered', 'by', 'another', 'longstanding', 'sampling', 'artifact', 'problem', 'in', 'volume', 'weighted', 'velocity', 'measurement', 'we', 'circumvent', 'this', 'problem', 'with', 'a', 'hybrid', 'approach', 'we', 'first', 'measure', 'statistics', 'free', 'of', 'sampling', 'artifact', 'then', 'link', 'them', 'to', 'volume', 'weighted', 'statistics', 'in', 'theory', 'finally', 'solve', 'for', 'the', 'velocity', 'bias', 'b_v', 'determined', 'by', 'our', 'method', 'is', 'not', 'only', 'free', 'of', 'sampling', 'artifact', 'but', 'also', 'free', 'of', 'cosmic', 'variance', 'we', 'apply', 'this', 'method', 'to', 'a', 'lambdacdm', 'nbody', 'simulation', 'of', '30723', 'particles', 'and', '1200', 'mpcrm', 'h', 'box', 'size', 'for', 'the', 'first', 'time', 'we', 'determine', 'the', 'halo', 'velocity', 'bias', 'to', '011', 'accuracy', 'our', 'major', 'findings', 'are', 'as', 'follows', '1', 'b_vneq', '1', 'at', 'k01', 'hrm', 'mpc', 'the', 'deviation', 'from', 'unity', 'b_v1', 'increases', 'with', 'k', 'depending', 'on', 'halo', 'mass', 'and', 'redshift', 'it', 'may', 'reach', 'mathcalo001', 'at', 'k02', 'hrm', 'mpc', 'and', 'mathcalo005', 'at', 'ksim', '03', 'hrm', 'mpc', 'the', 'discovered', 'b_vneq', '1', 'has', 'statistically', 'significant', 'impact', 'on', 'structure', 'growth', 'rate', 'measurement', 'by', 'spectroscopic', 'redshift', 'surveys', 'including', 'desi', 'euclid', 'and', 'ska', '2', 'both', 'the', 'sign', 'and', 'the', 'amplitude', 'of', 'b_v1', 'depend', 'on', 'mass', 'and', 'redshift', 'these', 'results', 'disagree', 'with', 'the', 'peak', 'model', 'prediction', 'in', 'that', 'b_v', 'has', 'much', 'weaker', 'deviation', 'from', 'unity', 'varies', 'with', 'redshift', 'and', 'can', 'be', 'bigger', 'than', 'unity', '3', 'most', 'of', 'the', 'mass', 'and', 'redshift', 'dependences', 'can', 'be', 'compressed', 'into', 'a', 'single', 'dependence', 'on', 'the', 'halo', 'density', 'bias', 'based', 'on', 'this', 'finding', 'we', 'provide', 'an', 'approximate', 'twoparameter', 'fitting', 'formula']] | [-0.07339137906385514, 0.11967199834546682, -0.09014909247806396, 0.08587608173683145, -0.09582530891580522, -0.09968141071379272, 0.03461113351833999, 0.3837527884007973, -0.2386787341760522, -0.3660192725180049, 0.07413511367355899, -0.28128304536086185, -0.016614936022340616, 0.20989171105058857, -0.023998396139945692, 0.016097263834626927, 0.03881853472535289, -0.008574951996791263, -0.07390708515307524, -0.2620474731747256, 0.279269528657364, 0.11256861774604623, 0.2441558133839637, 0.030642063163812887, 0.10632458184268181, -0.03602857535534972, -0.06776697101620163, 0.05637776127622947, -0.20807773068330324, 0.01690043552504318, 0.20451845687294248, 0.11753608628497422, 0.2969750578004448, -0.30204124502655366, -0.1831954620393499, 0.12229370487521785, 0.1960560508025449, 0.09425570178269806, -0.04606561949332209, -0.22934587722374294, 0.10562270931004322, -0.1691267555760032, -0.13789861016886945, 0.010855082662545087, -0.0043277837022012745, -0.00984015404481383, -0.23516921162792093, 0.22155687114385827, -0.02487834811557171, 0.05542877665540391, -0.023529967470924812, -0.14901654723428853, 0.009399681366518024, 0.06987205858012055, 0.028564072591739945, 0.09092751504716197, 0.15107076855889853, -0.1168287811582446, -0.04661636832242384, 0.39104791116258203, -0.06891900458236183, -0.1436419519337477, 0.1311634515796593, -0.2013021749426257, -0.1529528687193912, 0.10721208221304353, 0.16893865815959438, 0.05444420178311646, -0.09339514547302893, 0.07666998414923762, 0.01744180957427679, 0.2566179900426533, 0.0632419014532776, -0.01711442716448575, 0.22012335995154442, 0.14597773697775926, 0.09374791078762217, 0.017745834765793365, -0.15323338443478804, -0.02404590635091182, -0.2770439695256452, -0.08503408675251688, -0.18509497171152353, 0.0787775478653033, -0.16257828234129967, -0.128703643862057, 0.3323429977492422, 0.20390964961157707, 0.2226051097255662, 0.11717350120194141, 0.3126983600014337, 0.11640057441202721, 0.0859166493406068, 0.05054116568910752, 0.2511434286468222, 0.1230625332551539, 0.04514816216943973, -0.21031160590368822, 0.03863757120421907, 0.012995205582263915] |
1,803.00729 | Representing Verbs as Argument Concepts | Verbs play an important role in the understanding of natural language text.
This paper studies the problem of abstracting the subject and object arguments
of a verb into a set of noun concepts, known as the "argument concepts". This
set of concepts, whose size is parameterized, represents the fine-grained
semantics of a verb. For example, the object of "enjoy" can be abstracted into
time, hobby and event, etc. We present a novel framework to automatically infer
human readable and machine computable action concepts with high accuracy.
| cs.CL cs.AI | verbs play an important role in the understanding of natural language text this paper studies the problem of abstracting the subject and object arguments of a verb into a set of noun concepts known as the argument concepts this set of concepts whose size is parameterized represents the finegrained semantics of a verb for example the object of enjoy can be abstracted into time hobby and event etc we present a novel framework to automatically infer human readable and machine computable action concepts with high accuracy | [['verbs', 'play', 'an', 'important', 'role', 'in', 'the', 'understanding', 'of', 'natural', 'language', 'text', 'this', 'paper', 'studies', 'the', 'problem', 'of', 'abstracting', 'the', 'subject', 'and', 'object', 'arguments', 'of', 'a', 'verb', 'into', 'a', 'set', 'of', 'noun', 'concepts', 'known', 'as', 'the', 'argument', 'concepts', 'this', 'set', 'of', 'concepts', 'whose', 'size', 'is', 'parameterized', 'represents', 'the', 'finegrained', 'semantics', 'of', 'a', 'verb', 'for', 'example', 'the', 'object', 'of', 'enjoy', 'can', 'be', 'abstracted', 'into', 'time', 'hobby', 'and', 'event', 'etc', 'we', 'present', 'a', 'novel', 'framework', 'to', 'automatically', 'infer', 'human', 'readable', 'and', 'machine', 'computable', 'action', 'concepts', 'with', 'high', 'accuracy']] | [-0.053651207159165035, 0.05302162985686283, -0.10703683323443455, 0.11036332141097667, -0.17953570230409158, -0.12007219319470054, 0.058546180419927076, 0.3495140343384687, -0.29546598606028185, -0.364207495112232, 0.05112617537460485, -0.25564707347278504, -0.1673901768747804, 0.16968640548631894, -0.15989791721018942, 0.04185390004584955, 0.08959397649782341, 0.11572136589174353, -0.019687121463289787, -0.19072013714372418, 0.32704891977279427, 0.026534800829235896, 0.2451683469874741, 0.03806382864930256, 0.1709911360643631, -0.0170314344144318, -0.07483169530128497, 0.028123477148975052, -0.08242735472172065, 0.2045422838878991, 0.37342280281577694, 0.28131637119059993, 0.3395471667145314, -0.4118093449925614, -0.1653583035005668, 0.0371379408982669, 0.11278388846319082, 0.0827035538640366, -0.01545482185171094, -0.3642108569511884, 0.08959628581367217, -0.18966051562537634, -0.04179655944625305, -0.09169203764217537, 0.05190400930857936, -0.0372404876424996, -0.22520835832882197, -0.024855914200807728, 0.20489021328949306, 0.13205012550501716, -0.05693818003867839, -0.07564497938336329, 0.02592064851223556, 0.19904656041153643, 0.04504354147857791, 0.06742597924447943, 0.1624817020248968, -0.158252504762522, -0.14627996225689732, 0.44704352327904034, 0.015242880351061737, -0.2276019721053714, 0.19629844745924308, -0.008274495764094036, -0.1837913507357413, 0.05281457216830838, 0.21816659159958363, 0.12630785922628157, -0.16398087444953446, 0.037484365551283066, -0.08165831390638338, 0.2020731202034323, 0.06404911215027231, 0.06941762818348442, 0.24601321878604765, 0.26961168679300435, -0.025801567059567976, 0.16489939123993133, -0.00877320366846614, -0.04126786992906831, -0.28372767706250035, -0.16308478205085752, -0.12418673799351551, -0.0163665631549774, -0.0951688889257385, -0.1887603521910171, 0.384004395715026, 0.18784465862243155, 0.18952788334058293, 0.09189539000955085, 0.2839772119078525, 0.06928430476156876, 0.06921935102599132, 0.012010473863568244, 0.10320327291806597, 0.02027075893657152, 0.10566308202362772, -0.13201986251637166, 0.1125279339355265, 0.13916173781170835] |
1,803.0073 | On stability properties of powers of polymatroidal ideals | Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field
$K$ with the maximal ideal $\frak{m}=(x_1,...,x_n)$.
Let $\astab(I)$ and $\dstab(I)$ be the smallest integer $n$ for which
$\Ass(I^n)$ and $\depth(I^n)$ stabilize, respectively.
In this paper we show that $\astab(I)=\dstab(I)$ in the following cases:
\begin{itemize} \item[(i)] $I$ is a matroidal ideal and $n\leq 5$.
\item[(ii)] $I$ is a polymatroidal ideal, $n=4$ and
$\frak{m}\notin\Ass^{\infty}(I)$, where $\Ass^{\infty}(I)$ is the stable set of
associated prime ideals of $I$. \item[(iii)] $I$ is a polymatroidal ideal of
degree $2$. \end{itemize} Moreover, we give an example of a polymatroidal ideal
for which $\astab(I)\neq\dstab(I)$. This is a counterexample to the conjecture
of Herzog and Qureshi, according to which these two numbers are the same for
polymatroidal ideals.
| math.AC math.CO | let rkx_1x_n be the polynomial ring in n variables over a field k with the maximal ideal frakmx_1x_n let astabi and dstabi be the smallest integer n for which assin and depthin stabilize respectively in this paper we show that astabidstabi in the following cases beginitemize itemi i is a matroidal ideal and nleq 5 itemii i is a polymatroidal ideal n4 and frakmnotinassinftyi where assinftyi is the stable set of associated prime ideals of i itemiii i is a polymatroidal ideal of degree 2 enditemize moreover we give an example of a polymatroidal ideal for which astabineqdstabi this is a counterexample to the conjecture of herzog and qureshi according to which these two numbers are the same for polymatroidal ideals | [['let', 'rkx_1x_n', 'be', 'the', 'polynomial', 'ring', 'in', 'n', 'variables', 'over', 'a', 'field', 'k', 'with', 'the', 'maximal', 'ideal', 'frakmx_1x_n', 'let', 'astabi', 'and', 'dstabi', 'be', 'the', 'smallest', 'integer', 'n', 'for', 'which', 'assin', 'and', 'depthin', 'stabilize', 'respectively', 'in', 'this', 'paper', 'we', 'show', 'that', 'astabidstabi', 'in', 'the', 'following', 'cases', 'beginitemize', 'itemi', 'i', 'is', 'a', 'matroidal', 'ideal', 'and', 'nleq', '5', 'itemii', 'i', 'is', 'a', 'polymatroidal', 'ideal', 'n4', 'and', 'frakmnotinassinftyi', 'where', 'assinftyi', 'is', 'the', 'stable', 'set', 'of', 'associated', 'prime', 'ideals', 'of', 'i', 'itemiii', 'i', 'is', 'a', 'polymatroidal', 'ideal', 'of', 'degree', '2', 'enditemize', 'moreover', 'we', 'give', 'an', 'example', 'of', 'a', 'polymatroidal', 'ideal', 'for', 'which', 'astabineqdstabi', 'this', 'is', 'a', 'counterexample', 'to', 'the', 'conjecture', 'of', 'herzog', 'and', 'qureshi', 'according', 'to', 'which', 'these', 'two', 'numbers', 'are', 'the', 'same', 'for', 'polymatroidal', 'ideals']] | [-0.1829245350505833, 0.10943474430785737, -0.02998328460785358, 0.0010562713025137783, -0.03864360298333771, -0.21138911047221526, -0.04676627177319935, 0.30290038305456224, -0.3212124037394381, -0.19148383329258017, 0.12568432010568517, -0.2847162484899973, -0.11510078206496394, 0.15426309862700494, -0.08668410328581282, -0.04279338990986023, -0.0053077759869072745, 0.0924161272406902, 0.011546255395059352, -0.32023334375218204, 0.3456817352901334, -0.009150093000220216, 0.14848315533574508, 0.0336408453527838, 0.07355086675075734, -0.028940012617765562, 0.03633894394354328, 0.06671074962541752, -0.2000720368154757, 0.1052933716741593, 0.3032426957041025, 0.13049950277351816, 0.2422537732626433, -0.34526849681557076, -0.06300451079100046, 0.20666949378083582, 0.13251834187008765, -0.006128642553180132, 0.01944437602372921, -0.15492129557482573, 0.2170419451497171, -0.17685665271520798, -0.16251615446627787, -0.025367812166476378, 0.13377888164300797, 0.03973886167843138, -0.39935915053052745, -0.02435480549769557, 0.14473282441739801, 0.13194295610098736, -0.01664826779919879, -0.1324839180537864, -0.014559275240880316, 0.027569901708351528, -0.07660980071750996, 0.04457699098097889, -0.011506283427993565, -0.1214193717536071, -0.1320566473285789, 0.36254564988548343, -0.022935156722593567, -0.19268691756803055, 0.12178541283811564, -0.16332129534819853, -0.13630636181763334, 0.09186689751425191, 0.05247617786466752, 0.14607718886564608, -0.025613698630553225, 0.15587203518598866, -0.19217466339468955, 0.08617818519958984, 0.07926536921978644, 0.002519010047873725, 0.14677113243378698, 0.09321996624095609, 0.08309023187460338, 0.14351960679556688, -0.01712414204477049, 0.025645591642545616, -0.3588216625477957, -0.24273801703491937, -0.1935858177183115, 0.16425424066939107, -0.10081181179304384, -0.10337133647307106, 0.38794884171093935, 0.11946220694352751, 0.1775100273768539, 0.08078482066301386, 0.20110524709781874, 0.06415184868977952, -0.02301977176786117, 0.13977261163375299, 0.11274178683474335, 0.15577942432592745, -0.044329279431384865, -0.14928899464480902, 0.003242517043026569, 0.12015704677804656] |
1,803.00731 | Antiferroelectric and Magnetodielectric Coupling Response of
La0.2Sr0.7Fe12O19 Ceramics | Multiferroics is a class of functional materials that simultaneously exhibit
ferroelectricity and ferromagnetism in a single structure. We report here the
integration of anti-ferroelectricity and ferromagnetism in a new M-type
hexaferrite compound, in which 0.3 Sr ions was substituted by 0.2 La3+ ions in
SrFe12O19 so as to keep the charge balance. This doped compound is expressed as
a molecular formula of La0.2Sr0.7Fe12O19, which was confirmed by XRD to have
the same structure as SrFe12O19 with a lattice contraction of 0.59%.
Surprisingly, the doping effect turns La0.2Sr0.7Fe12O19 from ferroelectric to
antiferroelectric phase, which displays double hysteresis loops with a maximum
polarization of 154 uC/cm2 and a remnant one of 38uC/cm2. The dielectric
constant is also greatly improved from 1462 to 1451778 at 10.2Hz by this
substitution. This compound simultaneously demonstrates strong ferromagnetism,
the remnant magnetic moment and coercive field are 52 emu/g and 5876 Oe,
respectively. In addition, La0.2Sr0.7Fe12O19 also exhibits strong
magnetodielectric (MD) response, in which a applying magnetic field B lifts the
whole e1-f spectra up and right shifts e2-f spectra to higher frequency side.
Both real and imaginary parts of the dielectric constant varies with frequency
and B field and obey Debye relaxation model. The maximum MD increment in e1
reaches as high as 540830 upon a B field of 926mT. The capacitance of the
La0.2Sr0.7Fe12O19 ceramics could be much more enhanced by applying a magnetic
field B, which could induce an additional polarization P(H) upon the
conventional P(E) by the cycloid conical spin in the intermediate phases. These
results suggest that La0.2Sr0.7Fe12O19 exhibits a strong interplay between
magnetic ordering and ferroelectricity, which makes it a good magnetoelectric
coupling candidate.
| cond-mat.mtrl-sci | multiferroics is a class of functional materials that simultaneously exhibit ferroelectricity and ferromagnetism in a single structure we report here the integration of antiferroelectricity and ferromagnetism in a new mtype hexaferrite compound in which 03 sr ions was substituted by 02 la3 ions in srfe12o19 so as to keep the charge balance this doped compound is expressed as a molecular formula of la02sr07fe12o19 which was confirmed by xrd to have the same structure as srfe12o19 with a lattice contraction of 059 surprisingly the doping effect turns la02sr07fe12o19 from ferroelectric to antiferroelectric phase which displays double hysteresis loops with a maximum polarization of 154 uccm2 and a remnant one of 38uccm2 the dielectric constant is also greatly improved from 1462 to 1451778 at 102hz by this substitution this compound simultaneously demonstrates strong ferromagnetism the remnant magnetic moment and coercive field are 52 emug and 5876 oe respectively in addition la02sr07fe12o19 also exhibits strong magnetodielectric md response in which a applying magnetic field b lifts the whole e1f spectra up and right shifts e2f spectra to higher frequency side both real and imaginary parts of the dielectric constant varies with frequency and b field and obey debye relaxation model the maximum md increment in e1 reaches as high as 540830 upon a b field of 926mt the capacitance of the la02sr07fe12o19 ceramics could be much more enhanced by applying a magnetic field b which could induce an additional polarization ph upon the conventional pe by the cycloid conical spin in the intermediate phases these results suggest that la02sr07fe12o19 exhibits a strong interplay between magnetic ordering and ferroelectricity which makes it a good magnetoelectric coupling candidate | [['multiferroics', 'is', 'a', 'class', 'of', 'functional', 'materials', 'that', 'simultaneously', 'exhibit', 'ferroelectricity', 'and', 'ferromagnetism', 'in', 'a', 'single', 'structure', 'we', 'report', 'here', 'the', 'integration', 'of', 'antiferroelectricity', 'and', 'ferromagnetism', 'in', 'a', 'new', 'mtype', 'hexaferrite', 'compound', 'in', 'which', '03', 'sr', 'ions', 'was', 'substituted', 'by', '02', 'la3', 'ions', 'in', 'srfe12o19', 'so', 'as', 'to', 'keep', 'the', 'charge', 'balance', 'this', 'doped', 'compound', 'is', 'expressed', 'as', 'a', 'molecular', 'formula', 'of', 'la02sr07fe12o19', 'which', 'was', 'confirmed', 'by', 'xrd', 'to', 'have', 'the', 'same', 'structure', 'as', 'srfe12o19', 'with', 'a', 'lattice', 'contraction', 'of', '059', 'surprisingly', 'the', 'doping', 'effect', 'turns', 'la02sr07fe12o19', 'from', 'ferroelectric', 'to', 'antiferroelectric', 'phase', 'which', 'displays', 'double', 'hysteresis', 'loops', 'with', 'a', 'maximum', 'polarization', 'of', '154', 'uccm2', 'and', 'a', 'remnant', 'one', 'of', '38uccm2', 'the', 'dielectric', 'constant', 'is', 'also', 'greatly', 'improved', 'from', '1462', 'to', '1451778', 'at', '102hz', 'by', 'this', 'substitution', 'this', 'compound', 'simultaneously', 'demonstrates', 'strong', 'ferromagnetism', 'the', 'remnant', 'magnetic', 'moment', 'and', 'coercive', 'field', 'are', '52', 'emug', 'and', '5876', 'oe', 'respectively', 'in', 'addition', 'la02sr07fe12o19', 'also', 'exhibits', 'strong', 'magnetodielectric', 'md', 'response', 'in', 'which', 'a', 'applying', 'magnetic', 'field', 'b', 'lifts', 'the', 'whole', 'e1f', 'spectra', 'up', 'and', 'right', 'shifts', 'e2f', 'spectra', 'to', 'higher', 'frequency', 'side', 'both', 'real', 'and', 'imaginary', 'parts', 'of', 'the', 'dielectric', 'constant', 'varies', 'with', 'frequency', 'and', 'b', 'field', 'and', 'obey', 'debye', 'relaxation', 'model', 'the', 'maximum', 'md', 'increment', 'in', 'e1', 'reaches', 'as', 'high', 'as', '540830', 'upon', 'a', 'b', 'field', 'of', '926mt', 'the', 'capacitance', 'of', 'the', 'la02sr07fe12o19', 'ceramics', 'could', 'be', 'much', 'more', 'enhanced', 'by', 'applying', 'a', 'magnetic', 'field', 'b', 'which', 'could', 'induce', 'an', 'additional', 'polarization', 'ph', 'upon', 'the', 'conventional', 'pe', 'by', 'the', 'cycloid', 'conical', 'spin', 'in', 'the', 'intermediate', 'phases', 'these', 'results', 'suggest', 'that', 'la02sr07fe12o19', 'exhibits', 'a', 'strong', 'interplay', 'between', 'magnetic', 'ordering', 'and', 'ferroelectricity', 'which', 'makes', 'it', 'a', 'good', 'magnetoelectric', 'coupling', 'candidate']] | [-0.15022083923454763, 0.19651809098857037, -0.03243191815569969, -0.011359209090914426, -0.072401658815356, -0.14854552712703478, 0.10841377966601894, 0.4011444985108332, -0.2557916753340277, -0.29750477396761893, 0.022479471085821608, -0.2912635855709088, -0.12407747497106988, 0.15694932143730164, 0.032574895861105076, -0.04853463593652285, -0.05562943899675123, -0.008895320753778113, -0.0907185500189939, -0.17305001857185037, 0.20723509840618778, 0.0581284042314228, 0.2743420550187696, 0.07569455029962231, 0.06860580724113548, -0.03427885627792975, 0.13932120191283026, 0.0682207769194971, -0.09373572243917015, 0.04651176062807247, 0.21714724170141006, -0.049019840202332375, 0.19445988122844673, -0.36232996377990095, -0.19321667314870594, -0.007081075074656634, 0.11589516973777304, 0.09817468718327858, -0.06994863292558308, -0.25232280578921273, 0.0952825668225927, -0.12480673469779632, -0.10256923889933019, -0.0995473981563168, 0.009374144685724716, 0.016727494420379845, -0.29131210285375675, 0.10834141705703634, 0.0908373357255538, 0.13099390511110176, -0.11598674565740622, -0.17607240812189973, -0.06209328366429666, 0.02935434855887715, 0.07774013561174122, 0.11964436859709512, 0.15361337052298135, -0.08334103951292963, -0.09838579459891388, 0.3638808224557944, -0.09321856020160407, -0.059046504111548534, 0.13977868970203106, -0.2189544342557461, -0.08493806515754543, 0.21355113311026758, 0.07862599223175304, 0.10798661432555291, -0.14101618461486784, 0.08597408471171152, 0.01584738838057065, 0.20923201847115191, 0.08611661330433251, 0.03956340779342644, 0.23695096680868527, 0.14084487224558584, 0.023175489251782293, 0.1762561189849449, -0.10994189904247961, -0.0272319337221548, -0.21717030291019707, -0.18632448406207988, -0.1647928515293369, 0.09464497933684429, -0.1109786768192659, -0.1740208989092353, 0.3553966132899726, 0.10723614579605001, 0.18079651127392807, -0.06505173959485411, 0.2132579727880795, 0.08643228472011392, 0.11148274572112608, 0.0113822081174743, 0.27204174461746833, 0.2072394908289858, 0.16091440717575442, -0.29404869638764225, 0.09627016925090252, -0.007083464790175437] |
1,803.00732 | Bootstrapping Non-commutative Gauge Theories from L$_\infty$ algebras | Non-commutative gauge theories with a non-constant NC-parameter are
investigated. As a novel approach, we propose that such theories should admit
an underlying L$_\infty$ algebra, that governs not only the action of the
symmetries but also the dynamics of the theory. Our approach is well motivated
from string theory. We recall that such field theories arise in the context of
branes in WZW models and briefly comment on its appearance for integrable
deformations of AdS$_5$ sigma models. For the SU(2) WZW model, we show that the
earlier proposed matrix valued gauge theory on the fuzzy 2-sphere can be
bootstrapped via an L$_\infty$ algebra. We then apply this approach to the
construction of non-commutative Chern-Simons and Yang-Mills theories on flat
and curved backgrounds with non-constant NC-structure. More concretely, up to
the second order, we demonstrate how derivative and curvature corrections to
the equations of motion can be bootstrapped in an algebraic way from the
L$_\infty$ algebra. The appearance of a non-trivial A$_\infty$ algebra is
discussed, as well.
| hep-th math-ph math.MP math.QA math.SG | noncommutative gauge theories with a nonconstant ncparameter are investigated as a novel approach we propose that such theories should admit an underlying l_infty algebra that governs not only the action of the symmetries but also the dynamics of the theory our approach is well motivated from string theory we recall that such field theories arise in the context of branes in wzw models and briefly comment on its appearance for integrable deformations of ads_5 sigma models for the su2 wzw model we show that the earlier proposed matrix valued gauge theory on the fuzzy 2sphere can be bootstrapped via an l_infty algebra we then apply this approach to the construction of noncommutative chernsimons and yangmills theories on flat and curved backgrounds with nonconstant ncstructure more concretely up to the second order we demonstrate how derivative and curvature corrections to the equations of motion can be bootstrapped in an algebraic way from the l_infty algebra the appearance of a nontrivial a_infty algebra is discussed as well | [['noncommutative', 'gauge', 'theories', 'with', 'a', 'nonconstant', 'ncparameter', 'are', 'investigated', 'as', 'a', 'novel', 'approach', 'we', 'propose', 'that', 'such', 'theories', 'should', 'admit', 'an', 'underlying', 'l_infty', 'algebra', 'that', 'governs', 'not', 'only', 'the', 'action', 'of', 'the', 'symmetries', 'but', 'also', 'the', 'dynamics', 'of', 'the', 'theory', 'our', 'approach', 'is', 'well', 'motivated', 'from', 'string', 'theory', 'we', 'recall', 'that', 'such', 'field', 'theories', 'arise', 'in', 'the', 'context', 'of', 'branes', 'in', 'wzw', 'models', 'and', 'briefly', 'comment', 'on', 'its', 'appearance', 'for', 'integrable', 'deformations', 'of', 'ads_5', 'sigma', 'models', 'for', 'the', 'su2', 'wzw', 'model', 'we', 'show', 'that', 'the', 'earlier', 'proposed', 'matrix', 'valued', 'gauge', 'theory', 'on', 'the', 'fuzzy', '2sphere', 'can', 'be', 'bootstrapped', 'via', 'an', 'l_infty', 'algebra', 'we', 'then', 'apply', 'this', 'approach', 'to', 'the', 'construction', 'of', 'noncommutative', 'chernsimons', 'and', 'yangmills', 'theories', 'on', 'flat', 'and', 'curved', 'backgrounds', 'with', 'nonconstant', 'ncstructure', 'more', 'concretely', 'up', 'to', 'the', 'second', 'order', 'we', 'demonstrate', 'how', 'derivative', 'and', 'curvature', 'corrections', 'to', 'the', 'equations', 'of', 'motion', 'can', 'be', 'bootstrapped', 'in', 'an', 'algebraic', 'way', 'from', 'the', 'l_infty', 'algebra', 'the', 'appearance', 'of', 'a', 'nontrivial', 'a_infty', 'algebra', 'is', 'discussed', 'as', 'well']] | [-0.09289831583311486, 0.1173785548743603, -0.08458260849454013, 0.10498009640908028, -0.11635109210364157, -0.13514267110333936, -0.05844361000203119, 0.36006669380429496, -0.26291254893649463, -0.22654875719894246, 0.10320645399042405, -0.24264005393289576, -0.2586292895439106, 0.13098670183766134, -0.1329051625131198, -0.003957688130179942, -0.00746664502544374, 0.1096411465167454, -0.1342714185480074, -0.275443691413895, 0.3581575452628341, 0.019636716543151658, 0.24306180212993128, 0.050389224328327833, 0.1377015525514896, -0.017426910412656826, -0.002533604645045338, 0.03995677464635952, -0.1397923128290752, 0.12099114162194338, 0.23773899252680677, 0.08391454768535346, 0.1476112129621026, -0.4394067187861698, -0.2108820447534615, 0.08840480330968048, 0.15437907380585716, 0.12860313722318628, -0.005718128064029038, -0.31881201378546836, 0.0662110697921002, -0.20436790721241113, -0.12210731579291793, -0.13069865878077974, -0.009340161218438524, -0.06276990170732549, -0.2403380971546739, 0.061516527607348444, 0.07007930747080003, 0.047544498712097, -0.09838605864064359, -0.05456965529890845, -0.0676890241745973, 0.05071427585080084, 0.07478413393610248, 0.07968979536998654, 0.11401913071153458, -0.14480379775802538, -0.18856080256618288, 0.3716460724940478, -0.08326776130565033, -0.29321731315221544, 0.1321858917135836, -0.13704127731176502, -0.1908442910516453, 0.036605417862441446, 0.12225269164219953, 0.15819333554330714, -0.08128915678016932, 0.2258814945462069, -0.05080572652443108, 0.11682827580470319, 0.04502434390522511, 0.01671398675818814, 0.21288900314148787, 0.11361441502373143, 0.03895184291326498, 0.11306083232317711, 0.0014051345791724489, -0.13858316323958428, -0.4270846029720837, -0.12706743300024267, -0.09416594657842524, 0.11769779505381693, -0.1275136493847041, -0.17880324321151597, 0.3718202798684105, 0.16805039794843007, 0.16534616684302597, 0.09550901754509385, 0.19146331714284492, 0.13919941842678094, 0.075537272118509, 0.02406048171631083, 0.19878753853029082, 0.1862211458657573, 0.02921638784294085, -0.1997842274412084, -0.1000800784847631, 0.1833275569952093] |
1,803.00733 | Continuous-time GARCH process driven by semi-L\'evy process | In this paper we study the simple semi-L\'evy driven continuous-time
generalized autoregressive conditionally heteroscedastic (SS-COGARCH) process.
The statistical properties of this process are characterized. This process has
the potential to approximate any semi-L\'evy driven COGARCH processes. We show
that the state representation of such SS-COGARCH process can be described by a
random recurrence equation with periodic random coefficients. The almost sure
absolute convergence of the state process is proved. The periodically
stationary solution of the state process is shown which cause the volatility to
be periodically stationary under some suitable conditions. Also it is shown
that the increments with constant length of such SS-COGARCH process is itself a
periodically correlated (PC) process. Finally, we apply some test to
investigate the PC behavior of the increments (with constant length) of the
simulated samples of proposed SS-COGARCH process.
| math.ST stat.TH | in this paper we study the simple semilevy driven continuoustime generalized autoregressive conditionally heteroscedastic sscogarch process the statistical properties of this process are characterized this process has the potential to approximate any semilevy driven cogarch processes we show that the state representation of such sscogarch process can be described by a random recurrence equation with periodic random coefficients the almost sure absolute convergence of the state process is proved the periodically stationary solution of the state process is shown which cause the volatility to be periodically stationary under some suitable conditions also it is shown that the increments with constant length of such sscogarch process is itself a periodically correlated pc process finally we apply some test to investigate the pc behavior of the increments with constant length of the simulated samples of proposed sscogarch process | [['in', 'this', 'paper', 'we', 'study', 'the', 'simple', 'semilevy', 'driven', 'continuoustime', 'generalized', 'autoregressive', 'conditionally', 'heteroscedastic', 'sscogarch', 'process', 'the', 'statistical', 'properties', 'of', 'this', 'process', 'are', 'characterized', 'this', 'process', 'has', 'the', 'potential', 'to', 'approximate', 'any', 'semilevy', 'driven', 'cogarch', 'processes', 'we', 'show', 'that', 'the', 'state', 'representation', 'of', 'such', 'sscogarch', 'process', 'can', 'be', 'described', 'by', 'a', 'random', 'recurrence', 'equation', 'with', 'periodic', 'random', 'coefficients', 'the', 'almost', 'sure', 'absolute', 'convergence', 'of', 'the', 'state', 'process', 'is', 'proved', 'the', 'periodically', 'stationary', 'solution', 'of', 'the', 'state', 'process', 'is', 'shown', 'which', 'cause', 'the', 'volatility', 'to', 'be', 'periodically', 'stationary', 'under', 'some', 'suitable', 'conditions', 'also', 'it', 'is', 'shown', 'that', 'the', 'increments', 'with', 'constant', 'length', 'of', 'such', 'sscogarch', 'process', 'is', 'itself', 'a', 'periodically', 'correlated', 'pc', 'process', 'finally', 'we', 'apply', 'some', 'test', 'to', 'investigate', 'the', 'pc', 'behavior', 'of', 'the', 'increments', 'with', 'constant', 'length', 'of', 'the', 'simulated', 'samples', 'of', 'proposed', 'sscogarch', 'process']] | [-0.10377325248897679, 0.15709467460264398, -0.10202271213261958, 0.049208357132569935, -0.03553458359195193, -0.12780379625859067, 0.04393988059660735, 0.42246043191784444, -0.35257816346197884, -0.17692864896140664, 0.14490696711393813, -0.23827502706690745, -0.1680541662088431, 0.17378859044401906, -0.06131430173135253, 0.1121360065675724, 0.05035808522884241, 0.03567084035945728, 0.003454288890626391, -0.2604132459964603, 0.2999354558038142, 0.05793298540126724, 0.2801050309619099, -0.03652014079210965, 0.14729561825173304, -0.01065021865617703, -0.012541239668601467, -0.0159231764743762, -0.12261665298191314, 0.01968681112424854, 0.17480875939637533, 0.06197489059174105, 0.28326101176550283, -0.38766846843817104, -0.22392232639386372, 0.14692268544561504, 0.1261327015407219, 0.06081439559056889, -0.02198659875841044, -0.3018021960854051, 0.09560783987741589, -0.14298270898956722, -0.1801051760044442, -0.05817282396738472, 0.019937776487923282, 0.07154706870000262, -0.3246284537154305, 0.11101962741518304, 0.13242915291031002, 0.004588308059550507, -0.03582155388636131, -0.06004604555303505, 0.013803244527319776, 0.07311298653675134, 0.06242048374513294, 3.115606138153988e-05, 0.13628659891786382, -0.05957963212345289, -0.1279245765729095, 0.32570567710311427, -0.0962808447986711, -0.23747854883892133, 0.14626471498323715, -0.14428524128572248, -0.12561512028675198, 0.12712298145668363, 0.1635319664937389, 0.10695601904573028, -0.22276879499515737, 0.08394668191704113, -0.02981001924148158, 0.16199854549075313, 0.04208485659910366, -0.018135132226983413, 0.1453136706909658, 0.1711787765397115, 0.055981660645235985, 0.17538510416189262, -0.04829489596544162, -0.15681102562709437, -0.2942466066314784, -0.1489983435227152, -0.19213066767106818, 0.09293435855515246, -0.1217417086201535, -0.21420058554084628, 0.34700323130784777, 0.17970137440887116, 0.2020690248498474, 0.06889104656275936, 0.21836870446157478, 0.2234163592733881, -0.03276191523421884, 0.08450682201724061, 0.15348771541346864, 0.13411378596142373, 0.07534588977475376, -0.17067336164045094, 0.1691831848840914, 0.03232919884955182] |
1,803.00734 | Stable amplitude chimera states in a network of locally coupled
Stuart-Landau oscillators | We investigate the occurrence of collective dynamical states such as
transient amplitude chimera, stable amplitude chimera and imperfect breathing
chimera states in a \textit{locally coupled} network of Stuart-Landau
oscillators. In an imperfect breathing chimera state, the synchronized group of
oscillators exhibits oscillations with large amplitudes while the
desynchronized group of oscillators oscillates with small amplitudes and this
behavior of coexistence of synchronized and desynchronized oscillations
fluctuates with time. Then we analyze the stability of the amplitude chimera
states under various circumstances, including variations in system parameters
and coupling strength, and perturbations in the initial states of the
oscillators. For an increase in the value of the system parameter, namely the
nonisochronicity parameter, the transient chimera state becomes a stable
chimera state for a sufficiently large value of coupling strength. In addition,
we also analyze the stability of these states by perturbing the initial states
of the oscillators. We find that while a small perturbation allows one to
perturb a large number of oscillators resulting in a stable amplitude chimera
state, a large perturbation allows one to perturb a small number of oscillators
to get a stable amplitude chimera state. We also find the stability of the
transient and stable amplitude chimera states as well as traveling wave states
for appropriate number of oscillators using Floquet theory. In addition, we
also find the stability of the incoherent oscillation death states.
| nlin.AO | we investigate the occurrence of collective dynamical states such as transient amplitude chimera stable amplitude chimera and imperfect breathing chimera states in a textitlocally coupled network of stuartlandau oscillators in an imperfect breathing chimera state the synchronized group of oscillators exhibits oscillations with large amplitudes while the desynchronized group of oscillators oscillates with small amplitudes and this behavior of coexistence of synchronized and desynchronized oscillations fluctuates with time then we analyze the stability of the amplitude chimera states under various circumstances including variations in system parameters and coupling strength and perturbations in the initial states of the oscillators for an increase in the value of the system parameter namely the nonisochronicity parameter the transient chimera state becomes a stable chimera state for a sufficiently large value of coupling strength in addition we also analyze the stability of these states by perturbing the initial states of the oscillators we find that while a small perturbation allows one to perturb a large number of oscillators resulting in a stable amplitude chimera state a large perturbation allows one to perturb a small number of oscillators to get a stable amplitude chimera state we also find the stability of the transient and stable amplitude chimera states as well as traveling wave states for appropriate number of oscillators using floquet theory in addition we also find the stability of the incoherent oscillation death states | [['we', 'investigate', 'the', 'occurrence', 'of', 'collective', 'dynamical', 'states', 'such', 'as', 'transient', 'amplitude', 'chimera', 'stable', 'amplitude', 'chimera', 'and', 'imperfect', 'breathing', 'chimera', 'states', 'in', 'a', 'textitlocally', 'coupled', 'network', 'of', 'stuartlandau', 'oscillators', 'in', 'an', 'imperfect', 'breathing', 'chimera', 'state', 'the', 'synchronized', 'group', 'of', 'oscillators', 'exhibits', 'oscillations', 'with', 'large', 'amplitudes', 'while', 'the', 'desynchronized', 'group', 'of', 'oscillators', 'oscillates', 'with', 'small', 'amplitudes', 'and', 'this', 'behavior', 'of', 'coexistence', 'of', 'synchronized', 'and', 'desynchronized', 'oscillations', 'fluctuates', 'with', 'time', 'then', 'we', 'analyze', 'the', 'stability', 'of', 'the', 'amplitude', 'chimera', 'states', 'under', 'various', 'circumstances', 'including', 'variations', 'in', 'system', 'parameters', 'and', 'coupling', 'strength', 'and', 'perturbations', 'in', 'the', 'initial', 'states', 'of', 'the', 'oscillators', 'for', 'an', 'increase', 'in', 'the', 'value', 'of', 'the', 'system', 'parameter', 'namely', 'the', 'nonisochronicity', 'parameter', 'the', 'transient', 'chimera', 'state', 'becomes', 'a', 'stable', 'chimera', 'state', 'for', 'a', 'sufficiently', 'large', 'value', 'of', 'coupling', 'strength', 'in', 'addition', 'we', 'also', 'analyze', 'the', 'stability', 'of', 'these', 'states', 'by', 'perturbing', 'the', 'initial', 'states', 'of', 'the', 'oscillators', 'we', 'find', 'that', 'while', 'a', 'small', 'perturbation', 'allows', 'one', 'to', 'perturb', 'a', 'large', 'number', 'of', 'oscillators', 'resulting', 'in', 'a', 'stable', 'amplitude', 'chimera', 'state', 'a', 'large', 'perturbation', 'allows', 'one', 'to', 'perturb', 'a', 'small', 'number', 'of', 'oscillators', 'to', 'get', 'a', 'stable', 'amplitude', 'chimera', 'state', 'we', 'also', 'find', 'the', 'stability', 'of', 'the', 'transient', 'and', 'stable', 'amplitude', 'chimera', 'states', 'as', 'well', 'as', 'traveling', 'wave', 'states', 'for', 'appropriate', 'number', 'of', 'oscillators', 'using', 'floquet', 'theory', 'in', 'addition', 'we', 'also', 'find', 'the', 'stability', 'of', 'the', 'incoherent', 'oscillation', 'death', 'states']] | [-0.2839813021816899, 0.281993284875524, -0.06699786726670039, 0.044997955263210015, 0.021430657952861233, -0.13774238553306892, 0.09230328389844047, 0.2856648928154358, -0.2477902637969491, -0.24486617425834867, 0.10217485575241293, -0.23148440321367011, -0.19829054178942532, 0.1330772664715174, -0.006371950143012808, 0.04713643967086555, 0.11282048508724174, 0.08610604213566954, -0.016671588519327832, -0.14967200925164983, 0.34126822481045754, -0.020302560257696948, 0.3105718714945571, -0.07738200463807031, 0.07438381744231459, -0.02840151584922747, 0.10536089140258925, 0.034423859704054045, -0.12130760815679975, 0.009756466108181119, 0.21973040665104104, 0.060712947201097635, 0.2739985275558119, -0.4255509609437861, -0.18989833537895867, 0.12334460775087298, 0.16269490502644574, 0.23352806576360913, 0.017422851599553625, -0.35630479583915275, -0.00089362711954748, -0.18493168732948503, -0.2087721210816981, -0.12278300908691042, 0.06925627716520077, 0.06433658670953284, -0.27488068416389316, 0.11917829217948935, -0.0027587972003122684, 0.0119582433375534, -0.09499764704810432, -0.02231977009987174, -0.09459200464178885, 0.1416603303117897, 0.0020243232540062355, -0.0499273905160483, 0.10001905642726405, -0.1465350141124515, -0.08769441023672317, 0.2799274772812316, -0.1326825987859263, -0.14915688834498803, 0.1962926250284611, -0.1474950370159179, -0.12123086818953463, 0.12840071239195536, 0.17309026914296924, 0.07003895944293474, -0.048977392575170794, 0.01076158518266486, 0.018433029185962766, 0.2244500798258654, 0.10042948000576331, 0.11562247812447005, 0.1674758572554354, 0.2069231067371339, 0.12076143067183713, 0.1968120027833728, -0.10308863168915806, -0.13867229974613116, -0.26091704054585124, -0.02043823860016322, -0.1459409545773567, 0.02680961263494914, -0.08732582940315872, -0.23109891745526198, 0.5095512174541643, 0.08394144025964735, 0.20405654417245148, 0.005116036934493411, 0.21545846164470547, 0.10171427800448196, -0.0017324078087918623, 0.07045276606390374, 0.316897907805747, 0.2011836811454812, 0.09896672983332558, -0.32338273019110986, 0.03062619561508428, -0.023586260032836006] |
1,803.00735 | A Quantum N-Queens Solver | The N-queens problem is to find the position of N queens on an N by N chess
board such that no queens attack each other. The excluded diagonals N-queens
problem is a variation where queens cannot be placed on some predefined fields
along diagonals. This variation is proven NP-complete and the parameter regime
to generate hard instances that are intractable with current classical
algorithms is known. We propose a special purpose quantum simulator that
implements the excluded diagonals N-queens completion problem using atoms in an
optical lattice and cavity-mediated long-range interactions. Our implementation
has no overhead from the embedding allowing to directly probe for a possible
quantum advantage in near term devices for optimization problems.
| quant-ph cond-mat.quant-gas | the nqueens problem is to find the position of n queens on an n by n chess board such that no queens attack each other the excluded diagonals nqueens problem is a variation where queens cannot be placed on some predefined fields along diagonals this variation is proven npcomplete and the parameter regime to generate hard instances that are intractable with current classical algorithms is known we propose a special purpose quantum simulator that implements the excluded diagonals nqueens completion problem using atoms in an optical lattice and cavitymediated longrange interactions our implementation has no overhead from the embedding allowing to directly probe for a possible quantum advantage in near term devices for optimization problems | [['the', 'nqueens', 'problem', 'is', 'to', 'find', 'the', 'position', 'of', 'n', 'queens', 'on', 'an', 'n', 'by', 'n', 'chess', 'board', 'such', 'that', 'no', 'queens', 'attack', 'each', 'other', 'the', 'excluded', 'diagonals', 'nqueens', 'problem', 'is', 'a', 'variation', 'where', 'queens', 'can', 'not', 'be', 'placed', 'on', 'some', 'predefined', 'fields', 'along', 'diagonals', 'this', 'variation', 'is', 'proven', 'npcomplete', 'and', 'the', 'parameter', 'regime', 'to', 'generate', 'hard', 'instances', 'that', 'are', 'intractable', 'with', 'current', 'classical', 'algorithms', 'is', 'known', 'we', 'propose', 'a', 'special', 'purpose', 'quantum', 'simulator', 'that', 'implements', 'the', 'excluded', 'diagonals', 'nqueens', 'completion', 'problem', 'using', 'atoms', 'in', 'an', 'optical', 'lattice', 'and', 'cavitymediated', 'longrange', 'interactions', 'our', 'implementation', 'has', 'no', 'overhead', 'from', 'the', 'embedding', 'allowing', 'to', 'directly', 'probe', 'for', 'a', 'possible', 'quantum', 'advantage', 'in', 'near', 'term', 'devices', 'for', 'optimization', 'problems']] | [-0.15287576420714372, 0.10720409926028063, -0.024953283167319727, 0.06807144693046777, -0.11732671366892113, -0.22709696175097005, 0.04998755226000052, 0.4004748998017147, -0.2762911798239782, -0.3146572354859833, 0.11347405820310212, -0.2938454625887218, -0.12180661328602582, 0.18028944123793264, -0.07542907836814892, 0.03717954859241907, 0.061568750566321204, 0.03925409732017152, -0.01120148588961456, -0.2953274218879383, 0.2544378321698128, 0.0037486799129541836, 0.2092799487331047, 0.05447892546212172, 0.10522290026158865, 0.038851081341472936, 0.06499667034147243, 0.03608181788024075, -0.09474130650546456, 0.07087870123334518, 0.27032186552392445, 0.11767717056048649, 0.268071461806138, -0.42756652632920905, -0.14558923915670863, 0.16317727910615665, 0.15583584153350313, 0.10766327156332033, -0.01665226899384489, -0.27643921335452587, 0.025741935711643047, -0.10751178566816039, -0.08649503821213549, -0.029665494855525422, 0.04821232459026164, -0.0455707074117903, -0.2617982130313035, -0.04226853976283094, 0.04256365334731527, 0.017025312063573248, 0.00038364348802133463, -0.14072116980618188, 0.06417323878348066, 0.12359950072653912, -0.010183261422408295, 0.052423231383978294, 0.10278320012630188, -0.11188163383460427, -0.17420543251751824, 0.3951929294311538, -0.006510101989361233, -0.22269655279172906, 0.12990291997316647, -0.0679792199255738, -0.15170044179780987, 0.13060566565074058, 0.1401377080313476, 0.12623827395446854, -0.11615228204554397, 0.1483878183955375, -0.09622395433212534, 0.22790020126207122, 0.08681619989862345, 0.004112619386809268, 0.18360623896547495, 0.1367526069877605, 0.12881709787400503, 0.18372330894836242, -0.0675826785828294, -0.12135354521060121, -0.27226168387328625, -0.10501380569847493, -0.2264986782222344, 0.018355780909493254, -0.06702325653444358, -0.17002391207617998, 0.3166524321322554, 0.16497610519180508, 0.1821134431893997, 0.05926940765970483, 0.3188589530603575, 0.0764183343261689, 0.09430707378337032, 0.08828952012117952, 0.19298887317764357, 0.07360743082746671, 0.054563170467535484, -0.20589152998732532, 0.08218132469859295, 0.09127036696661199] |
1,803.00736 | Stress-stress correlator in lambda phi^4 theory: Poles or a Cut? | We explore the analytical properties of the traceless stress tensor 2-point
function at zero momentum and small frequency (relevant for shear viscosity and
hydrodynamic response) in hot, weakly coupled lambda phi^4 theory. We show
that, rather than one or a small number of poles, the correlator has a cut
along the negative imaginary frequency axis. We briefly discuss this result's
relevance for constructing 2'nd order hydrodynamic models of hot relativistic
field theories.
| hep-ph | we explore the analytical properties of the traceless stress tensor 2point function at zero momentum and small frequency relevant for shear viscosity and hydrodynamic response in hot weakly coupled lambda phi4 theory we show that rather than one or a small number of poles the correlator has a cut along the negative imaginary frequency axis we briefly discuss this results relevance for constructing 2nd order hydrodynamic models of hot relativistic field theories | [['we', 'explore', 'the', 'analytical', 'properties', 'of', 'the', 'traceless', 'stress', 'tensor', '2point', 'function', 'at', 'zero', 'momentum', 'and', 'small', 'frequency', 'relevant', 'for', 'shear', 'viscosity', 'and', 'hydrodynamic', 'response', 'in', 'hot', 'weakly', 'coupled', 'lambda', 'phi4', 'theory', 'we', 'show', 'that', 'rather', 'than', 'one', 'or', 'a', 'small', 'number', 'of', 'poles', 'the', 'correlator', 'has', 'a', 'cut', 'along', 'the', 'negative', 'imaginary', 'frequency', 'axis', 'we', 'briefly', 'discuss', 'this', 'results', 'relevance', 'for', 'constructing', '2nd', 'order', 'hydrodynamic', 'models', 'of', 'hot', 'relativistic', 'field', 'theories']] | [-0.20954644969121242, 0.19924085540050226, -0.07742150493949237, 0.0723868083360786, -0.1144522194388426, -0.10139800444206533, -0.054736664112877205, 0.332912330269917, -0.212210099833707, -0.19680784658218423, 0.04618978589729118, -0.2812533237738535, -0.1329521798017797, 0.14236110236379318, 0.07847272330481145, 0.019961939012217853, 0.005835334416284847, 0.04883275036182669, -0.08435790522748397, -0.18580975559436613, 0.32557840194527266, 0.041649802355095744, 0.2384259892343026, 0.08170101983705536, 0.07590522460587737, 0.024654389863523345, -0.045176634202814765, 0.07128659214100076, -0.1622574242575057, 0.03019709808884525, 0.20675178940842265, 0.010365576216524156, 0.26182501456545043, -0.4110005495086726, -0.1970965258596051, 0.057307809930838026, 0.13392678695446295, 0.1331615222669724, -0.015040788587713096, -0.1759706914761207, 0.05897329496737155, -0.19637969493891838, -0.21611928433412686, -0.10986460740807363, 0.04437807112278986, -0.00451104121748358, -0.2402677737150548, 0.18109801450757207, 0.020646782553133864, 0.06665462775466342, -0.08167066029758037, -0.1595758768186594, -0.03778891420612732, 0.050157642609620884, 0.09471982930295376, 0.044224993610340685, 0.1569592484156601, -0.19117806782984795, -0.04663050396548998, 0.3695945357774488, -0.13288920137893, -0.23091239940064648, 0.19162585634815818, -0.2159701108208133, -0.10622590877270947, 0.11510535072819847, 0.17483032268420276, 0.14503771925552023, -0.09550496700851202, 0.0868558515649056, 0.00916777733881544, 0.1427330191945657, 0.09400958760589775, 0.0049234468169743195, 0.29141979530039763, 0.10027452384949559, -0.015320000516819872, 0.16362058854105677, -0.051319232236387, -0.0850711355322144, -0.35496018009467256, -0.10412149389190341, -0.1840941964700404, 0.04508788667994344, -0.14354898651193557, -0.19044930718114805, 0.40509768076137537, 0.16481252940138802, 0.18115231429611514, 0.08648431505490509, 0.32710131586322355, 0.14199498969052607, 0.07613581558689475, 0.08735165569103426, 0.2585501347590859, 0.2085306767872276, 0.1235033964427809, -0.27355050353152266, -0.07303860461494575, 0.0952194818528369] |
1,803.00737 | Fusion of multispectral satellite imagery using a cluster of graphics
processing unit | The paper presents a parallel implementation of existing image fusion methods
on a graphical cluster. Parallel implementations of methods based on discrete
wavelet transformation (Haars and Daubechies discrete wavelet transform) are
developed. Experiments were performed on a cluster using GPU and CPU and
performance gains were estimated for the use of the developed parallel
implementations to process satellite images from satellite Landsat 7. The
implementation on a graphic cluster provides performance improvement from 2 to
18 times. The quality of the considered methods was evaluated by ERGAS and QNR
metrics. The results show performance gains and retaining of quality with the
cluster of GPU compared to the results obtained by the authors and other
researchers for a CPU and single GPU.
| cs.CV cs.DC | the paper presents a parallel implementation of existing image fusion methods on a graphical cluster parallel implementations of methods based on discrete wavelet transformation haars and daubechies discrete wavelet transform are developed experiments were performed on a cluster using gpu and cpu and performance gains were estimated for the use of the developed parallel implementations to process satellite images from satellite landsat 7 the implementation on a graphic cluster provides performance improvement from 2 to 18 times the quality of the considered methods was evaluated by ergas and qnr metrics the results show performance gains and retaining of quality with the cluster of gpu compared to the results obtained by the authors and other researchers for a cpu and single gpu | [['the', 'paper', 'presents', 'a', 'parallel', 'implementation', 'of', 'existing', 'image', 'fusion', 'methods', 'on', 'a', 'graphical', 'cluster', 'parallel', 'implementations', 'of', 'methods', 'based', 'on', 'discrete', 'wavelet', 'transformation', 'haars', 'and', 'daubechies', 'discrete', 'wavelet', 'transform', 'are', 'developed', 'experiments', 'were', 'performed', 'on', 'a', 'cluster', 'using', 'gpu', 'and', 'cpu', 'and', 'performance', 'gains', 'were', 'estimated', 'for', 'the', 'use', 'of', 'the', 'developed', 'parallel', 'implementations', 'to', 'process', 'satellite', 'images', 'from', 'satellite', 'landsat', '7', 'the', 'implementation', 'on', 'a', 'graphic', 'cluster', 'provides', 'performance', 'improvement', 'from', '2', 'to', '18', 'times', 'the', 'quality', 'of', 'the', 'considered', 'methods', 'was', 'evaluated', 'by', 'ergas', 'and', 'qnr', 'metrics', 'the', 'results', 'show', 'performance', 'gains', 'and', 'retaining', 'of', 'quality', 'with', 'the', 'cluster', 'of', 'gpu', 'compared', 'to', 'the', 'results', 'obtained', 'by', 'the', 'authors', 'and', 'other', 'researchers', 'for', 'a', 'cpu', 'and', 'single', 'gpu']] | [-0.05656471049936473, -0.05817444023699307, -0.09745815282683697, 0.009541186968359278, -0.06693340420784537, -0.10383899728883027, 0.04801775294275231, 0.4709493817130396, -0.19504409371144024, -0.35934321182079554, 0.12500719880023278, -0.24603423763312832, -0.09072114670387477, 0.29720844104424243, -0.06721529354195087, 0.11596476068827978, 0.17358265668615575, 0.03967070537965652, -0.13170844951667632, -0.3611501221783644, 0.21413089057684623, 0.10463537128011058, 0.3417976538935476, -0.01749733094249136, 0.11568760205722176, -0.027271540966346736, -0.10517649758945812, -0.022563502423403676, -0.07627860903509023, 0.1779931253130155, 0.2099700587766037, 0.15462893110215048, 0.26495148624054904, -0.4186312731909604, -0.15270674996047226, -0.026793134684505112, 0.12170394927201685, 0.012982074790903606, -0.06483869481502748, -0.3184595573693514, 0.13253896969297424, -0.15923590895004017, -0.005773539008372579, -0.07085011113234911, -0.05567593837045287, 0.04160026786079215, -0.27801713453844373, 0.0668936716739898, 0.012064283307687926, 0.10210360122521307, -0.040848040603792046, -0.18019265006103916, 0.04757007438504745, 0.11418321410825183, -0.015128706458981019, 0.04797756550679645, 0.16193618576912103, -0.0699733796828688, -0.20801706353494945, 0.4076181967581107, -0.051103061195924754, -0.2040438875738793, 0.20538011202704132, -0.028414294285284095, -0.13661793107166886, 0.10808321508802166, 0.19436105933379044, 0.05313101874218007, -0.139331317930059, 0.07297201665966918, 0.03678565681334739, 0.1707598889046464, 0.10150857143727524, -0.023508662842829858, 0.10044143528077167, 0.18421938030187748, -0.006459747956804008, 0.17436804907629266, -0.15817683973072544, -0.08249453908363588, -0.17223104873040984, -0.16158954712777776, -0.20479920243244032, -0.0552869615576053, -0.08979667431767742, -0.11142076807450657, 0.408216972057977, 0.1492565338507541, 0.13919723743557438, 0.09435252410413558, 0.36112432264961486, 0.038461829668434325, 0.13034046385225587, 0.12382613626608918, 0.16040837633508173, 0.07710428407400353, 0.13805306404213274, -0.17445996961910432, -0.018580633754387867, 0.0565200620985105] |
1,803.00738 | Notes on the gravitational, electromagnetic and axion memory effects | We investigate the memory effects associated with the kicks of particles.
Recently, the equivalence between the memory effect and soft theorem has been
established. By computing the memory effect from the radiation solutions, we
explicitly confirm that, in addition to the leading piece, the subleading and
subsubleading soft theorems are equivalent to the subleading and subsubleading
memory effects, respectively. It is known that the memory effects can be probed
by the displacements or kicks of the test particles. We point out that the
these memory effects are also probed by the permanent change of the direction
of the spin. We also show that the axion memory effect, recently proposed by
the current authors, can be detected as the change of the spin of the test
particle. We discuss that if we consider the magnetic monopole as an external
particle, the parity-odd electromagnetic memory appears.
| hep-th gr-qc | we investigate the memory effects associated with the kicks of particles recently the equivalence between the memory effect and soft theorem has been established by computing the memory effect from the radiation solutions we explicitly confirm that in addition to the leading piece the subleading and subsubleading soft theorems are equivalent to the subleading and subsubleading memory effects respectively it is known that the memory effects can be probed by the displacements or kicks of the test particles we point out that the these memory effects are also probed by the permanent change of the direction of the spin we also show that the axion memory effect recently proposed by the current authors can be detected as the change of the spin of the test particle we discuss that if we consider the magnetic monopole as an external particle the parityodd electromagnetic memory appears | [['we', 'investigate', 'the', 'memory', 'effects', 'associated', 'with', 'the', 'kicks', 'of', 'particles', 'recently', 'the', 'equivalence', 'between', 'the', 'memory', 'effect', 'and', 'soft', 'theorem', 'has', 'been', 'established', 'by', 'computing', 'the', 'memory', 'effect', 'from', 'the', 'radiation', 'solutions', 'we', 'explicitly', 'confirm', 'that', 'in', 'addition', 'to', 'the', 'leading', 'piece', 'the', 'subleading', 'and', 'subsubleading', 'soft', 'theorems', 'are', 'equivalent', 'to', 'the', 'subleading', 'and', 'subsubleading', 'memory', 'effects', 'respectively', 'it', 'is', 'known', 'that', 'the', 'memory', 'effects', 'can', 'be', 'probed', 'by', 'the', 'displacements', 'or', 'kicks', 'of', 'the', 'test', 'particles', 'we', 'point', 'out', 'that', 'the', 'these', 'memory', 'effects', 'are', 'also', 'probed', 'by', 'the', 'permanent', 'change', 'of', 'the', 'direction', 'of', 'the', 'spin', 'we', 'also', 'show', 'that', 'the', 'axion', 'memory', 'effect', 'recently', 'proposed', 'by', 'the', 'current', 'authors', 'can', 'be', 'detected', 'as', 'the', 'change', 'of', 'the', 'spin', 'of', 'the', 'test', 'particle', 'we', 'discuss', 'that', 'if', 'we', 'consider', 'the', 'magnetic', 'monopole', 'as', 'an', 'external', 'particle', 'the', 'parityodd', 'electromagnetic', 'memory', 'appears']] | [-0.14566554191211858, 0.20288833625666788, -0.07349863361256818, 0.10513773602320321, -0.0723412085402136, -0.0724827740179737, 0.014742893773169877, 0.35060285970879096, -0.2699839092836353, -0.3158868935845223, 0.09818230841564299, -0.28088203263986444, -0.13472280958538047, 0.14789096422221823, -0.013536745585345974, 0.013018464708390335, 0.008041347428742383, 0.0500817779393401, -0.05255950988470835, -0.22847623675705916, 0.31086987714257297, 0.0699420099069054, 0.23317607349923086, 0.09561510227568862, 0.09841838155989535, -0.008499202369421255, -0.022486099320101656, 0.06046878941965082, -0.08238845997448152, 0.026680780079105817, 0.1475999566868672, 0.027341072137157123, 0.21569534870084478, -0.4771522575756535, -0.19120596802612352, 0.11449937497592247, 0.11563390844579165, 0.1252306830526019, -0.05050778155823031, -0.2854010203874269, 0.07613454349565371, -0.21009758598585096, -0.1392120697031108, -0.10685105061697363, 0.03856408588277797, 0.03306373380797191, -0.23517790858426857, 0.07641643772553329, 0.11943025121258365, -0.04662566845460484, -0.03616302968132206, -0.08193930840934627, -0.019672296398008864, 0.11725115889405263, 0.12472261134421893, 0.017218266545872513, 0.1566335871337085, -0.14112349250353873, -0.1761325037550705, 0.35550297842645606, -0.0708652710204155, -0.19424843392334878, 0.1376265758897514, -0.15739673998905346, -0.11709997683970465, 0.1015554812297018, 0.14721913508320641, 0.085783919456541, -0.15456649351916793, 0.10343627350205982, -0.0059147889842279255, 0.15821746585526045, 0.0818143488593503, 0.09310534124637747, 0.23095586324537484, 0.11811364784241757, -0.00900496243492752, 0.20826114877612176, -0.14790605360798914, -0.06584449781480038, -0.3008165038708184, -0.15185525889197984, -0.19183865200547087, 0.05194277091585617, -0.08529987742763802, -0.11892700393541923, 0.35237071397649644, 0.19057754138419922, 0.13120446199577096, 0.02983349113168919, 0.28818357812188977, 0.14204626711175983, 0.14794517787716663, 0.08963421182448252, 0.31207072511056644, 0.1112223243205032, 0.11280498851232955, -0.2942790606127043, 0.06466223009758526, 0.03899877490605124] |
1,803.00739 | Markov Switch Smooth Transition HYGARCH Model: Stability and Estimation | HYGARCH model is basically used to model long-range dependence in volatility.
We propose Markov switch smooth-transition HYGARCH model, where the volatility
in each state is a time-dependent convex combination of GARCH and FIGARCH. This
model provides a flexible structure to capture different levels of volatilities
and also short and long memory effects. The necessary and sufficient condition
for the asymptotic stability is derived. Forecast of conditional variance is
studied by using all past information through a parsimonious way. Bayesian
estimations based on Gibbs sampling are provided. A simulation study has been
given to evaluate the estimations and model stability. The competitive
performance of the proposed model is shown by comparing it with the HYGARCH and
smooth-transition HYGARCH models for some period of the
\textit{S}\&\textit{P}500 indices based on volatility and value-at-risk
forecasts.
| math.ST stat.TH | hygarch model is basically used to model longrange dependence in volatility we propose markov switch smoothtransition hygarch model where the volatility in each state is a timedependent convex combination of garch and figarch this model provides a flexible structure to capture different levels of volatilities and also short and long memory effects the necessary and sufficient condition for the asymptotic stability is derived forecast of conditional variance is studied by using all past information through a parsimonious way bayesian estimations based on gibbs sampling are provided a simulation study has been given to evaluate the estimations and model stability the competitive performance of the proposed model is shown by comparing it with the hygarch and smoothtransition hygarch models for some period of the textitstextitp500 indices based on volatility and valueatrisk forecasts | [['hygarch', 'model', 'is', 'basically', 'used', 'to', 'model', 'longrange', 'dependence', 'in', 'volatility', 'we', 'propose', 'markov', 'switch', 'smoothtransition', 'hygarch', 'model', 'where', 'the', 'volatility', 'in', 'each', 'state', 'is', 'a', 'timedependent', 'convex', 'combination', 'of', 'garch', 'and', 'figarch', 'this', 'model', 'provides', 'a', 'flexible', 'structure', 'to', 'capture', 'different', 'levels', 'of', 'volatilities', 'and', 'also', 'short', 'and', 'long', 'memory', 'effects', 'the', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'asymptotic', 'stability', 'is', 'derived', 'forecast', 'of', 'conditional', 'variance', 'is', 'studied', 'by', 'using', 'all', 'past', 'information', 'through', 'a', 'parsimonious', 'way', 'bayesian', 'estimations', 'based', 'on', 'gibbs', 'sampling', 'are', 'provided', 'a', 'simulation', 'study', 'has', 'been', 'given', 'to', 'evaluate', 'the', 'estimations', 'and', 'model', 'stability', 'the', 'competitive', 'performance', 'of', 'the', 'proposed', 'model', 'is', 'shown', 'by', 'comparing', 'it', 'with', 'the', 'hygarch', 'and', 'smoothtransition', 'hygarch', 'models', 'for', 'some', 'period', 'of', 'the', 'textitstextitp500', 'indices', 'based', 'on', 'volatility', 'and', 'valueatrisk', 'forecasts']] | [-0.046697434528596204, 0.05756353406468406, -0.1163957686003414, 0.14466172443280811, -0.05788011383901903, -0.16176945872575743, 0.03570025856879511, 0.41941086869337596, -0.23675060983805452, -0.27695494404179044, 0.14487682068102004, -0.23873293337237556, -0.13989522944115151, 0.19074682209020466, -0.07808322296477854, 0.08353345046634786, 0.03360995082221052, 0.017334828600723995, -0.025440206858547754, -0.2514130569452391, 0.23454918926290702, 0.11385173990493058, 0.3220804335869616, 0.01569017258952954, 0.16293270479218336, -0.016161342486157082, -0.03367965033544351, 0.011004490945197176, -0.15625751440165914, 0.11497006778154173, 0.1872502737018351, 0.12445585927889624, 0.3007949742514029, -0.4124515896110097, -0.24307055451208726, 0.11824415437331481, 0.065543516921025, 0.06061286279873457, 0.007894938580648159, -0.28117168074822985, 0.03668445140192489, -0.21984369910205714, -0.048228569546154176, -0.14008320360153448, 0.0187418434798019, 0.06680233492988918, -0.3471152961633379, 0.10515411312303513, 0.031175390982753015, 0.05020943049271409, -0.06627191574807512, -0.11827489589632023, -0.03470604979884229, 0.09009603850063286, 0.08554571720560489, -0.03601681382042443, 0.06801563008411904, -0.08078040587264468, -0.13828112637565937, 0.3294968967420573, -0.11160643242874357, -0.2277064986633377, 0.14586530416818277, -0.10986037160000706, -0.11333446485150489, 0.07503326797450427, 0.17302234931412386, 0.07584927191783208, -0.20482405620396094, 0.07108163035672987, -0.010421420670354564, 0.15865708865931083, -0.005195149144583411, -0.02251903603610117, 0.16431715659018664, 0.24570409848092822, 0.053904063081063214, 0.1359091557337706, -0.11165521807481582, -0.16862937094083463, -0.2563626276823925, -0.09417116564145545, -0.1671524461644367, -0.007212786162199336, -0.13177951297177515, -0.1592207101209624, 0.4233978826305247, 0.20447122553377994, 0.1711233023343084, 0.11973674777163978, 0.3051520285225706, 0.14597802308480823, -0.007802117405276476, 0.08033388435796951, 0.16631426571734664, 0.12017573776029167, 0.054814470026030904, -0.1665369489674049, 0.20943579600680096, 0.04696967211202718] |
1,803.0074 | Interrogating Seyferts with NebulaBayes: Spatially probing the
narrow-line region radiation fields and chemical abundances | NebulaBayes is a new Bayesian code that implements a general method of
comparing observed emission-line fluxes to photoionization model grids. The
code enables us to extract robust, spatially resolved measurements of
abundances in the extended narrow line regions (ENLRs) produced by Active
Galactic Nuclei (AGN). We observe near-constant ionization parameters but
steeply radially-declining pressures, which together imply that radiation
pressure regulates the ENLR density structure on large scales. Our sample
includes four `pure Seyfert' galaxies from the S7 survey that have extensive
ENLRs. NGC2992 shows steep metallicity gradients from the nucleus into the
ionization cones. An {\it inverse} metallicity gradient is observed in
ESO138-G01, which we attribute to a recent gas inflow or minor merger. A
uniformly high metallicity and hard ionizing continuum are inferred across the
ENLR of Mrk573. Our analysis of IC5063 is likely affected by contamination from
shock excitation, which appears to soften the inferred ionizing spectrum. The
peak of the ionizing continuum E_peak is determined by the nuclear spectrum and
the absorbing column between the nucleus and the ionized nebula. We cannot
separate variation in this intrinsic E_peak from the effects of shock or HII
region contamination, but E_peak measurements nevertheless give insights into
ENLR excitation. We demonstrate the general applicability of NebulaBayes by
analyzing a nuclear spectrum from the non-active galaxy NGC4691 using a HII
region grid. The NLR and HII region model grids are provided with NebulaBayes
for use by the astronomical community.
| astro-ph.GA | nebulabayes is a new bayesian code that implements a general method of comparing observed emissionline fluxes to photoionization model grids the code enables us to extract robust spatially resolved measurements of abundances in the extended narrow line regions enlrs produced by active galactic nuclei agn we observe nearconstant ionization parameters but steeply radiallydeclining pressures which together imply that radiation pressure regulates the enlr density structure on large scales our sample includes four pure seyfert galaxies from the s7 survey that have extensive enlrs ngc2992 shows steep metallicity gradients from the nucleus into the ionization cones an it inverse metallicity gradient is observed in eso138g01 which we attribute to a recent gas inflow or minor merger a uniformly high metallicity and hard ionizing continuum are inferred across the enlr of mrk573 our analysis of ic5063 is likely affected by contamination from shock excitation which appears to soften the inferred ionizing spectrum the peak of the ionizing continuum e_peak is determined by the nuclear spectrum and the absorbing column between the nucleus and the ionized nebula we cannot separate variation in this intrinsic e_peak from the effects of shock or hii region contamination but e_peak measurements nevertheless give insights into enlr excitation we demonstrate the general applicability of nebulabayes by analyzing a nuclear spectrum from the nonactive galaxy ngc4691 using a hii region grid the nlr and hii region model grids are provided with nebulabayes for use by the astronomical community | [['nebulabayes', 'is', 'a', 'new', 'bayesian', 'code', 'that', 'implements', 'a', 'general', 'method', 'of', 'comparing', 'observed', 'emissionline', 'fluxes', 'to', 'photoionization', 'model', 'grids', 'the', 'code', 'enables', 'us', 'to', 'extract', 'robust', 'spatially', 'resolved', 'measurements', 'of', 'abundances', 'in', 'the', 'extended', 'narrow', 'line', 'regions', 'enlrs', 'produced', 'by', 'active', 'galactic', 'nuclei', 'agn', 'we', 'observe', 'nearconstant', 'ionization', 'parameters', 'but', 'steeply', 'radiallydeclining', 'pressures', 'which', 'together', 'imply', 'that', 'radiation', 'pressure', 'regulates', 'the', 'enlr', 'density', 'structure', 'on', 'large', 'scales', 'our', 'sample', 'includes', 'four', 'pure', 'seyfert', 'galaxies', 'from', 'the', 's7', 'survey', 'that', 'have', 'extensive', 'enlrs', 'ngc2992', 'shows', 'steep', 'metallicity', 'gradients', 'from', 'the', 'nucleus', 'into', 'the', 'ionization', 'cones', 'an', 'it', 'inverse', 'metallicity', 'gradient', 'is', 'observed', 'in', 'eso138g01', 'which', 'we', 'attribute', 'to', 'a', 'recent', 'gas', 'inflow', 'or', 'minor', 'merger', 'a', 'uniformly', 'high', 'metallicity', 'and', 'hard', 'ionizing', 'continuum', 'are', 'inferred', 'across', 'the', 'enlr', 'of', 'mrk573', 'our', 'analysis', 'of', 'ic5063', 'is', 'likely', 'affected', 'by', 'contamination', 'from', 'shock', 'excitation', 'which', 'appears', 'to', 'soften', 'the', 'inferred', 'ionizing', 'spectrum', 'the', 'peak', 'of', 'the', 'ionizing', 'continuum', 'e_peak', 'is', 'determined', 'by', 'the', 'nuclear', 'spectrum', 'and', 'the', 'absorbing', 'column', 'between', 'the', 'nucleus', 'and', 'the', 'ionized', 'nebula', 'we', 'can', 'not', 'separate', 'variation', 'in', 'this', 'intrinsic', 'e_peak', 'from', 'the', 'effects', 'of', 'shock', 'or', 'hii', 'region', 'contamination', 'but', 'e_peak', 'measurements', 'nevertheless', 'give', 'insights', 'into', 'enlr', 'excitation', 'we', 'demonstrate', 'the', 'general', 'applicability', 'of', 'nebulabayes', 'by', 'analyzing', 'a', 'nuclear', 'spectrum', 'from', 'the', 'nonactive', 'galaxy', 'ngc4691', 'using', 'a', 'hii', 'region', 'grid', 'the', 'nlr', 'and', 'hii', 'region', 'model', 'grids', 'are', 'provided', 'with', 'nebulabayes', 'for', 'use', 'by', 'the', 'astronomical', 'community']] | [-0.00860995788717611, 0.09064174956920358, -0.07126289245648947, 0.10916916094671243, -0.056200175707224555, -0.09062136555648555, 0.043176208259508346, 0.46901054294457667, -0.1788180767271652, -0.3285675509655966, 0.01279647975525414, -0.2771959628178915, 0.017270057232272398, 0.15866066098560969, -0.00744048556455859, -0.06360640660132663, 0.015768335515216683, -0.13402941916678257, -0.02441635317432415, -0.1718299188228709, 0.33443131297433804, 0.1174327466393259, 0.20521040171589153, 0.02381622378193952, 0.07055984176931125, -0.11351817238482524, -0.09791165930395827, 0.017209001178244122, -0.13166077633312573, 0.06866047887489168, 0.2420306806305211, 0.1318965962300085, 0.21444994609563253, -0.34992784950552475, -0.2721324332538827, 0.05516165719411281, 0.21288867170415535, 0.07071003798082989, -0.07010606505548511, -0.27308566247865573, -0.002826264114335242, -0.18350662384968142, -0.16338686062659644, 0.049773745504215275, -0.0014634468049431841, 0.028896236690036357, -0.24460140321495105, 0.14980285215674888, -0.011977975163166706, 0.06682680146022059, -0.11589930096311093, -0.10860046452473268, -0.08134638877852746, 0.07469089020570183, 0.015490271227693633, 0.04885564963451198, 0.2668226276846595, -0.11220468350224616, 0.007318411838805563, 0.3775707432049236, -0.02545427667755115, -0.003911853220361926, 0.19643730872786183, -0.22601793454822453, -0.1543590250112635, 0.25630518441620964, 0.14410281936021105, 0.10991852013895265, -0.11349416066394365, 0.023683666687788842, -0.04524718413673703, 0.2385360201671405, 0.009432788087518783, 0.02715307194303637, 0.25720582265733005, 0.07119417083911393, 0.0445988217043545, 0.13890865222621662, -0.20165473682597626, -0.04391196163291139, -0.2566973944927737, -0.04036820170180754, -0.12259879797001523, 0.08625884257157025, -0.12966164596008437, -0.14225993354172142, 0.35173947269584244, 0.09334375170739329, 0.22497161768302165, 0.007367479261615066, 0.3298729893767161, 0.08855217195780091, 0.0887981070400086, 0.14674121957814582, 0.29779241937566314, 0.18039373163122072, 0.07151839851091306, -0.266008393451933, 0.09050177432545599, 0.012631494906546257] |
1,803.00741 | On Topologized Fundamental Group and covering spaces of topological
groups | In this paper, we show that every topological group is a strong small loop
transfer space at the identity element. This implies that the quasitopological
fundamental group of a connected locally path connected topological group is a
topological group. Also, we show that every covering space of a connected
locally path connected topological group is a topological group and its
covering map is homomorphism.
| math.AT | in this paper we show that every topological group is a strong small loop transfer space at the identity element this implies that the quasitopological fundamental group of a connected locally path connected topological group is a topological group also we show that every covering space of a connected locally path connected topological group is a topological group and its covering map is homomorphism | [['in', 'this', 'paper', 'we', 'show', 'that', 'every', 'topological', 'group', 'is', 'a', 'strong', 'small', 'loop', 'transfer', 'space', 'at', 'the', 'identity', 'element', 'this', 'implies', 'that', 'the', 'quasitopological', 'fundamental', 'group', 'of', 'a', 'connected', 'locally', 'path', 'connected', 'topological', 'group', 'is', 'a', 'topological', 'group', 'also', 'we', 'show', 'that', 'every', 'covering', 'space', 'of', 'a', 'connected', 'locally', 'path', 'connected', 'topological', 'group', 'is', 'a', 'topological', 'group', 'and', 'its', 'covering', 'map', 'is', 'homomorphism']] | [-0.29322027415400953, 0.184911711330642, -0.13799081053730333, 0.007817086374416249, -0.14446819994191173, -0.10390183403796982, 0.06840337778885441, 0.42687309230677783, -0.3625196794164367, -0.16624708904419094, 0.11130818346828164, -0.268238714634208, -0.2282702320298995, 0.17660439654719085, -0.11921638139756396, -0.08572923793781229, 0.04986498484504409, 0.13357185779022984, -0.08308864188074949, -0.20344469438350643, 0.41226912068668753, -0.11640023143263534, 0.2555276509265241, 0.05267556925537065, 0.12221043640602147, -0.014449619789957069, -0.01382884920167271, 0.13766593993841525, -0.10224535236000065, 0.13595634889315988, 0.26783675780461635, 0.0004209578037261963, 0.21883096668170765, -0.3038347576612068, -0.253895172252669, 0.16080157150281593, 0.08124352583035943, 0.016551795415580273, -0.09923335725034121, -0.26459398210863583, 0.19168732011166867, -0.22080690978327766, -0.08924339724762831, -0.026976896813721396, 0.07376790160196833, -0.08196246629813686, -0.16744529327843338, -0.04935644098850389, 0.028990420512855053, 0.035418171755736694, -0.005195427018406917, 0.05067690953728743, -0.09548617492691847, 0.20309021912544267, -0.08756433085363824, 0.13763939453929197, 0.08653493683777924, -0.0872420723826508, -0.1058492039956036, 0.43460585505818017, -0.06310143756854814, -0.1497155976248905, 0.1714423677767627, -0.18615389749174938, -0.22127151943277568, 0.13545440979942214, 0.07635911446413957, 0.13557806061726296, -0.05446939721878152, 0.20424065054885432, -0.17436049962998368, 0.16982648757402785, -0.02892326467554085, 0.00031716070225229487, 0.16339395014006186, 0.16876988305011764, 0.23570726008620113, 0.1338629285019124, 0.0357994205551222, 0.027836305933305994, -0.3770486779976636, -0.27392644283827394, -0.200888041559665, 0.08611112943617627, -0.10050730610214487, -0.19257703080074862, 0.4252420213088044, 0.06324912060517818, 0.14714249529060908, 0.07035039926995523, 0.23099878878565505, 0.08239119581412524, 0.07900005249393871, 0.14405845054716337, 0.1012420550105162, 0.19277345738373697, -0.09579155061510392, -0.19079573583439924, -0.03597726515727118, 0.1984012313914718] |
1,803.00742 | Selective resolution of phonon modes in STM-IETS on clean and
oxygen-adsorbed Cu(100) surfaces | The observation of surface phonon dispersion using local probes can provide
important information related to local structural and thermal properties. In
this study, surface phonon modes on a Cu(100) surface were measured using the
inelastic tunneling spectroscopy of scanning tunneling microscopy (STM-IETS)
with atomically sharp tips. Different phonon modes were selectively measured
depending on the structures of the probing tips or the surfaces. Two different
surface phonon modes, at 19.0 meV on a clean Cu(100) surface and at 13.5 meV on
an oxygen-adsorbed Cu(100) surface, are explained by the selection rules.
Additionally, the spatial variation in STM-IETS showed surface stress
relaxation.
| cond-mat.mes-hall | the observation of surface phonon dispersion using local probes can provide important information related to local structural and thermal properties in this study surface phonon modes on a cu100 surface were measured using the inelastic tunneling spectroscopy of scanning tunneling microscopy stmiets with atomically sharp tips different phonon modes were selectively measured depending on the structures of the probing tips or the surfaces two different surface phonon modes at 190 mev on a clean cu100 surface and at 135 mev on an oxygenadsorbed cu100 surface are explained by the selection rules additionally the spatial variation in stmiets showed surface stress relaxation | [['the', 'observation', 'of', 'surface', 'phonon', 'dispersion', 'using', 'local', 'probes', 'can', 'provide', 'important', 'information', 'related', 'to', 'local', 'structural', 'and', 'thermal', 'properties', 'in', 'this', 'study', 'surface', 'phonon', 'modes', 'on', 'a', 'cu100', 'surface', 'were', 'measured', 'using', 'the', 'inelastic', 'tunneling', 'spectroscopy', 'of', 'scanning', 'tunneling', 'microscopy', 'stmiets', 'with', 'atomically', 'sharp', 'tips', 'different', 'phonon', 'modes', 'were', 'selectively', 'measured', 'depending', 'on', 'the', 'structures', 'of', 'the', 'probing', 'tips', 'or', 'the', 'surfaces', 'two', 'different', 'surface', 'phonon', 'modes', 'at', '190', 'mev', 'on', 'a', 'clean', 'cu100', 'surface', 'and', 'at', '135', 'mev', 'on', 'an', 'oxygenadsorbed', 'cu100', 'surface', 'are', 'explained', 'by', 'the', 'selection', 'rules', 'additionally', 'the', 'spatial', 'variation', 'in', 'stmiets', 'showed', 'surface', 'stress', 'relaxation']] | [-0.10151030390290544, 0.20453465163373039, -0.13316347948275506, 0.02997391085489653, -0.038608147435006686, -0.16268700855784118, 0.0820914445159724, 0.43188782650977375, -0.27396800186485054, -0.3133044226840138, -0.00523731853114441, -0.3464427794516087, -0.08922079434385523, 0.229131931590382, 0.037256657015532255, 0.011753708718460985, 0.015613696633372455, -0.07720908893941669, -0.06064336257055402, -0.19237607191782444, 0.28322550145327113, 0.06264321661554277, 0.3742164943087846, 0.15097737626172603, 0.03473042954923585, 0.05211975386358972, 0.029945614568132443, 0.007214946690946817, -0.23507822914980353, 0.09805119583383202, 0.21743043049704283, -0.13015249862568454, 0.18319233937188983, -0.5123810174688697, -0.2358801928535104, -0.07093346828594804, 0.1136595636466518, 0.13188379649072884, -0.019057880482287147, -0.25984391126781703, 0.019185855137184262, 0.013613602281257044, -0.08908813554793596, -0.06962161745876073, -0.05439910043030977, -0.0027715054771397262, -0.14502714227419347, 0.12780867223162204, -0.028706851582974195, 0.15781013315077871, -0.11528414232190698, -0.11594415259314701, -0.14235001754947008, 0.030802803628612308, 0.012723590871319175, 0.012061335023026913, 0.25053732566535475, -0.053495496313553305, -0.06988918944261968, 0.296596632534638, -0.10242342453217133, -0.09069061055779457, 0.22493956415448338, -0.18063020960893483, -0.01515613208990544, 0.1976891300850548, 0.12259865281797828, 0.13369255107361824, -0.17292934427037834, 0.03194944931310602, 0.03487868563272059, 0.18097246008692308, 0.18277473188529256, 0.07679896209039726, 0.23646664225962014, 0.18208234632154927, 0.02246133554726839, 0.07166076202411205, -0.2326003459468484, 0.09812603805214166, -0.23462217980646527, -0.15282205173105468, -0.20740021603181957, 0.06003072528168559, -0.04952484826528234, -0.15715878861024976, 0.38854756850749256, 0.00239177480340004, 0.23208429889316903, -0.06286722513847053, 0.2653566410008352, 0.07789185433881357, 0.08618870939128101, -0.0032839038968086242, 0.256786471651867, 0.1774656031257473, 0.017978887963108717, -0.3288796027749777, 0.06194205437321216, -0.012346613998524845] |
1,803.00743 | Brauer correspondent blocks with one simple module | One of the main problems in representation theory is to understand the exact
relationship between Brauer corresponding blocks of finite groups. The case
where the local correspondent has a unique simple module seems key. We
characterize this situation for the principal p-blocks where p is odd.
| math.RT | one of the main problems in representation theory is to understand the exact relationship between brauer corresponding blocks of finite groups the case where the local correspondent has a unique simple module seems key we characterize this situation for the principal pblocks where p is odd | [['one', 'of', 'the', 'main', 'problems', 'in', 'representation', 'theory', 'is', 'to', 'understand', 'the', 'exact', 'relationship', 'between', 'brauer', 'corresponding', 'blocks', 'of', 'finite', 'groups', 'the', 'case', 'where', 'the', 'local', 'correspondent', 'has', 'a', 'unique', 'simple', 'module', 'seems', 'key', 'we', 'characterize', 'this', 'situation', 'for', 'the', 'principal', 'pblocks', 'where', 'p', 'is', 'odd']] | [-0.1495913353080497, 0.0584695395107543, -0.11798150276603259, 0.08212171081180239, -0.08108008649888569, -0.16152614736727075, -0.02611274016342814, 0.30726924092184915, -0.352112432172441, -0.21414420259711536, 0.07336897599009756, -0.23866865670551424, -0.16789141302401928, 0.1465091570685415, -0.0871723247691989, -0.03889152031067921, -0.023280502560184053, 0.15424017982719385, -0.07595326400199987, -0.23067668067676056, 0.36180687137960416, -0.01643844240385553, 0.28052638009514497, 0.019185563286199518, 0.07546462170506382, 0.04306439375099928, -0.018710312352556248, -0.032287604317231024, -0.1293290989756908, 0.1383534345937812, 0.3419172103850819, 0.05268294406730844, 0.27788321261861076, -0.3773185726579117, -0.1238814583554378, 0.21034443456396137, 0.14691030051883147, 0.07447763111280359, 0.01898597368626329, -0.1811677360775597, 0.17023408144671956, -0.1572057678485694, -0.16366751633746468, -0.004989151579692312, 0.10201645055380852, -0.03136813830908226, -0.26085654909358075, 0.01684712049672785, 0.06011676703296278, 0.07069073520276857, -0.0805582063343457, -0.0983538361792655, 0.0002909046395317368, 0.21068203567689203, 0.018247949293531154, -0.009983379353323708, 0.037273735587444644, -0.09563748335020374, -0.10978125043861243, 0.4000634693783586, 0.012223868347380472, -0.1930570938958503, 0.1859316382476169, -0.1653671444332956, -0.17366479908156654, 0.07299091057527972, 0.08359544495444583, 0.11865045855064756, -0.06785904308376105, 0.17309088527184466, -0.13309954633207424, 0.10930586984866987, 0.03197531258363439, -0.03764843762568806, 0.15994063224238547, 0.14390146043961463, 0.08618135361567787, 0.15950461655207301, 0.007611207178105478, -0.0718332125764826, -0.3577984906125652, -0.2033126237675669, -0.1507150294745098, 0.048809525759323784, -0.09810500048384395, -0.15309800497640896, 0.42468510288745165, 0.10354163959298444, 0.17174992791336516, 0.04005913248123682, 0.2654526991688687, 0.10989075866730316, 0.04894609194572853, 0.030431020297565618, 0.1405291038200907, 0.2583713223853999, -0.018696880494446858, -0.20661136117237416, 0.061211594071684645, 0.15431296542975242] |
1,803.00744 | Clinically Meaningful Comparisons Over Time: An Approach to Measuring
Patient Similarity based on Subsequence Alignment | Longitudinal patient data has the potential to improve clinical risk
stratification models for disease. However, chronic diseases that progress
slowly over time are often heterogeneous in their clinical presentation.
Patients may progress through disease stages at varying rates. This leads to
pathophysiological misalignment over time, making it difficult to consistently
compare patients in a clinically meaningful way. Furthermore, patients present
clinically for the first time at different stages of disease. This eliminates
the possibility of simply aligning patients based on their initial
presentation. Finally, patient data may be sampled at different rates due to
differences in schedules or missed visits. To address these challenges, we
propose a robust measure of patient similarity based on subsequence alignment.
Compared to global alignment techniques that do not account for
pathophysiological misalignment, focusing on the most relevant subsequences
allows for an accurate measure of similarity between patients. We demonstrate
the utility of our approach in settings where longitudinal data, while useful,
are limited and lack a clear temporal alignment for comparison. Applied to the
task of stratifying patients for risk of progression to probable Alzheimer's
Disease, our approach outperforms models that use only snapshot data (AUROC of
0.839 vs. 0.812) and models that use global alignment techniques (AUROC of
0.822). Our results support the hypothesis that patients' trajectories are
useful for quantifying inter-patient similarities and that using subsequence
matching and can help account for heterogeneity and misalignment in
longitudinal data.
| cs.LG stat.ML | longitudinal patient data has the potential to improve clinical risk stratification models for disease however chronic diseases that progress slowly over time are often heterogeneous in their clinical presentation patients may progress through disease stages at varying rates this leads to pathophysiological misalignment over time making it difficult to consistently compare patients in a clinically meaningful way furthermore patients present clinically for the first time at different stages of disease this eliminates the possibility of simply aligning patients based on their initial presentation finally patient data may be sampled at different rates due to differences in schedules or missed visits to address these challenges we propose a robust measure of patient similarity based on subsequence alignment compared to global alignment techniques that do not account for pathophysiological misalignment focusing on the most relevant subsequences allows for an accurate measure of similarity between patients we demonstrate the utility of our approach in settings where longitudinal data while useful are limited and lack a clear temporal alignment for comparison applied to the task of stratifying patients for risk of progression to probable alzheimers disease our approach outperforms models that use only snapshot data auroc of 0839 vs 0812 and models that use global alignment techniques auroc of 0822 our results support the hypothesis that patients trajectories are useful for quantifying interpatient similarities and that using subsequence matching and can help account for heterogeneity and misalignment in longitudinal data | [['longitudinal', 'patient', 'data', 'has', 'the', 'potential', 'to', 'improve', 'clinical', 'risk', 'stratification', 'models', 'for', 'disease', 'however', 'chronic', 'diseases', 'that', 'progress', 'slowly', 'over', 'time', 'are', 'often', 'heterogeneous', 'in', 'their', 'clinical', 'presentation', 'patients', 'may', 'progress', 'through', 'disease', 'stages', 'at', 'varying', 'rates', 'this', 'leads', 'to', 'pathophysiological', 'misalignment', 'over', 'time', 'making', 'it', 'difficult', 'to', 'consistently', 'compare', 'patients', 'in', 'a', 'clinically', 'meaningful', 'way', 'furthermore', 'patients', 'present', 'clinically', 'for', 'the', 'first', 'time', 'at', 'different', 'stages', 'of', 'disease', 'this', 'eliminates', 'the', 'possibility', 'of', 'simply', 'aligning', 'patients', 'based', 'on', 'their', 'initial', 'presentation', 'finally', 'patient', 'data', 'may', 'be', 'sampled', 'at', 'different', 'rates', 'due', 'to', 'differences', 'in', 'schedules', 'or', 'missed', 'visits', 'to', 'address', 'these', 'challenges', 'we', 'propose', 'a', 'robust', 'measure', 'of', 'patient', 'similarity', 'based', 'on', 'subsequence', 'alignment', 'compared', 'to', 'global', 'alignment', 'techniques', 'that', 'do', 'not', 'account', 'for', 'pathophysiological', 'misalignment', 'focusing', 'on', 'the', 'most', 'relevant', 'subsequences', 'allows', 'for', 'an', 'accurate', 'measure', 'of', 'similarity', 'between', 'patients', 'we', 'demonstrate', 'the', 'utility', 'of', 'our', 'approach', 'in', 'settings', 'where', 'longitudinal', 'data', 'while', 'useful', 'are', 'limited', 'and', 'lack', 'a', 'clear', 'temporal', 'alignment', 'for', 'comparison', 'applied', 'to', 'the', 'task', 'of', 'stratifying', 'patients', 'for', 'risk', 'of', 'progression', 'to', 'probable', 'alzheimers', 'disease', 'our', 'approach', 'outperforms', 'models', 'that', 'use', 'only', 'snapshot', 'data', 'auroc', 'of', '0839', 'vs', '0812', 'and', 'models', 'that', 'use', 'global', 'alignment', 'techniques', 'auroc', 'of', '0822', 'our', 'results', 'support', 'the', 'hypothesis', 'that', 'patients', 'trajectories', 'are', 'useful', 'for', 'quantifying', 'interpatient', 'similarities', 'and', 'that', 'using', 'subsequence', 'matching', 'and', 'can', 'help', 'account', 'for', 'heterogeneity', 'and', 'misalignment', 'in', 'longitudinal', 'data']] | [-0.04850870097782147, 0.05008715589712542, -0.07705702036777037, 0.11707607399765008, -0.10238809868204013, -0.1527618332144457, 0.08694337875536895, 0.4547041689629777, -0.21745748670169418, -0.2812432927470181, 0.1117844411573507, -0.27229889592071216, -0.14354732106202991, 0.21965916873837854, -0.1601847535230109, 0.04433192933319626, 0.15406240348435812, 0.027643846178237917, -0.02875972430367749, -0.27948282863064255, 0.2873950147581034, 0.035897844694002326, 0.35705327066214027, 0.028394323865433176, 0.08639933556160186, 0.01551684122202105, -0.05242495066476433, 0.003653367674491226, -0.0864448292072743, 0.12279271916091694, 0.3609428952214345, 0.20717941765610318, 0.34717259466869094, -0.4414932185278858, -0.23159018863324013, 0.11342670002969976, 0.15747475918773088, 0.10602266890671641, -0.011730607596553578, -0.28375245605682226, 0.1077246178790998, -0.12476515892737197, -0.06349369385417834, -0.1042540733879077, 0.01890708880214873, -0.015090087348530148, -0.30993595641201077, 0.157742494990767, -0.03886641032443287, 0.128663124414003, -0.10085754024365057, -0.12199137010512937, -0.006523501119079163, 0.2173038645098933, 0.1258300596382469, 0.059734141394906376, 0.12454681249998384, -0.136394594706224, -0.1260723687739948, 0.33785644609291676, 0.00959683095092167, -0.17466831123416895, 0.2079768117154175, -0.09371715087356772, -0.14077204874108973, 0.12843194859639062, 0.22355195672929057, 0.08668017234669019, -0.19238303863774922, -0.08012503528325242, 0.054027624330601765, 0.17940229842127536, 0.06987426357868648, -0.01912000940489125, 0.17856340228690434, 0.19053690849756033, 0.010197098429070123, 0.04486211781464991, -0.12948102518566884, -0.04767813594711913, -0.21525596787855109, -0.1312631956854479, -0.08613586744838157, 0.0021876369996249906, -0.11605068589174691, -0.1276557702009795, 0.4020481796795108, 0.2284305844521256, 0.16379685233883812, 0.08817749451727495, 0.29132875135578845, -0.00399358166525756, 0.08388471234021551, 0.0006192182612475166, 0.14153901330428198, 0.01912829456298407, 0.07029337042911073, -0.246460997611008, 0.19170715138750247, -0.040670681354131995] |
1,803.00745 | Quantum Circuit Learning | We propose a classical-quantum hybrid algorithm for machine learning on
near-term quantum processors, which we call quantum circuit learning. A quantum
circuit driven by our framework learns a given task by tuning parameters
implemented on it. The iterative optimization of the parameters allows us to
circumvent the high-depth circuit. Theoretical investigation shows that a
quantum circuit can approximate nonlinear functions, which is further confirmed
by numerical simulations. Hybridizing a low-depth quantum circuit and a
classical computer for machine learning, the proposed framework paves the way
toward applications of near-term quantum devices for quantum machine learning.
| quant-ph | we propose a classicalquantum hybrid algorithm for machine learning on nearterm quantum processors which we call quantum circuit learning a quantum circuit driven by our framework learns a given task by tuning parameters implemented on it the iterative optimization of the parameters allows us to circumvent the highdepth circuit theoretical investigation shows that a quantum circuit can approximate nonlinear functions which is further confirmed by numerical simulations hybridizing a lowdepth quantum circuit and a classical computer for machine learning the proposed framework paves the way toward applications of nearterm quantum devices for quantum machine learning | [['we', 'propose', 'a', 'classicalquantum', 'hybrid', 'algorithm', 'for', 'machine', 'learning', 'on', 'nearterm', 'quantum', 'processors', 'which', 'we', 'call', 'quantum', 'circuit', 'learning', 'a', 'quantum', 'circuit', 'driven', 'by', 'our', 'framework', 'learns', 'a', 'given', 'task', 'by', 'tuning', 'parameters', 'implemented', 'on', 'it', 'the', 'iterative', 'optimization', 'of', 'the', 'parameters', 'allows', 'us', 'to', 'circumvent', 'the', 'highdepth', 'circuit', 'theoretical', 'investigation', 'shows', 'that', 'a', 'quantum', 'circuit', 'can', 'approximate', 'nonlinear', 'functions', 'which', 'is', 'further', 'confirmed', 'by', 'numerical', 'simulations', 'hybridizing', 'a', 'lowdepth', 'quantum', 'circuit', 'and', 'a', 'classical', 'computer', 'for', 'machine', 'learning', 'the', 'proposed', 'framework', 'paves', 'the', 'way', 'toward', 'applications', 'of', 'nearterm', 'quantum', 'devices', 'for', 'quantum', 'machine', 'learning']] | [-0.10239585051610273, 0.07166078322111293, -0.0979304686882236, 0.00949053706364716, -0.09603891955648965, -0.2707815483866378, 0.0942103673055015, 0.3803853769885733, -0.2688047655045669, -0.31300453298745, -0.0026131189945946508, -0.1914603942040753, -0.23770694512913518, 0.3385557785705772, -0.08437127935046211, 0.23127060353835213, 0.1052162302558885, -0.027623876364544987, -0.07357648910336603, -0.24151086214771297, 0.2324619349439014, 0.04155764339040925, 0.30655461868291045, -0.0005230762787718088, 0.13636842358144038, -0.011711099848864561, 0.05850048794688538, -0.020102285274720574, -0.11965274464060674, 0.20293260798690485, 0.33301649308030273, 0.18073875551171442, 0.3645178313426515, -0.44813005537032446, -0.24310963035145022, 0.06331638180145478, 0.13680160124885274, 0.18319210930023977, -0.0888860597735905, -0.325206908476638, 0.07115248804961509, -0.1710399844871953, -0.030204312095481734, -0.17290810278388968, -0.06377469938981564, -0.058275173398408486, -0.27290690334593043, -0.057305527078185946, 0.0584785832374535, 0.03780815029080878, 0.05506784872116615, -0.06290536940573378, 0.1611838343112353, 0.07759459596746503, -0.13954005114228882, 0.040962477110603704, 0.20972426554703333, -0.14981841451755942, -0.27923178242796914, 0.33304160461820503, 0.0017530616630423575, -0.17228765951152494, 0.13280370727706542, 0.04185362816094718, -0.1373477692894162, 0.0204251955283132, 0.20224600853992902, 0.07018378325440783, -0.14792260740130664, 0.1394307533015269, 0.009584335000947752, 0.1892648135965809, -0.040126952550750467, 0.0037528652836509207, 0.20811088149624063, 0.22477845992258888, 0.048906908667785055, 0.19974057318920152, -0.05299953169169578, -0.20448810363465802, -0.27429785505135323, -0.1951630168812389, -0.24232595571703178, 0.06716115235727518, -0.07338983778568713, -0.15224474344521444, 0.4130918970727857, 0.20959653926485694, 0.11920498166867394, 0.08550354521572986, 0.36015288248420396, 0.1328988611373674, 0.09553019661998792, 0.1304040414502874, 0.19836985213840577, 0.15278691391985705, 0.09083289914625756, -0.29500314807816547, 0.04998197042918269, 0.04411617338538487] |
1,803.00746 | Shear relaxation behind the shock front in $\langle$110$\rangle$
Molybdenum - From the Atomic Scale to Continuous Dislocation Fields | In this work we study shock-induced plasticity in Mo single crystals,
impacted along the <110> crystal orientation. In particular, the shear
relaxation behind the shock front is quantitatively inspected. Molecular
dynamics (MD) simulations are employed to simulate the deformation during
shock, followed by post-processing to identify and quantify the dislocation
lines nucleated behind the shock front. The information on the dislocation
lines is ensemble averaged inside slabs of the simulation box and over
different realizations of the MD simulations, from which continuous dislocation
fields are extracted using the Discrete-to-Continuous method. The continuous
dislocation fields are correlated with the stress and strain fields obtained
from the MD simulations. Based on this analysis, we show that the elastic
precursor overshoots the shear stress, after which dislocations on a specific
group of slip planes are nucleated, slightly lagging behind the elastic front.
Consequently, the resolved shear stress is relaxed, but the principal lateral
stress increases. The latter leads to an increase in the resolved shear stress
on a plane parallel to the shock wave, resulting in an additional retarded
front of dislocation nucleation on planes parallel to the shock front. Finally,
the two-stage process of plasticity results in an isotropic stress state in the
plane parallel to the shock wave. The MD simulation results are employed to
calculate the dislocation densities on specific slip planes and the plastic
deformation behind the shock, bridging the gap between the information on the
atomic scale and the continuum level.
| cond-mat.mtrl-sci | in this work we study shockinduced plasticity in mo single crystals impacted along the 110 crystal orientation in particular the shear relaxation behind the shock front is quantitatively inspected molecular dynamics md simulations are employed to simulate the deformation during shock followed by postprocessing to identify and quantify the dislocation lines nucleated behind the shock front the information on the dislocation lines is ensemble averaged inside slabs of the simulation box and over different realizations of the md simulations from which continuous dislocation fields are extracted using the discretetocontinuous method the continuous dislocation fields are correlated with the stress and strain fields obtained from the md simulations based on this analysis we show that the elastic precursor overshoots the shear stress after which dislocations on a specific group of slip planes are nucleated slightly lagging behind the elastic front consequently the resolved shear stress is relaxed but the principal lateral stress increases the latter leads to an increase in the resolved shear stress on a plane parallel to the shock wave resulting in an additional retarded front of dislocation nucleation on planes parallel to the shock front finally the twostage process of plasticity results in an isotropic stress state in the plane parallel to the shock wave the md simulation results are employed to calculate the dislocation densities on specific slip planes and the plastic deformation behind the shock bridging the gap between the information on the atomic scale and the continuum level | [['in', 'this', 'work', 'we', 'study', 'shockinduced', 'plasticity', 'in', 'mo', 'single', 'crystals', 'impacted', 'along', 'the', '110', 'crystal', 'orientation', 'in', 'particular', 'the', 'shear', 'relaxation', 'behind', 'the', 'shock', 'front', 'is', 'quantitatively', 'inspected', 'molecular', 'dynamics', 'md', 'simulations', 'are', 'employed', 'to', 'simulate', 'the', 'deformation', 'during', 'shock', 'followed', 'by', 'postprocessing', 'to', 'identify', 'and', 'quantify', 'the', 'dislocation', 'lines', 'nucleated', 'behind', 'the', 'shock', 'front', 'the', 'information', 'on', 'the', 'dislocation', 'lines', 'is', 'ensemble', 'averaged', 'inside', 'slabs', 'of', 'the', 'simulation', 'box', 'and', 'over', 'different', 'realizations', 'of', 'the', 'md', 'simulations', 'from', 'which', 'continuous', 'dislocation', 'fields', 'are', 'extracted', 'using', 'the', 'discretetocontinuous', 'method', 'the', 'continuous', 'dislocation', 'fields', 'are', 'correlated', 'with', 'the', 'stress', 'and', 'strain', 'fields', 'obtained', 'from', 'the', 'md', 'simulations', 'based', 'on', 'this', 'analysis', 'we', 'show', 'that', 'the', 'elastic', 'precursor', 'overshoots', 'the', 'shear', 'stress', 'after', 'which', 'dislocations', 'on', 'a', 'specific', 'group', 'of', 'slip', 'planes', 'are', 'nucleated', 'slightly', 'lagging', 'behind', 'the', 'elastic', 'front', 'consequently', 'the', 'resolved', 'shear', 'stress', 'is', 'relaxed', 'but', 'the', 'principal', 'lateral', 'stress', 'increases', 'the', 'latter', 'leads', 'to', 'an', 'increase', 'in', 'the', 'resolved', 'shear', 'stress', 'on', 'a', 'plane', 'parallel', 'to', 'the', 'shock', 'wave', 'resulting', 'in', 'an', 'additional', 'retarded', 'front', 'of', 'dislocation', 'nucleation', 'on', 'planes', 'parallel', 'to', 'the', 'shock', 'front', 'finally', 'the', 'twostage', 'process', 'of', 'plasticity', 'results', 'in', 'an', 'isotropic', 'stress', 'state', 'in', 'the', 'plane', 'parallel', 'to', 'the', 'shock', 'wave', 'the', 'md', 'simulation', 'results', 'are', 'employed', 'to', 'calculate', 'the', 'dislocation', 'densities', 'on', 'specific', 'slip', 'planes', 'and', 'the', 'plastic', 'deformation', 'behind', 'the', 'shock', 'bridging', 'the', 'gap', 'between', 'the', 'information', 'on', 'the', 'atomic', 'scale', 'and', 'the', 'continuum', 'level']] | [-0.12884558597867043, 0.14565153810914958, -0.08503511149068306, 0.006089884565304833, -0.04097942551099715, -0.03555658650047955, -0.0029884881590044607, 0.4217452571225264, -0.3115460374929134, -0.22866328295182298, 0.061553016357189, -0.23866260004586276, -0.12142125902593964, 0.15377574242170472, 0.0419313108123103, 0.021367207620342724, 0.0192318449722442, -0.023619528543663983, -0.07107516600551092, -0.1983961873867936, 0.2787270044080085, 0.09690745893881154, 0.3450473169623702, 0.04183204516523169, 0.07686186603737809, -0.008200850552369538, -0.03231611556503845, 0.04900688629400046, -0.2036577146856362, 0.05679777358062642, 0.19203348583810093, -0.0042875263123263304, 0.20856736186094613, -0.5403259124054953, -0.24432842350380932, -0.009472470839772328, 0.12759796360415626, 0.13561342056139292, 0.009229294654871089, -0.2629833281684069, 0.0411251742841193, -0.06792310181882524, -0.12897726701305273, 0.030287305649117004, -0.0008544555066130412, 0.059378812174837835, -0.19790798351944736, 0.15708100061227448, 0.020195980238682232, 0.0524932716325416, -0.10507937623935257, -0.042317999245162, -0.08859445217425778, 0.048612928345182396, 0.0771532017188367, 0.07797449096280855, 0.2522491562561565, -0.12739351905744384, -0.06079576981499209, 0.3959994663488227, -0.008975698994213922, -0.16064909524801704, 0.2012904152023096, -0.132288063686617, -0.07310059462607371, 0.23441537955599556, 0.181984291858195, 0.04880764693646489, -0.12154607939315432, -0.0283427076951271, 0.012430400393233508, 0.1495211932447896, 0.11060244843187463, -0.10683224343315319, 0.2263440996106166, 0.16301418344563048, 0.005728072276024661, 0.15179344403485978, -0.17790015753015584, -0.1080336352971233, -0.3369261333613499, -0.17343334601368035, -0.1837014380644589, -0.003863164626752743, -0.128210882199897, -0.19363778301202328, 0.34130176833596987, 0.12223231213451402, 0.1513675469770997, 0.02060009531941219, 0.248939060832186, 0.06465104637943485, 0.06445433711058196, 0.0799118650668979, 0.28621273231405164, 0.18711810665676532, 0.1122344328912642, -0.28454565315089597, 0.07264653443255359, 0.02641609616562295] |
1,803.00747 | SCALAR - Simultaneous Calibration of 2D Laser and Robot's Kinematic
Parameters Using Three Planar Constraints | Industrial robots are increasingly used in various applications where the
robot accuracy becomes very important, hence calibrations of the robot's
kinematic parameters and the measurement system's extrinsic parameters are
required. However, the existing calibration approaches are either too
cumbersome or require another expensive external measurement system such as
laser tracker or measurement spinarm. In this paper, we propose SCALAR, a
calibration method to simultaneously improve the kinematic parameters of a
6-DoF robot and the extrinsic parameters of a 2D Laser Range Finder (LRF) which
is attached to the robot. Three flat planes are placed around the robot, and
for each plane the robot moves to several poses such that the LRF's ray
intersect the respective plane. Geometric planar constraints are then used to
optimize the calibration parameters using Levenberg- Marquardt nonlinear
optimization algorithm. We demonstrate through simulations that SCALAR can
reduce the average position and orientation errors of the robot system from
14.6mm and 4.05 degrees to 0.09mm and 0.02 degrees.
| cs.RO | industrial robots are increasingly used in various applications where the robot accuracy becomes very important hence calibrations of the robots kinematic parameters and the measurement systems extrinsic parameters are required however the existing calibration approaches are either too cumbersome or require another expensive external measurement system such as laser tracker or measurement spinarm in this paper we propose scalar a calibration method to simultaneously improve the kinematic parameters of a 6dof robot and the extrinsic parameters of a 2d laser range finder lrf which is attached to the robot three flat planes are placed around the robot and for each plane the robot moves to several poses such that the lrfs ray intersect the respective plane geometric planar constraints are then used to optimize the calibration parameters using levenberg marquardt nonlinear optimization algorithm we demonstrate through simulations that scalar can reduce the average position and orientation errors of the robot system from 146mm and 405 degrees to 009mm and 002 degrees | [['industrial', 'robots', 'are', 'increasingly', 'used', 'in', 'various', 'applications', 'where', 'the', 'robot', 'accuracy', 'becomes', 'very', 'important', 'hence', 'calibrations', 'of', 'the', 'robots', 'kinematic', 'parameters', 'and', 'the', 'measurement', 'systems', 'extrinsic', 'parameters', 'are', 'required', 'however', 'the', 'existing', 'calibration', 'approaches', 'are', 'either', 'too', 'cumbersome', 'or', 'require', 'another', 'expensive', 'external', 'measurement', 'system', 'such', 'as', 'laser', 'tracker', 'or', 'measurement', 'spinarm', 'in', 'this', 'paper', 'we', 'propose', 'scalar', 'a', 'calibration', 'method', 'to', 'simultaneously', 'improve', 'the', 'kinematic', 'parameters', 'of', 'a', '6dof', 'robot', 'and', 'the', 'extrinsic', 'parameters', 'of', 'a', '2d', 'laser', 'range', 'finder', 'lrf', 'which', 'is', 'attached', 'to', 'the', 'robot', 'three', 'flat', 'planes', 'are', 'placed', 'around', 'the', 'robot', 'and', 'for', 'each', 'plane', 'the', 'robot', 'moves', 'to', 'several', 'poses', 'such', 'that', 'the', 'lrfs', 'ray', 'intersect', 'the', 'respective', 'plane', 'geometric', 'planar', 'constraints', 'are', 'then', 'used', 'to', 'optimize', 'the', 'calibration', 'parameters', 'using', 'levenberg', 'marquardt', 'nonlinear', 'optimization', 'algorithm', 'we', 'demonstrate', 'through', 'simulations', 'that', 'scalar', 'can', 'reduce', 'the', 'average', 'position', 'and', 'orientation', 'errors', 'of', 'the', 'robot', 'system', 'from', '146mm', 'and', '405', 'degrees', 'to', '009mm', 'and', '002', 'degrees']] | [-0.11974246601892423, 0.0920878325270701, -0.057325500293481574, 0.006117896425915009, -0.12789049129520508, -0.17663782598639402, 0.003191367791570676, 0.4400602879262046, -0.24041994228440372, -0.40392749408433876, 0.10889594340358, -0.24745625934763987, -0.11742775110657551, 0.21953380390076274, -0.10512034607391003, 0.124858976315259, 0.09884387374519595, 0.001067544590045191, -0.05833654602123071, -0.2004106346329179, 0.24144907330775844, 0.027401354399662983, 0.23151871947500902, -0.01597464996422464, 0.15559614526367263, 0.050407934098363014, 0.005993454848619508, 0.013836386354192149, -0.1225427549095313, 0.0928923282433372, 0.2566490430205094, 0.10648666500833028, 0.21281301132344368, -0.4040216481006598, -0.16605144296183333, 0.10116961669129661, 0.15148969569768098, 0.07559372672422117, 0.0035572645631677742, -0.29400365536183687, 0.04939875513598134, -0.130103332062747, -0.1260952010862765, -0.03735394268650326, -0.008992834004891825, 0.040899572566098566, -0.2854959627530903, 0.001556881208302854, -0.0035646855860618472, 0.08149511188480861, -0.05328263742392411, -0.10688710107049564, -0.027077339357501957, 0.19160423439093335, 0.01783992858055413, 0.05576102732963671, 0.23607016235142003, -0.13922169761396236, -0.07816590123391369, 0.4079019268856773, 0.019785043775012622, -0.27445224391390816, 0.20020573845654843, -0.08910548506684814, -0.09894721904958162, 0.11153419889639356, 0.22585519174809415, 0.12886169803059142, -0.17286457955436427, 0.05063669226807247, 0.0455203486821626, 0.18195811290694755, 0.06427194396788373, -0.01163082916725757, 0.1939884736158449, 0.1432919710273324, 0.09933755453675985, 0.1029191364702191, -0.13643173175227322, -0.060032702166044824, -0.2827864066341043, -0.12202646688534584, -0.14157385070943804, -0.022129947242999, -0.10788491443687419, -0.1213754662666234, 0.35789665103229823, 0.21416601738940388, 0.19329606253311887, 0.022191022877151124, 0.3842467023678643, 0.06210127642379685, 0.08004974171849369, 0.05233107762753115, 0.27411901414441536, 0.06575887357886834, 0.09102391850945976, -0.2075377564945058, 0.059314514153719515, 0.008850091107519744] |
1,803.00748 | Large second harmonic generation of LiCs2PO4 caused by the
metal-cation-centered groups | We evaluated the individual atom contributions to the second harmonic
generation (SHG) coefficients of LiCs2PO4 (LCPO) by introducing the partial
response functionals on the basis of first principles calculations. The SHG
response of LCPO is dominated by the metal-cation-centered groups CsO6 and
LiO4, not by the nonmetal-cation-centered groups PO4 one expects from the
existing models and theories. The SHG coefficients of LCPO are determined
mainly by the occupied orbitals O-2p and Cs-5p as well as by the unoccupied
orbitals Cs-5d and Li-2p. For the SHG response of a material, the polarizable
atomic orbitals of the occupied and the unoccupied states are both important.
| cond-mat.mtrl-sci | we evaluated the individual atom contributions to the second harmonic generation shg coefficients of lics2po4 lcpo by introducing the partial response functionals on the basis of first principles calculations the shg response of lcpo is dominated by the metalcationcentered groups cso6 and lio4 not by the nonmetalcationcentered groups po4 one expects from the existing models and theories the shg coefficients of lcpo are determined mainly by the occupied orbitals o2p and cs5p as well as by the unoccupied orbitals cs5d and li2p for the shg response of a material the polarizable atomic orbitals of the occupied and the unoccupied states are both important | [['we', 'evaluated', 'the', 'individual', 'atom', 'contributions', 'to', 'the', 'second', 'harmonic', 'generation', 'shg', 'coefficients', 'of', 'lics2po4', 'lcpo', 'by', 'introducing', 'the', 'partial', 'response', 'functionals', 'on', 'the', 'basis', 'of', 'first', 'principles', 'calculations', 'the', 'shg', 'response', 'of', 'lcpo', 'is', 'dominated', 'by', 'the', 'metalcationcentered', 'groups', 'cso6', 'and', 'lio4', 'not', 'by', 'the', 'nonmetalcationcentered', 'groups', 'po4', 'one', 'expects', 'from', 'the', 'existing', 'models', 'and', 'theories', 'the', 'shg', 'coefficients', 'of', 'lcpo', 'are', 'determined', 'mainly', 'by', 'the', 'occupied', 'orbitals', 'o2p', 'and', 'cs5p', 'as', 'well', 'as', 'by', 'the', 'unoccupied', 'orbitals', 'cs5d', 'and', 'li2p', 'for', 'the', 'shg', 'response', 'of', 'a', 'material', 'the', 'polarizable', 'atomic', 'orbitals', 'of', 'the', 'occupied', 'and', 'the', 'unoccupied', 'states', 'are', 'both', 'important']] | [-0.09251304430169209, 0.1737209521816112, 0.027224802984468017, 0.01853214340735576, 0.026779339590575546, -0.07526310391161435, 0.06496352404064965, 0.3452742906702042, -0.2725615224917419, -0.2621082093877097, 0.005966434425014692, -0.37137491438382614, -0.14182431106261598, 0.13349735605637156, 0.06999887428052413, 0.019345621369817916, -0.01993727857673851, -0.04630812754718742, -0.017714598497453455, -0.19880040341134494, 0.32884031027788296, 0.061003160721156746, 0.2568716644163942, 0.05934138119361402, 0.06789715538131229, 0.018344591987746146, 0.00181560196991389, -0.021948049591931824, -0.07183232173944513, 0.2317828197040702, 0.24866811623773324, -0.008039237926520096, 0.2543937721202383, -0.4514616734231822, -0.144867645566895, -0.04725407086273966, 0.08188960441232969, 0.12000049546865436, -0.02311572146936669, -0.2905141245331227, -0.03600116106614829, -0.12088802602374926, -0.08767993248087198, -0.10630267120723147, -0.025485254959979404, 0.06921469399336881, -0.24336592100735288, 0.10974788105280216, 0.03730186268391359, 0.0637829485160637, -0.11130691154297286, -0.15731633528290936, -0.13904671112201564, 0.12347357424732763, 0.048709310714912135, 0.00772526660633351, 0.14613798496854238, -0.11590318910020869, -0.12391435215734721, 0.47915689101985964, -0.07151459155526634, -0.15625794819394892, 0.13011952648715427, -0.2077030656655552, -0.0740290237251126, 0.14658839987047637, 0.09449642919935286, 0.15519735257385037, -0.10767470467544626, 0.07662809726207342, 0.00429877860005945, 0.17886249971343204, 0.09412082797886494, 0.03897538259237384, 0.19215420157221766, 0.0941123682957065, 0.0297789190566012, 0.11351819185074419, -0.0768016664199725, -0.051467948738718405, -0.26486943700774646, -0.1505243478459306, -0.2736496831736683, -0.004168067559021438, -0.009991331643959711, -0.13297119027993176, 0.4464041965644962, 0.030344980919229176, 0.11863887424503143, -0.014816326671279967, 0.2793264366143073, 0.15395918421563692, 0.11915623587750208, -0.038274698503907224, 0.25892604800174013, 0.16564675996050937, 0.03764451516629682, -0.24483011118263676, 0.09754214778998478, 0.10746988339815289] |
1,803.00749 | Coherent electron transport in silicon quantum dots | With silicon being the go-to material for spin qubits, and motivated by the
demand of a scalable quantum computer architecture for fast and reliable
quantum information transfer on-chip, we study coherent electron transport in a
silicon double quantum dot. We first examine the valley-orbital dynamics in a
silicon double dot, and discuss how to properly measure the tunnel couplings as
well as the valley phase difference between two quantum dots. We then focus on
possible phase and spin flip errors during spin transport across a silicon
double dot. In particular, we clarify correction on the effective $g$-factor
for the electron spin from the double dot confinement potential, and quantify
the resulting phase error. We then study spin fidelity loss due to spin-valley
mixing, which is a unique feature of silicon quantum dots. We show that a small
phase correction between valleys can cause a significant coherence loss. We
also investigate spin flip errors caused by either an external inhomogeneous
magnetic field or the intrinsic spin-orbit coupling. We show that the presence
of valleys makes it possible to have much broader (in terms of interdot
detuning) level anti-crossings compared to typical anti-crossings in, for
example, a GaAs double dot, and such broad anti-crossings lead to amplification
of spin flip errors. Lastly, we design a pulse sequence to suppress various
possible spin flip errors by taking advantage of the multiple level
anti-crossings in a silicon double dot and employing Landau-Zener transitions.
| cond-mat.mes-hall quant-ph | with silicon being the goto material for spin qubits and motivated by the demand of a scalable quantum computer architecture for fast and reliable quantum information transfer onchip we study coherent electron transport in a silicon double quantum dot we first examine the valleyorbital dynamics in a silicon double dot and discuss how to properly measure the tunnel couplings as well as the valley phase difference between two quantum dots we then focus on possible phase and spin flip errors during spin transport across a silicon double dot in particular we clarify correction on the effective gfactor for the electron spin from the double dot confinement potential and quantify the resulting phase error we then study spin fidelity loss due to spinvalley mixing which is a unique feature of silicon quantum dots we show that a small phase correction between valleys can cause a significant coherence loss we also investigate spin flip errors caused by either an external inhomogeneous magnetic field or the intrinsic spinorbit coupling we show that the presence of valleys makes it possible to have much broader in terms of interdot detuning level anticrossings compared to typical anticrossings in for example a gaas double dot and such broad anticrossings lead to amplification of spin flip errors lastly we design a pulse sequence to suppress various possible spin flip errors by taking advantage of the multiple level anticrossings in a silicon double dot and employing landauzener transitions | [['with', 'silicon', 'being', 'the', 'goto', 'material', 'for', 'spin', 'qubits', 'and', 'motivated', 'by', 'the', 'demand', 'of', 'a', 'scalable', 'quantum', 'computer', 'architecture', 'for', 'fast', 'and', 'reliable', 'quantum', 'information', 'transfer', 'onchip', 'we', 'study', 'coherent', 'electron', 'transport', 'in', 'a', 'silicon', 'double', 'quantum', 'dot', 'we', 'first', 'examine', 'the', 'valleyorbital', 'dynamics', 'in', 'a', 'silicon', 'double', 'dot', 'and', 'discuss', 'how', 'to', 'properly', 'measure', 'the', 'tunnel', 'couplings', 'as', 'well', 'as', 'the', 'valley', 'phase', 'difference', 'between', 'two', 'quantum', 'dots', 'we', 'then', 'focus', 'on', 'possible', 'phase', 'and', 'spin', 'flip', 'errors', 'during', 'spin', 'transport', 'across', 'a', 'silicon', 'double', 'dot', 'in', 'particular', 'we', 'clarify', 'correction', 'on', 'the', 'effective', 'gfactor', 'for', 'the', 'electron', 'spin', 'from', 'the', 'double', 'dot', 'confinement', 'potential', 'and', 'quantify', 'the', 'resulting', 'phase', 'error', 'we', 'then', 'study', 'spin', 'fidelity', 'loss', 'due', 'to', 'spinvalley', 'mixing', 'which', 'is', 'a', 'unique', 'feature', 'of', 'silicon', 'quantum', 'dots', 'we', 'show', 'that', 'a', 'small', 'phase', 'correction', 'between', 'valleys', 'can', 'cause', 'a', 'significant', 'coherence', 'loss', 'we', 'also', 'investigate', 'spin', 'flip', 'errors', 'caused', 'by', 'either', 'an', 'external', 'inhomogeneous', 'magnetic', 'field', 'or', 'the', 'intrinsic', 'spinorbit', 'coupling', 'we', 'show', 'that', 'the', 'presence', 'of', 'valleys', 'makes', 'it', 'possible', 'to', 'have', 'much', 'broader', 'in', 'terms', 'of', 'interdot', 'detuning', 'level', 'anticrossings', 'compared', 'to', 'typical', 'anticrossings', 'in', 'for', 'example', 'a', 'gaas', 'double', 'dot', 'and', 'such', 'broad', 'anticrossings', 'lead', 'to', 'amplification', 'of', 'spin', 'flip', 'errors', 'lastly', 'we', 'design', 'a', 'pulse', 'sequence', 'to', 'suppress', 'various', 'possible', 'spin', 'flip', 'errors', 'by', 'taking', 'advantage', 'of', 'the', 'multiple', 'level', 'anticrossings', 'in', 'a', 'silicon', 'double', 'dot', 'and', 'employing', 'landauzener', 'transitions']] | [-0.16156123604472852, 0.1960383826782247, 0.003852406005519873, 0.07934223766440619, 0.017489413848193754, -0.20656282116635508, 0.08646357665963456, 0.44737466800363124, -0.29451909233980317, -0.3155930992665881, 0.014907292995509934, -0.26162625884171575, -0.14067509436971085, 0.2210687613926687, -0.03515723229291998, 0.029893445685024552, 0.05350584726626085, -0.05731790796110109, -0.11210105461807053, -0.1671674813343478, 0.2912523267876764, 0.025449548154861956, 0.27514745570727067, 0.09578856203642462, 0.10257431114397693, 0.03367297777694752, 0.09435465298725113, -0.029955912538913682, -0.11171137747539946, 0.05406716694084912, 0.2174787799184046, -0.06894119247058485, 0.23343662819003358, -0.4528636169070065, -0.15428475384891988, 0.057646546403274816, 0.15303205105707446, 0.20163273380848212, -0.07616889097496961, -0.2770823209195304, 0.014954112728415918, -0.20143722547286683, -0.056532418394476924, -0.07367802970893994, -0.009136835290725585, -0.016384498824701964, -0.254091898640696, 0.05883857414362162, 0.060934453291384146, -0.0004017725562434174, 0.04311413343549714, -0.06295222881398782, -0.02170201054306607, 0.11681227549174879, -0.005342740634996288, 0.03068674164968484, 0.19676405256183646, -0.11211675048234458, -0.18347389213819087, 0.3221997946438168, -0.07758673764823959, -0.1616740959086025, 0.11724063929389505, -0.19053207714689754, -0.057517337426934545, 0.10183035872266197, 0.15017012720966727, 0.06287035640493474, -0.1258794747766483, 0.06380476715642873, 0.07031279628579858, 0.16768951126532786, 0.053409134147360045, 0.14848898642328606, 0.25759409753871815, 0.16828532223129927, 0.07553897622655764, 0.14845867879090033, -0.18136109793050012, -0.13671246930803252, -0.24946903258375236, -0.19116043207478248, -0.1900760053359598, 0.13402757680575764, -0.06745850963195435, -0.17041423853093998, 0.43564513343104605, 0.14317351466332398, 0.17898149476944225, -0.06215993366500132, 0.2841499620743346, 0.1345414050488866, 0.0819427123525133, -0.004120549916861062, 0.2473312497624204, 0.20582870077909196, 0.04084985145805951, -0.34352769687118306, 0.009759680548009752, -0.04703569505168047] |
1,803.0075 | No Nonlocality. No Fractional Derivative | The paper discusses the characteristic properties of fractional derivatives
of non-integer order. It is known that derivatives of integer orders are
determined by properties of differentiable functions only in an infinitely
small neighborhood of the considered point. Therefore differential equation,
which is considered for this point and contains a finite number of
integer-order derivatives, cannot describe nonlocality in space and time. This
allows us to propose a principle of nonlocality for fractional derivatives. We
state that if the differential equation with fractional derivative can be
presented as a differential equation with a finite number of integer-order
derivatives, then this fractional derivative cannot be considered as a
derivative of non-integer order. This means that all results obtained for this
type of fractional derivatives can be derived by using differential operators
with integer orders. To illustrate the application of the nonlocality
principle, we prove that the conformable fractional derivative, the
M-fractional derivative, the alternative fractional derivative, the local
fractional derivative and the Caputo-Fabrizio fractional derivatives with
exponential kernels cannot be considered as fractional derivatives of
non-integer orders.
| math.CA | the paper discusses the characteristic properties of fractional derivatives of noninteger order it is known that derivatives of integer orders are determined by properties of differentiable functions only in an infinitely small neighborhood of the considered point therefore differential equation which is considered for this point and contains a finite number of integerorder derivatives cannot describe nonlocality in space and time this allows us to propose a principle of nonlocality for fractional derivatives we state that if the differential equation with fractional derivative can be presented as a differential equation with a finite number of integerorder derivatives then this fractional derivative cannot be considered as a derivative of noninteger order this means that all results obtained for this type of fractional derivatives can be derived by using differential operators with integer orders to illustrate the application of the nonlocality principle we prove that the conformable fractional derivative the mfractional derivative the alternative fractional derivative the local fractional derivative and the caputofabrizio fractional derivatives with exponential kernels cannot be considered as fractional derivatives of noninteger orders | [['the', 'paper', 'discusses', 'the', 'characteristic', 'properties', 'of', 'fractional', 'derivatives', 'of', 'noninteger', 'order', 'it', 'is', 'known', 'that', 'derivatives', 'of', 'integer', 'orders', 'are', 'determined', 'by', 'properties', 'of', 'differentiable', 'functions', 'only', 'in', 'an', 'infinitely', 'small', 'neighborhood', 'of', 'the', 'considered', 'point', 'therefore', 'differential', 'equation', 'which', 'is', 'considered', 'for', 'this', 'point', 'and', 'contains', 'a', 'finite', 'number', 'of', 'integerorder', 'derivatives', 'can', 'not', 'describe', 'nonlocality', 'in', 'space', 'and', 'time', 'this', 'allows', 'us', 'to', 'propose', 'a', 'principle', 'of', 'nonlocality', 'for', 'fractional', 'derivatives', 'we', 'state', 'that', 'if', 'the', 'differential', 'equation', 'with', 'fractional', 'derivative', 'can', 'be', 'presented', 'as', 'a', 'differential', 'equation', 'with', 'a', 'finite', 'number', 'of', 'integerorder', 'derivatives', 'then', 'this', 'fractional', 'derivative', 'can', 'not', 'be', 'considered', 'as', 'a', 'derivative', 'of', 'noninteger', 'order', 'this', 'means', 'that', 'all', 'results', 'obtained', 'for', 'this', 'type', 'of', 'fractional', 'derivatives', 'can', 'be', 'derived', 'by', 'using', 'differential', 'operators', 'with', 'integer', 'orders', 'to', 'illustrate', 'the', 'application', 'of', 'the', 'nonlocality', 'principle', 'we', 'prove', 'that', 'the', 'conformable', 'fractional', 'derivative', 'the', 'mfractional', 'derivative', 'the', 'alternative', 'fractional', 'derivative', 'the', 'local', 'fractional', 'derivative', 'and', 'the', 'caputofabrizio', 'fractional', 'derivatives', 'with', 'exponential', 'kernels', 'can', 'not', 'be', 'considered', 'as', 'fractional', 'derivatives', 'of', 'noninteger', 'orders']] | [-0.14980795089723778, 0.08069385200638515, -0.07821100426306739, 0.07896292573848238, -0.1591122248249254, -0.08122187086611232, -0.02396230970109091, 0.29664027509855084, -0.32017221314351213, -0.285059440886246, 0.15716876198270807, -0.26430675148477667, -0.16273621440436062, 0.16617414486343354, -0.061447529891359334, 0.08076461870746499, -0.06761093590842832, 0.062402391021422456, -0.11019088814997774, -0.26759921429741584, 0.33730020841421415, -0.08208373409769174, 0.1322603360252727, 0.030954617180265067, 0.17036767417088863, -0.05285373137573178, -0.036530234429755074, 0.04080735912184843, -0.14941710737364478, 0.12660025727406687, 0.2532366725937934, -0.021182539731557114, 0.31518567134783176, -0.4234181216007538, -0.23500790075775696, 0.1235094181938212, 0.0960544207423737, 0.03145284144916791, 0.01700555296154337, -0.29153659118841707, 0.08890279429687417, -0.18921414529381508, -0.20821547222041178, -0.13724332385051607, 0.06664604789922747, 0.07619186477432174, -0.2957718462102492, 0.13424913260661944, 0.05335810057572979, -0.0131845591678755, -0.05172223612709295, -0.14533889522838794, -0.03828709967319299, 0.020328281135978492, 0.02515705490976656, -0.016587101858962075, 0.021211351806904827, -0.08995092320605835, -0.18878775445765325, 0.344800932285784, -0.13419109600297896, -0.3165908092677036, 0.0862339081888851, -0.22226628662725345, -0.10485756159184521, 0.10861752322046853, 0.08726111039770452, 0.18892301866795155, -0.1574503199126718, 0.10561878018485371, 0.021299907948110212, 0.17951199465877313, 0.09842541651784578, 0.08361063840056068, 0.10588019116901991, 0.07470532378516673, 0.13894359002235146, 0.1411482078596175, -0.026021622023231276, -0.13886057180247866, -0.39681482725263983, -0.24708539508858673, -0.21113919168272516, 0.06684556832493563, -0.11467118924027479, -0.15666190624299847, 0.3774613431011316, 0.1277075310216777, 0.11293693605203474, 0.06199509259692676, 0.2366114735205689, 0.3272467062401774, 0.06591966015736708, 0.005772471947984945, 0.14687062855391356, 0.11606175705445197, 0.1148081975021096, -0.19960716781677323, 0.08063003648428267, 0.1404021829759095] |
1,803.00751 | Charge transport in doped zigzag phosphorene nanoribbons | The effects of lattice distortion and chemical disorder on charge transport
properties of two-terminal zigzag phosphorene nanoribbons (zPNRs), which shows
resonant tunneling behavior under an electrical applied bias, are studied. Our
comprehensive study is based on an {\it ab~initio} quantum transport
calculations on the basis of the Landauer theory. We use nitrogen and silicon
substitutional dopant atoms, and employ different physical quantities such as
$I-V$ curve, voltage drop behavior, transmission spectrum, transmission
pathway, and atomic current, to explore the transport mechanism of zPNR devices
under a bias voltage. The calculated transmission pathways show the transition
from a ballistic transport regime to a diffusive and in some particular cases
to localized transport regimes. Current flowing via the chemical bonds and
hopping are monitored, however, the conductance originates mainly from a charge
traveling through the chemical bonds in the vicinity of the zigzag edges. Our
results show that, in the doped systems, the device conductance decreases and
negative differential resistance characteristic becomes weak or eliminates.
Besides, the conductance in a pure zPNR system is almost independent of the
ribbon width.
| cond-mat.mes-hall cond-mat.mtrl-sci | the effects of lattice distortion and chemical disorder on charge transport properties of twoterminal zigzag phosphorene nanoribbons zpnrs which shows resonant tunneling behavior under an electrical applied bias are studied our comprehensive study is based on an it abinitio quantum transport calculations on the basis of the landauer theory we use nitrogen and silicon substitutional dopant atoms and employ different physical quantities such as iv curve voltage drop behavior transmission spectrum transmission pathway and atomic current to explore the transport mechanism of zpnr devices under a bias voltage the calculated transmission pathways show the transition from a ballistic transport regime to a diffusive and in some particular cases to localized transport regimes current flowing via the chemical bonds and hopping are monitored however the conductance originates mainly from a charge traveling through the chemical bonds in the vicinity of the zigzag edges our results show that in the doped systems the device conductance decreases and negative differential resistance characteristic becomes weak or eliminates besides the conductance in a pure zpnr system is almost independent of the ribbon width | [['the', 'effects', 'of', 'lattice', 'distortion', 'and', 'chemical', 'disorder', 'on', 'charge', 'transport', 'properties', 'of', 'twoterminal', 'zigzag', 'phosphorene', 'nanoribbons', 'zpnrs', 'which', 'shows', 'resonant', 'tunneling', 'behavior', 'under', 'an', 'electrical', 'applied', 'bias', 'are', 'studied', 'our', 'comprehensive', 'study', 'is', 'based', 'on', 'an', 'it', 'abinitio', 'quantum', 'transport', 'calculations', 'on', 'the', 'basis', 'of', 'the', 'landauer', 'theory', 'we', 'use', 'nitrogen', 'and', 'silicon', 'substitutional', 'dopant', 'atoms', 'and', 'employ', 'different', 'physical', 'quantities', 'such', 'as', 'iv', 'curve', 'voltage', 'drop', 'behavior', 'transmission', 'spectrum', 'transmission', 'pathway', 'and', 'atomic', 'current', 'to', 'explore', 'the', 'transport', 'mechanism', 'of', 'zpnr', 'devices', 'under', 'a', 'bias', 'voltage', 'the', 'calculated', 'transmission', 'pathways', 'show', 'the', 'transition', 'from', 'a', 'ballistic', 'transport', 'regime', 'to', 'a', 'diffusive', 'and', 'in', 'some', 'particular', 'cases', 'to', 'localized', 'transport', 'regimes', 'current', 'flowing', 'via', 'the', 'chemical', 'bonds', 'and', 'hopping', 'are', 'monitored', 'however', 'the', 'conductance', 'originates', 'mainly', 'from', 'a', 'charge', 'traveling', 'through', 'the', 'chemical', 'bonds', 'in', 'the', 'vicinity', 'of', 'the', 'zigzag', 'edges', 'our', 'results', 'show', 'that', 'in', 'the', 'doped', 'systems', 'the', 'device', 'conductance', 'decreases', 'and', 'negative', 'differential', 'resistance', 'characteristic', 'becomes', 'weak', 'or', 'eliminates', 'besides', 'the', 'conductance', 'in', 'a', 'pure', 'zpnr', 'system', 'is', 'almost', 'independent', 'of', 'the', 'ribbon', 'width']] | [-0.19916786354171176, 0.13630825103920483, -0.03106738668814134, -0.011981186641411583, 0.02427601234874887, -0.19211889429049295, 0.12045409135177752, 0.40538621906274824, -0.3136528347896182, -0.23251675374628034, -0.018068462814298573, -0.3488695352662648, -0.1592389978429177, 0.17939667323253672, 0.023420728541638576, 0.01404474141976137, 0.034531203084206735, -0.04958526818264862, -0.05337766663490512, -0.18926133717452123, 0.2664767474150599, 0.04822734415235542, 0.3556801199735132, 0.13197327040206494, 0.012310422902005944, 0.025824106022391175, 0.084141606148437, 0.05906979840588218, -0.1625703887885526, 0.03175744348862261, 0.20143439734794116, -0.10700057179434388, 0.18033978409458246, -0.4871399449890877, -0.23990314400995547, -0.018689789873380422, 0.1360359400997378, 0.16834702828488302, -0.07039407952727876, -0.22620933852420094, 0.03674726904987284, -0.12034711999598932, -0.09039128176091969, -0.04046135742656803, 0.00836393538093341, 0.028643777047864714, -0.2334205219888369, 0.1150234854162744, 0.01112499437033293, 0.07230832215408851, -0.056957838144902205, -0.11808457842366142, -0.11107417631611814, 0.09239428682387492, 0.008506898446468993, -0.04729808981038546, 0.2798608330685352, -0.11004937706211729, -0.1169735243141107, 0.3452854085186486, -0.060660811519156095, -0.10649101871191367, 0.17481279951059836, -0.16148584313544162, -0.04761184123606327, 0.13425208473567632, 0.08448281206630087, 0.10845786738771883, -0.18836911141007792, 0.06606898842977224, 0.022047458729298596, 0.1355540481594841, 0.06641372867723865, 0.07872995456976271, 0.23354501089635776, 0.18587087853314627, 0.08088935765613059, 0.12462513091361799, -0.12415181262172717, -0.07318581114104541, -0.23789026813968764, -0.17025131944912286, -0.1755500102384288, 0.12136906139510736, -0.0683892335937446, -0.22844019277136396, 0.433893321223264, 0.15581850062668576, 0.1869426629312462, -0.02840712913272777, 0.27299298658140336, 0.16138774003595469, 0.04174707643426118, 0.024969331522503597, 0.21584066725286963, 0.19615534246177152, 0.13509104648353845, -0.325509149654444, 0.10784551864908484, -0.0251009503760103] |
1,803.00752 | Angular dependence of columnar recombination in high pressure xenon gas
using time profile of scintillation emission | The angular dependence of the columnar recombination in xenon gas, if
observed for low energy nuclear tracks, can be used for a direction-sensitive
dark matter search. We measured both scintillation and ionization to study
columnar recombination for 5.4 MeV alpha particles in a high pressure gas
detector filled with 8 atm xenon. Since the recombination photons are emitted
several~$\mu$s after de-excitation emission, scintillation photons are
separated to the fast and slow components. The fast component does not show
dependence on the track angle relative to the drift electric field, on the
other hand, the slow component increases when the track is aligned with the
electric field. The result indicates that the track angle relative to the
electric field can be reconstructed from the scintillation time profile.
| astro-ph.IM physics.ins-det | the angular dependence of the columnar recombination in xenon gas if observed for low energy nuclear tracks can be used for a directionsensitive dark matter search we measured both scintillation and ionization to study columnar recombination for 54 mev alpha particles in a high pressure gas detector filled with 8 atm xenon since the recombination photons are emitted severalmus after deexcitation emission scintillation photons are separated to the fast and slow components the fast component does not show dependence on the track angle relative to the drift electric field on the other hand the slow component increases when the track is aligned with the electric field the result indicates that the track angle relative to the electric field can be reconstructed from the scintillation time profile | [['the', 'angular', 'dependence', 'of', 'the', 'columnar', 'recombination', 'in', 'xenon', 'gas', 'if', 'observed', 'for', 'low', 'energy', 'nuclear', 'tracks', 'can', 'be', 'used', 'for', 'a', 'directionsensitive', 'dark', 'matter', 'search', 'we', 'measured', 'both', 'scintillation', 'and', 'ionization', 'to', 'study', 'columnar', 'recombination', 'for', '54', 'mev', 'alpha', 'particles', 'in', 'a', 'high', 'pressure', 'gas', 'detector', 'filled', 'with', '8', 'atm', 'xenon', 'since', 'the', 'recombination', 'photons', 'are', 'emitted', 'severalmus', 'after', 'deexcitation', 'emission', 'scintillation', 'photons', 'are', 'separated', 'to', 'the', 'fast', 'and', 'slow', 'components', 'the', 'fast', 'component', 'does', 'not', 'show', 'dependence', 'on', 'the', 'track', 'angle', 'relative', 'to', 'the', 'drift', 'electric', 'field', 'on', 'the', 'other', 'hand', 'the', 'slow', 'component', 'increases', 'when', 'the', 'track', 'is', 'aligned', 'with', 'the', 'electric', 'field', 'the', 'result', 'indicates', 'that', 'the', 'track', 'angle', 'relative', 'to', 'the', 'electric', 'field', 'can', 'be', 'reconstructed', 'from', 'the', 'scintillation', 'time', 'profile']] | [-0.06483804414514452, 0.2547072040326893, -0.06087474348768592, 0.04567259073234163, -0.010627395236166194, -0.1289167870339006, -0.031939039334654806, 0.41871427288651464, -0.2617251618653536, -0.3747515843957663, 0.02058582882769406, -0.3160726406276226, 0.055687825612723826, 0.1489238047003746, 0.0342939163595438, -0.017231075301766395, 0.010371704248711467, -0.0038053507208824157, -0.045612352886237204, -0.16801375990360976, 0.21494483929872513, 0.11483207936771214, 0.26788214986771347, 0.09211703383550048, 0.12631545394286514, -0.0020111394692212342, -0.05019342400878668, -0.008730877235531807, -0.07260958748898702, 0.005814309917390346, 0.20876779851317406, 0.05513791275024414, 0.1302149196136743, -0.440363378867507, -0.17717882499843834, 0.11537614898756146, 0.15249367375671863, 0.08174040655046702, -0.08652659705840052, -0.27836323823034764, 0.029114753738045694, -0.15013298508897424, -0.1530199884455651, 0.003830582283437252, 0.023676432750187815, 0.06824337737075985, -0.24562097855750473, 0.08963982313126326, -0.005016734403907322, -0.018241049252450466, -0.08959209791943432, -0.09783045877143741, -0.02963970559835434, 0.04039690485899337, 0.08850565396808088, 0.0669608078636229, 0.2905770854689181, -0.14316400147229433, -0.03684649335965514, 0.3483305963948369, -0.13919928166642784, -0.12231371216103434, 0.1802256374284625, -0.22585999109083787, -0.060692604293348267, 0.30332227346673607, 0.17071701142191886, 0.10339576725289226, -0.10059832414856647, 0.004441808768780902, 0.03860806435346603, 0.24747416205704212, 0.07716757427901029, 0.007188980679959059, 0.25718378664553165, 0.13102542994264513, 0.05027330580115085, 0.0673710601083003, -0.228135366756469, -0.043518709490075705, -0.26262509866058825, -0.17842952296324074, -0.13686510972306132, 0.026358736967784353, -0.054938686322188006, -0.12685006058961154, 0.37709997937828305, 0.08252531469240784, 0.18876814836263656, -0.03381346288509667, 0.3519331785365939, 0.09733606452587992, 0.05061618268489838, 0.06811624554917216, 0.3143869870752096, 0.16259930350631474, 0.13605710793286563, -0.2849827431757003, 0.09421763444319367, -0.010229937525466085] |
1,803.00753 | Decoupling of Two Closely Located Dipole Antennas by a Split-Loop
Resonator | In this letter, we theoretically and experimentally prove the possibility of
the complete passive decoupling for two parallel resonant dipoles by a
split-loop resonator. Unlike previously achieved decoupling by a similar
resonant dipole, this decoupling technique allows us to avoid the shrink of the
operation band. Compare to previous work, simulation and measurement show 100\%
enhancemnet of relative operation band from 0.2% to 0.4%
| physics.app-ph | in this letter we theoretically and experimentally prove the possibility of the complete passive decoupling for two parallel resonant dipoles by a splitloop resonator unlike previously achieved decoupling by a similar resonant dipole this decoupling technique allows us to avoid the shrink of the operation band compare to previous work simulation and measurement show 100 enhancemnet of relative operation band from 02 to 04 | [['in', 'this', 'letter', 'we', 'theoretically', 'and', 'experimentally', 'prove', 'the', 'possibility', 'of', 'the', 'complete', 'passive', 'decoupling', 'for', 'two', 'parallel', 'resonant', 'dipoles', 'by', 'a', 'splitloop', 'resonator', 'unlike', 'previously', 'achieved', 'decoupling', 'by', 'a', 'similar', 'resonant', 'dipole', 'this', 'decoupling', 'technique', 'allows', 'us', 'to', 'avoid', 'the', 'shrink', 'of', 'the', 'operation', 'band', 'compare', 'to', 'previous', 'work', 'simulation', 'and', 'measurement', 'show', '100', 'enhancemnet', 'of', 'relative', 'operation', 'band', 'from', '02', 'to', '04']] | [-0.12883542380445906, 0.1345257669867527, -0.04304990283544025, 0.0021783907544769107, -0.032036384747874354, -0.12168911542563189, 0.12544980534021893, 0.3988472406542109, -0.2583454216815411, -0.35242434146423496, 0.019911154066287583, -0.23801396541215758, -0.0991585740984808, 0.2000451861850677, -0.037679857756536934, 0.0662547036434614, 0.03828158863489666, -0.053839054844912984, -0.0666900284272889, -0.16157646041603818, 0.2822874189624863, 0.061232182813147386, 0.3213022617442954, 0.029532165446829413, 0.07191363265437464, 0.03572643740523246, -0.00610118137011605, -0.04062134063532276, -0.13846609552180575, 0.07549854479129275, 0.2065051956883361, -7.329519552689406e-05, 0.22509954932836757, -0.43372827095370137, -0.16777461762690254, 0.07230694813188165, 0.1883847474931709, 0.15184135156713666, -0.03764207937544392, -0.22747442582922597, 0.10727551768744184, -0.19102520351448365, -0.14205774343422345, -0.06411630821023737, -0.03191253439252896, -0.04731808228778743, -0.25803557938836036, 0.045931021405023434, 0.08743646022576873, 0.027518028047897162, -0.030867364941983513, -0.03812810580336278, 0.03187135408816469, 0.040430969543634884, -0.008935977434439043, 0.0211051584281508, 0.14054180769580266, -0.016274923436163415, -0.12562267866826826, 0.32326740780920393, -0.10112280777144816, -0.10522354272524675, 0.20011510498701565, -0.15734769905271428, -0.08626224977835532, 0.16206951383801718, 0.11981207456800246, 0.1245407361627346, -0.16664825572121528, 0.04834520508677909, 0.01993775951691092, 0.17453287846048274, 0.12910119866982342, 0.05429978233071104, 0.18938893506363516, 0.1598764226693029, 0.07387399868739228, 0.1753776430212442, -0.10985457232116812, -0.05184705081515976, -0.23472497214172636, -0.13788905675192514, -0.15968136203986022, 0.025640400227970414, -0.06130995139462738, -0.07368392715110414, 0.4131535546433541, 0.20442118802137912, 0.20709051349530777, 0.05920038019276915, 0.34263990344780104, 0.08091696107669943, 0.07933659821508392, 9.585478373112218e-05, 0.382180581410085, 0.16090132540182, 0.08776286296967056, -0.26558500365729654, -0.03457259031147846, -0.04358783036830925] |
1,803.00754 | Convolutional Geometric Matrix Completion | Geometric matrix completion (GMC) has been proposed for recommendation by
integrating the relationship (link) graphs among users/items into matrix
completion (MC). Traditional GMC methods typically adopt graph regularization
to impose smoothness priors for MC. Recently, geometric deep learning on graphs
(GDLG) is proposed to solve the GMC problem, showing better performance than
existing GMC methods including traditional graph regularization based methods.
To the best of our knowledge, there exists only one GDLG method for GMC, which
is called RMGCNN. RMGCNN combines graph convolutional network (GCN) and
recurrent neural network (RNN) together for GMC. In the original work of
RMGCNN, RMGCNN demonstrates better performance than pure GCN-based method. In
this paper, we propose a new GMC method, called convolutional geometric matrix
completion (CGMC), for recommendation with graphs among users/items. CGMC is a
pure GCN-based method with a newly designed graph convolutional network.
Experimental results on real datasets show that CGMC can outperform other
state-of-the-art methods including RMGCNN in terms of both accuracy and speed.
| cs.LG cs.IR | geometric matrix completion gmc has been proposed for recommendation by integrating the relationship link graphs among usersitems into matrix completion mc traditional gmc methods typically adopt graph regularization to impose smoothness priors for mc recently geometric deep learning on graphs gdlg is proposed to solve the gmc problem showing better performance than existing gmc methods including traditional graph regularization based methods to the best of our knowledge there exists only one gdlg method for gmc which is called rmgcnn rmgcnn combines graph convolutional network gcn and recurrent neural network rnn together for gmc in the original work of rmgcnn rmgcnn demonstrates better performance than pure gcnbased method in this paper we propose a new gmc method called convolutional geometric matrix completion cgmc for recommendation with graphs among usersitems cgmc is a pure gcnbased method with a newly designed graph convolutional network experimental results on real datasets show that cgmc can outperform other stateoftheart methods including rmgcnn in terms of both accuracy and speed | [['geometric', 'matrix', 'completion', 'gmc', 'has', 'been', 'proposed', 'for', 'recommendation', 'by', 'integrating', 'the', 'relationship', 'link', 'graphs', 'among', 'usersitems', 'into', 'matrix', 'completion', 'mc', 'traditional', 'gmc', 'methods', 'typically', 'adopt', 'graph', 'regularization', 'to', 'impose', 'smoothness', 'priors', 'for', 'mc', 'recently', 'geometric', 'deep', 'learning', 'on', 'graphs', 'gdlg', 'is', 'proposed', 'to', 'solve', 'the', 'gmc', 'problem', 'showing', 'better', 'performance', 'than', 'existing', 'gmc', 'methods', 'including', 'traditional', 'graph', 'regularization', 'based', 'methods', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'there', 'exists', 'only', 'one', 'gdlg', 'method', 'for', 'gmc', 'which', 'is', 'called', 'rmgcnn', 'rmgcnn', 'combines', 'graph', 'convolutional', 'network', 'gcn', 'and', 'recurrent', 'neural', 'network', 'rnn', 'together', 'for', 'gmc', 'in', 'the', 'original', 'work', 'of', 'rmgcnn', 'rmgcnn', 'demonstrates', 'better', 'performance', 'than', 'pure', 'gcnbased', 'method', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'gmc', 'method', 'called', 'convolutional', 'geometric', 'matrix', 'completion', 'cgmc', 'for', 'recommendation', 'with', 'graphs', 'among', 'usersitems', 'cgmc', 'is', 'a', 'pure', 'gcnbased', 'method', 'with', 'a', 'newly', 'designed', 'graph', 'convolutional', 'network', 'experimental', 'results', 'on', 'real', 'datasets', 'show', 'that', 'cgmc', 'can', 'outperform', 'other', 'stateoftheart', 'methods', 'including', 'rmgcnn', 'in', 'terms', 'of', 'both', 'accuracy', 'and', 'speed']] | [-0.020377892449856824, -0.05958523110830751, -0.0829202347660657, 0.06554282216141175, -0.12703349210194642, -0.1596394570411316, -0.008662483281808795, 0.48502956212770126, -0.23630829074171297, -0.3095540346242256, 0.061201584176160395, -0.24702220574970016, -0.23895750215323353, 0.1584957945681183, -0.1336444276182548, 0.10787743469989448, 0.1804903021504559, 0.0339393466537506, -0.08629703583768482, -0.278572647812811, 0.3294182222998869, 0.03839558105961339, 0.30625096047933426, 0.02250331450725171, 0.14839067653411572, -0.0639817006683544, -0.05059174369436382, 0.001637562372582901, -0.09520923872124902, 0.16020801786683292, 0.25870719035763456, 0.19922601412952826, 0.2940913358737963, -0.397357216822157, -0.2879759619440536, 0.1225752009842429, 0.15643862858761726, 0.03730343987665252, 0.010350213974793094, -0.29896762648956005, 0.131411149918524, -0.20918103964617535, 0.050022577777250395, -0.11988704468077338, -0.04932433315328617, -0.011990236756189362, -0.30986870987259824, 0.05884886011539131, 0.051154084930627355, 0.031206737249302938, 0.010601860245469934, -0.1992098862328422, 0.0691935796657959, 0.08500522677642033, -0.022477691821025117, 0.0895808534609929, 0.11932789315672024, -0.12960104501310168, -0.17672660524569314, 0.34566891177192977, -0.08313115218582691, -0.18132092619621373, 0.17616588099836517, -0.006303431104683543, -0.21037163056710861, 0.10452842581670106, 0.16936380791648506, 0.09410245484608856, -0.15668899609898188, 0.044893306118193206, -0.06127940905309334, 0.14805348740127053, 0.033299875052310295, 0.006587704684099425, 0.07392597621630716, 0.27407618978325426, 0.09304691588553826, 0.112802007026256, -0.08846976473256483, -0.12204349752492416, -0.12867832715407604, -0.08840484320191863, -0.2226193815481311, -0.02373214674859036, -0.18349898738409856, -0.17150396807986942, 0.3928565018064117, 0.20235411569863695, 0.1635674577965965, 0.15341970264573251, 0.34445254750743576, 0.007588070346568914, 0.14869811026790172, 0.15800336114946545, 0.16131678056362322, 0.10592184161842563, 0.08464589240665761, -0.15941399175048984, 0.08915856707789097, 0.14332423512592496] |
1,803.00755 | Electronic Correlations Among the Dirac Electrons in
$\alpha$-(BEDT-TTF)$_2$I$_3$ Unveiled by High-Pressure Optical Spectroscopy | The charge-ordered insulator $\alpha$-(BEDT-TTF)$_2$I$_3$ gradually evolves
to a metal when pressure is applied, and at low temperatures the electronic
bands form tilted Dirac-like cones. A metallic state with a
frequency-independent optical conductivity indicates the coexistence of the
trivial and massless Dirac electrons in the system. Our infrared investigations
also reveal that at the boundary between insulating and metallic states an
energy gap opens due to correlated massive Dirac fermions, which is gradually
suppressed when pressure increases.
| cond-mat.str-el | the chargeordered insulator alphabedtttf_2i_3 gradually evolves to a metal when pressure is applied and at low temperatures the electronic bands form tilted diraclike cones a metallic state with a frequencyindependent optical conductivity indicates the coexistence of the trivial and massless dirac electrons in the system our infrared investigations also reveal that at the boundary between insulating and metallic states an energy gap opens due to correlated massive dirac fermions which is gradually suppressed when pressure increases | [['the', 'chargeordered', 'insulator', 'alphabedtttf_2i_3', 'gradually', 'evolves', 'to', 'a', 'metal', 'when', 'pressure', 'is', 'applied', 'and', 'at', 'low', 'temperatures', 'the', 'electronic', 'bands', 'form', 'tilted', 'diraclike', 'cones', 'a', 'metallic', 'state', 'with', 'a', 'frequencyindependent', 'optical', 'conductivity', 'indicates', 'the', 'coexistence', 'of', 'the', 'trivial', 'and', 'massless', 'dirac', 'electrons', 'in', 'the', 'system', 'our', 'infrared', 'investigations', 'also', 'reveal', 'that', 'at', 'the', 'boundary', 'between', 'insulating', 'and', 'metallic', 'states', 'an', 'energy', 'gap', 'opens', 'due', 'to', 'correlated', 'massive', 'dirac', 'fermions', 'which', 'is', 'gradually', 'suppressed', 'when', 'pressure', 'increases']] | [-0.1881456613222039, 0.30556715280296265, -0.06372027832549065, 0.0005403615834534561, -0.02762886539920529, -0.21403679560477795, 0.12921989058132136, 0.36053326877912406, -0.2771125397044479, -0.2592394922884475, -0.03567664486533766, -0.39079362158908654, -0.12276747706499391, 0.11097188125744364, 0.047712921875676044, -0.03671486257314284, -0.025356378780040694, -0.08119333300534268, -0.17755009396626664, -0.17673347090050429, 0.3354675964403309, 0.02212726709579951, 0.34003223753289175, 0.11067382589374718, 0.007666043103917649, -0.03597386912320202, 0.1700623705983162, 0.02278851563498488, -0.07117391184424617, -0.0286688250155892, 0.2677659541000857, -0.21565208498290495, 0.20729375063092448, -0.429103989987389, -0.20616006582828336, -0.0301204407465105, 0.15367770122707283, 0.10469118414269026, -0.08891818239843767, -0.31865314298652503, 0.02130292921853987, -0.11600673351878006, -0.20689597464852819, -0.06314153237862659, -0.04228105360495025, -0.11543234650927939, -0.23095694345446596, 0.12170732359204282, 0.004653224026122571, 0.041607564008843745, -0.1644379838988626, -0.13278834237931542, -0.175439035467877, 0.03933403031107063, 0.06444405484944582, 0.06094743987839473, 0.1534598559190176, -0.132768605143371, -0.013468728719377205, 0.38750874699632587, -0.05308320148124997, -0.05529306826524829, 0.23013673449627517, -0.20211243090268813, -0.0022769606397272774, 0.2587689813103919, 0.08137284070988626, 0.04379769347877683, -0.07424272114823045, 0.0915540373454477, -0.007822436150347226, 0.16899484422940173, 0.01509873540826926, 0.09944684291871167, 0.33737627346999943, 0.17600273953039983, 0.08793916703832924, 0.16432092871860063, -0.09006212866332039, -0.021094807111167985, -0.18455548270752556, -0.21940449116089822, -0.24259960530080685, 0.07353829286110244, -0.06138828849534069, -0.22676916652064966, 0.40353302614408004, 0.11345044453628361, 0.1604116087791657, -0.06010148512340445, 0.2682289564491887, 0.152029796114412, 0.05723747331036353, 0.12177566229365766, 0.26604315216383456, 0.15805566792168016, 0.15622842223628572, -0.2917510523632365, -0.01744239502218797, -0.04807084460059598] |
1,803.00756 | Study of systematics effects on the Cross Power Spectrum of 21 cm Line
and Cosmic Microwave Background using Murchison Widefield Array Data | Observation of the 21cm line signal from neutral hydrogen during the Epoch of
Reionization is challenging due to extremely bright Galactic and extragalactic
foregrounds and complicated instrumental calibration. A reasonable approach for
mitigating these problems is the cross correlation with other observables. In
this work, we present the first results of the cross power spectrum (CPS)
between radio images observed by the Murchison Widefield Array and the cosmic
microwave background (CMB), measured by the Planck experiment. We study the
systematics due to the ionospheric activity, the dependence of CPS on group of
pointings, and frequency. The resulting CPS is consistent with zero because the
error is dominated by the foregrounds in the 21cm observation. Additionally,
the variance of the signal indicates the presence of unexpected systematics
error at small scales. Furthermore, we reduce the error by one order of
magnitude with application of a foreground removal using a polynomial fitting
method. Based on the results, we find that the detection of the 21cm-CMB CPS
with the MWA Phase I requires more than 99.95% of the foreground signal
removed, 2000 hours of deep observation and 50% of the sky fraction coverage.
| astro-ph.CO | observation of the 21cm line signal from neutral hydrogen during the epoch of reionization is challenging due to extremely bright galactic and extragalactic foregrounds and complicated instrumental calibration a reasonable approach for mitigating these problems is the cross correlation with other observables in this work we present the first results of the cross power spectrum cps between radio images observed by the murchison widefield array and the cosmic microwave background cmb measured by the planck experiment we study the systematics due to the ionospheric activity the dependence of cps on group of pointings and frequency the resulting cps is consistent with zero because the error is dominated by the foregrounds in the 21cm observation additionally the variance of the signal indicates the presence of unexpected systematics error at small scales furthermore we reduce the error by one order of magnitude with application of a foreground removal using a polynomial fitting method based on the results we find that the detection of the 21cmcmb cps with the mwa phase i requires more than 9995 of the foreground signal removed 2000 hours of deep observation and 50 of the sky fraction coverage | [['observation', 'of', 'the', '21cm', 'line', 'signal', 'from', 'neutral', 'hydrogen', 'during', 'the', 'epoch', 'of', 'reionization', 'is', 'challenging', 'due', 'to', 'extremely', 'bright', 'galactic', 'and', 'extragalactic', 'foregrounds', 'and', 'complicated', 'instrumental', 'calibration', 'a', 'reasonable', 'approach', 'for', 'mitigating', 'these', 'problems', 'is', 'the', 'cross', 'correlation', 'with', 'other', 'observables', 'in', 'this', 'work', 'we', 'present', 'the', 'first', 'results', 'of', 'the', 'cross', 'power', 'spectrum', 'cps', 'between', 'radio', 'images', 'observed', 'by', 'the', 'murchison', 'widefield', 'array', 'and', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'measured', 'by', 'the', 'planck', 'experiment', 'we', 'study', 'the', 'systematics', 'due', 'to', 'the', 'ionospheric', 'activity', 'the', 'dependence', 'of', 'cps', 'on', 'group', 'of', 'pointings', 'and', 'frequency', 'the', 'resulting', 'cps', 'is', 'consistent', 'with', 'zero', 'because', 'the', 'error', 'is', 'dominated', 'by', 'the', 'foregrounds', 'in', 'the', '21cm', 'observation', 'additionally', 'the', 'variance', 'of', 'the', 'signal', 'indicates', 'the', 'presence', 'of', 'unexpected', 'systematics', 'error', 'at', 'small', 'scales', 'furthermore', 'we', 'reduce', 'the', 'error', 'by', 'one', 'order', 'of', 'magnitude', 'with', 'application', 'of', 'a', 'foreground', 'removal', 'using', 'a', 'polynomial', 'fitting', 'method', 'based', 'on', 'the', 'results', 'we', 'find', 'that', 'the', 'detection', 'of', 'the', '21cmcmb', 'cps', 'with', 'the', 'mwa', 'phase', 'i', 'requires', 'more', 'than', '9995', 'of', 'the', 'foreground', 'signal', 'removed', '2000', 'hours', 'of', 'deep', 'observation', 'and', '50', 'of', 'the', 'sky', 'fraction', 'coverage']] | [-0.09833448828584834, 0.07503738069522475, -0.038799690863699034, 0.0573410966831491, -0.05853753814409612, -0.04945093033115858, 0.0504617604985094, 0.37618859567575985, -0.20741557698972798, -0.3512797990897621, 0.09950655883192898, -0.3183070268955023, -0.09107263285233072, 0.2023403863028362, -0.006125442927614564, 0.017576768993099453, 0.04985322486412115, -0.08157244145071932, -0.028148063790501544, -0.24976743309063806, 0.27918482344984397, 0.16674922696772407, 0.24996229080315777, 0.01836634081881986, 0.10411283936937926, -0.038580837873889814, -0.15165224763756943, -0.008394186375120644, -0.07100580611640234, 0.08333119585563148, 0.2589861701609734, 0.13465844329123794, 0.19701551735923484, -0.3748698748522512, -0.19459605635459185, 0.13699262372277204, 0.10556970827439159, 0.10938239899875409, -0.03935268733728364, -0.3246134381406206, 0.0550766942120852, -0.1407609072479385, -0.09441776160291204, 0.015810096859389906, 0.004740453968884019, 0.01537463448266622, -0.23936538317452663, 0.1299609443488181, 0.0296722438146986, 0.0806772052969478, -0.05615737008068849, -0.1246159849417391, 0.011825029791219445, 0.07986988846173204, 0.04805025262216096, 0.04104998710658586, 0.171178863593254, -0.13415599393007893, -0.050438899558872756, 0.3892241073624482, -0.11818347324559615, -0.05919594622695099, 0.11819728764596953, -0.1985894598118547, -0.1649118567861262, 0.19964856181352858, 0.16921596998587823, 0.052455305136621944, -0.13129693218174257, 0.051255904307783574, 0.05105434750359525, 0.24348362941521579, 0.06685790245386737, 0.04527177904836006, 0.24773557794221218, 0.1517639035345474, 0.12328269314168701, 0.12126010170954196, -0.25979103210810867, 0.012641292410316292, -0.2807044653423998, -0.036863906259424296, -0.1665426012148302, 0.04708800375924776, -0.10218875472784651, -0.11254615148143823, 0.4220603466053646, 0.18752830386748193, 0.20806397145451416, 0.05818543324084391, 0.4043053525386664, 0.09340282780532208, 0.06373139307218254, 0.01634482245537497, 0.3058909059048842, 0.12030501993836235, 0.07617900792260472, -0.23725067127727603, 0.07609424884332512, -0.04236979622679649] |
1,803.00757 | Gesture-based Piloting of an Aerial Robot using Monocular Vision | Aerial robots are becoming popular among general public, and with the
development of artificial intelligence (AI), there is a trend to equip aerial
robots with a natural user interface (NUI). Hand/arm gestures are an intuitive
way to communicate for humans, and various research works have focused on
controlling an aerial robot with natural gestures. However, the techniques in
this area are still far from mature. Many issues in this area have been poorly
addressed, such as the principles of choosing gestures from the design point of
view, hardware requirements from an economic point of view, considerations of
data availability, and algorithm complexity from a practical perspective. Our
work focuses on building an economical monocular system particularly designed
for gesture-based piloting of an aerial robot. Natural arm gestures are mapped
to rich target directions and convenient fine adjustment is achieved. Practical
piloting scenarios, hardware cost and algorithm applicability are jointly
considered in our system design. The entire system is successfully implemented
in an aerial robot and various properties of the system are tested.
| cs.HC cs.RO | aerial robots are becoming popular among general public and with the development of artificial intelligence ai there is a trend to equip aerial robots with a natural user interface nui handarm gestures are an intuitive way to communicate for humans and various research works have focused on controlling an aerial robot with natural gestures however the techniques in this area are still far from mature many issues in this area have been poorly addressed such as the principles of choosing gestures from the design point of view hardware requirements from an economic point of view considerations of data availability and algorithm complexity from a practical perspective our work focuses on building an economical monocular system particularly designed for gesturebased piloting of an aerial robot natural arm gestures are mapped to rich target directions and convenient fine adjustment is achieved practical piloting scenarios hardware cost and algorithm applicability are jointly considered in our system design the entire system is successfully implemented in an aerial robot and various properties of the system are tested | [['aerial', 'robots', 'are', 'becoming', 'popular', 'among', 'general', 'public', 'and', 'with', 'the', 'development', 'of', 'artificial', 'intelligence', 'ai', 'there', 'is', 'a', 'trend', 'to', 'equip', 'aerial', 'robots', 'with', 'a', 'natural', 'user', 'interface', 'nui', 'handarm', 'gestures', 'are', 'an', 'intuitive', 'way', 'to', 'communicate', 'for', 'humans', 'and', 'various', 'research', 'works', 'have', 'focused', 'on', 'controlling', 'an', 'aerial', 'robot', 'with', 'natural', 'gestures', 'however', 'the', 'techniques', 'in', 'this', 'area', 'are', 'still', 'far', 'from', 'mature', 'many', 'issues', 'in', 'this', 'area', 'have', 'been', 'poorly', 'addressed', 'such', 'as', 'the', 'principles', 'of', 'choosing', 'gestures', 'from', 'the', 'design', 'point', 'of', 'view', 'hardware', 'requirements', 'from', 'an', 'economic', 'point', 'of', 'view', 'considerations', 'of', 'data', 'availability', 'and', 'algorithm', 'complexity', 'from', 'a', 'practical', 'perspective', 'our', 'work', 'focuses', 'on', 'building', 'an', 'economical', 'monocular', 'system', 'particularly', 'designed', 'for', 'gesturebased', 'piloting', 'of', 'an', 'aerial', 'robot', 'natural', 'arm', 'gestures', 'are', 'mapped', 'to', 'rich', 'target', 'directions', 'and', 'convenient', 'fine', 'adjustment', 'is', 'achieved', 'practical', 'piloting', 'scenarios', 'hardware', 'cost', 'and', 'algorithm', 'applicability', 'are', 'jointly', 'considered', 'in', 'our', 'system', 'design', 'the', 'entire', 'system', 'is', 'successfully', 'implemented', 'in', 'an', 'aerial', 'robot', 'and', 'various', 'properties', 'of', 'the', 'system', 'are', 'tested']] | [-0.13477033910038339, 0.021714536033721022, -0.05611136679261446, 0.018885153744418477, -0.1483561184127317, -0.21426066896217594, 0.014843646975688983, 0.45838024722802084, -0.2403189425145514, -0.36810904857161086, 0.10455096987357666, -0.2534853935371651, -0.2004393900224809, 0.27453033298356894, -0.18844229979223984, 0.10037974224339218, 0.08381852466304418, 0.04067208379071184, 0.0332361780918206, -0.2237952259432817, 0.25636663304189716, 0.060733737818102165, 0.3090405810575629, 0.017547477372423854, 0.1342336193903425, -0.014522136180160084, 0.010732710690421681, -0.026858498438614757, -0.0708620551788129, 0.16248114506861597, 0.3658880297051266, 0.21750073978910223, 0.3300100671571441, -0.46054578260626905, -0.19679706920544768, 0.04620493512579002, 0.14821041533236154, 0.0654987313346071, -0.07902202349518923, -0.3734934590432013, 0.06418686453253031, -0.17062228412481112, -0.09792384276502268, -0.06676805115895086, 0.016353309404938808, 0.0073486860417815054, -0.2369182319217903, -0.10762116868525397, -0.007337328791076881, 0.19746537641947007, -0.03442865813714127, -0.11611568067442128, 0.03255422510948509, 0.2335162349747491, 0.057319129802297454, 0.035772411771346053, 0.20794463731946836, -0.16782960623399854, -0.13098999735801806, 0.41920481166033463, 0.08963499226347478, -0.220004711181012, 0.23879339229477958, -0.002509263008399758, -0.16607475046983508, 0.09101544166536092, 0.2257318406170884, 0.10697612415479366, -0.2139441650590946, 0.06034059948518027, -0.014279332910772673, 0.15394112225209916, 0.03642714317961796, 0.006772183075744853, 0.22841063482811413, 0.27148218593982504, 0.11110078383962689, 0.09528329004641882, -0.04993236690710927, -0.10993840929112657, -0.18899114556450852, -0.11827675008409938, -0.17292358024251583, -0.03203468029874615, -0.05283662252792098, -0.07761765770115998, 0.32900604232604247, 0.19585457241682466, 0.15476203275990652, 0.050266910842511545, 0.39495796959327406, 0.027186399218111928, 0.08390586532998917, 0.04926453751571433, 0.18876995487466217, -0.04047897098542646, 0.17464719969930864, -0.13941871194875538, 0.08529207708725575, -0.03421215450412832] |
1,803.00758 | Driving Digital Rock towards Machine Learning: predicting permeability
with Gradient Boosting and Deep Neural Networks | We present a research study aimed at testing of applicability of machine
learning techniques for prediction of permeability of digitized rock samples.
We prepare a training set containing 3D images of sandstone samples imaged with
X-ray microtomography and corresponding permeability values simulated with Pore
Network approach. We also use Minkowski functionals and Deep Learning-based
descriptors of 3D images and 2D slices as input features for predictive model
training and prediction. We compare predictive power of various feature sets
and methods. The later include Gradient Boosting and various architectures of
Deep Neural Networks (DNN). The results demonstrate applicability of machine
learning for image-based permeability prediction and open a new area of Digital
Rock research.
| physics.geo-ph cs.CV physics.comp-ph | we present a research study aimed at testing of applicability of machine learning techniques for prediction of permeability of digitized rock samples we prepare a training set containing 3d images of sandstone samples imaged with xray microtomography and corresponding permeability values simulated with pore network approach we also use minkowski functionals and deep learningbased descriptors of 3d images and 2d slices as input features for predictive model training and prediction we compare predictive power of various feature sets and methods the later include gradient boosting and various architectures of deep neural networks dnn the results demonstrate applicability of machine learning for imagebased permeability prediction and open a new area of digital rock research | [['we', 'present', 'a', 'research', 'study', 'aimed', 'at', 'testing', 'of', 'applicability', 'of', 'machine', 'learning', 'techniques', 'for', 'prediction', 'of', 'permeability', 'of', 'digitized', 'rock', 'samples', 'we', 'prepare', 'a', 'training', 'set', 'containing', '3d', 'images', 'of', 'sandstone', 'samples', 'imaged', 'with', 'xray', 'microtomography', 'and', 'corresponding', 'permeability', 'values', 'simulated', 'with', 'pore', 'network', 'approach', 'we', 'also', 'use', 'minkowski', 'functionals', 'and', 'deep', 'learningbased', 'descriptors', 'of', '3d', 'images', 'and', '2d', 'slices', 'as', 'input', 'features', 'for', 'predictive', 'model', 'training', 'and', 'prediction', 'we', 'compare', 'predictive', 'power', 'of', 'various', 'feature', 'sets', 'and', 'methods', 'the', 'later', 'include', 'gradient', 'boosting', 'and', 'various', 'architectures', 'of', 'deep', 'neural', 'networks', 'dnn', 'the', 'results', 'demonstrate', 'applicability', 'of', 'machine', 'learning', 'for', 'imagebased', 'permeability', 'prediction', 'and', 'open', 'a', 'new', 'area', 'of', 'digital', 'rock', 'research']] | [0.03584025270486894, 0.010684595887334935, -0.038302749957872834, 0.038951767299456146, -0.074341376532545, -0.1585246042958337, 0.01676424166426656, 0.46430175322874456, -0.2348590738684005, -0.3389186763814527, 0.08748940612005061, -0.28814926216032655, -0.18931367744452657, 0.22909885057478946, -0.09138352728852656, 0.16919299841776544, 0.12303775751270947, -0.03656492063330602, -0.08705287683029882, -0.27012432531342406, 0.28637384176583947, 0.019212646042594306, 0.39984274987724766, 0.0016134872999602715, 0.148407666560724, -0.043730287611756506, -0.050665645246122, 0.05121739742663417, -0.1080684187220393, 0.20650592102232365, 0.3236715235475418, 0.20994945434210574, 0.3054894049635437, -0.4216076037393207, -0.26855969497422993, 0.05083530804191807, 0.10504048226599012, 0.09267036807187627, -0.07689069708978213, -0.31972867159782786, 0.06855724818707831, -0.12909119024633767, -0.03306574472514665, -0.17493005731530423, -0.02032122252389492, 0.004442765812216475, -0.2823292561075279, 0.05276634524534127, 0.021265476698929493, 0.1341256192530942, -0.14148620225126501, -0.15406436316949207, 0.03861282634820822, 0.16171011407406324, 0.014134474583917948, 0.02390536328621077, 0.18614756878036842, -0.24561429742427, -0.125387489152825, 0.35119203183041736, -0.030141285919394772, -0.15901969946854938, 0.18301929560679514, -0.048941273827402466, -0.1233258160754247, 0.11056369179612503, 0.323930876337783, 0.11043849664501253, -0.14823937999183492, 0.020396531943285393, -0.021819277775712905, 0.1525517456116056, 0.05892578612980062, -0.0436620193789095, 0.17910053476740698, 0.3077999610233376, -0.052837355067516655, 0.17699220042420238, -0.22420268502514973, 0.003530776276525143, -0.20834725818275351, -0.13989940571672885, -0.19542569477127586, -0.02064821729024427, -0.1346765669894382, -0.20222161097072922, 0.4093744534282096, 0.2230388134536622, 0.1890986201114359, 0.13141368817439122, 0.3359839837643755, -0.047884531650744765, 0.13037769270203678, 0.06615587595883196, 0.16165084550177794, 0.08731249634143526, 0.14877796484635467, -0.13479011537882177, 0.03127049829036129, 0.04812606074229146] |
1,803.00759 | Gauged Peccei-Quinn Symmetry - A Case of Simultaneous Breaking of SUSY
and PQ Symmetry | Recently, a simple prescription to embed the global Peccei-Quinn (PQ)
symmetry into a gauged $U(1)$ symmetry has been proposed. There, explicit
breaking of the global PQ symmetry expected in quantum gravity are highly
suppressed due to the gauged PQ symmetry. In this paper, we apply the gauged PQ
mechanism to models where the global PQ symmetry and supersymmetry (SUSY) are
simultaneously broken at around $\mathcal{O}(10^{11-12})$\,GeV. Such scenario
is motivated by an intriguing coincidence between the supersymmetry breaking
scale which explains the observed Higgs boson mass by the gravity mediated
sfermion masses, and the PQ breaking scale which evades all the astrophysical
and the cosmological constraints. As a concrete example, we construct a model
which consists of a simultaneous supersymmetry/PQ symmetry breaking sector
based on $SU(2)$ dynamics and an additional PQ symmetry breaking sector based
on $SU(N)$ dynamics. We also show that new vector-like particles are predicted
in the TeV range in the minimum model, which can be tested by the LHC
experiments.
| hep-ph | recently a simple prescription to embed the global pecceiquinn pq symmetry into a gauged u1 symmetry has been proposed there explicit breaking of the global pq symmetry expected in quantum gravity are highly suppressed due to the gauged pq symmetry in this paper we apply the gauged pq mechanism to models where the global pq symmetry and supersymmetry susy are simultaneously broken at around mathcalo101112gev such scenario is motivated by an intriguing coincidence between the supersymmetry breaking scale which explains the observed higgs boson mass by the gravity mediated sfermion masses and the pq breaking scale which evades all the astrophysical and the cosmological constraints as a concrete example we construct a model which consists of a simultaneous supersymmetrypq symmetry breaking sector based on su2 dynamics and an additional pq symmetry breaking sector based on sun dynamics we also show that new vectorlike particles are predicted in the tev range in the minimum model which can be tested by the lhc experiments | [['recently', 'a', 'simple', 'prescription', 'to', 'embed', 'the', 'global', 'pecceiquinn', 'pq', 'symmetry', 'into', 'a', 'gauged', 'u1', 'symmetry', 'has', 'been', 'proposed', 'there', 'explicit', 'breaking', 'of', 'the', 'global', 'pq', 'symmetry', 'expected', 'in', 'quantum', 'gravity', 'are', 'highly', 'suppressed', 'due', 'to', 'the', 'gauged', 'pq', 'symmetry', 'in', 'this', 'paper', 'we', 'apply', 'the', 'gauged', 'pq', 'mechanism', 'to', 'models', 'where', 'the', 'global', 'pq', 'symmetry', 'and', 'supersymmetry', 'susy', 'are', 'simultaneously', 'broken', 'at', 'around', 'mathcalo101112gev', 'such', 'scenario', 'is', 'motivated', 'by', 'an', 'intriguing', 'coincidence', 'between', 'the', 'supersymmetry', 'breaking', 'scale', 'which', 'explains', 'the', 'observed', 'higgs', 'boson', 'mass', 'by', 'the', 'gravity', 'mediated', 'sfermion', 'masses', 'and', 'the', 'pq', 'breaking', 'scale', 'which', 'evades', 'all', 'the', 'astrophysical', 'and', 'the', 'cosmological', 'constraints', 'as', 'a', 'concrete', 'example', 'we', 'construct', 'a', 'model', 'which', 'consists', 'of', 'a', 'simultaneous', 'supersymmetrypq', 'symmetry', 'breaking', 'sector', 'based', 'on', 'su2', 'dynamics', 'and', 'an', 'additional', 'pq', 'symmetry', 'breaking', 'sector', 'based', 'on', 'sun', 'dynamics', 'we', 'also', 'show', 'that', 'new', 'vectorlike', 'particles', 'are', 'predicted', 'in', 'the', 'tev', 'range', 'in', 'the', 'minimum', 'model', 'which', 'can', 'be', 'tested', 'by', 'the', 'lhc', 'experiments']] | [-0.15673888579185585, 0.22998781380756556, -0.029675725561992293, 0.16747039793408475, -0.11927174582961016, -0.18217785030137748, -0.02385325796858524, 0.30363277208962247, -0.22358899297832976, -0.32874325693410356, 0.1100736806052737, -0.22219221014820506, -0.11248174784850562, 0.06593914884433616, 0.007436826158664189, 0.05555313667282462, -0.08384987597819418, 0.007844413409475236, -0.07579591977264499, -0.21897807981949882, 0.29052531129855197, 0.012424301435021334, 0.24852278434555047, 0.060508705658139664, 0.09770592927161488, -0.04472052350174636, 0.06499717582191807, -0.08322638439713045, -0.1102655543700621, 0.07759096497902647, 0.13886767934702676, 0.06732613544591004, 0.08900887763593346, -0.4238921250333078, -0.2237264001974836, 0.1804378304979764, 0.1772080171678681, 0.14235833309794543, -0.13653402866475517, -0.3626575618895004, 0.09809767007391201, -0.19581450297264383, -0.11034815212478861, -0.08440193793649087, -0.03648103528248612, -0.15454388693906368, -0.3349824626988266, 0.10098038873529731, -0.0008191634058675845, 0.0516168141621165, -0.02335285489280068, -0.030442861129995436, -0.1300960655353265, -0.013758381638035643, 0.20991059484367725, 0.016949316288810225, 0.117424925861269, -0.1670621152341482, -0.1675875961984275, 0.45199556471779945, -0.022725616942625492, -0.16477757656393804, 0.14262105699745006, -0.09891011882173188, -0.23912043378513773, 0.10427582443808206, 0.16558622581651433, 0.08659310068469495, -0.11363483326422283, 0.20799618931487202, -0.08555509786965558, 0.188256455026567, 0.043446914771629964, 0.004482046459452249, 0.2928989325824659, 0.17101249367697163, 0.07463682055531536, 0.08024894635673263, -0.024072769387203152, -0.11870449110647315, -0.43711990882220564, -0.07977966594626196, -0.13729883042469737, 0.053353020826762076, -0.08062624540361867, -0.033426848362432794, 0.4201934628712479, 0.14499113160709384, 0.25127853732265065, 0.022999306525161956, 0.22145405615883645, 0.08410009414583328, 0.1545228183735162, 0.029620242124656214, 0.2831648338818923, 0.06762125397435739, 0.05251338711823337, -0.26492912373796573, -0.08825332058477216, 0.139427014285684] |
1,803.0076 | On large values of $L(\sigma,\chi)$ | In recent years a variant of the resonance method was developed which allowed
to obtain improved $\Omega$-results for the Riemann zeta function along
vertical lines in the critical strip. In the present paper we show how this
method can be adapted to prove the existence of large values of $|L(\sigma,
\chi)|$ in the range $\sigma \in (1/2,1]$, and to estimate the proportion of
characters for which $|L(\sigma, \chi)|$ is of such a large order. More
precisely, for every fixed $\sigma \in (1/2,1)$ we show that for all
sufficiently large $q$ there is a non-principal character $\chi$ (mod $q$) such
that $\log |L(\sigma,\chi)| \geq C(\sigma) (\log q)^{1-\sigma} (\log \log
q)^{-\sigma}$. In the case $\sigma=1$ we show that there is a non-principal
character $\chi$ (mod $q$) for which $|L(1,\chi)| \geq e^\gamma \left(\log_2 q
+ \log_3 q - C \right)$. In both cases, our results essentially match the
prediction for the actual order of such extreme values, based on probabilistic
models.
| math.NT | in recent years a variant of the resonance method was developed which allowed to obtain improved omegaresults for the riemann zeta function along vertical lines in the critical strip in the present paper we show how this method can be adapted to prove the existence of large values of lsigma chi in the range sigma in 121 and to estimate the proportion of characters for which lsigma chi is of such a large order more precisely for every fixed sigma in 121 we show that for all sufficiently large q there is a nonprincipal character chi mod q such that log lsigmachi geq csigma log q1sigma log log qsigma in the case sigma1 we show that there is a nonprincipal character chi mod q for which l1chi geq egamma leftlog_2 q log_3 q c right in both cases our results essentially match the prediction for the actual order of such extreme values based on probabilistic models | [['in', 'recent', 'years', 'a', 'variant', 'of', 'the', 'resonance', 'method', 'was', 'developed', 'which', 'allowed', 'to', 'obtain', 'improved', 'omegaresults', 'for', 'the', 'riemann', 'zeta', 'function', 'along', 'vertical', 'lines', 'in', 'the', 'critical', 'strip', 'in', 'the', 'present', 'paper', 'we', 'show', 'how', 'this', 'method', 'can', 'be', 'adapted', 'to', 'prove', 'the', 'existence', 'of', 'large', 'values', 'of', 'lsigma', 'chi', 'in', 'the', 'range', 'sigma', 'in', '121', 'and', 'to', 'estimate', 'the', 'proportion', 'of', 'characters', 'for', 'which', 'lsigma', 'chi', 'is', 'of', 'such', 'a', 'large', 'order', 'more', 'precisely', 'for', 'every', 'fixed', 'sigma', 'in', '121', 'we', 'show', 'that', 'for', 'all', 'sufficiently', 'large', 'q', 'there', 'is', 'a', 'nonprincipal', 'character', 'chi', 'mod', 'q', 'such', 'that', 'log', 'lsigmachi', 'geq', 'csigma', 'log', 'q1sigma', 'log', 'log', 'qsigma', 'in', 'the', 'case', 'sigma1', 'we', 'show', 'that', 'there', 'is', 'a', 'nonprincipal', 'character', 'chi', 'mod', 'q', 'for', 'which', 'l1chi', 'geq', 'egamma', 'leftlog_2', 'q', 'log_3', 'q', 'c', 'right', 'in', 'both', 'cases', 'our', 'results', 'essentially', 'match', 'the', 'prediction', 'for', 'the', 'actual', 'order', 'of', 'such', 'extreme', 'values', 'based', 'on', 'probabilistic', 'models']] | [-0.14518204845984167, 0.10660383056457766, -0.05004449830134856, 0.06507415097553794, -0.030320471747674875, -0.14927706077506195, 0.04726744993373727, 0.3301572086459963, -0.2370254656245165, -0.28803836257239573, 0.06616867576220553, -0.28002875280609124, -0.12884955302229323, 0.23350691843132665, -0.05338055037534217, 0.04256712403502224, 0.033179190169618115, 0.10692710743979643, -0.04766743493363797, -0.2565329495172193, 0.29477281748466316, -0.05563153812868728, 0.1898351078282348, 0.047321970471077494, 0.051041398568724104, 0.020407533790502284, 0.04821673300865965, -0.02190296598047437, -0.19114670054936664, 0.09782848265509006, 0.2576206961864337, 0.06646303461371537, 0.22927730867191784, -0.31102158767045657, -0.1542877656745487, 0.19301648349409886, 0.15676066384717724, -0.0029685088118319124, 0.010439829345700464, -0.20009573085625043, 0.1971834180572259, -0.15767290994062338, -0.12764071568761484, -0.06278272857661267, 0.13597633673815557, -0.0033539954064645216, -0.35418891423424476, 0.07028092162111421, 0.0950348421100381, 0.070920125733501, -0.03940272627374023, -0.18611171133256993, 0.008578793713335996, 0.07599335646841164, 0.04857549727042175, 0.10651985491972928, 0.039315391842845, -0.15247819147048383, -0.04780011011129306, 0.3429031941211886, -0.12165667329537469, -0.1879936924593803, 0.1246593886867677, -0.20848911871001416, -0.1786207939297253, 0.09017668900025241, 0.12741829263460305, 0.173427996864798, -0.005188775181867718, 0.16085747304620537, -0.08910037754286154, 0.2105730691912517, 0.08318587288479595, -0.047544069714491176, 0.13554883895600153, 0.07414103007808424, 0.051639077201138674, 0.09486090499425331, -0.10600736345928406, 0.004568958335428261, -0.34235911689138687, -0.19450235742089503, -0.15459521102880316, 0.0895318969304474, -0.1407176523675398, -0.14158608469795558, 0.3271729312593641, 0.15076407778618578, 0.26406134990062197, 0.10174577620133052, 0.19375381595607288, 0.14624160258297267, 0.048250579875528665, 0.10319657742161474, 0.15514802226372174, 0.1003634518554915, 0.02411511657741286, -0.17357797102296565, 0.03442088191114439, 0.07274914726468862] |
1,803.00761 | Investigation of Noise Limitation Standardization and Evaluating the Low
Frequency Noise's Influence on Human Performance using Online Psychoacoustic
Test | A lot of research has been carried out to find out the influence of low
frequency noise on human behavior. Based on currently available results, some
countries have been developing National Standard to limit the low frequency
noise to protect people's health and working performance. However, after
investigating 28 National Standards about noise limitation of working machine
and other noise emission standards of China, it is found that the stipulation
of low frequency noise covers limited aspects. Most of the limitation used
A-weight sound level as the evaluation index, which only presents the loudness
perception of sound, not its influence. In this paper, two connected topics are
presented. One is to investigate the Chinese National Standard and
International Standard, in order to summarize all the noise limitation on low
frequency noise. The second topic is the application of online psychoacoustic
test to evaluate the influence of low frequency noise on human performance,
which can enlarge the subjective testing sample size in order to facilitate the
establishment of related National Standard. The online Hass effect experiment
is repeated to verify the accuracy of online psychoacoustic test. The
volunteers are asked to conduct several sessions of the colour identification
problems under different kind of controlled noise. The accuracy and finishing
time are taken into consideration to evaluate their performance under different
kinds of noise. The results show that low frequency noise does affect humans'
working performance and the existing Chinese Noise limitation Standards are
inadequate in low frequency noise limitation.
| physics.med-ph | a lot of research has been carried out to find out the influence of low frequency noise on human behavior based on currently available results some countries have been developing national standard to limit the low frequency noise to protect peoples health and working performance however after investigating 28 national standards about noise limitation of working machine and other noise emission standards of china it is found that the stipulation of low frequency noise covers limited aspects most of the limitation used aweight sound level as the evaluation index which only presents the loudness perception of sound not its influence in this paper two connected topics are presented one is to investigate the chinese national standard and international standard in order to summarize all the noise limitation on low frequency noise the second topic is the application of online psychoacoustic test to evaluate the influence of low frequency noise on human performance which can enlarge the subjective testing sample size in order to facilitate the establishment of related national standard the online hass effect experiment is repeated to verify the accuracy of online psychoacoustic test the volunteers are asked to conduct several sessions of the colour identification problems under different kind of controlled noise the accuracy and finishing time are taken into consideration to evaluate their performance under different kinds of noise the results show that low frequency noise does affect humans working performance and the existing chinese noise limitation standards are inadequate in low frequency noise limitation | [['a', 'lot', 'of', 'research', 'has', 'been', 'carried', 'out', 'to', 'find', 'out', 'the', 'influence', 'of', 'low', 'frequency', 'noise', 'on', 'human', 'behavior', 'based', 'on', 'currently', 'available', 'results', 'some', 'countries', 'have', 'been', 'developing', 'national', 'standard', 'to', 'limit', 'the', 'low', 'frequency', 'noise', 'to', 'protect', 'peoples', 'health', 'and', 'working', 'performance', 'however', 'after', 'investigating', '28', 'national', 'standards', 'about', 'noise', 'limitation', 'of', 'working', 'machine', 'and', 'other', 'noise', 'emission', 'standards', 'of', 'china', 'it', 'is', 'found', 'that', 'the', 'stipulation', 'of', 'low', 'frequency', 'noise', 'covers', 'limited', 'aspects', 'most', 'of', 'the', 'limitation', 'used', 'aweight', 'sound', 'level', 'as', 'the', 'evaluation', 'index', 'which', 'only', 'presents', 'the', 'loudness', 'perception', 'of', 'sound', 'not', 'its', 'influence', 'in', 'this', 'paper', 'two', 'connected', 'topics', 'are', 'presented', 'one', 'is', 'to', 'investigate', 'the', 'chinese', 'national', 'standard', 'and', 'international', 'standard', 'in', 'order', 'to', 'summarize', 'all', 'the', 'noise', 'limitation', 'on', 'low', 'frequency', 'noise', 'the', 'second', 'topic', 'is', 'the', 'application', 'of', 'online', 'psychoacoustic', 'test', 'to', 'evaluate', 'the', 'influence', 'of', 'low', 'frequency', 'noise', 'on', 'human', 'performance', 'which', 'can', 'enlarge', 'the', 'subjective', 'testing', 'sample', 'size', 'in', 'order', 'to', 'facilitate', 'the', 'establishment', 'of', 'related', 'national', 'standard', 'the', 'online', 'hass', 'effect', 'experiment', 'is', 'repeated', 'to', 'verify', 'the', 'accuracy', 'of', 'online', 'psychoacoustic', 'test', 'the', 'volunteers', 'are', 'asked', 'to', 'conduct', 'several', 'sessions', 'of', 'the', 'colour', 'identification', 'problems', 'under', 'different', 'kind', 'of', 'controlled', 'noise', 'the', 'accuracy', 'and', 'finishing', 'time', 'are', 'taken', 'into', 'consideration', 'to', 'evaluate', 'their', 'performance', 'under', 'different', 'kinds', 'of', 'noise', 'the', 'results', 'show', 'that', 'low', 'frequency', 'noise', 'does', 'affect', 'humans', 'working', 'performance', 'and', 'the', 'existing', 'chinese', 'noise', 'limitation', 'standards', 'are', 'inadequate', 'in', 'low', 'frequency', 'noise', 'limitation']] | [-0.09778137538517988, 0.08236978217951862, -0.06052093684054941, 0.0797194477000089, -0.1197961481930952, -0.11865379374760848, 0.07440271761564364, 0.38306232042203425, -0.2126683403784032, -0.3399726247135927, 0.13662596728449106, -0.2767268576495951, -0.11575244450451512, 0.23916320425839077, -0.15367250939876384, 0.0661043887130769, 0.06002568066457611, 0.05444269612439067, -0.012109641524914064, -0.2885466998269563, 0.2712895963265587, 0.12055645507914937, 0.4091115143830673, 0.04167860540088176, 0.0806794417979618, -0.052820302555450664, -0.10339286896260644, -0.013820835581494247, -0.04846281636637581, 0.0792371359001468, 0.32410030672138157, 0.13618513415963482, 0.3527468143687075, -0.3987676809004992, -0.20496796904723744, 0.08258760670154744, 0.07165823292424563, 0.05455427882186163, -0.01135882326007749, -0.3081855268419347, 0.07720322865353678, -0.17651267205308444, -0.07143557223638422, -0.05928443910252173, -0.01680936783491841, 0.02036106948192167, -0.2200414809772579, 0.04939051107871101, 0.05502952145445439, 0.1172856706268105, -0.009319188867446775, -0.16107315671920536, 0.04613967301316469, 0.23783219708054354, 0.07763706641563926, -0.026353312723563893, 0.18024431171860952, -0.13960048276406709, -0.12023031155612728, 0.3827919706321408, -0.06605746760975706, -0.1647110693340533, 0.21325016864349214, -0.15945305549285113, -0.13231783383620171, 0.09660741020944195, 0.21382213600883865, 0.020432934572218883, -0.17197473643327355, 0.034030089014976166, 0.05042963912748253, 0.22264967746217265, 0.11382526435666843, 0.059199772520661956, 0.1604478647564783, 0.20880315352517825, 0.018539973735424733, 0.12615681000205647, -0.12563433394831444, -0.06378456512027748, -0.22732190000504135, -0.08171554898790381, -0.16104433224498774, 0.007271769505641273, -0.030253119545841218, -0.1418632033982348, 0.3924712903518607, 0.2286161305552522, 0.11309131509002283, 0.017526422441453457, 0.34459705948537434, 0.07171012403260585, 0.05317666396585403, 0.04208966042857753, 0.24467880030783357, 0.05021718039077439, 0.12558610766457048, -0.22866210008432677, 0.08932938892582831, -0.04043618765346676] |
1,803.00762 | On order automorphisms of the effect algebra | We give short proofs of two \v{S}emrl's descriptions of order automorphisms
of the effect algebra. This sheds new light on both formulas that look quite
complicated. Our proofs rely on Moln\'{a}r's characterization of order
automorphisms of the cone of all positive operators.
| math.FA | we give short proofs of two vsemrls descriptions of order automorphisms of the effect algebra this sheds new light on both formulas that look quite complicated our proofs rely on molnars characterization of order automorphisms of the cone of all positive operators | [['we', 'give', 'short', 'proofs', 'of', 'two', 'vsemrls', 'descriptions', 'of', 'order', 'automorphisms', 'of', 'the', 'effect', 'algebra', 'this', 'sheds', 'new', 'light', 'on', 'both', 'formulas', 'that', 'look', 'quite', 'complicated', 'our', 'proofs', 'rely', 'on', 'molnars', 'characterization', 'of', 'order', 'automorphisms', 'of', 'the', 'cone', 'of', 'all', 'positive', 'operators']] | [-0.19191216340958617, 0.07033733074076293, -0.14750948532416328, 0.09192425622207272, -0.17306677882968471, -0.12418379157599879, 0.0326445048175207, 0.3096502434189727, -0.2325782167111955, -0.24762761017035056, 0.13470008254914387, -0.27503229598174006, -0.1582515049191964, 0.2659132953097181, -0.09184920527544951, -0.04474358101625268, 0.04941523678191915, 0.03512604043978017, -0.13475663505108437, -0.28103221135168543, 0.415439926792027, -0.06744521851764947, 0.20251356637695941, 0.14986167925341828, 0.08349705215475363, 0.04625999222640175, -0.09840503330456048, -0.05848932070884763, -0.1571199334087773, 0.1622525670838247, 0.21264503269297322, 0.10238475591035151, 0.18122093979178405, -0.47047956260602647, -0.11269619023972531, 0.117485273265984, 0.12082380557251049, 0.08171458901246874, -0.07090917059856398, -0.25670837715449857, 0.037731474208668236, -0.10996686580886202, -0.13025961207543932, -0.1405276241825848, 0.0032236789603058884, 0.02058418785653463, -0.16560271039332558, -0.010869497967111627, 0.2219416715613589, 0.12517082116498454, -0.053036162709226696, -0.17067494200224556, 0.009728653276929768, 0.1058357314365666, 0.03390972448013178, -0.0637017289295838, 0.07100141658334107, -0.06104649661858452, -0.1578493940121517, 0.36921993861111196, -0.010424295394175982, -0.179835196448172, 0.16781262439539338, -0.20965794119529607, -0.1627949360848927, 0.08775955115632358, 0.16835789723185504, 0.23558183743550284, -0.07999017434876139, 0.10577390892658292, -0.10128568514908959, 0.12128486243508212, 0.08048563868534274, 0.12442670232139347, 0.11981624900931265, 0.09543588337284035, 0.061861875239850546, 0.13943834979904862, 0.06925511538482658, -0.07139982445528958, -0.386309650431319, -0.14692234983894883, -0.07457157710805626, 0.11057472751453155, -0.12433636526963333, -0.2147885889905255, 0.450980991761132, 0.17395834965495074, 0.1926907541730055, 0.1358338395678779, 0.2582029737532139, 0.06076791697670138, 0.06648672653771029, 0.01859975641979495, 0.15581246760741965, 0.19549808864731613, 0.022055745209998836, -0.14628023297594087, 0.06345141055516718, 0.2114361376138177] |
1,803.00763 | Tingley's problem for $p$-Schatten von Neumann classes | Let $H$ and $H'$ be a complex Hilbert spaces. For $p\in(1,
\infty)\backslash\{2\}$ we consider the Banach space $C_p(H)$ of all
$p$-Schatten von Neumann operators, whose unit sphere is denoted by
$S(C_p(H))$. We prove that every surjective isometry $\Delta: S(C_p(H))\to
S(C_p(H'))$ can be extended to a complex linear or to a conjugate linear
surjective isometry $T:C_p(H)\to C_p(H')$.
| math.FA math.OA | let h and h be a complex hilbert spaces for pin1 inftybackslash2 we consider the banach space c_ph of all pschatten von neumann operators whose unit sphere is denoted by sc_ph we prove that every surjective isometry delta sc_phto sc_ph can be extended to a complex linear or to a conjugate linear surjective isometry tc_phto c_ph | [['let', 'h', 'and', 'h', 'be', 'a', 'complex', 'hilbert', 'spaces', 'for', 'pin1', 'inftybackslash2', 'we', 'consider', 'the', 'banach', 'space', 'c_ph', 'of', 'all', 'pschatten', 'von', 'neumann', 'operators', 'whose', 'unit', 'sphere', 'is', 'denoted', 'by', 'sc_ph', 'we', 'prove', 'that', 'every', 'surjective', 'isometry', 'delta', 'sc_phto', 'sc_ph', 'can', 'be', 'extended', 'to', 'a', 'complex', 'linear', 'or', 'to', 'a', 'conjugate', 'linear', 'surjective', 'isometry', 'tc_phto', 'c_ph']] | [-0.15306357252320238, 0.1758795830914203, -0.007859424746129662, 0.038247628687588756, -0.14223353138796108, -0.22373425767884828, -0.04929531397361893, 0.37673009906018917, -0.3983459133727878, -0.07738676930175108, 0.1677583128250405, -0.29666944759368313, -0.11348778586469445, 0.1572309078822168, -0.1570189503733726, 0.03226662264662046, 0.06355432628233935, 0.12947118629281426, -0.15709040101672359, -0.23968195378798626, 0.39410409661849927, -0.08938081323297001, 0.11161264245781828, -0.004317052561935841, 0.1314063102153002, 0.04084667450218808, 0.03773323924043307, 0.05300115829039201, -0.17765776128762095, 0.08165640060735099, 0.332857465408012, 0.10771664784874256, 0.29491914607876657, -0.32942136403289624, -0.1848915502036392, 0.3458680462859133, 0.13413335625812703, -0.14779470937655254, 0.04049794005650077, -0.31117066580290886, 0.07504622423199608, -0.1133697721376723, -0.08890397871351417, -0.11615791558927181, 0.08878674686831586, -0.05532239850920936, -0.3565120064817807, 0.013238842306914283, 0.13233891779593393, 0.07362995095843193, -0.07164456080827936, -0.05766759146297095, -0.11552247978454712, 0.011172098924825881, -0.1550853168934255, 0.13910269944508577, 0.10496820137703645, 0.06154636030688005, -0.08524818654519085, 0.38062050777907463, -0.08357013752752476, -0.3134765241514234, 0.09254835578886901, -0.22543323689195163, -0.14440514836642965, 0.05231631759042833, 0.09225819818675518, 0.1348612764302422, -0.02270755429259118, 0.3113866302483788, -0.15397957423884495, 0.12453008108936689, 0.06817213476945956, -0.006863880907094069, 0.03747904346342765, 0.0211624889908468, 0.17908203071348516, 0.15243491836750478, 0.08595042375336383, 0.03322126276850445, -0.33125415093758526, -0.22064999196742313, -0.15908099170637263, 0.19537111300536814, -0.1166707201876253, -0.18377280330248907, 0.29453915026148453, -0.04411509887808386, 0.21061775322053947, 0.11901890745788228, 0.16059240491549467, 0.11468396175141428, 0.06855167043121423, 0.10720124129461599, 0.09037760128358416, 0.236259525062005, -0.06487603518454467, -0.15809947339014388, -0.08222272726433243, 0.2560480329591562] |
1,803.00764 | Aspl{\"u}nd's metric defined in the Logarithmic Image Processing (LIP)
framework for colour and multivariate images | Aspl{\"u}nd's metric, which is useful for pattern matching, consists in a
double-sided probing, i.e. the over-graph and the sub-graph of a function are
probed jointly. It has previously been defined for grey-scale images using the
Logarithmic Image Processing (LIP) framework. LIP is a non-linear model to
perform operations between images while being consistent with the human visual
system. Our contribution consists in extending the Aspl{\"u}nd's metric to
colour and multivariate images using the LIP framework. Aspl{\"u}nd's metric is
insensitive to lighting variations and we propose a colour variant which is
robust to noise.
| cs.CV | asplunds metric which is useful for pattern matching consists in a doublesided probing ie the overgraph and the subgraph of a function are probed jointly it has previously been defined for greyscale images using the logarithmic image processing lip framework lip is a nonlinear model to perform operations between images while being consistent with the human visual system our contribution consists in extending the asplunds metric to colour and multivariate images using the lip framework asplunds metric is insensitive to lighting variations and we propose a colour variant which is robust to noise | [['asplunds', 'metric', 'which', 'is', 'useful', 'for', 'pattern', 'matching', 'consists', 'in', 'a', 'doublesided', 'probing', 'ie', 'the', 'overgraph', 'and', 'the', 'subgraph', 'of', 'a', 'function', 'are', 'probed', 'jointly', 'it', 'has', 'previously', 'been', 'defined', 'for', 'greyscale', 'images', 'using', 'the', 'logarithmic', 'image', 'processing', 'lip', 'framework', 'lip', 'is', 'a', 'nonlinear', 'model', 'to', 'perform', 'operations', 'between', 'images', 'while', 'being', 'consistent', 'with', 'the', 'human', 'visual', 'system', 'our', 'contribution', 'consists', 'in', 'extending', 'the', 'asplunds', 'metric', 'to', 'colour', 'and', 'multivariate', 'images', 'using', 'the', 'lip', 'framework', 'asplunds', 'metric', 'is', 'insensitive', 'to', 'lighting', 'variations', 'and', 'we', 'propose', 'a', 'colour', 'variant', 'which', 'is', 'robust', 'to', 'noise']] | [-0.04277415836796812, 0.009354453657895489, -0.11609257706542216, 0.07592635705773516, -0.08283825042536078, -0.16162999285860796, -0.01594313807278092, 0.45991989609825873, -0.2585785100641458, -0.33340082264950743, 0.08487944135128561, -0.29276612964863685, -0.17684045214327457, 0.16338888543364388, -0.1889395964440748, 0.08794001043450249, 0.01622788449165692, 0.029837386715529567, -0.025245273306095245, -0.19875361871875255, 0.2978435830800268, 0.02674494577197196, 0.30040527086543, -0.010433400955820538, 0.15131592346638764, 0.006721376335126874, -0.06980456662953972, 0.029438728856368234, -0.024391738217040573, 0.12941934004471556, 0.2281008358164083, 0.14841151778059808, 0.2165708852091642, -0.3451071655802915, -0.20475761604788917, 0.09660563681213914, 0.10083525896619033, 0.08540455347342092, -0.05224197821529663, -0.3425675053453154, 0.11612029467790347, -0.06302881598189149, -0.005999800718753882, -0.07854001450924324, 0.0325032016502835, -0.07719396240060197, -0.34026026158877043, 0.06976504040801007, 0.06455539837517553, 0.056675156861867595, -0.027526317908347624, -0.04347025654050927, 0.021693845838814486, 0.16931939368520904, -0.023968014057533328, 0.13637452986617776, 0.1420562742733518, -0.1498190897375183, -0.0780196447816232, 0.39173397492698353, -0.08153057506095375, -0.20609959567208652, 0.16024893102155108, -0.0932171909447314, -0.10105292002528744, 0.10083423986140153, 0.14908233103241122, 0.136822518011879, -0.1938566724749525, 0.060057313068208044, -0.040190617599443576, 0.19975198825704865, 0.07526565274810823, 0.03398686116460063, 0.19200689819357966, 0.22031268490599873, 0.0685542186661421, 0.1995453688154078, -0.13955661500601665, -0.038831119982363736, -0.23843601000566117, -0.11041664109443841, -0.15128439517043854, -0.053770476861087525, -0.11312170180383913, -0.1681470748077592, 0.43364936688348005, 0.1295700708059999, 0.22968161134201143, 0.07348482010369796, 0.34008459016964165, 0.075556867235244, 0.13431834700294648, 0.04466429352760315, 0.18833450718438657, 0.0843995965070739, 0.07131938757020576, -0.154600550805259, 0.09930249368873141, 0.07379412037603882] |
1,803.00765 | Objectivity (or lack there of): a comparison between predictions of
quantum Darwinism and spectrum broadcast structure | Quantum Darwinism and spectrum broadcast structure describe the emergence of
objectivity in quantum systems. However, it is unclear whether these two
frameworks lead to consistent predictions on the objectivity of the state of a
quantum system in a given scenario. In this paper, we jointly investigate
quantum Darwinism and spectrum broadcasting, as well as the subdivision of
quantum Darwinism into accessible information and quantum discord, in a
two-level system interacting with an $N$-level environment via a random matrix
coupling. We propose a novel partial trace method to suitably and consistently
partition the effective $N$-level environment, and compare the predictions with
those obtained using the partitioning method proposed by Perez [Phys. Rev. A
81, 052326 (2010)]. We find that Quantum Darwinism can apparently emerge under
the Perez trace even when spectrum broadcast structure does not emerge, and the
majority of the quantum mutual information between system and environment
fractions is in fact quantum in nature. This work therefore shows there can be
discrepancies between quantum Darwinism, and the nature of information and
spectrum broadcast structure.
| quant-ph | quantum darwinism and spectrum broadcast structure describe the emergence of objectivity in quantum systems however it is unclear whether these two frameworks lead to consistent predictions on the objectivity of the state of a quantum system in a given scenario in this paper we jointly investigate quantum darwinism and spectrum broadcasting as well as the subdivision of quantum darwinism into accessible information and quantum discord in a twolevel system interacting with an nlevel environment via a random matrix coupling we propose a novel partial trace method to suitably and consistently partition the effective nlevel environment and compare the predictions with those obtained using the partitioning method proposed by perez phys rev a 81 052326 2010 we find that quantum darwinism can apparently emerge under the perez trace even when spectrum broadcast structure does not emerge and the majority of the quantum mutual information between system and environment fractions is in fact quantum in nature this work therefore shows there can be discrepancies between quantum darwinism and the nature of information and spectrum broadcast structure | [['quantum', 'darwinism', 'and', 'spectrum', 'broadcast', 'structure', 'describe', 'the', 'emergence', 'of', 'objectivity', 'in', 'quantum', 'systems', 'however', 'it', 'is', 'unclear', 'whether', 'these', 'two', 'frameworks', 'lead', 'to', 'consistent', 'predictions', 'on', 'the', 'objectivity', 'of', 'the', 'state', 'of', 'a', 'quantum', 'system', 'in', 'a', 'given', 'scenario', 'in', 'this', 'paper', 'we', 'jointly', 'investigate', 'quantum', 'darwinism', 'and', 'spectrum', 'broadcasting', 'as', 'well', 'as', 'the', 'subdivision', 'of', 'quantum', 'darwinism', 'into', 'accessible', 'information', 'and', 'quantum', 'discord', 'in', 'a', 'twolevel', 'system', 'interacting', 'with', 'an', 'nlevel', 'environment', 'via', 'a', 'random', 'matrix', 'coupling', 'we', 'propose', 'a', 'novel', 'partial', 'trace', 'method', 'to', 'suitably', 'and', 'consistently', 'partition', 'the', 'effective', 'nlevel', 'environment', 'and', 'compare', 'the', 'predictions', 'with', 'those', 'obtained', 'using', 'the', 'partitioning', 'method', 'proposed', 'by', 'perez', 'phys', 'rev', 'a', '81', '052326', '2010', 'we', 'find', 'that', 'quantum', 'darwinism', 'can', 'apparently', 'emerge', 'under', 'the', 'perez', 'trace', 'even', 'when', 'spectrum', 'broadcast', 'structure', 'does', 'not', 'emerge', 'and', 'the', 'majority', 'of', 'the', 'quantum', 'mutual', 'information', 'between', 'system', 'and', 'environment', 'fractions', 'is', 'in', 'fact', 'quantum', 'in', 'nature', 'this', 'work', 'therefore', 'shows', 'there', 'can', 'be', 'discrepancies', 'between', 'quantum', 'darwinism', 'and', 'the', 'nature', 'of', 'information', 'and', 'spectrum', 'broadcast', 'structure']] | [-0.14076504032692813, 0.13195425528177326, -0.10702494980708152, 0.04462060817676149, -0.01606946235597995, -0.17360652142844965, 0.06821794549038235, 0.33683468880013406, -0.2527813012173367, -0.30618668582715697, 0.03162152865616271, -0.2564931256599681, -0.21212505425644146, 0.14816905730242458, -0.08919131620706333, 0.05118968743141848, 0.059911292510623965, 0.036303017394767934, -0.025436560787540467, -0.22866034388913628, 0.30611775192092955, 0.07783471823756104, 0.2994275597769315, 0.057671997226125996, 0.06642729985511545, 0.036166123629983706, 0.01698672351012857, 0.019734702877178142, -0.09088418971784339, 0.07967989845066789, 0.25526212365635687, 0.17462415867781192, 0.23087626618516197, -0.40408510650168955, -0.22848148677347369, 0.09298447676735118, 0.11786543868745898, 0.14328584460154004, -0.02701145743027954, -0.34696162378447765, 0.04170850442717056, -0.21800283921311872, -0.06300813765830302, -0.08623444769569172, -0.012455295608513531, -0.07094668727193157, -0.24315934313825907, 0.10360753928318571, 0.06782947164742179, 0.046133095375665956, -0.012679511514314682, -0.014539806792011882, 0.03542414264561006, 0.13904536041687512, -0.06926329538220745, 0.00016672541104752376, 0.11261342871514272, -0.1208890135469981, -0.1674263941587051, 0.39454758475195467, -0.04492492193216189, -0.1774217102735847, 0.20990367948664407, -0.12001252623619457, -0.1178032171480476, 0.04405824062172216, 0.1345057181874021, 0.0711812648257359, -0.17244573290107537, 0.1032617108144722, -0.03465530195951763, 0.17877993828245584, 0.024390831257275848, 0.13888924179404888, 0.22695324362142583, 0.10029359045438468, 0.0188562329939292, 0.15119876419907338, -0.017912532505713875, -0.216418729591684, -0.27707293769277397, -0.1915294799955045, -0.22377850373431696, 0.09671711231148843, -0.031051251766856656, -0.14066053026038183, 0.3789169793959298, 0.172050410800888, 0.21517323472973154, 0.01316391740457257, 0.2800620627035037, 0.09735123247494976, 0.013295715013949598, 0.1272343504955895, 0.217522741774517, 0.17571594868248297, 0.10089302358265988, -0.24582965577807211, 0.07213794043276868, 0.028141030367474593] |
1,803.00766 | A test of reality using quantum entanglement in J/{\psi} $\to$
{\Lambda}$\bar{\Lambda}$ | Quantum mechanics (QM) has been criticized for its violation of locality and
reality since it was put forward. A series of hidden variable theories (HVTs)
were evolved to ensure reality. In this paper, a new method to distinguish QM
and HVTs is proposed. The angle between two decay planes is introduced as the
observable and the distribution of it under two conditions is deduced. The
feasibility to test it on BESIII experiment is discussed.
| quant-ph hep-ex | quantum mechanics qm has been criticized for its violation of locality and reality since it was put forward a series of hidden variable theories hvts were evolved to ensure reality in this paper a new method to distinguish qm and hvts is proposed the angle between two decay planes is introduced as the observable and the distribution of it under two conditions is deduced the feasibility to test it on besiii experiment is discussed | [['quantum', 'mechanics', 'qm', 'has', 'been', 'criticized', 'for', 'its', 'violation', 'of', 'locality', 'and', 'reality', 'since', 'it', 'was', 'put', 'forward', 'a', 'series', 'of', 'hidden', 'variable', 'theories', 'hvts', 'were', 'evolved', 'to', 'ensure', 'reality', 'in', 'this', 'paper', 'a', 'new', 'method', 'to', 'distinguish', 'qm', 'and', 'hvts', 'is', 'proposed', 'the', 'angle', 'between', 'two', 'decay', 'planes', 'is', 'introduced', 'as', 'the', 'observable', 'and', 'the', 'distribution', 'of', 'it', 'under', 'two', 'conditions', 'is', 'deduced', 'the', 'feasibility', 'to', 'test', 'it', 'on', 'besiii', 'experiment', 'is', 'discussed']] | [-0.08668053231982363, 0.12887185245022378, -0.15640139184590127, 0.11843644716695102, -0.08848125449495038, -0.19370404705782798, 0.009062808030599577, 0.3418971287791391, -0.21343943957440756, -0.3022764241826293, 0.07777198157241769, -0.25606927616723085, -0.11171986837242101, 0.16329300336892139, -0.0729405844483424, 0.13379276113354954, 0.032375995195596606, 0.023445967622604723, -0.044365281711105965, -0.2538454645640544, 0.2881473287282436, 0.0772967726492474, 0.2997709670185892, 0.07227248241542839, 0.11254925106501056, -0.010954161986356249, -0.0006122727865806302, 0.031312649994081745, -0.07233556939565854, 0.07973095779212795, 0.20384736291158037, 0.20508172051238552, 0.2635190671662221, -0.4002697515030819, -0.1839091840854569, 0.09564310613063139, 0.06432026282355592, 0.048158148177773565, -0.03477498472863305, -0.34005214555843455, 0.0900546399549254, -0.1480199786286952, -0.12246326638096189, -0.06045506858090694, 0.05247813074950229, -0.0918578961612405, -0.2640446602536768, 0.02706687635666615, -0.0016980637368318196, 0.059373935395096604, -0.004866391182814196, -0.08276501715630041, 0.036124396490285524, 0.08548999052318568, 0.09879813476849499, 0.03350740850185724, 0.09342159630378356, -0.05481816439046147, -0.12259415642836609, 0.3971772194789672, 0.04096712705654067, -0.21250899552959143, 0.20167111957798134, -0.1364169961621834, -0.15486945962608867, 0.06143381242715829, 0.0986568840547792, 0.0761506866311302, -0.18927336958664898, 0.08019930456931754, -0.05675332262054891, 0.12999217116550818, 0.09262160080912951, 0.03887453993681718, 0.19099431158974767, 0.16289093015350503, -0.0015695708980028693, 0.10373558720095537, -0.09092777998601967, -0.1466316119264308, -0.34668713488389513, -0.2213924461472276, -0.20027171291813656, 0.02624612535677246, 0.025749392792341817, -0.09211397027861126, 0.3461588933258443, 0.1660047808813082, 0.16278313991387147, -0.014206924365606863, 0.2516715854085428, 0.11814548794928989, 0.06490073895484612, 0.0015299853969466043, 0.33430267841479666, 0.18618685019995412, 0.12642169390754723, -0.18958252828215827, 0.13126380172105054, 0.045880085156248834] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.