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.02067 | On cycles of pairing-friendly elliptic curves | A cycle of elliptic curves is a list of elliptic curves over finite fields
such that the number of points on one curve is equal to the size of the field
of definition of the next, in a cyclic way. We study cycles of elliptic curves
in which every curve is pairing-friendly. These have recently found notable
applications in pairing-based cryptography, for instance in improving the
scalability of distributed ledger technologies. We construct a new cycle of
length 4 consisting of MNT curves, and characterize all the possibilities for
cycles consisting of MNT curves. We rule out cycles of length 2 for particular
choices of small embedding degrees. We show that long cycles cannot be
constructed from families of curves with the same complex multiplication
discriminant, and that cycles of composite order elliptic curves cannot exist.
We show that there are no cycles consisting of curves from only the Freeman or
Barreto--Naehrig families.
| math.NT math.AG | a cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next in a cyclic way we study cycles of elliptic curves in which every curve is pairingfriendly these have recently found notable applications in pairingbased cryptography for instance in improving the scalability of distributed ledger technologies we construct a new cycle of length 4 consisting of mnt curves and characterize all the possibilities for cycles consisting of mnt curves we rule out cycles of length 2 for particular choices of small embedding degrees we show that long cycles cannot be constructed from families of curves with the same complex multiplication discriminant and that cycles of composite order elliptic curves cannot exist we show that there are no cycles consisting of curves from only the freeman or barretonaehrig families | [['a', 'cycle', 'of', 'elliptic', 'curves', 'is', 'a', 'list', 'of', 'elliptic', 'curves', 'over', 'finite', 'fields', 'such', 'that', 'the', 'number', 'of', 'points', 'on', 'one', 'curve', 'is', 'equal', 'to', 'the', 'size', 'of', 'the', 'field', 'of', 'definition', 'of', 'the', 'next', 'in', 'a', 'cyclic', 'way', 'we', 'study', 'cycles', 'of', 'elliptic', 'curves', 'in', 'which', 'every', 'curve', 'is', 'pairingfriendly', 'these', 'have', 'recently', 'found', 'notable', 'applications', 'in', 'pairingbased', 'cryptography', 'for', 'instance', 'in', 'improving', 'the', 'scalability', 'of', 'distributed', 'ledger', 'technologies', 'we', 'construct', 'a', 'new', 'cycle', 'of', 'length', '4', 'consisting', 'of', 'mnt', 'curves', 'and', 'characterize', 'all', 'the', 'possibilities', 'for', 'cycles', 'consisting', 'of', 'mnt', 'curves', 'we', 'rule', 'out', 'cycles', 'of', 'length', '2', 'for', 'particular', 'choices', 'of', 'small', 'embedding', 'degrees', 'we', 'show', 'that', 'long', 'cycles', 'can', 'not', 'be', 'constructed', 'from', 'families', 'of', 'curves', 'with', 'the', 'same', 'complex', 'multiplication', 'discriminant', 'and', 'that', 'cycles', 'of', 'composite', 'order', 'elliptic', 'curves', 'can', 'not', 'exist', 'we', 'show', 'that', 'there', 'are', 'no', 'cycles', 'consisting', 'of', 'curves', 'from', 'only', 'the', 'freeman', 'or', 'barretonaehrig', 'families']] | [-0.23653443430568538, 0.11355904746776471, -0.10313597738488832, 0.0310713122167939, -0.0211303167788965, -0.1266685987145386, 0.040963397214685074, 0.3634057166780551, -0.2737015265814186, -0.27918083636791674, 0.11045280118267257, -0.2705042368153907, -0.15115363040316077, 0.31242425890046766, -0.12344707227795833, 0.018137397504617254, 0.07191291860570866, 0.054935213123968284, -0.0595319663059547, -0.3202549129022987, 0.3281600826152286, -0.07821628945885686, 0.19449143831893292, -0.0021575635643796874, 0.07863625691139273, 0.05148108050154595, -0.010169708850346022, 0.03144027246162295, -0.12006383197016972, 0.15272269765665006, 0.25768971465552204, 0.12181602404210959, 0.17032641841267998, -0.3748043174029543, -0.2413929808361746, 0.22495281533640507, 0.11641576260709288, 0.07728016717803919, 0.001987456089315041, -0.1154727453635038, 0.1324850179787193, -0.12743029871036288, -0.17636535774807555, -0.07074426064364515, 0.09377259971322975, 0.10621049468157595, -0.20727164963526384, -0.02586134277396025, 0.08779029504550234, 0.15569176916909924, -0.015011364929740886, -0.11305579810415382, -0.02703525880412138, 0.10230003991738784, 0.024441460886812927, -0.011773106304916566, 0.0298230547919815, -0.11332897358428833, -0.15326019742393068, 0.36015907866130403, -0.07234661879589442, -0.11315931637118293, 0.12263959104515758, -0.11020738784338699, -0.1298772767549018, 0.16409126284393155, 0.17194733404639093, 0.15215633259239522, -0.10909330561853849, 0.08431498903415299, -0.08035643252562248, 0.17591929247046445, 0.11909768894592954, -0.005483935548555009, 0.2027245650382398, 0.1089706481298335, 0.06275905406423059, 0.11292548390942952, -0.062389645557669175, -0.08694237264707781, -0.3390582665474481, -0.17616667122846202, -0.10725289681856823, 0.0959894708268928, -0.11627199466914005, -0.1874795169690503, 0.4530711377934589, 0.05859483988326672, 0.21303145922780908, 0.031011971255746222, 0.22580487241472613, 0.07301979765670931, 0.11333587699775378, 0.12280858130052129, 0.19050036030881978, 0.10721438745937806, 0.008827129287445652, -0.15297962819504274, 0.0094191734535414, 0.09175790390967355] |
1,803.02068 | Infinite energy solutions to the Navier-Stokes equations in the
half-space and applications | This short note serves as an introduction to the papers arXiv:1711.01651 and
arXiv:1711.04486 by Maekawa, Miura and Prange. These two works deal with the
existence of mild solutions on the one hand and local energy weak solutions on
the other hand to the Navier-Stokes equations in the half-space $\R^3_+$. We
emphasize a concentration result for (sub)critical norms near a potential
singularity. The contents of these notes were presented during the X-EDP
seminar at IH\'ES in October 2017.
| math.AP | this short note serves as an introduction to the papers arxiv171101651 and arxiv171104486 by maekawa miura and prange these two works deal with the existence of mild solutions on the one hand and local energy weak solutions on the other hand to the navierstokes equations in the halfspace r3_ we emphasize a concentration result for subcritical norms near a potential singularity the contents of these notes were presented during the xedp seminar at ihes in october 2017 | [['this', 'short', 'note', 'serves', 'as', 'an', 'introduction', 'to', 'the', 'papers', 'arxiv171101651', 'and', 'arxiv171104486', 'by', 'maekawa', 'miura', 'and', 'prange', 'these', 'two', 'works', 'deal', 'with', 'the', 'existence', 'of', 'mild', 'solutions', 'on', 'the', 'one', 'hand', 'and', 'local', 'energy', 'weak', 'solutions', 'on', 'the', 'other', 'hand', 'to', 'the', 'navierstokes', 'equations', 'in', 'the', 'halfspace', 'r3_', 'we', 'emphasize', 'a', 'concentration', 'result', 'for', 'subcritical', 'norms', 'near', 'a', 'potential', 'singularity', 'the', 'contents', 'of', 'these', 'notes', 'were', 'presented', 'during', 'the', 'xedp', 'seminar', 'at', 'ihes', 'in', 'october', '2017']] | [-0.11279801368348401, 0.05411817715837576, -0.09076718249628823, 0.05954981506393115, -0.07327549525763134, -0.11625413834494916, -0.010473626499013925, 0.27830877545214183, -0.2384422545044406, -0.27940775748543645, 0.1794646458505225, -0.32946558601248105, -0.12700898277673972, 0.1787185864774762, -0.10391250194830669, 0.017275959146334917, 0.06744747745609414, 0.024740689780210722, -0.0653019433690084, -0.311947310022456, 0.3636621105912569, 0.052348169825367025, 0.24681975613222332, 0.09033717329588693, 0.0825520179775619, -0.01232989617887683, -0.028847409525533784, -0.02629072597955127, -0.1875169465972765, 0.0938068383563675, 0.24644134372372078, 0.04174119984491955, 0.2983170892741229, -0.45952224681103554, -0.15089194876506823, 0.04494430671597051, 0.06909579068825052, 0.09510117299804413, -0.057826053124625944, -0.3182994064849776, 0.05042517217933326, -0.09994066760850114, -0.16728572650007098, 0.006820557255146874, 0.03055181259893485, 0.09087250278507536, -0.21428721400632247, 0.08676034819989188, 0.09781341235832991, 0.062164897634018515, -0.12334327098977992, -0.10807603670636544, 0.0014439702029670337, 0.07511123980873742, 0.09467086685204727, 0.03988509680572394, 0.04208225727307837, -0.11915387318633194, -0.061398574472027456, 0.30984881706535816, -0.08117318007390241, -0.15932939013126432, 0.24015923602053443, -0.11514153819833253, -0.1724712333446872, 0.07438974395847402, 0.16773894466333897, 0.12900163972674794, -0.13481366779101459, 0.11163471828960511, -0.044233486326324845, 0.1461144044989015, 0.14043046788287325, -0.02558728389290942, 0.14152639011877613, 0.0831425402602936, 0.07122468061090724, 0.07750701837672701, -0.040050590631073794, -0.07780911780365214, -0.3555740897820608, -0.16823192502095088, -0.1354468983245661, 0.05836262667199244, -0.03038144721968156, -0.12942152264263682, 0.3918293439437056, 0.1179695698508137, 0.17717181232355134, 0.01281098383352966, 0.19858849022185077, 0.11730427940130687, 0.00271883634834651, 0.0629306159460464, 0.22925695672794874, 0.09914394292502186, 0.2101196433870575, -0.14640305955214677, 0.011566123349365551, 0.16800335851321752] |
1,803.02069 | Sequences of consecutive squares on quartic elliptic curves | Let $C: y^2=ax^4+bx^2+c$, be an elliptic curve defined over $\mathbb Q$. A
set of rational points $(x_i,y_i) \in C(\mathbb Q)$, $i=1,2,\cdots,$ is said to
be a sequence of consecutive squares if $x_i= (u + i)^2$, $i=1,2,\cdots$, for
some $u\in \mathbb Q$. Using ideas of Mestre, we construct infinitely many
elliptic curves $C$ with sequences of consecutive squares of length at least
$6$. It turns out that these 6 rational points are independent. We then
strengthen this result by proving that for a fixed $6$-term sequence of
consecutive squares, there are infinitely many elliptic curves $C$ with the
latter sequence forming the $x$-coordinates of six rational points in
$C(\mathbb Q)$.
| math.NT | let c y2ax4bx2c be an elliptic curve defined over mathbb q a set of rational points x_iy_i in cmathbb q i12cdots is said to be a sequence of consecutive squares if x_i u i2 i12cdots for some uin mathbb q using ideas of mestre we construct infinitely many elliptic curves c with sequences of consecutive squares of length at least 6 it turns out that these 6 rational points are independent we then strengthen this result by proving that for a fixed 6term sequence of consecutive squares there are infinitely many elliptic curves c with the latter sequence forming the xcoordinates of six rational points in cmathbb q | [['let', 'c', 'y2ax4bx2c', 'be', 'an', 'elliptic', 'curve', 'defined', 'over', 'mathbb', 'q', 'a', 'set', 'of', 'rational', 'points', 'x_iy_i', 'in', 'cmathbb', 'q', 'i12cdots', 'is', 'said', 'to', 'be', 'a', 'sequence', 'of', 'consecutive', 'squares', 'if', 'x_i', 'u', 'i2', 'i12cdots', 'for', 'some', 'uin', 'mathbb', 'q', 'using', 'ideas', 'of', 'mestre', 'we', 'construct', 'infinitely', 'many', 'elliptic', 'curves', 'c', 'with', 'sequences', 'of', 'consecutive', 'squares', 'of', 'length', 'at', 'least', '6', 'it', 'turns', 'out', 'that', 'these', '6', 'rational', 'points', 'are', 'independent', 'we', 'then', 'strengthen', 'this', 'result', 'by', 'proving', 'that', 'for', 'a', 'fixed', '6term', 'sequence', 'of', 'consecutive', 'squares', 'there', 'are', 'infinitely', 'many', 'elliptic', 'curves', 'c', 'with', 'the', 'latter', 'sequence', 'forming', 'the', 'xcoordinates', 'of', 'six', 'rational', 'points', 'in', 'cmathbb', 'q']] | [-0.23587487776389468, 0.1063484816441245, -0.08550299514763962, -0.013510073979045743, 0.002928617303738388, -0.21828648352246977, 0.01102153837972399, 0.3644072014281404, -0.34945467218895937, -0.18754161061353494, 0.09235984729559413, -0.3618639962591022, -0.10101050675071985, 0.20821847333181126, -0.10554422498201933, 0.04645084759773182, 0.03230658952564558, 0.07044475507774503, -0.057795207982308396, -0.38120510044429345, 0.3212958842898919, -0.20641561743812026, 0.08029555999804462, -0.024234454308540744, 0.09300550504665926, 0.048052600698075564, 0.01695960736615914, -0.03456632927208094, -0.16306071050933488, 0.07805519601956845, 0.3165908336669868, 0.09686042063168596, 0.2807939148325229, -0.32882545340075114, -0.12577086744534077, 0.27668732240639415, 0.1993934092346892, -0.07147301146847622, 0.027002110524607874, -0.15507975730731666, 0.17048598298037024, -0.08960694219660292, -0.1943708952760028, -0.031300851079704956, 0.1270850624619313, 0.10515861372489517, -0.3234870563235099, -0.0495765332794078, 0.10909064869270181, 0.16065833320684522, 0.04135039717254934, -0.20584467715348734, -0.06764342111239437, 0.06249245086458521, 0.040525085545171084, 0.15908612420120946, -0.004218465683407315, -0.01869810811487662, -0.09422187918849359, 0.31910586882835235, -0.037695728782042165, -0.19985373621092778, 0.0703276962881786, -0.15927369634035504, -0.14080442579584979, 0.1785740813884501, 0.0687544752156066, 0.16962090923198472, -0.03570758964361571, 0.15181550486274412, -0.14885647369496455, 0.15184151323155334, 0.16658585482912364, -0.06397874653339386, 0.19723524526414402, -0.0019008163602100075, 0.06783900035123089, 0.06770583582284782, -0.0071655656646275635, -0.022300598307329916, -0.3907191723445866, -0.11994826241840269, -0.14281257910427647, 0.16465347841660552, -0.14591490658365677, -0.1796541888762927, 0.3261075947329263, 0.034507109339688424, 0.2547921584919095, 0.08237331215222583, 0.17109842182824683, 0.09190140602684245, 0.010997445640267334, 0.10605522499759203, 0.06261978273973016, 0.10826328485468664, -0.06426051027189383, -0.13217858267321347, -0.01582341594621539, 0.1972103579161323] |
1,803.0207 | SOS-Convex Lyapunov Functions and Stability of Difference Inclusions | We introduce the concept of sos-convex Lyapunov functions for stability
analysis of both linear and nonlinear difference inclusions (also known as
discrete-time switched systems). These are polynomial Lyapunov functions that
have an algebraic certificate of convexity and that can be efficiently found
via semidefinite programming. We prove that sos-convex Lyapunov functions are
universal (i.e., necessary and sufficient) for stability analysis of switched
linear systems. We show via an explicit example however that the minimum degree
of a convex polynomial Lyapunov function can be arbitrarily higher than a
non-convex polynomial Lyapunov function. In the case of switched nonlinear
systems, we prove that existence of a common non-convex Lyapunov function does
not imply stability, but existence of a common convex Lyapunov function does.
We then provide a semidefinite programming-based procedure for computing a
full-dimensional subset of the region of attraction of equilibrium points of
switched polynomial systems, under the condition that their linearization be
stable. We conclude by showing that our semidefinite program can be extended to
search for Lyapunov functions that are pointwise maxima of sos-convex
polynomials.
| math.OC cs.SY math.DS | we introduce the concept of sosconvex lyapunov functions for stability analysis of both linear and nonlinear difference inclusions also known as discretetime switched systems these are polynomial lyapunov functions that have an algebraic certificate of convexity and that can be efficiently found via semidefinite programming we prove that sosconvex lyapunov functions are universal ie necessary and sufficient for stability analysis of switched linear systems we show via an explicit example however that the minimum degree of a convex polynomial lyapunov function can be arbitrarily higher than a nonconvex polynomial lyapunov function in the case of switched nonlinear systems we prove that existence of a common nonconvex lyapunov function does not imply stability but existence of a common convex lyapunov function does we then provide a semidefinite programmingbased procedure for computing a fulldimensional subset of the region of attraction of equilibrium points of switched polynomial systems under the condition that their linearization be stable we conclude by showing that our semidefinite program can be extended to search for lyapunov functions that are pointwise maxima of sosconvex polynomials | [['we', 'introduce', 'the', 'concept', 'of', 'sosconvex', 'lyapunov', 'functions', 'for', 'stability', 'analysis', 'of', 'both', 'linear', 'and', 'nonlinear', 'difference', 'inclusions', 'also', 'known', 'as', 'discretetime', 'switched', 'systems', 'these', 'are', 'polynomial', 'lyapunov', 'functions', 'that', 'have', 'an', 'algebraic', 'certificate', 'of', 'convexity', 'and', 'that', 'can', 'be', 'efficiently', 'found', 'via', 'semidefinite', 'programming', 'we', 'prove', 'that', 'sosconvex', 'lyapunov', 'functions', 'are', 'universal', 'ie', 'necessary', 'and', 'sufficient', 'for', 'stability', 'analysis', 'of', 'switched', 'linear', 'systems', 'we', 'show', 'via', 'an', 'explicit', 'example', 'however', 'that', 'the', 'minimum', 'degree', 'of', 'a', 'convex', 'polynomial', 'lyapunov', 'function', 'can', 'be', 'arbitrarily', 'higher', 'than', 'a', 'nonconvex', 'polynomial', 'lyapunov', 'function', 'in', 'the', 'case', 'of', 'switched', 'nonlinear', 'systems', 'we', 'prove', 'that', 'existence', 'of', 'a', 'common', 'nonconvex', 'lyapunov', 'function', 'does', 'not', 'imply', 'stability', 'but', 'existence', 'of', 'a', 'common', 'convex', 'lyapunov', 'function', 'does', 'we', 'then', 'provide', 'a', 'semidefinite', 'programmingbased', 'procedure', 'for', 'computing', 'a', 'fulldimensional', 'subset', 'of', 'the', 'region', 'of', 'attraction', 'of', 'equilibrium', 'points', 'of', 'switched', 'polynomial', 'systems', 'under', 'the', 'condition', 'that', 'their', 'linearization', 'be', 'stable', 'we', 'conclude', 'by', 'showing', 'that', 'our', 'semidefinite', 'program', 'can', 'be', 'extended', 'to', 'search', 'for', 'lyapunov', 'functions', 'that', 'are', 'pointwise', 'maxima', 'of', 'sosconvex', 'polynomials']] | [-0.20023618112926753, 0.03366815807996979, -0.14871992326913064, 0.10836180996439411, -0.07139035300166473, -0.19542561038344336, 0.030561419160221703, 0.3230810706882039, -0.3580826092088087, -0.17793920724811454, 0.18550124436825915, -0.20675576911889948, -0.24120113949968733, 0.22293968006984374, -0.03611641442148539, 0.14653042676086028, 0.027565363043157213, -0.017238411953009992, -0.12060244139601392, -0.27125694048035337, 0.333169114717748, -0.03724501376696439, 0.17139614225280556, 0.0790503417477091, 0.11692006131422451, 0.009893173730233684, 0.052444089290061544, 0.07448083214959214, -0.10496640386521573, 0.09104154141492803, 0.3095046993297398, 0.20294119560276158, 0.33268123447090725, -0.39091518779539247, -0.13535493985347619, 0.19664768010063033, 0.1620497010537127, 0.043331137919184665, -0.0465398247549522, -0.2260843427277657, 0.15539323475042527, -0.11697441992286754, -0.1545736576650101, -0.15471936183761995, 0.0005815358232542745, 0.09849146919904425, -0.3541579856722489, 0.0591970731420588, 0.09733682171843777, 0.09398796093988825, -0.09702658619260712, -0.11499476580369943, -0.06008204947019377, 0.01976900634922045, -0.013120013453193347, -0.00547441168402491, 0.1312480818120424, -0.015199141909595875, -0.13300940352333288, 0.2862781262268651, -0.04163672133199725, -0.27859713705203665, 0.1661744859481008, -0.11836449746359987, -0.13921615504659712, 0.12811933671367692, 0.21320509123060302, 0.17361665856812827, -0.1469024777179584, 0.11361877138320282, -0.09675208862278271, 0.1873423998159441, 0.06224730383308435, 0.04766648075416346, 0.148575332965596, 0.06788422397221439, 0.22893330399925949, 0.18678256070548246, 0.055317076552786275, -0.12301644328346645, -0.31151202747026796, -0.13254557237418008, -0.20874868967274035, 0.04862923451326589, -0.13293006656460254, -0.19836543027883058, 0.4021867486722344, 0.06074555934967727, 0.13174385171309536, 0.20498492717425423, 0.24752747422264126, 0.21585658561029544, 0.03627886169256685, 0.09182570237052542, 0.25584600908702915, 0.1252373997823187, 0.044916432567829775, -0.22605595047934912, 0.0995634099923667, 0.12317444903204557] |
1,803.02071 | Coupled charge and spin dynamics in a photo-excited Mott insulator | Using a nonequilibrium implementation of the extended dynamical mean field
theory (EDMFT) we simulate the relaxation after photo excitation in a strongly
correlated electron system with antiferromagnetic spin interactions. We
consider the $t$-$J$ model and focus on the interplay between the charge- and
spin-dynamics in different excitation and doping regimes. The appearance of
string states after a weak photo excitation manifests itself in a nontrivial
scaling of the relaxation time with the exchange coupling and leads to a
correlated oscillatory evolution of the kinetic energy and spin-spin
correlation function. A strong excitation of the system, on the other hand,
suppresses the spin correlations and results in a relaxation that is controlled
by hole scattering. We discuss the possibility of detecting string states in
optical and cold atom experiments.
| cond-mat.str-el | using a nonequilibrium implementation of the extended dynamical mean field theory edmft we simulate the relaxation after photo excitation in a strongly correlated electron system with antiferromagnetic spin interactions we consider the tj model and focus on the interplay between the charge and spindynamics in different excitation and doping regimes the appearance of string states after a weak photo excitation manifests itself in a nontrivial scaling of the relaxation time with the exchange coupling and leads to a correlated oscillatory evolution of the kinetic energy and spinspin correlation function a strong excitation of the system on the other hand suppresses the spin correlations and results in a relaxation that is controlled by hole scattering we discuss the possibility of detecting string states in optical and cold atom experiments | [['using', 'a', 'nonequilibrium', 'implementation', 'of', 'the', 'extended', 'dynamical', 'mean', 'field', 'theory', 'edmft', 'we', 'simulate', 'the', 'relaxation', 'after', 'photo', 'excitation', 'in', 'a', 'strongly', 'correlated', 'electron', 'system', 'with', 'antiferromagnetic', 'spin', 'interactions', 'we', 'consider', 'the', 'tj', 'model', 'and', 'focus', 'on', 'the', 'interplay', 'between', 'the', 'charge', 'and', 'spindynamics', 'in', 'different', 'excitation', 'and', 'doping', 'regimes', 'the', 'appearance', 'of', 'string', 'states', 'after', 'a', 'weak', 'photo', 'excitation', 'manifests', 'itself', 'in', 'a', 'nontrivial', 'scaling', 'of', 'the', 'relaxation', 'time', 'with', 'the', 'exchange', 'coupling', 'and', 'leads', 'to', 'a', 'correlated', 'oscillatory', 'evolution', 'of', 'the', 'kinetic', 'energy', 'and', 'spinspin', 'correlation', 'function', 'a', 'strong', 'excitation', 'of', 'the', 'system', 'on', 'the', 'other', 'hand', 'suppresses', 'the', 'spin', 'correlations', 'and', 'results', 'in', 'a', 'relaxation', 'that', 'is', 'controlled', 'by', 'hole', 'scattering', 'we', 'discuss', 'the', 'possibility', 'of', 'detecting', 'string', 'states', 'in', 'optical', 'and', 'cold', 'atom', 'experiments']] | [-0.18222970510760206, 0.21390021312618046, -0.07501587519917408, 0.10018276074697496, 0.02474393376178341, -0.13623632132748753, 0.05026962418560288, 0.3550975838006707, -0.2658934896244318, -0.2743118444486754, 0.008502619634782604, -0.317200161756773, -0.10960983026416216, 0.15445808307958941, 0.1037652599879948, -0.00465628543679486, -0.0041400513546250295, -0.011114650249510305, -0.11148818930587368, -0.15341065584652824, 0.330349178166216, 0.04323549016498873, 0.27935387392062694, 0.12880191899694182, 0.08389041428745259, 0.0765243268051563, 0.04099091845455405, 0.006061802210751921, -0.10166479812897933, 0.055124761914157716, 0.1855395005122773, -0.00935893417852185, 0.20914723480018438, -0.459902717571822, -0.2049844106004457, 0.007749702752334997, 0.13095776461159403, 0.17057845991803333, -0.07722836440552783, -0.27773786237230524, -0.055624327271289076, -0.17136943949299166, -0.10985593455234266, -0.07425086472721887, 0.027648820053400414, 0.02614667823218042, -0.2722553242383583, 0.1426172326955566, 0.06747446414078695, 0.034583980494062416, -0.08865492999575508, -0.026083296243086806, -0.0365934318760992, 0.06634631373162847, 0.044836835397291, 0.04185882800084073, 0.1794730738729413, -0.17130009023094317, -0.1285436973371361, 0.32987981889164075, -0.1206052732295575, -0.1369856997862371, 0.21031131406198256, -0.1714584176625067, -0.0820139108946023, 0.14184059963736217, 0.1390704314035247, 0.1117267135559814, -0.1333018803052255, 0.08864917156142837, 0.0060389589561964385, 0.1918610180800897, 0.016015559105653665, 0.10609877680326463, 0.24872094960301183, 0.20124606819081237, 0.028510907573945588, 0.17002879891197153, -0.11995331298385281, -0.13504027943781693, -0.2487324638350401, -0.10249442466647452, -0.18733933165640337, 0.07127942788065411, -0.049379209370840726, -0.13964780242895358, 0.45741314517727005, 0.14868031727382913, 0.19984264815138886, -0.025997896962508094, 0.24402311299127177, 0.14200038145645522, 0.03065998212332488, 0.02280864186832332, 0.24975860813901818, 0.1596990362049837, 0.09232665736271883, -0.3858900323139096, 0.03130795982724521, 0.025239979186153505] |
1,803.02072 | Nearly isentropic flow at sizeable $\eta/s$ | Non-linearities in the harmonic spectra of hadron-nucleus and nucleus-nucleus
collisions provide evidence for the dynamical response to azimuthal spatial
eccentricities. Here, we demonstrate within the framework of transport theory
that even the mildest interaction correction to a picture of free-streaming
particle distributions, namely the inclusion of one perturbatively weak
interaction ("one-hit dynamics"), will generically give rise to all observed
linear and non-linear structures. We further argue that transport theory
naturally accounts within the range of its validity for realistic signal sizes
of the linear and non-linear response coefficients observed in azimuthal
momentum anisotropies with a large mean free path of the order of the system
size in peripheral ($\sim 50 \%$ centrality) PbPb or central pPb collisions.
The shear viscosity to entropy density ratio $\eta/s$ of such a transport
theory is approximately an order of magnitude larger than that of an almost
perfect fluid. The phenomenological success of transport simulations thus
challenges the perfect fluid paradigm of ultra-relativistic nucleus-nucleus and
hadron-nucleus collisions.
| hep-ph hep-ex nucl-ex nucl-th | nonlinearities in the harmonic spectra of hadronnucleus and nucleusnucleus collisions provide evidence for the dynamical response to azimuthal spatial eccentricities here we demonstrate within the framework of transport theory that even the mildest interaction correction to a picture of freestreaming particle distributions namely the inclusion of one perturbatively weak interaction onehit dynamics will generically give rise to all observed linear and nonlinear structures we further argue that transport theory naturally accounts within the range of its validity for realistic signal sizes of the linear and nonlinear response coefficients observed in azimuthal momentum anisotropies with a large mean free path of the order of the system size in peripheral sim 50 centrality pbpb or central ppb collisions the shear viscosity to entropy density ratio etas of such a transport theory is approximately an order of magnitude larger than that of an almost perfect fluid the phenomenological success of transport simulations thus challenges the perfect fluid paradigm of ultrarelativistic nucleusnucleus and hadronnucleus collisions | [['nonlinearities', 'in', 'the', 'harmonic', 'spectra', 'of', 'hadronnucleus', 'and', 'nucleusnucleus', 'collisions', 'provide', 'evidence', 'for', 'the', 'dynamical', 'response', 'to', 'azimuthal', 'spatial', 'eccentricities', 'here', 'we', 'demonstrate', 'within', 'the', 'framework', 'of', 'transport', 'theory', 'that', 'even', 'the', 'mildest', 'interaction', 'correction', 'to', 'a', 'picture', 'of', 'freestreaming', 'particle', 'distributions', 'namely', 'the', 'inclusion', 'of', 'one', 'perturbatively', 'weak', 'interaction', 'onehit', 'dynamics', 'will', 'generically', 'give', 'rise', 'to', 'all', 'observed', 'linear', 'and', 'nonlinear', 'structures', 'we', 'further', 'argue', 'that', 'transport', 'theory', 'naturally', 'accounts', 'within', 'the', 'range', 'of', 'its', 'validity', 'for', 'realistic', 'signal', 'sizes', 'of', 'the', 'linear', 'and', 'nonlinear', 'response', 'coefficients', 'observed', 'in', 'azimuthal', 'momentum', 'anisotropies', 'with', 'a', 'large', 'mean', 'free', 'path', 'of', 'the', 'order', 'of', 'the', 'system', 'size', 'in', 'peripheral', 'sim', '50', 'centrality', 'pbpb', 'or', 'central', 'ppb', 'collisions', 'the', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'of', 'such', 'a', 'transport', 'theory', 'is', 'approximately', 'an', 'order', 'of', 'magnitude', 'larger', 'than', 'that', 'of', 'an', 'almost', 'perfect', 'fluid', 'the', 'phenomenological', 'success', 'of', 'transport', 'simulations', 'thus', 'challenges', 'the', 'perfect', 'fluid', 'paradigm', 'of', 'ultrarelativistic', 'nucleusnucleus', 'and', 'hadronnucleus', 'collisions']] | [-0.1429042632687924, 0.1962386877670724, -0.13584266789548566, 0.08826102205566713, 0.00048248994571622463, -0.07033903111951076, -0.09827041027674568, 0.3067928828080767, -0.2722441728314152, -0.2910060465859715, -0.034924855638382726, -0.3151139022840653, -0.04567734797747107, 0.13810261759367676, 0.05290527345860028, 0.08411007426184369, 0.06237875040169456, 0.018433426681622223, -0.03485136244853493, -0.19365135300904512, 0.2790960045836982, 0.1020962793030776, 0.2521410118511994, 0.12617061646742514, 0.08424340472265612, 0.055140276595193424, 0.021490921205258928, 0.08571484407875687, -0.17546003212551115, 0.07192448989862896, 0.25501181801300843, 0.008845527387893525, 0.22820036407501904, -0.41867078934737945, -0.21564569414185825, 0.08279943809029647, 0.13869258523045574, 0.1288036858459236, -0.054200623743236066, -0.1934291299621691, 0.06696931126934942, -0.23452201110630994, -0.16830806016805583, -0.05756109202920925, 0.05381639726692811, 0.03438760048884433, -0.29389531462802554, 0.18817055850304315, 0.05426522808756999, 0.06739595939288848, -0.057492895457107805, -0.10281603186376742, -0.056989605544367807, 0.039571276067727014, 0.05812552007118939, 0.016752939374418928, 0.1562860856880434, -0.18187241311752586, -0.09945672789181118, 0.4219937374116853, -0.047919107343204814, -0.1488803914107848, 0.1922010314767249, -0.2069434083023225, -0.09025314895843621, 0.16347335117461625, 0.24015673499088735, 0.09209014718326217, -0.16551155564957298, 0.03155360310192919, -0.013868519999232377, 0.18779756996082142, 0.06874460547114722, 0.0757132141297916, 0.19465973779865636, 0.1607517124910373, 0.03456875136471353, 0.0782457174762385, -0.09080229646642693, -0.12134842849482083, -0.3560866674699355, -0.09457553317188286, -0.1239378026133636, 0.05904986787645612, -0.1541021023174835, -0.13543789584073238, 0.37505302239442245, 0.1607687611845904, 0.22039320748663158, 0.037390754780790306, 0.2877019715175265, 0.12033715356410539, 0.03420315241382923, 0.08778812941745855, 0.2863056334666908, 0.17604139537725133, 0.1336138179205591, -0.261378849222092, 0.04070461327210069, 0.04398840586800361] |
1,803.02073 | Formal Intercept of Sturmian words | We give a combinatorial definition of the second parameter describing
Sturmian words, that we call formal intercept, as an infinite Ostrowski
expansion. We recall the well-known properties of Sturmian words, study factors
graphs and repetition function, and end with the definition of formal
intercepts.
| math.CO | we give a combinatorial definition of the second parameter describing sturmian words that we call formal intercept as an infinite ostrowski expansion we recall the wellknown properties of sturmian words study factors graphs and repetition function and end with the definition of formal intercepts | [['we', 'give', 'a', 'combinatorial', 'definition', 'of', 'the', 'second', 'parameter', 'describing', 'sturmian', 'words', 'that', 'we', 'call', 'formal', 'intercept', 'as', 'an', 'infinite', 'ostrowski', 'expansion', 'we', 'recall', 'the', 'wellknown', 'properties', 'of', 'sturmian', 'words', 'study', 'factors', 'graphs', 'and', 'repetition', 'function', 'and', 'end', 'with', 'the', 'definition', 'of', 'formal', 'intercepts']] | [-0.17354264063760638, 0.10361401877790657, -0.1385680129751563, 0.11542306626638905, -0.17777534338264642, -0.14092036204370248, 0.12187270081432705, 0.3263946663461287, -0.3251902773468332, -0.22261775422587313, 0.035129976755177435, -0.30917658961632033, -0.17788393664258448, 0.1473692528167951, -0.135563879633661, 0.017848706148056823, 0.024193697979419747, 0.11362794658634812, -0.09998112749450559, -0.2312341740524227, 0.3702920392282646, -0.0019442211751910772, 0.1888694385151294, 0.011780466651543975, 0.14088093709539284, 0.033343741659667685, -0.07911934834820303, -0.02170789423822002, -0.23375293189763563, 0.1241005980621346, 0.25130521453155036, 0.1690257005393505, 0.26823986499485647, -0.2968166068365628, -0.12791810007977553, 0.1013687148753723, 0.14071987749775872, 0.0666056466712193, 0.0026024457765743136, -0.19656566035171802, 0.06652047695719045, -0.2664872844311917, -0.15310750425454567, -0.08350789422084662, 0.06811923876574094, 0.1093396800517274, -0.21090836337217214, 0.03195230713622137, 0.13776290792421522, 0.1069421033257227, -0.024204994943416255, -0.10542452667670493, 0.10989416905530644, 0.1226652323120189, 0.02554029522633011, 0.007935138382229277, 0.04946336991534653, -0.1128889771644026, -0.20859215601178055, 0.36044801297512924, -0.07585518225096166, -0.20739690934053875, 0.09424076218750667, -0.17286269880026917, -0.1998442002699118, 0.02442201347598298, 0.12112709717819764, 0.11638337327167392, -0.09053855088793418, 0.09285174750998108, -0.09645764508538625, 0.2040282299911434, 0.21088069704869253, 0.08709927452516487, 0.10137551671571353, 0.07985821781171994, 0.006018249000507322, 0.21416393066333098, 0.05360412917004644, -0.08443026675377041, -0.3322271059177266, -0.1642469598022713, -0.09159065694124861, 0.05349829014052044, -0.1787778060262843, -0.29423895609480416, 0.4153271072798155, 0.1199071381283416, 0.20878326715054837, 0.19043844699097628, 0.23361946972595019, 0.17891606999381277, 0.012901598682881078, 0.03709002514369786, 0.07344425647434863, 0.13955664103956555, 0.01972317606718703, -0.14323280784050108, 0.07119098025247116, 0.2396091689694334] |
1,803.02074 | "Massless" spin-2 field in de Sitter space | In this paper, admitting a de Sitter (dS)-invariant vacuum in an indefinite
inner product space, we present a Gupta-Bleuler type setting for causal and
full dS-covariant quantization of free "massless" spin-2 field in dS spacetime.
The term "massless" stands for the fact that the field displays gauge and
conformal invariance properties. In this construction, the field is defined
rigorously as an operator-valued distribution. It is covariant in the usual
strong sense: $\underline{U}_g \underline{{\cal{K}}} (X) \underline{U}_g^{-1} =
\underline{{\cal{K}}} (g.X)$, for any $g$ in the dS group, where
$\underline{U}$ is associated with the indecomposable representations of the dS
group, $SO_0(1,4)$, on the space of states. The theory, therefore, does not
suffer from infrared divergences. Despite the appearance of negative norm
states in the theory, the energy operator is positive in all physical states
and vanishes in the vacuum.
| gr-qc | in this paper admitting a de sitter dsinvariant vacuum in an indefinite inner product space we present a guptableuler type setting for causal and full dscovariant quantization of free massless spin2 field in ds spacetime the term massless stands for the fact that the field displays gauge and conformal invariance properties in this construction the field is defined rigorously as an operatorvalued distribution it is covariant in the usual strong sense underlineu_g underlinecalk x underlineu_g1 underlinecalk gx for any g in the ds group where underlineu is associated with the indecomposable representations of the ds group so_014 on the space of states the theory therefore does not suffer from infrared divergences despite the appearance of negative norm states in the theory the energy operator is positive in all physical states and vanishes in the vacuum | [['in', 'this', 'paper', 'admitting', 'a', 'de', 'sitter', 'dsinvariant', 'vacuum', 'in', 'an', 'indefinite', 'inner', 'product', 'space', 'we', 'present', 'a', 'guptableuler', 'type', 'setting', 'for', 'causal', 'and', 'full', 'dscovariant', 'quantization', 'of', 'free', 'massless', 'spin2', 'field', 'in', 'ds', 'spacetime', 'the', 'term', 'massless', 'stands', 'for', 'the', 'fact', 'that', 'the', 'field', 'displays', 'gauge', 'and', 'conformal', 'invariance', 'properties', 'in', 'this', 'construction', 'the', 'field', 'is', 'defined', 'rigorously', 'as', 'an', 'operatorvalued', 'distribution', 'it', 'is', 'covariant', 'in', 'the', 'usual', 'strong', 'sense', 'underlineu_g', 'underlinecalk', 'x', 'underlineu_g1', 'underlinecalk', 'gx', 'for', 'any', 'g', 'in', 'the', 'ds', 'group', 'where', 'underlineu', 'is', 'associated', 'with', 'the', 'indecomposable', 'representations', 'of', 'the', 'ds', 'group', 'so_014', 'on', 'the', 'space', 'of', 'states', 'the', 'theory', 'therefore', 'does', 'not', 'suffer', 'from', 'infrared', 'divergences', 'despite', 'the', 'appearance', 'of', 'negative', 'norm', 'states', 'in', 'the', 'theory', 'the', 'energy', 'operator', 'is', 'positive', 'in', 'all', 'physical', 'states', 'and', 'vanishes', 'in', 'the', 'vacuum']] | [-0.160988901498226, 0.16910090388286894, -0.11097294511008, 0.0787456058162766, -0.08902261474241431, -0.08403292704516878, -0.03799844104348897, 0.31873718708610305, -0.22581776834021394, -0.20342735204344187, 0.07155055089835793, -0.26831274072353084, -0.14790400139351662, 0.09732931185191354, -0.09633444968897563, 0.005359947917839655, 0.0020783283492514433, 0.12341629000595555, -0.11696193986035024, -0.19268020467223743, 0.4073669298695257, 0.02265562531627858, 0.2768685917155101, 0.015227664365934639, 0.1305178144803414, 0.0532873837187743, 0.011384919049361578, -0.007384927260528247, -0.09746785161870111, 0.06487717250800835, 0.2535155736697981, 0.08691871495337601, 0.2328186478940412, -0.35977261760630286, -0.20534278350107624, 0.14057549154385923, 0.12808361096809118, 0.07993459395097138, -0.033373207291767286, -0.295933454311811, 0.06449804629485767, -0.14460291361364608, -0.1593280727446724, -0.06863376092738831, 0.020827199775689784, -0.12808950176605813, -0.25012065411652795, 0.10401041404559062, 0.049579746218828054, 0.030410253886993116, -0.11169764368991869, -0.08000714257717706, -0.0381510366148387, 0.07595378502916832, 0.07452340643996229, 0.07831771499745978, 0.08347369906349252, -0.1500327910368259, -0.11219209191801313, 0.3459030926657411, -0.11184977550202838, -0.25642250951092976, 0.12599201350329586, -0.19109861557013713, -0.14126800147171778, 0.11596821973171945, 0.07129535513500182, 0.16022031497066982, -0.09273880191433888, 0.2675250634716716, -0.0410596624446603, 0.10470570480146517, 0.07968863725590591, 0.0937335623213305, 0.18244094469656164, 0.041003880282201303, 0.0651383458976992, 0.10633392865196443, 0.004462740958507101, -0.11041182950855448, -0.4224328940304426, -0.2131262294480201, -0.16633583050346576, 0.10290335636292673, -0.1031328539074121, -0.23392150431676642, 0.3493874967492257, 0.07885413131656466, 0.14619728215038777, 0.03542396266801426, 0.21559130853185288, 0.11625366523199213, 0.08037442507831237, 0.1018281663624713, 0.2475631012652929, 0.16358211234283562, 0.07674074923225607, -0.2203474513666991, -0.049011414870619774, 0.10682690346326966] |
1,803.02075 | Development of a New Spectral Collocation Method Using Laplacian
Eigenbasis for Elliptic Partial Differential Equations in an Extended Domain | The recent development of spectral method has been praised for its high-order
convergence in simulating complex physical problems. The combination of
embedded boundary method and spectral method becomes a mainstream way to tackle
geometrically complicated problems. However, the convergence is deteriorated
when embedded boundary strategies are employed. Owing to the loss of
regularity, in this paper we propose a new spectral collocation method which
retains the regularity of solutions to solve differential equations in the case
of complex geometries. The idea is rooted in the basis functions defined in an
extended domain, which leads to a useful upper bound of the Lebesgue constant
with respect to the Fourier best approximation. In particular, how the
stretching of the domain defining basis functions affects the convergence rate
directly is detailed. Error estimates chosen in our proposed method show that
the exponential decay convergence for problems with analytical solutions can be
retained. Moreover, two-dimensional Poisson equations and convection-diffusion
equations with simple and complex geometrical domains will be simulated. The
predicted results justify the advantages of applying our method to tackle
geometrically complicated problems.
| math.NA | the recent development of spectral method has been praised for its highorder convergence in simulating complex physical problems the combination of embedded boundary method and spectral method becomes a mainstream way to tackle geometrically complicated problems however the convergence is deteriorated when embedded boundary strategies are employed owing to the loss of regularity in this paper we propose a new spectral collocation method which retains the regularity of solutions to solve differential equations in the case of complex geometries the idea is rooted in the basis functions defined in an extended domain which leads to a useful upper bound of the lebesgue constant with respect to the fourier best approximation in particular how the stretching of the domain defining basis functions affects the convergence rate directly is detailed error estimates chosen in our proposed method show that the exponential decay convergence for problems with analytical solutions can be retained moreover twodimensional poisson equations and convectiondiffusion equations with simple and complex geometrical domains will be simulated the predicted results justify the advantages of applying our method to tackle geometrically complicated problems | [['the', 'recent', 'development', 'of', 'spectral', 'method', 'has', 'been', 'praised', 'for', 'its', 'highorder', 'convergence', 'in', 'simulating', 'complex', 'physical', 'problems', 'the', 'combination', 'of', 'embedded', 'boundary', 'method', 'and', 'spectral', 'method', 'becomes', 'a', 'mainstream', 'way', 'to', 'tackle', 'geometrically', 'complicated', 'problems', 'however', 'the', 'convergence', 'is', 'deteriorated', 'when', 'embedded', 'boundary', 'strategies', 'are', 'employed', 'owing', 'to', 'the', 'loss', 'of', 'regularity', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'spectral', 'collocation', 'method', 'which', 'retains', 'the', 'regularity', 'of', 'solutions', 'to', 'solve', 'differential', 'equations', 'in', 'the', 'case', 'of', 'complex', 'geometries', 'the', 'idea', 'is', 'rooted', 'in', 'the', 'basis', 'functions', 'defined', 'in', 'an', 'extended', 'domain', 'which', 'leads', 'to', 'a', 'useful', 'upper', 'bound', 'of', 'the', 'lebesgue', 'constant', 'with', 'respect', 'to', 'the', 'fourier', 'best', 'approximation', 'in', 'particular', 'how', 'the', 'stretching', 'of', 'the', 'domain', 'defining', 'basis', 'functions', 'affects', 'the', 'convergence', 'rate', 'directly', 'is', 'detailed', 'error', 'estimates', 'chosen', 'in', 'our', 'proposed', 'method', 'show', 'that', 'the', 'exponential', 'decay', 'convergence', 'for', 'problems', 'with', 'analytical', 'solutions', 'can', 'be', 'retained', 'moreover', 'twodimensional', 'poisson', 'equations', 'and', 'convectiondiffusion', 'equations', 'with', 'simple', 'and', 'complex', 'geometrical', 'domains', 'will', 'be', 'simulated', 'the', 'predicted', 'results', 'justify', 'the', 'advantages', 'of', 'applying', 'our', 'method', 'to', 'tackle', 'geometrically', 'complicated', 'problems']] | [-0.07213189718345853, 0.008958705049735727, -0.11299293259184601, 0.07393546234428262, -0.1004820305116785, -0.115778730240547, -0.0034530149889178572, 0.3628499823363705, -0.3065663824026059, -0.26404239341726576, 0.13884737699538366, -0.21804988858186536, -0.16104254639810986, 0.217111251094482, -0.09819394113082025, 0.11104444013876168, 0.08621619611771571, -0.019947409535396015, -0.11395646906587192, -0.2603182828157312, 0.32874170720137447, 0.022549057055989072, 0.2922781341411691, 0.05001358768592278, 0.09214856817464655, -0.07359349342166549, -0.022656898834328684, 0.03202289322701593, -0.13358709511703637, 0.1658957003046655, 0.2411253646455912, 0.09302368645633881, 0.3010620211483911, -0.42607966703362765, -0.23208919599031408, 0.0950918458266339, 0.19938899850369327, 0.08853144404969902, -0.0461584412971408, -0.2603727315229157, 0.09072127660943402, -0.10676836667634133, -0.18889355067060226, -0.11824035577527765, -0.03493096486975749, 0.05184157894174051, -0.3019502211206903, 0.085420310158386, 0.05763842705346178, 0.014200572378750722, -0.08810429347666084, -0.0917901936517511, 0.027415111417778665, 0.08335174487389546, 0.04704314914997667, 0.02468497409588761, 0.06483208978186465, -0.10160432958509773, -0.11163836957679854, 0.38787743267085817, -0.04945326963853505, -0.29834057714453793, 0.19036758188675676, -0.11604747725909369, -0.11365353614867975, 0.15124010159634055, 0.18223674416852495, 0.18169164599385113, -0.141830826247153, 0.12377832994906283, -0.006877823115792126, 0.14728254865234097, 0.061743176244716674, 0.007422737541815473, 0.10212964258777599, 0.18158584143707734, 0.10377761593036768, 0.1525792031445437, -0.03865999386438893, -0.1388313937621812, -0.2645845242465536, -0.12872341681730987, -0.1818806193018746, 0.014791111543308944, -0.12896485521511447, -0.1996291951289297, 0.39560068688458866, 0.1471343291638833, 0.16289134575207653, 0.042624287416806, 0.30195260520300105, 0.18222032837802543, 0.038912078047805054, 0.0733382923833738, 0.20137937292456626, 0.15952506392107654, 0.09722353680796611, -0.21589938050407606, 0.07012912209934762, 0.1084460117491997] |
1,803.02076 | Invariant Smoothing on Lie Groups | In this paper we propose a (non-linear) smoothing algorithm for group-affine
observation systems, a recently introduced class of estimation problems on Lie
groups that bear a particular structure. As most non-linear smoothing methods,
the proposed algorithm is based on a maximum a posteriori estimator, determined
by optimization. But owing to the specific properties of the considered class
of problems, the involved linearizations are proved to have a form of
independence with respect to the current estimates, leveraged to avoid
(partially or sometimes totally) the need to relinearize. The method is
validated on a robot localization example, both in simulations and on real
experimental data.
| cs.RO | in this paper we propose a nonlinear smoothing algorithm for groupaffine observation systems a recently introduced class of estimation problems on lie groups that bear a particular structure as most nonlinear smoothing methods the proposed algorithm is based on a maximum a posteriori estimator determined by optimization but owing to the specific properties of the considered class of problems the involved linearizations are proved to have a form of independence with respect to the current estimates leveraged to avoid partially or sometimes totally the need to relinearize the method is validated on a robot localization example both in simulations and on real experimental data | [['in', 'this', 'paper', 'we', 'propose', 'a', 'nonlinear', 'smoothing', 'algorithm', 'for', 'groupaffine', 'observation', 'systems', 'a', 'recently', 'introduced', 'class', 'of', 'estimation', 'problems', 'on', 'lie', 'groups', 'that', 'bear', 'a', 'particular', 'structure', 'as', 'most', 'nonlinear', 'smoothing', 'methods', 'the', 'proposed', 'algorithm', 'is', 'based', 'on', 'a', 'maximum', 'a', 'posteriori', 'estimator', 'determined', 'by', 'optimization', 'but', 'owing', 'to', 'the', 'specific', 'properties', 'of', 'the', 'considered', 'class', 'of', 'problems', 'the', 'involved', 'linearizations', 'are', 'proved', 'to', 'have', 'a', 'form', 'of', 'independence', 'with', 'respect', 'to', 'the', 'current', 'estimates', 'leveraged', 'to', 'avoid', 'partially', 'or', 'sometimes', 'totally', 'the', 'need', 'to', 'relinearize', 'the', 'method', 'is', 'validated', 'on', 'a', 'robot', 'localization', 'example', 'both', 'in', 'simulations', 'and', 'on', 'real', 'experimental', 'data']] | [-0.08838619369769342, -0.001995536435431647, -0.09688259730538244, 0.05377712192068112, -0.1121631145423043, -0.1476938991843569, 0.02032356386387142, 0.3934451698244197, -0.2567200436611723, -0.3160625918959358, 0.17241933019786568, -0.22914004011206257, -0.206209111861541, 0.24055523461282471, -0.10003314743234405, 0.10076070378774107, 0.08491541327483662, 0.041596001167826864, -0.07964047018067857, -0.2586485208938965, 0.3224515891577416, 0.03807275362981899, 0.26589779665205376, 0.019717477429296495, 0.1424098464092963, -0.015361399046208674, -0.03370743921225511, 0.06802943067679416, -0.11210460825496889, 0.16148547380394077, 0.2461239148871702, 0.11113887998496987, 0.3329561010423541, -0.3668568907396018, -0.22859575592876566, 0.1309560676991433, 0.11718613949934364, 0.09723751901115463, -0.06558737995609351, -0.3048149368192241, 0.10669089832514958, -0.12980394253453004, -0.07262176598503607, -0.08925378680663201, -0.04001388698985836, 0.012808567256603426, -0.29997274398778845, 0.04072738477273039, 0.043637979007100015, 0.03742255498868474, -0.05136906554542699, -0.09231460086766233, 0.022215673528177646, 0.05652892755828255, 0.03381537043408138, -0.01579691115676344, 0.08197931681750613, -0.09726359961256023, -0.13432822586263268, 0.39257164969497804, -0.006325384913898498, -0.25386073649719637, 0.1910879676042631, -0.0757269518883917, -0.1540717074367245, 0.11870646452784393, 0.2244609327064556, 0.1503058860837979, -0.14471149289114763, 0.07223787483729838, -0.0502527045273647, 0.1359288022577654, 0.019591135809252275, -0.025159827781642236, 0.13183200707686252, 0.17205322476203364, 0.12729610512439993, 0.11682909632608005, -0.07531675236588976, -0.0749286833282524, -0.26663661402767724, -0.1049969576480595, -0.20129575969163074, -0.0025445920894446882, -0.05078280266378305, -0.19765006356818365, 0.382678184782616, 0.17953640706082738, 0.21071619638106198, 0.07109435357252877, 0.2879620205760183, 0.12402180594378558, 0.0691728647165362, 0.06671282984497189, 0.1972865883658812, 0.15913754181023146, 0.0672782397856122, -0.1990721263601761, 0.11230573497115842, 0.08971962542725202] |
1,803.02077 | The Contextual Loss for Image Transformation with Non-Aligned Data | Feed-forward CNNs trained for image transformation problems rely on loss
functions that measure the similarity between the generated image and a target
image. Most of the common loss functions assume that these images are spatially
aligned and compare pixels at corresponding locations. However, for many tasks,
aligned training pairs of images will not be available. We present an
alternative loss function that does not require alignment, thus providing an
effective and simple solution for a new space of problems. Our loss is based on
both context and semantics -- it compares regions with similar semantic
meaning, while considering the context of the entire image. Hence, for example,
when transferring the style of one face to another, it will translate
eyes-to-eyes and mouth-to-mouth. Our code can be found at
https://www.github.com/roimehrez/contextualLoss
| cs.CV cs.LG | feedforward cnns trained for image transformation problems rely on loss functions that measure the similarity between the generated image and a target image most of the common loss functions assume that these images are spatially aligned and compare pixels at corresponding locations however for many tasks aligned training pairs of images will not be available we present an alternative loss function that does not require alignment thus providing an effective and simple solution for a new space of problems our loss is based on both context and semantics it compares regions with similar semantic meaning while considering the context of the entire image hence for example when transferring the style of one face to another it will translate eyestoeyes and mouthtomouth our code can be found at httpswwwgithubcomroimehrezcontextualloss | [['feedforward', 'cnns', 'trained', 'for', 'image', 'transformation', 'problems', 'rely', 'on', 'loss', 'functions', 'that', 'measure', 'the', 'similarity', 'between', 'the', 'generated', 'image', 'and', 'a', 'target', 'image', 'most', 'of', 'the', 'common', 'loss', 'functions', 'assume', 'that', 'these', 'images', 'are', 'spatially', 'aligned', 'and', 'compare', 'pixels', 'at', 'corresponding', 'locations', 'however', 'for', 'many', 'tasks', 'aligned', 'training', 'pairs', 'of', 'images', 'will', 'not', 'be', 'available', 'we', 'present', 'an', 'alternative', 'loss', 'function', 'that', 'does', 'not', 'require', 'alignment', 'thus', 'providing', 'an', 'effective', 'and', 'simple', 'solution', 'for', 'a', 'new', 'space', 'of', 'problems', 'our', 'loss', 'is', 'based', 'on', 'both', 'context', 'and', 'semantics', 'it', 'compares', 'regions', 'with', 'similar', 'semantic', 'meaning', 'while', 'considering', 'the', 'context', 'of', 'the', 'entire', 'image', 'hence', 'for', 'example', 'when', 'transferring', 'the', 'style', 'of', 'one', 'face', 'to', 'another', 'it', 'will', 'translate', 'eyestoeyes', 'and', 'mouthtomouth', 'our', 'code', 'can', 'be', 'found', 'at', 'httpswwwgithubcomroimehrezcontextualloss']] | [-0.028253979619592428, 0.01072695462894626, -0.06240170784853399, 0.10454466267023235, -0.10023642277345061, -0.14820395212620496, -0.011427939568180591, 0.48215259730815885, -0.28143965317774566, -0.31952156499028206, 0.09681539266556502, -0.2726891626678407, -0.141199267975986, 0.22333337433636188, -0.11251641501486301, 0.03643605072516948, 0.13467107728496194, 0.05448967009037733, -0.10346182837325614, -0.2723499035835266, 0.35461957022733986, 0.03434391485154629, 0.31463425440341236, 0.029659990344196557, 0.1423273156248033, -0.007912934257648885, -0.0238650345467031, -0.01101846946706064, -0.022294479650387077, 0.1690408825799823, 0.27089713090658185, 0.2097320711389184, 0.26147782725840807, -0.4136913297027349, -0.22487108441442252, 0.09743578602001071, 0.15001622273772955, 0.09183376221917569, -0.06843405900988728, -0.27451671559363605, 0.10028758767060936, -0.10377487145923078, 0.005133136361837387, -0.09777052830904723, -0.007753209879621864, 0.005261033246759326, -0.30319995278120043, 0.034186440066288924, 0.0719509906731546, 0.0439019625261426, -0.07367834467627109, -0.09381357203051448, -0.024887707717716694, 0.1930648289017845, 0.001008710401132703, 0.08754383413493633, 0.12274040624499322, -0.17988159564509987, -0.08847207809239625, 0.391533273935318, -0.03169788685068488, -0.2648380724787712, 0.22887957823462785, -0.06815012711379677, -0.0970387686174363, 0.10081980034708976, 0.17130576337873935, 0.1392486467026174, -0.15300283397606107, -0.0004833963424898684, -0.04567743098922074, 0.21908178367465733, 0.07849563648924232, 0.031205986741930248, 0.23936944899801166, 0.15398893122188748, 0.06705779845966026, 0.14775564709492028, -0.11382001873478294, -0.04394025055132806, -0.2810016856342554, -0.12010477955453097, -0.20292476242408156, -0.045090038175694645, -0.080213612768217, -0.15774262990243734, 0.37875956839695574, 0.19362747975625097, 0.25329358857497575, 0.08951909520104527, 0.3213135147988796, 0.0557192764300853, 0.14534413101989777, 0.06717296798340976, 0.1950819913856685, 0.0018485554195940494, 0.08403349333442747, -0.1330930955596268, 0.10349191111139953, 0.03736086944118142] |
1,803.02078 | Finite sample improvement of Akaike's Information Criterion | We emphasize that it is possible to improve the principle of unbiased risk
estimation for model selection by addressing excess risk deviations in the
design of penalization procedures. Indeed, we propose a modification of
Akaike's Information Criterion that avoids overfitting, even when the sample
size is small. We call this correction an over-penalization procedure. As proof
of concept, we show the nonasymptotic optimality of our histogram selection
procedure in density estimation by establishing sharp oracle inequalities for
the Kullback-Leibler divergence. One of the main features of our theoretical
results is that they include the estimation of unbounded logdensities. To do
so, we prove several analytical and probabilistic lemmas that are of
independent interest. In an experimental study, we also demonstrate
state-of-the-art performance of our over-penalization criterion for bin size
selection, in particular outperforming AICc procedure.
| math.ST cs.IT math.IT stat.TH | we emphasize that it is possible to improve the principle of unbiased risk estimation for model selection by addressing excess risk deviations in the design of penalization procedures indeed we propose a modification of akaikes information criterion that avoids overfitting even when the sample size is small we call this correction an overpenalization procedure as proof of concept we show the nonasymptotic optimality of our histogram selection procedure in density estimation by establishing sharp oracle inequalities for the kullbackleibler divergence one of the main features of our theoretical results is that they include the estimation of unbounded logdensities to do so we prove several analytical and probabilistic lemmas that are of independent interest in an experimental study we also demonstrate stateoftheart performance of our overpenalization criterion for bin size selection in particular outperforming aicc procedure | [['we', 'emphasize', 'that', 'it', 'is', 'possible', 'to', 'improve', 'the', 'principle', 'of', 'unbiased', 'risk', 'estimation', 'for', 'model', 'selection', 'by', 'addressing', 'excess', 'risk', 'deviations', 'in', 'the', 'design', 'of', 'penalization', 'procedures', 'indeed', 'we', 'propose', 'a', 'modification', 'of', 'akaikes', 'information', 'criterion', 'that', 'avoids', 'overfitting', 'even', 'when', 'the', 'sample', 'size', 'is', 'small', 'we', 'call', 'this', 'correction', 'an', 'overpenalization', 'procedure', 'as', 'proof', 'of', 'concept', 'we', 'show', 'the', 'nonasymptotic', 'optimality', 'of', 'our', 'histogram', 'selection', 'procedure', 'in', 'density', 'estimation', 'by', 'establishing', 'sharp', 'oracle', 'inequalities', 'for', 'the', 'kullbackleibler', 'divergence', 'one', 'of', 'the', 'main', 'features', 'of', 'our', 'theoretical', 'results', 'is', 'that', 'they', 'include', 'the', 'estimation', 'of', 'unbounded', 'logdensities', 'to', 'do', 'so', 'we', 'prove', 'several', 'analytical', 'and', 'probabilistic', 'lemmas', 'that', 'are', 'of', 'independent', 'interest', 'in', 'an', 'experimental', 'study', 'we', 'also', 'demonstrate', 'stateoftheart', 'performance', 'of', 'our', 'overpenalization', 'criterion', 'for', 'bin', 'size', 'selection', 'in', 'particular', 'outperforming', 'aicc', 'procedure']] | [-0.04213900923280528, -0.00025984039681066793, -0.12040095921191904, 0.1275080496057247, -0.0768155003397691, -0.15770747116594402, 0.10211226365494508, 0.3958343795604176, -0.24153047807652642, -0.2971136636618111, 0.12107911037488116, -0.24822585818668205, -0.1608866426679823, 0.20595828729974866, -0.1884534052055743, 0.09338537444257074, 0.08310613407132526, -0.0033796397417231844, -0.06377903831803619, -0.28612023886914056, 0.28496623378143543, 0.05731447182457756, 0.30738406125801027, 0.06750626035586552, 0.08321433946720963, 0.04372073383829384, -0.04442994112010907, 0.020303723985260282, -0.1796481318989579, 0.14082017133219374, 0.26734275557100773, 0.2011366566560658, 0.36845584406896875, -0.32028624125625893, -0.1991913587199869, 0.11905808279428769, 0.1340685062714059, 0.14447308240320395, -0.04855121050064486, -0.2471382163223569, 0.09342064562909029, -0.14061382367443812, -0.09610657531906057, -0.1264917323305444, -0.05171986286769863, 0.011141135511678403, -0.34811195985379595, 0.1108774197509909, 0.1331650478903342, 0.034637898721525236, -0.03627617360541114, -0.15393747583687029, 0.04944907916813261, 0.07556709186454234, 0.0772519460922383, -0.024698312997955968, 0.12711017949105655, -0.10335250893366281, -0.13804749636565922, 0.2889441130613839, -0.047658700659802114, -0.21351269540825377, 0.11930764384257296, -0.08304014905976752, -0.17626541565620787, 0.08643274021645388, 0.17174455782191622, 0.10372329948952905, -0.1685777341728142, 0.03689330649277609, -0.06275085888682279, 0.15250138665928883, 0.04190838997666207, 0.05038815970204909, 0.09415367212732909, 0.17609075221267564, 0.13065332278643768, 0.17198052884907358, -0.11380148861660726, -0.0712127026105817, -0.36485264749024754, -0.14671613445367526, -0.2155323122938474, -0.022201701508903944, -0.16232113671667994, -0.1795979842612589, 0.32241932144733493, 0.2420357801175366, 0.18281149977162756, 0.11739663068136132, 0.3058172653394717, 0.09910396679360592, 0.04645140634642707, 0.07018446518384196, 0.2550483466285557, 0.0884920218821477, -0.006606369596664552, -0.21324437368247245, 0.11987656283157844, 0.07714053744243252] |
1,803.02079 | $\boldsymbol{\mathcal{\alpha}}$ decay properties of
$\boldsymbol{^{296}}$Og within the two-potential approach | The present work is a continuations of our previous paper [J.-G. Deng, et
al., Chin. Phys. C, {\bf41}: 124109 (2017)]. In present work, the
$\mathcal{\alpha}$ decay half-life of unknown nucleus $^{296}$Og is predicted
within the two-potential approach and the hindrance factors of all 20 even-even
nuclei in the same region with $^{296}$Og, i.e. proton number $82<Z<126$ and
neutron number $152<N<184$, from $^{250}$Cm to $^{294}$Og are extracted. The
prediction is 1.09 ms within a factor of 5.12. In addition, based on the latest
experimental data, a new set of parameters of $\mathcal{\alpha}$ decay
hindrance factors for the even-even nuclei in this region considering the shell
effect and proton-neutron interaction are obtained.
| nucl-th nucl-ex | the present work is a continuations of our previous paper jg deng et al chin phys c bf41 124109 2017 in present work the mathcalalpha decay halflife of unknown nucleus 296og is predicted within the twopotential approach and the hindrance factors of all 20 eveneven nuclei in the same region with 296og ie proton number 82z126 and neutron number 152n184 from 250cm to 294og are extracted the prediction is 109 ms within a factor of 512 in addition based on the latest experimental data a new set of parameters of mathcalalpha decay hindrance factors for the eveneven nuclei in this region considering the shell effect and protonneutron interaction are obtained | [['the', 'present', 'work', 'is', 'a', 'continuations', 'of', 'our', 'previous', 'paper', 'jg', 'deng', 'et', 'al', 'chin', 'phys', 'c', 'bf41', '124109', '2017', 'in', 'present', 'work', 'the', 'mathcalalpha', 'decay', 'halflife', 'of', 'unknown', 'nucleus', '296og', 'is', 'predicted', 'within', 'the', 'twopotential', 'approach', 'and', 'the', 'hindrance', 'factors', 'of', 'all', '20', 'eveneven', 'nuclei', 'in', 'the', 'same', 'region', 'with', '296og', 'ie', 'proton', 'number', '82z126', 'and', 'neutron', 'number', '152n184', 'from', '250cm', 'to', '294og', 'are', 'extracted', 'the', 'prediction', 'is', '109', 'ms', 'within', 'a', 'factor', 'of', '512', 'in', 'addition', 'based', 'on', 'the', 'latest', 'experimental', 'data', 'a', 'new', 'set', 'of', 'parameters', 'of', 'mathcalalpha', 'decay', 'hindrance', 'factors', 'for', 'the', 'eveneven', 'nuclei', 'in', 'this', 'region', 'considering', 'the', 'shell', 'effect', 'and', 'protonneutron', 'interaction', 'are', 'obtained']] | [-0.04558185945139625, 0.1381790537808019, -0.020340275823120743, 0.029701557173841417, 0.010462610489832094, -0.04003146136920595, 0.1126964768392589, 0.3060825249233928, -0.15937723115516397, -0.35379161548693305, -0.020987180119846016, -0.3047884375644991, -0.05244050325395969, 0.1702930349543189, -0.00960523256911144, 0.03807601068379322, 0.0405473268944591, 0.0278756536986643, -0.047593956222184576, -0.21608924810089564, 0.2835434084901443, 0.10078106564469635, 0.24756971258634272, 0.0683790949910522, 0.01729264375843251, 0.0009654437755950942, -0.03004071429425564, -0.05630694998678966, -0.1396816967272361, 0.10582685603115422, 0.22126983343500448, 0.09605591894181159, 0.19968870575897968, -0.3808194655531014, -0.17252907695029324, 0.06565721573021549, 0.15719850095830715, 0.1330772943799205, -0.03753831317366208, -0.3214644517642088, 0.07688149369250123, -0.25554990004569006, -0.10259348428091751, -0.03828750575373236, 0.11731150421725872, 0.051856402665949784, -0.2895507919143151, 0.11200167410201035, 0.002588842744724109, 0.0489901730683274, -0.09955712306187846, -0.22963644617434162, 0.04043504449341876, 0.06274282651093717, 0.07863661672140901, 0.08812804245658648, 0.1700508006167813, -0.060949212685675144, -0.082602080775989, 0.37131218793085563, -0.0008895467169797764, -0.09102930049770154, 0.11195212632390814, -0.15588033848549598, -0.1537683891141429, 0.1661846540899625, 0.1470762513613758, 0.1321435797995386, -0.15293468969712892, 0.10517431048580105, -0.06521319393337202, 0.16611556306732103, 0.06599709794737954, 0.009578995442447754, 0.09405965664280722, 0.22887943250736079, -0.09766261599277361, 0.052609114249487623, -0.1687482666860048, -0.06609183373746838, -0.3133501669150204, -0.10529168812074484, -0.14058974444476638, 0.01992604671081958, -0.014152108453904825, -0.08982560141549374, 0.3796682356713483, 0.056285127762328975, 0.23403573298576072, 0.02514233475085348, 0.23091419107871702, 0.03835823581693358, 0.04229697836965967, 0.09697670580443138, 0.33027678083341855, 0.15776233449399185, 0.04927755896306525, -0.2386303366757392, 0.0671373276362339, 0.0566505828487257] |
1,803.0208 | Constructive approach to limiting periodic orbits with exponential and
power law dynamics | In dynamical systems limit cycles arise as a result of a Hopf bifurcation,
after a control parameter has crossed its critical value. In this study we
present a constructive method to produce dissipative dynamics which lead to
stable periodic orbits as time grows, with predesigned transient dynamics.
Depending on the construction method a) the limiting orbit can be a regular
circle, an ellipse or a more complex closed orbit and b) the approach to the
limiting orbit can follow an exponential law or a power law. This technique
allows to design nonlinear models of dynamical systems with desired
(exponential or power law) relaxation properties.
| nlin.CD | in dynamical systems limit cycles arise as a result of a hopf bifurcation after a control parameter has crossed its critical value in this study we present a constructive method to produce dissipative dynamics which lead to stable periodic orbits as time grows with predesigned transient dynamics depending on the construction method a the limiting orbit can be a regular circle an ellipse or a more complex closed orbit and b the approach to the limiting orbit can follow an exponential law or a power law this technique allows to design nonlinear models of dynamical systems with desired exponential or power law relaxation properties | [['in', 'dynamical', 'systems', 'limit', 'cycles', 'arise', 'as', 'a', 'result', 'of', 'a', 'hopf', 'bifurcation', 'after', 'a', 'control', 'parameter', 'has', 'crossed', 'its', 'critical', 'value', 'in', 'this', 'study', 'we', 'present', 'a', 'constructive', 'method', 'to', 'produce', 'dissipative', 'dynamics', 'which', 'lead', 'to', 'stable', 'periodic', 'orbits', 'as', 'time', 'grows', 'with', 'predesigned', 'transient', 'dynamics', 'depending', 'on', 'the', 'construction', 'method', 'a', 'the', 'limiting', 'orbit', 'can', 'be', 'a', 'regular', 'circle', 'an', 'ellipse', 'or', 'a', 'more', 'complex', 'closed', 'orbit', 'and', 'b', 'the', 'approach', 'to', 'the', 'limiting', 'orbit', 'can', 'follow', 'an', 'exponential', 'law', 'or', 'a', 'power', 'law', 'this', 'technique', 'allows', 'to', 'design', 'nonlinear', 'models', 'of', 'dynamical', 'systems', 'with', 'desired', 'exponential', 'or', 'power', 'law', 'relaxation', 'properties']] | [-0.19578862785196038, 0.10654689265272911, -0.17194639983622786, 0.02535976510709868, -0.08015619245214531, -0.16759524624033545, 0.06627408506868121, 0.32780392127684677, -0.3083943123391901, -0.2542604334459891, 0.13273307197512343, -0.20044071136656455, -0.17651221341265438, 0.2479044902608551, -0.0763343418814027, 0.07253613365901401, 0.06161968645532257, 0.05076508990672524, -0.06148634138606632, -0.18503372027323797, 0.27456697684157494, 0.036020592419215694, 0.199004509927293, -0.04202395957411052, 0.08532433401649961, -0.0016755657882011011, 0.05655441291254157, 0.0311144306190097, -0.14999769604093252, 0.07253568864185721, 0.1855070258152759, 0.06762888829129785, 0.2736685713529229, -0.38632351319448877, -0.1998492956467649, 0.12480795223606177, 0.1520415468257852, 0.11430155572620257, -0.010510098112578047, -0.2415385999931739, 0.06798997573787346, -0.21304266884824477, -0.2450952991628303, -0.08736761724531579, 0.05795298575853499, 0.04376785261690831, -0.28903753092946805, 0.07261145574739203, 0.1612847080838177, 0.0489566195241283, -0.05041059781965137, 0.003729534407074635, -0.02035292979920856, 0.12115565327202113, 0.03125573641983255, 0.001473008643817873, 0.17644681128709075, -0.077148931445733, -0.12994480830653068, 0.38387762285912264, -0.06827446602311774, -0.18791889342649554, 0.1899159781538541, -0.1427453021527841, -0.10275164543865965, 0.17301289919683208, 0.20531704018895441, 0.13838453149604063, -0.12787886175255364, 0.08977154863028912, -0.013044828034113519, 0.1750241522408592, 0.06579901255407514, -0.0007710170556003085, 0.23486922989384487, 0.17329899505980742, 0.15259746281215206, 0.15119335465827205, -0.04132242285637543, -0.12702274042665243, -0.2486253479997126, -0.09364678035070448, -0.11869739426765591, 0.13190819221871117, -0.10052870457100373, -0.22120642388024583, 0.40222102117079955, 0.07099497374684478, 0.22257601200208926, 0.06353392931655086, 0.2817212806325048, 0.18699812681566422, 0.0437261920065234, 0.043193062409605215, 0.21472791600479887, 0.12067728784929316, 0.08534675696864724, -0.2112092241206063, 0.01834384259284259, 0.0950005082368779] |
1,803.02081 | Statistical-mechanical analysis of compressed sensing for Hamiltonian
estimation of Ising spin glass | Several powerful machines, such as the D-Wave 2000Q, dedicated to solving
combinatorial optimization problems through the Ising-model formulation have
been developed. To input problems into the machines, the unknown parameters on
the Ising model must be determined, and this is necessarily a nontrivial task.
It could be beneficial to construct a method to estimate the parameters of the
Ising model from several pairs of values of the energy and spin configurations.
In the present paper, we propose a simple method employing the $L_1$-norm
minimization, which is based on the concept of the compressed sensing.
Moreover, we analyze the typical performance of our proposed method of the
Hamiltonian estimation by using the replica method. We also compare our
analytical results through several numerical experiments using the alternating
direction method of multipliers.
| cond-mat.stat-mech | several powerful machines such as the dwave 2000q dedicated to solving combinatorial optimization problems through the isingmodel formulation have been developed to input problems into the machines the unknown parameters on the ising model must be determined and this is necessarily a nontrivial task it could be beneficial to construct a method to estimate the parameters of the ising model from several pairs of values of the energy and spin configurations in the present paper we propose a simple method employing the l_1norm minimization which is based on the concept of the compressed sensing moreover we analyze the typical performance of our proposed method of the hamiltonian estimation by using the replica method we also compare our analytical results through several numerical experiments using the alternating direction method of multipliers | [['several', 'powerful', 'machines', 'such', 'as', 'the', 'dwave', '2000q', 'dedicated', 'to', 'solving', 'combinatorial', 'optimization', 'problems', 'through', 'the', 'isingmodel', 'formulation', 'have', 'been', 'developed', 'to', 'input', 'problems', 'into', 'the', 'machines', 'the', 'unknown', 'parameters', 'on', 'the', 'ising', 'model', 'must', 'be', 'determined', 'and', 'this', 'is', 'necessarily', 'a', 'nontrivial', 'task', 'it', 'could', 'be', 'beneficial', 'to', 'construct', 'a', 'method', 'to', 'estimate', 'the', 'parameters', 'of', 'the', 'ising', 'model', 'from', 'several', 'pairs', 'of', 'values', 'of', 'the', 'energy', 'and', 'spin', 'configurations', 'in', 'the', 'present', 'paper', 'we', 'propose', 'a', 'simple', 'method', 'employing', 'the', 'l_1norm', 'minimization', 'which', 'is', 'based', 'on', 'the', 'concept', 'of', 'the', 'compressed', 'sensing', 'moreover', 'we', 'analyze', 'the', 'typical', 'performance', 'of', 'our', 'proposed', 'method', 'of', 'the', 'hamiltonian', 'estimation', 'by', 'using', 'the', 'replica', 'method', 'we', 'also', 'compare', 'our', 'analytical', 'results', 'through', 'several', 'numerical', 'experiments', 'using', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers']] | [-0.07690875820385722, 0.05489375517846873, -0.11012572159525007, 0.04116069579210419, -0.08986632319597097, -0.13652495057322084, 0.04314065212115215, 0.387382055604114, -0.2896677559778954, -0.321955437399447, 0.1313156633091589, -0.21755199265451386, -0.17171863147568028, 0.23828102659004238, -0.01274448256724729, 0.1141689421063907, 0.0715128385166351, 0.026558329834817693, -0.11564882212903915, -0.2454758550398625, 0.28959424760765756, 0.03474788294675259, 0.29050441607116506, 0.054320473148702426, 0.12327326897245187, 0.01352888722366725, 0.02210993718606635, 0.0478124840471607, -0.12064436854919992, 0.16244611008665882, 0.22323202558506566, 0.1426951019720246, 0.286576852381516, -0.4171371220396115, -0.22247416054686675, 0.11291048991708802, 0.14658381527003186, 0.1283284747426828, -0.05186806280398741, -0.28320237879569715, 0.09838942958113665, -0.17154918941310965, -0.07410220010206103, -0.11616753804801892, -0.0880760073930455, 0.02483448441355274, -0.2893634351203218, 0.0394809455277237, 0.024121876786319683, 0.014853729622868392, -0.0794110221734557, -0.1305465445298558, 0.05053723806586976, 0.08847662715886075, 0.04974176411767705, 0.01758646218535992, 0.09758698748281369, -0.07696155102457851, -0.17870824253186585, 0.3686586945819167, -0.027784567782118057, -0.2602162693669715, 0.176722015804038, -0.022615902340756014, -0.13129357701489844, 0.09418029326300781, 0.19514781639982876, 0.16829671305246077, -0.1664674198254943, 0.06163499116396102, -0.0804162144392299, 0.1388673112835162, -0.026008874437628456, -0.030197192753593508, 0.14418449415467105, 0.18855754859888782, 0.0525986889968268, 0.20358832778628522, -0.11036354429804934, -0.10071147077788527, -0.2532145668573391, -0.12591782985255123, -0.2461382396501274, -0.020980826480529055, -0.07572464374444769, -0.13478836860651008, 0.4514922858144228, 0.21215005233400286, 0.19734230651520193, 0.04619200786378665, 0.34946233776326363, 0.12759499234738403, 0.07212929506786167, 0.07196070966086923, 0.21697073988616467, 0.13372532041455717, 0.06208864060732035, -0.2516544499846462, 0.04539003979343061, 0.10905239455437718] |
1,803.02082 | Partitioning signed networks | Signed networks appear naturally in contexts where conflict or animosity is
apparent. In this book chapter we review some of the literature on signed
networks, especially in the context of partitioning. Most of the work is
founded in what is known as structural balance theory. We cover the basic
mathematical principles of structural balance theory. The theory yields a
natural formulation for partitioning. We briefly compare this to other
partitioning approaches based on community detection. Finally, we analyse an
international network of alliances and conflicts and discuss the implications
of our findings for structural balance theory.
| physics.soc-ph cs.SI | signed networks appear naturally in contexts where conflict or animosity is apparent in this book chapter we review some of the literature on signed networks especially in the context of partitioning most of the work is founded in what is known as structural balance theory we cover the basic mathematical principles of structural balance theory the theory yields a natural formulation for partitioning we briefly compare this to other partitioning approaches based on community detection finally we analyse an international network of alliances and conflicts and discuss the implications of our findings for structural balance theory | [['signed', 'networks', 'appear', 'naturally', 'in', 'contexts', 'where', 'conflict', 'or', 'animosity', 'is', 'apparent', 'in', 'this', 'book', 'chapter', 'we', 'review', 'some', 'of', 'the', 'literature', 'on', 'signed', 'networks', 'especially', 'in', 'the', 'context', 'of', 'partitioning', 'most', 'of', 'the', 'work', 'is', 'founded', 'in', 'what', 'is', 'known', 'as', 'structural', 'balance', 'theory', 'we', 'cover', 'the', 'basic', 'mathematical', 'principles', 'of', 'structural', 'balance', 'theory', 'the', 'theory', 'yields', 'a', 'natural', 'formulation', 'for', 'partitioning', 'we', 'briefly', 'compare', 'this', 'to', 'other', 'partitioning', 'approaches', 'based', 'on', 'community', 'detection', 'finally', 'we', 'analyse', 'an', 'international', 'network', 'of', 'alliances', 'and', 'conflicts', 'and', 'discuss', 'the', 'implications', 'of', 'our', 'findings', 'for', 'structural', 'balance', 'theory']] | [-0.10541582842900728, 0.05226282877886964, -0.09423789452193887, 0.10974149538499962, -0.10586683731283604, -0.0803888769733021, 0.06268317996970534, 0.3434535683700233, -0.2836210978239251, -0.32576862845841487, 0.10767627272677298, -0.2693053315015277, -0.26290013172789867, 0.13189082000705335, -0.1214196950677433, 0.0016682202731317375, 0.047070864997901175, 0.04517052056326065, -0.038203058434495084, -0.22681635143332338, 0.3374060328860651, 0.07680461912726362, 0.3085081296643087, 0.1116728195095978, 0.04409990683855843, 0.004405313256332495, -0.11340516316704452, 0.0929870457657671, -0.16480808669196753, 0.1754780979026691, 0.2802056186289216, 0.21189348348222362, 0.2843939539937613, -0.48022979317465797, -0.2367105352038076, 0.07029590213520957, 0.09844095848772365, 0.1047680021835428, -0.012294869925729776, -0.22509321283238629, 0.04780640018119205, -0.16924373530976786, -0.08455150075830413, -0.04697693625833684, 0.015204929009390375, 0.036695208883732754, -0.17215646389498337, 0.05442613493263101, 0.07015072352805873, 0.08642401439525808, -0.05929832901529153, -0.14402988917572657, 0.03429323485276351, 0.12268913018003029, 0.04377749357324016, -0.01087981796687624, 0.08603700102927785, -0.14871591943665408, -0.1870755339235378, 0.4274516368750483, 0.005366935176122449, -0.14667538798918636, 0.20238999696205914, -0.06606598716947094, -0.2526800394601499, -0.0246005452912262, 0.17786878043261822, 0.10699484274179365, -0.15163107967358277, 0.05968250140116046, -0.053527193747868296, 0.14428236714350837, 0.06093754305038601, 0.03305542307983463, 0.1718948685156647, 0.23829358520742971, 0.0704499355488224, 0.12203659629024817, -0.029533111592172645, -0.17930801163311116, -0.31779894652815227, -0.13650684754247777, -0.12920332786658642, -0.00039540000580018386, -0.07003901492347116, -0.1579905933564684, 0.3882990417769179, 0.19822803634451702, 0.16485456660787653, 0.0520954582025297, 0.2652352634286217, 0.05831425683087824, 0.01089965864472712, 0.01594473213966315, 0.21518254930955058, 0.1429087727156002, 0.1165628285962157, -0.1564757949236082, 0.07527646026270911, 0.08232516091811704] |
1,803.02083 | Detection of topological phase transitions through entropy measurements:
the case of germanene | We propose a characterization tool for studies of the band structure of new
materials promising for the observation of topological phase transitions. We
show that a specific resonant feature in the entropy per electron dependence on
the chemical potential may be considered as a fingerprint of the transition
between topological and trivial insulator phases. The entropy per electron in a
honeycomb two-dimensional crystal of germanene subjected to the external
electric field is obtained from the first principle calculation of the density
of electronic states and the Maxwell relation. We demonstrate that, in
agreement to the recent prediction of the analytical model, strong spikes in
the entropy per particle dependence on the chemical potential appear at low
temperatures. They are observed at the values of the applied bias both below
and above the critical value that corresponds to the transition between the
topological insulator and trivial insulator phases, while the giant resonant
feature in the vicinity of zero chemical potential is strongly suppressed at
the topological transition point, in the low temperature limit. In a wide
energy range, the van Hove singularities in the electronic density of states
manifest themselves as zeros in the entropy per particle dependence on the
chemical potential.
| cond-mat.mes-hall | we propose a characterization tool for studies of the band structure of new materials promising for the observation of topological phase transitions we show that a specific resonant feature in the entropy per electron dependence on the chemical potential may be considered as a fingerprint of the transition between topological and trivial insulator phases the entropy per electron in a honeycomb twodimensional crystal of germanene subjected to the external electric field is obtained from the first principle calculation of the density of electronic states and the maxwell relation we demonstrate that in agreement to the recent prediction of the analytical model strong spikes in the entropy per particle dependence on the chemical potential appear at low temperatures they are observed at the values of the applied bias both below and above the critical value that corresponds to the transition between the topological insulator and trivial insulator phases while the giant resonant feature in the vicinity of zero chemical potential is strongly suppressed at the topological transition point in the low temperature limit in a wide energy range the van hove singularities in the electronic density of states manifest themselves as zeros in the entropy per particle dependence on the chemical potential | [['we', 'propose', 'a', 'characterization', 'tool', 'for', 'studies', 'of', 'the', 'band', 'structure', 'of', 'new', 'materials', 'promising', 'for', 'the', 'observation', 'of', 'topological', 'phase', 'transitions', 'we', 'show', 'that', 'a', 'specific', 'resonant', 'feature', 'in', 'the', 'entropy', 'per', 'electron', 'dependence', 'on', 'the', 'chemical', 'potential', 'may', 'be', 'considered', 'as', 'a', 'fingerprint', 'of', 'the', 'transition', 'between', 'topological', 'and', 'trivial', 'insulator', 'phases', 'the', 'entropy', 'per', 'electron', 'in', 'a', 'honeycomb', 'twodimensional', 'crystal', 'of', 'germanene', 'subjected', 'to', 'the', 'external', 'electric', 'field', 'is', 'obtained', 'from', 'the', 'first', 'principle', 'calculation', 'of', 'the', 'density', 'of', 'electronic', 'states', 'and', 'the', 'maxwell', 'relation', 'we', 'demonstrate', 'that', 'in', 'agreement', 'to', 'the', 'recent', 'prediction', 'of', 'the', 'analytical', 'model', 'strong', 'spikes', 'in', 'the', 'entropy', 'per', 'particle', 'dependence', 'on', 'the', 'chemical', 'potential', 'appear', 'at', 'low', 'temperatures', 'they', 'are', 'observed', 'at', 'the', 'values', 'of', 'the', 'applied', 'bias', 'both', 'below', 'and', 'above', 'the', 'critical', 'value', 'that', 'corresponds', 'to', 'the', 'transition', 'between', 'the', 'topological', 'insulator', 'and', 'trivial', 'insulator', 'phases', 'while', 'the', 'giant', 'resonant', 'feature', 'in', 'the', 'vicinity', 'of', 'zero', 'chemical', 'potential', 'is', 'strongly', 'suppressed', 'at', 'the', 'topological', 'transition', 'point', 'in', 'the', 'low', 'temperature', 'limit', 'in', 'a', 'wide', 'energy', 'range', 'the', 'van', 'hove', 'singularities', 'in', 'the', 'electronic', 'density', 'of', 'states', 'manifest', 'themselves', 'as', 'zeros', 'in', 'the', 'entropy', 'per', 'particle', 'dependence', 'on', 'the', 'chemical', 'potential']] | [-0.1538047802643804, 0.1708281515814846, -0.06659836763752375, 0.039953331138408134, 0.006561803318726927, -0.11669526980559698, 0.11558152712066079, 0.3297933383024673, -0.24354060175156786, -0.3121432273634779, 0.013943217652479177, -0.3349207517996764, -0.1347619647540115, 0.15921119579915605, 0.03702223787908975, 0.04460140281023553, -0.03177873344990003, 0.036286410772234705, -0.11596291259670194, -0.17013187752573275, 0.31365178962323853, 0.04592092500638161, 0.31756345871187264, 0.13430695098115883, 0.03890898592065816, -0.015465733881307701, 0.09212466596454308, 0.014425230247260475, -0.15460662119751836, 0.03494237066971703, 0.24169297435724024, -0.055655216970202974, 0.21162641439610044, -0.41810646247285516, -0.22740430115207808, 0.06002896484010737, 0.0931831995669326, 0.12390657626115602, -0.09696416912625883, -0.26157986342591877, 0.05377649197086173, -0.13885271345932426, -0.13926841655285074, -0.0798972648990095, 0.011132469500961775, 0.007758666635826879, -0.21622513968929583, 0.13242805904861707, 0.028946986920038116, 0.06208427884472321, -0.09798677805208819, -0.10379071431628321, -0.11237429443802406, 0.09756001379498425, 0.026793488981874093, 0.04270794461724529, 0.1673878909607617, -0.1593890583619883, -0.08719056765711056, 0.3703716512994183, -0.10792232246430063, -0.1094034621318274, 0.20546780254191427, -0.1973959927226183, -0.11899360056647415, 0.1676367146115917, 0.12846556505210355, 0.08194720495112277, -0.08491883755966197, 0.08074942767296904, 0.02678163372911513, 0.14790058305990345, 0.034928085620686486, 0.07698277480849175, 0.2940943783603201, 0.15267973707581114, 0.04985124817516525, 0.15789956513233946, -0.1179890090968015, -0.08168621819619257, -0.2941470516762182, -0.18027398174898512, -0.24745711825083738, 0.03304485643782945, -0.09161505452907454, -0.20236783977644288, 0.43960399334481104, 0.15203251755532557, 0.21533135851655175, -0.04012964002959504, 0.245814325777925, 0.15621791987457492, 0.06908120209610655, 0.016046535722107454, 0.2696810599082886, 0.1481732269007694, 0.12557937624743812, -0.25911827112283947, 0.03903912502226295, 0.039507495842883315] |
1,803.02084 | Long-range Low-power Wireless Networks and Sampling Strategies in
Electricity Metering | This paper studies a specific low-power wireless technology capable of
reaching a long range, namely LoRa. Such a technology can be used by different
applications in cities involving many transmitting devices while requiring
loose communication constrains. We focus on electricity grids, where LoRa
end-devices are smart-meters that send the average power demanded by their
respective households during a given period. The successfully decoded data by
the LoRa gateway are used by an aggregator to reconstruct the daily households'
profiles. We show how the interference from concurrent transmissions from both
LoRa and non-LoRa devices negatively affect the communication outage
probability and the link effective bit-rate. Besides, we use actual electricity
consumption data to compare time-based and event-based sampling strategies,
showing the advantages of the latter. We then employ this analysis to assess
the gateway range that achieves an average outage probability that leads to a
signal reconstruction with a given requirement. We also discuss that, although
the proposed analysis focuses on electricity metering, it can be easily
extended to any other smart city application with similar requirements, like
water metering or traffic monitoring.
| eess.SP cs.SY | this paper studies a specific lowpower wireless technology capable of reaching a long range namely lora such a technology can be used by different applications in cities involving many transmitting devices while requiring loose communication constrains we focus on electricity grids where lora enddevices are smartmeters that send the average power demanded by their respective households during a given period the successfully decoded data by the lora gateway are used by an aggregator to reconstruct the daily households profiles we show how the interference from concurrent transmissions from both lora and nonlora devices negatively affect the communication outage probability and the link effective bitrate besides we use actual electricity consumption data to compare timebased and eventbased sampling strategies showing the advantages of the latter we then employ this analysis to assess the gateway range that achieves an average outage probability that leads to a signal reconstruction with a given requirement we also discuss that although the proposed analysis focuses on electricity metering it can be easily extended to any other smart city application with similar requirements like water metering or traffic monitoring | [['this', 'paper', 'studies', 'a', 'specific', 'lowpower', 'wireless', 'technology', 'capable', 'of', 'reaching', 'a', 'long', 'range', 'namely', 'lora', 'such', 'a', 'technology', 'can', 'be', 'used', 'by', 'different', 'applications', 'in', 'cities', 'involving', 'many', 'transmitting', 'devices', 'while', 'requiring', 'loose', 'communication', 'constrains', 'we', 'focus', 'on', 'electricity', 'grids', 'where', 'lora', 'enddevices', 'are', 'smartmeters', 'that', 'send', 'the', 'average', 'power', 'demanded', 'by', 'their', 'respective', 'households', 'during', 'a', 'given', 'period', 'the', 'successfully', 'decoded', 'data', 'by', 'the', 'lora', 'gateway', 'are', 'used', 'by', 'an', 'aggregator', 'to', 'reconstruct', 'the', 'daily', 'households', 'profiles', 'we', 'show', 'how', 'the', 'interference', 'from', 'concurrent', 'transmissions', 'from', 'both', 'lora', 'and', 'nonlora', 'devices', 'negatively', 'affect', 'the', 'communication', 'outage', 'probability', 'and', 'the', 'link', 'effective', 'bitrate', 'besides', 'we', 'use', 'actual', 'electricity', 'consumption', 'data', 'to', 'compare', 'timebased', 'and', 'eventbased', 'sampling', 'strategies', 'showing', 'the', 'advantages', 'of', 'the', 'latter', 'we', 'then', 'employ', 'this', 'analysis', 'to', 'assess', 'the', 'gateway', 'range', 'that', 'achieves', 'an', 'average', 'outage', 'probability', 'that', 'leads', 'to', 'a', 'signal', 'reconstruction', 'with', 'a', 'given', 'requirement', 'we', 'also', 'discuss', 'that', 'although', 'the', 'proposed', 'analysis', 'focuses', 'on', 'electricity', 'metering', 'it', 'can', 'be', 'easily', 'extended', 'to', 'any', 'other', 'smart', 'city', 'application', 'with', 'similar', 'requirements', 'like', 'water', 'metering', 'or', 'traffic', 'monitoring']] | [-0.1613106860146338, 0.06754695566628997, -0.05165341532710703, 0.055993997598663796, -0.07190943500850329, -0.2020529009342626, 0.11618884098047175, 0.39873842246706975, -0.25438408148655084, -0.33417329241557675, 0.1311512997789432, -0.2892958199520446, -0.14343391154900462, 0.2216720310006373, -0.1616643148973502, 0.04694025193531457, 0.0669489140835853, 0.03142587525656869, 0.004402252027342991, -0.258155952776314, 0.23289781495496548, 0.10233143665596267, 0.3838924177927454, 0.05914879239097402, 0.07826143297757851, 0.020115298332224564, -0.04311810112677293, -0.022037158192788862, -0.08182579908440872, 0.12222907911067654, 0.33611246544188556, 0.20335116754002994, 0.27747986548019377, -0.485708002083374, -0.23761568381193798, 0.1062010005888277, 0.13086661056567817, 0.025655712858704306, -0.05709235162155198, -0.2729327175303141, 0.10262400758818038, -0.2642071889719838, -0.06921051625012502, -0.037779058201125315, -0.042277939831169106, 0.10917751108217748, -0.26896919579713385, -0.009421813239032167, -0.04972024205094461, 0.03809766898971072, -0.014487878726576635, -0.061355435890171325, -0.018695336649482502, 0.19095550560474767, 0.029089906178955093, -0.04662575259629781, 0.18036515620995044, -0.09423804996041221, -0.11441509726261771, 0.38939442383820055, -0.008618430126437825, -0.16221799941229229, 0.15197672373300047, -0.061209869805790316, -0.11902128973492107, 0.09678927110186494, 0.23825711893298515, 0.03197509570829365, -0.18062472998457885, -0.005463542412511119, 0.029708131806904358, 0.19646032323330148, 0.08485868413487542, 0.0662446233613715, 0.19127464472079517, 0.199769046724882, 0.1440101469753089, 0.09687487150057482, -0.11229885703734847, -0.09202296051546643, -0.20021292465888169, -0.12749425888264768, -0.1862869919689362, 0.04049544234358762, -0.08409174277296982, -0.052326091073803316, 0.3952255994287314, 0.19557554674283692, 0.1302813676221924, 0.09846174668518116, 0.39753427965957566, 0.09174914331334895, 0.07686952190470138, 0.13729815072385151, 0.15785410463326296, -0.0011739227714953502, 0.19739947155939971, -0.17124167644001997, 0.10096682282164693, -0.051989274657748184] |
1,803.02085 | Semileptonic $\Lambda_{b}\rightarrow \Lambda_{c}{\ell}\bar\nu_{\ell}$
Transition in Full QCD | The tree-level $b\rightarrow c{\ell}\bar\nu_{\ell}$ based hadronic
transitions have been on the focus of much attention since recording
significant deviations of the experimental data, on the ratios of the branching
fractions in $ \tau $ and $ e-\mu $ channels of the semileptonic $ B
\rightarrow D $ transition, from the SM predictions by BaBar Collaboration in
2012. It can be of great importance to look whether similar discrepancies take
place in the semileptonic baryonic $\Lambda_{b}\rightarrow
\Lambda_{c}{\ell}\bar\nu_{\ell}$ decay channel or not. In this accordance we
estimate the decay width as well as the ratios of the branching fractions in $
\tau $ and $ e-\mu $ channels of this baryonic transition by calculating the
form factors, entering the amplitude of this transition as the main inputs, in
the framework of QCD sum rules in full theory. We compare the obtained results
with the predictions of other theoretical studies. Our results may be compared
with the corresponding future experimental data to look for possible deviations
of data from the SM predictions.
| hep-ph hep-ex hep-lat | the treelevel brightarrow cellbarnu_ell based hadronic transitions have been on the focus of much attention since recording significant deviations of the experimental data on the ratios of the branching fractions in tau and emu channels of the semileptonic b rightarrow d transition from the sm predictions by babar collaboration in 2012 it can be of great importance to look whether similar discrepancies take place in the semileptonic baryonic lambda_brightarrow lambda_cellbarnu_ell decay channel or not in this accordance we estimate the decay width as well as the ratios of the branching fractions in tau and emu channels of this baryonic transition by calculating the form factors entering the amplitude of this transition as the main inputs in the framework of qcd sum rules in full theory we compare the obtained results with the predictions of other theoretical studies our results may be compared with the corresponding future experimental data to look for possible deviations of data from the sm predictions | [['the', 'treelevel', 'brightarrow', 'cellbarnu_ell', 'based', 'hadronic', 'transitions', 'have', 'been', 'on', 'the', 'focus', 'of', 'much', 'attention', 'since', 'recording', 'significant', 'deviations', 'of', 'the', 'experimental', 'data', 'on', 'the', 'ratios', 'of', 'the', 'branching', 'fractions', 'in', 'tau', 'and', 'emu', 'channels', 'of', 'the', 'semileptonic', 'b', 'rightarrow', 'd', 'transition', 'from', 'the', 'sm', 'predictions', 'by', 'babar', 'collaboration', 'in', '2012', 'it', 'can', 'be', 'of', 'great', 'importance', 'to', 'look', 'whether', 'similar', 'discrepancies', 'take', 'place', 'in', 'the', 'semileptonic', 'baryonic', 'lambda_brightarrow', 'lambda_cellbarnu_ell', 'decay', 'channel', 'or', 'not', 'in', 'this', 'accordance', 'we', 'estimate', 'the', 'decay', 'width', 'as', 'well', 'as', 'the', 'ratios', 'of', 'the', 'branching', 'fractions', 'in', 'tau', 'and', 'emu', 'channels', 'of', 'this', 'baryonic', 'transition', 'by', 'calculating', 'the', 'form', 'factors', 'entering', 'the', 'amplitude', 'of', 'this', 'transition', 'as', 'the', 'main', 'inputs', 'in', 'the', 'framework', 'of', 'qcd', 'sum', 'rules', 'in', 'full', 'theory', 'we', 'compare', 'the', 'obtained', 'results', 'with', 'the', 'predictions', 'of', 'other', 'theoretical', 'studies', 'our', 'results', 'may', 'be', 'compared', 'with', 'the', 'corresponding', 'future', 'experimental', 'data', 'to', 'look', 'for', 'possible', 'deviations', 'of', 'data', 'from', 'the', 'sm', 'predictions']] | [-0.0493991047886918, 0.16842993141736265, -0.060540059403439234, 0.08867780791942599, -0.03836968318399066, -0.09357100027571817, 0.108180837641221, 0.30367523530249, -0.19871649957576376, -0.2501155190958766, 0.05447446116228487, -0.32268907096990307, -0.053486294138681285, 0.1518642205587784, 0.04969245030776046, 0.09376559098055408, 0.09081964691727167, 0.025597978582024384, -0.07640131427735909, -0.19718627722423737, 0.25417510215133715, 0.05111856432335012, 0.2574271857884941, 0.07300501496821737, -0.05537580297800125, -0.03368636302332613, -0.09646051240325638, -0.029133624815423587, -0.17023692723155276, 0.06048642805996974, 0.2199615471177752, 0.14348083275079632, 0.13224621146774976, -0.3935256523738621, -0.12063747557669072, 0.14156306321602197, 0.1467207715991932, 0.09627966303378344, -0.023572351058328132, -0.34551875286136463, 0.09011123520225749, -0.16778682369833728, -0.04745080755655743, -0.054389758569419765, 0.0353970036806337, -0.021840472913281932, -0.31658359072734693, 0.08918506621270422, -0.00575726662812885, 0.02818129895622753, -0.017768517141022785, -0.24223498055699524, -0.0023821285884281632, 0.1395769525945163, 0.13002454407756353, 0.057002308693933926, 0.13809646661304364, -0.16194716025926884, -0.17536613291609962, 0.4335348568560117, -0.09481782679724846, -0.15307577649594112, 0.15155304382647133, -0.24360342385769365, -0.15892177096929158, 0.15083816432198333, 0.2274044474266517, 0.027376369863843463, -0.15324007141979257, 0.09997142536289824, -0.03222913280052317, 0.12043134016607693, 0.04011331510338576, 0.06304678767267022, 0.19899538445440684, 0.1898787822070158, -0.06961600040678813, 0.07596731036612289, -0.07581159439542966, -0.08890861312593304, -0.3565764202288453, -0.12271962292005967, -0.11068933251296069, 0.06968469582774282, -0.0546446781200253, -0.078353403236978, 0.36358545979063744, 0.13035518962335269, 0.323212492787079, 0.0654846776193779, 0.3097733373658815, 0.1036805937817071, 0.08974240673149811, 0.007250315620961368, 0.32681597200530776, 0.16215501433374824, 0.1277825744454838, -0.2544744181695875, 0.08576706172542492, 0.0009172144256959295] |
1,803.02086 | Classes of Exactly Solvable Generalized Semi-Classical Rabi Systems | The exact quantum dynamics of a single spin-1/2 in a generic time-dependent
classical magnetic field is investigated and compared with the quantum motion
of a spin-1/2 studied by Rabi and Schwinger. The possibility of regarding the
scenario studied in this paper as a generalization of that considered by Rabi
and Schwinger is discussed and a notion of time-dependent resonance condition
is introduced and carefully legitimated and analysed. Several examples help to
disclose analogies and departures of the quantum motion induced in a
generalized Rabi system with respect to that exhibited by the spin-1/2 in a
magnetic field precessing around the $z$-axis. We find that, under generalized
resonance condition, the time evolution of the transition probability
$P_+^-(t)$ between the two eigenstates of ${\hat{S}}^z$ may be dominated by a
regime of distorted oscillations, or may even exhibit a monotonic behaviour. At
the same time we succeed in predicting no oscillations in the behaviour of
$P_+^-(t)$ under general conditions. New scenarios of experimental interest
originating a Landau-Zener transition is brought to light. Finally, the
usefulness of our results is emphasized by showing their applicability in a
classical guided wave optics scenario.
| quant-ph | the exact quantum dynamics of a single spin12 in a generic timedependent classical magnetic field is investigated and compared with the quantum motion of a spin12 studied by rabi and schwinger the possibility of regarding the scenario studied in this paper as a generalization of that considered by rabi and schwinger is discussed and a notion of timedependent resonance condition is introduced and carefully legitimated and analysed several examples help to disclose analogies and departures of the quantum motion induced in a generalized rabi system with respect to that exhibited by the spin12 in a magnetic field precessing around the zaxis we find that under generalized resonance condition the time evolution of the transition probability p_t between the two eigenstates of hatsz may be dominated by a regime of distorted oscillations or may even exhibit a monotonic behaviour at the same time we succeed in predicting no oscillations in the behaviour of p_t under general conditions new scenarios of experimental interest originating a landauzener transition is brought to light finally the usefulness of our results is emphasized by showing their applicability in a classical guided wave optics scenario | [['the', 'exact', 'quantum', 'dynamics', 'of', 'a', 'single', 'spin12', 'in', 'a', 'generic', 'timedependent', 'classical', 'magnetic', 'field', 'is', 'investigated', 'and', 'compared', 'with', 'the', 'quantum', 'motion', 'of', 'a', 'spin12', 'studied', 'by', 'rabi', 'and', 'schwinger', 'the', 'possibility', 'of', 'regarding', 'the', 'scenario', 'studied', 'in', 'this', 'paper', 'as', 'a', 'generalization', 'of', 'that', 'considered', 'by', 'rabi', 'and', 'schwinger', 'is', 'discussed', 'and', 'a', 'notion', 'of', 'timedependent', 'resonance', 'condition', 'is', 'introduced', 'and', 'carefully', 'legitimated', 'and', 'analysed', 'several', 'examples', 'help', 'to', 'disclose', 'analogies', 'and', 'departures', 'of', 'the', 'quantum', 'motion', 'induced', 'in', 'a', 'generalized', 'rabi', 'system', 'with', 'respect', 'to', 'that', 'exhibited', 'by', 'the', 'spin12', 'in', 'a', 'magnetic', 'field', 'precessing', 'around', 'the', 'zaxis', 'we', 'find', 'that', 'under', 'generalized', 'resonance', 'condition', 'the', 'time', 'evolution', 'of', 'the', 'transition', 'probability', 'p_t', 'between', 'the', 'two', 'eigenstates', 'of', 'hatsz', 'may', 'be', 'dominated', 'by', 'a', 'regime', 'of', 'distorted', 'oscillations', 'or', 'may', 'even', 'exhibit', 'a', 'monotonic', 'behaviour', 'at', 'the', 'same', 'time', 'we', 'succeed', 'in', 'predicting', 'no', 'oscillations', 'in', 'the', 'behaviour', 'of', 'p_t', 'under', 'general', 'conditions', 'new', 'scenarios', 'of', 'experimental', 'interest', 'originating', 'a', 'landauzener', 'transition', 'is', 'brought', 'to', 'light', 'finally', 'the', 'usefulness', 'of', 'our', 'results', 'is', 'emphasized', 'by', 'showing', 'their', 'applicability', 'in', 'a', 'classical', 'guided', 'wave', 'optics', 'scenario']] | [-0.16054421720748885, 0.19174313052567316, -0.06218090623944126, 0.08610382099992576, -0.03031292919718482, -0.14006876171952945, 0.03620711928964196, 0.3442495665735902, -0.22118806599718618, -0.2630606075167344, 0.0429337765263552, -0.23794758226227095, -0.1472217949624966, 0.21846802965514955, -0.017263297602147894, 0.05029976209984755, 0.04778120893380664, 0.05912795224093258, -0.0764340224676879, -0.17623384937797573, 0.3130035202868501, 0.051205452200287875, 0.25560223751830213, 0.04407281422321288, 0.08106742313805412, 0.015659516730514217, 0.05910594023496626, 0.05476420483690627, -0.11683759904302318, 0.05089631580073941, 0.18543943935668372, 0.05370160541249479, 0.25927065301468555, -0.3996606763214507, -0.2145248514629821, 0.07746520410836773, 0.13998268982593684, 0.1309189695389347, -0.09760223440776401, -0.33870121917905327, 0.03544444286393279, -0.15059759281327986, -0.17321037616273585, -0.06888799373422096, -0.008138984631241715, 0.00835193899965429, -0.2701269793373711, 0.10410358294834719, 0.0940352208327819, 0.06172498044264664, -0.05130705062022552, -0.032209134295315266, 0.0014040112554868484, 0.06046987658222899, 0.061593305793878166, 0.014430012873453187, 0.10687630522025234, -0.13386051472588542, -0.1647858177014488, 0.4055804621497605, -0.08773591776379691, -0.18634482539392652, 0.1556525040966548, -0.17669302524325062, -0.0945498708368061, 0.1142569551469778, 0.12712885326943657, 0.10488020488001565, -0.1555864747187638, 0.0864108311723883, -0.018539433599065153, 0.12370780247332964, 0.0668501485376916, 0.03923815392060552, 0.21990804301272643, 0.1408241387825717, -0.013352463759997107, 0.18213066137259568, -0.07957153239267621, -0.1768318305480631, -0.28381994664371807, -0.12272621800025747, -0.1792976602347211, 0.0671746562475164, -0.04228077981903706, -0.13761209166222352, 0.4394956540138005, 0.14449280013263405, 0.21574266218738827, -0.011475318198171543, 0.23875642969258168, 0.13798945057924164, 0.007555447344202548, 0.0370600528103557, 0.2762534319561847, 0.17320318385448424, 0.11526526182523354, -0.28551771561800937, 0.030375173241098192, 0.014146351672837789] |
1,803.02087 | Two limit theorems for the high-dimensional two-stage contact process | In this paper we are concerned with the two-stage contact process introduced
in \cite{Krone1999} on a high-dimensional lattice. By comparing this process
with an auxiliary model which is a linear system, we obtain two limit theorems
for this process as the dimension of the lattice grows to infinity. The first
theorem is about the upper invariant measure of the process. The second theorem
is about asymptotic behavior of the critical value of the process. These two
theorems can be considered as extensions of their counterparts for the basic
contact processes proved in \cite{Grif1983} and \cite{Schonmann1986}.
| math.PR | in this paper we are concerned with the twostage contact process introduced in citekrone1999 on a highdimensional lattice by comparing this process with an auxiliary model which is a linear system we obtain two limit theorems for this process as the dimension of the lattice grows to infinity the first theorem is about the upper invariant measure of the process the second theorem is about asymptotic behavior of the critical value of the process these two theorems can be considered as extensions of their counterparts for the basic contact processes proved in citegrif1983 and citeschonmann1986 | [['in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'the', 'twostage', 'contact', 'process', 'introduced', 'in', 'citekrone1999', 'on', 'a', 'highdimensional', 'lattice', 'by', 'comparing', 'this', 'process', 'with', 'an', 'auxiliary', 'model', 'which', 'is', 'a', 'linear', 'system', 'we', 'obtain', 'two', 'limit', 'theorems', 'for', 'this', 'process', 'as', 'the', 'dimension', 'of', 'the', 'lattice', 'grows', 'to', 'infinity', 'the', 'first', 'theorem', 'is', 'about', 'the', 'upper', 'invariant', 'measure', 'of', 'the', 'process', 'the', 'second', 'theorem', 'is', 'about', 'asymptotic', 'behavior', 'of', 'the', 'critical', 'value', 'of', 'the', 'process', 'these', 'two', 'theorems', 'can', 'be', 'considered', 'as', 'extensions', 'of', 'their', 'counterparts', 'for', 'the', 'basic', 'contact', 'processes', 'proved', 'in', 'citegrif1983', 'and', 'citeschonmann1986']] | [-0.11159918864217142, 0.10482165340537271, -0.1014139809716574, 0.06865513766722317, -0.02424611221573761, -0.10703369816157805, 0.06792339876815474, 0.3258707295981762, -0.2846527123094901, -0.2471751737985355, 0.17250342553344797, -0.2733278361392086, -0.14817124157739076, 0.1967222275409807, -0.06631755148080866, 0.08074195295288834, 0.02191333885750045, 0.07718112900519096, -0.0411208668096072, -0.2504303481571538, 0.37349203741177917, 0.04413467523155977, 0.2468169787493737, 0.05478660516319391, 0.10730144950756094, 0.033389543732324535, -0.028774972488779738, -0.019473109348758084, -0.1434058094214972, 0.13186213408556322, 0.21784951652238227, 0.07326305448330696, 0.26129785119353427, -0.36757124249782896, -0.18515614415114018, 0.10783533772716866, 0.12226711425920138, 0.10710684968754598, 0.03877498788895774, -0.26265508140204474, 0.12142248951789478, -0.12931578160192736, -0.18722881449123277, -0.032281994961364115, -0.015350602348284472, 0.012189897240402744, -0.27097050100564957, 0.06638459603140212, 0.17483650202579473, 0.06249727363889258, -0.04231832022576228, -0.09241514718134726, 0.018270156412061467, 0.13059258131872173, 0.08044099895778345, 0.00214382471597713, 0.08745715401955353, -0.11513428830632778, -0.14864729368127882, 0.3492852825944757, -0.0746875770223003, -0.21270341682311086, 0.18480772944167256, -0.12697955831358937, -0.1450428856339346, 0.08366825994428086, 0.1798306708122887, 0.14503276056569556, -0.18777402289940612, 0.10950715166868379, -0.03763312317997865, 0.10885296411731321, 0.05736782394207852, 0.018691750714028982, 0.1446082514746155, 0.1938240592084501, 0.09059989927134113, 0.19938609460444676, -0.03050077605597756, -0.13068349542015273, -0.33729364237059717, -0.19090975211609318, -0.187370089474944, 0.07879704585977142, -0.1145770445758029, -0.1653809459809133, 0.32985595092886005, 0.14765398537375682, 0.23971538265671014, 0.08177846039609943, 0.258839031370134, 0.2039401473593898, 0.009863047069697843, 0.02743239281192908, 0.2156623303687767, 0.16663605859756228, 0.09094258120951607, -0.1391480757362012, 0.05822631269794605, 0.10557005239610115] |
1,803.02088 | Explain Yourself: A Natural Language Interface for Scrutable Autonomous
Robots | Autonomous systems in remote locations have a high degree of autonomy and
there is a need to explain what they are doing and why in order to increase
transparency and maintain trust. Here, we describe a natural language chat
interface that enables vehicle behaviour to be queried by the user. We obtain
an interpretable model of autonomy through having an expert 'speak out-loud'
and provide explanations during a mission. This approach is agnostic to the
type of autonomy model and as expert and operator are from the same user-group,
we predict that these explanations will align well with the operator's mental
model, increase transparency and assist with operator training.
| cs.CL cs.AI cs.HC | autonomous systems in remote locations have a high degree of autonomy and there is a need to explain what they are doing and why in order to increase transparency and maintain trust here we describe a natural language chat interface that enables vehicle behaviour to be queried by the user we obtain an interpretable model of autonomy through having an expert speak outloud and provide explanations during a mission this approach is agnostic to the type of autonomy model and as expert and operator are from the same usergroup we predict that these explanations will align well with the operators mental model increase transparency and assist with operator training | [['autonomous', 'systems', 'in', 'remote', 'locations', 'have', 'a', 'high', 'degree', 'of', 'autonomy', 'and', 'there', 'is', 'a', 'need', 'to', 'explain', 'what', 'they', 'are', 'doing', 'and', 'why', 'in', 'order', 'to', 'increase', 'transparency', 'and', 'maintain', 'trust', 'here', 'we', 'describe', 'a', 'natural', 'language', 'chat', 'interface', 'that', 'enables', 'vehicle', 'behaviour', 'to', 'be', 'queried', 'by', 'the', 'user', 'we', 'obtain', 'an', 'interpretable', 'model', 'of', 'autonomy', 'through', 'having', 'an', 'expert', 'speak', 'outloud', 'and', 'provide', 'explanations', 'during', 'a', 'mission', 'this', 'approach', 'is', 'agnostic', 'to', 'the', 'type', 'of', 'autonomy', 'model', 'and', 'as', 'expert', 'and', 'operator', 'are', 'from', 'the', 'same', 'usergroup', 'we', 'predict', 'that', 'these', 'explanations', 'will', 'align', 'well', 'with', 'the', 'operators', 'mental', 'model', 'increase', 'transparency', 'and', 'assist', 'with', 'operator', 'training']] | [-0.07100990021394359, 0.09994375065246087, -0.07399015485619505, 0.08480496002744918, -0.1627931813558529, -0.18898050113650108, 0.06327230420343026, 0.4494146750981195, -0.2468814300718131, -0.36463662616356657, 0.07945537769140813, -0.2975665670302179, -0.17946547410381888, 0.13263198643862442, -0.15180454646771843, 0.009288547250131765, 0.06387041247432569, 0.08613548829480014, 0.013587000885039472, -0.2331424701993388, 0.30049464382507185, 0.07148960729440053, 0.2426804357630856, 0.04858366338777597, 0.104381995042786, -0.033759225931673964, 0.029185524022775806, -0.011493038981118135, -0.06068869969978415, 0.15892848128095027, 0.3343125844926194, 0.21264916490246025, 0.3189052184181357, -0.44687054878859606, -0.1857651169843006, 0.09898488245111096, 0.13457286927883547, 0.07927526785190114, -0.01782747519879464, -0.32018619296744605, 0.09602585777799875, -0.22473194036986874, -0.1294823165495742, -0.14275360085001146, -0.014540427521785238, 0.018730116960661555, -0.28767250159957997, -0.009873740433249623, 0.057314994892631484, 0.12841378356744018, -0.0962158127049743, -0.011916745545696121, -0.004354616133409932, 0.21080855514500635, 0.020012884833030747, 0.03250935264104218, 0.11159611900371534, -0.14584949502885272, -0.1444485882055704, 0.36990597224535626, 0.003589237310397611, -0.19821734387531048, 0.2120450422527803, -0.0967792031932967, -0.08932399794166149, 0.060101727996004266, 0.20787787549973777, 0.04351632122847217, -0.1701741359429434, 0.01897391795958996, -0.0005139065561471162, 0.18835237055059728, 0.02789899500095527, 0.020469144659323826, 0.20643014591877107, 0.1836058691971832, 0.08362190343689656, 0.09401609484619391, -0.01161784230714181, -0.0524152092575268, -0.2599507092241698, -0.19018131780817552, -0.1058902881556639, -0.008268124702024378, -0.05607639555293847, -0.11429188011593565, 0.3566337102610204, 0.2700244074307934, 0.22289589989964884, 0.05316695224286781, 0.3042616259298046, 0.11171923795201885, 0.10160216853492549, 0.06906167729930193, 0.19483724250609089, 0.002742053219763976, 0.16156308586209048, -0.16963784100436088, 0.15112126926477584, 0.005178382195515075] |
1,803.02089 | Optimal Independence-Checking Coding For Secure Uplink Training in
Large-Scale MISO-OFDM Systems | Due to the publicly-known deterministic character- istic of pilot tones,
pilot-aware attack, by jamming, nulling and spoofing pilot tones, can
significantly paralyze the uplink channel training in large-scale MISO-OFDM
systems. To solve this, we in this paper develop an independence-checking
coding based (ICCB) uplink training architecture for one-ring scattering
scenarios allowing for uniform linear arrays (ULA) deployment. Here, we not
only insert randomized pilots on subcarriers for channel impulse response (CIR)
estimation, but also diversify and encode subcarrier activation patterns (SAPs)
to convey those pilots simultaneously. The coded SAPs, though interfered by
arbitrary unknown SAPs in wireless environment, are qualified to be reliably
identified and decoded into the original pilots by checking the hidden channel
independence existing in subcarri- ers. Specifically, an independence-checking
coding (ICC) theory is formulated to support the encoding/decoding process in
this architecture. The optimal ICC code is further developed for guaranteeing a
well-imposed estimation of CIR while maximizing the code rate. Based on this
code, the identification error probability (IEP) is characterized to evaluate
the reliability of this architecture. Interestingly, we discover the principle
of IEP reduction by exploiting the array spatial correlation, and prove that
zero-IEP, i.e., perfect reliability, can be guaranteed under
continuously-distributed mean angle of arrival (AoA). Besides this, a novel
closed form of IEP expression is derived in discretely- distributed case.
Simulation results finally verify the effectiveness of the proposed
architecture.
| eess.SP | due to the publiclyknown deterministic character istic of pilot tones pilotaware attack by jamming nulling and spoofing pilot tones can significantly paralyze the uplink channel training in largescale misoofdm systems to solve this we in this paper develop an independencechecking coding based iccb uplink training architecture for onering scattering scenarios allowing for uniform linear arrays ula deployment here we not only insert randomized pilots on subcarriers for channel impulse response cir estimation but also diversify and encode subcarrier activation patterns saps to convey those pilots simultaneously the coded saps though interfered by arbitrary unknown saps in wireless environment are qualified to be reliably identified and decoded into the original pilots by checking the hidden channel independence existing in subcarri ers specifically an independencechecking coding icc theory is formulated to support the encodingdecoding process in this architecture the optimal icc code is further developed for guaranteeing a wellimposed estimation of cir while maximizing the code rate based on this code the identification error probability iep is characterized to evaluate the reliability of this architecture interestingly we discover the principle of iep reduction by exploiting the array spatial correlation and prove that zeroiep ie perfect reliability can be guaranteed under continuouslydistributed mean angle of arrival aoa besides this a novel closed form of iep expression is derived in discretely distributed case simulation results finally verify the effectiveness of the proposed architecture | [['due', 'to', 'the', 'publiclyknown', 'deterministic', 'character', 'istic', 'of', 'pilot', 'tones', 'pilotaware', 'attack', 'by', 'jamming', 'nulling', 'and', 'spoofing', 'pilot', 'tones', 'can', 'significantly', 'paralyze', 'the', 'uplink', 'channel', 'training', 'in', 'largescale', 'misoofdm', 'systems', 'to', 'solve', 'this', 'we', 'in', 'this', 'paper', 'develop', 'an', 'independencechecking', 'coding', 'based', 'iccb', 'uplink', 'training', 'architecture', 'for', 'onering', 'scattering', 'scenarios', 'allowing', 'for', 'uniform', 'linear', 'arrays', 'ula', 'deployment', 'here', 'we', 'not', 'only', 'insert', 'randomized', 'pilots', 'on', 'subcarriers', 'for', 'channel', 'impulse', 'response', 'cir', 'estimation', 'but', 'also', 'diversify', 'and', 'encode', 'subcarrier', 'activation', 'patterns', 'saps', 'to', 'convey', 'those', 'pilots', 'simultaneously', 'the', 'coded', 'saps', 'though', 'interfered', 'by', 'arbitrary', 'unknown', 'saps', 'in', 'wireless', 'environment', 'are', 'qualified', 'to', 'be', 'reliably', 'identified', 'and', 'decoded', 'into', 'the', 'original', 'pilots', 'by', 'checking', 'the', 'hidden', 'channel', 'independence', 'existing', 'in', 'subcarri', 'ers', 'specifically', 'an', 'independencechecking', 'coding', 'icc', 'theory', 'is', 'formulated', 'to', 'support', 'the', 'encodingdecoding', 'process', 'in', 'this', 'architecture', 'the', 'optimal', 'icc', 'code', 'is', 'further', 'developed', 'for', 'guaranteeing', 'a', 'wellimposed', 'estimation', 'of', 'cir', 'while', 'maximizing', 'the', 'code', 'rate', 'based', 'on', 'this', 'code', 'the', 'identification', 'error', 'probability', 'iep', 'is', 'characterized', 'to', 'evaluate', 'the', 'reliability', 'of', 'this', 'architecture', 'interestingly', 'we', 'discover', 'the', 'principle', 'of', 'iep', 'reduction', 'by', 'exploiting', 'the', 'array', 'spatial', 'correlation', 'and', 'prove', 'that', 'zeroiep', 'ie', 'perfect', 'reliability', 'can', 'be', 'guaranteed', 'under', 'continuouslydistributed', 'mean', 'angle', 'of', 'arrival', 'aoa', 'besides', 'this', 'a', 'novel', 'closed', 'form', 'of', 'iep', 'expression', 'is', 'derived', 'in', 'discretely', 'distributed', 'case', 'simulation', 'results', 'finally', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'architecture']] | [-0.19304135243821366, 0.04034812089039447, -0.0315270236444689, 0.04768657741510754, -0.0654454776928739, -0.24180058158546416, 0.11618061061781026, 0.3976306402760798, -0.27226097713228803, -0.2768744673733747, 0.10697564391321313, -0.20044154334234968, -0.19168341102771783, 0.13123738122745776, -0.14664924683995392, 0.0818460893952098, 0.04522612163738023, 0.030498711607204035, -0.037383073789822946, -0.2865076433610154, 0.25012105248438626, 0.12851184430612225, 0.36081037405305183, -0.025686200265403903, 0.09659782933109183, 0.047010651755892585, -0.042457437192245776, -0.05322703108827824, -0.06122095476034886, 0.08431295895837332, 0.3307120401424891, 0.20098435844355833, 0.25277219301435205, -0.41264564230852674, -0.24287602716711312, 0.07913774228549449, 0.1836747309125589, 0.08617543527430842, -0.03951589118824151, -0.31613264189363033, 0.14110197618074832, -0.1886274050742101, -0.015755252611857094, -0.02711315013518835, -0.060724898804046586, 0.03123850258656175, -0.367447287217204, 0.024595782006811562, 0.029920526477824307, 0.05610021607680626, -0.058681318150017814, -0.09423442333631167, 0.05192239309067952, 0.1586429134508536, 0.02005057747365709, -0.002468547490910033, 0.0984092877279099, -0.07392937514050078, -0.11471183658013862, 0.3107545535560546, -0.0018782684870793302, -0.25572281265926305, 0.11196482185736863, -0.07712990106283624, -0.09513332374600432, 0.18293803494120212, 0.24854497309791018, 0.061079328342412524, -0.21213117627030853, 0.013824248588454333, -0.028740290962201775, 0.23277884803246707, 0.09881550670976486, 0.06650484335604566, 0.13972019190463866, 0.1535418567537937, 0.08682062675885655, 0.17714366320272007, -0.12354812271707603, -0.0677837268512578, -0.22572550196327032, -0.10821976621855973, -0.21221064562104405, -0.013122410227360765, -0.0761617693954729, -0.0964136627424778, 0.36453746530075654, 0.17211313319826557, 0.09487798175568023, 0.1383479332743103, 0.37435033034461623, 0.08915973660797913, 0.04932802780773659, 0.1318427018159621, 0.1774217330205899, 0.0950432975009522, 0.0819746814786701, -0.22732922336828318, 0.1242195363925576, 0.0160455025381691] |
1,803.0209 | Spectroscopy of $\Omega_{ccb}$ baryon in Hypercentral Quark Model | We extract the mass spectra of triply heavy baryon $\Omega_{ccb}$ using
Hypercentral constituent quark model. The first order correction is also added
to the potential term of Hamiltonian. The radial and orbital excited state
masses are also determined. Moreover, the Regge trajectories and magnetic
moments are also given for this baryon.
| hep-ph | we extract the mass spectra of triply heavy baryon omega_ccb using hypercentral constituent quark model the first order correction is also added to the potential term of hamiltonian the radial and orbital excited state masses are also determined moreover the regge trajectories and magnetic moments are also given for this baryon | [['we', 'extract', 'the', 'mass', 'spectra', 'of', 'triply', 'heavy', 'baryon', 'omega_ccb', 'using', 'hypercentral', 'constituent', 'quark', 'model', 'the', 'first', 'order', 'correction', 'is', 'also', 'added', 'to', 'the', 'potential', 'term', 'of', 'hamiltonian', 'the', 'radial', 'and', 'orbital', 'excited', 'state', 'masses', 'are', 'also', 'determined', 'moreover', 'the', 'regge', 'trajectories', 'and', 'magnetic', 'moments', 'are', 'also', 'given', 'for', 'this', 'baryon']] | [-0.10039181978094812, 0.25779387910905127, -0.07648669583175112, 0.1366395138788457, -0.06769867420342623, -0.07961506268703471, 0.055044793350366404, 0.3093001681434758, -0.2231236832289427, -0.29419880937419685, -0.03212239855316048, -0.3485199824779057, -0.0037179941987144013, 0.08119538897082355, 0.06852403779824574, 0.07318460271127668, 0.05068154064207977, 0.10400134962344286, -0.05135379342690987, -0.22829445201319223, 0.34418876646269186, -0.0038971014905209633, 0.13598678892880095, 0.10508984604886934, 0.054068929871872944, -0.03667955261235144, -0.010392227009230969, -0.03456206356777864, -0.1396757130985897, 0.09938635656555347, 0.09556720938017665, 0.00486182595840564, 0.10560227231140815, -0.3439362050198457, -0.1377563627719806, 0.10605377912083093, 0.18741735243512428, 0.21149377842598102, -0.06451691458841749, -0.28381836783213943, 0.10902150999754667, -0.22689460082819649, -0.2208610332260529, -0.18793048443017052, 0.025908381449898668, 0.01727916613020295, -0.3088036053540075, 0.13955652503143795, -0.04570937981628174, 0.006770174895577571, -0.11234731703777523, -0.21064635276721388, -0.1480902042108652, 0.10186757413926077, 0.08403767014661913, 0.04140292142755261, 0.09264869007336743, -0.08938281460067111, -0.07136744343876547, 0.4242148423457847, -0.08684301878298249, -0.1793585047599467, 0.059986795006575534, -0.16445293957732765, -0.1289234317693056, 0.09124075236054612, 0.1927605053482979, 0.11915451799765886, -0.21747522227758287, 0.0738366708118359, -0.0017742870521603846, 0.1651415604111903, 0.08229806641226306, 0.07424072990668755, 0.24645956760893264, 0.12304043492722307, -0.04934554244848151, 0.05228612382037967, -0.12726907100638046, -0.0880582164607796, -0.3437101586411397, -0.0867438475035277, -0.19099010123560825, -0.030890589032103035, -0.06316964279839714, -0.12685429851362465, 0.43925518191912594, 0.0966103466264173, 0.21721856624764554, 0.024890141214664076, 0.3331437190885053, 0.1611959264778039, 0.06606378314523574, 0.07610492899046079, 0.26269073539650906, 0.24067077427810313, 0.12077208578714407, -0.32625001417838184, -0.03378431635963566, 0.12067950856597985] |
1,803.02091 | On-off intermittency and chaotic walks | We consider a class of skew product maps of interval diffeomorphisms over the
doubling map. The interval maps fix the end points of the interval. It is
assumed that the system has zero fiber Lyapunov exponent at one endpoint and
zero or positive fiber Lyapunov exponent at the other endpoint. We prove the
appearance of on-off intermittency. This is done using the equivalent
description of chaotic walks: random walks driven by the doubling map. The
analysis further relies on approximating the chaotic walks by Markov random
walks, that are constructed using Markov partitions for the doubling map.
| math.DS | we consider a class of skew product maps of interval diffeomorphisms over the doubling map the interval maps fix the end points of the interval it is assumed that the system has zero fiber lyapunov exponent at one endpoint and zero or positive fiber lyapunov exponent at the other endpoint we prove the appearance of onoff intermittency this is done using the equivalent description of chaotic walks random walks driven by the doubling map the analysis further relies on approximating the chaotic walks by markov random walks that are constructed using markov partitions for the doubling map | [['we', 'consider', 'a', 'class', 'of', 'skew', 'product', 'maps', 'of', 'interval', 'diffeomorphisms', 'over', 'the', 'doubling', 'map', 'the', 'interval', 'maps', 'fix', 'the', 'end', 'points', 'of', 'the', 'interval', 'it', 'is', 'assumed', 'that', 'the', 'system', 'has', 'zero', 'fiber', 'lyapunov', 'exponent', 'at', 'one', 'endpoint', 'and', 'zero', 'or', 'positive', 'fiber', 'lyapunov', 'exponent', 'at', 'the', 'other', 'endpoint', 'we', 'prove', 'the', 'appearance', 'of', 'onoff', 'intermittency', 'this', 'is', 'done', 'using', 'the', 'equivalent', 'description', 'of', 'chaotic', 'walks', 'random', 'walks', 'driven', 'by', 'the', 'doubling', 'map', 'the', 'analysis', 'further', 'relies', 'on', 'approximating', 'the', 'chaotic', 'walks', 'by', 'markov', 'random', 'walks', 'that', 'are', 'constructed', 'using', 'markov', 'partitions', 'for', 'the', 'doubling', 'map']] | [-0.20275905031528438, 0.17428710920371346, -0.09675444220286962, 0.06740656448648186, -0.013979656589409509, -0.18773745295601255, 0.09781146569888002, 0.36819499673456263, -0.30088185964958725, -0.13118971262568818, 0.17683731016616538, -0.28163672795461625, -0.14859742767503964, 0.2093864623241165, -0.04912412048499916, 0.1105825668872939, 0.039781813077705425, 0.06997671848902307, -0.04361255141935244, -0.22356411718196936, 0.37081313283019457, 0.013464069464387968, 0.2435911787558616, -0.0401184537265565, 0.15867227675950096, 0.016120604813079704, -0.08335286075460542, -0.018111198214026764, -0.1760166433992971, 0.07479512077016928, 0.1479595361671113, 0.04475152850785345, 0.2534825851871949, -0.2844074989486601, -0.228736067834051, 0.2127871266854255, 0.1377200125908652, 0.03701242820849431, 0.0380758661836789, -0.3221522368221861, 0.10835060335398104, -0.10347454514853734, -0.1367934267372661, -0.01804578679460149, 0.024638135403817155, 0.05583916894477053, -0.26921458849107327, 0.02701867299788084, 0.10100310391832873, 0.1351803039589455, 0.015374926264522616, -0.03471469386965612, -0.030337089288634125, 0.1405977338538073, -0.0029552147193264563, 0.04621339804785729, 0.16950526550296963, 0.012648761054001673, -0.16309418697294192, 0.3053236002889798, -0.09683964330674216, -0.2342265591447808, 0.13352507821370646, -0.20645681992845283, -0.15988954946341127, 0.17034506040250824, 0.11099937399753283, 0.07839766793797925, -0.11010642079924493, 0.14083951438918768, -0.05986792963843063, 0.1227065606964464, 0.10943956746594961, -0.012173803290352225, 0.176448876230219, 0.1129742256058476, 0.18028595029573274, 0.19312432742516808, -0.04082183695167841, -0.16553331318685843, -0.29807743824269506, -0.10634789445927155, -0.2278642886673513, 0.11811763024288854, -0.16067718326569577, -0.22690640081238656, 0.42078615796089786, 0.1148204098205975, 0.22317478919075323, 0.15208557898601152, 0.2111073897133783, 0.18522641460228825, 0.007614391462243709, 0.05745394924444329, 0.11630860932372972, 0.14371413562312416, 0.09673898366457523, -0.14509631120032732, 0.06944476196196736, 0.1966454220225209] |
1,803.02092 | Resonant excitation of infra-red emission in GaN:(Mn,Mg) | By combining experimental photoluminescence excitation spectroscopy and
calculations based on density functional theory and many-body Green's
functions, the most efficient excitation channels of infra-red (IR) emission
from Mn-Mg$_{k}$ paramagnetic complexes stabilized in GaN:(Mn,Mg) are here
identified. Moreover, a Tanabe-Sugano energy diagram for 3$d^{2}$Mn$ ^{5+}$ is
reconstructed and Mn-Mg$_{3}$ are singled out as the predominant configurations
responsible for the IR emission. The correlation of intensity of the individual
emission lines as a function of temperature and excitation energy, allows
assigning them to well defined and specific optical transitions.
| cond-mat.mtrl-sci | by combining experimental photoluminescence excitation spectroscopy and calculations based on density functional theory and manybody greens functions the most efficient excitation channels of infrared ir emission from mnmg_k paramagnetic complexes stabilized in ganmnmg are here identified moreover a tanabesugano energy diagram for 3d2mn 5 is reconstructed and mnmg_3 are singled out as the predominant configurations responsible for the ir emission the correlation of intensity of the individual emission lines as a function of temperature and excitation energy allows assigning them to well defined and specific optical transitions | [['by', 'combining', 'experimental', 'photoluminescence', 'excitation', 'spectroscopy', 'and', 'calculations', 'based', 'on', 'density', 'functional', 'theory', 'and', 'manybody', 'greens', 'functions', 'the', 'most', 'efficient', 'excitation', 'channels', 'of', 'infrared', 'ir', 'emission', 'from', 'mnmg_k', 'paramagnetic', 'complexes', 'stabilized', 'in', 'ganmnmg', 'are', 'here', 'identified', 'moreover', 'a', 'tanabesugano', 'energy', 'diagram', 'for', '3d2mn', '5', 'is', 'reconstructed', 'and', 'mnmg_3', 'are', 'singled', 'out', 'as', 'the', 'predominant', 'configurations', 'responsible', 'for', 'the', 'ir', 'emission', 'the', 'correlation', 'of', 'intensity', 'of', 'the', 'individual', 'emission', 'lines', 'as', 'a', 'function', 'of', 'temperature', 'and', 'excitation', 'energy', 'allows', 'assigning', 'them', 'to', 'well', 'defined', 'and', 'specific', 'optical', 'transitions']] | [-0.08185165194473007, 0.13638477592862078, -0.07063644407926836, 0.10095280295354314, 0.009443954198754259, -0.11969917142275899, 0.07849536842661023, 0.46361474887955756, -0.21630669762851626, -0.29255070777920383, 0.034513827971836906, -0.31030070001465254, -0.08480782970409131, 0.1565859451227533, 0.10941987308961827, 0.030653336879497926, -0.04132651797235234, -0.05899002804930899, -0.04287056679216524, -0.10718061083683833, 0.3230726629151918, 0.07414414689299606, 0.28200185877115774, 0.1167772086226337, 0.03741020276876433, 0.030756843608937094, -0.028187358868308365, 0.007995010985593711, -0.11208690813786927, 0.09725019514804617, 0.2887579244783237, 0.039902334611508106, 0.166588783118641, -0.36954507056535, -0.2239476968866906, 0.026927062637350035, 0.17096080919284196, 0.0863998525199436, -0.058414300494838416, -0.2605320633211661, -0.007039488204533146, -0.09346383372099981, -0.1217437328027916, -0.0952828887717, 0.00297562276301462, 0.05154169863644278, -0.2663828333884123, 0.10944541063093181, -0.06081050567861114, 0.10033588577261114, -0.13280957677592856, -0.1315534888057127, -0.13243499829245375, 0.09369173586656827, -0.017742089364522446, 0.048649230844429917, 0.2125037609865623, -0.12027907868226369, -0.12016064346521273, 0.3428785243138139, -0.07167580107315666, -0.05576973503810309, 0.19053724035689984, -0.13770266537488038, -0.11863324763336484, 0.22335704186532115, 0.04976623851273741, 0.16711232695351577, -0.14765726707299195, 0.04122177612831971, 0.04938361591276979, 0.18523919888372933, 0.08050105253434074, 0.1483901337875674, 0.23689754153712697, 0.10990576281966198, -0.017352162206190683, 0.14822599996183444, -0.16036962466127339, -0.08256092514022298, -0.265559132926033, -0.10770134504751436, -0.20900892486263598, 0.08419365426414602, -0.030734075986401876, -0.1427518321045985, 0.4114103371144405, 0.08265401650004649, 0.17587654530403338, -0.005920544782254312, 0.28649974259592237, 0.16059193974970618, 0.0879406423136104, 0.014765721706983944, 0.25147693615318056, 0.17073311628441193, 0.04913858509999478, -0.2740858493156598, 0.0032289480746147178, 0.017288462073165214] |
1,803.02093 | Twist-induced crossover from 2D to 3D turbulence in active nematics | While studies of active nematics in two dimensions have shed light on various
aspects of the flow regimes and topology of active matter, three-dimensional
properties of topological defects and chaotic flows remain unexplored. By
confining a film of active nematics between two parallel plates, we use
continuum simulations and analytical arguments to demonstrate that the
crossover from quasi-2D to 3D chaotic flows is controlled by the morphology of
the disclination lines. For small plate separations, the active nematic behaves
as a quasi-2D material, with straight topological disclination lines spanning
the height of the channel and exhibiting effectively 2D active turbulence. Upon
increasing channel height, we find a crossover to 3D chaotic flows due to the
contortion of disclinations above a critical activity. We further show that
these contortions are engendered by twist perturbations producing a sharp
change in the curvature of disclinations.
| cond-mat.soft physics.flu-dyn | while studies of active nematics in two dimensions have shed light on various aspects of the flow regimes and topology of active matter threedimensional properties of topological defects and chaotic flows remain unexplored by confining a film of active nematics between two parallel plates we use continuum simulations and analytical arguments to demonstrate that the crossover from quasi2d to 3d chaotic flows is controlled by the morphology of the disclination lines for small plate separations the active nematic behaves as a quasi2d material with straight topological disclination lines spanning the height of the channel and exhibiting effectively 2d active turbulence upon increasing channel height we find a crossover to 3d chaotic flows due to the contortion of disclinations above a critical activity we further show that these contortions are engendered by twist perturbations producing a sharp change in the curvature of disclinations | [['while', 'studies', 'of', 'active', 'nematics', 'in', 'two', 'dimensions', 'have', 'shed', 'light', 'on', 'various', 'aspects', 'of', 'the', 'flow', 'regimes', 'and', 'topology', 'of', 'active', 'matter', 'threedimensional', 'properties', 'of', 'topological', 'defects', 'and', 'chaotic', 'flows', 'remain', 'unexplored', 'by', 'confining', 'a', 'film', 'of', 'active', 'nematics', 'between', 'two', 'parallel', 'plates', 'we', 'use', 'continuum', 'simulations', 'and', 'analytical', 'arguments', 'to', 'demonstrate', 'that', 'the', 'crossover', 'from', 'quasi2d', 'to', '3d', 'chaotic', 'flows', 'is', 'controlled', 'by', 'the', 'morphology', 'of', 'the', 'disclination', 'lines', 'for', 'small', 'plate', 'separations', 'the', 'active', 'nematic', 'behaves', 'as', 'a', 'quasi2d', 'material', 'with', 'straight', 'topological', 'disclination', 'lines', 'spanning', 'the', 'height', 'of', 'the', 'channel', 'and', 'exhibiting', 'effectively', '2d', 'active', 'turbulence', 'upon', 'increasing', 'channel', 'height', 'we', 'find', 'a', 'crossover', 'to', '3d', 'chaotic', 'flows', 'due', 'to', 'the', 'contortion', 'of', 'disclinations', 'above', 'a', 'critical', 'activity', 'we', 'further', 'show', 'that', 'these', 'contortions', 'are', 'engendered', 'by', 'twist', 'perturbations', 'producing', 'a', 'sharp', 'change', 'in', 'the', 'curvature', 'of', 'disclinations']] | [-0.19229524072543686, 0.2407155359784762, -0.05768501893980495, 0.03153263993234314, -0.02197034148406898, -0.15769721618820484, 0.02588997909416121, 0.3802025201895558, -0.25977351776066615, -0.2843040902669548, 0.0663493775864997, -0.2794843210462243, -0.18550968382190516, 0.15437492026438845, -0.008226998029289114, 0.05500604844972465, -0.04340680495749974, -0.07622833112799661, -0.05856192366679113, -0.14868264169769085, 0.3185595621302037, -0.002187032919667714, 0.3059246572698896, 0.042248764085246526, 0.04458956944868497, -0.06626008431830094, 0.016887362227372246, 0.08981384419842708, -0.1946094776938235, 0.08810588007451016, 0.20125890386830406, -0.06149130907233355, 0.17403123467988896, -0.478525513875569, -0.2978323371585538, 0.022736022073828372, 0.1833843051039792, 0.12553753758655162, -0.06985846685381038, -0.27929835925737384, 0.05676946409231593, -0.09632955571877645, -0.1499225576259592, -0.05405225065464141, 0.0343475405338174, 0.04302290067075032, -0.19794660249843876, 0.09575314450586307, 0.0847933846608412, 0.1183820817865603, -0.059619052979206756, -0.020435306918972457, -0.09286480447928032, 0.1279391893920495, 0.0908959073869921, 0.012095541231737122, 0.1961574708309738, -0.1960488757191239, -0.09512281979282275, 0.3565099760097392, -0.02098587527871132, -0.17040464133420524, 0.225087485686506, -0.14527873131479566, -0.0570063212265571, 0.2214287595686351, 0.20089288646807724, 0.09302269301463104, -0.046929334534715254, 0.0331173212059397, -0.06579487501554429, 0.16389652036695165, 0.05104267092236708, -0.010845326952279565, 0.29023352034178607, 0.17408809397396044, 0.06691486492310486, 0.18792674904243348, -0.13777182871271057, -0.13435999877380986, -0.2696421949617261, -0.15804338135512164, -0.14939304615588897, 0.028469663879550095, -0.10303654956609896, -0.2271014065052389, 0.38453607003581014, 0.10687166689531812, 0.22517776793093547, -0.019730372739136748, 0.25846082055677017, -0.0015786359861083594, 0.049259432657549146, 0.07973536647895867, 0.3037277292460203, 0.1519240014773549, 0.12398818584905395, -0.2273106580543999, -0.005694799802219826, 0.08211344785010773] |
1,803.02094 | Developments of Multi-wavelength Spectro-Polarimeter on the Domeless
Solar Telescope at Hida Observatory | To obtain full Stokes spectra in multi-wavelength windows simultaneously, we
developed a new spectro-polarimeter on the Domeless Solar Telescope at Hida
Observatory. The new polarimeter consists of a 60 cm aperture vacuum telescope
on an altazimuth mount, an image rotator, a high dispersion spectrograph,
polarization modulator and analyzer composed of a continuously rotating
waveplate with a retardation nearly constant around 127$^{circ}$ in 500 - 1100
nm and a polarizing beam splitter located closely behind the focus of the
telescope, fast and large format CMOS cameras and an infrared camera. The slit
spectrograph allows us to obtain spectra in as many wavelength windows as the
number of cameras. We characterized the instrumental polarization of the entire
system and established the polarization calibration procedure. The cross-talks
among the Stokes Q,U and V are evaluated to be about 0.06% $sim$ 1.2% depending
on the degree of the intrinsic polarizations. In a typical observing setup, a
sensitivity of 0.03% can be achieved in 20 - 60 second for 500 nm - 1100 nm.
The new polarimeter is expected to provide a powerful tool to diagnose the 3D
magnetic field and other vector physical quantities in the solar atmosphere.
| astro-ph.IM astro-ph.SR | to obtain full stokes spectra in multiwavelength windows simultaneously we developed a new spectropolarimeter on the domeless solar telescope at hida observatory the new polarimeter consists of a 60 cm aperture vacuum telescope on an altazimuth mount an image rotator a high dispersion spectrograph polarization modulator and analyzer composed of a continuously rotating waveplate with a retardation nearly constant around 127circ in 500 1100 nm and a polarizing beam splitter located closely behind the focus of the telescope fast and large format cmos cameras and an infrared camera the slit spectrograph allows us to obtain spectra in as many wavelength windows as the number of cameras we characterized the instrumental polarization of the entire system and established the polarization calibration procedure the crosstalks among the stokes qu and v are evaluated to be about 006 sim 12 depending on the degree of the intrinsic polarizations in a typical observing setup a sensitivity of 003 can be achieved in 20 60 second for 500 nm 1100 nm the new polarimeter is expected to provide a powerful tool to diagnose the 3d magnetic field and other vector physical quantities in the solar atmosphere | [['to', 'obtain', 'full', 'stokes', 'spectra', 'in', 'multiwavelength', 'windows', 'simultaneously', 'we', 'developed', 'a', 'new', 'spectropolarimeter', 'on', 'the', 'domeless', 'solar', 'telescope', 'at', 'hida', 'observatory', 'the', 'new', 'polarimeter', 'consists', 'of', 'a', '60', 'cm', 'aperture', 'vacuum', 'telescope', 'on', 'an', 'altazimuth', 'mount', 'an', 'image', 'rotator', 'a', 'high', 'dispersion', 'spectrograph', 'polarization', 'modulator', 'and', 'analyzer', 'composed', 'of', 'a', 'continuously', 'rotating', 'waveplate', 'with', 'a', 'retardation', 'nearly', 'constant', 'around', '127circ', 'in', '500', '1100', 'nm', 'and', 'a', 'polarizing', 'beam', 'splitter', 'located', 'closely', 'behind', 'the', 'focus', 'of', 'the', 'telescope', 'fast', 'and', 'large', 'format', 'cmos', 'cameras', 'and', 'an', 'infrared', 'camera', 'the', 'slit', 'spectrograph', 'allows', 'us', 'to', 'obtain', 'spectra', 'in', 'as', 'many', 'wavelength', 'windows', 'as', 'the', 'number', 'of', 'cameras', 'we', 'characterized', 'the', 'instrumental', 'polarization', 'of', 'the', 'entire', 'system', 'and', 'established', 'the', 'polarization', 'calibration', 'procedure', 'the', 'crosstalks', 'among', 'the', 'stokes', 'qu', 'and', 'v', 'are', 'evaluated', 'to', 'be', 'about', '006', 'sim', '12', 'depending', 'on', 'the', 'degree', 'of', 'the', 'intrinsic', 'polarizations', 'in', 'a', 'typical', 'observing', 'setup', 'a', 'sensitivity', 'of', '003', 'can', 'be', 'achieved', 'in', '20', '60', 'second', 'for', '500', 'nm', '1100', 'nm', 'the', 'new', 'polarimeter', 'is', 'expected', 'to', 'provide', 'a', 'powerful', 'tool', 'to', 'diagnose', 'the', '3d', 'magnetic', 'field', 'and', 'other', 'vector', 'physical', 'quantities', 'in', 'the', 'solar', 'atmosphere']] | [-0.11087838672591667, 0.15803356395849014, -0.06197768634140773, 0.015105225276324507, -0.07842564294421064, -0.1656949179516615, -0.00021398041127739767, 0.42536499007654033, -0.2080285908654332, -0.3864411989815141, 0.08909119865734522, -0.2730206401467991, -0.03341679340105896, 0.27566196222814093, -0.048528987698649106, 0.02808155898605228, 0.04445366340376878, -0.06775980808291168, -0.01875979732660773, -0.16952622970137254, 0.21950501917714352, 0.12256684662087967, 0.27018094159123535, -0.016372884216865426, 0.16484303116724874, -0.010716291461875173, -0.031276492599250846, -0.014502204199762721, -0.08597373580988987, 0.054324583819528156, 0.21358075042775646, 0.09421077999814818, 0.19382649824010992, -0.35296471564981496, -0.13094766563000648, 0.012142399982794335, 0.10622993029016806, -0.003913392224594166, 0.0012237557187051464, -0.28930376037023964, 0.04678256562604618, -0.10404174582102936, -0.19176890945160074, 0.029083779632836874, 0.0009587531498829393, -0.002170419239586121, -0.27939113086383593, -0.04897139214567448, -0.054315448650404025, 0.14765589780443789, -0.08811220565326756, -0.10883909314809563, -0.024882301797869762, 0.10549364484797576, -0.049577841330564726, 0.07010547207893596, 0.11406980467719749, -0.11028535275989654, -0.024072155518775906, 0.36630553309560604, -0.12292029005597885, -0.05604134687271557, 0.11697281433306145, -0.22601926251755733, -0.05364835811288733, 0.19123985748002795, 0.20257390549308377, 0.13693523597781007, -0.16036771015313112, 0.039837187294860514, -0.00541161551801978, 0.268591700354591, 0.11670718482989621, 0.07694216431363633, 0.2595652447425221, 0.15368595358327422, 0.04187444192326726, 0.12593583261477762, -0.28898873987338064, 0.00975872700739848, -0.2652675552783828, -0.16223790390711082, -0.1359768392787756, 0.060476204299515016, -0.11220669524298404, -0.1359552238234564, 0.4169103834998647, 0.1489996009947438, 0.16744949990197233, 0.0012583421445206593, 0.3196619718580654, 0.04925543576797568, 0.12707372043453352, 0.018629472752984023, 0.31201550739045303, 0.16496862108255492, 0.2020194291345481, -0.1892395591744724, -0.043423301657955896, -0.006072225645919771] |
1,803.02095 | Local negative circuits and cyclic attractors in Boolean networks with
at most five components | We consider the following question on the relationship between the asymptotic
behaviours of asynchronous dynamics of Boolean networks and their regulatory
structures: does the presence of a cyclic attractor imply the existence of a
local negative circuit in the regulatory graph? When the number of model
components $n$ verifies $n \geq 6$, the answer is known to be negative. We show
that the question can be translated into a Boolean satisfiability problem on $n
\cdot 2^n$ variables. A Boolean formula expressing the absence of local
negative circuits and a necessary condition for the existence of cyclic
attractors is found unsatisfiable for $n \leq 5$. In other words, for Boolean
networks with up to $5$ components, the presence of a cyclic attractor requires
the existence of a local negative circuit.
| cs.DM | we consider the following question on the relationship between the asymptotic behaviours of asynchronous dynamics of boolean networks and their regulatory structures does the presence of a cyclic attractor imply the existence of a local negative circuit in the regulatory graph when the number of model components n verifies n geq 6 the answer is known to be negative we show that the question can be translated into a boolean satisfiability problem on n cdot 2n variables a boolean formula expressing the absence of local negative circuits and a necessary condition for the existence of cyclic attractors is found unsatisfiable for n leq 5 in other words for boolean networks with up to 5 components the presence of a cyclic attractor requires the existence of a local negative circuit | [['we', 'consider', 'the', 'following', 'question', 'on', 'the', 'relationship', 'between', 'the', 'asymptotic', 'behaviours', 'of', 'asynchronous', 'dynamics', 'of', 'boolean', 'networks', 'and', 'their', 'regulatory', 'structures', 'does', 'the', 'presence', 'of', 'a', 'cyclic', 'attractor', 'imply', 'the', 'existence', 'of', 'a', 'local', 'negative', 'circuit', 'in', 'the', 'regulatory', 'graph', 'when', 'the', 'number', 'of', 'model', 'components', 'n', 'verifies', 'n', 'geq', '6', 'the', 'answer', 'is', 'known', 'to', 'be', 'negative', 'we', 'show', 'that', 'the', 'question', 'can', 'be', 'translated', 'into', 'a', 'boolean', 'satisfiability', 'problem', 'on', 'n', 'cdot', '2n', 'variables', 'a', 'boolean', 'formula', 'expressing', 'the', 'absence', 'of', 'local', 'negative', 'circuits', 'and', 'a', 'necessary', 'condition', 'for', 'the', 'existence', 'of', 'cyclic', 'attractors', 'is', 'found', 'unsatisfiable', 'for', 'n', 'leq', '5', 'in', 'other', 'words', 'for', 'boolean', 'networks', 'with', 'up', 'to', '5', 'components', 'the', 'presence', 'of', 'a', 'cyclic', 'attractor', 'requires', 'the', 'existence', 'of', 'a', 'local', 'negative', 'circuit']] | [-0.2198746842223891, 0.1122305466136498, -0.00474244971261468, 0.07440434728546949, -0.03698306208721889, -0.1701719962717431, 0.07092697775828861, 0.3025668828437726, -0.27044918990239153, -0.30690638027550987, 0.0770482843896995, -0.25393427420378656, -0.17319294049354025, 0.15823361436997058, -0.033994313805948854, 0.027484041169401285, 0.008288046433554255, 0.09562284566368186, -0.01113126366471424, -0.27292905425650155, 0.3149546480867578, -0.047823749049458394, 0.20546316302403114, 0.036391729626140394, 0.09680795471378884, -0.03311551387905497, 0.021751644730553493, 0.03882902546590844, -0.08423295357679025, 0.09537865193253889, 0.2318675556064894, 0.19469545025725005, 0.279334357008338, -0.4452754043966763, -0.17100388760761495, 0.2118913658593182, 0.13295449517205243, 0.07952477202512497, 0.003403719983879448, -0.22239862178098554, 0.15193228449213567, -0.10479409009932952, -0.1323521691482774, -0.048005477178755196, 0.10278855058068569, 0.029406213540901508, -0.2919534930161583, 0.03840079767153014, 0.17011525018082918, 0.05620628029339073, -0.05183742239768075, -0.10802767048914765, -0.009048830486776294, 0.13091471878917302, -0.03053193564260995, 0.0025445113261771757, 0.08048267232961664, -0.12499039003250095, -0.14501273354457678, 0.3042237860576589, -0.044933144068128844, -0.20610384258997533, 0.12763145124871833, -0.1096180890751786, -0.17903963733435602, 0.10713503274041437, 0.12618281279488416, 0.09635529037954849, -0.0793461904076132, 0.14445462811407958, -0.09779094218081513, 0.2322722653706753, 0.1214826681846103, 0.02016868031865289, 0.1662662894060734, 0.14507684678871677, 0.09742234961584106, 0.1740299781279949, 0.01735478282956652, -0.0733028609276742, -0.2985803478852261, -0.13811976213527974, -0.1414638333123668, 0.13240425646767134, -0.15402712216469922, -0.19602702341453973, 0.38793337436811637, 0.08600288010455033, 0.20944921029803826, 0.13502341278922536, 0.22495190019524375, 0.08340361094925293, 0.040387065465699215, 0.07170242538256932, 0.1335721632841137, 0.18655896012115386, 0.05942210385778038, -0.24406255898246354, 0.1245129130177864, 0.09565149131411499] |
1,803.02096 | Cooperative Tracking of Cyclists Based on Smart Devices and
Infrastructure | In future traffic scenarios, vehicles and other traffic participants will be
interconnected and equipped with various types of sensors, allowing for
cooperation based on data or information exchange. This article presents an
approach to cooperative tracking of cyclists using smart devices and
infrastructure-based sensors. A smart device is carried by the cyclists and an
intersection is equipped with a wide angle stereo camera system. Two tracking
models are presented and compared. The first model is based on the stereo
camera system detections only, whereas the second model cooperatively combines
the camera based detections with velocity and yaw rate data provided by the
smart device. Our aim is to overcome limitations of tracking approaches based
on single data sources. We show in numerical evaluations on scenes where
cyclists are starting or turning right that the cooperation leads to an
improvement in both the ability to keep track of a cyclist and the accuracy of
the track particularly when it comes to occlusions in the visual system. We,
therefore, contribute to the safety of vulnerable road users in future traffic.
| cs.CY cs.AI | in future traffic scenarios vehicles and other traffic participants will be interconnected and equipped with various types of sensors allowing for cooperation based on data or information exchange this article presents an approach to cooperative tracking of cyclists using smart devices and infrastructurebased sensors a smart device is carried by the cyclists and an intersection is equipped with a wide angle stereo camera system two tracking models are presented and compared the first model is based on the stereo camera system detections only whereas the second model cooperatively combines the camera based detections with velocity and yaw rate data provided by the smart device our aim is to overcome limitations of tracking approaches based on single data sources we show in numerical evaluations on scenes where cyclists are starting or turning right that the cooperation leads to an improvement in both the ability to keep track of a cyclist and the accuracy of the track particularly when it comes to occlusions in the visual system we therefore contribute to the safety of vulnerable road users in future traffic | [['in', 'future', 'traffic', 'scenarios', 'vehicles', 'and', 'other', 'traffic', 'participants', 'will', 'be', 'interconnected', 'and', 'equipped', 'with', 'various', 'types', 'of', 'sensors', 'allowing', 'for', 'cooperation', 'based', 'on', 'data', 'or', 'information', 'exchange', 'this', 'article', 'presents', 'an', 'approach', 'to', 'cooperative', 'tracking', 'of', 'cyclists', 'using', 'smart', 'devices', 'and', 'infrastructurebased', 'sensors', 'a', 'smart', 'device', 'is', 'carried', 'by', 'the', 'cyclists', 'and', 'an', 'intersection', 'is', 'equipped', 'with', 'a', 'wide', 'angle', 'stereo', 'camera', 'system', 'two', 'tracking', 'models', 'are', 'presented', 'and', 'compared', 'the', 'first', 'model', 'is', 'based', 'on', 'the', 'stereo', 'camera', 'system', 'detections', 'only', 'whereas', 'the', 'second', 'model', 'cooperatively', 'combines', 'the', 'camera', 'based', 'detections', 'with', 'velocity', 'and', 'yaw', 'rate', 'data', 'provided', 'by', 'the', 'smart', 'device', 'our', 'aim', 'is', 'to', 'overcome', 'limitations', 'of', 'tracking', 'approaches', 'based', 'on', 'single', 'data', 'sources', 'we', 'show', 'in', 'numerical', 'evaluations', 'on', 'scenes', 'where', 'cyclists', 'are', 'starting', 'or', 'turning', 'right', 'that', 'the', 'cooperation', 'leads', 'to', 'an', 'improvement', 'in', 'both', 'the', 'ability', 'to', 'keep', 'track', 'of', 'a', 'cyclist', 'and', 'the', 'accuracy', 'of', 'the', 'track', 'particularly', 'when', 'it', 'comes', 'to', 'occlusions', 'in', 'the', 'visual', 'system', 'we', 'therefore', 'contribute', 'to', 'the', 'safety', 'of', 'vulnerable', 'road', 'users', 'in', 'future', 'traffic']] | [-0.16632681011400197, 0.04506323625177624, -0.05163947238686254, -0.02513409887631476, -0.09702451127120869, -0.19769270245372997, 0.053405813096494024, 0.4034611873611222, -0.22038873891461264, -0.35143810703701683, 0.11582334995010785, -0.3429202090744766, -0.1327105636650885, 0.21895461998555515, -0.18820798760698584, 0.06085534394114393, 0.10410252352522456, 0.049869323479602885, 0.0032382827772748438, -0.23638622142018728, 0.2857713713459346, 0.06503635431441028, 0.31617736324061, 0.03916261962280096, 0.14684788375148508, 0.014004926829012844, -0.05404899476797142, 0.009223856735864022, -0.03548908692686014, 0.12909117924164604, 0.29147906088639525, 0.14967405443927378, 0.257660775141937, -0.4793034455414568, -0.1972273247881552, 0.061964848963020555, 0.11723043311130925, 0.042574563343601116, -0.04572560981156702, -0.3815011087480639, 0.09870786001981666, -0.19917365030537287, -0.08590534127314425, -0.04378473367332743, -0.03554450687062874, 0.06778925962045035, -0.28563576195587853, -0.02406097390804063, -0.03389883689121919, 0.08758464225128376, -0.06496939703462752, -0.04004791922529825, -0.004101437727758514, 0.21149301736074724, 0.049361577049536066, -0.0002723423112707024, 0.16019096125827662, -0.18016608497206374, -0.12696797032108048, 0.4149415490709329, -0.0006968291205605178, -0.19431544019607827, 0.2124734399565548, -0.06212813834126076, -0.08542344679930404, 0.10846894728268361, 0.2454479291238508, 0.11184972609926978, -0.18010804038718828, -0.02568080252411859, 0.021973799647282015, 0.1809061945787516, 0.020197877249669996, -0.004289999047001259, 0.20211670736342752, 0.24732759738147383, 0.14983442244172263, 0.07847209721692482, -0.17543851687792647, -0.09241978592616035, -0.2349229702631828, -0.12035936491270915, -0.15438993542789994, -0.03769391427839141, -0.059707758037240655, -0.07553491054535738, 0.3644462896071458, 0.2555923075205908, 0.17559733408963663, 0.052961854634314694, 0.40143072374918487, 0.03820055741045017, 0.07730512414389196, 0.06649633286144124, 0.2029030145854909, 0.002429161415686517, 0.18151272034136515, -0.17200165497171144, 0.07960898926601943, 0.0022680357548544245] |
1,803.02097 | Where is my Device? - Detecting the Smart Device's Wearing Location in
the Context of Active Safety for Vulnerable Road Users | This article describes an approach to detect the wearing location of smart
devices worn by pedestrians and cyclists. The detection, which is based solely
on the sensors of the smart devices, is important context-information which can
be used to parametrize subsequent algorithms, e.g. for dead reckoning or
intention detection to improve the safety of vulnerable road users. The wearing
location recognition can in terms of Organic Computing (OC) be seen as a step
towards self-awareness and self-adaptation. For the wearing location detection
a two-stage process is presented. It is subdivided into moving detection
followed by the wearing location classification. Finally, the approach is
evaluated on a real world dataset consisting of pedestrians and cyclists.
| cs.HC cs.AI cs.CV | this article describes an approach to detect the wearing location of smart devices worn by pedestrians and cyclists the detection which is based solely on the sensors of the smart devices is important contextinformation which can be used to parametrize subsequent algorithms eg for dead reckoning or intention detection to improve the safety of vulnerable road users the wearing location recognition can in terms of organic computing oc be seen as a step towards selfawareness and selfadaptation for the wearing location detection a twostage process is presented it is subdivided into moving detection followed by the wearing location classification finally the approach is evaluated on a real world dataset consisting of pedestrians and cyclists | [['this', 'article', 'describes', 'an', 'approach', 'to', 'detect', 'the', 'wearing', 'location', 'of', 'smart', 'devices', 'worn', 'by', 'pedestrians', 'and', 'cyclists', 'the', 'detection', 'which', 'is', 'based', 'solely', 'on', 'the', 'sensors', 'of', 'the', 'smart', 'devices', 'is', 'important', 'contextinformation', 'which', 'can', 'be', 'used', 'to', 'parametrize', 'subsequent', 'algorithms', 'eg', 'for', 'dead', 'reckoning', 'or', 'intention', 'detection', 'to', 'improve', 'the', 'safety', 'of', 'vulnerable', 'road', 'users', 'the', 'wearing', 'location', 'recognition', 'can', 'in', 'terms', 'of', 'organic', 'computing', 'oc', 'be', 'seen', 'as', 'a', 'step', 'towards', 'selfawareness', 'and', 'selfadaptation', 'for', 'the', 'wearing', 'location', 'detection', 'a', 'twostage', 'process', 'is', 'presented', 'it', 'is', 'subdivided', 'into', 'moving', 'detection', 'followed', 'by', 'the', 'wearing', 'location', 'classification', 'finally', 'the', 'approach', 'is', 'evaluated', 'on', 'a', 'real', 'world', 'dataset', 'consisting', 'of', 'pedestrians', 'and', 'cyclists']] | [-0.10719536165567733, 0.0625509573034664, -0.06950728580627623, -0.0147193352813621, -0.11004876463459723, -0.2029539478769674, 0.05022557162699306, 0.3805692410838287, -0.215076064633255, -0.3484794567874839, 0.1480663083895497, -0.30070463813989695, -0.160754946365425, 0.1967058398171567, -0.20477557137956034, 0.02473944903606862, 0.05554253549677674, 0.09428117257765437, 0.043412901683652826, -0.24050825987571636, 0.23181423916588578, 0.039571048403406035, 0.31353528191854735, 0.06807535126871239, 0.10059871269076799, 0.03120605512604579, -0.029095611966676614, -0.0038312098641871614, -0.007163516212815205, 0.11472788275697524, 0.31686864841927204, 0.15792000051835073, 0.29453408025798544, -0.42896914678271364, -0.2106116594895061, 0.0847394021260923, 0.1635115190002958, 0.04890459124617015, -0.040799851551965145, -0.4384357549633369, 0.12064149717396472, -0.19054543008549815, -0.11273003920095775, -0.020083808636836772, 0.004413428727178876, 0.0010698125120746878, -0.23018035653409902, -0.01716448299059298, 0.01629505950990504, 0.0736342440853802, -0.03608913349932414, -0.053761204570713164, 0.01888463475980458, 0.22678200205977578, 0.011039721600008733, -0.01449988971142906, 0.26258976979436666, -0.1825219434727214, -0.15105069867145698, 0.4290798135695204, 0.015551531622989877, -0.16223792908960474, 0.1958486882174404, 0.0027119126088455715, -0.0847954172476203, 0.10615718559221884, 0.26795297429229303, 0.16175604194394452, -0.17743916561892997, -0.07240950777885644, 0.011773115069300464, 0.13333475062277464, 0.07695815026702409, -0.0562659866481492, 0.25236253540929965, 0.2689197174380575, 0.09091863286294109, 0.12252257300532562, -0.16838847003893648, -0.04732171713943239, -0.22855822124469002, -0.17668815473902277, -0.1873698034797655, -0.013690333708346021, -0.03837239400618112, -0.1428943658165172, 0.39118459322118915, 0.21858972870637622, 0.16851513728548864, 0.03018268405674108, 0.3894550385596478, 0.07391427995830742, 0.10344989831864307, 0.04873334356806183, 0.1679456415555267, -0.06899989064601539, 0.1305227594581985, -0.18292757928519782, 0.17027635991045859, 0.06025529639544048] |
1,803.02098 | Orbit equivalence and classification of weak solenoids | In this work, we study minimal equicontinuous actions which are locally
quasi-analytic. The first main result shows that for minimal equicontinuous
actions which are locally quasi-analytic, continuous orbit equivalence of the
actions implies return equivalence. This generalizes results of Cortez and
Medynets, and of Li. The second main result is that if G is a
finitely-generated, virtually nilpotent group, then every minimal
equicontinuous action by G is locally quasi-analytic. As an application, we
show that the homeomorphism type of a nil-solenoid is determined by the virtual
topological full group of its monodromy action.
| math.DS | in this work we study minimal equicontinuous actions which are locally quasianalytic the first main result shows that for minimal equicontinuous actions which are locally quasianalytic continuous orbit equivalence of the actions implies return equivalence this generalizes results of cortez and medynets and of li the second main result is that if g is a finitelygenerated virtually nilpotent group then every minimal equicontinuous action by g is locally quasianalytic as an application we show that the homeomorphism type of a nilsolenoid is determined by the virtual topological full group of its monodromy action | [['in', 'this', 'work', 'we', 'study', 'minimal', 'equicontinuous', 'actions', 'which', 'are', 'locally', 'quasianalytic', 'the', 'first', 'main', 'result', 'shows', 'that', 'for', 'minimal', 'equicontinuous', 'actions', 'which', 'are', 'locally', 'quasianalytic', 'continuous', 'orbit', 'equivalence', 'of', 'the', 'actions', 'implies', 'return', 'equivalence', 'this', 'generalizes', 'results', 'of', 'cortez', 'and', 'medynets', 'and', 'of', 'li', 'the', 'second', 'main', 'result', 'is', 'that', 'if', 'g', 'is', 'a', 'finitelygenerated', 'virtually', 'nilpotent', 'group', 'then', 'every', 'minimal', 'equicontinuous', 'action', 'by', 'g', 'is', 'locally', 'quasianalytic', 'as', 'an', 'application', 'we', 'show', 'that', 'the', 'homeomorphism', 'type', 'of', 'a', 'nilsolenoid', 'is', 'determined', 'by', 'the', 'virtual', 'topological', 'full', 'group', 'of', 'its', 'monodromy', 'action']] | [-0.1938311615553887, 0.14853806909235098, -0.0716721075561667, 0.05021298698240729, -0.10460344707066922, -0.10954281105153749, 0.01780009799150993, 0.39163468420282815, -0.3028663197916973, -0.15784680607485707, 0.12672035613112434, -0.23285128127621568, -0.19667976965074954, 0.21257997062259718, -0.18984845173848874, -0.02760682217257968, 0.08360870412307912, 0.13138422945959735, -0.06860682258696255, -0.2727465714054668, 0.42460727934604103, -0.05848513364427439, 0.21183391391431264, 0.04451684657808231, 0.11628248168246659, 0.004569216717399009, -0.021423236746594066, 0.008760309555446323, -0.1085538030993516, 0.1149288859020959, 0.25724207586608827, 0.09273636883691601, 0.2566146258689949, -0.2819903711519462, -0.17642421816961598, 0.1764664108746017, 0.06218587050249841, -0.006072301480858384, -0.06504480145952624, -0.2865098657126984, 0.1861500248424304, -0.196026615889581, -0.14559152353625826, -0.06636019659471577, 0.10117958217818776, 0.0036483981378335993, -0.23019156386853074, -0.019077052595093846, 0.17964321150161003, 0.1020699464412325, -0.09783477570643932, 0.03154873413476035, -0.11557588068282475, 0.15321900850445355, 0.030892662207960435, 0.08593080597980272, 0.1117027968759193, -0.009717115793255683, -0.13788308905128835, 0.42080097106973763, -0.12305773193340587, -0.1788525769810329, 0.16900910670950037, -0.18368288818949266, -0.1862041622137084, 0.12569406240895067, 0.048838880186414586, 0.18277806211667863, -0.11948596884537002, 0.21223023221903967, -0.1550327042401161, 0.11946913335249638, 0.03725402786032013, -0.017736461939816567, 0.07511375815374777, 0.12972327564721522, 0.17399230769470983, 0.12336938905418324, 0.09827523409267483, 0.013699796607555903, -0.39349703942223085, -0.18610081692104755, -0.134252869357031, 0.12260290751557636, -0.053820936983317115, -0.1743585213350699, 0.4022373659333781, 0.09226108586375156, 0.1404216429193342, 0.15133939097564586, 0.2278438075243131, 0.06347605945041362, 0.05293925220409975, 0.10686744404871285, 0.15124848629246748, 0.15854094525212017, -0.12739795922180233, -0.19123485621410352, 0.017383449410218695, 0.24933725189539077] |
1,803.02099 | A Hybrid Method for Traffic Flow Forecasting Using Multimodal Deep
Learning | Traffic flow forecasting has been regarded as a key problem of intelligent
transport systems. In this work, we propose a hybrid multimodal deep learning
method for short-term traffic flow forecasting, which can jointly and
adaptively learn the spatial-temporal correlation features and long temporal
interdependence of multi-modality traffic data by an attention auxiliary
multimodal deep learning architecture. According to the highly nonlinear
characteristics of multi-modality traffic data, the base module of our method
consists of one-dimensional Convolutional Neural Networks (1D CNN) and Gated
Recurrent Units (GRU) with the attention mechanism. The former is to capture
the local trend features and the latter is to capture the long temporal
dependencies. Then, we design a hybrid multimodal deep learning framework
(HMDLF) for fusing share representation features of different modality traffic
data by multiple CNN-GRU-Attention modules. The experimental results indicate
that the proposed multimodal deep learning model is capable of dealing with
complex nonlinear urban traffic flow forecasting with satisfying accuracy and
effectiveness.
| cs.LG cs.SY | traffic flow forecasting has been regarded as a key problem of intelligent transport systems in this work we propose a hybrid multimodal deep learning method for shortterm traffic flow forecasting which can jointly and adaptively learn the spatialtemporal correlation features and long temporal interdependence of multimodality traffic data by an attention auxiliary multimodal deep learning architecture according to the highly nonlinear characteristics of multimodality traffic data the base module of our method consists of onedimensional convolutional neural networks 1d cnn and gated recurrent units gru with the attention mechanism the former is to capture the local trend features and the latter is to capture the long temporal dependencies then we design a hybrid multimodal deep learning framework hmdlf for fusing share representation features of different modality traffic data by multiple cnngruattention modules the experimental results indicate that the proposed multimodal deep learning model is capable of dealing with complex nonlinear urban traffic flow forecasting with satisfying accuracy and effectiveness | [['traffic', 'flow', 'forecasting', 'has', 'been', 'regarded', 'as', 'a', 'key', 'problem', 'of', 'intelligent', 'transport', 'systems', 'in', 'this', 'work', 'we', 'propose', 'a', 'hybrid', 'multimodal', 'deep', 'learning', 'method', 'for', 'shortterm', 'traffic', 'flow', 'forecasting', 'which', 'can', 'jointly', 'and', 'adaptively', 'learn', 'the', 'spatialtemporal', 'correlation', 'features', 'and', 'long', 'temporal', 'interdependence', 'of', 'multimodality', 'traffic', 'data', 'by', 'an', 'attention', 'auxiliary', 'multimodal', 'deep', 'learning', 'architecture', 'according', 'to', 'the', 'highly', 'nonlinear', 'characteristics', 'of', 'multimodality', 'traffic', 'data', 'the', 'base', 'module', 'of', 'our', 'method', 'consists', 'of', 'onedimensional', 'convolutional', 'neural', 'networks', '1d', 'cnn', 'and', 'gated', 'recurrent', 'units', 'gru', 'with', 'the', 'attention', 'mechanism', 'the', 'former', 'is', 'to', 'capture', 'the', 'local', 'trend', 'features', 'and', 'the', 'latter', 'is', 'to', 'capture', 'the', 'long', 'temporal', 'dependencies', 'then', 'we', 'design', 'a', 'hybrid', 'multimodal', 'deep', 'learning', 'framework', 'hmdlf', 'for', 'fusing', 'share', 'representation', 'features', 'of', 'different', 'modality', 'traffic', 'data', 'by', 'multiple', 'cnngruattention', 'modules', 'the', 'experimental', 'results', 'indicate', 'that', 'the', 'proposed', 'multimodal', 'deep', 'learning', 'model', 'is', 'capable', 'of', 'dealing', 'with', 'complex', 'nonlinear', 'urban', 'traffic', 'flow', 'forecasting', 'with', 'satisfying', 'accuracy', 'and', 'effectiveness']] | [-0.07009687540744236, 0.015005509251269667, -0.08569942680513783, 0.07807039424137859, -0.11583669346039462, -0.21902018763231718, -0.0298948422012032, 0.46670632313486116, -0.3314887550066279, -0.2803445650786636, 0.03752633179078223, -0.26767108788725674, -0.23818822984530288, 0.16621943811031806, -0.1433659776345275, 0.15071641228155822, 0.13627310896256736, 0.032129880141727865, -0.012703698835851755, -0.2354984456774479, 0.3151539567632565, 0.030399701415685713, 0.41662862822176167, -0.004225709531930791, 0.17502755085584726, 0.0012419429744125173, -0.04716637442007091, -0.03545188854169879, 0.010107352304675358, 0.2203740186501401, 0.3534120928324095, 0.18098272874233592, 0.35883198698662266, -0.45490445522888073, -0.359608722417645, 0.06767758918380376, 0.12595710791291514, 0.037371895503650186, -0.0067186047913281215, -0.3459696541421685, 0.08884104605093836, -0.20708401180258032, 0.011914068821129525, -0.15859919100121897, -0.025394899287160225, 0.042436495841522315, -0.31573078977715247, 0.030824787413499727, 0.08396052622538842, 0.07082608839271555, -0.07249867846109685, -0.029287695413852812, -0.016459614458155764, 0.17561129933211264, 0.03558349261241283, 0.015991171359256574, 0.11598956573956237, -0.19541885287228047, -0.1270719098848896, 0.3130975784442853, -0.05347062416588235, -0.18941652837838194, 0.17579981435541134, 0.007235419402598955, -0.15308903462615361, 0.09967883613411409, 0.28277892630048995, 0.08158776885384966, -0.19765562983674656, -0.03642340565647539, -0.06741554479212589, 0.16668647989870944, -0.008622849177699655, 0.007526745364236034, 0.20975863173675197, 0.35811181299412137, 0.03234786928222058, 0.10481522919366931, -0.20286891329440343, -0.1186100039868408, -0.16578822185405512, -0.08045849266942519, -0.1528180173604162, -0.05219481833824876, -0.13054203472475026, -0.11231929924352774, 0.46002049893615354, 0.2092488171609866, 0.2329251079562055, 0.12207521891123527, 0.36112384177791845, 0.06261864785330405, 0.1326981143978466, 0.11132899795178396, 0.11290371628288345, 0.03843130706661162, 0.22995767059178346, -0.21938900561160912, 0.11050732711561403, 0.058962719710721714] |
1,803.021 | The ORCA Hub: Explainable Offshore Robotics through Intelligent
Interfaces | We present the UK Robotics and Artificial Intelligence Hub for Offshore
Robotics for Certification of Assets (ORCA Hub), a 3.5 year EPSRC funded,
multi-site project. The ORCA Hub vision is to use teams of robots and
autonomous intelligent systems (AIS) to work on offshore energy platforms to
enable cheaper, safer and more efficient working practices. The ORCA Hub will
research, integrate, validate and deploy remote AIS solutions that can operate
with existing and future offshore energy assets and sensors, interacting safely
in autonomous or semi-autonomous modes in complex and cluttered environments,
co-operating with remote operators. The goal is that through the use of such
robotic systems offshore, the need for personnel will decrease. To enable this
to happen, the remote operator will need a high level of situation awareness
and key to this is the transparency of what the autonomous systems are doing
and why. This increased transparency will facilitate a trusting relationship,
which is particularly key in high-stakes, hazardous situations.
| cs.AI cs.HC cs.RO | we present the uk robotics and artificial intelligence hub for offshore robotics for certification of assets orca hub a 35 year epsrc funded multisite project the orca hub vision is to use teams of robots and autonomous intelligent systems ais to work on offshore energy platforms to enable cheaper safer and more efficient working practices the orca hub will research integrate validate and deploy remote ais solutions that can operate with existing and future offshore energy assets and sensors interacting safely in autonomous or semiautonomous modes in complex and cluttered environments cooperating with remote operators the goal is that through the use of such robotic systems offshore the need for personnel will decrease to enable this to happen the remote operator will need a high level of situation awareness and key to this is the transparency of what the autonomous systems are doing and why this increased transparency will facilitate a trusting relationship which is particularly key in highstakes hazardous situations | [['we', 'present', 'the', 'uk', 'robotics', 'and', 'artificial', 'intelligence', 'hub', 'for', 'offshore', 'robotics', 'for', 'certification', 'of', 'assets', 'orca', 'hub', 'a', '35', 'year', 'epsrc', 'funded', 'multisite', 'project', 'the', 'orca', 'hub', 'vision', 'is', 'to', 'use', 'teams', 'of', 'robots', 'and', 'autonomous', 'intelligent', 'systems', 'ais', 'to', 'work', 'on', 'offshore', 'energy', 'platforms', 'to', 'enable', 'cheaper', 'safer', 'and', 'more', 'efficient', 'working', 'practices', 'the', 'orca', 'hub', 'will', 'research', 'integrate', 'validate', 'and', 'deploy', 'remote', 'ais', 'solutions', 'that', 'can', 'operate', 'with', 'existing', 'and', 'future', 'offshore', 'energy', 'assets', 'and', 'sensors', 'interacting', 'safely', 'in', 'autonomous', 'or', 'semiautonomous', 'modes', 'in', 'complex', 'and', 'cluttered', 'environments', 'cooperating', 'with', 'remote', 'operators', 'the', 'goal', 'is', 'that', 'through', 'the', 'use', 'of', 'such', 'robotic', 'systems', 'offshore', 'the', 'need', 'for', 'personnel', 'will', 'decrease', 'to', 'enable', 'this', 'to', 'happen', 'the', 'remote', 'operator', 'will', 'need', 'a', 'high', 'level', 'of', 'situation', 'awareness', 'and', 'key', 'to', 'this', 'is', 'the', 'transparency', 'of', 'what', 'the', 'autonomous', 'systems', 'are', 'doing', 'and', 'why', 'this', 'increased', 'transparency', 'will', 'facilitate', 'a', 'trusting', 'relationship', 'which', 'is', 'particularly', 'key', 'in', 'highstakes', 'hazardous', 'situations']] | [-0.14604422363513353, 0.1244559963016846, -0.022995321282550045, 0.05775923611124781, -0.1310488958510437, -0.16754899142448854, 0.0659911758092851, 0.394735839839747, -0.202171452543033, -0.34772556119234016, 0.1558917932933983, -0.2972572995537765, -0.17356326812133482, 0.22223676359194175, -0.15904031971307553, 0.05681150650131221, 0.10579369290043479, 0.008700746355971657, 0.06501878146046008, -0.2347205015845157, 0.26320823385981806, 0.11351503736826864, 0.2991581286899514, 0.05363007730902722, 0.08384952593525374, 0.008389506685715285, 0.001614474489712243, -0.05485564875213996, -0.037187810868920715, 0.18460335957554533, 0.42844848464364593, 0.20586795323406873, 0.3857909266067588, -0.49949918965004986, -0.15999072100475475, 0.14500505248987064, 0.13478381315359025, 0.024517113832404014, -0.020776845673580006, -0.3531748789698117, 0.032781526280396406, -0.2455163917429051, -0.18935461297214773, -0.09125803247998361, 0.019391984991173936, 0.0387720686823899, -0.260319646939589, -0.051021360384404475, -0.046270950112167544, 0.1186742819672138, -0.04389546037310307, -0.05527731195751647, 0.009301398941518171, 0.2385742475368337, -0.017917669655882425, 0.026716836127459783, 0.23796966860232793, -0.1583125939034504, -0.1267779360941802, 0.39200568992806517, 0.04790638502317, -0.13307693385467026, 0.24935124481027449, -0.05276853137690088, -0.14707546491141182, 0.03193293471953699, 0.2742870036159752, 0.04685737389307585, -0.2055768639005443, 0.00466099678739755, 0.045950540749252027, 0.14684180136602257, 0.02714527871492984, -0.021997011226156483, 0.2184903334004816, 0.25041070803768517, 0.19185688673454968, 0.0643075895177559, -0.060679680961386664, -0.09558144991498684, -0.1901130160506271, -0.17138455212239165, -0.09405133587609028, -0.008210512320655658, -0.006400866184064754, -0.09131464353467551, 0.32350180130046996, 0.26470318908936213, 0.054352272064743204, -0.00861862687497423, 0.37322624298448887, 0.005399793528905427, 0.11615266908330392, 0.08929599787727553, 0.2210207835493482, -0.04858590325887274, 0.2500529771797961, -0.15636267765824283, 0.06746865872160665, -0.051218766006872474] |
1,803.02101 | VIPE: A new interactive classification framework for large sets of short
texts - application to opinion mining | This paper presents a new interactive opinion mining tool that helps users to
classify large sets of short texts originated from Web opinion polls, technical
forums or Twitter. From a manual multi-label pre-classification of a very
limited text subset, a learning algorithm predicts the labels of the remaining
texts of the corpus and the texts most likely associated to a selected label.
Using a fast matrix factorization, the algorithm is able to handle large
corpora and is well-adapted to interactivity by integrating the corrections
proposed by the users on the fly. Experimental results on classical datasets of
various sizes and feedbacks of users from marketing services of the
telecommunication company Orange confirm the quality of the obtained results.
| cs.IR | this paper presents a new interactive opinion mining tool that helps users to classify large sets of short texts originated from web opinion polls technical forums or twitter from a manual multilabel preclassification of a very limited text subset a learning algorithm predicts the labels of the remaining texts of the corpus and the texts most likely associated to a selected label using a fast matrix factorization the algorithm is able to handle large corpora and is welladapted to interactivity by integrating the corrections proposed by the users on the fly experimental results on classical datasets of various sizes and feedbacks of users from marketing services of the telecommunication company orange confirm the quality of the obtained results | [['this', 'paper', 'presents', 'a', 'new', 'interactive', 'opinion', 'mining', 'tool', 'that', 'helps', 'users', 'to', 'classify', 'large', 'sets', 'of', 'short', 'texts', 'originated', 'from', 'web', 'opinion', 'polls', 'technical', 'forums', 'or', 'twitter', 'from', 'a', 'manual', 'multilabel', 'preclassification', 'of', 'a', 'very', 'limited', 'text', 'subset', 'a', 'learning', 'algorithm', 'predicts', 'the', 'labels', 'of', 'the', 'remaining', 'texts', 'of', 'the', 'corpus', 'and', 'the', 'texts', 'most', 'likely', 'associated', 'to', 'a', 'selected', 'label', 'using', 'a', 'fast', 'matrix', 'factorization', 'the', 'algorithm', 'is', 'able', 'to', 'handle', 'large', 'corpora', 'and', 'is', 'welladapted', 'to', 'interactivity', 'by', 'integrating', 'the', 'corrections', 'proposed', 'by', 'the', 'users', 'on', 'the', 'fly', 'experimental', 'results', 'on', 'classical', 'datasets', 'of', 'various', 'sizes', 'and', 'feedbacks', 'of', 'users', 'from', 'marketing', 'services', 'of', 'the', 'telecommunication', 'company', 'orange', 'confirm', 'the', 'quality', 'of', 'the', 'obtained', 'results']] | [-0.06826775193523213, 0.021577199285660507, -0.05458921333034997, 0.10513018891392907, -0.17838454614709115, -0.13287101429492487, 0.12572014768375084, 0.4001394797242799, -0.25054382635931627, -0.3168345090057069, 0.07189442960533582, -0.3525775443107458, -0.1345186048459609, 0.20527522422381186, -0.13236033390433985, 0.02392772397803837, 0.1461649243177262, 0.06561280941685378, 0.04384012783727593, -0.3179459067029973, 0.3276123033241582, 0.031590185640675755, 0.33914015231401484, 0.04257331306698842, 0.09683827129271576, -0.029216319890850682, -0.13556399729726362, -0.013414444054587412, -0.057334583913978936, 0.1944166544284198, 0.3747822980818702, 0.2388335148038311, 0.34900530907759536, -0.3597608756138825, -0.13382619924811742, 0.04441572167768569, 0.13058933937898443, 0.11446139293091896, -0.04813580472472171, -0.40110552233596475, 0.10562346164547538, -0.19090088650039633, -0.004718216029548292, -0.08437231385299021, 0.0034829083695944586, 0.021360396096774897, -0.2658273285033844, 0.0013580922613520238, 0.02766018979482242, 0.09003328005941111, -0.014790936237027458, -0.0986721735623748, 0.02965335864711837, 0.2065439120554602, 0.1197792855091393, 0.018356594185037066, 0.15502307011540664, -0.1763087019020439, -0.15327829025464795, 0.41809251453032936, -0.029908627808346588, -0.14825247580449932, 0.19722251227062385, -0.037305537544159315, -0.15068881710107296, 0.13093187383344493, 0.24507224283100232, 0.09735076064717467, -0.19399250448105257, 0.008074279225893098, -0.04872322024509185, 0.23878539702460422, 0.06968390033974992, -0.05626630575716263, 0.16291040981235771, 0.21895881182656196, -0.0005877707784963867, 0.12176355350588969, -0.06683641626801484, -0.04623989627491367, -0.20089530517244553, -0.1046091035182067, -0.2234237187313137, 0.021894804793962483, -0.14160570638785552, -0.16988029742911379, 0.39786510325778845, 0.2102139842073962, 0.160956698083082, 0.09129206423047867, 0.30191860232754786, -0.05052709621692992, 0.11118073489958957, 0.08661030580968422, 0.08733987779321023, 0.0016857528727564771, 0.21781091974116862, -0.13802386646877216, 0.11575204851421511, 0.02257405288154417] |
1,803.02102 | On a degenerate singular elliptic problem | In this article we provide existence, uniqueness and regularity results of a
degenerate singular elliptic boundary value problem whose prototype is given by
\begin{gather*}
\begin{cases}
-\operatorname{div}(w(x)|\nabla u|^{p-2}\nabla
u)=\frac{f(x)}{u^\delta}\,\,\text{ in }\,\,\Omega,
u>0\text{ in }\Omega,\\ u = 0 \text{ on } \partial\Omega,
\end{cases} \end{gather*} where $\Omega$ is a bounded smooth domain in
$\mathbb{R}^N$ with $N\geq 2$, $w$ belong to the Muckenhoupt class $A_p$ for
some $1<p<\infty$, $f$ is a nonnegative function belong to some Lebesgue space
and $\delta>0$.
| math.AP | in this article we provide existence uniqueness and regularity results of a degenerate singular elliptic boundary value problem whose prototype is given by begingather begincases operatornamedivwxnabla up2nabla ufracfxudeltatext in omega u0text in omega u 0 text on partialomega endcases endgather where omega is a bounded smooth domain in mathbbrn with ngeq 2 w belong to the muckenhoupt class a_p for some 1pinfty f is a nonnegative function belong to some lebesgue space and delta0 | [['in', 'this', 'article', 'we', 'provide', 'existence', 'uniqueness', 'and', 'regularity', 'results', 'of', 'a', 'degenerate', 'singular', 'elliptic', 'boundary', 'value', 'problem', 'whose', 'prototype', 'is', 'given', 'by', 'begingather', 'begincases', 'operatornamedivwxnabla', 'up2nabla', 'ufracfxudeltatext', 'in', 'omega', 'u0text', 'in', 'omega', 'u', '0', 'text', 'on', 'partialomega', 'endcases', 'endgather', 'where', 'omega', 'is', 'a', 'bounded', 'smooth', 'domain', 'in', 'mathbbrn', 'with', 'ngeq', '2', 'w', 'belong', 'to', 'the', 'muckenhoupt', 'class', 'a_p', 'for', 'some', '1pinfty', 'f', 'is', 'a', 'nonnegative', 'function', 'belong', 'to', 'some', 'lebesgue', 'space', 'and', 'delta0']] | [-0.21502491565317744, 0.062143062868421514, 0.02431869670140764, -0.0007148731286482265, -0.15271805026956523, -0.23649598565599364, -0.05388367975926182, 0.3480538295633677, -0.3404767815954983, -0.08817554679181841, 0.15469632204298656, -0.38409145559287733, -0.027818038254433002, 0.1425902692798344, -0.14010243188951993, 0.10240689636622038, 0.04484479144836465, 0.08999331996286249, -0.04900178680610326, -0.20186351594101223, 0.43810088254718316, -0.29372341783406836, 0.11354824763515757, 0.08583246924293537, 0.06565329098116814, -0.0823350176667898, 0.1316087852206288, -0.09985633672436557, -0.3328890621164141, 0.059594291651996575, 0.29255861703616876, 0.06157432014717617, 0.385726684542735, -0.29410341053476763, -0.15500636088351408, 0.24691357640808242, 0.1354334722790453, -0.16462656868518227, -0.000937973023004209, -0.35931903169128215, 0.15967999924517548, -0.02682708453762138, -0.21623664500010717, 0.008484338167666769, 0.13606451441430384, 0.0702973948015521, -0.4277288133226749, 0.14909565596220395, 0.13644564096951703, 0.02008201579317554, -0.18272551044356078, -0.2143585191030676, -0.02778997373793067, 0.0009995868895202875, -0.02398509705866066, 0.24463556385469726, -0.03786410280736163, -0.05951696674067838, 0.0014991047404085596, 0.34786336955989505, -0.10129522034225778, -0.37878656066540217, 0.029676679437721357, -0.2481615286734369, -0.17779839855696386, 0.0773023985998912, 0.12941694049449223, 0.2064976105466485, -0.055167745954046644, 0.3126184831797016, -0.12063254961685743, 0.12305768991225502, 0.16144288862900188, 0.0008560583357595735, -0.018541937839472666, 0.12522968591009784, 0.18706554640084505, 0.08202063296468826, 0.01346684217828119, 0.04076525557320565, -0.44622580629463, -0.10250009585676405, -0.19370795513451514, 0.19988384976103488, -0.08367110142676716, -0.18992980499751866, 0.2820154849582145, 0.05689833898213692, 0.19157219021063712, 0.09765173942368063, 0.08963407537279029, 0.10258349762039466, -0.08269783073208398, 0.1042089319687673, 0.03900002407883423, 0.1298772795061167, 0.1610181903039726, -0.1637044035047034, 0.001676355210495078, 0.1691037530745234] |
1,803.02103 | Event-based Electricity Metering: An Autonomous Method to Determine
Transmission Thresholds | This paper provides an in-depth analysis of the event-based metering strategy
proposed by Simonov et al. This strategy is an alternative to the traditional
periodic (time-based) metering where the power demand is averaged in fixed time
periods (e.g. every 15 minutes). The event-based approach considers two
thresholds that trigger an event, one related to the (instantaneous) power
demanded, other to the accumulated energy consumed. The original work assumed
these thresholds fixed for the measurements. Our present contribution relaxes
this assumption by proposing a method to set the thresholds from the percentage
of the peak power consumption over the period under analysis. This approach, in
contrast to the time-based and the fixed thresholds, better captures the actual
power demanded when different households with diverse power demand profiles are
studied. In this sense, our method provides a more efficient way to store
electricity demand data while maintaining the estimation error (in relation to
the real-time power demand) under acceptable values. Numerical examples are
presented to illustrate the advantage and possible drawbacks of the proposed
method.
| cs.SY | this paper provides an indepth analysis of the eventbased metering strategy proposed by simonov et al this strategy is an alternative to the traditional periodic timebased metering where the power demand is averaged in fixed time periods eg every 15 minutes the eventbased approach considers two thresholds that trigger an event one related to the instantaneous power demanded other to the accumulated energy consumed the original work assumed these thresholds fixed for the measurements our present contribution relaxes this assumption by proposing a method to set the thresholds from the percentage of the peak power consumption over the period under analysis this approach in contrast to the timebased and the fixed thresholds better captures the actual power demanded when different households with diverse power demand profiles are studied in this sense our method provides a more efficient way to store electricity demand data while maintaining the estimation error in relation to the realtime power demand under acceptable values numerical examples are presented to illustrate the advantage and possible drawbacks of the proposed method | [['this', 'paper', 'provides', 'an', 'indepth', 'analysis', 'of', 'the', 'eventbased', 'metering', 'strategy', 'proposed', 'by', 'simonov', 'et', 'al', 'this', 'strategy', 'is', 'an', 'alternative', 'to', 'the', 'traditional', 'periodic', 'timebased', 'metering', 'where', 'the', 'power', 'demand', 'is', 'averaged', 'in', 'fixed', 'time', 'periods', 'eg', 'every', '15', 'minutes', 'the', 'eventbased', 'approach', 'considers', 'two', 'thresholds', 'that', 'trigger', 'an', 'event', 'one', 'related', 'to', 'the', 'instantaneous', 'power', 'demanded', 'other', 'to', 'the', 'accumulated', 'energy', 'consumed', 'the', 'original', 'work', 'assumed', 'these', 'thresholds', 'fixed', 'for', 'the', 'measurements', 'our', 'present', 'contribution', 'relaxes', 'this', 'assumption', 'by', 'proposing', 'a', 'method', 'to', 'set', 'the', 'thresholds', 'from', 'the', 'percentage', 'of', 'the', 'peak', 'power', 'consumption', 'over', 'the', 'period', 'under', 'analysis', 'this', 'approach', 'in', 'contrast', 'to', 'the', 'timebased', 'and', 'the', 'fixed', 'thresholds', 'better', 'captures', 'the', 'actual', 'power', 'demanded', 'when', 'different', 'households', 'with', 'diverse', 'power', 'demand', 'profiles', 'are', 'studied', 'in', 'this', 'sense', 'our', 'method', 'provides', 'a', 'more', 'efficient', 'way', 'to', 'store', 'electricity', 'demand', 'data', 'while', 'maintaining', 'the', 'estimation', 'error', 'in', 'relation', 'to', 'the', 'realtime', 'power', 'demand', 'under', 'acceptable', 'values', 'numerical', 'examples', 'are', 'presented', 'to', 'illustrate', 'the', 'advantage', 'and', 'possible', 'drawbacks', 'of', 'the', 'proposed', 'method']] | [-0.11750323428008666, 0.041666867571389654, -0.08167069758466214, 0.03726284008343957, -0.059143407960729186, -0.14166175898142977, 0.09376281585525506, 0.36463730987645904, -0.2649923503867248, -0.35057729054134706, 0.08451367010809266, -0.2761529472724177, -0.11389160762417179, 0.22747475829384575, -0.12736773827904566, 0.09894263299360045, 0.05097289913000184, 0.04091394442871127, -0.019718385518547363, -0.286629374180732, 0.2542153301721471, 0.134165217561615, 0.36687390157425337, 0.025432288409156907, 0.09653623977937127, 0.0014206928744739879, -0.0744451442822569, -0.015282160618660078, -0.10465539574934839, 0.13234721937329869, 0.27117827944619033, 0.14940317608739082, 0.3164044558555103, -0.4400650289337315, -0.20957513665847718, 0.11632176740310354, 0.08822537461358643, 0.053463061961175125, -0.05026118552241262, -0.22153901549680644, 0.11243248320752593, -0.21636992595239268, -0.11301319997197803, -0.06129008398062921, 0.012221113103038141, 0.036397345196200005, -0.31014466038070665, 0.0643686346354426, 0.04293579748707872, 0.03571432579653284, -0.059323115906855794, -0.07833868674826243, 0.007119740134729557, 0.11859735089567533, 0.05971090872152951, -0.015974803310899722, 0.13286699896450882, -0.08596077993393719, -0.10222090400871148, 0.3641493339468375, -0.011923517248555587, -0.1678232023315982, 0.14541090976156165, -0.05524493979473162, -0.10063155585533165, 0.133865831909712, 0.1632803562824006, 0.08126280529591433, -0.16431625058641994, 0.0059335513055227655, 0.013999439264523844, 0.2012583555860951, 0.03898413170592031, 0.020325146246744547, 0.16349502761089216, 0.19479417340591754, 0.11794915303690197, 0.11187678214998356, -0.1046293939159634, -0.11898163373304822, -0.2680875782967906, -0.07760936785435488, -0.15443440026070684, 0.014353061744921727, -0.07516956751384891, -0.0870926428769279, 0.4330966673102338, 0.19072936109746294, 0.1917744476046693, 0.10422456358233737, 0.39676003546502464, 0.14940946002740135, 0.03183745967859814, 0.1167721298167945, 0.19939833051105155, 0.007046066116907693, 0.1758879862996249, -0.20439311066599336, 0.07832037459660558, 0.011002392170283233] |
1,803.02104 | Effect of fluid inertia on swimming of a sphere in a viscous
incompressible fluid | Swimming of a sphere in a viscous incompressible fluid is studied on the
basis of the Navier-Stokes equations for wave-type distortions of the spherical
shape. At sizable values of the dimensionless scale number the mean swimming
velocity is the result of a delicate balance between the net time-averaged flow
generated directly by the surface distortions and the flow generated by the
mean Reynolds force density. Depending on the stroke, this can lead to a
surprising dependence of the mean swimming velocity on the kinematic viscosity
of the fluid. The net flow pattern is calculated as a function of kinematic
viscosity for axisymmetric strokes of the swimming sphere. The calculation
covers the full range of scale number, from the friction-dominated Stokes
regime in the limit of vanishing scale number to the inertia-dominated regime
at large scale number. The model therefore provides paradigmatic insight into
the fluid dynamics of swimming or flying of a wide range of organisms.
| physics.flu-dyn | swimming of a sphere in a viscous incompressible fluid is studied on the basis of the navierstokes equations for wavetype distortions of the spherical shape at sizable values of the dimensionless scale number the mean swimming velocity is the result of a delicate balance between the net timeaveraged flow generated directly by the surface distortions and the flow generated by the mean reynolds force density depending on the stroke this can lead to a surprising dependence of the mean swimming velocity on the kinematic viscosity of the fluid the net flow pattern is calculated as a function of kinematic viscosity for axisymmetric strokes of the swimming sphere the calculation covers the full range of scale number from the frictiondominated stokes regime in the limit of vanishing scale number to the inertiadominated regime at large scale number the model therefore provides paradigmatic insight into the fluid dynamics of swimming or flying of a wide range of organisms | [['swimming', 'of', 'a', 'sphere', 'in', 'a', 'viscous', 'incompressible', 'fluid', 'is', 'studied', 'on', 'the', 'basis', 'of', 'the', 'navierstokes', 'equations', 'for', 'wavetype', 'distortions', 'of', 'the', 'spherical', 'shape', 'at', 'sizable', 'values', 'of', 'the', 'dimensionless', 'scale', 'number', 'the', 'mean', 'swimming', 'velocity', 'is', 'the', 'result', 'of', 'a', 'delicate', 'balance', 'between', 'the', 'net', 'timeaveraged', 'flow', 'generated', 'directly', 'by', 'the', 'surface', 'distortions', 'and', 'the', 'flow', 'generated', 'by', 'the', 'mean', 'reynolds', 'force', 'density', 'depending', 'on', 'the', 'stroke', 'this', 'can', 'lead', 'to', 'a', 'surprising', 'dependence', 'of', 'the', 'mean', 'swimming', 'velocity', 'on', 'the', 'kinematic', 'viscosity', 'of', 'the', 'fluid', 'the', 'net', 'flow', 'pattern', 'is', 'calculated', 'as', 'a', 'function', 'of', 'kinematic', 'viscosity', 'for', 'axisymmetric', 'strokes', 'of', 'the', 'swimming', 'sphere', 'the', 'calculation', 'covers', 'the', 'full', 'range', 'of', 'scale', 'number', 'from', 'the', 'frictiondominated', 'stokes', 'regime', 'in', 'the', 'limit', 'of', 'vanishing', 'scale', 'number', 'to', 'the', 'inertiadominated', 'regime', 'at', 'large', 'scale', 'number', 'the', 'model', 'therefore', 'provides', 'paradigmatic', 'insight', 'into', 'the', 'fluid', 'dynamics', 'of', 'swimming', 'or', 'flying', 'of', 'a', 'wide', 'range', 'of', 'organisms']] | [-0.1692418235963067, 0.18193928989916083, -0.10663681961775112, 0.0008355670695145351, -0.0430354765591731, -0.045843883184716105, -0.02673413253386314, 0.252193922857539, -0.3004399840421497, -0.3329555613394731, 0.045929104182272196, -0.23350714784091672, -0.0749230423467592, 0.20793269499121472, -0.036121220196946524, 0.07185461644006025, 0.024114852723402854, 0.014561189772883574, -0.008450103474434657, -0.14650561201881665, 0.2749739861151633, 0.040737872471650824, 0.28984404211410153, 0.05319769825795307, 0.17071157475957313, -0.027316282903297972, -0.0017811962409327046, 0.09791700853309475, -0.21057352240985402, 0.05788405018840702, 0.14932029197314897, 0.0017214106927172113, 0.25438003435444373, -0.4201843476890085, -0.23222712677521393, 0.06541249184654309, 0.14804201239409545, 0.12051828532443884, 0.005724488623971597, -0.21355869048812354, 0.0278384040754575, -0.15080009876356387, -0.1450847453334763, -0.0476196992258804, 0.06344687304077432, 0.0753625700069675, -0.2530762866163292, 0.17193717388913798, 0.047671926052620016, 0.12648674881515595, -0.0870233443326866, -0.07804340913963433, -0.07778900411600868, 0.14075833496798834, 0.12147129350565732, 0.015460573121135194, 0.20383666182915944, -0.23601578286914632, 0.007907995582522394, 0.431277812183954, -0.07252998372468238, -0.2582036499172831, 0.18594686277449513, -0.1952134953238643, -0.0050248984539976865, 0.186342819129678, 0.23484439327745724, 0.11379275728578274, -0.06957426036117398, 0.036904176699746855, -0.09804758165428677, 0.15950417594882685, 0.0746461197686119, -0.06696551548054394, 0.21974624496383163, 0.18231801825981492, 0.08486772696368206, 0.11037507641893358, -0.15030154545997787, -0.11028796004113527, -0.32427946244103784, -0.12183827326561396, -0.1966322220933552, 0.06032446149784403, -0.1584547174621921, -0.1765778478524552, 0.3919357797280193, 0.08928672899062991, 0.20823787095753524, 0.07914755464746402, 0.2935176436096812, 0.0893915353621989, 0.03949263677872622, 0.0697355518439928, 0.2839683722764349, 0.13944612722097632, 0.13920581191240883, -0.2963070177774614, 0.040273209645723305, 0.11670167296557711] |
1,803.02105 | Nonlinear Photoelasticity to Explicate Acoustic Dephasing Dynamics | Detection and controlling of acoustic (AC) phonon phase have been strenuous
tasks although such capability is crucial for further manipulating thermal
properties. Here, we present a versatile formalism for tracing AC nanowaves
with arbitrary strain compositions by incorporating the nonlinear
photoelasticity (PE) into ultrafast acoustics where broad AC spectrum
encompassing thermally important THz frequency range should be collected far
beyond Brillouin frequency. The initial AC phase upon displacive carrier
generation could be inherently varied depending on the bipolar AC compositions
by implementing externally biased piezoelectric diodes. The importance of
adopting nonlinear PE is then manifested from the transient phase shift either
abrupt at the point of diffuse surface scattering or gradual during
phonon-phonon or phonon-electron scattering events based on which the ratio of
nonlinear to linear PE coefficient is experimentally extracted as a function of
the detection probe energy, reaching 0.98 slightly below the bandgap. As the
probing energy is rather set away from the bandgap, AC phase is completely
invariant with any scattering events, exhibiting the conventional trend at
Brillouin frequency in linear regime. Under potent influence of nonlinear PE,
the AC dephasing time during the propagation are quantified as a function of AC
wavepacket size and further correlated with intrinsic and extrinsic AC
scattering mechanisms in electron reservoir.
| physics.app-ph cond-mat.mes-hall | detection and controlling of acoustic ac phonon phase have been strenuous tasks although such capability is crucial for further manipulating thermal properties here we present a versatile formalism for tracing ac nanowaves with arbitrary strain compositions by incorporating the nonlinear photoelasticity pe into ultrafast acoustics where broad ac spectrum encompassing thermally important thz frequency range should be collected far beyond brillouin frequency the initial ac phase upon displacive carrier generation could be inherently varied depending on the bipolar ac compositions by implementing externally biased piezoelectric diodes the importance of adopting nonlinear pe is then manifested from the transient phase shift either abrupt at the point of diffuse surface scattering or gradual during phononphonon or phononelectron scattering events based on which the ratio of nonlinear to linear pe coefficient is experimentally extracted as a function of the detection probe energy reaching 098 slightly below the bandgap as the probing energy is rather set away from the bandgap ac phase is completely invariant with any scattering events exhibiting the conventional trend at brillouin frequency in linear regime under potent influence of nonlinear pe the ac dephasing time during the propagation are quantified as a function of ac wavepacket size and further correlated with intrinsic and extrinsic ac scattering mechanisms in electron reservoir | [['detection', 'and', 'controlling', 'of', 'acoustic', 'ac', 'phonon', 'phase', 'have', 'been', 'strenuous', 'tasks', 'although', 'such', 'capability', 'is', 'crucial', 'for', 'further', 'manipulating', 'thermal', 'properties', 'here', 'we', 'present', 'a', 'versatile', 'formalism', 'for', 'tracing', 'ac', 'nanowaves', 'with', 'arbitrary', 'strain', 'compositions', 'by', 'incorporating', 'the', 'nonlinear', 'photoelasticity', 'pe', 'into', 'ultrafast', 'acoustics', 'where', 'broad', 'ac', 'spectrum', 'encompassing', 'thermally', 'important', 'thz', 'frequency', 'range', 'should', 'be', 'collected', 'far', 'beyond', 'brillouin', 'frequency', 'the', 'initial', 'ac', 'phase', 'upon', 'displacive', 'carrier', 'generation', 'could', 'be', 'inherently', 'varied', 'depending', 'on', 'the', 'bipolar', 'ac', 'compositions', 'by', 'implementing', 'externally', 'biased', 'piezoelectric', 'diodes', 'the', 'importance', 'of', 'adopting', 'nonlinear', 'pe', 'is', 'then', 'manifested', 'from', 'the', 'transient', 'phase', 'shift', 'either', 'abrupt', 'at', 'the', 'point', 'of', 'diffuse', 'surface', 'scattering', 'or', 'gradual', 'during', 'phononphonon', 'or', 'phononelectron', 'scattering', 'events', 'based', 'on', 'which', 'the', 'ratio', 'of', 'nonlinear', 'to', 'linear', 'pe', 'coefficient', 'is', 'experimentally', 'extracted', 'as', 'a', 'function', 'of', 'the', 'detection', 'probe', 'energy', 'reaching', '098', 'slightly', 'below', 'the', 'bandgap', 'as', 'the', 'probing', 'energy', 'is', 'rather', 'set', 'away', 'from', 'the', 'bandgap', 'ac', 'phase', 'is', 'completely', 'invariant', 'with', 'any', 'scattering', 'events', 'exhibiting', 'the', 'conventional', 'trend', 'at', 'brillouin', 'frequency', 'in', 'linear', 'regime', 'under', 'potent', 'influence', 'of', 'nonlinear', 'pe', 'the', 'ac', 'dephasing', 'time', 'during', 'the', 'propagation', 'are', 'quantified', 'as', 'a', 'function', 'of', 'ac', 'wavepacket', 'size', 'and', 'further', 'correlated', 'with', 'intrinsic', 'and', 'extrinsic', 'ac', 'scattering', 'mechanisms', 'in', 'electron', 'reservoir']] | [-0.1325370625182808, 0.21978308302328062, -0.04021244756119887, -0.010642597656786157, -0.0746226725213087, -0.153362573309396, 0.08080125684765252, 0.41552175695196897, -0.3013862459630701, -0.26775515745043016, 0.05666362462703441, -0.28331588753209447, -0.12178620670668104, 0.261342157019329, 0.030698328884986883, 0.047131956230768816, -0.028285266712873854, -0.04079837929100939, -0.04229176414765097, -0.10260670296134847, 0.26605170373203296, 0.06847489183881704, 0.31832997217266396, 0.06964615346088507, 0.06537899983886397, 0.05021089385263622, 0.03760753893716769, 0.02755107289752767, -0.08063475070654919, 0.018749744029778043, 0.2891217696672065, -0.022522818384041483, 0.2144493563368061, -0.42465054940735325, -0.2703387629124893, 0.06583117629160758, 0.13970856481614974, 0.12379582847733692, -0.057045603755574104, -0.2628956849689029, 0.045017904495045044, -0.11262526359235306, -0.09309585308589255, -0.05780361226479117, 0.02275184808637608, 0.019998371097566695, -0.2481757741776277, 0.1328914721479902, 0.05572682664435553, 0.09841683856768614, -0.07539729293200197, -0.09804720020269235, -0.049647160546194634, 0.049102773392488336, 0.009663164755162386, 0.020070808453922066, 0.24578761027287024, -0.12331328875135684, -0.07057409457924763, 0.35391801010603396, -0.07743284399019616, -0.10437610255705826, 0.1492488424652412, -0.14431430887846994, -0.019989544458901196, 0.20737612892597307, 0.17062502359062362, 0.10040081379284556, -0.14788403068880804, 0.04013240200486346, 0.06527898272356847, 0.19538347423926072, 0.10813327050103881, 0.09509816994159773, 0.2518955647812278, 0.19393574498018973, 0.03831299534958729, 0.15767051972132443, -0.12914681221518898, -0.02883704020040172, -0.23129268250490526, -0.0758378186983812, -0.16823590418900938, 0.10069525247978929, -0.06789289727456406, -0.15574774818660486, 0.40465444033524317, 0.13097497782977433, 0.151111927881623, -0.015108954503967395, 0.3254745358725983, 0.20995225503815965, 0.07505033114862641, 0.011801809844511905, 0.2791020100241144, 0.12116627757433071, 0.13141413337860755, -0.2997626421458431, 0.10058242363552229, -0.013213328881251611] |
1,803.02106 | The PoGO+ Balloon-Borne Hard X-ray Polarimetry Mission | The PoGO mission, including the PoGOLite Pathfinder and PoGO+, aims to
provide polarimetric measurements of the Crab system and Cygnus X-1 in the hard
X-ray band. Measurements are conducted from a stabilized balloon-borne
platform, launched on a 1 million cubic meter balloon from the Esrange Space
Center in Sweden to an altitude of approximately 40 km. Several flights have
been conducted, resulting in two independent measurements of the Crab
polarization and one of Cygnus X-1. Here, a review of the PoGO mission is
presented, including a description of the payload and the flight campaigns, and
a discussion of some of the scientific results obtained to date.
| astro-ph.IM | the pogo mission including the pogolite pathfinder and pogo aims to provide polarimetric measurements of the crab system and cygnus x1 in the hard xray band measurements are conducted from a stabilized balloonborne platform launched on a 1 million cubic meter balloon from the esrange space center in sweden to an altitude of approximately 40 km several flights have been conducted resulting in two independent measurements of the crab polarization and one of cygnus x1 here a review of the pogo mission is presented including a description of the payload and the flight campaigns and a discussion of some of the scientific results obtained to date | [['the', 'pogo', 'mission', 'including', 'the', 'pogolite', 'pathfinder', 'and', 'pogo', 'aims', 'to', 'provide', 'polarimetric', 'measurements', 'of', 'the', 'crab', 'system', 'and', 'cygnus', 'x1', 'in', 'the', 'hard', 'xray', 'band', 'measurements', 'are', 'conducted', 'from', 'a', 'stabilized', 'balloonborne', 'platform', 'launched', 'on', 'a', '1', 'million', 'cubic', 'meter', 'balloon', 'from', 'the', 'esrange', 'space', 'center', 'in', 'sweden', 'to', 'an', 'altitude', 'of', 'approximately', '40', 'km', 'several', 'flights', 'have', 'been', 'conducted', 'resulting', 'in', 'two', 'independent', 'measurements', 'of', 'the', 'crab', 'polarization', 'and', 'one', 'of', 'cygnus', 'x1', 'here', 'a', 'review', 'of', 'the', 'pogo', 'mission', 'is', 'presented', 'including', 'a', 'description', 'of', 'the', 'payload', 'and', 'the', 'flight', 'campaigns', 'and', 'a', 'discussion', 'of', 'some', 'of', 'the', 'scientific', 'results', 'obtained', 'to', 'date']] | [-0.11237037955741573, 0.11534366934279634, -0.07661633939429555, -0.010863781400367548, -0.07251453902220951, -0.0863929989951979, 0.029807880898621283, 0.4013568840191682, -0.1782432260993376, -0.37630514795276915, 0.1909690141987565, -0.3638361032331749, -0.05150474640013615, 0.31124867871403694, -0.015623427549693382, 0.060332615506167545, 0.10119359085845919, -0.04594132869547224, -0.026981976753065608, -0.23291690844629523, 0.20729744700080152, 0.16497661296348526, 0.17579558458759115, -0.0012589918256227701, 0.16744753084022482, -0.054912256373461546, -0.051977527734740056, -0.044329323485451926, -0.1156602341699291, 0.09858439695792941, 0.23946656587199783, 0.1414152420183423, 0.2126574307539553, -0.3748348393776226, -0.17426256446238114, 0.019518788130778186, 0.03437666086269156, -0.057219758412343856, -0.00991790067461618, -0.33590072283811234, 0.02507826284821725, -0.23253048152469522, -0.16697935306001455, 0.04595440684461896, 0.007110013398078253, 0.02761379640356128, -0.17686574519524034, -0.0610184862436551, -0.03113596527046471, 0.11095873474688181, -0.15070461097419402, -0.11737690408569146, 0.013814528797805871, 0.12827642312062518, 0.03416791629213137, 0.08893098408040011, 0.09715694466711215, -0.06602657163946204, -0.141621276810941, 0.4226636033294336, -0.019384403956860724, 0.018586301332655944, 0.14951425181692993, -0.2332738120858953, -0.1674845932833499, 0.15571778549215282, 0.20583964841229455, 0.08682123073464576, -0.16007942328985147, 0.0360185525414121, -0.031130169610545603, 0.2226449478162839, 0.05013653617967272, 0.010084698992596834, 0.23107594304349063, 0.19207260439080134, 0.05618166059194098, 0.16537098250382598, -0.2718613925455841, -0.039609997632104973, -0.2913490603809719, -0.10990503828375126, -0.16475692251257879, 0.09428744719864554, -0.026949455578704935, -0.06910078431356628, 0.4013012112068882, 0.1145134649727107, 0.12659659108393034, -0.058331163389221674, 0.323568619361569, -0.03820062534475067, 0.0176022234284934, 0.046913316837986406, 0.3297562991713178, 0.09833109412201733, 0.1850679839724007, -0.16723522572461866, 0.016661996320592908, -0.037925250079254354] |
1,803.02107 | Optimal Grassmann Manifold Eavesdropping: A Huge Security Disaster for
M-1-2 Wiretap Channels | We in this paper introduce an advanced eavesdropper that aims to paralyze the
artificial-noise-aided secure communications. We consider the M-1-2 Gaussian
MISO wiretap channel, which consists of a M-antenna transmitter, a
single-antenna receiver, and a two-antenna eavesdropper. This type of
eavesdropper, by adopting an optimal Grassmann manifold (OGM) filtering
structure, can reduce the maximum achievable secrecy rate (MASR) to be zero by
using only two receive antennas, regardless of the number of antennas at the
transmitter. Specifically, the eavesdropper exploits linear filters to serially
recover the legitimate information symbols and intends to find the optimal
filter that minimizes the meansquare error (MSE) in estimating the symbols.
During the process, a convex semidefinite programming (SDP) problem with
constraints on the filter matrix can be formulated and solved. Interestingly,
the resulted optimal filters constitute a complex Grassmann manifold on the
matrix space. Based on the filters, a novel expression of MASR is derived and
further verified to be zero under the noiseless environment. Besides this, an
achievable variable region (AVR) that induces zero MASR is presented
analytically in the noisy case. Numerical results are provided to illustrate
the huge disaster in the respect of secrecy rate.
| cs.CR cs.IT math.IT | we in this paper introduce an advanced eavesdropper that aims to paralyze the artificialnoiseaided secure communications we consider the m12 gaussian miso wiretap channel which consists of a mantenna transmitter a singleantenna receiver and a twoantenna eavesdropper this type of eavesdropper by adopting an optimal grassmann manifold ogm filtering structure can reduce the maximum achievable secrecy rate masr to be zero by using only two receive antennas regardless of the number of antennas at the transmitter specifically the eavesdropper exploits linear filters to serially recover the legitimate information symbols and intends to find the optimal filter that minimizes the meansquare error mse in estimating the symbols during the process a convex semidefinite programming sdp problem with constraints on the filter matrix can be formulated and solved interestingly the resulted optimal filters constitute a complex grassmann manifold on the matrix space based on the filters a novel expression of masr is derived and further verified to be zero under the noiseless environment besides this an achievable variable region avr that induces zero masr is presented analytically in the noisy case numerical results are provided to illustrate the huge disaster in the respect of secrecy rate | [['we', 'in', 'this', 'paper', 'introduce', 'an', 'advanced', 'eavesdropper', 'that', 'aims', 'to', 'paralyze', 'the', 'artificialnoiseaided', 'secure', 'communications', 'we', 'consider', 'the', 'm12', 'gaussian', 'miso', 'wiretap', 'channel', 'which', 'consists', 'of', 'a', 'mantenna', 'transmitter', 'a', 'singleantenna', 'receiver', 'and', 'a', 'twoantenna', 'eavesdropper', 'this', 'type', 'of', 'eavesdropper', 'by', 'adopting', 'an', 'optimal', 'grassmann', 'manifold', 'ogm', 'filtering', 'structure', 'can', 'reduce', 'the', 'maximum', 'achievable', 'secrecy', 'rate', 'masr', 'to', 'be', 'zero', 'by', 'using', 'only', 'two', 'receive', 'antennas', 'regardless', 'of', 'the', 'number', 'of', 'antennas', 'at', 'the', 'transmitter', 'specifically', 'the', 'eavesdropper', 'exploits', 'linear', 'filters', 'to', 'serially', 'recover', 'the', 'legitimate', 'information', 'symbols', 'and', 'intends', 'to', 'find', 'the', 'optimal', 'filter', 'that', 'minimizes', 'the', 'meansquare', 'error', 'mse', 'in', 'estimating', 'the', 'symbols', 'during', 'the', 'process', 'a', 'convex', 'semidefinite', 'programming', 'sdp', 'problem', 'with', 'constraints', 'on', 'the', 'filter', 'matrix', 'can', 'be', 'formulated', 'and', 'solved', 'interestingly', 'the', 'resulted', 'optimal', 'filters', 'constitute', 'a', 'complex', 'grassmann', 'manifold', 'on', 'the', 'matrix', 'space', 'based', 'on', 'the', 'filters', 'a', 'novel', 'expression', 'of', 'masr', 'is', 'derived', 'and', 'further', 'verified', 'to', 'be', 'zero', 'under', 'the', 'noiseless', 'environment', 'besides', 'this', 'an', 'achievable', 'variable', 'region', 'avr', 'that', 'induces', 'zero', 'masr', 'is', 'presented', 'analytically', 'in', 'the', 'noisy', 'case', 'numerical', 'results', 'are', 'provided', 'to', 'illustrate', 'the', 'huge', 'disaster', 'in', 'the', 'respect', 'of', 'secrecy', 'rate']] | [-0.22281726676797897, 0.015420354931173035, -0.03629012063827327, 0.03556035549808229, -0.08413598979126449, -0.26905369219495, 0.09960222440308497, 0.3605068032677794, -0.28068951333959385, -0.23379223926152468, 0.126396890420025, -0.2572408749106263, -0.18828299726580375, 0.12140972327114534, -0.14658778861837735, 0.050821091091625165, 0.019324710045805556, 0.06784907413512162, -0.06742595370076404, -0.3040880876606494, 0.3027639784370117, 0.1281100430372219, 0.29531213877837836, -0.025907213040255492, 0.14911998175060587, 0.04789168164662095, -0.00935334879088878, -0.054345940659932805, -0.1122799672614456, 0.06075622737059638, 0.3381877655449045, 0.1952683774048712, 0.27277181108875836, -0.38868645641991156, -0.20451482847577787, 0.09420567116047227, 0.15519212979700936, 0.08722925273588733, -0.02949159422237666, -0.2950933693017638, 0.11724618814295139, -0.18103879291717848, -0.026163586893013305, 0.03575137548734309, -0.10590079416684114, 0.014511215487331842, -0.3870919933629621, 0.020731198225775252, 0.010335498796679924, 0.04005249870758619, -0.03403007189956849, -0.14370290308797098, 0.03638484455961926, 0.1421921419618248, 0.0059129300096680435, -0.00045378360424440394, 0.11303072360394638, -0.060484141877974795, -0.09025748087316464, 0.2811346182890102, -0.04362894968998609, -0.27011246394519645, 0.09262704567716111, -0.10026637247293112, -0.05604244468940096, 0.17392041125891672, 0.23713337216699093, 0.08206495569452413, -0.19157700356337262, 0.07112372873144551, -0.05093466161183782, 0.21610334624545938, 0.0703839957594065, 0.09651863945110403, 0.12697311105283418, 0.11004858849973408, 0.16327099792884914, 0.20829951167814723, -0.10955467428796031, -0.09745576580117467, -0.2667049940137826, -0.13684048888407954, -0.26268959370892997, 0.019254959119992695, -0.1214307352475049, -0.059515748897893836, 0.33913270483146296, 0.1361542837457256, 0.12565827895599158, 0.11250834236192737, 0.3705113992363829, 0.1347233293177176, 0.026137876893230473, 0.15276881630446032, 0.22919435563890897, 0.15284677100675084, 0.06105053053326309, -0.23144566098266503, 0.07038941089851186, 0.013986085800780463] |
1,803.02108 | HexaConv | The effectiveness of Convolutional Neural Networks stems in large part from
their ability to exploit the translation invariance that is inherent in many
learning problems. Recently, it was shown that CNNs can exploit other
invariances, such as rotation invariance, by using group convolutions instead
of planar convolutions. However, for reasons of performance and ease of
implementation, it has been necessary to limit the group convolution to
transformations that can be applied to the filters without interpolation. Thus,
for images with square pixels, only integer translations, rotations by
multiples of 90 degrees, and reflections are admissible.
Whereas the square tiling provides a 4-fold rotational symmetry, a hexagonal
tiling of the plane has a 6-fold rotational symmetry. In this paper we show how
one can efficiently implement planar convolution and group convolution over
hexagonal lattices, by re-using existing highly optimized convolution routines.
We find that, due to the reduced anisotropy of hexagonal filters, planar
HexaConv provides better accuracy than planar convolution with square filters,
given a fixed parameter budget. Furthermore, we find that the increased degree
of symmetry of the hexagonal grid increases the effectiveness of group
convolutions, by allowing for more parameter sharing. We show that our method
significantly outperforms conventional CNNs on the AID aerial scene
classification dataset, even outperforming ImageNet pre-trained models.
| cs.LG stat.ML | the effectiveness of convolutional neural networks stems in large part from their ability to exploit the translation invariance that is inherent in many learning problems recently it was shown that cnns can exploit other invariances such as rotation invariance by using group convolutions instead of planar convolutions however for reasons of performance and ease of implementation it has been necessary to limit the group convolution to transformations that can be applied to the filters without interpolation thus for images with square pixels only integer translations rotations by multiples of 90 degrees and reflections are admissible whereas the square tiling provides a 4fold rotational symmetry a hexagonal tiling of the plane has a 6fold rotational symmetry in this paper we show how one can efficiently implement planar convolution and group convolution over hexagonal lattices by reusing existing highly optimized convolution routines we find that due to the reduced anisotropy of hexagonal filters planar hexaconv provides better accuracy than planar convolution with square filters given a fixed parameter budget furthermore we find that the increased degree of symmetry of the hexagonal grid increases the effectiveness of group convolutions by allowing for more parameter sharing we show that our method significantly outperforms conventional cnns on the aid aerial scene classification dataset even outperforming imagenet pretrained models | [['the', 'effectiveness', 'of', 'convolutional', 'neural', 'networks', 'stems', 'in', 'large', 'part', 'from', 'their', 'ability', 'to', 'exploit', 'the', 'translation', 'invariance', 'that', 'is', 'inherent', 'in', 'many', 'learning', 'problems', 'recently', 'it', 'was', 'shown', 'that', 'cnns', 'can', 'exploit', 'other', 'invariances', 'such', 'as', 'rotation', 'invariance', 'by', 'using', 'group', 'convolutions', 'instead', 'of', 'planar', 'convolutions', 'however', 'for', 'reasons', 'of', 'performance', 'and', 'ease', 'of', 'implementation', 'it', 'has', 'been', 'necessary', 'to', 'limit', 'the', 'group', 'convolution', 'to', 'transformations', 'that', 'can', 'be', 'applied', 'to', 'the', 'filters', 'without', 'interpolation', 'thus', 'for', 'images', 'with', 'square', 'pixels', 'only', 'integer', 'translations', 'rotations', 'by', 'multiples', 'of', '90', 'degrees', 'and', 'reflections', 'are', 'admissible', 'whereas', 'the', 'square', 'tiling', 'provides', 'a', '4fold', 'rotational', 'symmetry', 'a', 'hexagonal', 'tiling', 'of', 'the', 'plane', 'has', 'a', '6fold', 'rotational', 'symmetry', 'in', 'this', 'paper', 'we', 'show', 'how', 'one', 'can', 'efficiently', 'implement', 'planar', 'convolution', 'and', 'group', 'convolution', 'over', 'hexagonal', 'lattices', 'by', 'reusing', 'existing', 'highly', 'optimized', 'convolution', 'routines', 'we', 'find', 'that', 'due', 'to', 'the', 'reduced', 'anisotropy', 'of', 'hexagonal', 'filters', 'planar', 'hexaconv', 'provides', 'better', 'accuracy', 'than', 'planar', 'convolution', 'with', 'square', 'filters', 'given', 'a', 'fixed', 'parameter', 'budget', 'furthermore', 'we', 'find', 'that', 'the', 'increased', 'degree', 'of', 'symmetry', 'of', 'the', 'hexagonal', 'grid', 'increases', 'the', 'effectiveness', 'of', 'group', 'convolutions', 'by', 'allowing', 'for', 'more', 'parameter', 'sharing', 'we', 'show', 'that', 'our', 'method', 'significantly', 'outperforms', 'conventional', 'cnns', 'on', 'the', 'aid', 'aerial', 'scene', 'classification', 'dataset', 'even', 'outperforming', 'imagenet', 'pretrained', 'models']] | [-0.09532200248213485, 0.07246430476090678, -0.03588673868216574, 0.019444446902028022, -0.12384653058153454, -0.13926640011255964, 0.01855030504246418, 0.47664437952609556, -0.2985836268130268, -0.3154502813528591, 0.1076433232525267, -0.24995284285044894, -0.1951797153506393, 0.18073360096248095, -0.11834071088968864, 0.07959682942051792, 0.10267194310084583, -0.003752761986106634, -0.1284837990961881, -0.28738470848886966, 0.26286582669181713, 0.042666578856472556, 0.3375917474875437, -0.007985863435951958, 0.12496865191936211, 0.0008016389998923636, 0.008743666596205483, 0.0038400577679979352, -0.04071197083393136, 0.13978545474578222, 0.2391081723987537, 0.0723694694878639, 0.22677337256137212, -0.4183264100212463, -0.2129387418456147, 0.09631863457396767, 0.17328903823651653, 0.09352165786110146, -0.02757089859390036, -0.29997351746220924, 0.10850870310227861, -0.1655007230611721, -0.08038012927973573, -0.1564900940459854, 0.004261322491384938, 0.012562491319291645, -0.2566473379419273, 0.04767323964723509, 0.10191851733872921, 0.08277038799792107, -0.0016519076450077711, -0.12172090558923851, -0.060840425649350334, 0.1257742801285788, 0.005188001983113728, 0.04918709387102182, 0.1045848168405256, -0.1489800437790658, -0.14195904817941757, 0.41785999694136233, -0.035484668066000834, -0.247796504701189, 0.1627955010055371, -0.11606795454555947, -0.13308967027732474, 0.14754168600072418, 0.18149424494542885, 0.06811908122142755, -0.09234068476713596, 0.08970983867244663, -0.06073108842631556, 0.20596445229712804, 0.1164855280636265, 0.008041960125753903, 0.1441632803619558, 0.17951227286786614, 0.10486279908136052, 0.17495871557967235, -0.1196702684084709, -0.04716469835103402, -0.2076520987979646, -0.10495471202478446, -0.212069517100902, 0.008373624387082978, -0.13237509916006326, -0.1256527518594082, 0.4088222731809782, 0.16997350300530428, 0.16516686468121577, 0.10310727794751313, 0.2786755754506953, 0.053674887621968564, 0.20528184795941068, 0.07095981921390015, 0.18705766883740238, 0.07958076818174033, 0.04583727369109116, -0.16742366830486682, 0.01937718657152903, 0.09745824339792444] |
1,803.02109 | A global stochastic maximum principle for fully coupled forward-backward
stochastic systems | We study a stochastic optimal control problem for fully coupled
forward-backward stochastic control systems with a nonempty control domain. For
our problem, the first-order and second-order variational equations are fully
coupled linear FBSDEs. Inspired by Hu (Hu, Probability, Uncertainty and
Quantitative Risk, 2(1) (2017):pp 1-20), we develop a new decoupling approach
by introducing an adjoint equation which is a quadratic BSDE. By revealing the
relations among the terms of the first-order Taylor's expansions, we estimate
the orders of them and derive a global stochastic maximum principle which
includes a completely new term. Applications to stochastic linear quadratic
control problems are investigated.
| math.OC | we study a stochastic optimal control problem for fully coupled forwardbackward stochastic control systems with a nonempty control domain for our problem the firstorder and secondorder variational equations are fully coupled linear fbsdes inspired by hu hu probability uncertainty and quantitative risk 21 2017pp 120 we develop a new decoupling approach by introducing an adjoint equation which is a quadratic bsde by revealing the relations among the terms of the firstorder taylors expansions we estimate the orders of them and derive a global stochastic maximum principle which includes a completely new term applications to stochastic linear quadratic control problems are investigated | [['we', 'study', 'a', 'stochastic', 'optimal', 'control', 'problem', 'for', 'fully', 'coupled', 'forwardbackward', 'stochastic', 'control', 'systems', 'with', 'a', 'nonempty', 'control', 'domain', 'for', 'our', 'problem', 'the', 'firstorder', 'and', 'secondorder', 'variational', 'equations', 'are', 'fully', 'coupled', 'linear', 'fbsdes', 'inspired', 'by', 'hu', 'hu', 'probability', 'uncertainty', 'and', 'quantitative', 'risk', '21', '2017pp', '120', 'we', 'develop', 'a', 'new', 'decoupling', 'approach', 'by', 'introducing', 'an', 'adjoint', 'equation', 'which', 'is', 'a', 'quadratic', 'bsde', 'by', 'revealing', 'the', 'relations', 'among', 'the', 'terms', 'of', 'the', 'firstorder', 'taylors', 'expansions', 'we', 'estimate', 'the', 'orders', 'of', 'them', 'and', 'derive', 'a', 'global', 'stochastic', 'maximum', 'principle', 'which', 'includes', 'a', 'completely', 'new', 'term', 'applications', 'to', 'stochastic', 'linear', 'quadratic', 'control', 'problems', 'are', 'investigated']] | [-0.1396426044171676, 0.04692087224349962, -0.050105870524421336, 0.08097432111972011, -0.13050115526653827, -0.15765251045115292, 0.05138524886686355, 0.2643534201011062, -0.38059679137775676, -0.27032944324426356, 0.13495787736494094, -0.25730533625930546, -0.16710999336850363, 0.17517155225854367, -0.0829090717062354, 0.12486554075963795, 0.01164207860827446, -0.027824643794447185, -0.08517751859733835, -0.23365377767011522, 0.29078596021980047, -0.04648452230729163, 0.22887641734443606, -0.024222416570410132, 0.22529656472150236, 0.023936392976902424, -0.021250152289867402, 0.059904290325939656, -0.13838451138231903, 0.1579305366310291, 0.26251855624839665, 0.0799661748483777, 0.36465713668614624, -0.3984514662064612, -0.23468829668127, 0.0807554525975138, 0.09384459838678595, 0.12468718704534694, -0.06159141915035434, -0.2920657588914037, 0.07272411042358726, -0.16256102587562055, -0.11914772500749678, -0.10592799177393317, -0.04420788211748004, 0.05511314343428239, -0.3634758387412876, 0.10681695165112615, 0.0878544631547993, 0.05174718356691301, -0.07038902658503503, -0.07469455930870027, 0.027305878846091217, 0.031174101252108812, 0.002269288976676762, 0.0018911908590234815, 0.05750798057299107, -0.07875726270955057, -0.17282374882139265, 0.3177958616241813, -0.09820307137444616, -0.26005142241716384, 0.15038400983437897, -0.0606299257883802, -0.12753626668360085, 0.11388028158340603, 0.19493012661114334, 0.20164954833686352, -0.29433365662582217, 0.1257163567171665, -0.011240405989810824, 0.16048544705845416, 0.02553623783402145, -0.022861967934295534, 0.13327942243777216, 0.15364475316833703, 0.15168211909011006, 0.14777676172554494, -0.002180261300818529, -0.2022943039238453, -0.32832149907946584, -0.10554875343572348, -0.07003428248222918, 0.011472848313860595, -0.12136585806918447, -0.14775055734906345, 0.36576054118573664, 0.10327669070102274, 0.13518384710419923, 0.12590619842056186, 0.2689314115373418, 0.2749393723683897, -0.02518765101209283, 0.0739446894126013, 0.22866082242690028, 0.20469635874731465, 0.10450056117959321, -0.2689757305430248, 0.05551305587403476, 0.15896810380741955] |
1,803.0211 | Localization control of few-photon states in parity-symmetric photonic
molecules under balanced pumping | We theoretically investigate the problem of localization control of
few-photon states in driven-dissipative parity-symmetric photonic molecules. We
show that a quantum feedback loop can utilize the information of the
spontaneously-emitted photons from each cavity to induce asymmetric photon
population in the system, while maintaining a balanced pump that respects
parity symmetry. To better understand the system's behaviour, we characterize
the degree of asymmetry as a function of the coupling between the two optical
cavities. Contrary to intuitive expectations, we find that in some regimes the
coupling can enhance the population asymmetry. We also show that these results
are robust against experimental imperfections and limitations such as detection
efficiency.
| quant-ph | we theoretically investigate the problem of localization control of fewphoton states in drivendissipative paritysymmetric photonic molecules we show that a quantum feedback loop can utilize the information of the spontaneouslyemitted photons from each cavity to induce asymmetric photon population in the system while maintaining a balanced pump that respects parity symmetry to better understand the systems behaviour we characterize the degree of asymmetry as a function of the coupling between the two optical cavities contrary to intuitive expectations we find that in some regimes the coupling can enhance the population asymmetry we also show that these results are robust against experimental imperfections and limitations such as detection efficiency | [['we', 'theoretically', 'investigate', 'the', 'problem', 'of', 'localization', 'control', 'of', 'fewphoton', 'states', 'in', 'drivendissipative', 'paritysymmetric', 'photonic', 'molecules', 'we', 'show', 'that', 'a', 'quantum', 'feedback', 'loop', 'can', 'utilize', 'the', 'information', 'of', 'the', 'spontaneouslyemitted', 'photons', 'from', 'each', 'cavity', 'to', 'induce', 'asymmetric', 'photon', 'population', 'in', 'the', 'system', 'while', 'maintaining', 'a', 'balanced', 'pump', 'that', 'respects', 'parity', 'symmetry', 'to', 'better', 'understand', 'the', 'systems', 'behaviour', 'we', 'characterize', 'the', 'degree', 'of', 'asymmetry', 'as', 'a', 'function', 'of', 'the', 'coupling', 'between', 'the', 'two', 'optical', 'cavities', 'contrary', 'to', 'intuitive', 'expectations', 'we', 'find', 'that', 'in', 'some', 'regimes', 'the', 'coupling', 'can', 'enhance', 'the', 'population', 'asymmetry', 'we', 'also', 'show', 'that', 'these', 'results', 'are', 'robust', 'against', 'experimental', 'imperfections', 'and', 'limitations', 'such', 'as', 'detection', 'efficiency']] | [-0.16308528434258895, 0.14609301914939674, -0.07353533906470462, 0.07502954293077237, -0.024200600032285552, -0.1686131664786801, 0.05955193224732947, 0.4275327851282102, -0.266124560523813, -0.2914022481260456, 0.0347511577539616, -0.2857962220637389, -0.1500197983233728, 0.18981073822643363, -0.03320488047342156, 0.04586620009982976, 0.024738826816501726, -0.019570665475346635, -0.028750305520979878, -0.1721083915696662, 0.2962020036076831, 0.03487236977872552, 0.32062840204094056, 0.08503503453587051, 0.09674496845142028, -0.027952189013257484, 0.060664451985715705, -0.0007746165050367747, -0.08483775213788368, 0.0804438419834815, 0.22503385164069933, 0.06530984012827834, 0.23115943588107546, -0.43785925047628793, -0.21625863744172258, 0.1309625283754039, 0.1657126646828359, 0.1869492308153971, -0.07579359584966693, -0.26894482760472554, 0.04053864645484452, -0.16271865908744654, -0.13595362664330926, -0.08808143699115195, -0.04156308293029248, 0.027798780678800948, -0.26241388340767857, 0.05613953659118362, 0.054270725749502674, -0.0005047280236939403, -0.017087178626837573, -0.026275759853344308, -0.04594862023716636, 0.12822388112327415, -0.020140318774452833, -0.05017169754382084, 0.15520982037485517, -0.17678636439344803, -0.17269800349669617, 0.36688385007328517, -0.07757873271339547, -0.1879136686117571, 0.19015098701744715, -0.1634626739036083, -0.09308098447204471, 0.08334504251659926, 0.18648175958100113, 0.06661136923618963, -0.08403462502522237, 0.011753640829032791, -0.039771308095377184, 0.2150994765389467, 0.04417081162002738, 0.16375231803786533, 0.205701133410368, 0.14395681312568834, 0.06424724976923839, 0.20668490347234864, -0.07647906433112014, -0.11737988652034759, -0.2840697838811674, -0.12362506348535279, -0.14393224326510715, 0.03787714400680662, -0.0688614454728314, -0.11016021648021503, 0.42074746259044266, 0.21774880522775036, 0.19501630697077332, 0.02313580075670556, 0.3224526147453863, 0.12310887307198456, 0.05015752577684193, 0.03230783600516826, 0.3234216931515926, 0.12075827076865761, 0.036703151951557045, -0.33191917684129396, 0.05642149827625846, -0.03761939035954876] |
1,803.02111 | Algorithmic bias amplifies opinion polarization: A bounded confidence
model | The flow of information reaching us via the online media platforms is
optimized not by the information content or relevance but by popularity and
proximity to the target. This is typically performed in order to maximise
platform usage. As a side effect, this introduces an algorithmic bias that is
believed to enhance polarization of the societal debate. To study this
phenomenon, we modify the well-known continuous opinion dynamics model of
bounded confidence in order to account for the algorithmic bias and investigate
its consequences. In the simplest version of the original model the pairs of
discussion participants are chosen at random and their opinions get closer to
each other if they are within a fixed tolerance level. We modify the selection
rule of the discussion partners: there is an enhanced probability to choose
individuals whose opinions are already close to each other, thus mimicking the
behavior of online media which suggest interaction with similar peers. As a
result we observe: a) an increased tendency towards polarization, which emerges
also in conditions where the original model would predict convergence, and b) a
dramatic slowing down of the speed at which the convergence at the asymptotic
state is reached, which makes the system highly unstable. Polarization is
augmented by a fragmented initial population.
| physics.soc-ph cs.MA cs.SI | the flow of information reaching us via the online media platforms is optimized not by the information content or relevance but by popularity and proximity to the target this is typically performed in order to maximise platform usage as a side effect this introduces an algorithmic bias that is believed to enhance polarization of the societal debate to study this phenomenon we modify the wellknown continuous opinion dynamics model of bounded confidence in order to account for the algorithmic bias and investigate its consequences in the simplest version of the original model the pairs of discussion participants are chosen at random and their opinions get closer to each other if they are within a fixed tolerance level we modify the selection rule of the discussion partners there is an enhanced probability to choose individuals whose opinions are already close to each other thus mimicking the behavior of online media which suggest interaction with similar peers as a result we observe a an increased tendency towards polarization which emerges also in conditions where the original model would predict convergence and b a dramatic slowing down of the speed at which the convergence at the asymptotic state is reached which makes the system highly unstable polarization is augmented by a fragmented initial population | [['the', 'flow', 'of', 'information', 'reaching', 'us', 'via', 'the', 'online', 'media', 'platforms', 'is', 'optimized', 'not', 'by', 'the', 'information', 'content', 'or', 'relevance', 'but', 'by', 'popularity', 'and', 'proximity', 'to', 'the', 'target', 'this', 'is', 'typically', 'performed', 'in', 'order', 'to', 'maximise', 'platform', 'usage', 'as', 'a', 'side', 'effect', 'this', 'introduces', 'an', 'algorithmic', 'bias', 'that', 'is', 'believed', 'to', 'enhance', 'polarization', 'of', 'the', 'societal', 'debate', 'to', 'study', 'this', 'phenomenon', 'we', 'modify', 'the', 'wellknown', 'continuous', 'opinion', 'dynamics', 'model', 'of', 'bounded', 'confidence', 'in', 'order', 'to', 'account', 'for', 'the', 'algorithmic', 'bias', 'and', 'investigate', 'its', 'consequences', 'in', 'the', 'simplest', 'version', 'of', 'the', 'original', 'model', 'the', 'pairs', 'of', 'discussion', 'participants', 'are', 'chosen', 'at', 'random', 'and', 'their', 'opinions', 'get', 'closer', 'to', 'each', 'other', 'if', 'they', 'are', 'within', 'a', 'fixed', 'tolerance', 'level', 'we', 'modify', 'the', 'selection', 'rule', 'of', 'the', 'discussion', 'partners', 'there', 'is', 'an', 'enhanced', 'probability', 'to', 'choose', 'individuals', 'whose', 'opinions', 'are', 'already', 'close', 'to', 'each', 'other', 'thus', 'mimicking', 'the', 'behavior', 'of', 'online', 'media', 'which', 'suggest', 'interaction', 'with', 'similar', 'peers', 'as', 'a', 'result', 'we', 'observe', 'a', 'an', 'increased', 'tendency', 'towards', 'polarization', 'which', 'emerges', 'also', 'in', 'conditions', 'where', 'the', 'original', 'model', 'would', 'predict', 'convergence', 'and', 'b', 'a', 'dramatic', 'slowing', 'down', 'of', 'the', 'speed', 'at', 'which', 'the', 'convergence', 'at', 'the', 'asymptotic', 'state', 'is', 'reached', 'which', 'makes', 'the', 'system', 'highly', 'unstable', 'polarization', 'is', 'augmented', 'by', 'a', 'fragmented', 'initial', 'population']] | [-0.10062090588526103, 0.10916832622582859, -0.09968654995660575, 0.08007627531115884, -0.09868121848737388, -0.14298095890228146, 0.09910355012155452, 0.38047704263038545, -0.2879154860644526, -0.30113350720612675, 0.10422127325776347, -0.2923792809053761, -0.11428435701740049, 0.12151421638320407, -0.05462677990193033, -0.01542078516963578, 0.028844390408206574, 0.09502247932711307, -0.0184159644353049, -0.2671267235920857, 0.28906239011166046, 0.09107026660561636, 0.30319463808235153, 0.060080538329478544, 0.08004752016500503, 0.0011503825138512805, -0.01347984688939147, 0.021338597103353077, -0.09850236936710291, 0.09715228219035466, 0.23320259513820066, 0.1187928844372876, 0.3487465895968379, -0.39559700780093526, -0.17190071530706333, 0.10154837995802904, 0.14815972993918364, 0.14498559078113374, -0.04102560771274451, -0.30193892784275433, 0.08679414317381494, -0.1660527534689368, -0.15502672192918676, -0.04909910371756596, 0.00942813474971854, 0.01957116938544817, -0.2659415729207062, 0.04081277067922563, 0.06349831851258857, 0.03085895139344425, -0.023352169397124863, -0.0805699948416758, -0.041027579213805954, 0.1545401704001077, 0.08126980752708453, 0.037696325679897814, 0.1512223483974741, -0.16614973517322373, -0.10134560958663293, 0.4012220950523541, -0.03568834482451627, -0.17430817039584978, 0.1977960107764185, -0.13320596690920858, -0.1004367999862703, 0.11746912098697153, 0.20454364934477126, 0.07187762580617768, -0.14763707426813613, -0.0013516289126834175, -0.010200703703087724, 0.1884985495252773, 0.036733177129700076, 0.03585221919217875, 0.21689935194072424, 0.1744777472966717, 0.08500759418550614, 0.13794163625159905, -0.016428091470593525, -0.13189302514510237, -0.24382409518882545, -0.117265493658667, -0.14403403133167156, 0.03963504776131567, -0.07833100908647746, -0.14481871211415784, 0.3842449019270203, 0.18999024066562054, 0.21489568107642268, 0.030485097029780465, 0.2772848692599031, 0.10262435778503205, 0.055366694206378526, 0.0730166129847344, 0.24352488134683098, 0.0641493554970788, 0.11106605087826249, -0.20095748802143815, 0.14496662135465485, 0.007166314532666388] |
1,803.02112 | Nonlocality-Reinforced Convolutional Neural Networks for Image Denoising | We introduce a paradigm for nonlocal sparsity reinforced deep convolutional
neural network denoising. It is a combination of a local multiscale denoising
by a convolutional neural network (CNN) based denoiser and a nonlocal denoising
based on a nonlocal filter (NLF) exploiting the mutual similarities between
groups of patches. CNN models are leveraged with noise levels that
progressively decrease at every iteration of our framework, while their output
is regularized by a nonlocal prior implicit within the NLF. Unlike complicated
neural networks that embed the nonlocality prior within the layers of the
network, our framework is modular, it uses standard pre-trained CNNs together
with standard nonlocal filters. An instance of the proposed framework, called
NN3D, is evaluated over large grayscale image datasets showing state-of-the-art
performance.
| eess.IV cs.CV | we introduce a paradigm for nonlocal sparsity reinforced deep convolutional neural network denoising it is a combination of a local multiscale denoising by a convolutional neural network cnn based denoiser and a nonlocal denoising based on a nonlocal filter nlf exploiting the mutual similarities between groups of patches cnn models are leveraged with noise levels that progressively decrease at every iteration of our framework while their output is regularized by a nonlocal prior implicit within the nlf unlike complicated neural networks that embed the nonlocality prior within the layers of the network our framework is modular it uses standard pretrained cnns together with standard nonlocal filters an instance of the proposed framework called nn3d is evaluated over large grayscale image datasets showing stateoftheart performance | [['we', 'introduce', 'a', 'paradigm', 'for', 'nonlocal', 'sparsity', 'reinforced', 'deep', 'convolutional', 'neural', 'network', 'denoising', 'it', 'is', 'a', 'combination', 'of', 'a', 'local', 'multiscale', 'denoising', 'by', 'a', 'convolutional', 'neural', 'network', 'cnn', 'based', 'denoiser', 'and', 'a', 'nonlocal', 'denoising', 'based', 'on', 'a', 'nonlocal', 'filter', 'nlf', 'exploiting', 'the', 'mutual', 'similarities', 'between', 'groups', 'of', 'patches', 'cnn', 'models', 'are', 'leveraged', 'with', 'noise', 'levels', 'that', 'progressively', 'decrease', 'at', 'every', 'iteration', 'of', 'our', 'framework', 'while', 'their', 'output', 'is', 'regularized', 'by', 'a', 'nonlocal', 'prior', 'implicit', 'within', 'the', 'nlf', 'unlike', 'complicated', 'neural', 'networks', 'that', 'embed', 'the', 'nonlocality', 'prior', 'within', 'the', 'layers', 'of', 'the', 'network', 'our', 'framework', 'is', 'modular', 'it', 'uses', 'standard', 'pretrained', 'cnns', 'together', 'with', 'standard', 'nonlocal', 'filters', 'an', 'instance', 'of', 'the', 'proposed', 'framework', 'called', 'nn3d', 'is', 'evaluated', 'over', 'large', 'grayscale', 'image', 'datasets', 'showing', 'stateoftheart', 'performance']] | [-0.030200178733538474, -0.05093265901690224, -0.09410918883721882, 0.055726999761461, -0.0818673310824102, -0.23289637560236867, -0.03591550815456766, 0.4717360901669031, -0.3076262747096579, -0.272495296011429, 0.027194410846455068, -0.25254337498312435, -0.2820489860965106, 0.11779926026739725, -0.1280955818436313, 0.10533592646290374, 0.14202578543359792, 0.025664845905531714, -0.08497193927414776, -0.28248892554718, 0.32330812879732046, 0.05808520675386014, 0.3605796026474819, -0.03768167668968681, 0.183975003720299, -0.0322604807608617, -0.04363939952771596, 0.01281263433658041, -0.004452435334418461, 0.19788077600845477, 0.2481994690401993, 0.13849017647761336, 0.3819211439146259, -0.4572131000485222, -0.3168810097542326, 0.08161696000024676, 0.09982072019464965, 0.09526218895005853, 0.004222019593519106, -0.3822384894923951, 0.09206563536441181, -0.16611693593544688, 0.09026574134273924, -0.12614551761255757, -0.06856641030919594, -0.01727946195798752, -0.331345527069416, 0.08070843616061336, 0.10290022035852468, 0.02518612523260337, -0.007004014843397175, -0.11886986502923252, -0.003484360235781083, 0.09642763171965878, -0.05200636628977349, 0.06702388183221342, 0.14146763459747141, -0.19691275887766746, -0.11723468430260787, 0.2876471051249683, -0.1036259981356864, -0.23462038802369156, 0.1494318497957798, 0.0500913714399425, -0.12967449844231813, 0.10202752538328248, 0.2010781611829364, 0.09456731185527155, -0.16828432159566478, 0.03439144740151847, -0.09630948690530973, 0.21299316605356167, 0.046600437234723714, 0.016718872296586026, 0.15564095603143116, 0.3108740745309165, 0.054371724571517815, 0.14589071604688236, -0.16185371266518023, -0.07103244868690163, -0.2303287976807574, -0.062368182541151354, -0.22665529424036907, -0.05249714994485059, -0.15715569026786663, -0.16088559817545478, 0.4421368088966947, 0.1991137110370749, 0.20892005482673404, 0.15232365947156176, 0.33624900739291697, 0.05706372190403139, 0.22160925429761108, 0.1152597666629098, 0.17086759395140216, 0.08924341088584889, 0.12179468439350556, -0.14559070931792986, 0.06333686862182539, 0.12930660603314306] |
1,803.02113 | Propagators for the time-dependent Kohn-Sham equations: multistep,
Runge-Kutta, exponential Runge-Kutta, and commutator free Magnus methods | We examine various integration schemes for the time-dependent Kohn-Sham
equations. Contrary to the time-dependent Schr\"odinger's equation, this set of
equations is non-linear, due to the dependence of the Hamiltonian on the
electronic density. We discuss some of their exact properties, and in
particular their symplectic structure. Four different families of propagators
are considered, specifically the linear multistep, Runge-Kutta, exponential
Runge-Kutta, and the commutator-free Magnus schemes. These have been chosen
because they have been largely ignored in the past for time-dependent
electronic structure calculations. The performance is analyzed in terms of
cost-versus-accuracy. The clear winner, in terms of robustness, simplicity, and
efficiency is a simplified version of a fourth-order commutator-free Magnus
integrator. However, in some specific cases, other propagators, such as some
implicit versions of the multistep methods, may be useful.
| physics.comp-ph physics.chem-ph | we examine various integration schemes for the timedependent kohnsham equations contrary to the timedependent schrodingers equation this set of equations is nonlinear due to the dependence of the hamiltonian on the electronic density we discuss some of their exact properties and in particular their symplectic structure four different families of propagators are considered specifically the linear multistep rungekutta exponential rungekutta and the commutatorfree magnus schemes these have been chosen because they have been largely ignored in the past for timedependent electronic structure calculations the performance is analyzed in terms of costversusaccuracy the clear winner in terms of robustness simplicity and efficiency is a simplified version of a fourthorder commutatorfree magnus integrator however in some specific cases other propagators such as some implicit versions of the multistep methods may be useful | [['we', 'examine', 'various', 'integration', 'schemes', 'for', 'the', 'timedependent', 'kohnsham', 'equations', 'contrary', 'to', 'the', 'timedependent', 'schrodingers', 'equation', 'this', 'set', 'of', 'equations', 'is', 'nonlinear', 'due', 'to', 'the', 'dependence', 'of', 'the', 'hamiltonian', 'on', 'the', 'electronic', 'density', 'we', 'discuss', 'some', 'of', 'their', 'exact', 'properties', 'and', 'in', 'particular', 'their', 'symplectic', 'structure', 'four', 'different', 'families', 'of', 'propagators', 'are', 'considered', 'specifically', 'the', 'linear', 'multistep', 'rungekutta', 'exponential', 'rungekutta', 'and', 'the', 'commutatorfree', 'magnus', 'schemes', 'these', 'have', 'been', 'chosen', 'because', 'they', 'have', 'been', 'largely', 'ignored', 'in', 'the', 'past', 'for', 'timedependent', 'electronic', 'structure', 'calculations', 'the', 'performance', 'is', 'analyzed', 'in', 'terms', 'of', 'costversusaccuracy', 'the', 'clear', 'winner', 'in', 'terms', 'of', 'robustness', 'simplicity', 'and', 'efficiency', 'is', 'a', 'simplified', 'version', 'of', 'a', 'fourthorder', 'commutatorfree', 'magnus', 'integrator', 'however', 'in', 'some', 'specific', 'cases', 'other', 'propagators', 'such', 'as', 'some', 'implicit', 'versions', 'of', 'the', 'multistep', 'methods', 'may', 'be', 'useful']] | [-0.13591935803983793, 0.025936549794751892, -0.10840984009379565, 0.10974957989239993, -0.080834783772512, -0.10400683089166649, -0.019023711760636677, 0.40695169854948887, -0.2614288433658432, -0.272011570401432, 0.10061164059073398, -0.23787488734580634, -0.1474533243097596, 0.1958878665834001, -0.046797543182940216, 0.1128533129190463, 0.05071188539064439, 0.01194480720676424, -0.1401310885603027, -0.2678067088488114, 0.30792656315620553, 0.03182120079376785, 0.24537177769920263, 0.04252588040332577, 0.08953856084813443, -0.05389379046120962, -0.030212059050307487, 0.014506777011267204, -0.10449357255715733, 0.06929010857806303, 0.23930204113180092, 0.038425670810361474, 0.32159175280149477, -0.4819123490078216, -0.2133306226397092, 0.07836962398051378, 0.15932908070105842, 0.16114305309200472, -0.037549457712236126, -0.26651419026329537, 0.047407753144701324, -0.20490938403044445, -0.11835543950568422, -0.16442758818842876, 0.006039300579722075, 0.09434684442063837, -0.18196870792790698, 0.08794833213278605, 0.04042067769292179, 0.03760411648765385, -0.05429724021724519, -0.1492385498226382, -0.017005908330938554, 0.08560399149811661, 0.05729773655974183, -0.07023396167196622, 0.06573170030402929, -0.1396011843205278, -0.11737693746505637, 0.41536309836475654, -0.056017213551573054, -0.2870113612694103, 0.17737761985279563, -0.08750575540818331, -0.15973669695018164, 0.10153379823738175, 0.1402205988275638, 0.15262021253953956, -0.1601739417005316, 0.1296360691483205, -0.0015479082398679714, 0.10730842134171678, 0.0823379522514378, 0.06667625669808697, 0.07927734376826548, 0.1063422806481578, 0.02037789997763845, 0.08575428887261366, -0.029512379395183492, -0.1846799127772891, -0.2750115786036549, -0.15431506726656166, -0.12834393629955865, 0.03760902209265172, -0.09983057657569419, -0.18295495558616726, 0.42374507753654966, 0.14283591728621836, 0.11686741179866038, 0.006189847516632358, 0.28965414696654607, 0.2065482021675151, 0.04545766311921468, 0.050414438642073664, 0.23970894924660083, 0.16009520568935445, 0.08193717562672935, -0.2808347292616241, 0.08639993279759028, 0.11874482972915609] |
1,803.02114 | A continuous-time persistent random walk model for flocking | Random walkers characterized by random positions and random velocities lead
to normal diffusion. A random walk was originally proposed by Einstein to model
Brownian motion and to demonstrate the existence of atoms and molecules. Such a
walker represents an inanimate particle driven by environmental fluctuations.
On the other hand, there are many examples of so-called "persistent random
walkers", including self-propelled particles that are able to move with almost
constant speed while randomly changing their direction of motion. Examples
include living entities (ranging from flagellated unicellular organisms to
complex animals such as birds and fish), as well as synthetic materials. Here
we discuss such persistent non-interacting random walkers as a model for active
particles. We also present a model that includes interactions among particles,
leading to a transition to flocking, that is, to a net flux where the majority
of the particles move in the same direction. Moreover, the model exhibits
secondary transitions that lead to clustering and more complex spatially
structured states of flocking. We analyze all these transitions in terms of
bifurcations using a number of mean field strategies (all to all interaction
and advection-reaction equations for the spatially structured states), and
compare these results with direct numerical simulations of ensembles of these
interacting active particles.
| cond-mat.stat-mech | random walkers characterized by random positions and random velocities lead to normal diffusion a random walk was originally proposed by einstein to model brownian motion and to demonstrate the existence of atoms and molecules such a walker represents an inanimate particle driven by environmental fluctuations on the other hand there are many examples of socalled persistent random walkers including selfpropelled particles that are able to move with almost constant speed while randomly changing their direction of motion examples include living entities ranging from flagellated unicellular organisms to complex animals such as birds and fish as well as synthetic materials here we discuss such persistent noninteracting random walkers as a model for active particles we also present a model that includes interactions among particles leading to a transition to flocking that is to a net flux where the majority of the particles move in the same direction moreover the model exhibits secondary transitions that lead to clustering and more complex spatially structured states of flocking we analyze all these transitions in terms of bifurcations using a number of mean field strategies all to all interaction and advectionreaction equations for the spatially structured states and compare these results with direct numerical simulations of ensembles of these interacting active particles | [['random', 'walkers', 'characterized', 'by', 'random', 'positions', 'and', 'random', 'velocities', 'lead', 'to', 'normal', 'diffusion', 'a', 'random', 'walk', 'was', 'originally', 'proposed', 'by', 'einstein', 'to', 'model', 'brownian', 'motion', 'and', 'to', 'demonstrate', 'the', 'existence', 'of', 'atoms', 'and', 'molecules', 'such', 'a', 'walker', 'represents', 'an', 'inanimate', 'particle', 'driven', 'by', 'environmental', 'fluctuations', 'on', 'the', 'other', 'hand', 'there', 'are', 'many', 'examples', 'of', 'socalled', 'persistent', 'random', 'walkers', 'including', 'selfpropelled', 'particles', 'that', 'are', 'able', 'to', 'move', 'with', 'almost', 'constant', 'speed', 'while', 'randomly', 'changing', 'their', 'direction', 'of', 'motion', 'examples', 'include', 'living', 'entities', 'ranging', 'from', 'flagellated', 'unicellular', 'organisms', 'to', 'complex', 'animals', 'such', 'as', 'birds', 'and', 'fish', 'as', 'well', 'as', 'synthetic', 'materials', 'here', 'we', 'discuss', 'such', 'persistent', 'noninteracting', 'random', 'walkers', 'as', 'a', 'model', 'for', 'active', 'particles', 'we', 'also', 'present', 'a', 'model', 'that', 'includes', 'interactions', 'among', 'particles', 'leading', 'to', 'a', 'transition', 'to', 'flocking', 'that', 'is', 'to', 'a', 'net', 'flux', 'where', 'the', 'majority', 'of', 'the', 'particles', 'move', 'in', 'the', 'same', 'direction', 'moreover', 'the', 'model', 'exhibits', 'secondary', 'transitions', 'that', 'lead', 'to', 'clustering', 'and', 'more', 'complex', 'spatially', 'structured', 'states', 'of', 'flocking', 'we', 'analyze', 'all', 'these', 'transitions', 'in', 'terms', 'of', 'bifurcations', 'using', 'a', 'number', 'of', 'mean', 'field', 'strategies', 'all', 'to', 'all', 'interaction', 'and', 'advectionreaction', 'equations', 'for', 'the', 'spatially', 'structured', 'states', 'and', 'compare', 'these', 'results', 'with', 'direct', 'numerical', 'simulations', 'of', 'ensembles', 'of', 'these', 'interacting', 'active', 'particles']] | [-0.10676190666157015, 0.2600907791020818, -0.03635339251216636, 0.026015105712956385, -0.03323693520160041, -0.1657389694676343, 0.03234097115686478, 0.3913271295262168, -0.24601551491299256, -0.3106725586101341, 0.04316593864415255, -0.3042494172234862, -0.18694373646949008, 0.1447823163518988, -0.03329734585657356, 0.023865716466635177, 0.024482683219568993, 0.023358287010791796, 0.054386685230625245, -0.20482878945374206, 0.26460285148929785, 0.019623408588954217, 0.23230349756822277, -0.030999927032977378, 0.15336545873298377, -0.005409842036475522, 0.0018639231875655804, 0.0699568156980806, -0.09844243468040181, 0.07819380170433976, 0.18584950926633786, 0.04495123267884631, 0.23224467643793079, -0.45442895947816075, -0.24309714695051815, 0.14524092553700838, 0.17909365614588205, 0.15782492966188685, -0.06350900255842978, -0.3245740724988462, 0.02746915024511768, -0.13563457086169417, -0.16393683599938014, -0.08925017521037283, 0.040501772154433034, 0.12943831109863613, -0.24588289773676564, 0.09027363392645335, 0.04648084157306233, 0.05556482975123729, -0.06472956435304981, -0.08735359815322763, -0.03311285959750162, 0.169641837417508, 0.06336582344529278, -0.024230038144306285, 0.19252071477928884, -0.14742843896951435, -0.1747273114500882, 0.4232912018067307, -0.05187968913902155, -0.22017443441034515, 0.28416247225191066, -0.12314156170232572, -0.10897636132602746, 0.1440828937423024, 0.20507003275614574, 0.09919955709849029, -0.1542829830955336, -0.00612167819208524, -0.05548494277355499, 0.10818519944028146, 0.051235717047536794, 2.8197991027348284e-05, 0.20866070350560084, 0.13496955648595513, 0.07883896868746809, 0.1244616427968913, -0.08530464273391535, -0.18274114752674234, -0.2331397457426225, -0.14292659469011829, -0.18119490820777284, 0.04724269856559338, -0.10415845436423933, -0.20196529889506273, 0.3846531626161026, 0.1648070284712088, 0.22646628745217418, 0.07346252843868077, 0.24171398439251138, 0.04066645411396588, 0.014063592008112566, 0.06483682468398541, 0.19989683777363837, 0.12760288498571348, 0.08635211597840135, -0.17626305890116606, 0.056152969409806144, 0.03853794712357331] |
1,803.02115 | Subradiant states of quantum bits coupled to a one-dimensional waveguide | The properties of coupled emitters can differ dramatically from those of
their individual constituents. Canonical examples include sub- and
super-radiance, wherein the decay rate of a collective excitation is reduced or
enhanced due to correlated interactions with the environment. Here, we
systematically study the properties of collective excitations for regularly
spaced arrays of quantum emitters coupled to a one-dimensional (1D) waveguide.
We find that, for low excitation numbers, the modal properties are
well-characterized by spin waves with a definite wavevector. Moreover, the
decay rate of the most subradiant modes obeys a universal scaling with a cubic
suppression in the number of emitters. Multi-excitation subradiant eigenstates
can be built from fermionic combinations of single excitation eigenstates; such
"fermionization" results in multiple excitations that spatially repel one
another. We put forward a method to efficiently create and measure such
subradiant states, which can be realized with superconducting qubits. These
measurement protocols probe both real-space correlations (using on-site
dispersive readout) and temporal correlations in the emitted field (using
photon correlation techniques).
| quant-ph | the properties of coupled emitters can differ dramatically from those of their individual constituents canonical examples include sub and superradiance wherein the decay rate of a collective excitation is reduced or enhanced due to correlated interactions with the environment here we systematically study the properties of collective excitations for regularly spaced arrays of quantum emitters coupled to a onedimensional 1d waveguide we find that for low excitation numbers the modal properties are wellcharacterized by spin waves with a definite wavevector moreover the decay rate of the most subradiant modes obeys a universal scaling with a cubic suppression in the number of emitters multiexcitation subradiant eigenstates can be built from fermionic combinations of single excitation eigenstates such fermionization results in multiple excitations that spatially repel one another we put forward a method to efficiently create and measure such subradiant states which can be realized with superconducting qubits these measurement protocols probe both realspace correlations using onsite dispersive readout and temporal correlations in the emitted field using photon correlation techniques | [['the', 'properties', 'of', 'coupled', 'emitters', 'can', 'differ', 'dramatically', 'from', 'those', 'of', 'their', 'individual', 'constituents', 'canonical', 'examples', 'include', 'sub', 'and', 'superradiance', 'wherein', 'the', 'decay', 'rate', 'of', 'a', 'collective', 'excitation', 'is', 'reduced', 'or', 'enhanced', 'due', 'to', 'correlated', 'interactions', 'with', 'the', 'environment', 'here', 'we', 'systematically', 'study', 'the', 'properties', 'of', 'collective', 'excitations', 'for', 'regularly', 'spaced', 'arrays', 'of', 'quantum', 'emitters', 'coupled', 'to', 'a', 'onedimensional', '1d', 'waveguide', 'we', 'find', 'that', 'for', 'low', 'excitation', 'numbers', 'the', 'modal', 'properties', 'are', 'wellcharacterized', 'by', 'spin', 'waves', 'with', 'a', 'definite', 'wavevector', 'moreover', 'the', 'decay', 'rate', 'of', 'the', 'most', 'subradiant', 'modes', 'obeys', 'a', 'universal', 'scaling', 'with', 'a', 'cubic', 'suppression', 'in', 'the', 'number', 'of', 'emitters', 'multiexcitation', 'subradiant', 'eigenstates', 'can', 'be', 'built', 'from', 'fermionic', 'combinations', 'of', 'single', 'excitation', 'eigenstates', 'such', 'fermionization', 'results', 'in', 'multiple', 'excitations', 'that', 'spatially', 'repel', 'one', 'another', 'we', 'put', 'forward', 'a', 'method', 'to', 'efficiently', 'create', 'and', 'measure', 'such', 'subradiant', 'states', 'which', 'can', 'be', 'realized', 'with', 'superconducting', 'qubits', 'these', 'measurement', 'protocols', 'probe', 'both', 'realspace', 'correlations', 'using', 'onsite', 'dispersive', 'readout', 'and', 'temporal', 'correlations', 'in', 'the', 'emitted', 'field', 'using', 'photon', 'correlation', 'techniques']] | [-0.15229334930578867, 0.2707534293793807, -0.07081287720280843, 0.05866963919609026, -0.013558010876988106, -0.20754511868913791, 0.03156907483796766, 0.39836945964045645, -0.2605185918267428, -0.2628848842855188, -0.004591389591777919, -0.33327025059718707, -0.07765622413734534, 0.18391774113600454, 0.08807634039770901, 0.04420406888467759, 0.029539343453333936, -0.02429139604092121, -0.05406203922272349, -0.16285436069093912, 0.29484661276607466, 0.038600303395512695, 0.30995634702932356, 0.003499745288059958, 0.061252264329509455, 0.0144021885920492, 0.05098409942556394, -0.007238069947648217, -0.08438621336426877, 0.08288540290162755, 0.2506825150332935, 0.030423222776291715, 0.19817104725240955, -0.4497027074851628, -0.18171423838828646, 0.08467368556219819, 0.22054087497305036, 0.17171288325473488, -0.040986680772177694, -0.31895627152906464, -0.02834055338401716, -0.15921623706041524, -0.13874959274627535, -0.09234227661398195, -0.027816253414216806, 0.0679006346299069, -0.24804293410713962, 0.09200494105572857, 0.03321008257002437, 0.017976203320791855, -0.009819191561421445, -0.027197299232024567, -0.042106046521526184, 0.07341626612746734, -0.017170280014397576, -0.05687050680613278, 0.16935011707357175, -0.12085787607273753, -0.14258543977346216, 0.3253200970246412, -0.08055304915511183, -0.19849149881684708, 0.21747189782105297, -0.16692686728146372, -0.0913298321670265, 0.1692344852315381, 0.16028748139658655, 0.09908268405983801, -0.12736393927618683, 0.021831276159078004, 0.006631846475924942, 0.2242749058625902, 0.06815159155078054, 0.19500554840695777, 0.25236729648341205, 0.1322145225491286, 0.0026514566332999884, 0.1673550434560249, -0.08741309699447204, -0.08311496149205293, -0.23970261973729412, -0.12053926487957749, -0.2169242943637073, 0.07762111731738384, -0.04970211137359521, -0.16135601804126054, 0.428678367602905, 0.11049926845658947, 0.1722547999594272, 0.009863912432116368, 0.2395033517109585, 0.16572485248269958, 0.09540669918212752, 0.02694097290458601, 0.2711457447128071, 0.1825392743298185, 0.038434855303161646, -0.293067300727541, -0.011434001659619667, -0.006786719599317405] |
1,803.02116 | Quasi-invariance of completely random measure | Let $X$ be a locally compact Polish space. Let $\mathbb K(X)$ denote the
space of discrete Radon measures on $X$. Let $\mu$ be a completely random
discrete measure on $X$, i.e., $\mu$ is (the distribution of) a completely
random measure on $X$ that is concentrated on $\mathbb K(X)$. We consider the
multiplicative (current) group $C_0(X\to\mathbb R_+)$ consisting of functions
on $X$ that take values in $\mathbb R_+=(0,\infty)$ and are equal to 1 outside
a compact set. Each element $\theta\in C_0(X\to\mathbb R_+)$ maps $\mathbb
K(X)$ onto itself; more precisely, $\theta$ sends a discrete Radon measure
$\sum_i s_i\delta_{x_i}$ to $\sum_i \theta(s_i)s_i\delta_{x_i}$. Thus, elements
of $C_0(X\to\mathbb R_+)$ transform the weights of discrete Radon measures. We
study conditions under which the measure $\mu$ is quasi-invariant under the
action of the current group $C_0(X\to\mathbb R_+)$ and consider several classes
of examples. We further assume that $X=\mathbb R^d$ and consider the group of
local diffeomorphisms $\operatorname{Diff}_0(X)$. Elements of this group also
map $\mathbb K(X)$ onto itself. More precisely, a diffeomorphism $\varphi\in
\operatorname{Diff}_0(X)$ sends a discrete Radon measure $\sum_i
s_i\delta_{x_i}$ to $\sum_i s_i\delta_{\varphi(x_i)}$. Thus, diffeomorphisms
from $\operatorname{Diff}_0(X)$ transform the atoms of discrete Radon measures.
We study quasi-invariance of $\mu$ under the action of
$\operatorname{Diff}_0(X)$. We finally consider the semidirect product
$\mathfrak G:=\operatorname{Diff}_0(X)\times C_0(X\to \mathbb R_+)$ and study
conditions of quasi-invariance and partial quasi-invariance of $\mu$ under the
action of $\mathfrak G$.
| math.PR | let x be a locally compact polish space let mathbb kx denote the space of discrete radon measures on x let mu be a completely random discrete measure on x ie mu is the distribution of a completely random measure on x that is concentrated on mathbb kx we consider the multiplicative current group c_0xtomathbb r_ consisting of functions on x that take values in mathbb r_0infty and are equal to 1 outside a compact set each element thetain c_0xtomathbb r_ maps mathbb kx onto itself more precisely theta sends a discrete radon measure sum_i s_idelta_x_i to sum_i thetas_is_idelta_x_i thus elements of c_0xtomathbb r_ transform the weights of discrete radon measures we study conditions under which the measure mu is quasiinvariant under the action of the current group c_0xtomathbb r_ and consider several classes of examples we further assume that xmathbb rd and consider the group of local diffeomorphisms operatornamediff_0x elements of this group also map mathbb kx onto itself more precisely a diffeomorphism varphiin operatornamediff_0x sends a discrete radon measure sum_i s_idelta_x_i to sum_i s_idelta_varphix_i thus diffeomorphisms from operatornamediff_0x transform the atoms of discrete radon measures we study quasiinvariance of mu under the action of operatornamediff_0x we finally consider the semidirect product mathfrak goperatornamediff_0xtimes c_0xto mathbb r_ and study conditions of quasiinvariance and partial quasiinvariance of mu under the action of mathfrak g | [['let', 'x', 'be', 'a', 'locally', 'compact', 'polish', 'space', 'let', 'mathbb', 'kx', 'denote', 'the', 'space', 'of', 'discrete', 'radon', 'measures', 'on', 'x', 'let', 'mu', 'be', 'a', 'completely', 'random', 'discrete', 'measure', 'on', 'x', 'ie', 'mu', 'is', 'the', 'distribution', 'of', 'a', 'completely', 'random', 'measure', 'on', 'x', 'that', 'is', 'concentrated', 'on', 'mathbb', 'kx', 'we', 'consider', 'the', 'multiplicative', 'current', 'group', 'c_0xtomathbb', 'r_', 'consisting', 'of', 'functions', 'on', 'x', 'that', 'take', 'values', 'in', 'mathbb', 'r_0infty', 'and', 'are', 'equal', 'to', '1', 'outside', 'a', 'compact', 'set', 'each', 'element', 'thetain', 'c_0xtomathbb', 'r_', 'maps', 'mathbb', 'kx', 'onto', 'itself', 'more', 'precisely', 'theta', 'sends', 'a', 'discrete', 'radon', 'measure', 'sum_i', 's_idelta_x_i', 'to', 'sum_i', 'thetas_is_idelta_x_i', 'thus', 'elements', 'of', 'c_0xtomathbb', 'r_', 'transform', 'the', 'weights', 'of', 'discrete', 'radon', 'measures', 'we', 'study', 'conditions', 'under', 'which', 'the', 'measure', 'mu', 'is', 'quasiinvariant', 'under', 'the', 'action', 'of', 'the', 'current', 'group', 'c_0xtomathbb', 'r_', 'and', 'consider', 'several', 'classes', 'of', 'examples', 'we', 'further', 'assume', 'that', 'xmathbb', 'rd', 'and', 'consider', 'the', 'group', 'of', 'local', 'diffeomorphisms', 'operatornamediff_0x', 'elements', 'of', 'this', 'group', 'also', 'map', 'mathbb', 'kx', 'onto', 'itself', 'more', 'precisely', 'a', 'diffeomorphism', 'varphiin', 'operatornamediff_0x', 'sends', 'a', 'discrete', 'radon', 'measure', 'sum_i', 's_idelta_x_i', 'to', 'sum_i', 's_idelta_varphix_i', 'thus', 'diffeomorphisms', 'from', 'operatornamediff_0x', 'transform', 'the', 'atoms', 'of', 'discrete', 'radon', 'measures', 'we', 'study', 'quasiinvariance', 'of', 'mu', 'under', 'the', 'action', 'of', 'operatornamediff_0x', 'we', 'finally', 'consider', 'the', 'semidirect', 'product', 'mathfrak', 'goperatornamediff_0xtimes', 'c_0xto', 'mathbb', 'r_', 'and', 'study', 'conditions', 'of', 'quasiinvariance', 'and', 'partial', 'quasiinvariance', 'of', 'mu', 'under', 'the', 'action', 'of', 'mathfrak', 'g']] | [-0.17092616610771574, 0.1173175062488662, -0.06398955836823773, -0.007045762710606492, -0.03316172418492171, -0.11935000784840401, 0.020986503674734144, 0.37448893699350705, -0.3223696474173884, -0.06530667402260347, 0.10862005092449264, -0.32759052310288467, -0.06408478435846644, 0.17458360763950223, -0.14949323300436704, -0.021908948098033253, -0.021442897969198953, 0.1368719953488251, -0.1483642518906982, -0.2088883319045118, 0.3774076919797637, -0.08096191684988865, 0.21749434811533044, -0.022645072156025115, 0.1496638800304569, -0.02809353326789078, -0.02447843272452576, -0.04134382335965761, -0.20094405081485042, 0.047252703552057435, 0.18401649776085732, 0.12076524749116271, 0.25168833652630856, -0.3469968082878841, -0.18777833831146223, 0.28079558181824216, 0.07382667929985039, -0.1987234758551728, -0.023733186210989483, -0.3607928286832031, 0.12527438449254685, -0.11873701866075329, -0.11818476779538062, -0.054058309768352214, 0.13658355427863195, 0.030261633389014237, -0.3771934378849462, 0.003286202791560262, 0.09091261786690683, 0.06205834318999064, -0.07351991186268764, -0.12747992861721186, -0.07528001187826344, 0.0761746231299919, -0.019860959181416813, 0.15730244667726406, 0.1665441880468279, 0.05199631779142783, -0.02724636918566096, 0.4183027215105473, -0.12020943894071308, -0.3214901071479715, 0.09784330644670429, -0.2553716704821846, -0.1649274530205363, 0.09771131760539026, 0.1699351875534401, 0.1699037208187676, -0.10320147070948274, 0.26553308715218243, -0.142709863649835, 0.10625418082735108, 0.05265526966845463, 0.03684348341103199, 0.11440738229029769, 0.0552115756537714, 0.164538133689715, 0.12190919149338071, -0.026593720478458552, 0.0271611957946459, -0.38256500984345554, -0.18786130017716302, -0.15092418858153456, 0.22507814128900272, -0.0888952525381833, -0.13480411421661392, 0.340240424649508, 0.061831545302593105, 0.1758996562353002, 0.11682470514569346, 0.1817696184312942, 0.10466576087452234, -0.0034589728958896197, 0.03455523328231904, -0.04348317160241203, 0.17716661283912974, -0.06516678396605997, -0.14953321222228708, -0.023863457346232523, 0.1703592436772626] |
1,803.02117 | Equality case in van der Corput's inequality and collisions in multiple
lattice tilings | Van der Corput's provides the sharp bound vol(C) \le m 2^d on the volume of a
d-dimensional origin-symmetric convex body C that has 2m-1 points of the
integer lattice in its interior. For m=1, a characterization of the equality
case vol(C)= m 2^d is equivalent to the well-known problem of characterizing
tilings by translations of a convex body. It is rather surprising that so far,
for m \ge 2, no characterization of the equality case has been available,
though a hint to the respective characterization problem can be found in the
1987 monograph of Gruber and Lekkerkerker. We give an explicit characterization
of the equality case for all m \ge 2. Our result reveals that, the equality
case for m \ge 2 is more restrictive than for $m=1$. We also present
consequences of our characterization in the context of multiple lattice
tilings.
| math.CO math.MG | van der corputs provides the sharp bound volc le m 2d on the volume of a ddimensional originsymmetric convex body c that has 2m1 points of the integer lattice in its interior for m1 a characterization of the equality case volc m 2d is equivalent to the wellknown problem of characterizing tilings by translations of a convex body it is rather surprising that so far for m ge 2 no characterization of the equality case has been available though a hint to the respective characterization problem can be found in the 1987 monograph of gruber and lekkerkerker we give an explicit characterization of the equality case for all m ge 2 our result reveals that the equality case for m ge 2 is more restrictive than for m1 we also present consequences of our characterization in the context of multiple lattice tilings | [['van', 'der', 'corputs', 'provides', 'the', 'sharp', 'bound', 'volc', 'le', 'm', '2d', 'on', 'the', 'volume', 'of', 'a', 'ddimensional', 'originsymmetric', 'convex', 'body', 'c', 'that', 'has', '2m1', 'points', 'of', 'the', 'integer', 'lattice', 'in', 'its', 'interior', 'for', 'm1', 'a', 'characterization', 'of', 'the', 'equality', 'case', 'volc', 'm', '2d', 'is', 'equivalent', 'to', 'the', 'wellknown', 'problem', 'of', 'characterizing', 'tilings', 'by', 'translations', 'of', 'a', 'convex', 'body', 'it', 'is', 'rather', 'surprising', 'that', 'so', 'far', 'for', 'm', 'ge', '2', 'no', 'characterization', 'of', 'the', 'equality', 'case', 'has', 'been', 'available', 'though', 'a', 'hint', 'to', 'the', 'respective', 'characterization', 'problem', 'can', 'be', 'found', 'in', 'the', '1987', 'monograph', 'of', 'gruber', 'and', 'lekkerkerker', 'we', 'give', 'an', 'explicit', 'characterization', 'of', 'the', 'equality', 'case', 'for', 'all', 'm', 'ge', '2', 'our', 'result', 'reveals', 'that', 'the', 'equality', 'case', 'for', 'm', 'ge', '2', 'is', 'more', 'restrictive', 'than', 'for', 'm1', 'we', 'also', 'present', 'consequences', 'of', 'our', 'characterization', 'in', 'the', 'context', 'of', 'multiple', 'lattice', 'tilings']] | [-0.15276057579190613, 0.07904326786300656, -0.038468759554490764, 0.04972812126006957, -0.05092941050607921, -0.15263605363417784, 0.03414780940224325, 0.3102249335136894, -0.20484910979473464, -0.28536448391928326, 0.11283297183625006, -0.30917674211562207, -0.15262962678696593, 0.21835834825326178, -0.07107034275098376, 0.012798270754578431, 0.02501065422728343, 0.03674122411101847, -0.07530770008124306, -0.276532220142618, 0.2897774906219049, -0.011548715982992779, 0.17922861985435945, 0.0723709180118175, 0.048258313814073174, 0.057993239034491946, 0.027283092495054007, 0.03669011129171286, -0.2282290288146637, 0.12157158517363993, 0.22876912172437763, 0.13058284396948425, 0.23486303019298005, -0.3675398594293166, -0.17418773974862578, 0.13281324669607247, 0.12588528034762597, 0.04838838556807645, -0.039960477664811755, -0.2023025743965007, 0.13228570664970493, -0.09920178003392746, -0.13376003096345812, -0.022302015150428265, 0.12656436204372473, -0.0330306891692986, -0.2778798091179416, 0.0662078173799542, 0.19925160952646967, 0.07982440660445309, -0.0648446682730729, -0.18287936398844745, -0.012470479959517087, 0.09848602876906663, -0.023829825404493635, 0.04830320996419251, 0.017468434582221727, -0.05321891228078117, -0.07679225797568198, 0.37471403406185266, -0.01564682463340176, -0.19015249036970666, 0.1883933056903426, -0.18278806724808586, -0.14244954042385896, 0.1251769465112298, 0.09267723764961874, 0.15761043276624676, -0.10037981036027342, 0.18170892139265485, -0.1289508420790375, 0.14188156274973718, 0.13456013876105277, 0.0019938119869141405, 0.14637181182509998, 0.13289184581396551, 0.13884262317212784, 0.1748556262820887, -0.021723716427952473, -0.013960907688285683, -0.297013892793395, -0.19951847836934358, -0.23537340545190602, 0.10426971463578373, -0.10774293738328376, -0.14331673282119906, 0.3036002235242795, 0.042408873569744994, 0.15520473100035123, 0.08097932894687943, 0.21493741821228776, 0.05714509463508312, 0.00044300990969493566, 0.06460954744408143, 0.21543657008729036, 0.13839032076148342, 0.034966738914257625, -0.14772974615457507, 0.01815226634072376, 0.11578464482478062] |
1,803.02118 | Neural Network Operations and Susuki-Trotter evolution of Neural Network
States | It was recently proposed to leverage the representational power of artificial
neural networks, in particular Restricted Boltzmann Machines, in order to model
complex quantum states of many-body systems [Science, 355(6325), 2017]. States
represented in this way, called Neural Network States (NNSs), were shown to
display interesting properties like the ability to efficiently capture
long-range quantum correlations. However, identifying an optimal neural network
representation of a given state might be challenging, and so far this problem
has been addressed with stochastic optimization techniques. In this work we
explore a different direction. We study how the action of elementary quantum
operations modifies NNSs. We parametrize a family of many body quantum
operations that can be directly applied to states represented by Unrestricted
Boltzmann Machines, by just adding hidden nodes and updating the network
parameters. We show that this parametrization contains a set of universal
quantum gates, from which it follows that the state prepared by any quantum
circuit can be expressed as a Neural Network State with a number of hidden
nodes that grows linearly with the number of elementary operations in the
circuit. This is a powerful representation theorem (which was recently obtained
with different methods) but that is not directly useful, since there is no
general and efficient way to extract information from this unrestricted
description of quantum states. To circumvent this problem, we propose a
step-wise procedure based on the projection of Unrestricted quantum states to
Restricted quantum states. In turn, two approximate methods to perform this
projection are discussed. In this way, we show that it is in principle possible
to approximately optimize or evolve Neural Network States without relying on
stochastic methods such as Variational Monte Carlo, which are computationally
expensive.
| quant-ph | it was recently proposed to leverage the representational power of artificial neural networks in particular restricted boltzmann machines in order to model complex quantum states of manybody systems science 3556325 2017 states represented in this way called neural network states nnss were shown to display interesting properties like the ability to efficiently capture longrange quantum correlations however identifying an optimal neural network representation of a given state might be challenging and so far this problem has been addressed with stochastic optimization techniques in this work we explore a different direction we study how the action of elementary quantum operations modifies nnss we parametrize a family of many body quantum operations that can be directly applied to states represented by unrestricted boltzmann machines by just adding hidden nodes and updating the network parameters we show that this parametrization contains a set of universal quantum gates from which it follows that the state prepared by any quantum circuit can be expressed as a neural network state with a number of hidden nodes that grows linearly with the number of elementary operations in the circuit this is a powerful representation theorem which was recently obtained with different methods but that is not directly useful since there is no general and efficient way to extract information from this unrestricted description of quantum states to circumvent this problem we propose a stepwise procedure based on the projection of unrestricted quantum states to restricted quantum states in turn two approximate methods to perform this projection are discussed in this way we show that it is in principle possible to approximately optimize or evolve neural network states without relying on stochastic methods such as variational monte carlo which are computationally expensive | [['it', 'was', 'recently', 'proposed', 'to', 'leverage', 'the', 'representational', 'power', 'of', 'artificial', 'neural', 'networks', 'in', 'particular', 'restricted', 'boltzmann', 'machines', 'in', 'order', 'to', 'model', 'complex', 'quantum', 'states', 'of', 'manybody', 'systems', 'science', '3556325', '2017', 'states', 'represented', 'in', 'this', 'way', 'called', 'neural', 'network', 'states', 'nnss', 'were', 'shown', 'to', 'display', 'interesting', 'properties', 'like', 'the', 'ability', 'to', 'efficiently', 'capture', 'longrange', 'quantum', 'correlations', 'however', 'identifying', 'an', 'optimal', 'neural', 'network', 'representation', 'of', 'a', 'given', 'state', 'might', 'be', 'challenging', 'and', 'so', 'far', 'this', 'problem', 'has', 'been', 'addressed', 'with', 'stochastic', 'optimization', 'techniques', 'in', 'this', 'work', 'we', 'explore', 'a', 'different', 'direction', 'we', 'study', 'how', 'the', 'action', 'of', 'elementary', 'quantum', 'operations', 'modifies', 'nnss', 'we', 'parametrize', 'a', 'family', 'of', 'many', 'body', 'quantum', 'operations', 'that', 'can', 'be', 'directly', 'applied', 'to', 'states', 'represented', 'by', 'unrestricted', 'boltzmann', 'machines', 'by', 'just', 'adding', 'hidden', 'nodes', 'and', 'updating', 'the', 'network', 'parameters', 'we', 'show', 'that', 'this', 'parametrization', 'contains', 'a', 'set', 'of', 'universal', 'quantum', 'gates', 'from', 'which', 'it', 'follows', 'that', 'the', 'state', 'prepared', 'by', 'any', 'quantum', 'circuit', 'can', 'be', 'expressed', 'as', 'a', 'neural', 'network', 'state', 'with', 'a', 'number', 'of', 'hidden', 'nodes', 'that', 'grows', 'linearly', 'with', 'the', 'number', 'of', 'elementary', 'operations', 'in', 'the', 'circuit', 'this', 'is', 'a', 'powerful', 'representation', 'theorem', 'which', 'was', 'recently', 'obtained', 'with', 'different', 'methods', 'but', 'that', 'is', 'not', 'directly', 'useful', 'since', 'there', 'is', 'no', 'general', 'and', 'efficient', 'way', 'to', 'extract', 'information', 'from', 'this', 'unrestricted', 'description', 'of', 'quantum', 'states', 'to', 'circumvent', 'this', 'problem', 'we', 'propose', 'a', 'stepwise', 'procedure', 'based', 'on', 'the', 'projection', 'of', 'unrestricted', 'quantum', 'states', 'to', 'restricted', 'quantum', 'states', 'in', 'turn', 'two', 'approximate', 'methods', 'to', 'perform', 'this', 'projection', 'are', 'discussed', 'in', 'this', 'way', 'we', 'show', 'that', 'it', 'is', 'in', 'principle', 'possible', 'to', 'approximately', 'optimize', 'or', 'evolve', 'neural', 'network', 'states', 'without', 'relying', 'on', 'stochastic', 'methods', 'such', 'as', 'variational', 'monte', 'carlo', 'which', 'are', 'computationally', 'expensive']] | [-0.08804357355413629, 0.13538965727261212, -0.09797828192674544, 0.07867909583152854, -0.07762258828757186, -0.1833266765603223, 0.0578711742474352, 0.3891029821596908, -0.32058406354676006, -0.3036247282157333, 0.05465940802601617, -0.23350959911517957, -0.20034971685426856, 0.18135816588452375, -0.06643653326046073, 0.11132359471790781, 0.07998059043297116, 0.047644849415776375, -0.05920629861354071, -0.2546754116266505, 0.2950197545665089, 0.03367733029038201, 0.28850495635265283, -0.006131009710459006, 0.11443780723287865, 0.006717065784441761, 0.03390758672758753, 0.043199576800705554, -0.06651125555768957, 0.15454745237458853, 0.29672647157006043, 0.15967191248233742, 0.2850973491537197, -0.47615145252155333, -0.24138535873868994, 0.12747866082722617, 0.1331382007163278, 0.17704081419541076, 0.005957821205541386, -0.28809909519571614, 0.07953951063536292, -0.18768559305438304, -0.07745032346159114, -0.16333739457210994, -0.015934704206456093, -0.024366057623719118, -0.231267621053725, 0.028714661873126726, 0.06852979073527206, 0.017116215498788882, 0.010097745870151179, -0.08691982777053721, 0.02111050186640922, 0.11385158875828787, -0.025828583407061102, 0.05388251144945779, 0.12241822524595176, -0.1341563222538836, -0.17391650855225305, 0.34117414716482264, -0.010126460948300815, -0.23262222680714073, 0.18701426869146395, -0.04709724806472922, -0.16354178668858727, 0.07486374034997167, 0.17907834990532548, 0.12440838531694662, -0.17137986203728, 0.07602932500877572, -0.06259800704498858, 0.18183711179541984, 0.03245877709187067, 0.04509239500103018, 0.17368801645753582, 0.15199207905400217, 0.06298345451094309, 0.17464269216249734, -0.04727273695414611, -0.14663485106094756, -0.24065329747557535, -0.13785173745937776, -0.244665447098463, 0.07422017669326803, -0.004225888693313996, -0.17453521479350226, 0.3991433136632449, 0.16712610874746273, 0.2059397103047729, 0.04287560649961562, 0.2849306913031851, 0.12794764398548022, 0.11330243659307752, 0.1133194758899036, 0.20613423460196084, 0.11476296092656707, 0.06934029339440825, -0.18204012677417378, 0.09173585699670438, 0.059466480115813604] |
1,803.02119 | Chaotic motion of neutral and charged particles in the magnetized
Ernst-Schwarzschild spacetime | Neutral test particles around a Schwarzschild black hole immersed in an
external uniform magnetic field have no interactions of electromagnetic forces,
but their motions can be chaotic. This chaotic behavior is induced owing to the
gravitational effect of the magnetic field leading to the nonintegrability of
the magnetized Ernst-Schwarzschild spacetime geometry. In fact, chaos is
strengthened typically with an increase of the energy or the magnetic field
under appropriate circumstances. When these test particles have charges, the
electromagnetic forces are included. As a result, the electromagnetic forces
have an effect on strengthening or weakening the extent of chaos caused by the
gravitational effect of the magnetic field.
| gr-qc | neutral test particles around a schwarzschild black hole immersed in an external uniform magnetic field have no interactions of electromagnetic forces but their motions can be chaotic this chaotic behavior is induced owing to the gravitational effect of the magnetic field leading to the nonintegrability of the magnetized ernstschwarzschild spacetime geometry in fact chaos is strengthened typically with an increase of the energy or the magnetic field under appropriate circumstances when these test particles have charges the electromagnetic forces are included as a result the electromagnetic forces have an effect on strengthening or weakening the extent of chaos caused by the gravitational effect of the magnetic field | [['neutral', 'test', 'particles', 'around', 'a', 'schwarzschild', 'black', 'hole', 'immersed', 'in', 'an', 'external', 'uniform', 'magnetic', 'field', 'have', 'no', 'interactions', 'of', 'electromagnetic', 'forces', 'but', 'their', 'motions', 'can', 'be', 'chaotic', 'this', 'chaotic', 'behavior', 'is', 'induced', 'owing', 'to', 'the', 'gravitational', 'effect', 'of', 'the', 'magnetic', 'field', 'leading', 'to', 'the', 'nonintegrability', 'of', 'the', 'magnetized', 'ernstschwarzschild', 'spacetime', 'geometry', 'in', 'fact', 'chaos', 'is', 'strengthened', 'typically', 'with', 'an', 'increase', 'of', 'the', 'energy', 'or', 'the', 'magnetic', 'field', 'under', 'appropriate', 'circumstances', 'when', 'these', 'test', 'particles', 'have', 'charges', 'the', 'electromagnetic', 'forces', 'are', 'included', 'as', 'a', 'result', 'the', 'electromagnetic', 'forces', 'have', 'an', 'effect', 'on', 'strengthening', 'or', 'weakening', 'the', 'extent', 'of', 'chaos', 'caused', 'by', 'the', 'gravitational', 'effect', 'of', 'the', 'magnetic', 'field']] | [-0.22091857331831288, 0.22867246330559216, -0.08318348362314831, 0.08757813173491191, -0.07689607287054213, -0.05138693626021158, -0.04013165981368214, 0.32448034802065145, -0.23344844297664064, -0.32860338589712484, 0.03931937675334443, -0.2476483901439867, -0.10365722806386228, 0.1835880580156128, -0.009392587801898425, -0.029675156475519233, -0.0019236390549197512, 0.07163215844171508, -0.018787449542081582, -0.19570805668997807, 0.3561182611507697, 0.11604332638561796, 0.22108907191486993, 0.0578230387011745, 0.041369193888111215, -0.01610546189421823, 0.037529368370876844, 0.11047311178474459, -0.07251320574169029, 0.0098764143603028, 0.10078959487694895, -0.005035015925729893, 0.2644793866026514, -0.49807295501935034, -0.23019643676168514, 0.1180597044712038, 0.11381194326271005, 0.15207070795344715, -0.09411049570299615, -0.3438712376837601, 0.021227593823634792, -0.14575151791620367, -0.19631232587040737, -0.04636589225979065, 0.04844708524134783, 0.04821374759139528, -0.26649976073641257, 0.1079777624932522, 0.14237357041675527, 0.08894841262433988, -0.09023901366602348, -0.001359488208830919, -0.026456531638033548, 0.09577638783655788, 0.1570252000292728, 0.082336446570171, 0.24559633579667448, -0.16538738731936253, -0.10242553680854023, 0.3832232194188279, -0.06258946152421523, -0.22662170904354667, 0.201215696608964, -0.18562741993645313, -0.042888592941827085, 0.19910375524382545, 0.17417614063564338, 0.09900392667897802, -0.1642189408145364, 0.10799049299192738, 0.012797838026429262, 0.12419050445182706, 0.10612455087731469, 0.06472918087614367, 0.3319024421990726, 0.09465068462963726, 0.027676003886263748, 0.15640016099468823, -0.0933224648030756, -0.05655068420488739, -0.26415441312633875, -0.11287614964344099, -0.14619860976477558, 0.07967713053057075, -0.11632863029177007, -0.21075544943857305, 0.31981008589039295, 0.168988772039741, 0.12271444571538354, -0.0748438828203054, 0.27241692061202144, 0.11929786712412266, 0.07576044039352674, 0.06622569857797814, 0.3953256240501156, 0.19237011088770023, 0.11102447661852359, -0.25126293771636654, 0.019680083913834027, 0.0379436306374253] |
1,803.0212 | Magnon-assisted tunnelling in van der Waals heterostructures based on
CrBr3 | The growing family of two-dimensional (2D) materials that are now available
can be used to assemble van der Waals heterostructures with a wide range of
properties. Of particular interest are tunnelling heterostructures, which have
been used to study the electronic states both in the tunnelling barrier and in
the emitter and collector contacts. Recently, 2D ferromagnets have been studied
theoretically and experimentally. Here we investigate electron tunnelling
through a thin (2-6 layers) ferromagnetic CrBr3 barrier. For devices with
non-magnetic barriers, conservation of momentum can be relaxed by
phonon-assisted tunnelling or by tunnelling through localised states. In the
case of our ferromagnetic barrier the dominant tunnelling mechanisms are the
emission of magnons at low temperatures or scattering of electrons on localised
magnetic excitations above the Curie temperature. Tunnelling with magnon
emission offers the possibility of injecting spin into the collector electrode.
| cond-mat.mes-hall | the growing family of twodimensional 2d materials that are now available can be used to assemble van der waals heterostructures with a wide range of properties of particular interest are tunnelling heterostructures which have been used to study the electronic states both in the tunnelling barrier and in the emitter and collector contacts recently 2d ferromagnets have been studied theoretically and experimentally here we investigate electron tunnelling through a thin 26 layers ferromagnetic crbr3 barrier for devices with nonmagnetic barriers conservation of momentum can be relaxed by phononassisted tunnelling or by tunnelling through localised states in the case of our ferromagnetic barrier the dominant tunnelling mechanisms are the emission of magnons at low temperatures or scattering of electrons on localised magnetic excitations above the curie temperature tunnelling with magnon emission offers the possibility of injecting spin into the collector electrode | [['the', 'growing', 'family', 'of', 'twodimensional', '2d', 'materials', 'that', 'are', 'now', 'available', 'can', 'be', 'used', 'to', 'assemble', 'van', 'der', 'waals', 'heterostructures', 'with', 'a', 'wide', 'range', 'of', 'properties', 'of', 'particular', 'interest', 'are', 'tunnelling', 'heterostructures', 'which', 'have', 'been', 'used', 'to', 'study', 'the', 'electronic', 'states', 'both', 'in', 'the', 'tunnelling', 'barrier', 'and', 'in', 'the', 'emitter', 'and', 'collector', 'contacts', 'recently', '2d', 'ferromagnets', 'have', 'been', 'studied', 'theoretically', 'and', 'experimentally', 'here', 'we', 'investigate', 'electron', 'tunnelling', 'through', 'a', 'thin', '26', 'layers', 'ferromagnetic', 'crbr3', 'barrier', 'for', 'devices', 'with', 'nonmagnetic', 'barriers', 'conservation', 'of', 'momentum', 'can', 'be', 'relaxed', 'by', 'phononassisted', 'tunnelling', 'or', 'by', 'tunnelling', 'through', 'localised', 'states', 'in', 'the', 'case', 'of', 'our', 'ferromagnetic', 'barrier', 'the', 'dominant', 'tunnelling', 'mechanisms', 'are', 'the', 'emission', 'of', 'magnons', 'at', 'low', 'temperatures', 'or', 'scattering', 'of', 'electrons', 'on', 'localised', 'magnetic', 'excitations', 'above', 'the', 'curie', 'temperature', 'tunnelling', 'with', 'magnon', 'emission', 'offers', 'the', 'possibility', 'of', 'injecting', 'spin', 'into', 'the', 'collector', 'electrode']] | [-0.13293679306682732, 0.21025307340148305, -0.01466106075427628, 0.04514317416719028, -0.01993852233281359, -0.19138900611017431, 0.05763326225403164, 0.41669314948189173, -0.2571796635697995, -0.31532087132467757, -0.04066817089499507, -0.3530278648316328, -0.07512836671500867, 0.21987378190471127, 0.07383476231646324, 0.053893410880118606, -0.03317296224247132, -0.12106236507991396, -0.02655193383439577, -0.19896470996152077, 0.3085842029856784, 0.019127303338609635, 0.3098565977033494, 0.1367394779908604, 0.03804743941457543, 0.024565965130750555, 0.18505922546610237, 0.027022456816796745, -0.16972858369476204, 0.06185357099914524, 0.26386906869177307, -0.14944343769789806, 0.211952702421695, -0.5182669353538326, -0.24487560872553982, -0.015508165922281998, 0.19659356365446, 0.18271360346365587, -0.127322628233482, -0.2893335697623635, 0.04074198937575732, -0.17200421457112366, -0.08020946923799264, -0.09006614133249968, -0.0026719485675649984, 0.04132807540175106, -0.18672580629728536, 0.08329490272860442, 0.03337218177870714, 0.036562286608386785, -0.07966337510785837, -0.08417315245606005, -0.10979492932591321, 0.06349646763410419, 0.030895696613671524, -0.02868337642451349, 0.20449601099161166, -0.0941914944306648, -0.14879518509842454, 0.3136031590015461, -0.028170468784602627, -0.09950908556181405, 0.19483247650953542, -0.18949270503695256, 0.00023326181607054812, 0.17465173557866365, 0.10110595581895072, 0.11347718907719744, -0.20222656360295202, 0.11172804990866488, 0.023349881118961743, 0.09969784941058606, 0.11414760681135314, 0.08522447711522026, 0.32345897709019483, 0.20396264621688584, -0.004220936357575868, 0.14468900150719233, -0.16900699370640462, -0.044347544317133725, -0.17565068464027717, -0.19544681748707912, -0.25947621104340735, 0.10513633518213672, -0.007410407307179412, -0.21727243287272618, 0.375595213206751, 0.14441091350412794, 0.1603270639931517, -0.07202470786121141, 0.2641846696197587, 0.13358910412810343, 0.10164294356945902, -0.003403233181286071, 0.2861517042121185, 0.17855282678335374, 0.11748554659518828, -0.23373421068702424, 0.08257872441983116, -0.03172605131486697] |
1,803.02121 | Super-intense Single Attosecond Pulse Generation by Plasma Gating | A robust plasma gating to generate a single ultra-intense attosecond pulse is
developed. It is a manifestation of the hole-boring effect that limits the
strongest attosecond pulse emission within one laser cycle. The generated pulse
is characterized by a stabilized harmonic phase $\psi \approx \pm\pi/2$ and a
slowly decaying exponential spectrum bounded by $\gamma$-spike scaling and CSE
scaling. The phase oscillations in low-frequency region and fluctuations in
high-frequency region are discussed. We also show that the phase fluctuations
in high-frequency region can be reduced by including radiation reaction force.
| physics.plasm-ph | a robust plasma gating to generate a single ultraintense attosecond pulse is developed it is a manifestation of the holeboring effect that limits the strongest attosecond pulse emission within one laser cycle the generated pulse is characterized by a stabilized harmonic phase psi approx pmpi2 and a slowly decaying exponential spectrum bounded by gammaspike scaling and cse scaling the phase oscillations in lowfrequency region and fluctuations in highfrequency region are discussed we also show that the phase fluctuations in highfrequency region can be reduced by including radiation reaction force | [['a', 'robust', 'plasma', 'gating', 'to', 'generate', 'a', 'single', 'ultraintense', 'attosecond', 'pulse', 'is', 'developed', 'it', 'is', 'a', 'manifestation', 'of', 'the', 'holeboring', 'effect', 'that', 'limits', 'the', 'strongest', 'attosecond', 'pulse', 'emission', 'within', 'one', 'laser', 'cycle', 'the', 'generated', 'pulse', 'is', 'characterized', 'by', 'a', 'stabilized', 'harmonic', 'phase', 'psi', 'approx', 'pmpi2', 'and', 'a', 'slowly', 'decaying', 'exponential', 'spectrum', 'bounded', 'by', 'gammaspike', 'scaling', 'and', 'cse', 'scaling', 'the', 'phase', 'oscillations', 'in', 'lowfrequency', 'region', 'and', 'fluctuations', 'in', 'highfrequency', 'region', 'are', 'discussed', 'we', 'also', 'show', 'that', 'the', 'phase', 'fluctuations', 'in', 'highfrequency', 'region', 'can', 'be', 'reduced', 'by', 'including', 'radiation', 'reaction', 'force']] | [-0.14293507994840515, 0.29955132689792663, -0.08528802911413633, 0.08118751049121121, -0.004183544724417681, -0.13521058079045775, 0.021710839447967537, 0.41892914699432865, -0.2696941142732447, -0.2405085744420913, 0.05797491535486188, -0.2557365000221497, -0.0983600490144454, 0.24820843523114242, 0.005367600630548127, 0.01068747903495519, 0.005462934718128632, -0.040133613225241956, 0.022921059701316568, -0.07240612414501481, 0.238865666387772, 0.08899067803709344, 0.2620178864506835, 0.03508734595644372, 0.08485655846677466, -0.06559832334063355, 0.046736666318875825, -0.018502139359373938, -0.08126201179551241, -0.0009757727384567261, 0.205822149902815, 0.01692738782730885, 0.22546293141997673, -0.4246718947860328, -0.28609516081103886, 0.06801484814125368, 0.17628747538599948, 0.10390298613558778, -0.08883607735730369, -0.30913812815296376, 0.014882995651780882, -0.15963670130903748, -0.14113957903728905, -0.036326246669473636, 0.05956434861714528, 0.06164668154815445, -0.29493679394098843, 0.091719661230441, 0.0482260193212741, 0.010943487514106726, -0.021661659989728254, 0.004330137379425155, -0.011827269717204299, 0.029683305236341603, 0.0352182931991675, 0.10707119556669072, 0.21985197099539536, -0.12953671581437282, -0.05092681260165674, 0.3397379725832831, -0.13101387378595641, -0.0827104842226783, 0.07952247302852232, -0.24104524963133206, -0.049404131507882004, 0.2428431718462062, 0.0990654806453015, 0.10948163610142232, -0.10738497208380564, 0.025971094070304058, 0.060707506291113204, 0.25471504779786547, 0.13887818369072524, 0.05593513971226374, 0.21683678545311771, 0.17355018415996296, 0.03308640487111089, 0.18910620046054563, -0.14067853474460373, -0.06854758503455245, -0.2883289771641351, -0.020941017822637645, -0.18067282938599502, 0.031149835759689184, -0.05004782640770083, -0.125956122266044, 0.4496819819747047, 0.09195857451479904, 0.1287034981862896, -0.03601211503634907, 0.29512868932744657, 0.2014271994544701, 0.023024077994209205, 0.058783763642829646, 0.30727209049192344, 0.16351323715273544, 0.12567897262157535, -0.2610905403959226, 0.020222110118166627, 0.03522517294302154] |
1,803.02122 | Smartphone-based Home Robotics | Humanoid robotics is a promising field because the strong human preference to
interact with anthropomorphic interfaces. Despite this, humanoid robots are far
from reaching main stream adoption and the features available in such robots
seem to lag that of the latest smartphones. A fragmented robot ecosystem and
low incentives to developers do not help to foster the creation of Robot-Apps
either. In contrast, smartphones enjoy high adoption rates and a vibrant app
ecosystem (4M apps published). Given this, it seems logical to apply the mobile
SW and HW development model to humanoid robots. One way is to use a smartphone
to power the robot. Smartphones have been embedded in toys and drones before.
However, they have never been used as the main compute unit in a humanoid
embodiment. Here, we introduce a novel robot architecture based on smartphones
that demonstrates x3 cost reduction and that is compatible with iOS/Android.
| cs.RO cs.CY cs.HC | humanoid robotics is a promising field because the strong human preference to interact with anthropomorphic interfaces despite this humanoid robots are far from reaching main stream adoption and the features available in such robots seem to lag that of the latest smartphones a fragmented robot ecosystem and low incentives to developers do not help to foster the creation of robotapps either in contrast smartphones enjoy high adoption rates and a vibrant app ecosystem 4m apps published given this it seems logical to apply the mobile sw and hw development model to humanoid robots one way is to use a smartphone to power the robot smartphones have been embedded in toys and drones before however they have never been used as the main compute unit in a humanoid embodiment here we introduce a novel robot architecture based on smartphones that demonstrates x3 cost reduction and that is compatible with iosandroid | [['humanoid', 'robotics', 'is', 'a', 'promising', 'field', 'because', 'the', 'strong', 'human', 'preference', 'to', 'interact', 'with', 'anthropomorphic', 'interfaces', 'despite', 'this', 'humanoid', 'robots', 'are', 'far', 'from', 'reaching', 'main', 'stream', 'adoption', 'and', 'the', 'features', 'available', 'in', 'such', 'robots', 'seem', 'to', 'lag', 'that', 'of', 'the', 'latest', 'smartphones', 'a', 'fragmented', 'robot', 'ecosystem', 'and', 'low', 'incentives', 'to', 'developers', 'do', 'not', 'help', 'to', 'foster', 'the', 'creation', 'of', 'robotapps', 'either', 'in', 'contrast', 'smartphones', 'enjoy', 'high', 'adoption', 'rates', 'and', 'a', 'vibrant', 'app', 'ecosystem', '4m', 'apps', 'published', 'given', 'this', 'it', 'seems', 'logical', 'to', 'apply', 'the', 'mobile', 'sw', 'and', 'hw', 'development', 'model', 'to', 'humanoid', 'robots', 'one', 'way', 'is', 'to', 'use', 'a', 'smartphone', 'to', 'power', 'the', 'robot', 'smartphones', 'have', 'been', 'embedded', 'in', 'toys', 'and', 'drones', 'before', 'however', 'they', 'have', 'never', 'been', 'used', 'as', 'the', 'main', 'compute', 'unit', 'in', 'a', 'humanoid', 'embodiment', 'here', 'we', 'introduce', 'a', 'novel', 'robot', 'architecture', 'based', 'on', 'smartphones', 'that', 'demonstrates', 'x3', 'cost', 'reduction', 'and', 'that', 'is', 'compatible', 'with', 'iosandroid']] | [-0.1310416632395263, 0.04873897536296626, -0.08912376664677116, 0.019280215458616575, -0.20342068971122051, -0.2267459499377276, 0.03269250308429556, 0.46656876726418123, -0.20366687497257122, -0.3527000799274617, 0.09508325846954471, -0.2904476363458956, -0.1778760875233126, 0.1950974462096117, -0.18613258604836164, 0.05026833482916613, 0.09928460219925662, 0.0394150070587908, 0.05288496198327452, -0.2445156403570151, 0.22786292295386623, 0.033095738502871876, 0.267125354544418, 0.062242570639663965, 0.1103063074667577, -0.03718652114031368, 0.04435163148723188, -0.029571172575383973, -0.05956671219852675, 0.15638017927163414, 0.3285355155869406, 0.1700262588252421, 0.3293341176321439, -0.4698243092707529, -0.15204741232347402, 0.07946072524527506, 0.1975520183136259, 0.055380974539878725, -0.08004459293581367, -0.3415421296281702, 0.12714621653070762, -0.27548591405957884, -0.12273678178962345, -0.07211334195121058, 0.04637582824473605, 0.031251842937698324, -0.19926265508354624, -0.07545060834207502, -0.030247995680590875, 0.12821110843547753, -0.05684644913124269, -0.0587746618429617, -0.01592701911406756, 0.22398856362378616, 0.0557031059379493, 0.04954116294781367, 0.22342571986484386, -0.16429532244072936, -0.1433888596710654, 0.3840241168948765, 0.04111732515588808, -0.16628253913554206, 0.27267738849045015, -0.09364792912387523, -0.14363665216076535, 0.06992284859590815, 0.23521562985724256, 0.05810027732672233, -0.18066365746020965, 0.04209464895923077, 0.013060004542245955, 0.18565410863430726, 0.026974994226732628, -0.022840194890376964, 0.20936663262546062, 0.20997443953592357, 0.08753799337562693, 0.05274735405870086, -0.019032324662710837, -0.10846592223930622, -0.18460705002324757, -0.19108124433653936, -0.15401244622522167, 0.0184385464994948, -0.024065939430187006, -0.12029469403799395, 0.3059378841632128, 0.23425330542230688, 0.14524571641291284, 0.05707956989910327, 0.3719310187259499, 0.015641130569555677, 0.18207824425328345, 0.12131672994024595, 0.22636347911859148, -0.02225980766396336, 0.2371806750409812, -0.13142966279018747, 0.10952619255083251, -0.0462508033406699] |
1,803.02123 | Towards Mission-Critical Control at the Edge and Over 5G | With the emergence of industrial IoT and cloud computing, and the advent of
5G and edge clouds, there are ambitious expectations on elasticity, economies
of scale, and fast time to market for demanding use cases in the next
generation of ICT networks. Responsiveness and reliability of wireless
communication links and services in the cloud are set to improve significantly
as the concept of edge clouds is becoming more prevalent. To enable industrial
uptake we must provide cloud capacity in the networks but also a sufficient
level of simplicity and self-sustainability in the software platforms. In this
paper, we present a research test-bed built to study mission-critical control
over the distributed edge cloud. We evaluate system properties using a
conventional control application in the form of a Model Predictive Controller.
Our cloud platform provides the means to continuously operate our
mission-critical application while seamlessly relocating computations across
geographically dispersed compute nodes. Through our use of 5G wireless radio,
we allow for mobility and reliably provide compute resources with low latency,
at the edge. The primary contribution of this paper is a state-of-the art,
fully operational test-bed showing the potential for merged IoT, 5G, and cloud.
We also provide an evaluation of the system while operating a mission-critical
application and provide an outlook on a novel research direction.
| cs.SY cs.DC | with the emergence of industrial iot and cloud computing and the advent of 5g and edge clouds there are ambitious expectations on elasticity economies of scale and fast time to market for demanding use cases in the next generation of ict networks responsiveness and reliability of wireless communication links and services in the cloud are set to improve significantly as the concept of edge clouds is becoming more prevalent to enable industrial uptake we must provide cloud capacity in the networks but also a sufficient level of simplicity and selfsustainability in the software platforms in this paper we present a research testbed built to study missioncritical control over the distributed edge cloud we evaluate system properties using a conventional control application in the form of a model predictive controller our cloud platform provides the means to continuously operate our missioncritical application while seamlessly relocating computations across geographically dispersed compute nodes through our use of 5g wireless radio we allow for mobility and reliably provide compute resources with low latency at the edge the primary contribution of this paper is a stateofthe art fully operational testbed showing the potential for merged iot 5g and cloud we also provide an evaluation of the system while operating a missioncritical application and provide an outlook on a novel research direction | [['with', 'the', 'emergence', 'of', 'industrial', 'iot', 'and', 'cloud', 'computing', 'and', 'the', 'advent', 'of', '5g', 'and', 'edge', 'clouds', 'there', 'are', 'ambitious', 'expectations', 'on', 'elasticity', 'economies', 'of', 'scale', 'and', 'fast', 'time', 'to', 'market', 'for', 'demanding', 'use', 'cases', 'in', 'the', 'next', 'generation', 'of', 'ict', 'networks', 'responsiveness', 'and', 'reliability', 'of', 'wireless', 'communication', 'links', 'and', 'services', 'in', 'the', 'cloud', 'are', 'set', 'to', 'improve', 'significantly', 'as', 'the', 'concept', 'of', 'edge', 'clouds', 'is', 'becoming', 'more', 'prevalent', 'to', 'enable', 'industrial', 'uptake', 'we', 'must', 'provide', 'cloud', 'capacity', 'in', 'the', 'networks', 'but', 'also', 'a', 'sufficient', 'level', 'of', 'simplicity', 'and', 'selfsustainability', 'in', 'the', 'software', 'platforms', 'in', 'this', 'paper', 'we', 'present', 'a', 'research', 'testbed', 'built', 'to', 'study', 'missioncritical', 'control', 'over', 'the', 'distributed', 'edge', 'cloud', 'we', 'evaluate', 'system', 'properties', 'using', 'a', 'conventional', 'control', 'application', 'in', 'the', 'form', 'of', 'a', 'model', 'predictive', 'controller', 'our', 'cloud', 'platform', 'provides', 'the', 'means', 'to', 'continuously', 'operate', 'our', 'missioncritical', 'application', 'while', 'seamlessly', 'relocating', 'computations', 'across', 'geographically', 'dispersed', 'compute', 'nodes', 'through', 'our', 'use', 'of', '5g', 'wireless', 'radio', 'we', 'allow', 'for', 'mobility', 'and', 'reliably', 'provide', 'compute', 'resources', 'with', 'low', 'latency', 'at', 'the', 'edge', 'the', 'primary', 'contribution', 'of', 'this', 'paper', 'is', 'a', 'stateofthe', 'art', 'fully', 'operational', 'testbed', 'showing', 'the', 'potential', 'for', 'merged', 'iot', '5g', 'and', 'cloud', 'we', 'also', 'provide', 'an', 'evaluation', 'of', 'the', 'system', 'while', 'operating', 'a', 'missioncritical', 'application', 'and', 'provide', 'an', 'outlook', 'on', 'a', 'novel', 'research', 'direction']] | [-0.19244426970073147, 0.02637802838917533, -0.023042724626268156, -0.009277447751999178, -0.06500689223240544, -0.13288834224631837, 0.08528638458853864, 0.39709644907809516, -0.2513728532282618, -0.3159013642806612, 0.13475856143708775, -0.2494817678730383, -0.16163180789724854, 0.22160554975939536, -0.08284836773182852, 0.07079292826259646, 0.0813832406657403, -0.017774019616168785, 0.02446544129957652, -0.24672586692678225, 0.28535598947470403, 0.09330143721308559, 0.35671125722971436, 0.11871955783903508, 0.030770104139163677, -0.04402169654430407, -0.03435467119238132, -0.03243543620860018, -0.07939653552818561, 0.21024337150717015, 0.33164536634447156, 0.19183777773287147, 0.31741154129203, -0.49062032983810816, -0.2053230517722787, 0.06862947119710346, 0.16426583250587876, 0.02669179811426956, -0.059890920379294346, -0.2816918663577073, 0.12183954887937203, -0.2877559103459741, -0.145849468209134, -0.07998647270627164, -0.0010828190360270026, 0.051035390233866766, -0.25917825765726676, -0.03160537802425636, -0.04780344507027486, 0.06845392706950575, -0.04998333512830194, -0.05568382245298751, 0.020160843213455303, 0.19705544207331346, -0.016445327531342896, 0.006766349633027049, 0.17648618173956898, -0.17508692816365376, -0.11532534306860287, 0.411931950547215, -0.007467375208593525, -0.13696657699835701, 0.218984685174224, -0.05548287391731584, -0.15387071027739527, 0.05678294553568035, 0.2579651475610229, 0.04779198667879596, -0.18072331789018656, 0.04389618036320489, 0.037245082277675264, 0.1382873266044987, 0.011761145871046378, 0.10075242544472632, 0.23112048793700524, 0.26453206528633555, 0.15817922811024968, 0.14328041556506865, -0.07728125556173769, -0.12584438795413547, -0.21823428913355908, -0.1902489009856557, -0.16701324185554836, 0.004610945912578178, -0.07191262881611625, -0.14100683165964223, 0.37953830362810687, 0.22505671979807731, 0.12061594414774811, 0.08969270849465155, 0.40220600336302864, 0.059423918933976826, 0.10681637453941491, 0.16077457186421035, 0.1852977558974763, 0.026760329988233193, 0.21226322001732317, -0.13606548827374354, 0.07036971585411164, -0.031356914364112996] |
1,803.02124 | MIRIAM: A Multimodal Chat-Based Interface for Autonomous Systems | We present MIRIAM (Multimodal Intelligent inteRactIon for Autonomous
systeMs), a multimodal interface to support situation awareness of autonomous
vehicles through chat-based interaction. The user is able to chat about the
vehicle's plan, objectives, previous activities and mission progress. The
system is mixed initiative in that it pro-actively sends messages about key
events, such as fault warnings. We will demonstrate MIRIAM using SeeByte's
SeeTrack command and control interface and Neptune autonomy simulator.
| cs.AI cs.HC | we present miriam multimodal intelligent interaction for autonomous systems a multimodal interface to support situation awareness of autonomous vehicles through chatbased interaction the user is able to chat about the vehicles plan objectives previous activities and mission progress the system is mixed initiative in that it proactively sends messages about key events such as fault warnings we will demonstrate miriam using seebytes seetrack command and control interface and neptune autonomy simulator | [['we', 'present', 'miriam', 'multimodal', 'intelligent', 'interaction', 'for', 'autonomous', 'systems', 'a', 'multimodal', 'interface', 'to', 'support', 'situation', 'awareness', 'of', 'autonomous', 'vehicles', 'through', 'chatbased', 'interaction', 'the', 'user', 'is', 'able', 'to', 'chat', 'about', 'the', 'vehicles', 'plan', 'objectives', 'previous', 'activities', 'and', 'mission', 'progress', 'the', 'system', 'is', 'mixed', 'initiative', 'in', 'that', 'it', 'proactively', 'sends', 'messages', 'about', 'key', 'events', 'such', 'as', 'fault', 'warnings', 'we', 'will', 'demonstrate', 'miriam', 'using', 'seebytes', 'seetrack', 'command', 'and', 'control', 'interface', 'and', 'neptune', 'autonomy', 'simulator']] | [-0.20716888120100982, 0.059526343168555824, -0.0657955586127397, 0.052177176814175386, -0.15813798874454654, -0.20812323213676395, 0.06334710699182165, 0.42016989089872525, -0.2198914526489334, -0.33814147336111555, 0.09379142736577416, -0.32238661822444503, -0.19763752446928318, 0.17132790706565845, -0.18077238360959766, 0.09510100470936816, 0.12820978492538046, 0.05067495817817964, 0.09984493940272302, -0.24007986907077872, 0.27458184887992515, 0.045102957946558796, 0.23606889544432794, 0.04536227549534237, 0.11364003971043596, 0.07389499140781877, 0.032598368459097714, -0.08819484072096268, -0.05495098681727752, 0.1253796558611203, 0.40021935290069843, 0.2613834062645185, 0.33790099604622176, -0.46100302472494653, -0.19930604528095844, 0.03501649850817478, 0.14480590434286042, 0.042873717905224665, -0.02345708205594101, -0.4418688473980064, 0.06252905217579742, -0.2836936429898808, -0.10760015336985605, -0.06454203966195168, 0.012154079258333946, 0.048821616043046495, -0.27814385524370533, -0.08408096651344196, 0.021574663376246674, 0.1469550939357799, -0.10177571283302446, -0.002521631110500058, -0.02861136033375194, 0.2478485862535519, 0.00882946898944784, 0.04969933755911779, 0.21983800226471562, -0.1248723868874536, -0.15223081137957997, 0.36494108424454497, 0.0419539761479836, -0.12710783846399654, 0.21821257879660613, -0.032076381281882095, -0.11227934033461455, 0.08447815733624325, 0.2873224135822755, 0.04509212038871171, -0.21251950951536064, -0.035812536169322666, 0.052997217533867, 0.2146627597976476, -0.008103696130000162, -0.030272115926271763, 0.22063382476082313, 0.251302741980855, 0.18234459404577164, 0.06503512655668285, -0.03689433428445372, -0.10375048530598481, -0.21223331642323645, -0.20207703564370025, -0.10526327701771389, -0.020246660323354645, 0.012396014506679343, -0.012953732270693434, 0.3237990333658198, 0.2813383423811014, 0.06285977224562911, 0.021839991373860317, 0.39706797033980273, 0.0046258371009531875, 0.05759596528377438, 0.10512841622466626, 0.12938584881308285, -0.021984726568495018, 0.24469863563317104, -0.17152461108576128, 0.14256664286570056, -0.007204832664380471] |
1,803.02125 | Statistical properties for flows with unbounded roof function, including
the Lorenz attractor | For geometric Lorenz attractors (including the classical Lorenz attractor) we
obtain a greatly simplified proof of the central limit theorem which applies
also to the more general class of codimension two singular hyperbolic
attractors. We also obtain the functional central limit theorem and moment
estimates, as well as iterated versions of these results. A consequence is
deterministic homogenisation (convergence to a stochastic differential
equation) for fast-slow dynamical systems whenever the fast dynamics is
singularly hyperbolic of codimension two.
| math.DS | for geometric lorenz attractors including the classical lorenz attractor we obtain a greatly simplified proof of the central limit theorem which applies also to the more general class of codimension two singular hyperbolic attractors we also obtain the functional central limit theorem and moment estimates as well as iterated versions of these results a consequence is deterministic homogenisation convergence to a stochastic differential equation for fastslow dynamical systems whenever the fast dynamics is singularly hyperbolic of codimension two | [['for', 'geometric', 'lorenz', 'attractors', 'including', 'the', 'classical', 'lorenz', 'attractor', 'we', 'obtain', 'a', 'greatly', 'simplified', 'proof', 'of', 'the', 'central', 'limit', 'theorem', 'which', 'applies', 'also', 'to', 'the', 'more', 'general', 'class', 'of', 'codimension', 'two', 'singular', 'hyperbolic', 'attractors', 'we', 'also', 'obtain', 'the', 'functional', 'central', 'limit', 'theorem', 'and', 'moment', 'estimates', 'as', 'well', 'as', 'iterated', 'versions', 'of', 'these', 'results', 'a', 'consequence', 'is', 'deterministic', 'homogenisation', 'convergence', 'to', 'a', 'stochastic', 'differential', 'equation', 'for', 'fastslow', 'dynamical', 'systems', 'whenever', 'the', 'fast', 'dynamics', 'is', 'singularly', 'hyperbolic', 'of', 'codimension', 'two']] | [-0.14432255603008878, 0.06605829796694124, -0.11927474402368833, 0.148249151940362, -0.04794552244054966, -0.15533383576145682, 0.006661789758184638, 0.18315896924991065, -0.28806658504674065, -0.19972564537937826, 0.15900077022916564, -0.24703367709970245, -0.2026841115588561, 0.26515367448043364, -0.12914387414303535, 0.10559108954233427, 0.06637430796698214, 0.03455760535330345, -0.042250175321570195, -0.20887221654023355, 0.3536993542071193, -0.05585468583740294, 0.20789633982647687, -0.0028798544274953506, 0.13285070127592638, 0.0016778686668914862, 0.011111395827566203, 0.04209091294950877, -0.1685263896241593, 0.07980234919784543, 0.23931191903270352, 0.036656337820041254, 0.25605052582418114, -0.38034287343422574, -0.20288392496653473, 0.14472692601908094, 0.1711871235781403, 0.11717377935434715, -0.020874833584597442, -0.2787342640833977, 0.07125578541905643, -0.12404244532659411, -0.28712580823906675, -0.14343134336507854, 0.028753350130640544, 0.10124827303493825, -0.2747103603891073, 0.09561555888070963, 0.1995833041023266, 0.05943771967819581, -0.050260908130066805, -0.042602709182597794, -0.06712544647057374, 0.06479560927105829, 0.05532145467945016, -0.028085091587108296, 0.13854533748534054, -0.06135630236269954, -0.12661311274860054, 0.3337705412145274, -0.10787794082753886, -0.2643696489528968, 0.2280551926829876, -0.1154889076983986, -0.23273733763310772, 0.11575658320903014, 0.1658713954847115, 0.14719275063357484, -0.16164984214955416, 0.12036142597282425, -0.06217963427591782, 0.11471081799708116, 0.10301582114054607, 0.04411593549780381, 0.07879624540248933, 0.16235186931533882, 0.16782733937725425, 0.15135050024419355, -0.019406718840727057, -0.21705025940751418, -0.31287672512455456, -0.15403993627152, -0.11312994334655695, 0.18052668849197337, -0.1999689086326562, -0.23322169305995488, 0.37877470715783346, 0.06364389067405285, 0.15130316627283508, 0.14492014393908903, 0.2710405513405418, 0.2042979681192754, -0.02823482243081507, 0.06627088375628376, 0.22557669255930263, 0.21826927654612333, 0.10348651765917356, -0.13797102250063267, -0.028998813532197323, 0.26230736223694223] |
1,803.02126 | Frozen Superparaelectric State of Local Polar Regions in GdMn2O5 and
Gd0.8Ce0.2Mn2O5 | A comparative study of the dielectric properties and electric polarization of
multiferroics GdMn2O5 and Gd0.8Ce0.2Mn2O5 has been carried out in the
temperature range from 5 up to 300 K. The polarization properties in the
ferroelectric state that forms due to a charge ordering and exchange striction
have been studied at T less than 30 K. The properties of the restricted polar
phase separation domains formed in the crystals containing ions Mn3+ and Mn4+
have been studied, too. These domains exhibit the electric polarization in the
temperature range from 5 K to some temperatures Tf lager than TC. Such a
high-temperature polarization is due to the frozen superparaelectric state of
the restricted polar domains.
| cond-mat.mtrl-sci | a comparative study of the dielectric properties and electric polarization of multiferroics gdmn2o5 and gd08ce02mn2o5 has been carried out in the temperature range from 5 up to 300 k the polarization properties in the ferroelectric state that forms due to a charge ordering and exchange striction have been studied at t less than 30 k the properties of the restricted polar phase separation domains formed in the crystals containing ions mn3 and mn4 have been studied too these domains exhibit the electric polarization in the temperature range from 5 k to some temperatures tf lager than tc such a hightemperature polarization is due to the frozen superparaelectric state of the restricted polar domains | [['a', 'comparative', 'study', 'of', 'the', 'dielectric', 'properties', 'and', 'electric', 'polarization', 'of', 'multiferroics', 'gdmn2o5', 'and', 'gd08ce02mn2o5', 'has', 'been', 'carried', 'out', 'in', 'the', 'temperature', 'range', 'from', '5', 'up', 'to', '300', 'k', 'the', 'polarization', 'properties', 'in', 'the', 'ferroelectric', 'state', 'that', 'forms', 'due', 'to', 'a', 'charge', 'ordering', 'and', 'exchange', 'striction', 'have', 'been', 'studied', 'at', 't', 'less', 'than', '30', 'k', 'the', 'properties', 'of', 'the', 'restricted', 'polar', 'phase', 'separation', 'domains', 'formed', 'in', 'the', 'crystals', 'containing', 'ions', 'mn3', 'and', 'mn4', 'have', 'been', 'studied', 'too', 'these', 'domains', 'exhibit', 'the', 'electric', 'polarization', 'in', 'the', 'temperature', 'range', 'from', '5', 'k', 'to', 'some', 'temperatures', 'tf', 'lager', 'than', 'tc', 'such', 'a', 'hightemperature', 'polarization', 'is', 'due', 'to', 'the', 'frozen', 'superparaelectric', 'state', 'of', 'the', 'restricted', 'polar', 'domains']] | [-0.15986093404018772, 0.2058215576545459, -0.01666663107833108, -0.010702868976601424, -0.025861290658502716, -0.09266661578558583, 0.07901822330545535, 0.4221806280908331, -0.25976949496672747, -0.2895805870669078, 0.05606987698630026, -0.31955308181983705, -0.015144168597077373, 0.16130114549490732, 0.09364062588274545, -0.008574206555113855, -0.09619608151817084, 0.03336120149753246, -0.1055359694616358, -0.21369465593809048, 0.21587367456373388, 0.013165995147413023, 0.282199947229397, 0.07437133669144416, 0.04325104472268604, -0.048427173394948834, 0.0987809943035245, 0.055284549706755615, -0.12133470333246484, 0.02888577895453282, 0.2692511102052785, -0.033989469329125985, 0.19292921692017564, -0.4008249193594783, -0.2281130960919952, 0.07280714960719369, 0.09104746308144743, 0.10494520212729684, -0.06805629670554031, -0.2294651565463406, 0.09323712273097012, -0.11661149537297938, -0.10726842446295458, -0.09674378745752361, 0.051120485986821944, 0.012497048114557272, -0.21370059074586736, 0.08498667038367254, 0.09134264941846507, 0.15226067932306137, -0.0816899126280198, -0.23094715398068713, -0.05613763863220811, 0.04353970716979388, 0.06690424836273676, 0.09317723257195172, 0.1353112038686476, -0.09580327050381265, -0.07197658035211858, 0.36296093917196304, -0.020189487693915802, -0.07584588474849552, 0.2037856239677135, -0.23063317863517893, -0.07111052973443165, 0.22527968846426338, 0.1373291526441009, 0.16437371546995982, -0.1478775985440058, 0.10009533145250671, 0.01821538821621015, 0.19020103806613292, 0.14515385203129422, 0.07572685438002237, 0.23831912668821592, 0.13221506429094393, 0.014078825658632327, 0.17761869748448542, -0.1200783659366116, -0.08125728378649306, -0.16858850765985692, -0.13240521498832158, -0.17969693001194864, 0.057754020643445245, -0.06522712941164052, -0.11596715415671335, 0.3788848640067519, 0.11996634503846074, 0.1824053782223831, -0.08954494225635992, 0.1902637631030737, 0.017510741504024617, 0.13310482870556611, 0.056073027232299205, 0.2858680690408466, 0.2301622602338614, 0.17358505345089772, -0.25624381043676253, 0.10489824376547033, -0.05206075396421736] |
1,803.02127 | Robust Continuous System Integration for Critical Deep-Sea Robot
Operations Using Knowledge-Enabled Simulation in the Loop | Deep-sea robot operations demand a high level of safety, efficiency and
reliability. As a consequence, measures within the development stage have to be
implemented to extensively evaluate and benchmark system components ranging
from data acquisition, perception and localization to control. We present an
approach based on high-fidelity simulation that embeds spatial and
environmental conditions from recorded real-world data. This simulation in the
loop (SIL) methodology allows for mitigating the discrepancy between simulation
and real-world conditions, e.g. regarding sensor noise. As a result, this work
provides a platform to thoroughly investigate and benchmark behaviors of system
components concurrently under real and simulated conditions. The conducted
evaluation shows the benefit of the proposed work in tasks related to
perception and self-localization under changing spatial and environmental
conditions.
| cs.RO | deepsea robot operations demand a high level of safety efficiency and reliability as a consequence measures within the development stage have to be implemented to extensively evaluate and benchmark system components ranging from data acquisition perception and localization to control we present an approach based on highfidelity simulation that embeds spatial and environmental conditions from recorded realworld data this simulation in the loop sil methodology allows for mitigating the discrepancy between simulation and realworld conditions eg regarding sensor noise as a result this work provides a platform to thoroughly investigate and benchmark behaviors of system components concurrently under real and simulated conditions the conducted evaluation shows the benefit of the proposed work in tasks related to perception and selflocalization under changing spatial and environmental conditions | [['deepsea', 'robot', 'operations', 'demand', 'a', 'high', 'level', 'of', 'safety', 'efficiency', 'and', 'reliability', 'as', 'a', 'consequence', 'measures', 'within', 'the', 'development', 'stage', 'have', 'to', 'be', 'implemented', 'to', 'extensively', 'evaluate', 'and', 'benchmark', 'system', 'components', 'ranging', 'from', 'data', 'acquisition', 'perception', 'and', 'localization', 'to', 'control', 'we', 'present', 'an', 'approach', 'based', 'on', 'highfidelity', 'simulation', 'that', 'embeds', 'spatial', 'and', 'environmental', 'conditions', 'from', 'recorded', 'realworld', 'data', 'this', 'simulation', 'in', 'the', 'loop', 'sil', 'methodology', 'allows', 'for', 'mitigating', 'the', 'discrepancy', 'between', 'simulation', 'and', 'realworld', 'conditions', 'eg', 'regarding', 'sensor', 'noise', 'as', 'a', 'result', 'this', 'work', 'provides', 'a', 'platform', 'to', 'thoroughly', 'investigate', 'and', 'benchmark', 'behaviors', 'of', 'system', 'components', 'concurrently', 'under', 'real', 'and', 'simulated', 'conditions', 'the', 'conducted', 'evaluation', 'shows', 'the', 'benefit', 'of', 'the', 'proposed', 'work', 'in', 'tasks', 'related', 'to', 'perception', 'and', 'selflocalization', 'under', 'changing', 'spatial', 'and', 'environmental', 'conditions']] | [-0.09592428544606083, 0.0176096494916128, -0.09044435334578156, 0.00644297026284039, -0.019465570382773877, -0.12815012031048537, 0.04573083384893835, 0.404249712664634, -0.22090122950077057, -0.38939634566009046, 0.14047233147360386, -0.22475447585631628, -0.1810910347700119, 0.2576138608157635, -0.1172966991160065, 0.10690797178540379, 0.1276842364901677, -0.019279530391097068, -0.030421683836029844, -0.22932135486230254, 0.28445782651379703, 0.07851010564714671, 0.3708226820603013, 0.09484312319289893, 0.13394421485997737, -0.005009996134787798, -0.03031675621494651, 0.010050864232704043, -0.07317428603797453, 0.083017403206788, 0.2730798568055034, 0.20153908242471516, 0.28753892435878514, -0.45528778414428234, -0.22181175098381936, 0.07494994713366032, 0.0901297804027563, 0.04098926527798176, -0.0629660574272275, -0.35514600832760335, 0.08614824794232845, -0.17569841045886278, -0.08703825246542692, -0.10312234424054623, -0.009815989239141345, -0.013408366203308106, -0.3209483010172844, 0.028098917823284865, -0.003051769172772765, 0.1234703632965684, -0.07339063408272341, -0.060220435006544, 0.0063608306609094145, 0.21848967895284296, 0.03331878538802266, -0.027628861068515108, 0.19120109458640216, -0.1174936809031642, -0.15257941134646535, 0.3883532015234232, -0.03447664745524526, -0.18879071962833405, 0.2658639798108488, -0.07328358458727598, -0.13638527812436224, 0.05673618705570698, 0.25494735058397056, 0.07473452795110642, -0.19299171890690922, 0.01822638928843662, 0.01906132023781538, 0.17582651191204787, 0.032185199484229085, 0.03526168458536267, 0.14840945480018855, 0.25145395496115086, 0.0598732298508985, 0.17165484163817019, -0.10534959989413618, -0.10031594829261303, -0.24661631816253066, -0.11860756283253432, -0.14581153376772998, -0.023277431905269624, -0.05536581899120938, -0.09608329750597477, 0.3867037002793513, 0.2635548834055662, 0.16745143219828607, 0.048860636711120606, 0.3736142373457551, 0.048728745913133024, 0.04910241076350212, 0.03192821232043207, 0.14428757109865548, 0.05053695312514901, 0.14409083508327603, -0.23738314239680766, 0.07566544087789953, -0.038912546437233686] |
1,803.02128 | Impact of beads and drops on a repellent solid surface: a unified
description | We investigate freely expanding sheets formed by ultrasoft gel beads, and
liquid and viscoelastic drops, produced by the impact of the bead or drop on a
silicon wafer covered with a thin layer of liquid nitrogen that suppresses
viscous dissipation thanks to an inverse Leidenfrost effect. Our experiments
show a unified behaviour for the impact dynamics that holds for solids,
liquids, and viscoelastic fluids and that we rationalize by properly taking
into account elastocapillary effects. In this framework, the classical impact
dynamics of solids and liquids as far as viscous dissipation is negligible,
appears as the asymptotic limits of a universal theoretical description. A
novel material-dependent characteristic velocity that includes both capillary
and bulk elasticity emerges from this unified description of the physics of
impact.
| cond-mat.soft physics.flu-dyn | we investigate freely expanding sheets formed by ultrasoft gel beads and liquid and viscoelastic drops produced by the impact of the bead or drop on a silicon wafer covered with a thin layer of liquid nitrogen that suppresses viscous dissipation thanks to an inverse leidenfrost effect our experiments show a unified behaviour for the impact dynamics that holds for solids liquids and viscoelastic fluids and that we rationalize by properly taking into account elastocapillary effects in this framework the classical impact dynamics of solids and liquids as far as viscous dissipation is negligible appears as the asymptotic limits of a universal theoretical description a novel materialdependent characteristic velocity that includes both capillary and bulk elasticity emerges from this unified description of the physics of impact | [['we', 'investigate', 'freely', 'expanding', 'sheets', 'formed', 'by', 'ultrasoft', 'gel', 'beads', 'and', 'liquid', 'and', 'viscoelastic', 'drops', 'produced', 'by', 'the', 'impact', 'of', 'the', 'bead', 'or', 'drop', 'on', 'a', 'silicon', 'wafer', 'covered', 'with', 'a', 'thin', 'layer', 'of', 'liquid', 'nitrogen', 'that', 'suppresses', 'viscous', 'dissipation', 'thanks', 'to', 'an', 'inverse', 'leidenfrost', 'effect', 'our', 'experiments', 'show', 'a', 'unified', 'behaviour', 'for', 'the', 'impact', 'dynamics', 'that', 'holds', 'for', 'solids', 'liquids', 'and', 'viscoelastic', 'fluids', 'and', 'that', 'we', 'rationalize', 'by', 'properly', 'taking', 'into', 'account', 'elastocapillary', 'effects', 'in', 'this', 'framework', 'the', 'classical', 'impact', 'dynamics', 'of', 'solids', 'and', 'liquids', 'as', 'far', 'as', 'viscous', 'dissipation', 'is', 'negligible', 'appears', 'as', 'the', 'asymptotic', 'limits', 'of', 'a', 'universal', 'theoretical', 'description', 'a', 'novel', 'materialdependent', 'characteristic', 'velocity', 'that', 'includes', 'both', 'capillary', 'and', 'bulk', 'elasticity', 'emerges', 'from', 'this', 'unified', 'description', 'of', 'the', 'physics', 'of', 'impact']] | [-0.10266863746941089, 0.22511613589257468, -0.12915690387412906, 0.003515372141264379, -0.03057304844260216, -0.11822819928079843, 0.01927219983190298, 0.3096076876819134, -0.2759522446766496, -0.2558539432734251, 0.036861919078975916, -0.2734028659462929, -0.1600791699849069, 0.16889720358327032, -0.003820176899433136, 0.037678775986656546, 0.008321539159864187, -0.10305689227581025, -0.03961372280307114, -0.1566992442086339, 0.25856765761226413, 0.06152099658548832, 0.28567350854724644, 0.1326992290392518, 0.13118062975257636, -0.014029306150972844, 0.03532785354927182, 0.11248210737109185, -0.2236832583185751, 0.022674561793450267, 0.20641204912960529, -0.07266404795646668, 0.23335845140367747, -0.5326066784411668, -0.29751389791443944, 0.00188749722763896, 0.12952276583760977, 0.09988242372276727, -0.052737399307079616, -0.2257290551709011, 0.010614500433206558, -0.20372671999782324, -0.1405808093138039, -0.05823259830812458, 0.05482660346105695, 0.0173429667330347, -0.2001636271760799, 0.12247981328330934, 0.11942347318539395, 0.05333121174573898, -0.08713293167576194, -0.07978037652373314, -0.018440830094739794, 0.07661455577425659, 0.08196638004295528, -0.019795330515131354, 0.28074085748009386, -0.17401224782690405, -0.026239209927618502, 0.43614712128043176, -0.08935438073799014, -0.16627449691295623, 0.2249989465996623, -0.13861957951262593, -0.03302078125998378, 0.18104660037904977, 0.19464925957284868, 0.07317413384653627, -0.12497443852201104, 0.03153318087104708, -0.041224085498601196, 0.1808073323071003, 0.06631281864456832, -0.005418698985129595, 0.24948158287256955, 0.2778418510854244, -0.04108773846924305, 0.18621837513521314, -0.08649504200764932, -0.08648661711066961, -0.312702347651124, -0.1824917385801673, -0.16654053969867527, 0.04344215741287917, -0.08003062765975483, -0.1908620186969638, 0.33649679873511196, 0.08619103092839941, 0.174071802303195, 0.04669841432571411, 0.26788206545822324, 0.026597037064842878, 0.03824203749187291, 0.054129191707063, 0.303054201990366, 0.12500127988122403, 0.09099295410711784, -0.2547713091019541, 0.09450636929832398, 0.06475891124084591] |
1,803.02129 | A Non-Technical Survey on Deep Convolutional Neural Network
Architectures | Artificial neural networks have recently shown great results in many
disciplines and a variety of applications, including natural language
understanding, speech processing, games and image data generation. One
particular application in which the strong performance of artificial neural
networks was demonstrated is the recognition of objects in images, where deep
convolutional neural networks are commonly applied. In this survey, we give a
comprehensive introduction to this topic (object recognition with deep
convolutional neural networks), with a strong focus on the evolution of network
architectures. Therefore, we aim to compress the most important concepts in
this field in a simple and non-technical manner to allow for future researchers
to have a quick general understanding.
This work is structured as follows:
1. We will explain the basic ideas of (convolutional) neural networks and
deep learning and examine their usage for three object recognition tasks: image
classification, object localization and object detection.
2. We give a review on the evolution of deep convolutional neural networks by
providing an extensive overview of the most important network architectures
presented in chronological order of their appearances.
| cs.CV | artificial neural networks have recently shown great results in many disciplines and a variety of applications including natural language understanding speech processing games and image data generation one particular application in which the strong performance of artificial neural networks was demonstrated is the recognition of objects in images where deep convolutional neural networks are commonly applied in this survey we give a comprehensive introduction to this topic object recognition with deep convolutional neural networks with a strong focus on the evolution of network architectures therefore we aim to compress the most important concepts in this field in a simple and nontechnical manner to allow for future researchers to have a quick general understanding this work is structured as follows 1 we will explain the basic ideas of convolutional neural networks and deep learning and examine their usage for three object recognition tasks image classification object localization and object detection 2 we give a review on the evolution of deep convolutional neural networks by providing an extensive overview of the most important network architectures presented in chronological order of their appearances | [['artificial', 'neural', 'networks', 'have', 'recently', 'shown', 'great', 'results', 'in', 'many', 'disciplines', 'and', 'a', 'variety', 'of', 'applications', 'including', 'natural', 'language', 'understanding', 'speech', 'processing', 'games', 'and', 'image', 'data', 'generation', 'one', 'particular', 'application', 'in', 'which', 'the', 'strong', 'performance', 'of', 'artificial', 'neural', 'networks', 'was', 'demonstrated', 'is', 'the', 'recognition', 'of', 'objects', 'in', 'images', 'where', 'deep', 'convolutional', 'neural', 'networks', 'are', 'commonly', 'applied', 'in', 'this', 'survey', 'we', 'give', 'a', 'comprehensive', 'introduction', 'to', 'this', 'topic', 'object', 'recognition', 'with', 'deep', 'convolutional', 'neural', 'networks', 'with', 'a', 'strong', 'focus', 'on', 'the', 'evolution', 'of', 'network', 'architectures', 'therefore', 'we', 'aim', 'to', 'compress', 'the', 'most', 'important', 'concepts', 'in', 'this', 'field', 'in', 'a', 'simple', 'and', 'nontechnical', 'manner', 'to', 'allow', 'for', 'future', 'researchers', 'to', 'have', 'a', 'quick', 'general', 'understanding', 'this', 'work', 'is', 'structured', 'as', 'follows', '1', 'we', 'will', 'explain', 'the', 'basic', 'ideas', 'of', 'convolutional', 'neural', 'networks', 'and', 'deep', 'learning', 'and', 'examine', 'their', 'usage', 'for', 'three', 'object', 'recognition', 'tasks', 'image', 'classification', 'object', 'localization', 'and', 'object', 'detection', '2', 'we', 'give', 'a', 'review', 'on', 'the', 'evolution', 'of', 'deep', 'convolutional', 'neural', 'networks', 'by', 'providing', 'an', 'extensive', 'overview', 'of', 'the', 'most', 'important', 'network', 'architectures', 'presented', 'in', 'chronological', 'order', 'of', 'their', 'appearances']] | [-0.08033128697360452, -0.026478287649337694, -0.04955674473506709, 0.07887403017246268, -0.10856577513687726, -0.16742805189763507, -0.05372966298730009, 0.4826850945957833, -0.2543179276981391, -0.32205271867472524, 0.08753052570391447, -0.22905437658126984, -0.2894631768809631, 0.19904158932363822, -0.15276809775580963, 0.08530628359747222, 0.1469339792073394, 0.06190928536945851, -0.03581245446629408, -0.30615520056970935, 0.3071233750217491, 0.04979616575809713, 0.3454616010344277, 0.050064258406766586, 0.10638931807350471, -0.04507287473210858, -0.06748045619347573, -0.044609266888195026, -0.0695426550291207, 0.230958196748462, 0.35450606361652415, 0.2076420509101202, 0.3426724292596595, -0.47217705900677376, -0.27816560555947945, 0.08281550454493199, 0.1522509708214784, 0.14143225530715425, -0.06014510512791781, -0.33986536444216553, 0.0894607742999344, -0.18619589689187704, 0.022312172209947474, -0.12884471492013996, 0.04763275691851353, 0.014538097043340612, -0.2070793548178497, -0.04960879918394817, 0.12652076602033857, 0.11725864684105747, -0.03543830801451501, -0.10696415303779455, 0.08560801232233643, 0.1841550203350683, 0.006163942811286284, 0.07932704701864471, 0.12265726487999523, -0.2784911427996121, -0.1560711321214007, 0.35453872623749905, -0.051386757489267944, -0.15602746314576102, 0.23684788938456525, -0.012954733128814648, -0.21651051182739645, 0.05209714276263387, 0.2891564088356164, 0.11003164219954568, -0.18691513097534576, -0.0038035617565684433, -0.032901059256659614, 0.13847946918621246, 0.029927977259891728, 0.0269291070435429, 0.24881515313302063, 0.33288756080437454, -0.0002833915437804535, 0.14923997276281525, -0.13341620153385317, -0.0606934555599259, -0.19108047201815578, -0.0924204224254936, -0.1656751993733148, 0.033585829849147965, -0.06392825973016443, -0.14727668269430674, 0.4422322685726815, 0.22700018764137186, 0.21273999597308121, 0.09163847305592046, 0.3273934421258875, 0.008457314206882276, 0.14693343162426672, 0.053270573598436184, 0.1978897281372661, 0.09288692276847238, 0.19730506693530414, -0.09985758449571829, 0.05940293780683229, 0.05893378546461463] |
1,803.0213 | STADS: Software Testing as Species Discovery | A fundamental challenge of software testing is the statistically
well-grounded extrapolation from program behaviors observed during testing. For
instance, a security researcher who has run the fuzzer for a week has currently
no means (i) to estimate the total number of feasible program branches, given
that only a fraction has been covered so far, (ii) to estimate the additional
time required to cover 10% more branches, or (iii) to assess the residual risk
that a vulnerability exists when no vulnerability has been discovered. Failing
to discover a vulnerability, does not mean that none exists---even if the
fuzzer was run for a week (or a year). Hence, testing provides no formal
correctness guarantees.
In this article, I establish an unexpected connection with the otherwise
unrelated scientific field of ecology, and introduce a statistical framework
that models Software Testing and Analysis as Discovery of Species (STADS). For
instance, in order to study the species diversity of arthropods in a tropical
rain forest, ecologists would first sample a large number of individuals from
that forest, determine their species, and extrapolate from the properties
observed in the sample to properties of the whole forest. The estimation (i) of
the total number of species, (ii) of the additional sampling effort required to
discover 10% more species, or (iii) of the probability to discover a new
species are classical problems in ecology. The STADS framework draws from over
three decades of research in ecological biostatistics to address the
fundamental extrapolation challenge for automated test generation. Our
preliminary empirical study demonstrates a good estimator performance even for
a fuzzer with adaptive sampling bias---AFL, a state-of-the-art vulnerability
detection tool. The STADS framework provides statistical correctness guarantees
with quantifiable accuracy.
| cs.SE | a fundamental challenge of software testing is the statistically wellgrounded extrapolation from program behaviors observed during testing for instance a security researcher who has run the fuzzer for a week has currently no means i to estimate the total number of feasible program branches given that only a fraction has been covered so far ii to estimate the additional time required to cover 10 more branches or iii to assess the residual risk that a vulnerability exists when no vulnerability has been discovered failing to discover a vulnerability does not mean that none existseven if the fuzzer was run for a week or a year hence testing provides no formal correctness guarantees in this article i establish an unexpected connection with the otherwise unrelated scientific field of ecology and introduce a statistical framework that models software testing and analysis as discovery of species stads for instance in order to study the species diversity of arthropods in a tropical rain forest ecologists would first sample a large number of individuals from that forest determine their species and extrapolate from the properties observed in the sample to properties of the whole forest the estimation i of the total number of species ii of the additional sampling effort required to discover 10 more species or iii of the probability to discover a new species are classical problems in ecology the stads framework draws from over three decades of research in ecological biostatistics to address the fundamental extrapolation challenge for automated test generation our preliminary empirical study demonstrates a good estimator performance even for a fuzzer with adaptive sampling biasafl a stateoftheart vulnerability detection tool the stads framework provides statistical correctness guarantees with quantifiable accuracy | [['a', 'fundamental', 'challenge', 'of', 'software', 'testing', 'is', 'the', 'statistically', 'wellgrounded', 'extrapolation', 'from', 'program', 'behaviors', 'observed', 'during', 'testing', 'for', 'instance', 'a', 'security', 'researcher', 'who', 'has', 'run', 'the', 'fuzzer', 'for', 'a', 'week', 'has', 'currently', 'no', 'means', 'i', 'to', 'estimate', 'the', 'total', 'number', 'of', 'feasible', 'program', 'branches', 'given', 'that', 'only', 'a', 'fraction', 'has', 'been', 'covered', 'so', 'far', 'ii', 'to', 'estimate', 'the', 'additional', 'time', 'required', 'to', 'cover', '10', 'more', 'branches', 'or', 'iii', 'to', 'assess', 'the', 'residual', 'risk', 'that', 'a', 'vulnerability', 'exists', 'when', 'no', 'vulnerability', 'has', 'been', 'discovered', 'failing', 'to', 'discover', 'a', 'vulnerability', 'does', 'not', 'mean', 'that', 'none', 'existseven', 'if', 'the', 'fuzzer', 'was', 'run', 'for', 'a', 'week', 'or', 'a', 'year', 'hence', 'testing', 'provides', 'no', 'formal', 'correctness', 'guarantees', 'in', 'this', 'article', 'i', 'establish', 'an', 'unexpected', 'connection', 'with', 'the', 'otherwise', 'unrelated', 'scientific', 'field', 'of', 'ecology', 'and', 'introduce', 'a', 'statistical', 'framework', 'that', 'models', 'software', 'testing', 'and', 'analysis', 'as', 'discovery', 'of', 'species', 'stads', 'for', 'instance', 'in', 'order', 'to', 'study', 'the', 'species', 'diversity', 'of', 'arthropods', 'in', 'a', 'tropical', 'rain', 'forest', 'ecologists', 'would', 'first', 'sample', 'a', 'large', 'number', 'of', 'individuals', 'from', 'that', 'forest', 'determine', 'their', 'species', 'and', 'extrapolate', 'from', 'the', 'properties', 'observed', 'in', 'the', 'sample', 'to', 'properties', 'of', 'the', 'whole', 'forest', 'the', 'estimation', 'i', 'of', 'the', 'total', 'number', 'of', 'species', 'ii', 'of', 'the', 'additional', 'sampling', 'effort', 'required', 'to', 'discover', '10', 'more', 'species', 'or', 'iii', 'of', 'the', 'probability', 'to', 'discover', 'a', 'new', 'species', 'are', 'classical', 'problems', 'in', 'ecology', 'the', 'stads', 'framework', 'draws', 'from', 'over', 'three', 'decades', 'of', 'research', 'in', 'ecological', 'biostatistics', 'to', 'address', 'the', 'fundamental', 'extrapolation', 'challenge', 'for', 'automated', 'test', 'generation', 'our', 'preliminary', 'empirical', 'study', 'demonstrates', 'a', 'good', 'estimator', 'performance', 'even', 'for', 'a', 'fuzzer', 'with', 'adaptive', 'sampling', 'biasafl', 'a', 'stateoftheart', 'vulnerability', 'detection', 'tool', 'the', 'stads', 'framework', 'provides', 'statistical', 'correctness', 'guarantees', 'with', 'quantifiable', 'accuracy']] | [-0.0607332416404728, 0.0408902954044489, -0.09172525205298938, 0.09548255883108851, -0.08311725854473088, -0.15291198963920274, 0.1121393586122965, 0.3464395080068846, -0.220945620717394, -0.36490076903494134, 0.1147347805762036, -0.2701188098776111, -0.116455735710089, 0.18035716694399154, -0.08887453365563598, 0.05282844093588171, 0.08988618554370512, 0.0239654606922553, 0.002193124414051092, -0.27123633462278085, 0.24799115109043762, 0.06946393288254711, 0.289128131426764, 0.020289600644457593, 0.0841273635569092, -0.022566668400507566, -0.07287464232524477, 0.032828765030029, -0.09612204341573484, 0.1131343167804275, 0.2955626913512445, 0.23786722599966018, 0.366309301623921, -0.37313075134951884, -0.21491150365721795, 0.1572453404132504, 0.1271364712556924, 0.10330150695016949, -0.05464183646022663, -0.23549809616299405, 0.0809549361494066, -0.1688926131514612, -0.13519240105374447, -0.05605577434226203, 0.031170462913674347, -0.0075281692512740635, -0.2593365627166558, 0.030439570941711947, 0.03646075681826654, 0.12511456931363724, -0.009520996435408524, -0.12906900957380305, -0.008552522227872417, 0.15707745118365843, 0.06941288603907017, 0.01967386832280505, 0.09814755484214767, -0.14380457806300811, -0.1270298127061604, 0.36459962474883245, -0.038720187881717785, -0.11892624880357455, 0.23284908203745266, -0.10292045669262982, -0.2017482107982547, 0.13601230460763192, 0.2031972005355796, 0.05797801200654291, -0.18399916791823803, 0.04068040952865054, -0.032615226428074545, 0.20516650935160965, 0.034861566510558877, -0.03067358769935399, 0.20516731413531927, 0.19880946271879243, 0.08188223032160633, 0.09582368134208838, -0.10807226574061753, -0.07354441921432807, -0.2596629704816073, -0.17505666925021077, -0.14592382424647876, 0.030293597253992915, -0.054353371004944945, -0.17044568763992426, 0.3950613407972252, 0.1997617129831054, 0.1419911886002922, 0.08368855529868688, 0.2919248893675912, 0.03526937877584089, 0.07629179500488191, 0.07948449172169691, 0.23540526362658415, 0.08147720247089836, 0.07747136031471086, -0.15428636267536744, 0.15536040134100396, 0.013167515397071838] |
1,803.02131 | Electron spin inversion in gated silicene nanoribbons | We study locally gated silicene nanoribbons as spin active devices. We find
that the gated segments of nanoribbons with zigzag edge can be used to perform
a spin inversion for the electron spins injected with an in-plane orientation.
The strong intrinsic spin-orbit coupling for low Fermi energy in presence of an
external vertical electric field provides a fast spin precession around the
axis perpendicular to the silicene plane. The spin inversion length can be as
small as 10 nm. On the other hand in the armchair nanoribbons the spin
inversion occurs via the Rashba effect which is weak and the spin inversion
lengths are of the order of $\mu$m.
| cond-mat.mes-hall | we study locally gated silicene nanoribbons as spin active devices we find that the gated segments of nanoribbons with zigzag edge can be used to perform a spin inversion for the electron spins injected with an inplane orientation the strong intrinsic spinorbit coupling for low fermi energy in presence of an external vertical electric field provides a fast spin precession around the axis perpendicular to the silicene plane the spin inversion length can be as small as 10 nm on the other hand in the armchair nanoribbons the spin inversion occurs via the rashba effect which is weak and the spin inversion lengths are of the order of mum | [['we', 'study', 'locally', 'gated', 'silicene', 'nanoribbons', 'as', 'spin', 'active', 'devices', 'we', 'find', 'that', 'the', 'gated', 'segments', 'of', 'nanoribbons', 'with', 'zigzag', 'edge', 'can', 'be', 'used', 'to', 'perform', 'a', 'spin', 'inversion', 'for', 'the', 'electron', 'spins', 'injected', 'with', 'an', 'inplane', 'orientation', 'the', 'strong', 'intrinsic', 'spinorbit', 'coupling', 'for', 'low', 'fermi', 'energy', 'in', 'presence', 'of', 'an', 'external', 'vertical', 'electric', 'field', 'provides', 'a', 'fast', 'spin', 'precession', 'around', 'the', 'axis', 'perpendicular', 'to', 'the', 'silicene', 'plane', 'the', 'spin', 'inversion', 'length', 'can', 'be', 'as', 'small', 'as', '10', 'nm', 'on', 'the', 'other', 'hand', 'in', 'the', 'armchair', 'nanoribbons', 'the', 'spin', 'inversion', 'occurs', 'via', 'the', 'rashba', 'effect', 'which', 'is', 'weak', 'and', 'the', 'spin', 'inversion', 'lengths', 'are', 'of', 'the', 'order', 'of', 'mum']] | [-0.23984108343634994, 0.20096761363888493, 0.03414024347268523, 0.015068127578252568, -0.05856100297607738, -0.1727475536658232, 0.005027265249486637, 0.4991512494418052, -0.3016574367658671, -0.2864550889273166, 0.02062892627372586, -0.2629637052945861, -0.07431517006966089, 0.18538724300408854, 0.07279154532076364, -0.01689934727966512, -0.009697304273861538, -0.06741370834888669, -0.11000828496650408, -0.16290848685744638, 0.20826917319810082, 0.031072490241959554, 0.30994893719416555, 0.09166585918891867, 0.023224994597888186, 0.06391706132466708, 0.16642652424650456, 0.03007182786497501, -0.09886977962388309, 0.06764559314475146, 0.19324955304896613, -0.18720240611155783, 0.17708034592535382, -0.5035880998357993, -0.14469468463724905, -0.02620491006522687, 0.14994486082781003, 0.21774840438119009, -0.043067893326291046, -0.28467736394067694, 0.088987415186514, -0.122631945707109, -0.14287821082983043, -0.03722093409833011, 0.020998099704546462, -0.005172710124522858, -0.24017680576498354, 0.0963651173013271, 0.09187518007233056, 0.07912067405947852, -0.062205717622952905, -0.11261489881638335, -0.1584271196993666, 0.07591591970226087, 0.10021254714416049, 0.08090181990287378, 0.23937747873143728, -0.09364531735180441, -0.15185118175684176, 0.3543574086672396, -0.10375615982701916, -0.17625947778514767, 0.12559568039739694, -0.16050920114262934, -0.03464793614240004, 0.1484353209785912, 0.13546617859718177, 0.10950222244879249, -0.09928373601116719, 0.08956357986434499, -0.04161554375244732, 0.16386164455683133, 0.058294278676322565, 0.09043380643300918, 0.34159062968549925, 0.14965077334002447, 0.13091840403615881, 0.15643055336133346, -0.256903431905912, 0.00956372443347349, -0.17639806490699086, -0.1820327534827344, -0.23219848810716473, 0.12878059497564484, -0.0880346799742189, -0.1915031578519954, 0.4406174608429364, 0.14712546442831875, 0.1735119257258986, -0.048957440608027265, 0.2909688508018441, 0.13493641013377816, 0.12366999190625384, 0.05009899917272253, 0.244937554241047, 0.2009901248549812, 0.057699401183651945, -0.32428274461529605, 0.04908404070371335, -0.024383875366231992] |
1,803.02132 | A complete FFT-based decomposition formalism for the redshift-space
bispectrum | To fully extract cosmological information from nonlinear galaxy distribution
in redshift space, it is essential to include higher-order statistics beyond
the two-point correlation function. In this paper, we propose a new
decomposition formalism for computing the anisotropic bispectrum in redshift
space and for measuring it from galaxy samples. Our formalism uses tri-polar
spherical harmonic decomposition with zero total angular momentum to compress
the 3D modes distribution in the redshift-space bispectrum. This approach
preserves three fundamental properties of the Universe: statistical
homogeneity, isotropy, and parity-symmetry, allowing us to efficiently separate
the anisotropic signal induced by redshift-space distortions (RSDs) and the
Alcock-Paczy\'{n}ski (AP) effect from the isotropic bispectrum. The relevant
expansion coefficients in terms of the anisotropic signal are reduced to one
multipole index $L$, and the $L> 0$ modes are induced only by the RSD or AP
effects. Our formalism has two advantages: (1) we can make use of Fast Fourier
Transforms (FFTs) to measure the bispectrum; (2) it gives a simple expression
to correct for the survey geometry, i.e., the survey window function. As a
demonstration, we measure the decomposed bispectrum from the Baryon Oscillation
Spectroscopic Survey (BOSS) Data Release 12, and, for the first time, present a
$14\sigma$ detection of the anisotropic bispectrum in the $L=2$ mode.
| astro-ph.CO astro-ph.GA | to fully extract cosmological information from nonlinear galaxy distribution in redshift space it is essential to include higherorder statistics beyond the twopoint correlation function in this paper we propose a new decomposition formalism for computing the anisotropic bispectrum in redshift space and for measuring it from galaxy samples our formalism uses tripolar spherical harmonic decomposition with zero total angular momentum to compress the 3d modes distribution in the redshiftspace bispectrum this approach preserves three fundamental properties of the universe statistical homogeneity isotropy and paritysymmetry allowing us to efficiently separate the anisotropic signal induced by redshiftspace distortions rsds and the alcockpaczynski ap effect from the isotropic bispectrum the relevant expansion coefficients in terms of the anisotropic signal are reduced to one multipole index l and the l 0 modes are induced only by the rsd or ap effects our formalism has two advantages 1 we can make use of fast fourier transforms ffts to measure the bispectrum 2 it gives a simple expression to correct for the survey geometry ie the survey window function as a demonstration we measure the decomposed bispectrum from the baryon oscillation spectroscopic survey boss data release 12 and for the first time present a 14sigma detection of the anisotropic bispectrum in the l2 mode | [['to', 'fully', 'extract', 'cosmological', 'information', 'from', 'nonlinear', 'galaxy', 'distribution', 'in', 'redshift', 'space', 'it', 'is', 'essential', 'to', 'include', 'higherorder', 'statistics', 'beyond', 'the', 'twopoint', 'correlation', 'function', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'decomposition', 'formalism', 'for', 'computing', 'the', 'anisotropic', 'bispectrum', 'in', 'redshift', 'space', 'and', 'for', 'measuring', 'it', 'from', 'galaxy', 'samples', 'our', 'formalism', 'uses', 'tripolar', 'spherical', 'harmonic', 'decomposition', 'with', 'zero', 'total', 'angular', 'momentum', 'to', 'compress', 'the', '3d', 'modes', 'distribution', 'in', 'the', 'redshiftspace', 'bispectrum', 'this', 'approach', 'preserves', 'three', 'fundamental', 'properties', 'of', 'the', 'universe', 'statistical', 'homogeneity', 'isotropy', 'and', 'paritysymmetry', 'allowing', 'us', 'to', 'efficiently', 'separate', 'the', 'anisotropic', 'signal', 'induced', 'by', 'redshiftspace', 'distortions', 'rsds', 'and', 'the', 'alcockpaczynski', 'ap', 'effect', 'from', 'the', 'isotropic', 'bispectrum', 'the', 'relevant', 'expansion', 'coefficients', 'in', 'terms', 'of', 'the', 'anisotropic', 'signal', 'are', 'reduced', 'to', 'one', 'multipole', 'index', 'l', 'and', 'the', 'l', '0', 'modes', 'are', 'induced', 'only', 'by', 'the', 'rsd', 'or', 'ap', 'effects', 'our', 'formalism', 'has', 'two', 'advantages', '1', 'we', 'can', 'make', 'use', 'of', 'fast', 'fourier', 'transforms', 'ffts', 'to', 'measure', 'the', 'bispectrum', '2', 'it', 'gives', 'a', 'simple', 'expression', 'to', 'correct', 'for', 'the', 'survey', 'geometry', 'ie', 'the', 'survey', 'window', 'function', 'as', 'a', 'demonstration', 'we', 'measure', 'the', 'decomposed', 'bispectrum', 'from', 'the', 'baryon', 'oscillation', 'spectroscopic', 'survey', 'boss', 'data', 'release', '12', 'and', 'for', 'the', 'first', 'time', 'present', 'a', '14sigma', 'detection', 'of', 'the', 'anisotropic', 'bispectrum', 'in', 'the', 'l2', 'mode']] | [-0.08584147667995869, 0.07959278574876058, -0.13443227436689015, 0.10329122987828808, -0.14546172312111594, -0.04695889991349899, -0.035869746955331024, 0.3414994139994423, -0.26917042324203067, -0.28577986461683536, 0.03476900707307952, -0.29920941257688144, -0.09729493424730698, 0.1798533016509072, 0.04376151867444815, 0.038823285805007726, 0.010838458748856703, -0.050357127958425105, -0.05975134703294316, -0.22110512288935963, 0.3085694219603633, 0.09322964245131096, 0.3028981221499495, -0.04940422837255308, 0.09292711109390858, 0.009023450645215165, -0.12816230827369368, 0.014616725858034512, -0.1795507788125318, 0.07047286860268706, 0.2234727447682347, 0.13539057955718958, 0.21673081525099966, -0.33829637650901884, -0.1950313570767041, 0.11727908650209429, 0.1741264519514516, 0.14233026083093137, -0.013131501961862132, -0.27424530219062804, 0.05171322113556716, -0.16036647101506019, -0.11088046214829844, -0.12160396227801147, 0.0016604041380700297, -0.014429211350104127, -0.2750690868124366, 0.19654509194795258, 0.04682316699248846, 0.014951799655906282, -0.035411962222916864, -0.097526917813901, -0.005285759586303567, 0.10762987903861078, 0.008121472889447782, 0.053191510833410297, 0.1134143124464362, -0.1059701085368243, -0.030657527903083695, 0.40657800316638226, -0.10442836676632467, -0.17768902039656845, 0.07129784772853152, -0.21699689087612428, -0.14281319269838816, 0.09154655269062809, 0.1881902575371966, 0.07257478670586491, -0.12436967146256322, 0.10634102734100172, 0.06444184759927268, 0.18898768697936946, 0.061895653524865896, 0.04310035037983303, 0.22344501373411801, 0.06927694883891561, 0.09334917070764977, 0.1317219332626197, -0.15856503181231135, 0.006994090590384216, -0.30539060617761254, -0.09997680951813401, -0.2292059107481831, 0.049201275552219995, -0.1475841877374058, -0.1680605826818814, 0.4359359942519894, 0.13698035970894404, 0.18771871791474182, 0.07806890947708431, 0.3700023749216388, 0.0847249083332057, 0.0879433121512053, 0.024707628115160894, 0.2558385953900422, 0.16040132648329467, 0.09505949957887284, -0.21901988296975525, -0.029061411131316654, 0.04766462110833695] |
1,803.02133 | Trees within trees: Simple nested coalescents | We consider the compact space of pairs of nested partitions of $\mathbb N$,
where by analogy with models used in molecular evolution, we call "gene
partition" the finer partition and "species partition" the coarser one. We
introduce the class of nondecreasing processes valued in nested partitions,
assumed Markovian and with exchangeable semigroup. These processes are said
simple when each partition only undergoes one coalescence event at a time (but
possibly the same time). Simple nested exchangeable coalescent (SNEC) processes
can be seen as the extension of $\Lambda$-coalescents to nested partitions. We
characterize the law of SNEC processes as follows. In the absence of gene
coalescences, species blocks undergo $\Lambda$-coalescent type events and in
the absence of species coalescences, gene blocks lying in the same species
block undergo i.i.d. $\Lambda$-coalescents. Simultaneous coalescence of the
gene and species partitions are governed by an intensity measure $\nu_s$ on
$(0,1]\times {\mathcal M}_1 ([0,1])$ providing the frequency of species merging
and the law in which are drawn (independently) the frequencies of genes merging
in each coalescing species block. As an application, we also study the
conditions under which a SNEC process comes down from infinity.
| math.PR | we consider the compact space of pairs of nested partitions of mathbb n where by analogy with models used in molecular evolution we call gene partition the finer partition and species partition the coarser one we introduce the class of nondecreasing processes valued in nested partitions assumed markovian and with exchangeable semigroup these processes are said simple when each partition only undergoes one coalescence event at a time but possibly the same time simple nested exchangeable coalescent snec processes can be seen as the extension of lambdacoalescents to nested partitions we characterize the law of snec processes as follows in the absence of gene coalescences species blocks undergo lambdacoalescent type events and in the absence of species coalescences gene blocks lying in the same species block undergo iid lambdacoalescents simultaneous coalescence of the gene and species partitions are governed by an intensity measure nu_s on 01times mathcal m_1 01 providing the frequency of species merging and the law in which are drawn independently the frequencies of genes merging in each coalescing species block as an application we also study the conditions under which a snec process comes down from infinity | [['we', 'consider', 'the', 'compact', 'space', 'of', 'pairs', 'of', 'nested', 'partitions', 'of', 'mathbb', 'n', 'where', 'by', 'analogy', 'with', 'models', 'used', 'in', 'molecular', 'evolution', 'we', 'call', 'gene', 'partition', 'the', 'finer', 'partition', 'and', 'species', 'partition', 'the', 'coarser', 'one', 'we', 'introduce', 'the', 'class', 'of', 'nondecreasing', 'processes', 'valued', 'in', 'nested', 'partitions', 'assumed', 'markovian', 'and', 'with', 'exchangeable', 'semigroup', 'these', 'processes', 'are', 'said', 'simple', 'when', 'each', 'partition', 'only', 'undergoes', 'one', 'coalescence', 'event', 'at', 'a', 'time', 'but', 'possibly', 'the', 'same', 'time', 'simple', 'nested', 'exchangeable', 'coalescent', 'snec', 'processes', 'can', 'be', 'seen', 'as', 'the', 'extension', 'of', 'lambdacoalescents', 'to', 'nested', 'partitions', 'we', 'characterize', 'the', 'law', 'of', 'snec', 'processes', 'as', 'follows', 'in', 'the', 'absence', 'of', 'gene', 'coalescences', 'species', 'blocks', 'undergo', 'lambdacoalescent', 'type', 'events', 'and', 'in', 'the', 'absence', 'of', 'species', 'coalescences', 'gene', 'blocks', 'lying', 'in', 'the', 'same', 'species', 'block', 'undergo', 'iid', 'lambdacoalescents', 'simultaneous', 'coalescence', 'of', 'the', 'gene', 'and', 'species', 'partitions', 'are', 'governed', 'by', 'an', 'intensity', 'measure', 'nu_s', 'on', '01times', 'mathcal', 'm_1', '01', 'providing', 'the', 'frequency', 'of', 'species', 'merging', 'and', 'the', 'law', 'in', 'which', 'are', 'drawn', 'independently', 'the', 'frequencies', 'of', 'genes', 'merging', 'in', 'each', 'coalescing', 'species', 'block', 'as', 'an', 'application', 'we', 'also', 'study', 'the', 'conditions', 'under', 'which', 'a', 'snec', 'process', 'comes', 'down', 'from', 'infinity']] | [-0.11270732919710051, 0.20235569456141858, -0.021929525547219733, 0.09519814268696791, -0.02270313699999334, -0.10131168918390022, 0.07795605738402198, 0.35435452820046953, -0.27692852006293833, -0.20628363382267326, 0.06091469472310947, -0.27762664824626165, -0.09359532433843828, 0.12159430140041207, -0.013904636807886785, -0.017401942837444184, 0.0763781170311727, 0.03709188299008498, 0.012662911165113512, -0.2216509902028759, 0.32638559090953906, 0.037045851347379775, 0.22818557969049402, -0.07547018006106986, 0.12237715578276517, 0.0014189591561980226, -0.05016760731630616, -0.024857868555792313, -0.13659766898980658, 0.040961532849867484, 0.28828399871611177, 0.17641644015614139, 0.21658771788995518, -0.4398056696855316, -0.18683385779885084, 0.15875611290531724, 0.18195705386368852, 0.07007110819241988, -0.0020154930926908395, -0.2573374132184606, 0.039453391550647976, -0.15680977641359756, -0.13049226531293243, 0.03709367851996304, 0.0236663544100769, 0.0763129927499808, -0.31617774681531285, 0.08488173837709168, 0.11023278968932573, 0.018714543966282356, -0.008068226500855464, -0.13104148245367564, -0.07247441485524178, 0.14062757799846096, 0.028249675365575395, 0.003232060692665216, 0.14042098527578148, -0.03305459539773629, -0.15635298807909223, 0.3358836643278329, -0.04360212901006698, -0.21017827762682972, 0.23108995842355254, -0.1805198052530422, -0.22239796033582504, 0.1588465271199024, 0.1605945112016726, 0.12914945803571945, -0.16861440209085182, 0.09453176248077254, -0.026372064174594062, 0.11976616929689618, 0.14645838917012474, 0.015100421016349605, 0.22890320343921255, 0.16449506046176937, 0.040913340111116046, 0.17208759995655304, -0.050880987041531815, -0.13231301471394927, -0.26320532283770215, -0.11694024881151946, -0.1592839468319557, 0.09400549239209412, -0.16125241057958, -0.20121075708762204, 0.3244863119638084, 0.07793715967349463, 0.25251163186652487, 0.11321575359600645, 0.19430214501243379, 0.11931935351427743, 0.07327344741635515, 0.022070776933412018, 0.0538841895121885, 0.13617933202706473, 0.0014778660389741785, -0.1745191107565341, 0.10747661938841797, 0.09926125155271669] |
1,803.02134 | Relative-locality phenomenology on Snyder spacetime | We study the effects of relative locality dynamics in the case of the Snyder
model. Several properties of this model differ from those of the widely studied
$\kappa$-Poincar\'e models: for example, in the Snyder case the action of the
Lorentz group is preserved, and the composition law of momenta is deformed by
terms quadratic in the inverse Planck energy. From the investigation of time
delay and dual curvature lensing we deduce that, because of these differences,
in the Snyder case the properties of the detector are essential for the
observation of relative locality effects. The deviations from special
relativity do not depend on the energy of the particles and are much smaller
than in the $\kappa$-Poincar\'e case, so that are beyond the reach of present
astrophysical experiments. However, these results have a conceptual interest,
because they show that relative-locality effects can occur even if the action
of the Lorentz group on phase space is not deformed.
| gr-qc hep-th | we study the effects of relative locality dynamics in the case of the snyder model several properties of this model differ from those of the widely studied kappapoincare models for example in the snyder case the action of the lorentz group is preserved and the composition law of momenta is deformed by terms quadratic in the inverse planck energy from the investigation of time delay and dual curvature lensing we deduce that because of these differences in the snyder case the properties of the detector are essential for the observation of relative locality effects the deviations from special relativity do not depend on the energy of the particles and are much smaller than in the kappapoincare case so that are beyond the reach of present astrophysical experiments however these results have a conceptual interest because they show that relativelocality effects can occur even if the action of the lorentz group on phase space is not deformed | [['we', 'study', 'the', 'effects', 'of', 'relative', 'locality', 'dynamics', 'in', 'the', 'case', 'of', 'the', 'snyder', 'model', 'several', 'properties', 'of', 'this', 'model', 'differ', 'from', 'those', 'of', 'the', 'widely', 'studied', 'kappapoincare', 'models', 'for', 'example', 'in', 'the', 'snyder', 'case', 'the', 'action', 'of', 'the', 'lorentz', 'group', 'is', 'preserved', 'and', 'the', 'composition', 'law', 'of', 'momenta', 'is', 'deformed', 'by', 'terms', 'quadratic', 'in', 'the', 'inverse', 'planck', 'energy', 'from', 'the', 'investigation', 'of', 'time', 'delay', 'and', 'dual', 'curvature', 'lensing', 'we', 'deduce', 'that', 'because', 'of', 'these', 'differences', 'in', 'the', 'snyder', 'case', 'the', 'properties', 'of', 'the', 'detector', 'are', 'essential', 'for', 'the', 'observation', 'of', 'relative', 'locality', 'effects', 'the', 'deviations', 'from', 'special', 'relativity', 'do', 'not', 'depend', 'on', 'the', 'energy', 'of', 'the', 'particles', 'and', 'are', 'much', 'smaller', 'than', 'in', 'the', 'kappapoincare', 'case', 'so', 'that', 'are', 'beyond', 'the', 'reach', 'of', 'present', 'astrophysical', 'experiments', 'however', 'these', 'results', 'have', 'a', 'conceptual', 'interest', 'because', 'they', 'show', 'that', 'relativelocality', 'effects', 'can', 'occur', 'even', 'if', 'the', 'action', 'of', 'the', 'lorentz', 'group', 'on', 'phase', 'space', 'is', 'not', 'deformed']] | [-0.10236049584674244, 0.1540461765596261, -0.08287763436181614, 0.11354825062563834, -0.06262185607248774, -0.07538361947398442, -0.0340773226493277, 0.33967852179044616, -0.2530623742271788, -0.2968797205607049, 0.09109598597831045, -0.2680507990462968, -0.14983252653081974, 0.20650988387299152, -0.055873345058315836, 0.007306856909193671, 0.052656729311610646, 0.07965833889559293, -0.11529294749086078, -0.22121627675369382, 0.3510791401532538, 0.10640791327788089, 0.26321391847271186, 0.019022350987562768, 0.06618724965702337, -0.010179869579867674, -0.031036680470256563, 0.05549814736075813, -0.11399803157347868, 0.08313682469396064, 0.19194357321427957, 0.07814759190286844, 0.20924661364794397, -0.41542693976915845, -0.2227650311139699, 0.12197580287316576, 0.09173922586398056, 0.11028501372306775, -0.03468916706314746, -0.27794037816616207, 0.035689781787835106, -0.1633493953529232, -0.11607735184355615, -0.04749768850720452, 0.014220733840305071, 0.005505476547673775, -0.18929273163069946, 0.10722185964606559, 0.10263552364808558, 0.03514851980472509, -0.08297416193780895, -0.09635972283491029, -0.04328400774512631, 0.1116557650668069, 0.1091235243526544, -0.03319013831116116, 0.135347251007214, -0.15161649359372228, -0.08577629500546326, 0.47977607836349845, -0.019741107053470423, -0.23059691895300952, 0.15157737129051477, -0.2295705532447662, -0.1572865302531192, 0.09211065322056246, 0.14842009076472515, 0.13140648368617128, -0.10154085263956147, 0.16997540493395766, -0.05048278922167344, 0.12212771002967389, 0.05723530374234542, 0.07220967285460435, 0.17450322341532087, 0.098602862843575, 0.03535291994100986, 0.10396266607597518, -0.06904709499436788, -0.14098350264621565, -0.36288255298486316, -0.13448461829214536, -0.1635161965774993, 0.05300674981453295, -0.0971587570232096, -0.10900959209538996, 0.3746067957134726, 0.15767450479026407, 0.17231083631542368, 0.04188093282461453, 0.23602684691640882, 0.0960516156658578, 0.09709952609876218, 0.046362776100301206, 0.34132137122707296, 0.11098353736227952, 0.060307141952365875, -0.2345498261289695, 0.04355912961629936, 0.07606488256118236] |
1,803.02135 | Hidden Conformal Symmetry for Vector Field on Various Black Hole
Backgrounds | Hidden conformal symmetries of scalar field on various black hole backgrounds
have been investigated for years, but whether those features holds for other
fields are still open questions. Recently, with proper assumptions, Lunin
achieves to the separation of variables for Maxwell equations on Kerr
background. In this paper, with that equation, we find that hidden conformal
symmetry appears at near region under low frequency limit. We also extended
those results to vector field on Kerr-(A)dS and Kerr-NUT-(A)dS backgrounds,
then hidden conformal symmetry also appears if we focusing on the near-horizon
region at low frequency limit.
| gr-qc hep-th | hidden conformal symmetries of scalar field on various black hole backgrounds have been investigated for years but whether those features holds for other fields are still open questions recently with proper assumptions lunin achieves to the separation of variables for maxwell equations on kerr background in this paper with that equation we find that hidden conformal symmetry appears at near region under low frequency limit we also extended those results to vector field on kerrads and kerrnutads backgrounds then hidden conformal symmetry also appears if we focusing on the nearhorizon region at low frequency limit | [['hidden', 'conformal', 'symmetries', 'of', 'scalar', 'field', 'on', 'various', 'black', 'hole', 'backgrounds', 'have', 'been', 'investigated', 'for', 'years', 'but', 'whether', 'those', 'features', 'holds', 'for', 'other', 'fields', 'are', 'still', 'open', 'questions', 'recently', 'with', 'proper', 'assumptions', 'lunin', 'achieves', 'to', 'the', 'separation', 'of', 'variables', 'for', 'maxwell', 'equations', 'on', 'kerr', 'background', 'in', 'this', 'paper', 'with', 'that', 'equation', 'we', 'find', 'that', 'hidden', 'conformal', 'symmetry', 'appears', 'at', 'near', 'region', 'under', 'low', 'frequency', 'limit', 'we', 'also', 'extended', 'those', 'results', 'to', 'vector', 'field', 'on', 'kerrads', 'and', 'kerrnutads', 'backgrounds', 'then', 'hidden', 'conformal', 'symmetry', 'also', 'appears', 'if', 'we', 'focusing', 'on', 'the', 'nearhorizon', 'region', 'at', 'low', 'frequency', 'limit']] | [-0.13190697175450622, 0.13697482625414667, -0.04804797004908323, 0.08779096598859484, -0.13696425754674954, -0.1618718775871553, -0.007304703281261027, 0.38007436873097167, -0.1670309550668064, -0.2755082906959088, 0.14023937730878394, -0.2913257411436031, -0.11977209664489094, 0.18420344962689436, -0.047063022847654984, 0.04298989919357394, -0.033689981208820094, 0.08534596158485663, -0.11317666739127354, -0.2522715886760699, 0.3776629554695989, 0.03584804154540363, 0.30887374399523987, 0.010461043102642228, 0.14717989351208272, -0.01637206715776732, 0.0499209086949888, 0.029356147138107764, -0.1349555317369155, 0.02207093891369081, 0.24070768571017603, 0.06820962032254198, 0.15593908505612297, -0.39595080673890676, -0.26568762276713787, 0.05845860039423171, 0.1761197090859672, 0.14603308561307035, -0.07914734514871317, -0.305539029701858, 0.11846556636063676, -0.09007472438051513, -0.17683007856340785, -0.09793745552612419, 0.038093767959722566, -0.08168196318377005, -0.23329557986243776, 0.10299821957198314, 0.08234777335984338, 0.028994142626853365, -0.08751085954228122, -0.07295289187765631, -0.04044012974972199, 0.044110205107809684, 0.1534772965836486, 0.03599142035175311, 0.14299454184886265, -0.18163309075477485, -0.11133260302074058, 0.31662282016324367, -0.08250900417762368, -0.24681514619212402, 0.20179721114078636, -0.21991277148849087, -0.2283542962597781, 0.10330433442110294, 0.1748180008150245, 0.14030052870512008, -0.14648411361941774, 0.19247562555400163, -0.04551356278948094, 0.1501749853199152, 0.15462673844181393, 0.09697044995662413, 0.2695291372898378, 0.07789930189518553, 0.03914327672682703, 0.13385785083641838, -0.06850787305126065, -0.10265552689762492, -0.33134255840590127, -0.06741556544224486, -0.1007758545248132, 0.09954067819604748, -0.10827153169681734, -0.1136553306034521, 0.331458818216465, 0.13836469311331473, 0.14027722736232376, 0.02132402911390129, 0.18428919182502126, 0.09746967395277399, 0.064903310862811, 0.13722535959984128, 0.3092967093481045, 0.15339286216583692, 0.10903206717308708, -0.18230414756230617, -0.08431394079602078, 0.0766756295863735] |
1,803.02136 | Limit distribution of the quartet balance index for Aldous's b>=0-model | This paper builds up on T. Martinez-Coronado, A. Mir, F. Rossello and G.
Valiente's work "A balance index for phylogenetic trees based on quartets",
introducing a new balance index for trees. We show here that this balance
index, in the case of Aldous's b>=0-model, convergences weakly to a
distribution that can be characterized as the fixed point of a contraction
operator on a class of distributions.
| q-bio.PE math.PR | this paper builds up on t martinezcoronado a mir f rossello and g valientes work a balance index for phylogenetic trees based on quartets introducing a new balance index for trees we show here that this balance index in the case of aldouss b0model convergences weakly to a distribution that can be characterized as the fixed point of a contraction operator on a class of distributions | [['this', 'paper', 'builds', 'up', 'on', 't', 'martinezcoronado', 'a', 'mir', 'f', 'rossello', 'and', 'g', 'valientes', 'work', 'a', 'balance', 'index', 'for', 'phylogenetic', 'trees', 'based', 'on', 'quartets', 'introducing', 'a', 'new', 'balance', 'index', 'for', 'trees', 'we', 'show', 'here', 'that', 'this', 'balance', 'index', 'in', 'the', 'case', 'of', 'aldouss', 'b0model', 'convergences', 'weakly', 'to', 'a', 'distribution', 'that', 'can', 'be', 'characterized', 'as', 'the', 'fixed', 'point', 'of', 'a', 'contraction', 'operator', 'on', 'a', 'class', 'of', 'distributions']] | [-0.115733977677601, 0.17046457742746438, -0.1411597022726651, 0.050769903347827494, -0.06777832520780183, -0.09733443843921827, 0.14296190075918042, 0.3770306812178704, -0.27317318537332597, -0.28228556563056284, 0.0664797455106201, -0.2551350109279156, -0.16190716969750582, 0.15833566325806803, -0.08428550360634202, 0.00139617302545136, 0.06542665942481929, 0.010433591399041394, -0.03444771821640672, -0.19089852171319147, 0.39065070985065353, 0.056487892634205276, 0.2490037209579661, 0.03884663661160777, 0.11984691040350064, -0.006618901982062286, -0.03417589560511612, 0.09135030186735094, -0.13814668335708707, 0.13726066473135423, 0.2091032168151991, 0.10449425085267473, 0.2587673232004407, -0.29618032481296047, -0.23085265207074343, 0.14648249856526813, 0.1164633041818536, 0.010663013379540174, -0.06385093367087745, -0.18952211175459407, 0.10372908197103008, -0.1795228676449868, -0.0805233875815306, -0.0509694822793526, 0.054283411001726505, 0.03970278707152653, -0.32271619093033577, 0.04885250440378103, 0.1381465047597885, 0.059082281310111284, -0.0005429381760017525, -0.09712470530141745, -0.04438339866277191, 0.08516581017794388, -0.022322129180294373, 0.048815917779481216, 0.0656878502923064, -0.1040119337623999, -0.12790407488993819, 0.33247998010577456, -0.1091907600301408, -0.22556817354333977, 0.17354169392192195, -0.10436235892496282, -0.2147209666549198, 0.041788242907533725, 0.1775419284784866, 0.19962609783115406, -0.14258200799926155, 0.09217679970653637, -0.06936783692048441, 0.18371610846154526, 0.10796269657270562, -0.05459337049884902, 0.1638938012183644, 0.1575843005688981, 0.15672010039129564, 0.1777242374467483, -0.03538135441786219, -0.04917649848146304, -0.3144933458327526, -0.1606273806668938, -0.1925810756567385, 0.09511463838298956, -0.11213852120389704, -0.20524253778820556, 0.4088237070808968, 0.10063821399929904, 0.24578131741333392, 0.14687430577713154, 0.2119100703407199, 0.13046830360361772, 0.017383668203687957, 0.09436524442336973, 0.15036683036915718, 0.12670983232918284, 0.03726113281933771, -0.1374543174320171, 0.06678123836736044, 0.12331056446888514] |
1,803.02137 | 9C spectral-index distributions and source-count estimates from 15 to 93
GHz - a re-assessment | In an earlier paper (2007), we used follow-up observations of a sample of
sources from the 9C survey at 15.2 GHz to derive a set of spectral-index
distributions up to a frequency of 90 GHz. These were based on simultaneous
measurements made at 15.2 GHz with the Ryle telescope and at 22 and 43 GHz with
the Karl G. Jansky Very Large Array (VLA). We used these distributions to make
empirical estimates of source counts at 22, 30, 43, 70 and 90 GHz. In a later
paper (2013), we took data at 15.7 GHz from the Arcminute Microkelvin Imager
(AMI) and data at 93.2 GHz from the Combined Array for Research in
Millimetre-wave Astronomy (CARMA) and estimated the source count at 93.2 GHz.
In this paper, we re-examine the data used in both papers and now believe that
the VLA flux densities we measured at 43 GHz were significantly in error, being
on average only about 70 per cent of their correct values. Here, we present
strong evidence for this conclusion and discuss the effect on the source-count
estimates made in the 2007 paper. The source-count prediction in the 2013 paper
is also revised. We make comparisons with spectral-index distributions and
source counts from other telescopes, in particular with a recent deep 95 GHz
source count measured by the South Pole Telescope. We investigate reasons for
the problem of the low VLA 43-GHz values and find a number of possible
contributory factors, but none is sufficient on its own to account for such a
large deficit.
| astro-ph.GA | in an earlier paper 2007 we used followup observations of a sample of sources from the 9c survey at 152 ghz to derive a set of spectralindex distributions up to a frequency of 90 ghz these were based on simultaneous measurements made at 152 ghz with the ryle telescope and at 22 and 43 ghz with the karl g jansky very large array vla we used these distributions to make empirical estimates of source counts at 22 30 43 70 and 90 ghz in a later paper 2013 we took data at 157 ghz from the arcminute microkelvin imager ami and data at 932 ghz from the combined array for research in millimetrewave astronomy carma and estimated the source count at 932 ghz in this paper we reexamine the data used in both papers and now believe that the vla flux densities we measured at 43 ghz were significantly in error being on average only about 70 per cent of their correct values here we present strong evidence for this conclusion and discuss the effect on the sourcecount estimates made in the 2007 paper the sourcecount prediction in the 2013 paper is also revised we make comparisons with spectralindex distributions and source counts from other telescopes in particular with a recent deep 95 ghz source count measured by the south pole telescope we investigate reasons for the problem of the low vla 43ghz values and find a number of possible contributory factors but none is sufficient on its own to account for such a large deficit | [['in', 'an', 'earlier', 'paper', '2007', 'we', 'used', 'followup', 'observations', 'of', 'a', 'sample', 'of', 'sources', 'from', 'the', '9c', 'survey', 'at', '152', 'ghz', 'to', 'derive', 'a', 'set', 'of', 'spectralindex', 'distributions', 'up', 'to', 'a', 'frequency', 'of', '90', 'ghz', 'these', 'were', 'based', 'on', 'simultaneous', 'measurements', 'made', 'at', '152', 'ghz', 'with', 'the', 'ryle', 'telescope', 'and', 'at', '22', 'and', '43', 'ghz', 'with', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'vla', 'we', 'used', 'these', 'distributions', 'to', 'make', 'empirical', 'estimates', 'of', 'source', 'counts', 'at', '22', '30', '43', '70', 'and', '90', 'ghz', 'in', 'a', 'later', 'paper', '2013', 'we', 'took', 'data', 'at', '157', 'ghz', 'from', 'the', 'arcminute', 'microkelvin', 'imager', 'ami', 'and', 'data', 'at', '932', 'ghz', 'from', 'the', 'combined', 'array', 'for', 'research', 'in', 'millimetrewave', 'astronomy', 'carma', 'and', 'estimated', 'the', 'source', 'count', 'at', '932', 'ghz', 'in', 'this', 'paper', 'we', 'reexamine', 'the', 'data', 'used', 'in', 'both', 'papers', 'and', 'now', 'believe', 'that', 'the', 'vla', 'flux', 'densities', 'we', 'measured', 'at', '43', 'ghz', 'were', 'significantly', 'in', 'error', 'being', 'on', 'average', 'only', 'about', '70', 'per', 'cent', 'of', 'their', 'correct', 'values', 'here', 'we', 'present', 'strong', 'evidence', 'for', 'this', 'conclusion', 'and', 'discuss', 'the', 'effect', 'on', 'the', 'sourcecount', 'estimates', 'made', 'in', 'the', '2007', 'paper', 'the', 'sourcecount', 'prediction', 'in', 'the', '2013', 'paper', 'is', 'also', 'revised', 'we', 'make', 'comparisons', 'with', 'spectralindex', 'distributions', 'and', 'source', 'counts', 'from', 'other', 'telescopes', 'in', 'particular', 'with', 'a', 'recent', 'deep', '95', 'ghz', 'source', 'count', 'measured', 'by', 'the', 'south', 'pole', 'telescope', 'we', 'investigate', 'reasons', 'for', 'the', 'problem', 'of', 'the', 'low', 'vla', '43ghz', 'values', 'and', 'find', 'a', 'number', 'of', 'possible', 'contributory', 'factors', 'but', 'none', 'is', 'sufficient', 'on', 'its', 'own', 'to', 'account', 'for', 'such', 'a', 'large', 'deficit']] | [-0.06005727267779548, 0.07604963601130521, -0.019339711671818804, 0.037305861564163934, -0.06519438289615209, -0.08016218233387917, 0.1226965473265409, 0.4214611434508697, -0.12744515181748284, -0.42349487430328736, 0.15957570555428902, -0.30696529323540744, -0.03896357184930821, 0.21132685513407523, -0.021323637920431793, 0.003649854406717168, 0.1044499377549073, -0.07604513984915684, -0.03293527293794796, -0.22897514668420627, 0.2210813033125305, 0.16008510122162534, 0.2762505687705925, 0.043527305311727105, 0.11865640071073358, -0.08294720903722919, -0.12687934577411397, -0.03239226715595578, -0.12152806161444119, 0.07612120444491666, 0.2787761899362522, 0.1199979400362281, 0.23506756954793673, -0.3502163966767, -0.1343786611359974, 0.0641772474920117, 0.05961581293638574, 0.07128025939687177, 0.03728503174352227, -0.30087594201177126, 0.07151073666318553, -0.18565025911448174, -0.1380295000890328, 0.053482998420804506, 0.057594786391973685, 0.013444149672068306, -0.22323962484551885, 0.10772925696517177, -0.0500336195274258, 0.1308481028827373, -0.10023320686150328, -0.2035503917504684, 0.03642033400319633, 0.10021967948523525, -0.04266178378361474, 0.10842629809326354, 0.05617253220270868, -0.09973910420376342, -0.07557164870195265, 0.31193311165407067, -0.10679369379340642, -0.04297514198515273, 0.19458036681044177, -0.22925373840007524, -0.2588520912104286, 0.14523027010301348, 0.19623233401216567, 0.0620675886585218, -0.15548388878187325, 0.0163510221617571, -0.02716873453800872, 0.25060360025463524, 0.11386288136418443, 0.03996331112466578, 0.23797883569204714, 0.08367332659418025, 0.041500466422803584, 0.15940091318339, -0.284809298133041, 0.02169368485715495, -0.2866174127598242, -0.07445430185543955, -0.1600584306561359, 0.11037300603811673, -0.06266112703218596, -0.036054427333283456, 0.37841945610853145, 0.15661743146756635, 0.20555215585864062, 0.08603561466225074, 0.2734101527275925, 0.04477956707097519, 0.0823923190118876, 0.12431744535206235, 0.29744568407841143, 0.1427702019964272, 0.13581757770316472, -0.12115849051224359, -0.01511928875288504, -0.08447999668351258] |
1,803.02138 | Transition from homogeneous to inhomogeneous limit cycles: Effect of
local filtering in coupled oscillators | We report an interesting symmetry-breaking transition in coupled identical
oscillators, namely the continuous transition from homogeneous to inhomogeneous
limit cycle oscillations. The observed transition is the oscillatory analog of
the Turing-type symmetry-breaking transition from amplitude death (i.e., stable
homogeneous steady state) to oscillation death (i.e., stable inhomogeneous
steady state). This novel transition occurs in the parametric zone of
occurrence of rhythmogenesis and oscillation death as a consequence of the
presence of local filtering in the coupling path. We consider paradigmatic
oscillators, such as Stuart-Landau and van der Pol oscillators under mean-field
coupling with low-pass or all-pass filtered self-feedback and through a
rigorous bifurcation analysis we explore the genesis of this transition.
Further, we experimentally demonstrate the observed transition, which
establishes its robustness in the presence of parameter fluctuations and noise.
| nlin.CD nlin.AO physics.app-ph | we report an interesting symmetrybreaking transition in coupled identical oscillators namely the continuous transition from homogeneous to inhomogeneous limit cycle oscillations the observed transition is the oscillatory analog of the turingtype symmetrybreaking transition from amplitude death ie stable homogeneous steady state to oscillation death ie stable inhomogeneous steady state this novel transition occurs in the parametric zone of occurrence of rhythmogenesis and oscillation death as a consequence of the presence of local filtering in the coupling path we consider paradigmatic oscillators such as stuartlandau and van der pol oscillators under meanfield coupling with lowpass or allpass filtered selffeedback and through a rigorous bifurcation analysis we explore the genesis of this transition further we experimentally demonstrate the observed transition which establishes its robustness in the presence of parameter fluctuations and noise | [['we', 'report', 'an', 'interesting', 'symmetrybreaking', 'transition', 'in', 'coupled', 'identical', 'oscillators', 'namely', 'the', 'continuous', 'transition', 'from', 'homogeneous', 'to', 'inhomogeneous', 'limit', 'cycle', 'oscillations', 'the', 'observed', 'transition', 'is', 'the', 'oscillatory', 'analog', 'of', 'the', 'turingtype', 'symmetrybreaking', 'transition', 'from', 'amplitude', 'death', 'ie', 'stable', 'homogeneous', 'steady', 'state', 'to', 'oscillation', 'death', 'ie', 'stable', 'inhomogeneous', 'steady', 'state', 'this', 'novel', 'transition', 'occurs', 'in', 'the', 'parametric', 'zone', 'of', 'occurrence', 'of', 'rhythmogenesis', 'and', 'oscillation', 'death', 'as', 'a', 'consequence', 'of', 'the', 'presence', 'of', 'local', 'filtering', 'in', 'the', 'coupling', 'path', 'we', 'consider', 'paradigmatic', 'oscillators', 'such', 'as', 'stuartlandau', 'and', 'van', 'der', 'pol', 'oscillators', 'under', 'meanfield', 'coupling', 'with', 'lowpass', 'or', 'allpass', 'filtered', 'selffeedback', 'and', 'through', 'a', 'rigorous', 'bifurcation', 'analysis', 'we', 'explore', 'the', 'genesis', 'of', 'this', 'transition', 'further', 'we', 'experimentally', 'demonstrate', 'the', 'observed', 'transition', 'which', 'establishes', 'its', 'robustness', 'in', 'the', 'presence', 'of', 'parameter', 'fluctuations', 'and', 'noise']] | [-0.21592517778850517, 0.21337593365203178, -0.02280952879227698, 0.020116640264705683, -0.014585645468189166, -0.1594682157648584, 0.09431915401409452, 0.3053168948077095, -0.2643981787197005, -0.21311876031641777, 0.08912238483138096, -0.24963116425161178, -0.23849893750515408, 0.12398309008254169, 0.009970273580760337, 0.01794659739601999, 0.021068166808869977, 0.030326195781190807, -0.024755014231106123, -0.11605572137587632, 0.3207011975742017, 0.00991314254128016, 0.32707683044449926, -0.05573353565235336, 0.09454878255581627, -0.029598789010196924, 0.0775590882027665, -0.015186621829007681, -0.1899650914479235, -0.021348493725347976, 0.21830371109625468, 0.018488007023608168, 0.2559144258176765, -0.40229059788756644, -0.22416090093409785, 0.14500639827814527, 0.1662419801004804, 0.18837601759094888, -0.029291804692743777, -0.34451939570359313, -0.05207473241831534, -0.16703281048685312, -0.15402307546196076, -0.08970369566769268, 0.01661802255190336, 0.055071660571803266, -0.27766973245351645, 0.1882845938205719, 0.09341909855675812, 0.07741668335556125, -0.059248590781890716, 0.0007791038316029769, -0.06722525195576824, 0.11422804480490203, -0.010875649419792284, -0.046671601443981324, 0.12790832018408066, -0.0978741387048593, -0.09641824496480135, 0.3283511133752584, -0.147774190050908, -0.08120407547371891, 0.2023015042193807, -0.15848877058865932, -0.09880253024614201, 0.1463453208293336, 0.14706379628668612, 0.039026766381441404, -0.09822992197452829, 0.012234416075695592, 0.06129091183583324, 0.13940043688859216, 0.10769775342196226, 0.016999632919816158, 0.18897851701773247, 0.23763668961428966, 0.06667305226079547, 0.21535577068906814, -0.07733063674487102, -0.17371189107115453, -0.2965663825269215, -0.06808381248265505, -0.15420858099376067, 0.10189800180512695, -0.0723914610002584, -0.2478804155611075, 0.42826262512602487, 0.14572346422266072, 0.17979701332604656, -0.009731591004842463, 0.23584686207692496, 0.15972556948052863, -0.03115336172408066, 0.01129069236250451, 0.3178467724472284, 0.1938343855391185, 0.10333828596183314, -0.3036035010035938, 0.037061534624976605, 0.03305922432157856] |
1,803.02139 | Connecting Randomized Response, Post-Randomization, Differential Privacy
and t-Closeness via Deniability and Permutation | We explore some novel connections between the main privacy models in use and
we recall a few known ones. We show these models to be more related than
commonly understood, around two main principles: deniability and permutation.
In particular, randomized response turns out to be very modern in spite of it
having been introduced over 50 years ago: it is a local anonymization method
and it allows understanding the protection offered by $\epsilon$-differential
privacy when $\epsilon$ is increased to improve utility. A similar
understanding on the effect of large $\epsilon$ in terms of deniability is
obtained from the connection between $\epsilon$-differential privacy and
t-closeness. Finally, the post-randomization method (PRAM) is shown to be
viewable as permutation and to be connected with randomized response and
differential privacy. Since the latter is also connected with t-closeness, it
follows that the permutation principle can explain the guarantees offered by
all those models. Thus, calibrating permutation is very relevant in
anonymization, and we conclude by sketching two ways of doing it.
| cs.CR | we explore some novel connections between the main privacy models in use and we recall a few known ones we show these models to be more related than commonly understood around two main principles deniability and permutation in particular randomized response turns out to be very modern in spite of it having been introduced over 50 years ago it is a local anonymization method and it allows understanding the protection offered by epsilondifferential privacy when epsilon is increased to improve utility a similar understanding on the effect of large epsilon in terms of deniability is obtained from the connection between epsilondifferential privacy and tcloseness finally the postrandomization method pram is shown to be viewable as permutation and to be connected with randomized response and differential privacy since the latter is also connected with tcloseness it follows that the permutation principle can explain the guarantees offered by all those models thus calibrating permutation is very relevant in anonymization and we conclude by sketching two ways of doing it | [['we', 'explore', 'some', 'novel', 'connections', 'between', 'the', 'main', 'privacy', 'models', 'in', 'use', 'and', 'we', 'recall', 'a', 'few', 'known', 'ones', 'we', 'show', 'these', 'models', 'to', 'be', 'more', 'related', 'than', 'commonly', 'understood', 'around', 'two', 'main', 'principles', 'deniability', 'and', 'permutation', 'in', 'particular', 'randomized', 'response', 'turns', 'out', 'to', 'be', 'very', 'modern', 'in', 'spite', 'of', 'it', 'having', 'been', 'introduced', 'over', '50', 'years', 'ago', 'it', 'is', 'a', 'local', 'anonymization', 'method', 'and', 'it', 'allows', 'understanding', 'the', 'protection', 'offered', 'by', 'epsilondifferential', 'privacy', 'when', 'epsilon', 'is', 'increased', 'to', 'improve', 'utility', 'a', 'similar', 'understanding', 'on', 'the', 'effect', 'of', 'large', 'epsilon', 'in', 'terms', 'of', 'deniability', 'is', 'obtained', 'from', 'the', 'connection', 'between', 'epsilondifferential', 'privacy', 'and', 'tcloseness', 'finally', 'the', 'postrandomization', 'method', 'pram', 'is', 'shown', 'to', 'be', 'viewable', 'as', 'permutation', 'and', 'to', 'be', 'connected', 'with', 'randomized', 'response', 'and', 'differential', 'privacy', 'since', 'the', 'latter', 'is', 'also', 'connected', 'with', 'tcloseness', 'it', 'follows', 'that', 'the', 'permutation', 'principle', 'can', 'explain', 'the', 'guarantees', 'offered', 'by', 'all', 'those', 'models', 'thus', 'calibrating', 'permutation', 'is', 'very', 'relevant', 'in', 'anonymization', 'and', 'we', 'conclude', 'by', 'sketching', 'two', 'ways', 'of', 'doing', 'it']] | [-0.09002301782442111, 0.04344720362468126, -0.07329277286562555, 0.11351295961150733, -0.08970899419011381, -0.19358440807289973, 0.06667069736087394, 0.390158566618394, -0.2966197216046784, -0.3481459619120477, 0.10999067335858004, -0.27086103054658933, -0.19479346344272555, 0.21473306241482887, -0.14573023324514445, 0.04163212667659907, 0.013841796354083958, 0.027579288344138753, -0.039414768390257114, -0.3110281189647085, 0.30053865323177803, 0.05822052959419653, 0.27801310140528007, 0.05778251520303478, 0.06207948337182888, -0.03444165163422505, -0.05798187767556997, 0.0637377893529877, -0.08148323059162023, 0.10911835968622681, 0.2642341990187103, 0.18364929383994263, 0.3012562764691423, -0.3894423200765591, -0.16140236344723824, 0.10391473751807931, 0.1213772022499965, 0.10992199452705458, -0.059500913973357446, -0.26577132541831294, 0.13391696866099795, -0.18563091557355832, -0.07830967322447822, -0.1263363662288764, 0.0025946145938586687, -0.008325708193514875, -0.24817653700798573, 0.010220602203354318, 0.06934326030397621, 0.04491806016610322, 0.014870751848162715, -0.10205138371950628, 0.00418283117511226, 0.11680694693691811, 0.09195263711958677, 0.031536376687926714, 0.07682504534475997, -0.10104584165787447, -0.12193255596041322, 0.3779499932655139, -0.018489500660050003, -0.1811017572285864, 0.1824214380293036, -0.11502452677361176, -0.15109223560402227, 0.06867011347217457, 0.12915024466876743, 0.0969438234338548, -0.18012908756815546, 0.04947123553047603, -0.051966341625073714, 0.1444121287218267, 0.09005977511182874, 0.039312685773607546, 0.1489077989725831, 0.1753363999911768, 0.09361937154129059, 0.10146979907036809, -0.017700592028729974, -0.11323302075361644, -0.2508926936676224, -0.1412784234372464, -0.14854303578508762, 0.05665186025525728, -0.07559525069000247, -0.07404721238839294, 0.3732496155481674, 0.19906283758892984, 0.19364757413702632, 0.06222951432835021, 0.311590627827096, 0.09992538965488422, 0.10780966914297935, 0.0979793028108508, 0.2328474366360185, 0.12837050000378517, 0.054854700625539494, -0.14864809993336614, 0.16962260901258736, 0.018123421472257484] |
1,803.0214 | Conceptualization of Object Compositions Using Persistent Homology | A topological shape analysis is proposed and utilized to learn concepts that
reflect shape commonalities. Our approach is two-fold: i) a spatial topology
analysis of point cloud segment constellations within objects. Therein
constellations are decomposed and described in an hierarchical manner - from
single segments to segment groups until a single group reflects an entire
object. ii) a topology analysis of the description space in which segment
decompositions are exposed in. Inspired by Persistent Homology, hidden groups
of shape commonalities are revealed from object segment decompositions.
Experiments show that extracted persistent groups of commonalities can
represent semantically meaningful shape concepts. We also show the
generalization capability of the proposed approach considering samples of
external datasets.
| cs.CV cs.RO | a topological shape analysis is proposed and utilized to learn concepts that reflect shape commonalities our approach is twofold i a spatial topology analysis of point cloud segment constellations within objects therein constellations are decomposed and described in an hierarchical manner from single segments to segment groups until a single group reflects an entire object ii a topology analysis of the description space in which segment decompositions are exposed in inspired by persistent homology hidden groups of shape commonalities are revealed from object segment decompositions experiments show that extracted persistent groups of commonalities can represent semantically meaningful shape concepts we also show the generalization capability of the proposed approach considering samples of external datasets | [['a', 'topological', 'shape', 'analysis', 'is', 'proposed', 'and', 'utilized', 'to', 'learn', 'concepts', 'that', 'reflect', 'shape', 'commonalities', 'our', 'approach', 'is', 'twofold', 'i', 'a', 'spatial', 'topology', 'analysis', 'of', 'point', 'cloud', 'segment', 'constellations', 'within', 'objects', 'therein', 'constellations', 'are', 'decomposed', 'and', 'described', 'in', 'an', 'hierarchical', 'manner', 'from', 'single', 'segments', 'to', 'segment', 'groups', 'until', 'a', 'single', 'group', 'reflects', 'an', 'entire', 'object', 'ii', 'a', 'topology', 'analysis', 'of', 'the', 'description', 'space', 'in', 'which', 'segment', 'decompositions', 'are', 'exposed', 'in', 'inspired', 'by', 'persistent', 'homology', 'hidden', 'groups', 'of', 'shape', 'commonalities', 'are', 'revealed', 'from', 'object', 'segment', 'decompositions', 'experiments', 'show', 'that', 'extracted', 'persistent', 'groups', 'of', 'commonalities', 'can', 'represent', 'semantically', 'meaningful', 'shape', 'concepts', 'we', 'also', 'show', 'the', 'generalization', 'capability', 'of', 'the', 'proposed', 'approach', 'considering', 'samples', 'of', 'external', 'datasets']] | [-0.1223094844741322, 0.039388392539541725, -0.13224856381247377, 0.08572920841540684, -0.08200456806164431, -0.11643445601262022, 0.03598245681394218, 0.45510821988838807, -0.3199115231379932, -0.3336358822130582, 0.03642402207499305, -0.26904210512804094, -0.20011957209933093, 0.15275283531988398, -0.13340929750426622, -0.02949333670518459, 0.08540774289959747, 0.03518048405398108, -0.054989511232921166, -0.19561855377335297, 0.32440934927415166, -0.0033618720869223275, 0.33665529903220504, -0.03973480884247182, 0.07606704408923785, -0.018660819590941333, -0.10065869092374526, 0.04725380802681269, -0.07515217838137464, 0.16769511937245465, 0.3016153841295786, 0.15327377856214808, 0.19921208110539929, -0.4037857225262805, -0.2370411502728402, 0.06629413032185352, 0.1612609285328194, 0.06881788890543823, -0.026518885274989565, -0.36761744828535275, 0.09773247248672864, -0.13174137773743846, -0.09222493622566394, -0.1145282636249536, 0.03849765109388452, 0.013068334260759385, -0.17875653454470203, 0.013188429245992825, 0.08013924946109846, 0.06118968464579666, -0.09739303512073923, -0.06409117694956397, -0.02175196552069106, 0.1987041698997481, -0.0038294419932195494, 0.0176312275386105, 0.16795067888635554, -0.13411779457441808, -0.14274909795903226, 0.3616883440776483, 0.003921313064270898, -0.2139313641951926, 0.15979850696595876, -0.10316667686167516, -0.1835572125406511, 0.1614808821478826, 0.1574238627534278, 0.10323239113980283, -0.12350286299101355, 0.027627011901035746, -0.07872260111923281, 0.21997967563501125, 0.039613569298301614, -0.0009765380650366607, 0.25899974202835246, 0.1947583978946664, 0.02943228459671924, 0.17264017430052422, -0.10988761383321202, -0.11107796343991108, -0.269652146748022, -0.0870851195976955, -0.1781840122043433, -0.040089490947011336, -0.07922488821363036, -0.16073833557068914, 0.4147207717525593, 0.13479799649416746, 0.24629909907091865, 0.03391163650054583, 0.27003326830699254, -0.003558251446137499, 0.1002008799553375, 0.06017623096704483, 0.13161457638795437, 0.07859839961185985, 0.03166148399427664, -0.12529941655699522, 0.07084583955114349, 0.10647301247604844] |
1,803.02141 | A note on joint functional convergence of partial sum and maxima for
linear processes | Recently, for the joint partial sum and partial maxima processes constructed
from linear processes with independent identically distributed innovations that
are regularly varying with tail index $\alpha \in (0, 2)$, a functional limit
theorem with the Skorohod weak $M_{2}$ topology has been obtained. In this
paper we show that, if all the coefficients of the linear processes are of the
same sign, the functional convergence holds in the stronger topology, i.e. in
the Skorohod weak $M_{1}$ topology on the space of $\mathbb{R}^{2}$--valued
c\`{a}dl\`{a}g functions on $[0, 1]$.
| math.PR | recently for the joint partial sum and partial maxima processes constructed from linear processes with independent identically distributed innovations that are regularly varying with tail index alpha in 0 2 a functional limit theorem with the skorohod weak m_2 topology has been obtained in this paper we show that if all the coefficients of the linear processes are of the same sign the functional convergence holds in the stronger topology ie in the skorohod weak m_1 topology on the space of mathbbr2valued cadlag functions on 0 1 | [['recently', 'for', 'the', 'joint', 'partial', 'sum', 'and', 'partial', 'maxima', 'processes', 'constructed', 'from', 'linear', 'processes', 'with', 'independent', 'identically', 'distributed', 'innovations', 'that', 'are', 'regularly', 'varying', 'with', 'tail', 'index', 'alpha', 'in', '0', '2', 'a', 'functional', 'limit', 'theorem', 'with', 'the', 'skorohod', 'weak', 'm_2', 'topology', 'has', 'been', 'obtained', 'in', 'this', 'paper', 'we', 'show', 'that', 'if', 'all', 'the', 'coefficients', 'of', 'the', 'linear', 'processes', 'are', 'of', 'the', 'same', 'sign', 'the', 'functional', 'convergence', 'holds', 'in', 'the', 'stronger', 'topology', 'ie', 'in', 'the', 'skorohod', 'weak', 'm_1', 'topology', 'on', 'the', 'space', 'of', 'mathbbr2valued', 'cadlag', 'functions', 'on', '0', '1']] | [-0.17038645516096176, 0.14607557432790255, -0.0447335459891407, 0.05814590585958641, -0.021824718891889198, -0.09901760492859216, 0.029765346688325464, 0.38378023458965893, -0.32434034171974524, -0.18705293103709988, 0.10424583427736471, -0.2783663600908014, -0.13989117092067568, 0.1467576715345869, -0.043697213383402204, 0.06005316307960913, 0.019675245144586455, 0.04390758034055946, -0.07289967951953583, -0.2301243868624342, 0.3650443370563738, -0.03318083013311542, 0.2412883041469359, -0.007881540387611964, 0.10937388195527782, 0.07135168400903542, -0.030294467240100962, -0.008504951881557896, -0.15533163157193358, 0.07770614082263996, 0.2170647519758378, 0.060441731890692275, 0.2701263887722088, -0.4011186434427041, -0.18207569083134675, 0.12767854733285547, 0.10463245943103028, -0.05676888005444031, -0.004222963907188554, -0.2884791907319135, 0.14881685747090598, -0.11182404564286785, -0.11179600903314763, -0.023424672267945677, 0.05289679007797406, 0.1189008077135545, -0.33823713080036916, 0.09551436909014123, 0.12226948150615582, 0.017880550315389515, -0.05763247197804352, -0.16197569616508253, -0.05659637376987215, 0.12493036178358156, 0.10947692456344764, 0.030430921401571612, 0.045847761724411844, -0.058400797617525375, -0.11373672987623461, 0.28117725042219477, -0.11963080268503092, -0.24007357038214974, 0.15887487526105223, -0.2331280425383613, -0.21786652993673095, 0.1197698460543935, 0.13410318292805862, 0.12995744471962767, -0.13255336503070062, 0.23467795949512235, -0.04047422083201765, 0.14270889452904806, 0.07005987862317727, 0.026416174532181914, 0.10864949743959239, 0.09013797528506524, 0.15218211342205948, 0.07856386304222818, -0.03184369938105516, -0.10885662885232904, -0.31708773291916, -0.11726700422493205, -0.1801751555417311, 0.10571034993419702, -0.15855903135416574, -0.1683014750844617, 0.31394044812982796, 0.062323952024138866, 0.21913527636005992, 0.11488048502126302, 0.22279002393285433, 0.18747170590635004, -0.019499928005382246, 0.06718247900877533, 0.18846383599039895, 0.15252749589753561, 0.09062581985717875, -0.1147651514419804, 0.0997784342349175, 0.09045392143722067] |
1,803.02142 | Nuclear quantum shape-phase transitions in odd-mass systems | Microscopic signatures of nuclear ground-state shape phase transitions in
odd-mass Eu isotopes are explored starting from excitation spectra and
collective wave functions obtained by diagonalization of a core-quasiparticle
coupling Hamiltonian based on energy density functionals. As functions of the
physical control parameter -- the number of nucleons -- theoretical low-energy
spectra, two-neutron separation energies, charge isotope shifts, spectroscopic
quadrupole moments, and $E2$ reduced transition matrix elements accurately
reproduce available data, and exhibit more pronounced discontinuities at
neutron number $N=90$, compared to the adjacent even-even Sm and Gd isotopes.
The enhancement of the first-order quantum phase transition in odd-mass systems
can be attributed to a shape polarization effect of the unpaired proton which,
at the critical neutron number, starts predominantly coupling to Gd core nuclei
that are characterized by larger quadrupole deformation and weaker proton
pairing correlations compared to the corresponding Sm isotopes.
| nucl-th nucl-ex | microscopic signatures of nuclear groundstate shape phase transitions in oddmass eu isotopes are explored starting from excitation spectra and collective wave functions obtained by diagonalization of a corequasiparticle coupling hamiltonian based on energy density functionals as functions of the physical control parameter the number of nucleons theoretical lowenergy spectra twoneutron separation energies charge isotope shifts spectroscopic quadrupole moments and e2 reduced transition matrix elements accurately reproduce available data and exhibit more pronounced discontinuities at neutron number n90 compared to the adjacent eveneven sm and gd isotopes the enhancement of the firstorder quantum phase transition in oddmass systems can be attributed to a shape polarization effect of the unpaired proton which at the critical neutron number starts predominantly coupling to gd core nuclei that are characterized by larger quadrupole deformation and weaker proton pairing correlations compared to the corresponding sm isotopes | [['microscopic', 'signatures', 'of', 'nuclear', 'groundstate', 'shape', 'phase', 'transitions', 'in', 'oddmass', 'eu', 'isotopes', 'are', 'explored', 'starting', 'from', 'excitation', 'spectra', 'and', 'collective', 'wave', 'functions', 'obtained', 'by', 'diagonalization', 'of', 'a', 'corequasiparticle', 'coupling', 'hamiltonian', 'based', 'on', 'energy', 'density', 'functionals', 'as', 'functions', 'of', 'the', 'physical', 'control', 'parameter', 'the', 'number', 'of', 'nucleons', 'theoretical', 'lowenergy', 'spectra', 'twoneutron', 'separation', 'energies', 'charge', 'isotope', 'shifts', 'spectroscopic', 'quadrupole', 'moments', 'and', 'e2', 'reduced', 'transition', 'matrix', 'elements', 'accurately', 'reproduce', 'available', 'data', 'and', 'exhibit', 'more', 'pronounced', 'discontinuities', 'at', 'neutron', 'number', 'n90', 'compared', 'to', 'the', 'adjacent', 'eveneven', 'sm', 'and', 'gd', 'isotopes', 'the', 'enhancement', 'of', 'the', 'firstorder', 'quantum', 'phase', 'transition', 'in', 'oddmass', 'systems', 'can', 'be', 'attributed', 'to', 'a', 'shape', 'polarization', 'effect', 'of', 'the', 'unpaired', 'proton', 'which', 'at', 'the', 'critical', 'neutron', 'number', 'starts', 'predominantly', 'coupling', 'to', 'gd', 'core', 'nuclei', 'that', 'are', 'characterized', 'by', 'larger', 'quadrupole', 'deformation', 'and', 'weaker', 'proton', 'pairing', 'correlations', 'compared', 'to', 'the', 'corresponding', 'sm', 'isotopes']] | [-0.06870507969430534, 0.2598725541925272, -0.01954688256097247, 0.14040419819811695, 0.014837609456597472, -0.12139428418595344, 0.05560045210282794, 0.3431445490166867, -0.20916111211513552, -0.30127554892716435, -0.10093823464406426, -0.37296830349863114, -0.018895730788146544, 0.10163406932579098, 0.10970442946464252, 0.017213838178289236, 0.015906663080543386, 0.03723432943425912, -0.16301156755824903, -0.11093718494814586, 0.29385916252533417, 0.08755127591895033, 0.2776563006902127, 0.03827956245656011, -0.022357587179122156, -0.013692422580684153, 0.09777644401241978, -0.018214967678026328, -0.10559586877458295, 0.05835361818434577, 0.3002990060167642, 0.013176873103521175, 0.11415095791126863, -0.44647677126508073, -0.1665653870139512, 0.09104931848659682, 0.16900978385799115, 0.1465848888858496, -0.07183327123310447, -0.308786228754752, 0.004542603934679529, -0.2140918251716619, -0.1438134962210445, -0.1511988968424258, 0.032560616399985635, 0.09281529642963152, -0.26369868368982413, 0.09741769370743536, -0.0016397867827481931, 0.10307692215114618, -0.11891807089459232, -0.2488691175503911, -0.0912290263163904, 0.02870319656217002, 0.0868528312902978, 0.023528653627475925, 0.20839122651319067, -0.06029301224881113, -0.04053134896135856, 0.389765017351015, -0.0056016766114441825, -0.06094912716971456, 0.10502924392060142, -0.204950440294786, -0.12049798092117245, 0.26178870868380016, 0.12449772297107387, 0.11299363551192361, -0.12123852474078965, 0.06345466617955457, 0.07090096212615737, 0.2155447763678946, 0.052490726933042395, 0.0893939387207355, 0.21013127814763957, 0.14294477873783318, 0.009710373584743885, 0.048235851108002735, -0.15236541259491132, -0.11622756858450099, -0.259170149647289, -0.04194055316909451, -0.201340143123253, 0.01873298290823402, -0.07704341359611973, -0.12635952710042533, 0.3919708615825545, 0.03883175514705425, 0.18498875502423257, -0.05859919210055026, 0.23647706487999975, 0.09775895987747894, 0.07389141545022114, -0.008624564891466669, 0.3222855604035954, 0.24014022477681365, 0.07434080970446787, -0.3508983475538038, 0.06265269033610821, 0.07133746582833822] |
1,803.02143 | A comparison of semi-Lagrangian discontinuous Galerkin and spline based
Vlasov solvers in four dimensions | The purpose of the present paper is to compare two semi-Lagrangian methods in
the context of the four-dimensional Vlasov--Poisson equation. More
specifically, our goal is to compare the performance of the more recently
developed semi-Lagrangian discontinuous Galerkin scheme with the de facto
standard in Eulerian Vlasov simulation (i.e. using cubic spline interpolation).
To that end, we perform simulations for nonlinear Landau damping and a
two-stream instability and provide benchmarks for the SeLaLib and sldg codes
(both on a workstation and using MPI on a cluster).
We find that the semi-Lagrangian discontinuous Galerkin scheme shows a
moderate improvement in run time for nonlinear Landau damping and a substantial
improvement for the two-stream instability. It should be emphasized that these
results are markedly different from results obtained in the asymptotic regime
(which favor spline interpolation). Thus, we conclude that the traditional
approach of evaluating numerical methods is misleading, even for short time
simulations. In addition, the absence of any All-to-All communication in the
semi-Lagrangian discontinuous Galerkin method gives it a decisive advantage for
scaling to more than 256 cores.
| math.NA cs.NA physics.comp-ph | the purpose of the present paper is to compare two semilagrangian methods in the context of the fourdimensional vlasovpoisson equation more specifically our goal is to compare the performance of the more recently developed semilagrangian discontinuous galerkin scheme with the de facto standard in eulerian vlasov simulation ie using cubic spline interpolation to that end we perform simulations for nonlinear landau damping and a twostream instability and provide benchmarks for the selalib and sldg codes both on a workstation and using mpi on a cluster we find that the semilagrangian discontinuous galerkin scheme shows a moderate improvement in run time for nonlinear landau damping and a substantial improvement for the twostream instability it should be emphasized that these results are markedly different from results obtained in the asymptotic regime which favor spline interpolation thus we conclude that the traditional approach of evaluating numerical methods is misleading even for short time simulations in addition the absence of any alltoall communication in the semilagrangian discontinuous galerkin method gives it a decisive advantage for scaling to more than 256 cores | [['the', 'purpose', 'of', 'the', 'present', 'paper', 'is', 'to', 'compare', 'two', 'semilagrangian', 'methods', 'in', 'the', 'context', 'of', 'the', 'fourdimensional', 'vlasovpoisson', 'equation', 'more', 'specifically', 'our', 'goal', 'is', 'to', 'compare', 'the', 'performance', 'of', 'the', 'more', 'recently', 'developed', 'semilagrangian', 'discontinuous', 'galerkin', 'scheme', 'with', 'the', 'de', 'facto', 'standard', 'in', 'eulerian', 'vlasov', 'simulation', 'ie', 'using', 'cubic', 'spline', 'interpolation', 'to', 'that', 'end', 'we', 'perform', 'simulations', 'for', 'nonlinear', 'landau', 'damping', 'and', 'a', 'twostream', 'instability', 'and', 'provide', 'benchmarks', 'for', 'the', 'selalib', 'and', 'sldg', 'codes', 'both', 'on', 'a', 'workstation', 'and', 'using', 'mpi', 'on', 'a', 'cluster', 'we', 'find', 'that', 'the', 'semilagrangian', 'discontinuous', 'galerkin', 'scheme', 'shows', 'a', 'moderate', 'improvement', 'in', 'run', 'time', 'for', 'nonlinear', 'landau', 'damping', 'and', 'a', 'substantial', 'improvement', 'for', 'the', 'twostream', 'instability', 'it', 'should', 'be', 'emphasized', 'that', 'these', 'results', 'are', 'markedly', 'different', 'from', 'results', 'obtained', 'in', 'the', 'asymptotic', 'regime', 'which', 'favor', 'spline', 'interpolation', 'thus', 'we', 'conclude', 'that', 'the', 'traditional', 'approach', 'of', 'evaluating', 'numerical', 'methods', 'is', 'misleading', 'even', 'for', 'short', 'time', 'simulations', 'in', 'addition', 'the', 'absence', 'of', 'any', 'alltoall', 'communication', 'in', 'the', 'semilagrangian', 'discontinuous', 'galerkin', 'method', 'gives', 'it', 'a', 'decisive', 'advantage', 'for', 'scaling', 'to', 'more', 'than', '256', 'cores']] | [-0.1052413823338363, 0.022268767706753515, -0.13429265335964208, 0.08124377426826289, -0.061239479609701615, -0.15161978381961075, 0.008390320548972919, 0.3635417374104939, -0.2155190744617192, -0.2600326740331101, 0.0911947857100379, -0.20769976214929062, -0.13525259775236587, 0.239171159226151, -0.039106212026540146, 0.0830010055162182, 0.11940814842819236, -0.07467039875452676, -0.10467542364627165, -0.25636207597033883, 0.28907142813973635, 0.07050842818518338, 0.2884799999486528, 0.015328426633707502, 0.09646376522273799, -0.06457238158062947, -0.04894610011780804, 0.029568165318447758, -0.10715084920444827, 0.06582908261969517, 0.2521803687314704, 0.04431072082793848, 0.3316368189830841, -0.4406992276040414, -0.23987910174764693, 0.04931172217369418, 0.173271542432882, 0.15054758093835766, -0.06822461952494698, -0.23829593120238066, 0.10796775345939254, -0.20100117963606448, -0.10447949569788761, -0.10881705450116318, -0.028016589558154174, 0.010502206727820025, -0.31995038476849336, 0.10582640025214377, 0.043553305498128546, 0.05858622664395212, -0.05041009716660483, -0.1133513689829587, 0.020861242176827298, 0.04496973683446661, -0.0065101397432789036, 0.036936906409788535, 0.013035304137950086, -0.09719955789676699, -0.11639626284026731, 0.41910962002690544, -0.10073285886863398, -0.260791369269348, 0.23737479678609155, -0.10978197648364585, -0.11512651410620575, 0.13845721349108234, 0.18187976359728386, 0.1303286328129616, -0.08402666714391671, 0.05931749741847108, 0.005233023691372099, 0.17009641841022213, 0.06333048819744197, -0.020614360019945623, 0.08468979472606654, 0.20017225778693418, 0.057060740433040665, 0.10103742971180261, -0.09973140911791813, -0.15033530055106067, -0.2872303106441078, -0.16282080066792498, -0.16493080981970046, -0.0483956917331935, -0.13604267019821814, -0.1826083742780611, 0.3825553113963658, 0.23239195163213563, 0.097290086081061, 0.09727904969754904, 0.332445592936975, 0.13255285804585915, 0.035579739313106984, 0.1208971713362685, 0.24421291509696114, 0.10063253097045659, 0.1371955038048327, -0.2499009377378653, 0.013940867355400273, 0.14190253216127696] |
1,803.02144 | Dark Matter Direct Detection from new interactions in models with
spin-two mediators | We consider models where a massive spin-two resonance acts as the mediator
between Dark Matter (DM) and the SM particles through the energy-momentum
tensor. We examine the effective theory for fermion, vector and scalar DM
generated in these models and find novel types of DM-SM interaction never
considered before. We identify the effective interactions between DM and the SM
quarks when the mediator is integrated out, and match them to the gravitational
form factors relevant for spin-independent DM-nucleon scattering. We also
discuss the interplay between DM relic density conditions, direct detection
bounds and collider searches for the spin-two mediator.
| hep-ph | we consider models where a massive spintwo resonance acts as the mediator between dark matter dm and the sm particles through the energymomentum tensor we examine the effective theory for fermion vector and scalar dm generated in these models and find novel types of dmsm interaction never considered before we identify the effective interactions between dm and the sm quarks when the mediator is integrated out and match them to the gravitational form factors relevant for spinindependent dmnucleon scattering we also discuss the interplay between dm relic density conditions direct detection bounds and collider searches for the spintwo mediator | [['we', 'consider', 'models', 'where', 'a', 'massive', 'spintwo', 'resonance', 'acts', 'as', 'the', 'mediator', 'between', 'dark', 'matter', 'dm', 'and', 'the', 'sm', 'particles', 'through', 'the', 'energymomentum', 'tensor', 'we', 'examine', 'the', 'effective', 'theory', 'for', 'fermion', 'vector', 'and', 'scalar', 'dm', 'generated', 'in', 'these', 'models', 'and', 'find', 'novel', 'types', 'of', 'dmsm', 'interaction', 'never', 'considered', 'before', 'we', 'identify', 'the', 'effective', 'interactions', 'between', 'dm', 'and', 'the', 'sm', 'quarks', 'when', 'the', 'mediator', 'is', 'integrated', 'out', 'and', 'match', 'them', 'to', 'the', 'gravitational', 'form', 'factors', 'relevant', 'for', 'spinindependent', 'dmnucleon', 'scattering', 'we', 'also', 'discuss', 'the', 'interplay', 'between', 'dm', 'relic', 'density', 'conditions', 'direct', 'detection', 'bounds', 'and', 'collider', 'searches', 'for', 'the', 'spintwo', 'mediator']] | [-0.12980111658742483, 0.23791536835558486, -0.05646120998926103, 0.20325649248770053, -0.11582753577533018, -0.1631683550746829, 0.016316993635928617, 0.3252612664693534, -0.21321441007853306, -0.33707214874977415, -0.045598571505068304, -0.2914257114941273, -0.09852245686143035, 0.10432097265929585, 0.15855720968013912, -0.006725218297556193, 0.0009203919678728914, 0.0753868670400345, -0.04193638141897291, -0.25116717927581206, 0.32027217214268566, 0.015898491571083515, 0.19097300791040514, 0.12624780295623672, 0.08973980422079977, 0.0818943732483971, -0.04384751258079301, -0.10230043381358488, -0.13232346075690454, 0.06561370688311831, 0.19693257211335063, 0.08626037545859663, 0.11011554890857878, -0.4243976769009323, -0.1885195721053716, 0.20561158456228146, 0.15842018518926143, 0.09181125724048476, -0.09780612918124958, -0.3761708587972504, 0.07325589402597586, -0.2464766637469181, -0.07078853895831289, -0.06591224032124937, -0.004685869515694753, -0.08920452138879384, -0.325931613954405, 0.11620175819097303, -0.05410261629055245, -0.06303785044248357, -0.06963385870172219, -0.1581132555961952, -0.03263793841963916, -0.000177084723184111, 0.14874341838518063, -0.07582156086984947, 0.23330305152657357, -0.2533261073245244, -0.08875741821953631, 0.3918345025317235, -0.17269208458619137, -0.20090086221920722, 0.22132291143167426, -0.08922504956335431, -0.10797766426482915, 0.03500692370451159, 0.21162653304260187, 0.05517039393813283, -0.17046284593592959, 0.17760595159647477, -0.04257993266160478, 0.14846929273041284, 0.0497866247244405, 0.05346639894626357, 0.3499707801813128, 0.14804807252419944, 0.06911345083511086, 0.047938067240245415, -0.07913039149887004, -0.07117296432290753, -0.39356545138765464, -0.16977890642980734, -0.06865514174216625, -0.017202672736738065, -0.0828484640753066, -0.08006023717079913, 0.3232416734358089, 0.1695644747503478, 0.19932076780212515, 0.0066907920056220255, 0.32110486081989503, 0.08688813192544109, 0.06375756793369708, 0.04077295731148104, 0.3689266532339682, 0.19933979645973504, 0.0685749107106316, -0.21486454025837545, -0.05103683869608424, 0.023495716266239985] |
1,803.02145 | Genarris: Random Generation of Molecular Crystal Structures and Fast
Screening with a Harris Approximation | We present Genarris, a Python package that performs configuration space
screening for molecular crystals of rigid molecules by random sampling with
physical constraints. For fast energy evaluations Genarris employs a Harris
approximation, whereby the total density of a molecular crystal is constructed
via superposition of single molecule densities. Dispersion-inclusive density
functional theory (DFT) is then used for the Harris density without performing
a self-consistency cycle. Genarris uses machine learning for clustering, based
on a relative coordinate descriptor (RCD) developed specifically for molecular
crystals, which is shown to be robust in identifying packing motif similarity.
In addition to random structure generation, Genarris offers three workflows
based on different sequences of successive clustering and selection steps: the
"Rigorous" workflow is an exhaustive exploration of the potential energy
landscape, the "Energy" workflow produces a set of low energy structures, and
the "Diverse" workflow produces a maximally diverse set of structures. The
latter is recommended for generating initial populations for genetic
algorithms. Here, the implementation of Genarris is reported and its
application is demonstrated for three test cases.
| physics.comp-ph cond-mat.mtrl-sci | we present genarris a python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints for fast energy evaluations genarris employs a harris approximation whereby the total density of a molecular crystal is constructed via superposition of single molecule densities dispersioninclusive density functional theory dft is then used for the harris density without performing a selfconsistency cycle genarris uses machine learning for clustering based on a relative coordinate descriptor rcd developed specifically for molecular crystals which is shown to be robust in identifying packing motif similarity in addition to random structure generation genarris offers three workflows based on different sequences of successive clustering and selection steps the rigorous workflow is an exhaustive exploration of the potential energy landscape the energy workflow produces a set of low energy structures and the diverse workflow produces a maximally diverse set of structures the latter is recommended for generating initial populations for genetic algorithms here the implementation of genarris is reported and its application is demonstrated for three test cases | [['we', 'present', 'genarris', 'a', 'python', 'package', 'that', 'performs', 'configuration', 'space', 'screening', 'for', 'molecular', 'crystals', 'of', 'rigid', 'molecules', 'by', 'random', 'sampling', 'with', 'physical', 'constraints', 'for', 'fast', 'energy', 'evaluations', 'genarris', 'employs', 'a', 'harris', 'approximation', 'whereby', 'the', 'total', 'density', 'of', 'a', 'molecular', 'crystal', 'is', 'constructed', 'via', 'superposition', 'of', 'single', 'molecule', 'densities', 'dispersioninclusive', 'density', 'functional', 'theory', 'dft', 'is', 'then', 'used', 'for', 'the', 'harris', 'density', 'without', 'performing', 'a', 'selfconsistency', 'cycle', 'genarris', 'uses', 'machine', 'learning', 'for', 'clustering', 'based', 'on', 'a', 'relative', 'coordinate', 'descriptor', 'rcd', 'developed', 'specifically', 'for', 'molecular', 'crystals', 'which', 'is', 'shown', 'to', 'be', 'robust', 'in', 'identifying', 'packing', 'motif', 'similarity', 'in', 'addition', 'to', 'random', 'structure', 'generation', 'genarris', 'offers', 'three', 'workflows', 'based', 'on', 'different', 'sequences', 'of', 'successive', 'clustering', 'and', 'selection', 'steps', 'the', 'rigorous', 'workflow', 'is', 'an', 'exhaustive', 'exploration', 'of', 'the', 'potential', 'energy', 'landscape', 'the', 'energy', 'workflow', 'produces', 'a', 'set', 'of', 'low', 'energy', 'structures', 'and', 'the', 'diverse', 'workflow', 'produces', 'a', 'maximally', 'diverse', 'set', 'of', 'structures', 'the', 'latter', 'is', 'recommended', 'for', 'generating', 'initial', 'populations', 'for', 'genetic', 'algorithms', 'here', 'the', 'implementation', 'of', 'genarris', 'is', 'reported', 'and', 'its', 'application', 'is', 'demonstrated', 'for', 'three', 'test', 'cases']] | [-0.11376451132966248, 0.07159911685206073, -0.10154305576164832, 0.06095068395102996, -0.05241875593074137, -0.12313489085759154, 0.06935688944589667, 0.40446540372895784, -0.2325230859455535, -0.3080647867547626, 0.03600718354908, -0.20531798077040705, -0.1368941191561124, 0.18735873188834165, -0.0008106178941269373, 0.08409395512566774, 0.0866870808230456, -0.00012279936144578047, -0.046564009593232356, -0.2190858615092644, 0.25823996244208114, 0.08985435942337773, 0.3250455852349064, -0.013060996875611144, 0.1098422546102933, 0.03353306892376136, -0.02770054503410905, 0.022429688791660362, -0.11273036606700311, 0.16411972080956844, 0.2555956789493111, 0.17740554181088147, 0.2902181416163863, -0.41193560521578654, -0.20575208146454252, 0.03970061468988143, 0.11678607527958765, 0.12790646557441923, -0.0761956739621257, -0.23596545802857513, 0.08228228791568686, -0.13845663059830007, -0.0856181869213737, -0.142837226408234, 0.018836961983202626, 0.06194845401553501, -0.30815864664177284, 0.06588538381774192, -0.011370449585312557, 0.06851020872582221, -0.05989418052345643, -0.13864981726042114, -0.018298591278364945, 0.07422409038027299, -0.04098906858567277, 0.05742531889733783, 0.19456729534230643, -0.09210266893172246, -0.12922501508159906, 0.38885202066673114, -0.013154842785088581, -0.19790957180228508, 0.20316430700718072, -0.030522116827216512, -0.18268759097855794, 0.14803999957585728, 0.13013002808418542, 0.12273853849994297, -0.17555226469793805, 0.08220747542275175, -0.013097203271757897, 0.178378416423354, 0.057993489058003174, -0.011016795775671115, 0.17275269564920928, 0.2270847111565714, 0.08142561712984703, 0.14678073984680526, -0.11749706702606602, -0.12011937798549831, -0.24246173922571984, -0.16092302188432464, -0.22365956779250917, 0.002434904282998251, -0.08717603076909382, -0.21712564727898295, 0.4099113814420356, 0.09557464166448035, 0.144605523455037, 0.05138106208265192, 0.3079363386422374, 0.06673661883717708, 0.055698071352216875, 0.05807454880171766, 0.14739115182551202, 0.0945925240942823, 0.05401866330133601, -0.19834935667037418, 0.07566200455800555, 0.08588385076834766] |
1,803.02146 | Regularity and Green's relations for the semigroup of partial
contractions of a finite chain | Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the
semigroup of partial transformations on $[n]$. Let
$\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for~all ~x,y\in
Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$, then $\mathcal{CP}_{n}$ is a
subsemigroup of $\mathcal{P}_{n}$. In this paper, we give a necessary and
sufficient condition for an element in $\mathcal{P}_{n}$ to be regular and
characterize all the Green's equivalences on the semigroup $\mathcal{CP}_{n}$.
| math.GR | let n12ldotsn be a finite chain and let mathcalp_n be the semigroup of partial transformations on n let mathcalcp_nalphain mathcalp_n forall xyin domalphaxalphayalphaleqxy then mathcalcp_n is a subsemigroup of mathcalp_n in this paper we give a necessary and sufficient condition for an element in mathcalp_n to be regular and characterize all the greens equivalences on the semigroup mathcalcp_n | [['let', 'n12ldotsn', 'be', 'a', 'finite', 'chain', 'and', 'let', 'mathcalp_n', 'be', 'the', 'semigroup', 'of', 'partial', 'transformations', 'on', 'n', 'let', 'mathcalcp_nalphain', 'mathcalp_n', 'forall', 'xyin', 'domalphaxalphayalphaleqxy', 'then', 'mathcalcp_n', 'is', 'a', 'subsemigroup', 'of', 'mathcalp_n', 'in', 'this', 'paper', 'we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'an', 'element', 'in', 'mathcalp_n', 'to', 'be', 'regular', 'and', 'characterize', 'all', 'the', 'greens', 'equivalences', 'on', 'the', 'semigroup', 'mathcalcp_n']] | [-0.16409470195815498, 0.14249695492643305, -0.0565870096740712, 0.0188163273103003, -0.0792096395660857, -0.14410500289107273, -0.0031445013197039123, 0.3385165434862886, -0.3735541551639991, -0.07346231452122863, 0.12940520530849295, -0.3554639080539346, -0.046392197450456606, 0.15154839416832797, -0.09777864957660702, -0.04157860252390882, 0.01922812224698386, 0.11933479004905426, -0.06098560534051752, -0.20645820306214904, 0.34138786889213535, -0.09057199998226549, 0.14826870732940733, 0.0846642858481833, 0.1366090912571443, 0.004064545193354466, 0.06543609573522449, 0.001772646397252434, -0.2592975998829518, 0.0239984760160691, 0.3341221714924489, 0.17336216883268207, 0.24761413536699756, -0.42965449795259963, -0.08775797445559874, 0.29279569075775463, 0.16809444097868567, -0.09909969944107745, -0.0005264346130258803, -0.2789622727515442, 0.20657377033161797, -0.13668031950614282, -0.10568776246093746, -0.08748386854339125, 0.11900618203383471, 0.03094452602921852, -0.43962135723060264, -0.05928876871309642, 0.11820990296213754, 0.09867819776575613, 0.0007034361478872597, -0.06922013818153314, -0.04919569518616689, 0.051809953101578037, -0.13114911073768912, 0.06243746279506013, -0.015198564847066467, 0.04980846132717228, -0.07551809168320947, 0.353604756295681, -0.05841932522266039, -0.2863995564901935, 0.07359931644584451, -0.1860648048210091, -0.13464230066165328, 0.07410168255280171, 0.11292485919381891, 0.19469600110980018, -0.13589138316456228, 0.2542138415457365, -0.14547718768673285, 0.12646413025712328, 0.0403200342719044, -0.02777514365568225, 0.11779579169420426, 0.08305009447420682, 0.12285142012738756, 0.1640529210250991, 0.06969505462828758, 0.07255672213588175, -0.3998734598280862, -0.20618267776444554, -0.150377385120789, 0.20561670942697674, -0.11535034803273447, -0.19587346656979726, 0.3437625595834106, 0.1066985483230545, 0.16644937195815146, 0.135232100986676, 0.15431274091159658, 0.11564734309857679, -0.038408298610842655, 0.087654221345604, -0.07985133285235081, 0.2458574062745486, -0.0919735600140744, -0.19539098125616355, 0.06775913778359868, 0.24619587672974116] |
1,803.02147 | Amplitude death criteria for coupled complex Ginzburg-Landau systems | Amplitude death, which occurs in a system when one or more macroscopic
wavefunctions collapse to zero, has been observed in mutually coupled
solid-state lasers, analog circuits, and thermoacoustic oscillators, to name a
few applications. While studies have considered amplitude death on oscillator
systems and in externally forced complex Ginzburg-Landau systems, a route to
amplitude death has not been studied in autonomous continuum systems. We derive
simple analytic conditions for the onset of amplitude death of one macroscopic
wavefunction in a system of two coupled complex Ginzburg-Landau equations with
general nonlinear self- and cross-interaction terms. Our results give a more
general theoretical underpinning for recent amplitude death results reported in
the literature, and suggest an approach for tuning parameters in such systems
so that they either permit or prohibit amplitude death of a wavefunction
(depending on the application). Numerical simulation of the coupled complex
Ginzburg-Landau equations, for examples including cubic, cubic-quintic, and
saturable nonlinearities, is used to illustrate the analytical results.
| nlin.PS | amplitude death which occurs in a system when one or more macroscopic wavefunctions collapse to zero has been observed in mutually coupled solidstate lasers analog circuits and thermoacoustic oscillators to name a few applications while studies have considered amplitude death on oscillator systems and in externally forced complex ginzburglandau systems a route to amplitude death has not been studied in autonomous continuum systems we derive simple analytic conditions for the onset of amplitude death of one macroscopic wavefunction in a system of two coupled complex ginzburglandau equations with general nonlinear self and crossinteraction terms our results give a more general theoretical underpinning for recent amplitude death results reported in the literature and suggest an approach for tuning parameters in such systems so that they either permit or prohibit amplitude death of a wavefunction depending on the application numerical simulation of the coupled complex ginzburglandau equations for examples including cubic cubicquintic and saturable nonlinearities is used to illustrate the analytical results | [['amplitude', 'death', 'which', 'occurs', 'in', 'a', 'system', 'when', 'one', 'or', 'more', 'macroscopic', 'wavefunctions', 'collapse', 'to', 'zero', 'has', 'been', 'observed', 'in', 'mutually', 'coupled', 'solidstate', 'lasers', 'analog', 'circuits', 'and', 'thermoacoustic', 'oscillators', 'to', 'name', 'a', 'few', 'applications', 'while', 'studies', 'have', 'considered', 'amplitude', 'death', 'on', 'oscillator', 'systems', 'and', 'in', 'externally', 'forced', 'complex', 'ginzburglandau', 'systems', 'a', 'route', 'to', 'amplitude', 'death', 'has', 'not', 'been', 'studied', 'in', 'autonomous', 'continuum', 'systems', 'we', 'derive', 'simple', 'analytic', 'conditions', 'for', 'the', 'onset', 'of', 'amplitude', 'death', 'of', 'one', 'macroscopic', 'wavefunction', 'in', 'a', 'system', 'of', 'two', 'coupled', 'complex', 'ginzburglandau', 'equations', 'with', 'general', 'nonlinear', 'self', 'and', 'crossinteraction', 'terms', 'our', 'results', 'give', 'a', 'more', 'general', 'theoretical', 'underpinning', 'for', 'recent', 'amplitude', 'death', 'results', 'reported', 'in', 'the', 'literature', 'and', 'suggest', 'an', 'approach', 'for', 'tuning', 'parameters', 'in', 'such', 'systems', 'so', 'that', 'they', 'either', 'permit', 'or', 'prohibit', 'amplitude', 'death', 'of', 'a', 'wavefunction', 'depending', 'on', 'the', 'application', 'numerical', 'simulation', 'of', 'the', 'coupled', 'complex', 'ginzburglandau', 'equations', 'for', 'examples', 'including', 'cubic', 'cubicquintic', 'and', 'saturable', 'nonlinearities', 'is', 'used', 'to', 'illustrate', 'the', 'analytical', 'results']] | [-0.1699683957194793, 0.1227783257790179, -0.038969644397730006, 0.0499767675610201, -0.07703052943543298, -0.19387964014022147, 0.02046239005649113, 0.3413822167480248, -0.17984751793555914, -0.23312241845414974, 0.11102185099225607, -0.25250195203116166, -0.21283757427008823, 0.28380190594907617, -0.01822061023194692, 0.07464023571810685, 0.05611124893184751, 0.043405188550241294, -0.01431305279766093, -0.2084859294242051, 0.2812549121386837, -0.03269012101518456, 0.279933263809653, 0.003362650747294538, 0.0898859739798354, -0.0348031595145585, 0.047772661162889564, -0.0076960368460277095, -0.14062336562369637, 0.05201083340216428, 0.23602371278684586, 0.0655840270104818, 0.27444536180701107, -0.4815817907568999, -0.30004617577833415, 0.10295490030257497, 0.1852312627219362, 0.19661510403311694, -0.025544364788584063, -0.28810256374417803, -0.022460229472562786, -0.1706362977740355, -0.19200444403686562, -0.09817305209726328, 0.05474955769313965, 0.060187944862627775, -0.27389513260277454, 0.11599208077532239, 0.031235361137078144, 0.06626751705189235, -0.07561217062564082, -0.056420565635198726, -0.020352971427200828, 0.050056842871890696, -0.016985859167471064, -0.02392922756553162, 0.10611500282793714, -0.13034359998709988, -0.13365029809065163, 0.36840382280061024, -0.05338750943192281, -0.2157995717774611, 0.2315981701904093, -0.136139573744731, -0.10727274901873898, 0.14637622675218154, 0.1789078777481336, 0.07405214365571737, -0.1697781973974088, 0.027236208789327067, 0.04693172107945429, 0.17967877964838408, 0.08180670437286608, 0.03675745526343235, 0.1686680822764174, 0.19911568711249855, 0.011206302982463967, 0.1146194033761276, 0.008973278456323897, -0.1575794248841703, -0.266132205381291, -0.07652932312630582, -0.14543941547744907, 0.0790028942182289, -0.05393119017053323, -0.18298508184961976, 0.3737982565187849, 0.13259095725952647, 0.1379548952798359, -0.0008534918983059469, 0.2648376962402835, 0.17331667428734363, 0.06317322645627428, -0.0027065729096648282, 0.258527144260006, 0.18728224807418883, 0.12402387351758079, -0.24353678387415129, 0.02288561965615372, 0.024838974844897166] |
1,803.02148 | Noise-induced distributed entanglement in atom-cavity-fiber system | The distributed quantum computation plays an important role in large-scale
quantum information processing. In the atom-cavity-fiber system, we put forward
two efficient proposals to prepare the steady entanglement of two distant atoms
with dissipation. The atomic spontaneous emission and the loss of fiber are
exploited actively as powerful resources, while the effect of cavity decay is
inhibited by quantum Zeno dynamics and quantum-jump-based feedback control.
These proposals do not require precisely tailored Rabi frequencies or coupling
strength between cavity and fiber. Furthermore, we discuss the feasibility of
extending the present schemes into the systems consisting of two atoms at the
opposite ends of the $n$ cavities connected by $(n-1)$ fibers, and the
corresponding numerical simulation reveals that a high fidelity remains
achievable with current experimental parameters.
| quant-ph | the distributed quantum computation plays an important role in largescale quantum information processing in the atomcavityfiber system we put forward two efficient proposals to prepare the steady entanglement of two distant atoms with dissipation the atomic spontaneous emission and the loss of fiber are exploited actively as powerful resources while the effect of cavity decay is inhibited by quantum zeno dynamics and quantumjumpbased feedback control these proposals do not require precisely tailored rabi frequencies or coupling strength between cavity and fiber furthermore we discuss the feasibility of extending the present schemes into the systems consisting of two atoms at the opposite ends of the n cavities connected by n1 fibers and the corresponding numerical simulation reveals that a high fidelity remains achievable with current experimental parameters | [['the', 'distributed', 'quantum', 'computation', 'plays', 'an', 'important', 'role', 'in', 'largescale', 'quantum', 'information', 'processing', 'in', 'the', 'atomcavityfiber', 'system', 'we', 'put', 'forward', 'two', 'efficient', 'proposals', 'to', 'prepare', 'the', 'steady', 'entanglement', 'of', 'two', 'distant', 'atoms', 'with', 'dissipation', 'the', 'atomic', 'spontaneous', 'emission', 'and', 'the', 'loss', 'of', 'fiber', 'are', 'exploited', 'actively', 'as', 'powerful', 'resources', 'while', 'the', 'effect', 'of', 'cavity', 'decay', 'is', 'inhibited', 'by', 'quantum', 'zeno', 'dynamics', 'and', 'quantumjumpbased', 'feedback', 'control', 'these', 'proposals', 'do', 'not', 'require', 'precisely', 'tailored', 'rabi', 'frequencies', 'or', 'coupling', 'strength', 'between', 'cavity', 'and', 'fiber', 'furthermore', 'we', 'discuss', 'the', 'feasibility', 'of', 'extending', 'the', 'present', 'schemes', 'into', 'the', 'systems', 'consisting', 'of', 'two', 'atoms', 'at', 'the', 'opposite', 'ends', 'of', 'the', 'n', 'cavities', 'connected', 'by', 'n1', 'fibers', 'and', 'the', 'corresponding', 'numerical', 'simulation', 'reveals', 'that', 'a', 'high', 'fidelity', 'remains', 'achievable', 'with', 'current', 'experimental', 'parameters']] | [-0.18878107062354685, 0.18468154662370215, -0.015612809292972088, 0.013295289372093975, -0.008747037630528212, -0.21068398497998714, 0.047778226360678674, 0.4185360150039196, -0.24530548035353422, -0.269456913843751, 0.06554003553278744, -0.24261580127989874, -0.0873518289513886, 0.23247951715346427, 0.002124641631031409, 0.08624350897222757, 0.05550599921494723, 0.001624176848679781, -0.014945441352203489, -0.21281671840883792, 0.30849839401338247, 0.0722319210888818, 0.3262725733667612, 0.031931024122983216, 0.10330623868852853, -0.023123673654161393, 0.008891771532595157, -0.037608644138090314, -0.11594057824305491, 0.14502935743890702, 0.24294332507252694, 0.0754802557528019, 0.3110042021498084, -0.4923629643470049, -0.1974056423306465, 0.09012961548089515, 0.17893972456827759, 0.14483724496513606, -0.06603458247706294, -0.2777716857790947, -0.007894717328250409, -0.14547077172249556, -0.11517097852751612, -0.061841891214251515, -0.008525375720113516, 0.0049526424661307826, -0.23772157806996255, 0.05663335067033768, 0.06126909325178713, 0.045015092093497515, 0.019336123537272216, -0.010770387726835907, -0.00035637712478637693, 0.15304033692367375, -0.0455503856819123, -0.027851899753324687, 0.18945867819339038, -0.1321607218235731, -0.15582341218367218, 0.3562620442844927, -0.05677760897018015, -0.16364809158444404, 0.1943243615552783, -0.1264529348704964, -0.07553535326570272, 0.12329568066447973, 0.1368464506249875, 0.0680974373742938, -0.08948174288868904, 0.03211268708202988, 0.04025121753662825, 0.18780846174992621, 0.06108983559906483, 0.14540651881322264, 0.23413663935661316, 0.16249579364061356, 0.03851501391036436, 0.1945506757609546, -0.08542984396405517, -0.13707819971814753, -0.2832202744968236, -0.1406358566209674, -0.16977072398550808, 0.06380634078953881, -0.05993172877607867, -0.07081528426334262, 0.3581367503106594, 0.1373275971338153, 0.1690466545522213, -0.014856328401714563, 0.34433618998900056, 0.08730183435801882, 0.06801323661953211, 0.07147967423126102, 0.29961502263695, 0.15948259470239282, 0.06039989317022264, -0.3188550210110843, 0.028734318217262626, 0.0011758756898343564] |
1,803.02149 | Signatures of Anderson localization and delocalized random quantum
states | We consider the notion of equilibration for an isolated quantum system
exhibiting Anderson localization. The system is assumed to be in a pure state,
i.e., described by a wave-function undergoing unitary dynamics. We focus on the
simplest model of a 1D disordered chain and we analyse both the dynamics of an
initially localized state and the dynamics of quantum states drawn at random
from the ensemble corresponding to the minimum knowledge about the initial
state. While in the former case the site distribution remains confined in a
limited portion of the chain, the site distribution of random pure state
fluctuates around an equilibrium average that is delocalized over the entire
chain. A clear connection between the equilibration observed when the system is
initialized in a fully localized state and the amplitude of dynamical
fluctuations of a typical random pure state is established.
| quant-ph cond-mat.stat-mech | we consider the notion of equilibration for an isolated quantum system exhibiting anderson localization the system is assumed to be in a pure state ie described by a wavefunction undergoing unitary dynamics we focus on the simplest model of a 1d disordered chain and we analyse both the dynamics of an initially localized state and the dynamics of quantum states drawn at random from the ensemble corresponding to the minimum knowledge about the initial state while in the former case the site distribution remains confined in a limited portion of the chain the site distribution of random pure state fluctuates around an equilibrium average that is delocalized over the entire chain a clear connection between the equilibration observed when the system is initialized in a fully localized state and the amplitude of dynamical fluctuations of a typical random pure state is established | [['we', 'consider', 'the', 'notion', 'of', 'equilibration', 'for', 'an', 'isolated', 'quantum', 'system', 'exhibiting', 'anderson', 'localization', 'the', 'system', 'is', 'assumed', 'to', 'be', 'in', 'a', 'pure', 'state', 'ie', 'described', 'by', 'a', 'wavefunction', 'undergoing', 'unitary', 'dynamics', 'we', 'focus', 'on', 'the', 'simplest', 'model', 'of', 'a', '1d', 'disordered', 'chain', 'and', 'we', 'analyse', 'both', 'the', 'dynamics', 'of', 'an', 'initially', 'localized', 'state', 'and', 'the', 'dynamics', 'of', 'quantum', 'states', 'drawn', 'at', 'random', 'from', 'the', 'ensemble', 'corresponding', 'to', 'the', 'minimum', 'knowledge', 'about', 'the', 'initial', 'state', 'while', 'in', 'the', 'former', 'case', 'the', 'site', 'distribution', 'remains', 'confined', 'in', 'a', 'limited', 'portion', 'of', 'the', 'chain', 'the', 'site', 'distribution', 'of', 'random', 'pure', 'state', 'fluctuates', 'around', 'an', 'equilibrium', 'average', 'that', 'is', 'delocalized', 'over', 'the', 'entire', 'chain', 'a', 'clear', 'connection', 'between', 'the', 'equilibration', 'observed', 'when', 'the', 'system', 'is', 'initialized', 'in', 'a', 'fully', 'localized', 'state', 'and', 'the', 'amplitude', 'of', 'dynamical', 'fluctuations', 'of', 'a', 'typical', 'random', 'pure', 'state', 'is', 'established']] | [-0.1600156278270756, 0.2161001539808611, -0.08674461901692909, 0.0469985552899487, 0.07595180595805212, -0.12804048154978606, 0.051138203059860936, 0.3407225341021254, -0.2715123246412013, -0.2277991880111816, 0.09073886670939572, -0.28977051964947875, -0.07261624789967293, 0.1062387951213578, 0.024690811296852803, 0.022767060187081217, 0.06661320897803025, 0.099766629716893, -0.0700263798533624, -0.19229490021538828, 0.3201244524368544, 0.060721269879214675, 0.3115606276108555, -0.025470515270389512, 0.09382995528588728, 0.04934066712600507, 0.0673813011733369, 0.0023164893147981608, -0.09079345738586787, 0.049027254907857025, 0.16721693047938843, 0.05729412514073643, 0.2510729839985954, -0.42988778192969695, -0.22039248352697363, 0.10891338756872, 0.13808757529272633, 0.17028632134848445, -0.005002154585820111, -0.3043813951113458, 0.03020058583277999, -0.17299991943315984, -0.1803623902854103, -0.005261923389797899, 0.019686938242647185, -0.02600570406451572, -0.23891867076794446, 0.10671849416004835, 0.09135134224218323, 0.05103216605575781, -0.06618112096608891, -0.04705396785587728, -0.05376709330643357, 0.1547346307847298, -0.041962868165106734, 0.027197010329806467, 0.12867749720798727, -0.16377915233631068, -0.08963257170029798, 0.35403812629938075, -0.07289030923078518, -0.18515656963581037, 0.20112661811405083, -0.15442326014638472, -0.0806045228333383, 0.15005310878000208, 0.1328890172032554, 0.12293021190373725, -0.13048307289515743, 0.07302029186768111, -0.040597786111953915, 0.2011349653631685, -0.028209376266934504, 0.028190929419688985, 0.23230561551893733, 0.18577826452526774, 0.07664974992209389, 0.19923602974839166, -0.07873523193509908, -0.24863813637795162, -0.2770530028944232, -0.12381621743355628, -0.2548959721355292, 0.10822128028687562, -0.02610976048583299, -0.20923653098059372, 0.4293091566774102, 0.11448061079445453, 0.21442293201271498, 0.0073131834907772045, 0.20978290123314086, 0.11777194695625927, -0.039448204909411956, 0.08609597592345689, 0.21369354132379234, 0.1515710039644725, 0.08025298343764775, -0.24389790577492612, 0.09684158221844741, 0.019050010611158862] |
1,803.0215 | Effect of short-range correlations on spectral properties of doped Mott
insulators | In the framework of cluster perturbation theory for the 2D Hubbard and
Hubbard-Holstein models at low hole doping we have studied the effect of local
and short-range correlations in strongly correlated systems on the anomalous
features in the electronic spectrum by investigating the fine structure of
quasiparticle bands. Different anomalous features of spectrum are obtained as
the result of intrinsic properties of strongly correlated electron and polaron
bands in the presence of short-range correlations. Particularly, features
similar to the electron-like Fermi-pockets of cuprates at hole doping
$p\sim0.1$ are obtained without ad hoc introducing a charge density wave order
parameter within the Hubbard model in a unified manner with other known
peculiarities of the pseudogap phase like Fermi-arcs, pockets, waterfalls, and
kink-like features. The Fermi surface is mainly formed by dispersive
quasiparticle bands with large spectral weight, formed by coherent low-energy
exications. Within the Hubbard-Holstein model at moderate phonon frequencies we
show that modest values of local electron-phonon interaction are capable of
introducing low-energy kink-like features and affecting the Fermi surface by
hybridization of the fermionic quasiparticle bands with the Franck-Condon
resonances.
| cond-mat.str-el | in the framework of cluster perturbation theory for the 2d hubbard and hubbardholstein models at low hole doping we have studied the effect of local and shortrange correlations in strongly correlated systems on the anomalous features in the electronic spectrum by investigating the fine structure of quasiparticle bands different anomalous features of spectrum are obtained as the result of intrinsic properties of strongly correlated electron and polaron bands in the presence of shortrange correlations particularly features similar to the electronlike fermipockets of cuprates at hole doping psim01 are obtained without ad hoc introducing a charge density wave order parameter within the hubbard model in a unified manner with other known peculiarities of the pseudogap phase like fermiarcs pockets waterfalls and kinklike features the fermi surface is mainly formed by dispersive quasiparticle bands with large spectral weight formed by coherent lowenergy exications within the hubbardholstein model at moderate phonon frequencies we show that modest values of local electronphonon interaction are capable of introducing lowenergy kinklike features and affecting the fermi surface by hybridization of the fermionic quasiparticle bands with the franckcondon resonances | [['in', 'the', 'framework', 'of', 'cluster', 'perturbation', 'theory', 'for', 'the', '2d', 'hubbard', 'and', 'hubbardholstein', 'models', 'at', 'low', 'hole', 'doping', 'we', 'have', 'studied', 'the', 'effect', 'of', 'local', 'and', 'shortrange', 'correlations', 'in', 'strongly', 'correlated', 'systems', 'on', 'the', 'anomalous', 'features', 'in', 'the', 'electronic', 'spectrum', 'by', 'investigating', 'the', 'fine', 'structure', 'of', 'quasiparticle', 'bands', 'different', 'anomalous', 'features', 'of', 'spectrum', 'are', 'obtained', 'as', 'the', 'result', 'of', 'intrinsic', 'properties', 'of', 'strongly', 'correlated', 'electron', 'and', 'polaron', 'bands', 'in', 'the', 'presence', 'of', 'shortrange', 'correlations', 'particularly', 'features', 'similar', 'to', 'the', 'electronlike', 'fermipockets', 'of', 'cuprates', 'at', 'hole', 'doping', 'psim01', 'are', 'obtained', 'without', 'ad', 'hoc', 'introducing', 'a', 'charge', 'density', 'wave', 'order', 'parameter', 'within', 'the', 'hubbard', 'model', 'in', 'a', 'unified', 'manner', 'with', 'other', 'known', 'peculiarities', 'of', 'the', 'pseudogap', 'phase', 'like', 'fermiarcs', 'pockets', 'waterfalls', 'and', 'kinklike', 'features', 'the', 'fermi', 'surface', 'is', 'mainly', 'formed', 'by', 'dispersive', 'quasiparticle', 'bands', 'with', 'large', 'spectral', 'weight', 'formed', 'by', 'coherent', 'lowenergy', 'exications', 'within', 'the', 'hubbardholstein', 'model', 'at', 'moderate', 'phonon', 'frequencies', 'we', 'show', 'that', 'modest', 'values', 'of', 'local', 'electronphonon', 'interaction', 'are', 'capable', 'of', 'introducing', 'lowenergy', 'kinklike', 'features', 'and', 'affecting', 'the', 'fermi', 'surface', 'by', 'hybridization', 'of', 'the', 'fermionic', 'quasiparticle', 'bands', 'with', 'the', 'franckcondon', 'resonances']] | [-0.16681582813433718, 0.2020359629623885, -0.04238480486739636, 0.10627623069625913, -0.0043487266148178935, -0.16795243616372849, 0.07558811970481523, 0.3624722666494297, -0.2481362276155962, -0.29630951976843095, -0.053400534912132855, -0.3502744231242268, -0.1285240600863995, 0.11735159815079794, 0.0644147381071378, 0.004993523750405136, -0.016157354230814602, -0.056368772759301106, -0.12049672998922217, -0.17932731926106335, 0.3850777066453998, 0.07999467713041546, 0.2849057370461942, 0.09001371600884903, -0.0032521533155866135, 0.04221239050555473, 0.05981484449156586, 0.020300558216221044, -0.11037029656785144, 0.08809722279031039, 0.2684775052050018, -0.11214034377042664, 0.19092476714449527, -0.43778096854142595, -0.2842589141644035, -0.03961622466142237, 0.1501078987312621, 0.13535023231865065, -0.02944426467770376, -0.3096282152207882, 0.012309481787463923, -0.17795170940919203, -0.148533902830821, -0.09282806038521649, -0.023954697256434312, 0.011664006386862628, -0.20368532617112067, 0.17078264077780037, 0.032965026929283915, 0.06323767095029856, -0.12255848632449169, -0.11438920805126093, -0.08465941743846732, 0.047066733868939156, 0.05734209099711243, -0.001324317284619038, 0.14586058266956642, -0.15155912834818716, -0.06728279469613237, 0.36993643972143697, -0.1065381787111721, -0.08909014678622983, 0.188004404630805, -0.20165912797569893, -0.09956259207454708, 0.2008932298860314, 0.08836059792103308, 0.04198986830404342, -0.15099489560522128, 0.11743067525928248, -0.0006012042356999016, 0.1484080361057821, 0.015520802984181582, 0.16391372444955737, 0.2627544830385805, 0.1711172603000102, 0.012049210261752348, 0.07770522473035955, -0.16500260952593276, -0.040461082545140484, -0.23808947200442174, -0.04738050912051681, -0.23705364971453052, -0.010644699272642754, -0.08499926602455796, -0.19712146222748364, 0.4703403182871891, 0.09433485038076224, 0.21654535809092307, -0.05779846420830764, 0.1990030374210537, 0.1481760935955995, 0.08285003501838178, 0.07101193734894642, 0.24516573892984792, 0.10380570324702879, 0.05452509184388883, -0.3083918050920402, 0.021911453132110837, 0.05654405679532819] |
1,803.02151 | A functional CLT for partial traces of random matrices | In this paper we show a functional central limit theorem for the sum of the
first $\lfloor t n \rfloor$ diagonal elements of $f(Z)$ as a function in $t$,
for $Z$ a random real symmetric or complex Hermitian $n\times n$ matrix. The
result holds for orthogonal or unitarily invariant distributions of $Z$, in the
cases when the linear eigenvalue statistic $\operatorname{tr} f(Z)$ satisfies a
CLT. The limit process interpolates between the fluctuations of individual
matrix elements as $f(Z)_{1,1}$ and of the linear eigenvalue statistic. It can
also be seen as a functional CLT for processes of randomly weighted measures.
| math.PR | in this paper we show a functional central limit theorem for the sum of the first lfloor t n rfloor diagonal elements of fz as a function in t for z a random real symmetric or complex hermitian ntimes n matrix the result holds for orthogonal or unitarily invariant distributions of z in the cases when the linear eigenvalue statistic operatornametr fz satisfies a clt the limit process interpolates between the fluctuations of individual matrix elements as fz_11 and of the linear eigenvalue statistic it can also be seen as a functional clt for processes of randomly weighted measures | [['in', 'this', 'paper', 'we', 'show', 'a', 'functional', 'central', 'limit', 'theorem', 'for', 'the', 'sum', 'of', 'the', 'first', 'lfloor', 't', 'n', 'rfloor', 'diagonal', 'elements', 'of', 'fz', 'as', 'a', 'function', 'in', 't', 'for', 'z', 'a', 'random', 'real', 'symmetric', 'or', 'complex', 'hermitian', 'ntimes', 'n', 'matrix', 'the', 'result', 'holds', 'for', 'orthogonal', 'or', 'unitarily', 'invariant', 'distributions', 'of', 'z', 'in', 'the', 'cases', 'when', 'the', 'linear', 'eigenvalue', 'statistic', 'operatornametr', 'fz', 'satisfies', 'a', 'clt', 'the', 'limit', 'process', 'interpolates', 'between', 'the', 'fluctuations', 'of', 'individual', 'matrix', 'elements', 'as', 'fz_11', 'and', 'of', 'the', 'linear', 'eigenvalue', 'statistic', 'it', 'can', 'also', 'be', 'seen', 'as', 'a', 'functional', 'clt', 'for', 'processes', 'of', 'randomly', 'weighted', 'measures']] | [-0.1365575250428246, 0.12632451982864615, -0.07281197981946931, 0.07384932285115109, 0.03897273943436389, -0.15710792021008627, 0.05410750668462632, 0.3175828034433593, -0.28362802945894705, -0.18879054941008894, 0.0737579991596713, -0.321664298865564, -0.16366350144261912, 0.12984776892936883, -0.006365032980636675, 0.09299258414147497, 0.026530979899689555, 0.08246345856531086, -0.09679675951234198, -0.2447613758386626, 0.2969542607208904, -0.024454225296610777, 0.2142586155737541, -0.005066454252560756, 0.10118243512602484, 0.0705877843797587, 0.010379913986460971, -0.03878218568587151, -0.08783965633839977, 0.04894974090132805, 0.28444434591683043, 0.11796092957600343, 0.274078322417692, -0.347601664376122, -0.11396797509787947, 0.21444922552101922, 0.17051293405381088, -0.02263026220762, 0.01821622671559453, -0.2279351940188481, 0.11409333840307152, -0.14270050339970966, -0.1917403856237723, -0.017978986456743156, 0.060659981218679826, 0.05320279222285869, -0.40454369528713274, 0.12353403359498324, 0.14959529768533017, 0.033874280133037546, 0.03145633819655572, -0.18543567714205353, -0.003900643618663355, 0.09568942544835723, 0.011977975821889917, 0.012511101717661535, 0.11064374564234547, -0.059413970863845735, -0.06925809937434232, 0.3479548001243752, -0.10914786121979052, -0.2416381712964907, 0.054361708528761356, -0.19081253741810822, -0.18378549197935784, 0.0468853673878677, 0.1499908957867978, 0.15381355237272776, -0.10726620194966054, 0.22097928580597556, -0.10278011507791829, 0.11637768925200882, 0.08782931586385381, 0.01772200070055468, 0.13021255381956545, 0.05751066580082157, 0.1304075719244607, 0.14062514979444557, -0.014057358280204388, -0.05860933317916886, -0.33921384209605426, -0.1955791954141186, -0.2621730776950337, 0.15020178333257458, -0.2001596561451003, -0.21387960765586825, 0.33254711759010597, 0.0460534782210669, 0.22923330912765646, 0.15186103345465143, 0.19992224503384562, 0.16698275125058062, 0.034278576490374246, 0.05570971510582128, 0.09552582836001922, 0.23809271411523603, 0.041177455582941065, -0.12553388252379183, 0.02717582677129884, 0.15096289053445264] |
1,803.02152 | Induced and Weak Induced Arboricities | We define the induced arboricity of a graph $G$, denoted by ${\rm ia}(G)$, as
the smallest $k$ such that the edges of $G$ can be covered with $k$ induced
forests in $G$. This notion generalizes the classical notions of the arboricity
and strong chromatic index.
For a class $\mathcal{F}$ of graphs and a graph parameter $p$, let
$p(\mathcal{F}) = \sup\{p(G) \mid G\in \mathcal{F}\}$. We show that ${\rm
ia}(\mathcal{F})$ is bounded from above by an absolute constant depending only
on $\mathcal{F}$, that is ${\rm ia}(\mathcal{F})\neq\infty$ if and only if
$\chi(\mathcal{F} \nabla \frac{1}{2}) \neq\infty$, where $\mathcal{F} \nabla
\frac{1}{2}$ is the class of $\frac{1}{2}$-shallow minors of graphs from
$\mathcal{F}$ and $\chi$ is the chromatic number.
Further, we give bounds on ${\rm ia}(\mathcal{F})$ when $\mathcal{F}$ is the
class of planar graphs, the class of $d$-degenerate graphs, or the class of
graphs having tree-width at most $d$. Specifically, we show that if
$\mathcal{F}$ is the class of planar graphs, then $8 \leq {\rm ia}(\mathcal{F})
\leq 10$.
In addition, we establish similar results for so-called weak induced
arboricities and star arboricities of classes of graphs.
| math.CO cs.DM | we define the induced arboricity of a graph g denoted by rm iag as the smallest k such that the edges of g can be covered with k induced forests in g this notion generalizes the classical notions of the arboricity and strong chromatic index for a class mathcalf of graphs and a graph parameter p let pmathcalf suppg mid gin mathcalf we show that rm iamathcalf is bounded from above by an absolute constant depending only on mathcalf that is rm iamathcalfneqinfty if and only if chimathcalf nabla frac12 neqinfty where mathcalf nabla frac12 is the class of frac12shallow minors of graphs from mathcalf and chi is the chromatic number further we give bounds on rm iamathcalf when mathcalf is the class of planar graphs the class of ddegenerate graphs or the class of graphs having treewidth at most d specifically we show that if mathcalf is the class of planar graphs then 8 leq rm iamathcalf leq 10 in addition we establish similar results for socalled weak induced arboricities and star arboricities of classes of graphs | [['we', 'define', 'the', 'induced', 'arboricity', 'of', 'a', 'graph', 'g', 'denoted', 'by', 'rm', 'iag', 'as', 'the', 'smallest', 'k', 'such', 'that', 'the', 'edges', 'of', 'g', 'can', 'be', 'covered', 'with', 'k', 'induced', 'forests', 'in', 'g', 'this', 'notion', 'generalizes', 'the', 'classical', 'notions', 'of', 'the', 'arboricity', 'and', 'strong', 'chromatic', 'index', 'for', 'a', 'class', 'mathcalf', 'of', 'graphs', 'and', 'a', 'graph', 'parameter', 'p', 'let', 'pmathcalf', 'suppg', 'mid', 'gin', 'mathcalf', 'we', 'show', 'that', 'rm', 'iamathcalf', 'is', 'bounded', 'from', 'above', 'by', 'an', 'absolute', 'constant', 'depending', 'only', 'on', 'mathcalf', 'that', 'is', 'rm', 'iamathcalfneqinfty', 'if', 'and', 'only', 'if', 'chimathcalf', 'nabla', 'frac12', 'neqinfty', 'where', 'mathcalf', 'nabla', 'frac12', 'is', 'the', 'class', 'of', 'frac12shallow', 'minors', 'of', 'graphs', 'from', 'mathcalf', 'and', 'chi', 'is', 'the', 'chromatic', 'number', 'further', 'we', 'give', 'bounds', 'on', 'rm', 'iamathcalf', 'when', 'mathcalf', 'is', 'the', 'class', 'of', 'planar', 'graphs', 'the', 'class', 'of', 'ddegenerate', 'graphs', 'or', 'the', 'class', 'of', 'graphs', 'having', 'treewidth', 'at', 'most', 'd', 'specifically', 'we', 'show', 'that', 'if', 'mathcalf', 'is', 'the', 'class', 'of', 'planar', 'graphs', 'then', '8', 'leq', 'rm', 'iamathcalf', 'leq', '10', 'in', 'addition', 'we', 'establish', 'similar', 'results', 'for', 'socalled', 'weak', 'induced', 'arboricities', 'and', 'star', 'arboricities', 'of', 'classes', 'of', 'graphs']] | [-0.18863426376275763, 0.18089261154410338, 0.03660356784675118, -0.006135310298948391, -0.10664430638361308, -0.1242209690056567, 0.0001736597249240816, 0.3719405207172995, -0.29541940317824156, -0.31806271901484906, 0.061513838872220915, -0.31404927011296063, -0.1074489655711127, 0.17090712303203143, -0.09811677147323887, -0.011316608073195301, 0.06439232305835998, 0.14972800114437154, -0.01628553625540018, -0.21726522402468884, 0.34730510475173215, -0.10766795359835116, 0.13416282624845005, 0.09399767401655428, 0.07905499031290696, -0.011459039494242759, 0.06964842998422682, 0.0899559650502075, -0.2564166420153329, 0.07178399162857156, 0.24748433766646954, 0.14591511865881712, 0.2588292102204167, -0.2902741160200179, -0.1443068380195277, 0.2857895131979944, 0.07510255059575913, -0.03980359581043148, 0.033004438908966746, -0.24126867600852808, 0.20490693123956696, -0.11205718614030302, -0.08389984432891098, 0.029474957162590576, 0.13000360954204324, 0.02132414072229151, -0.31921331354346105, 0.015497284734414684, 0.16628863864540183, 0.0659655669448102, 0.08946658112040629, -0.18215545476005787, -0.09097512467350397, 0.02483027076096089, -0.08293235625211172, 0.09489485423205889, 0.027337592990377274, -0.13316740246342593, -0.12040418943959391, 0.35778536063711547, -0.10117790106634952, -0.13874624607531758, 0.0695771604819953, -0.1912426396017099, -0.21992900436308388, 0.08418325082213776, 0.1177063172421696, 0.24289470111232317, -0.015720270752885696, 0.21142737302562897, -0.1383114608266113, 0.13845151949575857, 0.11137739788980512, 0.03383631708184856, 0.07177149354376727, 0.09365304020827102, 0.16363480952105414, 0.17119849059793402, -0.02677744197011081, 0.0928630901620402, -0.3348510012204884, -0.1001199960888347, -0.19486698300212796, 0.11675199318666295, -0.1769761447518164, -0.14929656101437014, 0.36539705762944635, 0.07683099678762485, 0.18438392911618304, 0.14293552038657387, 0.1562128499278265, 0.06776515334471515, 0.04226561258914635, 0.1952429116425807, 0.1253064739441619, 0.21036028774041268, -0.07615040184940859, -0.14605113350356008, 0.061573531764575785, 0.13847740959641264] |
1,803.02153 | Ladder Limit for Correlators of Wilson Loops | We study the correlator of concentric circular Wilson loops for arbitrary
radii, spatial and internal space separations. For real values of the
parameters specifying the dual string configuration, a typical Gross-Ooguri
phase transition is observed. In addition, we explore some analytic
continuation of a parameter $\gamma$ that characterizes the internal space
separation. This enables a ladder limit in which ladder resummation and string
theory computations precisely agree in the strong coupling limit. Finally, we
find a critical value of $\gamma$ for which the correlator is supersymmetric
and ladder diagrams can be exactly resummed for any value of the coupling
constant.
| hep-th | we study the correlator of concentric circular wilson loops for arbitrary radii spatial and internal space separations for real values of the parameters specifying the dual string configuration a typical grossooguri phase transition is observed in addition we explore some analytic continuation of a parameter gamma that characterizes the internal space separation this enables a ladder limit in which ladder resummation and string theory computations precisely agree in the strong coupling limit finally we find a critical value of gamma for which the correlator is supersymmetric and ladder diagrams can be exactly resummed for any value of the coupling constant | [['we', 'study', 'the', 'correlator', 'of', 'concentric', 'circular', 'wilson', 'loops', 'for', 'arbitrary', 'radii', 'spatial', 'and', 'internal', 'space', 'separations', 'for', 'real', 'values', 'of', 'the', 'parameters', 'specifying', 'the', 'dual', 'string', 'configuration', 'a', 'typical', 'grossooguri', 'phase', 'transition', 'is', 'observed', 'in', 'addition', 'we', 'explore', 'some', 'analytic', 'continuation', 'of', 'a', 'parameter', 'gamma', 'that', 'characterizes', 'the', 'internal', 'space', 'separation', 'this', 'enables', 'a', 'ladder', 'limit', 'in', 'which', 'ladder', 'resummation', 'and', 'string', 'theory', 'computations', 'precisely', 'agree', 'in', 'the', 'strong', 'coupling', 'limit', 'finally', 'we', 'find', 'a', 'critical', 'value', 'of', 'gamma', 'for', 'which', 'the', 'correlator', 'is', 'supersymmetric', 'and', 'ladder', 'diagrams', 'can', 'be', 'exactly', 'resummed', 'for', 'any', 'value', 'of', 'the', 'coupling', 'constant']] | [-0.19801119461655617, 0.17893319453578443, -0.07685346627607942, 0.1037840990780387, -0.062064202167093754, -0.10296844420372508, 0.05388325363979675, 0.3624537358246744, -0.1916502957465127, -0.24771843006834388, 0.07059235817636363, -0.2520667834766209, -0.10575868630316108, 0.14962175937835126, 0.051156354274135084, 0.03649407922013779, 0.0378749892860651, 0.05351533020148054, -0.14251169260358437, -0.1423291648121085, 0.3422031252132729, -0.0012744669942185282, 0.22031796581111848, 0.07022199351806194, 0.07289042742922902, 0.031737083878833804, 0.019000572375953196, 0.05887976655212697, -0.18584774310969807, 0.08558026385493576, 0.2114715823670849, 0.0230063821549993, 0.13449413208290933, -0.33498088873922827, -0.1776707045547664, 0.10383563743205741, 0.18889576653949916, 0.10775008542928845, 0.06005964406765998, -0.23907090972177683, 0.03509712174534798, -0.18123789792414755, -0.18525873764418066, -0.10229749000631273, 0.04454375786706805, -0.018211146558169276, -0.3159947879984975, 0.03526246704161167, 0.0031910123908892273, 0.016328076319769024, -0.030228758668527006, -0.06962676267139614, -0.007354487041011453, 0.14202819333411754, 0.02386379670111637, 0.09184183587087319, 0.11018923017662019, -0.1460761669627391, -0.1208379936311394, 0.3354940676316619, -0.09538290066935588, -0.18173723150976, 0.11656304703094066, -0.20186642720364034, -0.16156305403914303, 0.11453470289612597, 0.09821495376061648, 0.1139158465154469, -0.12066654190421104, 0.19396274431433994, -0.01981350193731487, 0.15964246187359094, 0.12352767654694617, 0.030288931854302065, 0.22422453783452512, 0.11481700986623763, 0.04169840906746686, 0.16312667516409418, -0.07836862862110137, -0.1515290499269031, -0.38746025364845993, -0.1339113672147505, -0.13394316969439388, 0.040131504717282954, -0.20987069155511562, -0.21343861876055598, 0.36236979778390377, 0.1311070426821243, 0.24507995162246515, 0.08044843717012555, 0.25883861458394675, 0.16690236304886638, 0.06941320335725322, 0.062453692762646826, 0.25829997511260444, 0.12891150295734405, 0.06056816092692316, -0.2427039773436263, -0.023259258733596654, 0.12387913489714265] |
1,803.02154 | The homotopy type of spaces of real resultants with bounded multiplicity | For positive integers $d,m,n\geq 1$ with $(m,n)\not= (1,1)$ and $\Bbb K=\Bbb
R$ or $\Bbb C$, let $Q^{d,m}_{n}(\Bbb K)$ denote the space of $m$-tuples
$(f_1(z),\cdots ,f_m(z))\in \Bbb K [z]^m$ of $\Bbb K$-coefficients monic
polynomials of the same degree $d$ such that polynomials $\{f_k(z)\}_{k=1}^m$
have no common {\it real} root of multiplicity $\geq n$ (but may have complex
common root of any multiplicity). %% These spaces can be regarded as one of
generalizations of the spaces defined and studied by Arnold and Vassiliev, and
they may be also considered as the real analogues of the spaces studied by B.
Farb and J. Wolfson. In this paper, we shall determine their homotopy types
explicitly and generalize some previously obtained results.
| math.AT | for positive integers dmngeq 1 with mnnot 11 and bbb kbbb r or bbb c let qdm_nbbb k denote the space of mtuples f_1zcdots f_mzin bbb k zm of bbb kcoefficients monic polynomials of the same degree d such that polynomials f_kz_k1m have no common it real root of multiplicity geq n but may have complex common root of any multiplicity these spaces can be regarded as one of generalizations of the spaces defined and studied by arnold and vassiliev and they may be also considered as the real analogues of the spaces studied by b farb and j wolfson in this paper we shall determine their homotopy types explicitly and generalize some previously obtained results | [['for', 'positive', 'integers', 'dmngeq', '1', 'with', 'mnnot', '11', 'and', 'bbb', 'kbbb', 'r', 'or', 'bbb', 'c', 'let', 'qdm_nbbb', 'k', 'denote', 'the', 'space', 'of', 'mtuples', 'f_1zcdots', 'f_mzin', 'bbb', 'k', 'zm', 'of', 'bbb', 'kcoefficients', 'monic', 'polynomials', 'of', 'the', 'same', 'degree', 'd', 'such', 'that', 'polynomials', 'f_kz_k1m', 'have', 'no', 'common', 'it', 'real', 'root', 'of', 'multiplicity', 'geq', 'n', 'but', 'may', 'have', 'complex', 'common', 'root', 'of', 'any', 'multiplicity', 'these', 'spaces', 'can', 'be', 'regarded', 'as', 'one', 'of', 'generalizations', 'of', 'the', 'spaces', 'defined', 'and', 'studied', 'by', 'arnold', 'and', 'vassiliev', 'and', 'they', 'may', 'be', 'also', 'considered', 'as', 'the', 'real', 'analogues', 'of', 'the', 'spaces', 'studied', 'by', 'b', 'farb', 'and', 'j', 'wolfson', 'in', 'this', 'paper', 'we', 'shall', 'determine', 'their', 'homotopy', 'types', 'explicitly', 'and', 'generalize', 'some', 'previously', 'obtained', 'results']] | [-0.1894451230607071, 0.12731759568575668, -0.01522106204081226, 0.039287967098717416, -0.029456682134050508, -0.16894653994120187, -0.06455178052786872, 0.302221905037358, -0.29528937809303535, -0.22600432521387512, 0.09540009933947544, -0.2644220176698254, -0.13481663494278584, 0.17773257636230205, -0.08661442225261985, -0.01662771194241941, -0.024884741833047556, 0.09675311591258054, -0.06888020869138911, -0.3449683179994961, 0.36645089284944776, -0.06830498549944579, 0.10184292319752637, 0.030310888084591373, 0.059808797887862065, 0.0007305261191307894, -0.039929887871383817, 0.024814132097342914, -0.20044180251027904, 0.07705686131790113, 0.29362390163933505, 0.1512336171974705, 0.23332487653389256, -0.3384402347896416, -0.1751832222347861, 0.27600175189693366, 0.22496544036527608, -0.07459955966427319, 0.03085156234383986, -0.2748804830291585, 0.1496624123296692, -0.12224057482816132, -0.17066735201221597, -0.0845962387996281, 0.1202440588307139, 0.09091445315327193, -0.27000287757045377, -0.005799445930106968, 0.11654365153328793, 0.15232637669756874, -0.03286619103505268, -0.23082224986943845, -0.07864124685744042, 0.08787417675469171, -0.022833492355169478, 0.11234628203689952, 0.01967516462192745, -0.015087691053899156, -0.16515436752642682, 0.3926180617397164, -0.03809469025728905, -0.23228967451565974, 0.16266774581661364, -0.19764223038260867, -0.15424430852772686, 0.0993042828427074, 0.10752811389849395, 0.1465210726711194, -0.0086434185924428, 0.17811057169665792, -0.13043337658903487, 0.05594055881505614, 0.1586137209507125, 0.019886512694217533, 0.11553367257520959, -0.030563738599822327, -0.003216564395204858, 0.09662786686608384, 0.00020014802581286645, 0.0050945208352352785, -0.319708764922243, -0.19493668421112872, -0.1833664415328688, 0.15097809008633098, -0.14297596481759814, -0.12387425042185429, 0.33265465720732873, 0.060864886745122505, 0.20091241774325436, 0.10357885137787676, 0.1616684687198014, 0.0685404733820768, 0.05606888504651677, 0.05730647967104708, 0.07737575569279231, 0.1697769843016726, 0.03494839236006007, -0.12041207872591242, 0.024648734032772145, 0.16141209264730547] |
1,803.02155 | Self-Attention with Relative Position Representations | Relying entirely on an attention mechanism, the Transformer introduced by
Vaswani et al. (2017) achieves state-of-the-art results for machine
translation. In contrast to recurrent and convolutional neural networks, it
does not explicitly model relative or absolute position information in its
structure. Instead, it requires adding representations of absolute positions to
its inputs. In this work we present an alternative approach, extending the
self-attention mechanism to efficiently consider representations of the
relative positions, or distances between sequence elements. On the WMT 2014
English-to-German and English-to-French translation tasks, this approach yields
improvements of 1.3 BLEU and 0.3 BLEU over absolute position representations,
respectively. Notably, we observe that combining relative and absolute position
representations yields no further improvement in translation quality. We
describe an efficient implementation of our method and cast it as an instance
of relation-aware self-attention mechanisms that can generalize to arbitrary
graph-labeled inputs.
| cs.CL | relying entirely on an attention mechanism the transformer introduced by vaswani et al 2017 achieves stateoftheart results for machine translation in contrast to recurrent and convolutional neural networks it does not explicitly model relative or absolute position information in its structure instead it requires adding representations of absolute positions to its inputs in this work we present an alternative approach extending the selfattention mechanism to efficiently consider representations of the relative positions or distances between sequence elements on the wmt 2014 englishtogerman and englishtofrench translation tasks this approach yields improvements of 13 bleu and 03 bleu over absolute position representations respectively notably we observe that combining relative and absolute position representations yields no further improvement in translation quality we describe an efficient implementation of our method and cast it as an instance of relationaware selfattention mechanisms that can generalize to arbitrary graphlabeled inputs | [['relying', 'entirely', 'on', 'an', 'attention', 'mechanism', 'the', 'transformer', 'introduced', 'by', 'vaswani', 'et', 'al', '2017', 'achieves', 'stateoftheart', 'results', 'for', 'machine', 'translation', 'in', 'contrast', 'to', 'recurrent', 'and', 'convolutional', 'neural', 'networks', 'it', 'does', 'not', 'explicitly', 'model', 'relative', 'or', 'absolute', 'position', 'information', 'in', 'its', 'structure', 'instead', 'it', 'requires', 'adding', 'representations', 'of', 'absolute', 'positions', 'to', 'its', 'inputs', 'in', 'this', 'work', 'we', 'present', 'an', 'alternative', 'approach', 'extending', 'the', 'selfattention', 'mechanism', 'to', 'efficiently', 'consider', 'representations', 'of', 'the', 'relative', 'positions', 'or', 'distances', 'between', 'sequence', 'elements', 'on', 'the', 'wmt', '2014', 'englishtogerman', 'and', 'englishtofrench', 'translation', 'tasks', 'this', 'approach', 'yields', 'improvements', 'of', '13', 'bleu', 'and', '03', 'bleu', 'over', 'absolute', 'position', 'representations', 'respectively', 'notably', 'we', 'observe', 'that', 'combining', 'relative', 'and', 'absolute', 'position', 'representations', 'yields', 'no', 'further', 'improvement', 'in', 'translation', 'quality', 'we', 'describe', 'an', 'efficient', 'implementation', 'of', 'our', 'method', 'and', 'cast', 'it', 'as', 'an', 'instance', 'of', 'relationaware', 'selfattention', 'mechanisms', 'that', 'can', 'generalize', 'to', 'arbitrary', 'graphlabeled', 'inputs']] | [-0.05904298762382992, 0.01590855178094621, -0.07715165928494952, 0.025278049605363544, -0.08805509117029026, -0.11758729068443496, 0.08766790532345177, 0.4815697263635642, -0.27796333755782626, -0.37405160912940055, 0.021906925259646794, -0.2546991789548374, -0.158527515521884, 0.20740528507257236, -0.16715720560771566, 0.0347332274177977, 0.10114291240296043, 0.04434881489789972, -0.1135804058648712, -0.298194776048078, 0.24311413088522799, 0.07807627380561374, 0.34383532043227744, 0.015842510276665608, 0.1525660669001757, 0.006823349886917318, -0.043955176844136086, -0.0586019684032187, -0.06159863343963099, 0.1948176787312453, 0.20664337035664854, 0.14593970844958057, 0.25533640559214493, -0.3462569011533831, -0.1732369984652028, 0.10331196608087907, 0.1154777450612515, 0.10568919217755608, 0.012325280423586568, -0.3096793775664682, 0.07822395148703577, -0.18577959602748223, -0.019596804679761118, -0.13881271403177198, 0.024380791499708773, -0.028332380117214423, -0.27046451384923254, 0.0508225333302262, 0.17494307819943578, 0.08197457382310155, -0.0747300148627833, -0.14531159501337837, 0.023916217797363165, 0.15127235182712898, -0.008224896688661571, 0.11759897017214077, 0.10074882517099804, -0.13721985835334324, -0.20019681043039467, 0.34859887571635506, -0.09514807608615977, -0.22622010042124713, 0.18623894873134633, -0.01184882194213305, -0.1253195918951157, 0.0758163387365375, 0.20896976058212843, 0.11538386583891334, -0.11480132911844734, 0.037844001841879985, -0.03670099997192833, 0.2194891915696257, 0.10891257516266976, 0.006660290381950425, 0.1475527408195937, 0.18262842945516744, 0.01875034160912037, 0.08517005550014582, -0.10676243320497163, -0.07182788435272304, -0.2430517627454713, -0.11561762873109774, -0.13733112890312962, -0.005803882150067816, -0.06358908748546044, -0.11795332021218666, 0.38865841675470486, 0.22810756257596485, 0.253880769810276, 0.10686902442108179, 0.3077534453840992, 0.05068344978866636, 0.10132101500334205, 0.12151258829601294, 0.22321616335448327, 0.047941066425438994, 0.09749081576571648, -0.16607964946723258, 0.07910722123743003, 0.10996326890688204] |
1,803.02156 | Chebyshev Filter Diagonalization on Modern Manycore Processors and
GPGPUs | Chebyshev filter diagonalization is well established in quantum chemistry and
quantum physics to compute bulks of eigenvalues of large sparse matrices.
Choosing a block vector implementation, we investigate optimization
opportunities on the new class of high-performance compute devices featuring
both high-bandwidth and low-bandwidth memory. We focus on the transparent
access to the full address space supported by both architectures under
consideration: Intel Xeon Phi "Knights Landing" and Nvidia "Pascal."
We propose two optimizations: (1) Subspace blocking is applied for improved
performance and data access efficiency. We also show that it allows
transparently handling problems much larger than the high-bandwidth memory
without significant performance penalties. (2) Pipelining of communication and
computation phases of successive subspaces is implemented to hide communication
costs without extra memory traffic.
As an application scenario we use filter diagonalization studies on
topological insulator materials. Performance numbers on up to 512 nodes of the
OakForest-PACS and Piz Daint supercomputers are presented, achieving beyond 100
Tflop/s for computing 100 inner eigenvalues of sparse matrices of dimension one
billion.
| cs.MS cs.PF physics.comp-ph | chebyshev filter diagonalization is well established in quantum chemistry and quantum physics to compute bulks of eigenvalues of large sparse matrices choosing a block vector implementation we investigate optimization opportunities on the new class of highperformance compute devices featuring both highbandwidth and lowbandwidth memory we focus on the transparent access to the full address space supported by both architectures under consideration intel xeon phi knights landing and nvidia pascal we propose two optimizations 1 subspace blocking is applied for improved performance and data access efficiency we also show that it allows transparently handling problems much larger than the highbandwidth memory without significant performance penalties 2 pipelining of communication and computation phases of successive subspaces is implemented to hide communication costs without extra memory traffic as an application scenario we use filter diagonalization studies on topological insulator materials performance numbers on up to 512 nodes of the oakforestpacs and piz daint supercomputers are presented achieving beyond 100 tflops for computing 100 inner eigenvalues of sparse matrices of dimension one billion | [['chebyshev', 'filter', 'diagonalization', 'is', 'well', 'established', 'in', 'quantum', 'chemistry', 'and', 'quantum', 'physics', 'to', 'compute', 'bulks', 'of', 'eigenvalues', 'of', 'large', 'sparse', 'matrices', 'choosing', 'a', 'block', 'vector', 'implementation', 'we', 'investigate', 'optimization', 'opportunities', 'on', 'the', 'new', 'class', 'of', 'highperformance', 'compute', 'devices', 'featuring', 'both', 'highbandwidth', 'and', 'lowbandwidth', 'memory', 'we', 'focus', 'on', 'the', 'transparent', 'access', 'to', 'the', 'full', 'address', 'space', 'supported', 'by', 'both', 'architectures', 'under', 'consideration', 'intel', 'xeon', 'phi', 'knights', 'landing', 'and', 'nvidia', 'pascal', 'we', 'propose', 'two', 'optimizations', '1', 'subspace', 'blocking', 'is', 'applied', 'for', 'improved', 'performance', 'and', 'data', 'access', 'efficiency', 'we', 'also', 'show', 'that', 'it', 'allows', 'transparently', 'handling', 'problems', 'much', 'larger', 'than', 'the', 'highbandwidth', 'memory', 'without', 'significant', 'performance', 'penalties', '2', 'pipelining', 'of', 'communication', 'and', 'computation', 'phases', 'of', 'successive', 'subspaces', 'is', 'implemented', 'to', 'hide', 'communication', 'costs', 'without', 'extra', 'memory', 'traffic', 'as', 'an', 'application', 'scenario', 'we', 'use', 'filter', 'diagonalization', 'studies', 'on', 'topological', 'insulator', 'materials', 'performance', 'numbers', 'on', 'up', 'to', '512', 'nodes', 'of', 'the', 'oakforestpacs', 'and', 'piz', 'daint', 'supercomputers', 'are', 'presented', 'achieving', 'beyond', '100', 'tflops', 'for', 'computing', '100', 'inner', 'eigenvalues', 'of', 'sparse', 'matrices', 'of', 'dimension', 'one', 'billion']] | [-0.19663629449970094, 0.06034682103725131, 0.0014833600078461438, 0.029232347076868958, -0.08212775534663636, -0.22066989578802645, 0.0804314321050277, 0.41763935482801773, -0.24432507757450173, -0.34348255605299094, 0.12447914277057345, -0.261319020928277, -0.12061648823723153, 0.22677299925181243, -0.05892706615454242, 0.12340342225272694, 0.11699482969135135, -0.019890438597208474, -0.11818593942244074, -0.29051315405587913, 0.21456507501914304, 0.07906716999586826, 0.29212493086564384, 0.058002846166367514, 0.07878434842937355, -0.012508607235290771, 0.0028049899340943383, -0.07744219270689805, -0.06290202312497456, 0.1211634378814133, 0.24833966552461745, 0.1363619486842657, 0.2825698740119059, -0.4809090569343269, -0.1354522716760988, 0.06763989238355023, 0.1337436774784159, 0.037397800418465625, -0.06108969859448234, -0.2842809658651874, 0.12747127713481263, -0.21979836774741976, -0.05206325074742871, -0.14800407276654165, -0.026908703228271394, -0.03282499585449475, -0.2726022182335559, -0.012422511837832332, -0.00333000786503303, 0.055619841502130736, 0.013939653400565254, -0.1789500494404922, 0.07188891724011029, 0.09887056709019214, -0.06223845081961819, -0.007486773680994761, 0.1756127683715151, -0.099569006216817, -0.17666688131185018, 0.38414970734955733, -0.003923486727141753, -0.19732067481333598, 0.18064575800300195, -0.06413341121558312, -0.13012553572643704, 0.09907384594549706, 0.2507485577122986, 0.05599702288690794, -0.10199328369499576, 0.12231888797150693, 0.017817809378739294, 0.18750042410721704, 0.08666651119814205, 0.08964676363600318, 0.12354472603445002, 0.21716316048463685, 0.10889191445295242, 0.17442314900711356, -0.09642297503284934, -0.14277128486331972, -0.20648991932800403, -0.20330562307234143, -0.24464857615475383, 0.0142896861973158, -0.12457517059964195, -0.15224807420208192, 0.3760488560173892, 0.17121644771572467, 0.13024120859163896, 0.10189900112465113, 0.35843110235529185, 0.023075236580003957, 0.15794552731487524, 0.17151865618976422, 0.1165840120682322, 0.09906497462060214, 0.13409873275306716, -0.18850796527323793, -0.008155609618806275, 0.03276158174838783] |
1,803.02157 | Kak's three-stage protocol of secure quantum communication revisited:
Hitherto unknown strengths and weaknesses of the protocol | Kak's three-stage protocol for quantum key distribution is revisited with
special focus on its hitherto unknown strengths and weaknesses. It is shown
that this protocol can be used for secure direct quantum communication.
Further, the implementability of this protocol in the realistic situation is
analyzed by considering various Markovian noise models. It is found that the
Kak's protocol and its variants in their original form can be implemented only
in a restricted class of noisy channels, where the protocols can be transformed
to corresponding protocols based on logical qubits in decoherence free
subspace. Specifically, it is observed that Kak's protocol can be implemented
in the presence of collective rotation and collective dephasing noise, but
cannot be implemented in its original form in the presence of other types of
noise, like amplitude damping and phase damping noise. Further, the performance
of the protocol in the noisy environment is quantified by computing average
fidelity under various noise models, and subsequently a set of preferred states
for secure communication in noisy environment have also been identified.
| quant-ph | kaks threestage protocol for quantum key distribution is revisited with special focus on its hitherto unknown strengths and weaknesses it is shown that this protocol can be used for secure direct quantum communication further the implementability of this protocol in the realistic situation is analyzed by considering various markovian noise models it is found that the kaks protocol and its variants in their original form can be implemented only in a restricted class of noisy channels where the protocols can be transformed to corresponding protocols based on logical qubits in decoherence free subspace specifically it is observed that kaks protocol can be implemented in the presence of collective rotation and collective dephasing noise but cannot be implemented in its original form in the presence of other types of noise like amplitude damping and phase damping noise further the performance of the protocol in the noisy environment is quantified by computing average fidelity under various noise models and subsequently a set of preferred states for secure communication in noisy environment have also been identified | [['kaks', 'threestage', 'protocol', 'for', 'quantum', 'key', 'distribution', 'is', 'revisited', 'with', 'special', 'focus', 'on', 'its', 'hitherto', 'unknown', 'strengths', 'and', 'weaknesses', 'it', 'is', 'shown', 'that', 'this', 'protocol', 'can', 'be', 'used', 'for', 'secure', 'direct', 'quantum', 'communication', 'further', 'the', 'implementability', 'of', 'this', 'protocol', 'in', 'the', 'realistic', 'situation', 'is', 'analyzed', 'by', 'considering', 'various', 'markovian', 'noise', 'models', 'it', 'is', 'found', 'that', 'the', 'kaks', 'protocol', 'and', 'its', 'variants', 'in', 'their', 'original', 'form', 'can', 'be', 'implemented', 'only', 'in', 'a', 'restricted', 'class', 'of', 'noisy', 'channels', 'where', 'the', 'protocols', 'can', 'be', 'transformed', 'to', 'corresponding', 'protocols', 'based', 'on', 'logical', 'qubits', 'in', 'decoherence', 'free', 'subspace', 'specifically', 'it', 'is', 'observed', 'that', 'kaks', 'protocol', 'can', 'be', 'implemented', 'in', 'the', 'presence', 'of', 'collective', 'rotation', 'and', 'collective', 'dephasing', 'noise', 'but', 'can', 'not', 'be', 'implemented', 'in', 'its', 'original', 'form', 'in', 'the', 'presence', 'of', 'other', 'types', 'of', 'noise', 'like', 'amplitude', 'damping', 'and', 'phase', 'damping', 'noise', 'further', 'the', 'performance', 'of', 'the', 'protocol', 'in', 'the', 'noisy', 'environment', 'is', 'quantified', 'by', 'computing', 'average', 'fidelity', 'under', 'various', 'noise', 'models', 'and', 'subsequently', 'a', 'set', 'of', 'preferred', 'states', 'for', 'secure', 'communication', 'in', 'noisy', 'environment', 'have', 'also', 'been', 'identified']] | [-0.1653438030572169, 0.11830139069900923, -0.07618175524864988, 0.05916641465382886, 0.006632643634046631, -0.23918557919872305, 0.05595982702242896, 0.4033070203858888, -0.28231840631014654, -0.2771099971596623, 0.10361633430122687, -0.17462726175148124, -0.15533725223129338, 0.23041544008957243, -0.10782303550045123, 0.08368398553602151, 0.0506282082448403, 0.04975224147154682, -0.009569706333548249, -0.2858120973714381, 0.2882426844417364, 0.06465208553040036, 0.30121471248058623, 0.007360324765028347, 0.04644170939793874, -0.008611381185059061, 0.001311171430580575, 0.012048111725384477, -0.05217588248246332, 0.03795722350257385, 0.23518683721670838, 0.1486810410098205, 0.26072023033924485, -0.4135040311014344, -0.226018701160819, 0.11820187257273637, 0.15995558217735212, 0.16747071673215805, -0.015523946905594277, -0.34072538774631833, 0.06661549644362738, -0.20281569010460343, -0.047125076500420596, -0.09276595600109933, 0.005195473898844472, 0.0015704130684293207, -0.26501720526319894, 0.07208670338133387, 0.05019158464000057, 0.02489936670245624, 0.005470267784696115, -0.06052057998490402, 0.004782696527525269, 0.14504621621059394, -0.02736950213164519, 0.00037629633804718993, 0.16935896825837507, -0.1030467033156076, -0.13675990140656993, 0.3630234793286192, -0.042265301067168, -0.24246611126066966, 0.16507587155685813, -0.05761172384259173, -0.12568219957321924, 0.10124295865166826, 0.167356629570914, 0.05907609891922524, -0.19833996770475273, 0.07421763497505113, -0.004679202442338434, 0.18954517656466227, 0.03324736345388081, 0.12754077882099168, 0.12713589258900115, 0.13718206581496367, 0.03928960592823167, 0.16285379882132495, -0.07623764378387995, -0.13010015196017063, -0.2453231262096643, -0.1319247630917221, -0.22004962694863306, 0.04242540699914539, -0.04182008824228569, -0.09574760271663826, 0.3797919892186791, 0.18597122383151396, 0.13978923958640588, -0.001546003747378187, 0.34858382243566727, 0.1193162164666413, 0.05335523660800516, 0.08738959902073203, 0.24426647478543306, 0.1257551134531868, 0.0662298096857708, -0.23019411768657208, 0.16435044984354627, -0.03276623056762606] |
1,803.02158 | Engineering steady Knill-Laflamme-Milburn state of Rydberg atoms by
dissipation | The Knill-Laflamme-Milburn (KLM) states have been proved to be a useful
resource for quantum information processing [Nature 409, 46 (2001)]. For atomic
KLM states, several schemes have been put forward based on the time-dependent
unitary dynamics, but the dissipative generation of these states has not been
reported. This work discusses the possibility for creating different forms of
bipartite KLM states in neutral atom system, where the spontaneous emission of
excited Rydberg states, combined with the Rydberg antiblockade mechanism, is
actively exploited to engineer a steady KLM state from an arbitrary initial
state. The numerical simulation of the master equation signifies that a
fidelity above 99\% is available with the current experimental parameters.
| quant-ph | the knilllaflammemilburn klm states have been proved to be a useful resource for quantum information processing nature 409 46 2001 for atomic klm states several schemes have been put forward based on the timedependent unitary dynamics but the dissipative generation of these states has not been reported this work discusses the possibility for creating different forms of bipartite klm states in neutral atom system where the spontaneous emission of excited rydberg states combined with the rydberg antiblockade mechanism is actively exploited to engineer a steady klm state from an arbitrary initial state the numerical simulation of the master equation signifies that a fidelity above 99 is available with the current experimental parameters | [['the', 'knilllaflammemilburn', 'klm', 'states', 'have', 'been', 'proved', 'to', 'be', 'a', 'useful', 'resource', 'for', 'quantum', 'information', 'processing', 'nature', '409', '46', '2001', 'for', 'atomic', 'klm', 'states', 'several', 'schemes', 'have', 'been', 'put', 'forward', 'based', 'on', 'the', 'timedependent', 'unitary', 'dynamics', 'but', 'the', 'dissipative', 'generation', 'of', 'these', 'states', 'has', 'not', 'been', 'reported', 'this', 'work', 'discusses', 'the', 'possibility', 'for', 'creating', 'different', 'forms', 'of', 'bipartite', 'klm', 'states', 'in', 'neutral', 'atom', 'system', 'where', 'the', 'spontaneous', 'emission', 'of', 'excited', 'rydberg', 'states', 'combined', 'with', 'the', 'rydberg', 'antiblockade', 'mechanism', 'is', 'actively', 'exploited', 'to', 'engineer', 'a', 'steady', 'klm', 'state', 'from', 'an', 'arbitrary', 'initial', 'state', 'the', 'numerical', 'simulation', 'of', 'the', 'master', 'equation', 'signifies', 'that', 'a', 'fidelity', 'above', '99', 'is', 'available', 'with', 'the', 'current', 'experimental', 'parameters']] | [-0.1260584653667008, 0.17897798512331065, -0.07995693272927643, 0.030937004353160904, 0.014256322186806105, -0.19914921585586853, 0.07713948913026668, 0.354202338594145, -0.2228165353590157, -0.28458211072055356, 0.0511948831065508, -0.2539873619347678, -0.03749501150533823, 0.18856214924848505, 0.020615990822469548, 0.14309334676363505, 0.062279302859678864, -0.011517384648738829, -0.012756186477158085, -0.22041673543779844, 0.29171498036677285, 0.05782127549069368, 0.3351636796724051, 0.06764515045194587, 0.10495663024318803, -0.04170515501963174, 0.05484959635733893, -0.07642053782806865, -0.10155927973008667, 0.111057619328806, 0.26116366488193826, 0.0783179483072932, 0.27813860605238006, -0.4625526616665801, -0.2374592186034923, 0.08276913972804323, 0.13014660104298464, 0.22788123957746262, -0.07255282729810071, -0.3687627630341532, -0.024050239606627395, -0.20655821766870627, -0.11036567915497082, -0.11222745652360443, 0.06508625632600992, -0.02371548390614667, -0.24187654556694074, 0.061758134759397114, 0.019687301466287215, 0.041973505396786744, -0.05430830913454494, -0.09355828651938022, -0.02198330505390394, 0.09867420991317236, -0.09568999331116045, 0.030850103608307627, 0.11627073180248512, -0.1098006784180013, -0.18934859336254053, 0.3322058762839463, -0.046018411557140225, -0.1702087629320366, 0.1954660239623211, -0.1048031013945417, -0.13474310014862567, 0.12229017397787954, 0.09795630216623456, 0.07049752492873397, -0.1423575814447499, 0.05726661989631664, -0.043409553988437564, 0.19422424629945972, 0.053949159886022766, 0.11282603722065687, 0.18110471342931436, 0.13127282109676994, 0.018881320109358057, 0.1808273757435797, -0.06368780490343592, -0.15503872474489203, -0.23199627773491166, -0.15324484789899934, -0.21976012129120395, 0.09695792568020677, 0.03690851572069472, -0.09035893310959052, 0.42703328212623354, 0.12406860171384844, 0.15427028924542746, -0.05282276680268946, 0.26258676580619067, 0.15102981657089135, 0.012423830397892743, 0.08154684232015695, 0.2797368309693411, 0.1547134552965872, 0.07375691137817089, -0.2672319770063041, 0.11626666343779236, 0.007101776519058538] |
1,803.02159 | Exogenous Approach to Grid Cost Allocation in Peer-to-Peer Electricity
Markets | The deployment of distributed energy resources, combined with a more
proactive demand side, is inducing a new paradigm in power system operation and
electricity markets. Within a consumer-centric market framework, peer-to-peer
approaches have gained substantial interest. Peer-to-peer markets rely on
multi-bilateral direct negotiation among all players to match supply and
demand, and with product differentiation. These markets can yield a complete
mapping of exchanges onto the grid, hence allowing to rethink our approach to
sharing costs related to usage of common infrastructure and services. We
propose here to attribute such costs in a number of alternative ways that
reflects different views on usage of the grid and on cost allocation, i.e.,
uniformly and based on the electrical distance between players. Since
attribution mechanisms are defined in an exogenous manner and made transparent
they eventually affect the trades of the market participants and related grid
usage. The interest of our approach is illustrated on a test case using the
IEEE 39 bus test system, underlying the impact of attribution mechanisms on
trades and grid usage.
| cs.SY math.OC | the deployment of distributed energy resources combined with a more proactive demand side is inducing a new paradigm in power system operation and electricity markets within a consumercentric market framework peertopeer approaches have gained substantial interest peertopeer markets rely on multibilateral direct negotiation among all players to match supply and demand and with product differentiation these markets can yield a complete mapping of exchanges onto the grid hence allowing to rethink our approach to sharing costs related to usage of common infrastructure and services we propose here to attribute such costs in a number of alternative ways that reflects different views on usage of the grid and on cost allocation ie uniformly and based on the electrical distance between players since attribution mechanisms are defined in an exogenous manner and made transparent they eventually affect the trades of the market participants and related grid usage the interest of our approach is illustrated on a test case using the ieee 39 bus test system underlying the impact of attribution mechanisms on trades and grid usage | [['the', 'deployment', 'of', 'distributed', 'energy', 'resources', 'combined', 'with', 'a', 'more', 'proactive', 'demand', 'side', 'is', 'inducing', 'a', 'new', 'paradigm', 'in', 'power', 'system', 'operation', 'and', 'electricity', 'markets', 'within', 'a', 'consumercentric', 'market', 'framework', 'peertopeer', 'approaches', 'have', 'gained', 'substantial', 'interest', 'peertopeer', 'markets', 'rely', 'on', 'multibilateral', 'direct', 'negotiation', 'among', 'all', 'players', 'to', 'match', 'supply', 'and', 'demand', 'and', 'with', 'product', 'differentiation', 'these', 'markets', 'can', 'yield', 'a', 'complete', 'mapping', 'of', 'exchanges', 'onto', 'the', 'grid', 'hence', 'allowing', 'to', 'rethink', 'our', 'approach', 'to', 'sharing', 'costs', 'related', 'to', 'usage', 'of', 'common', 'infrastructure', 'and', 'services', 'we', 'propose', 'here', 'to', 'attribute', 'such', 'costs', 'in', 'a', 'number', 'of', 'alternative', 'ways', 'that', 'reflects', 'different', 'views', 'on', 'usage', 'of', 'the', 'grid', 'and', 'on', 'cost', 'allocation', 'ie', 'uniformly', 'and', 'based', 'on', 'the', 'electrical', 'distance', 'between', 'players', 'since', 'attribution', 'mechanisms', 'are', 'defined', 'in', 'an', 'exogenous', 'manner', 'and', 'made', 'transparent', 'they', 'eventually', 'affect', 'the', 'trades', 'of', 'the', 'market', 'participants', 'and', 'related', 'grid', 'usage', 'the', 'interest', 'of', 'our', 'approach', 'is', 'illustrated', 'on', 'a', 'test', 'case', 'using', 'the', 'ieee', '39', 'bus', 'test', 'system', 'underlying', 'the', 'impact', 'of', 'attribution', 'mechanisms', 'on', 'trades', 'and', 'grid', 'usage']] | [-0.14892851093973986, 0.025443605252427195, -0.06703041099552494, 0.025910521683486544, -0.09920804764829233, -0.15362428989389848, 0.15761249460515447, 0.4151812873525818, -0.2665137258176317, -0.31765544529664386, 0.11371417510411541, -0.29251847832581435, -0.11860784992639875, 0.20684100416135684, -0.15096263403418184, 0.02675163143196668, 0.05230272314267871, 0.00010968782422507461, 0.042181095680096134, -0.2802875691800025, 0.29623123426418535, 0.08314077224282698, 0.3546940147122047, 0.06789469302514162, 0.0840377033201057, 0.0035821876887381933, -0.08252938586135325, 0.0010221162650348812, -0.06781050975953166, 0.19356216637728116, 0.2776532514574777, 0.18494506541575337, 0.34702583602576076, -0.48605972272611553, -0.1803358473665156, 0.09792807694034779, 0.07154709047466602, 0.0015812150133109983, -0.03045284412588841, -0.22695560650445049, 0.032959614236753476, -0.27349308947497314, -0.04093018062038069, -0.09269185588379315, -0.009914928070408687, 0.047273648795725286, -0.2852219265856213, -0.007052690360759352, -0.003495084665094813, 0.0655319335972141, -0.04757761781708734, -0.09719818992953046, -0.04116762854993857, 0.17676641515338387, 0.06358894305678363, -0.06112469617817979, 0.1606446172294057, -0.10719120449750502, -0.18321876740885962, 0.41689464563353995, 0.0247572978152947, -0.17305107151002433, 0.192053624507757, -0.050271662807188415, -0.10481648268338678, 0.06197760057710539, 0.2555681134984914, 0.043838959168201186, -0.16504205800004132, 0.027527638991703227, -0.0016116769127975936, 0.1922764993278074, 0.07342027902640616, 0.03649844828960967, 0.22097348786847687, 0.21101834201093378, 0.14696657870449234, 0.0932595969857541, -0.007004504137533321, -0.178953026769276, -0.2177707750039796, -0.12531356861408072, -0.16703363895568804, 0.03284690319292847, -0.11151438864356444, -0.14958486694243106, 0.39418509767401494, 0.17271007235354646, 0.13438190968410144, 0.053916299946461646, 0.344418557644447, 0.06433413194722613, 0.07473294851209583, 0.13204020510117212, 0.13829440518321492, -0.020115501411933582, 0.17738456404286213, -0.1779638366377645, 0.14243821435656143, 0.001656923725419603] |
1,803.0216 | A PTAS for vertex guarding weakly-visible polygons - An extended
abstract | In this extended abstract, we present a PTAS for guarding the vertices of a
weakly-visible polygon $P$ from a subset of its vertices, or in other words, a
PTAS for computing a minimum dominating set of the visibility graph of the
vertices of $P$. We then show how to obtain a PTAS for vertex guarding $P$'s
boundary.
| cs.CG | in this extended abstract we present a ptas for guarding the vertices of a weaklyvisible polygon p from a subset of its vertices or in other words a ptas for computing a minimum dominating set of the visibility graph of the vertices of p we then show how to obtain a ptas for vertex guarding ps boundary | [['in', 'this', 'extended', 'abstract', 'we', 'present', 'a', 'ptas', 'for', 'guarding', 'the', 'vertices', 'of', 'a', 'weaklyvisible', 'polygon', 'p', 'from', 'a', 'subset', 'of', 'its', 'vertices', 'or', 'in', 'other', 'words', 'a', 'ptas', 'for', 'computing', 'a', 'minimum', 'dominating', 'set', 'of', 'the', 'visibility', 'graph', 'of', 'the', 'vertices', 'of', 'p', 'we', 'then', 'show', 'how', 'to', 'obtain', 'a', 'ptas', 'for', 'vertex', 'guarding', 'ps', 'boundary']] | [-0.20768393256834575, 0.05181109476169305, -0.07666377264208027, 0.05890002245307967, -0.1264107677021197, -0.15116794641029888, 0.16858212104749068, 0.3525906341674272, -0.3012967320558216, -0.2835362582284558, 0.08656533922684113, -0.3032238247854236, -0.1238138787988906, 0.08998442130749547, -0.07913024623745255, 0.025168828939578298, 0.14300874720460602, 0.09375355918226498, 0.02041812946221658, -0.24104237301435205, 0.26788497385236304, -0.07371576195250132, 0.09203245133643836, 0.06191592458136646, 0.09124273138253816, 0.04437296850872891, 0.020965626342721016, 0.13142747170890548, -0.15896421910396644, 0.11193985720663997, 0.2875110522311713, 0.21373301031832984, 0.2544734325659062, -0.42668542691639494, -0.13280885610064225, 0.2143360542166712, 0.10522367191567485, 0.07861594316948738, -0.007353047150120672, -0.21176738857424685, 0.12217257263338459, -0.1144253205275163, -0.1252573044954001, 0.08495890421701395, 0.16082347403945668, 0.027636945680049912, -0.32038069590843016, -0.07919521273496295, 0.10248643482503082, -0.012947782632961338, 0.027526931219784143, -0.15150953746134682, 0.03855897855828516, 0.056913436082790474, -0.12990364151275052, 0.11326751444721594, -0.004899193981795439, -0.13485121736552433, -0.20771944410600035, 0.4123913446840431, -0.031192935188300908, -0.18207236972271598, 0.08626563607582025, -0.1555026292335242, -0.1647515461830023, 0.1322642868783857, 0.1870546448044479, 0.19298138386303826, -0.10330317152381342, 0.1277757319902386, -0.14318879427446518, 0.1286643587185868, 0.15353208926639386, 0.0011997603744800603, 0.1704400804425989, 0.18940875153722508, 0.22937866258767567, 0.20651439123425266, -0.03527641863911413, 0.045828463143802116, -0.32318887912801336, -0.08811983577366586, -0.21901890198101423, 0.042392989296266545, -0.16858136047708935, -0.23808310062824084, 0.4599374549330345, 0.12079040920694492, 0.20341952812408895, 0.11974120575801603, 0.2800369451703903, 0.05341235406714467, 0.0014985237253962883, 0.1738365312339738, 0.14295923684923245, 0.04664575832430273, -0.05309486794950707, -0.20379581505715447, 0.033544491082596196, 0.12230257861249681] |
1,803.02161 | The December 2015 re-brightening of V404 Cyg: Variable absorption from
the accretion disc outflow | In December 2015 the black hole binary V404 Cyg underwent a secondary
outburst after the main June 2015 event. We monitored this re-brightening with
the INTEGRAL and Swift satellites, and in this paper we report the results of
the time-resolved spectral analysis of these data. The December outburst shared
similar characteristics with the June one. The well sampled INTEGRAL light
curve shows up to 10 Crab flares, which are separated by relatively weak
non-flaring emission phases when compared to the June outburst. The spectra are
well described by absorbed Comptonization models, with hard photon indices,
$\Gamma \lesssim 2$, and significant detections of a high-energy cut-off only
during the bright flares. This is in contrast to the June outburst, where the
Comptonization models gave electron temperatures mostly in the 30--50 keV
range, while some spectra were soft ($\Gamma \sim 2.5$) without signs of any
spectral cut-off. Similarly to the June outburst, we see clear sings of a
variable local absorber in the soft energy band covered by Swift/XRT and
INTEGRAL/JEM-X, which causes rapid spectral variations observed during the
flares. During one flare, both Swift and INTEGRAL captured V404 Cyg in a state
where the absorber was nearly Compton thick, $N_\textrm{H} \approx
10^{24}\,\textrm{cm}^{-2}$, and the broad band spectrum was similar to obscured
AGN spectra, as seen during the "plateaus" in the June outburst. We conclude
that the spectral behaviour of V404 Cyg during the December outburst was
analogous with the first few days of the June outburst, both having hard X-ray
flares that were intermittently influenced by obscuration due to nearly
Compton-thick outflows launched from the accretion disc.
| astro-ph.HE | in december 2015 the black hole binary v404 cyg underwent a secondary outburst after the main june 2015 event we monitored this rebrightening with the integral and swift satellites and in this paper we report the results of the timeresolved spectral analysis of these data the december outburst shared similar characteristics with the june one the well sampled integral light curve shows up to 10 crab flares which are separated by relatively weak nonflaring emission phases when compared to the june outburst the spectra are well described by absorbed comptonization models with hard photon indices gamma lesssim 2 and significant detections of a highenergy cutoff only during the bright flares this is in contrast to the june outburst where the comptonization models gave electron temperatures mostly in the 3050 kev range while some spectra were soft gamma sim 25 without signs of any spectral cutoff similarly to the june outburst we see clear sings of a variable local absorber in the soft energy band covered by swiftxrt and integraljemx which causes rapid spectral variations observed during the flares during one flare both swift and integral captured v404 cyg in a state where the absorber was nearly compton thick n_textrmh approx 1024textrmcm2 and the broad band spectrum was similar to obscured agn spectra as seen during the plateaus in the june outburst we conclude that the spectral behaviour of v404 cyg during the december outburst was analogous with the first few days of the june outburst both having hard xray flares that were intermittently influenced by obscuration due to nearly comptonthick outflows launched from the accretion disc | [['in', 'december', '2015', 'the', 'black', 'hole', 'binary', 'v404', 'cyg', 'underwent', 'a', 'secondary', 'outburst', 'after', 'the', 'main', 'june', '2015', 'event', 'we', 'monitored', 'this', 'rebrightening', 'with', 'the', 'integral', 'and', 'swift', 'satellites', 'and', 'in', 'this', 'paper', 'we', 'report', 'the', 'results', 'of', 'the', 'timeresolved', 'spectral', 'analysis', 'of', 'these', 'data', 'the', 'december', 'outburst', 'shared', 'similar', 'characteristics', 'with', 'the', 'june', 'one', 'the', 'well', 'sampled', 'integral', 'light', 'curve', 'shows', 'up', 'to', '10', 'crab', 'flares', 'which', 'are', 'separated', 'by', 'relatively', 'weak', 'nonflaring', 'emission', 'phases', 'when', 'compared', 'to', 'the', 'june', 'outburst', 'the', 'spectra', 'are', 'well', 'described', 'by', 'absorbed', 'comptonization', 'models', 'with', 'hard', 'photon', 'indices', 'gamma', 'lesssim', '2', 'and', 'significant', 'detections', 'of', 'a', 'highenergy', 'cutoff', 'only', 'during', 'the', 'bright', 'flares', 'this', 'is', 'in', 'contrast', 'to', 'the', 'june', 'outburst', 'where', 'the', 'comptonization', 'models', 'gave', 'electron', 'temperatures', 'mostly', 'in', 'the', '3050', 'kev', 'range', 'while', 'some', 'spectra', 'were', 'soft', 'gamma', 'sim', '25', 'without', 'signs', 'of', 'any', 'spectral', 'cutoff', 'similarly', 'to', 'the', 'june', 'outburst', 'we', 'see', 'clear', 'sings', 'of', 'a', 'variable', 'local', 'absorber', 'in', 'the', 'soft', 'energy', 'band', 'covered', 'by', 'swiftxrt', 'and', 'integraljemx', 'which', 'causes', 'rapid', 'spectral', 'variations', 'observed', 'during', 'the', 'flares', 'during', 'one', 'flare', 'both', 'swift', 'and', 'integral', 'captured', 'v404', 'cyg', 'in', 'a', 'state', 'where', 'the', 'absorber', 'was', 'nearly', 'compton', 'thick', 'n_textrmh', 'approx', '1024textrmcm2', 'and', 'the', 'broad', 'band', 'spectrum', 'was', 'similar', 'to', 'obscured', 'agn', 'spectra', 'as', 'seen', 'during', 'the', 'plateaus', 'in', 'the', 'june', 'outburst', 'we', 'conclude', 'that', 'the', 'spectral', 'behaviour', 'of', 'v404', 'cyg', 'during', 'the', 'december', 'outburst', 'was', 'analogous', 'with', 'the', 'first', 'few', 'days', 'of', 'the', 'june', 'outburst', 'both', 'having', 'hard', 'xray', 'flares', 'that', 'were', 'intermittently', 'influenced', 'by', 'obscuration', 'due', 'to', 'nearly', 'comptonthick', 'outflows', 'launched', 'from', 'the', 'accretion', 'disc']] | [-0.038693136743814596, 0.1570811117199724, -0.09462003266298265, 0.10577691828058856, -0.08895426088030327, -0.13397563230158444, 0.04522297226358205, 0.4646086819083342, -0.16339124822187379, -0.41467669454034206, 0.11684347493266511, -0.3587254917705959, -0.04114035296095711, 0.21042717952118695, -0.09710918683558703, 0.0016691624608664018, 0.11886356047284351, -0.1117806528811343, -0.05706011267589792, -0.26913888416217885, 0.2316841404507253, 0.1152704757559201, 0.13911669290852996, -0.022729990104178213, 0.05937386849622752, -0.016133528955737657, -0.05301791958177005, -0.11159675876205823, -0.08824000772608243, -0.0032268952683738943, 0.24484208208403907, 0.04561975177373069, 0.17747818181359315, -0.356617041850322, -0.23496389082580244, 0.03772798226619104, 0.1205382220394347, -0.09782769881278927, 0.034561568493779116, -0.2645464659286311, -0.013030057010363858, -0.23568748314777072, -0.12518079314240307, 0.09895228314705475, 0.08486462755234174, 0.0009703557505623771, -0.1767232638208266, 0.12883929907858266, 0.04244701002443315, 0.08314105812855557, -0.17629248628322527, -0.005587574695500563, -0.06580514365561166, 0.05239891698023849, 0.13504340698764625, 0.07583004417389913, 0.12802863463864855, -0.08589555850024072, -0.10861242106360085, 0.3318697344019728, -0.049514884763520284, 0.1793132585236135, 0.18339629995654214, -0.25839699784492554, -0.19892685473281538, 0.2717162360806229, 0.1252993235026293, 0.09742508273536585, -0.1213920751018208, 0.0009611675924597361, -0.010253303955344238, 0.26991668023028464, 0.07446717167677323, 0.033585490373332264, 0.2944306513083712, 0.08123238180315931, -0.057669166668827807, 0.16225817066349335, -0.2655119243833535, 0.0028366965030864723, -0.2750941377300066, -0.0411641364337279, -0.15155433330614612, 0.12433885941677288, -0.08934646705308279, -0.11187661313012523, 0.4354646363471336, 0.017840433455476503, 0.24059581686830464, -0.0536730326356296, 0.2612108226268078, 0.14873447895955014, 0.013830507819031206, 0.2013203888683457, 0.38748246223175953, 0.1188659004884649, 0.23284073654158077, -0.18072370513131455, 0.06224054799344882, 0.017906017478485154] |
1,803.02162 | Contrarian compulsions produce time dependent flocking of active
particles | Animals having a trend to align their velocities to an average of their
neighbors' may flock as illustrated by the Vicsek model and its variants. If,
in addition, they feel a systematic contrarian trend, the result may be a time
periodic adjustment of the flock or period doubling in time. This is
demonstrated by analyzing a modified Vicsek model of self-propelled particles
and its corresponding kinetic equation valid for a large number of particles.
We have carried out a stability and bifurcation analysis of the order-disorder
transition to spatially uniform stationary or time periodic solutions that are
characterized by their complex order parameters. Direct numerical simulations
differing from theoretical predictions indicate the formation of spatiotemporal
structures. Strikingly, we have found that increasing the usual alignment noise
may favor flocking and an optimum noise produces the strongest possible order
parameter.
| cond-mat.stat-mech cond-mat.soft | animals having a trend to align their velocities to an average of their neighbors may flock as illustrated by the vicsek model and its variants if in addition they feel a systematic contrarian trend the result may be a time periodic adjustment of the flock or period doubling in time this is demonstrated by analyzing a modified vicsek model of selfpropelled particles and its corresponding kinetic equation valid for a large number of particles we have carried out a stability and bifurcation analysis of the orderdisorder transition to spatially uniform stationary or time periodic solutions that are characterized by their complex order parameters direct numerical simulations differing from theoretical predictions indicate the formation of spatiotemporal structures strikingly we have found that increasing the usual alignment noise may favor flocking and an optimum noise produces the strongest possible order parameter | [['animals', 'having', 'a', 'trend', 'to', 'align', 'their', 'velocities', 'to', 'an', 'average', 'of', 'their', 'neighbors', 'may', 'flock', 'as', 'illustrated', 'by', 'the', 'vicsek', 'model', 'and', 'its', 'variants', 'if', 'in', 'addition', 'they', 'feel', 'a', 'systematic', 'contrarian', 'trend', 'the', 'result', 'may', 'be', 'a', 'time', 'periodic', 'adjustment', 'of', 'the', 'flock', 'or', 'period', 'doubling', 'in', 'time', 'this', 'is', 'demonstrated', 'by', 'analyzing', 'a', 'modified', 'vicsek', 'model', 'of', 'selfpropelled', 'particles', 'and', 'its', 'corresponding', 'kinetic', 'equation', 'valid', 'for', 'a', 'large', 'number', 'of', 'particles', 'we', 'have', 'carried', 'out', 'a', 'stability', 'and', 'bifurcation', 'analysis', 'of', 'the', 'orderdisorder', 'transition', 'to', 'spatially', 'uniform', 'stationary', 'or', 'time', 'periodic', 'solutions', 'that', 'are', 'characterized', 'by', 'their', 'complex', 'order', 'parameters', 'direct', 'numerical', 'simulations', 'differing', 'from', 'theoretical', 'predictions', 'indicate', 'the', 'formation', 'of', 'spatiotemporal', 'structures', 'strikingly', 'we', 'have', 'found', 'that', 'increasing', 'the', 'usual', 'alignment', 'noise', 'may', 'favor', 'flocking', 'and', 'an', 'optimum', 'noise', 'produces', 'the', 'strongest', 'possible', 'order', 'parameter']] | [-0.16211329615447106, 0.15866898839540358, -0.10255335027472579, 0.06794018258479685, -0.07467298651542917, -0.13456855186348338, 0.06912776553608048, 0.39183415897297774, -0.24881905317976535, -0.3081592852065487, 0.08038515097582244, -0.25966858910396695, -0.15835800555219753, 0.1306731478987838, -0.018587282818587993, 0.030700678118879794, 0.04717999275458856, 0.025747325488285785, -0.021454304256962223, -0.21848632926925374, 0.24102558540649338, 0.07911847117055448, 0.24997592563640406, -0.027822642433021565, 0.09285380061474635, -0.04377525749368419, -0.03235584029298872, 0.0787504537386163, -0.1498936778207673, 0.043485033650808844, 0.17312841966962642, 0.04296352879710415, 0.27914724339523334, -0.4341219213235078, -0.22897571104196765, 0.12561526448506086, 0.182713527664569, 0.13624357395108602, -0.052371335522399, -0.2987557434671217, 0.06608660609910277, -0.1536817261513671, -0.18504490319760047, -0.08869942035961548, 0.04983695198299377, 0.0872192323114053, -0.26868576171519837, 0.11454993086572228, 0.08792512929871035, 0.08534852161387102, -0.09043764759344217, -0.07888699224111524, -0.07683072485726514, 0.11808500041357717, 0.09228620436310554, -0.00902310820135603, 0.1304877026194184, -0.10304298268282693, -0.13187620821643434, 0.3976691759345557, -0.04890644557861169, -0.19077474415124723, 0.24317952035591275, -0.12891066684086117, -0.07497995936398884, 0.16482645844062455, 0.16295474934183973, 0.08566403167201675, -0.12433641600228257, -0.002021517753668076, -0.030936154758008264, 0.1915585035860217, 0.07412944656039636, -0.018106892016521995, 0.2184999133971111, 0.15832492448858543, 0.06862861908831559, 0.11891982593094569, -0.07338820736212052, -0.15803408901510332, -0.2389739699470777, -0.0970350934138937, -0.1588656955311517, 0.022047863419757313, -0.14113517116488078, -0.16337198456883323, 0.39178568521085727, 0.1469867070223935, 0.20413146033445909, 0.07479280485644293, 0.23995331287209828, 0.10934074726809996, 0.02169774327121035, 0.03803224344369319, 0.2524015403607284, 0.09389238603071397, 0.11704823862185045, -0.21834156888858716, 0.11220607957501205, 0.015175816174194539] |
1,803.02163 | Revisit of cosmic ray antiprotons from dark matter annihilation with
updated constraints on the background model from AMS-02 and collider data | We study the cosmic ray antiprotons with updated constraints on the
propagation, proton injection, and solar modulation parameters based on the
newest AMS-02 data near the Earth and Voyager data in the local interstellar
space, and on the cross section of antiproton production due to proton-proton
collisions based on new collider data. We use a Bayesian approach to properly
consider the uncertainties of the model predictions of both the background and
the dark matter (DM) annihilation components of antiprotons. We find that
including an extra component of antiprotons from the annihilation of DM
particles into a pair of quarks can improve the fit to the AMS-02 antiproton
data considerably. The favored mass of DM particles is about $60\sim100$ GeV,
and the annihilation cross section is just at the level of the thermal
production of DM ($\langle\sigma v\rangle \sim O(10^{-26})$ cm$^3$~s$^{-1}$).
| astro-ph.HE hep-ph | we study the cosmic ray antiprotons with updated constraints on the propagation proton injection and solar modulation parameters based on the newest ams02 data near the earth and voyager data in the local interstellar space and on the cross section of antiproton production due to protonproton collisions based on new collider data we use a bayesian approach to properly consider the uncertainties of the model predictions of both the background and the dark matter dm annihilation components of antiprotons we find that including an extra component of antiprotons from the annihilation of dm particles into a pair of quarks can improve the fit to the ams02 antiproton data considerably the favored mass of dm particles is about 60sim100 gev and the annihilation cross section is just at the level of the thermal production of dm langlesigma vrangle sim o1026 cm3s1 | [['we', 'study', 'the', 'cosmic', 'ray', 'antiprotons', 'with', 'updated', 'constraints', 'on', 'the', 'propagation', 'proton', 'injection', 'and', 'solar', 'modulation', 'parameters', 'based', 'on', 'the', 'newest', 'ams02', 'data', 'near', 'the', 'earth', 'and', 'voyager', 'data', 'in', 'the', 'local', 'interstellar', 'space', 'and', 'on', 'the', 'cross', 'section', 'of', 'antiproton', 'production', 'due', 'to', 'protonproton', 'collisions', 'based', 'on', 'new', 'collider', 'data', 'we', 'use', 'a', 'bayesian', 'approach', 'to', 'properly', 'consider', 'the', 'uncertainties', 'of', 'the', 'model', 'predictions', 'of', 'both', 'the', 'background', 'and', 'the', 'dark', 'matter', 'dm', 'annihilation', 'components', 'of', 'antiprotons', 'we', 'find', 'that', 'including', 'an', 'extra', 'component', 'of', 'antiprotons', 'from', 'the', 'annihilation', 'of', 'dm', 'particles', 'into', 'a', 'pair', 'of', 'quarks', 'can', 'improve', 'the', 'fit', 'to', 'the', 'ams02', 'antiproton', 'data', 'considerably', 'the', 'favored', 'mass', 'of', 'dm', 'particles', 'is', 'about', '60sim100', 'gev', 'and', 'the', 'annihilation', 'cross', 'section', 'is', 'just', 'at', 'the', 'level', 'of', 'the', 'thermal', 'production', 'of', 'dm', 'langlesigma', 'vrangle', 'sim', 'o1026', 'cm3s1']] | [-0.05870859927779211, 0.2134219804376057, -0.0977721403138511, 0.15236076958336794, -0.06827966308911337, -0.038746426372349985, 0.006606662954143483, 0.3108942641762735, -0.22007030564889635, -0.35607539716330794, -0.05377011618948803, -0.3646801763663082, 0.11564663365791492, 0.20027825504159488, 0.07093274570740224, 0.04407376510496486, 0.10783063200898736, 0.021806095720087883, -0.007949400054987708, -0.26246876749896825, 0.2961985346820983, 0.16220763542776484, 0.20999098200645808, 0.14152447216165848, 0.0901548576808414, 0.04644689923688341, -0.07339153711084384, -0.10339311650713819, -0.1446045952669128, 0.13729526389330765, 0.1602637533838827, 0.11882225882342394, 0.03170477729056218, -0.4408616806052143, -0.1899486205811954, 0.20194554695919853, 0.1508962468800249, 0.033551049549400594, -0.06540880878723944, -0.3321243631217977, 0.06991538492017996, -0.24900050352749636, -0.07729667509075173, 0.024755487561882505, -0.015554775148898149, 0.0016087839076724306, -0.2880107202372855, 0.07763905421723512, -0.020671864847565512, -0.015164806309873036, -0.09670892399450992, -0.16345912225799059, -0.0557174141947582, -0.04492812282774303, 0.12373534404243872, 0.010451350487783725, 0.24856420289792067, -0.1591156797840347, -0.11440707305647271, 0.4215232619761134, -0.09898867616898936, -0.08681802443737874, 0.12993582547809795, -0.16277721185273183, -0.14232601457871766, 0.16351042022901796, 0.24461288728396133, 0.010435506597616905, -0.17457361312971698, 0.13811384972055918, -0.008243072362576457, 0.18450105355938615, 0.05280596326044995, -0.0075835225962960036, 0.261473470977206, 0.20846792092721025, 0.07313457373047051, -0.016911659771643526, -0.20801448052172825, -0.014577691637569194, -0.3703117804373983, -0.1412272067847762, -0.09199200526027264, 0.027572097263479832, -0.06182012689187235, -0.06514482549056679, 0.3475108891390532, 0.1250012052285639, 0.30369650355453115, -0.021661185867173208, 0.39176705937913, 0.0643388085844491, 0.020816919875621006, 0.0775335856579142, 0.32681533777684296, 0.15605537542108472, 0.14377772171559522, -0.19629852655812724, 0.042657307138090295, -0.017433889163323016] |
1,803.02164 | An Enriques Classification Theorem for Surfaces in Positive
Characteristic | We prove that a smooth projective surface $S$ over an algebraically closed
field of characteristic $p>3$ is birational to an abelian surface if
$P_1(S)=P_4(S)=1$ and $h^1(S,\mathcal{O}_S)=2$.
| math.AG | we prove that a smooth projective surface s over an algebraically closed field of characteristic p3 is birational to an abelian surface if p_1sp_4s1 and h1smathcalo_s2 | [['we', 'prove', 'that', 'a', 'smooth', 'projective', 'surface', 's', 'over', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', 'p3', 'is', 'birational', 'to', 'an', 'abelian', 'surface', 'if', 'p_1sp_4s1', 'and', 'h1smathcalo_s2']] | [-0.2650615447588886, 0.11372456297128035, -0.1403991582337767, 0.04451312026261197, -0.08954557085720201, -0.2047961264809904, -0.09574446400317053, 0.3799733333289623, -0.3791263233870268, -0.11140388793622454, 0.007338342470272134, -0.17027180422640717, -0.12286152517966305, 0.3190974114889589, -0.17679059819784015, -0.10708385830124219, -0.06872143527531686, 0.16787267375426987, -0.14280588375792527, -0.44376215571537614, 0.43800205442433554, -0.1591130766707162, 0.18785209608419487, 0.11360709687384467, 0.1477296038841208, 0.02414227727179726, 0.10942766241108377, 0.053519671161969505, -0.18405763150227963, 0.04674238796966771, 0.36818290191392106, 0.05753722184454091, 0.1287025910957406, -0.4170725510921329, -0.19830937819400182, 0.27890168557253975, 0.16162454802542925, 0.022751363498779636, -0.007545301778009161, -0.23093508432308832, 0.17387003874561438, -0.11816533216430496, -0.21269637567456812, -0.06152943312190473, 0.1861168616305804, -0.02848336601164192, -0.23609331188102564, -0.1037900559604168, 0.14626980371152362, 0.29119582947654027, -0.08385426884827514, 0.005702622351236641, -0.1276296298019588, -0.02499366223734493, 0.0351651552967572, 0.19353194705521068, 0.09039378641561295, -0.08358606765978038, -0.04264598432928324, 0.2616519384707014, -0.15910679187315205, -0.20024420243377486, 0.09806071470181148, -0.16648635198362172, -0.010135725994283954, 0.28611266271521646, 0.09014253178611398, 0.20881507413772246, 0.009003018611110747, 0.266713615814903, -0.15148116073881587, 0.15722831976988041, 0.037042926026818655, -0.12342544239557658, 0.1619456079400455, 0.0490446943246449, 0.13764544196116427, 0.06842400971800089, -0.09678065357729793, 0.046969034165764846, -0.44534477094809216, -0.28096408032191295, -0.08746048940035205, 0.27469248638954014, -0.08884834794965475, -0.21516514608326057, 0.4108722861856222, -0.029189363316011924, 0.16210053558461368, 0.10008404784214993, 0.20538269740063697, -0.0035413155953089395, -0.025939890804390114, 0.12042456785760199, 0.0491941156797111, 0.2438303001690656, -0.19675962722491627, -0.1493867753985493, -0.06801292558278267, 0.15412748052040115] |
1,803.02165 | Sparsity of curves and additive and multiplicative expansion of rational
maps over finite fields | For a prime $p$ and a polynomial $F(X,Y)$ over a finite field $\mathbb{F}_p$
of $p$ elements, we give upper bounds on the number of solutions $$ F(x,y)=0,
\quad x\in\mathcal{A}, \ y\in \mathcal{B}, $$ where $\mathcal{A}$ and
$\mathcal{B}$ are very small intervals or subgroups. These bounds can be
considered as positive characteristic analogues of the result of Bombieri and
Pila (1989) on sparsity of integral points on curves. As an application we
prove that distinct consecutive elements in sequences generated compositions of
several rational functions are not contained in any short intervals or small
subgroups.
| math.NT | for a prime p and a polynomial fxy over a finite field mathbbf_p of p elements we give upper bounds on the number of solutions fxy0 quad xinmathcala yin mathcalb where mathcala and mathcalb are very small intervals or subgroups these bounds can be considered as positive characteristic analogues of the result of bombieri and pila 1989 on sparsity of integral points on curves as an application we prove that distinct consecutive elements in sequences generated compositions of several rational functions are not contained in any short intervals or small subgroups | [['for', 'a', 'prime', 'p', 'and', 'a', 'polynomial', 'fxy', 'over', 'a', 'finite', 'field', 'mathbbf_p', 'of', 'p', 'elements', 'we', 'give', 'upper', 'bounds', 'on', 'the', 'number', 'of', 'solutions', 'fxy0', 'quad', 'xinmathcala', 'yin', 'mathcalb', 'where', 'mathcala', 'and', 'mathcalb', 'are', 'very', 'small', 'intervals', 'or', 'subgroups', 'these', 'bounds', 'can', 'be', 'considered', 'as', 'positive', 'characteristic', 'analogues', 'of', 'the', 'result', 'of', 'bombieri', 'and', 'pila', '1989', 'on', 'sparsity', 'of', 'integral', 'points', 'on', 'curves', 'as', 'an', 'application', 'we', 'prove', 'that', 'distinct', 'consecutive', 'elements', 'in', 'sequences', 'generated', 'compositions', 'of', 'several', 'rational', 'functions', 'are', 'not', 'contained', 'in', 'any', 'short', 'intervals', 'or', 'small', 'subgroups']] | [-0.24136317288891102, 0.11472497297234238, -0.0717407022551116, 0.06404310408462253, -0.036692129315472104, -0.12320806847678291, 0.03436521117885907, 0.34212702706249226, -0.3171126284326116, -0.22512846020464267, 0.10717224033497688, -0.29525700905877683, -0.08148370459158387, 0.2719913790416386, -0.12012528514282571, 0.02873787882272154, 0.04470766694802377, 0.08918004173061087, -0.06303234997257176, -0.33078527718058065, 0.30761790149327783, -0.12583779774399267, 0.15216492645235524, 0.02038983457411329, 0.08643340508763989, -0.0006801715586334467, 0.01025728516591092, 0.0031651251897629766, -0.1930794682280167, 0.09067508911636347, 0.30408088090933033, 0.12092198761335264, 0.2540147069013781, -0.3892371589731839, -0.11923671857479753, 0.24923324078424938, 0.16706069458482994, -0.024646044470783737, -0.022332912570952126, -0.24405658435490396, 0.16051847859699692, -0.12286836502866613, -0.0957946200027234, -0.0639415219736596, 0.12812849731934775, 0.10649868152621719, -0.33656520969234405, -0.02040577158331871, 0.1072413783830901, 0.15394533442870145, -0.04883806142024696, -0.21388173922378984, 0.015598701623578867, 0.07741401687574884, 0.018596753747098977, 0.04499494120245799, 0.02274216404184699, -0.04396303419230713, -0.09400349763196168, 0.3392777967473699, -0.0825667085333003, -0.21653320232613218, 0.1087095497124311, -0.19506290479459695, -0.1397309406246576, 0.1180487123835418, 0.1563107283708329, 0.17580559468931622, -0.017335669753245183, 0.1947032512353164, -0.15477827926062876, 0.11718645909956346, 0.16555204429767198, 0.028811730899744564, 0.14966461468332756, 0.010576593932799166, 0.0793102092627022, 0.07146857701655891, 0.00761334804766294, 0.04511943044554856, -0.3964333991623587, -0.13639256337450612, -0.1735562715679407, 0.10663240022404352, -0.130256656018739, -0.21724720067189385, 0.3483130897912714, 0.030835869483740275, 0.21552898345722094, 0.11434355792072085, 0.18549019649831786, 0.09409466737415642, 0.0262960443027421, 0.06475712064032753, 0.06047940362865726, 0.17370999544445012, -0.05265475618264948, -0.10493320484852625, 0.05397746643672387, 0.16198322662773232] |
1,803.02166 | Observation of the Semileptonic Decay $D^0 \to a_0(980)^- e^+ \nu_e$ and
Evidence for $D^+ \to a_0(980)^0 e^+ \nu_e$ | Using an $e^+e^-$ collision data sample of 2.93 fb$^{-1}$ collected at a
center-of-mass energy of 3.773 GeV by the BESIII detector at BEPCII, we report
the observation of $D^0 \to a_0(980)^- e^+ \nu_e$ and evidence for $D^+ \to
a_0(980)^0 e^+ \nu_e~$ with significances of $6.4\sigma$ and $2.9\sigma$,
respectively. The absolute branching fractions are determined to be
$\mathcal{B}(D^0 \to a_0(980)^- e^+ \nu_e)\times\mathcal{B}(a_0(980)^- \to \eta
\pi^-) = (1.33_{-0.29}^{+0.33}({\rm stat})\pm0.09({\rm syst}))\times10^{-4}~$
and $\mathcal{B}(D^+ \to a_0(980)^0 e^+ \nu_e)\times\mathcal{B}(a_0(980)^0 \to
\eta \pi^0) = (1.66_{-0.66}^{+0.81}({\rm stat})\pm0.11({\rm
syst}))\times10^{-4}~$.
An upper limit of $\mathcal{B}(D^+ \to a_0(980)^0 e^+
\nu_e)\times\mathcal{B}(a_0(980)^0 \to \eta \pi^0)<3.0\times10^{-4}~$ is also
determined at the $90\%~$ confidence level.
| hep-ex | using an ee collision data sample of 293 fb1 collected at a centerofmass energy of 3773 gev by the besiii detector at bepcii we report the observation of d0 to a_0980 e nu_e and evidence for d to a_09800 e nu_e with significances of 64sigma and 29sigma respectively the absolute branching fractions are determined to be mathcalbd0 to a_0980 e nu_etimesmathcalba_0980 to eta pi 133_029033rm statpm009rm systtimes104 and mathcalbd to a_09800 e nu_etimesmathcalba_09800 to eta pi0 166_066081rm statpm011rm systtimes104 an upper limit of mathcalbd to a_09800 e nu_etimesmathcalba_09800 to eta pi030times104 is also determined at the 90 confidence level | [['using', 'an', 'ee', 'collision', 'data', 'sample', 'of', '293', 'fb1', 'collected', 'at', 'a', 'centerofmass', 'energy', 'of', '3773', 'gev', 'by', 'the', 'besiii', 'detector', 'at', 'bepcii', 'we', 'report', 'the', 'observation', 'of', 'd0', 'to', 'a_0980', 'e', 'nu_e', 'and', 'evidence', 'for', 'd', 'to', 'a_09800', 'e', 'nu_e', 'with', 'significances', 'of', '64sigma', 'and', '29sigma', 'respectively', 'the', 'absolute', 'branching', 'fractions', 'are', 'determined', 'to', 'be', 'mathcalbd0', 'to', 'a_0980', 'e', 'nu_etimesmathcalba_0980', 'to', 'eta', 'pi', '133_029033rm', 'statpm009rm', 'systtimes104', 'and', 'mathcalbd', 'to', 'a_09800', 'e', 'nu_etimesmathcalba_09800', 'to', 'eta', 'pi0', '166_066081rm', 'statpm011rm', 'systtimes104', 'an', 'upper', 'limit', 'of', 'mathcalbd', 'to', 'a_09800', 'e', 'nu_etimesmathcalba_09800', 'to', 'eta', 'pi030times104', 'is', 'also', 'determined', 'at', 'the', '90', 'confidence', 'level']] | [-0.1027109943909806, 0.19168888260949413, -0.08408545459119174, 0.06777848688512017, -0.024232822900208142, -0.1092825157741842, 0.138812283862505, 0.30065412529754443, -0.15877232755851614, -0.2982327365776995, -0.07995115143789368, -0.4289751502756889, 0.12374819788549628, 0.17794045283213503, 0.06358847170965848, 0.09814249593598236, 0.10408831974696163, 0.05762272386473941, 0.011951170426762693, -0.16876552002453296, 0.1571789077255404, 0.14423389829040228, 0.16337305220908352, 0.1017585772314815, 0.036969123486235, -0.014363114811623326, -0.03140294126613618, -0.13760372957439868, -0.2113013609292006, 0.041519647608715834, 0.28418845794634423, 0.10021410798551617, 0.06709923429905877, -0.2501770991950832, 0.07147324057858806, 0.22973958410036105, 0.12476158619520593, -0.09153486905167912, 0.10212958719745115, -0.43228816367931416, 0.23710620901700888, -0.1913540350621218, -0.08848912396230274, -0.004849592020356475, 0.16282667769221487, -0.12651429577106302, -0.37133000901603436, 0.08004466728991727, -0.07028834517676752, 0.11847998061349134, -0.051688913793231435, -0.2924376109635437, -0.06265045061149727, -0.09185978098373328, 0.06717963986339273, 0.1465653568819027, 0.1658505025974751, -0.05841646685295707, -0.18000208559845174, 0.30867582793951365, -0.07245402267346016, -0.11557942087657157, 0.15621466475671955, -0.25803054219807736, -0.08262398810852524, 0.26523595011619094, 0.25726623080957395, -0.009170335482110034, -0.19427037461159322, 0.10755807317724288, 0.012111386498193266, 0.1702725160252917, 0.1327623753849376, 0.02313360030466056, 0.1385625290484833, 0.17901654662257369, -0.010345387804721082, -0.004297682955339142, -0.18215141295977347, 0.07395723516346661, -0.4045900747750548, -0.11167768559196023, -0.05189097319105333, 0.16140514073872958, 0.012024237959009882, 0.017764762054187255, 0.2657622179313266, 0.003523671299482665, 0.3988345632595675, 0.019208354967554193, 0.21680352549774798, 0.14338784101982038, -0.06098486106986037, 0.0732213423720428, 0.2934758608475082, 0.17741857448869108, 0.1128068950339374, -0.2753639178360802, -0.026726612988808244, -0.021874029619189408] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.