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.06667
|
Subleading-power corrections to the radiative leptonic $B \to \gamma
\ell \nu$ decay in QCD
|
Applying the method of light-cone sum rules with photon distribution
amplitudes, we compute the subleading-power correction to the radiative
leptonic $B \to \gamma \ell \nu$ decay, at next-to-leading order in QCD for the
twist-two contribution and at leading order in $\alpha_s$ for the higher-twist
contributions, induced by the hadronic component of the collinear photon. The
leading-twist hadronic photon effect turns out to preserve the symmetry
relation between the two $B \to \gamma$ form factors due to the helicity
conservation, however, the higher-twist hadronic photon corrections can yield
symmetry-breaking effect already at tree level in QCD. Using the conformal
expansion of photon distribution amplitudes with the non-perturbative
parameters estimated from QCD sum rules, the twist-two hadronic photon
contribution can give rise to approximately 30\% correction to the
leading-power "direct photon" effect computed from the perturbative QCD
factorization approach. In contrast, the subleading-power corrections from the
higher-twist two-particle and three-particle photon distribution amplitudes are
estimated to be of ${\cal O} (3 \sim 5\%)$ with the light-cone sum rule
approach. We further predict the partial branching fractions of $B \to \gamma
\ell \nu $ with a photon-energy cut $E_{\gamma} \geq E_{\rm cut}$, which are of
interest for determining the inverse moment of the leading-twist $B$-meson
distribution amplitude thanks to the forthcoming high-luminosity Belle II
experiment at KEK.
|
hep-ph hep-ex hep-lat
|
applying the method of lightcone sum rules with photon distribution amplitudes we compute the subleadingpower correction to the radiative leptonic b to gamma ell nu decay at nexttoleading order in qcd for the twisttwo contribution and at leading order in alpha_s for the highertwist contributions induced by the hadronic component of the collinear photon the leadingtwist hadronic photon effect turns out to preserve the symmetry relation between the two b to gamma form factors due to the helicity conservation however the highertwist hadronic photon corrections can yield symmetrybreaking effect already at tree level in qcd using the conformal expansion of photon distribution amplitudes with the nonperturbative parameters estimated from qcd sum rules the twisttwo hadronic photon contribution can give rise to approximately 30 correction to the leadingpower direct photon effect computed from the perturbative qcd factorization approach in contrast the subleadingpower corrections from the highertwist twoparticle and threeparticle photon distribution amplitudes are estimated to be of cal o 3 sim 5 with the lightcone sum rule approach we further predict the partial branching fractions of b to gamma ell nu with a photonenergy cut e_gamma geq e_rm cut which are of interest for determining the inverse moment of the leadingtwist bmeson distribution amplitude thanks to the forthcoming highluminosity belle ii experiment at kek
|
[['applying', 'the', 'method', 'of', 'lightcone', 'sum', 'rules', 'with', 'photon', 'distribution', 'amplitudes', 'we', 'compute', 'the', 'subleadingpower', 'correction', 'to', 'the', 'radiative', 'leptonic', 'b', 'to', 'gamma', 'ell', 'nu', 'decay', 'at', 'nexttoleading', 'order', 'in', 'qcd', 'for', 'the', 'twisttwo', 'contribution', 'and', 'at', 'leading', 'order', 'in', 'alpha_s', 'for', 'the', 'highertwist', 'contributions', 'induced', 'by', 'the', 'hadronic', 'component', 'of', 'the', 'collinear', 'photon', 'the', 'leadingtwist', 'hadronic', 'photon', 'effect', 'turns', 'out', 'to', 'preserve', 'the', 'symmetry', 'relation', 'between', 'the', 'two', 'b', 'to', 'gamma', 'form', 'factors', 'due', 'to', 'the', 'helicity', 'conservation', 'however', 'the', 'highertwist', 'hadronic', 'photon', 'corrections', 'can', 'yield', 'symmetrybreaking', 'effect', 'already', 'at', 'tree', 'level', 'in', 'qcd', 'using', 'the', 'conformal', 'expansion', 'of', 'photon', 'distribution', 'amplitudes', 'with', 'the', 'nonperturbative', 'parameters', 'estimated', 'from', 'qcd', 'sum', 'rules', 'the', 'twisttwo', 'hadronic', 'photon', 'contribution', 'can', 'give', 'rise', 'to', 'approximately', '30', 'correction', 'to', 'the', 'leadingpower', 'direct', 'photon', 'effect', 'computed', 'from', 'the', 'perturbative', 'qcd', 'factorization', 'approach', 'in', 'contrast', 'the', 'subleadingpower', 'corrections', 'from', 'the', 'highertwist', 'twoparticle', 'and', 'threeparticle', 'photon', 'distribution', 'amplitudes', 'are', 'estimated', 'to', 'be', 'of', 'cal', 'o', '3', 'sim', '5', 'with', 'the', 'lightcone', 'sum', 'rule', 'approach', 'we', 'further', 'predict', 'the', 'partial', 'branching', 'fractions', 'of', 'b', 'to', 'gamma', 'ell', 'nu', 'with', 'a', 'photonenergy', 'cut', 'e_gamma', 'geq', 'e_rm', 'cut', 'which', 'are', 'of', 'interest', 'for', 'determining', 'the', 'inverse', 'moment', 'of', 'the', 'leadingtwist', 'bmeson', 'distribution', 'amplitude', 'thanks', 'to', 'the', 'forthcoming', 'highluminosity', 'belle', 'ii', 'experiment', 'at', 'kek']]
|
[-0.0632871444530549, 0.2290208548287743, -0.12033359917151816, 0.12222332910507777, -0.0683606035401826, -0.05689085518696428, 0.07525195322953768, 0.33615106570713676, -0.2108425426257538, -0.2479359870033225, -0.061410055099549256, -0.3471991143937052, 0.0330099716472129, 0.09345408958413512, 0.10969241532746335, 0.09593522919236984, 0.03712225865153965, -0.007181606006244539, -0.08383903033078206, -0.17645239726609677, 0.30383926524207905, 0.041071504791717575, 0.2302534020081722, 0.14864406573144553, 0.03736172519523668, 0.02637244595658524, -0.11468464840081097, -0.06432763641774479, -0.1170991784062219, 0.043378310319595915, 0.24363825039199155, 0.023728431916642364, 0.09648763052922424, -0.31954775663626167, -0.06383078431758697, 0.1195415921220687, 0.17077708024938237, 0.08439776260447317, 0.08924962603487074, -0.24970600995816675, 0.07905355257642381, -0.2407007557186932, -0.13626966668766194, -0.10311051270489455, 0.008106462631217191, -0.08161005118431112, -0.3568838488992671, 0.108460154108913, -0.02900017229534091, -0.029100719256711326, 0.06590182230012062, -0.2327133240970726, -0.011790897511383038, 0.05291595276961095, 0.10574784496702919, 0.12039795740217325, 0.14852537830664117, -0.1983561448560494, -0.17657537427796444, 0.4181397352597191, -0.05041748533427645, -0.16122501019602686, 0.03109881731664036, -0.2567948026740005, -0.1546471194875702, 0.22982792217424358, 0.17629177228136628, 0.07608587637381353, -0.15860640382647795, 0.11766879906945647, 0.06634645231457278, 0.12814874820271288, 0.11906944888648292, 0.07917775250228008, 0.17921912792125638, 0.08113349941143758, -0.046670363153475274, 0.09162359255718006, -0.11517034284770489, -0.06937653616621671, -0.4412727822121145, -0.05740448564046145, -0.12410122738110488, 0.1330199307705245, -0.1289844869562488, -0.11756171655574454, 0.34080159380712804, 0.07235078650335136, 0.21700629689692447, 0.0578830820817649, 0.30979087403122807, 0.18978361566299617, 0.09691206318465119, 0.06214259323355755, 0.29779738160353064, 0.19973228162344756, 0.09256406927033395, -0.3185001951325335, 0.0028695957407250373, 0.1119015951522849]
|
1,803.06668
|
Local derivations on Solvable Lie algebras
|
We show that in the class of solvable Lie algebras there exist algebras which
admit local derivations which are not ordinary derivation and also algebras for
which every local derivation is a derivation. We found necessary and sufficient
conditions under which any local derivation of solvable Lie algebras with
abelian nilradical and one-dimensional complementary space is a derivation.
Moreover, we prove that every local derivation on a finite-dimensional solvable
Lie algebra with model nilradical and maximal dimension of complementary space
is a derivation.
|
math.RA
|
we show that in the class of solvable lie algebras there exist algebras which admit local derivations which are not ordinary derivation and also algebras for which every local derivation is a derivation we found necessary and sufficient conditions under which any local derivation of solvable lie algebras with abelian nilradical and onedimensional complementary space is a derivation moreover we prove that every local derivation on a finitedimensional solvable lie algebra with model nilradical and maximal dimension of complementary space is a derivation
|
[['we', 'show', 'that', 'in', 'the', 'class', 'of', 'solvable', 'lie', 'algebras', 'there', 'exist', 'algebras', 'which', 'admit', 'local', 'derivations', 'which', 'are', 'not', 'ordinary', 'derivation', 'and', 'also', 'algebras', 'for', 'which', 'every', 'local', 'derivation', 'is', 'a', 'derivation', 'we', 'found', 'necessary', 'and', 'sufficient', 'conditions', 'under', 'which', 'any', 'local', 'derivation', 'of', 'solvable', 'lie', 'algebras', 'with', 'abelian', 'nilradical', 'and', 'onedimensional', 'complementary', 'space', 'is', 'a', 'derivation', 'moreover', 'we', 'prove', 'that', 'every', 'local', 'derivation', 'on', 'a', 'finitedimensional', 'solvable', 'lie', 'algebra', 'with', 'model', 'nilradical', 'and', 'maximal', 'dimension', 'of', 'complementary', 'space', 'is', 'a', 'derivation']]
|
[-0.14784037889576102, 0.05159733779952828, -0.07031286857932446, 0.04313227258123323, -0.19779103502058928, -0.2187163176755589, -0.0649804145179083, 0.3744074667029711, -0.291212409824492, -0.16950347249856196, 0.1528364476167137, -0.19112462503274522, -0.18510256884956217, 0.20263019579754446, -0.06093047287719077, -0.11412319465798426, 0.08154678345848639, 0.14668572071311345, -0.15787364560156972, -0.2769080616354224, 0.36790629012891685, -0.053324693623167205, 0.2088093137458326, 0.016778095879911793, 0.1835561923076769, 0.029744774849344808, -0.013672471672004784, 0.05659561369677512, -0.23458791055793016, 0.07207967833537295, 0.29525629992046987, 0.058766963605555785, 0.20128257568162608, -0.3596266887216627, -0.1299812776788351, 0.23503983890390898, 0.16474443873255906, 0.07372899449441626, -0.05452514283712504, -0.24863567813692322, 0.07576688809926252, -0.20099189262612757, -0.14863335514014744, -0.09163316895803773, 0.1097622640902199, -0.04385821090405246, -0.2741829364291246, 0.05707634295054981, 0.1611804414136582, 0.1317958819441212, -0.155787223764886, -0.049661103983869755, -0.06057723985244352, 0.015771644031460655, -0.13906717594258533, -0.022286079302205736, 0.11529958212652794, -0.027598385654210328, -0.16185796420168447, 0.37975155503253444, 0.034536142844751656, -0.2699071399037199, 0.1845167107229312, -0.20351047162247082, -0.20697140184803361, 0.06915516028719315, -0.004518378405349262, 0.10764499365475523, -0.12545272496988974, 0.23653902627067663, -0.18986221455621072, 0.03256824782857368, 0.03764567019821829, 0.0579563410144793, 0.12898893069745188, 0.10387950925246241, 0.13984472818493124, 0.06343219694064324, 0.14095519702174666, -0.04357912163642875, -0.45558578332504596, -0.17048242246081313, -0.1274739088468164, 0.1354701531511319, -0.08434671326750799, -0.1886782261082925, 0.3813927796478552, 0.1290537857798388, 0.13038254978067904, 0.15558624814589878, 0.18341577680310212, 0.16859434595182873, 0.12628271619239487, 0.13817046307229314, 0.13095807960728206, 0.25545311473444643, -0.08751991473373968, -0.1392093420088998, -0.05065819632867912, 0.24234506842983236]
|
1,803.06669
|
Testing for equal correlation matrices with application to paired gene
expression data
|
We present a novel method for testing the hypothesis of equality of two
correlation matrices using paired high-dimensional datasets. We consider test
statistics based on the average of squares, maximum and sum of exceedances of
Fisher transform sample correlations and we derive approximate null
distributions using asymptotic and non-parametric distributions. Theoretical
results on the power of the tests are presented and backed up by a range of
simulation experiments. We apply the methodology to a case study of colorectal
tumour gene expression data with the aim of discovering biological pathway
lists of genes that present significantly different correlation matrices on
healthy and tumour samples. We find strong evidence for a large part of the
pathway lists correlation matrices to change among the two medical conditions.
|
stat.ME
|
we present a novel method for testing the hypothesis of equality of two correlation matrices using paired highdimensional datasets we consider test statistics based on the average of squares maximum and sum of exceedances of fisher transform sample correlations and we derive approximate null distributions using asymptotic and nonparametric distributions theoretical results on the power of the tests are presented and backed up by a range of simulation experiments we apply the methodology to a case study of colorectal tumour gene expression data with the aim of discovering biological pathway lists of genes that present significantly different correlation matrices on healthy and tumour samples we find strong evidence for a large part of the pathway lists correlation matrices to change among the two medical conditions
|
[['we', 'present', 'a', 'novel', 'method', 'for', 'testing', 'the', 'hypothesis', 'of', 'equality', 'of', 'two', 'correlation', 'matrices', 'using', 'paired', 'highdimensional', 'datasets', 'we', 'consider', 'test', 'statistics', 'based', 'on', 'the', 'average', 'of', 'squares', 'maximum', 'and', 'sum', 'of', 'exceedances', 'of', 'fisher', 'transform', 'sample', 'correlations', 'and', 'we', 'derive', 'approximate', 'null', 'distributions', 'using', 'asymptotic', 'and', 'nonparametric', 'distributions', 'theoretical', 'results', 'on', 'the', 'power', 'of', 'the', 'tests', 'are', 'presented', 'and', 'backed', 'up', 'by', 'a', 'range', 'of', 'simulation', 'experiments', 'we', 'apply', 'the', 'methodology', 'to', 'a', 'case', 'study', 'of', 'colorectal', 'tumour', 'gene', 'expression', 'data', 'with', 'the', 'aim', 'of', 'discovering', 'biological', 'pathway', 'lists', 'of', 'genes', 'that', 'present', 'significantly', 'different', 'correlation', 'matrices', 'on', 'healthy', 'and', 'tumour', 'samples', 'we', 'find', 'strong', 'evidence', 'for', 'a', 'large', 'part', 'of', 'the', 'pathway', 'lists', 'correlation', 'matrices', 'to', 'change', 'among', 'the', 'two', 'medical', 'conditions']]
|
[-0.07333579743653536, 0.029502228479832412, -0.0787783130556345, 0.11235462057963014, -0.023448702553287147, -0.1111677415445447, 0.10094376419484616, 0.3683983848262578, -0.18766963046602905, -0.31108912923559545, 0.08469584689289332, -0.32143610207363965, -0.17359904131293297, 0.19551215193606913, -0.0031330683529376983, 0.09075561743229628, 0.10166912784054875, -0.0026104040145874022, -0.0588905828949064, -0.25175072852522135, 0.34207940914481877, 0.04485073195397854, 0.34623182339221237, 0.01935437111929059, 0.1245277554774657, 0.016443468463141472, -0.09861610867269337, 0.0028595950584858654, -0.131997927910008, 0.15500447425991296, 0.2575559910959564, 0.2244168845973909, 0.28874977003782987, -0.40667803585500223, -0.1743594261035323, 0.12967284346744418, 0.11735983089264482, 0.08218977831036318, -0.06135522512998432, -0.26243459626846016, 0.06542961927130818, -0.1374441943652928, -0.06094533401215449, -0.110380281701684, -0.010768970731645823, 0.035724071515724064, -0.34223519572615624, 0.16274905883707105, 0.01923938847705722, 0.11388066712394357, -0.055942500634118916, -0.17063003543019295, 0.043750015359371904, 0.14073864424601198, 0.0560486270589754, -0.06244263913668692, 0.1298956776969135, -0.10080551839619875, -0.11975758117856458, 0.295929170742631, -0.04649463979015127, -0.19867872202023865, 0.1858447747025639, -0.16456725061684846, -0.15198900646716357, 0.08202689796686173, 0.21688026597723364, 0.11722558813355863, -0.19922524600848557, -0.0011309533067978919, -0.04176421544700861, 0.15515908129513264, 0.05235955731756985, -0.03855142817646265, 0.17158049669116734, 0.16574761932902038, 0.02162669963389635, 0.17750216132961213, -0.15107901890948414, -0.049736231250688434, -0.2946414180621505, -0.16263513506948948, -0.19370388559624552, -0.00998774279654026, -0.15003625911043492, -0.18376972089707852, 0.4083128438852727, 0.16785920140938834, 0.18468579301610588, 0.13726803017035127, 0.23751219253987074, 0.04958270909637213, 0.03716601492837071, 0.01809667854011059, 0.15775566522218287, 0.14821386153623461, 0.010787632629275321, -0.20880864172428845, 0.09832200709544123, 0.012055878277868033]
|
1,803.0667
|
Stone-type representations and dualities for varieties of bisemilattices
|
In this article we will focus our attention on the variety of distributive
bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and
involutive bisemilattices. After extending Balbes' representation theorem to
bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas-Dunn
duality and introduce the categories of 2spaces and 2spaces$^{\star}$. The
categories of 2spaces and 2spaces$^{\star}$ will play with respect to the
categories of distributive bisemilattices and De Morgan bisemilattices,
respectively, a role analogous to the category of Stone spaces with respect to
the category of Boolean algebras. Actually, the aim of this work is to show
that these categories are, in fact, dually equivalent.
|
math.LO
|
in this article we will focus our attention on the variety of distributive bisemilattices and some linguistic expansions thereof bounded de morgan and involutive bisemilattices after extending balbes representation theorem to bounded de morgan and involutive bisemilattices we make use of hartonasdunn duality and introduce the categories of 2spaces and 2spacesstar the categories of 2spaces and 2spacesstar will play with respect to the categories of distributive bisemilattices and de morgan bisemilattices respectively a role analogous to the category of stone spaces with respect to the category of boolean algebras actually the aim of this work is to show that these categories are in fact dually equivalent
|
[['in', 'this', 'article', 'we', 'will', 'focus', 'our', 'attention', 'on', 'the', 'variety', 'of', 'distributive', 'bisemilattices', 'and', 'some', 'linguistic', 'expansions', 'thereof', 'bounded', 'de', 'morgan', 'and', 'involutive', 'bisemilattices', 'after', 'extending', 'balbes', 'representation', 'theorem', 'to', 'bounded', 'de', 'morgan', 'and', 'involutive', 'bisemilattices', 'we', 'make', 'use', 'of', 'hartonasdunn', 'duality', 'and', 'introduce', 'the', 'categories', 'of', '2spaces', 'and', '2spacesstar', 'the', 'categories', 'of', '2spaces', 'and', '2spacesstar', 'will', 'play', 'with', 'respect', 'to', 'the', 'categories', 'of', 'distributive', 'bisemilattices', 'and', 'de', 'morgan', 'bisemilattices', 'respectively', 'a', 'role', 'analogous', 'to', 'the', 'category', 'of', 'stone', 'spaces', 'with', 'respect', 'to', 'the', 'category', 'of', 'boolean', 'algebras', 'actually', 'the', 'aim', 'of', 'this', 'work', 'is', 'to', 'show', 'that', 'these', 'categories', 'are', 'in', 'fact', 'dually', 'equivalent']]
|
[-0.09601830601619155, 0.039429759523544834, -0.09166263740774536, 0.09622434518806745, -0.1297125174097863, -0.08762106478816885, -0.005521388030519672, 0.3750021786830735, -0.3453487223881644, -0.20302238787054175, 0.11671534508430198, -0.2213401081880518, -0.13547812727298222, 0.15964837651699781, -0.22856822345570169, -0.0602237538105863, 0.019222039300217934, 0.07979762115071792, -0.056464550512221955, -0.28435881058548523, 0.4680884800960912, 0.031217743576431246, 0.2534840586869156, 0.017223906374591237, 0.10392484923952497, 0.009578481777662448, -0.0824045656961115, 0.021630379395312902, -0.16823843976189715, 0.1904604708269129, 0.3271763436131033, 0.10518810312336713, 0.24720925963985935, -0.35737968787697016, -0.03419345513205318, 0.15918300059788368, 0.1000432016124821, 0.05553595084176563, 0.008440973057968579, -0.3391356578407188, 0.09648624217302046, -0.24231487773724047, -0.06961322045547194, -0.08178863650662642, 0.07136787665441778, 0.04801072801152865, -0.19651133913259186, -0.022927773979437703, 0.18313317906622792, 0.09927551630957454, -0.107695523841197, -0.09907040755063587, -0.07511995461376786, 0.09430774837257523, -0.03474728954161572, 0.030782846138155198, 0.06863466190977716, -0.10327864583015588, -0.16246273611471349, 0.35417742161171545, -0.03454649375349868, -0.18527165502675025, 0.19474822321139715, -0.103803226495431, -0.18194091781590352, 0.05471791529699283, 0.05385706219456944, 0.10206257457863174, -0.014362839461468598, 0.1875683909023007, -0.08768319787786287, 0.07301616856335279, 0.17505974159576, 0.07588542182473283, 0.1554482566904934, 0.11324310311864988, 0.02603868813728731, 0.15070575858265453, 0.05784440673568158, -0.08264932916077383, -0.3107173433892575, -0.1903207474890366, -0.012882255246022753, 0.09339207096747808, -0.028763006874000626, -0.18861137257943697, 0.3226678399277814, 0.14502152928845116, 0.1516513316618169, 0.17159593998746692, 0.16585425426270448, -0.01045227617449949, 0.06959315080780025, 0.0031032432829413343, 0.16000976380760845, 0.20850450742770643, 0.08372353494404723, -0.10214575837074104, -0.03991720264129268, 0.1763964941528684]
|
1,803.06671
|
On some properties of PBZ*-lattices
|
We continue the algebraic investigation of PBZ*-lattices, a notion introduced
in [12] in order to obtain insights into the structure of certain algebras of
effects of a Hilbert space, lattice-ordered under the spectral ordering.
|
math.LO
|
we continue the algebraic investigation of pbzlattices a notion introduced in 12 in order to obtain insights into the structure of certain algebras of effects of a hilbert space latticeordered under the spectral ordering
|
[['we', 'continue', 'the', 'algebraic', 'investigation', 'of', 'pbzlattices', 'a', 'notion', 'introduced', 'in', '12', 'in', 'order', 'to', 'obtain', 'insights', 'into', 'the', 'structure', 'of', 'certain', 'algebras', 'of', 'effects', 'of', 'a', 'hilbert', 'space', 'latticeordered', 'under', 'the', 'spectral', 'ordering']]
|
[-0.17176486563050386, 0.11906621043542118, -0.16278986045808502, 0.10590859954104279, -0.0973823345407392, -0.02013440579740387, 0.05477691870747191, 0.31333413020227896, -0.32414467855723517, -0.24946284327994694, 0.11410081366105287, -0.1989790541260983, -0.13688809164997304, 0.13200540366497907, -0.06515508715176221, -0.012563359105225765, -0.007474601861428131, 0.06652637668461962, -0.18053962019356815, -0.27200436433353886, 0.40274470965519094, 0.015754473811918586, 0.23720156175620627, 0.0480888232669906, 0.07904014087310343, 0.0424536977132613, -0.05232344601642002, 0.04136257800608732, -0.210575218397108, 0.1621060629347057, 0.26844118552451784, 0.08500194133287578, 0.3279823281054357, -0.40723678029396315, -0.18338367783210494, 0.12016481849731821, 0.1243617965868025, 0.026500178811450798, -0.015331247426343687, -0.30571428061970934, 0.06907563419504599, -0.17918314231616078, -0.12139660800158074, -0.10238618093232314, -0.03140843185511502, -0.031987833226043164, -0.2573495888465197, -0.04299197470148405, 0.1662126259003399, 0.1182329277049355, -0.1423556436643456, -0.06399596444063002, -0.024287670378037023, 0.08246875178971977, -0.0312745263517806, -0.02546224222433838, 0.04634396403068394, -0.09211457588455894, -0.12355559028572205, 0.38926522535356606, -0.023135662574504473, -0.19518500476172476, 0.1025485500241771, -0.2283772804746122, -0.1781133044736855, 0.13016980254288876, 0.16183574729119288, 0.08216728440796335, -0.07664011945334179, 0.15872451600929102, -0.06933939874623761, 0.0810478889016491, 0.03833357143131169, 0.13045817765999923, 0.1219416694207625, 0.15071817560855186, 0.07495941082015634, 0.21646918932145293, -0.0010876083238558335, -0.08523297434051831, -0.2941631461973443, -0.20742778935836573, -0.06299525138103601, 0.12928813210490978, -0.08834186107428237, -0.1854801340536638, 0.4593721520804772, 0.12646035251743865, 0.2334510977521087, 0.03601330936406598, 0.17396113596094603, 0.05636509791524573, 0.08458534848283637, -0.0078038898663538876, 0.14098573193857164, 0.24982732003836922, 0.04126778561057466, -0.17236712495937492, -0.004667133039964194, 0.16761109872128477]
|
1,803.06672
|
Topological phases and edge states in a non-Hermitian trimerized optical
lattice
|
Topologically engineered optical materials support robust light transport.
Herein, the investigated non-Hermitian lattice is trimerized and
inhomogeneously coupled using uniform intracell coupling. The topological
properties of the coupled waveguide lattice are evaluated, the PT-symmetric
phase of a PT-symmetric lattice can have different topologies; the edge states
depend on the lattice size, boundary configuration, and competition between the
coupling and degree of non-Hermiticity. The topologically nontrivial region
extends in the presence of periodic gain and loss. The nonzero geometric phases
accumulated by the Bloch bands indicate the existence of topologically
protected edge states between the band gaps. The unidirectional amplification
and attenuation zero modes appear above a threshold degree of non-Hermiticity,
which facilitate the development of a robust optical diode.
|
cond-mat.mes-hall quant-ph
|
topologically engineered optical materials support robust light transport herein the investigated nonhermitian lattice is trimerized and inhomogeneously coupled using uniform intracell coupling the topological properties of the coupled waveguide lattice are evaluated the ptsymmetric phase of a ptsymmetric lattice can have different topologies the edge states depend on the lattice size boundary configuration and competition between the coupling and degree of nonhermiticity the topologically nontrivial region extends in the presence of periodic gain and loss the nonzero geometric phases accumulated by the bloch bands indicate the existence of topologically protected edge states between the band gaps the unidirectional amplification and attenuation zero modes appear above a threshold degree of nonhermiticity which facilitate the development of a robust optical diode
|
[['topologically', 'engineered', 'optical', 'materials', 'support', 'robust', 'light', 'transport', 'herein', 'the', 'investigated', 'nonhermitian', 'lattice', 'is', 'trimerized', 'and', 'inhomogeneously', 'coupled', 'using', 'uniform', 'intracell', 'coupling', 'the', 'topological', 'properties', 'of', 'the', 'coupled', 'waveguide', 'lattice', 'are', 'evaluated', 'the', 'ptsymmetric', 'phase', 'of', 'a', 'ptsymmetric', 'lattice', 'can', 'have', 'different', 'topologies', 'the', 'edge', 'states', 'depend', 'on', 'the', 'lattice', 'size', 'boundary', 'configuration', 'and', 'competition', 'between', 'the', 'coupling', 'and', 'degree', 'of', 'nonhermiticity', 'the', 'topologically', 'nontrivial', 'region', 'extends', 'in', 'the', 'presence', 'of', 'periodic', 'gain', 'and', 'loss', 'the', 'nonzero', 'geometric', 'phases', 'accumulated', 'by', 'the', 'bloch', 'bands', 'indicate', 'the', 'existence', 'of', 'topologically', 'protected', 'edge', 'states', 'between', 'the', 'band', 'gaps', 'the', 'unidirectional', 'amplification', 'and', 'attenuation', 'zero', 'modes', 'appear', 'above', 'a', 'threshold', 'degree', 'of', 'nonhermiticity', 'which', 'facilitate', 'the', 'development', 'of', 'a', 'robust', 'optical', 'diode']]
|
[-0.27315017240153266, 0.2607740777155322, -0.03107467813401663, -0.022344915374346516, -0.04885642584648077, -0.18557177188790583, 0.07129927690947006, 0.40535841609875695, -0.26163536244064195, -0.22988893066047683, 0.06032752497278217, -0.2842535907324372, -0.17311414587898416, 0.1023605525759714, 0.03057312760516774, 0.07601294485742555, 0.022685489042059463, -0.05745348793712734, -0.0669999473156924, -0.16676341663525604, 0.31048864671498727, -0.02314653147223304, 0.3583438019855183, 0.09721503709345085, 0.011809820293628868, 0.010478232345473366, 0.07633545390768524, -0.016154546423682144, -0.13180131100102507, 0.09635922851475316, 0.2028638938688399, -0.07967098121836531, 0.17377018415517792, -0.43676698381597756, -0.2521381731372045, 0.053748863076149414, 0.12543651249118837, 0.11341036966035314, -0.04502908518036999, -0.3282911741123887, 0.0317696092900734, -0.12709006241609797, -0.1648692074544853, -0.05282714516570119, -0.01809871947283254, -0.015903599748090535, -0.2349328122066506, 0.0557198838776901, 0.05516933853260609, 0.09570118515094851, -0.04917703349800671, -0.07203902513915751, -0.15304432225906672, 0.08225167117339849, -0.03437228314774189, -0.02323170511458977, 0.1003119508097997, -0.12170370609182551, -0.15025633021390863, 0.36731083768599926, -0.03237134497221403, -0.17026409002592272, 0.19103204588867537, -0.10836135611114651, 0.0055057742836407755, 0.18943628711242447, 0.15035508264701405, 0.04816493470644375, -0.057605431904280635, 0.09961549996177298, -0.024772610643510745, 0.17751866960976304, 0.06711851111652345, 0.17267959283179596, 0.25807867203878254, 0.13413815488334463, 0.09843054018179033, 0.18349692292761902, -0.06222328360137694, -0.11883739256368511, -0.2866919131503448, -0.09433677961204608, -0.2545545179897747, 0.03248986188701879, -0.10157163671602812, -0.2267372131175479, 0.4936301787422986, 0.09772137682513185, 0.17155413590215085, -0.05943494804786565, 0.2121109696801658, 0.14069278420050854, 0.06761886836851344, 0.052368465674054974, 0.3091266514610415, 0.1760975272500371, 0.05138208812979214, -0.3257286437834073, -0.002774196853489466, 0.017808264242719953]
|
1,803.06673
|
Damped Anderson acceleration with restarts and monotonicity control for
accelerating EM and EM-like algorithms
|
The expectation-maximization (EM) algorithm is a well-known iterative method
for computing maximum likelihood estimates from incomplete data. Despite its
numerous advantages, a main drawback of the EM algorithm is its frequently
observed slow convergence which often hinders the application of EM algorithms
in high-dimensional problems or in other complex settings.To address the need
for more rapidly convergent EM algorithms, we describe a new class of
acceleration schemes that build on the Anderson acceleration technique for
speeding fixed-point iterations. Our approach is effective at greatly
accelerating the convergence of EM algorithms and is automatically scalable to
high dimensional settings. Through the introduction of periodic algorithm
restarts and a damping factor, our acceleration scheme provides faster and more
robust convergence when compared to un-modified Anderson acceleration while
also improving global convergence. Crucially, our method works as an
"off-the-shelf" method in that it may be directly used to accelerate any EM
algorithm without relying on the use of any model-specific features or
insights. Through a series of simulation studies involving five representative
problems, we show that our algorithm is substantially faster than the existing
state-of-art acceleration schemes.
|
stat.CO stat.ME
|
the expectationmaximization em algorithm is a wellknown iterative method for computing maximum likelihood estimates from incomplete data despite its numerous advantages a main drawback of the em algorithm is its frequently observed slow convergence which often hinders the application of em algorithms in highdimensional problems or in other complex settingsto address the need for more rapidly convergent em algorithms we describe a new class of acceleration schemes that build on the anderson acceleration technique for speeding fixedpoint iterations our approach is effective at greatly accelerating the convergence of em algorithms and is automatically scalable to high dimensional settings through the introduction of periodic algorithm restarts and a damping factor our acceleration scheme provides faster and more robust convergence when compared to unmodified anderson acceleration while also improving global convergence crucially our method works as an offtheshelf method in that it may be directly used to accelerate any em algorithm without relying on the use of any modelspecific features or insights through a series of simulation studies involving five representative problems we show that our algorithm is substantially faster than the existing stateofart acceleration schemes
|
[['the', 'expectationmaximization', 'em', 'algorithm', 'is', 'a', 'wellknown', 'iterative', 'method', 'for', 'computing', 'maximum', 'likelihood', 'estimates', 'from', 'incomplete', 'data', 'despite', 'its', 'numerous', 'advantages', 'a', 'main', 'drawback', 'of', 'the', 'em', 'algorithm', 'is', 'its', 'frequently', 'observed', 'slow', 'convergence', 'which', 'often', 'hinders', 'the', 'application', 'of', 'em', 'algorithms', 'in', 'highdimensional', 'problems', 'or', 'in', 'other', 'complex', 'settingsto', 'address', 'the', 'need', 'for', 'more', 'rapidly', 'convergent', 'em', 'algorithms', 'we', 'describe', 'a', 'new', 'class', 'of', 'acceleration', 'schemes', 'that', 'build', 'on', 'the', 'anderson', 'acceleration', 'technique', 'for', 'speeding', 'fixedpoint', 'iterations', 'our', 'approach', 'is', 'effective', 'at', 'greatly', 'accelerating', 'the', 'convergence', 'of', 'em', 'algorithms', 'and', 'is', 'automatically', 'scalable', 'to', 'high', 'dimensional', 'settings', 'through', 'the', 'introduction', 'of', 'periodic', 'algorithm', 'restarts', 'and', 'a', 'damping', 'factor', 'our', 'acceleration', 'scheme', 'provides', 'faster', 'and', 'more', 'robust', 'convergence', 'when', 'compared', 'to', 'unmodified', 'anderson', 'acceleration', 'while', 'also', 'improving', 'global', 'convergence', 'crucially', 'our', 'method', 'works', 'as', 'an', 'offtheshelf', 'method', 'in', 'that', 'it', 'may', 'be', 'directly', 'used', 'to', 'accelerate', 'any', 'em', 'algorithm', 'without', 'relying', 'on', 'the', 'use', 'of', 'any', 'modelspecific', 'features', 'or', 'insights', 'through', 'a', 'series', 'of', 'simulation', 'studies', 'involving', 'five', 'representative', 'problems', 'we', 'show', 'that', 'our', 'algorithm', 'is', 'substantially', 'faster', 'than', 'the', 'existing', 'stateofart', 'acceleration', 'schemes']]
|
[-0.05465511332489957, 0.017847144086683, -0.10703064038932242, 0.08907193625969252, -0.11361722078662916, -0.1718554796289673, 0.058702804529091566, 0.4175001603215322, -0.2719117162718636, -0.3135470586340325, 0.12604899140160092, -0.19979320381528856, -0.17370455430870205, 0.29863216905457685, -0.06376544357140045, 0.08706313112045796, 0.1244665768119644, 0.006035222511616398, -0.08309423919039387, -0.2983563912872103, 0.23876131441103182, 0.09609036646717192, 0.3074417748804016, -0.013835795148647304, 0.1010941936178998, -0.007005688160545921, -0.03576043596023012, 0.03171760783673269, -0.06325261946954437, 0.1431759143047177, 0.2074603677620409, 0.1936879935241788, 0.3638591174993033, -0.4081588643272229, -0.21732423382765445, 0.09867366928291696, 0.20173801233053024, 0.14562419097160645, -0.06563823791732884, -0.2515874761640211, 0.10754780677691754, -0.14096918117122653, -0.10088360501209, -0.15019013828348593, -0.053448793419784375, 0.03471998944579588, -0.32612130102889786, 0.059557294038880125, 0.07155309688768101, -0.0034009519229067967, -0.012138718758395471, -0.09649586396500509, 0.09504320513446882, 0.05176782977205569, 0.0636179587190533, 0.05082330036312952, 0.12764641560888926, -0.10637260432269385, -0.1675502736085792, 0.3654138579241972, -0.04551931437974238, -0.18518378853268636, 0.22480329595534182, -0.029920539855600788, -0.1458651079055777, 0.20491239524197058, 0.18851827838982307, 0.1635552083645932, -0.11223991530926077, 0.08130943664391602, 0.026627184787531042, 0.13158224539098437, 0.020508065913254242, -0.00954238083875163, 0.08799032142380751, 0.1865485864627424, 0.13140722385943546, 0.09654079827217925, -0.05141529655357558, -0.09561727214299265, -0.22056168501196644, -0.14186450515910626, -0.20752545430508182, -0.018156108357994485, -0.1382969383852807, -0.1913889936652401, 0.38601011910311267, 0.2328479174397952, 0.16453570980945084, 0.06489461528765841, 0.40020468622659805, 0.08959709219774485, 0.050749693931999, 0.16653152965161888, 0.2147387669019686, 0.0644122028629209, 0.09774463895143422, -0.2252825385511756, 0.09608128331404413, 0.10825587010972934]
|
1,803.06674
|
A View-based Programmable Architecture for Controlling and Integrating
Decentralized Data
|
The view and the view update are known mechanism for controlling access of
data and for integrating data of different schemas. Despite intensive and long
research on them in both the database community and the programming language
community, we are facing difficulties to use them in practice. The main reason
is that we are lacking of control over the view update strategy to deal with
inherited ambiguity of view update for a given view.
This vision paper aims to provide a new language-based approach to
controlling and integrating decentralized data based on the view, and establish
a software foundation for systematic construction of such data management
systems. Our key observation is that a view should be defined through a view
update strategy rather than a query. In other words, the view definition should
be extracted from the view update strategy, which is in sharp contrast to the
traditional approaches where the view update strategy is derived from the view
definition.
In this paper, we present the first programmable architecture with a
declarative language for specifying update strategies over views, whose unique
view definition can be automatically derived, and show how it can be
effectively used to control data access, integrate data generally allowing
coexistence of GAV (global as view) and LAV (local as view), and perform both
analysis and updates on the integrated data. We demonstrate its usefulness
through development of a privacy-preserving ride-sharing alliance system,
discuss its application scope, and highlight future challenges.
|
cs.DB
|
the view and the view update are known mechanism for controlling access of data and for integrating data of different schemas despite intensive and long research on them in both the database community and the programming language community we are facing difficulties to use them in practice the main reason is that we are lacking of control over the view update strategy to deal with inherited ambiguity of view update for a given view this vision paper aims to provide a new languagebased approach to controlling and integrating decentralized data based on the view and establish a software foundation for systematic construction of such data management systems our key observation is that a view should be defined through a view update strategy rather than a query in other words the view definition should be extracted from the view update strategy which is in sharp contrast to the traditional approaches where the view update strategy is derived from the view definition in this paper we present the first programmable architecture with a declarative language for specifying update strategies over views whose unique view definition can be automatically derived and show how it can be effectively used to control data access integrate data generally allowing coexistence of gav global as view and lav local as view and perform both analysis and updates on the integrated data we demonstrate its usefulness through development of a privacypreserving ridesharing alliance system discuss its application scope and highlight future challenges
|
[['the', 'view', 'and', 'the', 'view', 'update', 'are', 'known', 'mechanism', 'for', 'controlling', 'access', 'of', 'data', 'and', 'for', 'integrating', 'data', 'of', 'different', 'schemas', 'despite', 'intensive', 'and', 'long', 'research', 'on', 'them', 'in', 'both', 'the', 'database', 'community', 'and', 'the', 'programming', 'language', 'community', 'we', 'are', 'facing', 'difficulties', 'to', 'use', 'them', 'in', 'practice', 'the', 'main', 'reason', 'is', 'that', 'we', 'are', 'lacking', 'of', 'control', 'over', 'the', 'view', 'update', 'strategy', 'to', 'deal', 'with', 'inherited', 'ambiguity', 'of', 'view', 'update', 'for', 'a', 'given', 'view', 'this', 'vision', 'paper', 'aims', 'to', 'provide', 'a', 'new', 'languagebased', 'approach', 'to', 'controlling', 'and', 'integrating', 'decentralized', 'data', 'based', 'on', 'the', 'view', 'and', 'establish', 'a', 'software', 'foundation', 'for', 'systematic', 'construction', 'of', 'such', 'data', 'management', 'systems', 'our', 'key', 'observation', 'is', 'that', 'a', 'view', 'should', 'be', 'defined', 'through', 'a', 'view', 'update', 'strategy', 'rather', 'than', 'a', 'query', 'in', 'other', 'words', 'the', 'view', 'definition', 'should', 'be', 'extracted', 'from', 'the', 'view', 'update', 'strategy', 'which', 'is', 'in', 'sharp', 'contrast', 'to', 'the', 'traditional', 'approaches', 'where', 'the', 'view', 'update', 'strategy', 'is', 'derived', 'from', 'the', 'view', 'definition', 'in', 'this', 'paper', 'we', 'present', 'the', 'first', 'programmable', 'architecture', 'with', 'a', 'declarative', 'language', 'for', 'specifying', 'update', 'strategies', 'over', 'views', 'whose', 'unique', 'view', 'definition', 'can', 'be', 'automatically', 'derived', 'and', 'show', 'how', 'it', 'can', 'be', 'effectively', 'used', 'to', 'control', 'data', 'access', 'integrate', 'data', 'generally', 'allowing', 'coexistence', 'of', 'gav', 'global', 'as', 'view', 'and', 'lav', 'local', 'as', 'view', 'and', 'perform', 'both', 'analysis', 'and', 'updates', 'on', 'the', 'integrated', 'data', 'we', 'demonstrate', 'its', 'usefulness', 'through', 'development', 'of', 'a', 'privacypreserving', 'ridesharing', 'alliance', 'system', 'discuss', 'its', 'application', 'scope', 'and', 'highlight', 'future', 'challenges']]
|
[-0.08748847258479533, -0.018206161546108664, -0.11278802950076423, 0.04069872491217226, -0.14463585877569668, -0.14451840066553293, 0.10963563648764364, 0.3876663197946475, -0.31830456187246275, -0.3505873179910552, 0.1358107502668138, -0.2477571098267513, -0.15525737492993597, 0.20569158801985485, -0.11564149639042491, 0.021429111837546845, 0.07322703528630196, 0.010603914580419545, -0.06609465632030405, -0.21418488721867077, 0.3047606972457467, 0.05736479504018656, 0.3204124895722193, 0.018008062138878664, 0.09131695518459071, 0.039880386808482535, -0.09936210240397725, 0.021367869463932442, -0.0896394691302047, 0.17598000604165032, 0.3166023563931421, 0.23839794163311617, 0.3259461125145193, -0.41804088647553667, -0.17989399002330114, 0.06534992889300767, 0.15410760909387627, 0.11482438600963729, -0.052765081850830925, -0.30194606173966754, 0.09275025761372326, -0.16484504611017642, -0.10312646786781547, -0.1262724987657256, -0.0215375705423658, -0.0045908015358765595, -0.26806579062478525, -0.05860668076364491, 0.04275518869141453, 0.09421641671682754, -0.0613412337137203, -0.09400195119326141, 0.031185550103727422, 0.15763365571791704, 0.026151909431839575, 0.05417820375334456, 0.15955747703097944, -0.11942927875235433, -0.15323731581872277, 0.40024195723311945, -0.009550846122946212, -0.18178629398929932, 0.16694864225631093, -0.03830259850298314, -0.17145953610440198, 0.07506470641762507, 0.193465995454405, 0.07809605988956315, -0.20163264997364555, 0.06147289861348595, -0.010588270600610336, 0.1413495353610087, 0.009413303387757834, 0.05676119830759937, 0.23936204294784788, 0.23361737840640984, 0.08537196828487528, 0.1030871217832309, -0.06271373625743569, -0.13454521903539168, -0.2866100538674681, -0.12582387742178502, -0.15011733701475513, -0.009838609835972673, -0.046103189152879656, -0.10932063844177078, 0.3777319438350921, 0.24103048648761555, 0.17752578639097083, 0.08128579874994371, 0.32985700659652345, 0.05775498536193064, 0.07821357503655504, 0.06759103469848328, 0.15861106895627913, 0.024223596569471307, 0.16489336102032942, -0.1362089382018894, 0.10135110537497685, 0.009335979026337688]
|
1,803.06675
|
Rare Feature Selection in High Dimensions
|
It is common in modern prediction problems for many predictor variables to be
counts of rarely occurring events. This leads to design matrices in which many
columns are highly sparse. The challenge posed by such "rare features" has
received little attention despite its prevalence in diverse areas, ranging from
natural language processing (e.g., rare words) to biology (e.g., rare species).
We show, both theoretically and empirically, that not explicitly accounting for
the rareness of features can greatly reduce the effectiveness of an analysis.
We next propose a framework for aggregating rare features into denser features
in a flexible manner that creates better predictors of the response. Our
strategy leverages side information in the form of a tree that encodes feature
similarity.
We apply our method to data from TripAdvisor, in which we predict the
numerical rating of a hotel based on the text of the associated review. Our
method achieves high accuracy by making effective use of rare words; by
contrast, the lasso is unable to identify highly predictive words if they are
too rare. A companion R package, called rare, implements our new estimator,
using the alternating direction method of multipliers.
|
stat.ME math.ST stat.CO stat.ML stat.TH
|
it is common in modern prediction problems for many predictor variables to be counts of rarely occurring events this leads to design matrices in which many columns are highly sparse the challenge posed by such rare features has received little attention despite its prevalence in diverse areas ranging from natural language processing eg rare words to biology eg rare species we show both theoretically and empirically that not explicitly accounting for the rareness of features can greatly reduce the effectiveness of an analysis we next propose a framework for aggregating rare features into denser features in a flexible manner that creates better predictors of the response our strategy leverages side information in the form of a tree that encodes feature similarity we apply our method to data from tripadvisor in which we predict the numerical rating of a hotel based on the text of the associated review our method achieves high accuracy by making effective use of rare words by contrast the lasso is unable to identify highly predictive words if they are too rare a companion r package called rare implements our new estimator using the alternating direction method of multipliers
|
[['it', 'is', 'common', 'in', 'modern', 'prediction', 'problems', 'for', 'many', 'predictor', 'variables', 'to', 'be', 'counts', 'of', 'rarely', 'occurring', 'events', 'this', 'leads', 'to', 'design', 'matrices', 'in', 'which', 'many', 'columns', 'are', 'highly', 'sparse', 'the', 'challenge', 'posed', 'by', 'such', 'rare', 'features', 'has', 'received', 'little', 'attention', 'despite', 'its', 'prevalence', 'in', 'diverse', 'areas', 'ranging', 'from', 'natural', 'language', 'processing', 'eg', 'rare', 'words', 'to', 'biology', 'eg', 'rare', 'species', 'we', 'show', 'both', 'theoretically', 'and', 'empirically', 'that', 'not', 'explicitly', 'accounting', 'for', 'the', 'rareness', 'of', 'features', 'can', 'greatly', 'reduce', 'the', 'effectiveness', 'of', 'an', 'analysis', 'we', 'next', 'propose', 'a', 'framework', 'for', 'aggregating', 'rare', 'features', 'into', 'denser', 'features', 'in', 'a', 'flexible', 'manner', 'that', 'creates', 'better', 'predictors', 'of', 'the', 'response', 'our', 'strategy', 'leverages', 'side', 'information', 'in', 'the', 'form', 'of', 'a', 'tree', 'that', 'encodes', 'feature', 'similarity', 'we', 'apply', 'our', 'method', 'to', 'data', 'from', 'tripadvisor', 'in', 'which', 'we', 'predict', 'the', 'numerical', 'rating', 'of', 'a', 'hotel', 'based', 'on', 'the', 'text', 'of', 'the', 'associated', 'review', 'our', 'method', 'achieves', 'high', 'accuracy', 'by', 'making', 'effective', 'use', 'of', 'rare', 'words', 'by', 'contrast', 'the', 'lasso', 'is', 'unable', 'to', 'identify', 'highly', 'predictive', 'words', 'if', 'they', 'are', 'too', 'rare', 'a', 'companion', 'r', 'package', 'called', 'rare', 'implements', 'our', 'new', 'estimator', 'using', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers']]
|
[-0.04531264783508959, 0.05151384304015968, -0.06843569474222022, 0.09237668693882976, -0.1268226318206871, -0.14247700094104707, 0.06160988438265728, 0.40454439603005693, -0.2890658990654629, -0.2898574968057801, 0.0973855794428194, -0.3071471304137958, -0.20601421648704368, 0.20056677348566154, -0.11248980791909464, 0.018458080719938152, 0.08886866541721854, 0.054302848504448775, -0.04531235604978671, -0.2454102380773596, 0.25488978650658584, 0.06421681892485746, 0.2997450706134259, -0.006947299809932399, 0.10055366606669243, -0.009980904165786342, -0.06880658259691093, 0.015049862381905163, -0.04587520813155758, 0.15958007248203407, 0.3203546690577544, 0.21011169218157497, 0.33409554029155214, -0.4045013303160279, -0.2021429041196825, 0.09227403795860785, 0.14798551789908743, 0.10860048110437977, -0.08885282301162079, -0.27878903715948883, 0.09447446731367866, -0.16378089385155667, -0.0379369634174509, -0.13582965131111754, 0.006381379072990967, 0.011055213607202555, -0.2853158620303778, 0.07807657012851148, 0.04746250353006568, 0.03762536164140329, 0.00818128065232789, -0.12932375741183932, 0.026473705351236276, 0.13329171240669288, 0.06844288081022872, 0.009582505553529094, 0.11694118843540006, -0.1473352316158222, -0.10714922445216264, 0.41448514348303434, -0.04477852804241896, -0.19811296028721395, 0.22968715412685015, -0.10227733019564766, -0.18747569747938542, 0.13554900381617094, 0.22379898677415136, 0.1198635277954357, -0.1737882766101393, 0.025569849982275628, -0.05355294985201908, 0.1864700284471231, 0.028535926085169194, 0.02562037820795619, 0.20968545254436322, 0.2174132516326305, 0.025121032196996868, 0.12115093068511366, -0.10571375736162736, -0.05585450529664134, -0.21197575402038638, -0.1262641404534103, -0.16753026116202818, -0.04000518520956575, -0.0894515073656142, -0.1814867589782807, 0.3977934290772964, 0.23124871558714707, 0.22185421246103942, 0.0403832430432279, 0.2829586335865315, 0.047354961610835744, 0.10247445540638485, 0.07954615956017126, 0.16202542272609813, 0.06245152942938148, 0.06900750654161432, -0.1643800226335467, 0.14654115055600414, 0.03782673884901063]
|
1,803.06676
|
Two-Stage Robust Unit Commitment for Co-Optimized Electricity Markets:
An Adaptive Data-Driven Approach for Scenario-Based Uncertainty Sets
|
Two-stage robust unit commitment (RUC) models have been widely used for
day-ahead energy and reserve scheduling under high renewable integration. The
current state of the art relies on budget-constrained polyhedral uncertainty
sets to control the conservativeness of the solutions. The associated lack of
interpretability and parameter specification procedures, as well as the high
computational burden exhibited by available exact solution techniques call for
new approaches. In this work, we use an alternative scenario-based framework
whereby uncertain renewable generation is characterized by a polyhedral
uncertainty set relying on the direct specification of its vertexes. Moreover,
we present a simple, yet efficient, adaptive data-driven procedure to
dynamically update the uncertainty set vertexes with observed daily
renewable-output profiles. Within this setting, the proposed data-driven RUC
ensures protection against the convex hull of realistic scenarios empirically
capturing the complex and time-varying intra-day spatial and temporal
interdependences among renewable units. The resulting counterpart features
advantageous properties from a computational perspective and can be effectively
solved by the column-and-constraint generation algorithm until
$\epsilon$-global optimality. Out-of-sample experiments reveal that the
proposed approach is capable of attaining efficient solutions in terms of cost
and robustness while keeping the model tractable and scalable.
|
math.OC
|
twostage robust unit commitment ruc models have been widely used for dayahead energy and reserve scheduling under high renewable integration the current state of the art relies on budgetconstrained polyhedral uncertainty sets to control the conservativeness of the solutions the associated lack of interpretability and parameter specification procedures as well as the high computational burden exhibited by available exact solution techniques call for new approaches in this work we use an alternative scenariobased framework whereby uncertain renewable generation is characterized by a polyhedral uncertainty set relying on the direct specification of its vertexes moreover we present a simple yet efficient adaptive datadriven procedure to dynamically update the uncertainty set vertexes with observed daily renewableoutput profiles within this setting the proposed datadriven ruc ensures protection against the convex hull of realistic scenarios empirically capturing the complex and timevarying intraday spatial and temporal interdependences among renewable units the resulting counterpart features advantageous properties from a computational perspective and can be effectively solved by the columnandconstraint generation algorithm until epsilonglobal optimality outofsample experiments reveal that the proposed approach is capable of attaining efficient solutions in terms of cost and robustness while keeping the model tractable and scalable
|
[['twostage', 'robust', 'unit', 'commitment', 'ruc', 'models', 'have', 'been', 'widely', 'used', 'for', 'dayahead', 'energy', 'and', 'reserve', 'scheduling', 'under', 'high', 'renewable', 'integration', 'the', 'current', 'state', 'of', 'the', 'art', 'relies', 'on', 'budgetconstrained', 'polyhedral', 'uncertainty', 'sets', 'to', 'control', 'the', 'conservativeness', 'of', 'the', 'solutions', 'the', 'associated', 'lack', 'of', 'interpretability', 'and', 'parameter', 'specification', 'procedures', 'as', 'well', 'as', 'the', 'high', 'computational', 'burden', 'exhibited', 'by', 'available', 'exact', 'solution', 'techniques', 'call', 'for', 'new', 'approaches', 'in', 'this', 'work', 'we', 'use', 'an', 'alternative', 'scenariobased', 'framework', 'whereby', 'uncertain', 'renewable', 'generation', 'is', 'characterized', 'by', 'a', 'polyhedral', 'uncertainty', 'set', 'relying', 'on', 'the', 'direct', 'specification', 'of', 'its', 'vertexes', 'moreover', 'we', 'present', 'a', 'simple', 'yet', 'efficient', 'adaptive', 'datadriven', 'procedure', 'to', 'dynamically', 'update', 'the', 'uncertainty', 'set', 'vertexes', 'with', 'observed', 'daily', 'renewableoutput', 'profiles', 'within', 'this', 'setting', 'the', 'proposed', 'datadriven', 'ruc', 'ensures', 'protection', 'against', 'the', 'convex', 'hull', 'of', 'realistic', 'scenarios', 'empirically', 'capturing', 'the', 'complex', 'and', 'timevarying', 'intraday', 'spatial', 'and', 'temporal', 'interdependences', 'among', 'renewable', 'units', 'the', 'resulting', 'counterpart', 'features', 'advantageous', 'properties', 'from', 'a', 'computational', 'perspective', 'and', 'can', 'be', 'effectively', 'solved', 'by', 'the', 'columnandconstraint', 'generation', 'algorithm', 'until', 'epsilonglobal', 'optimality', 'outofsample', 'experiments', 'reveal', 'that', 'the', 'proposed', 'approach', 'is', 'capable', 'of', 'attaining', 'efficient', 'solutions', 'in', 'terms', 'of', 'cost', 'and', 'robustness', 'while', 'keeping', 'the', 'model', 'tractable', 'and', 'scalable']]
|
[-0.07837348851288423, 0.01896518168054398, -0.04211629557524629, 0.09553587010342608, -0.10601872713859989, -0.15399252526688878, 0.11379419791710037, 0.40084382604054836, -0.29026929537857366, -0.33433330187168686, 0.13696460970894583, -0.21466861209238594, -0.12706142220702843, 0.1980555189298128, -0.13691282939321756, 0.13103201029064626, 0.0834412730342366, -0.028273501362255895, -0.017951778143733606, -0.2430577883262768, 0.25825191146170556, 0.10208390638656875, 0.3695051512485515, 0.013627855120156771, 0.16358149360981167, -0.0038747122834576534, -0.03071423976590442, 0.03374956160122673, -0.08267877581596424, 0.19025842593307246, 0.2744724835118394, 0.19263833440620684, 0.34709355100226913, -0.44362333443479063, -0.22300104737985116, 0.09220605713213972, 0.09819206974705574, 0.05886939450630368, -0.0411864055677708, -0.25884604298297337, 0.06715329457798229, -0.20404447092514225, -0.09589206016202664, -0.16241034320217843, -0.026858198246556705, 0.008893241135010235, -0.3139261712990894, 0.06682765364786851, 0.019186598680662522, 0.047273405928917496, -0.07325295670201683, -0.1100633212092569, -0.020492345861332983, 0.08758513576235294, 0.03602067113267692, -0.029456710471853692, 0.1083094320492819, -0.10082196052200668, -0.16445094932575222, 0.38177119471962745, -0.003568394067383569, -0.22791804335142818, 0.1615255336745261, -0.03592483427887059, -0.14700278262197586, 0.1353105415428453, 0.1902831278191252, 0.11061748422783621, -0.18413646381657203, 0.07931537244383274, 0.007926664546788356, 0.1621075259718243, 0.02274286406177429, 0.047460036073603856, 0.173329549175663, 0.23659007174899038, 0.1151251293238677, 0.138541692300275, -0.060087477610087016, -0.14119892189076527, -0.24717823324551313, -0.08752310586492458, -0.1534236626328003, -0.03370677792211425, -0.11753769070891738, -0.13536280101197445, 0.39737047983208007, 0.1848569763498622, 0.11510558025380645, 0.11636845949879507, 0.3755552970582301, 0.1126996985809465, 0.035590577141956035, 0.11502110510533724, 0.18557784981709552, 0.024524806913017377, 0.09954814473528975, -0.22731403633288633, 0.15995858056085316, 0.04608907194285161]
|
1,803.06677
|
A Review of Conjectured Laws of Total Mass of Bacry-Muzy GMC Measures on
the Interval and Circle and Their Applications
|
Selberg and Morris integral probability distributions are long conjectured to
be distributions of the total mass of the Bacry-Muzy Gaussian Multiplicative
Chaos measures with non-random logarithmic potentials on the unit interval and
circle, respectively. The construction and properties of these distributions
are reviewed from three perspectives: analytic based on several representations
of the Mellin transform, asymptotic based on low intermittency expansions, and
probabilistic based on the theory of Barnes beta probability distributions. In
particular, positive and negative integer moments, infinite factorizations and
involution invariance of the Mellin transform, analytic and probabilistic
proofs of infinite divisibility of the logarithm, factorizations into products
of Barnes beta distributions, and Stieltjes moment problems of these
distributions are presented in detail. Applications are given in the form of
conjectured mod-Gaussian limit theorems, laws of derivative martingales,
distribution of extrema of $1/f$ noises, and calculations of inverse
participation ratios in the Fyodorov-Bouchaud model.
|
math.PR
|
selberg and morris integral probability distributions are long conjectured to be distributions of the total mass of the bacrymuzy gaussian multiplicative chaos measures with nonrandom logarithmic potentials on the unit interval and circle respectively the construction and properties of these distributions are reviewed from three perspectives analytic based on several representations of the mellin transform asymptotic based on low intermittency expansions and probabilistic based on the theory of barnes beta probability distributions in particular positive and negative integer moments infinite factorizations and involution invariance of the mellin transform analytic and probabilistic proofs of infinite divisibility of the logarithm factorizations into products of barnes beta distributions and stieltjes moment problems of these distributions are presented in detail applications are given in the form of conjectured modgaussian limit theorems laws of derivative martingales distribution of extrema of 1f noises and calculations of inverse participation ratios in the fyodorovbouchaud model
|
[['selberg', 'and', 'morris', 'integral', 'probability', 'distributions', 'are', 'long', 'conjectured', 'to', 'be', 'distributions', 'of', 'the', 'total', 'mass', 'of', 'the', 'bacrymuzy', 'gaussian', 'multiplicative', 'chaos', 'measures', 'with', 'nonrandom', 'logarithmic', 'potentials', 'on', 'the', 'unit', 'interval', 'and', 'circle', 'respectively', 'the', 'construction', 'and', 'properties', 'of', 'these', 'distributions', 'are', 'reviewed', 'from', 'three', 'perspectives', 'analytic', 'based', 'on', 'several', 'representations', 'of', 'the', 'mellin', 'transform', 'asymptotic', 'based', 'on', 'low', 'intermittency', 'expansions', 'and', 'probabilistic', 'based', 'on', 'the', 'theory', 'of', 'barnes', 'beta', 'probability', 'distributions', 'in', 'particular', 'positive', 'and', 'negative', 'integer', 'moments', 'infinite', 'factorizations', 'and', 'involution', 'invariance', 'of', 'the', 'mellin', 'transform', 'analytic', 'and', 'probabilistic', 'proofs', 'of', 'infinite', 'divisibility', 'of', 'the', 'logarithm', 'factorizations', 'into', 'products', 'of', 'barnes', 'beta', 'distributions', 'and', 'stieltjes', 'moment', 'problems', 'of', 'these', 'distributions', 'are', 'presented', 'in', 'detail', 'applications', 'are', 'given', 'in', 'the', 'form', 'of', 'conjectured', 'modgaussian', 'limit', 'theorems', 'laws', 'of', 'derivative', 'martingales', 'distribution', 'of', 'extrema', 'of', '1f', 'noises', 'and', 'calculations', 'of', 'inverse', 'participation', 'ratios', 'in', 'the', 'fyodorovbouchaud', 'model']]
|
[-0.12502517870887284, 0.11828661903943101, -0.1495306106365592, 0.15546896818974246, -0.03453924163238286, -0.08480168409702968, 0.03995955779519385, 0.33899732995523163, -0.265465477022202, -0.23671238591307647, 0.1022818852885792, -0.3018164119287713, -0.14652138413249016, 0.18109912840866368, -0.04909276610482739, 0.13941478861770146, -0.013314371529890045, 0.01528212638118955, -0.11169469664000893, -0.25035755893802397, 0.3308292484095907, 0.014945403156062104, 0.25625856216256954, 0.04072723780401459, 0.10641315770144127, 0.023332735370487384, -0.11350697272597518, -0.07550893969553178, -0.137125482677868, 0.1387974264272425, 0.20769584411755204, 0.08900510492632548, 0.21152349140284557, -0.3830838134537821, -0.13644756214858245, 0.11076166222433317, 0.1367907843326078, -0.05458524700394538, -0.008103952905775546, -0.29585372813824207, 0.034950589773895806, -0.15266676374379393, -0.13793924477227248, -0.09679101229556007, 0.0842532655798307, 0.15677941052007094, -0.30308186918918095, 0.10810966434336765, 0.09620460107514303, 0.07849318362657445, -0.0674059199199578, -0.2209934032751783, 0.02857842083624883, 0.08935361853099033, 0.10516899244218733, -0.053981686011754126, 0.0947415805804505, -0.10243100660401779, -0.1522466403540632, 0.2963978273870602, -0.052772085871292305, -0.24054202388921012, 0.10366942651716558, -0.2418478682688246, -0.197984004836555, 0.11332072272692392, 0.1412193358952358, 0.13791820187478848, -0.1119992753860783, 0.1594182686728333, -0.018588520420638667, 0.07012586598842699, 0.14919508944507942, 0.04536291044805445, 0.15778732201569293, 0.03547043151585768, 0.011570876078322937, 0.13066967941217814, -0.038163494459059956, -0.16483605521322828, -0.3427718813492827, -0.14045455613136068, -0.2145288556109323, 0.09338335668642635, -0.17596879032070106, -0.22824397254480075, 0.3568267082677491, 0.08421540376730263, 0.17757939911536771, 0.1520170265209083, 0.19593841736906603, 0.20833603358087577, 0.013263480801594583, 0.005502483656004786, 0.0855885964207517, 0.2551630359104745, 0.0316599013956825, -0.15195346757058334, 0.04788056885734303, 0.17075383974468872]
|
1,803.06678
|
The Implications of 3D Thermal Structure on 1D Atmospheric Retrieval
|
Using the atmospheric structure from a 3D global radiation-hydrodynamic
simulation of HD 189733b and the open-source BART code, we investigate the
difference between the secondary-eclipse temperature structure produced with a
3D simulation and the best-fit 1D retrieved model. Synthetic data are generated
by integrating the 3D models over the Spitzer, HST, and JWST bandpasses,
covering the wavelength range between 1 and 11 um. Using the data from
different observing instruments, we present detailed comparisons between the
temperature-pressure profiles recovered by BART and those from the 3D
simulations. We calculate several averages of the 3D thermal structure and
implement two temperature parameterizations to investigate different thermal
profile shapes. To assess which part of the thermal structure is best
constrained by the data, we generate contribution functions for both our
theoretical model and each of our retrieved models. Our conclusions are
strongly affected by the spectral resolution of the instruments included, their
wavelength coverage, and the number of data points combined. We also see some
limitations in each of the temperature parametrizations. The results show that
our 1D retrieval is recovering a temperature and pressure profile that most
closely matches the arithmetic average of the 3D thermal structure. When we use
a higher resolution, more data points, and a parametrized temperature profile
that allows more flexibility in the middle part of the atmosphere, we find a
better match between the retrieved temperature and pressure profile and the
arithmetic average.
|
astro-ph.EP
|
using the atmospheric structure from a 3d global radiationhydrodynamic simulation of hd 189733b and the opensource bart code we investigate the difference between the secondaryeclipse temperature structure produced with a 3d simulation and the bestfit 1d retrieved model synthetic data are generated by integrating the 3d models over the spitzer hst and jwst bandpasses covering the wavelength range between 1 and 11 um using the data from different observing instruments we present detailed comparisons between the temperaturepressure profiles recovered by bart and those from the 3d simulations we calculate several averages of the 3d thermal structure and implement two temperature parameterizations to investigate different thermal profile shapes to assess which part of the thermal structure is best constrained by the data we generate contribution functions for both our theoretical model and each of our retrieved models our conclusions are strongly affected by the spectral resolution of the instruments included their wavelength coverage and the number of data points combined we also see some limitations in each of the temperature parametrizations the results show that our 1d retrieval is recovering a temperature and pressure profile that most closely matches the arithmetic average of the 3d thermal structure when we use a higher resolution more data points and a parametrized temperature profile that allows more flexibility in the middle part of the atmosphere we find a better match between the retrieved temperature and pressure profile and the arithmetic average
|
[['using', 'the', 'atmospheric', 'structure', 'from', 'a', '3d', 'global', 'radiationhydrodynamic', 'simulation', 'of', 'hd', '189733b', 'and', 'the', 'opensource', 'bart', 'code', 'we', 'investigate', 'the', 'difference', 'between', 'the', 'secondaryeclipse', 'temperature', 'structure', 'produced', 'with', 'a', '3d', 'simulation', 'and', 'the', 'bestfit', '1d', 'retrieved', 'model', 'synthetic', 'data', 'are', 'generated', 'by', 'integrating', 'the', '3d', 'models', 'over', 'the', 'spitzer', 'hst', 'and', 'jwst', 'bandpasses', 'covering', 'the', 'wavelength', 'range', 'between', '1', 'and', '11', 'um', 'using', 'the', 'data', 'from', 'different', 'observing', 'instruments', 'we', 'present', 'detailed', 'comparisons', 'between', 'the', 'temperaturepressure', 'profiles', 'recovered', 'by', 'bart', 'and', 'those', 'from', 'the', '3d', 'simulations', 'we', 'calculate', 'several', 'averages', 'of', 'the', '3d', 'thermal', 'structure', 'and', 'implement', 'two', 'temperature', 'parameterizations', 'to', 'investigate', 'different', 'thermal', 'profile', 'shapes', 'to', 'assess', 'which', 'part', 'of', 'the', 'thermal', 'structure', 'is', 'best', 'constrained', 'by', 'the', 'data', 'we', 'generate', 'contribution', 'functions', 'for', 'both', 'our', 'theoretical', 'model', 'and', 'each', 'of', 'our', 'retrieved', 'models', 'our', 'conclusions', 'are', 'strongly', 'affected', 'by', 'the', 'spectral', 'resolution', 'of', 'the', 'instruments', 'included', 'their', 'wavelength', 'coverage', 'and', 'the', 'number', 'of', 'data', 'points', 'combined', 'we', 'also', 'see', 'some', 'limitations', 'in', 'each', 'of', 'the', 'temperature', 'parametrizations', 'the', 'results', 'show', 'that', 'our', '1d', 'retrieval', 'is', 'recovering', 'a', 'temperature', 'and', 'pressure', 'profile', 'that', 'most', 'closely', 'matches', 'the', 'arithmetic', 'average', 'of', 'the', '3d', 'thermal', 'structure', 'when', 'we', 'use', 'a', 'higher', 'resolution', 'more', 'data', 'points', 'and', 'a', 'parametrized', 'temperature', 'profile', 'that', 'allows', 'more', 'flexibility', 'in', 'the', 'middle', 'part', 'of', 'the', 'atmosphere', 'we', 'find', 'a', 'better', 'match', 'between', 'the', 'retrieved', 'temperature', 'and', 'pressure', 'profile', 'and', 'the', 'arithmetic', 'average']]
|
[-0.04833460901863873, 0.0712267792432958, -0.08362105635002419, 0.06045376961433843, -0.028159692626591883, -0.08668715887573324, 0.03310332013631067, 0.41255719956592163, -0.24865273101980315, -0.3627990362733477, 0.0957655546241656, -0.29962639142529507, -0.09333399768903033, 0.2191743870788423, 0.0027091608339535537, 0.032896709678505984, 0.06733144386101687, -0.05488711404751687, -0.09423103041549995, -0.21398911051126002, 0.30390281789201284, 0.09851757620111548, 0.24822559726389148, 0.01972065113076178, 0.05150347001082362, -0.03046144264674537, -0.09230917184279626, 0.03144726230672518, -0.1722188585350093, 0.0981661452349857, 0.19488991958026913, 0.1298029650491957, 0.16216509173553484, -0.3985869418554605, -0.2504600082824492, 0.0605225411326259, 0.08840076309340325, 0.07899352976706524, -0.01989364761621927, -0.24676470619818897, 0.04768697619398875, -0.1369776343612417, -0.11156730679991628, -0.05723805812962735, -0.0223186118417726, 0.01976164845913798, -0.2657331434249945, 0.05658161769341579, -0.011694331432128804, 0.11870487883317635, -0.11881651497423405, -0.13366899103280414, -0.11049947176887044, 0.1467490125470107, -0.01971460669006728, 0.008717964843449964, 0.11877380239134773, -0.14418649776098966, -0.046304419531117545, 0.3917098932384753, -0.11675169187861216, -0.1393231748267301, 0.20027406089094307, -0.1717709814304415, -0.08026589742244736, 0.13752576380749262, 0.1472360935073959, 0.1061354950807187, -0.11714023362531058, 0.041580591295779006, -0.0365218907645766, 0.22331185149665497, 0.05008202717926369, -0.01293468431280808, 0.22828235193293242, 0.13890376675862698, -0.012674152537716655, 0.13462862771059453, -0.1900323052079621, -0.07599141711432031, -0.2561615861299986, -0.11062447443793091, -0.15590603479463214, -0.01350426759997202, -0.13995291154663655, -0.13474378953511013, 0.42669199962750515, 0.22604670690889334, 0.23050444783792215, 0.07710461432304831, 0.3548800506263594, 0.07921301801212502, 0.05079152249192764, 0.09526860745592271, 0.21293214704452834, 0.10939913953139686, 0.11787306705739287, -0.2322105482536985, 0.021033684434251316, -0.0022999753627605847]
|
1,803.06679
|
Kirchberg--Wassermann exactness vs exactness: reduction to the
unimodular totally disconnected case
|
We show that in order to prove that every second countable locally compact
groups with exact reduced group C*-algebra is exact in the dynamical sense
(i.e. KW-exact) it suffices to show this for totally disconnected groups.
|
math.GR math.OA
|
we show that in order to prove that every second countable locally compact groups with exact reduced group calgebra is exact in the dynamical sense ie kwexact it suffices to show this for totally disconnected groups
|
[['we', 'show', 'that', 'in', 'order', 'to', 'prove', 'that', 'every', 'second', 'countable', 'locally', 'compact', 'groups', 'with', 'exact', 'reduced', 'group', 'calgebra', 'is', 'exact', 'in', 'the', 'dynamical', 'sense', 'ie', 'kwexact', 'it', 'suffices', 'to', 'show', 'this', 'for', 'totally', 'disconnected', 'groups']]
|
[-0.15230381281248162, 0.15486990971756834, -0.11496592025671687, 0.07984349365745272, -0.08979711042983192, -0.10372812496830842, 0.04377705824694463, 0.4279540722657527, -0.3111633225211075, -0.15902323046965258, 0.09832390441027071, -0.24988425267594203, -0.1701015047063785, 0.17475696920716602, -0.12639460116292217, -0.08629958464631013, 0.08512735526476588, 0.21681953971939427, -0.08654436909460596, -0.30263433908777576, 0.4058764342750822, -0.10892523431352207, 0.235200654395989, 0.024427557084709405, 0.12390866707345205, -0.0035122419042246684, 0.00012945208166326795, 0.06757723721010345, -0.09716015991829668, 0.08897571651531118, 0.35243716524647817, 0.037346428972003715, 0.24549879261425564, -0.3580467139861347, -0.17818168960511685, 0.24344440770468542, 0.10782701282628945, 0.06325911898165941, -0.05082561877290053, -0.2931505246886185, 0.22147771625646523, -0.21651232170739343, -0.16614102604133743, -0.13068810902269823, 0.10350183442767177, -0.045622946188918184, -0.2581386555784515, 0.03987382897841079, 0.09435066810526353, -0.01939656055931534, -0.05851226918665426, 0.01911791046815259, -0.06299757294889008, 0.13382104699100766, -0.024676420705925142, 0.016420740062104804, 0.05791993141008009, 0.026264430456129566, -0.09126784828424986, 0.40591644383966924, -0.0596791642584971, -0.20209902631384985, 0.18464495119239602, -0.27448898019003015, -0.2587372260301241, 0.14938479230872223, 0.06688629144004413, 0.13719149508646555, -0.04001419874174254, 0.16532165690192155, -0.12981085681489535, 0.1802134263728346, 0.013825148344039917, -0.02539658746016877, 0.05895184137459312, 0.07081112332109894, 0.21392663387315614, 0.1703994098651622, 0.1288793088602168, -0.010912776172959378, -0.32709788020168035, -0.16842252353339324, -0.12865196191705763, 0.10707270564245326, -0.07573188725592835, -0.20355420145871383, 0.3037437019071409, 0.12939326103244508, 0.10774071927049331, 0.1694265688370381, 0.2452060612716845, 0.06968402074250792, 0.03959915552820478, 0.2094227298695062, 0.12200274510043008, 0.18392188495823314, -0.13088298772594759, -0.15472859816841913, -0.03567074142130358, 0.18036320587354046]
|
1,803.0668
|
Holographic subregion complexity under a thermal quench
|
We study the evolution of holographic subregion complexity under a thermal
quench in this paper. From the subregion CV proposal in the AdS/CFT
correspondence, the subregion complexity in the CFT is holographically captured
by the volume of the codimension-one surface enclosed by the codimension-two
extremal entanglement surface and the boundary subregion. Under a thermal
quench, the dual gravitational configuration is described by a Vaidya-AdS
spacetime. In this case we find that the holographic subregion complexity
always increases at early time, and after reaching a maximum it decreases and
gets to saturation. Moreover we notice that when the size of the strip is large
enough and the quench is fast enough, in $AdS_{d+1}(d\geq3)$ spacetime the
evolution of the complexity is discontinuous and there is a sudden drop due to
the transition of the extremal entanglement surface. We discuss the effects of
the quench speed, the strip size, the black hole mass and the spacetime
dimension on the evolution of the subregion complexity in detail numerically.
|
hep-th
|
we study the evolution of holographic subregion complexity under a thermal quench in this paper from the subregion cv proposal in the adscft correspondence the subregion complexity in the cft is holographically captured by the volume of the codimensionone surface enclosed by the codimensiontwo extremal entanglement surface and the boundary subregion under a thermal quench the dual gravitational configuration is described by a vaidyaads spacetime in this case we find that the holographic subregion complexity always increases at early time and after reaching a maximum it decreases and gets to saturation moreover we notice that when the size of the strip is large enough and the quench is fast enough in ads_d1dgeq3 spacetime the evolution of the complexity is discontinuous and there is a sudden drop due to the transition of the extremal entanglement surface we discuss the effects of the quench speed the strip size the black hole mass and the spacetime dimension on the evolution of the subregion complexity in detail numerically
|
[['we', 'study', 'the', 'evolution', 'of', 'holographic', 'subregion', 'complexity', 'under', 'a', 'thermal', 'quench', 'in', 'this', 'paper', 'from', 'the', 'subregion', 'cv', 'proposal', 'in', 'the', 'adscft', 'correspondence', 'the', 'subregion', 'complexity', 'in', 'the', 'cft', 'is', 'holographically', 'captured', 'by', 'the', 'volume', 'of', 'the', 'codimensionone', 'surface', 'enclosed', 'by', 'the', 'codimensiontwo', 'extremal', 'entanglement', 'surface', 'and', 'the', 'boundary', 'subregion', 'under', 'a', 'thermal', 'quench', 'the', 'dual', 'gravitational', 'configuration', 'is', 'described', 'by', 'a', 'vaidyaads', 'spacetime', 'in', 'this', 'case', 'we', 'find', 'that', 'the', 'holographic', 'subregion', 'complexity', 'always', 'increases', 'at', 'early', 'time', 'and', 'after', 'reaching', 'a', 'maximum', 'it', 'decreases', 'and', 'gets', 'to', 'saturation', 'moreover', 'we', 'notice', 'that', 'when', 'the', 'size', 'of', 'the', 'strip', 'is', 'large', 'enough', 'and', 'the', 'quench', 'is', 'fast', 'enough', 'in', 'ads_d1dgeq3', 'spacetime', 'the', 'evolution', 'of', 'the', 'complexity', 'is', 'discontinuous', 'and', 'there', 'is', 'a', 'sudden', 'drop', 'due', 'to', 'the', 'transition', 'of', 'the', 'extremal', 'entanglement', 'surface', 'we', 'discuss', 'the', 'effects', 'of', 'the', 'quench', 'speed', 'the', 'strip', 'size', 'the', 'black', 'hole', 'mass', 'and', 'the', 'spacetime', 'dimension', 'on', 'the', 'evolution', 'of', 'the', 'subregion', 'complexity', 'in', 'detail', 'numerically']]
|
[-0.13257620702469092, 0.16331007647430923, -0.10412603692420147, 0.05699385442639604, 0.013528642995980071, -0.10550215853766703, 0.02435895172876243, 0.30223894680341695, -0.2233264707228843, -0.26071102933763907, 0.14674251458744741, -0.26187283157776653, -0.11460913109244561, 0.1252285442957826, -0.10667871851816865, 0.06199353148852207, 0.017197719726574384, 0.06947208134217496, -0.11813491358610292, -0.2695122947809258, 0.3596188858839929, 0.0634142329367849, 0.2971162650437077, 0.09177455746217351, 0.0602601472619761, -0.015223408532128927, 0.03141213765230738, 0.09407761192772011, -0.17765597298648853, 0.03468890366732983, 0.20274039293907903, 0.12858148817932863, 0.22811855307774492, -0.4205823998921122, -0.2181743642920914, 0.08710361209960849, 0.14783531024215024, 0.157320645986342, -0.025441164447943126, -0.23329660457707485, 0.026158930711280177, -0.1540181918449677, -0.17292608306714635, 0.022895792030666502, 0.07264943983537242, -0.08554623665236669, -0.18718151211741443, 0.1148524625466828, 0.027838521502752064, 0.01110261357303686, -0.037599733512330105, 0.04502747226735017, -0.07566150580532849, 0.10508625589734646, 0.07753417178602072, 0.08210779535527016, 0.18010812502445803, -0.1798160373793195, -0.022344663156413595, 0.3123149860027515, -0.047743409023580194, -0.16684156743112516, 0.193537689168349, -0.2257186436619998, -0.080675253619767, 0.13845631290524285, 0.11478167254923403, 0.13301054186611208, -0.0901402570383139, 0.14756880489545282, -0.014812784622983287, 0.15987885537403035, 0.07880215547361806, 0.05302488654737641, 0.2652749761573376, 0.1703340742891323, 0.05837856463665154, 0.26715417157971455, -0.10945359830304614, -0.11100055317771536, -0.36167799688281455, -0.1815017135928105, -0.2191290848979875, 0.05620713137872974, -0.17086521314369213, -0.15141846383550417, 0.3944786653791103, 0.09511952259594951, 0.20582916894413394, 0.05063949735903758, 0.2332180859321054, 0.12816406309710346, 0.040480857755006094, 0.14727146504732547, 0.2568124523100677, 0.12035638398913655, 0.13550529227037827, -0.34936640457752977, 0.0008396707000953654, 0.11309005723454835]
|
1,803.06681
|
Local-in-time well-posedness for Compressible MHD boundary layer
|
In this paper, we are concerned with the motion of electrically conducting
fluid governed by the two-dimensional non-isentropic viscous compressible MHD
system on the half plane, with no-slip condition for velocity field, perfect
conducting condition for magnetic field and Dirichlet boundary condition for
temperature on the boundary. When the viscosity, heat conductivity and magnetic
diffusivity coefficients tend to zero in the same rate, there is a boundary
layer that is described by a Prandtl-type system. By applying a coordinate
transformation in terms of stream function as motivated by the recent work
\cite{liu2016mhdboundarylayer} on the incompressible MHD system, under the
non-degeneracy condition on the tangential magnetic field, we obtain the
local-in-time well-posedness of the boundary layer system in weighted Sobolev
spaces.
|
math.AP
|
in this paper we are concerned with the motion of electrically conducting fluid governed by the twodimensional nonisentropic viscous compressible mhd system on the half plane with noslip condition for velocity field perfect conducting condition for magnetic field and dirichlet boundary condition for temperature on the boundary when the viscosity heat conductivity and magnetic diffusivity coefficients tend to zero in the same rate there is a boundary layer that is described by a prandtltype system by applying a coordinate transformation in terms of stream function as motivated by the recent work citeliu2016mhdboundarylayer on the incompressible mhd system under the nondegeneracy condition on the tangential magnetic field we obtain the localintime wellposedness of the boundary layer system in weighted sobolev spaces
|
[['in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'the', 'motion', 'of', 'electrically', 'conducting', 'fluid', 'governed', 'by', 'the', 'twodimensional', 'nonisentropic', 'viscous', 'compressible', 'mhd', 'system', 'on', 'the', 'half', 'plane', 'with', 'noslip', 'condition', 'for', 'velocity', 'field', 'perfect', 'conducting', 'condition', 'for', 'magnetic', 'field', 'and', 'dirichlet', 'boundary', 'condition', 'for', 'temperature', 'on', 'the', 'boundary', 'when', 'the', 'viscosity', 'heat', 'conductivity', 'and', 'magnetic', 'diffusivity', 'coefficients', 'tend', 'to', 'zero', 'in', 'the', 'same', 'rate', 'there', 'is', 'a', 'boundary', 'layer', 'that', 'is', 'described', 'by', 'a', 'prandtltype', 'system', 'by', 'applying', 'a', 'coordinate', 'transformation', 'in', 'terms', 'of', 'stream', 'function', 'as', 'motivated', 'by', 'the', 'recent', 'work', 'citeliu2016mhdboundarylayer', 'on', 'the', 'incompressible', 'mhd', 'system', 'under', 'the', 'nondegeneracy', 'condition', 'on', 'the', 'tangential', 'magnetic', 'field', 'we', 'obtain', 'the', 'localintime', 'wellposedness', 'of', 'the', 'boundary', 'layer', 'system', 'in', 'weighted', 'sobolev', 'spaces']]
|
[-0.227828339258788, 0.13486400758456282, -0.02827753359745374, -0.02860136519033587, -0.06568512698917203, -0.11258590296928246, -0.03396069482966725, 0.3022608789732727, -0.2940617368376556, -0.24624696173587768, 0.1292618280237525, -0.22463640983866043, -0.07197537395453565, 0.18994962571173155, -0.0548627039401972, 0.12272878749366506, 0.06109204973258516, 0.01740626706702619, -0.03860510667559041, -0.20245684490601742, 0.4227402007849026, -0.0030059831573025267, 0.2863071190208948, 0.028736702688410096, 0.09601486464101477, -0.01999565802060631, 0.05570460015813969, 0.09378186448970262, -0.2145690538810039, 0.011822085702369194, 0.16565180155096434, -0.06747009887696565, 0.25080376716052816, -0.49192645031364024, -0.24264243273299282, 0.011303684243760189, 0.11710046619536872, 0.0556760384787281, -0.037883973890766816, -0.27753761298797963, 0.07678373082454841, -0.08454063379385766, -0.17350709000837153, -0.026297731201767045, -0.007011898688604163, 0.019990711536516725, -0.3226627860249591, 0.17296952524078993, 0.10409613791070566, 0.12616481350249603, -0.22174322237691083, -0.060218314839793105, -0.04899325042556064, 0.0384118544446997, 0.08890443624333799, 0.07500779963325427, 0.11154814507467907, -0.19101611950372135, 0.0074748197656531795, 0.344350499226203, -0.09661645120980233, -0.31162493488117426, 0.19830233576324055, -0.16741268879913984, -0.018233294262229895, 0.11826015348906214, 0.15620398208373734, 0.11601126332133382, -0.1583633467682467, 0.11002178835598683, -0.09462335248313405, 0.11871822153515488, 0.09600867928561418, -0.07272818340614688, 0.18623813446180723, 0.14334034051613084, 0.13613861597323118, 0.17747233093504897, -0.06332316480495305, -0.08756234939943827, -0.3339064738110584, -0.20547748057703888, -0.20229531324981173, 0.0629444474964833, -0.09473110405515935, -0.21282141479593114, 0.3355844325792952, 0.1431796113733484, 0.1504477907692184, 0.02138349785226859, 0.28860838620477364, 0.16810836446835434, -0.0017652094223293937, 0.14468813851131362, 0.23773459773197644, 0.20340829478193292, 0.2109154277880277, -0.24794654589647255, 0.04389463615224172, 0.17976778008419425]
|
1,803.06682
|
Supervised learning magnetic skyrmion phases
|
We propose and apply simple machine learning approaches for recognition and
classification of complex non-collinear magnetic structures in two-dimensional
materials. The first approach is based on the implementation of the
single-hidden-layer neural network that only relies on the z projections of the
spins. In this setup one needs a limited set of magnetic configurations to
distinguish ferromag- netic, skyrmion and spin spiral phases, as well as their
different combinations in transitional areas of the phase diagram. The network
trained on the configurations for square-lattice Heisenberg model with
Dzyaloshinskii-Moriya interaction can classify the magnetic structures obtained
from Monte Carlo calculations for triangular lattice and vice versa. The second
approach we apply, a minimum distance method performs a fast and cheap
classification in cases when a particular configuration is to be assigned to
only one magnetic phase. The methods we propose are also easy to use for
analysis of the numerous experimental data collected with spin-polarized
scanning tunneling microscopy and Lorentz transmission electron microscopy
experiments.
|
cond-mat.str-el cond-mat.dis-nn
|
we propose and apply simple machine learning approaches for recognition and classification of complex noncollinear magnetic structures in twodimensional materials the first approach is based on the implementation of the singlehiddenlayer neural network that only relies on the z projections of the spins in this setup one needs a limited set of magnetic configurations to distinguish ferromag netic skyrmion and spin spiral phases as well as their different combinations in transitional areas of the phase diagram the network trained on the configurations for squarelattice heisenberg model with dzyaloshinskiimoriya interaction can classify the magnetic structures obtained from monte carlo calculations for triangular lattice and vice versa the second approach we apply a minimum distance method performs a fast and cheap classification in cases when a particular configuration is to be assigned to only one magnetic phase the methods we propose are also easy to use for analysis of the numerous experimental data collected with spinpolarized scanning tunneling microscopy and lorentz transmission electron microscopy experiments
|
[['we', 'propose', 'and', 'apply', 'simple', 'machine', 'learning', 'approaches', 'for', 'recognition', 'and', 'classification', 'of', 'complex', 'noncollinear', 'magnetic', 'structures', 'in', 'twodimensional', 'materials', 'the', 'first', 'approach', 'is', 'based', 'on', 'the', 'implementation', 'of', 'the', 'singlehiddenlayer', 'neural', 'network', 'that', 'only', 'relies', 'on', 'the', 'z', 'projections', 'of', 'the', 'spins', 'in', 'this', 'setup', 'one', 'needs', 'a', 'limited', 'set', 'of', 'magnetic', 'configurations', 'to', 'distinguish', 'ferromag', 'netic', 'skyrmion', 'and', 'spin', 'spiral', 'phases', 'as', 'well', 'as', 'their', 'different', 'combinations', 'in', 'transitional', 'areas', 'of', 'the', 'phase', 'diagram', 'the', 'network', 'trained', 'on', 'the', 'configurations', 'for', 'squarelattice', 'heisenberg', 'model', 'with', 'dzyaloshinskiimoriya', 'interaction', 'can', 'classify', 'the', 'magnetic', 'structures', 'obtained', 'from', 'monte', 'carlo', 'calculations', 'for', 'triangular', 'lattice', 'and', 'vice', 'versa', 'the', 'second', 'approach', 'we', 'apply', 'a', 'minimum', 'distance', 'method', 'performs', 'a', 'fast', 'and', 'cheap', 'classification', 'in', 'cases', 'when', 'a', 'particular', 'configuration', 'is', 'to', 'be', 'assigned', 'to', 'only', 'one', 'magnetic', 'phase', 'the', 'methods', 'we', 'propose', 'are', 'also', 'easy', 'to', 'use', 'for', 'analysis', 'of', 'the', 'numerous', 'experimental', 'data', 'collected', 'with', 'spinpolarized', 'scanning', 'tunneling', 'microscopy', 'and', 'lorentz', 'transmission', 'electron', 'microscopy', 'experiments']]
|
[-0.11696211238575663, 0.10425708625022966, -0.0469094873463482, 0.06060136236138297, -0.08261582736546795, -0.1682787777720893, 0.056298429592667766, 0.44883088217789513, -0.2617822575762316, -0.300117336196342, 0.07144843555130294, -0.2751837294939675, -0.1585177613126206, 0.22570054032437412, 0.004071258948426004, 0.02865456957995236, 0.05047329409726332, 0.013902330052475502, -0.10429672253415863, -0.24069651005535248, 0.2816762707215399, 0.004623359835269734, 0.32602604624619824, 0.011675889129508977, 0.08400722239044334, 0.03775740533572748, 0.0608296947967675, 0.023183041393841215, -0.12584633190483235, 0.11675457136251355, 0.22876572839514767, 0.05112278075704788, 0.19020063368557596, -0.4608239638446658, -0.19804917441474068, 0.0493876262733937, 0.14857856071278178, 0.14886242922188508, -0.03889729811473646, -0.29378859085220566, 0.053293571992846275, -0.15791954750836149, -0.0726509406518789, -0.17661466565627007, -0.033558377004401, 0.01645736967753849, -0.2777609130839047, 0.07032170826781191, 0.016196452228519145, 0.0823087430164131, -0.07684129345184768, -0.08579147875274497, -0.02323918363775046, 0.10855379091941515, 0.01244359188583783, 0.06832999763952821, 0.13452445668812243, -0.1272806513660737, -0.18346472995148766, 0.3724758611951759, -0.001530713428503167, -0.1773404210552941, 0.20552597241907347, -0.12322599706421448, -0.12947047477657045, 0.09859746770126987, 0.1842335097367421, 0.13886839451044108, -0.1296764038073619, 0.04770511608746156, -0.0255660595929963, 0.15883099347536947, 0.012527297651912603, -0.019193129013235003, 0.20964857876476153, 0.226535875554323, 0.049732391598180256, 0.15186517810331152, -0.18036387929330683, -0.06776251117871315, -0.2204903297702621, -0.12816275137672087, -0.24237661886914277, 0.00928721161139554, -0.07519715930925205, -0.17596107051437607, 0.3998461994572462, 0.17677329610501427, 0.18795590003791415, -0.01131573352203877, 0.3467065541786544, 0.031231948626633692, 0.08233435012911802, 0.03516927664168179, 0.21374574737094434, 0.14637846253915793, 0.11153882209866962, -0.21090604921383926, 0.028134742275995696, 0.061694258532233905]
|
1,803.06683
|
Conformal slant submersions in contact geometry
|
Akyol M.A. [Conformal anti-invariant submersions from cosymplectic manifolds,
Hacettepe Journal of Mathematics and Statistic, 46(2), (2017), 177-192.]
defined and studied conformal anti-invariant submersions from cosymplectic
manifolds. The aim of the present paper is to define and study the notion of
conformal slant submersions (it means the Reeb vector field $\xi$ is a vertical
vector field) from almost contact metric manifolds onto Riemannian manifolds as
a generalization of Riemannian submersions, horizontally conformal submersions,
slant submersions and conformal anti-invariant submersions. More precisely, we
mention lots of examples and obtain the geometries of the leaves of
$\ker\pi_{*}$ and $(\ker\pi_{*})^\perp,$ including the integrability of the
distributions, the geometry of foliations, some conditions related to totally
geodesicness and harmonicty of the submersions. Finally, we consider a
decomposition theorem on total space of the new submersion.
|
math.DG
|
akyol ma conformal antiinvariant submersions from cosymplectic manifolds hacettepe journal of mathematics and statistic 462 2017 177192 defined and studied conformal antiinvariant submersions from cosymplectic manifolds the aim of the present paper is to define and study the notion of conformal slant submersions it means the reeb vector field xi is a vertical vector field from almost contact metric manifolds onto riemannian manifolds as a generalization of riemannian submersions horizontally conformal submersions slant submersions and conformal antiinvariant submersions more precisely we mention lots of examples and obtain the geometries of the leaves of kerpi_ and kerpi_perp including the integrability of the distributions the geometry of foliations some conditions related to totally geodesicness and harmonicty of the submersions finally we consider a decomposition theorem on total space of the new submersion
|
[['akyol', 'ma', 'conformal', 'antiinvariant', 'submersions', 'from', 'cosymplectic', 'manifolds', 'hacettepe', 'journal', 'of', 'mathematics', 'and', 'statistic', '462', '2017', '177192', 'defined', 'and', 'studied', 'conformal', 'antiinvariant', 'submersions', 'from', 'cosymplectic', 'manifolds', 'the', 'aim', 'of', 'the', 'present', 'paper', 'is', 'to', 'define', 'and', 'study', 'the', 'notion', 'of', 'conformal', 'slant', 'submersions', 'it', 'means', 'the', 'reeb', 'vector', 'field', 'xi', 'is', 'a', 'vertical', 'vector', 'field', 'from', 'almost', 'contact', 'metric', 'manifolds', 'onto', 'riemannian', 'manifolds', 'as', 'a', 'generalization', 'of', 'riemannian', 'submersions', 'horizontally', 'conformal', 'submersions', 'slant', 'submersions', 'and', 'conformal', 'antiinvariant', 'submersions', 'more', 'precisely', 'we', 'mention', 'lots', 'of', 'examples', 'and', 'obtain', 'the', 'geometries', 'of', 'the', 'leaves', 'of', 'kerpi_', 'and', 'kerpi_perp', 'including', 'the', 'integrability', 'of', 'the', 'distributions', 'the', 'geometry', 'of', 'foliations', 'some', 'conditions', 'related', 'to', 'totally', 'geodesicness', 'and', 'harmonicty', 'of', 'the', 'submersions', 'finally', 'we', 'consider', 'a', 'decomposition', 'theorem', 'on', 'total', 'space', 'of', 'the', 'new', 'submersion']]
|
[-0.21450136973914097, 0.07411828153999522, -0.06601000493091921, 0.14634147110102216, -0.16443326405151898, -0.14488613122187916, -0.11400440185905374, 0.3807232714738817, -0.2528579868789342, -0.21037894125366885, 0.10817493104766454, -0.3153317431213274, -0.23494567268062383, 0.15332797879443294, -0.20293774166061812, 0.041774794940025575, 0.0858101743769141, 0.0745084248032541, -0.16329201302048, -0.2602703030279372, 0.5234479182775342, 0.02775983733215159, 0.24443703675792822, 0.11334374992387189, 0.19395329994562593, 0.012413003046305911, -0.04714391666141549, 0.00025026276008218465, -0.2494505659992536, 0.11520312393775149, 0.20059953063290806, 0.09554589857091947, 0.1392248501107397, -0.3285730319480682, -0.16952659177684015, 0.14686253778223368, 0.05171108510530171, -0.029450754257625028, 0.026911070182024793, -0.3790838911137994, 0.03862442057617309, -0.004263918272279683, -0.19266005364601546, -0.1326025782092925, -0.0020639793778349075, -0.045301026704105275, -0.14350667891032512, 0.046195075002258584, 0.1888253642584107, 0.18414505911418783, -0.11851389518368148, -0.09650407022526188, -0.12473945911680799, 0.07319323982923262, 0.045386351493840675, 0.10251061650436191, 0.19252345206276064, -0.007630751220389239, -0.12227539753075689, 0.3697508545592427, -0.10655443393860027, -0.34166865716237693, 0.07951456345542665, -0.10556773315258924, -0.17848825504657842, 0.0663730625040649, 0.20004328591899284, 0.19004513464085082, -0.158938487725062, 0.15771272582529608, -0.07549831940747437, -0.06450882790264703, 0.18016525543475104, -0.057907368792521376, 0.13303738312735672, 0.05546013733762647, 0.17508337441869382, 0.16771071041265742, -0.03185326119907381, -0.041205957892440984, -0.3715538999418758, -0.26754649685538046, -0.03711793185662358, 0.2634746916441908, -0.15151432339647022, -0.20666640183527865, 0.4039004928124468, -0.005214745050315903, 0.16725772182877746, 0.1516320604094935, 0.2207699260099851, -0.10195684781572181, 0.014834072852071615, 0.1201162250644918, 0.20485491231351438, 0.36665409560044926, 0.08959097382443536, 0.017892751156450098, -0.1847494197708945, 0.12943495425110263]
|
1,803.06684
|
The decomposition formula for Verlinde Sums
|
We prove a decomposition formula for Verlinde sums (rational trigonometric
sums), as a discrete counterpart to the Boysal-Vergne decomposition formula for
Bernoulli series. Motivated by applications to fixed point formulas in
Hamiltonian geometry, we develop differential form valued version of Bernoulli
series and Verlinde sums, and extend the decomposition formula to this wider
context.
|
math.SG
|
we prove a decomposition formula for verlinde sums rational trigonometric sums as a discrete counterpart to the boysalvergne decomposition formula for bernoulli series motivated by applications to fixed point formulas in hamiltonian geometry we develop differential form valued version of bernoulli series and verlinde sums and extend the decomposition formula to this wider context
|
[['we', 'prove', 'a', 'decomposition', 'formula', 'for', 'verlinde', 'sums', 'rational', 'trigonometric', 'sums', 'as', 'a', 'discrete', 'counterpart', 'to', 'the', 'boysalvergne', 'decomposition', 'formula', 'for', 'bernoulli', 'series', 'motivated', 'by', 'applications', 'to', 'fixed', 'point', 'formulas', 'in', 'hamiltonian', 'geometry', 'we', 'develop', 'differential', 'form', 'valued', 'version', 'of', 'bernoulli', 'series', 'and', 'verlinde', 'sums', 'and', 'extend', 'the', 'decomposition', 'formula', 'to', 'this', 'wider', 'context']]
|
[-0.13504467929168693, -0.014832189798636257, -0.15362225912230196, 0.09649918188630902, -0.16223374220437176, -0.1377690239581016, 0.07809266581569078, 0.2827442101431343, -0.3340533273821732, -0.18979739355591108, 0.10529652401971859, -0.20356196337291654, -0.2312883219488387, 0.24942732625201625, -0.12751848731087828, 0.06085266960117052, 0.0023742980271015527, 0.012312872282598378, -0.13305096270270506, -0.2405816368969544, 0.2836166751694004, -0.030270924475395453, 0.22378264815669577, 0.015226803157689437, 0.113007948136414, 0.11418400522110597, -0.08495721463465465, -0.049984109236524916, -0.16510340754153593, 0.1682731992090648, 0.2730196091381587, 0.07788547330079074, 0.2465226029766337, -0.35773450452482924, -0.1647088178169896, 0.19167853881306243, 0.14237351682177693, 0.04476682836506164, 0.02143750404324031, -0.26423512290249457, 0.03385320175790562, -0.27535984883049747, -0.19521726345432536, -0.16468364608315927, 0.08172058387887927, 0.042295662651084504, -0.3044449509877079, 0.03331837399845135, 0.05740833126078799, 0.10743913490254924, -0.09050046186894178, -0.1877985410040842, 0.11069772642035529, 0.02240625982840528, 0.011032778391930854, -0.03727701327429628, 0.052922984743315096, -0.04329520082189087, -0.15997052737423834, 0.3442856535877822, -0.10064002043207369, -0.2810540393627477, 0.025121541728950897, -0.1779011616676624, -0.24780357328577424, 0.09488611243102911, 0.10442685018697719, 0.1600551819780244, -0.08748889714479446, 0.12854438062256449, -0.10644433027976807, -0.0008575088659714345, 0.1897199648203996, -0.024432473692972707, 0.152247444480517, -0.05481718306622978, 0.06990688253756401, 0.24785649210636346, 0.013235892790791421, -0.15834753218827383, -0.344909188038898, -0.22180959404850342, -0.2109502543704057, 0.14547053411743552, -0.1391537154861067, -0.2261611999205823, 0.3153062918407948, 0.038064754023304524, 0.1824046335587243, 0.17707995441302937, 0.24319203711062107, 0.26161422536330614, 0.025134260045751085, -0.018086027336429875, 0.014442269804553603, 0.31303459211287776, 0.08816612163066583, -0.055022420423140504, -0.030697336833361746, 0.33639595873724176]
|
1,803.06685
|
Shifted Poisson structures on differentiable stacks
|
The purpose of this paper is to investigate shifted $(+1)$ Poisson structures
in context of differential geometry. The relevant notion is shifted $(+1)$
Poisson structures on differentiable stacks. More precisely, we develop the
notion of Morita equivalence of quasi-Poisson groupoids. Thus isomorphism
classes of $(+1)$ Poisson stack correspond to Morita equivalence classes of
quasi-Poisson groupoids. In the process, we carry out the following programs of
independent interests:
(1) We introduce a $\mathbb Z$-graded Lie 2-algebra of polyvector fields on a
given Lie groupoid and prove that its homotopy equivalence class is invariant
under Morita equivalence of Lie groupoids, thus can be considered as polyvector
fields on the corresponding differentiable stack ${\mathfrak X}$. It turns out
that shifted $(+1)$ Poisson structures on ${\mathfrak X}$ correspond exactly to
elements of the Maurer-Cartan moduli set of the corresponding dgla.
(2) We introduce the notion of tangent complex $T_{\mathfrak X}$ and
cotangent complex $L_{\mathfrak X}$ of a differentiable stack ${\mathfrak X}$
in terms of any Lie groupoid $\Gamma{\rightrightarrows} M$ representing
${\mathfrak X}$. They correspond to homotopy class of 2-term homotopy
$\Gamma$-modules $A[1]\rightarrow TM$ and $T^\vee M\rightarrow A^\vee[-1]$,
respectively. We prove that a $(+1)$-shifted Poisson structure on a
differentiable stack ${\mathfrak X}$, defines a morphism ${L_{{\mathfrak
X}}}[1]\to {T_{{\mathfrak X}}}$.
|
math.DG
|
the purpose of this paper is to investigate shifted 1 poisson structures in context of differential geometry the relevant notion is shifted 1 poisson structures on differentiable stacks more precisely we develop the notion of morita equivalence of quasipoisson groupoids thus isomorphism classes of 1 poisson stack correspond to morita equivalence classes of quasipoisson groupoids in the process we carry out the following programs of independent interests 1 we introduce a mathbb zgraded lie 2algebra of polyvector fields on a given lie groupoid and prove that its homotopy equivalence class is invariant under morita equivalence of lie groupoids thus can be considered as polyvector fields on the corresponding differentiable stack mathfrak x it turns out that shifted 1 poisson structures on mathfrak x correspond exactly to elements of the maurercartan moduli set of the corresponding dgla 2 we introduce the notion of tangent complex t_mathfrak x and cotangent complex l_mathfrak x of a differentiable stack mathfrak x in terms of any lie groupoid gammarightrightarrows m representing mathfrak x they correspond to homotopy class of 2term homotopy gammamodules a1rightarrow tm and tvee mrightarrow avee1 respectively we prove that a 1shifted poisson structure on a differentiable stack mathfrak x defines a morphism l_mathfrak x1to t_mathfrak x
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'investigate', 'shifted', '1', 'poisson', 'structures', 'in', 'context', 'of', 'differential', 'geometry', 'the', 'relevant', 'notion', 'is', 'shifted', '1', 'poisson', 'structures', 'on', 'differentiable', 'stacks', 'more', 'precisely', 'we', 'develop', 'the', 'notion', 'of', 'morita', 'equivalence', 'of', 'quasipoisson', 'groupoids', 'thus', 'isomorphism', 'classes', 'of', '1', 'poisson', 'stack', 'correspond', 'to', 'morita', 'equivalence', 'classes', 'of', 'quasipoisson', 'groupoids', 'in', 'the', 'process', 'we', 'carry', 'out', 'the', 'following', 'programs', 'of', 'independent', 'interests', '1', 'we', 'introduce', 'a', 'mathbb', 'zgraded', 'lie', '2algebra', 'of', 'polyvector', 'fields', 'on', 'a', 'given', 'lie', 'groupoid', 'and', 'prove', 'that', 'its', 'homotopy', 'equivalence', 'class', 'is', 'invariant', 'under', 'morita', 'equivalence', 'of', 'lie', 'groupoids', 'thus', 'can', 'be', 'considered', 'as', 'polyvector', 'fields', 'on', 'the', 'corresponding', 'differentiable', 'stack', 'mathfrak', 'x', 'it', 'turns', 'out', 'that', 'shifted', '1', 'poisson', 'structures', 'on', 'mathfrak', 'x', 'correspond', 'exactly', 'to', 'elements', 'of', 'the', 'maurercartan', 'moduli', 'set', 'of', 'the', 'corresponding', 'dgla', '2', 'we', 'introduce', 'the', 'notion', 'of', 'tangent', 'complex', 't_mathfrak', 'x', 'and', 'cotangent', 'complex', 'l_mathfrak', 'x', 'of', 'a', 'differentiable', 'stack', 'mathfrak', 'x', 'in', 'terms', 'of', 'any', 'lie', 'groupoid', 'gammarightrightarrows', 'm', 'representing', 'mathfrak', 'x', 'they', 'correspond', 'to', 'homotopy', 'class', 'of', '2term', 'homotopy', 'gammamodules', 'a1rightarrow', 'tm', 'and', 'tvee', 'mrightarrow', 'avee1', 'respectively', 'we', 'prove', 'that', 'a', '1shifted', 'poisson', 'structure', 'on', 'a', 'differentiable', 'stack', 'mathfrak', 'x', 'defines', 'a', 'morphism', 'l_mathfrak', 'x1to', 't_mathfrak', 'x']]
|
[-0.23090453870827332, 0.0366706477150067, -0.04867275605566748, 0.09737034262464779, -0.14588997521992736, -0.13273452663784752, -0.02153046529286193, 0.42173692019599857, -0.41883238554565294, -0.1707348250313615, 0.03319867510487316, -0.19717119781140502, -0.1317067276216065, 0.15127240712084158, -0.18322191531816967, -0.06778117599385565, 0.022757207247783722, 0.11967369810574585, -0.15291360304679139, -0.2447486981206263, 0.48159871314360636, -0.05505720182143227, 0.24406603279870373, -0.05804914382734393, 0.18780150410079519, -0.03594230517222913, 0.012178960747809874, -0.011387589613370823, -0.15895729139855108, 0.1298735560543572, 0.34278033093332944, 0.03666191940536726, 0.20018030725292524, -0.330480377928288, -0.056832723747562576, 0.18279866697360772, 0.10456677482021276, -0.11087919959170518, 0.06439691223343776, -0.31392605536654966, 0.1514103535840269, -0.168427044036563, -0.09899091182248385, -0.08506676089018583, 0.09918367929963602, 0.01222212038783714, -0.20001969278720677, -0.0698520563768618, 0.1331293278601905, 0.10482931579698367, -0.06562984116537722, -0.07258159542606786, -0.1477077692450786, 0.027556549061578933, -0.07760676909887791, 0.08445923498624729, 0.1983907389703837, -0.017206302513556575, -0.11933435962272036, 0.3936766172862715, -0.024971880070451234, -0.25519723845928005, 0.11524113287180286, -0.14402056570432967, -0.2138041795109107, 0.14621275072597495, 0.059019930109221755, 0.18747820930480205, -0.029453058021832162, 0.26149322704624883, -0.11963230934972414, 0.03892148111304833, 0.10797324826508159, -0.020097013506767895, 0.14595351509063156, 0.12805519633070386, 0.09862934469158356, 0.08952435659834965, 0.036615137258930265, -0.027371273614757816, -0.4009192186699371, -0.2186693895697556, -0.011200659423878398, 0.25132997828239406, -0.09441135801127089, -0.19410204128926675, 0.3541603037767639, 0.13414924034867623, 0.21521385189032916, 0.15755330320127836, 0.1453874125568704, 0.0673186325023775, 0.062526161427318, 0.025122650849604695, 0.08277332055032009, 0.29977985101662613, -0.01264621720959743, -0.043149667614459465, -0.08210698566211369, 0.2428881954730987]
|
1,803.06686
|
Code Vectors: Understanding Programs Through Embedded Abstracted
Symbolic Traces
|
With the rise of machine learning, there is a great deal of interest in
treating programs as data to be fed to learning algorithms. However, programs
do not start off in a form that is immediately amenable to most off-the-shelf
learning techniques. Instead, it is necessary to transform the program to a
suitable representation before a learning technique can be applied.
In this paper, we use abstractions of traces obtained from symbolic execution
of a program as a representation for learning word embeddings. We trained a
variety of word embeddings under hundreds of parameterizations, and evaluated
each learned embedding on a suite of different tasks. In our evaluation, we
obtain 93% top-1 accuracy on a benchmark consisting of over 19,000 API-usage
analogies extracted from the Linux kernel. In addition, we show that embeddings
learned from (mainly) semantic abstractions provide nearly triple the accuracy
of those learned from (mainly) syntactic abstractions.
|
cs.SE
|
with the rise of machine learning there is a great deal of interest in treating programs as data to be fed to learning algorithms however programs do not start off in a form that is immediately amenable to most offtheshelf learning techniques instead it is necessary to transform the program to a suitable representation before a learning technique can be applied in this paper we use abstractions of traces obtained from symbolic execution of a program as a representation for learning word embeddings we trained a variety of word embeddings under hundreds of parameterizations and evaluated each learned embedding on a suite of different tasks in our evaluation we obtain 93 top1 accuracy on a benchmark consisting of over 19000 apiusage analogies extracted from the linux kernel in addition we show that embeddings learned from mainly semantic abstractions provide nearly triple the accuracy of those learned from mainly syntactic abstractions
|
[['with', 'the', 'rise', 'of', 'machine', 'learning', 'there', 'is', 'a', 'great', 'deal', 'of', 'interest', 'in', 'treating', 'programs', 'as', 'data', 'to', 'be', 'fed', 'to', 'learning', 'algorithms', 'however', 'programs', 'do', 'not', 'start', 'off', 'in', 'a', 'form', 'that', 'is', 'immediately', 'amenable', 'to', 'most', 'offtheshelf', 'learning', 'techniques', 'instead', 'it', 'is', 'necessary', 'to', 'transform', 'the', 'program', 'to', 'a', 'suitable', 'representation', 'before', 'a', 'learning', 'technique', 'can', 'be', 'applied', 'in', 'this', 'paper', 'we', 'use', 'abstractions', 'of', 'traces', 'obtained', 'from', 'symbolic', 'execution', 'of', 'a', 'program', 'as', 'a', 'representation', 'for', 'learning', 'word', 'embeddings', 'we', 'trained', 'a', 'variety', 'of', 'word', 'embeddings', 'under', 'hundreds', 'of', 'parameterizations', 'and', 'evaluated', 'each', 'learned', 'embedding', 'on', 'a', 'suite', 'of', 'different', 'tasks', 'in', 'our', 'evaluation', 'we', 'obtain', '93', 'top1', 'accuracy', 'on', 'a', 'benchmark', 'consisting', 'of', 'over', '19000', 'apiusage', 'analogies', 'extracted', 'from', 'the', 'linux', 'kernel', 'in', 'addition', 'we', 'show', 'that', 'embeddings', 'learned', 'from', 'mainly', 'semantic', 'abstractions', 'provide', 'nearly', 'triple', 'the', 'accuracy', 'of', 'those', 'learned', 'from', 'mainly', 'syntactic', 'abstractions']]
|
[-0.024176508075738914, -0.00886538324740109, -0.1133665341693258, 0.07682477041685191, -0.13037116124588471, -0.14092437280717013, 0.06278781947951714, 0.4527578794416165, -0.31191403749820795, -0.31480203035768844, 0.0966625842000139, -0.26445239852963875, -0.13372746293726784, 0.2749715434745167, -0.10962209809921532, 0.07658053404064036, 0.15422371974771204, 0.08753791880100847, -0.11531064066342109, -0.2791939398880123, 0.30604303008157935, -0.00681620051509282, 0.2689618157854166, -0.012717012958616743, 0.12854077157583213, -0.017315222216057496, -0.022443352984389504, 0.012523981837490136, -0.04997996819854461, 0.18996383382582524, 0.372003861271695, 0.2412173355204497, 0.32728110734785865, -0.3889854106670808, -0.17272718512646903, 0.08834939732547574, 0.12819053748335013, 0.09873346708739963, -0.02721690563891308, -0.3334743411924015, 0.08745436109414936, -0.19928563352449227, 0.0284836055342133, -0.15509440196715546, -0.042851691056142914, -0.014135672877255152, -0.25034767322417273, -0.057388422023129944, 0.10278263274539612, 0.09037269445311204, -0.054229392427888594, -0.10488455672435862, 0.012757079317953262, 0.14157365253445187, 0.013442147680208237, 0.07902728636661582, 0.13949449925414667, -0.1559811897791497, -0.14816093785475765, 0.3806117125818093, -0.09071083469300738, -0.20588599209792463, 0.21995121688775768, -0.022808124061248845, -0.18841515165822417, 0.12563872310464214, 0.25913728473570524, 0.10299820695447441, -0.16736329455028645, 0.06084169266118837, -0.047996296394216334, 0.2052433383307301, 0.09391004017760489, -0.025051845874381095, 0.17550605454719656, 0.22973169384511724, -0.002965305205247046, 0.15126724018490303, -0.04078185339552044, -0.0536107479800914, -0.24354373406768845, -0.11486297754583343, -0.19063989603079406, 0.0074471447105252265, -0.09180298088196175, -0.14634783051426728, 0.3859892458195529, 0.20158418186708985, 0.22061484998979625, 0.1231481968831496, 0.3033752061126616, 0.039078745522986374, 0.14879869307147575, 0.12777007303291293, 0.14025056821015983, 0.03828633575381449, 0.10923328498087749, -0.1215292110971969, 0.07735999899403811, 0.06638854421400184]
|
1,803.06687
|
Sub-Riemannian Geodesics on SU(n)/S(U(n-1)xU(1)) and Optimal Control of
Three Level Quantum Systems
|
We study the time optimal control problem for the evolution operator of an
n-level quantum system from the identity to any desired final condition. For
the considered class of quantum systems the control couples all the energy
levels to a given one and is assumed to be bounded in Euclidean norm. From a
mathematical perspective, such a problem is a sub-Riemannian K-P problem, whose
underlying symmetric space is SU(n)/S(U(n-1) x U(1)). Following the method of
symmetry reduction, we consider the action of S(U(n-1) xU(1)) on SU(n) as a
conjugation X ---> AXA^{-1}. This allows us to do a symmetry reduction and
consider the problem on a quotient space. We give an explicit description of
such a quotient space which has the structure of a stratified space. We prove
several properties of sub-Riemannian problems with the given structure. We
derive the explicit optimal control for the case of three level quantum systems
where the desired operation is on the lowest two energy levels
(Lambda-systems). We solve this latter problem by reducing it to an integer
quadratic optimization problem with linear constraints.
|
quant-ph math.OC
|
we study the time optimal control problem for the evolution operator of an nlevel quantum system from the identity to any desired final condition for the considered class of quantum systems the control couples all the energy levels to a given one and is assumed to be bounded in euclidean norm from a mathematical perspective such a problem is a subriemannian kp problem whose underlying symmetric space is sunsun1 x u1 following the method of symmetry reduction we consider the action of sun1 xu1 on sun as a conjugation x axa1 this allows us to do a symmetry reduction and consider the problem on a quotient space we give an explicit description of such a quotient space which has the structure of a stratified space we prove several properties of subriemannian problems with the given structure we derive the explicit optimal control for the case of three level quantum systems where the desired operation is on the lowest two energy levels lambdasystems we solve this latter problem by reducing it to an integer quadratic optimization problem with linear constraints
|
[['we', 'study', 'the', 'time', 'optimal', 'control', 'problem', 'for', 'the', 'evolution', 'operator', 'of', 'an', 'nlevel', 'quantum', 'system', 'from', 'the', 'identity', 'to', 'any', 'desired', 'final', 'condition', 'for', 'the', 'considered', 'class', 'of', 'quantum', 'systems', 'the', 'control', 'couples', 'all', 'the', 'energy', 'levels', 'to', 'a', 'given', 'one', 'and', 'is', 'assumed', 'to', 'be', 'bounded', 'in', 'euclidean', 'norm', 'from', 'a', 'mathematical', 'perspective', 'such', 'a', 'problem', 'is', 'a', 'subriemannian', 'kp', 'problem', 'whose', 'underlying', 'symmetric', 'space', 'is', 'sunsun1', 'x', 'u1', 'following', 'the', 'method', 'of', 'symmetry', 'reduction', 'we', 'consider', 'the', 'action', 'of', 'sun1', 'xu1', 'on', 'sun', 'as', 'a', 'conjugation', 'x', 'axa1', 'this', 'allows', 'us', 'to', 'do', 'a', 'symmetry', 'reduction', 'and', 'consider', 'the', 'problem', 'on', 'a', 'quotient', 'space', 'we', 'give', 'an', 'explicit', 'description', 'of', 'such', 'a', 'quotient', 'space', 'which', 'has', 'the', 'structure', 'of', 'a', 'stratified', 'space', 'we', 'prove', 'several', 'properties', 'of', 'subriemannian', 'problems', 'with', 'the', 'given', 'structure', 'we', 'derive', 'the', 'explicit', 'optimal', 'control', 'for', 'the', 'case', 'of', 'three', 'level', 'quantum', 'systems', 'where', 'the', 'desired', 'operation', 'is', 'on', 'the', 'lowest', 'two', 'energy', 'levels', 'lambdasystems', 'we', 'solve', 'this', 'latter', 'problem', 'by', 'reducing', 'it', 'to', 'an', 'integer', 'quadratic', 'optimization', 'problem', 'with', 'linear', 'constraints']]
|
[-0.1570590052645209, 0.0732103475016133, -0.06898320880472139, 0.06676696419890504, -0.089958827953193, -0.11748714640006339, 0.028025541797846512, 0.33184331035855313, -0.3356960618310206, -0.27972158999711444, 0.11931738707393048, -0.2398022498356857, -0.14937632622472433, 0.1696239621451241, -0.07481675011910159, 0.0677531191454777, 0.020962420411788942, 0.0904525814310711, -0.1239825296162797, -0.23806971974607388, 0.3549768508038886, -0.00011932001308940181, 0.24307832603385163, 0.023220024365317924, 0.1797634239536075, 0.01908607210547912, 0.04839413867871785, -0.009946240059930873, -0.13380275153957139, 0.13510704425756226, 0.24284380207113412, 0.10583465760282706, 0.26987825000436383, -0.4025860766626217, -0.201441198850675, 0.1527056167231587, 0.10037113145385361, 0.11229649360426595, -0.019368019918725953, -0.25172254113898485, 0.08395815011317609, -0.13473375597757034, -0.1328772239794489, -0.028148929376832464, -0.00025920523330569267, -0.05255358856811654, -0.294175297295045, 0.014209229647266593, 0.07920619919737378, 0.046674565300980415, -0.12148128541362398, -0.06986040902120294, -0.0077035666115327995, 0.12893537809246813, 0.00462755722401198, 0.030615497829785454, 0.08501273310685065, -0.09555046865187417, -0.12174959201101129, 0.4277277078521861, -0.02572039480781479, -0.2839053219014948, 0.13241009141942908, -0.09913519756314186, -0.14998042294940783, 0.10394894054413518, 0.17871354062464723, 0.14913778594398702, -0.11262272383067863, 0.17064813856995897, -0.08503277454821562, 0.1495587179689954, 0.023025150527246296, 0.025189571538992987, 0.12882382754337, 0.15649673155117358, 0.1800453106340931, 0.1672372744724271, -0.017030172305319204, -0.1087018639928746, -0.3289954818954522, -0.17433180675553475, -0.15477034675595033, 0.10518647697079525, -0.072223922901685, -0.15550119100688872, 0.39887719696641644, 0.08688444399211387, 0.20486226727371104, 0.05835151368955849, 0.2574316478778862, 0.1751292125653973, 0.013260973261904755, 0.06420906663300809, 0.15867274116714147, 0.13121557907354806, 0.037610700261376966, -0.2482835151670522, -0.004826347872784192, 0.12524067964535457]
|
1,803.06688
|
Height estimates for constant mean curvature graphs in $\mathrm{Nil}_3$
and $\widetilde{PSL}_2(\mathbb{R})$
|
In this paper we obtain height estimates for compact, constant mean curvature
vertical graphs in the homogeneous spaces $\mathrm{Nil}_3$ and
$\widetilde{PSL}_2(\mathbb{R})$. As a straightforward consequence, we announce
a structure-type result for proper graphs defined on relatively compact
domains.
|
math.DG
|
in this paper we obtain height estimates for compact constant mean curvature vertical graphs in the homogeneous spaces mathrmnil_3 and widetildepsl_2mathbbr as a straightforward consequence we announce a structuretype result for proper graphs defined on relatively compact domains
|
[['in', 'this', 'paper', 'we', 'obtain', 'height', 'estimates', 'for', 'compact', 'constant', 'mean', 'curvature', 'vertical', 'graphs', 'in', 'the', 'homogeneous', 'spaces', 'mathrmnil_3', 'and', 'widetildepsl_2mathbbr', 'as', 'a', 'straightforward', 'consequence', 'we', 'announce', 'a', 'structuretype', 'result', 'for', 'proper', 'graphs', 'defined', 'on', 'relatively', 'compact', 'domains']]
|
[-0.1631029515380138, 0.08553074256173875, -0.042427853779181054, 0.12283564303499206, -0.1346394619169204, -0.050948533940276035, 0.04601641036386259, 0.4437234523264985, -0.2310605392742314, -0.23737748839745396, 0.13906136482929518, -0.16168998230836892, -0.11121521645078533, 0.2652537418823493, -0.16068538660673717, -0.02462181456289009, 0.10483151115477085, 0.04078822193275157, -0.06697751346387361, -0.2076649872684165, 0.3945040118047281, -0.04782510249826469, 0.15624752748561532, 0.10654179565302145, 0.1057375380524287, -0.0018032869005477742, -0.042537765687723696, 0.0932785495135345, -0.2563800730889565, 0.12744748597278407, 0.21520578747272098, 0.024935943748507845, 0.2269014209312828, -0.3211175050390394, -0.20181020437494704, 0.14811902136639937, 0.12027645934569209, 0.055488151743223794, -0.05631528291422384, -0.25445175180701834, 0.10028206478608281, -0.11675681580642336, -0.20535044176013847, -0.061622993849021826, 0.07913914328367498, 0.019813292463751214, -0.25878522623526423, 0.0770974841557051, 0.13189277246496395, 0.10283690583156913, -0.09286523252529533, -0.09744418455336831, 0.0244062188767681, 0.11076760461161796, -0.04691571585441891, 0.08158526769349057, 0.043551559020814146, -0.04423442021576002, -0.10427011007835206, 0.3355851519460741, -0.16929506848100573, -0.23209316459925552, 0.13009715552509174, -0.11671169597263399, -0.18551079118869415, 0.055743006744274966, 0.2014863345968096, 0.21692512223595067, -0.07732185733651645, 0.11056243939368103, -0.08071411079972197, 0.08279710794235334, 0.13226407428125017, 0.02658899069616669, 0.11237796671737574, 0.13139500428530337, 0.20372246553827272, 0.13741708529720964, 0.0043852279685731785, -0.0189849728592794, -0.326269978265229, -0.1940915245366724, -0.18235737544876574, 0.11739873165558827, -0.15492745396936938, -0.2723586052460106, 0.3417563970494819, 0.0011330566025878255, 0.20449901980004812, 0.1625210956278208, 0.23848941657496125, 0.021638781013040755, 0.04362417652737349, 0.14717016550467202, 0.14868029118760637, 0.21731710978048413, 0.0807693469534187, -0.04521441743954232, 0.01416807067825606, 0.10512904092473419]
|
1,803.06689
|
Controllability of Symmetric Spin Networks
|
We consider a network of n spin 1/2 systems which are pairwise interacting
via Ising interaction and are controlled by the same electro-magnetic control
field. Such a system presents symmetries since the Hamiltonian is unchanged if
we permute two spins. This prevents full (operator) controllability in that not
every unitary evolution can be obtained. We prove however that controllability
is verified if we restrict ourselves to unitary evolutions which preserve the
above permutation invariance. For low dimensional cases, n=2 and n=3, we
provide an analysis of the Lie group of available evolutions and give explicit
control laws to transfer between any two permutation invariant states. This
class of states includes highly entangled states such as GHZ states and W
states, which are of interest in quantum information.
|
quant-ph math.OC
|
we consider a network of n spin 12 systems which are pairwise interacting via ising interaction and are controlled by the same electromagnetic control field such a system presents symmetries since the hamiltonian is unchanged if we permute two spins this prevents full operator controllability in that not every unitary evolution can be obtained we prove however that controllability is verified if we restrict ourselves to unitary evolutions which preserve the above permutation invariance for low dimensional cases n2 and n3 we provide an analysis of the lie group of available evolutions and give explicit control laws to transfer between any two permutation invariant states this class of states includes highly entangled states such as ghz states and w states which are of interest in quantum information
|
[['we', 'consider', 'a', 'network', 'of', 'n', 'spin', '12', 'systems', 'which', 'are', 'pairwise', 'interacting', 'via', 'ising', 'interaction', 'and', 'are', 'controlled', 'by', 'the', 'same', 'electromagnetic', 'control', 'field', 'such', 'a', 'system', 'presents', 'symmetries', 'since', 'the', 'hamiltonian', 'is', 'unchanged', 'if', 'we', 'permute', 'two', 'spins', 'this', 'prevents', 'full', 'operator', 'controllability', 'in', 'that', 'not', 'every', 'unitary', 'evolution', 'can', 'be', 'obtained', 'we', 'prove', 'however', 'that', 'controllability', 'is', 'verified', 'if', 'we', 'restrict', 'ourselves', 'to', 'unitary', 'evolutions', 'which', 'preserve', 'the', 'above', 'permutation', 'invariance', 'for', 'low', 'dimensional', 'cases', 'n2', 'and', 'n3', 'we', 'provide', 'an', 'analysis', 'of', 'the', 'lie', 'group', 'of', 'available', 'evolutions', 'and', 'give', 'explicit', 'control', 'laws', 'to', 'transfer', 'between', 'any', 'two', 'permutation', 'invariant', 'states', 'this', 'class', 'of', 'states', 'includes', 'highly', 'entangled', 'states', 'such', 'as', 'ghz', 'states', 'and', 'w', 'states', 'which', 'are', 'of', 'interest', 'in', 'quantum', 'information']]
|
[-0.1856223459953193, 0.20947800283093376, -0.03299203990980631, 0.04052710882938049, -0.020911340618242076, -0.1969072882482034, 0.0007076103764578817, 0.3856986289125259, -0.2597872135229409, -0.2712909365292844, 0.10546821095489377, -0.26209324757810537, -0.11118608331637765, 0.14455594581471184, -0.015232471587855047, 0.05756378452674904, 0.07130519972424808, 0.049951422068805575, -0.11159331038205583, -0.23086923128543935, 0.3386641945725437, -0.036434721671902814, 0.25214583813176145, 0.017628696677458332, 0.11178298877170822, 0.05098899601460031, 0.04959332732498411, -0.030517719504433178, -0.08099051232426335, 0.07522896501578494, 0.2730607964821695, 0.11027666334407478, 0.21041054086481023, -0.42894280542262947, -0.18861747628781855, 0.13513982994848583, 0.14680459335406024, 0.16366349546125114, -0.03605909228845551, -0.2983308921157434, 0.07375539287807435, -0.17632710239959984, -0.12545639706599548, -0.12288376188829658, 0.038640844002256064, -0.01837816866257734, -0.2669622218932986, 0.06445840427718001, 0.10061901731519249, 0.06870294551504409, -0.04949108433843715, -0.039798875310912904, -0.06595839750696356, 0.17139883449770452, -0.030747314248652027, -0.019019211340864286, 0.1041405988177908, -0.10438076318426133, -0.14615229299240637, 0.3693493921053046, -0.023432759639594382, -0.25527020043961146, 0.18414194905749104, -0.15414416472112216, -0.17747187740939457, 0.06970528316112073, 0.12748115454015768, 0.11585983603195411, -0.1352022542613861, 0.12964142317077929, -0.06128728063777089, 0.1588026736001301, 0.029719736210737875, 0.07423698689099255, 0.17622247134797334, 0.07810011447781301, 0.11256135248040092, 0.1681674695014587, 0.013319253749177447, -0.0969532244567444, -0.3343297533881594, -0.1570800201065369, -0.20025234309017775, 0.12567787050504667, -0.040635793796519555, -0.12477311454933342, 0.3994929826796407, 0.13592564672603838, 0.1810348498869658, 0.06105579723930353, 0.18975917475782042, 0.1284078907205056, 0.04639936063262656, 0.12876275721864086, 0.2254369122628856, 0.16872398319331502, -0.0014409604519018977, -0.21511628079103437, 0.007516067401748004, 0.059566235008436864]
|
1,803.0669
|
Non-reciprocal Components Based on Switched Transmission Lines
|
Non-reciprocal components, such as isolators and circulators, are critical to
wireless communication and radar applications. Traditionally, non-reciprocal
components have been implemented using ferrite materials, which exhibit
non-reciprocity under the influence of an external magnetic field. However,
ferrite materials cannot be integrated into IC fabrication processes, and
consequently are bulky and expensive. In the recent past, there has been strong
interest in achieving non-reciprocity in a non-magnetic IC-compatible fashion
using spatio-temporal modulation. In this paper, we present a general approach
to non-reciprocity based on switched transmission lines. Switched transmission
lines enable broadband, lossless and compact non-reciprocity, and a wide range
of non-reciprocal functionalities, including non-reciprocal phase shifters,
ultra-broadband gyrators and isolators, frequency-conversion isolators, and
high-linearity/high-frequency/ultra-broadband circulators. We present a
detailed theoretical analysis of the various non-idealities that impact
insertion loss and provide design guidelines. The theory is validated by
experimental results from discrete-component-based gyrators and isolators, and
a 25GHz circulator fabricated in 45nm SOI CMOS technology.
|
eess.SP
|
nonreciprocal components such as isolators and circulators are critical to wireless communication and radar applications traditionally nonreciprocal components have been implemented using ferrite materials which exhibit nonreciprocity under the influence of an external magnetic field however ferrite materials cannot be integrated into ic fabrication processes and consequently are bulky and expensive in the recent past there has been strong interest in achieving nonreciprocity in a nonmagnetic iccompatible fashion using spatiotemporal modulation in this paper we present a general approach to nonreciprocity based on switched transmission lines switched transmission lines enable broadband lossless and compact nonreciprocity and a wide range of nonreciprocal functionalities including nonreciprocal phase shifters ultrabroadband gyrators and isolators frequencyconversion isolators and highlinearityhighfrequencyultrabroadband circulators we present a detailed theoretical analysis of the various nonidealities that impact insertion loss and provide design guidelines the theory is validated by experimental results from discretecomponentbased gyrators and isolators and a 25ghz circulator fabricated in 45nm soi cmos technology
|
[['nonreciprocal', 'components', 'such', 'as', 'isolators', 'and', 'circulators', 'are', 'critical', 'to', 'wireless', 'communication', 'and', 'radar', 'applications', 'traditionally', 'nonreciprocal', 'components', 'have', 'been', 'implemented', 'using', 'ferrite', 'materials', 'which', 'exhibit', 'nonreciprocity', 'under', 'the', 'influence', 'of', 'an', 'external', 'magnetic', 'field', 'however', 'ferrite', 'materials', 'can', 'not', 'be', 'integrated', 'into', 'ic', 'fabrication', 'processes', 'and', 'consequently', 'are', 'bulky', 'and', 'expensive', 'in', 'the', 'recent', 'past', 'there', 'has', 'been', 'strong', 'interest', 'in', 'achieving', 'nonreciprocity', 'in', 'a', 'nonmagnetic', 'iccompatible', 'fashion', 'using', 'spatiotemporal', 'modulation', 'in', 'this', 'paper', 'we', 'present', 'a', 'general', 'approach', 'to', 'nonreciprocity', 'based', 'on', 'switched', 'transmission', 'lines', 'switched', 'transmission', 'lines', 'enable', 'broadband', 'lossless', 'and', 'compact', 'nonreciprocity', 'and', 'a', 'wide', 'range', 'of', 'nonreciprocal', 'functionalities', 'including', 'nonreciprocal', 'phase', 'shifters', 'ultrabroadband', 'gyrators', 'and', 'isolators', 'frequencyconversion', 'isolators', 'and', 'highlinearityhighfrequencyultrabroadband', 'circulators', 'we', 'present', 'a', 'detailed', 'theoretical', 'analysis', 'of', 'the', 'various', 'nonidealities', 'that', 'impact', 'insertion', 'loss', 'and', 'provide', 'design', 'guidelines', 'the', 'theory', 'is', 'validated', 'by', 'experimental', 'results', 'from', 'discretecomponentbased', 'gyrators', 'and', 'isolators', 'and', 'a', '25ghz', 'circulator', 'fabricated', 'in', '45nm', 'soi', 'cmos', 'technology']]
|
[-0.20517903945946706, 0.12162567306170316, -0.012559011100343995, -0.08596359059713732, -0.12711222222062693, -0.22611636963971202, 0.020033008863333784, 0.543290024720668, -0.20155041815798266, -0.2699468771567921, 0.10674232999821577, -0.2445625756635921, -0.22300190746394638, 0.29821095583668233, -0.04354417581245108, 0.12285306220691578, -0.0328838448009752, -0.1499598461271376, -0.030296463627570606, -0.13222946405176414, 0.208611185507228, 0.027417276934203174, 0.4004118017535778, 0.0696651132429609, 0.0926621158985749, -0.003447758921062927, 0.057946701442025406, -0.04416037173759119, -0.06895793293165446, 0.08458631635442668, 0.33537703842302063, 0.034623419689440646, 0.18817212220183968, -0.4966723558015884, -0.2736578394591906, 0.040324495849656125, 0.16698469396443197, 0.09650845925728456, -0.13703973042653886, -0.28863708234812113, 0.07700541882708765, -0.17470948794990585, -0.059274828989740486, -0.07927600446832823, -0.0130251942596587, 0.04816660658970743, -0.2595894400827781, -0.0484653361890392, 0.060085224398576165, 0.14570764928532678, -0.01877364144946625, -0.07989380171665544, 0.0013803331542066206, 0.06465603208498043, -0.07206989145986857, -0.0442237943499136, 0.17065489882705245, -0.07989546248013628, -0.16404721765699826, 0.36532198223194073, -0.014895266037224335, -0.14553064301463903, 0.14834241419680588, -0.0625770730483863, -0.0354097464024485, 0.10742094867034918, 0.24480983953362975, 0.052993730115369446, -0.16996748260301509, 0.02817667177246786, 0.057971178554759355, 0.20318092347968833, 0.08818817610268061, 0.18830930067453033, 0.24128922872440098, 0.21896092534625258, 0.03411603407099998, 0.1339932134560632, -0.06720410156355915, 0.0056935659445383965, -0.23369834648165244, -0.1427278113049254, -0.17237798015440942, 0.04345815434370546, -0.05058209475000873, -0.15559048009914608, 0.36007595254911806, 0.16502742000301582, 0.09169280881801539, -0.04692689908799271, 0.38776681925249257, 0.09690451156728433, 0.12392853436614173, 0.032854708334662364, 0.3164830133562384, 0.18578880316474372, 0.17503877763493364, -0.18663183338727096, 0.03946350029216215, -0.09862982011187116]
|
1,803.06691
|
On the Absence of a Normal Nonabelian Sylow Subgroup
|
Let $G$ be a finite solvable group. We show that $G$ does not have a normal
nonabelian Sylow $p$-subgroup when its prime character degree graph $\Delta(G)$
satisfies a technical hypothesis.
|
math.GR
|
let g be a finite solvable group we show that g does not have a normal nonabelian sylow psubgroup when its prime character degree graph deltag satisfies a technical hypothesis
|
[['let', 'g', 'be', 'a', 'finite', 'solvable', 'group', 'we', 'show', 'that', 'g', 'does', 'not', 'have', 'a', 'normal', 'nonabelian', 'sylow', 'psubgroup', 'when', 'its', 'prime', 'character', 'degree', 'graph', 'deltag', 'satisfies', 'a', 'technical', 'hypothesis']]
|
[-0.2990201458024482, 0.1899887690631052, -0.19995024055242538, 0.022232782918338974, -0.25761794901142515, -0.25827234610915184, 0.015413642913335935, 0.39243146220687775, -0.29558611835042636, -0.21533311208089193, 0.00467077229792873, -0.2446469775090615, -0.10135733416924873, 0.13721274059886734, -0.18030151234318811, -0.1535399299056735, 0.12487719859927893, 0.25217371359467505, 0.001797143486328423, -0.3320214353550303, 0.24738041687135895, -0.15950530323510367, 0.2247286878914262, 0.07717855245185395, 0.07821592949330806, 0.018896885154147943, 0.13920137494181592, 0.049938873411156236, -0.15433450497342469, -0.06103130156795184, 0.3385866542036335, 0.06509544464449088, 0.29558297837502323, -0.3601890649646521, -0.19383782496054966, 0.3724247691531976, 0.13894135116909942, -0.09443154462302725, -0.036421177349984644, -0.20207847449928523, 0.27027013385668397, -0.25425626568467125, -0.19301315791284043, -0.05894672165935238, 0.14789146517092983, -0.06220679574956497, -0.27300784676335754, -0.023052541818469763, 0.1615278895944357, 0.17992508390683118, 0.127185960218776, -0.17512544818843404, -0.04935560543090105, 0.029919213798712006, -0.08998550213873387, 0.05501902879526218, 0.05535272636431424, -0.11878698412328959, -0.1177626576119413, 0.43827719446271657, -0.09064211204337577, -0.16642630603164435, 0.057430042792111634, -0.24561839529002708, -0.2782427941759427, 0.0941118418549498, 0.05801490241040786, 0.1364864033802102, 0.04289160591773301, 0.2926891315728426, -0.200694633834064, 0.15990028232336045, 0.009739574044942856, -0.11512127802707255, 0.09316579749186833, 0.05203958300407976, 0.10857334687219312, 0.08138107653940096, 0.10789535281558832, 0.26208423930220304, -0.39008278846740724, -0.13695071215430896, -0.2807527881115675, 0.20401487357497292, -0.11695095885079354, -0.17695670537650585, 0.4180281468977531, 0.04241431270493194, -0.002774648554623127, 0.15266024187828103, 0.13977292291820048, 0.05388494258125623, 0.06464970315185686, 0.18870651920636494, -0.0244835260634621, 0.31088375219454367, -0.25440733786672354, -0.23884074854043622, 0.04137861398824801, 0.21694051790982485]
|
1,803.06692
|
Radial Schur multipliers on some generalisations of trees
|
We give a characterisation of radial Schur multipliers on finite products of
trees. The equivalent condition is that a certain generalised Hankel matrix
involving the discrete derivatives of the radial function is a trace class
operator. This extends Haagerup, Steenstrup and Szwarc's result for trees. The
same condition can be expressed in terms of Besov spaces on the torus. We also
prove a similar result for products of hyperbolic graphs and provide a
sufficient condition for a function to define a radial Schur multiplier on a
finite dimensional CAT(0) cube complex.
|
math.OA
|
we give a characterisation of radial schur multipliers on finite products of trees the equivalent condition is that a certain generalised hankel matrix involving the discrete derivatives of the radial function is a trace class operator this extends haagerup steenstrup and szwarcs result for trees the same condition can be expressed in terms of besov spaces on the torus we also prove a similar result for products of hyperbolic graphs and provide a sufficient condition for a function to define a radial schur multiplier on a finite dimensional cat0 cube complex
|
[['we', 'give', 'a', 'characterisation', 'of', 'radial', 'schur', 'multipliers', 'on', 'finite', 'products', 'of', 'trees', 'the', 'equivalent', 'condition', 'is', 'that', 'a', 'certain', 'generalised', 'hankel', 'matrix', 'involving', 'the', 'discrete', 'derivatives', 'of', 'the', 'radial', 'function', 'is', 'a', 'trace', 'class', 'operator', 'this', 'extends', 'haagerup', 'steenstrup', 'and', 'szwarcs', 'result', 'for', 'trees', 'the', 'same', 'condition', 'can', 'be', 'expressed', 'in', 'terms', 'of', 'besov', 'spaces', 'on', 'the', 'torus', 'we', 'also', 'prove', 'a', 'similar', 'result', 'for', 'products', 'of', 'hyperbolic', 'graphs', 'and', 'provide', 'a', 'sufficient', 'condition', 'for', 'a', 'function', 'to', 'define', 'a', 'radial', 'schur', 'multiplier', 'on', 'a', 'finite', 'dimensional', 'cat0', 'cube', 'complex']]
|
[-0.13519451091212503, 0.09499192593901763, -0.09882867186633723, 0.11747234245615729, -0.1269074756275402, -0.07499055046943968, -0.00574571458790242, 0.3515063571963417, -0.28972106505436507, -0.15486576413903175, 0.1621240138330005, -0.18838962769721834, -0.12452024991592664, 0.2017760495315149, -0.11932656707064238, 0.03846464418084099, 0.08683439060062002, 0.07033826926954645, -0.14444555841082854, -0.24729155097156763, 0.4038627717769548, -0.0313267648596777, 0.1866384797698159, 0.10066039128270879, 0.1414109083059966, 0.015880630942835903, -0.04995022421922493, 0.017166648687941304, -0.16486930454012824, 0.10057935526390466, 0.22366263210940895, 0.10429601136103189, 0.265595839105107, -0.3500708509864432, -0.15382908770730824, 0.1973134446261304, 0.12309358175320739, -0.019101770511001682, -0.029400085801457504, -0.2630192729947942, 0.07598013864578994, -0.17337847724975494, -0.1846760783470079, -0.06873663949382523, 0.011602193870571223, 0.05966151086090321, -0.36258164701167117, 0.05142168042196348, 0.125658542692159, 0.07619770627803682, -0.09986638751147796, -0.10826203341627222, -0.0007984390157913224, 0.06397983238226577, -0.07478772984357195, 0.013740116379778372, 0.07888289052323344, -0.02653139880755354, -0.09624961026933755, 0.3539288875678282, -0.07526542534109916, -0.31497024171305504, 0.15281146511519222, -0.17980193140592132, -0.16715147356722462, 0.08653604937455711, 0.13509357163912794, 0.17917654874703187, -0.08745510945243112, 0.1599614419699699, -0.16237418574354287, 0.08496980897538113, 0.14414731924830193, 0.024843050193125278, 0.08919885815278197, 0.0486559312466239, 0.19472678960039375, 0.20990369260458935, 0.04823646256098461, -0.018348454625288214, -0.3449225260384297, -0.2517144333445624, -0.1813228494812096, 0.1016977006370683, -0.180316387691072, -0.2845503411862706, 0.4005321364514948, 0.016374635067375985, 0.17713770553930086, 0.15348315000595536, 0.20803221705202224, 0.14546183970746365, 0.10708163841889146, 0.01780018783200616, 0.11071425413168716, 0.25717171093742, 0.056141561917500214, -0.11680082114559881, 0.031323510384333605, 0.26065817799712165]
|
1,803.06693
|
Persistent incomplete mixing in reactive flows
|
We present an effective stochastic advection-diffusion-reaction (SADR) model
that explains incomplete mixing typically observed in transport with
bimolecular reactions. Unlike traditional advection-dispersion-reaction models,
the SADR model describes mechanical and diffusive mixing as two separate
processes. In the SADR model, mechanical mixing is driven by random advective
velocity with the variance given by the coefficient of mechanical dispersion.
The diffusive mixing is modeled as a Fickian diffusion with the effective
diffusion coefficient. We demonstrate that the sum of the two coefficients is
equal to the dispersion coefficients, but only the effective diffusion
coefficient contributes to the mixing-controlled reactions, indicating that
such systems do not get fully mixed at the Representative Elementary Volume
scale where the deterministic equations and dispersion coefficient are defined.
We use the experimental results of Gramling et al. \cite{Gramling} to show that
for transport and bimolecular reactions in porous media, the SADR model is
significantly more accurate than the traditional dispersion model, which
overestimates the concentration of the reaction product by as much as 60\%.
|
physics.flu-dyn
|
we present an effective stochastic advectiondiffusionreaction sadr model that explains incomplete mixing typically observed in transport with bimolecular reactions unlike traditional advectiondispersionreaction models the sadr model describes mechanical and diffusive mixing as two separate processes in the sadr model mechanical mixing is driven by random advective velocity with the variance given by the coefficient of mechanical dispersion the diffusive mixing is modeled as a fickian diffusion with the effective diffusion coefficient we demonstrate that the sum of the two coefficients is equal to the dispersion coefficients but only the effective diffusion coefficient contributes to the mixingcontrolled reactions indicating that such systems do not get fully mixed at the representative elementary volume scale where the deterministic equations and dispersion coefficient are defined we use the experimental results of gramling et al citegramling to show that for transport and bimolecular reactions in porous media the sadr model is significantly more accurate than the traditional dispersion model which overestimates the concentration of the reaction product by as much as 60
|
[['we', 'present', 'an', 'effective', 'stochastic', 'advectiondiffusionreaction', 'sadr', 'model', 'that', 'explains', 'incomplete', 'mixing', 'typically', 'observed', 'in', 'transport', 'with', 'bimolecular', 'reactions', 'unlike', 'traditional', 'advectiondispersionreaction', 'models', 'the', 'sadr', 'model', 'describes', 'mechanical', 'and', 'diffusive', 'mixing', 'as', 'two', 'separate', 'processes', 'in', 'the', 'sadr', 'model', 'mechanical', 'mixing', 'is', 'driven', 'by', 'random', 'advective', 'velocity', 'with', 'the', 'variance', 'given', 'by', 'the', 'coefficient', 'of', 'mechanical', 'dispersion', 'the', 'diffusive', 'mixing', 'is', 'modeled', 'as', 'a', 'fickian', 'diffusion', 'with', 'the', 'effective', 'diffusion', 'coefficient', 'we', 'demonstrate', 'that', 'the', 'sum', 'of', 'the', 'two', 'coefficients', 'is', 'equal', 'to', 'the', 'dispersion', 'coefficients', 'but', 'only', 'the', 'effective', 'diffusion', 'coefficient', 'contributes', 'to', 'the', 'mixingcontrolled', 'reactions', 'indicating', 'that', 'such', 'systems', 'do', 'not', 'get', 'fully', 'mixed', 'at', 'the', 'representative', 'elementary', 'volume', 'scale', 'where', 'the', 'deterministic', 'equations', 'and', 'dispersion', 'coefficient', 'are', 'defined', 'we', 'use', 'the', 'experimental', 'results', 'of', 'gramling', 'et', 'al', 'citegramling', 'to', 'show', 'that', 'for', 'transport', 'and', 'bimolecular', 'reactions', 'in', 'porous', 'media', 'the', 'sadr', 'model', 'is', 'significantly', 'more', 'accurate', 'than', 'the', 'traditional', 'dispersion', 'model', 'which', 'overestimates', 'the', 'concentration', 'of', 'the', 'reaction', 'product', 'by', 'as', 'much', 'as', '60']]
|
[-0.06667255404036766, 0.18185556282946752, -0.028303906223143913, 0.036102715072627724, -0.03978485820037913, -0.1449601808919977, -0.001826406741497661, 0.337020805654076, -0.31156879545195154, -0.27192025081443094, 0.036409930063931534, -0.29956749774104247, -0.15683013574324514, 0.1796247023122065, 0.0006317357415550508, 0.038701458691270806, 0.0178435031935984, -0.013278685638715336, -0.011598588407405314, -0.18903530159382367, 0.2793137506393293, 0.0628794274218609, 0.2702039495279064, 0.0520387892639893, 0.1194778523933531, -0.017580404217737766, -0.03716825207901056, 0.029101326574565718, -0.12610867728162814, 0.0944312063668586, 0.1918015005334148, -0.004956976819120667, 0.1980419864712363, -0.4149401620018976, -0.30497849271261346, 0.0552729569672624, 0.17001494496437275, 0.1173869328097686, -0.02373623035098583, -0.1980029748112786, 0.006027023207990487, -0.1758190537945716, -0.1016738259403515, -0.05972375870472323, 0.026675070027472235, 0.033559432333232435, -0.30401798947914244, 0.20338168766001735, 0.050100002980625336, 0.03136153480872238, -0.05188560676175324, -0.15880998645114935, -0.047442836332723407, 0.0856055073908593, 0.02834204099772418, -0.04407037029587778, 0.15625858433727471, -0.11847259469353165, -0.06205875446528562, 0.4238154217657959, -0.1269588298811556, -0.23778688021438435, 0.20314511329084178, -0.14050638883380345, -0.05445379782982308, 0.15060657037399205, 0.1647208119325477, 0.10777501329962462, -0.18299361925137922, 0.026370799416416194, -0.03997272687844155, 0.15633123455157766, 0.028044615675083883, -0.02509517949417325, 0.09777183184811583, 0.18782961777085724, 0.02363642714946228, 0.05496936946631655, -0.04535269930221689, -0.14503385703560775, -0.2635444421264017, -0.1522300518238367, -0.154177897332659, 0.08559243502018565, -0.09797622059713663, -0.1571389399011808, 0.3257169896833873, 0.15207535504117792, 0.21659619704837357, 0.06046110240562585, 0.28821528197031904, 0.1669154898392071, 0.060410621261761235, 0.09003346617922095, 0.257910721548233, 0.14841867823216584, 0.11169766070195503, -0.2545663638874614, 0.15022131394983435, 0.06180754398171464]
|
1,803.06694
|
Asymptotic properties of integrals of quotients, when the numerator
oscillates and denominator degenerates
|
We study asymptotical expansion as $\nu\to0$ for integrals over ${ \mathbb{R}
}^{2d}=\{(x,y)\}$ of quotients of the form $F(x,y) \cos(\lambda x\cdot y) \big/
\big( (x\cdot y)^2+\nu^2\big)$, where $\lambda\ge 0$ and $F$ decays at infinity
sufficiently fast. Integrals of this kind appear in the theory of wave
turbulence.
|
math-ph math.MP
|
we study asymptotical expansion as nuto0 for integrals over mathbbr 2dxy of quotients of the form fxy coslambda xcdot y big big xcdot y2nu2big where lambdage 0 and f decays at infinity sufficiently fast integrals of this kind appear in the theory of wave turbulence
|
[['we', 'study', 'asymptotical', 'expansion', 'as', 'nuto0', 'for', 'integrals', 'over', 'mathbbr', '2dxy', 'of', 'quotients', 'of', 'the', 'form', 'fxy', 'coslambda', 'xcdot', 'y', 'big', 'big', 'xcdot', 'y2nu2big', 'where', 'lambdage', '0', 'and', 'f', 'decays', 'at', 'infinity', 'sufficiently', 'fast', 'integrals', 'of', 'this', 'kind', 'appear', 'in', 'the', 'theory', 'of', 'wave', 'turbulence']]
|
[-0.2230036107886752, 0.12816380681893366, -0.08401950441343202, 0.09700673019291241, -0.019650530371687968, -0.11935191385617311, -0.002404000334949656, 0.25711527809670026, -0.35368012789298187, -0.0773335088848729, 0.09764622799279592, -0.34259515772150323, -0.09207026599059728, 0.17452438933436165, -0.00495122250338847, 0.05442407980974002, 0.025011332827323877, 0.08084266315299002, -0.07239547972461548, -0.25176616703075444, 0.3231816375310617, -0.0966170197352767, 0.13547873758414591, -0.005790512945333665, 0.0901723101547263, -4.981446545571089e-05, 0.03578541471638759, -0.08799235359765589, -0.2568235744256526, -0.006029206328094006, 0.31046918545722624, 0.10880633341995152, 0.30795552700080653, -0.3755907013970004, -0.12184114999730479, 0.19270249517549845, 0.2671195492995056, -0.09010093680328944, 0.03971755041063509, -0.26904343686659227, 0.08478337074153718, -0.16331924609204923, -0.1946546733379364, -0.1179688362701034, 0.11306573996659029, 0.08247278096810491, -0.3372162743259899, 0.0780942259483378, 0.060319779525426304, 0.057260658401487904, -0.011021227173676545, -0.14093369950371032, 0.025261929544450886, -0.003909080733799122, 0.114329017883971, 0.14776063276010312, 0.04047329420096834, -0.10745621902804653, 0.00646771932952106, 0.3123284968632189, -0.11543070667275143, -0.17958346193402328, 0.07316710570276799, -0.28768808428536763, -0.17485677234997804, 0.13609924565323375, 0.14194655906811188, 0.1916215839287774, -0.010685811962255022, 0.29965674290724564, 0.019057574639935574, 0.01336365155029026, 0.19087608099322428, 0.009696904495781795, 0.09800027342068708, 0.06137170346284455, 0.047487132251262665, 0.044625416080552066, -0.02478219869292595, -0.0686133853292135, -0.41205938698046585, -0.20975113190202552, -0.1444082595619627, 0.23686616135521696, -0.14104841048372857, -0.2294544175436551, 0.2639809067477472, 0.04178963927552104, 0.20988867025483737, 0.10902042997556484, 0.1794726916334846, 0.13812486930824394, -0.02409798563034697, 0.06616502132436092, 0.0570860962933776, 0.1613216114188121, 0.13205258204040796, -0.15150638270742176, 0.0009998590460533953, 0.1412069279573519]
|
1,803.06695
|
Vortex-like solutions and internal structures of covariant ideal
magnetohydrodynamics
|
We discuss a manifestly covariant formulation of ideal relativistic
magnetohydrodynamics, which has been recently used in astrophysical and
heavy-ion contexts, and compare it to other similar frameworks. We show that
the covariant equations allow for stationary vortex-like solutions that
represent generalizations of the perfect-fluid solutions describing systems in
global equilibrium with rotation. Such solutions are further used to
demonstrate that inhomogeneous Maxwell equations, implicitly included in the
covariant framework, may generate very large electric charge densities. This
suggests that solutions of the covariant formulation may violate in some cases
the assumptions of standard ideal magnetohydrodynamics. Furthermore, we show
that the flow four-vector and conserved currents obtained in the covariant
approach are usually not related to each other, which hinders kinetic-theory
interpretation of the obtained results.
|
nucl-th hep-ph
|
we discuss a manifestly covariant formulation of ideal relativistic magnetohydrodynamics which has been recently used in astrophysical and heavyion contexts and compare it to other similar frameworks we show that the covariant equations allow for stationary vortexlike solutions that represent generalizations of the perfectfluid solutions describing systems in global equilibrium with rotation such solutions are further used to demonstrate that inhomogeneous maxwell equations implicitly included in the covariant framework may generate very large electric charge densities this suggests that solutions of the covariant formulation may violate in some cases the assumptions of standard ideal magnetohydrodynamics furthermore we show that the flow fourvector and conserved currents obtained in the covariant approach are usually not related to each other which hinders kinetictheory interpretation of the obtained results
|
[['we', 'discuss', 'a', 'manifestly', 'covariant', 'formulation', 'of', 'ideal', 'relativistic', 'magnetohydrodynamics', 'which', 'has', 'been', 'recently', 'used', 'in', 'astrophysical', 'and', 'heavyion', 'contexts', 'and', 'compare', 'it', 'to', 'other', 'similar', 'frameworks', 'we', 'show', 'that', 'the', 'covariant', 'equations', 'allow', 'for', 'stationary', 'vortexlike', 'solutions', 'that', 'represent', 'generalizations', 'of', 'the', 'perfectfluid', 'solutions', 'describing', 'systems', 'in', 'global', 'equilibrium', 'with', 'rotation', 'such', 'solutions', 'are', 'further', 'used', 'to', 'demonstrate', 'that', 'inhomogeneous', 'maxwell', 'equations', 'implicitly', 'included', 'in', 'the', 'covariant', 'framework', 'may', 'generate', 'very', 'large', 'electric', 'charge', 'densities', 'this', 'suggests', 'that', 'solutions', 'of', 'the', 'covariant', 'formulation', 'may', 'violate', 'in', 'some', 'cases', 'the', 'assumptions', 'of', 'standard', 'ideal', 'magnetohydrodynamics', 'furthermore', 'we', 'show', 'that', 'the', 'flow', 'fourvector', 'and', 'conserved', 'currents', 'obtained', 'in', 'the', 'covariant', 'approach', 'are', 'usually', 'not', 'related', 'to', 'each', 'other', 'which', 'hinders', 'kinetictheory', 'interpretation', 'of', 'the', 'obtained', 'results']]
|
[-0.11233962991461158, 0.09274876734428107, -0.11484866955876351, 0.10260431806650012, -0.09687441285699606, -0.12618166118487717, -0.09068074264936149, 0.319583903491497, -0.2245649058111012, -0.25371756590902805, 0.05044407399650663, -0.23610126442462206, -0.1421524142920971, 0.17574986373633147, -0.04352022190019488, 0.07627286509232363, 0.04097188881319016, 0.02057010813243687, -0.11315722426213325, -0.19489160504564643, 0.31714246537536384, 0.010524559818208217, 0.2955197394490242, 0.026113467428833245, 0.1304960430264473, -0.05853178646788001, -0.04028904933761805, 0.10298799852943921, -0.13396176630590345, 0.06755785923823714, 0.25041622552648185, 0.11045156972669065, 0.18417554490454496, -0.5082700310051441, -0.2541957015953958, 0.058211294833570716, 0.13186004907265306, 0.17168812213558704, -0.05019857649157348, -0.27452368576824665, 0.0878462386354804, -0.2063554742783308, -0.19172207403182984, -0.18454312681406737, 0.003162560805678368, 0.04502074744505808, -0.2757197782546282, 0.11036774674803018, 0.05224032740294933, -0.020898488604696466, -0.15154372199624777, -0.11411469991877675, -0.03825601348280907, 0.04078669031336903, 0.09754486491810531, 0.014619676625356078, 0.10976728551462292, -0.15124094371451066, -0.11646255007758737, 0.4188940128162503, -0.07050659345276654, -0.29405169839411976, 0.20549818908423184, -0.15535037202946841, -0.18581221163272857, 0.0812203059643507, 0.13277864279970528, 0.16202978928387166, -0.19137123814970255, 0.08414829168329016, -0.07764663057215512, 0.08167901940830052, 0.06696911124885083, 0.039847435291856526, 0.21448913916945458, 0.0453188579166308, 0.043185397281311454, 0.10293216815870256, -0.0020363759105093775, -0.1691344718709588, -0.37187635093927385, -0.14604379276186227, -0.11725108447670937, 0.06537058014620561, -0.06583280082012061, -0.1503088008724153, 0.344072293382138, 0.22380295086465776, 0.10198308305442333, 0.0008324587233364582, 0.2561479056328535, 0.14145205952972173, 0.07021845184266567, 0.13120061646401882, 0.27014243239094504, 0.15707422983646394, 0.12914904823806136, -0.2085072171241045, 0.012486834798008203, 0.10042100582271814]
|
1,803.06696
|
Low emittance muon accelerator studies with production from positrons on
target
|
A new scheme to produce very low emittance muon beams using a positron beam
of about 45~GeV interacting on electrons on target is presented.
One of the innovative topics to be investigated is the behaviour of the
positron beam stored in a low emittance ring with a thin target, that is
directly inserted in the ring chamber to produce muons. Muons can be
immediately collected at the exit of the target and transported to two $\mu^+$
and $\mu^-$ accumulator rings and then accelerated and injected in muon
collider rings. We focus in this paper on the simulation of the e$^+$ beam
interacting with the target, the effect of the target on the 6-D phase space
and the optimization of the e$^+$ ring design to maximize the energy
acceptance. We will investigate the performance of this scheme, ring plus
target system, comparing different multi-turn simulations. The source is
considered for use in a multi-TeV collider in ref.[1]
|
physics.acc-ph
|
a new scheme to produce very low emittance muon beams using a positron beam of about 45gev interacting on electrons on target is presented one of the innovative topics to be investigated is the behaviour of the positron beam stored in a low emittance ring with a thin target that is directly inserted in the ring chamber to produce muons muons can be immediately collected at the exit of the target and transported to two mu and mu accumulator rings and then accelerated and injected in muon collider rings we focus in this paper on the simulation of the e beam interacting with the target the effect of the target on the 6d phase space and the optimization of the e ring design to maximize the energy acceptance we will investigate the performance of this scheme ring plus target system comparing different multiturn simulations the source is considered for use in a multitev collider in ref1
|
[['a', 'new', 'scheme', 'to', 'produce', 'very', 'low', 'emittance', 'muon', 'beams', 'using', 'a', 'positron', 'beam', 'of', 'about', '45gev', 'interacting', 'on', 'electrons', 'on', 'target', 'is', 'presented', 'one', 'of', 'the', 'innovative', 'topics', 'to', 'be', 'investigated', 'is', 'the', 'behaviour', 'of', 'the', 'positron', 'beam', 'stored', 'in', 'a', 'low', 'emittance', 'ring', 'with', 'a', 'thin', 'target', 'that', 'is', 'directly', 'inserted', 'in', 'the', 'ring', 'chamber', 'to', 'produce', 'muons', 'muons', 'can', 'be', 'immediately', 'collected', 'at', 'the', 'exit', 'of', 'the', 'target', 'and', 'transported', 'to', 'two', 'mu', 'and', 'mu', 'accumulator', 'rings', 'and', 'then', 'accelerated', 'and', 'injected', 'in', 'muon', 'collider', 'rings', 'we', 'focus', 'in', 'this', 'paper', 'on', 'the', 'simulation', 'of', 'the', 'e', 'beam', 'interacting', 'with', 'the', 'target', 'the', 'effect', 'of', 'the', 'target', 'on', 'the', '6d', 'phase', 'space', 'and', 'the', 'optimization', 'of', 'the', 'e', 'ring', 'design', 'to', 'maximize', 'the', 'energy', 'acceptance', 'we', 'will', 'investigate', 'the', 'performance', 'of', 'this', 'scheme', 'ring', 'plus', 'target', 'system', 'comparing', 'different', 'multiturn', 'simulations', 'the', 'source', 'is', 'considered', 'for', 'use', 'in', 'a', 'multitev', 'collider', 'in', 'ref1']]
|
[-0.10453861948842995, 0.14996054370959216, -0.091832168895799, 0.06942074767534788, -0.01648194423148361, -0.13806141306681988, -0.018348416956052042, 0.390387419038094, -0.26392775911312455, -0.2918206074585517, 0.0414070734494509, -0.2946220819826405, 0.05657129481028861, 0.20249763073829505, -0.02618772043243576, 0.03569115986987853, 0.06554967553790611, 0.02257919967479001, -0.048933873121710256, -0.24068691284180835, 0.28787696099756527, 0.16855229005122033, 0.2699753449429782, 0.05817297562652339, 0.14882355281868234, 0.004758413588532653, -0.006852388214797546, -0.021337794653589252, -0.10049493733416827, 0.11516281351065025, 0.2341293467205758, 0.10706277040299028, 0.19179193811634412, -0.4417915493249893, -0.14523942119632968, 0.1120564165429618, 0.1260887884045354, 0.057999512258296214, -0.1005271542787504, -0.25978259580771035, 0.10235055664685579, -0.2036441795151824, -0.12581964341016152, 0.013304819782766012, -0.014470633376055421, 0.054015650413184166, -0.2850053962667097, -0.02428685549276475, -0.0001480623017041347, 0.029407076221198227, -0.04157148545178083, -0.11117774094022118, 0.02036297145502594, 0.053513947203427024, 0.04871977748086628, 0.06331463331261124, 0.18153308395845577, -0.11140200958694689, -0.10943637785609238, 0.3677980963749668, -0.051288134625886016, -0.19359906604670238, 0.16836299195300597, -0.22644123967545918, -0.03569826603723833, 0.1981452603567726, 0.2544341878249095, 0.12432183448870021, -0.15534975169560847, 0.06674216439326604, -0.03693201408672254, 0.14636303028629088, 0.08040484928567775, 0.012317480776124658, 0.23176265727931586, 0.21932059493011388, 0.08019048987532584, 0.16893832796127894, -0.16121400131706673, -0.008084324788517104, -0.3332348834150113, -0.16580379508340207, -0.1665365330558509, 0.03510949464562612, 0.046048700732334955, -0.07300868499516629, 0.4183698086358979, 0.10376519797286257, 0.21059388846147042, -0.06593574106451482, 0.3359202051487489, 0.04698187509366574, 0.051836031831230804, 0.029380703596241523, 0.22222286303981376, 0.09055253165850165, 0.13025033416516424, -0.2571176530402273, 0.0005730522680096328, 0.027330036158673465]
|
1,803.06697
|
Higher-order estimates for collapsing Calabi-Yau metrics
|
We prove a uniform C^alpha estimate for collapsing Calabi-Yau metrics on the
total space of a proper holomorphic submersion over the unit ball in C^m. The
usual methods of Calabi, Evans-Krylov, and Caffarelli do not apply to this
setting because the background geometry degenerates. We instead rely on blowup
arguments and on linear and nonlinear Liouville theorems on cylinders. In
particular, as an intermediate step, we use such arguments to prove sharp new
Schauder estimates for the Laplacian on cylinders. If the fibers of the
submersion are pairwise biholomorphic, our method yields a uniform C^infinity
estimate. We then apply these local results to the case of collapsing
Calabi-Yau metrics on compact Calabi-Yau manifolds. In this global setting, the
C^0 estimate required as a hypothesis in our new local C^alpha and C^infinity
estimates is known to hold thanks to earlier work of the second-named author.
|
math.DG math.AP math.CV
|
we prove a uniform calpha estimate for collapsing calabiyau metrics on the total space of a proper holomorphic submersion over the unit ball in cm the usual methods of calabi evanskrylov and caffarelli do not apply to this setting because the background geometry degenerates we instead rely on blowup arguments and on linear and nonlinear liouville theorems on cylinders in particular as an intermediate step we use such arguments to prove sharp new schauder estimates for the laplacian on cylinders if the fibers of the submersion are pairwise biholomorphic our method yields a uniform cinfinity estimate we then apply these local results to the case of collapsing calabiyau metrics on compact calabiyau manifolds in this global setting the c0 estimate required as a hypothesis in our new local calpha and cinfinity estimates is known to hold thanks to earlier work of the secondnamed author
|
[['we', 'prove', 'a', 'uniform', 'calpha', 'estimate', 'for', 'collapsing', 'calabiyau', 'metrics', 'on', 'the', 'total', 'space', 'of', 'a', 'proper', 'holomorphic', 'submersion', 'over', 'the', 'unit', 'ball', 'in', 'cm', 'the', 'usual', 'methods', 'of', 'calabi', 'evanskrylov', 'and', 'caffarelli', 'do', 'not', 'apply', 'to', 'this', 'setting', 'because', 'the', 'background', 'geometry', 'degenerates', 'we', 'instead', 'rely', 'on', 'blowup', 'arguments', 'and', 'on', 'linear', 'and', 'nonlinear', 'liouville', 'theorems', 'on', 'cylinders', 'in', 'particular', 'as', 'an', 'intermediate', 'step', 'we', 'use', 'such', 'arguments', 'to', 'prove', 'sharp', 'new', 'schauder', 'estimates', 'for', 'the', 'laplacian', 'on', 'cylinders', 'if', 'the', 'fibers', 'of', 'the', 'submersion', 'are', 'pairwise', 'biholomorphic', 'our', 'method', 'yields', 'a', 'uniform', 'cinfinity', 'estimate', 'we', 'then', 'apply', 'these', 'local', 'results', 'to', 'the', 'case', 'of', 'collapsing', 'calabiyau', 'metrics', 'on', 'compact', 'calabiyau', 'manifolds', 'in', 'this', 'global', 'setting', 'the', 'c0', 'estimate', 'required', 'as', 'a', 'hypothesis', 'in', 'our', 'new', 'local', 'calpha', 'and', 'cinfinity', 'estimates', 'is', 'known', 'to', 'hold', 'thanks', 'to', 'earlier', 'work', 'of', 'the', 'secondnamed', 'author']]
|
[-0.1109886134913217, -0.02192433257237604, -0.09284467854174888, 0.10971862212318229, -0.12303509823848596, -0.11523031687182891, 0.024651784430413198, 0.3591837792838406, -0.240673195360513, -0.19112705266323043, 0.13021872359725725, -0.24978494161041453, -0.12384152776010321, 0.21479095158429118, -0.18993955059947135, 0.05262445738076672, 0.06132611061265278, 0.043056020558449544, -0.10911523008285763, -0.30126551563282394, 0.4323164955130778, -0.026019886624352593, 0.244688655993539, 0.07899398725001244, 0.10585763446094158, -0.00624429506327336, -0.04369192230903233, -0.012942303082228237, -0.24804226345925903, 0.1506927738405971, 0.20962209813296795, 0.05926986573225198, 0.22928066758645904, -0.4250170617079776, -0.2119764489878738, 0.15652246989338892, 0.1358221555096356, 0.06821171884237426, -0.0027020729725740645, -0.2852331539987871, 0.11572329901294627, -0.07752788365663339, -0.18012902317827362, -0.10862088674750542, 0.0032994650052084276, 0.053263618091781005, -0.25627886629404706, 0.045085000307557896, 0.1573526979643955, 0.04903136510984041, -0.11032649478147505, -0.06477247268129657, -0.02077967823909906, 0.08219291870288241, 0.03977133756496995, 0.08543905726805355, 0.11438599729929895, -0.04404680165316677, -0.07365410653356877, 0.3162155480175797, -0.10102682081439222, -0.26925212133533527, 0.15073631247044736, -0.13676364063414642, -0.18624031715929354, 0.0808869843684887, 0.15353502640128783, 0.2059793145615711, -0.053975262077680476, 0.13802629599457658, -0.09213614838922189, 0.11206865442444622, 0.13351509179725932, -0.017590621811298963, 0.09865517183465676, 0.11005085584959791, 0.18977739899451584, 0.09840126661745469, -0.04700125448976501, -0.06340007084751657, -0.3935664367551605, -0.18870710875166374, -0.16819330943205082, 0.16840510508346698, -0.13483631269991747, -0.19091591786127537, 0.3202420841197535, 0.05590241886804708, 0.2156965496768761, 0.13279457083748034, 0.24241017503017145, 0.04586561574413079, 0.04404307733703819, 0.08095096216938044, 0.22691195847680015, 0.2016210065792418, 0.07985669614653387, -0.10234748163363999, -0.029912268571529746, 0.20308725204247619]
|
1,803.06698
|
Possible interaction between baryons and dark-matter particles revealed
by the first stars
|
The cosmic radio-frequency spectrum is expected to show a strong absorption
signal corresponding to the 21-centimetre-wavelength transition of atomic
hydrogen around redshift 20, which arises from Lyman-alpha radiation from some
of the earliest stars. By observing this 21-centimetre signal - either its
sky-averaged spectrum or maps of its fluctuations, obtained using radio
interferometers - we can obtain information about cosmic dawn, the era when the
first astrophysical sources of light were formed. The recent detection of the
global 21-centimetre spectrum reveals a stronger absorption than the maximum
predicted by existing models, at a confidence level of 3.8 standard deviations.
Here we report that this absorption can be explained by the combination of
radiation from the first stars and excess cooling of the cosmic gas induced by
its interaction with dark matter. Our analysis indicates that the spatial
fluctuations of the 21-centimetre signal at cosmic dawn could be an order of
magnitude larger than previously expected and that the dark-matter particle is
no heavier than several proton masses, well below the commonly predicted mass
of weakly interacting massive particles. Our analysis also confirms that dark
matter is highly non-relativistic and at least moderately cold, and primordial
velocities predicted by models of warm dark matter are potentially detectable.
These results indicate that 21-centimetre cosmology can be used as a
dark-matter probe.
|
astro-ph.CO
|
the cosmic radiofrequency spectrum is expected to show a strong absorption signal corresponding to the 21centimetrewavelength transition of atomic hydrogen around redshift 20 which arises from lymanalpha radiation from some of the earliest stars by observing this 21centimetre signal either its skyaveraged spectrum or maps of its fluctuations obtained using radio interferometers we can obtain information about cosmic dawn the era when the first astrophysical sources of light were formed the recent detection of the global 21centimetre spectrum reveals a stronger absorption than the maximum predicted by existing models at a confidence level of 38 standard deviations here we report that this absorption can be explained by the combination of radiation from the first stars and excess cooling of the cosmic gas induced by its interaction with dark matter our analysis indicates that the spatial fluctuations of the 21centimetre signal at cosmic dawn could be an order of magnitude larger than previously expected and that the darkmatter particle is no heavier than several proton masses well below the commonly predicted mass of weakly interacting massive particles our analysis also confirms that dark matter is highly nonrelativistic and at least moderately cold and primordial velocities predicted by models of warm dark matter are potentially detectable these results indicate that 21centimetre cosmology can be used as a darkmatter probe
|
[['the', 'cosmic', 'radiofrequency', 'spectrum', 'is', 'expected', 'to', 'show', 'a', 'strong', 'absorption', 'signal', 'corresponding', 'to', 'the', '21centimetrewavelength', 'transition', 'of', 'atomic', 'hydrogen', 'around', 'redshift', '20', 'which', 'arises', 'from', 'lymanalpha', 'radiation', 'from', 'some', 'of', 'the', 'earliest', 'stars', 'by', 'observing', 'this', '21centimetre', 'signal', 'either', 'its', 'skyaveraged', 'spectrum', 'or', 'maps', 'of', 'its', 'fluctuations', 'obtained', 'using', 'radio', 'interferometers', 'we', 'can', 'obtain', 'information', 'about', 'cosmic', 'dawn', 'the', 'era', 'when', 'the', 'first', 'astrophysical', 'sources', 'of', 'light', 'were', 'formed', 'the', 'recent', 'detection', 'of', 'the', 'global', '21centimetre', 'spectrum', 'reveals', 'a', 'stronger', 'absorption', 'than', 'the', 'maximum', 'predicted', 'by', 'existing', 'models', 'at', 'a', 'confidence', 'level', 'of', '38', 'standard', 'deviations', 'here', 'we', 'report', 'that', 'this', 'absorption', 'can', 'be', 'explained', 'by', 'the', 'combination', 'of', 'radiation', 'from', 'the', 'first', 'stars', 'and', 'excess', 'cooling', 'of', 'the', 'cosmic', 'gas', 'induced', 'by', 'its', 'interaction', 'with', 'dark', 'matter', 'our', 'analysis', 'indicates', 'that', 'the', 'spatial', 'fluctuations', 'of', 'the', '21centimetre', 'signal', 'at', 'cosmic', 'dawn', 'could', 'be', 'an', 'order', 'of', 'magnitude', 'larger', 'than', 'previously', 'expected', 'and', 'that', 'the', 'darkmatter', 'particle', 'is', 'no', 'heavier', 'than', 'several', 'proton', 'masses', 'well', 'below', 'the', 'commonly', 'predicted', 'mass', 'of', 'weakly', 'interacting', 'massive', 'particles', 'our', 'analysis', 'also', 'confirms', 'that', 'dark', 'matter', 'is', 'highly', 'nonrelativistic', 'and', 'at', 'least', 'moderately', 'cold', 'and', 'primordial', 'velocities', 'predicted', 'by', 'models', 'of', 'warm', 'dark', 'matter', 'are', 'potentially', 'detectable', 'these', 'results', 'indicate', 'that', '21centimetre', 'cosmology', 'can', 'be', 'used', 'as', 'a', 'darkmatter', 'probe']]
|
[-0.07590968051065122, 0.19736381958426608, -0.08576172863292784, 0.10697984789051891, -0.047100800074447224, -0.061094026453146294, -0.005816987758778312, 0.3286839797704791, -0.21162608011703318, -0.3744521724508592, 0.06335572261768566, -0.32315330543443216, -0.039107753510405824, 0.19955618115717597, 0.05422178723124994, -0.0171221989391294, 0.018119386435568298, 0.00013840989170906445, -0.03147635677622155, -0.2153288004806705, 0.2977011849569088, 0.14769608303753626, 0.19875784899664317, 0.037243572218964495, 0.055665870091481204, -0.07807487572319116, -0.07436002646486654, -3.2221764774510154e-05, -0.10625047750878973, 0.07005859495149236, 0.19051955132794388, 0.1319175954715185, 0.18154155087972026, -0.3975292214265749, -0.27316976798573267, 0.15619687979536442, 0.17690176019149711, 0.11629077878023963, -0.0820871410418207, -0.3229737010336033, 0.06628850428495314, -0.15719819853634195, -0.12784755044763355, 0.013669302637464608, -0.03577486643809135, -0.0006245203117874486, -0.2252674536818328, 0.1384820230724236, 0.005535960528909022, 0.00801548435939131, -0.060471988267467906, -0.11730376632853963, -0.05847318508097454, 0.010639082614135178, 0.04972925691766216, 0.02917269669072724, 0.21885575773436963, -0.15972425177891705, -0.07875763745795228, 0.43470846900405985, -0.1677642348981694, -0.008465337584278098, 0.2050002244973762, -0.22064958041085414, -0.14397109516991163, 0.20124834609925057, 0.12501151274449918, 0.08082908121610267, -0.1427984839713948, 0.021124326480612916, -0.004036192802703698, 0.2214975880471886, 0.07803803991905793, 0.0637175139816935, 0.3565354932194438, 0.14449891840707063, 0.04035128111502639, 0.057563517167754645, -0.15934971997463704, -0.0006098024702320496, -0.25713666648112443, -0.0978514682523113, -0.17112714839512827, 0.05686966426933564, -0.11349802712572489, -0.08542220911018646, 0.3505297383332315, 0.15433621512406884, 0.18573760711876308, 0.03219679042134279, 0.3363875398429594, 0.11405909310539115, 0.046117424729918303, 0.06848508765472582, 0.36056622019087725, 0.13917893302601037, 0.07500874600373209, -0.200903087658204, 0.057704402972982884, -0.04286403557139069]
|
1,803.06699
|
Eshel Ben-Jacob: A unique individual in the science of collective
phenomena
|
Eshel Ben-Jacob, one of the co-organizers of this meeting on collective
behavior and one of the pioneers in the field of collective behavior in
biology, passed away suddenly just before we convened. This article presents a
brief glimpse of Eshel's life-long path through science, seen from the
perspective of a decades long collaboration on many disparate yet ultimately
connected topics. The article attempts to convey how the concept of
self-organization of complex interacting objects into higher order functional
units, as evidenced so wonderfully by Eshel's experiments on bacterial colony
formation, provides a unifying theme for the study of collective behavior. Our
entire field will miss his unique ability to "let the complex become simple".
|
q-bio.OT q-bio.CB
|
eshel benjacob one of the coorganizers of this meeting on collective behavior and one of the pioneers in the field of collective behavior in biology passed away suddenly just before we convened this article presents a brief glimpse of eshels lifelong path through science seen from the perspective of a decades long collaboration on many disparate yet ultimately connected topics the article attempts to convey how the concept of selforganization of complex interacting objects into higher order functional units as evidenced so wonderfully by eshels experiments on bacterial colony formation provides a unifying theme for the study of collective behavior our entire field will miss his unique ability to let the complex become simple
|
[['eshel', 'benjacob', 'one', 'of', 'the', 'coorganizers', 'of', 'this', 'meeting', 'on', 'collective', 'behavior', 'and', 'one', 'of', 'the', 'pioneers', 'in', 'the', 'field', 'of', 'collective', 'behavior', 'in', 'biology', 'passed', 'away', 'suddenly', 'just', 'before', 'we', 'convened', 'this', 'article', 'presents', 'a', 'brief', 'glimpse', 'of', 'eshels', 'lifelong', 'path', 'through', 'science', 'seen', 'from', 'the', 'perspective', 'of', 'a', 'decades', 'long', 'collaboration', 'on', 'many', 'disparate', 'yet', 'ultimately', 'connected', 'topics', 'the', 'article', 'attempts', 'to', 'convey', 'how', 'the', 'concept', 'of', 'selforganization', 'of', 'complex', 'interacting', 'objects', 'into', 'higher', 'order', 'functional', 'units', 'as', 'evidenced', 'so', 'wonderfully', 'by', 'eshels', 'experiments', 'on', 'bacterial', 'colony', 'formation', 'provides', 'a', 'unifying', 'theme', 'for', 'the', 'study', 'of', 'collective', 'behavior', 'our', 'entire', 'field', 'will', 'miss', 'his', 'unique', 'ability', 'to', 'let', 'the', 'complex', 'become', 'simple']]
|
[-0.10797600836958736, 0.12880199908871542, -0.132316674916497, 0.02123816055563194, -0.130338965237818, -0.08575295298704243, 0.044996900081803855, 0.3069369666109031, -0.27864767472175034, -0.2990190937268463, 0.05961695000561039, -0.2719285242428834, -0.22439806197812273, 0.19114094981817867, -0.07243003128096462, -0.030875409683424303, 0.03549737712072039, 0.06811588010327382, 0.008467433823865245, -0.2563343998891386, 0.2763395910278301, 0.0795416265599091, 0.2782983476296067, 0.048831623873080716, 0.11358240457484499, 0.01994852294976061, -0.04666476556184617, 0.021282541580413553, -0.15047594872726636, 0.14683060972866688, 0.28977094253059477, 0.17591102702797137, 0.37616519365798345, -0.4764052358201959, -0.22067960298366168, 0.07232300964374604, 0.1827258931896226, 0.08105311855165796, -0.04390344535826113, -0.2928769523277879, 0.025939657039601695, -0.16291622260416097, -0.15544469006444242, -0.053589837542015385, 0.036996729191477326, 0.01742484462024136, -0.13244760147380558, 0.017812076648062263, 0.06363307220268656, 0.1317478920163756, -0.02998558312485164, -0.09306511192169803, 0.03575630830812522, 0.18747888659550385, 0.07977599389004436, 0.04915341699961573, 0.1452679822052067, -0.1548582758563994, -0.13247025891799818, 0.3920521155804057, -0.004950204729737544, -0.07877705337860706, 0.2327003765316807, -0.1465962770860642, -0.1681228795268742, 0.12402233117344705, 0.22010301578451286, 0.09371532691981305, -0.1724896334535019, 0.03265444999931126, -0.0210823092863641, 0.12752535443287344, 0.03704380959230052, 0.02645480710674416, 0.28863449023212356, 0.23561345625838095, 0.03914144143239934, 0.12622500838796524, -0.0057437233521010385, -0.16946198815818536, -0.2631797006501901, -0.14770072182979097, -0.15296593227381394, 0.08878748860125514, 0.023787073909691325, -0.12646647154079718, 0.4474816994148899, 0.14660407703115858, 0.19305383855138314, -0.004792997719381343, 0.25147138148207554, 0.014791238282553174, 0.0638781099114567, 0.017522848518141967, 0.20830039564435454, 0.08946112031752074, 0.1638633355794644, -0.15855423571668903, 0.058143428298221396, 0.029820766160264613]
|
1,803.067
|
Categoricity of Shimura Varieties
|
We propose a model-theoretic structure for Shimura varieties and give
necessary and sufficient conditions to obtain categoricity. We show that these
conditions are directly related to important conjectures in number theory
coming from Galois representations attached the points of a Shimura variety. We
end by showing that the existing literature is enough to prove categoricity of
$\mathcal{A}_{2}$ and $\mathcal{A}_{3}$.
|
math.LO math.AG math.NT
|
we propose a modeltheoretic structure for shimura varieties and give necessary and sufficient conditions to obtain categoricity we show that these conditions are directly related to important conjectures in number theory coming from galois representations attached the points of a shimura variety we end by showing that the existing literature is enough to prove categoricity of mathcala_2 and mathcala_3
|
[['we', 'propose', 'a', 'modeltheoretic', 'structure', 'for', 'shimura', 'varieties', 'and', 'give', 'necessary', 'and', 'sufficient', 'conditions', 'to', 'obtain', 'categoricity', 'we', 'show', 'that', 'these', 'conditions', 'are', 'directly', 'related', 'to', 'important', 'conjectures', 'in', 'number', 'theory', 'coming', 'from', 'galois', 'representations', 'attached', 'the', 'points', 'of', 'a', 'shimura', 'variety', 'we', 'end', 'by', 'showing', 'that', 'the', 'existing', 'literature', 'is', 'enough', 'to', 'prove', 'categoricity', 'of', 'mathcala_2', 'and', 'mathcala_3']]
|
[-0.14454912735502526, 0.0420987024935412, -0.16776518491578513, 0.12261805199447955, -0.12906246827433593, -0.14242141656898732, 0.006617339370081779, 0.33274799575708036, -0.33655629380895147, -0.2710855396721384, 0.10795814976505615, -0.18619061903706913, -0.16491942230917128, 0.2329322275352375, -0.2204517969090877, 0.03706963647735016, 0.08596116797356256, 0.08095599523873935, -0.05561208425507207, -0.35131607406596044, 0.43117116234899533, -0.06868121514482231, 0.23630785681949606, 0.11595351806568817, 0.07734483366446762, -0.03833779318515083, 0.030354747456369985, -0.04500512219162594, -0.18801696487057126, 0.1820155225597836, 0.3861193900028693, 0.15270290541831918, 0.21227740989355692, -0.4573547501309678, -0.12498482955009516, 0.21191739170523038, 0.061921341710268314, 0.10868289650835354, -0.02678200641470351, -0.2620285557390287, 0.14270192752431693, -0.13468051760393226, -0.1460497389338782, -0.17891646016003757, 0.005444750615299262, 0.04795376656793764, -0.2780459374640988, -0.0256156333208341, 0.09232280167333524, 0.1717691222880164, -0.07837569817162023, -0.1158058659719496, 0.0002810470037290762, 0.08484062183937378, 0.02505986708425114, -0.012047819126846975, 0.05580159417225112, -0.12624695005120132, -0.09073263326467111, 0.3468663657790628, -0.03677887853299235, -0.14046563853606067, 0.2212329452279313, -0.15553896108256846, -0.21160447615166678, 0.09876046324919524, 0.08982048707147097, 0.0993019684763818, -0.053489360943284076, 0.09850855409027205, -0.12546497650829883, 0.07100791573034727, 0.11725712383711903, 0.017177363327736485, 0.15563289245494225, 0.03658839782443026, 0.06776682624657607, 0.1586780930339391, -0.015039292180204186, -0.020802362725652498, -0.37603914390864046, -0.14206063952939263, -0.06210339674324696, 0.14349596483376006, -0.03189340356565763, -0.12561094379132806, 0.3602720866108249, 0.20653329221210603, 0.2072458261752437, 0.14945048040806733, 0.19751165373700447, 0.0342412486317134, 0.04461538476933693, 0.059828965627620447, 0.1554507856771093, 0.23221603747666011, -0.027469640083867927, -0.09433644141696779, 0.023962917416517078, 0.15302661893857195]
|
1,803.06701
|
Inverse parameter-dependent Preisach operator in thermo-piezoelectricity
modeling
|
Hysteresis is an important issue in modeling piezoelectric materials, for
example, in applications to energy harvesting, where hysteresis losses may
influence the efficiency of the process. The main problem in numerical
simulations is the inversion of the underlying hysteresis operator. Moreover,
hysteresis dissipation is accompanied with heat production, which in turn
increases the temperature of the device and may change its physical
characteristics. More accurate models therefore have to take the temperature
dependence into account for a correct energy balance. We prove here that the
classical Preisach operator with a fairly general parameter-dependence admits a
Lipschitz continuous inverse in the space of right-continuous regulated
functions, propose a time-discrete and memory-discrete inversion algorithm, and
show that higher regularity of the inputs leads to a higher regularity of the
output of the inverse.
|
math.AP
|
hysteresis is an important issue in modeling piezoelectric materials for example in applications to energy harvesting where hysteresis losses may influence the efficiency of the process the main problem in numerical simulations is the inversion of the underlying hysteresis operator moreover hysteresis dissipation is accompanied with heat production which in turn increases the temperature of the device and may change its physical characteristics more accurate models therefore have to take the temperature dependence into account for a correct energy balance we prove here that the classical preisach operator with a fairly general parameterdependence admits a lipschitz continuous inverse in the space of rightcontinuous regulated functions propose a timediscrete and memorydiscrete inversion algorithm and show that higher regularity of the inputs leads to a higher regularity of the output of the inverse
|
[['hysteresis', 'is', 'an', 'important', 'issue', 'in', 'modeling', 'piezoelectric', 'materials', 'for', 'example', 'in', 'applications', 'to', 'energy', 'harvesting', 'where', 'hysteresis', 'losses', 'may', 'influence', 'the', 'efficiency', 'of', 'the', 'process', 'the', 'main', 'problem', 'in', 'numerical', 'simulations', 'is', 'the', 'inversion', 'of', 'the', 'underlying', 'hysteresis', 'operator', 'moreover', 'hysteresis', 'dissipation', 'is', 'accompanied', 'with', 'heat', 'production', 'which', 'in', 'turn', 'increases', 'the', 'temperature', 'of', 'the', 'device', 'and', 'may', 'change', 'its', 'physical', 'characteristics', 'more', 'accurate', 'models', 'therefore', 'have', 'to', 'take', 'the', 'temperature', 'dependence', 'into', 'account', 'for', 'a', 'correct', 'energy', 'balance', 'we', 'prove', 'here', 'that', 'the', 'classical', 'preisach', 'operator', 'with', 'a', 'fairly', 'general', 'parameterdependence', 'admits', 'a', 'lipschitz', 'continuous', 'inverse', 'in', 'the', 'space', 'of', 'rightcontinuous', 'regulated', 'functions', 'propose', 'a', 'timediscrete', 'and', 'memorydiscrete', 'inversion', 'algorithm', 'and', 'show', 'that', 'higher', 'regularity', 'of', 'the', 'inputs', 'leads', 'to', 'a', 'higher', 'regularity', 'of', 'the', 'output', 'of', 'the', 'inverse']]
|
[-0.12472461230712585, 0.11188999265891303, -0.07782519467067546, 0.0835008795029073, -0.0905176089825825, -0.12614769560929676, 0.045957318912797536, 0.36993236088981996, -0.29825487043708565, -0.27230016018192355, 0.09859321647717689, -0.24293322265864564, -0.15238923756405712, 0.2210340777412057, -0.06610983364069117, 0.05522089134856987, 0.03478178648242297, 0.013529277997664534, -0.07295962342490944, -0.17049790585341934, 0.3065727263903962, 0.0784554248317503, 0.27970250905289923, 0.11155324454705876, 0.12485290350965582, -0.031574824574188545, 0.01691867950811194, 0.023090534438513433, -0.10274074856570223, 0.08320590908943604, 0.2292062915730919, 0.0365443839566209, 0.29383502950748575, -0.4312540685184873, -0.2671639468027234, 0.12701353365197204, 0.11403331365436316, 0.07272401381051168, -0.06619750867797008, -0.18012273113888044, 0.0636185261564186, -0.12681946290943485, -0.11958115479389492, -0.06462930803402112, 0.02103941408254636, 0.02441663956627823, -0.32190642321768864, 0.09444809088913295, 0.09730113695303981, 0.0440083772678358, -0.1198539944123835, -0.08274032055095841, -0.07245606122395166, 0.10438504642538296, 0.046436196416750765, -0.006367512401909782, 0.15424148556597245, -0.12693037991411985, -0.0982013013213873, 0.35159582568045994, -0.032064028829336164, -0.21391452222775956, 0.1425090597763371, -0.15421081047791702, -0.09827597552950745, 0.15976645794983665, 0.17741457640121763, 0.09279717555126318, -0.13910118608663863, 0.08905207533255005, 0.02271155698869664, 0.15358679490343022, 0.02155140708021533, 0.029486451765898473, 0.14418503500234622, 0.19447389629741127, 0.08377100994738822, 0.1983388240664051, -0.04572354694985104, -0.10847776064273114, -0.31413453679818376, -0.16736516461499448, -0.1402918277021784, 0.08224739870414711, -0.12385581422008377, -0.20423051501409364, 0.3890734610111954, 0.1770023203056413, 0.19526872827958028, 0.03988872598229836, 0.3064132971259264, 0.20293031225625713, 0.055939481289197616, 0.06133612031833484, 0.22690607519963613, 0.13789061223013468, 0.16197186613885256, -0.2773344760474104, 0.11527156928339256, 0.037734571715387015]
|
1,803.06702
|
On the infinite divisibility of distributions of some inverse
subordinators
|
We consider the infinite divisibility of distributions of some well-known
inverse subordinators. Using a tail probability bound, we establish that
distributions of many of the inverse subordinators used in the literature are
not infinitely divisible. We further show that the distribution of a renewal
process time-changed by an inverse stable subordinator is not infinitely
divisible, which in particular implies that the distribution of the fractional
Poisson process is not infinitely divisible.
|
math.PR
|
we consider the infinite divisibility of distributions of some wellknown inverse subordinators using a tail probability bound we establish that distributions of many of the inverse subordinators used in the literature are not infinitely divisible we further show that the distribution of a renewal process timechanged by an inverse stable subordinator is not infinitely divisible which in particular implies that the distribution of the fractional poisson process is not infinitely divisible
|
[['we', 'consider', 'the', 'infinite', 'divisibility', 'of', 'distributions', 'of', 'some', 'wellknown', 'inverse', 'subordinators', 'using', 'a', 'tail', 'probability', 'bound', 'we', 'establish', 'that', 'distributions', 'of', 'many', 'of', 'the', 'inverse', 'subordinators', 'used', 'in', 'the', 'literature', 'are', 'not', 'infinitely', 'divisible', 'we', 'further', 'show', 'that', 'the', 'distribution', 'of', 'a', 'renewal', 'process', 'timechanged', 'by', 'an', 'inverse', 'stable', 'subordinator', 'is', 'not', 'infinitely', 'divisible', 'which', 'in', 'particular', 'implies', 'that', 'the', 'distribution', 'of', 'the', 'fractional', 'poisson', 'process', 'is', 'not', 'infinitely', 'divisible']]
|
[-0.07273491601866315, 0.1885408964092125, -0.17489480413496494, 0.14378333138819485, -0.03760443947894473, -0.10510287969045236, -0.000154260677141203, 0.4121648947852598, -0.3539857105679915, -0.17822068959841847, 0.10588690177143985, -0.259422331681134, -0.12081393877595244, 0.17854842606564642, -0.11297386960769204, 0.11312246646627154, -0.016510478338935007, 0.036198797255334716, 0.02053599220595624, -0.23979628566508246, 0.3487182742404476, -0.006148746879902524, 0.23591335007960212, 0.008057718689907605, 0.14515233761303023, -0.0019019918385515986, -0.052318409386969786, -0.06888002191316074, -0.14473700546157386, 0.0929080766665054, 0.2407981047872454, 0.03607561260881558, 0.28197612412746104, -0.36164281700908296, -0.20086424930913138, 0.26761742639289776, 0.20082390295262909, -0.035808962646832455, -0.0604098791020437, -0.23374651030073285, 0.1020055813747655, -0.21530864657637414, -0.18683011304508423, -0.02866252674393251, 0.09133082763357482, 0.1446647917799337, -0.33217490011249, 0.08600439196846014, 0.2161552633591731, 0.010403149223453562, -0.045830899449458846, -0.17569377662902566, 0.02859037616749255, 0.07090963143199472, 0.12374016285536181, -0.13157466818040736, 0.11077147319545629, -0.1043564641166111, -0.15828891216554272, 0.26768318529594953, -0.04293002842754965, -0.25938352541079823, 0.119614699029062, -0.22033250133152787, -0.20004263157549668, 0.1995387863315327, 0.09872804045624717, 0.1565720134506553, -0.17277479157323988, 0.1713775746707975, -0.14101091720504869, 0.12006027911278144, 0.11008668576144207, -0.04231293977592403, 0.08532439219489904, 0.10007702199492971, 0.13520869070870645, 0.19787579902749455, -0.03804794527773916, -0.15589450704406055, -0.37279660226350886, -0.15977285210531808, -0.2521362734669951, 0.14862996214917945, -0.1248436432961427, -0.23414187120195007, 0.2978062741458416, 0.15220596347476395, 0.2057746273373634, 0.11590000158208619, 0.13758624985184467, 0.22547105546306137, -0.06564654359384112, 0.1011543718927448, 0.060617022559417304, 0.15562940892947077, 0.006178260308651018, -0.10744061713224985, 0.13914837531456856, 0.05457104112244618]
|
1,803.06703
|
The X-ray modulation of PSR J2032+4127/MT91 213 during the Periastron
Passage in 2017
|
We present the Neil Gehrels Swift Observatory (Swift), Fermi Large Area
Telescope (Fermi-LAT), and Karl G. Jansky Very Large Array (VLA) observations
of the gamma-ray binary PSR J2032+4127/MT91 213, of which the periastron
passage has just occurred in November 2017. In the Swift X-ray light curve, the
flux was steadily increasing before mid-October 2017, however, a sharp X-ray
dip on a weekly time-scale is seen during the periastron passage, followed by a
post-periastron X-ray flare lasting for ~20 days. We suggest that the X-ray dip
is caused by (i) an increase of the magnetization parameter at the shock, and
(ii) the suppression due to the Doppler boosting effect. The 20-day
post-periastron flare could be a consequence of the Be stellar disk passage by
the pulsar. An orbital GeV modulation is also expected in our model, however,
no significant variability is seen in the Fermi-LAT light curve. We suspect
that the GeV emission resulted from the interaction between the binary's
members is hidden behind the bright magnetospheric emission of the pulsar.
Pulsar gating technique would be useful to remove the magnetospheric emission
and recover the predicted GeV modulation, if an accurate radio timing solution
over the periastron passage is provided in the future.
|
astro-ph.HE
|
we present the neil gehrels swift observatory swift fermi large area telescope fermilat and karl g jansky very large array vla observations of the gammaray binary psr j20324127mt91 213 of which the periastron passage has just occurred in november 2017 in the swift xray light curve the flux was steadily increasing before midoctober 2017 however a sharp xray dip on a weekly timescale is seen during the periastron passage followed by a postperiastron xray flare lasting for 20 days we suggest that the xray dip is caused by i an increase of the magnetization parameter at the shock and ii the suppression due to the doppler boosting effect the 20day postperiastron flare could be a consequence of the be stellar disk passage by the pulsar an orbital gev modulation is also expected in our model however no significant variability is seen in the fermilat light curve we suspect that the gev emission resulted from the interaction between the binarys members is hidden behind the bright magnetospheric emission of the pulsar pulsar gating technique would be useful to remove the magnetospheric emission and recover the predicted gev modulation if an accurate radio timing solution over the periastron passage is provided in the future
|
[['we', 'present', 'the', 'neil', 'gehrels', 'swift', 'observatory', 'swift', 'fermi', 'large', 'area', 'telescope', 'fermilat', 'and', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'observations', 'of', 'the', 'gammaray', 'binary', 'psr', 'j20324127mt91', '213', 'of', 'which', 'the', 'periastron', 'passage', 'has', 'just', 'occurred', 'in', 'november', '2017', 'in', 'the', 'swift', 'xray', 'light', 'curve', 'the', 'flux', 'was', 'steadily', 'increasing', 'before', 'midoctober', '2017', 'however', 'a', 'sharp', 'xray', 'dip', 'on', 'a', 'weekly', 'timescale', 'is', 'seen', 'during', 'the', 'periastron', 'passage', 'followed', 'by', 'a', 'postperiastron', 'xray', 'flare', 'lasting', 'for', '20', 'days', 'we', 'suggest', 'that', 'the', 'xray', 'dip', 'is', 'caused', 'by', 'i', 'an', 'increase', 'of', 'the', 'magnetization', 'parameter', 'at', 'the', 'shock', 'and', 'ii', 'the', 'suppression', 'due', 'to', 'the', 'doppler', 'boosting', 'effect', 'the', '20day', 'postperiastron', 'flare', 'could', 'be', 'a', 'consequence', 'of', 'the', 'be', 'stellar', 'disk', 'passage', 'by', 'the', 'pulsar', 'an', 'orbital', 'gev', 'modulation', 'is', 'also', 'expected', 'in', 'our', 'model', 'however', 'no', 'significant', 'variability', 'is', 'seen', 'in', 'the', 'fermilat', 'light', 'curve', 'we', 'suspect', 'that', 'the', 'gev', 'emission', 'resulted', 'from', 'the', 'interaction', 'between', 'the', 'binarys', 'members', 'is', 'hidden', 'behind', 'the', 'bright', 'magnetospheric', 'emission', 'of', 'the', 'pulsar', 'pulsar', 'gating', 'technique', 'would', 'be', 'useful', 'to', 'remove', 'the', 'magnetospheric', 'emission', 'and', 'recover', 'the', 'predicted', 'gev', 'modulation', 'if', 'an', 'accurate', 'radio', 'timing', 'solution', 'over', 'the', 'periastron', 'passage', 'is', 'provided', 'in', 'the', 'future']]
|
[-0.103194705748685, 0.16866182023391477, -0.08671164130606684, 0.12073634005967175, -0.15327792201395057, -0.08753184183264401, 0.06365963602461737, 0.4553315214099205, -0.21404562715385386, -0.34908327992440236, 0.09955665375747769, -0.323337975365865, -0.06165926062052523, 0.26392705131447247, -0.0695127165825361, -0.021815011511783843, 0.1646891917022112, -0.07614379553054806, -0.03196784264097611, -0.22925597559279862, 0.19345071172313905, 0.16028748337869805, 0.12297921770122551, 0.05387719616349509, 0.07509628320240244, -0.0233718262874146, -0.03425512949366178, -0.08062174024792453, -0.05392522453375344, 0.008059508123189507, 0.21438993438087933, 0.09863183166674194, 0.18758395382386184, -0.3816550412210659, -0.2258816007061384, 0.059391417299670665, 0.11587129977174956, -0.024303570473728824, -0.003922032026703752, -0.33626680370867346, 0.003295862384080257, -0.24449747587225182, -0.1692745911388366, 0.10788080453020127, 0.10895019823879894, 0.007478261205474313, -0.17929519867682042, 0.08587600737309144, 0.022451628067018697, 0.08242479436776012, -0.12385593415631806, -0.013347715946187761, 0.012965707926760748, 0.027503112252264178, 0.09638067917951582, 0.1402944434041491, 0.11664256166703814, -0.08757752596762088, -0.10520011494550113, 0.34729695887726486, -0.07541951564932937, 0.1242667240651315, 0.13899680564066497, -0.24245066884024746, -0.20065771789285378, 0.24972512206498218, 0.1292516458107724, 0.06690375284240836, -0.12990112201888718, 0.019334120895141336, -0.017191205844422106, 0.2578832498190934, 0.09427369283095224, -0.0031094187586823137, 0.324721199173054, 0.12821905406403925, 0.044289156945135015, 0.13850505198108784, -0.3445799621088495, 0.0077428386236230535, -0.23938287265074037, -0.04450633694046809, -0.1675578130557392, 0.12055113909312, -0.09620586481498176, -0.08467640726600047, 0.4077955790985357, 0.09519949807919821, 0.2104620051417333, -0.024168645065921864, 0.28599993830583803, 0.1577802573021418, 0.05577377949039734, 0.16077818715972686, 0.3914059640061277, 0.1241394649352415, 0.16038998055552128, -0.23186774347649322, 0.10881969408915187, -0.0006963557827828536]
|
1,803.06704
|
Dynamical Evolution of Planetary Systems
|
Planetary systems can evolve dynamically even after the planets themselves have fully formed, and there is circumstantial evidence that most planetary systems become unstable after the disappearance of the gaseous protoplanetary disk. Theories of planet formation predict that chains of mean motion resonances are the natural outcome of disk-driven planet migration, leading to the pile up of super-Earths resonant chains close to the inner edge of the disk and the formation of fragile chains for distant giant planets. Observations of young systems suggest that they are more often locked in these chains than older ones, which are instead mostly non-resonant. The instabilities thought responsible for this trend can arise intrinsically if the original systems are too closely packed, or be due to external perturbations such as tides, planetesimal scattering, or torques from distant stellar companions. The Solar System was not exceptional in this sense, as the outer giants saw the disruption of a resonant chain; meanwhile, the inner system was likely built through a series of giant impacts between closely packed planetary embryos. Thus, the orbital distributions of planetary systems that is observed today, both solar and extrasolar, can be different from those emerging from formation and assembly processes within the disk, and it is important to consider possible long-term dynamics to connect the two.
|
astro-ph.EP
|
planetary systems can evolve dynamically even after the planets themselves have fully formed and there is circumstantial evidence that most planetary systems become unstable after the disappearance of the gaseous protoplanetary disk theories of planet formation predict that chains of mean motion resonances are the natural outcome of diskdriven planet migration leading to the pile up of superearths resonant chains close to the inner edge of the disk and the formation of fragile chains for distant giant planets observations of young systems suggest that they are more often locked in these chains than older ones which are instead mostly nonresonant the instabilities thought responsible for this trend can arise intrinsically if the original systems are too closely packed or be due to external perturbations such as tides planetesimal scattering or torques from distant stellar companions the solar system was not exceptional in this sense as the outer giants saw the disruption of a resonant chain meanwhile the inner system was likely built through a series of giant impacts between closely packed planetary embryos thus the orbital distributions of planetary systems that is observed today both solar and extrasolar can be different from those emerging from formation and assembly processes within the disk and it is important to consider possible longterm dynamics to connect the two
|
[['planetary', 'systems', 'can', 'evolve', 'dynamically', 'even', 'after', 'the', 'planets', 'themselves', 'have', 'fully', 'formed', 'and', 'there', 'is', 'circumstantial', 'evidence', 'that', 'most', 'planetary', 'systems', 'become', 'unstable', 'after', 'the', 'disappearance', 'of', 'the', 'gaseous', 'protoplanetary', 'disk', 'theories', 'of', 'planet', 'formation', 'predict', 'that', 'chains', 'of', 'mean', 'motion', 'resonances', 'are', 'the', 'natural', 'outcome', 'of', 'diskdriven', 'planet', 'migration', 'leading', 'to', 'the', 'pile', 'up', 'of', 'superearths', 'resonant', 'chains', 'close', 'to', 'the', 'inner', 'edge', 'of', 'the', 'disk', 'and', 'the', 'formation', 'of', 'fragile', 'chains', 'for', 'distant', 'giant', 'planets', 'observations', 'of', 'young', 'systems', 'suggest', 'that', 'they', 'are', 'more', 'often', 'locked', 'in', 'these', 'chains', 'than', 'older', 'ones', 'which', 'are', 'instead', 'mostly', 'nonresonant', 'the', 'instabilities', 'thought', 'responsible', 'for', 'this', 'trend', 'can', 'arise', 'intrinsically', 'if', 'the', 'original', 'systems', 'are', 'too', 'closely', 'packed', 'or', 'be', 'due', 'to', 'external', 'perturbations', 'such', 'as', 'tides', 'planetesimal', 'scattering', 'or', 'torques', 'from', 'distant', 'stellar', 'companions', 'the', 'solar', 'system', 'was', 'not', 'exceptional', 'in', 'this', 'sense', 'as', 'the', 'outer', 'giants', 'saw', 'the', 'disruption', 'of', 'a', 'resonant', 'chain', 'meanwhile', 'the', 'inner', 'system', 'was', 'likely', 'built', 'through', 'a', 'series', 'of', 'giant', 'impacts', 'between', 'closely', 'packed', 'planetary', 'embryos', 'thus', 'the', 'orbital', 'distributions', 'of', 'planetary', 'systems', 'that', 'is', 'observed', 'today', 'both', 'solar', 'and', 'extrasolar', 'can', 'be', 'different', 'from', 'those', 'emerging', 'from', 'formation', 'and', 'assembly', 'processes', 'within', 'the', 'disk', 'and', 'it', 'is', 'important', 'to', 'consider', 'possible', 'longterm', 'dynamics', 'to', 'connect', 'the', 'two']]
|
[-0.1573137066689818, 0.21401488713833483, -0.06225067118147583, 0.1134820778534726, -0.08207188317914992, -0.08189549374199191, 0.001492049059895582, 0.34630917897231356, -0.24447856048273658, -0.33159120926676794, 0.11280098786079433, -0.26293753688765126, -0.14863538635721388, 0.18868796151607883, -0.04199399384128493, 0.019780083430042967, 0.13807408958240303, -0.04717027510754591, 0.012275723556630574, -0.255241740552362, 0.31497109697828457, 0.05720245727746704, 0.07989244062106969, -0.047911837671038716, -0.015680476358203695, -0.07846945615452823, 0.02641961807385087, -0.06326787222696598, -0.1358342160542528, 0.0783012263520166, 0.24135266579491313, 0.09274943008325821, 0.22619246676737487, -0.4731767730787396, -0.2048392206300483, 0.052163989334854534, 0.22019447436512904, 0.08146396630801, -0.03006037928774509, -0.25653561374692374, 0.08217903761122766, -0.1947692213504207, -0.16847476958727658, 0.027355214971832412, 0.08500120873714602, 0.023615004468795865, -0.24425840360453613, 0.0838285492050873, 0.12059056483815576, 0.07964222377252787, -0.11069237078583344, -0.09356545702565115, -0.11027169028123797, 0.1259478122689003, 0.05336127374158783, -0.012436341091470663, 0.23401889132422415, -0.07952578892866366, -0.05612275265969423, 0.4236749837835601, -0.038032017668592745, -0.06670189317380792, 0.3285744848942687, -0.22767386259944286, -0.10513380463343373, 0.16595637159595308, 0.1730953534935103, 0.1143621520277351, -0.16677486108031211, -0.027064789042450747, -0.005270821454956435, 0.15333902655537565, 0.09083246419011334, 0.04899593195661383, 0.42978768764215325, 0.13395533077608318, 0.06005662206159688, 0.09317248143407321, -0.11066518559792014, -0.13868687334497523, -0.14358140439401532, -0.11255177823869988, -0.1260064016388686, 0.029248840907158135, -0.03884264796202039, -0.17008729983326915, 0.289639034089876, 0.1217033612166931, 0.20103676091706338, -0.0120028924637577, 0.28276083209486896, 0.0848049123457438, 0.14597416279788758, 0.09993896965847113, 0.3222594621396342, 0.1374572842555164, 0.07409966233034813, -0.24720686445077664, 0.13873093491650274, -0.03222199416784353]
|
1,803.06705
|
Hierarchical Predictive Control Algorithms for Optimal Design and
Operation of Microgrids
|
In recent years, microgrids, i.e., disconnected distribution systems, have
received increasing interest from power system utilities to support the
economic and resiliency posture of their systems. The economics of long
distance transmission lines prevent many remote communities from connecting to
bulk transmission systems and these communities rely on off-grid microgrid
technology. Furthermore, communities that are connected to the bulk
transmission system are investigating microgrid technologies that will support
their ability to disconnect and operate independently during extreme events. In
each of these cases, it is important to develop methodologies that support the
capability to design and operate microgrids in the absence of transmission over
long periods of time. Unfortunately, such planning problems tend to be
computationally difficult to solve and those that are straightforward to solve
often lack the modeling fidelity that inspires confidence in the results. To
address these issues, we first develop a high fidelity model for design and
operations of a microgrid that include component efficiencies, component
operating limits, battery modeling, unit commitment, capacity expansion, and
power flow physics; the resulting model is a mixed-integer
quadratically-constrained quadratic program (MIQCQP). We then develop an
iterative algorithm, referred to as the Model Predictive Control (MPC)
algorithm, that allows us to solve the resulting MIQCQP. We show, through
extensive computational experiments, that the MPC-based method can scale to
problems that have a very long planning horizon and provide high quality
solutions that lie within 5\% of optimal.
|
math.OC cs.SY
|
in recent years microgrids ie disconnected distribution systems have received increasing interest from power system utilities to support the economic and resiliency posture of their systems the economics of long distance transmission lines prevent many remote communities from connecting to bulk transmission systems and these communities rely on offgrid microgrid technology furthermore communities that are connected to the bulk transmission system are investigating microgrid technologies that will support their ability to disconnect and operate independently during extreme events in each of these cases it is important to develop methodologies that support the capability to design and operate microgrids in the absence of transmission over long periods of time unfortunately such planning problems tend to be computationally difficult to solve and those that are straightforward to solve often lack the modeling fidelity that inspires confidence in the results to address these issues we first develop a high fidelity model for design and operations of a microgrid that include component efficiencies component operating limits battery modeling unit commitment capacity expansion and power flow physics the resulting model is a mixedinteger quadraticallyconstrained quadratic program miqcqp we then develop an iterative algorithm referred to as the model predictive control mpc algorithm that allows us to solve the resulting miqcqp we show through extensive computational experiments that the mpcbased method can scale to problems that have a very long planning horizon and provide high quality solutions that lie within 5 of optimal
|
[['in', 'recent', 'years', 'microgrids', 'ie', 'disconnected', 'distribution', 'systems', 'have', 'received', 'increasing', 'interest', 'from', 'power', 'system', 'utilities', 'to', 'support', 'the', 'economic', 'and', 'resiliency', 'posture', 'of', 'their', 'systems', 'the', 'economics', 'of', 'long', 'distance', 'transmission', 'lines', 'prevent', 'many', 'remote', 'communities', 'from', 'connecting', 'to', 'bulk', 'transmission', 'systems', 'and', 'these', 'communities', 'rely', 'on', 'offgrid', 'microgrid', 'technology', 'furthermore', 'communities', 'that', 'are', 'connected', 'to', 'the', 'bulk', 'transmission', 'system', 'are', 'investigating', 'microgrid', 'technologies', 'that', 'will', 'support', 'their', 'ability', 'to', 'disconnect', 'and', 'operate', 'independently', 'during', 'extreme', 'events', 'in', 'each', 'of', 'these', 'cases', 'it', 'is', 'important', 'to', 'develop', 'methodologies', 'that', 'support', 'the', 'capability', 'to', 'design', 'and', 'operate', 'microgrids', 'in', 'the', 'absence', 'of', 'transmission', 'over', 'long', 'periods', 'of', 'time', 'unfortunately', 'such', 'planning', 'problems', 'tend', 'to', 'be', 'computationally', 'difficult', 'to', 'solve', 'and', 'those', 'that', 'are', 'straightforward', 'to', 'solve', 'often', 'lack', 'the', 'modeling', 'fidelity', 'that', 'inspires', 'confidence', 'in', 'the', 'results', 'to', 'address', 'these', 'issues', 'we', 'first', 'develop', 'a', 'high', 'fidelity', 'model', 'for', 'design', 'and', 'operations', 'of', 'a', 'microgrid', 'that', 'include', 'component', 'efficiencies', 'component', 'operating', 'limits', 'battery', 'modeling', 'unit', 'commitment', 'capacity', 'expansion', 'and', 'power', 'flow', 'physics', 'the', 'resulting', 'model', 'is', 'a', 'mixedinteger', 'quadraticallyconstrained', 'quadratic', 'program', 'miqcqp', 'we', 'then', 'develop', 'an', 'iterative', 'algorithm', 'referred', 'to', 'as', 'the', 'model', 'predictive', 'control', 'mpc', 'algorithm', 'that', 'allows', 'us', 'to', 'solve', 'the', 'resulting', 'miqcqp', 'we', 'show', 'through', 'extensive', 'computational', 'experiments', 'that', 'the', 'mpcbased', 'method', 'can', 'scale', 'to', 'problems', 'that', 'have', 'a', 'very', 'long', 'planning', 'horizon', 'and', 'provide', 'high', 'quality', 'solutions', 'that', 'lie', 'within', '5', 'of', 'optimal']]
|
[-0.13857178765305864, 0.03135145827102473, -0.05987084892535197, 0.045128014670559186, -0.10832700695260919, -0.17761944227205748, 0.07247605051782438, 0.41386935841056366, -0.28952180920954684, -0.3321560918548015, 0.15781074988721813, -0.2564857689629261, -0.13253488116661866, 0.21779349714002813, -0.1149554860484413, 0.09879180522712207, 0.08251854378085599, -0.015930345467019644, -0.0004615801787357542, -0.25416751470188864, 0.2451023979049632, 0.0945660136148868, 0.3237335712998665, 0.046839392500367595, 0.09292580560439184, -0.02575924838814523, 0.006854922583381712, 0.040202936818307146, -0.06480712893489947, 0.14465573905153742, 0.3504287977388545, 0.1988705012137817, 0.3412718759979345, -0.47608842188295936, -0.23214666360305458, 0.11061066867221728, 0.13568464725745943, 0.056931581292674734, -0.007504246513484997, -0.2046893040850004, 0.09607507760257299, -0.21132398916031175, -0.09165724860661455, -0.10675469751986537, -0.008772777322726914, 0.034350454361268365, -0.2699464073459685, 0.03734338003994685, 0.010828662327714737, 0.016521362277368706, -0.0698862659633415, -0.07491412214475059, 0.010343848167671055, 0.16603221258977213, 0.04705863513636014, -0.017185400379625175, 0.14291593205883218, -0.1044711224992174, -0.1599289986112387, 0.36497241243492134, 0.023543468631316716, -0.15995207579830026, 0.21319898724642422, -0.08952957875378241, -0.14027502976027847, 0.12624635145005295, 0.2677927133528995, 0.08817460187533989, -0.16940732264914846, 0.03865796035815832, 0.021965601601351036, 0.17432456529470364, 0.03169826604425907, 0.03137658952090905, 0.2252094613757566, 0.17420825174369137, 0.13558492795510202, 0.09883171871264233, -0.050082148206007635, -0.11863168242548588, -0.2241035891639831, -0.10883611118821782, -0.14639024191510466, 0.006884987138404279, -0.051494193044766184, -0.14238679175999974, 0.37219766843454904, 0.22418096375490543, 0.1482626365277649, 0.0844136887492282, 0.34053381857804105, 0.1016597470287273, 0.08759781128784862, 0.11271100394026953, 0.2215051826478654, 0.07976003857339312, 0.13720458312272507, -0.22580517068080888, 0.06135348196756409, -0.013215339876208376]
|
1,803.06706
|
Descent distribution on Catalan words avoiding a pattern of length at
most three
|
Catalan words are particular growth-restricted words over the set of
non-negative integers, and they represent still another combinatorial class
counted by the Catalan numbers. We study the distribution of descents on the
sets of Catalan words avoiding a pattern of length at most three: for each such
a pattern $p$ we provide a bivariate generating function where the coefficient
of $x^ny^k$ in its series expansion is the number of length $n$ Catalan words
with $k$ descents and avoiding $p$. As a byproduct, we enumerate the set of
Catalan words avoiding $p$, and we provide the popularity of descents on this
set. Some of the obtained enumerating sequences are not yet recorded in the
On-line Encyclopedia of Integer Sequences.
|
math.CO cs.DM
|
catalan words are particular growthrestricted words over the set of nonnegative integers and they represent still another combinatorial class counted by the catalan numbers we study the distribution of descents on the sets of catalan words avoiding a pattern of length at most three for each such a pattern p we provide a bivariate generating function where the coefficient of xnyk in its series expansion is the number of length n catalan words with k descents and avoiding p as a byproduct we enumerate the set of catalan words avoiding p and we provide the popularity of descents on this set some of the obtained enumerating sequences are not yet recorded in the online encyclopedia of integer sequences
|
[['catalan', 'words', 'are', 'particular', 'growthrestricted', 'words', 'over', 'the', 'set', 'of', 'nonnegative', 'integers', 'and', 'they', 'represent', 'still', 'another', 'combinatorial', 'class', 'counted', 'by', 'the', 'catalan', 'numbers', 'we', 'study', 'the', 'distribution', 'of', 'descents', 'on', 'the', 'sets', 'of', 'catalan', 'words', 'avoiding', 'a', 'pattern', 'of', 'length', 'at', 'most', 'three', 'for', 'each', 'such', 'a', 'pattern', 'p', 'we', 'provide', 'a', 'bivariate', 'generating', 'function', 'where', 'the', 'coefficient', 'of', 'xnyk', 'in', 'its', 'series', 'expansion', 'is', 'the', 'number', 'of', 'length', 'n', 'catalan', 'words', 'with', 'k', 'descents', 'and', 'avoiding', 'p', 'as', 'a', 'byproduct', 'we', 'enumerate', 'the', 'set', 'of', 'catalan', 'words', 'avoiding', 'p', 'and', 'we', 'provide', 'the', 'popularity', 'of', 'descents', 'on', 'this', 'set', 'some', 'of', 'the', 'obtained', 'enumerating', 'sequences', 'are', 'not', 'yet', 'recorded', 'in', 'the', 'online', 'encyclopedia', 'of', 'integer', 'sequences']]
|
[-0.1932822259931037, 0.14716531643564376, -0.04610321080734014, 0.08170653600444715, -0.11130126351968218, -0.07413176597647257, 0.08758305512671159, 0.3179177284304403, -0.3456119836524973, -0.30315652907563323, 0.037472523036452696, -0.3564413572128257, -0.14883393033519068, 0.18649206845672864, -0.07445799982429951, 0.02466460539905641, 0.036001123078008235, 0.11919045767549855, -0.011182239495999375, -0.31574084997897506, 0.28394337931377256, -0.04309621004737977, 0.16527715283366415, -0.041849105960180044, 0.07854653663214885, 0.019603619875354517, -0.09293765775684236, -0.0008128020020886364, -0.14622949890028208, 0.12462466948070666, 0.2886805047766648, 0.2033485000093396, 0.25296259658713627, -0.3688670340925455, -0.08177454428126414, 0.19513535273508129, 0.17450560424397263, 0.06018595900545772, -0.04093483594469089, -0.19376036591636828, 0.12317066479565847, -0.11520965293877655, -0.07854910866301666, -0.027025637011895448, 0.10964690235196653, 0.10879619653002383, -0.2827164254720426, 0.01388701156147907, 0.0733169117448931, 0.14655378433820018, 0.02547884040261404, -0.2226115520247537, 0.06039322225146123, 0.10753732539601943, 0.05346898806806749, 0.007864658603381015, 0.011975507183263127, -0.12586764403236791, -0.15642930583980602, 0.3738536111389597, 0.03689881963416552, -0.22421496259605783, 0.10684083976472418, -0.1702854940548348, -0.17563823190255043, 0.11752940771671441, 0.12292563241038822, 0.16592151291954976, -0.053647606768923946, 0.06379842723552616, -0.1885226856176861, 0.12401490156244263, 0.24937235434245095, 0.02378644907258005, 0.20874449391411537, 0.10858581351458581, 0.014863074020856721, 0.1825295080526326, -0.048396744848921515, -0.014948280134166662, -0.302266042591988, -0.17592059447167394, -0.24305480471453988, 0.021833362318620157, -0.14604572458632994, -0.24774796771120408, 0.41014459990283364, 0.0984767197082058, 0.2429982241179444, 0.1583629320654222, 0.17031644122340742, 0.07400552591378104, 0.05658666693414442, 0.026182195979656063, -0.03758602084977051, 0.11566387876892129, 0.029947732506582562, -0.17459177690295455, 0.10230210868434773, 0.19758238912854567]
|
1,803.06707
|
An Improved Welfare Guarantee for First Price Auctions
|
This paper proves that the welfare of the first price auction in Bayes-Nash
equilibrium is at least a $.743$-fraction of the welfare of the optimal
mechanism assuming agents' values are independently distributed. The previous
best bound was $1-1/e \approx .63$, derived in Syrgkanis and Tardos (2013)
using smoothness, the standard technique for reasoning about welfare of games
in equilibrium. In the worst known example (from Hartline et al. (2014)), the
first price auction achieves a $\approx .869$-fraction of the optimal welfare,
far better than the theoretical guarantee. Despite this large gap, it was
unclear whether the $1-1/e \approx .63$ bound was tight. We prove that it is
not. Our analysis eschews smoothness, and instead uses the independence
assumption on agents' value distributions to give a more careful accounting of
the welfare contribution of agents who win despite not having the highest
value.
|
cs.GT
|
this paper proves that the welfare of the first price auction in bayesnash equilibrium is at least a 743fraction of the welfare of the optimal mechanism assuming agents values are independently distributed the previous best bound was 11e approx 63 derived in syrgkanis and tardos 2013 using smoothness the standard technique for reasoning about welfare of games in equilibrium in the worst known example from hartline et al 2014 the first price auction achieves a approx 869fraction of the optimal welfare far better than the theoretical guarantee despite this large gap it was unclear whether the 11e approx 63 bound was tight we prove that it is not our analysis eschews smoothness and instead uses the independence assumption on agents value distributions to give a more careful accounting of the welfare contribution of agents who win despite not having the highest value
|
[['this', 'paper', 'proves', 'that', 'the', 'welfare', 'of', 'the', 'first', 'price', 'auction', 'in', 'bayesnash', 'equilibrium', 'is', 'at', 'least', 'a', '743fraction', 'of', 'the', 'welfare', 'of', 'the', 'optimal', 'mechanism', 'assuming', 'agents', 'values', 'are', 'independently', 'distributed', 'the', 'previous', 'best', 'bound', 'was', '11e', 'approx', '63', 'derived', 'in', 'syrgkanis', 'and', 'tardos', '2013', 'using', 'smoothness', 'the', 'standard', 'technique', 'for', 'reasoning', 'about', 'welfare', 'of', 'games', 'in', 'equilibrium', 'in', 'the', 'worst', 'known', 'example', 'from', 'hartline', 'et', 'al', '2014', 'the', 'first', 'price', 'auction', 'achieves', 'a', 'approx', '869fraction', 'of', 'the', 'optimal', 'welfare', 'far', 'better', 'than', 'the', 'theoretical', 'guarantee', 'despite', 'this', 'large', 'gap', 'it', 'was', 'unclear', 'whether', 'the', '11e', 'approx', '63', 'bound', 'was', 'tight', 'we', 'prove', 'that', 'it', 'is', 'not', 'our', 'analysis', 'eschews', 'smoothness', 'and', 'instead', 'uses', 'the', 'independence', 'assumption', 'on', 'agents', 'value', 'distributions', 'to', 'give', 'a', 'more', 'careful', 'accounting', 'of', 'the', 'welfare', 'contribution', 'of', 'agents', 'who', 'win', 'despite', 'not', 'having', 'the', 'highest', 'value']]
|
[-0.09324741936538235, -0.0007645173522178083, -0.1108037329445194, 0.10158636874652334, -0.08185714062170259, -0.1507746416909088, 0.16734670634739035, 0.39056908011968644, -0.2279397257736751, -0.3740657593953074, 0.06729321839687015, -0.2655463205650449, -0.13662470489008618, 0.10691820958163589, -0.13593213463069073, 0.03882625097934839, 0.02309389369994668, -0.00019720082969537804, 0.041063277649560144, -0.3597565969651831, 0.25972096084899804, 0.13774063786757842, 0.2776355125276106, 0.06595177621929907, 0.07743561907139207, 0.005885200149246625, 0.04540764268520953, -0.019348508342851085, -0.17966431250648124, 0.08353455721932862, 0.25396134143063265, 0.17458012597801695, 0.375254562387376, -0.325513100241577, -0.1084121032834186, 0.14489386996470524, 0.06831476585399027, 0.06596835129894316, 0.00749754252974526, -0.2070800375991634, 0.1036101246252656, -0.16487525288082128, -0.07909707832150162, -0.0105630449884172, -0.0016759712614917328, 0.007234156135902075, -0.35044654169718603, 0.08188708029171851, 0.09525101176196975, 0.05791675311047584, -0.07612950326209622, -0.19484791920320796, 0.0020530398407052936, 0.10529483434012425, 0.0516201667853498, 0.03299312762849565, 0.10350321660849399, -0.12482059353580033, -0.16345874178888542, 0.38054874031139274, -0.0309373271631817, -0.09720228340842628, 0.1366301705944352, -0.14052467960864307, -0.1323910072545654, 0.14949302181401955, 0.12922855611624462, 0.13628927594316856, -0.14580071779367115, 0.07362956187737707, -0.16787537962747073, 0.2279517711614192, 0.11363429105840624, -0.006672860798425972, 0.07843527851094093, 0.16250046351924538, 0.1757202721367191, 0.08605047871574893, 0.028890067402971908, -0.1508942420714967, -0.2410102304969249, -0.12467068499016543, -0.21370559716597198, 0.07885359483542353, -0.12050078295350042, -0.06784622836192804, 0.3398355956056288, 0.14910620404739997, 0.1504998593025708, 0.1337099291251174, 0.2767716506695641, 0.09630770071983404, -0.0265329266066796, 0.20959012769162655, 0.3342124189981925, 0.032215190016930656, 0.08881136844242324, -0.16284614703285374, 0.20118252509606205, 0.035954934278769154]
|
1,803.06708
|
Accretion Processes
|
In planetary science, accretion is the process in which solids agglomerate to
form larger and larger objects and eventually planets are produced. The initial
conditions are a disc of gas and microscopic solid particles, with a total mass
of about 1% of the gas mass. Accretion has to be effective and fast. Effective,
because the original total mass in solids in the solar protoplanetary disk was
probably of the order of ~ 300 Earth masses, and the mass incorporated into the
planets is ~100 Earth masses. Fast, because the cores of the giant planets had
to grow to tens of Earth masses in order to capture massive doses of hydrogen
and helium from the disc before the dispersal of the latter, i.e. in a few
millions of years. There is probably not one accretion process but several,
depending on the scale at which accretion operates. A first process is the
sticking of microscopic dust into larger grains and pebbles. A second process
is the formation of an intermediate class of objects called planetesimals. A
third accretion process has to lead from planetesimals to planets. Actually,
several processes can be involved in this step, from collisional coagulation
among planetesimals to the accretion of small particles under the effect of gas
drag, to giant impacts between protoplanets. This chapter will detail all these
processes, adopting a historical perspective: i.e. from the classic processes
investigated in the past decades to those unveiled in the last years.
|
astro-ph.EP
|
in planetary science accretion is the process in which solids agglomerate to form larger and larger objects and eventually planets are produced the initial conditions are a disc of gas and microscopic solid particles with a total mass of about 1 of the gas mass accretion has to be effective and fast effective because the original total mass in solids in the solar protoplanetary disk was probably of the order of 300 earth masses and the mass incorporated into the planets is 100 earth masses fast because the cores of the giant planets had to grow to tens of earth masses in order to capture massive doses of hydrogen and helium from the disc before the dispersal of the latter ie in a few millions of years there is probably not one accretion process but several depending on the scale at which accretion operates a first process is the sticking of microscopic dust into larger grains and pebbles a second process is the formation of an intermediate class of objects called planetesimals a third accretion process has to lead from planetesimals to planets actually several processes can be involved in this step from collisional coagulation among planetesimals to the accretion of small particles under the effect of gas drag to giant impacts between protoplanets this chapter will detail all these processes adopting a historical perspective ie from the classic processes investigated in the past decades to those unveiled in the last years
|
[['in', 'planetary', 'science', 'accretion', 'is', 'the', 'process', 'in', 'which', 'solids', 'agglomerate', 'to', 'form', 'larger', 'and', 'larger', 'objects', 'and', 'eventually', 'planets', 'are', 'produced', 'the', 'initial', 'conditions', 'are', 'a', 'disc', 'of', 'gas', 'and', 'microscopic', 'solid', 'particles', 'with', 'a', 'total', 'mass', 'of', 'about', '1', 'of', 'the', 'gas', 'mass', 'accretion', 'has', 'to', 'be', 'effective', 'and', 'fast', 'effective', 'because', 'the', 'original', 'total', 'mass', 'in', 'solids', 'in', 'the', 'solar', 'protoplanetary', 'disk', 'was', 'probably', 'of', 'the', 'order', 'of', '300', 'earth', 'masses', 'and', 'the', 'mass', 'incorporated', 'into', 'the', 'planets', 'is', '100', 'earth', 'masses', 'fast', 'because', 'the', 'cores', 'of', 'the', 'giant', 'planets', 'had', 'to', 'grow', 'to', 'tens', 'of', 'earth', 'masses', 'in', 'order', 'to', 'capture', 'massive', 'doses', 'of', 'hydrogen', 'and', 'helium', 'from', 'the', 'disc', 'before', 'the', 'dispersal', 'of', 'the', 'latter', 'ie', 'in', 'a', 'few', 'millions', 'of', 'years', 'there', 'is', 'probably', 'not', 'one', 'accretion', 'process', 'but', 'several', 'depending', 'on', 'the', 'scale', 'at', 'which', 'accretion', 'operates', 'a', 'first', 'process', 'is', 'the', 'sticking', 'of', 'microscopic', 'dust', 'into', 'larger', 'grains', 'and', 'pebbles', 'a', 'second', 'process', 'is', 'the', 'formation', 'of', 'an', 'intermediate', 'class', 'of', 'objects', 'called', 'planetesimals', 'a', 'third', 'accretion', 'process', 'has', 'to', 'lead', 'from', 'planetesimals', 'to', 'planets', 'actually', 'several', 'processes', 'can', 'be', 'involved', 'in', 'this', 'step', 'from', 'collisional', 'coagulation', 'among', 'planetesimals', 'to', 'the', 'accretion', 'of', 'small', 'particles', 'under', 'the', 'effect', 'of', 'gas', 'drag', 'to', 'giant', 'impacts', 'between', 'protoplanets', 'this', 'chapter', 'will', 'detail', 'all', 'these', 'processes', 'adopting', 'a', 'historical', 'perspective', 'ie', 'from', 'the', 'classic', 'processes', 'investigated', 'in', 'the', 'past', 'decades', 'to', 'those', 'unveiled', 'in', 'the', 'last', 'years']]
|
[-0.06803976789512287, 0.2108957898473653, -0.05208564032694663, 0.06356632971672914, -0.05386086083536829, -0.021438322889172155, 0.02153231010099773, 0.3273658034822727, -0.2438383295069918, -0.3484262673781746, 0.1008674886519251, -0.26511470769909173, -0.03687479037672189, 0.17648579209296356, -0.046158719776113605, 0.014447604605258435, 0.08177825152847054, -0.03393741348019439, -0.03408708127142384, -0.2807648026746167, 0.3293948873130928, 0.08792211190020004, 0.07542994519510915, 0.03466470173919912, 0.07227036133668316, -0.11846952265116947, -0.010113579521248164, -0.07127516594723113, -0.16629189738911415, 0.07339178048620724, 0.19890221326384877, 0.09818625649675912, 0.27684602453488827, -0.47831201865068396, -0.2205979632914128, 0.07206899153399628, 0.16995280254189665, 0.0916065815056882, -0.042356665398202036, -0.21511229025084555, 0.05817845204512181, -0.216800827964032, -0.13322099056171854, 0.05583085208527036, 0.11028733722069917, -0.009763699138444687, -0.2754820666087345, 0.0906928819245832, 0.09399777062334436, 0.03758266245011117, -0.09050318507875954, -0.10649659082655263, -0.07473334146871362, 0.09835428673358372, 0.10663531427904252, -0.013800094100408071, 0.25389684342840796, -0.1115591020750513, -0.0076171465993527905, 0.44989125325906376, -0.041966794183754846, -0.06456154229288752, 0.27588897217296005, -0.24552436109655346, -0.10058411567140955, 0.2233744089208805, 0.22434715636955835, 0.13565277332567016, -0.19099854055622761, -0.009711392839344926, -0.018385660380494495, 0.16704786256867776, 0.10085213974056657, 0.01882963673758113, 0.35325203965849067, 0.20354003167767962, 0.022026062461986275, 0.0793141603367865, -0.13635293099825263, -0.1193656086862041, -0.1765901902786741, -0.1714121958679589, -0.17283079861942294, 0.06910458538054214, -0.09056512816105093, -0.12076382469077987, 0.31531793469936426, 0.13503155581199003, 0.23471082620080252, -0.005074628409429276, 0.2899020021504238, 0.07643169534396503, 0.14345192664648282, 0.1013031410984695, 0.3069047007174808, 0.12739517299981773, 0.11564997868845239, -0.19536080047661875, 0.11080256668073395, 0.02069179073105035]
|
1,803.06709
|
p-wave superfluidity in mixtures of ultracold Fermi and spinor Bose
gases
|
We reveal that the p-wave superfluid can be realized in a mixture of
fermionic and F=1 bosonic gases. We derive a general set of the gap equations
for gaps in the s- and p-channels. It is found that the spin-spin bose-fermi
interactions favor the p-wave pairing and naturally suppress the pairing in the
s-channel. The gap equations for the polar phase of p-wave superfluid fermions
are numerically solved. It is shown that a pure p-wave superfluid can be
observed in a well-controlled environment of atomic physics.
|
cond-mat.quant-gas
|
we reveal that the pwave superfluid can be realized in a mixture of fermionic and f1 bosonic gases we derive a general set of the gap equations for gaps in the s and pchannels it is found that the spinspin bosefermi interactions favor the pwave pairing and naturally suppress the pairing in the schannel the gap equations for the polar phase of pwave superfluid fermions are numerically solved it is shown that a pure pwave superfluid can be observed in a wellcontrolled environment of atomic physics
|
[['we', 'reveal', 'that', 'the', 'pwave', 'superfluid', 'can', 'be', 'realized', 'in', 'a', 'mixture', 'of', 'fermionic', 'and', 'f1', 'bosonic', 'gases', 'we', 'derive', 'a', 'general', 'set', 'of', 'the', 'gap', 'equations', 'for', 'gaps', 'in', 'the', 's', 'and', 'pchannels', 'it', 'is', 'found', 'that', 'the', 'spinspin', 'bosefermi', 'interactions', 'favor', 'the', 'pwave', 'pairing', 'and', 'naturally', 'suppress', 'the', 'pairing', 'in', 'the', 'schannel', 'the', 'gap', 'equations', 'for', 'the', 'polar', 'phase', 'of', 'pwave', 'superfluid', 'fermions', 'are', 'numerically', 'solved', 'it', 'is', 'shown', 'that', 'a', 'pure', 'pwave', 'superfluid', 'can', 'be', 'observed', 'in', 'a', 'wellcontrolled', 'environment', 'of', 'atomic', 'physics']]
|
[-0.20157544370603692, 0.2776204795110971, -0.10970862911370419, 0.12158725946621203, -0.006476420547594042, -0.1834748892003999, 0.052731478052652055, 0.3242638578227557, -0.23194456777316244, -0.21801373855594328, -0.060532440524548294, -0.27210138080751195, -0.0907498904832584, 0.12723621550454375, 0.084918628479628, 0.03438290012452532, -0.0022795610321576106, 0.0031305996235460043, -0.1263192798312315, -0.26066982411558615, 0.3428741981878, -0.0725163509740549, 0.27754500227815965, 0.11845897099770167, -0.017214231193065643, -0.04586805239429369, 0.09108456248307929, -0.025538342489915735, -0.10970384269149851, 0.04286413999164806, 0.31572354590410695, -0.05799526541548617, 0.11835489983067793, -0.4329288244357004, -0.23112911125097205, 0.09507305496098364, 0.20302870205110488, 0.18399426356396253, -0.012040074487381121, -0.349839567371151, -0.009439321190995328, -0.26089761244023546, -0.15410104311235687, -0.15148678821895054, 0.004689890749560778, -0.02756095608586774, -0.28899246161420117, 0.10784340123919879, 0.08276747467325014, 0.039537455283981914, -0.07696831482941942, -0.1153547931339263, -0.016541025313713095, 0.012238575551001465, 0.011913405062959475, 0.055700263427570465, 0.0820770107976654, -0.1798715767724549, -0.052739941909470976, 0.3927633019054637, -0.12149755945977042, -0.18217842195402173, 0.18671627283534584, -0.117959672574173, -0.05298350573353031, 0.13065035091165234, 0.09965238766196896, 0.04267685113146025, -0.13663404475459281, 0.10461777976563419, -0.11106074570732959, 0.16300906865474055, 0.023925240704899327, 0.04976815197630512, 0.29251093772404335, 0.17538181399816977, 0.014972475828493342, 0.1515887904446572, -0.10792459210600047, -0.11483063484158586, -0.28276865885538216, -0.18536806262153036, -0.21891024643829202, -0.022857022542944725, 0.009511329524513498, -0.1365707745347583, 0.34599456754239166, 0.12484390844371827, 0.19120672388988383, -0.0674452107755796, 0.21412836707690183, 0.13870319931045422, 0.06054319976007237, 0.054464804633137055, 0.2797404545578448, 0.15708124657325884, 0.038184242114862973, -0.34336530935457527, 0.006271821673726663, 0.05625450148740235]
|
1,803.0671
|
Almost all string graphs are intersection graphs of plane convex sets
|
A {\em string graph} is the intersection graph of a family of continuous arcs
in the plane. The intersection graph of a family of plane convex sets is a
string graph, but not all string graphs can be obtained in this way. We prove
the following structure theorem conjectured by Janson and Uzzell: The vertex
set of {\em almost all} string graphs on $n$ vertices can be partitioned into
{\em five} cliques such that some pair of them is not connected by any edge
($n\rightarrow\infty$). We also show that every graph with the above property
is an intersection graph of plane convex sets. As a corollary, we obtain that
{\em almost all} string graphs on $n$ vertices are intersection graphs of plane
convex sets.
|
math.CO cs.CG
|
a em string graph is the intersection graph of a family of continuous arcs in the plane the intersection graph of a family of plane convex sets is a string graph but not all string graphs can be obtained in this way we prove the following structure theorem conjectured by janson and uzzell the vertex set of em almost all string graphs on n vertices can be partitioned into em five cliques such that some pair of them is not connected by any edge nrightarrowinfty we also show that every graph with the above property is an intersection graph of plane convex sets as a corollary we obtain that em almost all string graphs on n vertices are intersection graphs of plane convex sets
|
[['a', 'em', 'string', 'graph', 'is', 'the', 'intersection', 'graph', 'of', 'a', 'family', 'of', 'continuous', 'arcs', 'in', 'the', 'plane', 'the', 'intersection', 'graph', 'of', 'a', 'family', 'of', 'plane', 'convex', 'sets', 'is', 'a', 'string', 'graph', 'but', 'not', 'all', 'string', 'graphs', 'can', 'be', 'obtained', 'in', 'this', 'way', 'we', 'prove', 'the', 'following', 'structure', 'theorem', 'conjectured', 'by', 'janson', 'and', 'uzzell', 'the', 'vertex', 'set', 'of', 'em', 'almost', 'all', 'string', 'graphs', 'on', 'n', 'vertices', 'can', 'be', 'partitioned', 'into', 'em', 'five', 'cliques', 'such', 'that', 'some', 'pair', 'of', 'them', 'is', 'not', 'connected', 'by', 'any', 'edge', 'nrightarrowinfty', 'we', 'also', 'show', 'that', 'every', 'graph', 'with', 'the', 'above', 'property', 'is', 'an', 'intersection', 'graph', 'of', 'plane', 'convex', 'sets', 'as', 'a', 'corollary', 'we', 'obtain', 'that', 'em', 'almost', 'all', 'string', 'graphs', 'on', 'n', 'vertices', 'are', 'intersection', 'graphs', 'of', 'plane', 'convex', 'sets']]
|
[-0.220552641513472, 0.11445888695638015, -0.05941109745875902, 0.06831782757991835, -0.11260131753853432, -0.09370157745621738, 0.06683322447051684, 0.3903670248184954, -0.29653329845337617, -0.2591626884363171, 0.09425873294915824, -0.341488181898791, -0.1605164082758429, 0.13287974226911883, -0.09902035021936641, 0.026378068892705824, 0.1277641510410655, 0.09344190187496884, 0.047235772273721055, -0.2878384952439979, 0.34301559868899567, -0.11556246881223013, 0.18607162345471162, 0.07146479269008964, 0.07345935586659659, 0.056441994387686496, 0.025765267760312606, 0.16340637359685534, -0.14119454364252657, 0.09306493317407946, 0.279887592082002, 0.21939386370133668, 0.17959366845635458, -0.398032608283111, -0.15914491528359753, 0.22111779941065657, 0.13913817400856304, 0.06783354913838388, 0.045321784984891214, -0.2140047612539943, 0.14265433032696526, -0.08796796396434788, -0.09256772908021606, -0.012395614375089925, 0.07555789272526219, 0.029757217842064077, -0.23592667890601837, -0.08030417005201959, 0.14065443855079432, 0.013181240425535267, 0.05680909919394781, -0.11664674047290557, -0.07005754784838628, 0.07458760977944269, -0.06027809283395688, 0.1429513853283659, 0.051512052191913335, -0.06399035076197658, -0.2105952987734664, 0.35335922721048607, 0.004324317359620885, -0.17768346027831636, 0.09466566628355894, -0.14385471086678725, -0.18483345191400016, 0.10607119238815241, 0.099795218863179, 0.1473832930918903, -0.14040956948930775, 0.1894605052727838, -0.1673175436707454, 0.08625042783997712, 0.1628706155292269, 0.0051795945675562945, 0.16030038840272615, 0.10040951784955518, 0.19155605663845857, 0.19766624792171042, 0.029957918951338564, -0.013858366453449332, -0.34079896218533956, -0.08753342347429885, -0.2679460121820035, 0.0708373706422149, -0.21391745897433853, -0.2624987290060568, 0.3992949946513099, 0.02280886705979825, 0.23192204952976037, 0.12274854404160813, 0.1986374145734214, 0.04095904183428032, 0.032880255148836204, 0.21430620273214676, 0.12327976838517521, 0.14279399886201585, -0.06370570747211816, -0.09197408859167368, 0.023724190124701106, 0.20126279590335944]
|
1,803.06711
|
A Dynamic Additive and Multiplicative Effects Model with Application to
the United Nations Voting Behaviors
|
Motivated by a study of United Nations voting behaviors, we introduce a
regression model for a series of networks that are correlated over time. Our
model is a dynamic extension of the additive and multiplicative effects network
model (AMEN) of Hoff (2019). In addition to incorporating a temporal structure,
the model accommodates two types of missing data thus allows the size of the
network to vary over time. We demonstrate via simulations the necessity of
various components of the model. We apply the model to the United Nations
General Assembly voting data from 1983 to 2014 (Voeten (2013)) to answer
interesting research questions regarding international voting behaviors. In
addition to finding important factors that could explain the voting behaviors,
the model-estimated additive effects, multiplicative effects, and their
movements reveal meaningful foreign policy positions and alliances of various
countries.
|
stat.AP
|
motivated by a study of united nations voting behaviors we introduce a regression model for a series of networks that are correlated over time our model is a dynamic extension of the additive and multiplicative effects network model amen of hoff 2019 in addition to incorporating a temporal structure the model accommodates two types of missing data thus allows the size of the network to vary over time we demonstrate via simulations the necessity of various components of the model we apply the model to the united nations general assembly voting data from 1983 to 2014 voeten 2013 to answer interesting research questions regarding international voting behaviors in addition to finding important factors that could explain the voting behaviors the modelestimated additive effects multiplicative effects and their movements reveal meaningful foreign policy positions and alliances of various countries
|
[['motivated', 'by', 'a', 'study', 'of', 'united', 'nations', 'voting', 'behaviors', 'we', 'introduce', 'a', 'regression', 'model', 'for', 'a', 'series', 'of', 'networks', 'that', 'are', 'correlated', 'over', 'time', 'our', 'model', 'is', 'a', 'dynamic', 'extension', 'of', 'the', 'additive', 'and', 'multiplicative', 'effects', 'network', 'model', 'amen', 'of', 'hoff', '2019', 'in', 'addition', 'to', 'incorporating', 'a', 'temporal', 'structure', 'the', 'model', 'accommodates', 'two', 'types', 'of', 'missing', 'data', 'thus', 'allows', 'the', 'size', 'of', 'the', 'network', 'to', 'vary', 'over', 'time', 'we', 'demonstrate', 'via', 'simulations', 'the', 'necessity', 'of', 'various', 'components', 'of', 'the', 'model', 'we', 'apply', 'the', 'model', 'to', 'the', 'united', 'nations', 'general', 'assembly', 'voting', 'data', 'from', '1983', 'to', '2014', 'voeten', '2013', 'to', 'answer', 'interesting', 'research', 'questions', 'regarding', 'international', 'voting', 'behaviors', 'in', 'addition', 'to', 'finding', 'important', 'factors', 'that', 'could', 'explain', 'the', 'voting', 'behaviors', 'the', 'modelestimated', 'additive', 'effects', 'multiplicative', 'effects', 'and', 'their', 'movements', 'reveal', 'meaningful', 'foreign', 'policy', 'positions', 'and', 'alliances', 'of', 'various', 'countries']]
|
[-0.0936021532720621, 0.052682282474490194, -0.11084273646510866, 0.09595774428283348, -0.07913708791177529, -0.12009997580567525, 0.11390282818537723, 0.365760090386998, -0.28741797784438533, -0.3305617394367654, 0.0867830963217293, -0.28126360051324134, -0.21480145771736212, 0.1558010839367707, -0.10527821107985058, 0.030733048494388588, 0.049701763598255164, -0.025883129945731838, 0.004447968634198943, -0.2992812913485499, 0.2902285226528961, 0.07649969714727715, 0.29136447341990296, 0.02045053773879135, 0.09711261861617711, 0.012988140143753185, -0.09501973740810896, 0.034439875627018134, -0.10809077349048274, 0.14915116742443646, 0.2858376340791039, 0.13545542879601138, 0.3439745330268748, -0.401732838345542, -0.22280452907574874, 0.09462018344673688, 0.04998150681159085, 0.0862491496118044, 0.025682433508336544, -0.301124447081442, 0.01923821373659111, -0.23271987161490332, -0.09510288266363098, -0.10603792008937057, 0.02440053775624447, 0.02470248213452525, -0.292168595371377, 0.08788291585162608, 0.056173196113430454, 0.05201497745706978, -0.0733503621300159, -0.10686427501563907, -0.004175053976232315, 0.19440628984266634, 0.06481896082379907, -0.05679820983391935, 0.12331893321901669, -0.13665466038102325, -0.19671706687217158, 0.3634136985226052, -0.02542345556872387, -0.11665902557327365, 0.16042473859634432, -0.10798824437465655, -0.15512236967227375, 0.05368716572241409, 0.25433949247872745, 0.03186756119567112, -0.1611558966628398, 0.05133405977215985, -0.08969725775158535, 0.17103466640029402, 0.05184110346416786, -0.019953488706641688, 0.17813586805314913, 0.18670509796909118, 0.017786804543683615, 0.12300728558372352, -0.07432839255032204, -0.16196674261289737, -0.240241006903867, -0.10336197574153869, -0.08169247937409112, -0.004201627820798189, -0.08674769014441731, -0.15205367301747094, 0.450254887886291, 0.18414057320813193, 0.18643760827988604, 0.0692641223733225, 0.2505780638324736, 0.01353837617071359, 0.0684155306020874, 0.06119537557114976, 0.15745866497856204, 0.06898410866601243, 0.09676260855830662, -0.19808581185418378, 0.13407676314500017, 0.004896378450530724]
|
1,803.06712
|
Haar-$\mathcal I$ sets: looking at small sets in Polish groups through
compact glasses
|
Generalizing Christensen's notion of a Haar-null set and Darji's notion of a
Haar-meager set, we introduce and study the notion of a Haar-$\mathcal I$ set
in a Polish group. Here $\mathcal I$ is an ideal of subsets of some compact
metrizable space $K$. A Borel subset $B\subset X$ of a Polish group $X$ is
called Haar-$\mathcal I$ if there exists a continuous map $f:K\to X$ such that
$f^{-1}(B+x)\in\mathcal I$ for all $x\in X$. Moreover, $B$ is generically
Haar-$\mathcal I$ if the set of witness functions $\{f\in C(K,X):\forall x\in
X\;\;f^{-1}(B+x)\in\mathcal I\}$ is comeager in the function space $C(K,X)$. We
study (generically) Haar-$\mathcal I$ sets in Polish groups for many concrete
and abstract ideals $\mathcal I$, and construct the corresponding
distinguishing examples. We prove some results on Borel hull of Haar-$\mathcal
I$ sets, generalizing results of Solecki, Elekes, Vidny\'anszky, Dole\v{z}al,
Vlas\v{a}k on Borel hulls of Haar-null and Haar-meager sets. Also we establish
various Steinhaus properties of the families of (generically) Haar-$\mathcal I$
sets in Polish groups for various ideals $\mathcal I$.
|
math.GN math.GR
|
generalizing christensens notion of a haarnull set and darjis notion of a haarmeager set we introduce and study the notion of a haarmathcal i set in a polish group here mathcal i is an ideal of subsets of some compact metrizable space k a borel subset bsubset x of a polish group x is called haarmathcal i if there exists a continuous map fkto x such that f1bxinmathcal i for all xin x moreover b is generically haarmathcal i if the set of witness functions fin ckxforall xin xf1bxinmathcal i is comeager in the function space ckx we study generically haarmathcal i sets in polish groups for many concrete and abstract ideals mathcal i and construct the corresponding distinguishing examples we prove some results on borel hull of haarmathcal i sets generalizing results of solecki elekes vidnyanszky dolevzal vlasvak on borel hulls of haarnull and haarmeager sets also we establish various steinhaus properties of the families of generically haarmathcal i sets in polish groups for various ideals mathcal i
|
[['generalizing', 'christensens', 'notion', 'of', 'a', 'haarnull', 'set', 'and', 'darjis', 'notion', 'of', 'a', 'haarmeager', 'set', 'we', 'introduce', 'and', 'study', 'the', 'notion', 'of', 'a', 'haarmathcal', 'i', 'set', 'in', 'a', 'polish', 'group', 'here', 'mathcal', 'i', 'is', 'an', 'ideal', 'of', 'subsets', 'of', 'some', 'compact', 'metrizable', 'space', 'k', 'a', 'borel', 'subset', 'bsubset', 'x', 'of', 'a', 'polish', 'group', 'x', 'is', 'called', 'haarmathcal', 'i', 'if', 'there', 'exists', 'a', 'continuous', 'map', 'fkto', 'x', 'such', 'that', 'f1bxinmathcal', 'i', 'for', 'all', 'xin', 'x', 'moreover', 'b', 'is', 'generically', 'haarmathcal', 'i', 'if', 'the', 'set', 'of', 'witness', 'functions', 'fin', 'ckxforall', 'xin', 'xf1bxinmathcal', 'i', 'is', 'comeager', 'in', 'the', 'function', 'space', 'ckx', 'we', 'study', 'generically', 'haarmathcal', 'i', 'sets', 'in', 'polish', 'groups', 'for', 'many', 'concrete', 'and', 'abstract', 'ideals', 'mathcal', 'i', 'and', 'construct', 'the', 'corresponding', 'distinguishing', 'examples', 'we', 'prove', 'some', 'results', 'on', 'borel', 'hull', 'of', 'haarmathcal', 'i', 'sets', 'generalizing', 'results', 'of', 'solecki', 'elekes', 'vidnyanszky', 'dolevzal', 'vlasvak', 'on', 'borel', 'hulls', 'of', 'haarnull', 'and', 'haarmeager', 'sets', 'also', 'we', 'establish', 'various', 'steinhaus', 'properties', 'of', 'the', 'families', 'of', 'generically', 'haarmathcal', 'i', 'sets', 'in', 'polish', 'groups', 'for', 'various', 'ideals', 'mathcal', 'i']]
|
[-0.17337587438296617, 0.1020391207138146, -0.05819158295521558, 0.0686247741105035, -0.053298357576018245, -0.11649423183180482, 0.06151645839009888, 0.3708613367904568, -0.3092492268216319, -0.08470512628441722, 0.0812809944945024, -0.33642967532547874, -0.11097892138982056, 0.20141521613000007, -0.17105389314862648, -0.02411615477147989, 0.04209758087345995, 0.04968798593277248, -0.07288814327117374, -0.2485067536415555, 0.4416486874631629, -0.14796444961074284, 0.19939213274501083, 0.017984437810188932, 0.12455269419474573, -0.03761353295171497, -0.027869090768678977, 0.07624672345849742, -0.23101476064434015, 0.07668773011054571, 0.2697514855961611, 0.24068115265307402, 0.2911627406663284, -0.28934874024991764, -0.08818256244540396, 0.24541541446772655, 0.05219638337545869, -0.07409955434097977, -0.015341183272894562, -0.2975737469145892, 0.13496823954713963, -0.18134641163505433, -0.10982146299097732, -0.0907242745267534, 0.17276581088308154, 0.012742634951392552, -0.30854643207247845, -0.07746494896642483, 0.14748317702664857, 0.1210956636322208, -0.04512307937143416, -0.10647283969787745, -0.06602387465593382, 0.030221735448122206, -0.06394672378466078, 0.09788233816067166, 0.04606799447196309, -0.016860211393000875, -0.11185231394412723, 0.3739291928472883, -0.06128999693092049, -0.23041542194124948, 0.17570757811105378, -0.2263258066789315, -0.2278494400906777, 0.05459648825614372, 0.08131800323906468, 0.14438269463390474, -0.03924900464423955, 0.25113624529508455, -0.21652841433405695, 0.05332471550692145, 0.05467005899153286, 0.054100595959802954, 0.10029909021800339, 0.1227688357253877, 0.08780281250783889, 0.10495305668971525, 0.03195676302946195, 0.04810014753119748, -0.4246292006019957, -0.1831149041862795, -0.1358417022430974, 0.14915054461424715, -0.08579509282616328, -0.19297929162943236, 0.35434209883621914, 0.09820245251644448, 0.15781618209226375, 0.10359938262121343, 0.1384765484630096, 0.01166449171752192, -0.04563163541272998, 0.12251214491680446, 0.04911930090925236, 0.13304139592645053, -0.10466287390715102, -0.0974163041427368, -0.009980154796233742, 0.1995946511671674]
|
1,803.06713
|
Four-manifolds with shadow-complexity one
|
We study the set of all closed oriented smooth 4-manifolds experimentally,
according to a suitable complexity defined using Turaev's shadows. This
complexity roughly measures how complicated the 2-skeleton of the 4-manifold
is.
We characterise here all the closed oriented 4-manifolds that have complexity
at most one. They are generated by a certain set of 20 blocks, that are some
basic 4-manifolds with boundary consisting of copies of $S^2 \times S^1$, plus
connected sums with some copies of $\mathbb{CP}^2$ with either orientation.
All the manifolds generated by these blocks are doubles. Many of these are
doubles of 2-handlebodies and are hence efficiently encoded using finite
presentations of groups. In contrast to the complexity zero case, in complexity
one there are also plenty of doubles that are not doubles of 2-handlebodies,
like for instance $\mathbb{RP}^3 \times S^1$.
|
math.GT
|
we study the set of all closed oriented smooth 4manifolds experimentally according to a suitable complexity defined using turaevs shadows this complexity roughly measures how complicated the 2skeleton of the 4manifold is we characterise here all the closed oriented 4manifolds that have complexity at most one they are generated by a certain set of 20 blocks that are some basic 4manifolds with boundary consisting of copies of s2 times s1 plus connected sums with some copies of mathbbcp2 with either orientation all the manifolds generated by these blocks are doubles many of these are doubles of 2handlebodies and are hence efficiently encoded using finite presentations of groups in contrast to the complexity zero case in complexity one there are also plenty of doubles that are not doubles of 2handlebodies like for instance mathbbrp3 times s1
|
[['we', 'study', 'the', 'set', 'of', 'all', 'closed', 'oriented', 'smooth', '4manifolds', 'experimentally', 'according', 'to', 'a', 'suitable', 'complexity', 'defined', 'using', 'turaevs', 'shadows', 'this', 'complexity', 'roughly', 'measures', 'how', 'complicated', 'the', '2skeleton', 'of', 'the', '4manifold', 'is', 'we', 'characterise', 'here', 'all', 'the', 'closed', 'oriented', '4manifolds', 'that', 'have', 'complexity', 'at', 'most', 'one', 'they', 'are', 'generated', 'by', 'a', 'certain', 'set', 'of', '20', 'blocks', 'that', 'are', 'some', 'basic', '4manifolds', 'with', 'boundary', 'consisting', 'of', 'copies', 'of', 's2', 'times', 's1', 'plus', 'connected', 'sums', 'with', 'some', 'copies', 'of', 'mathbbcp2', 'with', 'either', 'orientation', 'all', 'the', 'manifolds', 'generated', 'by', 'these', 'blocks', 'are', 'doubles', 'many', 'of', 'these', 'are', 'doubles', 'of', '2handlebodies', 'and', 'are', 'hence', 'efficiently', 'encoded', 'using', 'finite', 'presentations', 'of', 'groups', 'in', 'contrast', 'to', 'the', 'complexity', 'zero', 'case', 'in', 'complexity', 'one', 'there', 'are', 'also', 'plenty', 'of', 'doubles', 'that', 'are', 'not', 'doubles', 'of', '2handlebodies', 'like', 'for', 'instance', 'mathbbrp3', 'times', 's1']]
|
[-0.19911296621689367, 0.15667041518759947, -0.007020764373656776, 0.044083901529234866, -0.046694068614117526, -0.1307497909947954, -0.02226473321724269, 0.3910594823735732, -0.22498249984605032, -0.28781328921516736, 0.15387496661472444, -0.29702985126318204, -0.11717015710590338, 0.24394884437184644, -0.12171679570650061, -0.005904212258583693, 0.05325159981708836, 0.08397115226317611, -0.09649990606552887, -0.3403040768923583, 0.36380149063964684, -0.08432896509076711, 0.19124230175037626, -0.0035165692162182596, 0.08083846642877217, -0.02930850294177179, 0.0020607294790722704, 0.08263330140309538, -0.11329485112364637, 0.1536599402246928, 0.27259387546046465, 0.11764169668571817, 0.16425442102330703, -0.43332953636569005, -0.1465936048646216, 0.14735047396410395, 0.14252809644504277, 0.037737656778578335, 0.008000312393738164, -0.24717468595373684, 0.14073346758054361, -0.12327521954904552, -0.11144486034495962, -0.06841066072660464, 0.014517164030284793, 0.05267712620293929, -0.1378848175138787, 0.012958918634103611, 0.03254160319489462, 0.056768897913948256, -0.030536566438429332, -0.12255664599921416, -0.048964910510996426, 0.15383226989458004, 0.033326824959712446, 0.06863675642827595, 0.11464868623211429, -0.059657820560796944, -0.14462549131001448, 0.37124287323612304, -0.0324845621784873, -0.25202524538531346, 0.1960198003453789, -0.149280965789135, -0.1972938011745336, 0.2082391820503054, 0.06545976000596528, 0.13935433867111527, -0.0926705523290568, 0.12218713066325075, -0.09876553276812451, 0.1149806729759331, 0.11626059291884303, 0.050840112190969566, 0.1751133204748233, 0.08556385258971541, 0.0761810874510384, 0.13206359385340302, 0.0011061797832587251, -0.06106342938901098, -0.3215246091631276, -0.18700578477302635, -0.12404011991306174, 0.1134352572625546, -0.10688629929241465, -0.18877304546983428, 0.36466172500341026, 0.041338467922199654, 0.21579067820200212, 0.11922820783306465, 0.24778782867447094, 0.04188758868021304, 0.09607466738671064, 0.12589998003526556, 0.10741100750941163, 0.16010662888832114, -0.07304017603121422, -0.10183965445634116, -0.015333725843164656, 0.09631925759561084]
|
1,803.06714
|
Mathematics for cryo-electron microscopy
|
Single-particle cryo-electron microscopy (cryo-EM) has recently joined X-ray
crystallography and NMR spectroscopy as a high-resolution structural method for
biological macromolecules. Cryo-EM was selected by Nature Methods as Method of
the Year 2015, large scale investments in cryo-EM facilities are being made all
over the world, and the Nobel Prize in Chemistry 2017 was awarded to Jacques
Dubochet, Joachim Frank and Richard Henderson "for developing cryo-electron
microscopy for the high-resolution structure determination of biomolecules in
solution". This paper focuses on the mathematical principles underlying
existing algorithms for structure determination using single particle cryo-EM.
|
physics.comp-ph math.HO
|
singleparticle cryoelectron microscopy cryoem has recently joined xray crystallography and nmr spectroscopy as a highresolution structural method for biological macromolecules cryoem was selected by nature methods as method of the year 2015 large scale investments in cryoem facilities are being made all over the world and the nobel prize in chemistry 2017 was awarded to jacques dubochet joachim frank and richard henderson for developing cryoelectron microscopy for the highresolution structure determination of biomolecules in solution this paper focuses on the mathematical principles underlying existing algorithms for structure determination using single particle cryoem
|
[['singleparticle', 'cryoelectron', 'microscopy', 'cryoem', 'has', 'recently', 'joined', 'xray', 'crystallography', 'and', 'nmr', 'spectroscopy', 'as', 'a', 'highresolution', 'structural', 'method', 'for', 'biological', 'macromolecules', 'cryoem', 'was', 'selected', 'by', 'nature', 'methods', 'as', 'method', 'of', 'the', 'year', '2015', 'large', 'scale', 'investments', 'in', 'cryoem', 'facilities', 'are', 'being', 'made', 'all', 'over', 'the', 'world', 'and', 'the', 'nobel', 'prize', 'in', 'chemistry', '2017', 'was', 'awarded', 'to', 'jacques', 'dubochet', 'joachim', 'frank', 'and', 'richard', 'henderson', 'for', 'developing', 'cryoelectron', 'microscopy', 'for', 'the', 'highresolution', 'structure', 'determination', 'of', 'biomolecules', 'in', 'solution', 'this', 'paper', 'focuses', 'on', 'the', 'mathematical', 'principles', 'underlying', 'existing', 'algorithms', 'for', 'structure', 'determination', 'using', 'single', 'particle', 'cryoem']]
|
[0.013408755924511741, 0.05476028265451992, -0.093723157471926, 0.015411005246678142, -0.07874844335326618, -0.11816870660909994, 0.007054290365796168, 0.3642564867367292, -0.2596627395405948, -0.40022750730001994, 0.06874577536958955, -0.3442395563790022, -0.17892416601407005, 0.22817363899206272, -0.05013532817854986, 0.1198394087624255, 0.10183356160932518, -0.09507987846282649, 0.016384446696675086, -0.24820489639539148, 0.22274380416998252, 0.17120583286856886, 0.31035622980977806, 0.0701887148642237, 0.11857703180758508, 0.11211267344469389, -0.09105098460337843, 0.02052105591212819, -0.15012913424992463, 0.1677396996663167, 0.3238096921525609, 0.14592580246780026, 0.29948464671027036, -0.4478609486595615, -0.22934315265616873, 0.010533626058271952, 0.09355309589351476, 0.10793595070756234, -0.08872951694462285, -0.2870720791231309, 0.001373036646867519, -0.11247418081684672, -0.09455749978423937, -0.13836098732529106, 0.03733761067205405, -0.006748970434233383, -0.17005717490958358, 0.11631573991502052, -0.05720488062597924, 0.1810367845093504, -0.1162517712077965, -0.14792123517778877, 0.09298949129879475, 0.12441293716655819, -0.006380054982031112, 0.06239563684557452, 0.1579743238309255, -0.12625359712618883, -0.1920220147265674, 0.41183928688885746, 0.04097587200250108, -0.04295433746589409, 0.18451926744655595, -0.14726031234406017, -0.21622432739177083, 0.13817783917689308, 0.1094244267218388, 0.13963315575025403, -0.20888264525034414, 0.1393080375388848, -0.06687925834781848, 0.17924836892660215, 0.15190658549993083, -0.05539117776532913, 0.16175682774929145, 0.22294266883585767, -0.012981090346699233, 0.04078672673287136, -0.16257737480503107, -0.022817143858256905, -0.11258078216329463, -0.19163178836998457, -0.2644337662815495, 0.04008952995434731, 0.06226936641330242, -0.16933002905244685, 0.37029150081798434, 0.08654924531743585, 0.10804703852141297, -0.07800689110389122, 0.29069833101187886, -0.04830202616106432, 0.05138246973996961, -0.03419440245808481, 0.18991984342286303, 0.15007894777099265, 0.19120370260833836, -0.1761642209673812, 0.08561040023034745, 0.10817425551691226]
|
1,803.06715
|
Restricting homology to hypersurfaces
|
This paper concerns the homological properties of a module $M$ over a
commutative noetherian ring $R$ relative to a presentation $R\cong P/I$, where
$P$ is local ring. It is proved that the Betti sequence of $M$ with respect to
$P/(f)$ for a regular element $f$ in $I$ depends only on the class of $f$ in
$I/\mathfrak{n} I$, where $\mathfrak{n}$ is the maximal ideal of $P$.
Applications to the theory of supports sets in local algebra and in the modular
representation theory of elementary abelian groups are presented.
|
math.AC math.GR
|
this paper concerns the homological properties of a module m over a commutative noetherian ring r relative to a presentation rcong pi where p is local ring it is proved that the betti sequence of m with respect to pf for a regular element f in i depends only on the class of f in imathfrakn i where mathfrakn is the maximal ideal of p applications to the theory of supports sets in local algebra and in the modular representation theory of elementary abelian groups are presented
|
[['this', 'paper', 'concerns', 'the', 'homological', 'properties', 'of', 'a', 'module', 'm', 'over', 'a', 'commutative', 'noetherian', 'ring', 'r', 'relative', 'to', 'a', 'presentation', 'rcong', 'pi', 'where', 'p', 'is', 'local', 'ring', 'it', 'is', 'proved', 'that', 'the', 'betti', 'sequence', 'of', 'm', 'with', 'respect', 'to', 'pf', 'for', 'a', 'regular', 'element', 'f', 'in', 'i', 'depends', 'only', 'on', 'the', 'class', 'of', 'f', 'in', 'imathfrakn', 'i', 'where', 'mathfrakn', 'is', 'the', 'maximal', 'ideal', 'of', 'p', 'applications', 'to', 'the', 'theory', 'of', 'supports', 'sets', 'in', 'local', 'algebra', 'and', 'in', 'the', 'modular', 'representation', 'theory', 'of', 'elementary', 'abelian', 'groups', 'are', 'presented']]
|
[-0.2106141003585139, 0.05533137393920401, -0.10279457364231348, 0.004188913573121089, -0.06687263210932183, -0.15541246324387747, -0.034875217803515664, 0.32099674785033216, -0.36370663602598186, -0.18496471371428586, 0.07292547824976663, -0.23993489870714935, -0.09210850693878371, 0.1886336600115566, -0.1377631578551129, -0.05395199931741064, 0.009775934383533028, 0.1634665984270531, -0.06381817704586443, -0.2781276070447855, 0.3630221206369961, -0.013155657386537208, 0.20531772986747499, -0.005207982471992456, 0.06980112544802386, 0.024800652372759094, -0.04938185256689267, 0.03480112599208951, -0.15451335714533343, 0.14555175812525112, 0.3159528524983068, 0.07905583680867283, 0.24181394695932434, -0.3526769956292281, -0.07711392237133412, 0.17032334930804927, 0.11377067423187369, -0.030931935266613267, -0.012185154630271934, -0.20487043922117285, 0.21753195504831194, -0.21346341840635855, -0.13939309736908695, -0.014903250182870515, 0.1689038599819638, 0.042497479551753335, -0.3186463537777579, -0.0211392845525298, 0.11145834864950048, 0.16065110815255795, -0.030628656773546408, -0.09268722642039837, -0.03973747523458198, 0.031164701638180158, -0.04016073745253041, 0.044742000939021274, 0.11247545623675335, -0.10370768751505069, -0.0724503431891546, 0.36608438586902825, -0.04987366123904669, -0.20457707374183418, 0.1503952644213081, -0.2089700196696402, -0.13705316279624957, 0.10442375333243331, 0.04939617310802257, 0.16207347970542518, -0.009385440769323777, 0.2630891436920772, -0.15438865524240183, 0.12061575817507367, 0.039076342047083865, 0.028721484740069785, 0.13792191186464978, 0.11874404034663945, 0.08775462832391197, 0.10260128580726856, 0.020249942060408376, -0.0077661162724198644, -0.38084283676864794, -0.21685673550940876, -0.18771041695808255, 0.11226785511081648, -0.05362856830724076, -0.15603418884593126, 0.42929341431793777, 0.07629515072547419, 0.15783754203381928, 0.055256652970646705, 0.21380940128421022, 0.040428216926493614, 0.04551653124305398, 0.06312259419301394, 0.0934511382338526, 0.22264785533987505, -0.015583348510581133, -0.16165971121382575, -0.01451127037546749, 0.1814809242658707]
|
1,803.06716
|
High Dimensional Linear Regression using Lattice Basis Reduction
|
We consider a high dimensional linear regression problem where the goal is to
efficiently recover an unknown vector $\beta^*$ from $n$ noisy linear
observations $Y=X\beta^*+W \in \mathbb{R}^n$, for known $X \in \mathbb{R}^{n
\times p}$ and unknown $W \in \mathbb{R}^n$. Unlike most of the literature on
this model we make no sparsity assumption on $\beta^*$. Instead we adopt a
regularization based on assuming that the underlying vectors $\beta^*$ have
rational entries with the same denominator $Q \in \mathbb{Z}_{>0}$. We call
this $Q$-rationality assumption.
We propose a new polynomial-time algorithm for this task which is based on
the seminal Lenstra-Lenstra-Lovasz (LLL) lattice basis reduction algorithm. We
establish that under the $Q$-rationality assumption, our algorithm recovers
exactly the vector $\beta^*$ for a large class of distributions for the iid
entries of $X$ and non-zero noise $W$. We prove that it is successful under
small noise, even when the learner has access to only one observation ($n=1$).
Furthermore, we prove that in the case of the Gaussian white noise for $W$,
$n=o\left(p/\log p\right)$ and $Q$ sufficiently large, our algorithm tolerates
a nearly optimal information-theoretic level of the noise.
|
math.ST math.PR stat.ML stat.TH
|
we consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector beta from n noisy linear observations yxbetaw in mathbbrn for known x in mathbbrn times p and unknown w in mathbbrn unlike most of the literature on this model we make no sparsity assumption on beta instead we adopt a regularization based on assuming that the underlying vectors beta have rational entries with the same denominator q in mathbbz_0 we call this qrationality assumption we propose a new polynomialtime algorithm for this task which is based on the seminal lenstralenstralovasz lll lattice basis reduction algorithm we establish that under the qrationality assumption our algorithm recovers exactly the vector beta for a large class of distributions for the iid entries of x and nonzero noise w we prove that it is successful under small noise even when the learner has access to only one observation n1 furthermore we prove that in the case of the gaussian white noise for w noleftplog pright and q sufficiently large our algorithm tolerates a nearly optimal informationtheoretic level of the noise
|
[['we', 'consider', 'a', 'high', 'dimensional', 'linear', 'regression', 'problem', 'where', 'the', 'goal', 'is', 'to', 'efficiently', 'recover', 'an', 'unknown', 'vector', 'beta', 'from', 'n', 'noisy', 'linear', 'observations', 'yxbetaw', 'in', 'mathbbrn', 'for', 'known', 'x', 'in', 'mathbbrn', 'times', 'p', 'and', 'unknown', 'w', 'in', 'mathbbrn', 'unlike', 'most', 'of', 'the', 'literature', 'on', 'this', 'model', 'we', 'make', 'no', 'sparsity', 'assumption', 'on', 'beta', 'instead', 'we', 'adopt', 'a', 'regularization', 'based', 'on', 'assuming', 'that', 'the', 'underlying', 'vectors', 'beta', 'have', 'rational', 'entries', 'with', 'the', 'same', 'denominator', 'q', 'in', 'mathbbz_0', 'we', 'call', 'this', 'qrationality', 'assumption', 'we', 'propose', 'a', 'new', 'polynomialtime', 'algorithm', 'for', 'this', 'task', 'which', 'is', 'based', 'on', 'the', 'seminal', 'lenstralenstralovasz', 'lll', 'lattice', 'basis', 'reduction', 'algorithm', 'we', 'establish', 'that', 'under', 'the', 'qrationality', 'assumption', 'our', 'algorithm', 'recovers', 'exactly', 'the', 'vector', 'beta', 'for', 'a', 'large', 'class', 'of', 'distributions', 'for', 'the', 'iid', 'entries', 'of', 'x', 'and', 'nonzero', 'noise', 'w', 'we', 'prove', 'that', 'it', 'is', 'successful', 'under', 'small', 'noise', 'even', 'when', 'the', 'learner', 'has', 'access', 'to', 'only', 'one', 'observation', 'n1', 'furthermore', 'we', 'prove', 'that', 'in', 'the', 'case', 'of', 'the', 'gaussian', 'white', 'noise', 'for', 'w', 'noleftplog', 'pright', 'and', 'q', 'sufficiently', 'large', 'our', 'algorithm', 'tolerates', 'a', 'nearly', 'optimal', 'informationtheoretic', 'level', 'of', 'the', 'noise']]
|
[-0.1227092104372234, 0.08354002163233815, -0.04553141629127837, 0.049019002102222806, -0.0554138559318091, -0.20155181443525827, 0.08829110626321678, 0.3796151494144241, -0.2788897231716447, -0.21934231552835656, 0.10113752202564356, -0.24544518784161926, -0.17506673592927438, 0.15248981591453004, -0.09889338155230765, 0.0760283846985703, 0.03615268313413414, 0.08966912614478786, -0.052732890997936134, -0.29963834053394256, 0.324725108807109, -0.012667829650634312, 0.2389588412977961, -0.05054978144969997, 0.14879188593991555, 0.04402833449196338, -0.009281388386178412, -0.03875544189748185, -0.12280359757676314, 0.07450365929321505, 0.23145141534620475, 0.12023508576200298, 0.299768671154132, -0.35720586186038195, -0.17429589677102947, 0.1735680222528014, 0.11610037326949098, 0.08316513062364715, -0.02539064415216958, -0.22427702956133166, 0.13951333489871034, -0.10896002235745199, -0.09816193203853434, -0.05537891733197711, 0.03253594048074267, -0.02563541897222688, -0.3803293442724077, 0.059573396514247055, 0.10458943184506334, 0.012006704407378783, -0.04231769487632243, -0.20004539383647357, 0.06948463073146957, 0.05467554108057691, 0.037157238198660354, 0.07791782763110633, 0.06661970218777327, -0.10594942268082719, -0.08529917934384629, 0.3441811060132227, -0.09927782176502399, -0.2568974169157703, 0.1303650000755217, -0.16983674724138656, -0.2044057463995536, 0.12379021110985614, 0.178783914269828, 0.11399924510174035, -0.09399431576935938, 0.1750827076840369, -0.12873765945599225, 0.18243343192564312, 0.07166864017786159, 0.018896808098481956, 0.08826577858819282, 0.129642286514143, 0.11646682645441213, 0.12142498501015632, -0.10048563758590522, -0.03402987694707365, -0.3159675539203647, -0.11043306203071512, -0.24509261559324536, 0.09629343686115964, -0.11526779626093828, -0.16285344552845585, 0.3267247520685608, 0.1645156577540155, 0.2309672811135485, 0.10536400027616845, 0.2739368545274811, 0.10357554276983218, 0.0009525508956870487, 0.12481480490291512, 0.15417910230510679, 0.10890530009151987, 0.027401831811448323, -0.16574755643149683, 0.08197746606471625, 0.056249435580700884]
|
1,803.06717
|
High frequency limits for invariant Ruelle densities
|
We establish an equidistribution result for Ruelle resonant states on compact
locally symmetric spaces of rank one. More precisely, we prove that among the
first band Ruelle resonances there is a density one subsequence such that the
respective products of resonant and co-resonant states converge weakly to the
Liouville measure. We prove this result by establishing an explicit
quantum-classical correspondence between eigenspaces of the scalar Laplacian
and the resonant states of the first band of Ruelle resonances which also leads
to a new description of Patterson-Sullivan distributions.
|
math.AP math-ph math.DS math.MP math.SP
|
we establish an equidistribution result for ruelle resonant states on compact locally symmetric spaces of rank one more precisely we prove that among the first band ruelle resonances there is a density one subsequence such that the respective products of resonant and coresonant states converge weakly to the liouville measure we prove this result by establishing an explicit quantumclassical correspondence between eigenspaces of the scalar laplacian and the resonant states of the first band of ruelle resonances which also leads to a new description of pattersonsullivan distributions
|
[['we', 'establish', 'an', 'equidistribution', 'result', 'for', 'ruelle', 'resonant', 'states', 'on', 'compact', 'locally', 'symmetric', 'spaces', 'of', 'rank', 'one', 'more', 'precisely', 'we', 'prove', 'that', 'among', 'the', 'first', 'band', 'ruelle', 'resonances', 'there', 'is', 'a', 'density', 'one', 'subsequence', 'such', 'that', 'the', 'respective', 'products', 'of', 'resonant', 'and', 'coresonant', 'states', 'converge', 'weakly', 'to', 'the', 'liouville', 'measure', 'we', 'prove', 'this', 'result', 'by', 'establishing', 'an', 'explicit', 'quantumclassical', 'correspondence', 'between', 'eigenspaces', 'of', 'the', 'scalar', 'laplacian', 'and', 'the', 'resonant', 'states', 'of', 'the', 'first', 'band', 'of', 'ruelle', 'resonances', 'which', 'also', 'leads', 'to', 'a', 'new', 'description', 'of', 'pattersonsullivan', 'distributions']]
|
[-0.14970547199482098, 0.12591516231166383, -0.11654909504144344, 0.11147972509308263, -0.03829521404817527, -0.10907329270226318, 0.049459937641797805, 0.3395677412708485, -0.27083639249877006, -0.19567877119190472, 0.023224936500408275, -0.28964329128110305, -0.17729307733053817, 0.16730483440509022, -0.05104269069446207, 0.06451939722133238, 0.08763279774507811, 0.06307085115072686, -0.06687838696268235, -0.14440714146638678, 0.45447914783171445, -0.027989565059109482, 0.20506211710270755, 0.12000208113039303, 0.05031691047330495, 0.0259329765645224, 0.038425805442425055, -0.11301322038783583, -0.17401094598845215, 0.16342701124051737, 0.2724264962111361, 0.062406369409155706, 0.25630104269420856, -0.3650576337132343, -0.14027022711152948, 0.16639336319856865, 0.1240715688787574, 0.06617993570263173, -0.036022491115016785, -0.3340281773965026, 0.08817881211465181, -0.13560525609483554, -0.19480884045925598, -0.1089483140859493, 0.043924555830863236, -0.007378085765467827, -0.2897905580385393, 0.05058152090756732, 0.13302164373182973, 0.04406606064849468, -0.08705337985613665, -0.08185483940855362, -0.04987434469986447, 0.08571530968968778, 0.03895758740809681, -0.024625389593068595, 0.08483837943437487, -0.04155386057086722, -0.13896122887367815, 0.2801124591171893, -0.10340013739458004, -0.21316634883107835, 0.19831192936223044, -0.19162377768715974, -0.14076039157158068, 0.10489306749429467, 0.10904111063411069, 0.16166672157698994, -0.08578726696121225, 0.08933851849368968, -0.1041264773609095, 0.12091292886382922, 0.1467341495201338, 0.10025004516788867, 0.15734603533218072, 0.07169616094595471, 0.18504622415097993, 0.14160270719290818, -0.01680493728138593, -0.08349875012767329, -0.3156102221285881, -0.2067247310458401, -0.2163246959572398, 0.08812301238825501, -0.09152277629940261, -0.22472862394656554, 0.4213957496767127, 0.045926976464363896, 0.22836459213651197, 0.12340482534586214, 0.18916442002397205, 0.18960484533928074, -0.006392682890331936, 0.09624497677459447, 0.21629950163755998, 0.24505772347681137, 0.014455340797254858, -0.20479617846674872, -0.06298956714657157, 0.1481511534467816]
|
1,803.06718
|
Directional emphasis in ambisonics
|
We describe an ambisonics enhancement method that increases the signal
strength in specified directions at low computational cost. The method can be
used in a static setup to emphasize the signal arriving from a particular
direction or set of directions. It can also be used in an adaptive arrangement
where it sharpens directionality and reduces the distortion in timbre
associated with low-degree ambisonics representations. The emphasis operator
has very low computational complexity and can be applied to time-domain as well
as time-frequency ambisonics representations. The operator upscales a
low-degree ambisonics representation to a higher degree representation.
|
eess.AS cs.SD
|
we describe an ambisonics enhancement method that increases the signal strength in specified directions at low computational cost the method can be used in a static setup to emphasize the signal arriving from a particular direction or set of directions it can also be used in an adaptive arrangement where it sharpens directionality and reduces the distortion in timbre associated with lowdegree ambisonics representations the emphasis operator has very low computational complexity and can be applied to timedomain as well as timefrequency ambisonics representations the operator upscales a lowdegree ambisonics representation to a higher degree representation
|
[['we', 'describe', 'an', 'ambisonics', 'enhancement', 'method', 'that', 'increases', 'the', 'signal', 'strength', 'in', 'specified', 'directions', 'at', 'low', 'computational', 'cost', 'the', 'method', 'can', 'be', 'used', 'in', 'a', 'static', 'setup', 'to', 'emphasize', 'the', 'signal', 'arriving', 'from', 'a', 'particular', 'direction', 'or', 'set', 'of', 'directions', 'it', 'can', 'also', 'be', 'used', 'in', 'an', 'adaptive', 'arrangement', 'where', 'it', 'sharpens', 'directionality', 'and', 'reduces', 'the', 'distortion', 'in', 'timbre', 'associated', 'with', 'lowdegree', 'ambisonics', 'representations', 'the', 'emphasis', 'operator', 'has', 'very', 'low', 'computational', 'complexity', 'and', 'can', 'be', 'applied', 'to', 'timedomain', 'as', 'well', 'as', 'timefrequency', 'ambisonics', 'representations', 'the', 'operator', 'upscales', 'a', 'lowdegree', 'ambisonics', 'representation', 'to', 'a', 'higher', 'degree', 'representation']]
|
[-0.08885025745257735, 0.10173773140589522, -0.08661677976003072, 0.0504617286848467, -0.12253161807893775, -0.10852334143661817, 0.024073812586721033, 0.4069351857760921, -0.33351910655619577, -0.2834938604113025, 0.0928025359462481, -0.24405485121921325, -0.18515698256427035, 0.2091781570125022, -0.08783900648510705, 0.024283647498426337, 0.03217898373986827, 0.09023784773307852, -0.05835969206782465, -0.19731802449193006, 0.2278239572685076, 0.11565586846942703, 0.31456205616511096, 0.024192038355977274, 0.0793669195457672, 0.004856874952868869, 0.0061798836492622895, 0.03726829414760383, -0.013546666113825268, 0.11127679441900303, 0.31668222057972645, 0.13728312869837586, 0.24750074785940038, -0.3983329361314342, -0.20332276900686944, 0.11741994414963604, 0.17341204091887144, 0.11569289148125488, -0.030964911105305266, -0.2633001751479848, 0.08585040717055865, -0.1554907310311743, -0.1213436732214177, -0.09150595344302322, -0.03879890096868621, 0.018399462147499435, -0.2794440655852668, 0.046708348330563844, 0.0423382432697205, 0.07699622420477681, -0.03667132665092746, -0.11870536429341882, -0.001661157570197247, 0.11827785122295609, 0.01708725116138036, 0.12333676305327874, 0.07675127644809739, -0.12094966239722756, -0.10767766270631303, 0.37061998522646417, -0.08492402013386406, -0.2782582202811075, 0.1820178090177554, -0.13482100768790892, -0.10875070426027378, 0.14089832883473719, 0.23146950223114496, 0.08518490732240025, -0.05120300430765686, 0.06999724285014963, 0.018263297493831487, 0.17675324656253602, 0.10717239778750809, 0.05503323063021526, 0.13788676744540376, 0.13917344328304657, 0.10694942292563307, 0.1496835678954085, -0.0801952961198064, 0.010307294190473234, -0.25439954371055745, -0.1233279407703473, -0.20024106168663516, -0.025174293308130775, -0.12843942095999714, -0.09052864642095908, 0.4132080440273664, 0.1333222503065675, 0.22023517900379375, 0.04434889393936222, 0.28384548727384146, 0.17618225519390762, 0.10091223300939116, 0.05926952578981096, 0.18204026467113485, 0.1301064040089841, 0.08669029443990439, -0.20423167861251082, 0.07124709275861581, 0.0670159064005323]
|
1,803.06719
|
Summability in a monomial for some classes of singularly perturbed
partial differential equation
|
The aim of this paper is to continue the study of asymptotic expansions and
summability in a monomial in any number of variables. In particular we
characterize these expansions in terms of bounded derivatives and we develop
tauberian theorems for the summability processes involved. Furthermore, we
develop and apply the Borel-Laplace analysis in this framework to prove the
monomial summability of solutions of a specific class of singularly perturbed
PDEs.
|
math.CA
|
the aim of this paper is to continue the study of asymptotic expansions and summability in a monomial in any number of variables in particular we characterize these expansions in terms of bounded derivatives and we develop tauberian theorems for the summability processes involved furthermore we develop and apply the borellaplace analysis in this framework to prove the monomial summability of solutions of a specific class of singularly perturbed pdes
|
[['the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'continue', 'the', 'study', 'of', 'asymptotic', 'expansions', 'and', 'summability', 'in', 'a', 'monomial', 'in', 'any', 'number', 'of', 'variables', 'in', 'particular', 'we', 'characterize', 'these', 'expansions', 'in', 'terms', 'of', 'bounded', 'derivatives', 'and', 'we', 'develop', 'tauberian', 'theorems', 'for', 'the', 'summability', 'processes', 'involved', 'furthermore', 'we', 'develop', 'and', 'apply', 'the', 'borellaplace', 'analysis', 'in', 'this', 'framework', 'to', 'prove', 'the', 'monomial', 'summability', 'of', 'solutions', 'of', 'a', 'specific', 'class', 'of', 'singularly', 'perturbed', 'pdes']]
|
[-0.13416593677497335, 0.031442854407110386, -0.10170286941741194, 0.07543291821244306, -0.059827917228852, -0.03851249243265816, 0.0160337311976556, 0.2860572769173554, -0.30235039211277454, -0.18852568660596652, 0.1491612990802553, -0.25434752060100435, -0.18468770464616163, 0.16155594971163997, -0.13243508403122958, 0.09494093696453741, 0.021919429135907973, 0.023005879989692144, -0.08630567057989538, -0.25648305486621603, 0.3992674681757178, -0.04499319956770965, 0.18352767496502825, 0.024149479544056312, 0.06606786251068116, -0.017247462093031834, -0.07846627180198473, -0.030824659086231675, -0.22961162757128478, 0.17187435516555394, 0.2931642441877297, 0.09059697960037738, 0.3536570029599326, -0.39885043131985837, -0.14103106453216502, 0.17793792336513953, 0.18216849337997182, 0.032059525791555646, -0.004875797083202217, -0.21685063644378846, 0.1031894207799009, -0.14481426868587732, -0.21007758093598697, -0.17337203725640263, -0.027211687210780967, 0.12382138033197927, -0.3363556337143694, 0.07054219163422074, 0.1349045167078397, 0.09617777707421088, -0.07856854804392371, -0.050388987016464985, 0.07121970291648592, 0.06073566409093993, 0.07268822031827378, -0.047149045788682994, 0.01807953872984009, -0.10501433176188064, -0.10627487464142697, 0.33631595467616404, -0.08855812956046845, -0.2535336892320109, 0.1386294563966138, -0.24119854592718185, -0.2327520179961409, 0.03320480929687619, 0.1950935767098729, 0.2153040973735707, -0.1589702404170696, 0.16563644581890133, -0.009949276889009135, 0.07874873851625515, 0.12000265231888209, 0.041367734250213416, 0.0736238661554775, 0.10258996163694455, 0.07739970252982208, 0.22409356421059265, 0.021387132204004695, -0.06895720884203911, -0.37440984936963234, -0.20137501742158617, -0.13336255350815399, 0.06790136200143024, -0.14148169451197776, -0.23625179095459836, 0.4574644462538085, 0.19735309936326562, 0.12739513890285578, 0.1371238587291113, 0.20574394983372518, 0.1777995360216924, -0.028816400029297386, 0.028499416767486505, 0.1828917110205761, 0.1930787343531847, 0.10077022312741195, -0.16458543443919293, 0.02150234168262354, 0.18880718319207]
|
1,803.0672
|
TYDR - Track Your Daily Routine. Android App for Tracking Smartphone
Sensor and Usage Data
|
We present the Android app TYDR (Track Your Daily Routine) which tracks
smartphone sensor and usage data and utilizes standardized psychometric
personality questionnaires. With the app, we aim at collecting data for
researching correlations between the tracked smartphone data and the user's
personality in order to predict personality from smartphone data. In this
paper, we highlight our approaches in addressing the challenges in developing
such an app. We optimize the tracking of sensor data by assessing the trade-off
of size of data and battery consumption and granularity of the stored
information. Our user interface is designed to incentivize users to install the
app and fill out questionnaires. TYDR processes and visualizes the tracked
sensor and usage data as well as the results of the personality questionnaires.
When developing an app that will be used in psychological studies, requirements
posed by ethics commissions / institutional review boards and data protection
officials have to be met. We detail our approaches concerning those
requirements regarding the anonymized storing of user data, informing the users
about the data collection, and enabling an opt-out option. We present our
process for anonymized data storing while still being able to identify
individual users who successfully completed a psychological study with the app.
|
cs.CY cs.HC
|
we present the android app tydr track your daily routine which tracks smartphone sensor and usage data and utilizes standardized psychometric personality questionnaires with the app we aim at collecting data for researching correlations between the tracked smartphone data and the users personality in order to predict personality from smartphone data in this paper we highlight our approaches in addressing the challenges in developing such an app we optimize the tracking of sensor data by assessing the tradeoff of size of data and battery consumption and granularity of the stored information our user interface is designed to incentivize users to install the app and fill out questionnaires tydr processes and visualizes the tracked sensor and usage data as well as the results of the personality questionnaires when developing an app that will be used in psychological studies requirements posed by ethics commissions institutional review boards and data protection officials have to be met we detail our approaches concerning those requirements regarding the anonymized storing of user data informing the users about the data collection and enabling an optout option we present our process for anonymized data storing while still being able to identify individual users who successfully completed a psychological study with the app
|
[['we', 'present', 'the', 'android', 'app', 'tydr', 'track', 'your', 'daily', 'routine', 'which', 'tracks', 'smartphone', 'sensor', 'and', 'usage', 'data', 'and', 'utilizes', 'standardized', 'psychometric', 'personality', 'questionnaires', 'with', 'the', 'app', 'we', 'aim', 'at', 'collecting', 'data', 'for', 'researching', 'correlations', 'between', 'the', 'tracked', 'smartphone', 'data', 'and', 'the', 'users', 'personality', 'in', 'order', 'to', 'predict', 'personality', 'from', 'smartphone', 'data', 'in', 'this', 'paper', 'we', 'highlight', 'our', 'approaches', 'in', 'addressing', 'the', 'challenges', 'in', 'developing', 'such', 'an', 'app', 'we', 'optimize', 'the', 'tracking', 'of', 'sensor', 'data', 'by', 'assessing', 'the', 'tradeoff', 'of', 'size', 'of', 'data', 'and', 'battery', 'consumption', 'and', 'granularity', 'of', 'the', 'stored', 'information', 'our', 'user', 'interface', 'is', 'designed', 'to', 'incentivize', 'users', 'to', 'install', 'the', 'app', 'and', 'fill', 'out', 'questionnaires', 'tydr', 'processes', 'and', 'visualizes', 'the', 'tracked', 'sensor', 'and', 'usage', 'data', 'as', 'well', 'as', 'the', 'results', 'of', 'the', 'personality', 'questionnaires', 'when', 'developing', 'an', 'app', 'that', 'will', 'be', 'used', 'in', 'psychological', 'studies', 'requirements', 'posed', 'by', 'ethics', 'commissions', 'institutional', 'review', 'boards', 'and', 'data', 'protection', 'officials', 'have', 'to', 'be', 'met', 'we', 'detail', 'our', 'approaches', 'concerning', 'those', 'requirements', 'regarding', 'the', 'anonymized', 'storing', 'of', 'user', 'data', 'informing', 'the', 'users', 'about', 'the', 'data', 'collection', 'and', 'enabling', 'an', 'optout', 'option', 'we', 'present', 'our', 'process', 'for', 'anonymized', 'data', 'storing', 'while', 'still', 'being', 'able', 'to', 'identify', 'individual', 'users', 'who', 'successfully', 'completed', 'a', 'psychological', 'study', 'with', 'the', 'app']]
|
[-0.07136956863128123, -0.0009015630263699373, -0.06346202150498535, 0.07822061598724259, -0.15495345108530612, -0.2015026700842724, 0.1248191536989693, 0.4080290176595251, -0.23595869937893368, -0.4073138944895975, 0.13083469478913365, -0.38783314830724, -0.09761013553875006, 0.17131843659844176, -0.15744681049859627, 0.05394550141714075, 0.07583264940402325, 0.04468291289830471, 0.04242095071708272, -0.3234231652093905, 0.3102231983394435, 0.13349608675229782, 0.33972630684957933, 0.06261836681012795, 0.06668051688386328, 0.03207043059256987, -0.11448088406577167, -0.04962914011340734, -0.1144439376146015, 0.15943100298532312, 0.40309667885851336, 0.26184472430031747, 0.34859396901903855, -0.4686513421509196, -0.11343065961595059, 0.012788175898558442, 0.10681495638938014, 0.03316444109305831, -0.07500926364617258, -0.39464030671047556, 0.0930844935230162, -0.21348652625502104, -0.08086698150545285, -0.08595267203910385, -0.010118108480146118, 0.024453003600059423, -0.24918096303008497, -0.048565849955148045, -0.042882144787262065, 0.15823335507336786, -0.04185012745095745, -0.06314915729122803, -0.006217585099340581, 0.2857645441655026, 0.10063098096183168, -0.05547620469245457, 0.1984026661649456, -0.13609832913304368, -0.14253047892570442, 0.34239297034675437, 0.044569428341906046, -0.14843520166023688, 0.14216493631372976, -0.05777492567408355, -0.10852429106393281, 0.04204813451232279, 0.23980733278828362, 0.04011735224562204, -0.22759064538873716, -0.03189100178161764, 0.0062126577763325155, 0.21903305749041393, 0.0250719801189524, -0.010176022591836312, 0.1751953777183742, 0.21898609611968162, 0.013427881529102759, 0.072165152856934, -0.08123905684652866, -0.01193246285102385, -0.21359076445714534, -0.17703569105373496, -0.16784796596039087, 0.002528034322940763, -0.05898852877740579, -0.08424688484428414, 0.3955099422041802, 0.260705707129091, 0.11981759629184928, 0.03903079586726723, 0.34097630407332497, -0.018571467019986205, 0.103679880232484, 0.1206668403431061, 0.11131898786270004, -0.057941944735277646, 0.2711914098609294, -0.1551367882057093, 0.128292915039221, -0.07387956488859274]
|
1,803.06721
|
A note on defect Mellin amplitudes
|
We generalize the Mellin representation for a generic co-dimension flat
defect CFT. We study the analytic structure of the Mellin amplitudes. We also
compute Witten diagrams for a generic co-dimension flat defect CFT.
|
hep-th
|
we generalize the mellin representation for a generic codimension flat defect cft we study the analytic structure of the mellin amplitudes we also compute witten diagrams for a generic codimension flat defect cft
|
[['we', 'generalize', 'the', 'mellin', 'representation', 'for', 'a', 'generic', 'codimension', 'flat', 'defect', 'cft', 'we', 'study', 'the', 'analytic', 'structure', 'of', 'the', 'mellin', 'amplitudes', 'we', 'also', 'compute', 'witten', 'diagrams', 'for', 'a', 'generic', 'codimension', 'flat', 'defect', 'cft']]
|
[-0.16838680388349475, 0.09155665109442039, -0.15761229977237456, 0.19571993195197798, -0.12235712880889575, -0.1469289410125577, -0.03868609012076349, 0.35118450839636906, -0.14716628261587836, -0.04248023814183067, 0.03568611831658266, -0.25697518456162827, -0.22287620017022797, 0.1294737567730022, -0.0822298564016819, 0.034503689938873955, 0.009376174530409502, 0.0496444360522384, -0.1908839466896924, -0.22474098972496437, 0.44249350013154926, -0.048262645744464615, 0.2781657956992135, 0.06812237196771259, 0.04562602406649879, 0.10653142082138044, -0.012544567781415853, -0.03397659020441951, -0.24304274407525858, 0.22245058242344495, 0.30533556724813854, -0.008658002949122227, -0.015034098171092795, -0.4310706081715497, -0.19431285314600577, 0.10134357230907137, 0.17971990065592708, 0.1574695041459618, 0.04311410783592499, -0.2519969606038296, 0.0923670807599344, -0.1813986755794648, -0.2922639907655222, -0.1591472217079365, 0.04066510131639062, -0.18210037928215708, -0.21259230129230258, 0.04090733164974319, 0.03488531539385969, 0.06935765642221227, -0.09597306918691505, -0.04213801748824842, -0.12261573885652152, 0.0732108521359888, 0.018151352859356186, 0.0629617767196826, 0.12229855235835368, -0.1794529759296865, -0.1562625832968589, 0.17846275814526685, -0.03419354567868692, -0.2617788130248135, 0.11422634432374527, -0.212175604802641, -0.2343817808185563, 0.05978752342476086, 0.10179616465713039, 0.2309082452433579, -0.06557704584680102, 0.2724587779605027, -0.025331745488625584, 0.059884317219257355, 0.2128411936432575, -0.016195653062878235, 0.23234962638128887, 0.05644169541527376, -0.004616942002692006, 0.2545144542713057, -0.0356872819335849, -0.06936264873454065, -0.452781014595971, -0.242909867711591, -0.14980028177413976, 0.15096427975786905, -0.26946428399815253, -0.2738561909081358, 0.462725340191162, 0.07546277019675031, 0.21591588386570837, 0.13991144866767255, 0.21410782714233254, 0.15517745539546013, 0.03654029197765119, 0.08339085494817207, 0.11601156899423311, 0.16669322008436377, 0.025013329461216927, -0.16253492196626734, -0.16330288244750013, 0.3051839716958277]
|
1,803.06722
|
Excluding joint probabilities from quantum theory
|
Quantum theory does not provide a unique definition for the joint probability
of two non-commuting observables, which is the next important question after
the Born's probability for a single observable. Instead, various definitions
were suggested, e.g. via quasi-probabilities or via hidden-variable theories.
After reviewing open issues of the joint probability, we relate it to quantum
imprecise probabilities, which are non-contextual and are consistent with all
constraints expected from a quantum probability. We study two non-commuting
observables in a two-dimensional Hilbert space and show that there is no
precise joint probability that applies for any quantum state and is consistent
with imprecise probabilities. This contrasts to theorems by Bell and
Kochen-Specker that exclude joint probabilities for more than two non-commuting
observables, in Hilbert space with dimension larger than two. If measurement
contexts are included into the definition, joint probabilities are not anymore
excluded, but they are still constrained by imprecise probabilities.
|
quant-ph cond-mat.stat-mech physics.data-an
|
quantum theory does not provide a unique definition for the joint probability of two noncommuting observables which is the next important question after the borns probability for a single observable instead various definitions were suggested eg via quasiprobabilities or via hiddenvariable theories after reviewing open issues of the joint probability we relate it to quantum imprecise probabilities which are noncontextual and are consistent with all constraints expected from a quantum probability we study two noncommuting observables in a twodimensional hilbert space and show that there is no precise joint probability that applies for any quantum state and is consistent with imprecise probabilities this contrasts to theorems by bell and kochenspecker that exclude joint probabilities for more than two noncommuting observables in hilbert space with dimension larger than two if measurement contexts are included into the definition joint probabilities are not anymore excluded but they are still constrained by imprecise probabilities
|
[['quantum', 'theory', 'does', 'not', 'provide', 'a', 'unique', 'definition', 'for', 'the', 'joint', 'probability', 'of', 'two', 'noncommuting', 'observables', 'which', 'is', 'the', 'next', 'important', 'question', 'after', 'the', 'borns', 'probability', 'for', 'a', 'single', 'observable', 'instead', 'various', 'definitions', 'were', 'suggested', 'eg', 'via', 'quasiprobabilities', 'or', 'via', 'hiddenvariable', 'theories', 'after', 'reviewing', 'open', 'issues', 'of', 'the', 'joint', 'probability', 'we', 'relate', 'it', 'to', 'quantum', 'imprecise', 'probabilities', 'which', 'are', 'noncontextual', 'and', 'are', 'consistent', 'with', 'all', 'constraints', 'expected', 'from', 'a', 'quantum', 'probability', 'we', 'study', 'two', 'noncommuting', 'observables', 'in', 'a', 'twodimensional', 'hilbert', 'space', 'and', 'show', 'that', 'there', 'is', 'no', 'precise', 'joint', 'probability', 'that', 'applies', 'for', 'any', 'quantum', 'state', 'and', 'is', 'consistent', 'with', 'imprecise', 'probabilities', 'this', 'contrasts', 'to', 'theorems', 'by', 'bell', 'and', 'kochenspecker', 'that', 'exclude', 'joint', 'probabilities', 'for', 'more', 'than', 'two', 'noncommuting', 'observables', 'in', 'hilbert', 'space', 'with', 'dimension', 'larger', 'than', 'two', 'if', 'measurement', 'contexts', 'are', 'included', 'into', 'the', 'definition', 'joint', 'probabilities', 'are', 'not', 'anymore', 'excluded', 'but', 'they', 'are', 'still', 'constrained', 'by', 'imprecise', 'probabilities']]
|
[-0.08133368048254246, 0.19741641891188919, -0.07244517285997669, 0.14012963840272277, -0.060304915594557924, -0.20780892911056678, 0.07795289721883213, 0.37000800570473075, -0.2057214156613433, -0.24970865288749336, 0.07808890616948096, -0.24496703363955022, -0.0869127936490501, 0.19776640266024817, -0.11969313779690613, 0.1170937412418425, 0.08619271848971645, 0.0742396601338017, -0.11387396561214701, -0.22527677372097968, 0.3519203482195735, 0.025178471255737047, 0.24172230609382192, 4.866780092318853e-05, 0.09431297463054458, 0.06392766868695617, -0.06017352740901212, 0.06381066464780209, -0.12947500041293097, 0.09635666272874611, 0.2903097722289385, 0.20765829776258518, 0.2598767243201534, -0.4198997419700026, -0.2096631173354884, 0.16929484461123745, 0.08970419228106039, 0.11787515316313754, 0.043955439982140285, -0.3348481957738598, 0.03441910711117089, -0.16831764506486555, -0.06444864357200762, -0.10891152285039425, 0.02241293266105155, -0.031158014102838933, -0.2868354703501488, 0.1070729190375035, 0.07003183957344541, 0.014406424444168807, -0.008145643882453441, -0.10267899448052048, 0.004956533020207037, 0.08668554065516218, -0.003368069585412741, 0.002969650786059598, 0.11052757136213283, -0.09221430619092037, -0.19452789946071183, 0.34557308330821496, 0.02961448742445403, -0.24785251069193084, 0.16413084771794578, -0.18367882586084305, -0.2045310233316074, 0.09415887794457375, 0.04069117007777095, 0.09432269452605396, -0.16619120246187474, 0.0786340776256596, -0.05792326799283425, 0.15966667939831192, 0.06681277986615897, 0.12918481388362124, 0.26013699573775134, 0.03559026642392079, 0.07931143910313646, 0.056455777178828916, -0.02811229628821214, -0.1784022078725199, -0.36574534930909675, -0.16482012384105474, -0.20169515259641532, 0.0785792197335589, -0.05350711769075133, -0.1274366913239161, 0.3140275389745754, 0.1568045500976344, 0.2378676604355375, 0.08088964359990011, 0.2647520814587673, 0.12299621690064669, 0.0008719518408179283, 0.04164667319195966, 0.22241665591408188, 0.1102708341817682, -0.009127309719721477, -0.11940812245942652, 0.13902614924746254, 0.05837211303412914]
|
1,803.06723
|
Universality in statistics of Stokes flow over no-slip wall with random
roughness
|
Stochastic roughness is widespread feature of natural surfaces and is an
inherent by-product of most fabrication techniques. In view of rapid
development of microfluidics, the important question is how this inevitable
evil affects the low-Reynolds flows which are common for micro-devices.
Moreover, one could potentially turn the flaw into a virtue and control the
flow properties by means of specially "tuned" random roughness. In this paper
we investigate theoretically the statistics of fluctuations in fluid velocity
produced by the waviness irregularities at the surface of a no-slip wall.
Particular emphasis is laid on the issue of the universality of our findings.
|
physics.flu-dyn
|
stochastic roughness is widespread feature of natural surfaces and is an inherent byproduct of most fabrication techniques in view of rapid development of microfluidics the important question is how this inevitable evil affects the lowreynolds flows which are common for microdevices moreover one could potentially turn the flaw into a virtue and control the flow properties by means of specially tuned random roughness in this paper we investigate theoretically the statistics of fluctuations in fluid velocity produced by the waviness irregularities at the surface of a noslip wall particular emphasis is laid on the issue of the universality of our findings
|
[['stochastic', 'roughness', 'is', 'widespread', 'feature', 'of', 'natural', 'surfaces', 'and', 'is', 'an', 'inherent', 'byproduct', 'of', 'most', 'fabrication', 'techniques', 'in', 'view', 'of', 'rapid', 'development', 'of', 'microfluidics', 'the', 'important', 'question', 'is', 'how', 'this', 'inevitable', 'evil', 'affects', 'the', 'lowreynolds', 'flows', 'which', 'are', 'common', 'for', 'microdevices', 'moreover', 'one', 'could', 'potentially', 'turn', 'the', 'flaw', 'into', 'a', 'virtue', 'and', 'control', 'the', 'flow', 'properties', 'by', 'means', 'of', 'specially', 'tuned', 'random', 'roughness', 'in', 'this', 'paper', 'we', 'investigate', 'theoretically', 'the', 'statistics', 'of', 'fluctuations', 'in', 'fluid', 'velocity', 'produced', 'by', 'the', 'waviness', 'irregularities', 'at', 'the', 'surface', 'of', 'a', 'noslip', 'wall', 'particular', 'emphasis', 'is', 'laid', 'on', 'the', 'issue', 'of', 'the', 'universality', 'of', 'our', 'findings']]
|
[-0.1445670186690087, 0.172210804432415, -0.10875300867229441, 0.02974907427076435, -0.06703737635386757, -0.08796231516424825, 0.0005109464913366897, 0.3216478637060021, -0.292947353837818, -0.2761449348734747, 0.11070393370395286, -0.23656958305406026, -0.177821874452552, 0.2298223482869049, -0.12465398177725844, 0.07421477226249984, 0.036911493621632284, -0.056484475067936545, -0.005203733334806517, -0.19369463510073648, 0.3248678847529584, 0.08708328348330895, 0.34002123544416807, 0.11180842414470667, 0.07830299673334576, -0.012038712233009905, -0.031623995549386684, 0.040358600733423663, -0.15084848307663262, 0.12999994969825343, 0.22220543162473064, 0.037418897750114304, 0.30462950892230073, -0.4584704325857139, -0.24770708728839855, 0.06266193271679159, 0.1621289831896815, 0.11382074656292317, -0.07268536911751743, -0.23972194766312246, 0.07628366744864991, -0.09801580581703398, -0.18275505047531262, -0.02825131714528445, 0.011170766583763727, 0.010370472792448421, -0.1904767214292937, 0.05881808296141058, 0.11514885323917456, 0.10802872312061562, 0.004646603557474837, -0.06096806618763079, -0.032142889877264894, 0.12245047902042913, 0.0850461388357205, 0.0008829377757588236, 0.18508252014041796, -0.18477104837420663, -0.06907527131664723, 0.41254315268027014, -0.011961237453661932, -0.2110635484845405, 0.19319198305930685, -0.10451365478733314, -0.11259627794053885, 0.1024881193165363, 0.19672864083302125, 0.10261615779306187, -0.14165158602086328, 0.05475273286568757, -0.009384842322088114, 0.1405689539814294, 0.07209909642299656, -0.0020094397984961473, 0.24328627592266197, 0.22119774890482646, 0.04780021201044616, 0.16360032437645858, -0.10167542776775242, -0.08953352816089398, -0.27801304527254095, -0.17110154961263485, -0.173875469622193, 0.03348361632422461, -0.08993963804182431, -0.1743816482364246, 0.3894052989780903, 0.17397396417685074, 0.17686191123753492, -0.03510141978847176, 0.27208256029920413, 0.08460854739065993, 0.04461609809382791, 0.014202406155037702, 0.2537451292178363, 0.1373487784305938, 0.09516970609028888, -0.2242961475743202, 0.12407440667289614, 0.03293025380203334]
|
1,803.06724
|
Melting a Hubbard dimer: benchmarks of `ALDA' for quantum thermodynamics
|
The competition between evolution time, interaction strength, and temperature
challenges our understanding of many-body quantum systems out-of-equilibrium.
Here we consider a benchmark system, the Hubbard dimer, which allows us to
explore all the relevant regimes and calculate exactly the related average
quantum work. At difference with previous studies, we focus on the effect of
increasing temperature, and show how this can turn competition between
many-body interactions and driving field into synergy. We then turn to use
recently proposed protocols inspired by density functional theory to explore if
these effects could be reproduced by using simple approximations. We find that,
up to and including intermediate temperatures, a method which borrows from
ground-state adiabatic local density approximation improves dramatically the
estimate for the average quantum work, including, in the adiabatic regime, when
correlations are strong. However at high temperature and at least when based on
the pseudo-LDA, this method fails to capture the counterintuitive qualitative
dependence of the quantum work with interaction strength, albeit getting the
quantitative estimates relatively close to the exact results.
|
quant-ph cond-mat.mtrl-sci cond-mat.str-el
|
the competition between evolution time interaction strength and temperature challenges our understanding of manybody quantum systems outofequilibrium here we consider a benchmark system the hubbard dimer which allows us to explore all the relevant regimes and calculate exactly the related average quantum work at difference with previous studies we focus on the effect of increasing temperature and show how this can turn competition between manybody interactions and driving field into synergy we then turn to use recently proposed protocols inspired by density functional theory to explore if these effects could be reproduced by using simple approximations we find that up to and including intermediate temperatures a method which borrows from groundstate adiabatic local density approximation improves dramatically the estimate for the average quantum work including in the adiabatic regime when correlations are strong however at high temperature and at least when based on the pseudolda this method fails to capture the counterintuitive qualitative dependence of the quantum work with interaction strength albeit getting the quantitative estimates relatively close to the exact results
|
[['the', 'competition', 'between', 'evolution', 'time', 'interaction', 'strength', 'and', 'temperature', 'challenges', 'our', 'understanding', 'of', 'manybody', 'quantum', 'systems', 'outofequilibrium', 'here', 'we', 'consider', 'a', 'benchmark', 'system', 'the', 'hubbard', 'dimer', 'which', 'allows', 'us', 'to', 'explore', 'all', 'the', 'relevant', 'regimes', 'and', 'calculate', 'exactly', 'the', 'related', 'average', 'quantum', 'work', 'at', 'difference', 'with', 'previous', 'studies', 'we', 'focus', 'on', 'the', 'effect', 'of', 'increasing', 'temperature', 'and', 'show', 'how', 'this', 'can', 'turn', 'competition', 'between', 'manybody', 'interactions', 'and', 'driving', 'field', 'into', 'synergy', 'we', 'then', 'turn', 'to', 'use', 'recently', 'proposed', 'protocols', 'inspired', 'by', 'density', 'functional', 'theory', 'to', 'explore', 'if', 'these', 'effects', 'could', 'be', 'reproduced', 'by', 'using', 'simple', 'approximations', 'we', 'find', 'that', 'up', 'to', 'and', 'including', 'intermediate', 'temperatures', 'a', 'method', 'which', 'borrows', 'from', 'groundstate', 'adiabatic', 'local', 'density', 'approximation', 'improves', 'dramatically', 'the', 'estimate', 'for', 'the', 'average', 'quantum', 'work', 'including', 'in', 'the', 'adiabatic', 'regime', 'when', 'correlations', 'are', 'strong', 'however', 'at', 'high', 'temperature', 'and', 'at', 'least', 'when', 'based', 'on', 'the', 'pseudolda', 'this', 'method', 'fails', 'to', 'capture', 'the', 'counterintuitive', 'qualitative', 'dependence', 'of', 'the', 'quantum', 'work', 'with', 'interaction', 'strength', 'albeit', 'getting', 'the', 'quantitative', 'estimates', 'relatively', 'close', 'to', 'the', 'exact', 'results']]
|
[-0.07442687558859848, 0.1458722517596917, -0.10517685349563638, 0.07937016567536657, -0.013519418575632118, -0.14556781298954757, 0.07734159920677783, 0.3420265501484885, -0.2580014841538467, -0.3405367704598527, 0.027405667450273553, -0.2741539935638062, -0.16060337416006645, 0.20129765126832397, 0.015612144518796115, 0.02626006447911611, 0.040335251763871496, 0.009807567258858346, -0.10197300019358116, -0.23174693707883226, 0.3211614279109135, 0.06767803668970383, 0.2960520245554198, 0.13820118960387984, 0.06270122626110126, 0.018134149530771793, 0.027657521407975005, 0.04635366506613137, -0.1620666192225756, 0.09897365791134928, 0.23008869043129296, 0.02714791828603075, 0.2811588783481578, -0.45229371734050633, -0.23089834075007173, 0.07682536959774759, 0.14911142437499594, 0.1688556147028545, -0.028767960034419744, -0.2735760790018136, 0.0315808402197381, -0.17159813189367104, -0.10613540154732001, -0.12893107456116998, 0.010784064918587648, 0.03032571442182889, -0.2583236030074196, 0.0966571265768957, 0.04042938482887738, 0.03768344829675921, -0.04318267546018193, -0.07572276555532753, 0.02138200272364836, 0.142942197611678, 0.042469256782185355, 0.03197486306491651, 0.12801087081802692, -0.12946317131680093, -0.08624866770645767, 0.35658850358548566, -0.08562533249561158, -0.12097812880358894, 0.25129119171052955, -0.14663605856006606, -0.12652872730460432, 0.08587413479993392, 0.16382920364604184, 0.07739888744534958, -0.12263094422040502, 0.07453677688156152, 0.025406277211579054, 0.18211511975938552, 0.023359151734093652, 0.05431360895718224, 0.1954362538114887, 0.14096015998657946, 0.04586594541998286, 0.13932129373087696, -0.0712395733282275, -0.17124298431404067, -0.24570371512301833, -0.08988022852664519, -0.17313730572990266, 0.029358014045010882, -0.06901879858838977, -0.11891312801077614, 0.39482207358569693, 0.23734481245747696, 0.2060220876316491, 0.04881863798728289, 0.28767598667644967, 0.15376812534485754, 0.023646417907194087, 0.06587182506047494, 0.26392407218342895, 0.1380903626743116, 0.05817219006082817, -0.29438978738739696, 0.07179967159873735, 0.05239327639009128]
|
1,803.06725
|
Detection under One-Bit Messaging over Adaptive Networks
|
This work studies the operation of multi-agent networks engaged in binary
decision tasks, and derives performance expressions and performance operating
curves under challenging conditions with some revealing insights. One of the
main challenges in the analysis is that agents are only allowed to exchange
one-bit messages, and the information at each agent therefore consists of both
continuous and discrete components. Due to this mixed nature, the steady-state
distribution of the state of each agent cannot be inferred from direct
application of central limit arguments. Instead, the behavior of the continuous
component is characterized in integral form by using a log-characteristic
function, while the behavior of the discrete component is characterized by
means of an asymmetric Bernoulli convolution. By exploiting these results, the
article derives reliable approximate performance expressions for the network
nodes that match well with the simulated results for a wide range of system
parameters. The results also reveal an important interplay between continuous
adaptation under constant step-size learning and the binary nature of the
messages exchanged with neighbors.
|
cs.MA
|
this work studies the operation of multiagent networks engaged in binary decision tasks and derives performance expressions and performance operating curves under challenging conditions with some revealing insights one of the main challenges in the analysis is that agents are only allowed to exchange onebit messages and the information at each agent therefore consists of both continuous and discrete components due to this mixed nature the steadystate distribution of the state of each agent cannot be inferred from direct application of central limit arguments instead the behavior of the continuous component is characterized in integral form by using a logcharacteristic function while the behavior of the discrete component is characterized by means of an asymmetric bernoulli convolution by exploiting these results the article derives reliable approximate performance expressions for the network nodes that match well with the simulated results for a wide range of system parameters the results also reveal an important interplay between continuous adaptation under constant stepsize learning and the binary nature of the messages exchanged with neighbors
|
[['this', 'work', 'studies', 'the', 'operation', 'of', 'multiagent', 'networks', 'engaged', 'in', 'binary', 'decision', 'tasks', 'and', 'derives', 'performance', 'expressions', 'and', 'performance', 'operating', 'curves', 'under', 'challenging', 'conditions', 'with', 'some', 'revealing', 'insights', 'one', 'of', 'the', 'main', 'challenges', 'in', 'the', 'analysis', 'is', 'that', 'agents', 'are', 'only', 'allowed', 'to', 'exchange', 'onebit', 'messages', 'and', 'the', 'information', 'at', 'each', 'agent', 'therefore', 'consists', 'of', 'both', 'continuous', 'and', 'discrete', 'components', 'due', 'to', 'this', 'mixed', 'nature', 'the', 'steadystate', 'distribution', 'of', 'the', 'state', 'of', 'each', 'agent', 'can', 'not', 'be', 'inferred', 'from', 'direct', 'application', 'of', 'central', 'limit', 'arguments', 'instead', 'the', 'behavior', 'of', 'the', 'continuous', 'component', 'is', 'characterized', 'in', 'integral', 'form', 'by', 'using', 'a', 'logcharacteristic', 'function', 'while', 'the', 'behavior', 'of', 'the', 'discrete', 'component', 'is', 'characterized', 'by', 'means', 'of', 'an', 'asymmetric', 'bernoulli', 'convolution', 'by', 'exploiting', 'these', 'results', 'the', 'article', 'derives', 'reliable', 'approximate', 'performance', 'expressions', 'for', 'the', 'network', 'nodes', 'that', 'match', 'well', 'with', 'the', 'simulated', 'results', 'for', 'a', 'wide', 'range', 'of', 'system', 'parameters', 'the', 'results', 'also', 'reveal', 'an', 'important', 'interplay', 'between', 'continuous', 'adaptation', 'under', 'constant', 'stepsize', 'learning', 'and', 'the', 'binary', 'nature', 'of', 'the', 'messages', 'exchanged', 'with', 'neighbors']]
|
[-0.13920852085742255, 0.07057975999597726, -0.07515323359916826, 0.014938599231914339, -0.09152938754907781, -0.147347145882702, 0.08635981706357752, 0.37633408061419316, -0.28124730075213905, -0.2972922929785928, 0.12025491146667594, -0.23954334436801442, -0.1700986784049555, 0.19890241922908708, -0.06103924837518941, 0.041299364761019135, 0.07933541704432179, 0.05442506957755626, -0.049647108771516915, -0.2362687283956595, 0.32549168311103044, 0.04010165888238807, 0.2876648003594917, 0.017333962719707767, 0.13195100947615435, 0.051026966906158114, -0.02659753207607489, -0.011081374588705686, -0.08851161658022164, 0.12134557741568887, 0.2772923191799646, 0.1235155853611684, 0.2891100360004351, -0.40534031211959515, -0.21272174735711505, 0.09941333312990909, 0.12248517787873701, 0.048063518900195494, -0.026522669222271235, -0.30097612521981504, 0.08777476560967097, -0.15418201462741485, -0.0912387936256216, -0.06165967689968689, -0.009373523055287132, 0.07451956802182585, -0.30360568601540044, 0.04947031196257867, 0.07459205618653751, 0.055507230490707514, -0.08158875988865794, -0.10175437103954896, 0.005612179221672535, 0.19433062396976247, 0.06399447726880947, -0.012546130362081161, 0.13296366634244938, -0.16093495805143265, -0.11725638521159863, 0.3569866349833489, -0.04358684598558109, -0.191362112038905, 0.19783699472723473, -0.08769153076501791, -0.1296859861307979, 0.14098063974889072, 0.17004220311840376, 0.09055954800940484, -0.18374867505824183, 0.04196197295402128, -0.019853987159174784, 0.18493198622726123, 0.025232400994323063, 0.05206820519630149, 0.1953760814629713, 0.16149017728364085, 0.05372499827426083, 0.15428419662122098, -0.04580262863984037, -0.15334158699022749, -0.26422492150565857, -0.11431463954872206, -0.21068157696802364, 0.006677310433928386, -0.10916221503800459, -0.0911139567322724, 0.38601066973005904, 0.12648374815771019, 0.20952913785497632, 0.07594879855516187, 0.31126776331088, 0.13059658463772017, 0.027528993789466064, 0.10662145213610684, 0.20007352558545338, 0.11342889176714316, 0.1000048573556416, -0.20746127322005728, 0.14066423969860706, 0.015506959422927197]
|
1,803.06726
|
Theory of Orbital Magnetic Quadrupole Moment and Nonlinear Anomalous
Thermoelectric Transport
|
We present a microscopic theory of the magnetic quadrupole moment density
$\mathcal{Q}_{ij}$ in periodic crystals with combined time reversal
($\mathcal{T}$) and inversion ($\mathcal{I}$) symmetry. We obtain a
gauge-invariant expression with clear physical interpretation and demonstrate
the typical behaviour of $\mathcal{Q}_{ij}$ in a minimal two-band model that
hosts a tilted Dirac cone. We then show that $\mathcal{Q}_{ij}$ leads to an
intrinsic nonlinear anomalous thermoelectric current. As an example, we
calculate the nonlinear Nernst and Hall current in the loop-current model for
cuprate superconductors, and demonstrate their unique behaviour and capability
of indicating $\mathcal{TI}$-invariance.
|
cond-mat.mes-hall
|
we present a microscopic theory of the magnetic quadrupole moment density mathcalq_ij in periodic crystals with combined time reversal mathcalt and inversion mathcali symmetry we obtain a gaugeinvariant expression with clear physical interpretation and demonstrate the typical behaviour of mathcalq_ij in a minimal twoband model that hosts a tilted dirac cone we then show that mathcalq_ij leads to an intrinsic nonlinear anomalous thermoelectric current as an example we calculate the nonlinear nernst and hall current in the loopcurrent model for cuprate superconductors and demonstrate their unique behaviour and capability of indicating mathcaltiinvariance
|
[['we', 'present', 'a', 'microscopic', 'theory', 'of', 'the', 'magnetic', 'quadrupole', 'moment', 'density', 'mathcalq_ij', 'in', 'periodic', 'crystals', 'with', 'combined', 'time', 'reversal', 'mathcalt', 'and', 'inversion', 'mathcali', 'symmetry', 'we', 'obtain', 'a', 'gaugeinvariant', 'expression', 'with', 'clear', 'physical', 'interpretation', 'and', 'demonstrate', 'the', 'typical', 'behaviour', 'of', 'mathcalq_ij', 'in', 'a', 'minimal', 'twoband', 'model', 'that', 'hosts', 'a', 'tilted', 'dirac', 'cone', 'we', 'then', 'show', 'that', 'mathcalq_ij', 'leads', 'to', 'an', 'intrinsic', 'nonlinear', 'anomalous', 'thermoelectric', 'current', 'as', 'an', 'example', 'we', 'calculate', 'the', 'nonlinear', 'nernst', 'and', 'hall', 'current', 'in', 'the', 'loopcurrent', 'model', 'for', 'cuprate', 'superconductors', 'and', 'demonstrate', 'their', 'unique', 'behaviour', 'and', 'capability', 'of', 'indicating', 'mathcaltiinvariance']]
|
[-0.18304146156431392, 0.11851431692184133, -0.0655906283306879, 0.06004558375187136, -0.10446145674111423, -0.13969776754850868, 0.045872140310546074, 0.3633372126464415, -0.25501802601758133, -0.2535994585583007, 0.009766233016117629, -0.28832104511477136, -0.19218468222419147, 0.17109174836570254, -0.002143653017560859, 0.026726716200585712, -0.06300041246596355, 0.009199469810822508, -0.14060706102831677, -0.15350076924641054, 0.270302649561807, -0.005708053504669486, 0.31975870549801616, 0.05318920087621926, 0.11375585752078793, -0.009327747915349491, 0.06842925738809365, 0.07063199484536609, -0.15244366270621118, 0.051206496165512684, 0.2044180903025995, -0.04124125330657749, 0.12981482288175886, -0.447261030284258, -0.18312418508947223, 0.031221163448887868, 0.1099050702056387, 0.144348917662033, -0.10307110718113709, -0.25850381018532503, 0.05871632737158747, -0.18886413729166265, -0.17927351539921282, -0.15601236022468964, 0.018723641204964985, -0.05272323855168217, -0.26866891877828064, 0.11399587827663009, 0.08668680086854723, 0.1032513010182551, -0.11827750179589122, -0.09284217279035967, -0.07252478129025754, 0.01545610456921897, 0.06412554524741698, -0.0021915717644023372, 0.08417421697055573, -0.14046556229836174, -0.1511110061636338, 0.3694837293536453, -0.09005648424787509, -0.1275432122062769, 0.12369856998902633, -0.22186305128283554, -0.09539255283895758, 0.09279768055837069, 0.12160713258352908, 0.0828403791637866, -0.13697062323258802, 0.10198173614840565, -0.07302224788377266, 0.15068643918813585, -0.012960972090425727, 0.0694052603525611, 0.2844318330676837, 0.18667124904651236, 0.04344714043922927, 0.14885595726401923, -0.12287872541148298, -0.01530139727241636, -0.31157572428276253, -0.17616502665863423, -0.17990295061903014, 0.11883580074185035, -0.07338255882032271, -0.209063167253939, 0.4198708221889459, 0.19361233537259337, 0.20032584748312748, 0.009794253344227979, 0.24021973620056286, 0.15997772083418177, 0.030184443074196658, 0.044285977620037865, 0.20269942879011588, 0.1469442651499636, 0.09172417290488279, -0.3304608346904618, 0.03857670138989176, 0.041486073298134155]
|
1,803.06727
|
Aggregating Strategies for Long-term Forecasting
|
The article is devoted to investigating the application of aggregating
algorithms to the problem of the long-term forecasting. We examine the classic
aggregating algorithms based on the exponential reweighing. For the general
Vovk's aggregating algorithm we provide its generalization for the long-term
forecasting. For the special basic case of Vovk's algorithm we provide its two
modifications for the long-term forecasting. The first one is theoretically
close to an optimal algorithm and is based on replication of independent
copies. It provides the time-independent regret bound with respect to the best
expert in the pool. The second one is not optimal but is more practical and has
$O(\sqrt{T})$ regret bound, where $T$ is the length of the game.
|
cs.LG math.PR math.ST stat.ML stat.TH
|
the article is devoted to investigating the application of aggregating algorithms to the problem of the longterm forecasting we examine the classic aggregating algorithms based on the exponential reweighing for the general vovks aggregating algorithm we provide its generalization for the longterm forecasting for the special basic case of vovks algorithm we provide its two modifications for the longterm forecasting the first one is theoretically close to an optimal algorithm and is based on replication of independent copies it provides the timeindependent regret bound with respect to the best expert in the pool the second one is not optimal but is more practical and has osqrtt regret bound where t is the length of the game
|
[['the', 'article', 'is', 'devoted', 'to', 'investigating', 'the', 'application', 'of', 'aggregating', 'algorithms', 'to', 'the', 'problem', 'of', 'the', 'longterm', 'forecasting', 'we', 'examine', 'the', 'classic', 'aggregating', 'algorithms', 'based', 'on', 'the', 'exponential', 'reweighing', 'for', 'the', 'general', 'vovks', 'aggregating', 'algorithm', 'we', 'provide', 'its', 'generalization', 'for', 'the', 'longterm', 'forecasting', 'for', 'the', 'special', 'basic', 'case', 'of', 'vovks', 'algorithm', 'we', 'provide', 'its', 'two', 'modifications', 'for', 'the', 'longterm', 'forecasting', 'the', 'first', 'one', 'is', 'theoretically', 'close', 'to', 'an', 'optimal', 'algorithm', 'and', 'is', 'based', 'on', 'replication', 'of', 'independent', 'copies', 'it', 'provides', 'the', 'timeindependent', 'regret', 'bound', 'with', 'respect', 'to', 'the', 'best', 'expert', 'in', 'the', 'pool', 'the', 'second', 'one', 'is', 'not', 'optimal', 'but', 'is', 'more', 'practical', 'and', 'has', 'osqrtt', 'regret', 'bound', 'where', 't', 'is', 'the', 'length', 'of', 'the', 'game']]
|
[-0.09352041058069706, 0.015221625555568608, -0.0994156307303989, 0.09068163763531002, -0.09361193648836544, -0.1558383361853916, 0.0809592028020014, 0.3701557973961763, -0.2565121271422711, -0.2811830345494071, 0.13180387374073876, -0.2688202236092585, -0.14648605097920217, 0.21875067593144445, -0.11964991946447769, 0.09151519028819166, 0.030675233767271555, 0.10798852673203861, 0.0002617246555646175, -0.33189772878741397, 0.2737162187093355, 0.12448179223253553, 0.2671933004568363, 0.03283830942005995, 0.10329773461100934, 0.0161193175289523, -0.025242525490065074, -0.01193948709084813, -0.14837025817893124, 0.13883244692536617, 0.22197607166238192, 0.1915842534492875, 0.3532742175498399, -0.38418983452921285, -0.1394812137627139, 0.14084586977220043, 0.11030096512544772, 0.10611958585851143, -0.011646276103670845, -0.24179601014575697, 0.09618031152635452, -0.1330441838644188, -0.062239286064266645, -0.06919337804670092, 0.013104534579505181, 0.018923444109406835, -0.321331158260301, 0.03910612174438249, 0.06362229117577703, 0.020159405644743198, -0.08132898007872803, -0.11512553588194162, 0.07530083109078736, 0.1597394560070323, 0.08631482479917206, 0.00930969981308063, 0.07337452338382217, -0.09825565612268762, -0.1608193632183147, 0.3795875967801388, -0.05403353199202182, -0.18610218107290888, 0.14082414261868287, -0.07172280665013361, -0.14824537589246856, 0.08360587859803265, 0.1904155652375956, 0.1538824576659706, -0.13790673954143381, 0.06797380852894376, -0.07649084097898469, 0.13674601852634904, 0.03452869311199877, 0.020770480497519422, 0.1060776602785938, 0.2619098755932445, 0.15625679346026275, 0.1722638038757803, -0.044441952141290854, -0.15326517716788784, -0.26377073638060866, -0.15665684851962303, -0.19158977174384775, -0.00844348371136785, -0.13321540629514292, -0.15707249524360845, 0.41185479174400197, 0.17414827288353238, 0.16223303629647426, 0.1275727133154227, 0.34007950048444086, 0.13677463958296796, 9.283986231633301e-05, 0.1398521944679644, 0.2317153580109428, 0.06491950529743917, 0.07591629398039318, -0.22891545668971958, 0.14247371937180386, 0.09219339464245171]
|
1,803.06728
|
A non-intersecting random walk on the Manhattan lattice and SLE_6
|
We consider a random walk on the Manhattan lattice. The walker must follow
the orientations of the bonds in this lattice, and the walker is not allowed to
visit a site more than once. When both possible steps are allowed, the walker
chooses between them with equal probability. The walks generated by this model
are known to be related to interfaces for bond percolation on a square lattice.
So it is natural to conjecture that the scaling limit is SLE$_6$. We test this
conjecture with Monte Carlo simulations of the random walk model and find
strong support for the conjecture.
|
math.PR math-ph math.MP
|
we consider a random walk on the manhattan lattice the walker must follow the orientations of the bonds in this lattice and the walker is not allowed to visit a site more than once when both possible steps are allowed the walker chooses between them with equal probability the walks generated by this model are known to be related to interfaces for bond percolation on a square lattice so it is natural to conjecture that the scaling limit is sle_6 we test this conjecture with monte carlo simulations of the random walk model and find strong support for the conjecture
|
[['we', 'consider', 'a', 'random', 'walk', 'on', 'the', 'manhattan', 'lattice', 'the', 'walker', 'must', 'follow', 'the', 'orientations', 'of', 'the', 'bonds', 'in', 'this', 'lattice', 'and', 'the', 'walker', 'is', 'not', 'allowed', 'to', 'visit', 'a', 'site', 'more', 'than', 'once', 'when', 'both', 'possible', 'steps', 'are', 'allowed', 'the', 'walker', 'chooses', 'between', 'them', 'with', 'equal', 'probability', 'the', 'walks', 'generated', 'by', 'this', 'model', 'are', 'known', 'to', 'be', 'related', 'to', 'interfaces', 'for', 'bond', 'percolation', 'on', 'a', 'square', 'lattice', 'so', 'it', 'is', 'natural', 'to', 'conjecture', 'that', 'the', 'scaling', 'limit', 'is', 'sle_6', 'we', 'test', 'this', 'conjecture', 'with', 'monte', 'carlo', 'simulations', 'of', 'the', 'random', 'walk', 'model', 'and', 'find', 'strong', 'support', 'for', 'the', 'conjecture']]
|
[-0.09279073557816446, 0.20529964124783873, -0.07280475907959044, 0.04473229639232159, -0.04310459518805146, -0.21459330639336258, 0.11579237646888942, 0.4374739449843764, -0.24416440772823989, -0.23206839255057277, 0.09810495359241031, -0.2920050551998429, -0.13124759060214275, 0.11597854934167116, -0.015934376614168286, 0.03541942423209548, 0.05333761715330183, 0.044517337046563625, 0.009998483841191046, -0.3279171299189329, 0.24502577764913439, 0.06609314584638923, 0.26725933654233813, 0.05774762565968558, 0.07158663464710116, 0.040498549095354976, 0.0026703035924583673, 0.021914028180763125, -0.18543710049976653, 0.06482643265277148, 0.12094161838875152, 0.03031951291486621, 0.23870705985464155, -0.42493391925469043, -0.18523740358883514, 0.14302230068133212, 0.10437653199769556, 0.16755014084745198, 0.025345058091188546, -0.2826035563834012, 0.08824340718099848, -0.10707450080662965, -0.1493221091432497, 0.0040870255557820204, 0.044321752614341674, 0.03247415820136666, -0.27797535839024934, 0.04029821709729731, 0.049860542004462334, 0.031200366634875534, 0.022084606657736004, -0.059047942692413924, -0.03976863539777696, 0.1432870288848062, 0.04347795520327054, 0.07660912289749831, 0.07995151721406728, -0.07907019501784816, -0.18260952860116958, 0.44549431655555966, 0.0013018284521240276, -0.21220078755170108, 0.17294903113273905, -0.19874412666540592, -0.1621109365578741, 0.0852396448329091, 0.11812327275052667, 0.09684552097227424, -0.1292413856794883, 0.0687493177736178, -0.09730422693770378, 0.09673746034037321, 0.042122476268559694, -0.06477229242678732, 0.1986227278225124, 0.1323433847515844, 0.12279557248577476, 0.16155465145944617, -0.07990474615042331, -0.18760934750607702, -0.2776874106726609, -0.14391374975908547, -0.27770012643188235, 0.0954608954397554, -0.13893083485745591, -0.2020283298008144, 0.34825026541482657, 0.21597524678800256, 0.2046051178406924, 0.1475774262705818, 0.19296698423102498, 0.11370758341625332, 0.05651622388511896, 0.09076320862397552, 0.15546989535563627, 0.11385922051267698, 0.03866823009215295, -0.13889897982124239, 0.09830848750192672, 0.1047703296970576]
|
1,803.06729
|
Polar polarization: a new method for polarimetry analysis
|
We present a novel analysis method for measurements of polarization
transferred in $A(\vec{e},e'\vec{N})$ experiments, which can be applied to
other kinds of polarization measurements as well. In this method the
polarization transfer components are presented in spherical coordinates using
an efficient likelihood numerical maximization based on an analytic derivation.
We also propose a formalism that accounts for multi-parameter models, and which
yields a smooth and continuous representation of the data (rather than using
standard binning). Applying this method on simulated data generates results
with reduced statistical and systematic uncertainties and enables revealing
physical information that is lost in standard binning of the data. The obtained
results can be compared easily to theoretical models and other measurements.
Furthermore, CPU time is significantly reduced using this method.
|
nucl-th hep-ph nucl-ex
|
we present a novel analysis method for measurements of polarization transferred in aveceevecn experiments which can be applied to other kinds of polarization measurements as well in this method the polarization transfer components are presented in spherical coordinates using an efficient likelihood numerical maximization based on an analytic derivation we also propose a formalism that accounts for multiparameter models and which yields a smooth and continuous representation of the data rather than using standard binning applying this method on simulated data generates results with reduced statistical and systematic uncertainties and enables revealing physical information that is lost in standard binning of the data the obtained results can be compared easily to theoretical models and other measurements furthermore cpu time is significantly reduced using this method
|
[['we', 'present', 'a', 'novel', 'analysis', 'method', 'for', 'measurements', 'of', 'polarization', 'transferred', 'in', 'aveceevecn', 'experiments', 'which', 'can', 'be', 'applied', 'to', 'other', 'kinds', 'of', 'polarization', 'measurements', 'as', 'well', 'in', 'this', 'method', 'the', 'polarization', 'transfer', 'components', 'are', 'presented', 'in', 'spherical', 'coordinates', 'using', 'an', 'efficient', 'likelihood', 'numerical', 'maximization', 'based', 'on', 'an', 'analytic', 'derivation', 'we', 'also', 'propose', 'a', 'formalism', 'that', 'accounts', 'for', 'multiparameter', 'models', 'and', 'which', 'yields', 'a', 'smooth', 'and', 'continuous', 'representation', 'of', 'the', 'data', 'rather', 'than', 'using', 'standard', 'binning', 'applying', 'this', 'method', 'on', 'simulated', 'data', 'generates', 'results', 'with', 'reduced', 'statistical', 'and', 'systematic', 'uncertainties', 'and', 'enables', 'revealing', 'physical', 'information', 'that', 'is', 'lost', 'in', 'standard', 'binning', 'of', 'the', 'data', 'the', 'obtained', 'results', 'can', 'be', 'compared', 'easily', 'to', 'theoretical', 'models', 'and', 'other', 'measurements', 'furthermore', 'cpu', 'time', 'is', 'significantly', 'reduced', 'using', 'this', 'method']]
|
[-0.04382568813912991, 0.03474870588721505, -0.14154252079090163, 0.04668907439167191, -0.06726324212767425, -0.11980168121461306, 0.05089348409749237, 0.40880716877478745, -0.2596759221801955, -0.3282757861419551, 0.10249847522936761, -0.24791515059769154, -0.1274670377493866, 0.28564746146120373, -0.049610639973487254, 0.04609040199072972, 0.1028809019171017, -0.018167694889745043, -0.13134554004101384, -0.20354115172109055, 0.27794497859694306, 0.07938173552975059, 0.30577041682667067, 0.017205641514831973, 0.0971378114162719, 0.023490771463501356, -0.08387697277770888, 0.054732925709216826, -0.09542491398585093, 0.16098472605940076, 0.22517457834686455, 0.15811235055087075, 0.19437711447056744, -0.42492814638817145, -0.2324386343525182, 0.0794117248846188, 0.14193819236055377, 0.15298924232915706, -0.07032524081014638, -0.2715532857203676, 0.0717439639997939, -0.15786846042160066, -0.07213834774935798, -0.16015025090065696, -0.0592237691612794, 0.0073606344015007055, -0.32553979238089653, 0.12940013965553296, 0.014920210556855665, 0.04622109327465296, -0.06002286951538296, -0.12954008890946786, -0.0043350532895044215, 0.08713187133487794, 0.014826211355431307, 0.03403127629726735, 0.12109495236748649, -0.058982684156827385, -0.13536241285562997, 0.38151309131494454, -0.09281215066103839, -0.25298381654635793, 0.15778119213721384, -0.10161686735227704, -0.1270682435264931, 0.10783948311431994, 0.2012219555120194, 0.14935405751419883, -0.16914866739628656, 0.008160374954909897, -0.01660833170171827, 0.19505881204179698, -0.006521012061350648, -0.007504208302575975, 0.13389455136512557, 0.179181499707122, 0.013164501754985278, 0.1464480068600331, -0.12748872961533525, -0.08752980139932685, -0.29156116116791964, -0.12024350750479859, -0.19786517703229742, 0.00870476534398603, -0.10270918821932414, -0.09761988091462802, 0.3973274503744418, 0.1958803897423129, 0.19713345847858657, 0.05777099255600103, 0.37030335544278065, 0.13439226212475688, 0.09029978300414739, 0.06138512730455747, 0.2236385370469502, 0.09725708220784943, 0.07230314479449824, -0.16451064555627865, 0.0680810552852739, 0.0012193286130505224]
|
1,803.0673
|
Combining Probabilistic Load Forecasts
|
Probabilistic load forecasts provide comprehensive information about future
load uncertainties. In recent years, many methodologies and techniques have
been proposed for probabilistic load forecasting. Forecast combination, a
widely recognized best practice in point forecasting literature, has never been
formally adopted to combine probabilistic load forecasts. This paper proposes a
constrained quantile regression averaging (CQRA) method to create an improved
ensemble from several individual probabilistic forecasts. We formulate the CQRA
parameter estimation problem as a linear program with the objective of
minimizing the pinball loss, with the constraints that the parameters are
nonnegative and summing up to one. We demonstrate the effectiveness of the
proposed method using two publicly available datasets, the ISO New England data
and Irish smart meter data. Comparing with the best individual probabilistic
forecast, the ensemble can reduce the pinball score by 4.39% on average. The
proposed ensemble also demonstrates superior performance over nine other
benchmark ensembles.
|
stat.AP
|
probabilistic load forecasts provide comprehensive information about future load uncertainties in recent years many methodologies and techniques have been proposed for probabilistic load forecasting forecast combination a widely recognized best practice in point forecasting literature has never been formally adopted to combine probabilistic load forecasts this paper proposes a constrained quantile regression averaging cqra method to create an improved ensemble from several individual probabilistic forecasts we formulate the cqra parameter estimation problem as a linear program with the objective of minimizing the pinball loss with the constraints that the parameters are nonnegative and summing up to one we demonstrate the effectiveness of the proposed method using two publicly available datasets the iso new england data and irish smart meter data comparing with the best individual probabilistic forecast the ensemble can reduce the pinball score by 439 on average the proposed ensemble also demonstrates superior performance over nine other benchmark ensembles
|
[['probabilistic', 'load', 'forecasts', 'provide', 'comprehensive', 'information', 'about', 'future', 'load', 'uncertainties', 'in', 'recent', 'years', 'many', 'methodologies', 'and', 'techniques', 'have', 'been', 'proposed', 'for', 'probabilistic', 'load', 'forecasting', 'forecast', 'combination', 'a', 'widely', 'recognized', 'best', 'practice', 'in', 'point', 'forecasting', 'literature', 'has', 'never', 'been', 'formally', 'adopted', 'to', 'combine', 'probabilistic', 'load', 'forecasts', 'this', 'paper', 'proposes', 'a', 'constrained', 'quantile', 'regression', 'averaging', 'cqra', 'method', 'to', 'create', 'an', 'improved', 'ensemble', 'from', 'several', 'individual', 'probabilistic', 'forecasts', 'we', 'formulate', 'the', 'cqra', 'parameter', 'estimation', 'problem', 'as', 'a', 'linear', 'program', 'with', 'the', 'objective', 'of', 'minimizing', 'the', 'pinball', 'loss', 'with', 'the', 'constraints', 'that', 'the', 'parameters', 'are', 'nonnegative', 'and', 'summing', 'up', 'to', 'one', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'using', 'two', 'publicly', 'available', 'datasets', 'the', 'iso', 'new', 'england', 'data', 'and', 'irish', 'smart', 'meter', 'data', 'comparing', 'with', 'the', 'best', 'individual', 'probabilistic', 'forecast', 'the', 'ensemble', 'can', 'reduce', 'the', 'pinball', 'score', 'by', '439', 'on', 'average', 'the', 'proposed', 'ensemble', 'also', 'demonstrates', 'superior', 'performance', 'over', 'nine', 'other', 'benchmark', 'ensembles']]
|
[-0.03026881422163176, -0.015101723573418378, -0.09515535577382842, 0.07892717846128083, -0.07319434080587549, -0.1482148946961388, 0.0767539749590592, 0.40629182177016865, -0.24162557420975253, -0.37044844707368707, 0.13432095713466657, -0.29972228195795136, -0.12540909819890167, 0.22913945118921833, -0.12418364797643311, 0.16778393961942276, 0.11519505870780228, 0.0023208692014245694, -0.058009149841775465, -0.3367758793819293, 0.21745656372198985, 0.12763586743243946, 0.372281661634711, -0.012824370085286934, 0.13294624295825064, 0.0008427227620740194, -0.08397389143214536, 0.02213401611299707, -0.09124325372982098, 0.16796019348092503, 0.29487073125563107, 0.22395244730334427, 0.36052927043213434, -0.3889507203539078, -0.2646972425219074, 0.12523640421332438, 0.09867953890116533, 0.053404585050196365, 0.015046295860146702, -0.2691487370600068, 0.014587869324542053, -0.2391402692206808, -0.05163774632760701, -0.12981385948227694, -0.048947035586713136, 0.04164652006599952, -0.31005742452484936, 0.06016184455173159, -0.014961250563705893, 0.09600652296826043, -0.05603657827108494, -0.2072184315844867, 0.014309983999418045, 0.13314465898076525, 0.051405575600723306, 0.009216947813763761, 0.1265878785193923, -0.04560154591308674, -0.17325480962628373, 0.3338678090870884, -0.09582534911759147, -0.18406175073225214, 0.12782610729462593, -0.02387222901578187, -0.16794919351751386, 0.0716949146008119, 0.230874495489548, 0.06704064659346398, -0.2260700583181067, -0.008713459218081364, -0.043241508814783114, 0.16792259533434156, 0.039224362331190823, -0.0430609500240157, 0.18962940111963986, 0.2310535258336647, 0.07126032502030186, 0.11832463199223983, -0.1401694205611617, -0.12624667246347746, -0.212366585465576, -0.08688664803835186, -0.16950983718679463, -0.03409024235490408, -0.11757399863101356, -0.12192287004703807, 0.40302169296538104, 0.2714292549093984, 0.1537699963412927, 0.10603542036984141, 0.373341341175743, 0.07934879902923303, 0.03837659044468121, 0.09485308775313299, 0.23075040999439708, 0.028233790280914085, 0.09845539603014225, -0.17572084415744915, 0.10279855353370737, 0.020170677289668773]
|
1,803.06731
|
Discriminative Learning of Latent Features for Zero-Shot Recognition
|
Zero-shot learning (ZSL) aims to recognize unseen image categories by
learning an embedding space between image and semantic representations. For
years, among existing works, it has been the center task to learn the proper
mapping matrices aligning the visual and semantic space, whilst the importance
to learn discriminative representations for ZSL is ignored. In this work, we
retrospect existing methods and demonstrate the necessity to learn
discriminative representations for both visual and semantic instances of ZSL.
We propose an end-to-end network that is capable of 1) automatically
discovering discriminative regions by a zoom network; and 2) learning
discriminative semantic representations in an augmented space introduced for
both user-defined and latent attributes. Our proposed method is tested
extensively on two challenging ZSL datasets, and the experiment results show
that the proposed method significantly outperforms state-of-the-art methods.
|
cs.CV
|
zeroshot learning zsl aims to recognize unseen image categories by learning an embedding space between image and semantic representations for years among existing works it has been the center task to learn the proper mapping matrices aligning the visual and semantic space whilst the importance to learn discriminative representations for zsl is ignored in this work we retrospect existing methods and demonstrate the necessity to learn discriminative representations for both visual and semantic instances of zsl we propose an endtoend network that is capable of 1 automatically discovering discriminative regions by a zoom network and 2 learning discriminative semantic representations in an augmented space introduced for both userdefined and latent attributes our proposed method is tested extensively on two challenging zsl datasets and the experiment results show that the proposed method significantly outperforms stateoftheart methods
|
[['zeroshot', 'learning', 'zsl', 'aims', 'to', 'recognize', 'unseen', 'image', 'categories', 'by', 'learning', 'an', 'embedding', 'space', 'between', 'image', 'and', 'semantic', 'representations', 'for', 'years', 'among', 'existing', 'works', 'it', 'has', 'been', 'the', 'center', 'task', 'to', 'learn', 'the', 'proper', 'mapping', 'matrices', 'aligning', 'the', 'visual', 'and', 'semantic', 'space', 'whilst', 'the', 'importance', 'to', 'learn', 'discriminative', 'representations', 'for', 'zsl', 'is', 'ignored', 'in', 'this', 'work', 'we', 'retrospect', 'existing', 'methods', 'and', 'demonstrate', 'the', 'necessity', 'to', 'learn', 'discriminative', 'representations', 'for', 'both', 'visual', 'and', 'semantic', 'instances', 'of', 'zsl', 'we', 'propose', 'an', 'endtoend', 'network', 'that', 'is', 'capable', 'of', '1', 'automatically', 'discovering', 'discriminative', 'regions', 'by', 'a', 'zoom', 'network', 'and', '2', 'learning', 'discriminative', 'semantic', 'representations', 'in', 'an', 'augmented', 'space', 'introduced', 'for', 'both', 'userdefined', 'and', 'latent', 'attributes', 'our', 'proposed', 'method', 'is', 'tested', 'extensively', 'on', 'two', 'challenging', 'zsl', 'datasets', 'and', 'the', 'experiment', 'results', 'show', 'that', 'the', 'proposed', 'method', 'significantly', 'outperforms', 'stateoftheart', 'methods']]
|
[0.02322551054811036, -0.05458256795159455, -0.05537091858202109, 0.11086538674965225, -0.19534885499419438, -0.17411964431198107, -0.022729154399389193, 0.5168234720274254, -0.2800891777207316, -0.3551214377671756, -0.008424896272589211, -0.26918490355558417, -0.19848679846359624, 0.16296411811339634, -0.17648050860260373, 0.08890004995520469, 0.1439120096223498, 0.06818480407819152, -0.10360348717895923, -0.3178491740297802, 0.38442274646109176, 0.01751372031867504, 0.37374974781026443, -0.009146633671803607, 0.20543434587134807, -0.04407055824305172, -0.061857941613049694, -0.03635037788944492, -0.024528054828018262, 0.25205353121100754, 0.4276607014031874, 0.2613697608191244, 0.32679677459376827, -0.33806745656938464, -0.28113483386631644, 0.12228765048224617, 0.14286834829383427, 0.07071124478857706, -0.03617695987103852, -0.4545452239647232, 0.10279026487152333, -0.16389943567553053, 0.13326751482155588, -0.22685389300825556, -0.004283879800803131, -0.09993869665734194, -0.29355243610011206, -0.026975415098584362, 0.13384833647697061, 0.06774189827998203, -0.09895384108854664, -0.10335346041247248, 0.049501767570014905, 0.1971414937361799, 0.04275314724762683, 0.0954599866402094, 0.12958379743827714, -0.22322493596174928, -0.16205863030282436, 0.34975492097437383, -0.019250837665189195, -0.23811112797508638, 0.24912574529233905, 0.016004550691556048, -0.16472089972898915, 0.08965970577189215, 0.20396307014204837, 0.13903248362519122, -0.15467522658959584, 0.030894254038058636, -0.07990675771401988, 0.17007856268987612, 0.05135335684926422, -0.03959672918060311, 0.17836808149047473, 0.2811906256126585, 0.027890737723835088, 0.12882436098772343, -0.16375687851536053, -0.020513950834154256, -0.1420315966622352, -0.0853834546757517, -0.21322681796909482, -0.13506307708168472, -0.13769330521625103, -0.06888425745559357, 0.4220604198432907, 0.2763492228670253, 0.2309836830460915, 0.13390309679563397, 0.360418929533895, -0.047826243173848426, 0.15615912511668822, 0.12660119734764858, 0.15792818256412391, -0.01708487787939332, 0.11712614633229182, -0.1679117587291532, 0.08384520211084573, 0.12597300319208038]
|
1,803.06732
|
A class of asymmetric regression models for left-censored data
|
A common assumption regarding the standard tobit model is the normality of
the error distribution. However, asymmetry and bimodality may be present and
alternative tobit models must be used. In this paper, we propose a tobit model
based on the class of log-symmetric distributions, which includes as special
cases heavy and light tailed distributions and bimodal distributions. We
implement a likelihood-based approach for parameter estimation and derive a
type of residual. We then discuss the problem of performing testing inference
in the proposed class by using the likelihood ratio and gradient statistics,
which are particularly convenient for tobit models, as they do not require the
information matrix. A thorough Monte Carlo study is presented to evaluate the
performance of the maximum likelihood estimators and the likelihood ratio and
gradient tests. Finally, we illustrate the proposed methodology by using a
real-world data set.
|
stat.ME
|
a common assumption regarding the standard tobit model is the normality of the error distribution however asymmetry and bimodality may be present and alternative tobit models must be used in this paper we propose a tobit model based on the class of logsymmetric distributions which includes as special cases heavy and light tailed distributions and bimodal distributions we implement a likelihoodbased approach for parameter estimation and derive a type of residual we then discuss the problem of performing testing inference in the proposed class by using the likelihood ratio and gradient statistics which are particularly convenient for tobit models as they do not require the information matrix a thorough monte carlo study is presented to evaluate the performance of the maximum likelihood estimators and the likelihood ratio and gradient tests finally we illustrate the proposed methodology by using a realworld data set
|
[['a', 'common', 'assumption', 'regarding', 'the', 'standard', 'tobit', 'model', 'is', 'the', 'normality', 'of', 'the', 'error', 'distribution', 'however', 'asymmetry', 'and', 'bimodality', 'may', 'be', 'present', 'and', 'alternative', 'tobit', 'models', 'must', 'be', 'used', 'in', 'this', 'paper', 'we', 'propose', 'a', 'tobit', 'model', 'based', 'on', 'the', 'class', 'of', 'logsymmetric', 'distributions', 'which', 'includes', 'as', 'special', 'cases', 'heavy', 'and', 'light', 'tailed', 'distributions', 'and', 'bimodal', 'distributions', 'we', 'implement', 'a', 'likelihoodbased', 'approach', 'for', 'parameter', 'estimation', 'and', 'derive', 'a', 'type', 'of', 'residual', 'we', 'then', 'discuss', 'the', 'problem', 'of', 'performing', 'testing', 'inference', 'in', 'the', 'proposed', 'class', 'by', 'using', 'the', 'likelihood', 'ratio', 'and', 'gradient', 'statistics', 'which', 'are', 'particularly', 'convenient', 'for', 'tobit', 'models', 'as', 'they', 'do', 'not', 'require', 'the', 'information', 'matrix', 'a', 'thorough', 'monte', 'carlo', 'study', 'is', 'presented', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'maximum', 'likelihood', 'estimators', 'and', 'the', 'likelihood', 'ratio', 'and', 'gradient', 'tests', 'finally', 'we', 'illustrate', 'the', 'proposed', 'methodology', 'by', 'using', 'a', 'realworld', 'data', 'set']]
|
[-0.017730464227497578, 0.007245108373725499, -0.13085544484496955, 0.14407584980838525, -0.06906697769898554, -0.15427514040370433, 0.059254163285081186, 0.4050086274952956, -0.22510540505221874, -0.3235092933788161, 0.14105885882343783, -0.23622610432941887, -0.15468224092111202, 0.1826297544019992, -0.08029162049339428, 0.10038055401806995, 0.07261971721563383, -0.02338699770855232, -0.09927977181390636, -0.23852545855907906, 0.2995725001690542, 0.08372487295189426, 0.33650511536668515, -0.0017095030888810124, 0.10553430509507578, 0.0376347842049116, -0.04390252355984609, 0.031245651045038087, -0.12670051409292338, 0.11293321190988907, 0.19740448907431926, 0.1977398142080859, 0.2845407471382125, -0.3541909102809576, -0.2280887875141917, 0.16335020448789525, 0.14775548366957647, 0.08449840269700795, -0.053460413246566404, -0.24592404508254898, 0.05884098899091633, -0.194047659271541, -0.08872087516585811, -0.11164707026582106, -0.062388092561454424, 0.0428976136215464, -0.3723563406301636, 0.11907949822325208, 0.04121536954345418, 0.062308475093155256, 0.030042299794190576, -0.16500423254582927, 0.02986142625146821, 0.0482779192889083, 0.06730897796578446, -0.05039167190938008, 0.10374105199646781, -0.09796894428562693, -0.10144784877037394, 0.34820478396739446, -0.07247823573120961, -0.25283756902651255, 0.1507261044945909, -0.07833714791062013, -0.165411919522637, 0.041481520592818746, 0.23368451618392702, 0.15830117779206748, -0.19072729148442896, 0.05718642517573423, -0.029657894306042244, 0.12624803788609093, -0.038627193263456434, -0.03339376108160137, 0.18656012309144554, 0.17731817399518907, 0.012014696982026783, 0.15505774582336118, -0.17470285584199124, -0.09947791072854799, -0.328007349796908, -0.14702724499306577, -0.18450833782783224, -0.02298325047535989, -0.12283527842496561, -0.18743903725080088, 0.3935165676406362, 0.21807726459744925, 0.20229479963038588, 0.11792182674611801, 0.2957537529570326, 0.1261741884527638, 0.016255220973824844, 0.08690467872984813, 0.1941841827495627, 0.1301481005634037, 0.03319965845013274, -0.16639869165291984, 0.15096971580535698, 0.026061020452737428]
|
1,803.06733
|
Combinatorial bases of principal subspaces of modules for twisted affine
Lie algebras of type $A_{2l-1}^{(2)}$, $D_l^{(2)}$, $E_6^{(2)}$ and
$D_4^{(3)}$
|
We construct combinatorial bases of principal subspaces of standard modules
of level $k \geq 1$ with highest weight $k\Lambda_0$ for the twisted affine Lie
algebras of type $A_{2l-1}^{(2)}$, $D_l^{(2)}$, $E_6^{(2)}$ and $D_4^{(3)}$.
Using these bases we directly calculate characters of principal subspaces.
|
math.QA math.RT
|
we construct combinatorial bases of principal subspaces of standard modules of level k geq 1 with highest weight klambda_0 for the twisted affine lie algebras of type a_2l12 d_l2 e_62 and d_43 using these bases we directly calculate characters of principal subspaces
|
[['we', 'construct', 'combinatorial', 'bases', 'of', 'principal', 'subspaces', 'of', 'standard', 'modules', 'of', 'level', 'k', 'geq', '1', 'with', 'highest', 'weight', 'klambda_0', 'for', 'the', 'twisted', 'affine', 'lie', 'algebras', 'of', 'type', 'a_2l12', 'd_l2', 'e_62', 'and', 'd_43', 'using', 'these', 'bases', 'we', 'directly', 'calculate', 'characters', 'of', 'principal', 'subspaces']]
|
[-0.17246190897929362, 0.07733618175030316, 0.008016469840628978, 0.01593907779225936, -0.09139036430189243, -0.150928431429351, -0.015686489856587008, 0.3775278096779799, -0.4015912862542348, -0.15206723574262399, 0.10904451124131298, -0.22031033392517996, -0.13029121693510276, 0.16105809640616942, -0.07707228812460716, -0.05096368319713152, 0.056010207829949185, 0.11354076473090129, -0.17940962782934852, -0.2804100613276928, 0.47387579217171055, 0.01782309385135961, 0.22740622132252425, -0.11531273757095616, 0.16949299487691277, 0.04224604374179856, -0.042482302022668034, -0.09176854964775535, -0.17418266088964465, 0.2619715099258778, 0.347718881843134, 0.09711442997631355, 0.14894772726946917, -0.33872661682275623, -0.03988315852191777, 0.2256967531135067, 0.16720886117754838, 0.014343475970702294, 0.08509424288207904, -0.20162905171179238, 0.12082688664444365, -0.1845076342161076, -0.13111207299889663, -0.11819373129699857, 0.033482434323582895, 0.014570297586779373, -0.24887951692709556, 0.06246568081088555, 0.057568762152909465, 0.1938463053546655, -0.14649683265731886, -0.2581666537966484, -0.062239608757245615, 0.09132994391406193, -0.11368777020237385, -0.0363690187902345, 0.097246638738001, -0.05887443648699003, -0.23745978442140114, 0.30668717871109646, -0.004008052369149832, -0.21702584371161768, 0.12462588872473973, -0.19318627828779894, -0.1904678400605917, 0.10241589193733838, 0.062389780301600695, 0.10185135623965508, -0.010737258869294938, 0.1529072139230079, -0.10898822326308642, 0.045530834736732334, 0.0985488702949041, 0.012647990638820024, 0.13162736298564154, 0.03680161238671877, 0.00338547841574137, 0.11546980100086866, -0.010992398282560783, 0.06862132373051001, -0.3532651274059063, -0.23496874526907235, -0.10403480718676479, 0.11756541300565004, -0.14294097262086908, -0.177143586662192, 0.44467229491625077, 0.07445556481774801, 0.20371498169902807, 0.13477810558218223, 0.12901190482079983, 0.049947541183195054, 0.11679339461410657, 0.05373360474522297, 0.104206654529732, 0.2722867458867721, -0.14109341260523367, -0.09327574640225905, -0.1111849999101534, 0.22979186991086373]
|
1,803.06734
|
The Strategic LQG System: A Dynamic Stochastic VCG Framework for Optimal
Coordination
|
The classic Vickrey-Clarke-Groves (VCG) mechanism ensures incentive
compatibility, i.e., that truth-telling of all agents is a dominant strategy,
for a static one-shot game. However, in a dynamic environment that unfolds over
time, the agents' intertemporal payoffs depend on the expected future controls
and payments, and a direct extension of the VCG mechanism is not sufficient to
guarantee incentive compatibility. In fact, it does not appear to be feasible
to construct mechanisms that ensure the dominance of dynamic truth-telling for
agents comprised of general stochastic dynamic systems. The contribution of
this paper is to show that such a dynamic stochastic extension does exist for
the special case of Linear-Quadratic-Gaussian (LQG) agents with a careful
construction of a sequence of layered payments over time. For a set of LQG
agents, we propose a modified layered version of the VCG mechanism for payments
that decouples the intertemporal effect of current bids on future payoffs, and
prove that truth-telling of dynamic states forms a dominant strategy if system
parameters are known and agents are rational.
An important example of a problem needing such optimal dynamic coordination
of stochastic agents arises in power systems where an Independent System
Operator (ISO) has to ensure balance of generation and consumption at all time
instants, while ensuring social optimality. The challenge is to determine a
bidding scheme between all agents and the ISO that maximizes social welfare,
while taking into account the stochastic dynamic models of agents, since
renewable energy resources such as solar/wind are stochastic and dynamic in
nature, as are consumptions by loads which are influenced by factors such as
local temperatures and thermal inertias of facilities.
|
eess.SY cs.SY
|
the classic vickreyclarkegroves vcg mechanism ensures incentive compatibility ie that truthtelling of all agents is a dominant strategy for a static oneshot game however in a dynamic environment that unfolds over time the agents intertemporal payoffs depend on the expected future controls and payments and a direct extension of the vcg mechanism is not sufficient to guarantee incentive compatibility in fact it does not appear to be feasible to construct mechanisms that ensure the dominance of dynamic truthtelling for agents comprised of general stochastic dynamic systems the contribution of this paper is to show that such a dynamic stochastic extension does exist for the special case of linearquadraticgaussian lqg agents with a careful construction of a sequence of layered payments over time for a set of lqg agents we propose a modified layered version of the vcg mechanism for payments that decouples the intertemporal effect of current bids on future payoffs and prove that truthtelling of dynamic states forms a dominant strategy if system parameters are known and agents are rational an important example of a problem needing such optimal dynamic coordination of stochastic agents arises in power systems where an independent system operator iso has to ensure balance of generation and consumption at all time instants while ensuring social optimality the challenge is to determine a bidding scheme between all agents and the iso that maximizes social welfare while taking into account the stochastic dynamic models of agents since renewable energy resources such as solarwind are stochastic and dynamic in nature as are consumptions by loads which are influenced by factors such as local temperatures and thermal inertias of facilities
|
[['the', 'classic', 'vickreyclarkegroves', 'vcg', 'mechanism', 'ensures', 'incentive', 'compatibility', 'ie', 'that', 'truthtelling', 'of', 'all', 'agents', 'is', 'a', 'dominant', 'strategy', 'for', 'a', 'static', 'oneshot', 'game', 'however', 'in', 'a', 'dynamic', 'environment', 'that', 'unfolds', 'over', 'time', 'the', 'agents', 'intertemporal', 'payoffs', 'depend', 'on', 'the', 'expected', 'future', 'controls', 'and', 'payments', 'and', 'a', 'direct', 'extension', 'of', 'the', 'vcg', 'mechanism', 'is', 'not', 'sufficient', 'to', 'guarantee', 'incentive', 'compatibility', 'in', 'fact', 'it', 'does', 'not', 'appear', 'to', 'be', 'feasible', 'to', 'construct', 'mechanisms', 'that', 'ensure', 'the', 'dominance', 'of', 'dynamic', 'truthtelling', 'for', 'agents', 'comprised', 'of', 'general', 'stochastic', 'dynamic', 'systems', 'the', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'show', 'that', 'such', 'a', 'dynamic', 'stochastic', 'extension', 'does', 'exist', 'for', 'the', 'special', 'case', 'of', 'linearquadraticgaussian', 'lqg', 'agents', 'with', 'a', 'careful', 'construction', 'of', 'a', 'sequence', 'of', 'layered', 'payments', 'over', 'time', 'for', 'a', 'set', 'of', 'lqg', 'agents', 'we', 'propose', 'a', 'modified', 'layered', 'version', 'of', 'the', 'vcg', 'mechanism', 'for', 'payments', 'that', 'decouples', 'the', 'intertemporal', 'effect', 'of', 'current', 'bids', 'on', 'future', 'payoffs', 'and', 'prove', 'that', 'truthtelling', 'of', 'dynamic', 'states', 'forms', 'a', 'dominant', 'strategy', 'if', 'system', 'parameters', 'are', 'known', 'and', 'agents', 'are', 'rational', 'an', 'important', 'example', 'of', 'a', 'problem', 'needing', 'such', 'optimal', 'dynamic', 'coordination', 'of', 'stochastic', 'agents', 'arises', 'in', 'power', 'systems', 'where', 'an', 'independent', 'system', 'operator', 'iso', 'has', 'to', 'ensure', 'balance', 'of', 'generation', 'and', 'consumption', 'at', 'all', 'time', 'instants', 'while', 'ensuring', 'social', 'optimality', 'the', 'challenge', 'is', 'to', 'determine', 'a', 'bidding', 'scheme', 'between', 'all', 'agents', 'and', 'the', 'iso', 'that', 'maximizes', 'social', 'welfare', 'while', 'taking', 'into', 'account', 'the', 'stochastic', 'dynamic', 'models', 'of', 'agents', 'since', 'renewable', 'energy', 'resources', 'such', 'as', 'solarwind', 'are', 'stochastic', 'and', 'dynamic', 'in', 'nature', 'as', 'are', 'consumptions', 'by', 'loads', 'which', 'are', 'influenced', 'by', 'factors', 'such', 'as', 'local', 'temperatures', 'and', 'thermal', 'inertias', 'of', 'facilities']]
|
[-0.1672107641605791, 0.07549742735139219, -0.06334026705308704, 0.07219884070444069, -0.12362292867903064, -0.1687898687894604, 0.11727466252701171, 0.38708024992989, -0.32053175675803003, -0.27420471692835824, 0.09340186090882166, -0.23834805255601135, -0.1576044993282629, 0.147011674604657, -0.09746455988284833, 0.017511492556844224, 0.02373599887883971, 0.031842404403216874, 0.060905574682611985, -0.25203004737498025, 0.3173078205642665, 0.07671252951005343, 0.2874018508404823, 0.03654825064951616, 0.1578779994833156, 0.03439115593209863, 0.022345431201414263, 0.03836911112156858, -0.08161116667109351, 0.07506129259223847, 0.299834288306781, 0.15828413089646118, 0.36627624355208444, -0.4420995218662126, -0.17724690570767085, 0.16117415839301016, 0.07046629325991473, 0.06862776298325068, -0.005584029630307671, -0.20133464120421216, 0.08587596570167388, -0.20120082975140124, -0.0771117004816338, -0.06728070915240203, -0.01861626350379298, 0.06593269597123827, -0.3753140280229414, 0.017098793888815106, 0.06904706936776363, 0.0184619262955423, -0.12213346388060393, -0.10643559878879326, -0.048676595694086486, 0.1496115657732894, 0.04405244647411843, -0.042849949029243356, 0.1559358375003936, -0.15565383130241173, -0.18897118344748345, 0.425684615718785, 0.0011194295480132543, -0.16443500509296588, 0.1542584565029964, -0.048400702938691774, -0.1247634204049557, 0.10330685511243451, 0.20524719606988764, 0.10733401706670771, -0.1731671436940667, 0.0692340245623334, -0.058130447415985526, 0.17145523478404182, 0.024388494578317304, 0.07482800314935763, 0.17933054130208229, 0.17183400868228552, 0.1868735700128325, 0.07582610473960356, 0.05504125687706102, -0.19436661512986156, -0.2755330885155642, -0.13969208403308772, -0.13979432881746193, 0.05644148982714645, -0.0950549921866917, -0.1447944321954877, 0.3449562880038291, 0.14034459216484105, 0.13248097989020863, 0.11297980860791537, 0.3238274518372938, 0.11556409928408354, 0.051441558729513545, 0.10733530514210297, 0.22895907931505768, -0.00919552547754067, 0.11827341646103814, -0.2226940349481761, 0.1859266672683347, 0.02949617766496825]
|
1,803.06735
|
Bayesian ROC surface estimation under verification bias
|
The Receiver Operating Characteristic (ROC) surface is a generalization of
ROC curve and is widely used for assessment of the accuracy of diagnostic tests
on three categories. A complication called the verification bias, meaning that
not all subjects have their true disease status verified often occur in real
application of ROC analysis. This is a common problem since the gold standard
test, which is used to generate true disease status, can be invasive and
expensive. In this paper, we will propose a Bayesian approach for estimating
the ROC surface based on continuous data under a semi-parametric trinormality
assumption. Our proposed method often adopted in ROC analysis can also be
extended to situation in the presence of verification bias. We compute the
posterior distribution of the parameters under trinormality assumption by using
a rank-based likelihood. Consistency of the posterior under mild conditions is
also established. We compare our method with the existing methods for
estimating ROC surface and conclude that our method performs well in terms of
accuracy.
|
stat.AP stat.ME
|
the receiver operating characteristic roc surface is a generalization of roc curve and is widely used for assessment of the accuracy of diagnostic tests on three categories a complication called the verification bias meaning that not all subjects have their true disease status verified often occur in real application of roc analysis this is a common problem since the gold standard test which is used to generate true disease status can be invasive and expensive in this paper we will propose a bayesian approach for estimating the roc surface based on continuous data under a semiparametric trinormality assumption our proposed method often adopted in roc analysis can also be extended to situation in the presence of verification bias we compute the posterior distribution of the parameters under trinormality assumption by using a rankbased likelihood consistency of the posterior under mild conditions is also established we compare our method with the existing methods for estimating roc surface and conclude that our method performs well in terms of accuracy
|
[['the', 'receiver', 'operating', 'characteristic', 'roc', 'surface', 'is', 'a', 'generalization', 'of', 'roc', 'curve', 'and', 'is', 'widely', 'used', 'for', 'assessment', 'of', 'the', 'accuracy', 'of', 'diagnostic', 'tests', 'on', 'three', 'categories', 'a', 'complication', 'called', 'the', 'verification', 'bias', 'meaning', 'that', 'not', 'all', 'subjects', 'have', 'their', 'true', 'disease', 'status', 'verified', 'often', 'occur', 'in', 'real', 'application', 'of', 'roc', 'analysis', 'this', 'is', 'a', 'common', 'problem', 'since', 'the', 'gold', 'standard', 'test', 'which', 'is', 'used', 'to', 'generate', 'true', 'disease', 'status', 'can', 'be', 'invasive', 'and', 'expensive', 'in', 'this', 'paper', 'we', 'will', 'propose', 'a', 'bayesian', 'approach', 'for', 'estimating', 'the', 'roc', 'surface', 'based', 'on', 'continuous', 'data', 'under', 'a', 'semiparametric', 'trinormality', 'assumption', 'our', 'proposed', 'method', 'often', 'adopted', 'in', 'roc', 'analysis', 'can', 'also', 'be', 'extended', 'to', 'situation', 'in', 'the', 'presence', 'of', 'verification', 'bias', 'we', 'compute', 'the', 'posterior', 'distribution', 'of', 'the', 'parameters', 'under', 'trinormality', 'assumption', 'by', 'using', 'a', 'rankbased', 'likelihood', 'consistency', 'of', 'the', 'posterior', 'under', 'mild', 'conditions', 'is', 'also', 'established', 'we', 'compare', 'our', 'method', 'with', 'the', 'existing', 'methods', 'for', 'estimating', 'roc', 'surface', 'and', 'conclude', 'that', 'our', 'method', 'performs', 'well', 'in', 'terms', 'of', 'accuracy']]
|
[-0.04745294603124035, -0.028864444244765874, -0.14100671917708082, 0.11829563052125389, -0.06145339195164993, -0.17788643453721747, 0.05755289520179345, 0.40176865632335346, -0.20055818004025655, -0.2936402871471011, 0.1456750789791289, -0.20498845814303918, -0.1833819367753511, 0.27759187941185454, -0.17342789612258924, 0.09296008597946528, 0.10317297470896984, 0.05021834134716879, -0.08102165211246094, -0.3110748886384747, 0.28777481055620946, 0.0492307887045723, 0.3821788798509674, 0.04020712496465862, 0.0955602034369032, 0.014100296904022496, -0.002775394031777978, 0.0396133448145437, -0.10626129460085366, 0.12845258767448478, 0.2934528614521365, 0.20736451101009593, 0.29537237298985325, -0.3389223989855964, -0.22186730812783495, 0.14132360678420147, 0.08529657989627484, 0.05028447503661455, -0.002529329074208032, -0.28025769429902236, 0.10527678618884899, -0.13677351299221768, -0.09650755480891376, -0.08094488426647854, -0.07064545180535678, 0.006845179259085633, -0.31849217907363325, 0.09703462539826323, 0.014963232356857396, 0.15360939357699616, -0.03643998915724682, -0.13812481980262833, 0.03345674305420482, 0.10278173716682376, 0.0864920967780618, 0.002704021330414848, 0.16418711501032565, -0.09496462289914206, -0.072609834830192, 0.33748950621282514, -0.09220441158077765, -0.25301887188106775, 0.18301586495998146, -0.08697424117532192, -0.13299915774048052, 0.11061169515279207, 0.1804187052629211, 0.11901548135122567, -0.2090298634361137, 0.042504922725669476, -0.028457893575118347, 0.1586635027983875, 0.03591501368633048, -0.04722798250502709, 0.17394361480308526, 0.2032740274274891, 0.030242932628783765, 0.12294785212019854, -0.16163830053569242, -0.04048336371497223, -0.29567608227106656, -0.16182129393176486, -0.17433890737099292, -0.016376190066644498, -0.08066582569374463, -0.18077366306361828, 0.4289201433572805, 0.23158361691078452, 0.12684129963374952, 0.10015217216727747, 0.3264986984883294, 0.09107686184614784, 0.025580224839293144, 0.057617175556493525, 0.21165709410314307, 0.07491304872762129, 0.005398581120552439, -0.19004393905528227, 0.18801916742302252, -0.0024058385526366305]
|
1,803.06736
|
Effect of gap anisotropy on the spin resonance peak in the
superconducting state of iron-based materials
|
Spin resonance in the superconducting state of Fe-based materials within the
multiorbital model with unequal anisotropic gaps on different Fermi surface
sheets is studied. On the basis of the model gap function and the one
calculated within the spin fluctuation theory of pairing, I show that the
resonance peak shifts to higher frequencies with increasing the zero-amplitude
gap magnitude. On the contrary, with increasing the gap anisotropy, it shifts
to lower frequencies and lose some intensity.
|
cond-mat.supr-con
|
spin resonance in the superconducting state of febased materials within the multiorbital model with unequal anisotropic gaps on different fermi surface sheets is studied on the basis of the model gap function and the one calculated within the spin fluctuation theory of pairing i show that the resonance peak shifts to higher frequencies with increasing the zeroamplitude gap magnitude on the contrary with increasing the gap anisotropy it shifts to lower frequencies and lose some intensity
|
[['spin', 'resonance', 'in', 'the', 'superconducting', 'state', 'of', 'febased', 'materials', 'within', 'the', 'multiorbital', 'model', 'with', 'unequal', 'anisotropic', 'gaps', 'on', 'different', 'fermi', 'surface', 'sheets', 'is', 'studied', 'on', 'the', 'basis', 'of', 'the', 'model', 'gap', 'function', 'and', 'the', 'one', 'calculated', 'within', 'the', 'spin', 'fluctuation', 'theory', 'of', 'pairing', 'i', 'show', 'that', 'the', 'resonance', 'peak', 'shifts', 'to', 'higher', 'frequencies', 'with', 'increasing', 'the', 'zeroamplitude', 'gap', 'magnitude', 'on', 'the', 'contrary', 'with', 'increasing', 'the', 'gap', 'anisotropy', 'it', 'shifts', 'to', 'lower', 'frequencies', 'and', 'lose', 'some', 'intensity']]
|
[-0.15925541794001075, 0.22257436074601414, -0.020553214454067575, 0.08886652140063234, -0.03539525942974969, -0.10938369583240465, 0.07586596900517562, 0.3878289475105703, -0.24545659695899016, -0.31266863712746845, -0.018449100293525447, -0.3444185332934323, -0.07934437371410527, 0.17901106260251254, 0.0764183816193652, 0.005878645206777085, -0.012961573874283778, 0.009933263014413808, -0.15338042411818414, -0.18294398275841223, 0.3599441382163939, 0.05687238001509717, 0.35508641179062816, 0.08735873037796027, 0.0003345898156495471, 0.019453387995446592, 0.11969184089991215, -0.01332717274903859, -0.15694117015826983, 0.12846955558358641, 0.23792207027834497, -0.09039548528993405, 0.2022097821984636, -0.40711592145166114, -0.23019171550434916, 0.014397640491982824, 0.11013281671330333, 0.12557639361751316, 0.0037008569297062137, -0.26402155370574054, 0.03284522508712191, -0.1858885443193446, -0.12620465160273997, -0.020933321076690367, 0.01569640984464633, 0.007573116742270558, -0.17911625510743379, 0.11787206604831706, 0.072731502326573, 0.0891403412617939, -0.14054196133694954, -0.20472692324485825, -0.0673128922322863, 0.04279867011293965, 0.09581072556810748, 0.04699057547718679, 0.12714321943196027, -0.11549723829681936, -0.0703327122947054, 0.31621227105834376, -0.08617333126695532, -0.11944514073088373, 0.15664086983490147, -0.248828686271353, -0.03983391980689607, 0.14989178632631114, 0.10822008925759674, 0.03143268780733802, -0.04710829281248152, 0.04948208094911503, 0.027689128869066115, 0.19728923138954038, 0.058729842862751534, 0.07400674746665907, 0.23968142994655003, 0.16718413130269924, 0.0925103574378514, 0.10627184250686121, -0.12590378058896595, -0.08082752319444951, -0.22185518546029925, -0.10034252226499743, -0.23568696808069944, -0.01636907975587651, -0.05298676934839214, -0.18196677742525935, 0.43775997141768275, 0.1658285916200839, 0.22247661249467024, -0.031776878075968275, 0.22469709536648894, 0.19009969337065213, 0.12466498707592684, 0.05094410208249955, 0.27680559269662663, 0.1611706022706226, 0.0678192438300405, -0.31685105194705293, 0.052249747800248623, -0.02563648879233944]
|
1,803.06737
|
Optimal control policies for evolutionary dynamics with environmental
feedback
|
We study a dynamical model of a population of cooperators and defectors whose
actions have long-term consequences on environmental "commons" - what we term
the "resource". Cooperators contribute to restoring the resource whereas
defectors degrade it. The population dynamics evolve according to a replicator
equation coupled with an environmental state. Our goal is to identify methods
of influencing the population with the objective to maximize accumulation of
the resource. In particular, we consider strategies that modify
individual-level incentives. We then extend the model to incorporate a public
opinion state that imperfectly tracks the true environmental state, and study
strategies that influence opinion. We formulate optimal control problems and
solve them using numerical techniques to characterize locally optimal control
policies for three problem formulations: 1) control of incentives, and control
of opinions through 2) propaganda-like strategies and 3) awareness campaigns.
We show numerically that the resulting controllers in all formulations achieve
the objective, albeit with an unintended consequence. The resulting dynamics
include cycles between low and high resource states - a dynamical regime termed
an "oscillating tragedy of the commons". This outcome may have desirable
average properties, but includes risks to resource depletion. Our findings
suggest the need for new approaches to controlling coupled
population-environment dynamics.
|
cs.SY
|
we study a dynamical model of a population of cooperators and defectors whose actions have longterm consequences on environmental commons what we term the resource cooperators contribute to restoring the resource whereas defectors degrade it the population dynamics evolve according to a replicator equation coupled with an environmental state our goal is to identify methods of influencing the population with the objective to maximize accumulation of the resource in particular we consider strategies that modify individuallevel incentives we then extend the model to incorporate a public opinion state that imperfectly tracks the true environmental state and study strategies that influence opinion we formulate optimal control problems and solve them using numerical techniques to characterize locally optimal control policies for three problem formulations 1 control of incentives and control of opinions through 2 propagandalike strategies and 3 awareness campaigns we show numerically that the resulting controllers in all formulations achieve the objective albeit with an unintended consequence the resulting dynamics include cycles between low and high resource states a dynamical regime termed an oscillating tragedy of the commons this outcome may have desirable average properties but includes risks to resource depletion our findings suggest the need for new approaches to controlling coupled populationenvironment dynamics
|
[['we', 'study', 'a', 'dynamical', 'model', 'of', 'a', 'population', 'of', 'cooperators', 'and', 'defectors', 'whose', 'actions', 'have', 'longterm', 'consequences', 'on', 'environmental', 'commons', 'what', 'we', 'term', 'the', 'resource', 'cooperators', 'contribute', 'to', 'restoring', 'the', 'resource', 'whereas', 'defectors', 'degrade', 'it', 'the', 'population', 'dynamics', 'evolve', 'according', 'to', 'a', 'replicator', 'equation', 'coupled', 'with', 'an', 'environmental', 'state', 'our', 'goal', 'is', 'to', 'identify', 'methods', 'of', 'influencing', 'the', 'population', 'with', 'the', 'objective', 'to', 'maximize', 'accumulation', 'of', 'the', 'resource', 'in', 'particular', 'we', 'consider', 'strategies', 'that', 'modify', 'individuallevel', 'incentives', 'we', 'then', 'extend', 'the', 'model', 'to', 'incorporate', 'a', 'public', 'opinion', 'state', 'that', 'imperfectly', 'tracks', 'the', 'true', 'environmental', 'state', 'and', 'study', 'strategies', 'that', 'influence', 'opinion', 'we', 'formulate', 'optimal', 'control', 'problems', 'and', 'solve', 'them', 'using', 'numerical', 'techniques', 'to', 'characterize', 'locally', 'optimal', 'control', 'policies', 'for', 'three', 'problem', 'formulations', '1', 'control', 'of', 'incentives', 'and', 'control', 'of', 'opinions', 'through', '2', 'propagandalike', 'strategies', 'and', '3', 'awareness', 'campaigns', 'we', 'show', 'numerically', 'that', 'the', 'resulting', 'controllers', 'in', 'all', 'formulations', 'achieve', 'the', 'objective', 'albeit', 'with', 'an', 'unintended', 'consequence', 'the', 'resulting', 'dynamics', 'include', 'cycles', 'between', 'low', 'and', 'high', 'resource', 'states', 'a', 'dynamical', 'regime', 'termed', 'an', 'oscillating', 'tragedy', 'of', 'the', 'commons', 'this', 'outcome', 'may', 'have', 'desirable', 'average', 'properties', 'but', 'includes', 'risks', 'to', 'resource', 'depletion', 'our', 'findings', 'suggest', 'the', 'need', 'for', 'new', 'approaches', 'to', 'controlling', 'coupled', 'populationenvironment', 'dynamics']]
|
[-0.11854020623253908, 0.09304051397248711, -0.11004808667435576, 0.08479376426151958, -0.07198439007138473, -0.17485293373349703, 0.13002634644844285, 0.3951781145783503, -0.27938818475648536, -0.3016387637269067, 0.10622899165604059, -0.25624876614863895, -0.16826119564881373, 0.10750330134702671, -0.12431121873785163, 0.0017152489869581972, 0.05422271458566448, -0.018108976289018322, 0.031538804815804115, -0.2888402530601461, 0.32865211012192874, 0.03417336331930623, 0.31041396219301876, 0.012715209972817654, 0.11620558400531832, -0.010290392540135787, -0.008881944199254857, 0.013624320326473469, -0.15237528344754428, 0.07495914903540044, 0.29289294825055967, 0.18484888334911484, 0.39525762177419976, -0.4451140886385791, -0.216631160910005, 0.1310133236617925, 0.12331958113305401, 0.14495290932824734, -0.02289396422319763, -0.27455980131699154, 0.043506882936214165, -0.2218120996701295, -0.13926353103560002, -0.09165489569361975, -0.03703509566990371, 0.032200087499237195, -0.2969123550310768, 0.045668816214788764, 0.024711623282544778, 0.030379440046995138, -0.14199406581940083, -0.08647232076421899, -0.03196596959374141, 0.2163585176950886, 0.06553899772425845, -0.03514836629185436, 0.17321590599036354, -0.17673035272726076, -0.1804521623466034, 0.36617242309047066, -0.021317019867502264, -0.21315511208680918, 0.20353811897918933, -0.08796447797606592, -0.11751926191383104, 0.08142153629847798, 0.22785570992814813, 0.10196481382854246, -0.16618984392774638, -0.014293421215501693, 0.003225522851386103, 0.19715183766255276, -0.01723924134128185, 0.07661568852771648, 0.17414200154193377, 0.17688149124481228, 0.15714903600254462, 0.12310215231640477, 0.004009310078351939, -0.16833086533527544, -0.20269183341045377, -0.09784700249006685, -0.08947661156309722, 0.049581045901115554, -0.043594711380970166, -0.11332029075505425, 0.3816613197252525, 0.1919152278004826, 0.11346080395583044, 0.09095233414711347, 0.27291478225914995, 0.07537758497831722, 0.025390981982950936, 0.0913302563269859, 0.20677172077127004, 0.05706706995796644, 0.09022776185261522, -0.30678187803173, 0.12500107673284092, -0.027170201234718718]
|
1,803.06738
|
Large-Scale Dynamic Predictive Regressions
|
We develop a novel "decouple-recouple" dynamic predictive strategy and
contribute to the literature on forecasting and economic decision making in a
data-rich environment. Under this framework, clusters of predictors generate
different latent states in the form of predictive densities that are later
synthesized within an implied time-varying latent factor model. As a result,
the latent inter-dependencies across predictive densities and biases are
sequentially learned and corrected. Unlike sparse modeling and variable
selection procedures, we do not assume a priori that there is a given subset of
active predictors, which characterize the predictive density of a quantity of
interest. We test our procedure by investigating the predictive content of a
large set of financial ratios and macroeconomic variables on both the equity
premium across different industries and the inflation rate in the U.S., two
contexts of topical interest in finance and macroeconomics. We find that our
predictive synthesis framework generates both statistically and economically
significant out-of-sample benefits while maintaining interpretability of the
forecasting variables. In addition, the main empirical results highlight that
our proposed framework outperforms both LASSO-type shrinkage regressions,
factor based dimension reduction, sequential variable selection, and
equal-weighted linear pooling methodologies.
|
stat.ME econ.EM q-fin.ST
|
we develop a novel decouplerecouple dynamic predictive strategy and contribute to the literature on forecasting and economic decision making in a datarich environment under this framework clusters of predictors generate different latent states in the form of predictive densities that are later synthesized within an implied timevarying latent factor model as a result the latent interdependencies across predictive densities and biases are sequentially learned and corrected unlike sparse modeling and variable selection procedures we do not assume a priori that there is a given subset of active predictors which characterize the predictive density of a quantity of interest we test our procedure by investigating the predictive content of a large set of financial ratios and macroeconomic variables on both the equity premium across different industries and the inflation rate in the us two contexts of topical interest in finance and macroeconomics we find that our predictive synthesis framework generates both statistically and economically significant outofsample benefits while maintaining interpretability of the forecasting variables in addition the main empirical results highlight that our proposed framework outperforms both lassotype shrinkage regressions factor based dimension reduction sequential variable selection and equalweighted linear pooling methodologies
|
[['we', 'develop', 'a', 'novel', 'decouplerecouple', 'dynamic', 'predictive', 'strategy', 'and', 'contribute', 'to', 'the', 'literature', 'on', 'forecasting', 'and', 'economic', 'decision', 'making', 'in', 'a', 'datarich', 'environment', 'under', 'this', 'framework', 'clusters', 'of', 'predictors', 'generate', 'different', 'latent', 'states', 'in', 'the', 'form', 'of', 'predictive', 'densities', 'that', 'are', 'later', 'synthesized', 'within', 'an', 'implied', 'timevarying', 'latent', 'factor', 'model', 'as', 'a', 'result', 'the', 'latent', 'interdependencies', 'across', 'predictive', 'densities', 'and', 'biases', 'are', 'sequentially', 'learned', 'and', 'corrected', 'unlike', 'sparse', 'modeling', 'and', 'variable', 'selection', 'procedures', 'we', 'do', 'not', 'assume', 'a', 'priori', 'that', 'there', 'is', 'a', 'given', 'subset', 'of', 'active', 'predictors', 'which', 'characterize', 'the', 'predictive', 'density', 'of', 'a', 'quantity', 'of', 'interest', 'we', 'test', 'our', 'procedure', 'by', 'investigating', 'the', 'predictive', 'content', 'of', 'a', 'large', 'set', 'of', 'financial', 'ratios', 'and', 'macroeconomic', 'variables', 'on', 'both', 'the', 'equity', 'premium', 'across', 'different', 'industries', 'and', 'the', 'inflation', 'rate', 'in', 'the', 'us', 'two', 'contexts', 'of', 'topical', 'interest', 'in', 'finance', 'and', 'macroeconomics', 'we', 'find', 'that', 'our', 'predictive', 'synthesis', 'framework', 'generates', 'both', 'statistically', 'and', 'economically', 'significant', 'outofsample', 'benefits', 'while', 'maintaining', 'interpretability', 'of', 'the', 'forecasting', 'variables', 'in', 'addition', 'the', 'main', 'empirical', 'results', 'highlight', 'that', 'our', 'proposed', 'framework', 'outperforms', 'both', 'lassotype', 'shrinkage', 'regressions', 'factor', 'based', 'dimension', 'reduction', 'sequential', 'variable', 'selection', 'and', 'equalweighted', 'linear', 'pooling', 'methodologies']]
|
[-0.02637287507477309, 0.04676750160003122, -0.09182567828693257, 0.10057146045079464, -0.08676308654224334, -0.14032216329147054, 0.10775725567147759, 0.42861805891335325, -0.2450941064741209, -0.3041858629698997, 0.08780267168277099, -0.2420463931517607, -0.16998995908082545, 0.16996220451187224, -0.12562284567417742, 0.06401465246600162, 0.03780215311398076, -0.014363270145670282, -0.02641468454903255, -0.2909291833127161, 0.26438762787827025, 0.0466148323374581, 0.3578884173282154, -0.03133785740395579, 0.138974472480681, -0.002666316650983395, -0.11081238921563487, 0.04427898486988395, -0.08650080903377798, 0.18949982619000824, 0.32364875904201523, 0.20266545468000255, 0.39026692737605795, -0.3783702112329607, -0.2686335498208658, 0.1134123499090759, 0.07590752122533649, 0.03816513809026829, -0.02024358716008317, -0.24750904702820392, 0.025420346473470447, -0.2195552148669105, -0.03385496986371645, -0.16852270278845627, -0.013530908825353802, 0.014382411999486543, -0.3532566697682932, 0.10653047757076968, 0.045181004101342244, 0.04622691185384287, -0.08616656433615386, -0.15927852619761182, -0.022224145049121992, 0.13317322335495488, 0.10669713557139526, -0.025350989727547187, 0.15165337642498744, -0.15186067656656552, -0.13000980505222426, 0.32529024984346244, -0.05286704152529932, -0.2024321736778859, 0.17403362421635832, -0.09979997950493899, -0.19979098212359112, 0.06852412521741622, 0.2489270388699717, 0.07403029789611776, -0.1933458757279587, 0.02316837743868203, -0.03985819633847775, 0.18418907128117187, 0.018101941237070096, -0.006404100924593772, 0.1898513057285003, 0.21574316752820974, 0.05866426857875865, 0.09401006069910806, -0.08683897246952846, -0.13194032380612158, -0.2841748832127674, -0.08998034842658534, -0.1298434976780914, -0.034367630388560284, -0.1910425704793885, -0.1709694929264915, 0.422345032343758, 0.2010771915516499, 0.17408142856770825, 0.08487764224489293, 0.2810217551399432, 0.07924170017369513, 0.03886166058178425, 0.11272772197996837, 0.1653070619734521, 0.05842171414482227, 0.06927595292620302, -0.1808459804520128, 0.16940481663167756, -0.009465090039366592]
|
1,803.06739
|
A Construction of the Stable Web
|
We provide a process on the space of coalescing cadlag stable paths and show
convergence in the appropriate topology for coalescing stable random walks on
the integer lattice.
|
math.PR
|
we provide a process on the space of coalescing cadlag stable paths and show convergence in the appropriate topology for coalescing stable random walks on the integer lattice
|
[['we', 'provide', 'a', 'process', 'on', 'the', 'space', 'of', 'coalescing', 'cadlag', 'stable', 'paths', 'and', 'show', 'convergence', 'in', 'the', 'appropriate', 'topology', 'for', 'coalescing', 'stable', 'random', 'walks', 'on', 'the', 'integer', 'lattice']]
|
[-0.19885691069066525, 0.23882033373229206, -0.09825785823964647, 0.09595170425258662, -0.03680720453017524, -0.07420220483826208, 0.17829372111840971, 0.4517701564888869, -0.2827801150935037, -0.12164744029619864, 0.13274096986528353, -0.23865681284639453, -0.16302213538438082, 0.19886166682200773, -0.04483680849495743, 0.10725040427808251, 0.15142874725695168, 0.04350316527104171, -0.02037706126325897, -0.28889885099072543, 0.3329616960797596, -0.021915487961710563, 0.2372516007827861, -0.0650619815569371, 0.14193089273093001, 0.10382683563511819, -0.0407462419409837, 0.023713161851836567, -0.20653955013092076, 0.0923928825317749, 0.15101459542555468, 0.041294281445776244, 0.21898668419037545, -0.41897830220737625, -0.1955617677886039, 0.1265031883958727, 0.10999838079858039, 0.06652135523368738, -0.083087703154888, -0.32570161963147776, 0.11987685734805252, -0.059845464037997384, -0.11018743033387832, -0.0813273844043059, 0.07127117408838655, 0.11511468574670809, -0.31432332284748554, -0.04247977800800332, 0.12394498780901943, -0.03478575966853116, -0.026891448135886873, -0.07163572051961507, -0.05122681021956461, 0.08431738620025239, -0.03841698978067143, 0.022682775809828724, 0.09330709699341762, 0.009618724097630807, -0.22575037896500103, 0.37640675789277467, -0.049083507885890346, -0.2736003058962524, 0.19415457732975483, -0.19460752736111836, -0.19880371607307876, 0.16947070063490952, 0.2644116364286414, 0.1912115728482604, -0.04507602980759527, 0.1420658750472025, -0.006090036460331508, 0.03463919214638216, 0.07483171994265701, 0.0311320944290076, 0.20175035025126167, 0.20872503612190485, 0.2161043219467891, 0.1594088362929012, -0.026692992359000658, -0.21904209016689233, -0.29088027618126944, -0.16844131305281604, -0.2153152429299163, 0.1718747732478992, -0.2516415970660871, -0.2750786167037274, 0.32871692419783877, 0.12549511298337684, 0.204021732855056, 0.1617366585747472, 0.1838872004300356, 0.11490987640406404, -0.10095904198741275, 0.08148886140302888, 0.1358792900240847, 0.07491246211741652, 0.07189793488942087, -0.1760854306381329, 0.07563645204728735, 0.17703438024701817]
|
1,803.0674
|
Metabolomic signature of type 1 diabetes-induced sensory loss and nerve
damage in diabetic neuropathy
|
Diabetic-induced peripheral neuropathy (DPN) is a diabetic late complication.
The molecular mechanisms underlying the pathophysiology of nerve damage &
sensory loss remain largely unclear. Recently, alterations in metabolic flux
have gained attention a basis for organ damage in diabetes; however, peripheral
sensory neurons have not been adequately analyzed. In the present study, we
attempted to delineate the role of alteration of metabolic pathways in relation
to nerve damage & sensory loss. We employed STZ-injected mouse model of type1
diabetes. To investigate the progression of DPN by behavioral measurements of
sensitivity to thermal & mechanical stimuli and quantitative assessment of
intraepidermal nerve fiber density. We employed a MS-based screen to address
alterations in levels of metabolites in peripheral sciatic nerve (SN) & amino
acids (AA) in serum over several months post-STZ administration. Although
hyperglycemia & body weight changes occurred early, sensory loss & reduced
intraepithelial branching of nociceptive nerves was only evident at 22 wks
post-STZ. The longitudinal metabolites screen in SN demonstrated that mice at
12 and 22 wks post-STZ showed an early impairment the tricarboxylic acid. We
found that levels of citric acid, ketoglutaric acid, succinic acid, fumaric
acid & malic acid were observed to be significantly reduced in SN at 22 wks
post-STZ. In addition, we also found the increase in levels of sorbitol &
L-Lactate in SN from 12 wks post-STZ injection. AA screen in serum showed that
the amino acids Val, Ile and Leu, increased more than 2-fold from 12 wks
post-STZ. Similarly, the levels of Tyr, Asn, Ser, His, Ala, & Pro showed
progressive increase. Our results indicate that the impaired TCA cycle
metabolites in peripheral nerve is the primary cause of shunting metabolic
substrate to compensatory pathways which leads to mitochondrial dysfunction &
nerve damage.
|
q-bio.CB q-bio.TO
|
diabeticinduced peripheral neuropathy dpn is a diabetic late complication the molecular mechanisms underlying the pathophysiology of nerve damage sensory loss remain largely unclear recently alterations in metabolic flux have gained attention a basis for organ damage in diabetes however peripheral sensory neurons have not been adequately analyzed in the present study we attempted to delineate the role of alteration of metabolic pathways in relation to nerve damage sensory loss we employed stzinjected mouse model of type1 diabetes to investigate the progression of dpn by behavioral measurements of sensitivity to thermal mechanical stimuli and quantitative assessment of intraepidermal nerve fiber density we employed a msbased screen to address alterations in levels of metabolites in peripheral sciatic nerve sn amino acids aa in serum over several months poststz administration although hyperglycemia body weight changes occurred early sensory loss reduced intraepithelial branching of nociceptive nerves was only evident at 22 wks poststz the longitudinal metabolites screen in sn demonstrated that mice at 12 and 22 wks poststz showed an early impairment the tricarboxylic acid we found that levels of citric acid ketoglutaric acid succinic acid fumaric acid malic acid were observed to be significantly reduced in sn at 22 wks poststz in addition we also found the increase in levels of sorbitol llactate in sn from 12 wks poststz injection aa screen in serum showed that the amino acids val ile and leu increased more than 2fold from 12 wks poststz similarly the levels of tyr asn ser his ala pro showed progressive increase our results indicate that the impaired tca cycle metabolites in peripheral nerve is the primary cause of shunting metabolic substrate to compensatory pathways which leads to mitochondrial dysfunction nerve damage
|
[['diabeticinduced', 'peripheral', 'neuropathy', 'dpn', 'is', 'a', 'diabetic', 'late', 'complication', 'the', 'molecular', 'mechanisms', 'underlying', 'the', 'pathophysiology', 'of', 'nerve', 'damage', 'sensory', 'loss', 'remain', 'largely', 'unclear', 'recently', 'alterations', 'in', 'metabolic', 'flux', 'have', 'gained', 'attention', 'a', 'basis', 'for', 'organ', 'damage', 'in', 'diabetes', 'however', 'peripheral', 'sensory', 'neurons', 'have', 'not', 'been', 'adequately', 'analyzed', 'in', 'the', 'present', 'study', 'we', 'attempted', 'to', 'delineate', 'the', 'role', 'of', 'alteration', 'of', 'metabolic', 'pathways', 'in', 'relation', 'to', 'nerve', 'damage', 'sensory', 'loss', 'we', 'employed', 'stzinjected', 'mouse', 'model', 'of', 'type1', 'diabetes', 'to', 'investigate', 'the', 'progression', 'of', 'dpn', 'by', 'behavioral', 'measurements', 'of', 'sensitivity', 'to', 'thermal', 'mechanical', 'stimuli', 'and', 'quantitative', 'assessment', 'of', 'intraepidermal', 'nerve', 'fiber', 'density', 'we', 'employed', 'a', 'msbased', 'screen', 'to', 'address', 'alterations', 'in', 'levels', 'of', 'metabolites', 'in', 'peripheral', 'sciatic', 'nerve', 'sn', 'amino', 'acids', 'aa', 'in', 'serum', 'over', 'several', 'months', 'poststz', 'administration', 'although', 'hyperglycemia', 'body', 'weight', 'changes', 'occurred', 'early', 'sensory', 'loss', 'reduced', 'intraepithelial', 'branching', 'of', 'nociceptive', 'nerves', 'was', 'only', 'evident', 'at', '22', 'wks', 'poststz', 'the', 'longitudinal', 'metabolites', 'screen', 'in', 'sn', 'demonstrated', 'that', 'mice', 'at', '12', 'and', '22', 'wks', 'poststz', 'showed', 'an', 'early', 'impairment', 'the', 'tricarboxylic', 'acid', 'we', 'found', 'that', 'levels', 'of', 'citric', 'acid', 'ketoglutaric', 'acid', 'succinic', 'acid', 'fumaric', 'acid', 'malic', 'acid', 'were', 'observed', 'to', 'be', 'significantly', 'reduced', 'in', 'sn', 'at', '22', 'wks', 'poststz', 'in', 'addition', 'we', 'also', 'found', 'the', 'increase', 'in', 'levels', 'of', 'sorbitol', 'llactate', 'in', 'sn', 'from', '12', 'wks', 'poststz', 'injection', 'aa', 'screen', 'in', 'serum', 'showed', 'that', 'the', 'amino', 'acids', 'val', 'ile', 'and', 'leu', 'increased', 'more', 'than', '2fold', 'from', '12', 'wks', 'poststz', 'similarly', 'the', 'levels', 'of', 'tyr', 'asn', 'ser', 'his', 'ala', 'pro', 'showed', 'progressive', 'increase', 'our', 'results', 'indicate', 'that', 'the', 'impaired', 'tca', 'cycle', 'metabolites', 'in', 'peripheral', 'nerve', 'is', 'the', 'primary', 'cause', 'of', 'shunting', 'metabolic', 'substrate', 'to', 'compensatory', 'pathways', 'which', 'leads', 'to', 'mitochondrial', 'dysfunction', 'nerve', 'damage']]
|
[-0.04413044466462239, 0.11652215717633506, -0.005013646110175894, 0.07245505921885494, 0.01323138363403524, -0.14685310257834147, 0.07341189920644689, 0.4243453309492587, -0.1981042091821699, -0.2515351040375798, 0.012101909380249215, -0.2949459628021215, -0.24235427054839256, 0.11952400191229914, -0.18986827812597648, -0.04028537851031665, 0.10700020469527269, 0.028619629978253455, 0.07009564184894164, -0.22310688801027917, 0.1568015158827154, 0.08665702281171804, 0.29297707543363827, 0.07715156199171758, 0.0895778019814462, -0.0382536386545652, -0.009503420886682558, -0.060721159501567534, -0.11236075173448105, 0.12001481964728891, 0.3350302015223128, 0.13990934402809815, 0.2649989984588418, -0.4806153315900665, -0.2672155355376229, 0.1076305177499414, 0.130351558349636, 0.09061808635236784, -0.005502892851447021, -0.21942302236553526, 0.14310813776384562, -0.17682892000882616, -0.06875953478943352, 0.03267650747323757, 0.02851126976515893, 0.03104903595522046, -0.2123395423284406, 0.16872844323948719, -0.00016558217737591748, 0.21500512315881448, -0.1234651541421804, -0.15942733739280984, -0.12346898156688156, 0.16299888492739273, 0.07131772306739206, 0.06436349023065288, 0.2691228138393767, -0.11604984753702054, -0.08188913910284693, 0.30345831465934686, 0.013806340379899303, -0.09085144566784821, 0.18436197100188872, -0.11935963291007916, -0.15314643983788884, 0.22937786495637136, 0.11259467621383364, 0.0335554110855137, -0.17477587010752368, -0.0568979165366264, 0.07235278219970509, 0.22348666842259302, 0.20101312455728024, -0.031411774786131205, 0.09611114442362126, 0.18618294209047415, -0.05435543897947222, 0.11228672943492471, -0.11619270933389446, 0.016970856411164224, -0.15869983826037293, -0.14972323758336595, -0.029678974401260362, 0.09387725343823905, -0.06576597176462577, -0.12314587527580709, 0.37437179806768456, 0.06371659162274033, 0.1441098599193188, 0.008530900193183878, 0.18308070121544512, -0.045124525881471325, 0.1299600571384585, -0.044683987519216824, 0.18623256857418233, 0.11424267105928762, 0.12178651086053037, -0.2853819823503194, 0.17493037888816482, 0.01696575726825921]
|
1,803.06741
|
Superconducting Magnetic Bearings Simulation using an H-formulation
Finite Element Model
|
The modeling of superconducting magnetic bearing (SMB) is of great
significance for predicting and optimizing its levitation performance before
construction. Although lots of efforts have been made in this area, it still
remains some space for improvements. Thus the goal of this work is to report a
flexible, fast and trustworthy H-formulation finite element model. First the
methodology for modeling and calibrating both bulk-type and stack-type SMB is
summarized. Then its effectiveness for simulating SMBs in 2-D, 2-D axisymmetric
and 3-D is evaluated by comparison with measurements. In particular, original
solutions to overcome several obstacles are given: clarification of the
calibration procedure for stack-type and bulk-type SMBs, details on the
experimental protocol to obtain reproducible measurements, validation of the
2-D model for a stack-type SMB modeling the tapes real thickness,
implementation of a 2-D axisymmetric SMB model, implementation of a 3-D SMB
model, extensive validation of the models by comparison with experimental
results for field cooling and zero field cooling, for both vertical and lateral
movements. The accuracy of the model being proved, it has now a strong
potential for speeding up the development of numerous applications including
maglev vehicles, magnetic launchers, flywheel energy storage systems, motor
bearings and cosmic microwave background polarimeters.
|
cond-mat.supr-con
|
the modeling of superconducting magnetic bearing smb is of great significance for predicting and optimizing its levitation performance before construction although lots of efforts have been made in this area it still remains some space for improvements thus the goal of this work is to report a flexible fast and trustworthy hformulation finite element model first the methodology for modeling and calibrating both bulktype and stacktype smb is summarized then its effectiveness for simulating smbs in 2d 2d axisymmetric and 3d is evaluated by comparison with measurements in particular original solutions to overcome several obstacles are given clarification of the calibration procedure for stacktype and bulktype smbs details on the experimental protocol to obtain reproducible measurements validation of the 2d model for a stacktype smb modeling the tapes real thickness implementation of a 2d axisymmetric smb model implementation of a 3d smb model extensive validation of the models by comparison with experimental results for field cooling and zero field cooling for both vertical and lateral movements the accuracy of the model being proved it has now a strong potential for speeding up the development of numerous applications including maglev vehicles magnetic launchers flywheel energy storage systems motor bearings and cosmic microwave background polarimeters
|
[['the', 'modeling', 'of', 'superconducting', 'magnetic', 'bearing', 'smb', 'is', 'of', 'great', 'significance', 'for', 'predicting', 'and', 'optimizing', 'its', 'levitation', 'performance', 'before', 'construction', 'although', 'lots', 'of', 'efforts', 'have', 'been', 'made', 'in', 'this', 'area', 'it', 'still', 'remains', 'some', 'space', 'for', 'improvements', 'thus', 'the', 'goal', 'of', 'this', 'work', 'is', 'to', 'report', 'a', 'flexible', 'fast', 'and', 'trustworthy', 'hformulation', 'finite', 'element', 'model', 'first', 'the', 'methodology', 'for', 'modeling', 'and', 'calibrating', 'both', 'bulktype', 'and', 'stacktype', 'smb', 'is', 'summarized', 'then', 'its', 'effectiveness', 'for', 'simulating', 'smbs', 'in', '2d', '2d', 'axisymmetric', 'and', '3d', 'is', 'evaluated', 'by', 'comparison', 'with', 'measurements', 'in', 'particular', 'original', 'solutions', 'to', 'overcome', 'several', 'obstacles', 'are', 'given', 'clarification', 'of', 'the', 'calibration', 'procedure', 'for', 'stacktype', 'and', 'bulktype', 'smbs', 'details', 'on', 'the', 'experimental', 'protocol', 'to', 'obtain', 'reproducible', 'measurements', 'validation', 'of', 'the', '2d', 'model', 'for', 'a', 'stacktype', 'smb', 'modeling', 'the', 'tapes', 'real', 'thickness', 'implementation', 'of', 'a', '2d', 'axisymmetric', 'smb', 'model', 'implementation', 'of', 'a', '3d', 'smb', 'model', 'extensive', 'validation', 'of', 'the', 'models', 'by', 'comparison', 'with', 'experimental', 'results', 'for', 'field', 'cooling', 'and', 'zero', 'field', 'cooling', 'for', 'both', 'vertical', 'and', 'lateral', 'movements', 'the', 'accuracy', 'of', 'the', 'model', 'being', 'proved', 'it', 'has', 'now', 'a', 'strong', 'potential', 'for', 'speeding', 'up', 'the', 'development', 'of', 'numerous', 'applications', 'including', 'maglev', 'vehicles', 'magnetic', 'launchers', 'flywheel', 'energy', 'storage', 'systems', 'motor', 'bearings', 'and', 'cosmic', 'microwave', 'background', 'polarimeters']]
|
[-0.09017725850987647, 0.05869203859830064, -0.008474477066422166, 0.007254831854189779, -0.0578665304974896, -0.15098557633484297, 0.02587690574158295, 0.4041125404974216, -0.18732235311723217, -0.33523557736570464, 0.12011852309227063, -0.2556146595746352, -0.0927104491745053, 0.28152555480411307, -0.043082488464476, 0.1228425846878999, 0.0872542397418566, -0.03855501461413969, -0.04770422958782668, -0.21113408272317497, 0.22778385852376376, 0.10613291428121624, 0.334039664471733, 0.066415771344227, 0.10366014597577322, -0.038988251752321026, -0.034968393478884356, 0.03340547334553624, -0.10876071835028495, 0.11943365751594773, 0.2218218575092986, 0.09464297051486453, 0.2535372676323237, -0.43687908769828343, -0.260207341601837, 0.0654160105531549, 0.10728279966803662, 0.11937120529992754, -0.11066910867485232, -0.2668009515292025, 0.08806889464853909, -0.163713440841541, -0.12394902114114113, -0.10686648480487061, 0.05210758737985761, 0.020767243708469503, -0.2406307454840303, 0.01856891282896048, 0.06543290337864217, 0.1075601262373625, -0.10109776796731786, -0.10124420423721298, 0.007142290804094149, 0.12825143702380964, 0.030848695372983702, 0.05684028348078025, 0.1322789226264092, -0.15636673341665802, -0.11235753590071326, 0.3683740785253679, -0.013179423411381362, -0.17115612413385525, 0.1688581139509901, -0.0945839303126444, -0.11427090194402033, 0.11462477223002558, 0.17422201025891554, 0.07952336060442948, -0.16910987031035896, 0.06432897965951359, 0.0025488674282807436, 0.1331880221497772, 0.024430843067855524, -0.02865978688910016, 0.21511710477933252, 0.2625273866312271, 0.013953434446771523, 0.11800391047968176, -0.12201450345005492, -0.07279826722823524, -0.24810045698354838, -0.1859622316865372, -0.163275117123757, 0.005669113565718049, -0.05660153138547335, -0.18521255448608534, 0.3898973059450538, 0.20064212185940866, 0.14355361730943025, 0.03132557712169593, 0.3677371685746415, 0.03288506830496521, 0.04242640148402132, 0.04509079055585371, 0.24157956360252644, 0.12724897264746096, 0.12406072608915529, -0.20635847713605598, 0.0786060226481612, 0.01873078758787052]
|
1,803.06742
|
Inventory Control with Modulated Demand and a Partially Observed
Modulation Process
|
We consider a periodic review inventory control problem having an underlying
modulation process that affects demand and that is partially observed by the
uncensored demand process and a novel additional observation data (AOD)
process. We present an attainability condition, AC, that guarantees the
existence of an optimal myopic base stock policy if the reorder cost $K=0$ and
the existence of an optimal $(s, S)$ policy if $K>0$, where both policies
depend on the belief function of the modulation process. Assuming AC holds, we
show that (i) when $K=0$, the value of the optimal base stock level is constant
within regions of the belief space and that each region can be described by two
linear inequalities and (ii) when $K>0$, the values of $s$ and $S$ and upper
and lower bounds on these values are constant within regions of the belief
space and that these regions can be described by a finite set of linear
inequalities. A heuristic and bounds for the $K=0$ case are presented when AC
does not hold. Special cases of this inventory control problem include problems
considered in the Markov-modulated demand and Bayesian updating literatures.
|
math.OC
|
we consider a periodic review inventory control problem having an underlying modulation process that affects demand and that is partially observed by the uncensored demand process and a novel additional observation data aod process we present an attainability condition ac that guarantees the existence of an optimal myopic base stock policy if the reorder cost k0 and the existence of an optimal s s policy if k0 where both policies depend on the belief function of the modulation process assuming ac holds we show that i when k0 the value of the optimal base stock level is constant within regions of the belief space and that each region can be described by two linear inequalities and ii when k0 the values of s and s and upper and lower bounds on these values are constant within regions of the belief space and that these regions can be described by a finite set of linear inequalities a heuristic and bounds for the k0 case are presented when ac does not hold special cases of this inventory control problem include problems considered in the markovmodulated demand and bayesian updating literatures
|
[['we', 'consider', 'a', 'periodic', 'review', 'inventory', 'control', 'problem', 'having', 'an', 'underlying', 'modulation', 'process', 'that', 'affects', 'demand', 'and', 'that', 'is', 'partially', 'observed', 'by', 'the', 'uncensored', 'demand', 'process', 'and', 'a', 'novel', 'additional', 'observation', 'data', 'aod', 'process', 'we', 'present', 'an', 'attainability', 'condition', 'ac', 'that', 'guarantees', 'the', 'existence', 'of', 'an', 'optimal', 'myopic', 'base', 'stock', 'policy', 'if', 'the', 'reorder', 'cost', 'k0', 'and', 'the', 'existence', 'of', 'an', 'optimal', 's', 's', 'policy', 'if', 'k0', 'where', 'both', 'policies', 'depend', 'on', 'the', 'belief', 'function', 'of', 'the', 'modulation', 'process', 'assuming', 'ac', 'holds', 'we', 'show', 'that', 'i', 'when', 'k0', 'the', 'value', 'of', 'the', 'optimal', 'base', 'stock', 'level', 'is', 'constant', 'within', 'regions', 'of', 'the', 'belief', 'space', 'and', 'that', 'each', 'region', 'can', 'be', 'described', 'by', 'two', 'linear', 'inequalities', 'and', 'ii', 'when', 'k0', 'the', 'values', 'of', 's', 'and', 's', 'and', 'upper', 'and', 'lower', 'bounds', 'on', 'these', 'values', 'are', 'constant', 'within', 'regions', 'of', 'the', 'belief', 'space', 'and', 'that', 'these', 'regions', 'can', 'be', 'described', 'by', 'a', 'finite', 'set', 'of', 'linear', 'inequalities', 'a', 'heuristic', 'and', 'bounds', 'for', 'the', 'k0', 'case', 'are', 'presented', 'when', 'ac', 'does', 'not', 'hold', 'special', 'cases', 'of', 'this', 'inventory', 'control', 'problem', 'include', 'problems', 'considered', 'in', 'the', 'markovmodulated', 'demand', 'and', 'bayesian', 'updating', 'literatures']]
|
[-0.13841753912732957, 0.12023839917550348, -0.04131599033419835, 0.05628217596696483, -0.08567914761791125, -0.17337075367252877, 0.1421490981085028, 0.37986924340007233, -0.283807414546708, -0.25872212494853536, 0.14880171321775823, -0.24770385968533562, -0.13276237693052997, 0.18956110089214795, -0.07287355847152054, 0.034607393489537536, 0.04317976712209589, 0.04997947361776011, -0.029980723605865237, -0.2615339096221934, 0.3124839524475937, 0.02003607102620237, 0.27966728474588154, 0.035816147527162064, 0.08234935683171027, 0.024727863772336316, 0.0057640204050062975, 0.034205177208498735, -0.16154074809441846, 0.08383953503854424, 0.26864054104055657, 0.1663704057926302, 0.28551252749550377, -0.4038445760416699, -0.18522734809146718, 0.14776544694967092, 0.0972934795018444, 0.04459795586150536, -0.007046714153864045, -0.24283926521720206, 0.10305789037622472, -0.11632512517377457, -0.0807706425808608, -0.04345482443038255, 0.028570446081736936, 0.03353082213644929, -0.35595808190323336, 0.05769109570153771, 0.08882164912830241, 0.02597088125231552, -0.1062200665634938, -0.14188122769887063, -0.018512476283928103, 0.1029634578907404, 0.04886573574263008, 0.0073255891721272105, 0.11607279315680027, -0.11048455013611176, -0.1389997678145053, 0.34020548624090574, -0.08019149434217747, -0.22367757663348728, 0.08416200485829749, -0.1378203586506796, -0.1158908386318449, 0.11194427930712798, 0.17708683198694378, 0.1250963568652762, -0.14780909036763912, 0.12183975690315996, -0.08168268733301219, 0.15742432877441195, 0.059904478934960086, 0.019776668741387574, 0.14544430096693178, 0.1216142068913038, 0.14300059847920102, 0.0974646421691819, -0.06416090888942176, -0.11033466395406806, -0.3335773907799987, -0.10930582759016381, -0.14939986441923464, 0.01412767732890256, -0.13004804895040542, -0.13513686040669007, 0.3177547776288888, 0.10405290200612805, 0.1957695209148756, 0.07573081914984443, 0.2617094953361146, 0.16601976569925567, -0.029800684827855452, 0.14948884416569738, 0.212916445213697, 0.07277105161994497, 0.08353620000243028, -0.20609686267438365, 0.13938610783797947, 0.03360907712634256]
|
1,803.06743
|
Raising the superconducting $T_\mathrm{c}$ of gallium: in-situ
characterization of the transformation of $\alpha$-Ga into $\beta$-Ga
|
Gallium (Ga) displays several metastable phases. Superconductivity is
strongly enhanced in the metastable $\mathrm{\beta}$-Ga with a critical
temperature $T_\mathrm{c}= 6.04(5)\,\mathrm{K}$, while stable
$\mathrm{\alpha}$-Ga has a much lower $T_\mathrm{c}<1.2\,\mathrm{K}$. Here we
use a membrane-based nanocalorimeter to initiate the transition from
$\mathrm{\alpha}$-Ga to $\mathrm{\beta}$-Ga on demand, as well as study the
specific heat of the two phases on one and the same sample. The in-situ
transformation is initiated by bringing the temperature to about
$10\,\mathrm{K}$ above the melting temperature of $\mathrm{\alpha}$-Ga. After
such treatment, the liquid supercools down to $232\,\mathrm{K}$, where
$\mathrm{\beta}$-Ga solidifies. We find that $\mathrm{\beta}$-Ga is a
strong-coupling type-I superconductor with $\Delta(0)/k_\mathrm{B}T_\mathrm{c}
=2.00(5)$ and a Sommerfeld coefficient $\gamma_\mathrm{n} =
1.53(4)\,\mathrm{mJ/molK^2}$, 2.55 times higher than that in the $\alpha$
phase. The results allow a detailed comparison of fundamental thermodynamic
properties between the two phases.
|
cond-mat.supr-con
|
gallium ga displays several metastable phases superconductivity is strongly enhanced in the metastable mathrmbetaga with a critical temperature t_mathrmc 6045mathrmk while stable mathrmalphaga has a much lower t_mathrmc12mathrmk here we use a membranebased nanocalorimeter to initiate the transition from mathrmalphaga to mathrmbetaga on demand as well as study the specific heat of the two phases on one and the same sample the insitu transformation is initiated by bringing the temperature to about 10mathrmk above the melting temperature of mathrmalphaga after such treatment the liquid supercools down to 232mathrmk where mathrmbetaga solidifies we find that mathrmbetaga is a strongcoupling typei superconductor with delta0k_mathrmbt_mathrmc 2005 and a sommerfeld coefficient gamma_mathrmn 1534mathrmmjmolk2 255 times higher than that in the alpha phase the results allow a detailed comparison of fundamental thermodynamic properties between the two phases
|
[['gallium', 'ga', 'displays', 'several', 'metastable', 'phases', 'superconductivity', 'is', 'strongly', 'enhanced', 'in', 'the', 'metastable', 'mathrmbetaga', 'with', 'a', 'critical', 'temperature', 't_mathrmc', '6045mathrmk', 'while', 'stable', 'mathrmalphaga', 'has', 'a', 'much', 'lower', 't_mathrmc12mathrmk', 'here', 'we', 'use', 'a', 'membranebased', 'nanocalorimeter', 'to', 'initiate', 'the', 'transition', 'from', 'mathrmalphaga', 'to', 'mathrmbetaga', 'on', 'demand', 'as', 'well', 'as', 'study', 'the', 'specific', 'heat', 'of', 'the', 'two', 'phases', 'on', 'one', 'and', 'the', 'same', 'sample', 'the', 'insitu', 'transformation', 'is', 'initiated', 'by', 'bringing', 'the', 'temperature', 'to', 'about', '10mathrmk', 'above', 'the', 'melting', 'temperature', 'of', 'mathrmalphaga', 'after', 'such', 'treatment', 'the', 'liquid', 'supercools', 'down', 'to', '232mathrmk', 'where', 'mathrmbetaga', 'solidifies', 'we', 'find', 'that', 'mathrmbetaga', 'is', 'a', 'strongcoupling', 'typei', 'superconductor', 'with', 'delta0k_mathrmbt_mathrmc', '2005', 'and', 'a', 'sommerfeld', 'coefficient', 'gamma_mathrmn', '1534mathrmmjmolk2', '255', 'times', 'higher', 'than', 'that', 'in', 'the', 'alpha', 'phase', 'the', 'results', 'allow', 'a', 'detailed', 'comparison', 'of', 'fundamental', 'thermodynamic', 'properties', 'between', 'the', 'two', 'phases']]
|
[-0.08795734599143976, 0.22115773841783049, -0.0643519263766292, 0.006564029731736001, -0.024786475212461065, -0.12911301545266593, 0.15179569591196518, 0.3401393358048702, -0.20705734773553788, -0.283155593281937, 0.10604816592217142, -0.31848190789894454, -0.08153653613546685, 0.18066373491098012, 0.016209665449365737, 0.010159280835761734, -0.0626417635247067, 0.026310225665968443, -0.13910585000283188, -0.19779979850771645, 0.26513671542939155, 0.04496067113036083, 0.29802949763169245, 0.07683163590078788, 0.04079275427474862, -0.049955625047755706, 0.08880183001654962, 0.011935154386308221, -0.18053293815088212, 0.01636343271913199, 0.21566643608394004, -0.004172179818389908, 0.21205798227576508, -0.3962408732028659, -0.22771260751751327, 0.06586411811382739, 0.09293002419779817, 0.09462622399922342, -0.05930864035765389, -0.227724559479467, 0.05130813377336525, -0.12189290385013299, -0.10731698503895175, -0.06471225001968421, 0.0008190921286032314, -0.03535416258738325, -0.22709403350479931, 0.10445789692401752, 0.0456569302274609, 0.06996163860192552, -0.055054534928843615, -0.1162520073546422, -0.06095428516282626, 0.055726861991431745, 0.051250651735620247, 0.0463073291069281, 0.1401875596031517, -0.1243032643290621, -0.05664446907457969, 0.3626982193321936, -0.06928135954097213, -0.02594232338938921, 0.223478127901058, -0.15658205435904657, -0.1110594802284761, 0.1721642358461395, 0.09865252433219067, 0.1097821182430914, -0.131117749441829, 0.026943526242763572, -0.0007618449347478057, 0.18680004572998438, 0.05303297669900256, 0.015151285292905948, 0.21862729651010818, 0.2200048268247869, 0.043749268384768614, 0.1660930267886244, -0.08366348772930603, -0.0788190991835787, -0.23571233792851368, -0.19437102303056727, -0.1336792160716233, 0.07610996553142156, -0.08199345162263073, -0.1599904630094811, 0.3750111577673889, 0.1370692869773299, 0.21433134915100205, -0.022251515497734384, 0.21858183656068933, 0.09764415471230649, 0.04866124885221426, 0.04253356257593998, 0.24742416460214864, 0.14241752641401179, 0.12970686421751798, -0.2605228189264409, 0.05212080952829667, 0.04753010200395707]
|
1,803.06744
|
Fast Neural Architecture Construction using EnvelopeNets
|
Fast Neural Architecture Construction (NAC) is a method to construct deep
network architectures by pruning and expansion of a base network. In recent
years, several automated search methods for neural network architectures have
been proposed using methods such as evolutionary algorithms and reinforcement
learning. These methods use a single scalar objective function (usually
accuracy) that is evaluated after a full training and evaluation cycle. In
contrast NAC directly compares the utility of different filters using
statistics derived from filter featuremaps reach a state where the utility of
different filters within a network can be compared and hence can be used to
construct networks. The training epochs needed for filters within a network to
reach this state is much less than the training epochs needed for the accuracy
of a network to stabilize. NAC exploits this finding to construct convolutional
neural nets (CNNs) with close to state of the art accuracy, in < 1 GPU day,
faster than most of the current neural architecture search methods. The
constructed networks show close to state of the art performance on the image
classification problem on well known datasets (CIFAR-10, ImageNet) and
consistently show better performance than hand constructed and randomly
generated networks of the same depth, operators and approximately the same
number of parameters.
|
cs.NE cs.CV
|
fast neural architecture construction nac is a method to construct deep network architectures by pruning and expansion of a base network in recent years several automated search methods for neural network architectures have been proposed using methods such as evolutionary algorithms and reinforcement learning these methods use a single scalar objective function usually accuracy that is evaluated after a full training and evaluation cycle in contrast nac directly compares the utility of different filters using statistics derived from filter featuremaps reach a state where the utility of different filters within a network can be compared and hence can be used to construct networks the training epochs needed for filters within a network to reach this state is much less than the training epochs needed for the accuracy of a network to stabilize nac exploits this finding to construct convolutional neural nets cnns with close to state of the art accuracy in 1 gpu day faster than most of the current neural architecture search methods the constructed networks show close to state of the art performance on the image classification problem on well known datasets cifar10 imagenet and consistently show better performance than hand constructed and randomly generated networks of the same depth operators and approximately the same number of parameters
|
[['fast', 'neural', 'architecture', 'construction', 'nac', 'is', 'a', 'method', 'to', 'construct', 'deep', 'network', 'architectures', 'by', 'pruning', 'and', 'expansion', 'of', 'a', 'base', 'network', 'in', 'recent', 'years', 'several', 'automated', 'search', 'methods', 'for', 'neural', 'network', 'architectures', 'have', 'been', 'proposed', 'using', 'methods', 'such', 'as', 'evolutionary', 'algorithms', 'and', 'reinforcement', 'learning', 'these', 'methods', 'use', 'a', 'single', 'scalar', 'objective', 'function', 'usually', 'accuracy', 'that', 'is', 'evaluated', 'after', 'a', 'full', 'training', 'and', 'evaluation', 'cycle', 'in', 'contrast', 'nac', 'directly', 'compares', 'the', 'utility', 'of', 'different', 'filters', 'using', 'statistics', 'derived', 'from', 'filter', 'featuremaps', 'reach', 'a', 'state', 'where', 'the', 'utility', 'of', 'different', 'filters', 'within', 'a', 'network', 'can', 'be', 'compared', 'and', 'hence', 'can', 'be', 'used', 'to', 'construct', 'networks', 'the', 'training', 'epochs', 'needed', 'for', 'filters', 'within', 'a', 'network', 'to', 'reach', 'this', 'state', 'is', 'much', 'less', 'than', 'the', 'training', 'epochs', 'needed', 'for', 'the', 'accuracy', 'of', 'a', 'network', 'to', 'stabilize', 'nac', 'exploits', 'this', 'finding', 'to', 'construct', 'convolutional', 'neural', 'nets', 'cnns', 'with', 'close', 'to', 'state', 'of', 'the', 'art', 'accuracy', 'in', '1', 'gpu', 'day', 'faster', 'than', 'most', 'of', 'the', 'current', 'neural', 'architecture', 'search', 'methods', 'the', 'constructed', 'networks', 'show', 'close', 'to', 'state', 'of', 'the', 'art', 'performance', 'on', 'the', 'image', 'classification', 'problem', 'on', 'well', 'known', 'datasets', 'cifar10', 'imagenet', 'and', 'consistently', 'show', 'better', 'performance', 'than', 'hand', 'constructed', 'and', 'randomly', 'generated', 'networks', 'of', 'the', 'same', 'depth', 'operators', 'and', 'approximately', 'the', 'same', 'number', 'of', 'parameters']]
|
[-0.03097243725039464, -0.02145746041843224, -0.048078537231222504, 0.059281951772780825, -0.05883567854872949, -0.17488536551328643, 0.0301915996397535, 0.4616422143276958, -0.24942625894798853, -0.34654711688026074, 0.09706676173567151, -0.2291414071295765, -0.1820563605753705, 0.21564498394062476, -0.08983732704294935, 0.10179245578224903, 0.1677784062195791, 0.06645185410577271, -0.1110395714496484, -0.33135157320648434, 0.26587049030211, 0.05391257387638602, 0.3369043944403529, -0.04821624781027259, 0.13357996735888134, -0.06628999226017013, 0.004408516075706021, 0.0037794062019591884, -0.0475637842814086, 0.15414044476901403, 0.27769647740448516, 0.18919536752870217, 0.31908109368135534, -0.42516818891855934, -0.23702555241914178, 0.11669582778732071, 0.14952005612708275, 0.11660036173977589, 0.04189710746009258, -0.3221002256874705, 0.10531425880756051, -0.18049530282040083, 0.005183841951102728, -0.12990585329243914, -0.03485741000179024, 0.021601737528995035, -0.2962004460799064, 0.0014444383537574183, 0.01582981480695751, 0.036931450676084276, -0.026908653516632814, -0.1640422448249107, -0.013962698500559088, 0.14194623036088333, -0.01954786167590923, 0.09788172042906462, 0.12791267970488185, -0.21239220188442795, -0.16937174861668608, 0.31758861162123225, -0.0875106691093866, -0.17201224357954092, 0.189341691541042, -0.015366880309634975, -0.11137400193672095, 0.12531834650130588, 0.23379399539193227, 0.13759774367014568, -0.1450046873529486, -0.01543949976801828, -0.0002558664817895208, 0.20529540982540875, 0.053420455503233134, 0.010659698000000346, 0.14948258876268353, 0.2980935216748289, 0.05466321980514165, 0.13299210741561615, -0.1308124862877386, -0.08781344464348097, -0.19190696123100462, -0.085426669822967, -0.22100467583541536, -0.007433937616380198, -0.10493930970447504, -0.13316185392905028, 0.42960708716085977, 0.22983286716930923, 0.21159444717424256, 0.15059310568585282, 0.3470828815662701, 0.03559816409113063, 0.1737070172143701, 0.13969428827431762, 0.2295650759368159, 0.050110889042151115, 0.12657381477100507, -0.14755473261632557, 0.0698454963126486, 0.07421200631458001]
|
1,803.06745
|
Sentiment Analysis of Code-Mixed Indian Languages: An Overview of
SAIL_Code-Mixed Shared Task @ICON-2017
|
Sentiment analysis is essential in many real-world applications such as
stance detection, review analysis, recommendation system, and so on. Sentiment
analysis becomes more difficult when the data is noisy and collected from
social media. India is a multilingual country; people use more than one
languages to communicate within themselves. The switching in between the
languages is called code-switching or code-mixing, depending upon the type of
mixing. This paper presents overview of the shared task on sentiment analysis
of code-mixed data pairs of Hindi-English and Bengali-English collected from
the different social media platform. The paper describes the task, dataset,
evaluation, baseline and participant's systems.
|
cs.CL
|
sentiment analysis is essential in many realworld applications such as stance detection review analysis recommendation system and so on sentiment analysis becomes more difficult when the data is noisy and collected from social media india is a multilingual country people use more than one languages to communicate within themselves the switching in between the languages is called codeswitching or codemixing depending upon the type of mixing this paper presents overview of the shared task on sentiment analysis of codemixed data pairs of hindienglish and bengalienglish collected from the different social media platform the paper describes the task dataset evaluation baseline and participants systems
|
[['sentiment', 'analysis', 'is', 'essential', 'in', 'many', 'realworld', 'applications', 'such', 'as', 'stance', 'detection', 'review', 'analysis', 'recommendation', 'system', 'and', 'so', 'on', 'sentiment', 'analysis', 'becomes', 'more', 'difficult', 'when', 'the', 'data', 'is', 'noisy', 'and', 'collected', 'from', 'social', 'media', 'india', 'is', 'a', 'multilingual', 'country', 'people', 'use', 'more', 'than', 'one', 'languages', 'to', 'communicate', 'within', 'themselves', 'the', 'switching', 'in', 'between', 'the', 'languages', 'is', 'called', 'codeswitching', 'or', 'codemixing', 'depending', 'upon', 'the', 'type', 'of', 'mixing', 'this', 'paper', 'presents', 'overview', 'of', 'the', 'shared', 'task', 'on', 'sentiment', 'analysis', 'of', 'codemixed', 'data', 'pairs', 'of', 'hindienglish', 'and', 'bengalienglish', 'collected', 'from', 'the', 'different', 'social', 'media', 'platform', 'the', 'paper', 'describes', 'the', 'task', 'dataset', 'evaluation', 'baseline', 'and', 'participants', 'systems']]
|
[-0.10439182354761198, 0.015284523738602411, -0.037325496007733557, 0.08196450150413528, -0.18200628021822393, -0.17482522026481992, 0.056663924206536515, 0.40977859547705325, -0.21666531523834298, -0.33282966696593946, 0.09333904230180513, -0.4142330149459897, -0.18036536318792518, 0.23067171646291118, -0.08850627223671713, -0.0042365638197860815, 0.1550080494195657, 0.08829162921530456, 0.020383775568775183, -0.24475180023141857, 0.3445487728034987, -0.00017240518722140674, 0.4088163877231548, 0.046904273742574804, 0.06034170032379407, 0.007692658823905784, -0.12846145020273414, -0.05805151659466362, -0.027423545089776364, 0.17360547825567496, 0.3922815721084192, 0.2524256892502308, 0.34113095834109824, -0.37700968510606914, -0.14146992132108369, 0.06517496621869143, 0.14181825257295255, 0.08922370631265843, 0.01744260707755971, -0.3906886154894256, 0.031240232153207932, -0.2157504335678752, 0.041987167074553015, -0.07708328254340054, 0.05519189285250037, -0.026536681164887922, -0.21624847924680385, 0.054374582785208826, 0.04261902084990034, 0.19790897328515075, -0.009841500722703714, -0.09757814725784096, 0.0295366884109754, 0.20482776708391187, 0.1126782966877144, -0.011849094376655168, 0.15870530595064833, -0.1698589231118162, -0.14614812867010682, 0.41551457778595896, -0.028346837390450425, -0.1494654612107094, 0.23665446117384703, -0.04216152869133297, -0.17799639439626228, 0.010695038171195723, 0.3034955283391823, 0.09718996312161818, -0.22109520031906127, -0.018455666618747184, -0.08095452829616741, 0.2716026017080667, 0.09404309932368546, -0.03331643583488117, 0.17049545069559685, 0.3142207929733417, 0.030222222707980285, 0.1062446489994577, -0.03159289105509372, -0.07047017263158144, -0.18657147057820112, -0.12435051046076764, -0.14821959559543474, 0.013990333491429975, -0.06967130992324228, -0.12778006547392862, 0.3941739454200871, 0.20121695478311152, 0.12111882336360845, 0.03538850463646491, 0.30838106154889156, -0.026080522954111323, 0.057231101117015466, 0.08922492367502537, 0.0991204154654519, -0.04904892935770229, 0.2563878084957889, -0.12550184476975967, 0.13966043466855818, -0.01603366812528337]
|
1,803.06746
|
Experimental Verification of Rate Flexibility and Probabilistic Shaping
by 4D Signaling
|
The rate flexibility and probabilistic shaping gain of $4$-dimensional
signaling is experimentally tested for short-reach, unrepeated transmission. A
rate granularity of 0.5 bits/QAM symbol is achieved with a distribution matcher
based on a simple look-up table.
|
cs.IT math.IT
|
the rate flexibility and probabilistic shaping gain of 4dimensional signaling is experimentally tested for shortreach unrepeated transmission a rate granularity of 05 bitsqam symbol is achieved with a distribution matcher based on a simple lookup table
|
[['the', 'rate', 'flexibility', 'and', 'probabilistic', 'shaping', 'gain', 'of', '4dimensional', 'signaling', 'is', 'experimentally', 'tested', 'for', 'shortreach', 'unrepeated', 'transmission', 'a', 'rate', 'granularity', 'of', '05', 'bitsqam', 'symbol', 'is', 'achieved', 'with', 'a', 'distribution', 'matcher', 'based', 'on', 'a', 'simple', 'lookup', 'table']]
|
[-0.1947574198246002, 0.06027818439262254, -0.06226992090897901, 0.027168006895642194, -0.07000543653432811, -0.24222358173823783, 0.13657250811478922, 0.4338025855166571, -0.24879922568798066, -0.2599536078849009, 0.08364290121410574, -0.19080831355282238, -0.12433520137731519, 0.21571293265691827, -0.10973147787153721, 0.0885492314185415, 0.057792772357684694, 0.07180456914938986, -0.055880707475755895, -0.2600133874320558, 0.2328734082835061, 0.18492542119430644, 0.36899373403617314, 0.04198371786624193, 0.19708897061645986, 0.008598345212106194, -0.025591598078608512, -0.08618364576250315, -0.08995094916650227, 0.1441673567784684, 0.23713401377733265, 0.16970738864370755, 0.21313079776508467, -0.3474099196759718, -0.2471315593325666, 0.05190049782395363, 0.14987020980832833, 0.04314663841256074, -0.13192810787752804, -0.2035649660974741, 0.1570695782612477, -0.2514098115797554, -0.07461668588221074, -0.029552289976605348, -0.012619996097471033, 0.024150066317192145, -0.33288354139242854, 0.03513752456222262, -0.003218703025153705, 0.128544434266431, 0.011093580842550311, -0.09114634533013616, 0.007968925232333796, 0.09757191892048078, -0.10360113177448511, 0.025732614286243915, 0.13414258265069554, -0.07693752428250654, -0.1579333155016814, 0.3573393498414329, -0.03207203367991107, -0.25310639065823387, 0.07126488851250283, -0.06532717728987336, -0.02173790391534567, 0.1912918796496732, 0.1802194235580308, 0.07302039427948849, -0.14831609130279894, -0.006005088401226593, -0.0037077721740518296, 0.3063966780900955, 0.1535603744376983, 0.06401249548154218, 0.15908120942435094, 0.2689829348985638, 0.010267401779336589, 0.10314062487866198, -0.1387661807438625, -0.11014243912816579, -0.1975675962565999, -0.14826236071863344, -0.20015273349625723, 0.016791648683803423, -0.13993360817923012, -0.10627601274422237, 0.3935791196567672, 0.04736957640520164, 0.1887508283502289, 0.14973028610859598, 0.3256955627884184, 0.10766564421605186, 0.07392181325703859, 0.05215998060469117, 0.14635089699212195, 0.05655102556837457, 0.08062318809596555, -0.18704071436077357, 0.1538632456479328, 0.06376770862511226]
|
1,803.06747
|
Quantum effects near the Cauchy horizon of a Reissner-Nordstrom black
hole
|
We consider a massless, minimally-coupled quantum scalar field on a
Reissner-Nordstrom black hole background, and we study the leading asymptotic
behavior of the expectation value of the stress energy tensor operator
$\langle\hat{T}_{\mu\nu}\rangle_{ren}$ and of
$\langle\hat{\Phi}^{2}\rangle_{ren}$ near the inner horizon, in both the Unruh
and the Hartle-Hawking quantum states. We find that the coefficients of the
expected leading-order divergences of these expectation values vanish,
indicating that the modifications of the classical geometry due to quantum
vacuum effects might be weaker than expected. In addition, we calculate the
leading-order divergences of $\langle\hat{T}_{\mu\nu}\rangle_{ren}$ and of
$\langle\hat{\Phi}^{2}\rangle_{ren}$ in the Boulware state near the outer
(event) horizon, and we obtain analytical expressions that correspond to
previous numerical results.
|
gr-qc hep-th
|
we consider a massless minimallycoupled quantum scalar field on a reissnernordstrom black hole background and we study the leading asymptotic behavior of the expectation value of the stress energy tensor operator langlehatt_munurangle_ren and of langlehatphi2rangle_ren near the inner horizon in both the unruh and the hartlehawking quantum states we find that the coefficients of the expected leadingorder divergences of these expectation values vanish indicating that the modifications of the classical geometry due to quantum vacuum effects might be weaker than expected in addition we calculate the leadingorder divergences of langlehatt_munurangle_ren and of langlehatphi2rangle_ren in the boulware state near the outer event horizon and we obtain analytical expressions that correspond to previous numerical results
|
[['we', 'consider', 'a', 'massless', 'minimallycoupled', 'quantum', 'scalar', 'field', 'on', 'a', 'reissnernordstrom', 'black', 'hole', 'background', 'and', 'we', 'study', 'the', 'leading', 'asymptotic', 'behavior', 'of', 'the', 'expectation', 'value', 'of', 'the', 'stress', 'energy', 'tensor', 'operator', 'langlehatt_munurangle_ren', 'and', 'of', 'langlehatphi2rangle_ren', 'near', 'the', 'inner', 'horizon', 'in', 'both', 'the', 'unruh', 'and', 'the', 'hartlehawking', 'quantum', 'states', 'we', 'find', 'that', 'the', 'coefficients', 'of', 'the', 'expected', 'leadingorder', 'divergences', 'of', 'these', 'expectation', 'values', 'vanish', 'indicating', 'that', 'the', 'modifications', 'of', 'the', 'classical', 'geometry', 'due', 'to', 'quantum', 'vacuum', 'effects', 'might', 'be', 'weaker', 'than', 'expected', 'in', 'addition', 'we', 'calculate', 'the', 'leadingorder', 'divergences', 'of', 'langlehatt_munurangle_ren', 'and', 'of', 'langlehatphi2rangle_ren', 'in', 'the', 'boulware', 'state', 'near', 'the', 'outer', 'event', 'horizon', 'and', 'we', 'obtain', 'analytical', 'expressions', 'that', 'correspond', 'to', 'previous', 'numerical', 'results']]
|
[-0.13959089387627738, 0.1494426623003574, -0.12016306039331867, 0.11683669392657173, -0.04203768562827561, -0.0725132783807747, -0.019135069250976584, 0.28871975654551574, -0.1519148105625399, -0.25032933378541794, 0.07401210688650273, -0.329678590904485, -0.1327893952251756, 0.15222978637646045, -0.0332459064099837, 0.05652967610027796, 0.016287674274723475, 0.09835424004877741, -0.13362182957237703, -0.19637848505423078, 0.3599173478522078, 0.09893886737739416, 0.2533839497262159, 0.0733651313846847, 0.07931068970461015, 0.010146321420482284, 0.02249512728303671, 0.04396627306401193, -0.176025076453542, 0.06254229917943997, 0.20865863661055226, 0.06108137418994227, 0.1935280031684014, -0.4429566283282396, -0.16891282149968115, 0.11014959316381866, 0.1204590910944987, 0.1650007110182668, -0.013677892330740285, -0.27434239211609707, 0.06651629466402999, -0.1966138082023643, -0.16660215001687542, -0.04738069485992546, -0.021794895619481197, -0.09346446969235937, -0.25200681447110196, 0.13957547235327797, 0.04221145706544924, -0.0547251935611974, -0.1162279461183258, -0.11055259163248109, -0.024473942121960694, 0.08922066070508582, 0.14251594041025284, -0.002602611658968837, 0.1848971471861676, -0.1815402990056051, -0.1294986792003132, 0.305132045083352, -0.11291400953848858, -0.16568755940743932, 0.11923189919865648, -0.24270955552053344, -0.03157327407215898, 0.11203252532527791, 0.1520745740733571, 0.17658549400732373, -0.11010612513416924, 0.1587623517497795, 0.023176070751605538, 0.091070633692046, 0.09831121590340862, 0.10947933425992593, 0.2577096326444466, -0.02230362250964652, 0.03031256648938398, 0.18950535522392103, -0.0620472058297244, -0.1763532406205798, -0.40874485849394454, -0.17060384909236417, -0.13995377926642563, 0.09941183717350836, -0.15666246378460275, -0.21249107635571612, 0.34135018077653806, 0.17737545528782633, 0.19019858343663062, 0.059372597747390066, 0.25308892152666507, 0.16711267036478128, 0.03693191003188625, 0.1357693724535607, 0.3537266400751767, 0.11726531786592426, 0.0967889978248324, -0.30951740522239657, -0.014186480061595773, 0.06729427209912657]
|
1,803.06748
|
Optically resolving the dynamic walking of a plasmonic walker couple
|
Deterministic placement and dynamic manipulation of individual plasmonic
nanoparticles with nanoscale precision feature an important step towards active
nanoplasmonic devices with prescribed levels of performance and functionalities
at optical frequencies. In this Letter, we demonstrate a plasmonic walker
couple system, in which two gold nanorod walkers can independently or
simultaneously perform stepwise walking powered by DNA hybridization along the
same DNA origami track. We utilize optical spectroscopy to resolve such dynamic
walking with nanoscale steps well below the optical diffraction limit. We also
show that the number of walkers and the optical response of the system can be
correlated. Our studies exemplify the power of plasmonics, when integrated with
DNA nanotechnology for realization of advanced artificial nanomachinery with
tailored optical functionalities.
|
physics.bio-ph
|
deterministic placement and dynamic manipulation of individual plasmonic nanoparticles with nanoscale precision feature an important step towards active nanoplasmonic devices with prescribed levels of performance and functionalities at optical frequencies in this letter we demonstrate a plasmonic walker couple system in which two gold nanorod walkers can independently or simultaneously perform stepwise walking powered by dna hybridization along the same dna origami track we utilize optical spectroscopy to resolve such dynamic walking with nanoscale steps well below the optical diffraction limit we also show that the number of walkers and the optical response of the system can be correlated our studies exemplify the power of plasmonics when integrated with dna nanotechnology for realization of advanced artificial nanomachinery with tailored optical functionalities
|
[['deterministic', 'placement', 'and', 'dynamic', 'manipulation', 'of', 'individual', 'plasmonic', 'nanoparticles', 'with', 'nanoscale', 'precision', 'feature', 'an', 'important', 'step', 'towards', 'active', 'nanoplasmonic', 'devices', 'with', 'prescribed', 'levels', 'of', 'performance', 'and', 'functionalities', 'at', 'optical', 'frequencies', 'in', 'this', 'letter', 'we', 'demonstrate', 'a', 'plasmonic', 'walker', 'couple', 'system', 'in', 'which', 'two', 'gold', 'nanorod', 'walkers', 'can', 'independently', 'or', 'simultaneously', 'perform', 'stepwise', 'walking', 'powered', 'by', 'dna', 'hybridization', 'along', 'the', 'same', 'dna', 'origami', 'track', 'we', 'utilize', 'optical', 'spectroscopy', 'to', 'resolve', 'such', 'dynamic', 'walking', 'with', 'nanoscale', 'steps', 'well', 'below', 'the', 'optical', 'diffraction', 'limit', 'we', 'also', 'show', 'that', 'the', 'number', 'of', 'walkers', 'and', 'the', 'optical', 'response', 'of', 'the', 'system', 'can', 'be', 'correlated', 'our', 'studies', 'exemplify', 'the', 'power', 'of', 'plasmonics', 'when', 'integrated', 'with', 'dna', 'nanotechnology', 'for', 'realization', 'of', 'advanced', 'artificial', 'nanomachinery', 'with', 'tailored', 'optical', 'functionalities']]
|
[-0.11745876733459963, 0.1744386986635716, -0.009335271148241994, -0.06285821536097921, -0.05758181543759078, -0.23776601079066306, 0.06810281793432972, 0.497585441209068, -0.2748020387000658, -0.33599626451484427, 0.029592345705379015, -0.2724355417842523, -0.20294996464051585, 0.19890741872878298, -0.03812755130502034, 0.10686441791082217, 0.03687690336171592, -0.048189542683472565, 0.050656767556259086, -0.15629898934540423, 0.19063550485528943, 0.06582778694073492, 0.3194736445876808, 0.034009124233179595, 0.10879524998089746, 0.0380058349571999, 0.03308145352639258, 0.0006847401392022686, -0.09518175710923248, 0.16616403635914537, 0.2897449096025945, 0.006766344574549474, 0.26308915645561437, -0.49559944700295766, -0.2273792112361609, 0.04528695401990082, 0.20895964114287915, 0.17037039615256203, -0.08370514921767037, -0.2670436413373706, 0.0510449247484765, -0.08709672921094735, -0.1624287234720041, -0.06741576692597433, -0.02976666562921129, 0.08726854630301452, -0.19998532542160305, -0.011610197986924467, 0.017484547854170265, 0.11456710824450432, -0.054623008586013155, -0.061608757690934476, 0.010751675995266882, 0.12907867254578692, -0.04515039779761545, -0.01605475060199195, 0.24652350747049595, -0.1255172713032408, -0.18704154708014786, 0.35577039212788925, -0.031593304958717885, -0.13685326035950363, 0.1911884318740869, -0.12557796090225543, -0.08197852948388039, 0.11940448270718113, 0.19291573819080907, 0.0942059735467365, -0.1478208360876282, -0.006823523231293267, 0.04868352640283579, 0.21010960638523102, 0.10479820573563911, 0.11929023893904095, 0.2818865597359682, 0.24236234431135784, 0.03555139157322643, 0.15349448819871808, -0.11263353795136426, -0.03379311859954056, -0.2027110848587857, -0.1655886389723063, -0.20107775300833558, 0.05414494246144371, -0.0945700063705223, -0.1556749241311134, 0.39406463039132394, 0.14926637305824225, 0.164230023387604, 0.032029476648866205, 0.3249619259067988, 0.05120938696248133, 0.09101255331958129, -0.012518822246285017, 0.2470404070471067, 0.06949891071681949, 0.12156630264333457, -0.2838749555901678, 0.012106174155723397, -0.018086365610745943]
|
1,803.06749
|
Shape transitions in two-body systems: two-electron quantum dots in a
magnetic field
|
We present a thorough analysis of the electron density distribution (shape)
of two electrons, confined in the three-dimensional harmonic oscillator
potential, as a function of the perpendicular magnetic field.Explicit algebraic
expressions are derived in terms of the system's parameters and the magnetic
field strength to trace the shape transformations in the ground and low-lying
excited states. We found that the interplay of the classical and quantum
properties lead to a quantum shape transition from a lateral to a vertical
localization of electrons in low-lying excited states at relatively strong
Coulomb interaction with alteration of the magnetic field. In contrast, in that
regime in the ground states the electrons form always a ring type distribution
in the lateral plane. The analytical results demonstrate a good agreement with
quantum numerical results near the transition point and at high magnetic field.
|
cond-mat.mes-hall
|
we present a thorough analysis of the electron density distribution shape of two electrons confined in the threedimensional harmonic oscillator potential as a function of the perpendicular magnetic fieldexplicit algebraic expressions are derived in terms of the systems parameters and the magnetic field strength to trace the shape transformations in the ground and lowlying excited states we found that the interplay of the classical and quantum properties lead to a quantum shape transition from a lateral to a vertical localization of electrons in lowlying excited states at relatively strong coulomb interaction with alteration of the magnetic field in contrast in that regime in the ground states the electrons form always a ring type distribution in the lateral plane the analytical results demonstrate a good agreement with quantum numerical results near the transition point and at high magnetic field
|
[['we', 'present', 'a', 'thorough', 'analysis', 'of', 'the', 'electron', 'density', 'distribution', 'shape', 'of', 'two', 'electrons', 'confined', 'in', 'the', 'threedimensional', 'harmonic', 'oscillator', 'potential', 'as', 'a', 'function', 'of', 'the', 'perpendicular', 'magnetic', 'fieldexplicit', 'algebraic', 'expressions', 'are', 'derived', 'in', 'terms', 'of', 'the', 'systems', 'parameters', 'and', 'the', 'magnetic', 'field', 'strength', 'to', 'trace', 'the', 'shape', 'transformations', 'in', 'the', 'ground', 'and', 'lowlying', 'excited', 'states', 'we', 'found', 'that', 'the', 'interplay', 'of', 'the', 'classical', 'and', 'quantum', 'properties', 'lead', 'to', 'a', 'quantum', 'shape', 'transition', 'from', 'a', 'lateral', 'to', 'a', 'vertical', 'localization', 'of', 'electrons', 'in', 'lowlying', 'excited', 'states', 'at', 'relatively', 'strong', 'coulomb', 'interaction', 'with', 'alteration', 'of', 'the', 'magnetic', 'field', 'in', 'contrast', 'in', 'that', 'regime', 'in', 'the', 'ground', 'states', 'the', 'electrons', 'form', 'always', 'a', 'ring', 'type', 'distribution', 'in', 'the', 'lateral', 'plane', 'the', 'analytical', 'results', 'demonstrate', 'a', 'good', 'agreement', 'with', 'quantum', 'numerical', 'results', 'near', 'the', 'transition', 'point', 'and', 'at', 'high', 'magnetic', 'field']]
|
[-0.14588978466489455, 0.1688723484543662, -0.053243177868153926, 0.06308607312843856, 0.032189074516242006, -0.08475105888652106, 0.027392078738278935, 0.36406249417005665, -0.23415971801609453, -0.3009313052234641, -0.009997809689022927, -0.28431867600765326, -0.1258522139005635, 0.17442669722176815, 0.05544267086325771, 0.02555237609186094, 0.043399734273009055, 0.04339703553811695, -0.10233238825139447, -0.11819342269399033, 0.30825947768931844, 0.036756264169047835, 0.29988895287995576, 0.08544512999917034, 0.03996128538609856, -0.008138154616348283, 0.10453535933523392, 0.031139213149945666, -0.1279514289507175, 0.09745354985989915, 0.19460421014130183, -0.03417816762574506, 0.21957924966122547, -0.4652349692871318, -0.18565357065195368, 0.044277451772677855, 0.15878202456532278, 0.15081505978439194, -0.09360846737314722, -0.3038871984820079, 0.020839712276619717, -0.12706001436025122, -0.19616331913963939, -0.06393675866407635, 0.014498544329213128, 0.05594916344300783, -0.27531590868772454, 0.09160086469568421, 0.046259350802776586, 0.09099593924453658, -0.11563258398201888, -0.06778321190087981, -0.04028802276011149, 0.12320247773475347, 0.03583735090605643, 0.06592727301941409, 0.15288409541095913, -0.18658792956461995, -0.08960101095089404, 0.35269357047866295, -0.0791620452867916, -0.17348547367528624, 0.18256389092905514, -0.22261651919774003, -0.07300646358040454, 0.18069573676716671, 0.13925499376589365, 0.09010132728144526, -0.07657041296661987, 0.08940667003209628, -0.01420968564067471, 0.13970526301809313, 0.025604838835089093, 0.06604094359632641, 0.2384831162958141, 0.08362156808729806, 0.02397940497880251, 0.16334634443853785, -0.13371187876774013, -0.11993165252675866, -0.2900733119760552, -0.1489004293884946, -0.21219140318830762, 0.04835781192723118, -0.061071183358703186, -0.20435990914906355, 0.4557222248419157, 0.11189187214884866, 0.20061358985708633, -0.03186202825414167, 0.27573548018742, 0.1282069555468463, 0.024629915778926256, 0.0562410346677622, 0.28974630791748307, 0.21450444543394295, 0.08568566468251991, -0.28099586196196175, 0.007938245277389558, 0.027048519521910886]
|
1,803.0675
|
Determining both the source of a wave and its speed in a medium from
boundary measurements
|
We study the inverse problem of determining both the source of a wave and its
speed inside a medium from measurements of the solution of the wave equation on
the boundary. This problem arises in photoacoustic and thermoacoustic
tomography, and has important applications in medical imaging. We prove that if
the solutions of the wave equation with the source and sound speed $(f_1,c_1)$
and $(f_2,c_2)$ agree on the boundary of a bounded region $\Omega$, then
\[ \int_{\Omega}(c_2^{-2}-c_1^{-2})\varphi dy=0,\] for every harmonic
function $\varphi \in C(\bar{\Omega})$, which holds without any knowledge of
the source. We also show that if the wave speed $c$ is known and only assumed
to be bounded then, under a natural admissibility assumption, the source of the
wave can be uniquely determined from boundary measurements.
|
math.AP
|
we study the inverse problem of determining both the source of a wave and its speed inside a medium from measurements of the solution of the wave equation on the boundary this problem arises in photoacoustic and thermoacoustic tomography and has important applications in medical imaging we prove that if the solutions of the wave equation with the source and sound speed f_1c_1 and f_2c_2 agree on the boundary of a bounded region omega then int_omegac_22c_12varphi dy0 for every harmonic function varphi in cbaromega which holds without any knowledge of the source we also show that if the wave speed c is known and only assumed to be bounded then under a natural admissibility assumption the source of the wave can be uniquely determined from boundary measurements
|
[['we', 'study', 'the', 'inverse', 'problem', 'of', 'determining', 'both', 'the', 'source', 'of', 'a', 'wave', 'and', 'its', 'speed', 'inside', 'a', 'medium', 'from', 'measurements', 'of', 'the', 'solution', 'of', 'the', 'wave', 'equation', 'on', 'the', 'boundary', 'this', 'problem', 'arises', 'in', 'photoacoustic', 'and', 'thermoacoustic', 'tomography', 'and', 'has', 'important', 'applications', 'in', 'medical', 'imaging', 'we', 'prove', 'that', 'if', 'the', 'solutions', 'of', 'the', 'wave', 'equation', 'with', 'the', 'source', 'and', 'sound', 'speed', 'f_1c_1', 'and', 'f_2c_2', 'agree', 'on', 'the', 'boundary', 'of', 'a', 'bounded', 'region', 'omega', 'then', 'int_omegac_22c_12varphi', 'dy0', 'for', 'every', 'harmonic', 'function', 'varphi', 'in', 'cbaromega', 'which', 'holds', 'without', 'any', 'knowledge', 'of', 'the', 'source', 'we', 'also', 'show', 'that', 'if', 'the', 'wave', 'speed', 'c', 'is', 'known', 'and', 'only', 'assumed', 'to', 'be', 'bounded', 'then', 'under', 'a', 'natural', 'admissibility', 'assumption', 'the', 'source', 'of', 'the', 'wave', 'can', 'be', 'uniquely', 'determined', 'from', 'boundary', 'measurements']]
|
[-0.12711552185412014, 0.09390406467155704, -0.06302849076981205, 0.014016755796488254, -0.09351551870725328, -0.09064751815786885, 0.014030407535873594, 0.3466179119423032, -0.3282257788213751, -0.2196910475350676, 0.18096603350732626, -0.27948775623864947, -0.1239885303882822, 0.23817425812200282, -0.014795712452811836, 0.08301743879236446, 0.07963935169317987, 0.11513781010909306, -0.05583419342855773, -0.12868615894976462, 0.35393765389416065, -0.03213857127834232, 0.2437168790511937, 0.12257477366731637, 0.16370917691458617, 0.002258673531844491, 0.011543376251093803, 0.024287286710234418, -0.12891347120920169, 0.06955504391554578, 0.2161532050269025, 0.17922023139826412, 0.24892085270896072, -0.4113223578566366, -0.2507454722128328, 0.11701341077869368, 0.12661209167732346, 0.08100955719935647, -0.03980502289825029, -0.2896614816235078, 0.09750261244123741, -0.0738029066217883, -0.16453276452938875, 0.0345284691486027, 0.03279527427718764, 0.03745047907127188, -0.2897725198568115, 0.09118867483935432, 0.06316667385098915, -0.00011289252659245844, -0.13846692746418768, -0.04387799944097717, -0.029975014746249203, 0.1016941706785151, 0.03125582250668817, 0.09593192838139893, 0.07283906640453008, -0.18401043311009305, -0.03586470343232635, 0.40066796951296346, -0.08297869522545126, -0.25181488178350264, 0.150008603937984, -0.17858830789074062, -0.0687130584171222, 0.10928161926717768, 0.15296461255169444, 0.1412619358292901, -0.13359529660984634, 0.12800595862509292, -0.07394546565199327, 0.20333724178659218, 0.13016433455049992, 0.005385663542490933, 0.13830923590989364, 0.11775211830653491, 0.09420840055005805, 0.15553498847763084, -0.08350058384953186, 0.006777732197435633, -0.34589787221123136, -0.1629424019220976, -0.2008020161020179, 0.05400737297649386, -0.07921719494686019, -0.17735686779562984, 0.377948128145128, 0.15941374750071835, 0.14703688435556908, 0.019180173160425657, 0.29349175047489906, 0.17871330520926765, 0.013934833208857585, 0.10891149529901843, 0.23683001782985463, 0.14599915558562404, 0.10120767567517056, -0.2225205302651551, 0.06749588897406694, 0.036976527483456]
|
1,803.06751
|
Plasmonic Toroidal Metamolecules Assembled by DNA Origami
|
We demonstrate hierarchical assembly of plasmonic toroidal metamolecules,
which exhibit tailored optical activity in the visible spectral range. Each
metamolecule consists of four identical origami-templated helical building
blocks. Such toroidal metamolecules show stronger chiroptical response than
monomers and dimers of the helical building blocks. Enantiomers of the
plasmonic structures yield opposite circular dichroism spectra. The
experimental results agree well with the theoretical simulations. We also
demonstrate that given the circular symmetry of the structures, distinct
chiroptical response along their axial orientation can be uncovered via simple
spin-coating of the metamolecules on substrates. Our work provides a new
strategy to create plasmonic chiral platforms with sophisticated nanoscale
architectures for potential applications such as chiral sensing using
chemically-based assembly systems.
|
physics.bio-ph cond-mat.soft
|
we demonstrate hierarchical assembly of plasmonic toroidal metamolecules which exhibit tailored optical activity in the visible spectral range each metamolecule consists of four identical origamitemplated helical building blocks such toroidal metamolecules show stronger chiroptical response than monomers and dimers of the helical building blocks enantiomers of the plasmonic structures yield opposite circular dichroism spectra the experimental results agree well with the theoretical simulations we also demonstrate that given the circular symmetry of the structures distinct chiroptical response along their axial orientation can be uncovered via simple spincoating of the metamolecules on substrates our work provides a new strategy to create plasmonic chiral platforms with sophisticated nanoscale architectures for potential applications such as chiral sensing using chemicallybased assembly systems
|
[['we', 'demonstrate', 'hierarchical', 'assembly', 'of', 'plasmonic', 'toroidal', 'metamolecules', 'which', 'exhibit', 'tailored', 'optical', 'activity', 'in', 'the', 'visible', 'spectral', 'range', 'each', 'metamolecule', 'consists', 'of', 'four', 'identical', 'origamitemplated', 'helical', 'building', 'blocks', 'such', 'toroidal', 'metamolecules', 'show', 'stronger', 'chiroptical', 'response', 'than', 'monomers', 'and', 'dimers', 'of', 'the', 'helical', 'building', 'blocks', 'enantiomers', 'of', 'the', 'plasmonic', 'structures', 'yield', 'opposite', 'circular', 'dichroism', 'spectra', 'the', 'experimental', 'results', 'agree', 'well', 'with', 'the', 'theoretical', 'simulations', 'we', 'also', 'demonstrate', 'that', 'given', 'the', 'circular', 'symmetry', 'of', 'the', 'structures', 'distinct', 'chiroptical', 'response', 'along', 'their', 'axial', 'orientation', 'can', 'be', 'uncovered', 'via', 'simple', 'spincoating', 'of', 'the', 'metamolecules', 'on', 'substrates', 'our', 'work', 'provides', 'a', 'new', 'strategy', 'to', 'create', 'plasmonic', 'chiral', 'platforms', 'with', 'sophisticated', 'nanoscale', 'architectures', 'for', 'potential', 'applications', 'such', 'as', 'chiral', 'sensing', 'using', 'chemicallybased', 'assembly', 'systems']]
|
[-0.1636902955440997, 0.16695255331232428, -0.03392669686983372, -0.030460624863265146, -0.08378905507511106, -0.1570304783526808, -0.06236031141678064, 0.5013474600774974, -0.21716647207433887, -0.3087887750328358, 0.008168999855366439, -0.23685327077942803, -0.22930754869694597, 0.20088358802704848, 0.04533075488268815, 0.05383979631909009, 0.01288444665260613, -0.06959509251013013, -0.019904710866253953, -0.14541503687585897, 0.21799126873645883, 0.024233465622367882, 0.35596998696665055, 0.030114959833083738, 0.04934844403760508, 0.04278381328612309, 0.05897959146311443, 0.021082217805087566, -0.1198919525710341, 0.15897568885301208, 0.2206267896690406, -0.023612114251591265, 0.16507258902480504, -0.5195731815143392, -0.19774904535633736, 0.011315950534292919, 0.17233336573980493, 0.14136283258116675, -0.11463810972857354, -0.26232807748099984, 0.0771036496835536, -0.1296779475383589, -0.1462912974810902, -0.10715324741563406, -0.05660286181654524, 0.06012424009707596, -0.24837952860277787, 0.008814883163220908, 0.06966213780106045, 0.10759842219152327, -0.07596082119512018, -0.12661976453944526, -0.06479240838711246, 0.10816442014765926, -0.02103900822714485, -0.06391937832412278, 0.2476389577325257, -0.09330578555417215, -0.1965897028085551, 0.38390916521693097, -0.03617121307001196, -0.11968667808406312, 0.2036089525028164, -0.12485554057639092, -0.0932721871368844, 0.13338977025404317, 0.16443417380274883, 0.11449559558793132, -0.08962244061745125, 0.019847729539896105, -0.060680029110918784, 0.18490840431407157, 0.11337820681390064, 0.09300944735777789, 0.32911074725541706, 0.21094991302053476, 0.04895650963991447, 0.15651177827786686, -0.07029371604058442, -0.027791995260109805, -0.2110109326654467, -0.11120838221515818, -0.17718929149499485, -0.0028223690761510155, -0.09153230220532539, -0.21369425481153204, 0.41248422883579444, 0.08796714709726451, 0.1959296442336977, 0.01279133359664762, 0.31156164788287777, 0.01855884160412925, 0.14913123218816352, -0.014782447287620142, 0.2788222806030435, 0.17011518605808118, 0.06573515633072961, -0.27832425559533697, -0.01766829199864176, -0.020177337806671858]
|
1,803.06752
|
Scalar and Vectorial mu-calculus with Atoms
|
We study an extension of modal $\mu$-calculus to sets with atoms and we study
its basic properties. Model checking is decidable on orbit-finite structures,
and a correspondence to parity games holds. On the other hand, satisfiability
becomes undecidable. We also show expressive limitations of atom-enriched
$\mu$-calculi, and explain how their expressive power depends on the structure
of atoms used, and on the choice between basic or vectorial syntax.
|
cs.LO
|
we study an extension of modal mucalculus to sets with atoms and we study its basic properties model checking is decidable on orbitfinite structures and a correspondence to parity games holds on the other hand satisfiability becomes undecidable we also show expressive limitations of atomenriched mucalculi and explain how their expressive power depends on the structure of atoms used and on the choice between basic or vectorial syntax
|
[['we', 'study', 'an', 'extension', 'of', 'modal', 'mucalculus', 'to', 'sets', 'with', 'atoms', 'and', 'we', 'study', 'its', 'basic', 'properties', 'model', 'checking', 'is', 'decidable', 'on', 'orbitfinite', 'structures', 'and', 'a', 'correspondence', 'to', 'parity', 'games', 'holds', 'on', 'the', 'other', 'hand', 'satisfiability', 'becomes', 'undecidable', 'we', 'also', 'show', 'expressive', 'limitations', 'of', 'atomenriched', 'mucalculi', 'and', 'explain', 'how', 'their', 'expressive', 'power', 'depends', 'on', 'the', 'structure', 'of', 'atoms', 'used', 'and', 'on', 'the', 'choice', 'between', 'basic', 'or', 'vectorial', 'syntax']]
|
[-0.07991830586219456, 0.04370649218226526, -0.04670045243006255, 0.16580564291876698, -0.16893903480203293, -0.1725328567006917, 0.06557602425620182, 0.4275897704064846, -0.31390030889201964, -0.25339192846345143, 0.06315596160859954, -0.2658127217984466, -0.11645921155047576, 0.1662568808811258, -0.1024131091110019, 0.028200942215878072, 0.014643987640738487, 0.07933347477619328, -0.04028563790801746, -0.22420237563314166, 0.3452221514212329, 0.003772096013400092, 0.24572867169322918, 0.08823157880983468, 0.08621688381727062, 0.04586097477837952, 0.036051401482728215, 0.06956270253702776, -0.1316503975470898, 0.17005103723052195, 0.23288993306680403, 0.2449780194394624, 0.23310565267717326, -0.45482707820109913, -0.10032001117577971, 0.11296313673035423, 0.07561988475273794, 0.07850901283056183, 0.01733203039768694, -0.26311876435778037, 0.07887587558700522, -0.16221674496947386, -0.055031597871444564, -0.13632372075886423, 0.0488956248415495, 0.03460851405510929, -0.1970656527903056, -0.03019135850247121, 0.17841241895151672, 0.10836799694364195, -0.062444695791945476, -0.07431670409712399, 0.005317468953722004, 0.05576497977669003, -0.0005362342483600351, -0.10071671373252548, 0.10798798878885695, -0.12408283705920425, -0.16740925016521074, 0.42192249250278546, -0.04367394629977087, -0.19052307838713056, 0.2277950079791915, -0.09171801753196199, -0.19653501597914233, -0.010138742026261319, 0.10948798519128294, 0.12633774957772512, -0.01996587404248013, 0.1609118218957655, -0.10003411841366801, 0.3085403705655194, 0.12566299687848606, 0.08281001748878565, 0.1661655452352629, 0.21718143182459163, 0.03901036528509055, 0.2013517130807445, 0.049110143396781006, -0.11171873831954687, -0.2531673293143733, -0.14020792540830018, -0.06885055730591959, -0.04189291372617234, -0.04606132462895267, -0.1870311962357208, 0.40892635073179184, 0.18790941323725327, 0.12063386611668254, 0.1600640286733188, 0.3086480639332822, 0.11723201806698717, 0.04918969959479326, 0.01712912267574401, 0.13888247595377154, 0.20769307414875993, 0.05657352714403185, -0.2502852626381192, 0.11183720380901846, 0.08423524287723895]
|
1,803.06753
|
DNA nanotechnology-enabled chiral plasmonics: from static to dynamic
|
In this Account, we discuss a variety of static and dynamic chiral plasmonic
nanostructures enabled by DNA nanotechnology. In the category of static
plasmonic systems, we first show chiral plasmonic nanostructures based on
spherical AuNPs, including plasmonic helices, toroids, and tetramers. To
enhance the CD responses, anisotropic gold nanorods with larger extinction
coefficients are utilized to create chiral plasmonic crosses and helical
superstructures. Next, we highlight the inevitable evolution from static to
dynamic plasmonic systems along with the fast development of this
interdisciplinary field. Several dynamic plasmonic systems are reviewed
according to their working mechanisms.
|
physics.bio-ph cond-mat.soft
|
in this account we discuss a variety of static and dynamic chiral plasmonic nanostructures enabled by dna nanotechnology in the category of static plasmonic systems we first show chiral plasmonic nanostructures based on spherical aunps including plasmonic helices toroids and tetramers to enhance the cd responses anisotropic gold nanorods with larger extinction coefficients are utilized to create chiral plasmonic crosses and helical superstructures next we highlight the inevitable evolution from static to dynamic plasmonic systems along with the fast development of this interdisciplinary field several dynamic plasmonic systems are reviewed according to their working mechanisms
|
[['in', 'this', 'account', 'we', 'discuss', 'a', 'variety', 'of', 'static', 'and', 'dynamic', 'chiral', 'plasmonic', 'nanostructures', 'enabled', 'by', 'dna', 'nanotechnology', 'in', 'the', 'category', 'of', 'static', 'plasmonic', 'systems', 'we', 'first', 'show', 'chiral', 'plasmonic', 'nanostructures', 'based', 'on', 'spherical', 'aunps', 'including', 'plasmonic', 'helices', 'toroids', 'and', 'tetramers', 'to', 'enhance', 'the', 'cd', 'responses', 'anisotropic', 'gold', 'nanorods', 'with', 'larger', 'extinction', 'coefficients', 'are', 'utilized', 'to', 'create', 'chiral', 'plasmonic', 'crosses', 'and', 'helical', 'superstructures', 'next', 'we', 'highlight', 'the', 'inevitable', 'evolution', 'from', 'static', 'to', 'dynamic', 'plasmonic', 'systems', 'along', 'with', 'the', 'fast', 'development', 'of', 'this', 'interdisciplinary', 'field', 'several', 'dynamic', 'plasmonic', 'systems', 'are', 'reviewed', 'according', 'to', 'their', 'working', 'mechanisms']]
|
[-0.17015129275214827, 0.1519729158105819, -0.01815250316928876, 0.005271736169724088, -0.09276012170471643, -0.1511867469029599, -0.039746092514772166, 0.5070808076544812, -0.24097671679368143, -0.25298800657650355, -0.008888607504042356, -0.2639653586022752, -0.24608865585668308, 0.17489618647255395, 0.004355458375434146, 0.069209761692113, -0.04559622506954168, -0.07353463472161247, -0.020161230734696514, -0.14202755299568373, 0.26576270627740184, 0.021382795132108424, 0.33388940284126684, 0.07016076076481688, 0.021397847665081682, 0.024164450335267342, 0.03690110092100344, 0.024294340313262136, -0.1637348693783248, 0.17975068237436445, 0.27977882564607026, -0.03852580171813698, 0.23171219562646, -0.5281272453697105, -0.20662256937081877, -0.0014928655110691723, 0.1785453115001713, 0.18295298863790538, -0.10526255557043968, -0.3000344321817944, 0.11519897347806315, -0.1215208154857943, -0.15839015790996583, -0.08436175210012344, -0.01020101305268901, 0.08211509412350623, -0.18711309929586653, -0.01366054505403889, 0.055491217428368, 0.1123743614672046, -0.11382110135041569, -0.11318654397894677, 0.00047073221128237876, 0.07703556572822363, 0.006968216166684502, -0.057314944081008436, 0.2565586569939593, -0.11580452881263274, -0.1766688151775222, 0.4158892407621208, -0.014931232972364676, -0.14697297936011303, 0.20077448666561395, -0.15011081636246099, -0.022078003033407425, 0.16070923058463163, 0.24541284055694154, 0.11592297132470106, -0.15101500343237267, 0.02321564627529465, 0.05120008770180376, 0.1655522274895032, 0.10301260312921122, 0.08736435596978194, 0.3208088640025572, 0.23376529421657324, -0.010744432619723835, 0.18537772436577238, -0.06327754234846093, -0.07396941048730361, -0.17427567515130105, -0.14448941940147625, -0.1459199559041544, 0.024973164077259993, -0.10446624768312751, -0.23259933087974788, 0.3860097061450544, 0.12328024277169454, 0.13103943448513747, -0.028677245401961142, 0.2608929894717508, -9.39666244544481e-05, 0.1261924070330631, -0.027792846043839265, 0.2776850948012189, 0.1708044873378975, 0.12896883749452076, -0.27176974743212523, -0.029826844664976784, -0.010281897458787027]
|
1,803.06754
|
Quantum Grothendieck ring isomorphisms, cluster algebras and
Kazhdan-Lusztig algorithm
|
We establish ring isomorphisms between quantum Grothendieck rings of certain
remarkable monoidal categories of finite-dimensional representations of quantum
affine algebras of types $A_{2n-1}^{(1)}$ and $B_n^{(1)}$. Our proof relies in
part on the corresponding quantum cluster algebra structures. Moreover, we
prove that our isomorphisms specialize at $t = 1$ to the isomorphisms of
(classical) Grothendieck rings obtained recently by Kashiwara, Kim and Oh by
other methods. As a consequence, we prove a conjecture formulated by the first
author in 2002 : the multiplicities of simple modules in standard modules in
the categories above for type $B_n^{(1)}$ are given by the specialization of
certain analogues of Kazhdan-Lusztig polynomials and the coefficients of these
polynomials are positive.
|
math.RT math.QA math.RA
|
we establish ring isomorphisms between quantum grothendieck rings of certain remarkable monoidal categories of finitedimensional representations of quantum affine algebras of types a_2n11 and b_n1 our proof relies in part on the corresponding quantum cluster algebra structures moreover we prove that our isomorphisms specialize at t 1 to the isomorphisms of classical grothendieck rings obtained recently by kashiwara kim and oh by other methods as a consequence we prove a conjecture formulated by the first author in 2002 the multiplicities of simple modules in standard modules in the categories above for type b_n1 are given by the specialization of certain analogues of kazhdanlusztig polynomials and the coefficients of these polynomials are positive
|
[['we', 'establish', 'ring', 'isomorphisms', 'between', 'quantum', 'grothendieck', 'rings', 'of', 'certain', 'remarkable', 'monoidal', 'categories', 'of', 'finitedimensional', 'representations', 'of', 'quantum', 'affine', 'algebras', 'of', 'types', 'a_2n11', 'and', 'b_n1', 'our', 'proof', 'relies', 'in', 'part', 'on', 'the', 'corresponding', 'quantum', 'cluster', 'algebra', 'structures', 'moreover', 'we', 'prove', 'that', 'our', 'isomorphisms', 'specialize', 'at', 't', '1', 'to', 'the', 'isomorphisms', 'of', 'classical', 'grothendieck', 'rings', 'obtained', 'recently', 'by', 'kashiwara', 'kim', 'and', 'oh', 'by', 'other', 'methods', 'as', 'a', 'consequence', 'we', 'prove', 'a', 'conjecture', 'formulated', 'by', 'the', 'first', 'author', 'in', '2002', 'the', 'multiplicities', 'of', 'simple', 'modules', 'in', 'standard', 'modules', 'in', 'the', 'categories', 'above', 'for', 'type', 'b_n1', 'are', 'given', 'by', 'the', 'specialization', 'of', 'certain', 'analogues', 'of', 'kazhdanlusztig', 'polynomials', 'and', 'the', 'coefficients', 'of', 'these', 'polynomials', 'are', 'positive']]
|
[-0.15255407305396926, 0.04022422703461156, -0.054481228235610094, 0.057612425341046346, -0.06269766334194823, -0.1482741277141031, -0.028044416567094492, 0.3253378846483039, -0.3976407683733539, -0.21237747682191963, 0.07406778124381422, -0.18839146314712707, -0.17238299515364425, 0.20732784132893098, -0.169601537478489, -0.036631367152689824, 0.05318400025550675, 0.0804402417935697, -0.0995544566098293, -0.3489326773560606, 0.42589699822877136, -0.005974045223930651, 0.2214775110021167, 0.01793759921565652, 0.09734228344002206, 0.011630969496244299, -0.037843115794073255, -0.043542002086594166, -0.16071801669470784, 0.14873697049292137, 0.3470553931297867, 0.051863493447724195, 0.18367054384725634, -0.38108868506138344, -0.051646907433418425, 0.13175239883795647, 0.10887514229398221, 0.03626890492159873, -0.027886980143583578, -0.3193207839545461, 0.10877347641092326, -0.2053641767748299, -0.11223023034731991, -0.07674546770119507, 0.071295628673397, 0.08358285606872025, -0.2395612114175622, 0.03852317828152861, 0.1191060875862604, 0.15663053695711174, -0.08779282869987323, -0.14022164337802678, -0.039255625133851675, 0.07640616623601611, -0.0878864354038212, -0.041643037748664416, 0.0902911238008528, -0.09843887361681222, -0.23327827242402627, 0.320981650014541, -0.0106117772437366, -0.1643653221461656, 0.16333678378110303, -0.17775777299123416, -0.1961403223769074, 0.07472745547004576, 0.0021645191840694417, 0.1255126747169665, -0.0126745344750816, 0.1766242426430316, -0.1690812376618851, 0.007564719985696554, 0.1654014773084782, 0.012093154110646407, 0.13620134082157165, 0.019695079386500374, 0.017764743151669142, 0.15634642914821079, 0.058514270476215255, -0.06316061705417399, -0.3564025850625642, -0.22436435963858717, -0.09430393214695089, 0.11295103571735256, -0.10652419934675501, -0.11631343417268779, 0.3979417052302909, 0.07519942773745113, 0.1903882972505276, 0.13834208095379705, 0.16277216401483333, 0.053629858087723345, 0.10509719091740928, 0.012870553564945502, 0.1569734527105798, 0.30386208243102636, 0.01775434908423839, -0.1065068922887024, -0.020445981191837097, 0.27810757188750096]
|
1,803.06755
|
Witt groups of abelian categories and perverse sheaves
|
In this paper we study the Witt groups of symmetric and anti-symmetric forms
on perverse sheaves on a finite-dimensional topologically stratified space with
even dimensional strata. We show that the Witt group has a canonical
decomposition as a direct sum of the Witt groups of shifted local systems on
strata. We compare this with another `splitting decomposition' for Witt classes
of perverse sheaves obtained inductively from our main new tool, a `splitting
relation' which is a generalisation of isotropic reduction.
The Witt groups we study are identified with the (non-trivial) Balmer-Witt
groups of the constructible derived category of sheaves on the stratified
space, and also with the corresponding cobordism groups defined by Youssin.
Our methods are primarily algebraic and apply more widely. The general
context in which we work is that of a triangulated category with duality,
equipped with a self-dual t-structure with noetherian heart, glued from
self-dual t-structures on a thick subcategory and its quotient.
|
math.AT math.AG math.KT
|
in this paper we study the witt groups of symmetric and antisymmetric forms on perverse sheaves on a finitedimensional topologically stratified space with even dimensional strata we show that the witt group has a canonical decomposition as a direct sum of the witt groups of shifted local systems on strata we compare this with another splitting decomposition for witt classes of perverse sheaves obtained inductively from our main new tool a splitting relation which is a generalisation of isotropic reduction the witt groups we study are identified with the nontrivial balmerwitt groups of the constructible derived category of sheaves on the stratified space and also with the corresponding cobordism groups defined by youssin our methods are primarily algebraic and apply more widely the general context in which we work is that of a triangulated category with duality equipped with a selfdual tstructure with noetherian heart glued from selfdual tstructures on a thick subcategory and its quotient
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'witt', 'groups', 'of', 'symmetric', 'and', 'antisymmetric', 'forms', 'on', 'perverse', 'sheaves', 'on', 'a', 'finitedimensional', 'topologically', 'stratified', 'space', 'with', 'even', 'dimensional', 'strata', 'we', 'show', 'that', 'the', 'witt', 'group', 'has', 'a', 'canonical', 'decomposition', 'as', 'a', 'direct', 'sum', 'of', 'the', 'witt', 'groups', 'of', 'shifted', 'local', 'systems', 'on', 'strata', 'we', 'compare', 'this', 'with', 'another', 'splitting', 'decomposition', 'for', 'witt', 'classes', 'of', 'perverse', 'sheaves', 'obtained', 'inductively', 'from', 'our', 'main', 'new', 'tool', 'a', 'splitting', 'relation', 'which', 'is', 'a', 'generalisation', 'of', 'isotropic', 'reduction', 'the', 'witt', 'groups', 'we', 'study', 'are', 'identified', 'with', 'the', 'nontrivial', 'balmerwitt', 'groups', 'of', 'the', 'constructible', 'derived', 'category', 'of', 'sheaves', 'on', 'the', 'stratified', 'space', 'and', 'also', 'with', 'the', 'corresponding', 'cobordism', 'groups', 'defined', 'by', 'youssin', 'our', 'methods', 'are', 'primarily', 'algebraic', 'and', 'apply', 'more', 'widely', 'the', 'general', 'context', 'in', 'which', 'we', 'work', 'is', 'that', 'of', 'a', 'triangulated', 'category', 'with', 'duality', 'equipped', 'with', 'a', 'selfdual', 'tstructure', 'with', 'noetherian', 'heart', 'glued', 'from', 'selfdual', 'tstructures', 'on', 'a', 'thick', 'subcategory', 'and', 'its', 'quotient']]
|
[-0.17107375099719804, 0.04726718595574985, -0.12772603527727452, 0.06469528934640156, -0.12032602115098823, -0.10686387042152126, -0.02658816481231373, 0.3448119732527086, -0.3618845403914086, -0.15650009577670557, 0.09957055960685111, -0.18187693416975537, -0.15097258500029126, 0.22521537261736857, -0.1644297091338735, -0.09878602024362809, 0.05163692194793083, 0.08500719744433927, -0.09828771212495041, -0.2834135973175939, 0.5221635724067107, -0.0243082642298216, 0.3042330732644693, -0.036803732644282765, 0.11576800791443895, -0.003080291815658475, -0.030227350766540734, 0.01866282778754286, -0.13072257553268446, 0.19710739192782673, 0.3412156496620314, 0.013674758069289776, 0.1700006510212703, -0.3666327802718363, -0.1356700569899245, 0.15713785973667807, 0.12185448437684228, 0.05121599314220298, -0.03624285955872922, -0.3193117899626687, 0.11633880132370455, -0.2235410870204063, -0.06732839563643778, -0.062161468477411705, 0.022954315765059324, 0.01374634539454498, -0.20910878566111885, -0.015323370906967343, 0.04856637617053053, 0.13283262584455213, -0.1375492359262093, -0.10209316719329445, -0.10128973036182004, 0.04863063854395182, -0.02214921561263308, 0.020197018016395823, 0.10270028042171586, -0.07467298712884718, -0.1456052097423885, 0.3775283048630922, -0.08440128967843273, -0.23702502605813713, 0.17243129516764266, -0.12230604656597042, -0.14499793660391558, 0.1104292212864505, 0.053995551190689786, 0.19123454093812153, 0.02222061773774202, 0.15923939516326388, -0.1809585310878571, 0.06328298341612901, 0.09315996024418961, 0.009097560238192923, 0.1666267543257057, 0.12819192083189626, 0.04414675534739123, 0.15562646949736328, -0.01075093781382039, -0.052195480903731536, -0.3697054630036575, -0.20931061433761247, -0.0931790106039337, 0.14513035633831056, -0.07587847616330738, -0.18111211262634266, 0.40240042813291604, 0.06804503957769688, 0.17885420814325864, 0.16088220610755025, 0.26496531737835277, 0.019410081825358187, 0.08343897655594175, 0.040872743649577555, 0.12889908451750245, 0.27055522779081403, -0.0641578854010259, -0.10976541345612473, -0.04920505167607992, 0.23153730108729237]
|
1,803.06756
|
Chaos of Wilson Loop from String Motion near Black Hole Horizon
|
To find the origin of chaos near black hole horizon in string-theoretic
AdS/CFT correspondence, we perform a chaos analysis of a suspended string in
AdS black hole backgrounds. It has a definite CFT interpretation: chaos of
Wilson loops, or in other words, sensitive time-evolution of a quark antiquark
force in thermal gauge theories. Our nonlinear numerical simulation of the
suspended Nambu-Goto string shows chaos, which would be absent in pure AdS
background. The calculated Lyapunov exponent $\lambda$ satisfies the universal
bound $\lambda \leq 2\pi T_{\rm H}$ for the Hawking temperature $T_{\rm H}$. We
also analyze a toy model of a rectangular string probing the horizon and show
that it contains a universal saddle characterized by the surface gravity $2\pi
T_{\rm H}$. Our work demonstrates that the black hole horizon is the origin of
the chaos, and suggests a close interplay between chaos and quark
deconfinement.
|
hep-th gr-qc
|
to find the origin of chaos near black hole horizon in stringtheoretic adscft correspondence we perform a chaos analysis of a suspended string in ads black hole backgrounds it has a definite cft interpretation chaos of wilson loops or in other words sensitive timeevolution of a quark antiquark force in thermal gauge theories our nonlinear numerical simulation of the suspended nambugoto string shows chaos which would be absent in pure ads background the calculated lyapunov exponent lambda satisfies the universal bound lambda leq 2pi t_rm h for the hawking temperature t_rm h we also analyze a toy model of a rectangular string probing the horizon and show that it contains a universal saddle characterized by the surface gravity 2pi t_rm h our work demonstrates that the black hole horizon is the origin of the chaos and suggests a close interplay between chaos and quark deconfinement
|
[['to', 'find', 'the', 'origin', 'of', 'chaos', 'near', 'black', 'hole', 'horizon', 'in', 'stringtheoretic', 'adscft', 'correspondence', 'we', 'perform', 'a', 'chaos', 'analysis', 'of', 'a', 'suspended', 'string', 'in', 'ads', 'black', 'hole', 'backgrounds', 'it', 'has', 'a', 'definite', 'cft', 'interpretation', 'chaos', 'of', 'wilson', 'loops', 'or', 'in', 'other', 'words', 'sensitive', 'timeevolution', 'of', 'a', 'quark', 'antiquark', 'force', 'in', 'thermal', 'gauge', 'theories', 'our', 'nonlinear', 'numerical', 'simulation', 'of', 'the', 'suspended', 'nambugoto', 'string', 'shows', 'chaos', 'which', 'would', 'be', 'absent', 'in', 'pure', 'ads', 'background', 'the', 'calculated', 'lyapunov', 'exponent', 'lambda', 'satisfies', 'the', 'universal', 'bound', 'lambda', 'leq', '2pi', 't_rm', 'h', 'for', 'the', 'hawking', 'temperature', 't_rm', 'h', 'we', 'also', 'analyze', 'a', 'toy', 'model', 'of', 'a', 'rectangular', 'string', 'probing', 'the', 'horizon', 'and', 'show', 'that', 'it', 'contains', 'a', 'universal', 'saddle', 'characterized', 'by', 'the', 'surface', 'gravity', '2pi', 't_rm', 'h', 'our', 'work', 'demonstrates', 'that', 'the', 'black', 'hole', 'horizon', 'is', 'the', 'origin', 'of', 'the', 'chaos', 'and', 'suggests', 'a', 'close', 'interplay', 'between', 'chaos', 'and', 'quark', 'deconfinement']]
|
[-0.2010545341908161, 0.18859267327573215, -0.14914871914440703, 0.14249920036948832, -0.05239221390922843, -0.18532921080959255, 0.06496916940307308, 0.2772168744724758, -0.18729705079458653, -0.21283606954625456, 0.04062473978766979, -0.3230265216709211, -0.12380087669649771, 0.16176490151395637, -0.00669633382610206, 0.04085374625142792, -0.013319245904106004, 0.08401223764722718, -0.09773135889193107, -0.19087312658606417, 0.3162456276537529, 0.06903635013912772, 0.2230531716109093, 0.06444428951704297, 0.06421799332160374, -0.038062297499834974, 0.008182144113655749, 0.04657593129909244, -0.18880981587501772, -0.005613881644214793, 0.2117989984043906, 0.06225437531568881, 0.15402591484759387, -0.3668298068360008, -0.24790737460977558, 0.06561523148597315, 0.17159770594203266, 0.1265723633893027, -0.03925359515344788, -0.2716950590369003, 0.047088366552609305, -0.18178515176706272, -0.1682764473025976, -0.05381900532460161, 0.09101907643650113, -0.12245049334677129, -0.23869667898959898, 0.1253180617031015, 0.04957432000544564, 0.020374476716950023, -0.026633791577327866, -0.027927973281977506, -0.07724092077977698, 0.047019240139694565, 0.09832189879701313, 0.09311066977760016, 0.20053423753265162, -0.12393407617868245, -0.14399884008834588, 0.3317713356480516, -0.09503721040512982, -0.12993198263876396, 0.16206895128888046, -0.22816503018718856, -0.10804352675853618, 0.12566034739193754, 0.082182016153017, 0.1522106182793605, -0.11391716543585062, 0.2020092626840904, -0.029311783321137572, 0.19389926594469278, 0.14683401458414977, 0.051811494755333865, 0.35301818037084465, 0.13417859512927202, 0.01047579845542024, 0.1615301631772409, -0.03210340879761196, -0.12121377565480512, -0.376594043690069, -0.13780825436637126, -0.1578131288418482, 0.10885612857287172, -0.20310544277800263, -0.22108276602009247, 0.3081198092690541, 0.14128786005914726, 0.18825588380468303, 0.021780342904947184, 0.19319440579876818, 0.08598234736489067, 0.0051511358020120655, 0.13180229589021925, 0.277914090557345, 0.1500327936871427, 0.1441582137445823, -0.3149132942331248, -0.08215145045602373, 0.1422810301232826]
|
1,803.06757
|
On stabilization of solutions of higher order evolution inequalities
|
We obtain sharp conditions guaranteeing that every non-negative weak solution
of the inequality $$ \sum_{|\alpha| = m}
\partial^\alpha
a_\alpha (x, t, u)
-
u_t
\ge
f (x, t) g (u)
\quad
\mbox{in} {\mathbb R}_+^{n+1} = {\mathbb R}^n \times (0, \infty),
\quad
m,n \ge 1, $$ stabilizes to zero as $t \to \infty$. These conditions
generalize the well-known Keller-Osserman condition on the grows of the
function $g$ at infinity.
|
math.AP
|
we obtain sharp conditions guaranteeing that every nonnegative weak solution of the inequality sum_alpha m partialalpha a_alpha x t u u_t ge f x t g u quad mboxin mathbb r_n1 mathbb rn times 0 infty quad mn ge 1 stabilizes to zero as t to infty these conditions generalize the wellknown kellerosserman condition on the grows of the function g at infinity
|
[['we', 'obtain', 'sharp', 'conditions', 'guaranteeing', 'that', 'every', 'nonnegative', 'weak', 'solution', 'of', 'the', 'inequality', 'sum_alpha', 'm', 'partialalpha', 'a_alpha', 'x', 't', 'u', 'u_t', 'ge', 'f', 'x', 't', 'g', 'u', 'quad', 'mboxin', 'mathbb', 'r_n1', 'mathbb', 'rn', 'times', '0', 'infty', 'quad', 'mn', 'ge', '1', 'stabilizes', 'to', 'zero', 'as', 't', 'to', 'infty', 'these', 'conditions', 'generalize', 'the', 'wellknown', 'kellerosserman', 'condition', 'on', 'the', 'grows', 'of', 'the', 'function', 'g', 'at', 'infinity']]
|
[-0.2635453445282543, 0.09704174158867404, 0.07147313072715723, -0.04285503523276439, -0.021021540904979385, -0.30877883993976174, -0.046434934812760544, 0.3126625671154923, -0.37020499259233475, -0.11734112652225627, 0.055204506128257703, -0.44177695872291683, -0.013218845211205974, 0.07648284735882448, -0.056875885759909005, 0.025208142002127946, -0.030051633065182066, 0.11171602649939438, -0.12024024921277213, -0.26552668639591764, 0.25613371783956174, -0.2148797619378283, 0.1511348614557868, 0.04859627725275618, 0.11250912128034832, -0.027444670863804362, 0.17692249977872485, -0.09847886150791532, -0.39762845618101966, -0.11929312589696593, 0.19998383001675682, 0.0842061422040893, 0.33195168081493603, -0.35904538816733594, -0.12313186305220283, 0.2544604228543384, 0.1622762665122984, -0.20141121857459582, 0.058874265192860056, -0.31281877438434297, 0.20524982751036683, -0.001098052343531024, -0.235553244897534, -0.00590209515085296, 0.19681265255406735, 0.07985747632171426, -0.4758065728736775, 0.09567407214467133, 0.19182302145331742, -0.04960171058995738, -0.04067507542906299, -0.2649366595109718, -0.11912106552589981, 0.045485786679718226, -0.003461256209346983, 0.2911683312295714, 0.02400980577416097, -0.010152717941396293, 0.07043395821921646, 0.29796866868578253, -0.164883287431347, -0.2031172981692685, 0.06581600079874671, -0.2678047080657312, -0.18117547129827832, 0.06387834800111633, 0.047638557259998625, 0.27141596903167076, 0.0064828843765315555, 0.4086319891336773, -0.08859293452567524, 0.11009687693819167, 0.1720016338522472, 0.014770625136970054, -0.046678210774968774, 0.03736327170941328, 0.20287183937912304, 0.05966067958682302, 0.0023169206521872964, 0.15339440160564013, -0.4518523196198253, -0.1312869613369306, -0.15461311230642927, 0.319001760688566, -0.1795517566155583, -0.1156605306184954, 0.16365469569369914, 0.03967622992774797, 0.21143176022266585, 0.1506521696343072, 0.11192809212361536, 0.11608620506659564, -0.05316702000028084, 0.10668191023998791, -0.052708826559994905, 0.19619502730312802, 0.12614288184762237, -0.2147128234602629, -0.029741838337883117, 0.18033526032157834]
|
1,803.06758
|
Impact of the $^7$Be($\alpha, \gamma$)$^{11}$C reaction on the
primordial abundance of $^7$Li
|
We calculate the radiative capture cross section for $^7$Be($\alpha,
\gamma$)$^{11}$C and its reaction rate of relevance for the big bang
nucleosynthesis. The impact of this reaction on the primordial $^7$Li abundance
is revised including narrow and broad resonances in the pertinent energy
region. Our calculations show that it is unlikely that very low energy
resonances in $^{11}$C of relevance for the big bang nucleosynthesis would
emerge within a two-body potential model. Based on our results and a comparison
with previous theoretical and experimental analyses, we conclude that the
impact of this reaction on the so-called "cosmological lithium puzzle" is
completely irrelevant.
|
nucl-th astro-ph.CO nucl-ex
|
we calculate the radiative capture cross section for 7bealpha gamma11c and its reaction rate of relevance for the big bang nucleosynthesis the impact of this reaction on the primordial 7li abundance is revised including narrow and broad resonances in the pertinent energy region our calculations show that it is unlikely that very low energy resonances in 11c of relevance for the big bang nucleosynthesis would emerge within a twobody potential model based on our results and a comparison with previous theoretical and experimental analyses we conclude that the impact of this reaction on the socalled cosmological lithium puzzle is completely irrelevant
|
[['we', 'calculate', 'the', 'radiative', 'capture', 'cross', 'section', 'for', '7bealpha', 'gamma11c', 'and', 'its', 'reaction', 'rate', 'of', 'relevance', 'for', 'the', 'big', 'bang', 'nucleosynthesis', 'the', 'impact', 'of', 'this', 'reaction', 'on', 'the', 'primordial', '7li', 'abundance', 'is', 'revised', 'including', 'narrow', 'and', 'broad', 'resonances', 'in', 'the', 'pertinent', 'energy', 'region', 'our', 'calculations', 'show', 'that', 'it', 'is', 'unlikely', 'that', 'very', 'low', 'energy', 'resonances', 'in', '11c', 'of', 'relevance', 'for', 'the', 'big', 'bang', 'nucleosynthesis', 'would', 'emerge', 'within', 'a', 'twobody', 'potential', 'model', 'based', 'on', 'our', 'results', 'and', 'a', 'comparison', 'with', 'previous', 'theoretical', 'and', 'experimental', 'analyses', 'we', 'conclude', 'that', 'the', 'impact', 'of', 'this', 'reaction', 'on', 'the', 'socalled', 'cosmological', 'lithium', 'puzzle', 'is', 'completely', 'irrelevant']]
|
[-0.046010525547899306, 0.11065649554599076, -0.07010333629645174, 0.11812511315220035, -0.024243231582222507, -0.07580785366240889, 0.05695065784268081, 0.31759398160502317, -0.2189172692783177, -0.2828226501122117, 0.01475356433307752, -0.32935175991617144, -0.05845739801414311, 0.18769218205008656, 0.020358364837884436, 0.047129822902497835, 0.13890897947479972, 0.04540969773661345, -0.014429331731516868, -0.21296998885576612, 0.3703078077826649, 0.14450427521020173, 0.1992257689521648, 0.1818022581236437, -0.007204930610023439, -0.06299940880096982, -0.020867226416012272, -0.05126062492839992, -0.18620707064743328, 0.10216622719541192, 0.21790210146456956, 0.15640881846193225, 0.18441552557982505, -0.42184021081775425, -0.2523294107243419, 0.09879454697249457, 0.15908050214871763, 0.1688847104460001, -0.14781836351263336, -0.25347407637164, 0.07468221614719368, -0.1762747024651617, -0.08291802059859038, -0.060858436757698656, 0.04269557825755328, -0.01235470655374229, -0.2487023723591119, 0.09030473504972178, -0.0021670512529090046, -0.004311342053770204, -0.10262044794973918, -0.165941153569147, 0.0008993647084571421, 0.04182779802475125, 0.060786462706746536, -0.03948602241027402, 0.16333876990713178, -0.09445966406781736, -0.04759225144516677, 0.4201359631121159, -0.09511382948840037, -0.08525936576537788, 0.14638951121130958, -0.16577538286801427, -0.17703032250748948, 0.14412133392412216, 0.1513062669034116, 0.11440580281661823, -0.11644291530363261, 0.10714674342685612, 0.030960951820015906, 0.16506451109424233, 0.07386861273320391, 0.002993093193508685, 0.2158223872166127, 0.22944851488806306, -0.04626010132022202, -0.0034831974073313175, -0.1287067271419801, -0.14659679188393057, -0.32766067145392297, -0.1181693383026868, -0.08912574308924377, 0.0774528323393315, -0.08441228678391781, -0.1485091176815331, 0.3421247213613242, 0.15674730124883354, 0.2762044468871318, -0.017345818178728222, 0.31834362658672033, 0.07507025567116216, 0.04377035176381469, 0.026473374402849005, 0.34439515984617175, 0.15300616108812393, 0.11024083573836833, -0.29709353668848054, 0.1206192622333765, -0.029443497830070556]
|
1,803.06759
|
Universal bound states of one-dimensional bosons with two- and
three-body attractions
|
When quantum particles are confined into lower dimensions, an effective
three-body interaction inevitably arises and may cause significant
consequences. Here we study bosons in one dimension with weak two-body and
three-body interactions, predict the existence of two three-body bound states
when both interactions are attractive, and determine their binding energies as
universal functions of the two-body and three-body scattering lengths. We also
show that an infinitesimal three-body attraction induces an excited bound state
only for 3, 39, or more bosons. Our findings herein have direct relevance to a
broad range of quasi-one-dimensional systems realized with ultracold atoms.
|
cond-mat.quant-gas
|
when quantum particles are confined into lower dimensions an effective threebody interaction inevitably arises and may cause significant consequences here we study bosons in one dimension with weak twobody and threebody interactions predict the existence of two threebody bound states when both interactions are attractive and determine their binding energies as universal functions of the twobody and threebody scattering lengths we also show that an infinitesimal threebody attraction induces an excited bound state only for 3 39 or more bosons our findings herein have direct relevance to a broad range of quasionedimensional systems realized with ultracold atoms
|
[['when', 'quantum', 'particles', 'are', 'confined', 'into', 'lower', 'dimensions', 'an', 'effective', 'threebody', 'interaction', 'inevitably', 'arises', 'and', 'may', 'cause', 'significant', 'consequences', 'here', 'we', 'study', 'bosons', 'in', 'one', 'dimension', 'with', 'weak', 'twobody', 'and', 'threebody', 'interactions', 'predict', 'the', 'existence', 'of', 'two', 'threebody', 'bound', 'states', 'when', 'both', 'interactions', 'are', 'attractive', 'and', 'determine', 'their', 'binding', 'energies', 'as', 'universal', 'functions', 'of', 'the', 'twobody', 'and', 'threebody', 'scattering', 'lengths', 'we', 'also', 'show', 'that', 'an', 'infinitesimal', 'threebody', 'attraction', 'induces', 'an', 'excited', 'bound', 'state', 'only', 'for', '3', '39', 'or', 'more', 'bosons', 'our', 'findings', 'herein', 'have', 'direct', 'relevance', 'to', 'a', 'broad', 'range', 'of', 'quasionedimensional', 'systems', 'realized', 'with', 'ultracold', 'atoms']]
|
[-0.14307344742671385, 0.2829962076525355, -0.021174693150090573, 0.1022872290641223, 0.019339954485329464, -0.20496716916311494, 0.017410175404367373, 0.3390014326030667, -0.24303506223062418, -0.2597569125253208, -0.042828169441301876, -0.32500827330711884, -0.11167094494893033, 0.14799622291478223, 0.10946127377239238, 0.04359028404386541, 0.10448041822300437, 0.024821312022731475, -0.05226151571013801, -0.2183859834697136, 0.34106898190184815, 0.0015580209209727718, 0.16121542676995249, 0.21249317924597674, 0.010666015471533402, 0.07050993662692376, 0.10512331322546012, -0.03697526725201109, -0.16641822613131546, 0.08942195304763052, 0.22576586565197224, -0.00843917963229427, 0.2199882052685182, -0.44221520850185264, -0.17089150246885634, 0.1546742053721676, 0.23174493150190287, 0.20029523001609312, -0.06930627451910153, -0.34564157339777873, -0.024019718227773598, -0.2181898784756507, -0.15316202574092702, -0.13781130575507725, 0.10219646365737024, -0.0027920951143857666, -0.257698440674654, 0.0983379401138158, 0.08197590820827358, 0.03596926533338642, -0.13588233367472732, -0.12285393580299869, 0.0025501277408149746, 0.07539725534500286, 0.04521101946491249, -0.011284698792205183, 0.14134585888355433, -0.1738773149170567, -0.1343614510530558, 0.41411496298003597, -0.0507823288627929, -0.18660600627196433, 0.3019268206541532, -0.10635782418215704, -0.09678966613467206, 0.15569200675896147, 0.222441314678812, 0.053063033688417395, -0.1571221591142059, 0.09862333254831046, -0.042244166846281475, 0.19389183050592804, 0.07761347382185385, 0.09965809023238181, 0.197492697093751, 0.12363511273522199, 0.03630865794683317, 0.13291104900237827, -0.08333743077501193, -0.14836864634272978, -0.2709698819545741, -0.11322709385752101, -0.1741060624907235, 0.04525545033021379, -0.0538212298010548, -0.14326995739367665, 0.30190752561866624, 0.08623610082269675, 0.2278802789382867, 0.015107976750365085, 0.22766317950427226, 0.13633499031924864, 0.05759712617565906, 0.021126964460751137, 0.3336687941373009, 0.12740152125659676, -0.05850414413305902, -0.25321630249760047, -0.0011263551963397215, 0.05018106587807235]
|
1,803.0676
|
A Machine Learning Approach for Power Allocation in HetNets Considering
QoS
|
There is an increase in usage of smaller cells or femtocells to improve
performance and coverage of next-generation heterogeneous wireless networks
(HetNets). However, the interference caused by femtocells to neighboring cells
is a limiting performance factor in dense HetNets. This interference is being
managed via distributed resource allocation methods. However, as the density of
the network increases so does the complexity of such resource allocation
methods. Yet, unplanned deployment of femtocells requires an adaptable and
self-organizing algorithm to make HetNets viable. As such, we propose to use a
machine learning approach based on Q-learning to solve the resource allocation
problem in such complex networks. By defining each base station as an agent, a
cellular network is modelled as a multi-agent network. Subsequently,
cooperative Q-learning can be applied as an efficient approach to manage the
resources of a multi-agent network. Furthermore, the proposed approach
considers the quality of service (QoS) for each user and fairness in the
network. In comparison with prior work, the proposed approach can bring more
than a four-fold increase in the number of supported femtocells while using
cooperative Q-learning to reduce resource allocation overhead.
|
cs.IT math.IT
|
there is an increase in usage of smaller cells or femtocells to improve performance and coverage of nextgeneration heterogeneous wireless networks hetnets however the interference caused by femtocells to neighboring cells is a limiting performance factor in dense hetnets this interference is being managed via distributed resource allocation methods however as the density of the network increases so does the complexity of such resource allocation methods yet unplanned deployment of femtocells requires an adaptable and selforganizing algorithm to make hetnets viable as such we propose to use a machine learning approach based on qlearning to solve the resource allocation problem in such complex networks by defining each base station as an agent a cellular network is modelled as a multiagent network subsequently cooperative qlearning can be applied as an efficient approach to manage the resources of a multiagent network furthermore the proposed approach considers the quality of service qos for each user and fairness in the network in comparison with prior work the proposed approach can bring more than a fourfold increase in the number of supported femtocells while using cooperative qlearning to reduce resource allocation overhead
|
[['there', 'is', 'an', 'increase', 'in', 'usage', 'of', 'smaller', 'cells', 'or', 'femtocells', 'to', 'improve', 'performance', 'and', 'coverage', 'of', 'nextgeneration', 'heterogeneous', 'wireless', 'networks', 'hetnets', 'however', 'the', 'interference', 'caused', 'by', 'femtocells', 'to', 'neighboring', 'cells', 'is', 'a', 'limiting', 'performance', 'factor', 'in', 'dense', 'hetnets', 'this', 'interference', 'is', 'being', 'managed', 'via', 'distributed', 'resource', 'allocation', 'methods', 'however', 'as', 'the', 'density', 'of', 'the', 'network', 'increases', 'so', 'does', 'the', 'complexity', 'of', 'such', 'resource', 'allocation', 'methods', 'yet', 'unplanned', 'deployment', 'of', 'femtocells', 'requires', 'an', 'adaptable', 'and', 'selforganizing', 'algorithm', 'to', 'make', 'hetnets', 'viable', 'as', 'such', 'we', 'propose', 'to', 'use', 'a', 'machine', 'learning', 'approach', 'based', 'on', 'qlearning', 'to', 'solve', 'the', 'resource', 'allocation', 'problem', 'in', 'such', 'complex', 'networks', 'by', 'defining', 'each', 'base', 'station', 'as', 'an', 'agent', 'a', 'cellular', 'network', 'is', 'modelled', 'as', 'a', 'multiagent', 'network', 'subsequently', 'cooperative', 'qlearning', 'can', 'be', 'applied', 'as', 'an', 'efficient', 'approach', 'to', 'manage', 'the', 'resources', 'of', 'a', 'multiagent', 'network', 'furthermore', 'the', 'proposed', 'approach', 'considers', 'the', 'quality', 'of', 'service', 'qos', 'for', 'each', 'user', 'and', 'fairness', 'in', 'the', 'network', 'in', 'comparison', 'with', 'prior', 'work', 'the', 'proposed', 'approach', 'can', 'bring', 'more', 'than', 'a', 'fourfold', 'increase', 'in', 'the', 'number', 'of', 'supported', 'femtocells', 'while', 'using', 'cooperative', 'qlearning', 'to', 'reduce', 'resource', 'allocation', 'overhead']]
|
[-0.19984909314799176, -0.014518515724516947, -0.01046107785855943, 0.017818896286065047, -0.10266688656071848, -0.21364327860039903, 0.13186802105096612, 0.43842422551809146, -0.28321647371369646, -0.3080552018640991, 0.04489359476249964, -0.2042618604167738, -0.20973916304731036, 0.12006517357123209, -0.1951259031971508, 0.05980122729358985, 0.04959175865076243, 0.03368748973477333, 0.039001935965974226, -0.2753530937373977, 0.2831449648371604, 0.1378954793600475, 0.3994752996636027, 0.02995250120081685, 0.05413125820438014, -0.03144140538907694, 0.0002192696877057978, 0.013538786032695304, -0.030092791032872816, 0.15828610715558403, 0.37633717730815675, 0.2392569976251194, 0.3830310950543791, -0.46503719723320264, -0.2866045004298492, 0.10974548580025367, 0.2129836401050502, 0.019971266153572316, 0.012156196669684748, -0.2729063603434373, 0.10853315565677828, -0.2824932870051679, -0.03291458942563856, -0.05997521863543095, -0.07423734453750803, 0.06187723540012441, -0.34294689601576106, -0.023534506525443418, -0.03021162424117008, 0.023629875820040464, -0.05342646341342579, -0.10257845996495556, 0.032571731848682076, 0.17293903626997104, 0.029502384205234242, 0.015567477710325928, 0.15188361551453244, -0.15129022450275958, -0.16799604951996694, 0.4174546703564272, 0.011375105135403648, -0.23146674701356315, 0.16385196774630226, 0.0273145481316562, -0.13830010595007422, 0.13177235559236636, 0.2684389231377904, 0.06758717204229955, -0.19391265651958192, -0.0012104660537178543, 0.008389364107808267, 0.18215222718047208, 0.06257218991301675, 0.0749263014684227, 0.1450783358824584, 0.33057070190316057, 0.19713283242548213, 0.11528174370156233, -0.06395127801946737, -0.1252974301481988, -0.1301332612990098, -0.12226586190256525, -0.23394976039342383, 0.018989377585364217, -0.09172293759440757, -0.10444582717363687, 0.32896508335728536, 0.13061416722749444, 0.1308855980928529, 0.12848419234664601, 0.4101277550851757, 0.08098444704372276, 0.1196499455382146, 0.1510878462135234, 0.13829808598035637, 0.026544359918524395, 0.18452907738992994, -0.2236613618075489, 0.0895796304787783, -0.020785020005685044]
|
1,803.06761
|
Hadron-Quark Combustion as a Nonlinear, Dynamical System
|
The hadron-quark combustion front is a system that couples various processes,
such as chemical reactions, hydrodynamics, diffusion, and neutrino transport.
Previous numerical work has shown that this system is very nonlinear, and can
be very sensitive to some of these processes. In these proceedings, we
contextualize the hadron-quark combustion as a nonlinear system, subject to
dramatic feedback triggered by leptonic weak decays and neutrino transport.
|
nucl-th astro-ph.HE
|
the hadronquark combustion front is a system that couples various processes such as chemical reactions hydrodynamics diffusion and neutrino transport previous numerical work has shown that this system is very nonlinear and can be very sensitive to some of these processes in these proceedings we contextualize the hadronquark combustion as a nonlinear system subject to dramatic feedback triggered by leptonic weak decays and neutrino transport
|
[['the', 'hadronquark', 'combustion', 'front', 'is', 'a', 'system', 'that', 'couples', 'various', 'processes', 'such', 'as', 'chemical', 'reactions', 'hydrodynamics', 'diffusion', 'and', 'neutrino', 'transport', 'previous', 'numerical', 'work', 'has', 'shown', 'that', 'this', 'system', 'is', 'very', 'nonlinear', 'and', 'can', 'be', 'very', 'sensitive', 'to', 'some', 'of', 'these', 'processes', 'in', 'these', 'proceedings', 'we', 'contextualize', 'the', 'hadronquark', 'combustion', 'as', 'a', 'nonlinear', 'system', 'subject', 'to', 'dramatic', 'feedback', 'triggered', 'by', 'leptonic', 'weak', 'decays', 'and', 'neutrino', 'transport']]
|
[-0.09360250955841576, 0.2266644455349216, -0.07989064218619694, 0.08234490650311972, -0.09334346235084992, -0.12144251036314437, 0.010735861532605038, 0.3204053615721372, -0.30063624226559815, -0.2532455859132684, 0.07748260661207426, -0.2918757941717139, -0.1446270591077896, 0.20479959679337648, 0.009440828064599862, 0.09877301399381115, 0.09274782814945166, -0.05394091501545448, -0.016752446213593848, -0.19552961784916428, 0.3380643133360606, 0.09582814840026772, 0.2050185243599117, 0.10486129210867848, 0.06973517876691543, -0.13233492579669334, -0.03112784054560157, -0.0017443004834394042, -0.11430465050619275, -0.02768430979564213, 0.24371532740501256, 0.06655712272398746, 0.1979469696489664, -0.456059085806975, -0.3094488510861993, 0.10187947599647137, 0.15557547058695212, 0.13379692309177837, -0.12761926182474082, -0.24971036759133522, 0.02396598603719702, -0.23077514172316743, -0.07719892050641088, -0.10212786845289744, -0.00730860186740756, 0.05278154796007864, -0.29046939777640196, 0.06812432229232329, 0.030127416816181862, -0.026594058252297915, -0.020877900103536937, -0.12949829422689688, -0.04119141114553293, 0.07641896759518065, 0.0712243042814617, 0.023987030137616855, 0.17296916775118845, -0.16513622362668123, -0.07349974157718511, 0.44976738818133105, -0.05526620485963157, -0.15415665077475402, 0.29562230294283764, -0.16956731439926304, -0.12923029993589108, 0.15740121302839655, 0.2502935081577072, 0.09539871788941896, -0.240366053652878, 0.022793127553618082, -0.025837091643076678, 0.14810708472505213, 0.016557513958273026, 0.01908505397060743, 0.1867684387960113, 0.27707932949639286, 0.021563022641035226, 0.0539831432281062, -0.03920512763926616, -0.08502861820161342, -0.34440384020025916, -0.12899828865551033, -0.08987314697856513, 0.09047256150067999, -0.01747768636582455, -0.13418553895809546, 0.3548626151938851, 0.15134769101412252, 0.13373929416904082, -0.08143339963773122, 0.2661121487116011, 0.12532908729850673, -0.005788585944817616, 0.04289980308654217, 0.2846113657386293, 0.18729184786072717, 0.22291386637550134, -0.30462854540405365, 0.10485553475669944, 0.06651828144318782]
|
1,803.06762
|
Towards an Efficient Anomaly-Based Intrusion Detection for
Software-Defined Networks
|
Software-defined networking (SDN) is a new paradigm that allows developing
more flexible network applications. SDN controller, which represents a
centralized controlling point, is responsible for running various network
applications as well as maintaining different network services and
functionalities. Choosing an efficient intrusion detection system helps in
reducing the overhead of the running controller and creates a more secure
network. In this study, we investigate the performance of the well-known
anomaly-based intrusion detection approaches in terms of accuracy, false alarm
rate, precision, recall, f1-measure, area under ROC curve, execution time and
Mc Nemar's test. Precisely, we focus on supervised machine-learning approaches
where we use the following classifiers: Decision Trees (DT), Extreme Learning
Machine (ELM), Naive Bayes (NB), Linear Discriminant Analysis (LDA), Neural
Networks (NN), Support Vector Machines (SVM), Random Forest (RT), K
Nearest-Neighbour (KNN), AdaBoost, RUSBoost, LogitBoost and BaggingTrees where
we employ the well-known NSL-KDD benchmark dataset to compare the performance
of each one of these classifiers.
|
cs.CR cs.LG
|
softwaredefined networking sdn is a new paradigm that allows developing more flexible network applications sdn controller which represents a centralized controlling point is responsible for running various network applications as well as maintaining different network services and functionalities choosing an efficient intrusion detection system helps in reducing the overhead of the running controller and creates a more secure network in this study we investigate the performance of the wellknown anomalybased intrusion detection approaches in terms of accuracy false alarm rate precision recall f1measure area under roc curve execution time and mc nemars test precisely we focus on supervised machinelearning approaches where we use the following classifiers decision trees dt extreme learning machine elm naive bayes nb linear discriminant analysis lda neural networks nn support vector machines svm random forest rt k nearestneighbour knn adaboost rusboost logitboost and baggingtrees where we employ the wellknown nslkdd benchmark dataset to compare the performance of each one of these classifiers
|
[['softwaredefined', 'networking', 'sdn', 'is', 'a', 'new', 'paradigm', 'that', 'allows', 'developing', 'more', 'flexible', 'network', 'applications', 'sdn', 'controller', 'which', 'represents', 'a', 'centralized', 'controlling', 'point', 'is', 'responsible', 'for', 'running', 'various', 'network', 'applications', 'as', 'well', 'as', 'maintaining', 'different', 'network', 'services', 'and', 'functionalities', 'choosing', 'an', 'efficient', 'intrusion', 'detection', 'system', 'helps', 'in', 'reducing', 'the', 'overhead', 'of', 'the', 'running', 'controller', 'and', 'creates', 'a', 'more', 'secure', 'network', 'in', 'this', 'study', 'we', 'investigate', 'the', 'performance', 'of', 'the', 'wellknown', 'anomalybased', 'intrusion', 'detection', 'approaches', 'in', 'terms', 'of', 'accuracy', 'false', 'alarm', 'rate', 'precision', 'recall', 'f1measure', 'area', 'under', 'roc', 'curve', 'execution', 'time', 'and', 'mc', 'nemars', 'test', 'precisely', 'we', 'focus', 'on', 'supervised', 'machinelearning', 'approaches', 'where', 'we', 'use', 'the', 'following', 'classifiers', 'decision', 'trees', 'dt', 'extreme', 'learning', 'machine', 'elm', 'naive', 'bayes', 'nb', 'linear', 'discriminant', 'analysis', 'lda', 'neural', 'networks', 'nn', 'support', 'vector', 'machines', 'svm', 'random', 'forest', 'rt', 'k', 'nearestneighbour', 'knn', 'adaboost', 'rusboost', 'logitboost', 'and', 'baggingtrees', 'where', 'we', 'employ', 'the', 'wellknown', 'nslkdd', 'benchmark', 'dataset', 'to', 'compare', 'the', 'performance', 'of', 'each', 'one', 'of', 'these', 'classifiers']]
|
[-0.14991542046085338, -0.04552764934402597, -0.030109790639117263, 0.060456726912487685, -0.10379210416705335, -0.2828919206618924, 0.1277474367827806, 0.42003193295669633, -0.2469795968431931, -0.2635634417597253, 0.07877407841726097, -0.2744271468248123, -0.1945494624813293, 0.21498536952323727, -0.12673695841138916, 0.16750146752803938, 0.10679373251086755, 0.06843157614393813, -0.02797318736012638, -0.34234051558781753, 0.27129067411622054, 0.09416870829987932, 0.3907206324050082, 1.9896720300198762e-06, 0.08263831228235519, 0.020527087983542254, -0.0029952015724734635, -0.024774413660180742, -0.052964493405769725, 0.14617078856401775, 0.35483131001328494, 0.2445668573884366, 0.36906329704472773, -0.3465086838605439, -0.2171725386288017, 0.10991378270646, 0.1339001620276045, 0.061721478603431024, 0.01599192065651704, -0.30892622738762143, 0.12190428883133625, -0.2086599359754473, -0.022542070302592178, -0.14132949782765242, -0.041197369596316154, 0.012812703693672628, -0.28960871890598494, -0.009206951601890388, 0.037639349526665235, 0.10221909027691785, -0.03412014102093065, -0.14498883374141192, 0.0453302425660447, 0.08286264755267214, -0.0017561791464686394, 0.06892429541814589, 0.21756513406183908, -0.16859582499842848, -0.20733378028615027, 0.32303944072238616, -0.06496932321113183, -0.1608243474507003, 0.1974083254682263, 0.07669091365578307, -0.16851388212964663, 0.06559612405147743, 0.29083019351229894, 0.0783717874766406, -0.17278012756088917, 0.02495344640957736, 0.02055048092393894, 0.1671288736028878, 0.0672651737907224, -0.029300099335514106, 0.14625993778198873, 0.3313814944817455, 0.08739329011530264, 0.12735762148974583, -0.14505281419774468, -0.08216774083867476, -0.18953286906758735, -0.14306521645781897, -0.1550785025185603, -0.012624447909788556, -0.18451076410007783, -0.16252004679945575, 0.3727986361663607, 0.23140801734883676, 0.1626865638740506, 0.1572119104320655, 0.3821579870078471, 0.051980800913834294, 0.09671074752514432, 0.17434570830853582, 0.18327151659222973, 0.04317536068983473, 0.1327061673691315, -0.16769793974054228, 0.10891982952023965, 0.052247855392006506]
|
1,803.06763
|
Differentially Private Data Release via Statistical Election to
Partition Sequentially
|
Differential Privacy (DP) formalizes privacy in mathematical terms and
provides a robust concept for privacy protection. DIfferentially Private Data
Synthesis (DIPS) techniques produce and release synthetic individual-level data
in the DP framework. One key challenge to developing DIPS methods is
preservation of the statistical utility of synthetic data, especially in
high-dimensional settings. We propose a new DIPS approach, STatistical Election
to Partition Sequentially (STEPS) that partitions data by attributes according
to their importance ranks according to either a practical or statistical
importance measure. STEPS aims to achieve better original information
preservation for the attributes with higher importance ranks and produce thus
more useful synthetic data overall. We present an algorithm to implement the
STEPS procedure and employ the privacy budget composability to ensure the
overall privacy cost is controlled at the pre-specified value. We apply the
STEPS procedure to both simulated data and the 2000-2012 Current Population
Survey youth voter data. The results suggest STEPS can better preserve the
population-level information and the original information for some analyses
compared to PrivBayes, a modified Uniform histogram approach, and the flat
Laplace sanitizer.
|
stat.AP
|
differential privacy dp formalizes privacy in mathematical terms and provides a robust concept for privacy protection differentially private data synthesis dips techniques produce and release synthetic individuallevel data in the dp framework one key challenge to developing dips methods is preservation of the statistical utility of synthetic data especially in highdimensional settings we propose a new dips approach statistical election to partition sequentially steps that partitions data by attributes according to their importance ranks according to either a practical or statistical importance measure steps aims to achieve better original information preservation for the attributes with higher importance ranks and produce thus more useful synthetic data overall we present an algorithm to implement the steps procedure and employ the privacy budget composability to ensure the overall privacy cost is controlled at the prespecified value we apply the steps procedure to both simulated data and the 20002012 current population survey youth voter data the results suggest steps can better preserve the populationlevel information and the original information for some analyses compared to privbayes a modified uniform histogram approach and the flat laplace sanitizer
|
[['differential', 'privacy', 'dp', 'formalizes', 'privacy', 'in', 'mathematical', 'terms', 'and', 'provides', 'a', 'robust', 'concept', 'for', 'privacy', 'protection', 'differentially', 'private', 'data', 'synthesis', 'dips', 'techniques', 'produce', 'and', 'release', 'synthetic', 'individuallevel', 'data', 'in', 'the', 'dp', 'framework', 'one', 'key', 'challenge', 'to', 'developing', 'dips', 'methods', 'is', 'preservation', 'of', 'the', 'statistical', 'utility', 'of', 'synthetic', 'data', 'especially', 'in', 'highdimensional', 'settings', 'we', 'propose', 'a', 'new', 'dips', 'approach', 'statistical', 'election', 'to', 'partition', 'sequentially', 'steps', 'that', 'partitions', 'data', 'by', 'attributes', 'according', 'to', 'their', 'importance', 'ranks', 'according', 'to', 'either', 'a', 'practical', 'or', 'statistical', 'importance', 'measure', 'steps', 'aims', 'to', 'achieve', 'better', 'original', 'information', 'preservation', 'for', 'the', 'attributes', 'with', 'higher', 'importance', 'ranks', 'and', 'produce', 'thus', 'more', 'useful', 'synthetic', 'data', 'overall', 'we', 'present', 'an', 'algorithm', 'to', 'implement', 'the', 'steps', 'procedure', 'and', 'employ', 'the', 'privacy', 'budget', 'composability', 'to', 'ensure', 'the', 'overall', 'privacy', 'cost', 'is', 'controlled', 'at', 'the', 'prespecified', 'value', 'we', 'apply', 'the', 'steps', 'procedure', 'to', 'both', 'simulated', 'data', 'and', 'the', '20002012', 'current', 'population', 'survey', 'youth', 'voter', 'data', 'the', 'results', 'suggest', 'steps', 'can', 'better', 'preserve', 'the', 'populationlevel', 'information', 'and', 'the', 'original', 'information', 'for', 'some', 'analyses', 'compared', 'to', 'privbayes', 'a', 'modified', 'uniform', 'histogram', 'approach', 'and', 'the', 'flat', 'laplace', 'sanitizer']]
|
[-0.05979195956541743, -0.0322985346046658, -0.09805469515267759, 0.14855634341818383, -0.1224237799553925, -0.18200180599362487, 0.12203434011769584, 0.37793417976030874, -0.27793748387032086, -0.3663124515034724, 0.09801255340959567, -0.290748353393024, -0.10923741179220896, 0.1684096215435097, -0.17236615299609387, 0.1118283877407925, 0.09472729257799478, -0.014938607646359337, -0.008094434703040557, -0.3148700996353808, 0.31031012638252126, 0.08774161710041678, 0.3730565937132471, -0.003452859632670879, 0.08193608398432843, 0.016948400009682195, -0.0721215136297461, 0.00024736812524174133, -0.12197027777522938, 0.16639824266441994, 0.3097980309226033, 0.22800830508300957, 0.336954298033379, -0.41042109046959213, -0.14621646096832894, 0.08165238136943016, 0.10602583747867256, 0.12364657658876645, -0.06997096858208857, -0.28440637129048507, 0.08354035868509932, -0.11438468987018698, -0.08635108096592982, -0.1696858196564588, -0.025759368095572832, -0.009303816273394558, -0.31412400836125015, 0.06185113693225301, 0.041148903468921263, 0.08616554675261594, -0.037022233300376683, -0.1084633531773256, -0.04376759399763412, 0.15453101315457995, 0.027735314727760852, -0.004900069841985695, 0.15512738263027537, -0.1039799315492726, -0.17763534589256677, 0.36353224153733915, -0.02114769954674153, -0.19636820703227487, 0.13449458768073883, -0.07303629531783776, -0.16131245168702055, 0.10760427613600364, 0.21542631620799915, 0.0655655848638465, -0.18044828996515005, -0.005937830273049055, 0.027390378194912853, 0.17727158267257942, -0.007090901197969086, 0.03451639608635257, 0.1649058462301683, 0.1648235064847136, 0.0877647381896774, 0.12312380489505206, -0.11054119037257301, -0.10882148077168191, -0.24106173299046027, -0.14263726094116766, -0.14457963079007136, -0.02405146767074863, -0.11866122644545006, -0.11229842935637054, 0.3895300751293285, 0.22707836421517033, 0.2152669593756501, 0.09684880667676528, 0.383283113866734, 0.06338772618910297, 0.058956614846829326, 0.07499715940017875, 0.14024226947884827, 0.06572603273024369, 0.14087344574638538, -0.17255655766089653, 0.14100025896138202, -0.0023580566069641563]
|
1,803.06764
|
Exact holographic RG flows and the $A_{1}\times A_{1}$ Toda chain
|
We construct analytic solutions of Einstein gravity coupled to a dilaton
field with a potential given by a sum of two exponentials, by rewriting the
equations of motion in terms of an integrable Toda chain. These solutions can
be interpreted as domain walls interpolating between different asymptotics, and
as such they can have interesting applications in holography. In some cases, we
can construct a solution which interpolates between an AdS fixed point in the
UV limit and a hyperscaling violating boundary in the IR region. We also find
analytic black brane solutions at finite temperature. We discuss the properties
of the solutions and the interpretation in terms of RG flow.
|
hep-th gr-qc math-ph math.MP
|
we construct analytic solutions of einstein gravity coupled to a dilaton field with a potential given by a sum of two exponentials by rewriting the equations of motion in terms of an integrable toda chain these solutions can be interpreted as domain walls interpolating between different asymptotics and as such they can have interesting applications in holography in some cases we can construct a solution which interpolates between an ads fixed point in the uv limit and a hyperscaling violating boundary in the ir region we also find analytic black brane solutions at finite temperature we discuss the properties of the solutions and the interpretation in terms of rg flow
|
[['we', 'construct', 'analytic', 'solutions', 'of', 'einstein', 'gravity', 'coupled', 'to', 'a', 'dilaton', 'field', 'with', 'a', 'potential', 'given', 'by', 'a', 'sum', 'of', 'two', 'exponentials', 'by', 'rewriting', 'the', 'equations', 'of', 'motion', 'in', 'terms', 'of', 'an', 'integrable', 'toda', 'chain', 'these', 'solutions', 'can', 'be', 'interpreted', 'as', 'domain', 'walls', 'interpolating', 'between', 'different', 'asymptotics', 'and', 'as', 'such', 'they', 'can', 'have', 'interesting', 'applications', 'in', 'holography', 'in', 'some', 'cases', 'we', 'can', 'construct', 'a', 'solution', 'which', 'interpolates', 'between', 'an', 'ads', 'fixed', 'point', 'in', 'the', 'uv', 'limit', 'and', 'a', 'hyperscaling', 'violating', 'boundary', 'in', 'the', 'ir', 'region', 'we', 'also', 'find', 'analytic', 'black', 'brane', 'solutions', 'at', 'finite', 'temperature', 'we', 'discuss', 'the', 'properties', 'of', 'the', 'solutions', 'and', 'the', 'interpretation', 'in', 'terms', 'of', 'rg', 'flow']]
|
[-0.15863771558400583, 0.08780168790439016, -0.09540436334315348, 0.09053858975795183, -0.06803623405920173, -0.1292987263465131, 0.0036666892976923425, 0.32163556609302757, -0.2349082735155455, -0.24000381981445984, 0.13812659742120145, -0.30521627697585657, -0.15049183247187597, 0.16389184307137675, -0.05032790057937911, 0.04259949601255357, -0.024790158224376767, 0.03733624010770158, -0.1322538904263638, -0.187791822118346, 0.33658360596746206, -0.048123317702927375, 0.22432070427828216, 0.055773812794888564, 0.10437177661806345, -0.041912677507339555, 0.025318124852227893, 0.07143336164416807, -0.17999245994301005, 0.06430206555365162, 0.27147739034315405, 0.0781525608744811, 0.18660290898670526, -0.42161301649598915, -0.2156491829505698, 0.09940880487926981, 0.22585924222896045, 0.13452667177718303, -0.05660973364931785, -0.2733068493279544, 0.03886969293975694, -0.1646938890684396, -0.18775237328796224, -0.08717832536521283, 0.011061911899808118, 0.04362576200034131, -0.26997872735797, 0.05309015343743588, 0.009259437056342986, 0.019985630363225936, -0.11313233554828912, -0.03040454779666933, -0.03099800543859601, 0.0971234083768319, 0.11752382187405601, 0.03382355039092627, 0.06509350623977794, -0.19559935923581095, -0.12278467927720736, 0.3456018613651395, -0.12748451761224053, -0.28236432334577494, 0.2010061153041368, -0.13495089652609418, -0.08859850975092162, 0.0724143275483088, 0.1278173476161266, 0.1540726122234694, -0.16526373820379375, 0.1835193934580523, -0.03237162200120193, 0.11748459611897653, 0.1360261337916282, 0.052077176040885124, 0.2991394390436736, 0.08324078564447436, 0.04440424707189033, 0.19587015028598465, -0.0002511140191927552, -0.13047188150865788, -0.4035229179500179, -0.14950624825856226, -0.12144471897150982, 0.10176279780200936, -0.19879435573410856, -0.19367416110736402, 0.36401119440455326, 0.11205366078251741, 0.19603283519179307, 0.03804650890154087, 0.1860644539987499, 0.16623164367735047, 0.04875723914751275, 0.08833123613572257, 0.24570438091309785, 0.1015616783131422, 0.10931801480791446, -0.23160700288347222, -0.08810360197147185, 0.16167996007610452]
|
1,803.06765
|
Sparse Regularization via Convex Analysis
|
Sparse approximate solutions to linear equations are classically obtained via
L1 norm regularized least squares, but this method often underestimates the
true solution. As an alternative to the L1 norm, this paper proposes a class of
non-convex penalty functions that maintain the convexity of the least squares
cost function to be minimized, and avoids the systematic underestimation
characteristic of L1 norm regularization. The proposed penalty function is a
multivariate generalization of the minimax-concave (MC) penalty. It is defined
in terms of a new multivariate generalization of the Huber function, which in
turn is defined via infimal convolution. The proposed sparse-regularized least
squares cost function can be minimized by proximal algorithms comprising simple
computations.
|
math.OC
|
sparse approximate solutions to linear equations are classically obtained via l1 norm regularized least squares but this method often underestimates the true solution as an alternative to the l1 norm this paper proposes a class of nonconvex penalty functions that maintain the convexity of the least squares cost function to be minimized and avoids the systematic underestimation characteristic of l1 norm regularization the proposed penalty function is a multivariate generalization of the minimaxconcave mc penalty it is defined in terms of a new multivariate generalization of the huber function which in turn is defined via infimal convolution the proposed sparseregularized least squares cost function can be minimized by proximal algorithms comprising simple computations
|
[['sparse', 'approximate', 'solutions', 'to', 'linear', 'equations', 'are', 'classically', 'obtained', 'via', 'l1', 'norm', 'regularized', 'least', 'squares', 'but', 'this', 'method', 'often', 'underestimates', 'the', 'true', 'solution', 'as', 'an', 'alternative', 'to', 'the', 'l1', 'norm', 'this', 'paper', 'proposes', 'a', 'class', 'of', 'nonconvex', 'penalty', 'functions', 'that', 'maintain', 'the', 'convexity', 'of', 'the', 'least', 'squares', 'cost', 'function', 'to', 'be', 'minimized', 'and', 'avoids', 'the', 'systematic', 'underestimation', 'characteristic', 'of', 'l1', 'norm', 'regularization', 'the', 'proposed', 'penalty', 'function', 'is', 'a', 'multivariate', 'generalization', 'of', 'the', 'minimaxconcave', 'mc', 'penalty', 'it', 'is', 'defined', 'in', 'terms', 'of', 'a', 'new', 'multivariate', 'generalization', 'of', 'the', 'huber', 'function', 'which', 'in', 'turn', 'is', 'defined', 'via', 'infimal', 'convolution', 'the', 'proposed', 'sparseregularized', 'least', 'squares', 'cost', 'function', 'can', 'be', 'minimized', 'by', 'proximal', 'algorithms', 'comprising', 'simple', 'computations']]
|
[-0.07630886441423886, -0.016958748530423444, -0.1048460175891025, 0.14259273410032228, -0.09406778810394777, -0.1495809477233739, 0.003197356354789221, 0.35968035545099425, -0.37306088591749603, -0.26451216322193677, 0.1456381694396941, -0.24856910310677244, -0.19699093293365058, 0.11963502615522426, -0.16483943698810297, 0.12326929314682881, 0.06094392158535754, -0.0192647725595413, -0.16202534792990936, -0.30356965068022945, 0.2589022043949782, 0.051243975313867, 0.1922017924890325, 0.019991566341051512, 0.15051542236973103, 0.024059895347375924, 0.0004933270990747858, 0.03336149029410654, -0.05945749102855943, 0.1413566923180075, 0.2808280502831949, 0.16700191086007132, 0.4261076097619963, -0.36688826125752816, -0.17575428056790754, 0.1792179384344333, 0.13160795842188303, -0.009062951542898543, 0.01549880016964298, -0.18169653363450355, 0.08242836160593675, -0.16606435902953684, -0.11412775386879975, -0.11113116905714075, -0.08968768212189143, 0.039291099087242876, -0.39107802495159005, 0.12118410492349449, 0.03408482419914222, 0.02207946902490221, -0.0620527360441482, -0.21092145498170778, 0.04098676356092632, -0.012170163864219511, 0.11373918763825172, 0.11851094173569535, 0.07669024533164259, -0.06814174040698924, -0.08175896875652577, 0.29735346295375814, -0.06307537602848029, -0.3145173228270299, 0.11572555248701089, -0.059099368018995936, -0.07049793298754774, 0.14048741639986098, 0.17841032945743954, 0.17700093702270506, -0.1930927463328919, 0.07600016760176283, -0.054304676327585906, 0.13234898244945315, 0.07987673472936123, 0.014336110440896707, 0.06201357670497518, 0.12617833669263837, 0.21239955557996895, 0.1777192215405841, -0.05237619589326215, -0.09623812065199688, -0.33586084771783903, -0.12941084505344094, -0.2752398749947682, -0.010341974478718397, -0.14809383493457473, -0.23015213559742445, 0.3582271075018824, 0.048299089984481666, 0.17927075653160746, 0.12553329722272014, 0.32912907823249027, 0.21082976253321478, 0.11369165675798515, 0.0941089656254327, 0.19009389186504524, 0.14612856001366634, -0.01503920803047918, -0.23290211940393993, 0.09195289920663109, 0.20584026989233387]
|
1,803.06766
|
Automated Localization for Unreproducible Builds
|
Reproducibility is the ability of recreating identical binaries under
pre-defined build environments. Due to the need of quality assurance and the
benefit of better detecting attacks against build environments, the practice of
reproducible builds has gained popularity in many open-source software
repositories such as Debian and Bitcoin. However, identifying the
unreproducible issues remains a labour intensive and time consuming challenge,
because of the lacking of information to guide the search and the diversity of
the causes that may lead to the unreproducible binaries.
In this paper we propose an automated framework called RepLoc to localize the
problematic files for unreproducible builds. RepLoc features a query
augmentation component that utilizes the information extracted from the build
logs, and a heuristic rule-based filtering component that narrows the search
scope. By integrating the two components with a weighted file ranking module,
RepLoc is able to automatically produce a ranked list of files that are helpful
in locating the problematic files for the unreproducible builds. We have
implemented a prototype and conducted extensive experiments over 671 real-world
unreproducible Debian packages in four different categories. By considering the
topmost ranked file only, RepLoc achieves an accuracy rate of 47.09%. If we
expand our examination to the top ten ranked files in the list produced by
RepLoc, the accuracy rate becomes 79.28%. Considering that there are hundreds
of source code, scripts, Makefiles, etc., in a package, RepLoc significantly
reduces the scope of localizing problematic files. Moreover, with the help of
RepLoc, we successfully identified and fixed six new unreproducible packages
from Debian and Guix.
|
cs.SE
|
reproducibility is the ability of recreating identical binaries under predefined build environments due to the need of quality assurance and the benefit of better detecting attacks against build environments the practice of reproducible builds has gained popularity in many opensource software repositories such as debian and bitcoin however identifying the unreproducible issues remains a labour intensive and time consuming challenge because of the lacking of information to guide the search and the diversity of the causes that may lead to the unreproducible binaries in this paper we propose an automated framework called reploc to localize the problematic files for unreproducible builds reploc features a query augmentation component that utilizes the information extracted from the build logs and a heuristic rulebased filtering component that narrows the search scope by integrating the two components with a weighted file ranking module reploc is able to automatically produce a ranked list of files that are helpful in locating the problematic files for the unreproducible builds we have implemented a prototype and conducted extensive experiments over 671 realworld unreproducible debian packages in four different categories by considering the topmost ranked file only reploc achieves an accuracy rate of 4709 if we expand our examination to the top ten ranked files in the list produced by reploc the accuracy rate becomes 7928 considering that there are hundreds of source code scripts makefiles etc in a package reploc significantly reduces the scope of localizing problematic files moreover with the help of reploc we successfully identified and fixed six new unreproducible packages from debian and guix
|
[['reproducibility', 'is', 'the', 'ability', 'of', 'recreating', 'identical', 'binaries', 'under', 'predefined', 'build', 'environments', 'due', 'to', 'the', 'need', 'of', 'quality', 'assurance', 'and', 'the', 'benefit', 'of', 'better', 'detecting', 'attacks', 'against', 'build', 'environments', 'the', 'practice', 'of', 'reproducible', 'builds', 'has', 'gained', 'popularity', 'in', 'many', 'opensource', 'software', 'repositories', 'such', 'as', 'debian', 'and', 'bitcoin', 'however', 'identifying', 'the', 'unreproducible', 'issues', 'remains', 'a', 'labour', 'intensive', 'and', 'time', 'consuming', 'challenge', 'because', 'of', 'the', 'lacking', 'of', 'information', 'to', 'guide', 'the', 'search', 'and', 'the', 'diversity', 'of', 'the', 'causes', 'that', 'may', 'lead', 'to', 'the', 'unreproducible', 'binaries', 'in', 'this', 'paper', 'we', 'propose', 'an', 'automated', 'framework', 'called', 'reploc', 'to', 'localize', 'the', 'problematic', 'files', 'for', 'unreproducible', 'builds', 'reploc', 'features', 'a', 'query', 'augmentation', 'component', 'that', 'utilizes', 'the', 'information', 'extracted', 'from', 'the', 'build', 'logs', 'and', 'a', 'heuristic', 'rulebased', 'filtering', 'component', 'that', 'narrows', 'the', 'search', 'scope', 'by', 'integrating', 'the', 'two', 'components', 'with', 'a', 'weighted', 'file', 'ranking', 'module', 'reploc', 'is', 'able', 'to', 'automatically', 'produce', 'a', 'ranked', 'list', 'of', 'files', 'that', 'are', 'helpful', 'in', 'locating', 'the', 'problematic', 'files', 'for', 'the', 'unreproducible', 'builds', 'we', 'have', 'implemented', 'a', 'prototype', 'and', 'conducted', 'extensive', 'experiments', 'over', '671', 'realworld', 'unreproducible', 'debian', 'packages', 'in', 'four', 'different', 'categories', 'by', 'considering', 'the', 'topmost', 'ranked', 'file', 'only', 'reploc', 'achieves', 'an', 'accuracy', 'rate', 'of', '4709', 'if', 'we', 'expand', 'our', 'examination', 'to', 'the', 'top', 'ten', 'ranked', 'files', 'in', 'the', 'list', 'produced', 'by', 'reploc', 'the', 'accuracy', 'rate', 'becomes', '7928', 'considering', 'that', 'there', 'are', 'hundreds', 'of', 'source', 'code', 'scripts', 'makefiles', 'etc', 'in', 'a', 'package', 'reploc', 'significantly', 'reduces', 'the', 'scope', 'of', 'localizing', 'problematic', 'files', 'moreover', 'with', 'the', 'help', 'of', 'reploc', 'we', 'successfully', 'identified', 'and', 'fixed', 'six', 'new', 'unreproducible', 'packages', 'from', 'debian', 'and', 'guix']]
|
[-0.09136784207057715, 0.014644997677397062, -0.056081952387648216, 0.05717265781455452, -0.10522474387410578, -0.15325074557193233, 0.078841842912547, 0.3810822956956169, -0.23084656122876224, -0.3639752804211084, 0.10122224251949863, -0.3037576516483211, -0.09223214347379333, 0.20508440946145454, -0.09540404254708308, 0.04775915960536668, 0.1189884275849365, 0.007265072858145874, -0.020416078439588453, -0.3055992549564327, 0.28416830629603174, 0.09860217854188545, 0.3026799748702417, 0.03885620616803105, 0.06781335282710232, 0.013884537109963829, -0.11939599189602912, -0.011457681261340034, -0.04079869032471331, 0.139400505619341, 0.33076786907962324, 0.24801752879827896, 0.3100201990781533, -0.3828963390714579, -0.15011371245810667, 0.04834973163070866, 0.14900902154695075, 0.07970395762154449, -0.062035677384255375, -0.29937778883668004, 0.13146127772187735, -0.23436999148036922, -0.07303343680487938, -0.09830901291717845, -0.0015944164619574519, 0.024151660153163952, -0.23808722133686627, -0.01182948886634282, 0.024106358691297132, 0.06540676587485937, -0.0023823871751993547, -0.11247311931117963, -0.01275013033246281, 0.18652001464493023, 0.0484139978632436, 0.0386616234465571, 0.16955039915284467, -0.12195493230063482, -0.12188896441701727, 0.3990745047426235, -0.03831234292022101, -0.1578610121872247, 0.19836607223407435, -0.024712393246953474, -0.16281231221605222, 0.14980325406482478, 0.18966201889638495, 0.09905843836335096, -0.19360851404412943, 0.026277065565193557, 0.007475491866817271, 0.23036403241630732, 0.0732981528722634, -0.0006921815095697657, 0.19269816648461474, 0.20376868992101704, -0.017631502330588796, 0.1627142369187281, -0.09286515017362594, -0.05002767445722501, -0.20577274412478425, -0.13946789544952692, -0.13715645379535418, -0.04043317395389254, -0.054080270350809256, -0.17325825562903563, 0.4123708321006266, 0.23304661203054386, 0.14526891771836228, 0.053819163787588185, 0.31911647807107335, -0.018301487764423342, 0.13865309011133148, 0.13145144294642985, 0.15030894137317394, -0.03229403836065577, 0.12683289992357585, -0.14175279546847952, 0.11080648146156613, 0.0014423351836343684]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.