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,802.0326 | The MUCHFUSS photometric campaign | Hot subdwarfs (sdO/Bs) are the helium-burning cores of red giants, which lost
almost all of their hydrogen envelopes. This mass loss is often triggered by
common envelope interactions with close stellar or even substellar companions.
Cool companions like late-type stars or brown dwarfs are detectable via
characteristic light curve variations like reflection effects and often also
eclipses. To search for such objects we obtained multi-band light curves of 26
close sdO/B binary candidates from the MUCHFUSS project with the BUSCA
instrument. We discovered a new eclipsing reflection effect system
($P=0.168938$~d) with a low-mass M dwarf companion ($0.116 M_{\rm \odot}$).
Three more reflection effect binaries found in the course of the campaign were
already published, two of them are eclipsing systems, in one system only
showing the reflection effect but no eclipses the sdB primary is found to be
pulsating. Amongst the targets without reflection effect a new long-period sdB
pulsator was discovered and irregular light variations were found in two sdO
stars. The found light variations allowed us to constrain the fraction of
reflection effect binaries and the substellar companion fraction around sdB
stars. The minimum fraction of reflection effect systems amongst the close sdB
binaries might be greater than 15\% and the fraction of close substellar
companions in sdB binaries might be as high as $8.0\%$. This would result in a
close substellar companion fraction to sdB stars of about 3\%. This fraction is
much higher than the fraction of brown dwarfs around possible progenitor
systems, which are solar-type stars with substellar companions around 1 AU, as
well as close binary white dwarfs with brown dwarf companions. This might be a
hint that common envelope interactions with substellar objects are
preferentially followed by a hot subdwarf phase.
| astro-ph.SR | hot subdwarfs sdobs are the heliumburning cores of red giants which lost almost all of their hydrogen envelopes this mass loss is often triggered by common envelope interactions with close stellar or even substellar companions cool companions like latetype stars or brown dwarfs are detectable via characteristic light curve variations like reflection effects and often also eclipses to search for such objects we obtained multiband light curves of 26 close sdob binary candidates from the muchfuss project with the busca instrument we discovered a new eclipsing reflection effect system p0168938d with a lowmass m dwarf companion 0116 m_rm odot three more reflection effect binaries found in the course of the campaign were already published two of them are eclipsing systems in one system only showing the reflection effect but no eclipses the sdb primary is found to be pulsating amongst the targets without reflection effect a new longperiod sdb pulsator was discovered and irregular light variations were found in two sdo stars the found light variations allowed us to constrain the fraction of reflection effect binaries and the substellar companion fraction around sdb stars the minimum fraction of reflection effect systems amongst the close sdb binaries might be greater than 15 and the fraction of close substellar companions in sdb binaries might be as high as 80 this would result in a close substellar companion fraction to sdb stars of about 3 this fraction is much higher than the fraction of brown dwarfs around possible progenitor systems which are solartype stars with substellar companions around 1 au as well as close binary white dwarfs with brown dwarf companions this might be a hint that common envelope interactions with substellar objects are preferentially followed by a hot subdwarf phase | [['hot', 'subdwarfs', 'sdobs', 'are', 'the', 'heliumburning', 'cores', 'of', 'red', 'giants', 'which', 'lost', 'almost', 'all', 'of', 'their', 'hydrogen', 'envelopes', 'this', 'mass', 'loss', 'is', 'often', 'triggered', 'by', 'common', 'envelope', 'interactions', 'with', 'close', 'stellar', 'or', 'even', 'substellar', 'companions', 'cool', 'companions', 'like', 'latetype', 'stars', 'or', 'brown', 'dwarfs', 'are', 'detectable', 'via', 'characteristic', 'light', 'curve', 'variations', 'like', 'reflection', 'effects', 'and', 'often', 'also', 'eclipses', 'to', 'search', 'for', 'such', 'objects', 'we', 'obtained', 'multiband', 'light', 'curves', 'of', '26', 'close', 'sdob', 'binary', 'candidates', 'from', 'the', 'muchfuss', 'project', 'with', 'the', 'busca', 'instrument', 'we', 'discovered', 'a', 'new', 'eclipsing', 'reflection', 'effect', 'system', 'p0168938d', 'with', 'a', 'lowmass', 'm', 'dwarf', 'companion', '0116', 'm_rm', 'odot', 'three', 'more', 'reflection', 'effect', 'binaries', 'found', 'in', 'the', 'course', 'of', 'the', 'campaign', 'were', 'already', 'published', 'two', 'of', 'them', 'are', 'eclipsing', 'systems', 'in', 'one', 'system', 'only', 'showing', 'the', 'reflection', 'effect', 'but', 'no', 'eclipses', 'the', 'sdb', 'primary', 'is', 'found', 'to', 'be', 'pulsating', 'amongst', 'the', 'targets', 'without', 'reflection', 'effect', 'a', 'new', 'longperiod', 'sdb', 'pulsator', 'was', 'discovered', 'and', 'irregular', 'light', 'variations', 'were', 'found', 'in', 'two', 'sdo', 'stars', 'the', 'found', 'light', 'variations', 'allowed', 'us', 'to', 'constrain', 'the', 'fraction', 'of', 'reflection', 'effect', 'binaries', 'and', 'the', 'substellar', 'companion', 'fraction', 'around', 'sdb', 'stars', 'the', 'minimum', 'fraction', 'of', 'reflection', 'effect', 'systems', 'amongst', 'the', 'close', 'sdb', 'binaries', 'might', 'be', 'greater', 'than', '15', 'and', 'the', 'fraction', 'of', 'close', 'substellar', 'companions', 'in', 'sdb', 'binaries', 'might', 'be', 'as', 'high', 'as', '80', 'this', 'would', 'result', 'in', 'a', 'close', 'substellar', 'companion', 'fraction', 'to', 'sdb', 'stars', 'of', 'about', '3', 'this', 'fraction', 'is', 'much', 'higher', 'than', 'the', 'fraction', 'of', 'brown', 'dwarfs', 'around', 'possible', 'progenitor', 'systems', 'which', 'are', 'solartype', 'stars', 'with', 'substellar', 'companions', 'around', '1', 'au', 'as', 'well', 'as', 'close', 'binary', 'white', 'dwarfs', 'with', 'brown', 'dwarf', 'companions', 'this', 'might', 'be', 'a', 'hint', 'that', 'common', 'envelope', 'interactions', 'with', 'substellar', 'objects', 'are', 'preferentially', 'followed', 'by', 'a', 'hot', 'subdwarf', 'phase']] | [-0.11275551452111608, 0.20367160691954325, -0.07425019677074542, 0.13772810073463954, -0.21264858171181553, -0.12327253068748614, 0.15974647744691797, 0.3687672875586326, -0.10817727765217683, -0.3897379090951087, 0.041132545797559934, -0.3374441679638489, -0.07112402040515425, 0.21940440376279455, -0.13917154729697295, -0.006209529897373312, 0.19468281459337497, -0.04907114920632278, -0.03376563358909973, -0.31894243974968767, 0.3099231611375895, 0.006127796503342039, -0.034357684402392355, -0.11326251815451238, -0.013677925597316544, -0.10458846704041397, -0.029000471899357304, -0.10283740562182374, -0.11348655400972651, -0.06393508701049803, 0.26781325149820395, 0.08043750989577268, 0.18891237373382683, -0.25995571735981876, -0.2242879877588955, 0.06417498958235418, 0.2005677886004235, -0.013151481920424913, -0.06404562480854177, -0.261362020376557, 0.1230103549029709, -0.2252626778616307, -0.19192428072226536, 0.07912333008836475, 0.09306456959881018, 0.03168586629705718, -0.21185473384147427, 0.08945867760244429, 0.10281684967966666, 0.13258192898179907, -0.14065011253804358, -0.17743325821052627, -0.07565095489406601, 0.0443892873675994, 0.03276298562379534, 0.06777828872911243, 0.13182531701212666, -0.08771817723795357, 0.01705233635582056, 0.4353221558538515, -0.10269748316382103, 0.013828730148600758, 0.3019652430402952, -0.2266042778586469, -0.14781419105036023, 0.16605923824719696, 0.15023504167256507, 0.19936458367646676, -0.21881198369693466, -0.08549382722164255, 0.007445126848996257, 0.2252659334376039, 0.1095159102275072, 0.09912866754059839, 0.46779642900198903, 0.12430795294284182, -0.004056497976729055, 0.07170821019109234, -0.2646812731717536, -0.026204191125768727, -0.12112363681151736, -0.09637906328038368, -0.10215717208862161, 0.07048915808481726, -0.08425715219376297, -0.13514363585455336, 0.2774935553347463, 0.0638041919728462, 0.1933528499942247, -0.015526026573343663, 0.2976737204608134, 0.08271734670773213, 0.13916325493138088, 0.14010578282956254, 0.35306891247967603, 0.2381550365611132, 0.09660648773318864, -0.24025650619600578, 0.09299247286839002, -0.037659481884944106] |
1,802.03261 | Topological Hochschild homology and integral $p$-adic Hodge theory | In mixed characteristic and in equal characteristic $p$ we define a
filtration on topological Hochschild homology and its variants. This filtration
is an analogue of the filtration of algebraic $K$-theory by motivic cohomology.
Its graded pieces are related in mixed characteristic to the complex $A\Omega$
constructed in our previous work, and in equal characteristic $p$ to
crystalline cohomology. Our construction of the filtration on $\mathrm{THH}$ is
via flat descent to semiperfectoid rings.
As one application, we refine the construction of the $A\Omega$-complex by
giving a cohomological construction of Breuil--Kisin modules for proper smooth
formal schemes over $\mathcal O_K$, where $K$ is a discretely valued extension
of $\mathbb Q_p$ with perfect residue field. As another application, we define
syntomic sheaves $\mathbb Z_p(n)$ for all $n\geq 0$ on a large class of
$\mathbb Z_p$-algebras, and identify them in terms of $p$-adic nearby cycles in
mixed characteristic, and in terms of logarithmic de~Rham-Witt sheaves in equal
characteristic $p$.
| math.AG math.KT math.NT | in mixed characteristic and in equal characteristic p we define a filtration on topological hochschild homology and its variants this filtration is an analogue of the filtration of algebraic ktheory by motivic cohomology its graded pieces are related in mixed characteristic to the complex aomega constructed in our previous work and in equal characteristic p to crystalline cohomology our construction of the filtration on mathrmthh is via flat descent to semiperfectoid rings as one application we refine the construction of the aomegacomplex by giving a cohomological construction of breuilkisin modules for proper smooth formal schemes over mathcal o_k where k is a discretely valued extension of mathbb q_p with perfect residue field as another application we define syntomic sheaves mathbb z_pn for all ngeq 0 on a large class of mathbb z_palgebras and identify them in terms of padic nearby cycles in mixed characteristic and in terms of logarithmic derhamwitt sheaves in equal characteristic p | [['in', 'mixed', 'characteristic', 'and', 'in', 'equal', 'characteristic', 'p', 'we', 'define', 'a', 'filtration', 'on', 'topological', 'hochschild', 'homology', 'and', 'its', 'variants', 'this', 'filtration', 'is', 'an', 'analogue', 'of', 'the', 'filtration', 'of', 'algebraic', 'ktheory', 'by', 'motivic', 'cohomology', 'its', 'graded', 'pieces', 'are', 'related', 'in', 'mixed', 'characteristic', 'to', 'the', 'complex', 'aomega', 'constructed', 'in', 'our', 'previous', 'work', 'and', 'in', 'equal', 'characteristic', 'p', 'to', 'crystalline', 'cohomology', 'our', 'construction', 'of', 'the', 'filtration', 'on', 'mathrmthh', 'is', 'via', 'flat', 'descent', 'to', 'semiperfectoid', 'rings', 'as', 'one', 'application', 'we', 'refine', 'the', 'construction', 'of', 'the', 'aomegacomplex', 'by', 'giving', 'a', 'cohomological', 'construction', 'of', 'breuilkisin', 'modules', 'for', 'proper', 'smooth', 'formal', 'schemes', 'over', 'mathcal', 'o_k', 'where', 'k', 'is', 'a', 'discretely', 'valued', 'extension', 'of', 'mathbb', 'q_p', 'with', 'perfect', 'residue', 'field', 'as', 'another', 'application', 'we', 'define', 'syntomic', 'sheaves', 'mathbb', 'z_pn', 'for', 'all', 'ngeq', '0', 'on', 'a', 'large', 'class', 'of', 'mathbb', 'z_palgebras', 'and', 'identify', 'them', 'in', 'terms', 'of', 'padic', 'nearby', 'cycles', 'in', 'mixed', 'characteristic', 'and', 'in', 'terms', 'of', 'logarithmic', 'derhamwitt', 'sheaves', 'in', 'equal', 'characteristic', 'p']] | [-0.21082620302350907, 0.05525962988445489, -0.127206488746829, 0.03527631143274538, -0.06648421741787665, -0.13567215455264248, -0.06088290754177558, 0.30797652614037724, -0.3869124203642818, -0.17745841960869854, 0.06999321952724323, -0.17652314301273347, -0.13417332383976718, 0.200064874173987, -0.19682546678332255, -0.041799049695725524, -0.048843442505558596, 0.12306382624117893, -0.05775051311102529, -0.320165848760366, 0.4067497934825373, -0.05066914020710631, 0.21235479668880633, 0.007797011935972417, 0.07671615534110476, 0.022399612489643672, -0.025301613413192182, -0.03823405563744982, -0.19393729429309634, 0.13601611139228112, 0.35370253672243546, -0.001303553016893319, 0.19917618710893076, -0.3712453387295272, -0.11568601686135088, 0.22004863071341735, 0.13483397632726277, -0.01288940807933987, 0.028189285981333165, -0.24211790610493364, 0.19222164963254865, -0.18890238636202605, -0.14620177556964142, -0.08031409310904757, 0.11374849367606152, 0.027522296422710087, -0.246114617722442, -0.020195064690759688, 0.07305704300223992, 0.20728043598024212, -0.12968848128833912, -0.12245781191652455, -0.05092452923283104, 0.03739919777133113, -0.026386385118983537, 0.06834436816761628, 0.10643786202425397, -0.08430715453724642, -0.16294703028158636, 0.3476615161912528, -0.12669426172552323, -0.20865607739962785, 0.11294991872427577, -0.16245185265576603, -0.151902722068353, 0.17022691326006162, 0.04603608353495203, 0.20373225277166393, 0.0619472497519081, 0.21084181440721222, -0.11039570962011025, 0.044054843332704825, 0.10851557196629856, 0.03182316342035666, 0.13738260345706185, 0.07265373023029491, 0.07008845567709415, 0.14129572034819632, -0.0015452004329606717, -0.06262696102656276, -0.3726431747747351, -0.2459057241989321, -0.12297660606490782, 0.18213535282785528, -0.10741934277969552, -0.18122049221855324, 0.4261766461199088, 0.0586388478185118, 0.18659310125698034, 0.14814618412429922, 0.25259504367023805, 0.03899791563509513, 0.05842230311634994, -0.019364859522759778, 0.031402929513314304, 0.23128636797199284, -0.02691838537290421, -0.12891088364012107, 0.0023975348106233885, 0.20297268854256795] |
1,802.03262 | A new approach to computing the asymptotics of the position of
Fisher-KPP fronts | This paper presents a novel way of computing front positions in Fisher-KPP
equations. Our method is based on an exact relation between the Laplace
transform of the initial condition and some integral functional of the front
position. Using singularity analysis, one can obtain the asymptotics of the
front position up to the O(log t/t) term. Our approach is robust and can be
generalised to other front equations.
| cond-mat.stat-mech | this paper presents a novel way of computing front positions in fisherkpp equations our method is based on an exact relation between the laplace transform of the initial condition and some integral functional of the front position using singularity analysis one can obtain the asymptotics of the front position up to the olog tt term our approach is robust and can be generalised to other front equations | [['this', 'paper', 'presents', 'a', 'novel', 'way', 'of', 'computing', 'front', 'positions', 'in', 'fisherkpp', 'equations', 'our', 'method', 'is', 'based', 'on', 'an', 'exact', 'relation', 'between', 'the', 'laplace', 'transform', 'of', 'the', 'initial', 'condition', 'and', 'some', 'integral', 'functional', 'of', 'the', 'front', 'position', 'using', 'singularity', 'analysis', 'one', 'can', 'obtain', 'the', 'asymptotics', 'of', 'the', 'front', 'position', 'up', 'to', 'the', 'olog', 'tt', 'term', 'our', 'approach', 'is', 'robust', 'and', 'can', 'be', 'generalised', 'to', 'other', 'front', 'equations']] | [-0.1283366727267406, 0.007795367829732722, -0.19043666416250948, 0.02696750043550812, -0.13619445200397898, -0.11980717825884027, 0.021030542977612966, 0.32854505703409215, -0.31923450543475684, -0.281401720787607, 0.10294191574559672, -0.28479000281042127, -0.17323739715476535, 0.18545526993085645, -0.04226362720521083, 0.07141034850683897, 0.05886841715494199, 0.03883630677418255, -0.10087600290608495, -0.2016207610548877, 0.32677694465687024, 0.026434482061373655, 0.26563498131764024, 0.040004057969564376, 0.12369307525344748, -0.018071755763393507, -0.02016800778236852, -0.03416414582518054, -0.14642111728412668, 0.1369884317417615, 0.1788596860028859, 0.11209892205643787, 0.2674917106085749, -0.4344109915641706, -0.14425595179756187, 0.0523109891688201, 0.18000354524701834, 0.1358349569030662, -0.013693688446030354, -0.3131783471317656, 0.06668675895224312, -0.11540720189240442, -0.2304330867673479, -0.029512687655749607, -0.0010992324626101042, 0.06286012623181093, -0.24645871475839348, 0.11005867771637529, 0.026906024480460963, -0.043714373358594835, -0.06254918310346443, -0.07924130377568193, 0.04462980343473714, 0.11078474184831799, 0.017156984670949515, 0.07785711342246453, 0.08749114978822198, -0.09983610368069651, -0.057437569980245476, 0.3484759161026398, -0.0984525716960875, -0.24164676655660758, 0.1296957149830605, -0.1237613339699916, -0.09986104137861906, 0.12154155888650288, 0.15867893698055352, 0.15449963119437002, -0.18605955976492433, 0.09226692907699842, -0.029556464264864354, 0.13682172400181863, 0.1020248269578859, -0.020570483475701132, 0.1175663580061562, 0.1370414628355361, 0.10457265022586086, 0.15659325423827672, -0.09881149028400098, -0.09886169437763852, -0.3684471350774836, -0.1782535146139979, -0.1541441290277932, -0.0030961194364076006, -0.14020153664620663, -0.20309618607497038, 0.380119871320342, 0.1459788704124182, 0.18184236321014477, 0.07957500868490827, 0.30603849821126283, 0.20661941943203668, -0.006751030614015771, 0.09778955303577345, 0.1577968438622479, 0.10921937594218041, 0.12257121178780252, -0.22881847560238927, 0.0846682104851995, 0.15633594310050136] |
1,802.03263 | Minimal kernels of Dirac operators along maps | Let $M$ be a closed spin manifold and let $N$ be a closed manifold. For maps
$f\colon M\to N$ and Riemannian metrics $g$ on $M$ and $h$ on $N$, we consider
the Dirac operator $D^f_{g,h}$ of the twisted Dirac bundle $\Sigma
M\otimes_{\mathbb{R}} f^*TN$. To this Dirac operator one can associate an index
in $KO^{-dim(M)}(pt)$. If $M$ is $2$-dimensional, one gets a lower bound for
the dimension of the kernel of $D^f_{g,h}$ out of this index. We investigate
the question whether this lower bound is obtained for generic tupels $(f,g,h)$.
| math.DG | let m be a closed spin manifold and let n be a closed manifold for maps fcolon mto n and riemannian metrics g on m and h on n we consider the dirac operator df_gh of the twisted dirac bundle sigma motimes_mathbbr ftn to this dirac operator one can associate an index in kodimmpt if m is 2dimensional one gets a lower bound for the dimension of the kernel of df_gh out of this index we investigate the question whether this lower bound is obtained for generic tupels fgh | [['let', 'm', 'be', 'a', 'closed', 'spin', 'manifold', 'and', 'let', 'n', 'be', 'a', 'closed', 'manifold', 'for', 'maps', 'fcolon', 'mto', 'n', 'and', 'riemannian', 'metrics', 'g', 'on', 'm', 'and', 'h', 'on', 'n', 'we', 'consider', 'the', 'dirac', 'operator', 'df_gh', 'of', 'the', 'twisted', 'dirac', 'bundle', 'sigma', 'motimes_mathbbr', 'ftn', 'to', 'this', 'dirac', 'operator', 'one', 'can', 'associate', 'an', 'index', 'in', 'kodimmpt', 'if', 'm', 'is', '2dimensional', 'one', 'gets', 'a', 'lower', 'bound', 'for', 'the', 'dimension', 'of', 'the', 'kernel', 'of', 'df_gh', 'out', 'of', 'this', 'index', 'we', 'investigate', 'the', 'question', 'whether', 'this', 'lower', 'bound', 'is', 'obtained', 'for', 'generic', 'tupels', 'fgh']] | [-0.21261556856777697, 0.15616047630308977, -0.04951602085271761, 0.0530460566944731, -0.0704919557319954, -0.21516710960505797, 0.02637329901335761, 0.33456211134658326, -0.24408447485239732, -0.24917817830490613, 0.06460978541664579, -0.2980838298487167, -0.134265024456129, 0.17385990059258238, -0.07686046547522503, -0.03786235329850266, 0.03082430460268543, 0.15224604434998973, -0.11025274271101114, -0.2344402844818043, 0.4189035144324104, -0.025628465554854346, 0.18422262715397492, 0.06741344050637313, 0.0959435549143347, -0.023208208224137446, 0.06082404172047973, -0.007620517990463192, -0.17132280810203934, 0.1070598390152944, 0.2345875140190834, 0.08785724110202864, 0.20433205014671244, -0.34791097182702896, -0.19882201677232625, 0.21175820736347564, 0.1546437981693695, -0.09115808552485846, 0.02487832350778349, -0.27500504937155973, 0.14442923308936206, -0.0751539979662214, -0.1597567464147384, -0.024712652134309922, 0.08881350990296119, -0.12589238219273588, -0.300475179389607, -0.03648283031292349, 0.09838712006984722, 0.03827620681286568, -0.02941503919594522, -0.12392229409444899, -0.07212324742050398, 0.077340910204276, -0.06102515702895332, 0.11390006805526182, 0.059259698781672684, -0.033928995884794165, -0.08122042557668119, 0.3576058925827965, -0.17321643839767648, -0.31473740225746516, 0.06353981667364549, -0.18009567034563848, -0.12497484930125731, 0.07905869057313317, 0.16172654722772895, 0.18943593236396, -0.04211345995732006, 0.2458950844461686, -0.1450775135696555, 0.11116304538500983, 0.06344949191303126, -0.041862067966056724, 0.16631063437532811, 0.1134766337456226, 0.19210461478325583, 0.1297453612815367, -0.027896832663654572, 0.045705792081121, -0.30884012553308693, -0.2472462602405964, -0.19853106371703602, 0.24435842256726964, -0.12429730010920875, -0.15021529570887132, 0.363765672248389, 0.008242772642656096, 0.2507266375413608, 0.08900534043398996, 0.21126507490962035, 0.15022986763644786, -0.00963120843793842, 0.12233334319067321, 0.09720622700461674, 0.19347156074252866, -0.02672242294509141, -0.18110086925194732, -0.06971987368472453, 0.16896613615210213] |
1,802.03264 | Mesoscopic simulations of anisotropic chemically-powered nanomotors | Chemically powered self-propelled colloids generate a motor force by
converting locally a source of energy into directed motion, a process that has
been explored both in experiments and in computational models. The use of
active colloids as building blocks for nanotechnology opens the doors to
interesting applications, provided we understand the behaviour of these
elementary constituents. We build a consistent mesoscopic simulation model for
self-propelled colloids of complex shape with the aim of resolving the coupling
between their translational and rotational motion. Considering a passive
L-shaped colloidal particle, we study its Brownian dynamics and locate its
center of hydrodynamics, the tracking point at which translation and rotation
decouple. The active L particle displays the same circling trajectories that
have been found experimentally, a result which we compare with the Brownian
dynamics model. We put forward the role of hydrodynamics by comparing our
results with a fluid model in which the particles' velocities are reset
randomly. There, the trajectories only display random orientations. We obtain
these original simulation results without any parametrization of the algorithm,
which makes it a useful method for the preliminary study of active colloids,
prior to experimental work.
| cond-mat.soft | chemically powered selfpropelled colloids generate a motor force by converting locally a source of energy into directed motion a process that has been explored both in experiments and in computational models the use of active colloids as building blocks for nanotechnology opens the doors to interesting applications provided we understand the behaviour of these elementary constituents we build a consistent mesoscopic simulation model for selfpropelled colloids of complex shape with the aim of resolving the coupling between their translational and rotational motion considering a passive lshaped colloidal particle we study its brownian dynamics and locate its center of hydrodynamics the tracking point at which translation and rotation decouple the active l particle displays the same circling trajectories that have been found experimentally a result which we compare with the brownian dynamics model we put forward the role of hydrodynamics by comparing our results with a fluid model in which the particles velocities are reset randomly there the trajectories only display random orientations we obtain these original simulation results without any parametrization of the algorithm which makes it a useful method for the preliminary study of active colloids prior to experimental work | [['chemically', 'powered', 'selfpropelled', 'colloids', 'generate', 'a', 'motor', 'force', 'by', 'converting', 'locally', 'a', 'source', 'of', 'energy', 'into', 'directed', 'motion', 'a', 'process', 'that', 'has', 'been', 'explored', 'both', 'in', 'experiments', 'and', 'in', 'computational', 'models', 'the', 'use', 'of', 'active', 'colloids', 'as', 'building', 'blocks', 'for', 'nanotechnology', 'opens', 'the', 'doors', 'to', 'interesting', 'applications', 'provided', 'we', 'understand', 'the', 'behaviour', 'of', 'these', 'elementary', 'constituents', 'we', 'build', 'a', 'consistent', 'mesoscopic', 'simulation', 'model', 'for', 'selfpropelled', 'colloids', 'of', 'complex', 'shape', 'with', 'the', 'aim', 'of', 'resolving', 'the', 'coupling', 'between', 'their', 'translational', 'and', 'rotational', 'motion', 'considering', 'a', 'passive', 'lshaped', 'colloidal', 'particle', 'we', 'study', 'its', 'brownian', 'dynamics', 'and', 'locate', 'its', 'center', 'of', 'hydrodynamics', 'the', 'tracking', 'point', 'at', 'which', 'translation', 'and', 'rotation', 'decouple', 'the', 'active', 'l', 'particle', 'displays', 'the', 'same', 'circling', 'trajectories', 'that', 'have', 'been', 'found', 'experimentally', 'a', 'result', 'which', 'we', 'compare', 'with', 'the', 'brownian', 'dynamics', 'model', 'we', 'put', 'forward', 'the', 'role', 'of', 'hydrodynamics', 'by', 'comparing', 'our', 'results', 'with', 'a', 'fluid', 'model', 'in', 'which', 'the', 'particles', 'velocities', 'are', 'reset', 'randomly', 'there', 'the', 'trajectories', 'only', 'display', 'random', 'orientations', 'we', 'obtain', 'these', 'original', 'simulation', 'results', 'without', 'any', 'parametrization', 'of', 'the', 'algorithm', 'which', 'makes', 'it', 'a', 'useful', 'method', 'for', 'the', 'preliminary', 'study', 'of', 'active', 'colloids', 'prior', 'to', 'experimental', 'work']] | [-0.09939087824213333, 0.17122291659458458, -0.1308579127479793, 0.011926889552779972, -0.05919529698516062, -0.1702850690423584, 0.019930859753393922, 0.4075825526062107, -0.25182484191048804, -0.3262739018463964, 0.027511455940877463, -0.2613938291757051, -0.1447630205270298, 0.18326614604755767, -0.011427869267608722, 0.06429952746244996, 0.047954224132785224, -0.0025038031315070173, 0.011488632179543141, -0.1650893876867866, 0.21119588854630034, 0.04905740986943869, 0.25034402048273785, -0.002018157234269131, 0.16051511158215867, -0.012639335097003903, -0.03221131941359685, 0.045077386504790075, -0.16562308602412024, 0.11738303265197896, 0.19333919409153322, 0.03077067372130708, 0.23226491676604483, -0.4528010581566401, -0.24079208316023007, 0.10903341312897612, 0.16176097008463053, 0.13866869845130134, -0.1339580440035587, -0.2792726152025514, 0.05332086364012114, -0.14234402887303751, -0.1601643656716921, -0.07609421138149437, 0.03717666144936262, 0.07206980601966098, -0.2109595165141195, 0.05080062203982075, 0.08810069299448058, 0.06259564438064373, -0.08428632783830282, -0.06258208929995046, -0.009524983121082187, 0.15766399133711545, 0.04355241290061413, 0.008081280831150048, 0.21117271621423866, -0.1455274539233517, -0.12866763649288934, 0.42095415403881153, -0.0034627526491412316, -0.24071267808218247, 0.24656900223003242, -0.11867201732500841, -0.11964756269154202, 0.14286046468711297, 0.19360027143595185, 0.1248179758625856, -0.1617287937015373, 0.03853763006773841, -0.06319786809233666, 0.14715733853396132, 0.0335613309676364, -0.03590575659511055, 0.2494370120416605, 0.21647998263982626, 0.018295827990943928, 0.17482797836114441, -0.1002715739484935, -0.15672070607640512, -0.26446600034052786, -0.16502916914074442, -0.17930289887559858, 0.009568258399858155, -0.08214955185924008, -0.12903505892746384, 0.37287493731886123, 0.16701472312192486, 0.21215958219918749, 0.058438340088606114, 0.27605962463659456, 0.02881104047824653, 0.03808750113178561, 0.06454821662850561, 0.24903886367479114, 0.11443812057378346, 0.11040262057304538, -0.24310048267303805, 0.048784237962060106, 0.061481545306864095] |
1,802.03265 | A self-similar aperiodic set of 19 Wang tiles | We define a Wang tile set $\mathcal{U}$ of cardinality 19 and show that the
set $\Omega_\mathcal{U}$ of all valid Wang tilings $\mathbb{Z}^2\to\mathcal{U}$
is self-similar, aperiodic and is a minimal subshift of
$\mathcal{U}^{\mathbb{Z}^2}$. Thus $\mathcal{U}$ is the second smallest
self-similar aperiodic Wang tile set known after Ammann's set of 16 Wang tiles.
The proof is based on the unique composition property. We prove the existence
of an expansive, primitive and recognizable $2$-dimensional morphism
$\omega:\Omega_\mathcal{U}\to\Omega_\mathcal{U}$ that is onto up to a shift.
The proof of recognizability is done in two steps using at each step the same
criteria (the existence of marker tiles) for proving the existence of a
recognizable one-dimensional substitution that sends each tile either on a
single tile or on a domino of two tiles.
| math.DS | we define a wang tile set mathcalu of cardinality 19 and show that the set omega_mathcalu of all valid wang tilings mathbbz2tomathcalu is selfsimilar aperiodic and is a minimal subshift of mathcalumathbbz2 thus mathcalu is the second smallest selfsimilar aperiodic wang tile set known after ammanns set of 16 wang tiles the proof is based on the unique composition property we prove the existence of an expansive primitive and recognizable 2dimensional morphism omegaomega_mathcalutoomega_mathcalu that is onto up to a shift the proof of recognizability is done in two steps using at each step the same criteria the existence of marker tiles for proving the existence of a recognizable onedimensional substitution that sends each tile either on a single tile or on a domino of two tiles | [['we', 'define', 'a', 'wang', 'tile', 'set', 'mathcalu', 'of', 'cardinality', '19', 'and', 'show', 'that', 'the', 'set', 'omega_mathcalu', 'of', 'all', 'valid', 'wang', 'tilings', 'mathbbz2tomathcalu', 'is', 'selfsimilar', 'aperiodic', 'and', 'is', 'a', 'minimal', 'subshift', 'of', 'mathcalumathbbz2', 'thus', 'mathcalu', 'is', 'the', 'second', 'smallest', 'selfsimilar', 'aperiodic', 'wang', 'tile', 'set', 'known', 'after', 'ammanns', 'set', 'of', '16', 'wang', 'tiles', 'the', 'proof', 'is', 'based', 'on', 'the', 'unique', 'composition', 'property', 'we', 'prove', 'the', 'existence', 'of', 'an', 'expansive', 'primitive', 'and', 'recognizable', '2dimensional', 'morphism', 'omegaomega_mathcalutoomega_mathcalu', 'that', 'is', 'onto', 'up', 'to', 'a', 'shift', 'the', 'proof', 'of', 'recognizability', 'is', 'done', 'in', 'two', 'steps', 'using', 'at', 'each', 'step', 'the', 'same', 'criteria', 'the', 'existence', 'of', 'marker', 'tiles', 'for', 'proving', 'the', 'existence', 'of', 'a', 'recognizable', 'onedimensional', 'substitution', 'that', 'sends', 'each', 'tile', 'either', 'on', 'a', 'single', 'tile', 'or', 'on', 'a', 'domino', 'of', 'two', 'tiles']] | [-0.14305954154827133, 0.12455987163796763, -0.049054943028960594, 0.023999194804124904, -0.0750146823211704, -0.13742957963061728, 0.11838448798083816, 0.3265629587387127, -0.324577135842078, -0.1972745913658137, 0.10552912177219756, -0.3105598434744295, -0.09549919758588538, 0.18485419044063295, -0.10934199799575713, 0.02765253202389341, 0.025486997524969093, 0.025255123030178805, -0.026088536845920378, -0.28715639102680623, 0.30571588522885457, -0.06575181743145482, 0.2216209663724727, -0.016881001624471145, 0.16590971126767598, -0.00044525506683001833, -0.04193350242658649, 0.040478219147309785, -0.16997087380192424, 0.05252141433129133, 0.1861522564094914, 0.17476631706765244, 0.22500564437840626, -0.33389296685922737, -0.13008368716475147, 0.16352194027825112, 0.10748342462345835, 0.04091679761648055, -0.08199286977048532, -0.21353642011353793, 0.18444409395360256, -0.08245834003275737, -0.15211429389978737, 0.01588686260063786, 0.08255994263343698, 0.04484454956490639, -0.27184808648899506, -0.04824577442039389, 0.2111520208187463, 0.10635871166932928, -0.05018441538395714, -0.06677914728710721, -0.06919055589482434, 0.1094031701814999, -0.08744530567960922, 0.05840669436118573, 0.0881792233779657, 0.0069487215758663075, -0.14268323387815962, 0.3653767442230659, -0.00942119674310704, -0.23549069247154658, 0.20983946493303418, -0.1464743616736748, -0.19258964364994163, 0.17862589406580778, 0.0596577933035052, 0.06481247875947228, -0.15128933348739135, 0.15399667470425382, -0.18989208238132005, 0.24753551149508946, 0.20183552910904745, -0.02447042868603483, 0.1781282666762752, 0.19940571474250068, 0.14559166838053214, 0.19431293793676868, 0.0010359055412671537, -0.008124408402580245, -0.33077743182282066, -0.14426439806765085, -0.18333333933221807, 0.07180844840770664, -0.08967930153130134, -0.23818381143010353, 0.39330031738177806, 0.06661365525065806, 0.19264202188577287, 0.10254196345436671, 0.19210238906185428, 0.035659560229925606, 0.052565920877400044, 0.02429677559301442, 0.0951947056773034, 0.10473659077720825, -0.019762322785763824, -0.13958655545812232, 0.037304819907900716, 0.24572420947653942] |
1,802.03266 | Analysis of Summatory Functions of Regular Sequences: Transducer and
Pascal's Rhombus | The summatory function of a $q$-regular sequence in the sense of Allouche and
Shallit is analysed asymptotically. The result is a sum of periodic
fluctuations for eigenvalues of absolute value larger than the joint spectral
radius of the matrices of a linear representation of the sequence. The Fourier
coefficients of the fluctuations are expressed in terms of residues of the
corresponding Dirichlet generating function. A known pseudo Tauberian argument
is extended in order to overcome convergence problems in Mellin--Perron
summation.
Two examples are discussed in more detail: The case of sequences defined as
the sum of outputs written by a transducer when reading a $q$ary expansion of
the input and the number of odd entries in the rows of Pascal's rhombus.
| math.CO | the summatory function of a qregular sequence in the sense of allouche and shallit is analysed asymptotically the result is a sum of periodic fluctuations for eigenvalues of absolute value larger than the joint spectral radius of the matrices of a linear representation of the sequence the fourier coefficients of the fluctuations are expressed in terms of residues of the corresponding dirichlet generating function a known pseudo tauberian argument is extended in order to overcome convergence problems in mellinperron summation two examples are discussed in more detail the case of sequences defined as the sum of outputs written by a transducer when reading a qary expansion of the input and the number of odd entries in the rows of pascals rhombus | [['the', 'summatory', 'function', 'of', 'a', 'qregular', 'sequence', 'in', 'the', 'sense', 'of', 'allouche', 'and', 'shallit', 'is', 'analysed', 'asymptotically', 'the', 'result', 'is', 'a', 'sum', 'of', 'periodic', 'fluctuations', 'for', 'eigenvalues', 'of', 'absolute', 'value', 'larger', 'than', 'the', 'joint', 'spectral', 'radius', 'of', 'the', 'matrices', 'of', 'a', 'linear', 'representation', 'of', 'the', 'sequence', 'the', 'fourier', 'coefficients', 'of', 'the', 'fluctuations', 'are', 'expressed', 'in', 'terms', 'of', 'residues', 'of', 'the', 'corresponding', 'dirichlet', 'generating', 'function', 'a', 'known', 'pseudo', 'tauberian', 'argument', 'is', 'extended', 'in', 'order', 'to', 'overcome', 'convergence', 'problems', 'in', 'mellinperron', 'summation', 'two', 'examples', 'are', 'discussed', 'in', 'more', 'detail', 'the', 'case', 'of', 'sequences', 'defined', 'as', 'the', 'sum', 'of', 'outputs', 'written', 'by', 'a', 'transducer', 'when', 'reading', 'a', 'qary', 'expansion', 'of', 'the', 'input', 'and', 'the', 'number', 'of', 'odd', 'entries', 'in', 'the', 'rows', 'of', 'pascals', 'rhombus']] | [-0.18419155504935505, 0.10816558440743122, -0.050654344553174066, 0.0970201625763862, -0.019721490688899085, -0.061995249891976925, 0.0140165717089414, 0.3013920608199825, -0.2877081417024505, -0.24963369242431335, 0.12237932688695155, -0.3015167656285334, -0.14762741588979714, 0.17284927840829512, -0.07983398409791229, 0.07136252848239046, 0.04353445477029386, 0.0928813182798884, -0.09088777530599725, -0.26830490263494516, 0.3042154016669778, 0.007483135670238782, 0.21083726818396226, -0.016378843769130937, 0.08695042513942053, 0.020081587478302975, -0.05028688771965767, -0.015010596805229044, -0.1045189940193591, 0.13236188839205584, 0.23879357226277617, 0.09589329067894742, 0.27881119425662537, -0.3338070223608231, -0.11966199396285883, 0.12962233765177766, 0.1656451099436761, 0.021891452425952293, 0.012444489944725266, -0.23675734530326195, 0.11119751661846583, -0.135459662107212, -0.1284787970256399, -0.030369395453652196, 0.04752790964447147, 0.08683457725184916, -0.3341434099365118, 0.08986598584215996, 0.10701477655579052, 0.06556868342748143, -0.04059668392527941, -0.19763548744165085, 0.01955830119935072, 0.11266026752043616, 0.05281530146502451, 0.016170677528832077, 0.051360669018592965, -0.11511125699578484, -0.10503414818297395, 0.3491849461070085, -0.07322249656953475, -0.2518693693925065, 0.06872454446775085, -0.16585226043335294, -0.08075012343604702, 0.12759791346928798, 0.10602350421403804, 0.15399456063231592, -0.10943149048163968, 0.10141348613961022, -0.07969981568484483, 0.14873827158758215, 0.17419035154710377, 0.037152226729518616, 0.15544728041926692, 0.07910939370866957, 0.05691531154304004, 0.21264552878800871, -0.012164507449935536, -0.07605435768688822, -0.3269531419404498, -0.1520741186980235, -0.27098012269158994, 0.05197696942712896, -0.1465254570047221, -0.23213202239222025, 0.40900343271695877, 0.0627500587335426, 0.20175727195883833, 0.10945050057297002, 0.23836987320148995, 0.16693198974032633, 0.060409587697310696, 0.025060872713292465, 0.12694764306407022, 0.2113835607686134, 0.05390821769833565, -0.1794603959799644, 0.04449159136496115, 0.1621453126118911] |
1,802.03267 | Analog gravity in nonisentropic fluids | The analog acoustic metric has been originally derived for adiabatic acoustic
perturbations propagating in an isentropic irrotational ideal fluid. In the
framework of a Lagrangian hydrodynamic description we demonstrate that under
certain conditions the usual acoustic metric can be derived for nonisentropic
fluids. In a special case when the pressure takes a special form and the
nonadiabatic perturbations are neglected the adiabatic acoustic perturbations
corresponding to massless phonons propagate in an analog metric of the usual
type.
| gr-qc hep-th | the analog acoustic metric has been originally derived for adiabatic acoustic perturbations propagating in an isentropic irrotational ideal fluid in the framework of a lagrangian hydrodynamic description we demonstrate that under certain conditions the usual acoustic metric can be derived for nonisentropic fluids in a special case when the pressure takes a special form and the nonadiabatic perturbations are neglected the adiabatic acoustic perturbations corresponding to massless phonons propagate in an analog metric of the usual type | [['the', 'analog', 'acoustic', 'metric', 'has', 'been', 'originally', 'derived', 'for', 'adiabatic', 'acoustic', 'perturbations', 'propagating', 'in', 'an', 'isentropic', 'irrotational', 'ideal', 'fluid', 'in', 'the', 'framework', 'of', 'a', 'lagrangian', 'hydrodynamic', 'description', 'we', 'demonstrate', 'that', 'under', 'certain', 'conditions', 'the', 'usual', 'acoustic', 'metric', 'can', 'be', 'derived', 'for', 'nonisentropic', 'fluids', 'in', 'a', 'special', 'case', 'when', 'the', 'pressure', 'takes', 'a', 'special', 'form', 'and', 'the', 'nonadiabatic', 'perturbations', 'are', 'neglected', 'the', 'adiabatic', 'acoustic', 'perturbations', 'corresponding', 'to', 'massless', 'phonons', 'propagate', 'in', 'an', 'analog', 'metric', 'of', 'the', 'usual', 'type']] | [-0.1963953400248444, 0.173059284770574, -0.09599367362090278, 0.08071013012683237, -0.09165328963018664, -0.0932050618439816, -0.09324786888266151, 0.2750804086409316, -0.27222667792328187, -0.19854600127641256, 0.054343123013129484, -0.24016819633664444, -0.14871441670874883, 0.20761559884269515, -0.041802172016884596, 0.07890930272300135, 0.03388927927446346, 0.07961586942630154, -0.06492523448965089, -0.15240883725610646, 0.3323705352649286, 0.06419435922092721, 0.33788939454145245, -0.033500737006407134, 0.09626991236461448, -0.02074657264467958, 0.021212643151498074, 0.058701635147868234, -0.1446570583182431, -0.014861979715332582, 0.21877079768361093, 0.02664988067956617, 0.22140067902865349, -0.4929984851510494, -0.34473022536749576, 0.09547266238308572, 0.1360312429220452, 0.21917313102076386, -0.03071586326461636, -0.2787846237294037, 0.044338516806336964, -0.16675229948739728, -0.15509845753043117, -0.0724021890624003, 0.025205640122294426, -0.02660317937903977, -0.2442265675560414, 0.12535272865834368, 0.12171862226027946, 0.006288985455674785, -0.16711913182871876, -0.01812027861037618, -0.034469554321719456, 0.05913666517106369, 0.03596391641631626, 0.008046231438200196, 0.1095531222398405, -0.11678383539297751, -0.004270525558476711, 0.46562555853229065, -0.1670762638246955, -0.2785976745139856, 0.1788569790819152, -0.07293626910390018, -0.038305797789536127, 0.11273976963001316, 0.19006204768386367, 0.10263097630329913, -0.158858730419359, 0.12370687570685956, -0.02390447055751627, 0.0626117799358515, 0.15349720369468067, -0.004973498433102648, 0.19435802991078657, 0.09362313106305317, -0.011469544516271584, 0.16273433799014803, -0.042772358354459236, -0.07411207602202118, -0.35313143310221756, -0.14535042649896984, -0.1497735933570022, 0.07761597696256328, -0.11924392576673365, -0.2131239384255529, 0.35828545320379945, 0.10687751715999798, 0.115668296342256, 0.006024813944739955, 0.32809201589265424, 0.15420515277701152, 0.0025206815403003196, 0.1472361036273953, 0.3526253045669624, 0.18512398459307558, 0.08952509998888164, -0.20913194405374588, -0.02409111037124674, 0.1298249155379735] |
1,802.03268 | Efficient Neural Architecture Search via Parameter Sharing | We propose Efficient Neural Architecture Search (ENAS), a fast and
inexpensive approach for automatic model design. In ENAS, a controller learns
to discover neural network architectures by searching for an optimal subgraph
within a large computational graph. The controller is trained with policy
gradient to select a subgraph that maximizes the expected reward on the
validation set. Meanwhile the model corresponding to the selected subgraph is
trained to minimize a canonical cross entropy loss. Thanks to parameter sharing
between child models, ENAS is fast: it delivers strong empirical performances
using much fewer GPU-hours than all existing automatic model design approaches,
and notably, 1000x less expensive than standard Neural Architecture Search. On
the Penn Treebank dataset, ENAS discovers a novel architecture that achieves a
test perplexity of 55.8, establishing a new state-of-the-art among all methods
without post-training processing. On the CIFAR-10 dataset, ENAS designs novel
architectures that achieve a test error of 2.89%, which is on par with NASNet
(Zoph et al., 2018), whose test error is 2.65%.
| cs.LG cs.CL cs.CV cs.NE stat.ML | we propose efficient neural architecture search enas a fast and inexpensive approach for automatic model design in enas a controller learns to discover neural network architectures by searching for an optimal subgraph within a large computational graph the controller is trained with policy gradient to select a subgraph that maximizes the expected reward on the validation set meanwhile the model corresponding to the selected subgraph is trained to minimize a canonical cross entropy loss thanks to parameter sharing between child models enas is fast it delivers strong empirical performances using much fewer gpuhours than all existing automatic model design approaches and notably 1000x less expensive than standard neural architecture search on the penn treebank dataset enas discovers a novel architecture that achieves a test perplexity of 558 establishing a new stateoftheart among all methods without posttraining processing on the cifar10 dataset enas designs novel architectures that achieve a test error of 289 which is on par with nasnet zoph et al 2018 whose test error is 265 | [['we', 'propose', 'efficient', 'neural', 'architecture', 'search', 'enas', 'a', 'fast', 'and', 'inexpensive', 'approach', 'for', 'automatic', 'model', 'design', 'in', 'enas', 'a', 'controller', 'learns', 'to', 'discover', 'neural', 'network', 'architectures', 'by', 'searching', 'for', 'an', 'optimal', 'subgraph', 'within', 'a', 'large', 'computational', 'graph', 'the', 'controller', 'is', 'trained', 'with', 'policy', 'gradient', 'to', 'select', 'a', 'subgraph', 'that', 'maximizes', 'the', 'expected', 'reward', 'on', 'the', 'validation', 'set', 'meanwhile', 'the', 'model', 'corresponding', 'to', 'the', 'selected', 'subgraph', 'is', 'trained', 'to', 'minimize', 'a', 'canonical', 'cross', 'entropy', 'loss', 'thanks', 'to', 'parameter', 'sharing', 'between', 'child', 'models', 'enas', 'is', 'fast', 'it', 'delivers', 'strong', 'empirical', 'performances', 'using', 'much', 'fewer', 'gpuhours', 'than', 'all', 'existing', 'automatic', 'model', 'design', 'approaches', 'and', 'notably', '1000x', 'less', 'expensive', 'than', 'standard', 'neural', 'architecture', 'search', 'on', 'the', 'penn', 'treebank', 'dataset', 'enas', 'discovers', 'a', 'novel', 'architecture', 'that', 'achieves', 'a', 'test', 'perplexity', 'of', '558', 'establishing', 'a', 'new', 'stateoftheart', 'among', 'all', 'methods', 'without', 'posttraining', 'processing', 'on', 'the', 'cifar10', 'dataset', 'enas', 'designs', 'novel', 'architectures', 'that', 'achieve', 'a', 'test', 'error', 'of', '289', 'which', 'is', 'on', 'par', 'with', 'nasnet', 'zoph', 'et', 'al', '2018', 'whose', 'test', 'error', 'is', '265']] | [-0.05629871049923767, -0.011334249094420693, -0.04034242856533763, 0.0830793630277381, -0.1308819789803325, -0.21433119115860252, 0.09810479677457942, 0.4548835815739132, -0.2115914671665091, -0.3884921829344448, 0.04054509611552146, -0.2852006809741348, -0.1621495351727918, 0.24060172430786142, -0.12566200872565325, 0.08945410551425226, 0.17166787151994553, 0.04002279270730333, -0.048247080565357724, -0.2869199252038048, 0.18525630374394447, 0.12276950102120995, 0.3393396695540426, -0.03948739580224508, 0.1510107089531145, -0.06896730898712165, 0.009822945208093542, -0.04915613131555812, -0.0616125005588314, 0.18729513621656224, 0.24463203137498338, 0.21985004968874292, 0.34202398786957033, -0.35476171240366683, -0.16779584328861472, 0.11406715728571182, 0.09067251077925641, 0.08512668446484328, -0.03594299948712933, -0.312141288137398, 0.11721778216952679, -0.18587294440928423, 0.054156127594924434, -0.12993534282250693, -0.0003174039574261911, -0.026054992216421727, -0.3500302786852406, 0.019547519555683443, 0.03524496263551141, 0.04948387792735489, -0.017188672963418288, -0.17491685366815704, -0.016920776567198783, 0.08453218105756594, -0.05211325167416188, 0.13254157440879097, 0.14936095084102746, -0.13871649429369384, -0.16084219544880582, 0.33443852443761096, -0.07137940144030416, -0.16105816940342016, 0.17557172817986705, -0.0005982524149320618, -0.13594807180977556, 0.13417772834139044, 0.24368968213389733, 0.10867782458586306, -0.20367496762658932, 0.0034634750845289964, -0.04653099820040122, 0.2328037576565887, 0.04610028511476508, -0.021103003943439374, 0.14244122368919324, 0.32046535552038763, 0.09901523239168891, 0.13249630854091424, -0.12944443451525076, -0.05255680717876415, -0.21055103092954366, -0.11134818600613379, -0.1837682968805806, -0.041115981188014045, -0.10724609240371606, -0.14595845517629902, 0.38621755294825233, 0.22653678882989786, 0.18412900730217444, 0.15854800675931516, 0.3436614215418607, -0.008707481537423442, 0.14233736378213246, 0.19051116490513534, 0.21162662154877793, -0.0038519038269463593, 0.07391523358218294, -0.18424526436678218, 0.10899298147906265, 0.0930468379784777] |
1,802.03269 | Unsupervised Deep Domain Adaptation for Pedestrian Detection | This paper addresses the problem of unsupervised domain adaptation on the
task of pedestrian detection in crowded scenes. First, we utilize an iterative
algorithm to iteratively select and auto-annotate positive pedestrian samples
with high confidence as the training samples for the target domain. Meanwhile,
we also reuse negative samples from the source domain to compensate for the
imbalance between the amount of positive samples and negative samples. Second,
based on the deep network we also design an unsupervised regularizer to
mitigate influence from data noise. More specifically, we transform the last
fully connected layer into two sub-layers - an element-wise multiply layer and
a sum layer, and add the unsupervised regularizer to further improve the domain
adaptation accuracy. In experiments for pedestrian detection, the proposed
method boosts the recall value by nearly 30% while the precision stays almost
the same. Furthermore, we perform our method on standard domain adaptation
benchmarks on both supervised and unsupervised settings and also achieve
state-of-the-art results.
| cs.CV | this paper addresses the problem of unsupervised domain adaptation on the task of pedestrian detection in crowded scenes first we utilize an iterative algorithm to iteratively select and autoannotate positive pedestrian samples with high confidence as the training samples for the target domain meanwhile we also reuse negative samples from the source domain to compensate for the imbalance between the amount of positive samples and negative samples second based on the deep network we also design an unsupervised regularizer to mitigate influence from data noise more specifically we transform the last fully connected layer into two sublayers an elementwise multiply layer and a sum layer and add the unsupervised regularizer to further improve the domain adaptation accuracy in experiments for pedestrian detection the proposed method boosts the recall value by nearly 30 while the precision stays almost the same furthermore we perform our method on standard domain adaptation benchmarks on both supervised and unsupervised settings and also achieve stateoftheart results | [['this', 'paper', 'addresses', 'the', 'problem', 'of', 'unsupervised', 'domain', 'adaptation', 'on', 'the', 'task', 'of', 'pedestrian', 'detection', 'in', 'crowded', 'scenes', 'first', 'we', 'utilize', 'an', 'iterative', 'algorithm', 'to', 'iteratively', 'select', 'and', 'autoannotate', 'positive', 'pedestrian', 'samples', 'with', 'high', 'confidence', 'as', 'the', 'training', 'samples', 'for', 'the', 'target', 'domain', 'meanwhile', 'we', 'also', 'reuse', 'negative', 'samples', 'from', 'the', 'source', 'domain', 'to', 'compensate', 'for', 'the', 'imbalance', 'between', 'the', 'amount', 'of', 'positive', 'samples', 'and', 'negative', 'samples', 'second', 'based', 'on', 'the', 'deep', 'network', 'we', 'also', 'design', 'an', 'unsupervised', 'regularizer', 'to', 'mitigate', 'influence', 'from', 'data', 'noise', 'more', 'specifically', 'we', 'transform', 'the', 'last', 'fully', 'connected', 'layer', 'into', 'two', 'sublayers', 'an', 'elementwise', 'multiply', 'layer', 'and', 'a', 'sum', 'layer', 'and', 'add', 'the', 'unsupervised', 'regularizer', 'to', 'further', 'improve', 'the', 'domain', 'adaptation', 'accuracy', 'in', 'experiments', 'for', 'pedestrian', 'detection', 'the', 'proposed', 'method', 'boosts', 'the', 'recall', 'value', 'by', 'nearly', '30', 'while', 'the', 'precision', 'stays', 'almost', 'the', 'same', 'furthermore', 'we', 'perform', 'our', 'method', 'on', 'standard', 'domain', 'adaptation', 'benchmarks', 'on', 'both', 'supervised', 'and', 'unsupervised', 'settings', 'and', 'also', 'achieve', 'stateoftheart', 'results']] | [-0.011117280381087377, -0.004023640759676584, -0.044819159064231055, 0.02003278024430583, -0.11199816021008077, -0.1403515232029904, 0.10046786415528318, 0.4710651905504319, -0.28628578379679964, -0.33521665782673554, 0.09034869570941108, -0.28544788621366024, -0.13502678726126188, 0.16462848061379395, -0.12834336429412635, 0.05484690597506369, 0.12464361704311937, 0.04374137912062729, -0.0589014798367642, -0.3084594394437641, 0.32955589525419166, 0.03800808800125945, 0.36801069024833116, 0.039013346967597805, 0.17280970035639223, -0.03500417665484707, -0.0475527546690695, -0.01326281054102107, -0.057120880264709795, 0.13853849866500698, 0.2772444818555465, 0.13334015619782907, 0.3196709309470307, -0.3905606488250606, -0.2184001234478651, 0.1041805863925168, 0.16655658639428564, 0.10760914712248124, -0.056453896495795505, -0.3451979587018584, 0.11421744639285307, -0.1328017672233916, 0.025812087726996006, -0.12207622233040209, -0.059475430867300845, -0.03917928695211585, -0.31572042055004834, 0.073457626760066, 0.09025125455919583, 0.036846490805300905, -0.09811017420011098, -0.13699008774234908, 0.059522115755767664, 0.1763038576841237, 0.047811988219853094, 0.06587850952772834, 0.12461622964602502, -0.1800163833573812, -0.11360513724448194, 0.29843502358457297, -0.08712293712258246, -0.25199574158737825, 0.19017685431278306, -0.05176650383070393, -0.11386137137499948, 0.10608695161458596, 0.28021680885551015, 0.15388711496057142, -0.14247176188788135, -0.007151178531670861, -0.021886868911953468, 0.1998483104215431, 0.073508052984194, -0.03451845524305443, 0.12482675294825257, 0.26203458062695256, 0.1215047809916238, 0.16243282131083403, -0.16793053788674772, -0.015009205890878004, -0.24629720847588032, -0.10630553899590606, -0.2121033610222545, -0.06581922959384022, -0.11734498899855428, -0.12179743967739479, 0.39671159048312865, 0.21532638645701627, 0.23248875641363598, 0.1103040961923558, 0.36650585326946006, 0.027174119723363303, 0.09180674683185494, 0.09372689353218654, 0.186085804747769, 0.019561107372923655, 0.12042340787520057, -0.2189387242917818, 0.06837357175331446, 0.030327776878919896] |
1,802.0327 | Synchronization Invariance Under Network Structural Transformations | Synchronization processes are ubiquitous despite the many connectivity
patterns that complex systems can show. Usually, the emergence of synchrony is
a macroscopic observable, however, the microscopic details of the system, as
e.g. the underlying network of interactions, is many times partially or totally
unknown. We already know that different interaction structures can give rise to
a common functionality, understood as a common macroscopic observable. Building
upon this fact, here, we propose network transformations that keep the
collective behavior of a large system of Kuramoto oscillators functionally
invariant. We derive a method based on information theory principles, that
allows us to adjust the weights of the structural interactions to map random
homogeneous -in degree- networks into random heterogeneous networks and
vice-versa, keeping synchronization values invariant. The results of the
proposed transformations reveal an interesting principle; heterogeneous
networks can be mapped to homogeneous ones with local information, but the
reverse process needs to exploit higher-order information. The formalism
provides new analytical insight to tackle real complex scenarios when dealing
with uncertainty in the measurements of the underlying connectivity structure.
| physics.soc-ph | synchronization processes are ubiquitous despite the many connectivity patterns that complex systems can show usually the emergence of synchrony is a macroscopic observable however the microscopic details of the system as eg the underlying network of interactions is many times partially or totally unknown we already know that different interaction structures can give rise to a common functionality understood as a common macroscopic observable building upon this fact here we propose network transformations that keep the collective behavior of a large system of kuramoto oscillators functionally invariant we derive a method based on information theory principles that allows us to adjust the weights of the structural interactions to map random homogeneous in degree networks into random heterogeneous networks and viceversa keeping synchronization values invariant the results of the proposed transformations reveal an interesting principle heterogeneous networks can be mapped to homogeneous ones with local information but the reverse process needs to exploit higherorder information the formalism provides new analytical insight to tackle real complex scenarios when dealing with uncertainty in the measurements of the underlying connectivity structure | [['synchronization', 'processes', 'are', 'ubiquitous', 'despite', 'the', 'many', 'connectivity', 'patterns', 'that', 'complex', 'systems', 'can', 'show', 'usually', 'the', 'emergence', 'of', 'synchrony', 'is', 'a', 'macroscopic', 'observable', 'however', 'the', 'microscopic', 'details', 'of', 'the', 'system', 'as', 'eg', 'the', 'underlying', 'network', 'of', 'interactions', 'is', 'many', 'times', 'partially', 'or', 'totally', 'unknown', 'we', 'already', 'know', 'that', 'different', 'interaction', 'structures', 'can', 'give', 'rise', 'to', 'a', 'common', 'functionality', 'understood', 'as', 'a', 'common', 'macroscopic', 'observable', 'building', 'upon', 'this', 'fact', 'here', 'we', 'propose', 'network', 'transformations', 'that', 'keep', 'the', 'collective', 'behavior', 'of', 'a', 'large', 'system', 'of', 'kuramoto', 'oscillators', 'functionally', 'invariant', 'we', 'derive', 'a', 'method', 'based', 'on', 'information', 'theory', 'principles', 'that', 'allows', 'us', 'to', 'adjust', 'the', 'weights', 'of', 'the', 'structural', 'interactions', 'to', 'map', 'random', 'homogeneous', 'in', 'degree', 'networks', 'into', 'random', 'heterogeneous', 'networks', 'and', 'viceversa', 'keeping', 'synchronization', 'values', 'invariant', 'the', 'results', 'of', 'the', 'proposed', 'transformations', 'reveal', 'an', 'interesting', 'principle', 'heterogeneous', 'networks', 'can', 'be', 'mapped', 'to', 'homogeneous', 'ones', 'with', 'local', 'information', 'but', 'the', 'reverse', 'process', 'needs', 'to', 'exploit', 'higherorder', 'information', 'the', 'formalism', 'provides', 'new', 'analytical', 'insight', 'to', 'tackle', 'real', 'complex', 'scenarios', 'when', 'dealing', 'with', 'uncertainty', 'in', 'the', 'measurements', 'of', 'the', 'underlying', 'connectivity', 'structure']] | [-0.18065412454228152, 0.1306231513069081, -0.09117968956016446, 0.08744516883985842, -0.1138193945342538, -0.1515758299583827, 0.0310546319426457, 0.36446177875254787, -0.32046797008011596, -0.28927505165759454, 0.08539193679873258, -0.23063153570583997, -0.24536399062233583, 0.14376327466702427, -0.05026990375455238, 0.01926034728946798, 0.05174506823124501, 0.05851580665215303, -0.038482095529246384, -0.20236548331202275, 0.32300106660952255, 0.042515702362140737, 0.3126235831197414, 0.019056878739304967, 0.11557573236845366, 0.0019601361628254813, -0.014274741607155167, 0.042664273925478134, -0.09070507653263439, 0.14260126083252667, 0.26091830038345853, 0.13354492507062524, 0.2548717088052887, -0.4791519542535146, -0.2551063519723629, 0.11760664180363134, 0.14049397454106072, 0.15227734599009915, 0.014900878490748589, -0.29983656103512285, 0.048262721374841396, -0.12963859371041503, -0.13488756369083782, -0.14045404464448408, -0.02372463162472777, 0.029920152453436624, -0.2605132409230027, 0.04556281244550637, 0.07493402627901842, 0.03339276582497241, -0.03264741197729609, -0.04057448095573628, -0.013363107151646524, 0.18659183296909698, -0.0030479323420486816, -0.023593138459422704, 0.14927328198274734, -0.11192840213840038, -0.12410912553465393, 0.3959913167281676, 0.0014171839920582912, -0.21434745231595964, 0.22753932663649953, -0.10650545947574669, -0.1712280753447469, 0.12540954466229093, 0.20414690333050228, 0.04855741235680121, -0.21213412897782677, 0.04033737942953936, -0.022476679824376847, 0.1853074306216996, 0.012864068766140331, 0.07852347113065801, 0.1778007531512297, 0.18069907888312334, 0.06480052738810894, 0.12023144333076131, -0.013140279548453157, -0.1497149027641968, -0.2394279775099229, -0.09683128210042533, -0.17544434834166436, 0.06851504845899861, -0.12524167824223162, -0.1717301237362037, 0.3993792055558813, 0.17244970372162421, 0.22088832396877098, 0.048963379120127964, 0.2794305348741206, 0.07731157271941272, 0.08266484511142734, 0.032371761235224325, 0.19051737765555327, 0.1422627693355231, 0.10324004632986472, -0.1679928267406205, 0.13440154516532765, 0.012380556826937502] |
1,802.03271 | Enhancing Performance of Random Caching in Large-Scale Heterogeneous
Wireless Networks with Random Discontinuous Transmission | To make better use of file diversity provided by random caching and improve
the successful transmission probability (STP) of a file, we consider
retransmissions with random discontinuous transmission (DTX) in a large-scale
cache-enabled heterogeneous wireless network (HetNet) employing random caching.
We analyze and optimize the STP in two mobility scenarios, i.e., the high
mobility scenario and the static scenario. First, in each scenario, by using
tools from stochastic geometry, we obtain the closed-form expressions for the
STP in the general and low signal-to-interference ratio (SIR) threshold
regimes, respectively. The analysis shows that a larger caching probability
corresponds to a higher STP in both scenarios; random DTX can improve the STP
in the static scenario and its benefit gradually diminishes when mobility
increases. Then, in each scenario, we consider the maximization of the STP with
respect to the caching probability and the BS activity probability, which is a
challenging non-convex optimization problem. In particular, in the high
mobility scenario, we obtain a globally optimal solution using interior point
method. In the static scenario, we develop a low-complexity iterative algorithm
to obtain a stationary point using alternating optimization. Finally, numerical
results show that the proposed solutions achieve significant gains over
existing baseline schemes and can well adapt to the changes of the system
parameters to wisely utilize storage resources and transmission opportunities.
| cs.IT math.IT | to make better use of file diversity provided by random caching and improve the successful transmission probability stp of a file we consider retransmissions with random discontinuous transmission dtx in a largescale cacheenabled heterogeneous wireless network hetnet employing random caching we analyze and optimize the stp in two mobility scenarios ie the high mobility scenario and the static scenario first in each scenario by using tools from stochastic geometry we obtain the closedform expressions for the stp in the general and low signaltointerference ratio sir threshold regimes respectively the analysis shows that a larger caching probability corresponds to a higher stp in both scenarios random dtx can improve the stp in the static scenario and its benefit gradually diminishes when mobility increases then in each scenario we consider the maximization of the stp with respect to the caching probability and the bs activity probability which is a challenging nonconvex optimization problem in particular in the high mobility scenario we obtain a globally optimal solution using interior point method in the static scenario we develop a lowcomplexity iterative algorithm to obtain a stationary point using alternating optimization finally numerical results show that the proposed solutions achieve significant gains over existing baseline schemes and can well adapt to the changes of the system parameters to wisely utilize storage resources and transmission opportunities | [['to', 'make', 'better', 'use', 'of', 'file', 'diversity', 'provided', 'by', 'random', 'caching', 'and', 'improve', 'the', 'successful', 'transmission', 'probability', 'stp', 'of', 'a', 'file', 'we', 'consider', 'retransmissions', 'with', 'random', 'discontinuous', 'transmission', 'dtx', 'in', 'a', 'largescale', 'cacheenabled', 'heterogeneous', 'wireless', 'network', 'hetnet', 'employing', 'random', 'caching', 'we', 'analyze', 'and', 'optimize', 'the', 'stp', 'in', 'two', 'mobility', 'scenarios', 'ie', 'the', 'high', 'mobility', 'scenario', 'and', 'the', 'static', 'scenario', 'first', 'in', 'each', 'scenario', 'by', 'using', 'tools', 'from', 'stochastic', 'geometry', 'we', 'obtain', 'the', 'closedform', 'expressions', 'for', 'the', 'stp', 'in', 'the', 'general', 'and', 'low', 'signaltointerference', 'ratio', 'sir', 'threshold', 'regimes', 'respectively', 'the', 'analysis', 'shows', 'that', 'a', 'larger', 'caching', 'probability', 'corresponds', 'to', 'a', 'higher', 'stp', 'in', 'both', 'scenarios', 'random', 'dtx', 'can', 'improve', 'the', 'stp', 'in', 'the', 'static', 'scenario', 'and', 'its', 'benefit', 'gradually', 'diminishes', 'when', 'mobility', 'increases', 'then', 'in', 'each', 'scenario', 'we', 'consider', 'the', 'maximization', 'of', 'the', 'stp', 'with', 'respect', 'to', 'the', 'caching', 'probability', 'and', 'the', 'bs', 'activity', 'probability', 'which', 'is', 'a', 'challenging', 'nonconvex', 'optimization', 'problem', 'in', 'particular', 'in', 'the', 'high', 'mobility', 'scenario', 'we', 'obtain', 'a', 'globally', 'optimal', 'solution', 'using', 'interior', 'point', 'method', 'in', 'the', 'static', 'scenario', 'we', 'develop', 'a', 'lowcomplexity', 'iterative', 'algorithm', 'to', 'obtain', 'a', 'stationary', 'point', 'using', 'alternating', 'optimization', 'finally', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'solutions', 'achieve', 'significant', 'gains', 'over', 'existing', 'baseline', 'schemes', 'and', 'can', 'well', 'adapt', 'to', 'the', 'changes', 'of', 'the', 'system', 'parameters', 'to', 'wisely', 'utilize', 'storage', 'resources', 'and', 'transmission', 'opportunities']] | [-0.1824058918959715, -7.205946339209649e-05, -0.03729769114235586, 0.045795944962248376, -0.02782539636137616, -0.22662841427690264, 0.14463009206705135, 0.39448408373123545, -0.26072245204651895, -0.2786290484853618, 0.08104634551035071, -0.2511775047759081, -0.19929916605099357, 0.11365228453016078, -0.11144006429716352, 0.07771691756338854, 0.03638224093857306, 0.03926876716802574, -0.0680128612978892, -0.2597457706018097, 0.26869469417089764, 0.11100933401506732, 0.3740773439036936, 0.04735515010014007, 0.08672785798130049, 0.02846930081723258, -0.009769664812219244, 0.024911943759070708, -0.115430230106325, 0.07608425976124471, 0.2917062576394528, 0.18837400676089933, 0.27905355710747903, -0.4283245265314525, -0.2632511469842443, 0.09313143740238791, 0.1645055373938786, 0.08750622981302017, -0.046418179817159066, -0.2422824831213802, 0.15023154806853695, -0.24363640428266742, -0.0682462031265128, -0.030825701244810426, -0.058063043105754664, 0.06275016372039152, -0.3738702569664879, 0.031555990999120036, -0.04297310612825889, -0.03093435509045693, -0.07546740469194695, -0.09784662567756393, 0.03820581421314273, 0.1313389495836666, 0.035938709845438344, -0.024264361294494434, 0.10433994309807365, -0.11299092006573284, -0.1401575188808651, 0.37140420823231, -0.059585188716829926, -0.23548428631620483, 0.15905214084566316, -0.10061945044858889, -0.10436449963877252, 0.15012338798048652, 0.2515687828439034, 0.1327705991581421, -0.15138547580658765, 0.042437720350757116, -0.01407778855540197, 0.14436476145452948, 0.06136688580524854, 0.045938649112411606, 0.14732198097362098, 0.21440803014292298, 0.16203917469405993, 0.16546120887982066, -0.10774483849844811, -0.1464878885583444, -0.18024263108699498, -0.11582021332367069, -0.18058413962928832, -0.0017407063553533093, -0.16358019826161166, -0.08928764208579774, 0.3689995825327721, 0.18006352666680786, 0.19290904105132953, 0.1251198359071912, 0.38192057511345906, 0.1371335985223678, -0.020967021015134046, 0.1413901882979024, 0.15754064608104687, 0.04600413912928409, 0.16585304660627365, -0.21040891453740188, 0.09190357747297226, 0.010076286711476066] |
1,802.03272 | The ESO Survey of Non-Publishing Programmes | One of the classic ways to measure the success of a scientific facility is
the publication return, which is defined as the number of refereed papers
produced per unit of allocated resources (for example, telescope time or
proposals). The recent studies by Sterzik et al. (2015, 2016) have shown that
30-50 % of the programmes allocated time at ESO do not produce a refereed
publication. While this may be inherent to the scientific process, this finding
prompted further investigation. For this purpose, ESO conducted a Survey of
Non-Publishing Programmes (SNPP) within the activities of the Time Allocation
Working Group, similar to the monitoring campaign that was recently implemented
at ALMA (Stoehr et al. 2016). The SNPP targeted 1278 programmes scheduled
between ESO Periods 78 and 90 (October 2006 to March 2013) that had not
published a refereed paper as of April 2016. The poll was launched on 6 May
2016, remained open for four weeks, and returned 965 valid responses. This
article summarises and discusses the results of this survey, the first of its
kind at ESO.
| astro-ph.IM cs.DL physics.soc-ph | one of the classic ways to measure the success of a scientific facility is the publication return which is defined as the number of refereed papers produced per unit of allocated resources for example telescope time or proposals the recent studies by sterzik et al 2015 2016 have shown that 3050 of the programmes allocated time at eso do not produce a refereed publication while this may be inherent to the scientific process this finding prompted further investigation for this purpose eso conducted a survey of nonpublishing programmes snpp within the activities of the time allocation working group similar to the monitoring campaign that was recently implemented at alma stoehr et al 2016 the snpp targeted 1278 programmes scheduled between eso periods 78 and 90 october 2006 to march 2013 that had not published a refereed paper as of april 2016 the poll was launched on 6 may 2016 remained open for four weeks and returned 965 valid responses this article summarises and discusses the results of this survey the first of its kind at eso | [['one', 'of', 'the', 'classic', 'ways', 'to', 'measure', 'the', 'success', 'of', 'a', 'scientific', 'facility', 'is', 'the', 'publication', 'return', 'which', 'is', 'defined', 'as', 'the', 'number', 'of', 'refereed', 'papers', 'produced', 'per', 'unit', 'of', 'allocated', 'resources', 'for', 'example', 'telescope', 'time', 'or', 'proposals', 'the', 'recent', 'studies', 'by', 'sterzik', 'et', 'al', '2015', '2016', 'have', 'shown', 'that', '3050', 'of', 'the', 'programmes', 'allocated', 'time', 'at', 'eso', 'do', 'not', 'produce', 'a', 'refereed', 'publication', 'while', 'this', 'may', 'be', 'inherent', 'to', 'the', 'scientific', 'process', 'this', 'finding', 'prompted', 'further', 'investigation', 'for', 'this', 'purpose', 'eso', 'conducted', 'a', 'survey', 'of', 'nonpublishing', 'programmes', 'snpp', 'within', 'the', 'activities', 'of', 'the', 'time', 'allocation', 'working', 'group', 'similar', 'to', 'the', 'monitoring', 'campaign', 'that', 'was', 'recently', 'implemented', 'at', 'alma', 'stoehr', 'et', 'al', '2016', 'the', 'snpp', 'targeted', '1278', 'programmes', 'scheduled', 'between', 'eso', 'periods', '78', 'and', '90', 'october', '2006', 'to', 'march', '2013', 'that', 'had', 'not', 'published', 'a', 'refereed', 'paper', 'as', 'of', 'april', '2016', 'the', 'poll', 'was', 'launched', 'on', '6', 'may', '2016', 'remained', 'open', 'for', 'four', 'weeks', 'and', 'returned', '965', 'valid', 'responses', 'this', 'article', 'summarises', 'and', 'discusses', 'the', 'results', 'of', 'this', 'survey', 'the', 'first', 'of', 'its', 'kind', 'at', 'eso']] | [-0.08117082962093668, 0.07405152192971756, -0.0834573998826703, -0.0038419657700152336, -0.12831033829991756, -0.08108270885041582, 0.10204586535433514, 0.3378103754662892, -0.16455557749930724, -0.4265179722324798, 0.1482403827681375, -0.29738403280209125, -0.08177544774023995, 0.20949931934745492, -0.11508457844788263, 0.0263957476474165, 0.12295278894840277, -0.055637272042140626, 0.015456578167862046, -0.424739845739732, 0.20838256427549828, 0.2039472090995364, 0.2816608965176305, 0.01322903151743724, 0.08567283220033635, -0.023025999057762956, -0.16128384277812743, -0.03128082184556719, -0.1367445333243592, 0.062311127318929856, 0.3151044959463833, 0.16284360670435585, 0.3638149831983212, -0.3666679087743076, -0.13115639459581402, 0.041685735527698324, 0.0639013756330027, 0.01811640550673814, -0.0212584919962019, -0.31047123311120167, 0.022664662202063143, -0.21548681989399313, -0.13265233801416398, 0.0405394685694135, 0.12617271159617613, 0.005622857542673115, -0.215275992560391, 0.02812958946614935, 0.010611605688758338, 0.12229326855369478, -0.06388123121659942, -0.13434114438149403, 0.020770981114722614, 0.15474198258016258, 0.021122248170520205, 0.10735177626147081, 0.06264460353420405, -0.053844929050534354, -0.16839419238334685, 0.352869891153093, -0.02127113373002462, 0.04032614803464528, 0.19157666079046434, -0.15231661472404212, -0.2285054175575313, 0.08230399885977352, 0.2199159505891434, 0.1126487901494212, -0.19519750145672446, 0.06322268814655914, -0.06054925377758449, 0.19074171146701976, 0.10298168148752847, -0.006150828643119213, 0.21340322181887444, 0.11506699628539775, -0.0006765264402312493, 0.09930005649374307, -0.14224595234359, -0.047933523497566015, -0.2779192849221433, -0.14439170596146225, -0.1638216087839713, 0.046047662015308556, 0.09040560729947003, -0.046151165333569694, 0.4157842108380725, 0.12431550446805158, 0.14542471826871672, 0.007714010547875149, 0.24131862974959856, 0.03620939675891467, 0.07459716294001657, 0.10045021259067961, 0.2910768419656663, 0.029562309557267012, 0.2191903414163869, -0.1256563506356021, 0.08380781210569545, 0.020029308219244212] |
1,802.03273 | Lower tail of the KPZ equation | We provide the first tight bounds on the lower tail probability of the one
point distribution of the KPZ equation with narrow wedge initial data. Our
bounds hold for all sufficiently large times $T$ and demonstrates a crossover
between super-exponential decay with exponent $5/2$ (and leading pre-factor
$\frac{4}{15\pi} T^{1/3}$) for tail depth greater than $T^{2/3}$, and exponent
$3$ (with leading pre-factor $\frac{1}{12}$) for tail depth less than
$T^{2/3}$.
| math.PR cond-mat.stat-mech math-ph math.MP | we provide the first tight bounds on the lower tail probability of the one point distribution of the kpz equation with narrow wedge initial data our bounds hold for all sufficiently large times t and demonstrates a crossover between superexponential decay with exponent 52 and leading prefactor frac415pi t13 for tail depth greater than t23 and exponent 3 with leading prefactor frac112 for tail depth less than t23 | [['we', 'provide', 'the', 'first', 'tight', 'bounds', 'on', 'the', 'lower', 'tail', 'probability', 'of', 'the', 'one', 'point', 'distribution', 'of', 'the', 'kpz', 'equation', 'with', 'narrow', 'wedge', 'initial', 'data', 'our', 'bounds', 'hold', 'for', 'all', 'sufficiently', 'large', 'times', 't', 'and', 'demonstrates', 'a', 'crossover', 'between', 'superexponential', 'decay', 'with', 'exponent', '52', 'and', 'leading', 'prefactor', 'frac415pi', 't13', 'for', 'tail', 'depth', 'greater', 'than', 't23', 'and', 'exponent', '3', 'with', 'leading', 'prefactor', 'frac112', 'for', 'tail', 'depth', 'less', 'than', 't23']] | [-0.08197740533905201, 0.18157043595756614, -0.09983398837607298, 0.10599118350212698, 0.005856490400341798, -0.2488534431557046, 0.07160408399415327, 0.29926762791044675, -0.19586106651087307, -0.2859249977089131, 0.07959728295664623, -0.3361696344452785, -0.03324018851089389, 0.24909281656285054, 0.042878219779622535, 0.08488659690822294, -0.03405682442348395, 0.027852155056646538, -0.059515149687041545, -0.234253112365728, 0.2510643861770852, 0.05284069586934438, 0.23904496498072325, 0.0959500207690828, 0.014602531868366719, -0.06488895185514172, 0.021085972049787863, -0.05948275527847347, -0.2831037308909555, 0.055943587516893205, 0.12324036388143675, 0.01578142328636109, 0.22007989237057185, -0.35937068436239195, -0.15817537882587693, 0.11017846242427382, 0.19517394041976155, 0.027012078578013982, 0.005062969976605208, -0.2478966563801045, 0.10789293280121551, -0.17353739225263917, -0.19982577633779885, 0.009068659409435827, 0.16186755445243708, 1.2910466140775539e-05, -0.31570891935878725, 0.22278027000155912, 0.0889009412433674, 0.05088019228206753, -0.02342901164283559, -0.19012473194178806, 0.07032736963870477, 0.10973845570306502, 0.11748215635376635, 0.06183387722069426, 0.08004547953744655, -0.16248170609684004, -0.042563242253972525, 0.28230518675339755, -0.10102020375953584, -0.1120415132548382, 0.15909095219451128, -0.29012233437275264, -0.08259797867721141, 0.22194778115780495, 0.11678384000491072, 0.0924716879137611, -0.04185241066030602, 0.0935441546685952, 0.018168235107311116, 0.2171954540974537, 0.10524301055763195, 0.06683211139778593, 0.05475472877107894, 0.1527313262175546, 0.1502754540919368, 0.14484137243855355, -0.10747004652381945, -0.10237849182657786, -0.33619888496599093, -0.14032523183902698, -0.2053588785825353, 0.12035187376913295, -0.25290124474111564, -0.14026648208929865, 0.31497613563021615, 0.10316872109533913, 0.3037107905421628, 0.2662029141810403, 0.1917546751783855, 0.18721138246169786, 0.04188182585831009, 0.17916057376302222, 0.14148419623527286, 0.08523690241819887, 0.0863773946636426, -0.13116819602993332, 0.12505061595019565, 0.06730104460200267] |
1,802.03274 | Augmented Reality needle ablation guidance tool for Irreversible
Electroporation in the pancreas | Irreversible electroporation (IRE) is a soft tissue ablation technique
suitable for treatment of inoperable tumours in the pancreas. The process
involves applying a high voltage electric field to the tissue containing the
mass using needle electrodes, leaving cancerous cells irreversibly damaged and
vulnerable to apoptosis. Efficacy of the treatment depends heavily on the
accuracy of needle placement and requires a high degree of skill from the
operator. In this paper, we describe an Augmented Reality (AR) system designed
to overcome the challenges associated with planning and guiding the needle
insertion process. Our solution, based on the HoloLens (Microsoft, USA)
platform, tracks the position of the headset, needle electrodes and ultrasound
(US) probe in space. The proof of concept implementation of the system uses
this tracking data to render real-time holographic guides on the HoloLens,
giving the user insight into the current progress of needle insertion and an
indication of the target needle trajectory. The operator's field of view is
augmented using visual guides and real-time US feed rendered on a holographic
plane, eliminating the need to consult external monitors. Based on these early
prototypes, we are aiming to develop a system that will lower the skill level
required for IRE while increasing overall accuracy of needle insertion and,
hence, the likelihood of successful treatment.
| cs.CV physics.med-ph | irreversible electroporation ire is a soft tissue ablation technique suitable for treatment of inoperable tumours in the pancreas the process involves applying a high voltage electric field to the tissue containing the mass using needle electrodes leaving cancerous cells irreversibly damaged and vulnerable to apoptosis efficacy of the treatment depends heavily on the accuracy of needle placement and requires a high degree of skill from the operator in this paper we describe an augmented reality ar system designed to overcome the challenges associated with planning and guiding the needle insertion process our solution based on the hololens microsoft usa platform tracks the position of the headset needle electrodes and ultrasound us probe in space the proof of concept implementation of the system uses this tracking data to render realtime holographic guides on the hololens giving the user insight into the current progress of needle insertion and an indication of the target needle trajectory the operators field of view is augmented using visual guides and realtime us feed rendered on a holographic plane eliminating the need to consult external monitors based on these early prototypes we are aiming to develop a system that will lower the skill level required for ire while increasing overall accuracy of needle insertion and hence the likelihood of successful treatment | [['irreversible', 'electroporation', 'ire', 'is', 'a', 'soft', 'tissue', 'ablation', 'technique', 'suitable', 'for', 'treatment', 'of', 'inoperable', 'tumours', 'in', 'the', 'pancreas', 'the', 'process', 'involves', 'applying', 'a', 'high', 'voltage', 'electric', 'field', 'to', 'the', 'tissue', 'containing', 'the', 'mass', 'using', 'needle', 'electrodes', 'leaving', 'cancerous', 'cells', 'irreversibly', 'damaged', 'and', 'vulnerable', 'to', 'apoptosis', 'efficacy', 'of', 'the', 'treatment', 'depends', 'heavily', 'on', 'the', 'accuracy', 'of', 'needle', 'placement', 'and', 'requires', 'a', 'high', 'degree', 'of', 'skill', 'from', 'the', 'operator', 'in', 'this', 'paper', 'we', 'describe', 'an', 'augmented', 'reality', 'ar', 'system', 'designed', 'to', 'overcome', 'the', 'challenges', 'associated', 'with', 'planning', 'and', 'guiding', 'the', 'needle', 'insertion', 'process', 'our', 'solution', 'based', 'on', 'the', 'hololens', 'microsoft', 'usa', 'platform', 'tracks', 'the', 'position', 'of', 'the', 'headset', 'needle', 'electrodes', 'and', 'ultrasound', 'us', 'probe', 'in', 'space', 'the', 'proof', 'of', 'concept', 'implementation', 'of', 'the', 'system', 'uses', 'this', 'tracking', 'data', 'to', 'render', 'realtime', 'holographic', 'guides', 'on', 'the', 'hololens', 'giving', 'the', 'user', 'insight', 'into', 'the', 'current', 'progress', 'of', 'needle', 'insertion', 'and', 'an', 'indication', 'of', 'the', 'target', 'needle', 'trajectory', 'the', 'operators', 'field', 'of', 'view', 'is', 'augmented', 'using', 'visual', 'guides', 'and', 'realtime', 'us', 'feed', 'rendered', 'on', 'a', 'holographic', 'plane', 'eliminating', 'the', 'need', 'to', 'consult', 'external', 'monitors', 'based', 'on', 'these', 'early', 'prototypes', 'we', 'are', 'aiming', 'to', 'develop', 'a', 'system', 'that', 'will', 'lower', 'the', 'skill', 'level', 'required', 'for', 'ire', 'while', 'increasing', 'overall', 'accuracy', 'of', 'needle', 'insertion', 'and', 'hence', 'the', 'likelihood', 'of', 'successful', 'treatment']] | [-0.06919076339729026, 0.07451471535417699, -0.061373875332804764, 0.0016897369610020842, -0.10473411426896874, -0.15265874863410733, 0.09539695256705195, 0.37760813622169687, -0.18564043901795435, -0.3357225649024003, 0.08899283677853087, -0.26327024482486544, -0.12594596308299175, 0.20316517154825417, -0.1451890294344347, 0.06755730676221026, 0.0806922820466353, 0.02349981635065845, -0.009212234457867724, -0.20204664251079488, 0.2714639698747093, 0.0904508256679836, 0.3239020737949933, 0.07057445778383081, 0.15854488842561407, 0.06656981127610796, -0.007432142639245455, -0.013244006351244671, -0.06327510944739116, 0.14083444892111122, 0.2364610903417674, 0.16364665914470522, 0.28639055673189673, -0.5019637590500517, -0.16134201078871527, 0.04054206382879274, 0.12840159680198215, 0.09489724836007596, -0.06368154396464021, -0.31268308296033714, 0.04593048877927048, -0.11920057375139881, -0.13535404603963144, -0.05931358718776762, -0.03583939438228818, 0.004099951700958049, -0.28484414914344375, 0.012524928738772173, 0.019360261144569128, 0.07850828596660606, -0.08139186278943007, -0.06475773151522224, 0.005029514922638572, 0.18416268506784222, 0.010733082035075543, 0.08135209482548884, 0.23570974801762778, -0.17512639923452042, -0.07806124951620803, 0.33603899929211173, 0.019187213784457993, -0.18462900958071837, 0.19103743311259286, -0.10055736025031568, -0.062686615232944, 0.1669614361370609, 0.19807481480148734, 0.12786865611364803, -0.17535040605917712, 0.01199852474818276, 0.057413832256494296, 0.1877223837415679, 0.07652398305575181, -0.05727056037116726, 0.22112817622756012, 0.24218648871968318, 0.04829167664757164, 0.15957635470500617, -0.12613444247584416, -0.04133784598192183, -0.2550083279466065, -0.18969131279171, -0.12452561151569222, -0.0010978610659557804, -0.07588603804912038, -0.1979528702343988, 0.39234090891936535, 0.19466485735464178, 0.14961397953039887, 0.014631541021533799, 0.3297431980853761, 0.04787873037683856, 0.09342866126996265, -0.0027928957356592623, 0.19278511351679462, 0.05591524443502111, 0.1553556999990229, -0.2477180707571967, 0.11204839737598445, 0.07201526955610019] |
1,802.03275 | Slice Sampling Particle Belief Propagation | Inference in continuous label Markov random fields is a challenging task. We
use particle belief propagation (PBP) for solving the inference problem in
continuous label space. Sampling particles from the belief distribution is
typically done by using Metropolis-Hastings Markov chain Monte Carlo methods
which involves sampling from a proposal distribution. This proposal
distribution has to be carefully designed depending on the particular model and
input data to achieve fast convergence. We propose to avoid dependence on a
proposal distribution by introducing a slice sampling based PBP algorithm. The
proposed approach shows superior convergence performance on an image denoising
toy example. Our findings are validated on a challenging relational 2D feature
tracking application.
| cs.CV cs.AI | inference in continuous label markov random fields is a challenging task we use particle belief propagation pbp for solving the inference problem in continuous label space sampling particles from the belief distribution is typically done by using metropolishastings markov chain monte carlo methods which involves sampling from a proposal distribution this proposal distribution has to be carefully designed depending on the particular model and input data to achieve fast convergence we propose to avoid dependence on a proposal distribution by introducing a slice sampling based pbp algorithm the proposed approach shows superior convergence performance on an image denoising toy example our findings are validated on a challenging relational 2d feature tracking application | [['inference', 'in', 'continuous', 'label', 'markov', 'random', 'fields', 'is', 'a', 'challenging', 'task', 'we', 'use', 'particle', 'belief', 'propagation', 'pbp', 'for', 'solving', 'the', 'inference', 'problem', 'in', 'continuous', 'label', 'space', 'sampling', 'particles', 'from', 'the', 'belief', 'distribution', 'is', 'typically', 'done', 'by', 'using', 'metropolishastings', 'markov', 'chain', 'monte', 'carlo', 'methods', 'which', 'involves', 'sampling', 'from', 'a', 'proposal', 'distribution', 'this', 'proposal', 'distribution', 'has', 'to', 'be', 'carefully', 'designed', 'depending', 'on', 'the', 'particular', 'model', 'and', 'input', 'data', 'to', 'achieve', 'fast', 'convergence', 'we', 'propose', 'to', 'avoid', 'dependence', 'on', 'a', 'proposal', 'distribution', 'by', 'introducing', 'a', 'slice', 'sampling', 'based', 'pbp', 'algorithm', 'the', 'proposed', 'approach', 'shows', 'superior', 'convergence', 'performance', 'on', 'an', 'image', 'denoising', 'toy', 'example', 'our', 'findings', 'are', 'validated', 'on', 'a', 'challenging', 'relational', '2d', 'feature', 'tracking', 'application']] | [-0.011816220784177338, 0.04841537755016491, -0.13349879754813238, 0.10559441545150808, -0.11207540433055588, -0.15618318847763085, 0.05601720036273556, 0.5054280367995878, -0.25994521396101583, -0.3276814833334356, 0.08497087444370013, -0.20273080463604337, -0.12620463175283345, 0.18284023381732237, -0.09000194614470404, 0.1468442311493813, 0.14542700397682243, -0.012266469583015091, -0.06726311388771526, -0.2629814242744552, 0.2624689495382232, 0.0986728498994905, 0.3769997808017901, -0.052766050819108, 0.17642980247806658, 0.06537912234281455, -0.028158771984245896, -0.018222117031785143, -0.08981597987959893, 0.10168558837176533, 0.22932376654976647, 0.19118023843371443, 0.3420104045113216, -0.36474817229567896, -0.23675866706513002, 0.09763737568365675, 0.16334074506552757, 0.1354201174305802, -0.08305388702345746, -0.3578955600304263, 0.03550969235532518, -0.1506201501968982, -0.014600791921631233, -0.12212585052059564, -0.0976433782114847, -0.0003252803118292442, -0.32974579678349464, 0.03002572645034109, 0.04417194093132691, 0.04771010524460247, 0.020127329894291637, -0.09436134161322636, 0.04766956032627994, 0.03980764039027106, 0.04467518961090328, 0.07747391987608612, 0.14865070627586516, -0.09688756237613104, -0.1942187235898538, 0.3270509533675587, -0.049025480182275975, -0.3087792494500588, 0.15246981535580875, -0.02876540581174985, -0.17932169234596326, 0.16841280583633175, 0.2006657793036928, 0.16973337940622255, -0.15716297408133478, 0.08396498957829733, -0.021041584632517436, 0.14432671359307797, -0.0023140333318484147, -0.06410997022924546, 0.1471481830605106, 0.263682495667516, 0.07477196657367001, 0.17946992930020705, -0.1513809195561667, -0.1904922947121252, -0.22883205955648528, -0.12069601803003545, -0.29686524418190985, -0.0049792480546914574, -0.12150732429069779, -0.19025179003697953, 0.3805994830950762, 0.2785814199687674, 0.1972676372305224, 0.1008300380874841, 0.3216066587982433, 0.09111130324163241, 0.017435916607999907, 0.0954987497030483, 0.1237467750990098, 0.08362313667021226, 0.07426859526146602, -0.15790612764560916, 0.1286419997548884, 0.09498319491727411] |
1,802.03276 | Shadow of a noncommutative geometry inspired Ay\'on Beato Garc\'ia black
hole | We introduce the noncommutative geometry inspired Ay\'on Beato Garc\'ia black
hole metric and study various properties of this metric by which we try to
probe the allowed values of the noncommutative parameter $\vartheta$ under
certain conditions. We then construct the shadow (apparent shape) cast by this
black hole. We derive the corresponding photon orbits and explore the effects
of noncommutative spacetime on them. We then study the effects of
noncommutative parameter $\vartheta$, smeared mass $m(r)$, smeared charge
$q(r)$ on the silhouette of the shadow analytically and present the results
graphically. We then discuss the deformation which arises in the shape of the
shadow under various conditions. Finally, we introduce a plasma background and
observe how the shadow behaves in this scenario.
| physics.gen-ph | we introduce the noncommutative geometry inspired ayon beato garcia black hole metric and study various properties of this metric by which we try to probe the allowed values of the noncommutative parameter vartheta under certain conditions we then construct the shadow apparent shape cast by this black hole we derive the corresponding photon orbits and explore the effects of noncommutative spacetime on them we then study the effects of noncommutative parameter vartheta smeared mass mr smeared charge qr on the silhouette of the shadow analytically and present the results graphically we then discuss the deformation which arises in the shape of the shadow under various conditions finally we introduce a plasma background and observe how the shadow behaves in this scenario | [['we', 'introduce', 'the', 'noncommutative', 'geometry', 'inspired', 'ayon', 'beato', 'garcia', 'black', 'hole', 'metric', 'and', 'study', 'various', 'properties', 'of', 'this', 'metric', 'by', 'which', 'we', 'try', 'to', 'probe', 'the', 'allowed', 'values', 'of', 'the', 'noncommutative', 'parameter', 'vartheta', 'under', 'certain', 'conditions', 'we', 'then', 'construct', 'the', 'shadow', 'apparent', 'shape', 'cast', 'by', 'this', 'black', 'hole', 'we', 'derive', 'the', 'corresponding', 'photon', 'orbits', 'and', 'explore', 'the', 'effects', 'of', 'noncommutative', 'spacetime', 'on', 'them', 'we', 'then', 'study', 'the', 'effects', 'of', 'noncommutative', 'parameter', 'vartheta', 'smeared', 'mass', 'mr', 'smeared', 'charge', 'qr', 'on', 'the', 'silhouette', 'of', 'the', 'shadow', 'analytically', 'and', 'present', 'the', 'results', 'graphically', 'we', 'then', 'discuss', 'the', 'deformation', 'which', 'arises', 'in', 'the', 'shape', 'of', 'the', 'shadow', 'under', 'various', 'conditions', 'finally', 'we', 'introduce', 'a', 'plasma', 'background', 'and', 'observe', 'how', 'the', 'shadow', 'behaves', 'in', 'this', 'scenario']] | [-0.12564605116225905, 0.10184510744337243, -0.10124832470001292, 0.12108578901256614, -0.06806521204558491, -0.09451396166573928, 0.013292755078555657, 0.33337091466709345, -0.2570303786495121, -0.2759381985651846, 0.1053128436622562, -0.21930762787619526, -0.19548960715657523, 0.14343981235288084, -0.11415230160571259, 0.01928460225768626, -0.03860712031434689, 0.036763770612418464, -0.15927003753692412, -0.20726192535582086, 0.4248446581744346, 0.09602710107701416, 0.224384478121182, 0.051525433182896374, 0.1093798238791901, 0.048850687388956794, -0.03743346908888897, 0.0888912454521393, -0.257241775651884, 0.05762093378810071, 0.16258059694048235, 0.13097976213477613, 0.17515861757193543, -0.40052328495105277, -0.18580760146386555, 0.09296204708516598, 0.10026226062405885, 0.09881286483704105, -0.07235435359845203, -0.3093286896390574, 0.0686136627092394, -0.19924058803521535, -0.17333951637446254, -0.06138798761760675, 0.014054040252348455, -0.04064238771694485, -0.21742067248038333, 0.047486917569669856, 0.06982450390688512, -0.046838315618576626, -0.09055292195476153, -0.02684120471714487, -0.007831781149740103, 0.08399455114502553, 0.1086802072325042, -0.027437064965439475, 0.19942478579273368, -0.09647579874917708, -0.07934556847062557, 0.33675943034067124, -0.04204655560995491, -0.24879745521950497, 0.10873032256397379, -0.21976447515502698, -0.10669889239234333, 0.04588390887174912, 0.1669657252134145, 0.2053595881228249, -0.1030097627667945, 0.1540719946912889, -0.06850873184891246, 0.14101631202961967, 0.12529941854857596, 0.06363138394575066, 0.2639696831587984, 0.06717238141646405, 0.023644943075927616, 0.24598421803049492, -0.16276519232015751, -0.09601510261349819, -0.3166013061882881, -0.12104115322889651, -0.09148705026825514, 0.09210806807988331, -0.1732152260584608, -0.1807651377103033, 0.40937904548682585, 0.17878798815664373, 0.26770225625892147, -0.015277201667850633, 0.244800752357525, 0.10841714798183251, -0.003951028881578886, 0.04123043013783563, 0.2623607231120133, 0.11130847577240412, 0.09798969186748527, -0.2546220815490086, -0.036454212184635404, 0.10452373056993389] |
1,802.03277 | Mechanism for Resolving Gauge Hierarchy and Large Vacuum Energy | Alternative forms of the solutions to the quantum field equations and their
implications for physical theory are considered. Incorporation of these
alternative solution forms, herein deemed "supplemental solutions", into the
development of quantum field theory leads to a unique class of particle states,
which may provide simple resolutions of more than one extant problem in high
energy physics. The symmetry between the traditional and supplemental solutions
results in a direct and natural zero-point energy value of zero, and, as well,
a possible mechanism for cancelling the Higgs condensate energy, thereby
providing a potential resolution of the large cosmological constant problem.
Further, this symmetry may also resolve the Higgs gauge hierarchy problem.
Resolutions of seeming theoretic impediments to supplemental fields, in
particular, non-positive definite Fock space metric and vacuum decay, are
presented, and concomitant implications for unitarity are considered. As
supplemental solutions are already inherent in quantum field theory, little
change is required to the fundamental mathematics of the theory.
| physics.gen-ph | alternative forms of the solutions to the quantum field equations and their implications for physical theory are considered incorporation of these alternative solution forms herein deemed supplemental solutions into the development of quantum field theory leads to a unique class of particle states which may provide simple resolutions of more than one extant problem in high energy physics the symmetry between the traditional and supplemental solutions results in a direct and natural zeropoint energy value of zero and as well a possible mechanism for cancelling the higgs condensate energy thereby providing a potential resolution of the large cosmological constant problem further this symmetry may also resolve the higgs gauge hierarchy problem resolutions of seeming theoretic impediments to supplemental fields in particular nonpositive definite fock space metric and vacuum decay are presented and concomitant implications for unitarity are considered as supplemental solutions are already inherent in quantum field theory little change is required to the fundamental mathematics of the theory | [['alternative', 'forms', 'of', 'the', 'solutions', 'to', 'the', 'quantum', 'field', 'equations', 'and', 'their', 'implications', 'for', 'physical', 'theory', 'are', 'considered', 'incorporation', 'of', 'these', 'alternative', 'solution', 'forms', 'herein', 'deemed', 'supplemental', 'solutions', 'into', 'the', 'development', 'of', 'quantum', 'field', 'theory', 'leads', 'to', 'a', 'unique', 'class', 'of', 'particle', 'states', 'which', 'may', 'provide', 'simple', 'resolutions', 'of', 'more', 'than', 'one', 'extant', 'problem', 'in', 'high', 'energy', 'physics', 'the', 'symmetry', 'between', 'the', 'traditional', 'and', 'supplemental', 'solutions', 'results', 'in', 'a', 'direct', 'and', 'natural', 'zeropoint', 'energy', 'value', 'of', 'zero', 'and', 'as', 'well', 'a', 'possible', 'mechanism', 'for', 'cancelling', 'the', 'higgs', 'condensate', 'energy', 'thereby', 'providing', 'a', 'potential', 'resolution', 'of', 'the', 'large', 'cosmological', 'constant', 'problem', 'further', 'this', 'symmetry', 'may', 'also', 'resolve', 'the', 'higgs', 'gauge', 'hierarchy', 'problem', 'resolutions', 'of', 'seeming', 'theoretic', 'impediments', 'to', 'supplemental', 'fields', 'in', 'particular', 'nonpositive', 'definite', 'fock', 'space', 'metric', 'and', 'vacuum', 'decay', 'are', 'presented', 'and', 'concomitant', 'implications', 'for', 'unitarity', 'are', 'considered', 'as', 'supplemental', 'solutions', 'are', 'already', 'inherent', 'in', 'quantum', 'field', 'theory', 'little', 'change', 'is', 'required', 'to', 'the', 'fundamental', 'mathematics', 'of', 'the', 'theory']] | [-0.11881747525317138, 0.13921634466738775, -0.0773415018265493, 0.12101439079094045, -0.12942767688571094, -0.14507981455949304, 0.0128388216670708, 0.31133197891121767, -0.2785444335496557, -0.3142110458311607, 0.09165403228319022, -0.23851650710211797, -0.11956527269790945, 0.17423366433457593, -0.0426578602853155, 0.07803150674667936, 0.03810790828399876, 0.023091947693713068, -0.0653562111880355, -0.22513611237489203, 0.3232927750301864, 0.08251509597486928, 0.2676773165592795, 0.09441547934844527, 0.09999473857160353, -0.03267764374935918, -0.017819229325970763, 0.01578234706301705, -0.1467549825429846, 0.12958620606120616, 0.2645757990675457, 0.11491577906156825, 0.26356450863088826, -0.43265663432953116, -0.22665015841195793, 0.09987140849302963, 0.12208302779366269, 0.1614404113914923, -0.09587893868936007, -0.26420245553314126, 0.0680744035078693, -0.16808946426729407, -0.16858199425114892, -0.09645283408170133, -0.011987467062858713, -0.04331433674344008, -0.23603956775634355, 0.09440379933166353, 0.02479757203533074, 0.059681225257615246, -0.10651304667124396, -0.12640162021999465, -0.006397978907872764, 0.09272816977844392, 0.09612186279136149, -0.0012905930253858649, 0.06710680654864032, -0.19591951974281022, -0.13775858609591546, 0.41041712447672896, -0.02353378548332616, -0.2234938666839504, 0.1912998009074784, -0.09937987379647745, -0.10295830688398308, 0.12101275143770021, 0.11268500078164931, 0.08732691758646155, -0.10980897236017967, 0.14853331219161856, 0.02488661445560133, 0.1382595637385622, 0.0837015551763862, 0.11488219814480476, 0.25025244434979166, 0.10582897885491685, 0.08119955781331789, 0.07761757396624289, 0.011414333300829027, -0.16479688700114278, -0.3803850972450942, -0.20156068320286535, -0.13043228480613456, 0.09466108522940216, -0.08863711464160222, -0.16613021432041372, 0.3736321149048331, 0.12562131063145754, 0.15586507307810696, -0.006196653390590266, 0.2563901024844216, 0.11757248932233595, 0.05471255980232883, -0.005740178049008989, 0.2458686416371251, 0.17088393572536326, 0.1070989528670907, -0.1916107446238627, -0.019663004181201354, 0.055118967998632286] |
1,802.03278 | The weak-field-limit solution for Kerr black hole in radiation gauge | In this work we present the solution for a rotating Kerr black hole in the
weak-field limit under the radiation gauge proposed by Chen and Zhu [Phys. Rev.
D83, 061501(R) (2011)], with which the two physical components of the
gravitational wave can be picked out exactly.
| physics.gen-ph | in this work we present the solution for a rotating kerr black hole in the weakfield limit under the radiation gauge proposed by chen and zhu phys rev d83 061501r 2011 with which the two physical components of the gravitational wave can be picked out exactly | [['in', 'this', 'work', 'we', 'present', 'the', 'solution', 'for', 'a', 'rotating', 'kerr', 'black', 'hole', 'in', 'the', 'weakfield', 'limit', 'under', 'the', 'radiation', 'gauge', 'proposed', 'by', 'chen', 'and', 'zhu', 'phys', 'rev', 'd83', '061501r', '2011', 'with', 'which', 'the', 'two', 'physical', 'components', 'of', 'the', 'gravitational', 'wave', 'can', 'be', 'picked', 'out', 'exactly']] | [-0.1177061588462928, 0.08116090753743344, -0.04365077226058296, -0.05384762894169873, -0.08226271370506805, -0.07780173899727347, 0.046544124751918665, 0.2719189509465966, -0.09735894339847499, -0.29905941151082516, 0.007762650063301882, -0.26819408409621404, -0.16530492162817848, 0.18357054472131573, -0.10100545710884035, 0.05958510869506584, -0.030739302706459293, -0.05412126046797747, -0.05177630275062731, -0.28651811160228174, 0.2687724742471524, 0.10543234992529386, 0.23299246688332895, 0.010522852908647821, 0.09563120027356174, 0.047003992701597185, 0.019001435240447197, 0.04258245144687269, -0.15071220178177339, -0.0159289982655774, 0.20920839164729998, 0.08323221929047418, 0.21769204889626606, -0.39665914618450665, -0.25165983862446056, 0.05388912584875589, 0.08214498414536534, 0.17165144408152075, -0.04280139568626233, -0.3979248066999666, 0.05262403593540354, -0.2241530475490119, -0.1382774780934636, -0.08546423227728708, 0.12444212020415327, -0.01346654094674665, -0.27166696342275193, 0.11409048940581472, 0.08884929610497277, -0.06350900453474859, -0.027462210182262504, -0.016529649050663345, -0.03894185910568289, -0.017653015978715342, 0.0686513384723145, 0.10058357818659557, 0.10060568544608743, -0.029728689580224454, -0.11389871680623163, 0.35424350987633935, -0.09719513915479183, -0.21775773604926857, 0.18551596013687388, -0.18326612210670568, -0.13600056239849198, 0.09902449385465487, 0.12304199750170759, 0.2013732511702034, -0.2115816290733283, 0.1454844315746374, -0.09404670036082793, 0.09317568745261626, 0.20442421811268383, 0.006561729449616826, 0.2916812879316833, 0.06530004774179796, -0.07026265760641368, 0.13974902355466443, -0.10203035888464554, -0.06926550173565098, -0.31822764225628064, -0.14471281788080334, -0.1786878912243992, 0.13715800169302383, -0.035219826411301496, -0.08355620251361119, 0.39230036083608866, 0.16911689460824203, 0.18591009501529776, -0.02877784618328366, 0.22512390141618316, 0.11246644082205856, -0.05246259851138229, 0.22294388061551296, 0.4124585220023342, 0.1488162152590635, 0.12891875247916448, -0.24324961939988576, -0.10057257191763948, 0.12208629873297784] |
1,802.03279 | Temporally Object-based Video Co-Segmentation | In this paper, we propose an unsupervised video object co-segmentation
framework based on the primary object proposals to extract the common
foreground object(s) from a given video set. In addition to the objectness
attributes and motion coherence our framework exploits the temporal consistency
of the object-like regions between adjacent frames to enrich the set of
original object proposals. We call the enriched proposal sets temporal proposal
streams, as they are composed of the most similar proposals from each frame
augmented with predicted proposals using temporally consistent superpixel
information. The temporal proposal streams represent all the possible region
tubes of the objects. Therefore, we formulate a graphical model to select a
proposal stream for each object in which the pairwise potentials consist of the
appearance dissimilarity between different streams in the same video and also
the similarity between the streams in different videos. This model is suitable
for single (multiple) foreground objects in two (more) videos, which can be
solved by any existing energy minimization method. We evaluate our proposed
framework by comparing it to other video co-segmentation algorithms. Our method
achieves improved performance on state-of-the-art benchmark datasets.
| cs.CV | in this paper we propose an unsupervised video object cosegmentation framework based on the primary object proposals to extract the common foreground objects from a given video set in addition to the objectness attributes and motion coherence our framework exploits the temporal consistency of the objectlike regions between adjacent frames to enrich the set of original object proposals we call the enriched proposal sets temporal proposal streams as they are composed of the most similar proposals from each frame augmented with predicted proposals using temporally consistent superpixel information the temporal proposal streams represent all the possible region tubes of the objects therefore we formulate a graphical model to select a proposal stream for each object in which the pairwise potentials consist of the appearance dissimilarity between different streams in the same video and also the similarity between the streams in different videos this model is suitable for single multiple foreground objects in two more videos which can be solved by any existing energy minimization method we evaluate our proposed framework by comparing it to other video cosegmentation algorithms our method achieves improved performance on stateoftheart benchmark datasets | [['in', 'this', 'paper', 'we', 'propose', 'an', 'unsupervised', 'video', 'object', 'cosegmentation', 'framework', 'based', 'on', 'the', 'primary', 'object', 'proposals', 'to', 'extract', 'the', 'common', 'foreground', 'objects', 'from', 'a', 'given', 'video', 'set', 'in', 'addition', 'to', 'the', 'objectness', 'attributes', 'and', 'motion', 'coherence', 'our', 'framework', 'exploits', 'the', 'temporal', 'consistency', 'of', 'the', 'objectlike', 'regions', 'between', 'adjacent', 'frames', 'to', 'enrich', 'the', 'set', 'of', 'original', 'object', 'proposals', 'we', 'call', 'the', 'enriched', 'proposal', 'sets', 'temporal', 'proposal', 'streams', 'as', 'they', 'are', 'composed', 'of', 'the', 'most', 'similar', 'proposals', 'from', 'each', 'frame', 'augmented', 'with', 'predicted', 'proposals', 'using', 'temporally', 'consistent', 'superpixel', 'information', 'the', 'temporal', 'proposal', 'streams', 'represent', 'all', 'the', 'possible', 'region', 'tubes', 'of', 'the', 'objects', 'therefore', 'we', 'formulate', 'a', 'graphical', 'model', 'to', 'select', 'a', 'proposal', 'stream', 'for', 'each', 'object', 'in', 'which', 'the', 'pairwise', 'potentials', 'consist', 'of', 'the', 'appearance', 'dissimilarity', 'between', 'different', 'streams', 'in', 'the', 'same', 'video', 'and', 'also', 'the', 'similarity', 'between', 'the', 'streams', 'in', 'different', 'videos', 'this', 'model', 'is', 'suitable', 'for', 'single', 'multiple', 'foreground', 'objects', 'in', 'two', 'more', 'videos', 'which', 'can', 'be', 'solved', 'by', 'any', 'existing', 'energy', 'minimization', 'method', 'we', 'evaluate', 'our', 'proposed', 'framework', 'by', 'comparing', 'it', 'to', 'other', 'video', 'cosegmentation', 'algorithms', 'our', 'method', 'achieves', 'improved', 'performance', 'on', 'stateoftheart', 'benchmark', 'datasets']] | [-0.0554098985693293, 0.006486029539180716, -0.09809363727166792, 0.05600064819526764, -0.08231021776636016, -0.1286240594815164, 0.010907667217761239, 0.4604662825218975, -0.24991194477347148, -0.34876473108555545, 0.010115409510230077, -0.26711654916086935, -0.1324186809360981, 0.15533631696816494, -0.153789978575386, 0.05518339559209239, 0.12249308549375697, 0.07288375315082105, -0.05173346921048291, -0.27050277842258547, 0.31579230776938166, 0.019346030879725907, 0.324043236772485, -0.037869346071592466, 0.15119165795441855, -0.02095333542201648, -0.09054832360931339, 0.03428169822489673, -0.043221434699072636, 0.2056873151235641, 0.2749230573215288, 0.21929047961869055, 0.26190547304437123, -0.41338047706073816, -0.233979033171772, 0.053963156428217966, 0.1326252010770461, 0.0992780105793073, -0.03930819267445969, -0.40046107584242036, 0.10988551021595909, -0.16886140976239986, 0.01422718919086504, -0.07517390639426555, -0.0011227164805971365, -0.006179767620953965, -0.28361455628020876, 0.04108261028513248, 0.049114807456592344, -0.010730039542491104, -0.09417192987290854, -0.05742244690502272, 0.0320881713433241, 0.18518070777489698, 0.035808060145787496, 0.06160315534132309, 0.12999462423955693, -0.14734392937481805, -0.1462178406228416, 0.3925144047262197, -0.05914194259747743, -0.21724995213248244, 0.24032302605819933, -0.04351038765006594, -0.1379883453576143, 0.10980870643814897, 0.18117589101613685, 0.1860557706375422, -0.1855837329375473, -0.03225490872382142, -0.0894299269539309, 0.17648859366894087, 0.09564809981524386, 0.054516269481755836, 0.2626384127425045, 0.2053415342716545, 0.027545170223509722, 0.15480619787710426, -0.17604578079476474, -0.06825052077021639, -0.2694946534406857, -0.08786998529803944, -0.17785847874639685, -0.125556116911239, -0.1378516042752896, -0.11533256578831909, 0.4039454981634881, 0.2631368609219989, 0.2519014388631611, 0.054791451383252594, 0.3680347690911575, 0.0010990519152847143, 0.10296932371603425, 0.09535248335301477, 0.14689621886731508, -0.002035840287465941, 0.08728235417305875, -0.14972070300762347, 0.047916217978525764, 0.11099945158662802] |
1,802.0328 | A Practical Guide to Multi-image Alignment | Multi-image alignment, bringing a group of images into common register, is an
ubiquitous problem and the first step of many applications in a wide variety of
domains. As a result, a great amount of effort is being invested in developing
efficient multi-image alignment algorithms. Little has been done, however, to
answer fundamental practical questions such as: what is the comparative
performance of existing methods? is there still room for improvement? under
which conditions should one technique be preferred over another? does adding
more images or prior image information improve the registration results? In
this work, we present a thorough analysis and evaluation of the main
multi-image alignment methods which, combined with theoretical limits in
multi-image alignment performance, allows us to organize them under a common
framework and provide practical answers to these essential questions.
| eess.IV | multiimage alignment bringing a group of images into common register is an ubiquitous problem and the first step of many applications in a wide variety of domains as a result a great amount of effort is being invested in developing efficient multiimage alignment algorithms little has been done however to answer fundamental practical questions such as what is the comparative performance of existing methods is there still room for improvement under which conditions should one technique be preferred over another does adding more images or prior image information improve the registration results in this work we present a thorough analysis and evaluation of the main multiimage alignment methods which combined with theoretical limits in multiimage alignment performance allows us to organize them under a common framework and provide practical answers to these essential questions | [['multiimage', 'alignment', 'bringing', 'a', 'group', 'of', 'images', 'into', 'common', 'register', 'is', 'an', 'ubiquitous', 'problem', 'and', 'the', 'first', 'step', 'of', 'many', 'applications', 'in', 'a', 'wide', 'variety', 'of', 'domains', 'as', 'a', 'result', 'a', 'great', 'amount', 'of', 'effort', 'is', 'being', 'invested', 'in', 'developing', 'efficient', 'multiimage', 'alignment', 'algorithms', 'little', 'has', 'been', 'done', 'however', 'to', 'answer', 'fundamental', 'practical', 'questions', 'such', 'as', 'what', 'is', 'the', 'comparative', 'performance', 'of', 'existing', 'methods', 'is', 'there', 'still', 'room', 'for', 'improvement', 'under', 'which', 'conditions', 'should', 'one', 'technique', 'be', 'preferred', 'over', 'another', 'does', 'adding', 'more', 'images', 'or', 'prior', 'image', 'information', 'improve', 'the', 'registration', 'results', 'in', 'this', 'work', 'we', 'present', 'a', 'thorough', 'analysis', 'and', 'evaluation', 'of', 'the', 'main', 'multiimage', 'alignment', 'methods', 'which', 'combined', 'with', 'theoretical', 'limits', 'in', 'multiimage', 'alignment', 'performance', 'allows', 'us', 'to', 'organize', 'them', 'under', 'a', 'common', 'framework', 'and', 'provide', 'practical', 'answers', 'to', 'these', 'essential', 'questions']] | [-0.07882230416541475, -0.02691400427370829, -0.10305576216179266, 0.04860916958101886, -0.12245509844558286, -0.14402551989335177, 0.05768968721455547, 0.43144438315683337, -0.24887381369289732, -0.3507665682222639, 0.12109962660635112, -0.22493162698561148, -0.14101038331777524, 0.23542944896347653, -0.13695800967111404, 0.08644407489267525, 0.1112436769849885, 0.012306776417483603, -0.07367075588762649, -0.29003984600639166, 0.2671100652929562, 0.07443471335625249, 0.3325642844689871, 0.08116749290693134, 0.08335930391548396, -0.009813571932600506, -0.0509274226840092, 0.01139953380812015, -0.10283692798806604, 0.17506049246068545, 0.3304025001142786, 0.18998685688885458, 0.3519569158018914, -0.4043526532851271, -0.22209436252605474, 0.11148582019086462, 0.17231749143076144, 0.12778985161688736, -0.09745724216234304, -0.2605028862286526, 0.0982435596759306, -0.1209675037969293, -0.05679726663198489, -0.10677214966280692, -0.005671572543110754, -0.060664225589490924, -0.26412304420260463, 0.008099499794501645, 0.1090438667087079, 0.08870392398380522, -0.018148681211872582, -0.12172640540720478, 0.07549132857516881, 0.2157313409939047, 0.07796138486027805, 0.07385069983420588, 0.09105507972208894, -0.1482625476227128, -0.1315114039844319, 0.42881771475910696, -0.00872494072354496, -0.20306636112978432, 0.21892184237324036, -0.05070898458518004, -0.16998654249065154, 0.1308033441040498, 0.17028621126855933, 0.11535479747620758, -0.16200903965222802, 0.04601007542414799, -0.043284545409312446, 0.18736269869302996, 0.045381934951935245, 0.03608898300270953, 0.20974984326844673, 0.24183686989109351, 0.0956283036038217, 0.12247148414799221, -0.04990026213549279, -0.07915463738852362, -0.20601438477968992, -0.16837603397973216, -0.12841374965891963, 0.02035889324450643, -0.0426489086470909, -0.1369087321669864, 0.39101172691739317, 0.207264174422277, 0.19249258369447164, -0.00972390611857565, 0.3740733324258185, 0.03088157449730797, 0.09877117312297837, 0.00929944362811077, 0.18408710331440584, 0.0872288637659026, 0.07782298802144465, -0.11809834245368213, 0.08506330720204582, -0.007847744158344038] |
1,802.03281 | Universality of phonon transport in surface-roughness dominated
nanowires | We analyze, both theoretically and numerically, the temperature dependent
thermal conductivity \k{appa} of two-dimensional nanowires with surface
roughness. Although each sample is characterized by three independent
parameters - the diameter (width) of the wire, the correlation length and
strength of the surface corrugation - our theory predicts that there exists a
universal regime where \k{appa} is a function of a single combination of all
three model parameters. Numerical simulations of propagation of acoustic
phonons across thin wires confirm this universality and predict a d 1/2
dependence of \k{appa} on the diameter d.
| cond-mat.dis-nn cond-mat.mes-hall | we analyze both theoretically and numerically the temperature dependent thermal conductivity kappa of twodimensional nanowires with surface roughness although each sample is characterized by three independent parameters the diameter width of the wire the correlation length and strength of the surface corrugation our theory predicts that there exists a universal regime where kappa is a function of a single combination of all three model parameters numerical simulations of propagation of acoustic phonons across thin wires confirm this universality and predict a d 12 dependence of kappa on the diameter d | [['we', 'analyze', 'both', 'theoretically', 'and', 'numerically', 'the', 'temperature', 'dependent', 'thermal', 'conductivity', 'kappa', 'of', 'twodimensional', 'nanowires', 'with', 'surface', 'roughness', 'although', 'each', 'sample', 'is', 'characterized', 'by', 'three', 'independent', 'parameters', 'the', 'diameter', 'width', 'of', 'the', 'wire', 'the', 'correlation', 'length', 'and', 'strength', 'of', 'the', 'surface', 'corrugation', 'our', 'theory', 'predicts', 'that', 'there', 'exists', 'a', 'universal', 'regime', 'where', 'kappa', 'is', 'a', 'function', 'of', 'a', 'single', 'combination', 'of', 'all', 'three', 'model', 'parameters', 'numerical', 'simulations', 'of', 'propagation', 'of', 'acoustic', 'phonons', 'across', 'thin', 'wires', 'confirm', 'this', 'universality', 'and', 'predict', 'a', 'd', '12', 'dependence', 'of', 'kappa', 'on', 'the', 'diameter', 'd']] | [-0.17168145960571968, 0.2089836258130769, -0.056023858995952955, -0.014347814405078275, 0.003712302425669299, -0.16922493148595094, 0.05193541667863934, 0.37743142472787033, -0.2613121057239672, -0.27468860168009995, 0.017309719541420538, -0.29819567431178357, -0.1183242789366179, 0.20633606987022277, 0.0764800195582211, 0.0545380684081465, 0.00366240359014935, -0.015097830998193887, -0.07243332418664876, -0.18613583536611664, 0.2933224497621672, 0.007859736127364967, 0.3224884949831499, 0.09755503457660476, 0.06859069207372764, 0.0033822373745756016, 0.025831435972617733, 0.11255879394787674, -0.24026830409849126, 0.03815447968275597, 0.14665157519694832, -0.04735166371174273, 0.1996488373422633, -0.3662814571725095, -0.27304621395758455, 0.02349378652870655, 0.13453168502698343, 0.0779867807454947, 0.022213952329992834, -0.18487614223526583, 0.07763594871179925, -0.09420356595267852, -0.16029007189984742, 0.006267518839902348, 0.11302194255921576, 0.010006001829687092, -0.2531213371477659, 0.11510703755128715, 0.03906561743933708, 0.07842430948383278, -0.04513554133785268, -0.13434474588397682, -0.07120996961732291, 0.08437641031276952, 0.04541222849834917, 0.013627402101539903, 0.154004164893801, -0.11735813490166846, -0.07088067273855106, 0.324418388100134, -0.10374893254290024, -0.1776171169243753, 0.1723805278694878, -0.18257998371166953, -0.029126382370789846, 0.13608940169215203, 0.12847237635352132, 0.10756637677550315, -0.10036164005804393, 0.10147612123400904, -0.06771895958421131, 0.2575584333571088, 0.06987180691212416, 0.03505280761358639, 0.21585892347825897, 0.24002833630527473, -0.01686674913701912, 0.14063716404553916, -0.15127106059290882, -0.002552367451911171, -0.3125933390421172, -0.1284879685043254, -0.22244289416121318, 0.040095838733638325, -0.17003311427365084, -0.22885346466985843, 0.4001862084493041, 0.13246889638701556, 0.21171540739014744, 0.07591018011088535, 0.24498312127026212, 0.10103153069632956, 0.0521495477296412, 0.07803110855424569, 0.24569282182201277, 0.1781988185429428, 0.01843556448471241, -0.287105969293043, 0.07159196611804267, 0.00534664091343681] |
1,802.03282 | Chaotic synchronization of two optical cavity modes in optomechanical
systems | The synchronization of the motion of microresonators has attracted
considerable attention. Here we present theoretical methods to synchronize the
chaotic motion of two optical cavity modes in an optomechanical system, in
which one of the optical modes is strongly driven into chaotic motion and is
coupled to another weakly-driven optical mode mediated by a mechanical
resonator. In these optomechanical systems, we can obtain both complete and
phase synchronization of the optical cavity modes in chaotic motion, starting
from different initial states. We find that complete synchronization of chaos
can be achieved in two identical cavity modes. In the strong-coupling
small-detuning regime, we also {produce} phase synchronization of chaos between
two nonidentical cavity modes.
| quant-ph | the synchronization of the motion of microresonators has attracted considerable attention here we present theoretical methods to synchronize the chaotic motion of two optical cavity modes in an optomechanical system in which one of the optical modes is strongly driven into chaotic motion and is coupled to another weaklydriven optical mode mediated by a mechanical resonator in these optomechanical systems we can obtain both complete and phase synchronization of the optical cavity modes in chaotic motion starting from different initial states we find that complete synchronization of chaos can be achieved in two identical cavity modes in the strongcoupling smalldetuning regime we also produce phase synchronization of chaos between two nonidentical cavity modes | [['the', 'synchronization', 'of', 'the', 'motion', 'of', 'microresonators', 'has', 'attracted', 'considerable', 'attention', 'here', 'we', 'present', 'theoretical', 'methods', 'to', 'synchronize', 'the', 'chaotic', 'motion', 'of', 'two', 'optical', 'cavity', 'modes', 'in', 'an', 'optomechanical', 'system', 'in', 'which', 'one', 'of', 'the', 'optical', 'modes', 'is', 'strongly', 'driven', 'into', 'chaotic', 'motion', 'and', 'is', 'coupled', 'to', 'another', 'weaklydriven', 'optical', 'mode', 'mediated', 'by', 'a', 'mechanical', 'resonator', 'in', 'these', 'optomechanical', 'systems', 'we', 'can', 'obtain', 'both', 'complete', 'and', 'phase', 'synchronization', 'of', 'the', 'optical', 'cavity', 'modes', 'in', 'chaotic', 'motion', 'starting', 'from', 'different', 'initial', 'states', 'we', 'find', 'that', 'complete', 'synchronization', 'of', 'chaos', 'can', 'be', 'achieved', 'in', 'two', 'identical', 'cavity', 'modes', 'in', 'the', 'strongcoupling', 'smalldetuning', 'regime', 'we', 'also', 'produce', 'phase', 'synchronization', 'of', 'chaos', 'between', 'two', 'nonidentical', 'cavity', 'modes']] | [-0.2582076381742289, 0.2320082007241321, -0.08232360886177048, -0.07339968414037555, -0.022053128831820295, -0.1934564712199582, 0.02436134389842794, 0.4079672273531157, -0.26084520591289867, -0.2050843302193763, 0.05718600908793243, -0.2653359492209607, -0.15912916147083575, 0.2316932733104165, -0.04838030271951409, 0.07540299959613808, 0.07719782699132338, 0.007314924684968511, 0.03907647632669458, -0.12494451339547855, 0.2552121066463379, -0.03248003634091999, 0.28601944354263004, -0.053605256186399074, 0.08914527450438722, -0.08008698914324798, 0.076149018518793, -0.020082649009834443, -0.10324961335813246, 0.0815826485980194, 0.22200784237689472, 0.007392667649712946, 0.2878432963708682, -0.4735456071461418, -0.18864062852558813, 0.11721949969900639, 0.23494542931023585, 0.21371800260697324, -0.031771929776628634, -0.31938667617006494, -0.034072617592755705, -0.1409789916693366, -0.10137387381733529, -0.08881080203199028, 0.006983620039786079, 0.0049933542821755895, -0.25272554404468145, 0.08250774505281047, 0.08417717040616221, 0.06757229031063616, -0.04162837248129238, 0.05323900518435819, -0.036575093786398484, 0.11147935144254006, -0.040095661072492864, -0.03159288915672472, 0.12654699544197814, -0.11733653876581229, -0.12657153258000367, 0.36706139687781353, -0.08513752768340055, -0.16773827175867545, 0.2419605536353109, -0.1686807509353717, -0.05324223712835062, 0.1445253436270702, 0.21204753682416463, 0.03486117495257141, -0.14228506973345897, -0.014514315390053005, 0.040396760675191344, 0.21692244362202473, 0.09176367562031373, 0.1505490157703337, 0.2476830616859453, 0.19821028558986395, 0.009889856188757611, 0.21273723773421288, -0.04830619567655958, -0.1354329839897608, -0.23083956240277206, -0.08063882725712444, -0.16936038787987076, 0.004502895836984473, -0.08482496129389412, -0.16105906054976263, 0.44531934997732087, 0.14694426290225238, 0.1553711586997711, -0.05018353345076321, 0.29645592585542807, 0.13069476454984397, 0.037547312660275826, 0.028251713915129324, 0.42713950659214917, 0.149912914313193, 0.0791871119456898, -0.3298465746525575, -0.0792837964836508, 0.024854510361495028] |
1,802.03283 | Chiral magnetic effect search in p(d)+Au, Au+Au collisions at RHIC | The chiral magnetic effect (CME) refers to charge separation along a strong
magnetic field of single-handed quarks, caused by interactions with topological
gluon fields from QCD vacuum fluctuations. A major background of CME
measurements in heavy-ion collisions comes from resonance decays coupled with
elliptical flow anisotropy. These proceedings present two new studies from STAR
to shed further light on the background issue: (1) small system p+Au and d+Au
collisions where the CME signal is not expected, and (2) pair invariant mass
dependence where resonance peaks can be identified.
| nucl-ex hep-ex hep-ph nucl-th | the chiral magnetic effect cme refers to charge separation along a strong magnetic field of singlehanded quarks caused by interactions with topological gluon fields from qcd vacuum fluctuations a major background of cme measurements in heavyion collisions comes from resonance decays coupled with elliptical flow anisotropy these proceedings present two new studies from star to shed further light on the background issue 1 small system pau and dau collisions where the cme signal is not expected and 2 pair invariant mass dependence where resonance peaks can be identified | [['the', 'chiral', 'magnetic', 'effect', 'cme', 'refers', 'to', 'charge', 'separation', 'along', 'a', 'strong', 'magnetic', 'field', 'of', 'singlehanded', 'quarks', 'caused', 'by', 'interactions', 'with', 'topological', 'gluon', 'fields', 'from', 'qcd', 'vacuum', 'fluctuations', 'a', 'major', 'background', 'of', 'cme', 'measurements', 'in', 'heavyion', 'collisions', 'comes', 'from', 'resonance', 'decays', 'coupled', 'with', 'elliptical', 'flow', 'anisotropy', 'these', 'proceedings', 'present', 'two', 'new', 'studies', 'from', 'star', 'to', 'shed', 'further', 'light', 'on', 'the', 'background', 'issue', '1', 'small', 'system', 'pau', 'and', 'dau', 'collisions', 'where', 'the', 'cme', 'signal', 'is', 'not', 'expected', 'and', '2', 'pair', 'invariant', 'mass', 'dependence', 'where', 'resonance', 'peaks', 'can', 'be', 'identified']] | [-0.1354656811242669, 0.2855628294531595, -0.11068642479486615, 0.10566639810911677, -0.07990583799916996, -0.09563109815247696, -0.07006919856146189, 0.3233651291176846, -0.2074980999935757, -0.3197433945130218, -0.01874061840697488, -0.3486904268026013, -0.02539373612539335, 0.11341987164699029, 0.034832925175909295, 0.03838403779082, 0.0961275476464917, -0.004678932325491173, -0.016794650120904076, -0.16121304325431332, 0.34901809046806936, 0.035740061906505034, 0.235082650012125, 0.16614707358266143, 0.05847747110634704, 0.015877083893759514, -0.01442913322667168, 0.02135063896209679, -0.09419891739856791, -0.009088920687976166, 0.18850959134711462, 0.0035145471391098745, 0.1503504216750364, -0.4134466942738403, -0.16817851142365148, 0.07315750430147587, 0.18776358481210825, 0.1202745867273982, -0.1219346337721535, -0.33297373686218634, 0.06621575523802842, -0.1569484671503729, -0.11443059166909238, -0.009252641540528699, -0.016100626305243084, -0.00015130452811717987, -0.3239569760890762, 0.14841067887821488, 0.014471986864174885, 0.10634429706260562, -0.017310895851220597, -0.12293813347324348, -0.05886127008654347, 0.023848524248354475, 0.1530658529663924, 0.17331028908004306, 0.22628175316177393, -0.16784062880271283, -0.14622234548865395, 0.40294659944166517, -0.051211709968893876, -0.09168458620975302, 0.15820437712616034, -0.24797986482471143, -0.12437454612650485, 0.18597852854608474, 0.258525325641544, 0.050289224161216145, -0.1860413035981103, 0.020027893160162916, 0.03599462619009004, 0.184653153133695, 0.07315696055196565, 0.06177975649585609, 0.29475078462961724, 0.13178460302085362, 0.00396605996965346, 0.10081754833729727, -0.13096234475696375, -0.047177361620759424, -0.32770547888834367, -0.039547919179312885, -0.13761461784650403, 0.06010788670408312, -0.07690272751675696, -0.09760372420846992, 0.37199876942693, 0.14387242057339542, 0.2334059004920577, -0.13101848764133386, 0.2940222812731835, 0.08038265319324141, 0.05981066592291675, 0.09069680382857438, 0.3107537043476689, 0.23332707943998024, 0.18808965452163565, -0.2741306389719036, -0.008608462103769522, 0.03761602835518054] |
1,802.03284 | Mini-Batch Stochastic ADMMs for Nonconvex Nonsmooth Optimization | With the large rising of complex data, the nonconvex models such as nonconvex
loss function and nonconvex regularizer are widely used in machine learning and
pattern recognition. In this paper, we propose a class of mini-batch stochastic
ADMMs (alternating direction method of multipliers) for solving large-scale
nonconvex nonsmooth problems. We prove that, given an appropriate mini-batch
size, the mini-batch stochastic ADMM without variance reduction (VR) technique
is convergent and reaches a convergence rate of $O(1/T)$ to obtain a stationary
point of the nonconvex optimization, where $T$ denotes the number of
iterations. Moreover, we extend the mini-batch stochastic gradient method to
both the nonconvex SVRG-ADMM and SAGA-ADMM proposed in our initial manuscript
\cite{huang2016stochastic}, and prove these mini-batch stochastic ADMMs also
reaches the convergence rate of $O(1/T)$ without condition on the mini-batch
size. In particular, we provide a specific parameter selection for step size
$\eta$ of stochastic gradients and penalty parameter $\rho$ of augmented
Lagrangian function. Finally, extensive experimental results on both simulated
and real-world data demonstrate the effectiveness of the proposed algorithms.
| math.OC cs.LG stat.ML | with the large rising of complex data the nonconvex models such as nonconvex loss function and nonconvex regularizer are widely used in machine learning and pattern recognition in this paper we propose a class of minibatch stochastic admms alternating direction method of multipliers for solving largescale nonconvex nonsmooth problems we prove that given an appropriate minibatch size the minibatch stochastic admm without variance reduction vr technique is convergent and reaches a convergence rate of o1t to obtain a stationary point of the nonconvex optimization where t denotes the number of iterations moreover we extend the minibatch stochastic gradient method to both the nonconvex svrgadmm and sagaadmm proposed in our initial manuscript citehuang2016stochastic and prove these minibatch stochastic admms also reaches the convergence rate of o1t without condition on the minibatch size in particular we provide a specific parameter selection for step size eta of stochastic gradients and penalty parameter rho of augmented lagrangian function finally extensive experimental results on both simulated and realworld data demonstrate the effectiveness of the proposed algorithms | [['with', 'the', 'large', 'rising', 'of', 'complex', 'data', 'the', 'nonconvex', 'models', 'such', 'as', 'nonconvex', 'loss', 'function', 'and', 'nonconvex', 'regularizer', 'are', 'widely', 'used', 'in', 'machine', 'learning', 'and', 'pattern', 'recognition', 'in', 'this', 'paper', 'we', 'propose', 'a', 'class', 'of', 'minibatch', 'stochastic', 'admms', 'alternating', 'direction', 'method', 'of', 'multipliers', 'for', 'solving', 'largescale', 'nonconvex', 'nonsmooth', 'problems', 'we', 'prove', 'that', 'given', 'an', 'appropriate', 'minibatch', 'size', 'the', 'minibatch', 'stochastic', 'admm', 'without', 'variance', 'reduction', 'vr', 'technique', 'is', 'convergent', 'and', 'reaches', 'a', 'convergence', 'rate', 'of', 'o1t', 'to', 'obtain', 'a', 'stationary', 'point', 'of', 'the', 'nonconvex', 'optimization', 'where', 't', 'denotes', 'the', 'number', 'of', 'iterations', 'moreover', 'we', 'extend', 'the', 'minibatch', 'stochastic', 'gradient', 'method', 'to', 'both', 'the', 'nonconvex', 'svrgadmm', 'and', 'sagaadmm', 'proposed', 'in', 'our', 'initial', 'manuscript', 'citehuang2016stochastic', 'and', 'prove', 'these', 'minibatch', 'stochastic', 'admms', 'also', 'reaches', 'the', 'convergence', 'rate', 'of', 'o1t', 'without', 'condition', 'on', 'the', 'minibatch', 'size', 'in', 'particular', 'we', 'provide', 'a', 'specific', 'parameter', 'selection', 'for', 'step', 'size', 'eta', 'of', 'stochastic', 'gradients', 'and', 'penalty', 'parameter', 'rho', 'of', 'augmented', 'lagrangian', 'function', 'finally', 'extensive', 'experimental', 'results', 'on', 'both', 'simulated', 'and', 'realworld', 'data', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithms']] | [-0.0844486442769288, -0.02064125605136605, -0.059212437808822245, 0.0670245658474032, -0.07740402960124806, -0.15363183350318813, 0.050974192332508064, 0.4130364325525757, -0.34415927811487185, -0.2865168427354133, 0.11559668473882832, -0.22154876411880076, -0.15872228549815406, 0.19772750353192656, -0.12286513339943038, 0.15002298167873637, 0.1120250222105092, -0.008200471099850462, -0.11837102044456413, -0.3354786463197563, 0.25675424173083045, 0.003619529896542518, 0.28852111526583074, 0.03549804456928778, 0.16988317398960598, -0.0075795457218966545, 0.011554428434809505, 0.03244767415670667, -0.09192408376240575, 0.1092299584784275, 0.26170059560878445, 0.20861585446517672, 0.4109420547035892, -0.40375847967903644, -0.1669169598584168, 0.15480324833449968, 0.18048371185225534, 0.07913368279197028, -0.09661466534354189, -0.21483078435168068, 0.10773860712634874, -0.1200091433051778, -0.07513042214772934, -0.12636326674713627, -0.04968379957728176, 0.09136763880216688, -0.37552146193676095, 0.09284429671570035, 0.06631713195775564, 0.03233908871794946, -0.07633727524958595, -0.17232585458509272, 0.027882542641635037, 0.006159887310205656, 0.12286912005796985, 0.0766947835672801, 0.15742402772843486, -0.1184917281494757, -0.1013945424653722, 0.2955067707335896, -0.05401187310561527, -0.2435213060630761, 0.14910626226551169, -0.051059980620492315, -0.14296622302647702, 0.11925622974880613, 0.29423408488847713, 0.2302914199849161, -0.12463914282267263, 0.09705804502240178, -0.04308311168390971, 0.11903189302965607, 0.0185883932460386, -0.03898627835342429, 0.017084820291093556, 0.2083960704645538, 0.20153870689820433, 0.1886607958839107, -0.11791601578412941, -0.14514544064498688, -0.29887775614438855, -0.11660499784257813, -0.224143676338552, -0.017448924462581, -0.21160648634993767, -0.16297806323004457, 0.3691273318416268, 0.17157977228006416, 0.22122656161615833, 0.16087802043790825, 0.3137017503138301, 0.13809560574370727, 0.03712969016526225, 0.13383995749320857, 0.18338388321472102, 0.10644816458170142, 0.13989824056900904, -0.2807902313587008, 0.07922387230947074, 0.11189403830746399] |
1,802.03285 | On sequences covering all rainbow $k$-progressions | Let $\text{ac}(n,k)$ denote the smallest positive integer with the property
that there exists an $n$-colouring $f$ of $\{1,\dots,\text{ac}(n,k)\}$ such
that for every $k$-subset $R \subseteq \{1, \dots, n\}$ there exists an
(arithmetic) $k$-progression $A$ in $\{1,\dots,\text{ac}(n,k)\}$ with $\{f(a) :
a \in A\} = R$. Determining the behaviour of the function $\text{ac}(n,k)$ is a
previously unstudied problem. We use the first moment method to give an
asymptotic upper bound for $\text{ac}(n,k)$ for the case $k = o(n^{1/{5}})$.
| math.CO | let textacnk denote the smallest positive integer with the property that there exists an ncolouring f of 1dotstextacnk such that for every ksubset r subseteq 1 dots n there exists an arithmetic kprogression a in 1dotstextacnk with fa a in a r determining the behaviour of the function textacnk is a previously unstudied problem we use the first moment method to give an asymptotic upper bound for textacnk for the case k on15 | [['let', 'textacnk', 'denote', 'the', 'smallest', 'positive', 'integer', 'with', 'the', 'property', 'that', 'there', 'exists', 'an', 'ncolouring', 'f', 'of', '1dotstextacnk', 'such', 'that', 'for', 'every', 'ksubset', 'r', 'subseteq', '1', 'dots', 'n', 'there', 'exists', 'an', 'arithmetic', 'kprogression', 'a', 'in', '1dotstextacnk', 'with', 'fa', 'a', 'in', 'a', 'r', 'determining', 'the', 'behaviour', 'of', 'the', 'function', 'textacnk', 'is', 'a', 'previously', 'unstudied', 'problem', 'we', 'use', 'the', 'first', 'moment', 'method', 'to', 'give', 'an', 'asymptotic', 'upper', 'bound', 'for', 'textacnk', 'for', 'the', 'case', 'k', 'on15']] | [-0.21368987164527609, 0.08244572555459867, -0.06048469804691326, -0.002987095389339695, -0.007951803896846115, -0.16790840129597465, 0.03875162628347702, 0.31283642460956523, -0.27484579443715623, -0.2260280422380437, 0.05893471081525195, -0.323090313785318, -0.12704084842276853, 0.20826960079695866, -0.027274444071656984, -0.03043844506854826, -0.010595209658303234, 0.12740616936344598, -0.049649371772302664, -0.23060948563658673, 0.2702309347797131, -0.05176071409621964, 0.1270211981744438, 0.0710420171878692, 0.1108399802731161, -0.002026157548138197, 0.09384496490457568, 0.012229723936837652, -0.23227010944464238, 0.06230014328932579, 0.2618357862102921, 0.16665823710407468, 0.334632594678281, -0.3234867098909108, -0.10320824093819744, 0.25428958083300485, 0.1644743855138296, -0.03437087899141446, -0.07022456358780788, -0.1731218318556152, 0.19724051011355082, -0.11119250984241565, -0.1504271221279666, 0.005214477011906928, 0.19507167113108048, -0.038476254305113915, -0.3814542345918607, -0.025158366944262947, 0.1259597888034161, 0.09886787348195734, -0.022331896379752005, -0.1945894189664851, 0.03321753578611474, 0.09899260840662148, -0.02099365197405543, 0.12376747646645737, -0.023021898854125724, -0.07274123134793363, -0.11482373244581286, 0.33529703815778095, -0.10526632166643074, -0.22927588424172954, 0.07836914678995052, -0.15392828245471785, -0.15667457929204986, 0.10124329599025457, 0.07115076985750077, 0.1802363172983346, -0.026264311317219468, 0.22077283490638155, -0.1833119222327419, 0.18477273295107094, 0.055006911546207855, 0.001127379136564939, 0.13626784338291897, 0.11114314776183902, 0.15934370745621299, 0.16081340401770844, -0.037801036152286804, 0.0581252098393937, -0.3523136644988604, -0.16459441159099367, -0.23520397481279096, 0.13306036321581274, -0.14143154253859236, -0.21567703900939744, 0.28917130104441574, 0.08716114893204709, 0.20397110821922187, 0.12175930303561946, 0.2233118637147751, 0.1434362927802663, 0.007803953509183897, 0.15484911846536872, 0.0954954421174699, 0.13913781827896077, -0.041549007988710335, -0.20195473558471902, 0.07050735323581898, 0.12039936182723529] |
1,802.03286 | Explicit size distributions of failure cascades redefine systemic risk
on finite networks | How big is the risk that a few initial failures of nodes in a network amplify
to large cascades that span a substantial share of all nodes? Predicting the
final cascade size is critical to ensure the functioning of a system as a
whole. Yet, this task is hampered by uncertain or changing parameters and
missing information. In infinitely large networks, the average cascade size can
often be well estimated by established approaches building on local tree
approximations and mean field approximations. Yet, as we demonstrate, in finite
networks, this average does not even need to be a likely outcome. Instead, we
find broad and even bimodal cascade size distributions. This phenomenon
persists for system sizes up to $10^{7}$ and different cascade models, i.e. it
is relevant for most real systems. To show this, we derive explicit closed-form
solutions for the full probability distribution of the final cascade size. We
focus on two topological limit cases, the complete network representing a dense
network with a very narrow degree distribution, and the star network
representing a sparse network with a inhomogeneous degree distribution. Those
topologies are of great interest, as they either minimize or maximize the
average cascade size and are common motifs in many real world networks.
| physics.soc-ph math.ST q-fin.RM stat.TH | how big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes predicting the final cascade size is critical to ensure the functioning of a system as a whole yet this task is hampered by uncertain or changing parameters and missing information in infinitely large networks the average cascade size can often be well estimated by established approaches building on local tree approximations and mean field approximations yet as we demonstrate in finite networks this average does not even need to be a likely outcome instead we find broad and even bimodal cascade size distributions this phenomenon persists for system sizes up to 107 and different cascade models ie it is relevant for most real systems to show this we derive explicit closedform solutions for the full probability distribution of the final cascade size we focus on two topological limit cases the complete network representing a dense network with a very narrow degree distribution and the star network representing a sparse network with a inhomogeneous degree distribution those topologies are of great interest as they either minimize or maximize the average cascade size and are common motifs in many real world networks | [['how', 'big', 'is', 'the', 'risk', 'that', 'a', 'few', 'initial', 'failures', 'of', 'nodes', 'in', 'a', 'network', 'amplify', 'to', 'large', 'cascades', 'that', 'span', 'a', 'substantial', 'share', 'of', 'all', 'nodes', 'predicting', 'the', 'final', 'cascade', 'size', 'is', 'critical', 'to', 'ensure', 'the', 'functioning', 'of', 'a', 'system', 'as', 'a', 'whole', 'yet', 'this', 'task', 'is', 'hampered', 'by', 'uncertain', 'or', 'changing', 'parameters', 'and', 'missing', 'information', 'in', 'infinitely', 'large', 'networks', 'the', 'average', 'cascade', 'size', 'can', 'often', 'be', 'well', 'estimated', 'by', 'established', 'approaches', 'building', 'on', 'local', 'tree', 'approximations', 'and', 'mean', 'field', 'approximations', 'yet', 'as', 'we', 'demonstrate', 'in', 'finite', 'networks', 'this', 'average', 'does', 'not', 'even', 'need', 'to', 'be', 'a', 'likely', 'outcome', 'instead', 'we', 'find', 'broad', 'and', 'even', 'bimodal', 'cascade', 'size', 'distributions', 'this', 'phenomenon', 'persists', 'for', 'system', 'sizes', 'up', 'to', '107', 'and', 'different', 'cascade', 'models', 'ie', 'it', 'is', 'relevant', 'for', 'most', 'real', 'systems', 'to', 'show', 'this', 'we', 'derive', 'explicit', 'closedform', 'solutions', 'for', 'the', 'full', 'probability', 'distribution', 'of', 'the', 'final', 'cascade', 'size', 'we', 'focus', 'on', 'two', 'topological', 'limit', 'cases', 'the', 'complete', 'network', 'representing', 'a', 'dense', 'network', 'with', 'a', 'very', 'narrow', 'degree', 'distribution', 'and', 'the', 'star', 'network', 'representing', 'a', 'sparse', 'network', 'with', 'a', 'inhomogeneous', 'degree', 'distribution', 'those', 'topologies', 'are', 'of', 'great', 'interest', 'as', 'they', 'either', 'minimize', 'or', 'maximize', 'the', 'average', 'cascade', 'size', 'and', 'are', 'common', 'motifs', 'in', 'many', 'real', 'world', 'networks']] | [-0.13496649825207638, 0.11457185843590521, -0.03297391885797075, 0.11007503613802617, -0.039094504922772375, -0.12171923746309886, 0.048592549204322454, 0.39256418594901543, -0.26639916291089216, -0.32051693060961756, 0.11118530870723461, -0.2503389029172845, -0.1451354140240321, 0.1494069506722426, -0.05433685878226489, 0.06785619380638669, 0.10385315557086958, 0.05619427221118594, -0.01919422555177198, -0.23627469860746161, 0.3126258527385386, 0.052297178702682016, 0.3042344490340618, 0.02982297774847453, 0.08738551686117471, -0.02566626479462293, 0.0007798292652753312, 0.046298627434629855, -0.07552983335328708, 0.09091460404260723, 0.25531148564842415, 0.14881616945778905, 0.3124073263379219, -0.4053844958881213, -0.24866009893228755, 0.17472841891916785, 0.17520281480364322, 0.13204804204566323, 0.020346508917605713, -0.23938800311863315, 0.12285453318685725, -0.19629343708761707, -0.100640707536812, -0.059977438708020435, 0.03854234753106833, 0.052101345444862966, -0.2923603135449047, 0.043653392685118364, 0.041674511006061475, 0.04101411974890459, -0.011336708241164829, -0.10973518156752458, -0.025759632621581357, 0.1780155241727865, 0.017243634540461687, 0.005137634309934416, 0.13652891315354465, -0.1702660755122078, -0.08664038169854613, 0.3599332632465459, -0.02705184280352694, -0.20630498528884048, 0.20688064066875403, -0.13415609612264603, -0.13916544326927494, 0.15804409288580795, 0.2288488853370753, 0.09985310053632815, -0.13633088799922363, 0.017811668990067416, -0.0369937420318776, 0.18395661526463097, 0.03653780065908812, 0.04252794955222719, 0.2060062359874519, 0.20801635309412697, 0.07786469153777566, 0.1166785232698014, -0.06544175140046771, -0.11247517979942298, -0.2551678683842726, -0.09079481484278461, -0.2147312141524106, 0.07628674641515044, -0.1195764438973814, -0.19960217113530146, 0.38817408743004006, 0.14517723927881732, 0.26896725144633205, 0.0787856571841985, 0.29317695129176846, 0.09530697306809308, 0.08906299333371547, 0.1127899948050322, 0.19393540336223206, 0.07459635536803905, 0.07753418264955571, -0.13722417104408902, 0.13488761356644835, -0.01670824112775533] |
1,802.03287 | Resource Pooling in Large-Scale Content Delivery Systems | Content delivery networks are a key infrastructure component used by Video on
Demand (VoD) services to deliver content over the Internet. We study a content
delivery system consisting of a central server and multiple co-located caches,
each with limited storage and service capabilities. This work evaluates the
performance of such a system as a function of the storage capacity of the
caches, the content replication strategy, and the service policy. This analysis
can be used for a system-level optimization of these design choices.
The focus of this work is on understanding the benefits of allowing caches to
pool their resources to serve user requests. We show that the benefits of
resource pooling depend on the popularity profile of the contents offered by
the VoD service. More specifically, if the popularity does not vary drastically
across contents, resource pooling can lead to significant improvements in the
system performance. In contrast, if the content popularity is uneven, the
benefits of resource pooling are negligible.
| cs.IT math.IT | content delivery networks are a key infrastructure component used by video on demand vod services to deliver content over the internet we study a content delivery system consisting of a central server and multiple colocated caches each with limited storage and service capabilities this work evaluates the performance of such a system as a function of the storage capacity of the caches the content replication strategy and the service policy this analysis can be used for a systemlevel optimization of these design choices the focus of this work is on understanding the benefits of allowing caches to pool their resources to serve user requests we show that the benefits of resource pooling depend on the popularity profile of the contents offered by the vod service more specifically if the popularity does not vary drastically across contents resource pooling can lead to significant improvements in the system performance in contrast if the content popularity is uneven the benefits of resource pooling are negligible | [['content', 'delivery', 'networks', 'are', 'a', 'key', 'infrastructure', 'component', 'used', 'by', 'video', 'on', 'demand', 'vod', 'services', 'to', 'deliver', 'content', 'over', 'the', 'internet', 'we', 'study', 'a', 'content', 'delivery', 'system', 'consisting', 'of', 'a', 'central', 'server', 'and', 'multiple', 'colocated', 'caches', 'each', 'with', 'limited', 'storage', 'and', 'service', 'capabilities', 'this', 'work', 'evaluates', 'the', 'performance', 'of', 'such', 'a', 'system', 'as', 'a', 'function', 'of', 'the', 'storage', 'capacity', 'of', 'the', 'caches', 'the', 'content', 'replication', 'strategy', 'and', 'the', 'service', 'policy', 'this', 'analysis', 'can', 'be', 'used', 'for', 'a', 'systemlevel', 'optimization', 'of', 'these', 'design', 'choices', 'the', 'focus', 'of', 'this', 'work', 'is', 'on', 'understanding', 'the', 'benefits', 'of', 'allowing', 'caches', 'to', 'pool', 'their', 'resources', 'to', 'serve', 'user', 'requests', 'we', 'show', 'that', 'the', 'benefits', 'of', 'resource', 'pooling', 'depend', 'on', 'the', 'popularity', 'profile', 'of', 'the', 'contents', 'offered', 'by', 'the', 'vod', 'service', 'more', 'specifically', 'if', 'the', 'popularity', 'does', 'not', 'vary', 'drastically', 'across', 'contents', 'resource', 'pooling', 'can', 'lead', 'to', 'significant', 'improvements', 'in', 'the', 'system', 'performance', 'in', 'contrast', 'if', 'the', 'content', 'popularity', 'is', 'uneven', 'the', 'benefits', 'of', 'resource', 'pooling', 'are', 'negligible']] | [-0.18802089079493012, -0.005431109465900119, -0.065495594876048, -0.0039594453525223575, -0.08540012066419247, -0.1664147800018574, 0.1241747403005713, 0.41538619338592264, -0.27807230561868185, -0.3215570258103127, 0.08600474130592228, -0.2884491096095492, -0.10342518237913832, 0.13202411451744905, -0.17078781583817837, 0.03368527386452497, 0.06050021088765474, 0.04627467481057263, -0.029395590982555102, -0.35972319484147947, 0.28460288432104813, 0.10628100297770199, 0.41818731518485297, 0.09372898877632839, 0.015585165718760065, 0.003670403215729482, -0.06533891057170192, -0.029208017507407032, -0.054856493856614515, 0.177836560787932, 0.3196305602007074, 0.2617515935677529, 0.340713907096443, -0.4568866618483523, -0.222501808869434, 0.06412189150010639, 0.15616657143964627, 0.01713408653359906, -0.075668358584355, -0.24870355673893182, 0.10014645544306179, -0.2873452345346227, -0.02577427030759461, -0.043884532549131064, -0.028650365571525914, 0.09527918508055011, -0.27604305402398754, -0.03933425111995067, -0.0077099717670568715, 0.01756418152873255, -0.04269269014562101, -0.08258617980719003, -0.02599809465665416, 0.2223304392091562, 0.033541083700931916, -0.013495855092323948, 0.20396028028479146, -0.16805411618415633, -0.08404734820187851, 0.42925574139542416, -0.03966255025667955, -0.2026361247530368, 0.1624147220339373, -0.030697746472548186, -0.12799235243266907, 0.09944386592847698, 0.2736904473517544, 0.05524948903324979, -0.1887741803743497, 0.011894896234469028, -0.01376111445557556, 0.2287017424694366, 0.06537378045879765, 0.1235855408616502, 0.22326017493801767, 0.25553777252566817, 0.13039107400604902, 0.10824587350110466, -0.049821902470329756, -0.11125415031378513, -0.1812888317066676, -0.17613619492377763, -0.2024578208802268, -0.0028723305540215398, -0.10755597817523614, -0.08910833556710938, 0.3985310471142401, 0.16492258760227282, 0.12807844896846807, 0.0825933171046343, 0.38864917068937677, 0.05312848154004134, 0.148597162097612, 0.14198878039202595, 0.09454561399732843, -0.04647336854386707, 0.23821528327728933, -0.187778836219675, 0.15582331428074359, -0.037675020276327374] |
1,802.03288 | Convective Excitation of Inertial Modes in Binary Neutron Star Mergers | We present the first very long-term simulations (extending up to ~140 ms
after merger) of binary neutron star mergers with piecewise polytropic
equations of state and in full general relativity. Our simulations reveal that
at a time of 30-50 ms after merger, parts of the star become convectively
unstable, which triggers the excitation of inertial modes. The excited inertial
modes are sustained up to several tens of milliseconds and are potentially
observable by the planned third-generation gravitational-wave detectors at
frequencies of a few kilohertz. Since inertial modes depend on the rotation
rate of the star and they are triggered by a convective instability in the
postmerger remnant, their detection in gravitational waves will provide a
unique opportunity to probe the rotational and thermal state of the merger
remnant. In addition, our findings have implications for the long-term
evolution and stability of binary neutron star remnants
| gr-qc astro-ph.HE | we present the first very longterm simulations extending up to 140 ms after merger of binary neutron star mergers with piecewise polytropic equations of state and in full general relativity our simulations reveal that at a time of 3050 ms after merger parts of the star become convectively unstable which triggers the excitation of inertial modes the excited inertial modes are sustained up to several tens of milliseconds and are potentially observable by the planned thirdgeneration gravitationalwave detectors at frequencies of a few kilohertz since inertial modes depend on the rotation rate of the star and they are triggered by a convective instability in the postmerger remnant their detection in gravitational waves will provide a unique opportunity to probe the rotational and thermal state of the merger remnant in addition our findings have implications for the longterm evolution and stability of binary neutron star remnants | [['we', 'present', 'the', 'first', 'very', 'longterm', 'simulations', 'extending', 'up', 'to', '140', 'ms', 'after', 'merger', 'of', 'binary', 'neutron', 'star', 'mergers', 'with', 'piecewise', 'polytropic', 'equations', 'of', 'state', 'and', 'in', 'full', 'general', 'relativity', 'our', 'simulations', 'reveal', 'that', 'at', 'a', 'time', 'of', '3050', 'ms', 'after', 'merger', 'parts', 'of', 'the', 'star', 'become', 'convectively', 'unstable', 'which', 'triggers', 'the', 'excitation', 'of', 'inertial', 'modes', 'the', 'excited', 'inertial', 'modes', 'are', 'sustained', 'up', 'to', 'several', 'tens', 'of', 'milliseconds', 'and', 'are', 'potentially', 'observable', 'by', 'the', 'planned', 'thirdgeneration', 'gravitationalwave', 'detectors', 'at', 'frequencies', 'of', 'a', 'few', 'kilohertz', 'since', 'inertial', 'modes', 'depend', 'on', 'the', 'rotation', 'rate', 'of', 'the', 'star', 'and', 'they', 'are', 'triggered', 'by', 'a', 'convective', 'instability', 'in', 'the', 'postmerger', 'remnant', 'their', 'detection', 'in', 'gravitational', 'waves', 'will', 'provide', 'a', 'unique', 'opportunity', 'to', 'probe', 'the', 'rotational', 'and', 'thermal', 'state', 'of', 'the', 'merger', 'remnant', 'in', 'addition', 'our', 'findings', 'have', 'implications', 'for', 'the', 'longterm', 'evolution', 'and', 'stability', 'of', 'binary', 'neutron', 'star', 'remnants']] | [-0.14726213343634173, 0.21921382723055008, -0.07429277320103399, 0.05892892795261638, -0.08466116184818334, -0.027253212053971045, 0.03307886370778854, 0.34400802371895006, -0.20589925268151124, -0.30283250743202095, 0.11614853133375211, -0.2569612532083331, -0.024688500994495276, 0.24612685189229147, 0.05060875589702407, 0.022723297652756345, 0.15544443478133402, 0.01904437383656904, -0.07427570645713472, -0.21539843619318383, 0.30538818789324884, 0.11643643698430267, 0.1499642260501097, -0.02759186536443002, 0.09740286347424162, -0.10791997330038455, -0.04589256636541465, -0.08252292037218938, -0.13630795865665904, -0.02110224016058933, 0.25390902603655285, 0.12319525223353814, 0.24807169674092838, -0.4602541177437223, -0.2205020856176471, 0.02652239559924808, 0.15715794589145687, 0.12405479015654017, -0.08154826777172275, -0.3024359051314793, 0.09290842008295244, -0.26053320505688415, -0.15212048091765107, -0.0064827872697135495, 0.06424822389822582, 0.061018809605919724, -0.21876737985535172, 0.13992428672018237, 0.0700609691890663, -0.002646052875909312, -0.12892434706606357, -0.02949591382278194, -0.04956010342093891, 0.07305586899887642, 0.08719183718303924, 0.04022625339024796, 0.1612641475388202, -0.11977901391941925, -0.08003493784123968, 0.4012686632605719, -0.07585609887630261, -0.06916754472165786, 0.2368613493018623, -0.232881005744225, -0.12904261205875284, 0.1905960757413815, 0.19746774161427186, 0.1556760182796881, -0.09481356511020969, -0.07200660436004722, 0.06783581489761328, 0.18375765702462402, 0.13245574404517638, 0.06966075671009783, 0.37987895442879405, 0.20075852446386527, -1.328246234434432e-05, 0.08904908926402828, -0.18264298693212713, -0.05542292469341693, -0.26870702026925725, -0.06664171879468807, -0.10675565056695506, 0.07265954031769571, -0.09957419506320328, -0.10081449918898529, 0.4076553897097193, 0.0954615276049951, 0.1306934642075593, 0.026161373808482213, 0.27072395606544514, 0.05813718815414428, 0.05994927893585429, 0.09653437362084615, 0.38397220423573564, 0.184363819376148, 0.10326411560948552, -0.28357536738160355, 0.038357227311694414, -0.011094597856321468] |
1,802.03289 | Sharpness for Inhomogeneous Percolation on Quasi-Transitive Graphs | In this note we study the phase transition for percolation on
quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention
probabilities. A quasi-transitive graph is an infinite graph with finitely many
different "types" of edges and vertices. We prove that the transition is sharp
almost everywhere, i.e., that in the subcritical regime the expected cluster
size is finite, and that in the subcritical regime the probability of the
one-arm event decays exponentially. Our proof extends the proof of sharpness of
the phase transition for homogeneous percolation on vertex-transitive graphs by
Duminil-Copin and Tassion [Comm. Math. Phys., 2016], and the result generalizes
previous results of Antunovi\'c and Veseli\'c [J. Stat. Phys., 2008] and
Menshikov [Dokl. Akad. Nauk 1986].
| math.PR | in this note we study the phase transition for percolation on quasitransitive graphs with quasitransitively inhomogeneous edgeretention probabilities a quasitransitive graph is an infinite graph with finitely many different types of edges and vertices we prove that the transition is sharp almost everywhere ie that in the subcritical regime the expected cluster size is finite and that in the subcritical regime the probability of the onearm event decays exponentially our proof extends the proof of sharpness of the phase transition for homogeneous percolation on vertextransitive graphs by duminilcopin and tassion comm math phys 2016 and the result generalizes previous results of antunovic and veselic j stat phys 2008 and menshikov dokl akad nauk 1986 | [['in', 'this', 'note', 'we', 'study', 'the', 'phase', 'transition', 'for', 'percolation', 'on', 'quasitransitive', 'graphs', 'with', 'quasitransitively', 'inhomogeneous', 'edgeretention', 'probabilities', 'a', 'quasitransitive', 'graph', 'is', 'an', 'infinite', 'graph', 'with', 'finitely', 'many', 'different', 'types', 'of', 'edges', 'and', 'vertices', 'we', 'prove', 'that', 'the', 'transition', 'is', 'sharp', 'almost', 'everywhere', 'ie', 'that', 'in', 'the', 'subcritical', 'regime', 'the', 'expected', 'cluster', 'size', 'is', 'finite', 'and', 'that', 'in', 'the', 'subcritical', 'regime', 'the', 'probability', 'of', 'the', 'onearm', 'event', 'decays', 'exponentially', 'our', 'proof', 'extends', 'the', 'proof', 'of', 'sharpness', 'of', 'the', 'phase', 'transition', 'for', 'homogeneous', 'percolation', 'on', 'vertextransitive', 'graphs', 'by', 'duminilcopin', 'and', 'tassion', 'comm', 'math', 'phys', '2016', 'and', 'the', 'result', 'generalizes', 'previous', 'results', 'of', 'antunovic', 'and', 'veselic', 'j', 'stat', 'phys', '2008', 'and', 'menshikov', 'dokl', 'akad', 'nauk', '1986']] | [-0.10391781737520692, 0.1575108086868308, -0.044873859375781776, -0.01985491906296894, -0.0450042710456598, -0.09755129381665029, 0.06635778092666962, 0.3260240373243245, -0.16997400751487085, -0.2600171688411917, 0.0771505105824742, -0.3251815444091335, -0.1750651027791069, 0.1378735812031664, -0.12058988237549784, 0.030870971124386415, 0.05835159647644365, -0.003511124207372112, 0.0137291050528542, -0.26967337126812446, 0.28382235144921913, 0.0010896513454749116, 0.2665603451098702, 0.11100438111628007, 0.03248500477846911, 0.05436219187806403, -0.002413915640707793, 0.004952139021562678, -0.272998160523522, 0.007224181212482758, 0.23986830121637986, 0.04416411640912494, 0.21864228338069683, -0.3199337451244771, -0.17430637090832793, 0.16805813478796544, 0.09583088525271576, 0.05663829436915486, 0.026008192661850314, -0.3640562093205517, 0.08917111686449582, -0.14555633219840405, -0.10546463118017917, 0.01550829507842926, 0.14420150529726275, 0.042365546643850394, -0.29797449825231787, 0.13833287621881546, 0.2019281399303249, 0.04864792971056886, 0.023459133305420567, -0.11595534420380968, -0.025017397226682597, 0.03951774188733127, -0.04554806171342664, 0.09302813370907513, 0.031319479923695326, -0.04673558954008123, -0.18055517865494558, 0.2859464442423944, -0.018479850492440164, -0.05523783012540662, 0.2021110528439749, -0.16428413586358406, -0.20155126902994067, 0.13102627063822833, 0.12047475946227289, 0.1422404582470855, -0.07052584413239467, 0.19045857498609362, -0.10887889070935282, 0.10648285050410777, 0.14430006593881575, -0.06546585036890715, 0.04920019571935492, 0.13077647908877615, 0.08298099833388863, 0.14205450815123705, -0.01152648386362541, -0.10680928161101681, -0.30234813548824085, -0.13834012259446485, -0.22964357796757082, 0.09542883513911095, -0.12798092900655839, -0.1975417841957616, 0.36361420341251816, 0.11116130049673043, 0.18845445465662383, 0.11293600261394333, 0.13176738455409318, 0.08586701351721006, -0.06599630789215942, 0.1892083256555322, 0.20967063114429557, 0.21673779026813073, 0.10181175721975576, -0.13418256581644528, 0.0450334076179258, 0.16722498769481067] |
1,802.0329 | $f(R)$ quantum cosmology: avoiding the Big Rip | Extended theories of gravity have gathered a lot of attention over the last
years, for they not only provide an excellent framework to describe the
inflationary era but also yields an alternative to the elusive and mysterious
dark energy. Among the different extended theories of gravity, on this work we
focus on metric $f(R)$ theories. In addition, it is well known that if the
late-time acceleration of the universe is stronger than the one induced by a
cosmological constant then some future cosmic singularities might arise, being
the Big Rip the most virulent one. Following this reasoning, on this work, we
analyse the Big Rip singularity in the framework of $f(R)$ quantum
geometrodynamics. Invoking the DeWitt criterium, i. e. that the wave function
vanishes at the classical singularity, we proof that a class of solutions to
the Wheeler-DeWitt equation fulfilling this condition can be found. Therefore,
this result hints towards the avoidance of the Big Rip in metric $f(R)$
theories of gravity.
| gr-qc | extended theories of gravity have gathered a lot of attention over the last years for they not only provide an excellent framework to describe the inflationary era but also yields an alternative to the elusive and mysterious dark energy among the different extended theories of gravity on this work we focus on metric fr theories in addition it is well known that if the latetime acceleration of the universe is stronger than the one induced by a cosmological constant then some future cosmic singularities might arise being the big rip the most virulent one following this reasoning on this work we analyse the big rip singularity in the framework of fr quantum geometrodynamics invoking the dewitt criterium i e that the wave function vanishes at the classical singularity we proof that a class of solutions to the wheelerdewitt equation fulfilling this condition can be found therefore this result hints towards the avoidance of the big rip in metric fr theories of gravity | [['extended', 'theories', 'of', 'gravity', 'have', 'gathered', 'a', 'lot', 'of', 'attention', 'over', 'the', 'last', 'years', 'for', 'they', 'not', 'only', 'provide', 'an', 'excellent', 'framework', 'to', 'describe', 'the', 'inflationary', 'era', 'but', 'also', 'yields', 'an', 'alternative', 'to', 'the', 'elusive', 'and', 'mysterious', 'dark', 'energy', 'among', 'the', 'different', 'extended', 'theories', 'of', 'gravity', 'on', 'this', 'work', 'we', 'focus', 'on', 'metric', 'fr', 'theories', 'in', 'addition', 'it', 'is', 'well', 'known', 'that', 'if', 'the', 'latetime', 'acceleration', 'of', 'the', 'universe', 'is', 'stronger', 'than', 'the', 'one', 'induced', 'by', 'a', 'cosmological', 'constant', 'then', 'some', 'future', 'cosmic', 'singularities', 'might', 'arise', 'being', 'the', 'big', 'rip', 'the', 'most', 'virulent', 'one', 'following', 'this', 'reasoning', 'on', 'this', 'work', 'we', 'analyse', 'the', 'big', 'rip', 'singularity', 'in', 'the', 'framework', 'of', 'fr', 'quantum', 'geometrodynamics', 'invoking', 'the', 'dewitt', 'criterium', 'i', 'e', 'that', 'the', 'wave', 'function', 'vanishes', 'at', 'the', 'classical', 'singularity', 'we', 'proof', 'that', 'a', 'class', 'of', 'solutions', 'to', 'the', 'wheelerdewitt', 'equation', 'fulfilling', 'this', 'condition', 'can', 'be', 'found', 'therefore', 'this', 'result', 'hints', 'towards', 'the', 'avoidance', 'of', 'the', 'big', 'rip', 'in', 'metric', 'fr', 'theories', 'of', 'gravity']] | [-0.1404075988691967, 0.06765583057382667, -0.15316493032689862, 0.12924551065036752, -0.12122678909059843, -0.1807410409472837, -0.05545634789720039, 0.29995771453221454, -0.23896292604313427, -0.2573596723061515, 0.0813562919035048, -0.23899659921593366, -0.14898467545662028, 0.15536872646052757, -0.07629638164333885, 0.003833696039905197, 0.0229789345276565, 0.06200503587114113, -0.08120404411161916, -0.29456523345369434, 0.36785699591690235, 0.10860960061567042, 0.22563600871872938, 0.03776530387673389, 0.06738028106463637, -0.05982094621257052, 0.006125570383759354, 0.03594047954323253, -0.19390504693886068, 0.08101322959079464, 0.21709834030587916, 0.19045160771175115, 0.28039446817049873, -0.43949531695954963, -0.2712877878838759, 0.16380447556083608, 0.15714587947859623, 0.15491186191879766, -0.07322641791140569, -0.297059860960063, 0.08742810801615836, -0.16962963714620766, -0.1402531048932607, -0.02286008908054044, 0.019588004806320423, -0.08645241029767527, -0.16404307873080265, 0.06142370205463836, 0.06273087006375584, -0.017682936665225475, -0.06401388590471291, -0.05224865707741291, 0.052104059175622684, 0.03664122118591619, 0.12003181929079194, 0.058938707015189676, 0.08050008410771872, -0.16257657782594317, -0.07838532784781246, 0.4074979159452113, -0.06844484030865894, -0.13795315454150608, 0.16298228328656636, -0.15202974697666954, -0.20096145097287027, 0.050598100803643006, 0.07841421851965909, 0.13055097578340613, -0.12337855082493919, 0.1666455423501809, 0.012679466739405424, 0.10946618554104741, 0.12208781021583917, 0.0541877136134577, 0.26763995321479017, 0.12266445682487553, 0.05751931823266923, 0.045560983957487075, -0.011222100727918363, -0.09477536358445147, -0.3726162020760922, -0.1811541376741787, -0.1403471662412846, 0.0885052724851347, -0.1327643746733457, -0.16974697213757922, 0.3659577011820619, 0.149005281760136, 0.16864311554376468, 0.05230838884197084, 0.2597164651034055, 0.09269378388323533, 0.0577079040001227, 0.05615366330186342, 0.3095050629289076, 0.08996008379948268, 0.13306570518186983, -0.19132215636322436, 0.025710871874320286, 0.06481660681742209] |
1,802.03291 | Binding quantum matter and space-time, without romanticism | Understanding the emergence of a tangible 4-dimensional space-time from a
quantum theory of gravity promises to be a tremendously difficult task. This
article makes the case that this task may not have to be carried. Space-time as
we know it may be fundamental to begin with. I recall the common arguments
against this possibility and review a class of recently discovered models
bypassing the most serious objection. The generic solution of the measurement
problem that is tied to semiclassical gravity as well as the difficulty of the
alternative make it a reasonable default option in the absence of decisive
experimental evidence.
| physics.hist-ph gr-qc quant-ph | understanding the emergence of a tangible 4dimensional spacetime from a quantum theory of gravity promises to be a tremendously difficult task this article makes the case that this task may not have to be carried spacetime as we know it may be fundamental to begin with i recall the common arguments against this possibility and review a class of recently discovered models bypassing the most serious objection the generic solution of the measurement problem that is tied to semiclassical gravity as well as the difficulty of the alternative make it a reasonable default option in the absence of decisive experimental evidence | [['understanding', 'the', 'emergence', 'of', 'a', 'tangible', '4dimensional', 'spacetime', 'from', 'a', 'quantum', 'theory', 'of', 'gravity', 'promises', 'to', 'be', 'a', 'tremendously', 'difficult', 'task', 'this', 'article', 'makes', 'the', 'case', 'that', 'this', 'task', 'may', 'not', 'have', 'to', 'be', 'carried', 'spacetime', 'as', 'we', 'know', 'it', 'may', 'be', 'fundamental', 'to', 'begin', 'with', 'i', 'recall', 'the', 'common', 'arguments', 'against', 'this', 'possibility', 'and', 'review', 'a', 'class', 'of', 'recently', 'discovered', 'models', 'bypassing', 'the', 'most', 'serious', 'objection', 'the', 'generic', 'solution', 'of', 'the', 'measurement', 'problem', 'that', 'is', 'tied', 'to', 'semiclassical', 'gravity', 'as', 'well', 'as', 'the', 'difficulty', 'of', 'the', 'alternative', 'make', 'it', 'a', 'reasonable', 'default', 'option', 'in', 'the', 'absence', 'of', 'decisive', 'experimental', 'evidence']] | [-0.09169323226012806, 0.05951271553772806, -0.11887098215335962, 0.10086659548370776, -0.14127780926773453, -0.17202259846824672, 0.052015969964288325, 0.3237961965087469, -0.24547145780899773, -0.31671095851550596, 0.1230539974104152, -0.23017232554807965, -0.19996850074517844, 0.19359229114091042, -0.1190259536765147, 0.049837189197475734, 0.06598409304008035, 0.043425523961829665, -0.047169598935190404, -0.23089052035962002, 0.3227400838023992, 0.11265419829420119, 0.27284369309718653, 0.07257272583423274, 0.0618966806052935, -0.03322811779510783, -0.03271554106625148, 0.03981377373421841, -0.09377919808148273, 0.11498157923354187, 0.2793482905454397, 0.14664343957060783, 0.3190470376042741, -0.42972540230222855, -0.2375559328068601, 0.11637790034534318, 0.13392108530359398, 0.1800861035031036, -0.052030679041353785, -0.2707491656004608, 0.066788581181502, -0.20252470537503758, -0.17911460464543635, -0.09156374016426283, 0.015045626416322913, -0.10480782428369073, -0.18503262411968985, 0.046337550976267544, 0.08020066369975004, 0.004338253579923127, -0.022500670606634663, -0.061246944562587335, 0.03760587394993642, 0.11828590281731864, 0.11253121732918564, 0.06939225331626574, 0.07143003450208667, -0.1462370967515514, -0.13522829865059344, 0.44314101467480754, -0.03695221758726523, -0.20362974643144793, 0.20268425942020546, -0.10965284467259846, -0.16131428266312964, 0.07027554375207107, 0.10734107109976213, 0.133918910218163, -0.14881511383902024, 0.06485787042276012, -0.041273466173079934, 0.14388676066790698, 0.02935693273320794, 0.06386503848330219, 0.29490226765375327, 0.18260144268964776, 0.02905367261564156, 0.09174821840364043, -0.03939443371272507, -0.11106915490720237, -0.33133305998353085, -0.1975945776373397, -0.16459933685433895, 0.11954313318609919, -0.04544554984569895, -0.15641970095215457, 0.34374884570635267, 0.22653737374913352, 0.15708021694646762, 0.008145507858457541, 0.28096527440270574, 0.09583802123918281, 0.07237018262137576, 0.0144252782943428, 0.2760735003849362, 0.08732541689953517, 0.10638121475862099, -0.17389502047358246, 0.0922079976500556, 0.014336926650514108] |
1,802.03292 | Mathematical Logic in Computer Science | The article retraces major events and milestones in the mutual influences
between mathematical logic and computer science since the 1950s.
| cs.LO | the article retraces major events and milestones in the mutual influences between mathematical logic and computer science since the 1950s | [['the', 'article', 'retraces', 'major', 'events', 'and', 'milestones', 'in', 'the', 'mutual', 'influences', 'between', 'mathematical', 'logic', 'and', 'computer', 'science', 'since', 'the', '1950s']] | [-0.06354878353886306, 0.09339901637285948, -0.07042787327663973, 0.06988616231828929, -0.09805424246005714, -0.05950523819774389, 0.013261417852481827, 0.2705033267382532, -0.3112066389992833, -0.38370027765631676, 0.08056120576220564, -0.31261132115032525, -0.2559354407712817, 0.20776950865983962, -0.15794065743684768, 0.03590165935456753, 0.09254717535804957, 0.01213227198459208, -0.03905924363061786, -0.28198569947853686, 0.22743393970886244, 0.12587833774741738, 0.3173543829470873, 0.09014849960803986, 0.11088735722005368, 0.09636164845433086, -0.09804259873926639, -0.05030811503529549, -0.16948881316930056, 0.10286551000317559, 0.3717385443858802, 0.2399334017187357, 0.3813187310472131, -0.5317570134997368, -0.10893834168091417, 0.09700710419565439, 0.060618136823177335, 0.053202022612094876, -0.0020260545192286373, -0.29069520817138256, -0.07979206256568432, -0.14220215603709221, 0.0032368024811148645, 0.08192642806097865, 0.19039974510669708, 0.006264307722449303, -0.09120941476430744, 0.033763641002587975, 0.11577380807138979, 0.1802625022828579, 0.07928584180772305, -0.10512500270269812, 0.003596184914931655, 0.20804711100645362, 0.07197117418982088, 0.01781912591541186, 0.10844523763516918, -0.16807321840897202, -0.22385493235196918, 0.32999554350972177, 0.06845412189140916, -0.0315383649431169, 0.21288360729813577, -0.1533544695004821, -0.17838159492239355, -0.005120480246841907, 0.1833501162007451, -0.006877409294247627, -0.18157221684232355, 0.07326093501760625, 0.1021524865180254, 0.13815734554082154, 0.14475935478694738, 0.03347343383356929, 0.31179735716432333, 0.17638953793793916, -0.044269208004698156, 0.08677937556058168, -0.04536958271637559, -0.22486958275549113, -0.299150325730443, -0.21675102049484848, -0.16217467967653648, -0.05809518415480852, 0.04274834185052896, -0.09167316081002355, 0.39205701630562545, 0.19225673004984856, 0.023891862490563652, -0.053104180563241246, 0.26724731307476757, 0.030456422083079814, 0.023388630151748656, 0.029151460342109203, 0.28265721099451185, 0.20758549831807613, 0.2336586695164442, -0.15046094912104307, 0.1637212377972901, 0.037096403876785186] |
1,802.03293 | Gravitational lensing by magnetized compact object in the presence of
plasma | We study the gravitational lensing in the weak field approximation assuming
the presence of a plasma and of a magnetic field around a compact gravitational
source. The external magnetic field causes the split of the image, as the
counterpart of the Zeeman effect. The magnetic field affects the magnification
of images, creating additional components. We also study the time delay of an
electromagnetic signal due to the geometry and the gravitational field around
the source. We show that the time delay strongly depends on the plasma
parameters. Lastly, we consider the effects of the presence of an inhomogeneous
plasma on the gravitational lensing.
| gr-qc | we study the gravitational lensing in the weak field approximation assuming the presence of a plasma and of a magnetic field around a compact gravitational source the external magnetic field causes the split of the image as the counterpart of the zeeman effect the magnetic field affects the magnification of images creating additional components we also study the time delay of an electromagnetic signal due to the geometry and the gravitational field around the source we show that the time delay strongly depends on the plasma parameters lastly we consider the effects of the presence of an inhomogeneous plasma on the gravitational lensing | [['we', 'study', 'the', 'gravitational', 'lensing', 'in', 'the', 'weak', 'field', 'approximation', 'assuming', 'the', 'presence', 'of', 'a', 'plasma', 'and', 'of', 'a', 'magnetic', 'field', 'around', 'a', 'compact', 'gravitational', 'source', 'the', 'external', 'magnetic', 'field', 'causes', 'the', 'split', 'of', 'the', 'image', 'as', 'the', 'counterpart', 'of', 'the', 'zeeman', 'effect', 'the', 'magnetic', 'field', 'affects', 'the', 'magnification', 'of', 'images', 'creating', 'additional', 'components', 'we', 'also', 'study', 'the', 'time', 'delay', 'of', 'an', 'electromagnetic', 'signal', 'due', 'to', 'the', 'geometry', 'and', 'the', 'gravitational', 'field', 'around', 'the', 'source', 'we', 'show', 'that', 'the', 'time', 'delay', 'strongly', 'depends', 'on', 'the', 'plasma', 'parameters', 'lastly', 'we', 'consider', 'the', 'effects', 'of', 'the', 'presence', 'of', 'an', 'inhomogeneous', 'plasma', 'on', 'the', 'gravitational', 'lensing']] | [-0.22992203920600413, 0.10462493155839925, -0.048107469418239825, 0.06811103732234718, -0.07409086635390531, 0.0006175035818760256, -0.017540373739976328, 0.3579287088828758, -0.2514533316626132, -0.317132358077588, 0.058426910133137215, -0.22727654830923358, -0.11471849955726886, 0.2033907784854324, 0.029061758411523787, -0.04825046509323479, 0.00733554506113807, 0.06757050230014093, -0.06149215177741372, -0.20369150360946733, 0.3940864951503508, 0.10527189162749688, 0.23131507175784666, 0.07036615534712679, 0.10105233795000511, 0.03248689502242555, -0.04628561077259698, 0.07833927505857592, -0.07057127813989177, 0.024280748248678968, 0.08708261401229764, 0.07538736702024358, 0.24205134112333643, -0.43987767246452353, -0.2283726213906792, 0.10209713299369928, 0.09047482301056095, 0.16128760586194332, -0.08663992646480323, -0.3358199477322327, 0.02694136537475855, -0.10675780212470484, -0.140003661426164, 0.03205187477677771, 0.01085029343296819, 0.05822613538080121, -0.2699792668566976, 0.0876663446997731, 0.07106235905016944, 0.02896617019313921, -0.12976497931640993, -0.007413364313904522, 0.009195161223845574, 0.08699262959123091, 0.1058026738950838, 0.09498075482625405, 0.19704389707773057, -0.221141723798389, -0.05071441862207738, 0.39237354995990265, -0.14600734828600606, -0.14677974323570295, 0.1555518175574761, -0.2022160960234774, -0.09692821542289361, 0.15018610183818681, 0.2131168579827379, 0.10251626487170319, -0.11618892009849253, 0.09652683362749052, 0.0024295167599632903, 0.19300614396286495, 0.0658393681854082, 0.06475957113688866, 0.2915066220047115, 0.11588110857602499, 0.05188758129380289, 0.18953863192729434, -0.21038762220063978, 0.005768976526931651, -0.3102786927981284, -0.12491414404826835, -0.14621720853198356, 0.05863783566407787, -0.1278532356758731, -0.2151770886413536, 0.4322156267900707, 0.1867415557063899, 0.12964680967219536, -0.02795400647265674, 0.3350668957872877, 0.15567890089118255, 0.039399471676465375, 0.0657408001552363, 0.33114971443829894, 0.20186066278934622, 0.10459027049421034, -0.31717278405083615, -0.0010561954266237981, -0.010999759937211582] |
1,802.03294 | A fast speed planning algorithm for robotic manipulators | We consider the speed planning problem for a robotic manipulator. In
particular, we present an algorithm for finding the time-optimal speed law
along an assigned path that satisfies velocity and acceleration constraints and
respects the maximum forces and torques allowed by the actuators. The addressed
optimization problem is a finite dimensional reformulation of the
continuous-time speed optimization problem, obtained by discretizing the speed
profile with N points. The proposed algorithm has linear complexity with
respect to N and to the number of degrees of freedom. Such complexity is the
best possible for this problem. Numerical tests show that the proposed
algorithm is significantly faster than algorithms already existing in
literature.
| cs.RO math.OC | we consider the speed planning problem for a robotic manipulator in particular we present an algorithm for finding the timeoptimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the maximum forces and torques allowed by the actuators the addressed optimization problem is a finite dimensional reformulation of the continuoustime speed optimization problem obtained by discretizing the speed profile with n points the proposed algorithm has linear complexity with respect to n and to the number of degrees of freedom such complexity is the best possible for this problem numerical tests show that the proposed algorithm is significantly faster than algorithms already existing in literature | [['we', 'consider', 'the', 'speed', 'planning', 'problem', 'for', 'a', 'robotic', 'manipulator', 'in', 'particular', 'we', 'present', 'an', 'algorithm', 'for', 'finding', 'the', 'timeoptimal', 'speed', 'law', 'along', 'an', 'assigned', 'path', 'that', 'satisfies', 'velocity', 'and', 'acceleration', 'constraints', 'and', 'respects', 'the', 'maximum', 'forces', 'and', 'torques', 'allowed', 'by', 'the', 'actuators', 'the', 'addressed', 'optimization', 'problem', 'is', 'a', 'finite', 'dimensional', 'reformulation', 'of', 'the', 'continuoustime', 'speed', 'optimization', 'problem', 'obtained', 'by', 'discretizing', 'the', 'speed', 'profile', 'with', 'n', 'points', 'the', 'proposed', 'algorithm', 'has', 'linear', 'complexity', 'with', 'respect', 'to', 'n', 'and', 'to', 'the', 'number', 'of', 'degrees', 'of', 'freedom', 'such', 'complexity', 'is', 'the', 'best', 'possible', 'for', 'this', 'problem', 'numerical', 'tests', 'show', 'that', 'the', 'proposed', 'algorithm', 'is', 'significantly', 'faster', 'than', 'algorithms', 'already', 'existing', 'in', 'literature']] | [-0.15053878684782168, 0.05369381998819087, -0.04769772388125685, -0.032858634572899476, -0.10462129320949316, -0.1543817906894467, 0.04333340707658367, 0.3848084359239279, -0.3001232643442398, -0.34377684206966397, 0.08483353934293104, -0.2284203980456699, -0.14080050318840553, 0.2308332808315754, -0.10223424955779178, 0.13754912493750454, 0.07676751762628556, 0.046413928490470754, -0.04957119119724005, -0.269784706430933, 0.21889901934614914, 0.05141396616500887, 0.25380825544284147, 0.0012082725996151566, 0.18495959281413393, 0.024862597751515832, 0.026398820518939332, 0.08161112623797222, -0.13946634496797658, 0.09264400709335777, 0.2229335579174486, 0.18397481586983883, 0.2941453171724623, -0.41444830617613415, -0.21067570007660172, 0.11185540441762318, 0.14849139267726885, 0.09317689527418803, -0.03613266373815184, -0.24447654512795536, 0.06341836873907596, -0.11294011779298836, -0.16065589803355662, -0.024325708570805463, 0.02583070520565591, -0.0037968864029442723, -0.28336676721545784, 0.035445627151057126, 0.029929193752733143, 0.02424787509847771, -0.05676135583780706, -0.11764239607886835, 0.03412726037204265, 0.0721330870620229, 0.07492442861178213, 0.04903319293040444, 0.08832493317313492, -0.12555515302896805, -0.17198985288427635, 0.41066509397192436, -0.002435737157330467, -0.24428617796564306, 0.1544717765074562, -0.05543477282944051, -0.12414244534659453, 0.14428588118065488, 0.18383691912008956, 0.15980727948302625, -0.118975446540439, 0.11248959298033945, -0.03820418209599501, 0.1715627742846581, 0.04562453652139414, -0.02250762224112722, 0.10074272346424881, 0.17165503675668417, 0.18589668108086863, 0.15660671413114124, -0.04709246517582373, -0.11957067081080326, -0.2601440492678772, -0.1476692284034057, -0.1811739971691912, -0.04382906562902711, -0.14660705079440958, -0.0911291164430705, 0.36707782254300336, 0.18848557250881146, 0.16730876558206298, 0.13863696594807234, 0.36065412891859355, 0.14784435815262523, 0.025196985341608524, 0.15921917696991428, 0.23997440964872527, 0.08603269771503454, 0.0818668572676622, -0.29619443281977015, 0.07606992780823599, 0.10512083525854078] |
1,802.03295 | A relationship between multiple conjugation quandle/biquandle colorings | We define a functor $\mathcal{Q}$ from the category of multiple conjugation
biquandles to that of multiple conjugation quandles. We show that for any
multiple conjugation biquandle $X$, there is a one-to-one correspondence
between the set of $X$-colorings and that of $\mathcal{Q}(X)$-colorings
diagrammatically for any handlebody-link and spatial trivalent graph. In
particular, we prove that the set of $G$-family of Alexander biquandles
colorings is isomorphic to that of $G$-family of Alexander quandles colorings
as modules.
| math.GT | we define a functor mathcalq from the category of multiple conjugation biquandles to that of multiple conjugation quandles we show that for any multiple conjugation biquandle x there is a onetoone correspondence between the set of xcolorings and that of mathcalqxcolorings diagrammatically for any handlebodylink and spatial trivalent graph in particular we prove that the set of gfamily of alexander biquandles colorings is isomorphic to that of gfamily of alexander quandles colorings as modules | [['we', 'define', 'a', 'functor', 'mathcalq', 'from', 'the', 'category', 'of', 'multiple', 'conjugation', 'biquandles', 'to', 'that', 'of', 'multiple', 'conjugation', 'quandles', 'we', 'show', 'that', 'for', 'any', 'multiple', 'conjugation', 'biquandle', 'x', 'there', 'is', 'a', 'onetoone', 'correspondence', 'between', 'the', 'set', 'of', 'xcolorings', 'and', 'that', 'of', 'mathcalqxcolorings', 'diagrammatically', 'for', 'any', 'handlebodylink', 'and', 'spatial', 'trivalent', 'graph', 'in', 'particular', 'we', 'prove', 'that', 'the', 'set', 'of', 'gfamily', 'of', 'alexander', 'biquandles', 'colorings', 'is', 'isomorphic', 'to', 'that', 'of', 'gfamily', 'of', 'alexander', 'quandles', 'colorings', 'as', 'modules']] | [-0.26265743374824524, 0.09288691705067272, -0.08037127708786562, 0.05796438806502097, -0.0939301997423172, -0.12822077567497753, 0.039380337175441114, 0.40611410345116705, -0.3874743223088245, -0.23291117012857981, 0.00458033278118819, -0.24131172878288165, -0.18337722393135503, 0.1221613149694486, -0.1919203488768576, -0.04229974416275955, 0.06921294063635886, 0.10107928869946005, -0.06154198143057117, -0.2221246271363096, 0.4261376720993486, -0.10986505678459389, 0.15221603654886354, 0.08795445707103569, 0.12193721514960675, 0.017049736298671733, 0.0016440775832288887, 0.03603833214673277, -0.11279893696895396, 0.10996875809888317, 0.3276719754587298, 0.12664206888150323, 0.10604561341301322, -0.3374879951118364, -0.07600888789771762, 0.22775110681477476, 0.09641293636586977, -0.014097815762235694, -0.0017484278347955583, -0.2714369837704995, 0.19691813794564303, -0.22986786662001316, -0.052376947467763946, -0.10248147254835253, 0.10300310895051042, 0.05011365639862336, -0.23381630828833744, -0.05889008280961481, 0.08628204411329472, 0.10389386866343757, -0.013309829523914482, -0.04290546534251269, -0.1415642398690218, 0.15090518421174526, -0.04984726663040992, 0.0811949066932581, 0.05363482552618809, -0.12422679604528701, -0.2389003612764486, 0.3843830569124181, -0.011262548398481656, -0.21138698459692198, 0.14652914992750507, -0.15484989815940187, -0.24655879241069906, 0.1391462727564655, 0.0022308104862905527, 0.1351960998742956, -0.04897804078582215, 0.13214512863228328, -0.23377341632922627, 0.10321576120204305, 0.19663150618745856, 0.03173370311700114, 0.11943447999401044, 0.023151838689506668, 0.07753649912774563, 0.18680828599871635, 0.02342725698899937, 0.014969177620664034, -0.3452334779415165, -0.2325263743046416, -0.11808699227180587, 0.09819293876931276, -0.09358104194589406, -0.19477892261355706, 0.3809989503048973, 0.156572225541897, 0.1509011479920695, 0.17287690779321815, 0.2059051763515103, -0.030206232565719863, 0.08654169390003567, 0.05759015919206894, 0.030492416838955847, 0.23951867980601854, -0.05931874068632518, -0.1394046345208963, -0.049184604665927896, 0.2278182682236784] |
1,802.03296 | Pointed Closed Convex Sets are the Intersection of All Rational
Supporting Closed Halfspaces | We prove that every pointed closed convex set in $\mathbb{R}^n$ is the
intersection of all the rational closed halfspaces that contain it. This
generalizes a previous result by the authors for compact convex sets.
| math.OC | we prove that every pointed closed convex set in mathbbrn is the intersection of all the rational closed halfspaces that contain it this generalizes a previous result by the authors for compact convex sets | [['we', 'prove', 'that', 'every', 'pointed', 'closed', 'convex', 'set', 'in', 'mathbbrn', 'is', 'the', 'intersection', 'of', 'all', 'the', 'rational', 'closed', 'halfspaces', 'that', 'contain', 'it', 'this', 'generalizes', 'a', 'previous', 'result', 'by', 'the', 'authors', 'for', 'compact', 'convex', 'sets']] | [-0.17167266847237067, 0.04278325878412408, -0.05322618782520294, 0.037267481716459286, -0.06746884149170536, -0.08779043308459222, 0.0301326408105738, 0.32527970610296025, -0.28220737291335624, -0.10520363132031087, 0.0749325239311849, -0.3075014457983129, -0.16154962271342382, 0.25563517171779976, -0.17973489878589616, 0.040568678256343395, 0.08437387179583311, 0.05627568868701072, -0.028845411026850343, -0.36623656547025724, 0.4271894770071787, -0.20583735636490233, 0.176433857092086, 0.08978001202237518, 0.12007129050257123, 0.027690166224013355, 0.006210923838593504, 0.12803661423351834, -0.1469286456314662, 0.14711534634561224, 0.3463819510139087, 0.2102327795685543, 0.27909705081187625, -0.39470081585579253, -0.2041332054992809, 0.21510782450273194, 0.07362478818087016, -0.014359413070932907, -0.003257462679518058, -0.23111704024760163, 0.13106277905514135, -0.0787008360356969, -0.178775819217074, -0.05561143505003523, 0.0919011943590115, 0.03141095779617043, -0.2699611327227424, -0.05080320962759502, 0.20138991065323353, 0.06948567880317569, -0.12275885985068538, -0.12441284306730856, 0.008372451788197984, 0.04663034559994498, -0.015586068121004193, 0.19005092366269843, 0.07007561944363475, 0.05688762347734369, -0.1306420680382015, 0.3065381510292782, -0.0049287454389473975, -0.29641904155997667, 0.13028347974314408, -0.19954058945672037, -0.1890937367810265, 0.161766764762647, 0.06749053014551892, 0.20349622254862504, -0.12340442721238908, 0.23964635052663438, -0.2707700635963941, 0.024220040006398717, 0.16027888472137206, -0.03039622084949823, 0.12324982059790808, 0.10608212821021237, 0.17337841009173324, 0.18040025988867617, 0.056982801624518985, -0.05266424106872257, -0.4008147442603813, -0.13122747077004, -0.2086192136116819, 0.10973469239166554, -0.10103115331217208, -0.2130187699187766, 0.3287150839014965, 0.04023761083098019, 0.18517931476783225, 0.1483528138795758, 0.27793104793219003, 0.05212012000821928, 0.048974214231266695, 0.20254995790310204, 0.16809477635166226, 0.08023954123285983, -0.07115439759731731, -0.0932782247032532, 0.029671593226821107, 0.15214279297437958] |
1,802.03297 | Updating Dynamic Random Hyperbolic Graphs in Sublinear Time | Generative network models play an important role in algorithm development,
scaling studies, network analysis, and realistic system benchmarks for graph
data sets. A complex network model gaining considerable popularity builds
random hyperbolic graphs, generated by distributing points within a disk in the
hyperbolic plane and then adding edges between points with a probability
depending on their hyperbolic distance.
We present a dynamic extension to model gradual network change, while
preserving at each step the point position probabilities. To process the
dynamic changes efficiently, we formalize the concept of a probabilistic
neighborhood: Let $P$ be a set of $n$ points in Euclidean or hyperbolic space,
$q$ a query point, $\operatorname{dist}$ a distance metric, and $f :
\mathbb{R}^+ \rightarrow [0,1]$ a monotonically decreasing function. Then, the
probabilistic neighborhood $N(q, f)$ of $q$ with respect to $f$ is a random
subset of $P$ and each point $p \in P$ belongs to $N(q,f)$ with probability
$f(\operatorname{dist}(p,q))$. We present a fast, sublinear-time query
algorithm to sample probabilistic neighborhoods from planar point sets. For
certain distributions of planar $P$, we prove that our algorithm answers a
query in $O((|N(q,f)| + \sqrt{n})\log n)$ time with high probability. This
enables us to process a node movement in random hyperbolic graphs in sublinear
time, resulting in a speedup of about one order of magnitude in practice
compared to the fastest previous approach. Apart from that, our query algorithm
is also applicable to Euclidean geometry, making it of independent interest for
other sampling or probabilistic spreading scenarios.
| cs.DS | generative network models play an important role in algorithm development scaling studies network analysis and realistic system benchmarks for graph data sets a complex network model gaining considerable popularity builds random hyperbolic graphs generated by distributing points within a disk in the hyperbolic plane and then adding edges between points with a probability depending on their hyperbolic distance we present a dynamic extension to model gradual network change while preserving at each step the point position probabilities to process the dynamic changes efficiently we formalize the concept of a probabilistic neighborhood let p be a set of n points in euclidean or hyperbolic space q a query point operatornamedist a distance metric and f mathbbr rightarrow 01 a monotonically decreasing function then the probabilistic neighborhood nq f of q with respect to f is a random subset of p and each point p in p belongs to nqf with probability foperatornamedistpq we present a fast sublineartime query algorithm to sample probabilistic neighborhoods from planar point sets for certain distributions of planar p we prove that our algorithm answers a query in onqf sqrtnlog n time with high probability this enables us to process a node movement in random hyperbolic graphs in sublinear time resulting in a speedup of about one order of magnitude in practice compared to the fastest previous approach apart from that our query algorithm is also applicable to euclidean geometry making it of independent interest for other sampling or probabilistic spreading scenarios | [['generative', 'network', 'models', 'play', 'an', 'important', 'role', 'in', 'algorithm', 'development', 'scaling', 'studies', 'network', 'analysis', 'and', 'realistic', 'system', 'benchmarks', 'for', 'graph', 'data', 'sets', 'a', 'complex', 'network', 'model', 'gaining', 'considerable', 'popularity', 'builds', 'random', 'hyperbolic', 'graphs', 'generated', 'by', 'distributing', 'points', 'within', 'a', 'disk', 'in', 'the', 'hyperbolic', 'plane', 'and', 'then', 'adding', 'edges', 'between', 'points', 'with', 'a', 'probability', 'depending', 'on', 'their', 'hyperbolic', 'distance', 'we', 'present', 'a', 'dynamic', 'extension', 'to', 'model', 'gradual', 'network', 'change', 'while', 'preserving', 'at', 'each', 'step', 'the', 'point', 'position', 'probabilities', 'to', 'process', 'the', 'dynamic', 'changes', 'efficiently', 'we', 'formalize', 'the', 'concept', 'of', 'a', 'probabilistic', 'neighborhood', 'let', 'p', 'be', 'a', 'set', 'of', 'n', 'points', 'in', 'euclidean', 'or', 'hyperbolic', 'space', 'q', 'a', 'query', 'point', 'operatornamedist', 'a', 'distance', 'metric', 'and', 'f', 'mathbbr', 'rightarrow', '01', 'a', 'monotonically', 'decreasing', 'function', 'then', 'the', 'probabilistic', 'neighborhood', 'nq', 'f', 'of', 'q', 'with', 'respect', 'to', 'f', 'is', 'a', 'random', 'subset', 'of', 'p', 'and', 'each', 'point', 'p', 'in', 'p', 'belongs', 'to', 'nqf', 'with', 'probability', 'foperatornamedistpq', 'we', 'present', 'a', 'fast', 'sublineartime', 'query', 'algorithm', 'to', 'sample', 'probabilistic', 'neighborhoods', 'from', 'planar', 'point', 'sets', 'for', 'certain', 'distributions', 'of', 'planar', 'p', 'we', 'prove', 'that', 'our', 'algorithm', 'answers', 'a', 'query', 'in', 'onqf', 'sqrtnlog', 'n', 'time', 'with', 'high', 'probability', 'this', 'enables', 'us', 'to', 'process', 'a', 'node', 'movement', 'in', 'random', 'hyperbolic', 'graphs', 'in', 'sublinear', 'time', 'resulting', 'in', 'a', 'speedup', 'of', 'about', 'one', 'order', 'of', 'magnitude', 'in', 'practice', 'compared', 'to', 'the', 'fastest', 'previous', 'approach', 'apart', 'from', 'that', 'our', 'query', 'algorithm', 'is', 'also', 'applicable', 'to', 'euclidean', 'geometry', 'making', 'it', 'of', 'independent', 'interest', 'for', 'other', 'sampling', 'or', 'probabilistic', 'spreading', 'scenarios']] | [-0.13352258710867979, 0.06126026314071597, -0.07405917937886586, 0.0382965292834297, -0.0807624457881224, -0.1555001941578817, 0.13520716191057794, 0.39980454202587445, -0.3008266008605272, -0.2856930024483653, 0.03536611016452974, -0.2993077629299696, -0.138766550042374, 0.1649485858626787, -0.09380647962458802, 0.09621913385893072, 0.06771625106777103, 0.06597572863236655, -0.04649420062172388, -0.24736078079149593, 0.2934899895475054, 0.005974521210093882, 0.24073542172689577, -0.02063594536744212, 0.08619944197087248, 0.032522109994227145, -0.012336046940287237, 0.044709074254554684, -0.12464536514455762, 0.10003572120238023, 0.270042561173773, 0.1643725444462854, 0.31166871201173857, -0.37372427229746796, -0.1950296397005354, 0.1777160273468476, 0.13864806405276306, 0.05595742790163148, -0.017956453875334517, -0.2674124992321715, 0.1068820592674065, -0.112345445608674, -0.12436374216455935, -0.025992449417985466, 0.09264758135642363, 0.0062534299268760555, -0.3218738667643821, -0.0034950812943019974, 0.09716336211682228, 0.044264339228076016, 0.0060764506530432295, -0.09474762301547607, -0.007197887868589668, 0.11090643471106887, -0.0036482874129433185, 0.14071135422838313, 0.12348793529759138, -0.06105607562921633, -0.15161957268310663, 0.3648212319316943, -0.03502093294725853, -0.2193638931580796, 0.1536143993504715, -0.1590928516284782, -0.15188253350500094, 0.1515974712236746, 0.2329261467414706, 0.1325593933709397, -0.09687110052293951, 0.13494993665752056, -0.047382683383516415, 0.16366285919466764, 0.07437335273485693, -0.0016033788921680947, 0.1465052279868848, 0.18354041559510087, 0.1270711411335236, 0.14475951255044192, -0.04669932945831563, -0.10523724440997081, -0.2780515066047838, -0.1352590066015197, -0.2025887808913542, 0.05029419070547004, -0.19550473430585538, -0.19641032540778175, 0.366111658802179, 0.14848056202994905, 0.2539787785850527, 0.11956357620925881, 0.26273846162929515, 0.07676457530850869, 0.016566008497760746, 0.13717824380367624, 0.08477156636716937, 0.07063305671788629, 0.06517137187890985, -0.13511143231279532, 0.09551240979551438, 0.10058842177687055] |
1,802.03298 | A Hierarchical A-Posteriori Error Estimatorfor the Reduced Basis Method | In this contribution we are concerned with tight a posteriori error
estimation for projection based model order reduction of $\inf$-$\sup$ stable
parameterized variational problems. In particular, we consider the Reduced
Basis Method in a Petrov-Galerkin framework, where the reduced approximation
spaces are constructed by the (weak) Greedy algorithm. We propose and analyze a
hierarchical a posteriori error estimator which evaluates the difference of two
reduced approximations of different accuracy. Based on the a priori error
analysis of the (weak) Greedy algorithm, it is expected that the hierarchical
error estimator is sharp with efficiency index close to one, if the Kolmogorov
N-with decays fast for the underlying problem and if a suitable saturation
assumption for the reduced approximation is satisfied. We investigate the
tightness of the hierarchical a posteriori estimator both from a theoretical
and numerical perspective. For the respective approximation with higher
accuracy we study and compare basis enrichment of Lagrange- and Taylor-type
reduced bases. Numerical experiments indicate the efficiency for both, the
construction of a reduced basis using the hierarchical error estimator in a
weak Greedy algorithm, and for tight online certification of reduced
approximations. This is particularly relevant in cases where the $\inf$-$\sup$
constant may become small depending on the parameter. In such cases a standard
residual-based error estimator -- complemented by the successive constrained
method to compute a lower bound of the parameter dependent $\inf$-$\sup$
constant -- may become infeasible.
| math.NA | in this contribution we are concerned with tight a posteriori error estimation for projection based model order reduction of infsup stable parameterized variational problems in particular we consider the reduced basis method in a petrovgalerkin framework where the reduced approximation spaces are constructed by the weak greedy algorithm we propose and analyze a hierarchical a posteriori error estimator which evaluates the difference of two reduced approximations of different accuracy based on the a priori error analysis of the weak greedy algorithm it is expected that the hierarchical error estimator is sharp with efficiency index close to one if the kolmogorov nwith decays fast for the underlying problem and if a suitable saturation assumption for the reduced approximation is satisfied we investigate the tightness of the hierarchical a posteriori estimator both from a theoretical and numerical perspective for the respective approximation with higher accuracy we study and compare basis enrichment of lagrange and taylortype reduced bases numerical experiments indicate the efficiency for both the construction of a reduced basis using the hierarchical error estimator in a weak greedy algorithm and for tight online certification of reduced approximations this is particularly relevant in cases where the infsup constant may become small depending on the parameter in such cases a standard residualbased error estimator complemented by the successive constrained method to compute a lower bound of the parameter dependent infsup constant may become infeasible | [['in', 'this', 'contribution', 'we', 'are', 'concerned', 'with', 'tight', 'a', 'posteriori', 'error', 'estimation', 'for', 'projection', 'based', 'model', 'order', 'reduction', 'of', 'infsup', 'stable', 'parameterized', 'variational', 'problems', 'in', 'particular', 'we', 'consider', 'the', 'reduced', 'basis', 'method', 'in', 'a', 'petrovgalerkin', 'framework', 'where', 'the', 'reduced', 'approximation', 'spaces', 'are', 'constructed', 'by', 'the', 'weak', 'greedy', 'algorithm', 'we', 'propose', 'and', 'analyze', 'a', 'hierarchical', 'a', 'posteriori', 'error', 'estimator', 'which', 'evaluates', 'the', 'difference', 'of', 'two', 'reduced', 'approximations', 'of', 'different', 'accuracy', 'based', 'on', 'the', 'a', 'priori', 'error', 'analysis', 'of', 'the', 'weak', 'greedy', 'algorithm', 'it', 'is', 'expected', 'that', 'the', 'hierarchical', 'error', 'estimator', 'is', 'sharp', 'with', 'efficiency', 'index', 'close', 'to', 'one', 'if', 'the', 'kolmogorov', 'nwith', 'decays', 'fast', 'for', 'the', 'underlying', 'problem', 'and', 'if', 'a', 'suitable', 'saturation', 'assumption', 'for', 'the', 'reduced', 'approximation', 'is', 'satisfied', 'we', 'investigate', 'the', 'tightness', 'of', 'the', 'hierarchical', 'a', 'posteriori', 'estimator', 'both', 'from', 'a', 'theoretical', 'and', 'numerical', 'perspective', 'for', 'the', 'respective', 'approximation', 'with', 'higher', 'accuracy', 'we', 'study', 'and', 'compare', 'basis', 'enrichment', 'of', 'lagrange', 'and', 'taylortype', 'reduced', 'bases', 'numerical', 'experiments', 'indicate', 'the', 'efficiency', 'for', 'both', 'the', 'construction', 'of', 'a', 'reduced', 'basis', 'using', 'the', 'hierarchical', 'error', 'estimator', 'in', 'a', 'weak', 'greedy', 'algorithm', 'and', 'for', 'tight', 'online', 'certification', 'of', 'reduced', 'approximations', 'this', 'is', 'particularly', 'relevant', 'in', 'cases', 'where', 'the', 'infsup', 'constant', 'may', 'become', 'small', 'depending', 'on', 'the', 'parameter', 'in', 'such', 'cases', 'a', 'standard', 'residualbased', 'error', 'estimator', 'complemented', 'by', 'the', 'successive', 'constrained', 'method', 'to', 'compute', 'a', 'lower', 'bound', 'of', 'the', 'parameter', 'dependent', 'infsup', 'constant', 'may', 'become', 'infeasible']] | [-0.09800712678419507, 0.018415403677879468, -0.08581652860359654, 0.13071478692581878, -0.044969381529675875, -0.1553157775055455, 0.10825517837049277, 0.3615326451542585, -0.2872092739921873, -0.2814491315987771, 0.14044642601283672, -0.20233979575214503, -0.14876737435874732, 0.19576937525391416, -0.07277714394883293, 0.1056696064952437, 0.09885909711010754, 0.015513651649076643, -0.14204648181937796, -0.26144991866819073, 0.28908280937972924, 0.08673627110522078, 0.2884176819038618, -0.0023833710275104514, 0.11966911415245546, -0.018736817035824062, -0.034231109634224, 0.045077866965853586, -0.1644341583871447, 0.15595125151423575, 0.22180223199538887, 0.12038126165938118, 0.3440116567193004, -0.36604329316836337, -0.16645448505359642, 0.11236465799308422, 0.13603118341922274, 0.10322312477561038, -0.04394928596954307, -0.2510206053499132, 0.11623562497552484, -0.16529718463956986, -0.0857344812652825, -0.09693476148759542, -0.055349442243333095, 0.021391641623441777, -0.3739177877447851, 0.1305228770335974, 0.035814193431692926, 0.030673582284994748, -0.04547562041502122, -0.14848360749184275, 0.03585197226215235, 0.056254421048747054, 0.025192583009155223, 0.006097067757408418, 0.0711651281858592, -0.06939363583881894, -0.07032333856863578, 0.3480130479387615, -0.08805992010950475, -0.2665392747310841, 0.1300428542247771, -0.07990230161939627, -0.14034409444404605, 0.1469649696894719, 0.2016731708836944, 0.13719166532644758, -0.10988822641033355, 0.1004811361285291, -0.030284672691081854, 0.1676284146414179, 0.03659151546231917, 0.008287180713175432, 0.0697357260611961, 0.20135588964862425, 0.1450715552114517, 0.12008438436112003, -0.06752240868657321, -0.09766179422782127, -0.3247290158968257, -0.132676119528807, -0.20614005909706262, -0.030348986820773343, -0.15817924628968089, -0.20452577419700507, 0.34585019285669144, 0.1465266232388904, 0.15364847177963542, 0.09136092161364934, 0.32425500396639106, 0.17126945311623706, -0.023834686337605767, 0.11129896042908988, 0.266115895766036, 0.13463436938700793, 0.0021103218010545747, -0.22374633615051964, 0.10241614030066716, 0.158514880408209] |
1,802.03299 | Modular Cauchy kernel corresponding to the Hecke curve | In this paper we construct the modular Cauchy kernel $\Xi_N(z_1, z_2)$, i.e.
the modular invariant function of two variables, $(z_1, z_2) \in \mathbb{H}
\times \mathbb{H}$, with the first order pole on the curve $$D_N=\left\{(z_1,
z_2) \in \mathbb{H} \times \mathbb{H}|~ z_2=\gamma z_1, ~\gamma \in \Gamma_0(N)
\right\}.$$ The function $\Xi_N(z_1, z_2)$ is used in two cases and for two
different purposes. Firstly, we prove generalization of the Zagier theorem
([La], [Za3]) for the Hecke subgroups $\Gamma_0(N)$ of genus $g>0$. Namely, we
obtain a kind of "kernel function" for the Hecke operator $T_N(m)$ on the space
of the weight 2 cusp forms for $\Gamma_0(N)$, which is the analogue of the
Zagier series $\omega_{m, N}(z_1,\bar{z_2}, 2)$. Secondly, we consider an
elementary proof of the formula for the infinite Borcherds product of the
difference of two normalized Hauptmoduls,
$J_{\Gamma_0(N)}(z_1)-J_{\Gamma_0(N)}(z_2)$, for genus zero congruence subgroup
$\Gamma_0(N)$.
| math.AG math.NT | in this paper we construct the modular cauchy kernel xi_nz_1 z_2 ie the modular invariant function of two variables z_1 z_2 in mathbbh times mathbbh with the first order pole on the curve d_nleftz_1 z_2 in mathbbh times mathbbh z_2gamma z_1 gamma in gamma_0n right the function xi_nz_1 z_2 is used in two cases and for two different purposes firstly we prove generalization of the zagier theorem la za3 for the hecke subgroups gamma_0n of genus g0 namely we obtain a kind of kernel function for the hecke operator t_nm on the space of the weight 2 cusp forms for gamma_0n which is the analogue of the zagier series omega_m nz_1barz_2 2 secondly we consider an elementary proof of the formula for the infinite borcherds product of the difference of two normalized hauptmoduls j_gamma_0nz_1j_gamma_0nz_2 for genus zero congruence subgroup gamma_0n | [['in', 'this', 'paper', 'we', 'construct', 'the', 'modular', 'cauchy', 'kernel', 'xi_nz_1', 'z_2', 'ie', 'the', 'modular', 'invariant', 'function', 'of', 'two', 'variables', 'z_1', 'z_2', 'in', 'mathbbh', 'times', 'mathbbh', 'with', 'the', 'first', 'order', 'pole', 'on', 'the', 'curve', 'd_nleftz_1', 'z_2', 'in', 'mathbbh', 'times', 'mathbbh', 'z_2gamma', 'z_1', 'gamma', 'in', 'gamma_0n', 'right', 'the', 'function', 'xi_nz_1', 'z_2', 'is', 'used', 'in', 'two', 'cases', 'and', 'for', 'two', 'different', 'purposes', 'firstly', 'we', 'prove', 'generalization', 'of', 'the', 'zagier', 'theorem', 'la', 'za3', 'for', 'the', 'hecke', 'subgroups', 'gamma_0n', 'of', 'genus', 'g0', 'namely', 'we', 'obtain', 'a', 'kind', 'of', 'kernel', 'function', 'for', 'the', 'hecke', 'operator', 't_nm', 'on', 'the', 'space', 'of', 'the', 'weight', '2', 'cusp', 'forms', 'for', 'gamma_0n', 'which', 'is', 'the', 'analogue', 'of', 'the', 'zagier', 'series', 'omega_m', 'nz_1barz_2', '2', 'secondly', 'we', 'consider', 'an', 'elementary', 'proof', 'of', 'the', 'formula', 'for', 'the', 'infinite', 'borcherds', 'product', 'of', 'the', 'difference', 'of', 'two', 'normalized', 'hauptmoduls', 'j_gamma_0nz_1j_gamma_0nz_2', 'for', 'genus', 'zero', 'congruence', 'subgroup', 'gamma_0n']] | [-0.22296249390241096, 0.09308663645689111, -0.12817455445783157, 0.1109818108565047, -0.08772818131414666, -0.11678108590951358, -0.017585000151126278, 0.32822349800192047, -0.30039635369956325, -0.18081489505923606, 0.09950684499838672, -0.29009145778378076, -0.14270931301739023, 0.20883613921504354, -0.060486051429479354, 0.01645365425837085, -0.032605391061004026, 0.13212906073771813, -0.14093148965515534, -0.29938635725535057, 0.41662998330976925, -0.08427680491215804, 0.2003473259974271, 0.022087970099440128, 0.08743467858188193, 0.03402863438311739, 0.011338574367321351, -0.21709599103667532, -0.19670852106487888, 0.09785396128074464, 0.25144801385988214, 0.029301178788018384, 0.18596093378745895, -0.3931927565965011, -0.08233744108513223, 0.21413841149346394, 0.16572945935397662, -0.07757116467462655, 0.007848685540287106, -0.2687641019566041, 0.0623341626813988, -0.18776818067426299, -0.17841367841218458, -0.037863823200688894, 0.07616746243597432, -0.0492195596364609, -0.2728944386877684, 0.050076977921311154, 0.0751425640862153, 0.1397449628907039, -0.05947237549998769, -0.192300889782156, -0.009477820734239438, 0.06505408369103503, 0.06348573035387689, 0.07306863208456586, 0.03963743709027767, -0.10316736916976163, -0.09057768322456854, 0.3273150624749674, -0.08479861224116052, -0.2404700634493069, 0.043334234625834855, -0.2022975588386709, -0.22421067131147016, 0.0723785215280562, 0.08228891400380456, 0.1333960233764215, -0.004543582252650099, 0.20921824786372864, -0.10812121785640942, 0.08041831921913069, 0.14170138643715868, -0.05868617457930337, 0.10301869466308165, 0.035782852047828564, 0.0846424677336913, 0.1646988631903448, -0.029909940690479496, -0.0005691438264241724, -0.39086672691910557, -0.27677526465391344, -0.17566249635649112, 0.1323094400666543, -0.16319268693868336, -0.17351724816288686, 0.4443653891759106, 0.04040865241161858, 0.17483368729396412, 0.1464981417547361, 0.20162764480020004, 0.1683548264792824, 0.061469707574526015, 0.03147472285623239, 0.04119206755774829, 0.16287615673200256, -0.05635164270995918, -0.13720574453922876, -0.05206852568252626, 0.23663978182682485] |
1,802.033 | Bayesian inference for bivariate ranks | A recommender system based on ranks is proposed, where an expert's ranking of
a set of objects and a user's ranking of a subset of those objects are combined
to make a prediction of the user's ranking of all objects. The rankings are
assumed to be induced by latent continuous variables corresponding to the
grades assigned by the expert and the user to the objects. The dependence
between the expert and user grades is modelled by a copula in some parametric
family. Given a prior distribution on the copula parameter, the user's complete
ranking is predicted by the mode of the posterior predictive distribution of
the user's complete ranking conditional on the expert's complete and the user's
incomplete rankings. Various Markov chain Monte-Carlo algorithms are proposed
to approximate the predictive distribution or only its mode. The predictive
distribution can be obtained exactly for the Farlie-Gumbel-Morgenstern copula
family, providing a benchmark for the approximation accuracy of the algorithms.
The method is applied to the MovieLens 100k dataset with a Gaussian copula
modelling dependence between the expert's and user's grades.
| stat.ML cs.LG | a recommender system based on ranks is proposed where an experts ranking of a set of objects and a users ranking of a subset of those objects are combined to make a prediction of the users ranking of all objects the rankings are assumed to be induced by latent continuous variables corresponding to the grades assigned by the expert and the user to the objects the dependence between the expert and user grades is modelled by a copula in some parametric family given a prior distribution on the copula parameter the users complete ranking is predicted by the mode of the posterior predictive distribution of the users complete ranking conditional on the experts complete and the users incomplete rankings various markov chain montecarlo algorithms are proposed to approximate the predictive distribution or only its mode the predictive distribution can be obtained exactly for the farliegumbelmorgenstern copula family providing a benchmark for the approximation accuracy of the algorithms the method is applied to the movielens 100k dataset with a gaussian copula modelling dependence between the experts and users grades | [['a', 'recommender', 'system', 'based', 'on', 'ranks', 'is', 'proposed', 'where', 'an', 'experts', 'ranking', 'of', 'a', 'set', 'of', 'objects', 'and', 'a', 'users', 'ranking', 'of', 'a', 'subset', 'of', 'those', 'objects', 'are', 'combined', 'to', 'make', 'a', 'prediction', 'of', 'the', 'users', 'ranking', 'of', 'all', 'objects', 'the', 'rankings', 'are', 'assumed', 'to', 'be', 'induced', 'by', 'latent', 'continuous', 'variables', 'corresponding', 'to', 'the', 'grades', 'assigned', 'by', 'the', 'expert', 'and', 'the', 'user', 'to', 'the', 'objects', 'the', 'dependence', 'between', 'the', 'expert', 'and', 'user', 'grades', 'is', 'modelled', 'by', 'a', 'copula', 'in', 'some', 'parametric', 'family', 'given', 'a', 'prior', 'distribution', 'on', 'the', 'copula', 'parameter', 'the', 'users', 'complete', 'ranking', 'is', 'predicted', 'by', 'the', 'mode', 'of', 'the', 'posterior', 'predictive', 'distribution', 'of', 'the', 'users', 'complete', 'ranking', 'conditional', 'on', 'the', 'experts', 'complete', 'and', 'the', 'users', 'incomplete', 'rankings', 'various', 'markov', 'chain', 'montecarlo', 'algorithms', 'are', 'proposed', 'to', 'approximate', 'the', 'predictive', 'distribution', 'or', 'only', 'its', 'mode', 'the', 'predictive', 'distribution', 'can', 'be', 'obtained', 'exactly', 'for', 'the', 'farliegumbelmorgenstern', 'copula', 'family', 'providing', 'a', 'benchmark', 'for', 'the', 'approximation', 'accuracy', 'of', 'the', 'algorithms', 'the', 'method', 'is', 'applied', 'to', 'the', 'movielens', '100k', 'dataset', 'with', 'a', 'gaussian', 'copula', 'modelling', 'dependence', 'between', 'the', 'experts', 'and', 'users', 'grades']] | [-0.03867805028907181, 0.006445057412921425, -0.0981618939019907, 0.09634774895953904, -0.15153163487060267, -0.1344587231719385, 0.11368936742394326, 0.4291558043633619, -0.22443834832461362, -0.32897070174764714, 0.05390037954161977, -0.3254057391222273, -0.07956396433357359, 0.14331783964089378, -0.08295333015292966, 0.07946545814570782, 0.04846128495671692, 0.1040840518825656, -0.03383017720077763, -0.31943174515683415, 0.31535728715014844, 0.055527660150729706, 0.31298672506622344, -0.02981322686439066, 0.10840741705588913, -0.003660444548259374, -0.05694974511678676, 0.02254754266952782, -0.08404682594846236, 0.16721095304460046, 0.3139358177216033, 0.20287827287769217, 0.3412239487293396, -0.30961533399361574, -0.17633866933645326, 0.09454190263294437, 0.0572618708953659, 0.038948079636529756, 0.01795643848809152, -0.370380501241915, 0.08012603871848727, -0.21861214322048458, -0.02492490257633578, -0.08460023335516034, -0.03293370952034432, 0.04943977711000218, -0.38853495411072553, 0.03441083907107875, 0.04535378495903602, 0.08528965524805898, -0.025883815490661627, -0.13605083589732458, -0.028450161369721498, 0.16186807380356105, 0.06173192071296756, -0.022075745729687676, 0.15364748636702746, -0.16000597177627968, -0.147911026121609, 0.3565851263705186, -0.013699230417515036, -0.25244735321553236, 0.16574816719571317, -0.09593352084205056, -0.09801807424074478, 0.11709877775113485, 0.2088702118620695, 0.10590191052185392, -0.19284238585459298, 0.014402006649127063, -0.06846003908614283, 0.180307279136869, 0.03707021408651568, -0.062206138725905274, 0.18909478955640552, 0.1678763120068928, 0.041942092616194755, 0.10560643320688663, -0.04903634893838735, -0.08926181170011588, -0.2459883156724358, -0.10983355639350674, -0.2299159432259739, -0.02371455249481238, -0.15965694376080117, -0.19635962569311763, 0.4436681407890963, 0.14892327546375056, 0.19203456659707124, 0.1010247887559549, 0.27722897884708025, 0.09119009471367953, 0.03067401818031173, 0.08662120721125033, 0.1293774557058252, 0.06381308726359451, 0.05335296150244605, -0.1526995314248534, 0.17131633586197925, 0.026553557986874927] |
1,802.03301 | Peregrine's system revisited | In 1967 D. H. Peregrine proposed a Boussinesq-type model for long waves in
shallow waters of varying depth. This prominent paper turned a new leaf in
coastal hydrodynamics along with contributions by F. Serre, A. E. Green \& P.
M. Naghdi and many others since then. Several modern Boussinesq-type systems
stem from these pioneering works. In the present work we revise the long wave
model traditionally referred to as the Peregrine system. Namely, we propose a
modification of the governing equations which is asymptotically similar to the
initial model for weakly nonlinear waves, while preserving an additional
symmetry of the complete water wave problem. This modification procedure is
called the invariantization. We show that the improved system has well
conditioned dispersive terms in the swash zone, hence allowing for efficient
and stable run-up computations.
| physics.flu-dyn math.AP math.NA physics.ao-ph physics.class-ph | in 1967 d h peregrine proposed a boussinesqtype model for long waves in shallow waters of varying depth this prominent paper turned a new leaf in coastal hydrodynamics along with contributions by f serre a e green p m naghdi and many others since then several modern boussinesqtype systems stem from these pioneering works in the present work we revise the long wave model traditionally referred to as the peregrine system namely we propose a modification of the governing equations which is asymptotically similar to the initial model for weakly nonlinear waves while preserving an additional symmetry of the complete water wave problem this modification procedure is called the invariantization we show that the improved system has well conditioned dispersive terms in the swash zone hence allowing for efficient and stable runup computations | [['in', '1967', 'd', 'h', 'peregrine', 'proposed', 'a', 'boussinesqtype', 'model', 'for', 'long', 'waves', 'in', 'shallow', 'waters', 'of', 'varying', 'depth', 'this', 'prominent', 'paper', 'turned', 'a', 'new', 'leaf', 'in', 'coastal', 'hydrodynamics', 'along', 'with', 'contributions', 'by', 'f', 'serre', 'a', 'e', 'green', 'p', 'm', 'naghdi', 'and', 'many', 'others', 'since', 'then', 'several', 'modern', 'boussinesqtype', 'systems', 'stem', 'from', 'these', 'pioneering', 'works', 'in', 'the', 'present', 'work', 'we', 'revise', 'the', 'long', 'wave', 'model', 'traditionally', 'referred', 'to', 'as', 'the', 'peregrine', 'system', 'namely', 'we', 'propose', 'a', 'modification', 'of', 'the', 'governing', 'equations', 'which', 'is', 'asymptotically', 'similar', 'to', 'the', 'initial', 'model', 'for', 'weakly', 'nonlinear', 'waves', 'while', 'preserving', 'an', 'additional', 'symmetry', 'of', 'the', 'complete', 'water', 'wave', 'problem', 'this', 'modification', 'procedure', 'is', 'called', 'the', 'invariantization', 'we', 'show', 'that', 'the', 'improved', 'system', 'has', 'well', 'conditioned', 'dispersive', 'terms', 'in', 'the', 'swash', 'zone', 'hence', 'allowing', 'for', 'efficient', 'and', 'stable', 'runup', 'computations']] | [-0.13583411332710008, 0.09413798024654266, -0.08155315805268579, 0.0688879736191488, -0.06725907965941369, -0.13011765797951616, -0.004953450419155783, 0.3068263548937507, -0.2748317429970922, -0.26038260216285525, 0.10663709464164353, -0.254678410572469, -0.1929909710849362, 0.1815566334452636, -0.050984537389997704, 0.09960437457154232, 0.06406390952660625, -0.002180823816434669, -0.023221837326926283, -0.19829645246981567, 0.2974551405098562, 0.05406215200130653, 0.26113635729438156, 0.033487825106507295, 0.10754092356709359, 0.014473931578555166, -0.028559002524619938, 0.004223954981136927, -0.13309313210553037, 0.07349140795483429, 0.23622980767062732, 0.07665983887032178, 0.2834965323835009, -0.4446242962844838, -0.2720291419549936, 0.06260381195049985, 0.1634535624372556, 0.14344275269142695, -0.011662786449235688, -0.26971831847738503, 0.04217381237592912, -0.16082026610234962, -0.15627419179361454, -0.03251050095445007, 0.07395218723782696, 0.02735820776893218, -0.23596590070607126, 0.07240176676681503, 0.10390946850324176, 0.009888778230581517, -0.06640931149888643, -0.11360538324964393, -0.04840784230360523, 0.06581323408290632, 0.033745915664802395, 0.05092017080011617, 0.05456063610456072, -0.12472498524562925, -0.055935712247610764, 0.395827585131042, -0.10874663748431783, -0.18889458974669301, 0.18928961858330154, -0.08672480677303515, -0.1299203615005415, 0.1381156343889696, 0.1751070475499881, 0.14465477574932656, -0.13725129074830197, 0.07509557195130344, -0.07527993341226873, 0.1236758567357814, 0.11527280760858964, -0.010962037121022778, 0.17364150877600829, 0.1740473055147699, 0.06551006288553021, 0.1121007093627538, -0.053215119991227425, -0.0684697993337772, -0.27197611264366295, -0.12864320475215973, -0.12220002729375672, 0.032615893846684084, -0.012504708140701601, -0.17080959166519175, 0.4006041950105052, 0.11906493585919996, 0.16136819480645254, 0.05234132610179162, 0.25720671723295646, 0.11472257460499029, 0.04166095646070246, 0.10176866450101922, 0.22564075180888263, 0.11424956519219716, 0.1308924482480616, -0.21214300685446652, 0.02408310321082634, 0.09111804884501305] |
1,802.03302 | Compactness and lower semicontinuity in $GSBD$ | In this paper, we prove a compactness and semicontinuity result in $GSBD$ for
sequences with bounded Griffith energy. This generalises classical results in
$(G)SBV$ by Ambrosio and $SBD$ by Bellettini-Coscia-Dal Maso. As a result, the
static problem in Francfort-Marigo's variational approach to crack growth
admits (weak) solutions. Moreover, we obtain a compactness property for
minimisers of suitable Ambrosio-Tortorelli's type energies, for which we have
recently shown the $\Gamma$-convergence to Griffith energy.
| math.FA | in this paper we prove a compactness and semicontinuity result in gsbd for sequences with bounded griffith energy this generalises classical results in gsbv by ambrosio and sbd by bellettinicosciadal maso as a result the static problem in francfortmarigos variational approach to crack growth admits weak solutions moreover we obtain a compactness property for minimisers of suitable ambrosiotortorellis type energies for which we have recently shown the gammaconvergence to griffith energy | [['in', 'this', 'paper', 'we', 'prove', 'a', 'compactness', 'and', 'semicontinuity', 'result', 'in', 'gsbd', 'for', 'sequences', 'with', 'bounded', 'griffith', 'energy', 'this', 'generalises', 'classical', 'results', 'in', 'gsbv', 'by', 'ambrosio', 'and', 'sbd', 'by', 'bellettinicosciadal', 'maso', 'as', 'a', 'result', 'the', 'static', 'problem', 'in', 'francfortmarigos', 'variational', 'approach', 'to', 'crack', 'growth', 'admits', 'weak', 'solutions', 'moreover', 'we', 'obtain', 'a', 'compactness', 'property', 'for', 'minimisers', 'of', 'suitable', 'ambrosiotortorellis', 'type', 'energies', 'for', 'which', 'we', 'have', 'recently', 'shown', 'the', 'gammaconvergence', 'to', 'griffith', 'energy']] | [-0.08242945400685239, 0.03575620791308387, -0.11277360615751414, 0.11157056205878173, -0.05761111991952604, -0.0732649924900772, 0.04272976843813962, 0.31919309140335933, -0.2904331982066271, -0.27059862160805004, 0.09675400559060665, -0.22026725702766162, -0.14282567348025405, 0.1835697199871291, -0.1555861692681019, 0.10124651305794494, 0.0772786452643462, 0.008009325323709801, -0.04597191309639767, -0.1810469990457172, 0.3755863227172574, -0.004434062814367796, 0.26848413058514914, 0.13598660625684172, 0.08503678563370634, 0.029981063449505106, 0.07436415391849048, 0.05500073926940338, -0.2547034786895974, 0.1430062603139416, 0.2633059163258147, 0.06887957283101086, 0.32180319603449153, -0.3697435981177016, -0.2368611529219284, 0.11925351201320317, 0.08982303419581322, 0.09113378931747389, -0.06891032645075734, -0.2904560716628139, 0.1655065165137622, -0.1337401630815619, -0.1840630403733743, -0.09116339202581057, 0.011658192229971512, 0.1074806647557668, -0.296967123871419, 0.13444549366553774, 0.1663894537947516, 0.024338665223722137, -0.15858518191849563, -0.0429665116565441, -0.003637505599658992, -0.008327632669859858, 0.07855526972284067, 0.05427892811582493, 0.014174227561078855, -0.0650106708366257, -0.09691118513088007, 0.3036135188929403, -0.08716780558895709, -0.21225877633012497, 0.18586862862888556, -0.06324628137274464, -0.18998180753759927, 0.08498751483649127, 0.08740708495337349, 0.16151521221470477, -0.15541433879354996, 0.1553379603463517, -0.04383477560286202, 0.07425989376714648, 0.15155080047005148, 0.017668567524889288, 0.022880486789534787, 0.15641382823823324, 0.15865707313016392, 0.18317923651410462, -0.00866652733373539, -0.047799002712787086, -0.2787108247988482, -0.16864688729227922, -0.185240684049343, 0.1186517825829727, -0.07387908818434799, -0.1849944536767921, 0.3317934599802343, 0.0975288140001957, 0.15910264185226675, 0.15845787108340648, 0.19243876813257585, 0.14471518230075434, 0.000214150571611835, 0.08797440518374874, 0.2833327418054218, 0.163047151369001, 0.1324434183162651, -0.1263382246808163, 0.005302544634566823, 0.20870519412135002] |
1,802.03303 | Multiple points of operator semistable L\'evy processes | We determine the Hausdorff dimension of $k$-multiple points for a symmetric
operator semistable L\'evy process $X=\{X(t), t\in\mathbb{R}_+\}$ in terms of
the eigenvalues of its stability exponent. We also give a necessary and
sufficient condition for the existence of $k$-multiple points. Our results
extend to all $k\geq2$ the recent work [23], where the set of double points $(k
= 2)$ was studied in the symmetric operator stable case.
| math.PR | we determine the hausdorff dimension of kmultiple points for a symmetric operator semistable levy process xxt tinmathbbr_ in terms of the eigenvalues of its stability exponent we also give a necessary and sufficient condition for the existence of kmultiple points our results extend to all kgeq2 the recent work 23 where the set of double points k 2 was studied in the symmetric operator stable case | [['we', 'determine', 'the', 'hausdorff', 'dimension', 'of', 'kmultiple', 'points', 'for', 'a', 'symmetric', 'operator', 'semistable', 'levy', 'process', 'xxt', 'tinmathbbr_', 'in', 'terms', 'of', 'the', 'eigenvalues', 'of', 'its', 'stability', 'exponent', 'we', 'also', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'existence', 'of', 'kmultiple', 'points', 'our', 'results', 'extend', 'to', 'all', 'kgeq2', 'the', 'recent', 'work', '23', 'where', 'the', 'set', 'of', 'double', 'points', 'k', '2', 'was', 'studied', 'in', 'the', 'symmetric', 'operator', 'stable', 'case']] | [-0.1696995815092867, 0.09917430880225518, -0.06559883434833451, 0.049652714681928264, -0.019890753309785698, -0.12373280708649845, 0.08715538067079967, 0.29420348474135, -0.22359353314845287, -0.16074963405051015, 0.13255338759203864, -0.27157077994762047, -0.1558611616351162, 0.1590992078523744, -0.07639163450309724, 0.087528791757491, 0.02574051758556655, 0.10047640256357915, -0.05868827518795363, -0.30593559467657044, 0.37202847692551033, -0.024963263464583593, 0.2155504239807752, 0.07674388267156301, 0.07758432098974784, 0.0029885174678356357, -0.006218742222920286, -0.02885023309764537, -0.21173860965240182, 0.07870620316966917, 0.24293656906846797, 0.05777310229005349, 0.2389643979117726, -0.3354635112213366, -0.14063531185048772, 0.23847335021039753, 0.10992317053376499, -0.0074152908760659175, -0.014490762739583399, -0.2543827454721781, 0.1838438596407121, -0.11562287600386437, -0.24524747135089428, -0.0656073889412889, 0.0979348120039724, 0.00644335774422595, -0.34342844962057745, 0.055848600409455794, 0.1472822961072917, 0.0788134616432768, -0.10240505786196356, -0.1337868347270132, -0.040038884370446656, 0.09480737146716847, -0.012569779516497598, -0.016901949293572794, 0.04831371692037492, -0.04857515027238564, -0.12955613396788426, 0.3207194052678956, -0.04146424068180336, -0.2149217753022006, 0.13533668800708698, -0.20382125348304259, -0.12119433165273884, 0.1279427333325712, 0.11982993375171315, 0.18829435702751984, -0.06718024941669269, 0.19073691647976043, -0.0982806668969605, 0.09297770875943542, 0.10505777929034649, 0.010021432556889275, 0.07481618832345262, 0.09181654717152317, 0.15792003791835724, 0.1527299566907018, -0.03292663011587027, -0.09251741450421061, -0.36521904881704936, -0.1668965814240051, -0.16750982124534802, 0.09200550151537314, -0.13433537615977306, -0.17955872767858885, 0.41758822226388886, 0.1026360356614036, 0.24445015780458396, 0.08655891609801487, 0.18843838194328727, 0.1249533655771467, -0.031979114042990135, 0.08749060560666928, 0.16650486999953334, 0.17481617313442807, 0.0697129278613085, -0.15618471857724767, -0.002667241537534265, 0.14847911814594586] |
1,802.03304 | A Lefschetz fibration on minimal symplectic fillings of a quotient
surface singularity | In this article, we construct a genus-$0$ or genus-$1$ positive allowable
Lefschetz fibration on any minimal symplectic filling of the link of non-cyclic
quotient surface singularities. As a byproduct, we also show that any minimal
symplectic filling of the link of quotient surface singularities can be
obtained from a sequence of rational blowdowns from its minimal resolution.
| math.GT math.SG | in this article we construct a genus0 or genus1 positive allowable lefschetz fibration on any minimal symplectic filling of the link of noncyclic quotient surface singularities as a byproduct we also show that any minimal symplectic filling of the link of quotient surface singularities can be obtained from a sequence of rational blowdowns from its minimal resolution | [['in', 'this', 'article', 'we', 'construct', 'a', 'genus0', 'or', 'genus1', 'positive', 'allowable', 'lefschetz', 'fibration', 'on', 'any', 'minimal', 'symplectic', 'filling', 'of', 'the', 'link', 'of', 'noncyclic', 'quotient', 'surface', 'singularities', 'as', 'a', 'byproduct', 'we', 'also', 'show', 'that', 'any', 'minimal', 'symplectic', 'filling', 'of', 'the', 'link', 'of', 'quotient', 'surface', 'singularities', 'can', 'be', 'obtained', 'from', 'a', 'sequence', 'of', 'rational', 'blowdowns', 'from', 'its', 'minimal', 'resolution']] | [-0.24653421239437243, 0.03355375680614982, -0.14249466636152774, 0.11850358435287744, -0.09977129830472302, -0.17399202891739837, 0.0641758215487036, 0.3159703149525612, -0.3314462470773019, -0.21165294821063677, 0.10884378431160656, -0.21894368640424913, -0.2149880573749869, 0.18061136007880824, -0.20960173025531204, -0.023147123104998876, 0.0919967089828692, 0.0818836768729645, -0.1771267696586029, -0.26581809127278494, 0.4573932041724523, -0.04887831572181823, 0.14589261778695672, 0.12858337860783203, 0.1654361811029447, -0.018765961694155345, 0.008366799307272263, 0.029570870885723514, -0.21945885432081955, 0.07629701642221526, 0.2779025075989857, 0.04909487147897221, 0.11977438486524318, -0.39464656838722395, -0.1842132826384745, 0.22289275031602174, 0.16327988279558586, 0.04446757125786685, -0.010305972869932782, -0.20508458203096924, 0.1208755616752202, -0.190876320696828, -0.1999467526186715, -0.05544183396717958, -0.06221156181734905, 0.034718268706152834, -0.1175374419738849, -0.03687172092695459, 0.09233748430811, 0.16424130919601834, -0.02960351612949907, -0.040812701722116845, -0.1488803904013414, 0.10876040194559385, -0.008707975086412932, 0.08480544187937324, 0.07444031978344642, -0.12367594317663788, -0.11223713334715157, 0.35768823074013517, -0.09450292502317512, -0.27248417341003295, 0.11265092063695192, -0.14706954253396312, -0.15493165195935912, 0.21898473503492905, 0.05831623966233772, 0.15107988932153635, 0.022037590151293238, 0.18621766860106667, -0.12994052656811841, 0.09973144447921138, 0.17087360875060162, -0.026654026168807035, 0.18208027501149396, 0.09340278272468008, 0.11551286167416133, 0.11657025705688029, -0.03697604304097854, 0.0035273885566806584, -0.40732051445203915, -0.25802416540682316, -0.16093888356791516, 0.23809827777573414, -0.12787871623183028, -0.2036372784590512, 0.43464783873212964, -0.012706343011048279, 0.2330190989009121, 0.15597375943080374, 0.2722758952724306, 0.037569605759671776, 0.042733221584440845, 0.012819283568349323, 0.09460595504201033, 0.12248972038689412, -0.11207408432669022, -0.16817182471583547, -0.05907360855653359, 0.22478841076882786] |
1,802.03305 | Maps on probability measures preserving certain distances --- a survey
and some new results | Borel probability measures living on metric spaces are fundamental
mathematical objects. There are several meaningful distance functions that make
the collection of the probability measures living on a certain space a metric
space. We are interested in the description of the structure of the isometries
of such metric spaces. We overview some of the recent results of the topic and
we also provide some new ones concerning the Wasserstein distance. More
specifically, we consider the space of all Borel probability measures on the
unit sphere of a Euclidean space endowed with the Wasserstein metric $W_p$ for
arbitrary $p \geq 1,$ and we show that the action of a Wasserstein isometry on
the set of the Dirac measures is induced by an isometry of the underlying unit
sphere.
| math.FA math-ph math.MG math.MP | borel probability measures living on metric spaces are fundamental mathematical objects there are several meaningful distance functions that make the collection of the probability measures living on a certain space a metric space we are interested in the description of the structure of the isometries of such metric spaces we overview some of the recent results of the topic and we also provide some new ones concerning the wasserstein distance more specifically we consider the space of all borel probability measures on the unit sphere of a euclidean space endowed with the wasserstein metric w_p for arbitrary p geq 1 and we show that the action of a wasserstein isometry on the set of the dirac measures is induced by an isometry of the underlying unit sphere | [['borel', 'probability', 'measures', 'living', 'on', 'metric', 'spaces', 'are', 'fundamental', 'mathematical', 'objects', 'there', 'are', 'several', 'meaningful', 'distance', 'functions', 'that', 'make', 'the', 'collection', 'of', 'the', 'probability', 'measures', 'living', 'on', 'a', 'certain', 'space', 'a', 'metric', 'space', 'we', 'are', 'interested', 'in', 'the', 'description', 'of', 'the', 'structure', 'of', 'the', 'isometries', 'of', 'such', 'metric', 'spaces', 'we', 'overview', 'some', 'of', 'the', 'recent', 'results', 'of', 'the', 'topic', 'and', 'we', 'also', 'provide', 'some', 'new', 'ones', 'concerning', 'the', 'wasserstein', 'distance', 'more', 'specifically', 'we', 'consider', 'the', 'space', 'of', 'all', 'borel', 'probability', 'measures', 'on', 'the', 'unit', 'sphere', 'of', 'a', 'euclidean', 'space', 'endowed', 'with', 'the', 'wasserstein', 'metric', 'w_p', 'for', 'arbitrary', 'p', 'geq', '1', 'and', 'we', 'show', 'that', 'the', 'action', 'of', 'a', 'wasserstein', 'isometry', 'on', 'the', 'set', 'of', 'the', 'dirac', 'measures', 'is', 'induced', 'by', 'an', 'isometry', 'of', 'the', 'underlying', 'unit', 'sphere']] | [-0.15203868535504947, 0.1137361118917612, -0.07173960662527581, 0.1216481242550713, -0.0579214636053098, -0.04903674976328227, 0.030517230976343623, 0.4074159576154248, -0.2671852365290145, -0.20509481730716905, 0.09344998377422971, -0.33000571981409754, -0.17771073003248203, 0.19903561256561927, -0.1370043051869088, 0.07227786729390931, 0.04754046392517062, 0.1361003273927999, -0.11654520462685096, -0.23911756262417852, 0.4614136582552125, 0.0006431620164708359, 0.2510944987962565, 0.03335699543914222, 0.15864095867677466, 0.003809892018802288, -0.056065379898613835, 0.04473590416976757, -0.19557829531641607, 0.19860318598638135, 0.18312207336618205, 0.1898754722893414, 0.2760794667882742, -0.36292162961436536, -0.22009851454984486, 0.17371334727325544, 0.03838931721099836, -0.011890341703757995, -0.031501380835433385, -0.34135534174696314, 0.058999909163181354, -0.11068961777408996, -0.10314202222122451, -0.08110465071948729, 0.04489146630595049, 0.015950871165841818, -0.21688306020200618, -0.012814169575682086, 0.0888216517531995, 0.05187353323851749, -0.11357683259498798, -0.0929240673509111, 0.0032076576310319928, 0.14518576295767713, 0.04789465789840828, 0.11144232368243374, 0.09619343972684244, -0.05351655968413578, -0.12460481314681558, 0.39483679164435687, -0.044910204002824354, -0.3118073710893083, 0.16839528233399542, -0.22218679362086682, -0.13228900637844299, 0.03340718263070884, 0.18802480931269136, 0.14443592128791208, -0.0926536971590423, 0.17696393406161612, -0.09289009855532153, 0.08020444665338815, 0.0646556060959211, 0.10275069815216689, 0.142011609592101, 0.13410884634716305, 0.14593530940735258, 0.1066460973513496, -0.04489798551997331, -0.10018671385478228, -0.3565485481700794, -0.2032927272797335, -0.18660127408307514, 0.08761923514511877, -0.19538757250452685, -0.1900980645913528, 0.3585843234286299, 0.06225430699226659, 0.23970852626531614, 0.12202822603285313, 0.21368145441093783, 0.043161015751460884, -0.008210319827684737, 0.06675163865470746, 0.1612768357745225, 0.11641175770127457, -0.021224460894549924, -0.12293871270133344, 0.01727160855882075, 0.1448360633501035] |
1,802.03306 | On the Potential Observation of False Deviations from General Relativity
in Gravitational Wave Observations from Binary Black Holes | Detections of gravitational waves emitted by binary black holes allow for
tests of General Relativity in the strong-field regime. In particular,
deviations from General Relativity can be observed by comparing incoming
signals to waveform templates that include parametrized deviations from General
Relativity. However, it is essential that the General Relativity sector of
these templates accounts for all predictable physics. Otherwise, missing
physics might be mimicked by the "beyond General Relativity" sector of the
templates, leading the analysis to report apparent deviations from General
Relativity. Current parametrized tests implement templates that omit physical
phenomena such as orbital eccentricity and higher-order modes. In this paper,
we show how the omission of higher modes can lead to false deviations from
General Relativity when these effects are strong enough. We study the extent of
these deviations as a function of the mass ratio and the orbital orientation.
We find that significant false deviations can arise when current tests are
performed on signals emitted by asymmetric binaries whose orbital angular
momentum is orthogonal to the line-of-sight. We estimate that the Advanced
LIGO-Virgo network operating at its design sensitivity can observe false
violations with a significance above $5 \sigma$ as often as once per year.
Similar results are expected for other tests of General Relativity that use
modified waveform models. Hence, we stress the necessity of accurate waveform
models that include physical effects such as higher-order modes to trust future
tests of General Relativity.
| gr-qc astro-ph.HE | detections of gravitational waves emitted by binary black holes allow for tests of general relativity in the strongfield regime in particular deviations from general relativity can be observed by comparing incoming signals to waveform templates that include parametrized deviations from general relativity however it is essential that the general relativity sector of these templates accounts for all predictable physics otherwise missing physics might be mimicked by the beyond general relativity sector of the templates leading the analysis to report apparent deviations from general relativity current parametrized tests implement templates that omit physical phenomena such as orbital eccentricity and higherorder modes in this paper we show how the omission of higher modes can lead to false deviations from general relativity when these effects are strong enough we study the extent of these deviations as a function of the mass ratio and the orbital orientation we find that significant false deviations can arise when current tests are performed on signals emitted by asymmetric binaries whose orbital angular momentum is orthogonal to the lineofsight we estimate that the advanced ligovirgo network operating at its design sensitivity can observe false violations with a significance above 5 sigma as often as once per year similar results are expected for other tests of general relativity that use modified waveform models hence we stress the necessity of accurate waveform models that include physical effects such as higherorder modes to trust future tests of general relativity | [['detections', 'of', 'gravitational', 'waves', 'emitted', 'by', 'binary', 'black', 'holes', 'allow', 'for', 'tests', 'of', 'general', 'relativity', 'in', 'the', 'strongfield', 'regime', 'in', 'particular', 'deviations', 'from', 'general', 'relativity', 'can', 'be', 'observed', 'by', 'comparing', 'incoming', 'signals', 'to', 'waveform', 'templates', 'that', 'include', 'parametrized', 'deviations', 'from', 'general', 'relativity', 'however', 'it', 'is', 'essential', 'that', 'the', 'general', 'relativity', 'sector', 'of', 'these', 'templates', 'accounts', 'for', 'all', 'predictable', 'physics', 'otherwise', 'missing', 'physics', 'might', 'be', 'mimicked', 'by', 'the', 'beyond', 'general', 'relativity', 'sector', 'of', 'the', 'templates', 'leading', 'the', 'analysis', 'to', 'report', 'apparent', 'deviations', 'from', 'general', 'relativity', 'current', 'parametrized', 'tests', 'implement', 'templates', 'that', 'omit', 'physical', 'phenomena', 'such', 'as', 'orbital', 'eccentricity', 'and', 'higherorder', 'modes', 'in', 'this', 'paper', 'we', 'show', 'how', 'the', 'omission', 'of', 'higher', 'modes', 'can', 'lead', 'to', 'false', 'deviations', 'from', 'general', 'relativity', 'when', 'these', 'effects', 'are', 'strong', 'enough', 'we', 'study', 'the', 'extent', 'of', 'these', 'deviations', 'as', 'a', 'function', 'of', 'the', 'mass', 'ratio', 'and', 'the', 'orbital', 'orientation', 'we', 'find', 'that', 'significant', 'false', 'deviations', 'can', 'arise', 'when', 'current', 'tests', 'are', 'performed', 'on', 'signals', 'emitted', 'by', 'asymmetric', 'binaries', 'whose', 'orbital', 'angular', 'momentum', 'is', 'orthogonal', 'to', 'the', 'lineofsight', 'we', 'estimate', 'that', 'the', 'advanced', 'ligovirgo', 'network', 'operating', 'at', 'its', 'design', 'sensitivity', 'can', 'observe', 'false', 'violations', 'with', 'a', 'significance', 'above', '5', 'sigma', 'as', 'often', 'as', 'once', 'per', 'year', 'similar', 'results', 'are', 'expected', 'for', 'other', 'tests', 'of', 'general', 'relativity', 'that', 'use', 'modified', 'waveform', 'models', 'hence', 'we', 'stress', 'the', 'necessity', 'of', 'accurate', 'waveform', 'models', 'that', 'include', 'physical', 'effects', 'such', 'as', 'higherorder', 'modes', 'to', 'trust', 'future', 'tests', 'of', 'general', 'relativity']] | [-0.11360232546502928, 0.12658533344178327, -0.07252531392429368, 0.151997141431706, -0.10815979796168276, -0.146693184079618, 0.020959968231579272, 0.3030907981872496, -0.20515169787118917, -0.3478283676408826, 0.07449277154484983, -0.27101242019474003, -0.14308130336038088, 0.23368018825671502, -0.045559705438546275, 0.05155945422901662, 0.08348638075550611, -0.03304289388098605, -0.08980631365679487, -0.1819807892193736, 0.2994743996977751, 0.11414983899952813, 0.20383880995390075, -0.01882096873048474, 0.03285207643717559, 0.005497610159296573, -0.023237357039333266, 0.05242478858411484, -0.10490122200925947, 0.057027559858519865, 0.27394490409388716, 0.1646967991353052, 0.2194522587805517, -0.4332059533922237, -0.23054347165672895, 0.09284613300271395, 0.09016561085366089, 0.1873907125398454, -0.054852587775965106, -0.28043067052876264, 0.06143249030212261, -0.19713412526947985, -0.15801412347281554, -0.08779624349754617, 0.02840380833147704, 0.011878446757523422, -0.26227115419450675, 0.1348424119417, 0.05838652668293847, -0.0032507983122427924, -0.006748828341883114, -0.11011954362894517, -0.0360869367023883, 0.08772870573775741, 0.12672317053456478, 0.00819562207183511, 0.1631358016278407, -0.09351604477993503, -0.1385823035793195, 0.44076878048416945, -0.08343963835808105, -0.21169679860624546, 0.16883107862875996, -0.2282589133540286, -0.13807758041892296, 0.12224132389205844, 0.2274084863323374, 0.11285644107055068, -0.13893124951353442, 0.040522956389624686, 0.04148114094815898, 0.18157616400887736, 0.10749268302392653, 0.07791766370064579, 0.3348930478506886, 0.07421302355281978, -0.0037192372515202823, 0.06390103875946042, -0.10724631213375657, -0.06460797807060871, -0.3555030032240066, -0.0749470267582175, -0.1301900027987465, 0.0633707622984745, -0.11352450022179958, -0.10344075132161379, 0.36674194005239724, 0.1818716940020031, 0.09065182042990991, 0.09043585944102936, 0.28439915614252326, 0.09821804024928696, 0.06989994391646362, 0.0360045711536297, 0.3708068941320692, 0.09338904445904832, 0.06195325007419564, -0.1806418660004866, 0.07592544930267046, -0.0248744001749271] |
1,802.03307 | Charge transport and electron-hole asymmetry in low-mobility
graphene/hexagonal boron nitride heterostructures | Graphene/hexagonal boron nitride (G/$h$-BN) heterostructures offer an
excellent platform for developing nanoelectronic devices and for exploring
correlated states in graphene under modulation by a periodic superlattice
potential. Here, we report on transport measurements of nearly
$0^{\circ}$-twisted G/$h$-BN heterostructures. The heterostructures
investigated are prepared by dry transfer and thermally annealing processes and
are in the low mobility regime (approximately
$3000~\mathrm{cm}^{2}\mathrm{V}^{-1}\mathrm{s}^{-1}$ at 1.9 K). The replica
Dirac spectra and Hofstadter butterfly spectra are observed on the hole
transport side, but not on the electron transport side, of the
heterostructures. We associate the observed electron-hole asymmetry to the
presences of a large difference between the opened gaps in the conduction and
valence bands and a strong enhancement in the interband contribution to the
conductivity on the electron transport side in the low-mobility G/$h$-BN
heterostructures. We also show that the gaps opened at the central Dirac point
and the hole-branch secondary Dirac point are large, suggesting the presence of
strong graphene-substrate interaction and electron-electron interaction in our
G/$h$-BN heterostructures. Our results provide additional helpful insight into
the transport mechanism in G/$h$-BN heterostructures.
| cond-mat.mes-hall cond-mat.mtrl-sci | graphenehexagonal boron nitride ghbn heterostructures offer an excellent platform for developing nanoelectronic devices and for exploring correlated states in graphene under modulation by a periodic superlattice potential here we report on transport measurements of nearly 0circtwisted ghbn heterostructures the heterostructures investigated are prepared by dry transfer and thermally annealing processes and are in the low mobility regime approximately 3000mathrmcm2mathrmv1mathrms1 at 19 k the replica dirac spectra and hofstadter butterfly spectra are observed on the hole transport side but not on the electron transport side of the heterostructures we associate the observed electronhole asymmetry to the presences of a large difference between the opened gaps in the conduction and valence bands and a strong enhancement in the interband contribution to the conductivity on the electron transport side in the lowmobility ghbn heterostructures we also show that the gaps opened at the central dirac point and the holebranch secondary dirac point are large suggesting the presence of strong graphenesubstrate interaction and electronelectron interaction in our ghbn heterostructures our results provide additional helpful insight into the transport mechanism in ghbn heterostructures | [['graphenehexagonal', 'boron', 'nitride', 'ghbn', 'heterostructures', 'offer', 'an', 'excellent', 'platform', 'for', 'developing', 'nanoelectronic', 'devices', 'and', 'for', 'exploring', 'correlated', 'states', 'in', 'graphene', 'under', 'modulation', 'by', 'a', 'periodic', 'superlattice', 'potential', 'here', 'we', 'report', 'on', 'transport', 'measurements', 'of', 'nearly', '0circtwisted', 'ghbn', 'heterostructures', 'the', 'heterostructures', 'investigated', 'are', 'prepared', 'by', 'dry', 'transfer', 'and', 'thermally', 'annealing', 'processes', 'and', 'are', 'in', 'the', 'low', 'mobility', 'regime', 'approximately', '3000mathrmcm2mathrmv1mathrms1', 'at', '19', 'k', 'the', 'replica', 'dirac', 'spectra', 'and', 'hofstadter', 'butterfly', 'spectra', 'are', 'observed', 'on', 'the', 'hole', 'transport', 'side', 'but', 'not', 'on', 'the', 'electron', 'transport', 'side', 'of', 'the', 'heterostructures', 'we', 'associate', 'the', 'observed', 'electronhole', 'asymmetry', 'to', 'the', 'presences', 'of', 'a', 'large', 'difference', 'between', 'the', 'opened', 'gaps', 'in', 'the', 'conduction', 'and', 'valence', 'bands', 'and', 'a', 'strong', 'enhancement', 'in', 'the', 'interband', 'contribution', 'to', 'the', 'conductivity', 'on', 'the', 'electron', 'transport', 'side', 'in', 'the', 'lowmobility', 'ghbn', 'heterostructures', 'we', 'also', 'show', 'that', 'the', 'gaps', 'opened', 'at', 'the', 'central', 'dirac', 'point', 'and', 'the', 'holebranch', 'secondary', 'dirac', 'point', 'are', 'large', 'suggesting', 'the', 'presence', 'of', 'strong', 'graphenesubstrate', 'interaction', 'and', 'electronelectron', 'interaction', 'in', 'our', 'ghbn', 'heterostructures', 'our', 'results', 'provide', 'additional', 'helpful', 'insight', 'into', 'the', 'transport', 'mechanism', 'in', 'ghbn', 'heterostructures']] | [-0.208013827150488, 0.16519105479528662, -0.04961111761862412, 0.03749821171430605, 0.009423421518877149, -0.1822735082597605, 0.09869074391600277, 0.4335151785186359, -0.27804797221773436, -0.3066765359875613, -0.0174794967226418, -0.3631324545719794, -0.15238379246954406, 0.220840968452394, 0.06440733385070677, 0.025384476089051793, 0.0142817612710808, -0.15872476959451368, -0.043801411279876315, -0.1847801990075303, 0.2879499776554959, 0.04967231173201331, 0.33334774914330667, 0.17894884183038293, 0.005934281200170517, 0.018331127746828966, 0.11143953257373401, -0.012169482012811516, -0.14587581363735289, 0.0997345061024784, 0.22657245250219213, -0.18617000196129083, 0.2001701695472002, -0.48243952002110224, -0.221122405230999, -0.05971201842916863, 0.1460263413616589, 0.11930170125461051, -0.16805926890511597, -0.26449985800577064, 0.06174903248303703, -0.12570133861811233, -0.07673088388908322, -0.058582005144895186, -0.029261386618350767, -0.015880267197000128, -0.21778811460161315, 0.07311779036968281, 0.03262312969991139, 0.05464913772153003, -0.10937803987787836, -0.15755401794000395, -0.09219518400994794, 0.08980474907106586, 0.011680799992755056, -0.028440115161772285, 0.16686060491151045, -0.1167262068231191, -0.11326267648488283, 0.37333980646516596, -0.060803833808749916, -0.08393603142883097, 0.19606418795484518, -0.21659976062764014, -0.050400818746004786, 0.12747445636694985, 0.15281304236767548, 0.06829583788556712, -0.15353818815733705, 0.07790288050143447, -0.015841477508324067, 0.12363743971933477, 0.053572962347950254, 0.12097748448806149, 0.31422498244193514, 0.1839919892472348, 0.05615294633699315, 0.09751326555785324, -0.11493205109345062, -0.017394647942855956, -0.20580530799792282, -0.18352653140468256, -0.21959830806723662, 0.08704410631617066, -0.04707614059892616, -0.19756601403600405, 0.4323839886300266, 0.14122553826243217, 0.17722061570999878, -0.08328814260927694, 0.23529675700568728, 0.1110325625123057, 0.07884360795474744, 0.05231797837253128, 0.2722131081530824, 0.1416055192904813, 0.1354031993422125, -0.28183981434841243, 0.05974486093968153, -0.039594197044415136] |
1,802.03308 | Efficient Time-Series Approximation with Linear Recurrent Neural Networks: Architecture Learning and Predictive Power | Recurrent neural networks are a powerful means to cope with time series. We show how autoregressive linear, i.e., linearly activated recurrent neural networks (LRNNs) can approximate any time-dependent function f(t). The approximation can effectively be learned by simply solving a linear equation system; no backpropagation or similar methods are needed. Furthermore, and this is the main contribution of this paper, the size of an LRNN can be reduced significantly in one step after inspecting the spectrum of the network transition matrix, i.e., its eigenvalues, by taking only the most relevant components. Therefore, in contrast to other approaches, we do not only learn network weights but also the network architecture. LRNNs have interesting properties: They end up in ellipse trajectories in the long run and allow the prediction of further values and compact representations of functions. We demonstrate this by several case studies, among them multiple superimposed oscillators (MSO), robotic soccer (RoboCup), and stock price prediction. LRNNs outperform the previous state-of-the-art for the MSO task with a minimal number of units. | cs.LG cs.NE | recurrent neural networks are a powerful means to cope with time series we show how autoregressive linear ie linearly activated recurrent neural networks lrnns can approximate any timedependent function ft the approximation can effectively be learned by simply solving a linear equation system no backpropagation or similar methods are needed furthermore and this is the main contribution of this paper the size of an lrnn can be reduced significantly in one step after inspecting the spectrum of the network transition matrix ie its eigenvalues by taking only the most relevant components therefore in contrast to other approaches we do not only learn network weights but also the network architecture lrnns have interesting properties they end up in ellipse trajectories in the long run and allow the prediction of further values and compact representations of functions we demonstrate this by several case studies among them multiple superimposed oscillators mso robotic soccer robocup and stock price prediction lrnns outperform the previous stateoftheart for the mso task with a minimal number of units | [['recurrent', 'neural', 'networks', 'are', 'a', 'powerful', 'means', 'to', 'cope', 'with', 'time', 'series', 'we', 'show', 'how', 'autoregressive', 'linear', 'ie', 'linearly', 'activated', 'recurrent', 'neural', 'networks', 'lrnns', 'can', 'approximate', 'any', 'timedependent', 'function', 'ft', 'the', 'approximation', 'can', 'effectively', 'be', 'learned', 'by', 'simply', 'solving', 'a', 'linear', 'equation', 'system', 'no', 'backpropagation', 'or', 'similar', 'methods', 'are', 'needed', 'furthermore', 'and', 'this', 'is', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'the', 'size', 'of', 'an', 'lrnn', 'can', 'be', 'reduced', 'significantly', 'in', 'one', 'step', 'after', 'inspecting', 'the', 'spectrum', 'of', 'the', 'network', 'transition', 'matrix', 'ie', 'its', 'eigenvalues', 'by', 'taking', 'only', 'the', 'most', 'relevant', 'components', 'therefore', 'in', 'contrast', 'to', 'other', 'approaches', 'we', 'do', 'not', 'only', 'learn', 'network', 'weights', 'but', 'also', 'the', 'network', 'architecture', 'lrnns', 'have', 'interesting', 'properties', 'they', 'end', 'up', 'in', 'ellipse', 'trajectories', 'in', 'the', 'long', 'run', 'and', 'allow', 'the', 'prediction', 'of', 'further', 'values', 'and', 'compact', 'representations', 'of', 'functions', 'we', 'demonstrate', 'this', 'by', 'several', 'case', 'studies', 'among', 'them', 'multiple', 'superimposed', 'oscillators', 'mso', 'robotic', 'soccer', 'robocup', 'and', 'stock', 'price', 'prediction', 'lrnns', 'outperform', 'the', 'previous', 'stateoftheart', 'for', 'the', 'mso', 'task', 'with', 'a', 'minimal', 'number', 'of', 'units']] | [-0.087524014156754, 0.06831828540698391, -0.06691389306883752, 0.06401617965969593, -0.09124331712755843, -0.18268911087521789, 0.02948778250031504, 0.4463605460016465, -0.3055401888142819, -0.289499349123385, 0.10007320149917398, -0.2704251890109312, -0.21666646997593123, 0.19020044422755294, -0.0685436056979199, 0.09771417072512961, 0.1069082617091522, 0.06422421288505725, -0.04904137767049534, -0.28856858621577364, 0.28170481131869485, 0.031405046104161435, 0.25294173358989186, -0.02063161436848607, 0.08932756887285243, -0.037711314425787186, -0.012773036491125822, 0.020146976972478248, -0.04218023239163759, 0.1287479260426632, 0.2762219474496617, 0.12365147080988838, 0.3123066626260465, -0.4700482146120107, -0.2307224758851105, 0.1551333359461939, 0.1538056260547959, 0.09495602391891667, 0.04180960338728051, -0.2839771497542777, 0.08701902773016347, -0.1821830097624492, -0.051875275862816525, -0.11902779565721794, -0.017052886933198518, 0.036876989324637774, -0.26090454951151876, 0.028276908178861974, 0.09029617649227513, 0.005972121146468986, -0.03913992073747864, -0.10042704352433932, 0.004841375699233727, 0.15797822769268377, 0.023669346249469463, 0.034596647684236426, 0.11598957868116583, -0.1502577554170709, -0.14207672684304637, 0.33156229018305355, -0.0809178909275835, -0.21908994720554387, 0.16207407953867897, -0.09553367429903362, -0.15621410804861308, 0.10206671948021157, 0.19001701801530355, 0.11408667645510837, -0.16524946314390176, 0.041208991830474176, -0.03677262601955138, 0.2019918116888296, 0.05228974737403308, -0.007545957108270707, 0.17592928981816275, 0.20574108711802042, 0.04189564489456239, 0.11941536498488858, -0.05030284710273218, -0.08701610009285164, -0.22958480784174926, -0.094955454663492, -0.17834090388837387, 0.00039465791973238533, -0.1294682079119492, -0.13543079880084472, 0.4353368184226152, 0.16543597907941104, 0.22138470834528906, 0.14392041314679843, 0.2995940212645298, 0.1223761018943565, 0.10690840123188214, 0.12382956142172206, 0.19716328503453784, 0.05410835833547736, 0.10832681893798131, -0.1821494833972669, 0.11115496515946673, 0.0577423897180596] |
1,802.03309 | Gender Disparities in Nobel Prize Winning Labs. A Look into Glass
Ceilings, Maternal Walls and Bottlenecks | In this study, headcounts of all personnel in Nobel Prize-winning labs were
collected and sorted by gender. These results are used to determine gender
representation of graduate students in elite institutions on the pipeline
towards higher academic positions. Larger gender disparities are seen in
physics and physical chemistry labs and are reduced in biologically focused
labs. These differences are greater in Nobel Prize-winning institutions when
compared to the USA and EU averages. The gender bias in hiring during the
transition between postdoctoral fellow and junior faculty seems to be the
bottleneck for women; exacerbated by family formation. Women who surpass this
hurdle achieve tenure at the same rate and do not perform any worse than men in
such fields. Reduced participation in mathematically intensive fields can also
be traced to propensities of girls preferences to deviate from them as early as
kindergarten. As such, gender disparity may not be due to recalcitrant
pernicious attitudes of individuals towards women. Accumulated advantages such
as societal expectation, asymmetric teaching efforts and acceptance of men to
enter certain fields, over decades, may put men in more favourable positions
while competing for placement in prestigious labs. However, these factors are
sensitive to cultural shifts and show generational effects indicating the
possibility of equality facilitated by sociocultural shifts in expectation for
young women.
| physics.ed-ph | in this study headcounts of all personnel in nobel prizewinning labs were collected and sorted by gender these results are used to determine gender representation of graduate students in elite institutions on the pipeline towards higher academic positions larger gender disparities are seen in physics and physical chemistry labs and are reduced in biologically focused labs these differences are greater in nobel prizewinning institutions when compared to the usa and eu averages the gender bias in hiring during the transition between postdoctoral fellow and junior faculty seems to be the bottleneck for women exacerbated by family formation women who surpass this hurdle achieve tenure at the same rate and do not perform any worse than men in such fields reduced participation in mathematically intensive fields can also be traced to propensities of girls preferences to deviate from them as early as kindergarten as such gender disparity may not be due to recalcitrant pernicious attitudes of individuals towards women accumulated advantages such as societal expectation asymmetric teaching efforts and acceptance of men to enter certain fields over decades may put men in more favourable positions while competing for placement in prestigious labs however these factors are sensitive to cultural shifts and show generational effects indicating the possibility of equality facilitated by sociocultural shifts in expectation for young women | [['in', 'this', 'study', 'headcounts', 'of', 'all', 'personnel', 'in', 'nobel', 'prizewinning', 'labs', 'were', 'collected', 'and', 'sorted', 'by', 'gender', 'these', 'results', 'are', 'used', 'to', 'determine', 'gender', 'representation', 'of', 'graduate', 'students', 'in', 'elite', 'institutions', 'on', 'the', 'pipeline', 'towards', 'higher', 'academic', 'positions', 'larger', 'gender', 'disparities', 'are', 'seen', 'in', 'physics', 'and', 'physical', 'chemistry', 'labs', 'and', 'are', 'reduced', 'in', 'biologically', 'focused', 'labs', 'these', 'differences', 'are', 'greater', 'in', 'nobel', 'prizewinning', 'institutions', 'when', 'compared', 'to', 'the', 'usa', 'and', 'eu', 'averages', 'the', 'gender', 'bias', 'in', 'hiring', 'during', 'the', 'transition', 'between', 'postdoctoral', 'fellow', 'and', 'junior', 'faculty', 'seems', 'to', 'be', 'the', 'bottleneck', 'for', 'women', 'exacerbated', 'by', 'family', 'formation', 'women', 'who', 'surpass', 'this', 'hurdle', 'achieve', 'tenure', 'at', 'the', 'same', 'rate', 'and', 'do', 'not', 'perform', 'any', 'worse', 'than', 'men', 'in', 'such', 'fields', 'reduced', 'participation', 'in', 'mathematically', 'intensive', 'fields', 'can', 'also', 'be', 'traced', 'to', 'propensities', 'of', 'girls', 'preferences', 'to', 'deviate', 'from', 'them', 'as', 'early', 'as', 'kindergarten', 'as', 'such', 'gender', 'disparity', 'may', 'not', 'be', 'due', 'to', 'recalcitrant', 'pernicious', 'attitudes', 'of', 'individuals', 'towards', 'women', 'accumulated', 'advantages', 'such', 'as', 'societal', 'expectation', 'asymmetric', 'teaching', 'efforts', 'and', 'acceptance', 'of', 'men', 'to', 'enter', 'certain', 'fields', 'over', 'decades', 'may', 'put', 'men', 'in', 'more', 'favourable', 'positions', 'while', 'competing', 'for', 'placement', 'in', 'prestigious', 'labs', 'however', 'these', 'factors', 'are', 'sensitive', 'to', 'cultural', 'shifts', 'and', 'show', 'generational', 'effects', 'indicating', 'the', 'possibility', 'of', 'equality', 'facilitated', 'by', 'sociocultural', 'shifts', 'in', 'expectation', 'for', 'young', 'women']] | [-0.007386539549366312, 0.16080325058687273, -0.04125790617264876, 0.14594886098940926, -0.13048599002003256, -0.15528836099137724, 0.10012684525227761, 0.42058424109213605, -0.19122242021990973, -0.3973442248426619, 0.05999463178213099, -0.3167720694672661, -0.11249627243442875, 0.17411618659550893, -0.15184462520976552, -0.05177578303307571, 0.04558357111764727, 0.017329937752543226, -0.010749646287877113, -0.3621374730244969, 0.24934092534520594, 0.07868340836096278, 0.3073493359670802, 0.0392215365362871, 0.01127087833797473, -0.03100277032892875, -0.0722638949669932, 0.020928152349639545, -0.06404396005759568, 0.10613809509770901, 0.41632577162386886, 0.18079116246102517, 0.4167652754975414, -0.423036880325526, -0.12020246924280568, 0.09987075575217777, 0.14704293625200754, 0.07693620886075897, -0.004287569213206384, -0.35109100001864135, 0.02174164147086062, -0.19432813915180439, -0.07645331901558503, -0.025029086548009352, 0.04679894097865111, 0.008038182281813567, -0.19756088783766176, 0.10891672117186654, -0.02687215833025726, 0.19667571142781526, -0.03807086471028419, -0.24568236486003217, -0.018546454435973254, 0.2286550743653303, 0.11574952460230431, 0.0017947541453866979, 0.17885266444904524, -0.216832339151383, -0.1614636727759649, 0.3824482610450812, 0.02521456256194883, -0.11479383171212652, 0.2001369048030702, -0.20969824203051826, -0.13697570572926285, 0.06534881300413636, 0.22594774853725405, 0.039259821684094344, -0.13983309504396016, -0.04651564213088056, 0.026707344466693164, 0.12128161742940494, 0.12653230498458637, -0.01611434680644716, 0.2306903955220521, 0.09259478022081398, 0.04614017064752126, 0.0455777334600161, 0.019319172574426006, -0.10186987756147843, -0.1753140202016328, -0.16511196376544562, -0.08253805342947426, 0.02051613304084404, -0.021093803723622975, -0.09182138558309008, 0.3266788653455916, 0.16958541620665024, 0.09042612793402643, 0.013495489501683213, 0.19621666161347767, 0.0256878005802045, 0.1288394860673213, 0.07067111249974307, 0.2344543041523408, 0.01190215357173993, 0.17022325431861207, -0.16443456324567604, 0.1888428933032426, -0.051308346240720885] |
1,802.0331 | FPGA Implementation of ECG feature extraction using Time domain analysis | An electrocardiogram (ECG) feature extraction system has been developed and
evaluated using Virtex-6 FPGA kit which belongs to Xilinx Ltd. In time domain,
Pan-Tompkins algorithm is used for QRS detection and it is followed by a
feature extractor block to extract ECG features. This whole system can be used
to detect cardiac arrhythmia. The completed algorithm was implemented on
Virtex-6(XC6VLX240-T) device and tested using hardware co-simulation in
Modelsim and simulink environment. The software generated ECG signals are
obtained from MIT-BIH arrhythmia Database [1]. The memory and time complexities
of the implemented design were recorded and feature extraction has been done.
We have achieved satisfactory results which is mainly due to parallel
implementation. Therefore accurate arrhythmia detection using hardware
implementation a viable approach.
| eess.SP cs.AR | an electrocardiogram ecg feature extraction system has been developed and evaluated using virtex6 fpga kit which belongs to xilinx ltd in time domain pantompkins algorithm is used for qrs detection and it is followed by a feature extractor block to extract ecg features this whole system can be used to detect cardiac arrhythmia the completed algorithm was implemented on virtex6xc6vlx240t device and tested using hardware cosimulation in modelsim and simulink environment the software generated ecg signals are obtained from mitbih arrhythmia database 1 the memory and time complexities of the implemented design were recorded and feature extraction has been done we have achieved satisfactory results which is mainly due to parallel implementation therefore accurate arrhythmia detection using hardware implementation a viable approach | [['an', 'electrocardiogram', 'ecg', 'feature', 'extraction', 'system', 'has', 'been', 'developed', 'and', 'evaluated', 'using', 'virtex6', 'fpga', 'kit', 'which', 'belongs', 'to', 'xilinx', 'ltd', 'in', 'time', 'domain', 'pantompkins', 'algorithm', 'is', 'used', 'for', 'qrs', 'detection', 'and', 'it', 'is', 'followed', 'by', 'a', 'feature', 'extractor', 'block', 'to', 'extract', 'ecg', 'features', 'this', 'whole', 'system', 'can', 'be', 'used', 'to', 'detect', 'cardiac', 'arrhythmia', 'the', 'completed', 'algorithm', 'was', 'implemented', 'on', 'virtex6xc6vlx240t', 'device', 'and', 'tested', 'using', 'hardware', 'cosimulation', 'in', 'modelsim', 'and', 'simulink', 'environment', 'the', 'software', 'generated', 'ecg', 'signals', 'are', 'obtained', 'from', 'mitbih', 'arrhythmia', 'database', '1', 'the', 'memory', 'and', 'time', 'complexities', 'of', 'the', 'implemented', 'design', 'were', 'recorded', 'and', 'feature', 'extraction', 'has', 'been', 'done', 'we', 'have', 'achieved', 'satisfactory', 'results', 'which', 'is', 'mainly', 'due', 'to', 'parallel', 'implementation', 'therefore', 'accurate', 'arrhythmia', 'detection', 'using', 'hardware', 'implementation', 'a', 'viable', 'approach']] | [-0.08937750669647357, -0.054624304989192754, -0.10167250989276605, 0.0029059383445807422, -0.06389932419988327, -0.24811329933193824, -0.03391174097778275, 0.431482433139657, -0.2031390226368482, -0.31213289162454505, 0.18533608707948587, -0.22261513270204886, -0.14854898205570255, 0.30592601114573575, -0.08403019043422925, 0.1276592101668939, 0.11960374120001992, 0.03130668714875355, 0.01479299623509481, -0.2566571641790991, 0.15650013136522223, 0.09819286812562496, 0.3518544182491799, 0.007111525498718644, 0.13934581786937392, -0.06150787063719084, -0.06429611309431493, -0.057726174336858095, 0.0027816549610482372, 0.09045074384193867, 0.3488919088015488, 0.21449205381795763, 0.22392690865090117, -0.4426136774476618, -0.17342512728743412, 0.05009052938742874, 0.13991396816757817, 0.08415744387893938, -0.0570151917616992, -0.39997406568145377, 0.16622403333118807, -0.20038312893981736, 0.003932720993179828, -0.11715038384136278, 0.0086837245306621, -0.05289273235248402, -0.2927459972212091, 0.007716180570423603, -0.002418311143992469, 0.11575431888146946, -0.04169847584950427, -0.11068679237699447, 0.043944545736303554, 0.160755803566038, -0.03523295541720775, 0.10247260239751389, 0.21042454633473728, -0.029031778012479966, -0.14548545588089232, 0.3220244854688644, -0.03966866190700481, -0.16055438675296804, 0.18021786073998858, 0.018099187060821958, -0.11052888980484568, 0.1414977328192132, 0.2082695809425786, 0.061288466200736975, -0.2371286195043164, 0.04850140956793136, 0.09805400683738602, 0.250353943851466, 0.08744658709280581, -0.06047500027343631, 0.12124528728891164, 0.26717354559029144, -0.09783382985236434, 0.17772499628578467, -0.16339878479484468, -0.003716668704873882, -0.18322088350590396, -0.1307640897739475, -0.22883599022510073, -0.05723259398364462, -0.004819382520751484, -0.1307502555117632, 0.45833639477690064, 0.20524830538779498, 0.07210302730478967, 0.021395258036985373, 0.3520024024415761, 0.06889208735277255, 0.1871036835790922, 0.07010944933863357, 0.16297052150281768, 0.00888513015427937, 0.1673490642841595, -0.1957704802994461, 0.12160867912461981, 0.06004714087272684] |
1,802.03311 | Terminologies for Reproducible Research | Reproducible research---by its many names---has come to be regarded as a key
concern across disciplines and stakeholder groups. Funding agencies and
journals, professional societies and even mass media are paying attention,
often focusing on the so-called "crisis" of reproducibility. One big problem
keeps coming up among those seeking to tackle the issue: different groups are
using terminologies in utter contradiction with each other. Looking at a broad
sample of publications in different fields, we can classify their terminology
via decision tree: they either, A---make no distinction between the words
reproduce and replicate, or B---use them distinctly. If B, then they are
commonly divided in two camps. In a spectrum of concerns that starts at a
minimum standard of "same data+same methods=same results," to "new data and/or
new methods in an independent study=same findings," group 1 calls the minimum
standard reproduce, while group 2 calls it replicate. This direct swap of the
two terms aggravates an already weighty issue. By attempting to inventory the
terminologies across disciplines, I hope that some patterns will emerge to help
us resolve the contradictions.
| cs.DL | reproducible researchby its many nameshas come to be regarded as a key concern across disciplines and stakeholder groups funding agencies and journals professional societies and even mass media are paying attention often focusing on the socalled crisis of reproducibility one big problem keeps coming up among those seeking to tackle the issue different groups are using terminologies in utter contradiction with each other looking at a broad sample of publications in different fields we can classify their terminology via decision tree they either amake no distinction between the words reproduce and replicate or buse them distinctly if b then they are commonly divided in two camps in a spectrum of concerns that starts at a minimum standard of same datasame methodssame results to new data andor new methods in an independent studysame findings group 1 calls the minimum standard reproduce while group 2 calls it replicate this direct swap of the two terms aggravates an already weighty issue by attempting to inventory the terminologies across disciplines i hope that some patterns will emerge to help us resolve the contradictions | [['reproducible', 'researchby', 'its', 'many', 'nameshas', 'come', 'to', 'be', 'regarded', 'as', 'a', 'key', 'concern', 'across', 'disciplines', 'and', 'stakeholder', 'groups', 'funding', 'agencies', 'and', 'journals', 'professional', 'societies', 'and', 'even', 'mass', 'media', 'are', 'paying', 'attention', 'often', 'focusing', 'on', 'the', 'socalled', 'crisis', 'of', 'reproducibility', 'one', 'big', 'problem', 'keeps', 'coming', 'up', 'among', 'those', 'seeking', 'to', 'tackle', 'the', 'issue', 'different', 'groups', 'are', 'using', 'terminologies', 'in', 'utter', 'contradiction', 'with', 'each', 'other', 'looking', 'at', 'a', 'broad', 'sample', 'of', 'publications', 'in', 'different', 'fields', 'we', 'can', 'classify', 'their', 'terminology', 'via', 'decision', 'tree', 'they', 'either', 'amake', 'no', 'distinction', 'between', 'the', 'words', 'reproduce', 'and', 'replicate', 'or', 'buse', 'them', 'distinctly', 'if', 'b', 'then', 'they', 'are', 'commonly', 'divided', 'in', 'two', 'camps', 'in', 'a', 'spectrum', 'of', 'concerns', 'that', 'starts', 'at', 'a', 'minimum', 'standard', 'of', 'same', 'datasame', 'methodssame', 'results', 'to', 'new', 'data', 'andor', 'new', 'methods', 'in', 'an', 'independent', 'studysame', 'findings', 'group', '1', 'calls', 'the', 'minimum', 'standard', 'reproduce', 'while', 'group', '2', 'calls', 'it', 'replicate', 'this', 'direct', 'swap', 'of', 'the', 'two', 'terms', 'aggravates', 'an', 'already', 'weighty', 'issue', 'by', 'attempting', 'to', 'inventory', 'the', 'terminologies', 'across', 'disciplines', 'i', 'hope', 'that', 'some', 'patterns', 'will', 'emerge', 'to', 'help', 'us', 'resolve', 'the', 'contradictions']] | [-0.07141764351332323, 0.10793498648223575, -0.07080519529640933, 0.12436832822092157, -0.1239360029663826, -0.16709991609893007, 0.0843710800373087, 0.38655945182524926, -0.28692394963901685, -0.34724653895535224, 0.11478878349547592, -0.32570294589019577, -0.09071270248496359, 0.19149786491126006, -0.12864556022000503, -0.020175974625310823, 0.051717245316730456, 0.017769428497621777, -0.018340922854410087, -0.2773398442538401, 0.32479012425655146, 0.008412085181657989, 0.2876250134266891, 0.019031467034637584, 0.01536715160880367, -0.027179973988626906, -0.10378945734879444, 0.024603698713532678, -0.08595051749306933, 0.12212893127724851, 0.3405775257259758, 0.18279790097783316, 0.3620185336754846, -0.4490262437071379, -0.1810389181512887, 0.13523614579660959, 0.12932060087487274, 0.08572454250826786, -0.007474374212459204, -0.2596250690857616, 0.051604042755644446, -0.17617175782993005, -0.10009121261483242, -0.056783436073496334, -0.008890957636166515, -0.0031515773348079596, -0.18173301356543137, 0.018127609141214047, 0.02530315929466611, 0.0741685593333849, -0.015121755524635358, -0.1384338275300651, 0.005084441261462911, 0.22837809100343356, 0.10871349358016011, 0.012685371013735071, 0.10931416103250288, -0.14458923947437521, -0.15506007760558602, 0.4177583971819867, 0.004319073285132302, -0.14082342771156503, 0.23274627865986586, -0.1299370752332592, -0.17623199058718161, 0.08431353935072834, 0.1480654047800745, 0.03583560206502073, -0.16784055599460992, 0.012880932065628663, -0.02247767580533131, 0.14775662878097567, 0.0971479965481541, 0.0005035029200707816, 0.2320313691619159, 0.11068800496841873, 0.04290275587908913, 0.06317881357316413, 0.01749889234688558, -0.09639876733151818, -0.23923438407259998, -0.1333985761335561, -0.11656730412370983, 0.003187029061952035, -0.05654882314642541, -0.1369705378250192, 0.3802533856232387, 0.16868525467317746, 0.18339190775941724, 0.018689282495202766, 0.25083041866175354, 0.026720845605505125, 0.10676654825300635, 0.06395755351233065, 0.18847795379448365, 0.05808975376117089, 0.12982023845566706, -0.1313687049046245, 0.08991348333764455, -0.01577346797795654] |
1,802.03312 | Semi-analytical computation of Laplacian Green functions in
three-dimensional domains with disconnected spherical boundaries | We apply the generalized method of separation of variables (GMSV) to solve
boundary value problems for the Laplace operator in three-dimensional domains
with disconnected spherical boundaries (i.e., an arbitrary configuration of
non-overlapping partially reactive spherical sinks or obstacles). We consider
both exterior and interior problems and all most common boundary conditions:
Dirichlet, Neumann, Robin, and conjugate one. Using the translational addition
theorems for solid harmonics to switch between the local spherical coordinates,
we obtain a semi-analytical expression of the Green function as a linear
combination of partial solutions whose coefficients are fixed by boundary
conditions. Although the numerical computation of the coefficients involves
series truncation and matrix inversion, the use of the solid harmonics as basis
functions naturally adapted to the intrinsic symmetries of the problem makes
the GMSV particularly efficient, especially for exterior problems. The obtained
Green function is the key ingredient to solve boundary value problems and to
determine various characteristics of stationary diffusion such as reaction
rate, escape probability, harmonic measure, residence time, and mean first
passage time, to name but a few. The relevant aspects of the numerical
implementation and potential applications in chemical physics, heat transfer,
electrostatics, and hydrodynamics are discussed.
| physics.comp-ph | we apply the generalized method of separation of variables gmsv to solve boundary value problems for the laplace operator in threedimensional domains with disconnected spherical boundaries ie an arbitrary configuration of nonoverlapping partially reactive spherical sinks or obstacles we consider both exterior and interior problems and all most common boundary conditions dirichlet neumann robin and conjugate one using the translational addition theorems for solid harmonics to switch between the local spherical coordinates we obtain a semianalytical expression of the green function as a linear combination of partial solutions whose coefficients are fixed by boundary conditions although the numerical computation of the coefficients involves series truncation and matrix inversion the use of the solid harmonics as basis functions naturally adapted to the intrinsic symmetries of the problem makes the gmsv particularly efficient especially for exterior problems the obtained green function is the key ingredient to solve boundary value problems and to determine various characteristics of stationary diffusion such as reaction rate escape probability harmonic measure residence time and mean first passage time to name but a few the relevant aspects of the numerical implementation and potential applications in chemical physics heat transfer electrostatics and hydrodynamics are discussed | [['we', 'apply', 'the', 'generalized', 'method', 'of', 'separation', 'of', 'variables', 'gmsv', 'to', 'solve', 'boundary', 'value', 'problems', 'for', 'the', 'laplace', 'operator', 'in', 'threedimensional', 'domains', 'with', 'disconnected', 'spherical', 'boundaries', 'ie', 'an', 'arbitrary', 'configuration', 'of', 'nonoverlapping', 'partially', 'reactive', 'spherical', 'sinks', 'or', 'obstacles', 'we', 'consider', 'both', 'exterior', 'and', 'interior', 'problems', 'and', 'all', 'most', 'common', 'boundary', 'conditions', 'dirichlet', 'neumann', 'robin', 'and', 'conjugate', 'one', 'using', 'the', 'translational', 'addition', 'theorems', 'for', 'solid', 'harmonics', 'to', 'switch', 'between', 'the', 'local', 'spherical', 'coordinates', 'we', 'obtain', 'a', 'semianalytical', 'expression', 'of', 'the', 'green', 'function', 'as', 'a', 'linear', 'combination', 'of', 'partial', 'solutions', 'whose', 'coefficients', 'are', 'fixed', 'by', 'boundary', 'conditions', 'although', 'the', 'numerical', 'computation', 'of', 'the', 'coefficients', 'involves', 'series', 'truncation', 'and', 'matrix', 'inversion', 'the', 'use', 'of', 'the', 'solid', 'harmonics', 'as', 'basis', 'functions', 'naturally', 'adapted', 'to', 'the', 'intrinsic', 'symmetries', 'of', 'the', 'problem', 'makes', 'the', 'gmsv', 'particularly', 'efficient', 'especially', 'for', 'exterior', 'problems', 'the', 'obtained', 'green', 'function', 'is', 'the', 'key', 'ingredient', 'to', 'solve', 'boundary', 'value', 'problems', 'and', 'to', 'determine', 'various', 'characteristics', 'of', 'stationary', 'diffusion', 'such', 'as', 'reaction', 'rate', 'escape', 'probability', 'harmonic', 'measure', 'residence', 'time', 'and', 'mean', 'first', 'passage', 'time', 'to', 'name', 'but', 'a', 'few', 'the', 'relevant', 'aspects', 'of', 'the', 'numerical', 'implementation', 'and', 'potential', 'applications', 'in', 'chemical', 'physics', 'heat', 'transfer', 'electrostatics', 'and', 'hydrodynamics', 'are', 'discussed']] | [-0.10593754280749376, 0.06780007127881803, -0.06194048326558134, 0.05755524891274221, -0.09745788938669982, -0.12381214576972914, 0.003467044633295273, 0.3341714143230371, -0.3007003137401106, -0.2473416626999839, 0.15900457968189363, -0.2380007729765826, -0.13136686490045632, 0.17908318703447715, -0.028458485448862453, 0.11348370530901533, 0.04453015172668752, 0.014889349704798388, -0.10358118078414807, -0.17254969250940605, 0.3365367976283388, -0.0013892219825980387, 0.2506991337547649, 0.05893223000184291, 0.1105606371978754, 0.005997825397311577, -0.03120509582293714, -0.003088183510972529, -0.13872269738574836, 0.1035638131499433, 0.2509220229088785, 0.06678125286968994, 0.2624262804664405, -0.4775600918872776, -0.22910318394044263, 0.0938233250825742, 0.1185896853757167, 0.08841581535359312, -0.03865824089913002, -0.22261967091602558, 0.033083659887779504, -0.11913497924652634, -0.19999708921653908, -0.055820066961744914, 0.03882572003070037, 0.0448351200896895, -0.3095261170861444, 0.11633765731572307, 0.03462212676258416, 0.025935316736909693, -0.1155445414728352, -0.13294866762827245, -0.012240049527240537, 0.13901456974491913, 0.024181226214360713, -0.018839161464563162, 0.12260362900774546, -0.11642969114354298, -0.08539752535788077, 0.38456921074872036, -0.020942969223940556, -0.2800999222922006, 0.20172378282081715, -0.13908866486911262, -0.08525704057312247, 0.11666886935400188, 0.17015162601411266, 0.17512463974500342, -0.15931916311715863, 0.09434576981406355, 0.0038042542434354523, 0.1145418037955022, 0.13250602807906664, -0.02841851119740809, 0.14952708021452538, 0.0815279075450606, 0.10962963237531712, 0.16193624683988414, -0.06022680924174243, -0.1545751873399036, -0.31727419433431053, -0.16180154939576488, -0.19758478662875786, 0.018953863743393282, -0.12029180408865855, -0.21440152932262543, 0.359785046133246, 0.09095476750921154, 0.17862772047210826, 0.035051733207869896, 0.28029986395148976, 0.15815109312498696, 0.022466254089151184, 0.06828726914221878, 0.15222585107656006, 0.1761956791243782, 0.09925346645260495, -0.24178267358291458, 0.022116505763046825, 0.13264617716717741] |
1,802.03313 | Of Mites and Men: Johannes Kepler on Stars and Size | In his 1606 De Stella Nova, Johannes Kepler attempted to answer Tycho Brahe's
argument that the Copernican heliocentric hypothesis required all the fixed
stars to dwarf the Sun, something Brahe found to be a great drawback of that
hypothesis. This paper includes a translation into English of Chapter 16 of De
Stella Nova, in which Kepler discusses this argument, along with brief outlines
of both Tycho's argument and Kepler's answer (which references snakes, mites,
men, and divine power, among other things).
| physics.hist-ph | in his 1606 de stella nova johannes kepler attempted to answer tycho brahes argument that the copernican heliocentric hypothesis required all the fixed stars to dwarf the sun something brahe found to be a great drawback of that hypothesis this paper includes a translation into english of chapter 16 of de stella nova in which kepler discusses this argument along with brief outlines of both tychos argument and keplers answer which references snakes mites men and divine power among other things | [['in', 'his', '1606', 'de', 'stella', 'nova', 'johannes', 'kepler', 'attempted', 'to', 'answer', 'tycho', 'brahes', 'argument', 'that', 'the', 'copernican', 'heliocentric', 'hypothesis', 'required', 'all', 'the', 'fixed', 'stars', 'to', 'dwarf', 'the', 'sun', 'something', 'brahe', 'found', 'to', 'be', 'a', 'great', 'drawback', 'of', 'that', 'hypothesis', 'this', 'paper', 'includes', 'a', 'translation', 'into', 'english', 'of', 'chapter', '16', 'of', 'de', 'stella', 'nova', 'in', 'which', 'kepler', 'discusses', 'this', 'argument', 'along', 'with', 'brief', 'outlines', 'of', 'both', 'tychos', 'argument', 'and', 'keplers', 'answer', 'which', 'references', 'snakes', 'mites', 'men', 'and', 'divine', 'power', 'among', 'other', 'things']] | [-0.05599907647680353, 0.07388886213762524, -0.14324416413297444, 0.1032248875801739, -0.21599333669794837, -0.16637327380616357, 0.08563183096415697, 0.2745657015453886, -0.17031366736800582, -0.3652864546963462, 0.04594824594778963, -0.315952538765599, -0.11797406416340375, 0.20587669936135228, -0.2088266155096116, -0.03341252883367332, 0.1588089962915322, -0.032755137286091474, 0.011709877013884208, -0.36402978416946197, 0.23455173426227252, 0.10180925188103208, 0.15483795061569522, -0.05561517757998871, 0.08380638007189573, -0.04049634225781501, -0.10268742975744384, -0.0809149712347138, -0.14029439069121577, 0.06986484259803906, 0.26200328052710786, 0.2371382145900969, 0.2757671935092888, -0.3457474665325365, -0.1756892264303234, 0.053598179941835966, 0.15542781103494357, 0.03813056509516397, -0.0069895266371284735, -0.3241005902764974, 0.05398127080205782, -0.22989019561834909, -0.22328969860380446, 0.07175960790733864, 0.10424657270634248, 0.011981341401459995, -0.12658622428590868, 0.022942370397360697, 0.13446045695677583, 0.16344955419822607, -0.1164923314275335, -0.14317978871123935, 0.023606278858848927, 0.06394386045163336, 0.1294274245581529, 0.1106210854795566, 0.03693370304334863, -0.03166714575670568, -0.06839554835064912, 0.41247173840249024, -0.04993099983735585, -0.017756244248170176, 0.18340799814078634, -0.15283219159845216, -0.22186104354396877, 0.05243813877143426, 0.08433147157933334, 0.07069829462762968, -0.18548232627986574, 0.03357508254128244, -0.030419103151624216, 0.16403094910223176, 0.1817786621970389, -0.05299938014237049, 0.2720009479901673, 0.07660200971144217, -0.02273600024205667, 0.005118606588372064, -0.1327906891381667, -0.08221681459151485, -0.26026849421086135, -0.20652477226771968, -0.11964862402327313, 0.10105913671388946, -0.03863004093628986, -0.11726058266459057, 0.3219728840078101, 0.16909675447005826, 0.1119866499700296, 0.025521784086631222, 0.2788946038732926, -0.026462876835814966, 0.03160846479995935, 0.10881197981444406, 0.2673626351227731, 0.11024276002160745, 0.18777360097378676, -0.1669333841663176, 0.04488784629552637, 0.09995929619734302] |
1,802.03314 | Luminescence of BaBrI and SrBrI single crystals doped with Eu2+ | The crystal growth procedure and luminescence properties of pure and
Eu$^{2+}$-doped BaBrI and SrBrI crystals are reported. Emission and excitation
spectra were recorded under ultraviolet and vacuum ultraviolet excitations. The
energy of the first Eu$^{2+}$ 4f-5d transition and SrBrI band gap are obtained.
The electronic structure calculations were performed within GW approximation as
implemented in the Vienna Ab Initio Simulation Package. The energy between
lowest Eu$^{2+}$ 5d state and the bottom of conduction band are found based on
luminescence quenching parameters. The vacuum referred binding energy diagram
of lanthanide levels was constructed using the chemical shift model.
| cond-mat.mtrl-sci | the crystal growth procedure and luminescence properties of pure and eu2doped babri and srbri crystals are reported emission and excitation spectra were recorded under ultraviolet and vacuum ultraviolet excitations the energy of the first eu2 4f5d transition and srbri band gap are obtained the electronic structure calculations were performed within gw approximation as implemented in the vienna ab initio simulation package the energy between lowest eu2 5d state and the bottom of conduction band are found based on luminescence quenching parameters the vacuum referred binding energy diagram of lanthanide levels was constructed using the chemical shift model | [['the', 'crystal', 'growth', 'procedure', 'and', 'luminescence', 'properties', 'of', 'pure', 'and', 'eu2doped', 'babri', 'and', 'srbri', 'crystals', 'are', 'reported', 'emission', 'and', 'excitation', 'spectra', 'were', 'recorded', 'under', 'ultraviolet', 'and', 'vacuum', 'ultraviolet', 'excitations', 'the', 'energy', 'of', 'the', 'first', 'eu2', '4f5d', 'transition', 'and', 'srbri', 'band', 'gap', 'are', 'obtained', 'the', 'electronic', 'structure', 'calculations', 'were', 'performed', 'within', 'gw', 'approximation', 'as', 'implemented', 'in', 'the', 'vienna', 'ab', 'initio', 'simulation', 'package', 'the', 'energy', 'between', 'lowest', 'eu2', '5d', 'state', 'and', 'the', 'bottom', 'of', 'conduction', 'band', 'are', 'found', 'based', 'on', 'luminescence', 'quenching', 'parameters', 'the', 'vacuum', 'referred', 'binding', 'energy', 'diagram', 'of', 'lanthanide', 'levels', 'was', 'constructed', 'using', 'the', 'chemical', 'shift', 'model']] | [-0.07143158292734718, 0.16868819048543995, -0.05050427029206556, 0.07048015126913905, 0.012108169556279578, -0.08295995501325802, 0.08519202199308797, 0.4740634960409729, -0.20540826153406438, -0.3515604971808956, -0.02432149615104092, -0.3332243149386758, -0.05838811053879599, 0.11140573479017203, 0.13120017755291166, 0.04715726973409665, 0.026872181176316946, -0.05224362863326802, -0.09037632659044206, -0.14158375101768353, 0.2627765279674427, 0.12416274035151334, 0.31652033913563543, 0.07255064554083994, -8.555436308713669e-07, -0.011642597930287903, 0.06448178457968096, -0.04329705902652696, -0.16377767883974964, 0.06770913291071105, 0.25075995584979577, -0.04647235310279784, 0.16526948741607447, -0.44305368639687276, -0.1892568143183722, -0.0356254181366394, 0.07677540274218042, 0.11676672542903652, -0.06885253663417547, -0.2743930555582839, 0.007042254757215368, -0.13455956386640033, -0.08531673849025305, -0.07579706805111702, -0.07902596604067862, 0.004979612625902519, -0.2184541913454094, 0.11542374941896885, -0.08125452952771546, 0.10924382393792992, -0.17702596223952763, -0.19634172771413355, -0.17536593339049278, 0.07666891580942939, 0.012872586686887401, 0.0142871652239998, 0.20560036235033197, -0.049559899159964727, -0.12288240061953981, 0.40021327395546946, -0.07073410208079409, 0.010916519122436009, 0.13133612790571011, -0.17548762470919718, -0.0749288873531499, 0.23006095706009644, 0.053027432870139626, 0.11871695312413763, -0.15091547437391165, 0.1487393444856044, 0.0777216317934638, 0.20975630785873595, 0.09410214955680707, 0.0998622064300357, 0.1756064604987648, 0.14531347433976988, -0.08462465901244828, 0.11218203408049142, -0.14302425115106707, -0.05457385179358832, -0.2510062936851953, -0.11739838801007321, -0.22131859901252182, 0.03334196082048831, 0.00815328736798813, -0.20444553610967828, 0.43050241210755513, 0.04138126541325386, 0.09745075831566244, -0.06443118433804905, 0.19762023137089738, 0.12105572587944985, 0.039833567513925756, 0.06704967664158408, 0.30857552698952084, 0.18080141129309035, 0.1060171109435961, -0.32513906768129325, 0.029490599946237782, 0.04110644491230871] |
1,802.03315 | BKT universality class in the presence of correlated disorder | The correct detection of the Berezinskii-Kosterlitz-Thouless (BKT) transition
in quasi-two-dimensional superconductors still remains a controversial issue.
Its main signatures, indeed, are often at odds with the theoretical
expectations. In a recent work\cite{me} we have shown that the presence of
spatially correlated disorder plays a key role in this sense being it the
reason underlying the experimentally-observed smearing of the universal
superfluid-density jump. In the present paper, we closely investigate the
effects of correlated disorder on the BKT transition, addressing specifically
the issue whether it changes or not the BKT universality class.
| cond-mat.supr-con cond-mat.dis-nn cond-mat.stat-mech cond-mat.str-el | the correct detection of the berezinskiikosterlitzthouless bkt transition in quasitwodimensional superconductors still remains a controversial issue its main signatures indeed are often at odds with the theoretical expectations in a recent workciteme we have shown that the presence of spatially correlated disorder plays a key role in this sense being it the reason underlying the experimentallyobserved smearing of the universal superfluiddensity jump in the present paper we closely investigate the effects of correlated disorder on the bkt transition addressing specifically the issue whether it changes or not the bkt universality class | [['the', 'correct', 'detection', 'of', 'the', 'berezinskiikosterlitzthouless', 'bkt', 'transition', 'in', 'quasitwodimensional', 'superconductors', 'still', 'remains', 'a', 'controversial', 'issue', 'its', 'main', 'signatures', 'indeed', 'are', 'often', 'at', 'odds', 'with', 'the', 'theoretical', 'expectations', 'in', 'a', 'recent', 'workciteme', 'we', 'have', 'shown', 'that', 'the', 'presence', 'of', 'spatially', 'correlated', 'disorder', 'plays', 'a', 'key', 'role', 'in', 'this', 'sense', 'being', 'it', 'the', 'reason', 'underlying', 'the', 'experimentallyobserved', 'smearing', 'of', 'the', 'universal', 'superfluiddensity', 'jump', 'in', 'the', 'present', 'paper', 'we', 'closely', 'investigate', 'the', 'effects', 'of', 'correlated', 'disorder', 'on', 'the', 'bkt', 'transition', 'addressing', 'specifically', 'the', 'issue', 'whether', 'it', 'changes', 'or', 'not', 'the', 'bkt', 'universality', 'class']] | [-0.15119720947695897, 0.18522502055081227, -0.06963147876198895, 0.1282148516568769, -0.027330156006953783, -0.18336975380726572, 0.06610362571793504, 0.33881242028857944, -0.24007724115831985, -0.24293964619023933, 0.07693264393084165, -0.2781027865906556, -0.20102258794164907, 0.10041098761010087, -0.04778627423931741, 0.05395382393293807, -0.03573283684543437, 0.006275345009958578, -0.08753031868125416, -0.23438696790900496, 0.3834450981683201, 0.06603503154797687, 0.3690538688174759, 0.12324061719183292, 0.0011321744415909052, -0.07053492650803593, 0.008222019925273747, 0.016187758748936985, -0.14504314665464335, 0.04113123491155824, 0.27558930889806815, -0.01291439641887943, 0.25990725060304004, -0.3463438901739816, -0.25572076360177665, 0.13348337449133396, 0.15941704034080936, 0.14703390298204289, -0.07196603935962129, -0.2737774331846999, 0.027508463772634665, -0.11525383543016182, -0.15638669926362733, -0.047341849313428004, 0.0055309655300031105, -0.045023485101086815, -0.1896084766679754, 0.14767409279528593, 0.11791344594934748, 0.08766390778020852, -0.014086204684442945, -0.04985309238028195, 0.037692111218348145, 0.11136932440050361, 0.07410832387912604, 0.05342259343920482, 0.11795497537694044, -0.1768730723583657, -0.09624978493536926, 0.3927603855936064, -0.02692670880092515, -0.11996392629937165, 0.20878746929164563, -0.20176708051262215, -0.2081272575745566, 0.11720436436848508, 0.09880507098536731, 0.07194789502148827, -0.11419730169388155, 0.04798853254049189, -0.03842996990101205, 0.1724180209566839, -0.039102161463557016, 0.06020370108696322, 0.2858900534454733, 0.20345847852424614, -0.007723793004535967, 0.12851278251037002, -0.09307386269534214, -0.14938942237964106, -0.2949228367043866, -0.1210122265232106, -0.19234674003803068, 0.02520110988229539, -0.00405723435105756, -0.23415991190090102, 0.37699095256005727, 0.2586013165716496, 0.21757304467416058, -0.015538365352484915, 0.22764062725214496, 0.10901645606985161, 0.0162025920374112, 0.047475911806234054, 0.2654913562298235, 0.13685467169206175, 0.12795695250129535, -0.28198142325919534, 0.19103712802882203, 0.024406496197399166] |
1,802.03316 | Parallelizing Workload Execution in Embedded and High-Performance
Heterogeneous Systems | In this paper, we introduce a software-defined framework that enables the
parallel utilization of all the programmable processing resources available in
heterogeneous system-on-chip (SoC) including FPGA-based hardware accelerators
and programmable CPUs. Two platforms with different architectures are
considered, and a single C/C++ source code is used in both of them for the CPU
and FPGA resources. Instead of simply using the hardware accelerator to offload
a task from the CPU, we propose a scheduler that dynamically distributes the
tasks among all the resources to fully exploit all computing devices while
minimizing load unbalance. The multi-architecture study compares an ARMV7 and
ARMV8 implementation with different number and type of CPU cores and also
different FPGA micro-architecture and size. We measure that both platforms
benefit from having the CPU cores assist FPGA execution at the same level of
energy requirements.
| cs.DC | in this paper we introduce a softwaredefined framework that enables the parallel utilization of all the programmable processing resources available in heterogeneous systemonchip soc including fpgabased hardware accelerators and programmable cpus two platforms with different architectures are considered and a single cc source code is used in both of them for the cpu and fpga resources instead of simply using the hardware accelerator to offload a task from the cpu we propose a scheduler that dynamically distributes the tasks among all the resources to fully exploit all computing devices while minimizing load unbalance the multiarchitecture study compares an armv7 and armv8 implementation with different number and type of cpu cores and also different fpga microarchitecture and size we measure that both platforms benefit from having the cpu cores assist fpga execution at the same level of energy requirements | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'softwaredefined', 'framework', 'that', 'enables', 'the', 'parallel', 'utilization', 'of', 'all', 'the', 'programmable', 'processing', 'resources', 'available', 'in', 'heterogeneous', 'systemonchip', 'soc', 'including', 'fpgabased', 'hardware', 'accelerators', 'and', 'programmable', 'cpus', 'two', 'platforms', 'with', 'different', 'architectures', 'are', 'considered', 'and', 'a', 'single', 'cc', 'source', 'code', 'is', 'used', 'in', 'both', 'of', 'them', 'for', 'the', 'cpu', 'and', 'fpga', 'resources', 'instead', 'of', 'simply', 'using', 'the', 'hardware', 'accelerator', 'to', 'offload', 'a', 'task', 'from', 'the', 'cpu', 'we', 'propose', 'a', 'scheduler', 'that', 'dynamically', 'distributes', 'the', 'tasks', 'among', 'all', 'the', 'resources', 'to', 'fully', 'exploit', 'all', 'computing', 'devices', 'while', 'minimizing', 'load', 'unbalance', 'the', 'multiarchitecture', 'study', 'compares', 'an', 'armv7', 'and', 'armv8', 'implementation', 'with', 'different', 'number', 'and', 'type', 'of', 'cpu', 'cores', 'and', 'also', 'different', 'fpga', 'microarchitecture', 'and', 'size', 'we', 'measure', 'that', 'both', 'platforms', 'benefit', 'from', 'having', 'the', 'cpu', 'cores', 'assist', 'fpga', 'execution', 'at', 'the', 'same', 'level', 'of', 'energy', 'requirements']] | [-0.2124965331469574, 0.03989538355030708, -0.015461053702653977, -0.020022293115986415, -0.07913022877539705, -0.2263200365170075, 0.05692169516106021, 0.4490324950294338, -0.26023009064586927, -0.39577601735996776, 0.07009058955285263, -0.206213084287452, -0.07347835202694591, 0.2583594428660878, -0.05203435577224451, 0.07279219469531392, 0.11362127903644947, -0.023480015065874497, -0.06801154029072963, -0.28382345940832754, 0.23418489589192734, 0.07980191898634181, 0.36196590471931184, 0.052612809243401254, 0.07381371304691925, -0.07644742319911012, 0.006560166395289728, -0.07116465258282902, 0.010831399740072148, 0.17677885186382616, 0.2894075006895773, 0.2159460074893695, 0.31700121741198056, -0.5332832036091246, -0.1083110307673006, 0.0630524343688612, 0.11415587059718414, 0.03134673611213365, -0.0315909031506655, -0.22478719823993742, 0.12398984363424952, -0.2651646709083206, -0.011616001857243255, -0.061744673157205984, -0.021568005496676822, 0.08432927606822786, -0.20591072334370908, -0.047372008267880156, -0.040815631285425355, 0.033190958222279146, -0.035200701679471015, -0.11050263239601016, 0.03916409983551198, 0.15201495336810547, -0.06950216077057386, 0.02535410624708688, 0.1924429312518315, -0.10852054779648944, -0.17878545139555949, 0.39940713979575754, 0.024467342547616875, -0.19776886121716594, 0.20039582052472027, 0.0018070329670678742, -0.1695591291993938, 0.04229127338162902, 0.24101847883033053, 0.03370189480823431, -0.1868027415480057, 0.07428305368763428, 0.06326439436932985, 0.22239656038718283, 0.05923351805222078, 0.07901838966934215, 0.1825688176522419, 0.24644346306793882, 0.05051441710904567, 0.20188621456061837, -0.0865496047077799, -0.09573758510791146, -0.23117979232181055, -0.18299238393117204, -0.19910414279931407, -0.042249852046997195, -0.0768387524665369, -0.12160621234215796, 0.3983937761997872, 0.18211213498627835, 0.09759468046768167, 0.13566931861720002, 0.4496612632035339, 0.004486585097101918, 0.22531096282139773, 0.24391084187451656, 0.08238721284403527, -0.023751530668827413, 0.20378003740023795, -0.2410448653535088, 0.01056088412364938, -0.061516105605248554] |
1,802.03317 | $p$-adic vanishing cycles as Frobenius-fixed points | Given a smooth formal scheme over the ring of integers of a
mixed-characteristic perfectoid field, we study its $p$-adic vanishing cycles
via de Rham--Witt and $q$-de Rham complexes.
| math.AG math.NT | given a smooth formal scheme over the ring of integers of a mixedcharacteristic perfectoid field we study its padic vanishing cycles via de rhamwitt and qde rham complexes | [['given', 'a', 'smooth', 'formal', 'scheme', 'over', 'the', 'ring', 'of', 'integers', 'of', 'a', 'mixedcharacteristic', 'perfectoid', 'field', 'we', 'study', 'its', 'padic', 'vanishing', 'cycles', 'via', 'de', 'rhamwitt', 'and', 'qde', 'rham', 'complexes']] | [-0.3700052409632398, -0.00857610531550433, -0.20724598178640008, 0.06340666148545486, -0.08570136312794473, -0.0811091707520453, -0.04917486145028046, 0.2606835937393563, -0.3340358625033072, -0.13229028920509986, 0.025928525503591766, -0.09578927183922913, -0.16086393874138594, 0.22361225639802537, -0.17376475854377663, -0.08918701604748744, -0.023155650589615107, 0.10016981891489454, -0.017029816866852343, -0.32570437378516154, 0.4603024282093559, 0.014497585062469755, 0.19510770140914246, -0.012292706008468355, 0.16923592033396875, 0.06416746311463482, 0.006371050707197615, -0.044906109147372524, -0.2246159670342292, 0.15180099751367898, 0.3724517743768437, 0.042204942288143296, 0.2339299784174987, -0.3883237559348345, -0.12928488132144725, 0.28437608999333214, 0.1000176627255444, 0.03726764641968267, -0.012268537023503865, -0.28584930912724565, 0.17584450236920798, -0.22258768962430103, -0.1610447888129524, -0.0864146427983152, 0.07408258836533475, 0.08343296297659565, -0.1922710939044399, -0.016283982998824546, 0.05332892183547041, 0.2562755521586431, -0.09908899678599223, -0.061927030029307516, -0.09089696194860153, -0.02013024062450443, -0.0753535636966782, 0.058829629336417257, 0.14075386685518815, -0.049173155666462014, -0.1378462006936648, 0.2903386750923736, -0.20403064335031168, -0.10063115108226027, 0.08228778090727117, -0.15938328605677402, -0.10803625992100153, 0.1852599580639175, -0.03038541443779, 0.29584330919065643, 0.10859076835082046, 0.31869115560506805, -0.04953410855627486, 0.07215282254453216, 0.20447445547740375, -0.023881747969426215, 0.17862547047635807, 0.024766139586323073, 0.057565865507058334, 0.06752890601222004, 0.05389659146645239, -0.1375123125367931, -0.3261721831347261, -0.28050278399937917, -0.10508089559152722, 0.16891359790627444, -0.16249042867431335, -0.2420309656964881, 0.40374147123280374, -0.0013850343114297306, 0.20147493172303907, 0.1495007508367832, 0.2710929449780711, 0.03370060232867088, 0.01218325157450246, -0.04421774065122008, -0.0009771063923835754, 0.3216923702109073, 0.04756294341807786, -0.1386122724922773, -0.1480350195363696, 0.2466444471584899] |
1,802.03318 | Nature vs. Nurture: The Role of Environmental Resources in Evolutionary
Deep Intelligence | Evolutionary deep intelligence synthesizes highly efficient deep neural
networks architectures over successive generations. Inspired by the nature
versus nurture debate, we propose a study to examine the role of external
factors on the network synthesis process by varying the availability of
simulated environmental resources. Experimental results were obtained for
networks synthesized via asexual evolutionary synthesis (1-parent) and sexual
evolutionary synthesis (2-parent, 3-parent, and 5-parent) using a 10% subset of
the MNIST dataset. Results show that a lower environmental factor model
resulted in a more gradual loss in performance accuracy and decrease in storage
size. This potentially allows significantly reduced storage size with minimal
to no drop in performance accuracy, and the best networks were synthesized
using the lowest environmental factor models.
| cs.NE cs.AI cs.CV | evolutionary deep intelligence synthesizes highly efficient deep neural networks architectures over successive generations inspired by the nature versus nurture debate we propose a study to examine the role of external factors on the network synthesis process by varying the availability of simulated environmental resources experimental results were obtained for networks synthesized via asexual evolutionary synthesis 1parent and sexual evolutionary synthesis 2parent 3parent and 5parent using a 10 subset of the mnist dataset results show that a lower environmental factor model resulted in a more gradual loss in performance accuracy and decrease in storage size this potentially allows significantly reduced storage size with minimal to no drop in performance accuracy and the best networks were synthesized using the lowest environmental factor models | [['evolutionary', 'deep', 'intelligence', 'synthesizes', 'highly', 'efficient', 'deep', 'neural', 'networks', 'architectures', 'over', 'successive', 'generations', 'inspired', 'by', 'the', 'nature', 'versus', 'nurture', 'debate', 'we', 'propose', 'a', 'study', 'to', 'examine', 'the', 'role', 'of', 'external', 'factors', 'on', 'the', 'network', 'synthesis', 'process', 'by', 'varying', 'the', 'availability', 'of', 'simulated', 'environmental', 'resources', 'experimental', 'results', 'were', 'obtained', 'for', 'networks', 'synthesized', 'via', 'asexual', 'evolutionary', 'synthesis', '1parent', 'and', 'sexual', 'evolutionary', 'synthesis', '2parent', '3parent', 'and', '5parent', 'using', 'a', '10', 'subset', 'of', 'the', 'mnist', 'dataset', 'results', 'show', 'that', 'a', 'lower', 'environmental', 'factor', 'model', 'resulted', 'in', 'a', 'more', 'gradual', 'loss', 'in', 'performance', 'accuracy', 'and', 'decrease', 'in', 'storage', 'size', 'this', 'potentially', 'allows', 'significantly', 'reduced', 'storage', 'size', 'with', 'minimal', 'to', 'no', 'drop', 'in', 'performance', 'accuracy', 'and', 'the', 'best', 'networks', 'were', 'synthesized', 'using', 'the', 'lowest', 'environmental', 'factor', 'models']] | [-0.0881943674151125, 0.06394067163077685, -0.01959271291191252, 0.04882941928124824, -0.027830579123085637, -0.12100259733235097, 0.11278675564238404, 0.44729457666269606, -0.243051179843899, -0.397135115809675, 0.07580092607432196, -0.1969529478632871, -0.18124053615710548, 0.1887927753970218, -0.10441628930310154, 0.050993260951378405, 0.1253181424859561, -0.051679047584756575, -0.0509772422329451, -0.307481366273366, 0.2628080526756871, 0.10303441814940949, 0.3557617129901281, -0.008358956217113087, 0.08620183147951706, -0.055043968885468364, -0.03069672896924755, -0.013584580918192927, -0.07428959935425201, 0.1555228436795565, 0.23292039296705833, 0.19839746919739196, 0.31444311385146445, -0.46178592891137826, -0.273412716232686, 0.10801296006951831, 0.12579927101838762, 0.10251092845494421, -0.09438881118800273, -0.2633857950528399, 0.09012535904757042, -0.19319842049541572, -0.039229329404795274, -0.08257941168715031, 0.00914347896941452, 0.0024939513562294915, -0.2592299076147441, 0.05157388695993294, 0.007730212086477341, 0.10775750238074261, -0.08526593886970535, -0.1883433441607616, -0.01937930256478552, 0.14480798549822763, -0.015769582950464316, 0.029901747808704138, 0.19711029338929006, -0.1951746961965552, -0.14646805402560112, 0.32268436316353005, -0.08707325463780226, -0.1495091540989681, 0.21817391867247912, -0.04178680622806916, -0.1301219592539546, 0.1265510349956333, 0.2529021775525095, 0.07220243993732664, -0.1796908839327148, 0.00427180031935374, 0.02670308030170635, 0.23853589340837467, 0.05772518678210103, 0.0059394404266236555, 0.15429690315459782, 0.30532375988988286, -0.01877149631285196, 0.17563434866153532, -0.08568931880215995, -0.10766289138601312, -0.13451985111778492, -0.07651109728389062, -0.10858924157567258, 0.05679734368633447, -0.12246516011764781, -0.10028580811798063, 0.39021785609408194, 0.17202087859503734, 0.20193929889868212, 0.10893313473679571, 0.29894642817636585, 0.02305963122421223, 0.11501294594958551, 0.07700826583477931, 0.19477928861673188, 0.05711861351966603, 0.11040542146258661, -0.25711514791234946, 0.15859055675518435, -0.019283740383246515] |
1,802.03319 | Predicting Audio Advertisement Quality | Online audio advertising is a particular form of advertising used abundantly
in online music streaming services. In these platforms, which tend to host tens
of thousands of unique audio advertisements (ads), providing high quality ads
ensures a better user experience and results in longer user engagement.
Therefore, the automatic assessment of these ads is an important step toward
audio ads ranking and better audio ads creation. In this paper we propose one
way to measure the quality of the audio ads using a proxy metric called Long
Click Rate (LCR), which is defined by the amount of time a user engages with
the follow-up display ad (that is shown while the audio ad is playing) divided
by the impressions. We later focus on predicting the audio ad quality using
only acoustic features such as harmony, rhythm, and timbre of the audio,
extracted from the raw waveform. We discuss how the characteristics of the
sound can be connected to concepts such as the clarity of the audio ad message,
its trustworthiness, etc. Finally, we propose a new deep learning model for
audio ad quality prediction, which outperforms the other discussed models
trained on hand-crafted features. To the best of our knowledge, this is the
first large-scale audio ad quality prediction study.
| stat.ML cs.SD eess.AS | online audio advertising is a particular form of advertising used abundantly in online music streaming services in these platforms which tend to host tens of thousands of unique audio advertisements ads providing high quality ads ensures a better user experience and results in longer user engagement therefore the automatic assessment of these ads is an important step toward audio ads ranking and better audio ads creation in this paper we propose one way to measure the quality of the audio ads using a proxy metric called long click rate lcr which is defined by the amount of time a user engages with the followup display ad that is shown while the audio ad is playing divided by the impressions we later focus on predicting the audio ad quality using only acoustic features such as harmony rhythm and timbre of the audio extracted from the raw waveform we discuss how the characteristics of the sound can be connected to concepts such as the clarity of the audio ad message its trustworthiness etc finally we propose a new deep learning model for audio ad quality prediction which outperforms the other discussed models trained on handcrafted features to the best of our knowledge this is the first largescale audio ad quality prediction study | [['online', 'audio', 'advertising', 'is', 'a', 'particular', 'form', 'of', 'advertising', 'used', 'abundantly', 'in', 'online', 'music', 'streaming', 'services', 'in', 'these', 'platforms', 'which', 'tend', 'to', 'host', 'tens', 'of', 'thousands', 'of', 'unique', 'audio', 'advertisements', 'ads', 'providing', 'high', 'quality', 'ads', 'ensures', 'a', 'better', 'user', 'experience', 'and', 'results', 'in', 'longer', 'user', 'engagement', 'therefore', 'the', 'automatic', 'assessment', 'of', 'these', 'ads', 'is', 'an', 'important', 'step', 'toward', 'audio', 'ads', 'ranking', 'and', 'better', 'audio', 'ads', 'creation', 'in', 'this', 'paper', 'we', 'propose', 'one', 'way', 'to', 'measure', 'the', 'quality', 'of', 'the', 'audio', 'ads', 'using', 'a', 'proxy', 'metric', 'called', 'long', 'click', 'rate', 'lcr', 'which', 'is', 'defined', 'by', 'the', 'amount', 'of', 'time', 'a', 'user', 'engages', 'with', 'the', 'followup', 'display', 'ad', 'that', 'is', 'shown', 'while', 'the', 'audio', 'ad', 'is', 'playing', 'divided', 'by', 'the', 'impressions', 'we', 'later', 'focus', 'on', 'predicting', 'the', 'audio', 'ad', 'quality', 'using', 'only', 'acoustic', 'features', 'such', 'as', 'harmony', 'rhythm', 'and', 'timbre', 'of', 'the', 'audio', 'extracted', 'from', 'the', 'raw', 'waveform', 'we', 'discuss', 'how', 'the', 'characteristics', 'of', 'the', 'sound', 'can', 'be', 'connected', 'to', 'concepts', 'such', 'as', 'the', 'clarity', 'of', 'the', 'audio', 'ad', 'message', 'its', 'trustworthiness', 'etc', 'finally', 'we', 'propose', 'a', 'new', 'deep', 'learning', 'model', 'for', 'audio', 'ad', 'quality', 'prediction', 'which', 'outperforms', 'the', 'other', 'discussed', 'models', 'trained', 'on', 'handcrafted', 'features', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'largescale', 'audio', 'ad', 'quality', 'prediction', 'study']] | [-0.10112557609321639, 0.03388511463064268, -0.05893846595704201, 0.08030478133642603, -0.19127154374672545, -0.15928989408892535, 0.04631762003049343, 0.43766846918013125, -0.22028680870647632, -0.32607411359259414, 0.10309551934284779, -0.3203903843834442, -0.18774805997963995, 0.18633909841411792, -0.1213588937114331, 0.05484967809863433, 0.07371535825964418, 0.14248642260652214, -0.018113558135172795, -0.2722483239402728, 0.281958489683235, 0.08745093910963209, 0.3659777324192137, 0.0160122846940621, 0.08567776739641669, -0.004321037592100245, -0.09851249838414203, -0.06823780316183166, -0.07725437828786588, 0.15582801869937352, 0.3697590990742659, 0.23195395637747077, 0.32602565895233837, -0.4012623337540953, -0.21324595319816753, 0.0593214828631885, 0.1676675398789701, 0.06745230730323654, -0.08508243621326983, -0.3615497115689019, 0.11543304860769284, -0.20212364470852273, 0.0319029287346417, -0.06520848876042735, -0.01306984213047794, 0.006924808435308348, -0.25438546252858246, 0.031523164695993595, 0.04056076606779936, 0.06705212649623198, -0.07126667958218605, -0.044728358456909305, 0.00633970611739815, 0.22749707818341752, 0.09475654616807809, 0.03895335834850335, 0.15138228428771808, -0.18370053304381492, -0.1203046424713518, 0.411094960701164, -0.08498495738382363, -0.18543731814438832, 0.1794160993503673, -0.021942998464441015, -0.08775743393981386, 0.08471071722673341, 0.23880299732000346, 0.10631163680061166, -0.1778505233116448, -0.04824956471316649, -0.00880151460878551, 0.2359906615378956, 0.09977757614299966, 0.053048660402141866, 0.20447042946138286, 0.23864284473183078, -0.0007357510305675013, 0.1365180009097371, -0.05923362151453537, -0.007212902295231331, -0.21060665487360286, -0.15016659846573713, -0.1661765349496688, 0.017911808072988478, -0.136707830794746, -0.16109227520521796, 0.43057642490270415, 0.19713203733720416, 0.17644744074592988, 0.05301221704631601, 0.35982079063320443, 0.02668134193545917, 0.08363957883446432, 0.08125345822024559, 0.17694908371638685, -0.11172381426385115, 0.22204859135339836, -0.14453733575508176, 0.11447062833412062, 0.06818111066240817] |
1,802.0332 | Highly reproducible superconductivity in potassium-doped
triphenylbismuth | Using a new two-step synthesis method - ultrasound treatment and low
temperature annealing, we explore superconductivity in potassium-doped
triphenylbismuth, which is composed of one bismuth atom and three phenyl rings.
The combination of dc and ac magnetic measurements reveals that one hundred
percent of synthesized samples exhibit superconductivity at 3.5 K and/or 7.2 K
at ambient pressure. The magnetization hysteresis loops provide a strong
evidence of type-II superconductor, with the upper critical magnetic field up
to 1.0 Tesla. Both calculated electronic structure and measured Raman spectra
indicate that superconductivity is realized by transferring electron from
potassium to carbon atom. Our study opens an encouraging window for the search
of organic superconductors in organometallic molecules.
| cond-mat.supr-con | using a new twostep synthesis method ultrasound treatment and low temperature annealing we explore superconductivity in potassiumdoped triphenylbismuth which is composed of one bismuth atom and three phenyl rings the combination of dc and ac magnetic measurements reveals that one hundred percent of synthesized samples exhibit superconductivity at 35 k andor 72 k at ambient pressure the magnetization hysteresis loops provide a strong evidence of typeii superconductor with the upper critical magnetic field up to 10 tesla both calculated electronic structure and measured raman spectra indicate that superconductivity is realized by transferring electron from potassium to carbon atom our study opens an encouraging window for the search of organic superconductors in organometallic molecules | [['using', 'a', 'new', 'twostep', 'synthesis', 'method', 'ultrasound', 'treatment', 'and', 'low', 'temperature', 'annealing', 'we', 'explore', 'superconductivity', 'in', 'potassiumdoped', 'triphenylbismuth', 'which', 'is', 'composed', 'of', 'one', 'bismuth', 'atom', 'and', 'three', 'phenyl', 'rings', 'the', 'combination', 'of', 'dc', 'and', 'ac', 'magnetic', 'measurements', 'reveals', 'that', 'one', 'hundred', 'percent', 'of', 'synthesized', 'samples', 'exhibit', 'superconductivity', 'at', '35', 'k', 'andor', '72', 'k', 'at', 'ambient', 'pressure', 'the', 'magnetization', 'hysteresis', 'loops', 'provide', 'a', 'strong', 'evidence', 'of', 'typeii', 'superconductor', 'with', 'the', 'upper', 'critical', 'magnetic', 'field', 'up', 'to', '10', 'tesla', 'both', 'calculated', 'electronic', 'structure', 'and', 'measured', 'raman', 'spectra', 'indicate', 'that', 'superconductivity', 'is', 'realized', 'by', 'transferring', 'electron', 'from', 'potassium', 'to', 'carbon', 'atom', 'our', 'study', 'opens', 'an', 'encouraging', 'window', 'for', 'the', 'search', 'of', 'organic', 'superconductors', 'in', 'organometallic', 'molecules']] | [-0.15133589262976394, 0.20460983795588358, 0.01456734215857328, -0.027794408173316958, -0.008325177953728209, -0.19483286701974326, 0.15400681777932082, 0.4236746517292756, -0.21458194456811594, -0.34985828697348814, -0.008161605529104625, -0.3313163299046989, -0.04800550341626929, 0.221436040939547, 0.09135129061594073, -0.0048762869846541435, -0.023466870471436, -0.03812905927121132, -0.09443777708552911, -0.22800088827248796, 0.2479805759628237, 0.024856175187908645, 0.33095288719050586, 0.08504130976299555, 0.07028533904979538, -0.05941262020704536, 0.11556148909481376, 0.01829909408115782, -0.11775182060812638, 0.07274180227666095, 0.2701201620490922, -0.0760185388291055, 0.18369068672473077, -0.44679403331662926, -0.23838144367826836, -0.011537761419146721, 0.10077757060623428, 0.12476667683118389, -0.14313949742687068, -0.24696917069377378, 0.09302665634459117, -0.08740242922379236, -0.10009377342482496, -0.11799406888894737, -0.043933327046813374, -0.03993211434863042, -0.24571219432099106, 0.07206615137485121, 0.013412097082826742, 0.18913272265776218, -0.13283188742103189, -0.1715028180977762, -0.024461723978415, -0.014828068071178027, 0.012545515429727467, 0.06674409065038032, 0.2290414872612538, -0.07724610457080416, -0.10969020141055807, 0.3360189892451412, -0.10480015005409118, 0.0398050819598471, 0.16572895894725143, -0.19211164590420335, -0.08970293352363765, 0.22451452416966536, 0.1041603711569873, 0.11555320714666907, -0.16011394725865102, 0.015561626455174908, -0.026171372953935394, 0.19943685153391147, 0.09493239692112963, 0.050599587541780365, 0.2479635167401284, 0.22755049885745393, -0.007182237579919664, 0.1792938343455067, -0.15748799897015228, 0.027734323495159124, -0.18976811077612052, -0.20330126751053154, -0.15597342212900653, 0.0810987333284824, -0.06844154831898257, -0.16646788936746557, 0.3726128838731841, 0.14135335637755425, 0.1830468075765696, -0.11281886710431925, 0.24082847162675794, 0.05196580760197581, 0.11238133704838608, 0.03169294828590604, 0.22382917706688335, 0.21467156309310148, 0.11555815244927155, -0.3044297400296533, 0.05874448531540111, -0.019819474932903956] |
1,802.03321 | Opacity of nondeterministic transition systems: A (bi)simulation
relation approach | In this paper, we propose several opacity-preserving (bi)simulation relations
for general nondeterministic transition systems (NTS) in terms of initial-state
opacity, current-state opacity, K-step opacity, and infinite-step opacity. We
also show how one can leverage quotient construction to compute such relations.
In addition, we use a two-way observer method to verify opacity of
nondeterministic finite transition systems (NFTSs). As a result, although the
verification of opacity for infinite NTSs is generally undecidable, if one can
find such an opacity-preserving relation from an infinite NTS to an NFTS, the
(lack of) opacity of the NTS can be easily verified over the NFTS which is
decidable.
| cs.LO math.OC | in this paper we propose several opacitypreserving bisimulation relations for general nondeterministic transition systems nts in terms of initialstate opacity currentstate opacity kstep opacity and infinitestep opacity we also show how one can leverage quotient construction to compute such relations in addition we use a twoway observer method to verify opacity of nondeterministic finite transition systems nftss as a result although the verification of opacity for infinite ntss is generally undecidable if one can find such an opacitypreserving relation from an infinite nts to an nfts the lack of opacity of the nts can be easily verified over the nfts which is decidable | [['in', 'this', 'paper', 'we', 'propose', 'several', 'opacitypreserving', 'bisimulation', 'relations', 'for', 'general', 'nondeterministic', 'transition', 'systems', 'nts', 'in', 'terms', 'of', 'initialstate', 'opacity', 'currentstate', 'opacity', 'kstep', 'opacity', 'and', 'infinitestep', 'opacity', 'we', 'also', 'show', 'how', 'one', 'can', 'leverage', 'quotient', 'construction', 'to', 'compute', 'such', 'relations', 'in', 'addition', 'we', 'use', 'a', 'twoway', 'observer', 'method', 'to', 'verify', 'opacity', 'of', 'nondeterministic', 'finite', 'transition', 'systems', 'nftss', 'as', 'a', 'result', 'although', 'the', 'verification', 'of', 'opacity', 'for', 'infinite', 'ntss', 'is', 'generally', 'undecidable', 'if', 'one', 'can', 'find', 'such', 'an', 'opacitypreserving', 'relation', 'from', 'an', 'infinite', 'nts', 'to', 'an', 'nfts', 'the', 'lack', 'of', 'opacity', 'of', 'the', 'nts', 'can', 'be', 'easily', 'verified', 'over', 'the', 'nfts', 'which', 'is', 'decidable']] | [-0.08206483963760547, 0.14802416728736717, -0.0805679543595761, 0.11882772166864015, -0.08174603497609496, -0.10381987729109823, 0.03462998435948975, 0.4086087385937571, -0.31510100048035383, -0.2637592427432537, 0.09687326242798008, -0.23353685550391673, -0.09233345093380194, 0.20175711373332889, -0.09498273947276176, 0.05038341369479895, 0.017918729567318225, -0.012619496434926986, -0.0491236724704504, -0.2128601571172476, 0.3359733591601253, 0.03766505032312125, 0.22151604969985783, 0.11088102648034692, 0.03139106053393334, -0.023103888025507332, 0.0008227668702602386, 0.02889424469321966, -0.1117433578427881, 0.06433035174384713, 0.31806627158075573, 0.14374462863430382, 0.2127716929698363, -0.3781377345509827, -0.17746884155756562, 0.12168040813528933, 0.17778337153838947, 0.13018121734610758, -0.016714861961081625, -0.2275592140108347, 0.057744154552929104, -0.2532270273100585, -0.10707076564431191, -0.0699495639000088, 0.04413124467711896, -0.02904101529158652, -0.2605204342864454, 0.007806744249246549, 0.12811651412397623, 0.09733288659714162, -0.029177594631910324, -0.05148282691254281, -0.018986748802708463, 0.07344476250931621, -0.032342854333110155, -0.041124077262356874, 0.0682681858446449, -0.058359055852051825, -0.1370022331830114, 0.41900461046025156, -0.09494209782220424, -0.1523175418493338, 0.18934780814684926, -0.10130585020058788, -0.1698674952564761, 0.10937455798499286, 0.15976740375161172, 0.10827430695295334, -0.12470612615346909, 0.0723350360331824, -0.04625128023326397, 0.23783724600449205, 0.09057950831949711, 0.037414392259088346, 0.18001566121238283, 0.13451954132644459, 0.03834024098701775, 0.17408566073398105, -0.018469370314851404, -0.0333624595310539, -0.28338833039626476, -0.1931200914949295, -0.12147764376364649, 0.03834815629292279, -0.11594610883374117, -0.2021098754182458, 0.25972446533851323, 0.2347852017963305, 0.15142031526193023, 0.1467356359830592, 0.3031994587276131, 0.18552696038386784, 0.05945369317661971, 0.08449369406793267, 0.1981905336654745, 0.11804353884421288, 0.03360544032766484, -0.19913875996833666, 0.14310348991770297, 0.08509381320371176] |
1,802.03322 | Replica Approach for Minimal Investment Risk with Cost | In the present work, the optimal portfolio minimizing the investment risk
with cost is discussed analytically, where this objective function is
constructed in terms of two negative aspects of investment, the risk and cost.
We note the mathematical similarity between the Hamiltonian in the
mean-variance model and the Hamiltonians in the Hopfield model and the
Sherrington{Kirkpatrick model and show that we can analyze this portfolio
optimization problem by using replica analysis, and derive the minimal
investment risk with cost and the investment concentration of the optimal
portfolio. Furthermore, we validate our proposed method through numerical
simulations.
| q-fin.PM cond-mat.dis-nn cond-mat.stat-mech math.OC q-fin.RM | in the present work the optimal portfolio minimizing the investment risk with cost is discussed analytically where this objective function is constructed in terms of two negative aspects of investment the risk and cost we note the mathematical similarity between the hamiltonian in the meanvariance model and the hamiltonians in the hopfield model and the sherringtonkirkpatrick model and show that we can analyze this portfolio optimization problem by using replica analysis and derive the minimal investment risk with cost and the investment concentration of the optimal portfolio furthermore we validate our proposed method through numerical simulations | [['in', 'the', 'present', 'work', 'the', 'optimal', 'portfolio', 'minimizing', 'the', 'investment', 'risk', 'with', 'cost', 'is', 'discussed', 'analytically', 'where', 'this', 'objective', 'function', 'is', 'constructed', 'in', 'terms', 'of', 'two', 'negative', 'aspects', 'of', 'investment', 'the', 'risk', 'and', 'cost', 'we', 'note', 'the', 'mathematical', 'similarity', 'between', 'the', 'hamiltonian', 'in', 'the', 'meanvariance', 'model', 'and', 'the', 'hamiltonians', 'in', 'the', 'hopfield', 'model', 'and', 'the', 'sherringtonkirkpatrick', 'model', 'and', 'show', 'that', 'we', 'can', 'analyze', 'this', 'portfolio', 'optimization', 'problem', 'by', 'using', 'replica', 'analysis', 'and', 'derive', 'the', 'minimal', 'investment', 'risk', 'with', 'cost', 'and', 'the', 'investment', 'concentration', 'of', 'the', 'optimal', 'portfolio', 'furthermore', 'we', 'validate', 'our', 'proposed', 'method', 'through', 'numerical', 'simulations']] | [-0.06326758235809393, -0.01983150081165756, -0.07341663548140787, 0.11377881121976922, -0.022027843209798448, -0.11760945212639247, 0.11954323445631114, 0.403397254893207, -0.27562241427707096, -0.29521373628328246, 0.15118987458602837, -0.2806844037731935, -0.229854220058769, 0.1292460967815714, -0.1326780435629189, 0.10876830806955695, 0.04912555716388548, -0.02815637456175561, -0.019941548042576567, -0.2933429849217646, 0.31509906620218925, 0.10474722946916397, 0.29435343586374074, 0.08024035743922771, 0.13392755965348138, 0.03390869661719383, 0.0030784702685195953, 0.02497879713579702, -0.16919999312275044, 0.17809077028141473, 0.3000055862236574, 0.1680551286942015, 0.37529878787851584, -0.4225190985016525, -0.17181027201392376, 0.1528197477455251, 0.04199382782583901, 0.06464603238661464, -0.03057463889126666, -0.2209618880879134, -0.009394726483151317, -0.2111006657311615, -0.07663463797265042, -0.06994339208419358, -0.05098667072403865, 0.02724696326913545, -0.31304073554929346, 0.08985258757699437, -0.025676935726854328, 0.02739359441087193, -0.11957244759832975, -0.14247617715106267, -0.03552693386397247, 0.08833781515446996, 0.1594620121445208, -0.04582031584383609, 0.11773075818685659, -0.0830799581744941, -0.16894698845377812, 0.347662455344107, -0.06929854491075578, -0.25105742778396234, 0.09427982318932966, -0.08628108301976074, -0.09031497868515241, 0.057637047653164096, 0.20074138387280982, 0.08140924617570515, -0.22919411550780447, 0.10744680114657967, -0.050042679213220254, 0.14905255408909093, 0.002584094365981097, -0.019491005516708054, 0.10432256587713103, 0.21788541013180898, 0.13041585426738797, 0.21699541199874753, -0.04836630534070233, -0.1913514582508166, -0.30764880070152384, -0.14758000205680824, -0.20388066024073245, -0.0036108724925725255, -0.16494848676090137, -0.11528970739648987, 0.43121392640750855, 0.18606990065139448, 0.10483075522157985, 0.18544190669005425, 0.28890425777838874, 0.16164565313010826, -0.029262493228695046, 0.11260571567011841, 0.2250562117988011, -0.004241372114241433, 0.09041631783960231, -0.301463110285719, 0.11103173836697049, 0.06590525049978169] |
1,802.03323 | Definable functions in tame expansions of algebraically closed valued
fields | In this article we study definable functions in tame expansions of
algebraically closed valued fields. For a given definable function we have two
types of results: of type (I), which hold at a neighborhood of infinity, and of
type (II), which hold locally for all but finitely many points in the domain of
the function. In the first part of the article, we show type (I) and (II)
results concerning factorizations of definable functions over the value group.
As an application, we show that tame expansions of algebraically closed valued
fields having value group $\mathbb{Q}$ (like $\mathbb{C}_p$ and
$\overline{\mathbb{F}_p}^{alg}(\!(t^\mathbb{Q})\!)$) are polynomially bounded.
In the second part, under an additional assumption on the asymptotic behavior
of unary definable functions of the value group, we extend these factorizations
over the residue multiplicative structure $\mathrm{RV}$. In characteristic 0,
we obtain as a corollary that the domain of a definable function $f\colon
X\subseteq K\to K$ can be partitioned into sets $F\cup E\cup J$, where $F$ is
finite, $f|E$ is locally constant and $f|J$ satisfies locally the Jacobian
property.
| math.LO | in this article we study definable functions in tame expansions of algebraically closed valued fields for a given definable function we have two types of results of type i which hold at a neighborhood of infinity and of type ii which hold locally for all but finitely many points in the domain of the function in the first part of the article we show type i and ii results concerning factorizations of definable functions over the value group as an application we show that tame expansions of algebraically closed valued fields having value group mathbbq like mathbbc_p and overlinemathbbf_palgtmathbbq are polynomially bounded in the second part under an additional assumption on the asymptotic behavior of unary definable functions of the value group we extend these factorizations over the residue multiplicative structure mathrmrv in characteristic 0 we obtain as a corollary that the domain of a definable function fcolon xsubseteq kto k can be partitioned into sets fcup ecup j where f is finite fe is locally constant and fj satisfies locally the jacobian property | [['in', 'this', 'article', 'we', 'study', 'definable', 'functions', 'in', 'tame', 'expansions', 'of', 'algebraically', 'closed', 'valued', 'fields', 'for', 'a', 'given', 'definable', 'function', 'we', 'have', 'two', 'types', 'of', 'results', 'of', 'type', 'i', 'which', 'hold', 'at', 'a', 'neighborhood', 'of', 'infinity', 'and', 'of', 'type', 'ii', 'which', 'hold', 'locally', 'for', 'all', 'but', 'finitely', 'many', 'points', 'in', 'the', 'domain', 'of', 'the', 'function', 'in', 'the', 'first', 'part', 'of', 'the', 'article', 'we', 'show', 'type', 'i', 'and', 'ii', 'results', 'concerning', 'factorizations', 'of', 'definable', 'functions', 'over', 'the', 'value', 'group', 'as', 'an', 'application', 'we', 'show', 'that', 'tame', 'expansions', 'of', 'algebraically', 'closed', 'valued', 'fields', 'having', 'value', 'group', 'mathbbq', 'like', 'mathbbc_p', 'and', 'overlinemathbbf_palgtmathbbq', 'are', 'polynomially', 'bounded', 'in', 'the', 'second', 'part', 'under', 'an', 'additional', 'assumption', 'on', 'the', 'asymptotic', 'behavior', 'of', 'unary', 'definable', 'functions', 'of', 'the', 'value', 'group', 'we', 'extend', 'these', 'factorizations', 'over', 'the', 'residue', 'multiplicative', 'structure', 'mathrmrv', 'in', 'characteristic', '0', 'we', 'obtain', 'as', 'a', 'corollary', 'that', 'the', 'domain', 'of', 'a', 'definable', 'function', 'fcolon', 'xsubseteq', 'kto', 'k', 'can', 'be', 'partitioned', 'into', 'sets', 'fcup', 'ecup', 'j', 'where', 'f', 'is', 'finite', 'fe', 'is', 'locally', 'constant', 'and', 'fj', 'satisfies', 'locally', 'the', 'jacobian', 'property']] | [-0.18275548978872075, 0.07605382848183123, -0.077568724126506, 0.046043669898539495, -0.0813370891329315, -0.10454236383805847, 0.02131823234107585, 0.3601221589913472, -0.34484576867424954, -0.1721650551628779, 0.08668291652221123, -0.2563839836443682, -0.12181330645968866, 0.20303943087156232, -0.05897452962198104, -0.02588136065941936, -0.017172936009711516, 0.1266407439463407, -0.0810798135843422, -0.3020603029310638, 0.4019975494266602, -0.13041616126905844, 0.19845449273309082, 0.04744951119094989, 0.09853737371904253, 0.017081991799328237, 0.008762515461813027, 0.06361630324094572, -0.15974301945907268, 0.05523420589886148, 0.3053108869115032, 0.13447268512263372, 0.29046792988066306, -0.3913207932467959, -0.1457716788254455, 0.21163198195005717, 0.14543851157269108, -0.006855020107570709, -0.016107415079890768, -0.25363013558824987, 0.16449455492340073, -0.15561334821341113, -0.1632504011749437, -0.07092815066915147, 0.061280654661618826, 0.07903147514702545, -0.29683513689836577, 0.012817317252292446, 0.13337347147937276, 0.13683663228014756, -0.09923543294003963, -0.12006996919493577, 0.017926037150887194, 0.08440518159724293, 0.013105739885668832, 0.06905805604518404, 0.08110741642984556, -0.08895386747433123, -0.0648472834554125, 0.31876954767983734, -0.11448159024162947, -0.21626878976386193, 0.12910869078539117, -0.18935631644198594, -0.16478265609526843, 0.10101210821027819, 0.10009803868045933, 0.17204845778518818, -0.05743896163358729, 0.25149590708723846, -0.11694927312085154, 0.1269601811083001, 0.09466422378301365, 0.04236228061965544, 0.09513221024290512, 0.04972156299800988, 0.08385406485561292, 0.14338234103113218, 0.03451919796255728, -0.028975539040147213, -0.41072509850631334, -0.1671594307098908, -0.14321841696230966, 0.11939121376483412, -0.10957276366061493, -0.2383360136572642, 0.39544990796007606, 0.06857145729077141, 0.17773243316145593, 0.14763083987139514, 0.19311142247714844, 0.10599793591100876, 0.05579652088967953, 0.088604434338883, 0.09593229557589045, 0.16225364064519995, -0.018732727068198615, -0.1252590381522998, 0.04677855115307615, 0.1451416075877588] |
1,802.03324 | Dimension growth for iterated sumsets | We study dimensions of sumsets and iterated sumsets and provide natural
conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies
$\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even
$\dim_\text{H} n F \to 1$. Our results apply to, for example, all uniformly
perfect sets, which include Ahlfors-David regular sets. Our proofs rely on
Hochman's inverse theorem for entropy and the Assouad and lower dimensions play
a critical role. We give several applications of our results including an
Erd\H{o}s-Volkmann type theorem for semigroups and new lower bounds for the box
dimensions of distance sets for sets with small dimension.
| math.MG math.CA | we study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set f subseteq mathbbr satisfies overlinedim_textb ff overlinedim_textb f or even dim_texth n f to 1 our results apply to for example all uniformly perfect sets which include ahlforsdavid regular sets our proofs rely on hochmans inverse theorem for entropy and the assouad and lower dimensions play a critical role we give several applications of our results including an erdhosvolkmann type theorem for semigroups and new lower bounds for the box dimensions of distance sets for sets with small dimension | [['we', 'study', 'dimensions', 'of', 'sumsets', 'and', 'iterated', 'sumsets', 'and', 'provide', 'natural', 'conditions', 'which', 'guarantee', 'that', 'a', 'set', 'f', 'subseteq', 'mathbbr', 'satisfies', 'overlinedim_textb', 'ff', 'overlinedim_textb', 'f', 'or', 'even', 'dim_texth', 'n', 'f', 'to', '1', 'our', 'results', 'apply', 'to', 'for', 'example', 'all', 'uniformly', 'perfect', 'sets', 'which', 'include', 'ahlforsdavid', 'regular', 'sets', 'our', 'proofs', 'rely', 'on', 'hochmans', 'inverse', 'theorem', 'for', 'entropy', 'and', 'the', 'assouad', 'and', 'lower', 'dimensions', 'play', 'a', 'critical', 'role', 'we', 'give', 'several', 'applications', 'of', 'our', 'results', 'including', 'an', 'erdhosvolkmann', 'type', 'theorem', 'for', 'semigroups', 'and', 'new', 'lower', 'bounds', 'for', 'the', 'box', 'dimensions', 'of', 'distance', 'sets', 'for', 'sets', 'with', 'small', 'dimension']] | [-0.11021661103215127, 0.0708512860473228, -0.028346317116805214, 0.09885514288784024, -0.022713460035602304, -0.13576126901898533, 0.051939945524320644, 0.29517099053965523, -0.21754136931230414, -0.22407040937724423, 0.13244012662486987, -0.3029285120837232, -0.10622960284223502, 0.29898854465709324, -0.0661935813209795, 0.051544240220113, 0.06164439432719286, 0.044689980264012504, -0.03392393775086137, -0.3100200898702593, 0.3857500237274043, -0.08355387304215989, 0.23279323026617157, 0.11772137755983846, 0.07362632985112871, 0.007518145850205675, 0.009239856705460896, 0.03768606218348376, -0.24024966793381572, 0.12946619444397933, 0.23655636493671447, 0.14923210833172135, 0.25565458357611553, -0.3943722091932246, -0.1749122863823667, 0.19246445076064544, 0.09605555406008709, 0.0070778875923814604, -0.04461334220832214, -0.2453083460011143, 0.14755123614412832, -0.09680669892460425, -0.1704579545432662, -0.129289368375581, 0.1052838701041455, 0.03412979854855369, -0.38783979011659925, 0.04552690252324844, 0.20297200468051782, 0.08972565251144957, -0.04486824382911436, -0.18230114390756538, 0.02357169440353012, 0.10697836884758138, -0.03024044220008828, 0.04789329113369371, 0.0736460583643651, -0.035530327551780226, -0.141464934912213, 0.3250722157907613, -0.031630933889128424, -0.2341556171787546, 0.22642854728210876, -0.1370971854776144, -0.16181582905986208, 0.049642337738793896, 0.1419557528768448, 0.14212496569281088, -0.03742752867587347, 0.17701537154325125, -0.11456151006426266, 0.1338477923678472, 0.13351071096877468, 0.10159065399536903, 0.087909849462139, 0.08129655395416503, 0.16086370960630952, 0.1507848001610329, -0.005924050411348172, -0.023781243961879073, -0.3654209674494539, -0.13368943991496207, -0.15169353668325322, 0.09109586283863037, -0.17836478767601371, -0.22546778884691562, 0.3017867609779251, 0.12889855804833325, 0.18599684232291072, 0.1674881802817331, 0.2086988692667256, 0.08866838999652983, 0.026264684435792586, 0.10745081049390137, 0.08934866145260613, 0.1298494700273063, -0.000643906911755813, -0.096816133256962, -0.020527017129426624, 0.1953513398816056] |
1,802.03325 | Generating and refining particle detector simulations using the
Wasserstein distance in adversarial networks | We use adversarial network architectures together with the Wasserstein
distance to generate or refine simulated detector data. The data reflect
two-dimensional projections of spatially distributed signal patterns with a
broad spectrum of applications. As an example, we use an observatory to detect
cosmic ray-induced air showers with a ground-based array of particle detectors.
First we investigate a method of generating detector patterns with variable
signal strengths while constraining the primary particle energy. We then
present a technique to refine simulated time traces of detectors to match
corresponding data distributions. With this method we demonstrate that training
a deep network with refined data-like signal traces leads to a more precise
energy reconstruction of data events compared to training with the originally
simulated traces.
| astro-ph.IM hep-ex | we use adversarial network architectures together with the wasserstein distance to generate or refine simulated detector data the data reflect twodimensional projections of spatially distributed signal patterns with a broad spectrum of applications as an example we use an observatory to detect cosmic rayinduced air showers with a groundbased array of particle detectors first we investigate a method of generating detector patterns with variable signal strengths while constraining the primary particle energy we then present a technique to refine simulated time traces of detectors to match corresponding data distributions with this method we demonstrate that training a deep network with refined datalike signal traces leads to a more precise energy reconstruction of data events compared to training with the originally simulated traces | [['we', 'use', 'adversarial', 'network', 'architectures', 'together', 'with', 'the', 'wasserstein', 'distance', 'to', 'generate', 'or', 'refine', 'simulated', 'detector', 'data', 'the', 'data', 'reflect', 'twodimensional', 'projections', 'of', 'spatially', 'distributed', 'signal', 'patterns', 'with', 'a', 'broad', 'spectrum', 'of', 'applications', 'as', 'an', 'example', 'we', 'use', 'an', 'observatory', 'to', 'detect', 'cosmic', 'rayinduced', 'air', 'showers', 'with', 'a', 'groundbased', 'array', 'of', 'particle', 'detectors', 'first', 'we', 'investigate', 'a', 'method', 'of', 'generating', 'detector', 'patterns', 'with', 'variable', 'signal', 'strengths', 'while', 'constraining', 'the', 'primary', 'particle', 'energy', 'we', 'then', 'present', 'a', 'technique', 'to', 'refine', 'simulated', 'time', 'traces', 'of', 'detectors', 'to', 'match', 'corresponding', 'data', 'distributions', 'with', 'this', 'method', 'we', 'demonstrate', 'that', 'training', 'a', 'deep', 'network', 'with', 'refined', 'datalike', 'signal', 'traces', 'leads', 'to', 'a', 'more', 'precise', 'energy', 'reconstruction', 'of', 'data', 'events', 'compared', 'to', 'training', 'with', 'the', 'originally', 'simulated', 'traces']] | [-0.06623511368024247, 0.06933364162310293, -0.0974202920362109, 0.08718558595817322, -0.07298916437449392, -0.0999627391441313, 0.0029128944552808877, 0.43473305231051856, -0.2432283888548063, -0.3847140753260035, 0.07606864675925282, -0.3260352811241736, -0.112683486157158, 0.19518094259069957, -0.049101660218944805, 0.07747386238293448, 0.15662445434460753, -0.012977245761860223, -0.08203727328867393, -0.1945732266214661, 0.29599994247813605, 0.16877833678034998, 0.2876445369214797, -0.03799992388679234, 0.14181342316776147, -0.023218894530026638, -0.08476345257482445, -0.01901092771707927, -0.08151169703180995, 0.1333856719000204, 0.26750717577157107, 0.19773774213905707, 0.18192707424693297, -0.456076563101216, -0.22415242002147143, 0.15186619365084, 0.08151152671780437, 0.09211746664129991, -0.07885053481123712, -0.34513849354364345, 0.07979045960991109, -0.15193336800153015, -0.11496265178363098, -0.05244871806811358, -0.045047558263921345, 0.06005359387128293, -0.3036102041083037, 0.01844939608966596, -0.015820592328844987, 0.041729397548851174, -0.05645256807844414, -0.04996837917777336, 0.009736270201010783, 0.11082447401618158, 0.024110521186051555, 0.04007832793763182, 0.1296590183151611, -0.10792423875908917, -0.13442740597395744, 0.315148564605195, -0.10534484586754783, -0.14830696598825152, 0.18718624195145045, -0.1199929719546535, -0.10753253051919527, 0.1633777271204277, 0.2585300759862742, 0.1116365392112219, -0.19237207374764514, -0.01718876670595625, 0.006230921240248641, 0.2110671894090464, 0.03492742652821614, 0.011637965031159034, 0.18381831606422536, 0.22303611085918107, 0.08433837952382374, 0.1730660089209569, -0.2216432762759753, -0.014076080181842029, -0.2479600299027611, -0.115263263511731, -0.20204170820776557, -0.007632338415190089, -0.07262818112999933, -0.1607366599310495, 0.4089687096840534, 0.2127973718442725, 0.2595002213607496, 0.09427764164818236, 0.3366152706296473, 0.045570647247616565, 0.09752883116684122, 0.04906062145534231, 0.18619922326389152, 0.10006104242132946, 0.13002323651434394, -0.15170965212794235, 0.019476741262268824, -0.01047249427294267] |
1,802.03326 | Galactic center gamma-ray excess and the Fermi bubbles | Galactic center (GC) is expected to be the brightest source of possible dark
matter (DM) annihilation signal. Excess gamma-ray emission has been detected by
several groups. Both DM and more conventional astrophysical explanations of the
excess have been proposed. In this report, we discuss possible effects of
modeling the Fermi bubbles at low latitudes on the GC excess. We consider a
template of the Fermi bubbles at low latitudes derived by assuming that the
spectrum between 1 GeV and 10 GeV at low latitudes is the same as at high
latitudes. We argue that the presence of the Fermi bubbles near the GC may have
a significant influence on the spectrum of the GC excess, especially at
energies above 10 GeV.
| astro-ph.HE | galactic center gc is expected to be the brightest source of possible dark matter dm annihilation signal excess gammaray emission has been detected by several groups both dm and more conventional astrophysical explanations of the excess have been proposed in this report we discuss possible effects of modeling the fermi bubbles at low latitudes on the gc excess we consider a template of the fermi bubbles at low latitudes derived by assuming that the spectrum between 1 gev and 10 gev at low latitudes is the same as at high latitudes we argue that the presence of the fermi bubbles near the gc may have a significant influence on the spectrum of the gc excess especially at energies above 10 gev | [['galactic', 'center', 'gc', 'is', 'expected', 'to', 'be', 'the', 'brightest', 'source', 'of', 'possible', 'dark', 'matter', 'dm', 'annihilation', 'signal', 'excess', 'gammaray', 'emission', 'has', 'been', 'detected', 'by', 'several', 'groups', 'both', 'dm', 'and', 'more', 'conventional', 'astrophysical', 'explanations', 'of', 'the', 'excess', 'have', 'been', 'proposed', 'in', 'this', 'report', 'we', 'discuss', 'possible', 'effects', 'of', 'modeling', 'the', 'fermi', 'bubbles', 'at', 'low', 'latitudes', 'on', 'the', 'gc', 'excess', 'we', 'consider', 'a', 'template', 'of', 'the', 'fermi', 'bubbles', 'at', 'low', 'latitudes', 'derived', 'by', 'assuming', 'that', 'the', 'spectrum', 'between', '1', 'gev', 'and', '10', 'gev', 'at', 'low', 'latitudes', 'is', 'the', 'same', 'as', 'at', 'high', 'latitudes', 'we', 'argue', 'that', 'the', 'presence', 'of', 'the', 'fermi', 'bubbles', 'near', 'the', 'gc', 'may', 'have', 'a', 'significant', 'influence', 'on', 'the', 'spectrum', 'of', 'the', 'gc', 'excess', 'especially', 'at', 'energies', 'above', '10', 'gev']] | [-0.09289226859657879, 0.17098533132783145, -0.06573949703053872, 0.1812228272324582, -0.053043399021522074, -0.06350716190751303, 0.060041265285089, 0.4012278486197152, -0.1976468737260246, -0.4003565778170735, 0.020063763710454662, -0.3392095782155217, 0.01853222750927791, 0.19576872043958135, 0.021175029941580513, -0.05886061240203124, -0.002129067330090098, -0.0017700420061418833, -0.023660473776634876, -0.20997511237005373, 0.2759756425641908, 0.15739502332919886, 0.22464793133895752, 0.10473751423741914, 0.1108769281490221, -0.09151316144357412, -0.006207090540796764, -0.04605898986886109, -0.0892728866191729, 0.05285210094283804, 0.24842180044598078, 0.03998159474408454, 0.16094713924598902, -0.357413868165829, -0.27329879608159224, 0.16130355109791616, 0.16793026850166276, 0.03438915877241241, -0.10754643284106215, -0.27275695084605733, 0.10220576294559278, -0.21416073163186222, -0.17450651772582926, 0.0678631368070102, 0.03038327681855106, -0.006741869396122157, -0.12537493779947442, 0.13758974884394248, 0.0030248953781883458, 0.06971562247384679, -0.09862728969170904, -0.161879406887884, -0.04072825819223134, 0.009851103194427393, 0.09304520153644502, 0.034116798484590184, 0.20298772447257618, -0.14508231614008238, -0.08788698534519712, 0.39692491911782707, -0.08930878847652723, -0.023435508943940243, 0.22785332719872375, -0.26633931737208416, -0.20276720014839503, 0.22355349504866076, 0.16603143420647676, 0.036564782492754876, -0.14457175353819057, 0.09567034775790496, -0.03092394867711816, 0.13328691350280747, 0.09194956380058049, 0.038208011075977454, 0.3534614726562392, 0.1292310061148745, 0.08137484311226233, 0.10275184920284712, -0.3067609140772588, 0.013868322825898255, -0.29245469453244294, -0.04828219145751935, -0.13213338763722457, 0.01738912315485029, -0.07300336257923079, -0.03340458452955566, 0.3618078648597618, 0.10851561623406096, 0.2474804642679524, 0.00653305263758814, 0.2957110797201306, 0.10046960212471163, 0.07565114788002958, 0.1442314213726762, 0.3573690094053745, 0.07605116544791675, 0.0961792381626577, -0.19387983323713717, 0.05296272391160904, -0.06979667079011517] |
1,802.03327 | Shapes Characterization on Address Event Representation Using Histograms
of Oriented Events and an Extended LBP Approach | Address Event Representation is a thriving technology that could change
digital image processing paradigm. This paper proposes a methodology to
characterize the shape of objects using the streaming of asynchronous events. A
new descriptor that enhances spikes connectivity is associated with two
oriented histogram based representations. This paper uses these features to
develop both a non-supervised and a supervised multi-classification framework
to recognize poker symbols from the Poker-DVS public dataset. The
aforementioned framework, which uses a very limited number of events and a
simple class modeling, yields results that challenge more sophisticated
methodologies proposed by the state of the art. A feature family based on
context shapes is applied to the more challenging 2015 Poker-DVS dataset with a
supervised classifier obtaining an accuracy of 98.5 %. The system is also
applied to the MNIST-DVS dataset yielding an accuracy of 94.6 % and 96.3 % on
digit recognition, for scales 4 and 8 respectively.
| cs.CV | address event representation is a thriving technology that could change digital image processing paradigm this paper proposes a methodology to characterize the shape of objects using the streaming of asynchronous events a new descriptor that enhances spikes connectivity is associated with two oriented histogram based representations this paper uses these features to develop both a nonsupervised and a supervised multiclassification framework to recognize poker symbols from the pokerdvs public dataset the aforementioned framework which uses a very limited number of events and a simple class modeling yields results that challenge more sophisticated methodologies proposed by the state of the art a feature family based on context shapes is applied to the more challenging 2015 pokerdvs dataset with a supervised classifier obtaining an accuracy of 985 the system is also applied to the mnistdvs dataset yielding an accuracy of 946 and 963 on digit recognition for scales 4 and 8 respectively | [['address', 'event', 'representation', 'is', 'a', 'thriving', 'technology', 'that', 'could', 'change', 'digital', 'image', 'processing', 'paradigm', 'this', 'paper', 'proposes', 'a', 'methodology', 'to', 'characterize', 'the', 'shape', 'of', 'objects', 'using', 'the', 'streaming', 'of', 'asynchronous', 'events', 'a', 'new', 'descriptor', 'that', 'enhances', 'spikes', 'connectivity', 'is', 'associated', 'with', 'two', 'oriented', 'histogram', 'based', 'representations', 'this', 'paper', 'uses', 'these', 'features', 'to', 'develop', 'both', 'a', 'nonsupervised', 'and', 'a', 'supervised', 'multiclassification', 'framework', 'to', 'recognize', 'poker', 'symbols', 'from', 'the', 'pokerdvs', 'public', 'dataset', 'the', 'aforementioned', 'framework', 'which', 'uses', 'a', 'very', 'limited', 'number', 'of', 'events', 'and', 'a', 'simple', 'class', 'modeling', 'yields', 'results', 'that', 'challenge', 'more', 'sophisticated', 'methodologies', 'proposed', 'by', 'the', 'state', 'of', 'the', 'art', 'a', 'feature', 'family', 'based', 'on', 'context', 'shapes', 'is', 'applied', 'to', 'the', 'more', 'challenging', '2015', 'pokerdvs', 'dataset', 'with', 'a', 'supervised', 'classifier', 'obtaining', 'an', 'accuracy', 'of', '985', 'the', 'system', 'is', 'also', 'applied', 'to', 'the', 'mnistdvs', 'dataset', 'yielding', 'an', 'accuracy', 'of', '946', 'and', '963', 'on', 'digit', 'recognition', 'for', 'scales', '4', 'and', '8', 'respectively']] | [-0.07374794416702227, -0.0045261035366156895, -0.10832856205367558, 0.05269960675237549, -0.1003694063795076, -0.14823674311785884, 0.02887947065283771, 0.3863874150037363, -0.23252804516665196, -0.355529227671591, 0.0922059671704758, -0.27616365705113355, -0.16349001515757394, 0.22651348702837257, -0.14813634972843165, 0.03953106088463117, 0.1296950371965854, 0.05529600248917484, -0.04742671186387589, -0.26221672017316056, 0.290080673566302, 0.044485913498352306, 0.3443785577885039, 0.007120478127428607, 0.13896175076543177, -0.015358829716648403, -0.04486064166711593, 0.003970822495584552, -0.0425456392325007, 0.20541940235400674, 0.2839283955620123, 0.1922071123215672, 0.29368087720295816, -0.35098589662261104, -0.18934700321905612, 0.08761999549067302, 0.12937693760377933, 0.11072650596611926, -0.06974428515142692, -0.32825656831767913, 0.11978016442908729, -0.19249716157571892, -0.023151179877852368, -0.09894771895346206, 0.01786073877450985, -0.045742533336443875, -0.29082728241180145, 0.05572121282484905, 0.07947717294115825, 0.07517660032592814, -0.034726509085000565, -0.08865587325763537, 0.04817337525152677, 0.13140383385423873, -0.02354832359973492, 0.07596933524237594, 0.1207100204577531, -0.1687467015235106, -0.16020050037627084, 0.37053190706088523, -0.05322057698268091, -0.1808167455845349, 0.20756269260183782, -0.028620076206877728, -0.15522930038816804, 0.1326257703830551, 0.23579006719778958, 0.1308067350210213, -0.18456631143753593, -0.003950555568145639, -0.022909826422865327, 0.23025271184097446, 0.03283453877776157, -0.028010081282716145, 0.1818689336949909, 0.26764603723406893, 0.03454916638548713, 0.14881503421693687, -0.17036679449744485, -0.04873932280728745, -0.22027521552455082, -0.10761413689406991, -0.16720346912090364, -0.04393079099748787, -0.07215918151377008, -0.15435091671659737, 0.42688191332225056, 0.20052427100646938, 0.21719313332357923, 0.09703737599350437, 0.3034965303802007, 0.022921301248307165, 0.08395756743030271, 0.08009077537320303, 0.15064177546898733, 0.03647535909879701, 0.12274737689861197, -0.1380143104533262, 0.06763553161589378, 0.06964632764091319] |
1,802.03328 | Dust modeling of the combined ALMA and SPHERE datasets of HD163296. Is
HD163296 really a Meeus group II disk? | Context. Multi-wavelength observations are indispensable in studying disk
geometry and dust evolution processes in protoplanetary disks. Aims. We aimed
to construct a 3-dimensional model of HD 163296 capable of reproducing
simultaneously new observations of the disk surface in scattered light with the
SPHERE instrument and thermal emission continuum observations of the disk
midplane with ALMA. We want to determine why the SED of HD 163296 is
intermediary between the otherwise well-separated group I and group II Herbig
stars. Methods. The disk was modelled using the Monte Carlo radiative transfer
code MCMax3D. The radial dust surface density profile was modelled after the
ALMA observations, while the polarized scattered light observations were used
to constrain the inclination of the inner disk component and turbulence and
grain growth in the outer disk. Results. While three rings are observed in the
disk midplane in millimeter thermal emission at $\sim$80, 124 and 200 AU, only
the innermost of these is observed in polarized scattered light, indicating a
lack of small dust grains on the surface of the outer disk. We provide two
models capable of explaining this difference. The first model uses increased
settling in the outer disk as a mechanism to bring the small dust grains on the
surface of the disk closer to the midplane, and into the shadow cast by the
first ring. The second model uses depletion of the smallest dust grains in the
outer disk as a mechanism for decreasing the optical depth at optical and NIR
wavelengths. In the region outside the fragmentation-dominated regime, such
depletion is expected from state-of-the-art dust evolution models. We studied
the effect of creating an artificial inner cavity in our models, and conclude
that HD 163296 might be a precursor to typical group I sources.
| astro-ph.EP | context multiwavelength observations are indispensable in studying disk geometry and dust evolution processes in protoplanetary disks aims we aimed to construct a 3dimensional model of hd 163296 capable of reproducing simultaneously new observations of the disk surface in scattered light with the sphere instrument and thermal emission continuum observations of the disk midplane with alma we want to determine why the sed of hd 163296 is intermediary between the otherwise wellseparated group i and group ii herbig stars methods the disk was modelled using the monte carlo radiative transfer code mcmax3d the radial dust surface density profile was modelled after the alma observations while the polarized scattered light observations were used to constrain the inclination of the inner disk component and turbulence and grain growth in the outer disk results while three rings are observed in the disk midplane in millimeter thermal emission at sim80 124 and 200 au only the innermost of these is observed in polarized scattered light indicating a lack of small dust grains on the surface of the outer disk we provide two models capable of explaining this difference the first model uses increased settling in the outer disk as a mechanism to bring the small dust grains on the surface of the disk closer to the midplane and into the shadow cast by the first ring the second model uses depletion of the smallest dust grains in the outer disk as a mechanism for decreasing the optical depth at optical and nir wavelengths in the region outside the fragmentationdominated regime such depletion is expected from stateoftheart dust evolution models we studied the effect of creating an artificial inner cavity in our models and conclude that hd 163296 might be a precursor to typical group i sources | [['context', 'multiwavelength', 'observations', 'are', 'indispensable', 'in', 'studying', 'disk', 'geometry', 'and', 'dust', 'evolution', 'processes', 'in', 'protoplanetary', 'disks', 'aims', 'we', 'aimed', 'to', 'construct', 'a', '3dimensional', 'model', 'of', 'hd', '163296', 'capable', 'of', 'reproducing', 'simultaneously', 'new', 'observations', 'of', 'the', 'disk', 'surface', 'in', 'scattered', 'light', 'with', 'the', 'sphere', 'instrument', 'and', 'thermal', 'emission', 'continuum', 'observations', 'of', 'the', 'disk', 'midplane', 'with', 'alma', 'we', 'want', 'to', 'determine', 'why', 'the', 'sed', 'of', 'hd', '163296', 'is', 'intermediary', 'between', 'the', 'otherwise', 'wellseparated', 'group', 'i', 'and', 'group', 'ii', 'herbig', 'stars', 'methods', 'the', 'disk', 'was', 'modelled', 'using', 'the', 'monte', 'carlo', 'radiative', 'transfer', 'code', 'mcmax3d', 'the', 'radial', 'dust', 'surface', 'density', 'profile', 'was', 'modelled', 'after', 'the', 'alma', 'observations', 'while', 'the', 'polarized', 'scattered', 'light', 'observations', 'were', 'used', 'to', 'constrain', 'the', 'inclination', 'of', 'the', 'inner', 'disk', 'component', 'and', 'turbulence', 'and', 'grain', 'growth', 'in', 'the', 'outer', 'disk', 'results', 'while', 'three', 'rings', 'are', 'observed', 'in', 'the', 'disk', 'midplane', 'in', 'millimeter', 'thermal', 'emission', 'at', 'sim80', '124', 'and', '200', 'au', 'only', 'the', 'innermost', 'of', 'these', 'is', 'observed', 'in', 'polarized', 'scattered', 'light', 'indicating', 'a', 'lack', 'of', 'small', 'dust', 'grains', 'on', 'the', 'surface', 'of', 'the', 'outer', 'disk', 'we', 'provide', 'two', 'models', 'capable', 'of', 'explaining', 'this', 'difference', 'the', 'first', 'model', 'uses', 'increased', 'settling', 'in', 'the', 'outer', 'disk', 'as', 'a', 'mechanism', 'to', 'bring', 'the', 'small', 'dust', 'grains', 'on', 'the', 'surface', 'of', 'the', 'disk', 'closer', 'to', 'the', 'midplane', 'and', 'into', 'the', 'shadow', 'cast', 'by', 'the', 'first', 'ring', 'the', 'second', 'model', 'uses', 'depletion', 'of', 'the', 'smallest', 'dust', 'grains', 'in', 'the', 'outer', 'disk', 'as', 'a', 'mechanism', 'for', 'decreasing', 'the', 'optical', 'depth', 'at', 'optical', 'and', 'nir', 'wavelengths', 'in', 'the', 'region', 'outside', 'the', 'fragmentationdominated', 'regime', 'such', 'depletion', 'is', 'expected', 'from', 'stateoftheart', 'dust', 'evolution', 'models', 'we', 'studied', 'the', 'effect', 'of', 'creating', 'an', 'artificial', 'inner', 'cavity', 'in', 'our', 'models', 'and', 'conclude', 'that', 'hd', '163296', 'might', 'be', 'a', 'precursor', 'to', 'typical', 'group', 'i', 'sources']] | [-0.06246791474414815, 0.09834662414117432, -0.07146688017375433, 0.057362419781500674, -0.0568149417838578, -0.07448555288230517, -0.010999915624685122, 0.4273826123576186, -0.2520667461639715, -0.3117218755610983, 0.0809074296518535, -0.2568743983605896, -0.037575954076701897, 0.1632132175512238, -0.033042214117290865, 0.010225107483678598, 0.033278004227248005, -0.14427336131753868, 0.004973183469411798, -0.21034442662715808, 0.30231156668007036, 0.11619735823518831, 0.11715351485173543, 0.011492358522439718, 0.026866232826467926, -0.0999183142654795, -0.06983211452292865, -0.05819510376229109, -0.16431307165322454, 0.0966766932427361, 0.20385142014802554, 0.07678965408158421, 0.18312005452154315, -0.455022235668448, -0.2605041285209796, 0.034823117176695985, 0.1634422351967118, 0.04125511280267425, -0.02020690972339942, -0.2185053259753026, 0.053900874583481626, -0.14570647170670512, -0.19698862560982833, 0.09730337147426124, 0.05581992625332982, -0.024680863553497, -0.24270647102925239, 0.04923009369111456, 0.06944203170928395, 0.10786362046901149, -0.14169100113051933, -0.10140198601287335, -0.09678834276741119, 0.09208172057943811, 0.006532949857110847, 0.04721519913182797, 0.20505911460382764, -0.12412274966683484, -0.012756683539025563, 0.39175793184225277, -0.14698832167476047, -0.05502447749207692, 0.22409334755583205, -0.2617955237730152, -0.09655957639210931, 0.19723955565051637, 0.1691152727179822, 0.14359930870654933, -0.10254490725006457, 0.025712421585871777, -0.06382237132002236, 0.19963955015905208, 0.047191681981628125, 0.039251606618167, 0.3732464506732849, 0.1417047614940671, 0.0012544688667375336, 0.16573055970154632, -0.25637432555490813, -0.0849483833957631, -0.24665609667251678, -0.14047561376275025, -0.15031819970421106, 0.03366088403782011, -0.11861918919922576, -0.09736910920326718, 0.3202327183821596, 0.11357865033060582, 0.22958541960877635, 0.018328496547428744, 0.3421615631509714, 0.046308491664622815, 0.11683831727261104, 0.158480473884275, 0.30397199104204903, 0.16162321531168705, 0.10814446505404054, -0.2635151510499297, 0.08733629354817155, 0.00036022578088959814] |
1,802.03329 | Device-to-Device Communications in the Millimeter Wave Band: A Novel
Distributed Mechanism | In spite of its potential advantages, the large-scale implementation of the
device-to-device (D2D) communications has yet to be realized, mainly due to
severe interference and lack of enough bandwidth in the microwave ($\mu$W)
band. Recently, exploiting the millimeter wave (mmW) band for D2D
communications has attracted considerable attention as a potential solution to
these challenges. However, its severe sensitivity to blockage along with its
directional nature make the utilization of the mmW band a challenging task as
it requires line-of-sight (LOS) link detection and careful beam alignment
between the D2D transceivers. In this paper, we propose a novel distributed
mechanism which enables the D2D devices to discover unblocked LOS links for the
mmW band communication. Moreover, as such LOS links are not always available,
the proposed mechanism allows the D2D devices to switch to the $\mu$W band if
necessary. In addition, the proposed mechanism detects the direction of the LOS
links to perform the beam alignment. We have used tools from stochastic
geometry to evaluate the performance of the proposed mechanism in terms of the
signal-to-interference-plus-noise ratio (SINR) coverage probability. The
performance of the proposed algorithm is then compared to the one of the single
band (i.e., $\mu$W/mmW) communication. The simulation results show that the
proposed mechanism considerably outperforms the single band communication.
| cs.IT math.IT | in spite of its potential advantages the largescale implementation of the devicetodevice d2d communications has yet to be realized mainly due to severe interference and lack of enough bandwidth in the microwave muw band recently exploiting the millimeter wave mmw band for d2d communications has attracted considerable attention as a potential solution to these challenges however its severe sensitivity to blockage along with its directional nature make the utilization of the mmw band a challenging task as it requires lineofsight los link detection and careful beam alignment between the d2d transceivers in this paper we propose a novel distributed mechanism which enables the d2d devices to discover unblocked los links for the mmw band communication moreover as such los links are not always available the proposed mechanism allows the d2d devices to switch to the muw band if necessary in addition the proposed mechanism detects the direction of the los links to perform the beam alignment we have used tools from stochastic geometry to evaluate the performance of the proposed mechanism in terms of the signaltointerferenceplusnoise ratio sinr coverage probability the performance of the proposed algorithm is then compared to the one of the single band ie muwmmw communication the simulation results show that the proposed mechanism considerably outperforms the single band communication | [['in', 'spite', 'of', 'its', 'potential', 'advantages', 'the', 'largescale', 'implementation', 'of', 'the', 'devicetodevice', 'd2d', 'communications', 'has', 'yet', 'to', 'be', 'realized', 'mainly', 'due', 'to', 'severe', 'interference', 'and', 'lack', 'of', 'enough', 'bandwidth', 'in', 'the', 'microwave', 'muw', 'band', 'recently', 'exploiting', 'the', 'millimeter', 'wave', 'mmw', 'band', 'for', 'd2d', 'communications', 'has', 'attracted', 'considerable', 'attention', 'as', 'a', 'potential', 'solution', 'to', 'these', 'challenges', 'however', 'its', 'severe', 'sensitivity', 'to', 'blockage', 'along', 'with', 'its', 'directional', 'nature', 'make', 'the', 'utilization', 'of', 'the', 'mmw', 'band', 'a', 'challenging', 'task', 'as', 'it', 'requires', 'lineofsight', 'los', 'link', 'detection', 'and', 'careful', 'beam', 'alignment', 'between', 'the', 'd2d', 'transceivers', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'distributed', 'mechanism', 'which', 'enables', 'the', 'd2d', 'devices', 'to', 'discover', 'unblocked', 'los', 'links', 'for', 'the', 'mmw', 'band', 'communication', 'moreover', 'as', 'such', 'los', 'links', 'are', 'not', 'always', 'available', 'the', 'proposed', 'mechanism', 'allows', 'the', 'd2d', 'devices', 'to', 'switch', 'to', 'the', 'muw', 'band', 'if', 'necessary', 'in', 'addition', 'the', 'proposed', 'mechanism', 'detects', 'the', 'direction', 'of', 'the', 'los', 'links', 'to', 'perform', 'the', 'beam', 'alignment', 'we', 'have', 'used', 'tools', 'from', 'stochastic', 'geometry', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'mechanism', 'in', 'terms', 'of', 'the', 'signaltointerferenceplusnoise', 'ratio', 'sinr', 'coverage', 'probability', 'the', 'performance', 'of', 'the', 'proposed', 'algorithm', 'is', 'then', 'compared', 'to', 'the', 'one', 'of', 'the', 'single', 'band', 'ie', 'muwmmw', 'communication', 'the', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'mechanism', 'considerably', 'outperforms', 'the', 'single', 'band', 'communication']] | [-0.24673712423001307, -0.016933946926015575, 0.0011273602399747697, 0.0055425011207450164, -0.11295848135823305, -0.17903759827216467, 0.1305512022035756, 0.42359568827518834, -0.25963348053841734, -0.31507166032570066, 0.03899504592316444, -0.22987880304155428, -0.199764827885031, 0.1594859493389166, -0.08980580920653042, 0.047227506518436095, 0.05443941703625898, -0.018549108484261473, -0.015280324744908882, -0.20125025396777466, 0.2478670526247804, 0.15298277288106896, 0.42189093784455367, 0.11034503934288424, 0.06029298775960547, 0.010223277630240704, -0.01309653146994768, -0.04668455070732905, -0.07843101376732795, 0.11793668130019182, 0.3180061055023765, 0.1318227667448946, 0.28101751320894824, -0.426628252814913, -0.2632587643158775, 0.09913593380244125, 0.17473694251480232, 0.05685383672749475, -0.04082286770798773, -0.3042242216916991, 0.1279176833444743, -0.22693617456317158, -0.061554526931911206, 0.010087016029851818, -0.06778223587291866, 0.04085407697895166, -0.2602102024144025, 0.015287166266776446, -0.0212127517257323, -0.004778805978054032, 0.0019872526725931224, -0.07627853474190607, -0.0392673996336181, 0.14322086115599447, 0.05399672212483615, 0.009066322669736657, 0.08531263692658657, -0.13055316323357466, -0.11511521561053788, 0.42775339965966525, 0.000827591825263496, -0.19209566164188996, 0.1910318185557817, -0.08736405665702034, -0.08427432784592041, 0.1801761244008309, 0.21903247542967888, 0.024331830822351113, -0.15094346649498797, 0.03945129271542015, 0.028703677740252464, 0.15073655367098715, 0.07023848336356137, 0.1378574198059423, 0.1864458873032859, 0.19732117148317363, 0.13938666560835786, 0.08982949371082367, -0.19892867755673896, -0.07022723059296748, -0.18394083040875728, -0.14274625510563244, -0.21982828488064046, -0.0037177113437382374, -0.05257859715889645, -0.09283649549762688, 0.40430268542425696, 0.1803605292875652, 0.11539672975463382, 0.08275056093058904, 0.40546854423630124, 0.09857906737887331, 0.10456723863468834, 0.09511941558317426, 0.2736770089829402, 0.11493241966772003, 0.17251453391044563, -0.22007121547877334, 0.06385101255099399, -0.06445624758303603] |
1,802.0333 | Non-Hermitian noncommutative quantum mechanics | In this work we present a general formalism to treat non-Hermitian and
noncommutative Hamiltonians. This is done employing the phase-space formalism
of quantum mechanics, which allows to write a set of robust maps connecting the
Hamitonians and the associated Wigner functions to the different Hilbert space
structures, namely, those describing the non-Hermitian and noncommutative,
Hermitian and noncommutative, and Hermitian and commutative systems. A general
recipe is provided to obtain the expected values of the more general
Hamiltonian. Finally, we apply our method to the harmonic oscillator under
linear amplification and discuss the implications of both non-Hermitian and
noncommutative effects.
| quant-ph math-ph math.MP | in this work we present a general formalism to treat nonhermitian and noncommutative hamiltonians this is done employing the phasespace formalism of quantum mechanics which allows to write a set of robust maps connecting the hamitonians and the associated wigner functions to the different hilbert space structures namely those describing the nonhermitian and noncommutative hermitian and noncommutative and hermitian and commutative systems a general recipe is provided to obtain the expected values of the more general hamiltonian finally we apply our method to the harmonic oscillator under linear amplification and discuss the implications of both nonhermitian and noncommutative effects | [['in', 'this', 'work', 'we', 'present', 'a', 'general', 'formalism', 'to', 'treat', 'nonhermitian', 'and', 'noncommutative', 'hamiltonians', 'this', 'is', 'done', 'employing', 'the', 'phasespace', 'formalism', 'of', 'quantum', 'mechanics', 'which', 'allows', 'to', 'write', 'a', 'set', 'of', 'robust', 'maps', 'connecting', 'the', 'hamitonians', 'and', 'the', 'associated', 'wigner', 'functions', 'to', 'the', 'different', 'hilbert', 'space', 'structures', 'namely', 'those', 'describing', 'the', 'nonhermitian', 'and', 'noncommutative', 'hermitian', 'and', 'noncommutative', 'and', 'hermitian', 'and', 'commutative', 'systems', 'a', 'general', 'recipe', 'is', 'provided', 'to', 'obtain', 'the', 'expected', 'values', 'of', 'the', 'more', 'general', 'hamiltonian', 'finally', 'we', 'apply', 'our', 'method', 'to', 'the', 'harmonic', 'oscillator', 'under', 'linear', 'amplification', 'and', 'discuss', 'the', 'implications', 'of', 'both', 'nonhermitian', 'and', 'noncommutative', 'effects']] | [-0.10068204949464123, 0.10925740184205951, -0.08962895657227497, 0.10602030792094842, -0.06624025881944243, -0.16474982791796627, -0.01896969708284796, 0.32783163337370924, -0.2534646074043004, -0.21646841322401106, 0.034352422169776575, -0.21633295578699244, -0.2199679956291661, 0.20027587233543998, -0.06932633406143975, 0.09478391918034476, 0.01321103215932545, 0.012169693573142844, -0.18337583249773493, -0.2076777424722101, 0.3917524138032788, 0.0651196727771406, 0.205126673312425, 0.024918344282813257, 0.09991957455158534, 0.06792137582758159, -0.03170547988547972, -0.011126348029438763, -0.13675355246511636, 0.14180340422223311, 0.24848234072101838, 0.08068353051056314, 0.21716389298025104, -0.4208815237036859, -0.1831132642209831, 0.128300240409156, 0.08289395933124152, 0.15501231851051514, 0.00030710441551307647, -0.3133326607163657, -0.00021677986351829586, -0.19490466005817958, -0.17631356587934524, -0.1450148496137123, 0.02270688633481511, -0.03741141090715172, -0.2696095948399167, 0.022215991986520363, 0.08640552040735128, 0.031311175779785226, -0.05778634393025622, -0.05131940367617503, 0.0012664457670215404, 0.0701586201250779, -0.05080078809870162, -0.00866537486118349, 0.11981619551490917, -0.016668370628560133, -0.11818104912291723, 0.43341700684730755, -0.023785722371416563, -0.26391108874513797, 0.14083548104672722, -0.14571804971895133, -0.13183973105671354, 0.04030912380308063, 0.14210074955145968, 0.15326380408886406, -0.1329220603925712, 0.15881655678491702, -0.030921474673004462, 0.08233329601059056, 0.041790867167891876, 0.07593791195217313, 0.14715150237610244, 0.04393629114510435, 0.04098835712148234, 0.16924301017489699, -0.007701218970745539, -0.21140404225261222, -0.3267234218579651, -0.166730779203815, -0.1687558001763366, 0.1102067752073359, -0.10151612821430193, -0.18327680543403735, 0.46228502140935473, 0.16187558204612948, 0.18722247598561073, 0.07263475757049905, 0.24453026936812836, 0.18477263430976004, 0.031155197015690684, 0.02444447884618333, 0.20294845717573406, 0.23765282505991484, 0.07632775587321382, -0.19507534091708936, -0.08575088453168671, 0.08378325443188048] |
1,802.03331 | Asymptotically hyperbolic extensions and an analogue of the Bartnik mass | The Bartnik mass is a quasi-local mass tailored to asymptotically flat
Riemannian manifolds with non-negative scalar curvature. From the perspective
of general relativity, these model time-symmetric domains obeying the dominant
energy condition without a cosmological constant. There is a natural analogue
of the Bartnik mass for asymptotically hyperbolic Riemannian manifolds with a
negative lower bound on scalar curvature which model time-symmetric domains
obeying the dominant energy condition in the presence of a negative
cosmological constant.
Following the ideas of Mantoulidis and Schoen [2016], of Miao and Xie [2016],
and of joint work of Miao and the authors [2017], we construct asymptotically
hyperbolic extensions of minimal and constant mean curvature (CMC) Bartnik data
while controlling the total mass of the extensions. We establish that for
minimal surfaces satisfying a stability condition, the Bartnik mass is bounded
above by the conjectured lower bound coming from the asymptotically hyperbolic
Riemannian Penrose inequality. We also obtain estimates for such a hyperbolic
Bartnik mass of CMC surfaces with positive Gaussian curvature.
| math.DG gr-qc math.AP | the bartnik mass is a quasilocal mass tailored to asymptotically flat riemannian manifolds with nonnegative scalar curvature from the perspective of general relativity these model timesymmetric domains obeying the dominant energy condition without a cosmological constant there is a natural analogue of the bartnik mass for asymptotically hyperbolic riemannian manifolds with a negative lower bound on scalar curvature which model timesymmetric domains obeying the dominant energy condition in the presence of a negative cosmological constant following the ideas of mantoulidis and schoen 2016 of miao and xie 2016 and of joint work of miao and the authors 2017 we construct asymptotically hyperbolic extensions of minimal and constant mean curvature cmc bartnik data while controlling the total mass of the extensions we establish that for minimal surfaces satisfying a stability condition the bartnik mass is bounded above by the conjectured lower bound coming from the asymptotically hyperbolic riemannian penrose inequality we also obtain estimates for such a hyperbolic bartnik mass of cmc surfaces with positive gaussian curvature | [['the', 'bartnik', 'mass', 'is', 'a', 'quasilocal', 'mass', 'tailored', 'to', 'asymptotically', 'flat', 'riemannian', 'manifolds', 'with', 'nonnegative', 'scalar', 'curvature', 'from', 'the', 'perspective', 'of', 'general', 'relativity', 'these', 'model', 'timesymmetric', 'domains', 'obeying', 'the', 'dominant', 'energy', 'condition', 'without', 'a', 'cosmological', 'constant', 'there', 'is', 'a', 'natural', 'analogue', 'of', 'the', 'bartnik', 'mass', 'for', 'asymptotically', 'hyperbolic', 'riemannian', 'manifolds', 'with', 'a', 'negative', 'lower', 'bound', 'on', 'scalar', 'curvature', 'which', 'model', 'timesymmetric', 'domains', 'obeying', 'the', 'dominant', 'energy', 'condition', 'in', 'the', 'presence', 'of', 'a', 'negative', 'cosmological', 'constant', 'following', 'the', 'ideas', 'of', 'mantoulidis', 'and', 'schoen', '2016', 'of', 'miao', 'and', 'xie', '2016', 'and', 'of', 'joint', 'work', 'of', 'miao', 'and', 'the', 'authors', '2017', 'we', 'construct', 'asymptotically', 'hyperbolic', 'extensions', 'of', 'minimal', 'and', 'constant', 'mean', 'curvature', 'cmc', 'bartnik', 'data', 'while', 'controlling', 'the', 'total', 'mass', 'of', 'the', 'extensions', 'we', 'establish', 'that', 'for', 'minimal', 'surfaces', 'satisfying', 'a', 'stability', 'condition', 'the', 'bartnik', 'mass', 'is', 'bounded', 'above', 'by', 'the', 'conjectured', 'lower', 'bound', 'coming', 'from', 'the', 'asymptotically', 'hyperbolic', 'riemannian', 'penrose', 'inequality', 'we', 'also', 'obtain', 'estimates', 'for', 'such', 'a', 'hyperbolic', 'bartnik', 'mass', 'of', 'cmc', 'surfaces', 'with', 'positive', 'gaussian', 'curvature']] | [-0.14881209460595116, 0.13594478309969418, -0.06667968953649203, 0.1263451574758316, -0.12104543563768719, -0.1927228363654153, -0.0074158800765872, 0.25138635161530337, -0.16637573180945986, -0.33187359927264465, 0.12060811525337736, -0.28202563499975386, -0.1144081586463885, 0.1836594142443077, -0.1241600747558881, 0.08809756154025143, 0.03537243641912937, 0.0524529056919908, -0.09389290408033765, -0.24922995714781185, 0.4354221205706849, 0.05614801543115666, 0.22364323911341755, 0.13192538787173388, 0.14716950143955534, -0.0318977224979211, -0.008562032274450317, 0.022804599593986164, -0.2718154177893832, 0.10957697524519806, 0.1554486077363518, 0.06906322982218681, 0.22987505624804533, -0.3288611436544946, -0.2333236548767397, 0.17463643336104173, 0.05880546649974404, 0.057816838355255175, -0.10225942007082543, -0.2914569292217493, 0.0691141573359456, -0.0822323893676653, -0.21131772466399001, -0.01314441580325365, 0.002502186428473303, -0.057086142102101195, -0.26051724599392123, 0.1615557271124668, 0.13514104807805835, 0.012366027960723096, -0.1646986012488152, -0.11334079348369304, -0.08650057075375861, 0.037847726679209506, 0.09067693590892084, 0.032888513816887455, 0.06581605831725579, -0.03833003538011601, -0.08315590418677664, 0.30083028188709054, -0.14102910328091997, -0.2807983312191385, 0.09349602945431164, -0.11412044591164555, -0.11621314428012931, 0.08377127394813931, 0.16014748908664014, 0.15394694926499417, -0.10920089183544571, 0.20891015258525977, -0.06320214981608319, 0.08969270975018541, 0.1702440010665944, -0.03246065201908068, 0.1763196437732514, 0.057170323180881416, 0.170422145868581, 0.07936836240361586, 0.007106562878823642, -0.12432548391604514, -0.36784920945876476, -0.20779121282552793, -0.1797293882309036, 0.17348567182621497, -0.1801094182339236, -0.19864412932233377, 0.3465065655891191, -0.00958796160464937, 0.19047209288021832, 0.18204923902962808, 0.23114453445216923, 0.06962909358835807, 0.018824435447370915, 0.1493888975868961, 0.24123079211902665, 0.21616899178814933, 0.10000925694987403, -0.14527370319560623, -0.05327099898660725, 0.1125318553160248] |
1,802.03332 | Supersymmetric solutions of the cosmological, gauged, C magic model | We construct supersymmetric solutions of theories of gauged
$\mathcal{N}=1,d=5$ supergravity coupled to vector multiplets with a
$\mathrm{U}(1)_{\rm R}$ Abelian (Fayet-Iliopoulos) gauging and an independent
SU$(2)$ gauging associated to an $\mathrm{SU}(2)$ isometry group of the Real
Special scalar manifold. These theories provide minimal supersymmetrizations of
5-dimensional SU$(2)$ Einstein-Yang-Mills theories with negative cosmological
constant. We consider a minimal model with these gauge groups and the "magic
model" based on the Jordan algebra $\bf{J}_{3}^\mathbb{C}$ with gauge group
$\mathrm{SU}(3)\times\mathrm{U}(1)_{\rm R}$, which is a consistent truncation
of maximal $\mathrm{SO}(6)$-gauged supergravity in $d=5$ and whose solutions
can be embedded in Type IIB Superstring Theory. We find several solutions
containing selfdual $\mathrm{SU}(2)$ instantons, some of which asymptote to
AdS$_{5}$ and some of which are very small, supersymmetric, deformations of
AdS$_{5}$. We also show how some of those solutions can be embedded in Romans'
$\mathrm{SU}(2)\times\mathrm{U}(1)$-gauged half-maximal supergravity, which was
obtained by Lu, Pope and Tran by compactification of the Type IIB Superstring
effective action. This provides another way of uplifting those solutions to 10
dimensions.
| hep-th | we construct supersymmetric solutions of theories of gauged mathcaln1d5 supergravity coupled to vector multiplets with a mathrmu1_rm r abelian fayetiliopoulos gauging and an independent su2 gauging associated to an mathrmsu2 isometry group of the real special scalar manifold these theories provide minimal supersymmetrizations of 5dimensional su2 einsteinyangmills theories with negative cosmological constant we consider a minimal model with these gauge groups and the magic model based on the jordan algebra bfj_3mathbbc with gauge group mathrmsu3timesmathrmu1_rm r which is a consistent truncation of maximal mathrmso6gauged supergravity in d5 and whose solutions can be embedded in type iib superstring theory we find several solutions containing selfdual mathrmsu2 instantons some of which asymptote to ads_5 and some of which are very small supersymmetric deformations of ads_5 we also show how some of those solutions can be embedded in romans mathrmsu2timesmathrmu1gauged halfmaximal supergravity which was obtained by lu pope and tran by compactification of the type iib superstring effective action this provides another way of uplifting those solutions to 10 dimensions | [['we', 'construct', 'supersymmetric', 'solutions', 'of', 'theories', 'of', 'gauged', 'mathcaln1d5', 'supergravity', 'coupled', 'to', 'vector', 'multiplets', 'with', 'a', 'mathrmu1_rm', 'r', 'abelian', 'fayetiliopoulos', 'gauging', 'and', 'an', 'independent', 'su2', 'gauging', 'associated', 'to', 'an', 'mathrmsu2', 'isometry', 'group', 'of', 'the', 'real', 'special', 'scalar', 'manifold', 'these', 'theories', 'provide', 'minimal', 'supersymmetrizations', 'of', '5dimensional', 'su2', 'einsteinyangmills', 'theories', 'with', 'negative', 'cosmological', 'constant', 'we', 'consider', 'a', 'minimal', 'model', 'with', 'these', 'gauge', 'groups', 'and', 'the', 'magic', 'model', 'based', 'on', 'the', 'jordan', 'algebra', 'bfj_3mathbbc', 'with', 'gauge', 'group', 'mathrmsu3timesmathrmu1_rm', 'r', 'which', 'is', 'a', 'consistent', 'truncation', 'of', 'maximal', 'mathrmso6gauged', 'supergravity', 'in', 'd5', 'and', 'whose', 'solutions', 'can', 'be', 'embedded', 'in', 'type', 'iib', 'superstring', 'theory', 'we', 'find', 'several', 'solutions', 'containing', 'selfdual', 'mathrmsu2', 'instantons', 'some', 'of', 'which', 'asymptote', 'to', 'ads_5', 'and', 'some', 'of', 'which', 'are', 'very', 'small', 'supersymmetric', 'deformations', 'of', 'ads_5', 'we', 'also', 'show', 'how', 'some', 'of', 'those', 'solutions', 'can', 'be', 'embedded', 'in', 'romans', 'mathrmsu2timesmathrmu1gauged', 'halfmaximal', 'supergravity', 'which', 'was', 'obtained', 'by', 'lu', 'pope', 'and', 'tran', 'by', 'compactification', 'of', 'the', 'type', 'iib', 'superstring', 'effective', 'action', 'this', 'provides', 'another', 'way', 'of', 'uplifting', 'those', 'solutions', 'to', '10', 'dimensions']] | [-0.1577314493356284, 0.1571227103713625, -0.01432447485995959, 0.08725474292979292, -0.13231489837591923, -0.23053950570836107, -0.054201020136105345, 0.30294168021194406, -0.12242141881992358, -0.25388381749544126, 0.15711168819960344, -0.28551730143502124, -0.17549513228185568, 0.08007673520641112, -0.11915724778038837, -0.01094215662328538, -0.02653229963439314, 0.08340297918061737, -0.14059557125076466, -0.3311000054612501, 0.3431749875853937, -0.04499685591931299, 0.2177791187701666, -0.03349668483729966, 0.1127077717455509, -0.0769252717026411, 0.025242423269209332, 0.009315405139317794, -0.121872764980722, 0.16961119508208788, 0.2449622241554562, 0.08911380966685485, 0.0588061661019875, -0.4434455624139457, -0.22726157698086144, 0.13173009831493038, 0.20976396600472863, 0.1621483144182596, -0.02825163479284123, -0.32267472108027767, 0.08111544642799898, -0.2219032587509556, -0.17283608308148726, -0.10492186311354733, 0.025119594136333984, -0.1039311144246448, -0.24634004074802496, 0.043765131490065, -0.04138248044164469, 0.03129458406243057, -0.11508921451392289, -0.05214049016495716, -0.10646494532941106, 0.006857078580289894, 0.17279789689855984, 0.08189302883024172, 0.08888030084578888, -0.15712760103959011, -0.15139504459105224, 0.36280792274205764, -0.09776024720544771, -0.2675590010140068, 0.13870905050053406, -0.11253420824636214, -0.1895267699804643, 0.08545894713230685, 0.06661906649549462, 0.19855263689243646, -0.11976510691832497, 0.28080537591689203, -0.05970620512326034, 0.11209587537631485, 0.09831399033540246, 0.046636397525182234, 0.2232319758337292, 0.09549492306035498, 0.029597052169445994, 0.10687498252127342, 0.05005867021868399, -0.08805125745310541, -0.4564119531130939, -0.11650850745901373, -0.028343766973996015, 0.20673626101639422, -0.2177210517587561, -0.20034372941764383, 0.37938788844422894, 0.05471469421136361, 0.1513038011331412, 0.07187574888110994, 0.08699807196693576, 0.04214098284842435, 0.0948527267344458, 0.051158811298332045, 0.22655071352839162, 0.17618633978363843, -0.0065424682497284056, -0.2241796420088836, -0.23397714591162824, 0.24032750135137243] |
1,802.03333 | Perihelion precession in binary systems: higher order corrections | Higher order corrections (up to n-th order) are obtained for the perihelion
precession in binary systems like OJ287 using the Schwarzschild metric and
complex integration. The corrections are performed considering the third root
of the motion equation and developing the expansion in terms of
$r_s/\left(a(1-e^2)\right)$.}The results are compared with other expansions
that appear in the literature giving corrections to second and third order.
Finally, we simulate the shape of relativistic orbits for binary systems with
different masses.
| gr-qc | higher order corrections up to nth order are obtained for the perihelion precession in binary systems like oj287 using the schwarzschild metric and complex integration the corrections are performed considering the third root of the motion equation and developing the expansion in terms of r_slefta1e2rightthe results are compared with other expansions that appear in the literature giving corrections to second and third order finally we simulate the shape of relativistic orbits for binary systems with different masses | [['higher', 'order', 'corrections', 'up', 'to', 'nth', 'order', 'are', 'obtained', 'for', 'the', 'perihelion', 'precession', 'in', 'binary', 'systems', 'like', 'oj287', 'using', 'the', 'schwarzschild', 'metric', 'and', 'complex', 'integration', 'the', 'corrections', 'are', 'performed', 'considering', 'the', 'third', 'root', 'of', 'the', 'motion', 'equation', 'and', 'developing', 'the', 'expansion', 'in', 'terms', 'of', 'r_slefta1e2rightthe', 'results', 'are', 'compared', 'with', 'other', 'expansions', 'that', 'appear', 'in', 'the', 'literature', 'giving', 'corrections', 'to', 'second', 'and', 'third', 'order', 'finally', 'we', 'simulate', 'the', 'shape', 'of', 'relativistic', 'orbits', 'for', 'binary', 'systems', 'with', 'different', 'masses']] | [-0.13825943352850645, 0.08057808523421715, -0.05674136731479513, 0.07084917639823336, -0.05756471737434989, -0.06543886731378734, -0.03645895757883983, 0.30549576090599756, -0.21142803592068193, -0.3237938658383332, 0.11904837211171214, -0.34263398335315287, -0.08915497111095312, 0.2419457026071062, -0.015172133690947177, 0.07486120627359732, 0.03701488715964124, 0.08456547124047861, -0.13092595559704168, -0.2737884846221852, 0.34618353235572086, 0.06017208307687389, 0.12168143562188274, -0.02608392264473399, 0.06629568223204267, -0.020810906744660122, -0.027484659805180087, 0.02048534651188866, -0.11082258004142587, 0.14181578407480724, 0.1809967725972743, 0.0050003042652908905, 0.18300614010322055, -0.3815936704019183, -0.166379287244605, 0.04683966728503277, 0.13710532830660477, 0.15284455150954032, -0.02360587204365354, -0.28740355349452185, 0.08382338221724096, -0.25055197318081474, -0.1805409175270286, -0.10817771480957929, 0.03033982261733495, 0.05816996897766857, -0.2439666369341706, 0.10246376733687755, 0.05434218459566565, 0.003862805235640783, -0.09415785267973613, -0.11887182064636267, -0.009009020096671424, 0.15820899497913687, 0.07909677666765147, 0.024524135404805605, 0.0858517273660063, -0.08975846817300312, -0.1553813146586579, 0.4931037686765194, -0.0732906252217761, -0.1889656880551851, 0.16229203671805167, -0.2532693062002133, -0.1199283626996667, 0.13932609082640787, 0.2123904049911193, 0.1548823578387352, -0.12544527021236718, 0.0481627801116127, 0.11032536169391517, 0.13377525777506985, 0.1251729732121978, 0.017369938763103596, 0.21086390173724412, 0.09130553211281567, -0.03345734224115547, 0.12990600919415315, -0.10010280531193864, -0.14357102113334755, -0.30140755780188266, -0.10327477064167492, -0.11317882570438087, -0.008844899418028561, -0.1468354209847396, -0.13842263723429488, 0.34143851644751666, 0.15450813577167297, 0.16672336355488943, 0.07111161207706716, 0.2791839904200874, 0.17701880175522283, 0.07839526895641986, 0.07052404858098414, 0.2938581015792136, 0.13495172987888127, 0.0956900561853361, -0.21913511666666877, 0.021210410753969643, 0.11669707942852064] |
1,802.03334 | Learning Localized Spatio-Temporal Models From Streaming Data | We address the problem of predicting spatio-temporal processes with temporal
patterns that vary across spatial regions, when data is obtained as a stream.
That is, when the training dataset is augmented sequentially. Specifically, we
develop a localized spatio-temporal covariance model of the process that can
capture spatially varying temporal periodicities in the data. We then apply a
covariance-fitting methodology to learn the model parameters which yields a
predictor that can be updated sequentially with each new data point. The
proposed method is evaluated using both synthetic and real climate data which
demonstrate its ability to accurately predict data missing in spatial regions
over time.
| stat.ML cs.LG | we address the problem of predicting spatiotemporal processes with temporal patterns that vary across spatial regions when data is obtained as a stream that is when the training dataset is augmented sequentially specifically we develop a localized spatiotemporal covariance model of the process that can capture spatially varying temporal periodicities in the data we then apply a covariancefitting methodology to learn the model parameters which yields a predictor that can be updated sequentially with each new data point the proposed method is evaluated using both synthetic and real climate data which demonstrate its ability to accurately predict data missing in spatial regions over time | [['we', 'address', 'the', 'problem', 'of', 'predicting', 'spatiotemporal', 'processes', 'with', 'temporal', 'patterns', 'that', 'vary', 'across', 'spatial', 'regions', 'when', 'data', 'is', 'obtained', 'as', 'a', 'stream', 'that', 'is', 'when', 'the', 'training', 'dataset', 'is', 'augmented', 'sequentially', 'specifically', 'we', 'develop', 'a', 'localized', 'spatiotemporal', 'covariance', 'model', 'of', 'the', 'process', 'that', 'can', 'capture', 'spatially', 'varying', 'temporal', 'periodicities', 'in', 'the', 'data', 'we', 'then', 'apply', 'a', 'covariancefitting', 'methodology', 'to', 'learn', 'the', 'model', 'parameters', 'which', 'yields', 'a', 'predictor', 'that', 'can', 'be', 'updated', 'sequentially', 'with', 'each', 'new', 'data', 'point', 'the', 'proposed', 'method', 'is', 'evaluated', 'using', 'both', 'synthetic', 'and', 'real', 'climate', 'data', 'which', 'demonstrate', 'its', 'ability', 'to', 'accurately', 'predict', 'data', 'missing', 'in', 'spatial', 'regions', 'over', 'time']] | [-0.028272217605262995, 0.08721631086087848, -0.10828351477179134, 0.09815883141718322, -0.0852765528467095, -0.14611241246293327, 0.03458561106286581, 0.4428732535503443, -0.3181857329892736, -0.3261101050347596, 0.10358785303282433, -0.24764802565490737, -0.1716516956289127, 0.17328764948975836, -0.0702305440836161, 0.03096160593779432, 0.11225645976520858, 0.03583084439262024, -0.0386416981792421, -0.24787168721984892, 0.3170530911200472, 0.04607432140308677, 0.3095614049533943, -0.02861781095299255, 0.14037517184341888, -0.027201499717617497, -0.06357602641275785, 0.03435188638570818, -0.0347691839145501, 0.13473699457640534, 0.27600862825226075, 0.19832686918676895, 0.282368318082819, -0.433675037317195, -0.2787228228560495, 0.10484584562652247, 0.13337311536543867, 0.10912723239574545, -0.009147655318301279, -0.3221164223132203, 0.10923046502962853, -0.11202933061054175, -0.07358954541240502, -0.13584547649924328, -0.008272516260882027, 0.014218049586153797, -0.37153256096813864, 0.08702704416660284, -0.0033505711189100464, 0.03566046587634578, -0.0876422835880149, -0.018230793600929086, -0.061350048940122415, 0.17669449114405722, 0.035840603068314984, 0.021553135960751656, 0.10750345933223956, -0.07676676979505466, -0.11423371527547432, 0.34287187805200375, -0.07732379786869131, -0.23528368023305551, 0.16043928189619075, -0.13845419479552115, -0.10929193570124872, 0.11869991134888339, 0.2594565232193947, 0.10974429747614178, -0.19565861434218004, 0.022881737525362378, -0.07514644892958616, 0.2263936174559312, -0.004614135440330482, -0.03468771843076909, 0.17882543298623804, 0.22255436686835098, 0.018379263516551662, 0.1343770638883602, -0.2105664211207802, -0.09517943953588895, -0.2253935795042266, -0.07172913766167696, -0.19579889440854775, -0.07900373510410558, -0.135677143275705, -0.13404489547487244, 0.45533162570169683, 0.2503824778063928, 0.2800373062491417, 0.06548302590330493, 0.31787853065010124, 0.08162965117252965, 0.07420710496405519, 0.070701276865399, 0.11928301978657402, 0.007849177300423673, 0.11197512187131509, -0.17244282941270656, 0.10591336252457163, -0.01090232975491621] |
1,802.03335 | Black-box Variational Inference for Stochastic Differential Equations | Parameter inference for stochastic differential equations is challenging due
to the presence of a latent diffusion process. Working with an Euler-Maruyama
discretisation for the diffusion, we use variational inference to jointly learn
the parameters and the diffusion paths. We use a standard mean-field
variational approximation of the parameter posterior, and introduce a recurrent
neural network to approximate the posterior for the diffusion paths conditional
on the parameters. This neural network learns how to provide Gaussian state
transitions which bridge between observations in a very similar way to the
conditioned diffusion process. The resulting black-box inference method can be
applied to any SDE system with light tuning requirements. We illustrate the
method on a Lotka-Volterra system and an epidemic model, producing accurate
parameter estimates in a few hours.
| stat.CO stat.ML | parameter inference for stochastic differential equations is challenging due to the presence of a latent diffusion process working with an eulermaruyama discretisation for the diffusion we use variational inference to jointly learn the parameters and the diffusion paths we use a standard meanfield variational approximation of the parameter posterior and introduce a recurrent neural network to approximate the posterior for the diffusion paths conditional on the parameters this neural network learns how to provide gaussian state transitions which bridge between observations in a very similar way to the conditioned diffusion process the resulting blackbox inference method can be applied to any sde system with light tuning requirements we illustrate the method on a lotkavolterra system and an epidemic model producing accurate parameter estimates in a few hours | [['parameter', 'inference', 'for', 'stochastic', 'differential', 'equations', 'is', 'challenging', 'due', 'to', 'the', 'presence', 'of', 'a', 'latent', 'diffusion', 'process', 'working', 'with', 'an', 'eulermaruyama', 'discretisation', 'for', 'the', 'diffusion', 'we', 'use', 'variational', 'inference', 'to', 'jointly', 'learn', 'the', 'parameters', 'and', 'the', 'diffusion', 'paths', 'we', 'use', 'a', 'standard', 'meanfield', 'variational', 'approximation', 'of', 'the', 'parameter', 'posterior', 'and', 'introduce', 'a', 'recurrent', 'neural', 'network', 'to', 'approximate', 'the', 'posterior', 'for', 'the', 'diffusion', 'paths', 'conditional', 'on', 'the', 'parameters', 'this', 'neural', 'network', 'learns', 'how', 'to', 'provide', 'gaussian', 'state', 'transitions', 'which', 'bridge', 'between', 'observations', 'in', 'a', 'very', 'similar', 'way', 'to', 'the', 'conditioned', 'diffusion', 'process', 'the', 'resulting', 'blackbox', 'inference', 'method', 'can', 'be', 'applied', 'to', 'any', 'sde', 'system', 'with', 'light', 'tuning', 'requirements', 'we', 'illustrate', 'the', 'method', 'on', 'a', 'lotkavolterra', 'system', 'and', 'an', 'epidemic', 'model', 'producing', 'accurate', 'parameter', 'estimates', 'in', 'a', 'few', 'hours']] | [-0.04258446025801456, 0.047556189902898616, -0.07701132013132488, 0.10124428599892853, -0.13573087256871105, -0.16542970980920896, 0.08734159694441895, 0.4151480178986713, -0.3400021960416178, -0.3032450239196068, 0.07532172100288485, -0.22461432753695454, -0.16980877602252903, 0.1532318373944053, -0.06780466903367732, 0.10139926537636697, 0.11700829348020901, -0.0034114684903623874, -0.05307445472003672, -0.22983414688748932, 0.2838307399666863, 0.05287412045831521, 0.2633679066601349, -0.05569555711983813, 0.19204475902255594, -0.023342384493407448, 0.021799552060047706, -0.03491855178974334, -0.14453340420411445, 0.1472421791881147, 0.24326971952810766, 0.11247260471820597, 0.3324593045550773, -0.41879088738126546, -0.27001684875682175, 0.10837488565007299, 0.1482318936529529, 0.15092414737162071, 0.01878302935675872, -0.3252685738243456, -0.008346078653387197, -0.1629923679655066, -0.07385138943094731, -0.14247742538511346, -0.041888651958718076, 0.026041972362913016, -0.36250131480546127, 0.08211636539607302, 0.04595486212121442, 0.015563720228575816, -0.03824981179557682, -0.06575082486502709, 0.012282928274064435, 0.11115346309237593, 0.029530261022196424, 0.02357210940864729, 0.1272015192685282, -0.1451134969495002, -0.11978730117887493, 0.31240039709662126, -0.10376206966938348, -0.29115723184947895, 0.1647927689028713, -0.06103812562903081, -0.1409909062556864, 0.1397142211877279, 0.2305462983974043, 0.13237328411219276, -0.220381177701496, 0.04411789743224247, 0.013421515015679904, 0.17083451571217995, -0.024799584891412436, -0.06597373443912333, 0.10525689383338052, 0.2595856737979783, 0.10126386149823079, 0.1016210555639778, -0.15825692317851886, -0.17354625683574842, -0.2672924163391975, -0.13664644100145515, -0.17345148081502576, 0.04666725435022881, -0.16902172729690598, -0.20978715249640212, 0.39133472523586016, 0.2432898659658743, 0.22163627767114072, 0.12420159367332052, 0.28091664584793563, 0.1703103855692261, 0.008600528571960024, 0.11006360214687591, 0.1701423467474249, 0.14394179061348514, 0.10996331353708515, -0.19753476093691869, 0.16237473840766595, 0.07260451376379475] |
1,802.03336 | The Monadic Second Order Theory of Grid-Free 1-Safe Petri Nets is
Decidable | Finite 1-safe Petri nets, also called \emph{net systems}, are natural models
of asynchronous concurrency. The event structure of a net system describes all
its possible executions and their concurrent nature: two events may be causally
ordered, occur in parallel or be conflicting. Monadic second order logic (MSO)
can be used to specify behavioural properties of net systems. Thiagarajan's
conjecture states that MSO is decidable if and only if the net system is
grid-free. The present paper gives a positive answer to this conjecture.
| cs.LO | finite 1safe petri nets also called emphnet systems are natural models of asynchronous concurrency the event structure of a net system describes all its possible executions and their concurrent nature two events may be causally ordered occur in parallel or be conflicting monadic second order logic mso can be used to specify behavioural properties of net systems thiagarajans conjecture states that mso is decidable if and only if the net system is gridfree the present paper gives a positive answer to this conjecture | [['finite', '1safe', 'petri', 'nets', 'also', 'called', 'emphnet', 'systems', 'are', 'natural', 'models', 'of', 'asynchronous', 'concurrency', 'the', 'event', 'structure', 'of', 'a', 'net', 'system', 'describes', 'all', 'its', 'possible', 'executions', 'and', 'their', 'concurrent', 'nature', 'two', 'events', 'may', 'be', 'causally', 'ordered', 'occur', 'in', 'parallel', 'or', 'be', 'conflicting', 'monadic', 'second', 'order', 'logic', 'mso', 'can', 'be', 'used', 'to', 'specify', 'behavioural', 'properties', 'of', 'net', 'systems', 'thiagarajans', 'conjecture', 'states', 'that', 'mso', 'is', 'decidable', 'if', 'and', 'only', 'if', 'the', 'net', 'system', 'is', 'gridfree', 'the', 'present', 'paper', 'gives', 'a', 'positive', 'answer', 'to', 'this', 'conjecture']] | [-0.21790951147402932, 0.12277534793460423, -0.06316882575771249, 0.13934976458350742, -0.15496674954050743, -0.1826016493425591, 0.0308284786879085, 0.3557022904818196, -0.34958241323418004, -0.27619423621856587, 0.09004217117496698, -0.25601998395740805, -0.12187432541608492, 0.12173239985287826, -0.13154650080903638, 0.04035361756204355, 0.07279087838762235, 0.07838284689933062, 0.008065726133148618, -0.30097519785517873, 0.2792739827106366, -0.04016412600659106, 0.20139342082221423, 0.0591241403045587, 0.11016321756945151, -0.006381430822174724, 0.06477196098634655, 0.0881293912406829, -0.03593023937160402, 0.07243882868901781, 0.3352809287968362, 0.21954768244177103, 0.23648060333244958, -0.45147950924569513, -0.13378875164837553, 0.16295164256788244, 0.08532614177007727, 0.10499721569422257, 0.04578733073388476, -0.2552144518917108, 0.15344809134286352, -0.22878579450089756, -0.03658241884237746, -0.11741591917305458, 0.05170449791703283, 0.027952766977250576, -0.23761163555190717, 0.014610257269118958, 0.23892081989452424, 0.070773424058244, -0.04374738248269551, -0.018354886276583562, -0.07335298525442074, 0.09403261507395655, -0.03210254352377267, 0.019389424397803206, 0.07322591056524799, -0.03981608336098583, -0.24645548815861706, 0.3488197147125015, 0.0033833482515680173, -0.16347369813912538, 0.19453957657295665, -0.10818122083991312, -0.17808383802610744, 0.12285505538584846, 0.16763464417649296, 0.14501268053200186, -0.15520270466421185, 0.09216608925262557, -0.07724373256106203, 0.23670048064484103, 0.08421160221361078, 0.024497351626206827, 0.27402721075113956, 0.16334760359704223, 0.05650659494965178, 0.16310814330382728, 0.06703546348527618, -0.1090867868858878, -0.298531931802267, -0.16819004761055112, -0.06400870899357493, -0.02185852414780728, -0.011999489370060562, -0.22183702281880668, 0.33734374797743993, 0.18424638272291505, 0.14680242782072506, 0.1671593464604329, 0.2921289027464099, 0.13258699096012405, 0.07898942454116101, 0.06466872066759118, 0.13355414735198748, 0.13616703532454444, 0.12077598817782795, -0.1603514173997299, 0.19970807523989095, 0.08521921127727937] |
1,802.03337 | Large Scale Constrained Linear Regression Revisited: Faster Algorithms
via Preconditioning | In this paper, we revisit the large-scale constrained linear regression
problem and propose faster methods based on some recent developments in
sketching and optimization. Our algorithms combine (accelerated) mini-batch SGD
with a new method called two-step preconditioning to achieve an approximate
solution with a time complexity lower than that of the state-of-the-art
techniques for the low precision case. Our idea can also be extended to the
high precision case, which gives an alternative implementation to the Iterative
Hessian Sketch (IHS) method with significantly improved time complexity.
Experiments on benchmark and synthetic datasets suggest that our methods indeed
outperform existing ones considerably in both the low and high precision cases.
| cs.LG math.OC stat.ML | in this paper we revisit the largescale constrained linear regression problem and propose faster methods based on some recent developments in sketching and optimization our algorithms combine accelerated minibatch sgd with a new method called twostep preconditioning to achieve an approximate solution with a time complexity lower than that of the stateoftheart techniques for the low precision case our idea can also be extended to the high precision case which gives an alternative implementation to the iterative hessian sketch ihs method with significantly improved time complexity experiments on benchmark and synthetic datasets suggest that our methods indeed outperform existing ones considerably in both the low and high precision cases | [['in', 'this', 'paper', 'we', 'revisit', 'the', 'largescale', 'constrained', 'linear', 'regression', 'problem', 'and', 'propose', 'faster', 'methods', 'based', 'on', 'some', 'recent', 'developments', 'in', 'sketching', 'and', 'optimization', 'our', 'algorithms', 'combine', 'accelerated', 'minibatch', 'sgd', 'with', 'a', 'new', 'method', 'called', 'twostep', 'preconditioning', 'to', 'achieve', 'an', 'approximate', 'solution', 'with', 'a', 'time', 'complexity', 'lower', 'than', 'that', 'of', 'the', 'stateoftheart', 'techniques', 'for', 'the', 'low', 'precision', 'case', 'our', 'idea', 'can', 'also', 'be', 'extended', 'to', 'the', 'high', 'precision', 'case', 'which', 'gives', 'an', 'alternative', 'implementation', 'to', 'the', 'iterative', 'hessian', 'sketch', 'ihs', 'method', 'with', 'significantly', 'improved', 'time', 'complexity', 'experiments', 'on', 'benchmark', 'and', 'synthetic', 'datasets', 'suggest', 'that', 'our', 'methods', 'indeed', 'outperform', 'existing', 'ones', 'considerably', 'in', 'both', 'the', 'low', 'and', 'high', 'precision', 'cases']] | [-0.008843335686166078, -0.014478232891783717, -0.09737650172810557, 0.06122752176725878, -0.0842344685150054, -0.17716945107137666, 0.050085456299578446, 0.41530970525030697, -0.26352850278976175, -0.34161163360700697, 0.1476899537037836, -0.22538519726901682, -0.17109590406751757, 0.27163720874696834, -0.11265109748784624, 0.0824417141821543, 0.14728679518223903, -0.0179760040792235, -0.1556210522198144, -0.35077724325547527, 0.2252252229976408, 0.12075716123377922, 0.331557991910179, 0.012140389215713794, 0.1136279252673918, -0.04635899970222504, -0.0221830201078924, 0.04193212093376283, -0.07767977396417687, 0.1873719481689377, 0.24760835305061363, 0.17670817186611645, 0.29241916957661646, -0.42678917958102097, -0.20259182657961042, 0.09023420506268057, 0.18824122053220732, 0.13505525704606228, -0.10750018138600805, -0.2496879582054093, 0.07964267286230647, -0.14305797330351597, -0.06360387360386618, -0.1688618710811395, -0.08283992168074901, -0.016546407805268712, -0.3069983010581874, 0.07621810466895913, 0.037989297014481706, -0.00556525445346712, -0.02320932226528952, -0.19577052852634444, 0.12213428547272646, 0.014383520401262362, 0.04187663187114778, 0.07474744300264011, 0.0879384819845404, -0.10997521309363613, -0.1967155114681366, 0.33795722220263896, -0.10822085547327692, -0.21624002036630013, 0.23325909708558215, -0.04683584361892501, -0.1767871323780695, 0.12550231713989596, 0.24225904223500588, 0.19861482044493933, -0.0743705277980536, 0.05759811944193677, -0.007748415614606454, 0.16449334339127628, -0.006418230261978343, -0.009866900848857033, 0.06265419480869325, 0.2197607983365108, 0.12288536109487364, 0.11207692072098784, -0.08224026557622016, -0.08979659085802802, -0.2041242765262723, -0.1253929232821774, -0.1670415692262078, -0.05813193115738964, -0.14944176063627226, -0.13389054590028737, 0.37549231876405553, 0.2642189410105006, 0.20843357904152005, 0.1355747737411256, 0.39908018230178627, 0.08987018000227698, 0.05301794399498799, 0.12764802836992462, 0.22807974987818194, 0.06178656033530763, 0.11833695352180015, -0.2290438996326742, 0.04171063024828364, 0.08448847921120875] |
1,802.03338 | Extrapolation for multilinear Muckenhoupt classes and applications to
the bilinear Hilbert transform | In this paper we solve a long standing problem about the multivariable Rubio
de Francia extrapolation theorem for the multilinear Muckenhoupt classes
$A_{\vec{p}}$, which were extensively studied by Lerner et al. and which are
the natural ones for the class of multilinear Calder\'on-Zygmund operators.
Furthermore, we go beyond the classes $A_{\vec{p}}$ and extrapolate within the
classes $A_{\vec{p},\vec{r}}$ which appear naturally associated to the weighted
norm inequalities for multilinear sparse forms which control fundamental
operators such as the bilinear Hilbert transform. We give several applications
which can be easily obtained using extrapolation. First, for the bilinear
Hilbert transform one can extrapolate from the recent result of Culiuc et al.
who considered the Banach range and extend the estimates to the quasi-Banach
range. As a direct consequence, we obtain weighted vector-valued inequalities
reproving some of the results by Benea and Muscalu. We also extend recent
results of Carando et al. on Marcinkiewicz-Zygmund estimates for multilinear
Calder\'on-Zygmund operators. Finally, our last application gives new weighted
estimates for the commutators of multilinear Calder\'on-Zygmund operators and
for the bilinear Hilbert transform with BMO functions using ideas from B\'enyi
et al.
| math.CA | in this paper we solve a long standing problem about the multivariable rubio de francia extrapolation theorem for the multilinear muckenhoupt classes a_vecp which were extensively studied by lerner et al and which are the natural ones for the class of multilinear calderonzygmund operators furthermore we go beyond the classes a_vecp and extrapolate within the classes a_vecpvecr which appear naturally associated to the weighted norm inequalities for multilinear sparse forms which control fundamental operators such as the bilinear hilbert transform we give several applications which can be easily obtained using extrapolation first for the bilinear hilbert transform one can extrapolate from the recent result of culiuc et al who considered the banach range and extend the estimates to the quasibanach range as a direct consequence we obtain weighted vectorvalued inequalities reproving some of the results by benea and muscalu we also extend recent results of carando et al on marcinkiewiczzygmund estimates for multilinear calderonzygmund operators finally our last application gives new weighted estimates for the commutators of multilinear calderonzygmund operators and for the bilinear hilbert transform with bmo functions using ideas from benyi et al | [['in', 'this', 'paper', 'we', 'solve', 'a', 'long', 'standing', 'problem', 'about', 'the', 'multivariable', 'rubio', 'de', 'francia', 'extrapolation', 'theorem', 'for', 'the', 'multilinear', 'muckenhoupt', 'classes', 'a_vecp', 'which', 'were', 'extensively', 'studied', 'by', 'lerner', 'et', 'al', 'and', 'which', 'are', 'the', 'natural', 'ones', 'for', 'the', 'class', 'of', 'multilinear', 'calderonzygmund', 'operators', 'furthermore', 'we', 'go', 'beyond', 'the', 'classes', 'a_vecp', 'and', 'extrapolate', 'within', 'the', 'classes', 'a_vecpvecr', 'which', 'appear', 'naturally', 'associated', 'to', 'the', 'weighted', 'norm', 'inequalities', 'for', 'multilinear', 'sparse', 'forms', 'which', 'control', 'fundamental', 'operators', 'such', 'as', 'the', 'bilinear', 'hilbert', 'transform', 'we', 'give', 'several', 'applications', 'which', 'can', 'be', 'easily', 'obtained', 'using', 'extrapolation', 'first', 'for', 'the', 'bilinear', 'hilbert', 'transform', 'one', 'can', 'extrapolate', 'from', 'the', 'recent', 'result', 'of', 'culiuc', 'et', 'al', 'who', 'considered', 'the', 'banach', 'range', 'and', 'extend', 'the', 'estimates', 'to', 'the', 'quasibanach', 'range', 'as', 'a', 'direct', 'consequence', 'we', 'obtain', 'weighted', 'vectorvalued', 'inequalities', 'reproving', 'some', 'of', 'the', 'results', 'by', 'benea', 'and', 'muscalu', 'we', 'also', 'extend', 'recent', 'results', 'of', 'carando', 'et', 'al', 'on', 'marcinkiewiczzygmund', 'estimates', 'for', 'multilinear', 'calderonzygmund', 'operators', 'finally', 'our', 'last', 'application', 'gives', 'new', 'weighted', 'estimates', 'for', 'the', 'commutators', 'of', 'multilinear', 'calderonzygmund', 'operators', 'and', 'for', 'the', 'bilinear', 'hilbert', 'transform', 'with', 'bmo', 'functions', 'using', 'ideas', 'from', 'benyi', 'et', 'al']] | [-0.005153745676026396, 0.061561349789490516, -0.04780860813274478, 0.11706346536811907, -0.1404186144683753, -0.07610556548562548, 0.024572516298971808, 0.3003230941236404, -0.3290496329554235, -0.2430412646626001, 0.15419920827527833, -0.25750952294101415, -0.17010416568297407, 0.27498707242067094, -0.1387738532072905, 0.0833499314014815, 0.02260120557722352, -0.040536653375728864, -0.11450873989277803, -0.2974722657818347, 0.38639770964231424, 0.0020952124032191932, 0.175699395982994, 0.05122337339676249, 0.03336641871757583, 0.07389208833363069, -0.07204565639435516, -0.05728878237752487, -0.16406484823749887, 0.1776968450861244, 0.28960948467568454, 0.08718088708859717, 0.2916156125113206, -0.39394727739019564, -0.21104029957559364, 0.1766277505742872, 0.10660956870845478, 0.02073249874482154, -0.01880780302061517, -0.36349966921641125, 0.03628554856645085, -0.156420079363591, -0.12066626611530133, -0.15114759652414764, 0.015087137189845595, 0.062098771774048066, -0.39245143382931535, 0.11637413630349962, 0.11802209279393656, 0.023979325352347983, -0.12760597738467724, -0.18578594848994448, 0.06459742971144253, 0.05564782991954733, -0.04441916153281573, 0.06201337691416721, 0.03361047640108787, -0.0032097354047911485, -0.17288327052095986, 0.2589501727049102, -0.06499994502709065, -0.17936597455738354, 0.14447921896150903, -0.12261134609276347, -0.16940999132803763, -0.005703695753650011, 0.13150892533240435, 0.1428463310357588, -0.11708937604587687, 0.17370470174247873, -0.13967495567846092, 0.050871082708118076, 0.14060902831261046, 0.07871721527265871, 0.017434020676655167, 0.04360461879886039, 0.1144798863324863, 0.11176579477931069, 0.009632450152307485, -0.06516878183743835, -0.3042763554454407, -0.16310916135831655, -0.1789866522885859, 0.052303688315947984, -0.11143581220336352, -0.1323384575516684, 0.39020309474891174, 0.11134678672533482, 0.19922350975684822, 0.13800376546176898, 0.17343553130859105, 0.13245643827869333, 0.09112753770940522, 0.06647869615572626, 0.20383225755880552, 0.2219076525184589, 0.1564109207247384, -0.08989445287253424, -0.018957732239315468, 0.2582508365183299] |
1,802.03339 | The orientation of Eta Carinae and the powering mechanism of
intermediate luminosity optical transients (ILOTs) | Contrary to recent claims, we argue that the orientation of the massive
binary system Eta Carinae is such that the secondary star is closer to us at
periastron passage, and it is on the far side during most of the time of the
eccentric orbit. The binary orientation we dispute is based on problematic
interpretations of recent observations. Among these observations are the radial
velocity of the absorption component of He I P-Cyg lines, of the He II
$\lambda4686$ emission line, and of the Br$\gamma$ line emitted by clumps close
to the binary system. We also base our orientation on observations of
asymmetric molecular clumps that were recently observed by ALMA around the
binary system, and were claimed to compose a torus with a missing segment. The
orientation has implications for the modeling of the binary interaction during
the nineteenth century Great Eruption (GE) of Eta Carinae that occurred close
to periastron passage. The orientation where the secondary is closer to us at
periastron leads us to suggest that the mass-missing side of the molecular
clumps is a result of accretion onto the secondary star during the periastron
passage when the clumps were ejected, probably during the GE. The secondary
star accreted a few solar masses during the GE and the energy from the
accretion process consists the majority of the GE energy. This in turn
strengthens the more general model according to which many
intermediate-luminosity optical transients (ILOTs) are powered by accretion
onto a secondary star.
| astro-ph.SR | contrary to recent claims we argue that the orientation of the massive binary system eta carinae is such that the secondary star is closer to us at periastron passage and it is on the far side during most of the time of the eccentric orbit the binary orientation we dispute is based on problematic interpretations of recent observations among these observations are the radial velocity of the absorption component of he i pcyg lines of the he ii lambda4686 emission line and of the brgamma line emitted by clumps close to the binary system we also base our orientation on observations of asymmetric molecular clumps that were recently observed by alma around the binary system and were claimed to compose a torus with a missing segment the orientation has implications for the modeling of the binary interaction during the nineteenth century great eruption ge of eta carinae that occurred close to periastron passage the orientation where the secondary is closer to us at periastron leads us to suggest that the massmissing side of the molecular clumps is a result of accretion onto the secondary star during the periastron passage when the clumps were ejected probably during the ge the secondary star accreted a few solar masses during the ge and the energy from the accretion process consists the majority of the ge energy this in turn strengthens the more general model according to which many intermediateluminosity optical transients ilots are powered by accretion onto a secondary star | [['contrary', 'to', 'recent', 'claims', 'we', 'argue', 'that', 'the', 'orientation', 'of', 'the', 'massive', 'binary', 'system', 'eta', 'carinae', 'is', 'such', 'that', 'the', 'secondary', 'star', 'is', 'closer', 'to', 'us', 'at', 'periastron', 'passage', 'and', 'it', 'is', 'on', 'the', 'far', 'side', 'during', 'most', 'of', 'the', 'time', 'of', 'the', 'eccentric', 'orbit', 'the', 'binary', 'orientation', 'we', 'dispute', 'is', 'based', 'on', 'problematic', 'interpretations', 'of', 'recent', 'observations', 'among', 'these', 'observations', 'are', 'the', 'radial', 'velocity', 'of', 'the', 'absorption', 'component', 'of', 'he', 'i', 'pcyg', 'lines', 'of', 'the', 'he', 'ii', 'lambda4686', 'emission', 'line', 'and', 'of', 'the', 'brgamma', 'line', 'emitted', 'by', 'clumps', 'close', 'to', 'the', 'binary', 'system', 'we', 'also', 'base', 'our', 'orientation', 'on', 'observations', 'of', 'asymmetric', 'molecular', 'clumps', 'that', 'were', 'recently', 'observed', 'by', 'alma', 'around', 'the', 'binary', 'system', 'and', 'were', 'claimed', 'to', 'compose', 'a', 'torus', 'with', 'a', 'missing', 'segment', 'the', 'orientation', 'has', 'implications', 'for', 'the', 'modeling', 'of', 'the', 'binary', 'interaction', 'during', 'the', 'nineteenth', 'century', 'great', 'eruption', 'ge', 'of', 'eta', 'carinae', 'that', 'occurred', 'close', 'to', 'periastron', 'passage', 'the', 'orientation', 'where', 'the', 'secondary', 'is', 'closer', 'to', 'us', 'at', 'periastron', 'leads', 'us', 'to', 'suggest', 'that', 'the', 'massmissing', 'side', 'of', 'the', 'molecular', 'clumps', 'is', 'a', 'result', 'of', 'accretion', 'onto', 'the', 'secondary', 'star', 'during', 'the', 'periastron', 'passage', 'when', 'the', 'clumps', 'were', 'ejected', 'probably', 'during', 'the', 'ge', 'the', 'secondary', 'star', 'accreted', 'a', 'few', 'solar', 'masses', 'during', 'the', 'ge', 'and', 'the', 'energy', 'from', 'the', 'accretion', 'process', 'consists', 'the', 'majority', 'of', 'the', 'ge', 'energy', 'this', 'in', 'turn', 'strengthens', 'the', 'more', 'general', 'model', 'according', 'to', 'which', 'many', 'intermediateluminosity', 'optical', 'transients', 'ilots', 'are', 'powered', 'by', 'accretion', 'onto', 'a', 'secondary', 'star']] | [-0.10535122643980174, 0.11509891802244403, -0.06713206094984965, 0.020047086596878955, -0.10491202535236452, -0.09229198131403636, 0.04305875330370268, 0.41301657635400574, -0.20759253722295634, -0.29331131249181625, 0.06975587767196774, -0.3060990346518035, -0.07639489553838484, 0.1880749516251565, -0.04500441464625784, -0.024438134520939302, 0.13097882868021224, 0.01957806737854986, -0.031109183467356714, -0.23690508022133971, 0.3168424941382628, 0.11964145557371884, 0.12207963339969273, -0.0028098568119623553, 0.03842077687632565, -0.036579299551563534, -0.029084373778489426, -0.07453662530844771, -0.1298389947314274, 0.07698949573493404, 0.1870129039755746, 0.14835246968484386, 0.2209473307740428, -0.4023218153885043, -0.22215905971446537, 0.047709042000077, 0.15348916547372937, 0.02904423118173334, -0.012090487200097177, -0.2668266586975452, 0.0664464310140489, -0.18897522587662305, -0.14112062292642952, 0.1201078101492873, 0.1154501419590135, 0.03428246251428575, -0.2112256329605068, 0.07311380494940113, 0.09274003251890625, 0.021096730903851064, -0.10185837464850032, -0.07031872133985616, -0.07557019521576935, 0.09647724448858923, 0.08091856269447448, 0.0733325303005948, 0.16783395234866416, -0.10173249718206896, -0.044932553984983865, 0.39144451416578385, -0.033566666756116796, -0.004396977779508485, 0.2392863293615647, -0.2254100212679676, -0.19181070236178735, 0.2174906410746337, 0.1466940953471978, 0.1277186035110456, -0.09599318784668454, -0.0320147998144517, -0.033804694962937656, 0.17744720198462027, 0.0840438883940924, -0.012873266187328012, 0.37169091020354894, 0.1057072856796648, -0.006014562541537547, 0.11175182654557379, -0.23625460162103873, -0.10581500229437085, -0.2164251726552299, -0.1310628016074226, -0.15845934719952748, 0.09086410809550585, -0.08256374411469485, -0.07134992288751149, 0.3405636294973658, 0.10481344396059167, 0.25592745204902884, -0.02666082940922342, 0.277295786505035, 0.1096204483026934, 0.06805252436381894, 0.11161871715562373, 0.3405466169190813, 0.1723756790407214, 0.1271498510935836, -0.24169423064023893, 0.12546419120124896, 0.031755790277194926] |
1,802.0334 | On the symmetry properties of a random passive scalar with and without
boundaries, and their connection between hot and cold states | We consider the evolution of a decaying passive scalar in the presence of a
gaussian white noise fluctuating linear shear flow known as the Majda Model. We
focus on deterministic initial data and establish the symmetry properties of
the evolving point wise probability measure for the random scalar. We identify,
for both point line source initial data, regions in the x-y plane outside of
which the PDF skewness is sign definite for all time, while inside these
regions we observe multiple sign changes corresponding to exchanges in symmetry
between hot and cold leaning states using exact representation formula for the
PDF at the origin, and away from the origin, using numerical evaluation of the
exact available Mehler kernels for the scalars statistical moments. A new,
rapidly convergent Monte-Carlo method is developed, dubbed Direct Monte-Carlo
(DMC), using the random Green's functions allowing for the fast construction of
the PDF for single point statistics, and multi-point statistics natural for
full Monte-Carlo simulations of the underlying stochastic differential
equations (FMC). This new method demonstrates the full evolution of the PDF
from short times, to its long time, limiting and collapsing universal
distribution at arbitrary points in the plane. Further, this method provides a
strong benchmark for FMC and we document numbers of field realization criteria
for the FMC to faithfully compute this complete dynamics. Armed with this
benchmark, we apply the FMC to a channel with a no-flux boundary condition
enforced on a channel and observe a dramatically different long time state
resulting from the wall. In particular, the channel case collapsing invariant
measure has negative skewness, with random states heavily leaning heavily
towards the hot state, in stark contrast to free space, where the limiting
skewness is positive, with its states leaning heavily towards the cold state.
| physics.flu-dyn math.AP | we consider the evolution of a decaying passive scalar in the presence of a gaussian white noise fluctuating linear shear flow known as the majda model we focus on deterministic initial data and establish the symmetry properties of the evolving point wise probability measure for the random scalar we identify for both point line source initial data regions in the xy plane outside of which the pdf skewness is sign definite for all time while inside these regions we observe multiple sign changes corresponding to exchanges in symmetry between hot and cold leaning states using exact representation formula for the pdf at the origin and away from the origin using numerical evaluation of the exact available mehler kernels for the scalars statistical moments a new rapidly convergent montecarlo method is developed dubbed direct montecarlo dmc using the random greens functions allowing for the fast construction of the pdf for single point statistics and multipoint statistics natural for full montecarlo simulations of the underlying stochastic differential equations fmc this new method demonstrates the full evolution of the pdf from short times to its long time limiting and collapsing universal distribution at arbitrary points in the plane further this method provides a strong benchmark for fmc and we document numbers of field realization criteria for the fmc to faithfully compute this complete dynamics armed with this benchmark we apply the fmc to a channel with a noflux boundary condition enforced on a channel and observe a dramatically different long time state resulting from the wall in particular the channel case collapsing invariant measure has negative skewness with random states heavily leaning heavily towards the hot state in stark contrast to free space where the limiting skewness is positive with its states leaning heavily towards the cold state | [['we', 'consider', 'the', 'evolution', 'of', 'a', 'decaying', 'passive', 'scalar', 'in', 'the', 'presence', 'of', 'a', 'gaussian', 'white', 'noise', 'fluctuating', 'linear', 'shear', 'flow', 'known', 'as', 'the', 'majda', 'model', 'we', 'focus', 'on', 'deterministic', 'initial', 'data', 'and', 'establish', 'the', 'symmetry', 'properties', 'of', 'the', 'evolving', 'point', 'wise', 'probability', 'measure', 'for', 'the', 'random', 'scalar', 'we', 'identify', 'for', 'both', 'point', 'line', 'source', 'initial', 'data', 'regions', 'in', 'the', 'xy', 'plane', 'outside', 'of', 'which', 'the', 'pdf', 'skewness', 'is', 'sign', 'definite', 'for', 'all', 'time', 'while', 'inside', 'these', 'regions', 'we', 'observe', 'multiple', 'sign', 'changes', 'corresponding', 'to', 'exchanges', 'in', 'symmetry', 'between', 'hot', 'and', 'cold', 'leaning', 'states', 'using', 'exact', 'representation', 'formula', 'for', 'the', 'pdf', 'at', 'the', 'origin', 'and', 'away', 'from', 'the', 'origin', 'using', 'numerical', 'evaluation', 'of', 'the', 'exact', 'available', 'mehler', 'kernels', 'for', 'the', 'scalars', 'statistical', 'moments', 'a', 'new', 'rapidly', 'convergent', 'montecarlo', 'method', 'is', 'developed', 'dubbed', 'direct', 'montecarlo', 'dmc', 'using', 'the', 'random', 'greens', 'functions', 'allowing', 'for', 'the', 'fast', 'construction', 'of', 'the', 'pdf', 'for', 'single', 'point', 'statistics', 'and', 'multipoint', 'statistics', 'natural', 'for', 'full', 'montecarlo', 'simulations', 'of', 'the', 'underlying', 'stochastic', 'differential', 'equations', 'fmc', 'this', 'new', 'method', 'demonstrates', 'the', 'full', 'evolution', 'of', 'the', 'pdf', 'from', 'short', 'times', 'to', 'its', 'long', 'time', 'limiting', 'and', 'collapsing', 'universal', 'distribution', 'at', 'arbitrary', 'points', 'in', 'the', 'plane', 'further', 'this', 'method', 'provides', 'a', 'strong', 'benchmark', 'for', 'fmc', 'and', 'we', 'document', 'numbers', 'of', 'field', 'realization', 'criteria', 'for', 'the', 'fmc', 'to', 'faithfully', 'compute', 'this', 'complete', 'dynamics', 'armed', 'with', 'this', 'benchmark', 'we', 'apply', 'the', 'fmc', 'to', 'a', 'channel', 'with', 'a', 'noflux', 'boundary', 'condition', 'enforced', 'on', 'a', 'channel', 'and', 'observe', 'a', 'dramatically', 'different', 'long', 'time', 'state', 'resulting', 'from', 'the', 'wall', 'in', 'particular', 'the', 'channel', 'case', 'collapsing', 'invariant', 'measure', 'has', 'negative', 'skewness', 'with', 'random', 'states', 'heavily', 'leaning', 'heavily', 'towards', 'the', 'hot', 'state', 'in', 'stark', 'contrast', 'to', 'free', 'space', 'where', 'the', 'limiting', 'skewness', 'is', 'positive', 'with', 'its', 'states', 'leaning', 'heavily', 'towards', 'the', 'cold', 'state']] | [-0.10780260794938115, 0.11825433277122487, -0.11987367475531617, 0.07850803967241703, -0.047050602816171565, -0.1093812558673701, 0.0529820012207877, 0.3613310403080057, -0.2577226948971718, -0.2557988060433102, 0.09951750955670693, -0.26778086813095703, -0.05940464417907899, 0.16271699361297917, 0.011467755796973322, 0.0735937423921206, 0.052730861503899225, 0.0273827287334933, -0.08376159347136015, -0.19078607056763466, 0.3309688629708805, 0.03824073117920908, 0.29128574679716157, 0.02453674895025916, 0.0995823202315339, 0.025417598377976375, -0.04405180733035303, -0.024015378541711686, -0.14109664333370608, 0.04595486276896012, 0.19902598570195673, 0.08283971703090405, 0.24792407449587422, -0.40615423362765274, -0.20983789711470432, 0.09999261721850262, 0.12835457824413285, 0.12592412579244286, -0.058377965492733074, -0.30476184659006106, 0.07931039907406696, -0.146170767035209, -0.1499975403530081, -0.05943494555935011, 0.018112637895411985, 0.01853991424076859, -0.28819730455466247, 0.12022035802809238, 0.029473811774751394, 0.04104291303714706, -0.037211978049569966, -0.11324469009414315, -0.021986345356424988, 0.11961122851353138, 0.030853206584608907, 0.04326123987300858, 0.11540472461621008, -0.1498646934352957, -0.0774122995774309, 0.3414723561786636, -0.09745536234419225, -0.2099961874773726, 0.1767751691205885, -0.1685503017796614, -0.12495543019830296, 0.14247303854958232, 0.18392868402445595, 0.12807814856138774, -0.13514458931887807, 0.07092038140399382, -0.028332210216529163, 0.15468185182741717, 0.03335129335933065, 0.00786346269424184, 0.2053715154686469, 0.13599472267837343, 0.05650544865530426, 0.1599495030213463, -0.11067115690290802, -0.1687393345791152, -0.3186513457717611, -0.13975709737998718, -0.19143282096098982, 0.04528530985827289, -0.10411496375706165, -0.19420239335329023, 0.38896149551274917, 0.15491897256381937, 0.2155000980434371, 0.07404778363001611, 0.30030280677443844, 0.13095383060330493, 0.014244596865627485, 0.10510497619319012, 0.1626783607713089, 0.12764101421965635, 0.11940631920598069, -0.20873717201342884, 0.05921024877579993, 0.04279794182817815] |
1,802.03341 | Automatic Passenger Counting: Introducing the t-Test Induced Equivalence
Test | Automatic passenger counting (APC) in public transport has been introduced in
the 1970s and has been rapidly emerging in recent years. Still, real-world
applications continue to face events that are difficult to classify. The
induced imprecision needs to be handled as statistical noise and thus methods
have been defined to ensure that measurement errors do not exceed certain
bounds. Various recommendations for such an APC validation have been made to
establish criteria that limit the bias and the variability of the measurement
errors. In those works, the misinterpretation of non-significance in
statistical hypothesis tests for the detection of differences (e.g. Student's
t-test) proves to be prevalent, although existing methods which were developed
under the term equivalence testing in biostatistics (i.e. bioequivalence
trials, Schuirmann in J Pharmacokinet Pharmacodyn 15(6):657-680, 1987) would be
appropriate instead. This heavily affects the calibration and validation
process of APC systems and has been the reason for unexpected results when the
sample sizes were not suitably chosen: Large sample sizes were assumed to
improve the assessment of systematic measurement errors of the devices from a
user's perspective as well as from a manufacturer's perspective, but the
regular t-test fails to achieve that. We introduce a variant of the t-test, the
revised t-test, which addresses both type I and type II errors appropriately
and allows a comprehensible transition from the long-established t-test in a
widely used industrial recommendation. This test is appealing, but still it is
susceptible to numerical instability. Finally, we analytically reformulate it
as a numerically stable equivalence test, which is thus easier to use. Our
results therefore allow to induce an equivalence test from a t-test and
increase the comparability of both tests, especially for decision makers.
| stat.AP | automatic passenger counting apc in public transport has been introduced in the 1970s and has been rapidly emerging in recent years still realworld applications continue to face events that are difficult to classify the induced imprecision needs to be handled as statistical noise and thus methods have been defined to ensure that measurement errors do not exceed certain bounds various recommendations for such an apc validation have been made to establish criteria that limit the bias and the variability of the measurement errors in those works the misinterpretation of nonsignificance in statistical hypothesis tests for the detection of differences eg students ttest proves to be prevalent although existing methods which were developed under the term equivalence testing in biostatistics ie bioequivalence trials schuirmann in j pharmacokinet pharmacodyn 156657680 1987 would be appropriate instead this heavily affects the calibration and validation process of apc systems and has been the reason for unexpected results when the sample sizes were not suitably chosen large sample sizes were assumed to improve the assessment of systematic measurement errors of the devices from a users perspective as well as from a manufacturers perspective but the regular ttest fails to achieve that we introduce a variant of the ttest the revised ttest which addresses both type i and type ii errors appropriately and allows a comprehensible transition from the longestablished ttest in a widely used industrial recommendation this test is appealing but still it is susceptible to numerical instability finally we analytically reformulate it as a numerically stable equivalence test which is thus easier to use our results therefore allow to induce an equivalence test from a ttest and increase the comparability of both tests especially for decision makers | [['automatic', 'passenger', 'counting', 'apc', 'in', 'public', 'transport', 'has', 'been', 'introduced', 'in', 'the', '1970s', 'and', 'has', 'been', 'rapidly', 'emerging', 'in', 'recent', 'years', 'still', 'realworld', 'applications', 'continue', 'to', 'face', 'events', 'that', 'are', 'difficult', 'to', 'classify', 'the', 'induced', 'imprecision', 'needs', 'to', 'be', 'handled', 'as', 'statistical', 'noise', 'and', 'thus', 'methods', 'have', 'been', 'defined', 'to', 'ensure', 'that', 'measurement', 'errors', 'do', 'not', 'exceed', 'certain', 'bounds', 'various', 'recommendations', 'for', 'such', 'an', 'apc', 'validation', 'have', 'been', 'made', 'to', 'establish', 'criteria', 'that', 'limit', 'the', 'bias', 'and', 'the', 'variability', 'of', 'the', 'measurement', 'errors', 'in', 'those', 'works', 'the', 'misinterpretation', 'of', 'nonsignificance', 'in', 'statistical', 'hypothesis', 'tests', 'for', 'the', 'detection', 'of', 'differences', 'eg', 'students', 'ttest', 'proves', 'to', 'be', 'prevalent', 'although', 'existing', 'methods', 'which', 'were', 'developed', 'under', 'the', 'term', 'equivalence', 'testing', 'in', 'biostatistics', 'ie', 'bioequivalence', 'trials', 'schuirmann', 'in', 'j', 'pharmacokinet', 'pharmacodyn', '156657680', '1987', 'would', 'be', 'appropriate', 'instead', 'this', 'heavily', 'affects', 'the', 'calibration', 'and', 'validation', 'process', 'of', 'apc', 'systems', 'and', 'has', 'been', 'the', 'reason', 'for', 'unexpected', 'results', 'when', 'the', 'sample', 'sizes', 'were', 'not', 'suitably', 'chosen', 'large', 'sample', 'sizes', 'were', 'assumed', 'to', 'improve', 'the', 'assessment', 'of', 'systematic', 'measurement', 'errors', 'of', 'the', 'devices', 'from', 'a', 'users', 'perspective', 'as', 'well', 'as', 'from', 'a', 'manufacturers', 'perspective', 'but', 'the', 'regular', 'ttest', 'fails', 'to', 'achieve', 'that', 'we', 'introduce', 'a', 'variant', 'of', 'the', 'ttest', 'the', 'revised', 'ttest', 'which', 'addresses', 'both', 'type', 'i', 'and', 'type', 'ii', 'errors', 'appropriately', 'and', 'allows', 'a', 'comprehensible', 'transition', 'from', 'the', 'longestablished', 'ttest', 'in', 'a', 'widely', 'used', 'industrial', 'recommendation', 'this', 'test', 'is', 'appealing', 'but', 'still', 'it', 'is', 'susceptible', 'to', 'numerical', 'instability', 'finally', 'we', 'analytically', 'reformulate', 'it', 'as', 'a', 'numerically', 'stable', 'equivalence', 'test', 'which', 'is', 'thus', 'easier', 'to', 'use', 'our', 'results', 'therefore', 'allow', 'to', 'induce', 'an', 'equivalence', 'test', 'from', 'a', 'ttest', 'and', 'increase', 'the', 'comparability', 'of', 'both', 'tests', 'especially', 'for', 'decision', 'makers']] | [-0.023815794170427302, 0.05871406666665936, -0.10442455683663379, 0.11569026048657395, -0.09295115056817524, -0.16899644063923522, 0.07579906730633565, 0.3905520075024358, -0.2267090290942858, -0.3488199208192326, 0.1501568236862333, -0.2666181820072927, -0.11668164193939538, 0.21850823390840582, -0.153403373494398, 0.09807804311181852, 0.07780169262987854, -0.0029951928718022275, -0.051282529382956375, -0.2891465657035945, 0.2508038920434427, 0.0797731154833648, 0.3372103435485178, 0.028568336834907466, 0.047268679999706034, -0.019750149309927672, -0.061081955668311365, 0.06742273259316219, -0.09981151191160059, 0.08574176311412228, 0.30475020992304014, 0.15418414041376421, 0.3291531522717959, -0.3924873618520725, -0.1939262112456337, 0.12935274489314735, 0.12754627358728796, 0.09760613504600534, -0.025146582231534115, -0.28290011689725875, 0.10143959274623099, -0.1769388754552042, -0.08731505202659236, -0.10065410733063258, 0.031549436104103976, 0.02191367781963132, -0.2869713308343442, 0.05605408178965161, 0.07037114830719583, 0.08765592528061625, 0.0026676081606276866, -0.12462853780772792, 0.04401539543152716, 0.1745278441767664, 0.09747078187298187, 0.0019064135627782422, 0.12449396139120898, -0.10311089172481899, -0.12612930456905994, 0.38035452256268326, -0.004256380128712874, -0.19485496911758202, 0.21018549786386373, -0.0878796520658066, -0.16273596091532158, 0.08352108539266188, 0.17724519972403666, 0.07928851675216969, -0.19893742546831916, 0.03746237373483848, -0.0009276570474043058, 0.16887690171696892, 0.060922105946251956, -0.017798856576561713, 0.1748350351705932, 0.15798977280913143, 0.024754565334391347, 0.09897920339736442, -0.08701379601810033, -0.06460884531005033, -0.24014118326061307, -0.14802366546489676, -0.14852241191732285, 0.033035075955232855, -0.027513292028454372, -0.1623669407257536, 0.3378757483364564, 0.22430170348018327, 0.14862084383437485, 0.04485727069329551, 0.2844313783495475, 0.09469711405455407, 0.09843937150360661, 0.04385334917845117, 0.2666718817453845, 0.08758029867625973, 0.08374484566595937, -0.15039716218009808, 0.14263484053127132, -0.0035359793198076394] |
1,802.03342 | Code algebras which are axial algebras and their $\mathbb{Z}_2$-gradings | A code algebra $A_C$ is a non-associative commutative algebra defined via a
binary linear code $C$. We study certain idempotents in code algebras, which we
call small idempotents, that are determined by a single non-zero codeword. For
a general code $C$, we show that small idempotents are primitive and semisimple
and we calculate their fusion law. If $C$ is a projective code generated by a
conjugacy class of codewords, we show that $A_C$ is generated by small
idempotents and so is, in fact, an axial algebra. Furthermore, we classify when
the fusion law is $\mathbb{Z}_2$-graded. In doing so, we exhibit an infinite
family of $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded axial algebras - these are
the first known examples of axial algebras with a non-trivial grading other
than a $\mathbb{Z}_2$-grading.
| math.RA math.GR math.OA | a code algebra a_c is a nonassociative commutative algebra defined via a binary linear code c we study certain idempotents in code algebras which we call small idempotents that are determined by a single nonzero codeword for a general code c we show that small idempotents are primitive and semisimple and we calculate their fusion law if c is a projective code generated by a conjugacy class of codewords we show that a_c is generated by small idempotents and so is in fact an axial algebra furthermore we classify when the fusion law is mathbbz_2graded in doing so we exhibit an infinite family of mathbbz_2 times mathbbz_2graded axial algebras these are the first known examples of axial algebras with a nontrivial grading other than a mathbbz_2grading | [['a', 'code', 'algebra', 'a_c', 'is', 'a', 'nonassociative', 'commutative', 'algebra', 'defined', 'via', 'a', 'binary', 'linear', 'code', 'c', 'we', 'study', 'certain', 'idempotents', 'in', 'code', 'algebras', 'which', 'we', 'call', 'small', 'idempotents', 'that', 'are', 'determined', 'by', 'a', 'single', 'nonzero', 'codeword', 'for', 'a', 'general', 'code', 'c', 'we', 'show', 'that', 'small', 'idempotents', 'are', 'primitive', 'and', 'semisimple', 'and', 'we', 'calculate', 'their', 'fusion', 'law', 'if', 'c', 'is', 'a', 'projective', 'code', 'generated', 'by', 'a', 'conjugacy', 'class', 'of', 'codewords', 'we', 'show', 'that', 'a_c', 'is', 'generated', 'by', 'small', 'idempotents', 'and', 'so', 'is', 'in', 'fact', 'an', 'axial', 'algebra', 'furthermore', 'we', 'classify', 'when', 'the', 'fusion', 'law', 'is', 'mathbbz_2graded', 'in', 'doing', 'so', 'we', 'exhibit', 'an', 'infinite', 'family', 'of', 'mathbbz_2', 'times', 'mathbbz_2graded', 'axial', 'algebras', 'these', 'are', 'the', 'first', 'known', 'examples', 'of', 'axial', 'algebras', 'with', 'a', 'nontrivial', 'grading', 'other', 'than', 'a', 'mathbbz_2grading']] | [-0.21064581600801338, 0.13901460094082665, -0.01860574988411769, 0.05810950442294901, -0.09691563567205791, -0.20942996047984158, -0.044070453652816394, 0.39425958905901226, -0.37105935826779357, -0.16624020431782044, 0.11135424504939852, -0.2473018308879719, -0.13443366306213042, 0.19123986024882586, -0.1157660189764722, -0.02038210685483165, 0.09258581969761363, 0.11310917165662561, -0.12783936010341027, -0.24821511582131423, 0.39240656699985266, 0.019584822115517916, 0.19910586977170575, -0.00320746055952022, 0.09773811152470964, -0.03526665732663657, -0.03299808074786727, 0.02029944349002714, -0.1479491443393012, 0.07352130744783651, 0.26784419632028966, 0.11472990613990641, 0.18778091019466667, -0.3289846447222526, -0.08156117354150093, 0.15656388533349697, 0.15690481995180663, 0.11850300884624529, -0.0707529873535451, -0.2095611338098977, 0.17674045053140688, -0.3104208828142238, -0.07428289514537605, -0.09291103261981219, 0.1076057271418413, -0.01816484919889638, -0.3114217016347019, -0.013209091163136892, 0.09621754498590553, 0.1673644871657921, -0.06732672026440029, -0.10429747935129507, -0.09051545418702835, 0.0661480661090334, -0.05210239054553861, 0.02321070616432865, 0.12086727002650381, -0.04883137265116804, -0.1473708388040818, 0.3800181614855001, -0.013986042666175987, -0.22922993507231623, 0.09348447599063908, -0.17870914183985737, -0.1515343513003447, 0.10144063531761131, 0.08392188556137539, 0.1480091615892542, -0.07868857259018114, 0.18147410879453038, -0.17517131328996685, 0.09147368738472107, 0.057651350758821954, -0.015472997439607594, 0.17683219813579132, 0.04991377095714034, -0.0056789058245836745, 0.15900020625133673, 0.04478732588893128, -0.00647248432690662, -0.3615372736036541, -0.17393628741976702, -0.1354303569237273, 0.11325201922140661, -0.08013344625353402, -0.1719263790707503, 0.3795912638306618, 0.11890788914798389, 0.1666759089086323, 0.11185797055654731, 0.22022448358909477, 0.0696584104527054, 0.18677080832218515, 0.11820821754915255, 0.11946859605063403, 0.20037938377428208, -0.05790199150168707, -0.14118718837446992, -0.03282591032736477, 0.19448889520699306] |
1,802.03343 | Long-Term Unemployed hirings: Should targeted or untargeted policies be
preferred? | To what extent, hiring incentives targeting a specific group of vulnerable
unemployed (i.e. long term unemployed) are more effective, with respect to
generalised incentives (without a definite target), to increase hirings of the
targeted group? Are generalized incentives able to influence hirings of the
vulnerable group? Do targeted policies have negative side effects too important
to accept them? Even though there is a huge literature on hiring subsidies,
these questions remained unresolved. We tried to answer them, comparing the
impact of two similar hiring policies, one oriented towards a target group and
one generalised, implemented on the italian labour market. We used
administrative data on job contracts, and counterfactual analysis methods. The
targeted policy had a positive and significant impact, while the generalized
policy didn't have a significant impact on the vulnerable group. Moreover, we
concluded the targeted policy didn't have any indirect negative side effect.
| econ.EM stat.AP | to what extent hiring incentives targeting a specific group of vulnerable unemployed ie long term unemployed are more effective with respect to generalised incentives without a definite target to increase hirings of the targeted group are generalized incentives able to influence hirings of the vulnerable group do targeted policies have negative side effects too important to accept them even though there is a huge literature on hiring subsidies these questions remained unresolved we tried to answer them comparing the impact of two similar hiring policies one oriented towards a target group and one generalised implemented on the italian labour market we used administrative data on job contracts and counterfactual analysis methods the targeted policy had a positive and significant impact while the generalized policy didnt have a significant impact on the vulnerable group moreover we concluded the targeted policy didnt have any indirect negative side effect | [['to', 'what', 'extent', 'hiring', 'incentives', 'targeting', 'a', 'specific', 'group', 'of', 'vulnerable', 'unemployed', 'ie', 'long', 'term', 'unemployed', 'are', 'more', 'effective', 'with', 'respect', 'to', 'generalised', 'incentives', 'without', 'a', 'definite', 'target', 'to', 'increase', 'hirings', 'of', 'the', 'targeted', 'group', 'are', 'generalized', 'incentives', 'able', 'to', 'influence', 'hirings', 'of', 'the', 'vulnerable', 'group', 'do', 'targeted', 'policies', 'have', 'negative', 'side', 'effects', 'too', 'important', 'to', 'accept', 'them', 'even', 'though', 'there', 'is', 'a', 'huge', 'literature', 'on', 'hiring', 'subsidies', 'these', 'questions', 'remained', 'unresolved', 'we', 'tried', 'to', 'answer', 'them', 'comparing', 'the', 'impact', 'of', 'two', 'similar', 'hiring', 'policies', 'one', 'oriented', 'towards', 'a', 'target', 'group', 'and', 'one', 'generalised', 'implemented', 'on', 'the', 'italian', 'labour', 'market', 'we', 'used', 'administrative', 'data', 'on', 'job', 'contracts', 'and', 'counterfactual', 'analysis', 'methods', 'the', 'targeted', 'policy', 'had', 'a', 'positive', 'and', 'significant', 'impact', 'while', 'the', 'generalized', 'policy', 'didnt', 'have', 'a', 'significant', 'impact', 'on', 'the', 'vulnerable', 'group', 'moreover', 'we', 'concluded', 'the', 'targeted', 'policy', 'didnt', 'have', 'any', 'indirect', 'negative', 'side', 'effect']] | [-0.11473176907349301, 0.0470835896358787, -0.09071901623057584, 0.17442283585862167, -0.21236323726631395, -0.22776091279308885, 0.16569287642319877, 0.43943452364956476, -0.21071195472286988, -0.308131920108779, 0.14057060532999058, -0.30210449563798636, -0.12418765877373517, 0.1509960462958775, -0.13075763782465039, 0.022878082762536122, 0.031544192321758, 0.054997004868386136, 0.00583619718046776, -0.3239553221070833, 0.33925114205898077, 0.10314982493682318, 0.3039484066722838, 0.06696077140545702, 0.07374127481327303, -0.03869304325342281, -0.09784472449714547, 0.034109222115821215, -0.09729516623726701, 0.087723585284213, 0.3032424066738825, 0.13148918488439273, 0.4224499420530788, -0.4426936154470664, -0.1618637460130841, 0.1612118178442733, 0.10029438064650517, 0.07293552591956591, -0.07260937853176098, -0.28331078525173337, 0.06031410047411281, -0.24619338368001867, -0.07861876184095258, -0.06430829486216431, 0.031970209103996214, -0.007274518456479075, -0.20797779250009726, -0.011068375145080371, 0.022150314116391213, 0.08433184447404865, -0.05058376979376253, -0.18114504280614935, -0.025747271997803082, 0.21566434890312486, 0.09467871071259253, 0.0011396999941335048, 0.18158709680444676, -0.12433841002926435, -0.1341891957268323, 0.36210992087750404, -0.018927066854826393, -0.19352744262360916, 0.16167851667914998, -0.09232391509201938, -0.17558296044414531, 0.0882260277229425, 0.22664579006511165, 0.08894155725632628, -0.11132200499550018, -0.007673932845012144, -0.026702886255942797, 0.16821219328127496, 0.0758356439294166, -0.026810541646937802, 0.18556276090085916, 0.10153756059119351, 0.10492418648528369, 0.08865966773528146, -0.0036203595016260108, -0.1025438532903025, -0.18323434794270624, -0.08375231894881349, -0.06763309191701908, 0.06314486736824021, -0.052198577705433444, -0.12304695214349011, 0.3385306984714028, 0.18028604625000647, 0.11013270062011705, 0.038048562727715465, 0.2744375564004869, 0.026011094454140085, 0.13000567515112765, 0.09780210475054608, 0.192642085528486, -0.0005152602951131659, 0.10318418449805157, -0.18152624478464793, 0.20720006334148858, -0.05501656841457987] |
1,802.03344 | Co-periodicity isomorphisms between forests of finite p-groups | Based on a general theory of descendant trees of finite p-groups and the
virtual periodicity isomorphisms between the branches of a coclass subtree, the
behavior of algebraic invariants of the tree vertices and their automorphism
groups under these isomorphisms is described with simple transformation laws.
For the tree of finite 3-groups with elementary bicyclic commutator quotient,
the information content of each coclass subtree with metabelian mainline is
shown to be finite. As a striking novelty in this paper, evidence is provided
of co-periodicity isomorphisms between coclass forests which reduce the
information content of the entire metabelian skeleton and a significant part of
non-metabelian vertices to a finite amount of data.
| math.GR | based on a general theory of descendant trees of finite pgroups and the virtual periodicity isomorphisms between the branches of a coclass subtree the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws for the tree of finite 3groups with elementary bicyclic commutator quotient the information content of each coclass subtree with metabelian mainline is shown to be finite as a striking novelty in this paper evidence is provided of coperiodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of nonmetabelian vertices to a finite amount of data | [['based', 'on', 'a', 'general', 'theory', 'of', 'descendant', 'trees', 'of', 'finite', 'pgroups', 'and', 'the', 'virtual', 'periodicity', 'isomorphisms', 'between', 'the', 'branches', 'of', 'a', 'coclass', 'subtree', 'the', 'behavior', 'of', 'algebraic', 'invariants', 'of', 'the', 'tree', 'vertices', 'and', 'their', 'automorphism', 'groups', 'under', 'these', 'isomorphisms', 'is', 'described', 'with', 'simple', 'transformation', 'laws', 'for', 'the', 'tree', 'of', 'finite', '3groups', 'with', 'elementary', 'bicyclic', 'commutator', 'quotient', 'the', 'information', 'content', 'of', 'each', 'coclass', 'subtree', 'with', 'metabelian', 'mainline', 'is', 'shown', 'to', 'be', 'finite', 'as', 'a', 'striking', 'novelty', 'in', 'this', 'paper', 'evidence', 'is', 'provided', 'of', 'coperiodicity', 'isomorphisms', 'between', 'coclass', 'forests', 'which', 'reduce', 'the', 'information', 'content', 'of', 'the', 'entire', 'metabelian', 'skeleton', 'and', 'a', 'significant', 'part', 'of', 'nonmetabelian', 'vertices', 'to', 'a', 'finite', 'amount', 'of', 'data']] | [-0.1544321829329219, 0.15127018522983843, -0.09493141060635242, 0.0638372359323153, -0.13069128116951623, -0.09589816206519347, 0.07285284424850016, 0.34473789326094706, -0.35452849869060954, -0.26821258488974165, 0.08434885344147648, -0.3159772871967849, -0.12961716886765726, 0.12650240205416302, -0.11589393348950004, -0.01061099348696581, 0.07464972770892493, 0.1432537080446651, -0.05404389475113413, -0.29121495411227194, 0.3646845612205018, -0.007703495536580545, 0.2565000318033501, 0.08050527639522585, 0.1383949841699486, 0.017239768365654377, -0.06058158698585739, 0.0023009656253484413, -0.12786854799290043, 0.10771034673334809, 0.34272772371939836, 0.0995238379045569, 0.1817605126640597, -0.35916066523470463, -0.14177926757090956, 0.19186369347633844, 0.13330562165489745, 0.035155141737884546, -0.05668140454068267, -0.247966363372435, 0.13976919052934428, -0.19336701374193396, -0.10015954088351321, 0.007786854819625343, 0.10995099728140946, 0.023263946391317413, -0.211766662896363, 0.0005894350209377531, 0.10748064007029073, 0.152054418707181, -0.003366876432005692, -0.106774832897418, -0.10725571986270743, 0.14939127129357344, -0.013453235591274745, -0.0009120252595385622, 0.062278144527226686, -0.08568305901781477, -0.16832534908616079, 0.3771696030204996, -0.01907596443651603, -0.18062986860718203, 0.158141444619305, -0.13795702972816765, -0.19143266889582808, 0.13381677283264629, 0.07712618063349243, 0.13304315562095118, -0.09497250942086134, 0.14857093118182693, -0.08496763305994895, 0.10918739866977985, 0.092049950879033, 0.0029193050545264342, 0.14005396493770386, 0.1468436973630835, 0.09008918016072397, 0.1666666225972372, 0.07529706551283256, -0.01777382291545835, -0.3215417646666254, -0.17557975253807978, -0.13486547230068943, 0.03199126686764146, -0.1757058840189738, -0.22890811610337852, 0.41865580123977375, 0.08023359945231895, 0.15960426408788958, 0.13301047166796623, 0.2140200982092444, 0.05260753717781856, 0.1205184681516209, 0.07681861932927725, 0.06782101226731314, 0.24926201513019997, -0.0659032096753085, -0.17461301021944356, 0.030405376153493965, 0.22073164322614294] |
1,802.03345 | A Two-Stage Method for Text Line Detection in Historical Documents | This work presents a two-stage text line detection method for historical
documents. Each detected text line is represented by its baseline. In a first
stage, a deep neural network called ARU-Net labels pixels to belong to one of
the three classes: baseline, separator or other. The separator class marks
beginning and end of each text line. The ARU-Net is trainable from scratch with
manageably few manually annotated example images (less than 50). This is
achieved by utilizing data augmentation strategies. The network predictions are
used as input for the second stage which performs a bottom-up clustering to
build baselines. The developed method is capable of handling complex layouts as
well as curved and arbitrarily oriented text lines. It substantially
outperforms current state-of-the-art approaches. For example, for the complex
track of the cBAD: ICDAR2017 Competition on Baseline Detection the F-value is
increased from 0.859 to 0.922. The framework to train and run the ARU-Net is
open source.
| cs.CV | this work presents a twostage text line detection method for historical documents each detected text line is represented by its baseline in a first stage a deep neural network called arunet labels pixels to belong to one of the three classes baseline separator or other the separator class marks beginning and end of each text line the arunet is trainable from scratch with manageably few manually annotated example images less than 50 this is achieved by utilizing data augmentation strategies the network predictions are used as input for the second stage which performs a bottomup clustering to build baselines the developed method is capable of handling complex layouts as well as curved and arbitrarily oriented text lines it substantially outperforms current stateoftheart approaches for example for the complex track of the cbad icdar2017 competition on baseline detection the fvalue is increased from 0859 to 0922 the framework to train and run the arunet is open source | [['this', 'work', 'presents', 'a', 'twostage', 'text', 'line', 'detection', 'method', 'for', 'historical', 'documents', 'each', 'detected', 'text', 'line', 'is', 'represented', 'by', 'its', 'baseline', 'in', 'a', 'first', 'stage', 'a', 'deep', 'neural', 'network', 'called', 'arunet', 'labels', 'pixels', 'to', 'belong', 'to', 'one', 'of', 'the', 'three', 'classes', 'baseline', 'separator', 'or', 'other', 'the', 'separator', 'class', 'marks', 'beginning', 'and', 'end', 'of', 'each', 'text', 'line', 'the', 'arunet', 'is', 'trainable', 'from', 'scratch', 'with', 'manageably', 'few', 'manually', 'annotated', 'example', 'images', 'less', 'than', '50', 'this', 'is', 'achieved', 'by', 'utilizing', 'data', 'augmentation', 'strategies', 'the', 'network', 'predictions', 'are', 'used', 'as', 'input', 'for', 'the', 'second', 'stage', 'which', 'performs', 'a', 'bottomup', 'clustering', 'to', 'build', 'baselines', 'the', 'developed', 'method', 'is', 'capable', 'of', 'handling', 'complex', 'layouts', 'as', 'well', 'as', 'curved', 'and', 'arbitrarily', 'oriented', 'text', 'lines', 'it', 'substantially', 'outperforms', 'current', 'stateoftheart', 'approaches', 'for', 'example', 'for', 'the', 'complex', 'track', 'of', 'the', 'cbad', 'icdar2017', 'competition', 'on', 'baseline', 'detection', 'the', 'fvalue', 'is', 'increased', 'from', '0859', 'to', '0922', 'the', 'framework', 'to', 'train', 'and', 'run', 'the', 'arunet', 'is', 'open', 'source']] | [-0.03465674325162845, 0.03086419795459557, -0.0017110153732280578, 0.05840674915441101, -0.12593901099697236, -0.2114775150143091, 0.015673493921396234, 0.4432810002937913, -0.2372904357823333, -0.3409678759278669, 0.09478256227523689, -0.3000753110875526, -0.09011198422691274, 0.18650418691968004, -0.0748616528370598, 0.03937400933918393, 0.14825698179343055, 0.05836381823305161, -0.032524381327112356, -0.2514099280650337, 0.29230357411978464, 0.054343688360137504, 0.3145195079937337, -0.007261552954573304, 0.12715937128335597, -0.06273029659153713, -0.06557712027607786, 0.020312796516584294, -0.028968655716087068, 0.1348160409939385, 0.3319755336389907, 0.21247181194503942, 0.2628331132954167, -0.36939043540267213, -0.1926397295248124, 0.05355121966511492, 0.12314858257530197, 0.11566862417028226, 0.008253022883417865, -0.333078465209673, 0.10015999245787821, -0.16703662588711707, -0.029465064490514416, -0.0411667505759866, 0.020001676270828373, -0.00887716977346328, -0.2642522688354215, 0.008333101204686588, 0.07406015790090145, 0.05138132569169806, 0.007618035546564046, -0.13068421871791924, 0.04772940860430319, 0.1462890535586461, -0.005787208493077948, 0.12359533745104508, 0.1341884641622704, -0.15517933828861363, -0.1334728272481551, 0.3710865256526778, -0.08025081588392852, -0.16249911602541445, 0.1737772587799437, -0.002245574588361647, -0.14343865678134946, 0.15270377353674944, 0.15937297144724477, 0.14740292765951205, -0.14494144803574008, -0.027850958908863004, -0.021808215000876978, 0.19195842384135411, 0.07798474152241984, -0.06840986683814516, 0.17825321148660395, 0.279212000175199, 0.037147492080205874, 0.14603911493379143, -0.1737451514484541, -0.047343930355723825, -0.23117264322185468, -0.09106529063034442, -0.18054849965678108, -0.011710924167005766, -0.056916295210999855, -0.14790752573359398, 0.4259382396455734, 0.1741650915133857, 0.23023888225096367, 0.10444315537554963, 0.334149949541015, 0.007677011634223163, 0.12163644064097635, 0.06858608296080942, 0.15636697412738876, 0.0011659707032865094, 0.14547827588995138, -0.11086725003645576, 0.10097273409276479, 0.09170568429173961] |
1,802.03346 | Scaling limits of the Schelling model | The Schelling model, introduced by Schelling in 1969 as a model for
residential segregation in cities, describes how populations of multiple types
self-organize to form homogeneous clusters of one type. In this model, vertices
in an $N$-dimensional lattice are initially assigned types randomly. As time
evolves, the type at a vertex $v$ has a tendency to be replaced with the most
common type within distance $w$ of $v$. We present the first mathematical
description of the dynamical scaling limit of this model as $w$ tends to
infinity and the lattice is correspondingly rescaled. We do this by deriving an
integro-differential equation for the limiting Schelling dynamics and proving
almost sure existence and uniqueness of the solutions when the initial
conditions are described by white noise. The evolving fields are in some sense
very "rough" but we are able to make rigorous sense of the evolution. In a key
lemma, we show that for certain Gaussian fields $h$, the supremum of the
occupation density of $h-\phi$ at zero (taken over all $1$-Lipschitz functions
$\phi$) is almost surely finite, thereby extending a result of Bass and Burdzy.
In the one dimensional case, we also describe the scaling limit of the limiting
clusters obtained at time infinity, thereby resolving a conjecture of Brandt,
Immorlica, Kamath, and Kleinberg.
| math.PR | the schelling model introduced by schelling in 1969 as a model for residential segregation in cities describes how populations of multiple types selforganize to form homogeneous clusters of one type in this model vertices in an ndimensional lattice are initially assigned types randomly as time evolves the type at a vertex v has a tendency to be replaced with the most common type within distance w of v we present the first mathematical description of the dynamical scaling limit of this model as w tends to infinity and the lattice is correspondingly rescaled we do this by deriving an integrodifferential equation for the limiting schelling dynamics and proving almost sure existence and uniqueness of the solutions when the initial conditions are described by white noise the evolving fields are in some sense very rough but we are able to make rigorous sense of the evolution in a key lemma we show that for certain gaussian fields h the supremum of the occupation density of hphi at zero taken over all 1lipschitz functions phi is almost surely finite thereby extending a result of bass and burdzy in the one dimensional case we also describe the scaling limit of the limiting clusters obtained at time infinity thereby resolving a conjecture of brandt immorlica kamath and kleinberg | [['the', 'schelling', 'model', 'introduced', 'by', 'schelling', 'in', '1969', 'as', 'a', 'model', 'for', 'residential', 'segregation', 'in', 'cities', 'describes', 'how', 'populations', 'of', 'multiple', 'types', 'selforganize', 'to', 'form', 'homogeneous', 'clusters', 'of', 'one', 'type', 'in', 'this', 'model', 'vertices', 'in', 'an', 'ndimensional', 'lattice', 'are', 'initially', 'assigned', 'types', 'randomly', 'as', 'time', 'evolves', 'the', 'type', 'at', 'a', 'vertex', 'v', 'has', 'a', 'tendency', 'to', 'be', 'replaced', 'with', 'the', 'most', 'common', 'type', 'within', 'distance', 'w', 'of', 'v', 'we', 'present', 'the', 'first', 'mathematical', 'description', 'of', 'the', 'dynamical', 'scaling', 'limit', 'of', 'this', 'model', 'as', 'w', 'tends', 'to', 'infinity', 'and', 'the', 'lattice', 'is', 'correspondingly', 'rescaled', 'we', 'do', 'this', 'by', 'deriving', 'an', 'integrodifferential', 'equation', 'for', 'the', 'limiting', 'schelling', 'dynamics', 'and', 'proving', 'almost', 'sure', 'existence', 'and', 'uniqueness', 'of', 'the', 'solutions', 'when', 'the', 'initial', 'conditions', 'are', 'described', 'by', 'white', 'noise', 'the', 'evolving', 'fields', 'are', 'in', 'some', 'sense', 'very', 'rough', 'but', 'we', 'are', 'able', 'to', 'make', 'rigorous', 'sense', 'of', 'the', 'evolution', 'in', 'a', 'key', 'lemma', 'we', 'show', 'that', 'for', 'certain', 'gaussian', 'fields', 'h', 'the', 'supremum', 'of', 'the', 'occupation', 'density', 'of', 'hphi', 'at', 'zero', 'taken', 'over', 'all', '1lipschitz', 'functions', 'phi', 'is', 'almost', 'surely', 'finite', 'thereby', 'extending', 'a', 'result', 'of', 'bass', 'and', 'burdzy', 'in', 'the', 'one', 'dimensional', 'case', 'we', 'also', 'describe', 'the', 'scaling', 'limit', 'of', 'the', 'limiting', 'clusters', 'obtained', 'at', 'time', 'infinity', 'thereby', 'resolving', 'a', 'conjecture', 'of', 'brandt', 'immorlica', 'kamath', 'and', 'kleinberg']] | [-0.11118594633968042, 0.12889047497440081, -0.09321133520619543, 0.0657484692572529, -0.017280435897888632, -0.1300401121718487, 0.05873523527216688, 0.33093949359032176, -0.26467994374721354, -0.2621571963052396, 0.07679502289713944, -0.28633331502222015, -0.11571179632593608, 0.1399597634880142, -0.0675954566022738, 0.012438370274471242, 0.03199466008657076, 0.037259825515924196, -0.004514646255922565, -0.28863511409906445, 0.3349151410908813, 0.011034438028609572, 0.23478489988004772, -0.004371448454803952, 0.0893705983817029, 0.021456300675929917, -0.022318030767921777, 0.037480373771792655, -0.1687428579399774, 0.0687719016949533, 0.21620400439595333, 0.0842765893016846, 0.3144889594486558, -0.37889802508560994, -0.19286669549971783, 0.12390877826739903, 0.15648186028495467, 0.08058791256849175, -0.00034731003743048024, -0.27346322473865353, 0.09731799878982966, -0.14008778662238025, -0.22432976045289998, -0.023401171600045723, 0.06892318362054616, 0.05084613284365944, -0.2653894161840326, 0.08402959506283623, 0.12233440625025982, 0.023776737527016586, -0.07395506009816358, -0.1001500757976879, -0.04026128467668509, 0.13389071512917844, 0.014860420405133584, 0.01586420593835483, 0.059801230196205674, -0.10951176353787517, -0.08513731746520917, 0.3620505386391746, -0.08657136735251765, -0.18409032334201472, 0.1899172898129534, -0.15352476291166983, -0.13909258433426164, 0.08139561556136043, 0.12699358116304416, 0.09207630204036832, -0.15911640436096153, 0.13649369010059995, -0.07443475542822853, 0.10143240690002844, 0.10534330515330222, 0.004626134190725806, 0.15267734542471645, 0.16113826976196893, 0.09807244761956847, 0.13277994672643786, -0.0209743844858745, -0.10915202128039411, -0.3175945920376303, -0.13347829325112653, -0.17618250051920223, 0.11727627913824448, -0.10641774204558264, -0.17712780959016391, 0.3608251046813659, 0.12546833426877638, 0.21336366818286479, 0.09906940143033166, 0.19578199330325646, 0.12798719695458083, 0.020831650179575816, 0.09939542721095278, 0.1634128252888875, 0.16037845026122877, 0.09779145371410386, -0.15758714304418764, 0.05211647959191039, 0.10600248287827925] |
1,802.03347 | Acceleration and global convergence of a first-order primal--dual method
for nonconvex problems | The primal--dual hybrid gradient method (PDHGM, also known as the
Chambolle--Pock method) has proved very successful for convex optimization
problems involving linear operators arising in image processing and inverse
problems. In this paper, we analyze an extension to nonconvex problems that
arise if the operator is nonlinear. Based on the idea of testing, we derive new
step length parameter conditions for the convergence in infinite-dimensional
Hilbert spaces and provide acceleration rules for suitably (locally and/or
partially) monotone problems. Importantly, we prove linear convergence rates as
well as global convergence in certain cases. We demonstrate the efficacy of
these step length rules for PDE-constrained optimization problems.
| math.OC | the primaldual hybrid gradient method pdhgm also known as the chambollepock method has proved very successful for convex optimization problems involving linear operators arising in image processing and inverse problems in this paper we analyze an extension to nonconvex problems that arise if the operator is nonlinear based on the idea of testing we derive new step length parameter conditions for the convergence in infinitedimensional hilbert spaces and provide acceleration rules for suitably locally andor partially monotone problems importantly we prove linear convergence rates as well as global convergence in certain cases we demonstrate the efficacy of these step length rules for pdeconstrained optimization problems | [['the', 'primaldual', 'hybrid', 'gradient', 'method', 'pdhgm', 'also', 'known', 'as', 'the', 'chambollepock', 'method', 'has', 'proved', 'very', 'successful', 'for', 'convex', 'optimization', 'problems', 'involving', 'linear', 'operators', 'arising', 'in', 'image', 'processing', 'and', 'inverse', 'problems', 'in', 'this', 'paper', 'we', 'analyze', 'an', 'extension', 'to', 'nonconvex', 'problems', 'that', 'arise', 'if', 'the', 'operator', 'is', 'nonlinear', 'based', 'on', 'the', 'idea', 'of', 'testing', 'we', 'derive', 'new', 'step', 'length', 'parameter', 'conditions', 'for', 'the', 'convergence', 'in', 'infinitedimensional', 'hilbert', 'spaces', 'and', 'provide', 'acceleration', 'rules', 'for', 'suitably', 'locally', 'andor', 'partially', 'monotone', 'problems', 'importantly', 'we', 'prove', 'linear', 'convergence', 'rates', 'as', 'well', 'as', 'global', 'convergence', 'in', 'certain', 'cases', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'these', 'step', 'length', 'rules', 'for', 'pdeconstrained', 'optimization', 'problems']] | [-0.06408411067409012, 0.01213981927601428, -0.06132629383668805, 0.11448770754913522, -0.08909377574365443, -0.14864697627042636, 0.0034781273268610956, 0.4068214939190791, -0.37659064153558575, -0.23477310105226934, 0.19347119888362402, -0.18794294515660462, -0.1937768161878921, 0.24579801482300703, -0.11311268922201215, 0.14498316824140672, 0.08446399928428806, -0.027846338300990352, -0.11933568538426279, -0.27081527108720577, 0.32387947122781324, -0.0022617420718933526, 0.2631864773843867, 0.07282655286745957, 0.15896985454869886, 0.019067982086338676, 0.01121867557342809, 0.03981202677276157, -0.10434219998548472, 0.11002457532986927, 0.32986978269540346, 0.16917030676044165, 0.36713768766842875, -0.4239236768424654, -0.19685692437745345, 0.1406392465589586, 0.15814989301949167, 0.08069577225698875, -0.08609003743689615, -0.22668594319167404, 0.07746906560630752, -0.07688175728365493, -0.12341065973025532, -0.1311282705708156, -0.031132115051150322, 0.02912934778186564, -0.36888256948441267, 0.08824534119804202, 0.08124701882143899, 0.029107857092570227, -0.08361947711091489, -0.12456865701376675, 0.06871578619645263, 0.03800000172878544, 0.06377676955666035, -0.011607922165869521, 0.10000710161581922, -0.07912260470150684, -0.16412056971771213, 0.36062877637764007, -0.036211265982554044, -0.2657471461078295, 0.15505650077382319, -0.02580719329461527, -0.18641864321230409, 0.06632853322662413, 0.2318873279280244, 0.22294310684754656, -0.13407428443987066, 0.1419987987330667, -0.05251904689402391, 0.09554041191362418, 0.04455614944275182, 0.04021593259844499, 0.061693953981515594, 0.15876406119563258, 0.2155438102815354, 0.19539125494730586, -0.02291851225499368, -0.13255709580027122, -0.3197045158953048, -0.11715281328472954, -0.1444235975034714, -0.013005150855930809, -0.1304826379141909, -0.1852098518015387, 0.35428876515764457, 0.12385470890932573, 0.17511384592160958, 0.1283584666895107, 0.27618032314169866, 0.1612644142598863, 0.029670995319835268, 0.07326709576703322, 0.21312909682567877, 0.14668672719227077, 0.0939449397309755, -0.2404640891428034, 0.04621640427145534, 0.19292654484385052] |
1,802.03348 | Contractions of group representations via geometric quantisation | We propose a general framework to contract unitary dual of Lie groups via
holomorphic quantization of their co-adjoint orbits. The sufficient condition
for the contractability of a representation is expressed via cocycles on
coadjoint orbits. This condition is checked explicitly for the contraction of
${\mathrm SU}_2$ into $\mathbb{H}$. The main tool is the geometric
quantization. We construct two types of contractions that can be implemented on
every matrix Lie group with diagonal contraction matrix.
| math.RT | we propose a general framework to contract unitary dual of lie groups via holomorphic quantization of their coadjoint orbits the sufficient condition for the contractability of a representation is expressed via cocycles on coadjoint orbits this condition is checked explicitly for the contraction of mathrm su_2 into mathbbh the main tool is the geometric quantization we construct two types of contractions that can be implemented on every matrix lie group with diagonal contraction matrix | [['we', 'propose', 'a', 'general', 'framework', 'to', 'contract', 'unitary', 'dual', 'of', 'lie', 'groups', 'via', 'holomorphic', 'quantization', 'of', 'their', 'coadjoint', 'orbits', 'the', 'sufficient', 'condition', 'for', 'the', 'contractability', 'of', 'a', 'representation', 'is', 'expressed', 'via', 'cocycles', 'on', 'coadjoint', 'orbits', 'this', 'condition', 'is', 'checked', 'explicitly', 'for', 'the', 'contraction', 'of', 'mathrm', 'su_2', 'into', 'mathbbh', 'the', 'main', 'tool', 'is', 'the', 'geometric', 'quantization', 'we', 'construct', 'two', 'types', 'of', 'contractions', 'that', 'can', 'be', 'implemented', 'on', 'every', 'matrix', 'lie', 'group', 'with', 'diagonal', 'contraction', 'matrix']] | [-0.20806008725337785, 0.10654922126958223, -0.12341764491459686, 0.038954601929306165, -0.11736368396868037, -0.11224479522964317, -0.005309057000973453, 0.3737776541750725, -0.30380527129116125, -0.14312793396107137, 0.16150245752364192, -0.15795289312348995, -0.17952175643805363, 0.17169774525275786, -0.13414805918319583, 0.0012306224248588903, 0.09689273798123818, 0.12219404238148605, -0.16507442132450245, -0.2526577640299315, 0.3952928444702331, -0.023619980857490678, 0.20324032529167932, 0.007091534695562536, 0.1455176595202966, 0.041254187750706627, 0.009696384984362002, -0.06417044894195685, -0.10859126820954995, 0.12560544889388375, 0.24464718818868678, 0.10845380777824823, 0.2170463779635013, -0.40145544794967003, -0.12075260136123389, 0.15881013793054305, 0.14466960832782805, 0.030159371637114105, -0.028027978703405145, -0.33708946526765005, 0.12657105816170983, -0.19110318602458254, -0.13316599962186731, -0.12647323108163394, 0.029598732185486244, -0.060590601385864494, -0.28061720723771066, 0.041049371591501245, 0.09708375917517975, 0.06909675380750878, -0.08397390516092108, -0.061499131880126484, -0.06984720154576106, 0.12014049343279984, -0.03811916444220976, 0.010130798909813166, 0.16094632273817383, 0.04016614697988413, -0.09689142481082642, 0.42592653509688705, -0.03676809507664548, -0.29369947676585145, 0.11005631321403261, -0.13802164926971883, -0.19871899879805438, 0.06464752593167024, 0.1296166249627426, 0.15303562977032303, -0.11377835616928665, 0.16212709772413317, -0.08235026193042733, 0.03204054409663563, 0.05821021235458655, -0.03104101270293715, 0.1692917987717035, 0.08486855246943154, 0.09219216412469132, 0.12407877035151962, 0.04972483254713963, -0.06682619958324995, -0.4002881725254941, -0.17819155630183547, -0.12470503405935757, 0.10422369145010024, -0.1450815999319088, -0.1422792183943348, 0.4158105704780311, 0.061789819817632846, 0.20398898102496177, 0.11349255977236755, 0.22053989936431792, 0.15542314878955152, 0.11328192674937619, 0.05031995995174328, 0.1385788833339737, 0.2651528252467309, -0.08238835308751831, -0.1863350975965086, -0.027537245861548064, 0.267839759632894] |
1,802.03349 | The Super-NFW model: an analytic dynamical model for cold dark matter
haloes and elliptical galaxies | An analytic galaxy model with $\rho \sim r^{-1}$ at small radii and $\rho
\sim r^{-3.5}$ at large radii is presented. The asymptotic density fall-off is
slower than the Hernquist model, but faster than the Navarro-Frenk-White (NFW)
profile for dark matter haloes, and so in accord with recent evidence from
cosmological simulations. The model provides the zeroth-order term in a
biorthornomal basis function expansion, meaning that axisymmetric, triaxial and
lopsided distortions can easily be added (much like the Hernquist model itself
which is the zeroth-order term of the Hernquist-Ostriker expansion). The
properties of the spherical model, including analytic distribution functions
which are either isotropic, radially anisotropic or tangentially anisotropic,
are discussed in some detail. The analogue of the mass-concentration relation
for cosmological haloes is provided.
| astro-ph.GA astro-ph.CO | an analytic galaxy model with rho sim r1 at small radii and rho sim r35 at large radii is presented the asymptotic density falloff is slower than the hernquist model but faster than the navarrofrenkwhite nfw profile for dark matter haloes and so in accord with recent evidence from cosmological simulations the model provides the zerothorder term in a biorthornomal basis function expansion meaning that axisymmetric triaxial and lopsided distortions can easily be added much like the hernquist model itself which is the zerothorder term of the hernquistostriker expansion the properties of the spherical model including analytic distribution functions which are either isotropic radially anisotropic or tangentially anisotropic are discussed in some detail the analogue of the massconcentration relation for cosmological haloes is provided | [['an', 'analytic', 'galaxy', 'model', 'with', 'rho', 'sim', 'r1', 'at', 'small', 'radii', 'and', 'rho', 'sim', 'r35', 'at', 'large', 'radii', 'is', 'presented', 'the', 'asymptotic', 'density', 'falloff', 'is', 'slower', 'than', 'the', 'hernquist', 'model', 'but', 'faster', 'than', 'the', 'navarrofrenkwhite', 'nfw', 'profile', 'for', 'dark', 'matter', 'haloes', 'and', 'so', 'in', 'accord', 'with', 'recent', 'evidence', 'from', 'cosmological', 'simulations', 'the', 'model', 'provides', 'the', 'zerothorder', 'term', 'in', 'a', 'biorthornomal', 'basis', 'function', 'expansion', 'meaning', 'that', 'axisymmetric', 'triaxial', 'and', 'lopsided', 'distortions', 'can', 'easily', 'be', 'added', 'much', 'like', 'the', 'hernquist', 'model', 'itself', 'which', 'is', 'the', 'zerothorder', 'term', 'of', 'the', 'hernquistostriker', 'expansion', 'the', 'properties', 'of', 'the', 'spherical', 'model', 'including', 'analytic', 'distribution', 'functions', 'which', 'are', 'either', 'isotropic', 'radially', 'anisotropic', 'or', 'tangentially', 'anisotropic', 'are', 'discussed', 'in', 'some', 'detail', 'the', 'analogue', 'of', 'the', 'massconcentration', 'relation', 'for', 'cosmological', 'haloes', 'is', 'provided']] | [-0.06632009434241165, 0.09677384646689402, -0.14396027094358957, 0.14587766915272043, -0.09735777470608795, -0.12306558047383417, -0.10416745120371745, 0.3589703035427303, -0.18067143283542095, -0.3110920044071064, 0.051425747195735755, -0.3125608010005539, -0.0756250838181231, 0.1695900238194783, 0.0550589770929532, 0.017146355502792004, -0.019971330207204673, 0.0002709883605925048, -0.09182267794025896, -0.21543766741122203, 0.2797959642711936, 0.10688659859200318, 0.17927914071918988, -0.03273536510598975, 0.01761317780862252, -0.05793789487210958, -0.026954931714307, 0.020336362284350748, -0.21359656309185793, 0.02501349761415788, 0.124931038425463, 0.06411496119770577, 0.20372877602571454, -0.39719822820431244, -0.23264053613098898, 0.09457075515595394, 0.2119054705135494, 0.10585873971037317, -0.07133252585185616, -0.2620051780420287, 0.05026740901838473, -0.2554197167387096, -0.2295115728658147, -0.034651391594329985, 0.05142730239369884, 0.047728166559605094, -0.27146679043345817, 0.25449460058102036, 0.04787896839689797, 0.004777180640702703, -0.0896329294674371, -0.1617500477705181, -0.04823181072128861, -0.036719898243692164, 0.07529651560173256, 0.0898090547700299, 0.1801458467214512, -0.15043987970556913, 0.06108969426524591, 0.4244979918835972, -0.09340715778133135, -0.18573491966609307, 0.1435391469877516, -0.18054348661950448, -0.07543779405712234, 0.09220657442323485, 0.12103888026355364, 0.08565741289611452, -0.09491053490891932, 0.11049726830910876, -0.057893941934434395, 0.19839841014576878, 0.07550225369026506, -0.036356553747541105, 0.2974904259000488, 0.07852421049407221, 0.04198568302199123, 0.0862318536671772, -0.06461703236691835, -0.10850331953885715, -0.2906256525784852, -0.07222782665999924, -0.16526390401915292, 0.02163257741755465, -0.20269636161129911, -0.163461195244416, 0.33031701006570724, 0.06256850415886175, 0.2185348271642153, 0.11442259704974306, 0.33190939726868296, 0.09905008838428714, 0.07573482977998693, 0.12413678962616174, 0.2556359764026209, 0.14526141868200063, 0.050393969259732135, -0.15988394579986429, 0.05399129339550599, 0.023022482625958397] |
1,802.0335 | Galaxy halo expansions: a new biorthogonal family of potential-density
pairs | Efficient expansions of the gravitational field of (dark) haloes have two
main uses in the modelling of galaxies: first, they provide a compact
representation of numerically-constructed (or real) cosmological haloes,
incorporating the effects of triaxiality, lopsidedness or other distortion.
Secondly, they provide the basis functions for self-consistent field expansion
algorithms used in the evolution of $N$-body systems. We present a new family
of biorthogonal potential-density pairs constructed using the Hankel transform
of the Laguerre polynomials. The lowest-order density basis functions are
double-power-law profiles cusped like $\rho \sim r^{-2 + 1/\alpha}$ at small
radii with asymptotic density fall-off like $\rho \sim r^{-3 -1/(2\alpha)}$.
Here, $\alpha$ is a parameter satisfying $\alpha \ge 1/2$. The family therefore
spans the range of inner density cusps found in numerical simulations, but has
much shallower -- and hence more realistic -- outer slopes than the
corresponding members of the only previously-known family deduced by Zhao
(1996) and exemplified by Hernquist & Ostriker (1992). When $\alpha =1$, the
lowest-order density profile has an inner density cusp of $\rho \sim r^{-1}$
and an outer density slope of $\rho \sim r^{-3.5}$, similar to the famous
Navarro, Frenk & White (1997) model. For this reason, we demonstrate that our
new expansion provides a more accurate representation of flattened NFW haloes
than the competing Hernquist-Ostriker expansion. We utilize our new expansion
by analysing a suite of numerically-constructed haloes and providing the
distributions of the expansion coefficients.
| astro-ph.GA astro-ph.CO | efficient expansions of the gravitational field of dark haloes have two main uses in the modelling of galaxies first they provide a compact representation of numericallyconstructed or real cosmological haloes incorporating the effects of triaxiality lopsidedness or other distortion secondly they provide the basis functions for selfconsistent field expansion algorithms used in the evolution of nbody systems we present a new family of biorthogonal potentialdensity pairs constructed using the hankel transform of the laguerre polynomials the lowestorder density basis functions are doublepowerlaw profiles cusped like rho sim r2 1alpha at small radii with asymptotic density falloff like rho sim r3 12alpha here alpha is a parameter satisfying alpha ge 12 the family therefore spans the range of inner density cusps found in numerical simulations but has much shallower and hence more realistic outer slopes than the corresponding members of the only previouslyknown family deduced by zhao 1996 and exemplified by hernquist ostriker 1992 when alpha 1 the lowestorder density profile has an inner density cusp of rho sim r1 and an outer density slope of rho sim r35 similar to the famous navarro frenk white 1997 model for this reason we demonstrate that our new expansion provides a more accurate representation of flattened nfw haloes than the competing hernquistostriker expansion we utilize our new expansion by analysing a suite of numericallyconstructed haloes and providing the distributions of the expansion coefficients | [['efficient', 'expansions', 'of', 'the', 'gravitational', 'field', 'of', 'dark', 'haloes', 'have', 'two', 'main', 'uses', 'in', 'the', 'modelling', 'of', 'galaxies', 'first', 'they', 'provide', 'a', 'compact', 'representation', 'of', 'numericallyconstructed', 'or', 'real', 'cosmological', 'haloes', 'incorporating', 'the', 'effects', 'of', 'triaxiality', 'lopsidedness', 'or', 'other', 'distortion', 'secondly', 'they', 'provide', 'the', 'basis', 'functions', 'for', 'selfconsistent', 'field', 'expansion', 'algorithms', 'used', 'in', 'the', 'evolution', 'of', 'nbody', 'systems', 'we', 'present', 'a', 'new', 'family', 'of', 'biorthogonal', 'potentialdensity', 'pairs', 'constructed', 'using', 'the', 'hankel', 'transform', 'of', 'the', 'laguerre', 'polynomials', 'the', 'lowestorder', 'density', 'basis', 'functions', 'are', 'doublepowerlaw', 'profiles', 'cusped', 'like', 'rho', 'sim', 'r2', '1alpha', 'at', 'small', 'radii', 'with', 'asymptotic', 'density', 'falloff', 'like', 'rho', 'sim', 'r3', '12alpha', 'here', 'alpha', 'is', 'a', 'parameter', 'satisfying', 'alpha', 'ge', '12', 'the', 'family', 'therefore', 'spans', 'the', 'range', 'of', 'inner', 'density', 'cusps', 'found', 'in', 'numerical', 'simulations', 'but', 'has', 'much', 'shallower', 'and', 'hence', 'more', 'realistic', 'outer', 'slopes', 'than', 'the', 'corresponding', 'members', 'of', 'the', 'only', 'previouslyknown', 'family', 'deduced', 'by', 'zhao', '1996', 'and', 'exemplified', 'by', 'hernquist', 'ostriker', '1992', 'when', 'alpha', '1', 'the', 'lowestorder', 'density', 'profile', 'has', 'an', 'inner', 'density', 'cusp', 'of', 'rho', 'sim', 'r1', 'and', 'an', 'outer', 'density', 'slope', 'of', 'rho', 'sim', 'r35', 'similar', 'to', 'the', 'famous', 'navarro', 'frenk', 'white', '1997', 'model', 'for', 'this', 'reason', 'we', 'demonstrate', 'that', 'our', 'new', 'expansion', 'provides', 'a', 'more', 'accurate', 'representation', 'of', 'flattened', 'nfw', 'haloes', 'than', 'the', 'competing', 'hernquistostriker', 'expansion', 'we', 'utilize', 'our', 'new', 'expansion', 'by', 'analysing', 'a', 'suite', 'of', 'numericallyconstructed', 'haloes', 'and', 'providing', 'the', 'distributions', 'of', 'the', 'expansion', 'coefficients']] | [-0.11494139618969158, 0.09021654463962793, -0.13692761728256617, 0.10772841089283643, -0.06680566903568157, -0.07811355270728793, -0.03920417859968122, 0.33098842013910734, -0.1698407280785234, -0.31331373828098824, 0.02166570705999418, -0.2897019911375221, -0.09696080565513314, 0.18170657634390924, 0.017226061514457283, 0.0357052903359189, -0.009783118300180397, -0.014909801304178393, -0.12122059189967568, -0.24214231097746802, 0.31841728635721983, 0.06209953185575812, 0.15248096031541733, -0.054850763651420886, 0.024795923646256005, -0.033765761137170634, -0.044442069660062374, -0.024412411518151992, -0.22217246878239877, 0.09217215562542981, 0.1742024877255418, 0.10658613584692711, 0.24878213805166763, -0.3734626907774288, -0.22131010300236875, 0.08958033247567389, 0.2062181094246309, 0.025116544026557518, -0.07034997022369087, -0.2678635493953429, 0.06621737521060783, -0.23517107309206672, -0.20797880234237273, -0.05867115096391543, 0.06914307348855325, 0.04717113671156213, -0.28318855023801165, 0.18787445909363906, 0.036166954564902445, 0.03213188736864021, -0.04287889778978475, -0.1925657796147077, -0.021151776798069476, 0.033707705121006536, -2.373804530614744e-05, 0.04474067062382465, 0.14699435905178848, -0.12173287221939182, 0.0035131307136591363, 0.3575447254414346, -0.08106227485202354, -0.12742854595417158, 0.1486433448229471, -0.19621277009339436, -0.1380422399257836, 0.1328145785598874, 0.12380318201106527, 0.12302561164124991, -0.07311593358659277, 0.11068223440189562, -0.0586609355473901, 0.18881942133555876, 0.1312074708610611, -0.030545582296326756, 0.2280937509752972, 0.06799683693857135, 0.045668687978152024, 0.0824935340137808, -0.09497313182294854, -0.05387633011028495, -0.26780352067688235, -0.11521960661345435, -0.16080161547743838, 0.03669034807294931, -0.1848828670874987, -0.17899901565447773, 0.3483707760663136, 0.06994424227912374, 0.21109686991321328, 0.12475497200072784, 0.277127065460967, 0.12129787092107226, 0.06122665165356644, 0.13412163048861142, 0.20421858532253004, 0.17845441373166346, 0.027141240668361603, -0.1677581496640493, 0.018958493121697204, 0.05403204498326649] |
1,802.03351 | The Milky Way Halo in Action Space | We analyse the structure of the local stellar halo of the Milky Way using
$\sim$ 60000 stars with full phase space coordinates extracted from the
SDSS--{\it Gaia} catalogue. We display stars in action space as a function of
metallicity in a realistic axisymmetric potential for the Milky Way Galaxy. The
metal-rich population is more distended towards high radial action $J_R$ as
compared to azimuthal or vertical action, $J_\phi$ or $J_z$. It has a mild
prograde rotation $(\langle v_\phi \rangle \approx 25$ km s$^{-1}$), is
radially anisotropic and highly flattened with axis ratio $q \approx 0.6 -
0.7$. The metal-poor population is more evenly distributed in all three
actions. It has larger prograde rotation $(\langle v_\phi \rangle \approx 50$
km s$^{-1}$), a mild radial anisotropy and a roundish morphology ($q\approx
0.9$). We identify two further components of the halo in action space. There is
a high energy, retrograde component that is only present in the metal-rich
stars. This is suggestive of an origin in a retrograde encounter, possibly the
one that created the stripped dwarf galaxy nucleus, $\omega$Centauri. Also
visible as a distinct entity in action space is a resonant component, which is
flattened and prograde. It extends over a range of metallicities down to [Fe/H]
$\approx -3$. It has a net outward radial velocity $\langle v_R \rangle \approx
12$ km s$^{-1}$ within the Solar circle at $|z| <3.5$ kpc. The existence of
resonant stars at such extremely low metallicities has not been seen before.
| astro-ph.GA | we analyse the structure of the local stellar halo of the milky way using sim 60000 stars with full phase space coordinates extracted from the sdssit gaia catalogue we display stars in action space as a function of metallicity in a realistic axisymmetric potential for the milky way galaxy the metalrich population is more distended towards high radial action j_r as compared to azimuthal or vertical action j_phi or j_z it has a mild prograde rotation langle v_phi rangle approx 25 km s1 is radially anisotropic and highly flattened with axis ratio q approx 06 07 the metalpoor population is more evenly distributed in all three actions it has larger prograde rotation langle v_phi rangle approx 50 km s1 a mild radial anisotropy and a roundish morphology qapprox 09 we identify two further components of the halo in action space there is a high energy retrograde component that is only present in the metalrich stars this is suggestive of an origin in a retrograde encounter possibly the one that created the stripped dwarf galaxy nucleus omegacentauri also visible as a distinct entity in action space is a resonant component which is flattened and prograde it extends over a range of metallicities down to feh approx 3 it has a net outward radial velocity langle v_r rangle approx 12 km s1 within the solar circle at z 35 kpc the existence of resonant stars at such extremely low metallicities has not been seen before | [['we', 'analyse', 'the', 'structure', 'of', 'the', 'local', 'stellar', 'halo', 'of', 'the', 'milky', 'way', 'using', 'sim', '60000', 'stars', 'with', 'full', 'phase', 'space', 'coordinates', 'extracted', 'from', 'the', 'sdssit', 'gaia', 'catalogue', 'we', 'display', 'stars', 'in', 'action', 'space', 'as', 'a', 'function', 'of', 'metallicity', 'in', 'a', 'realistic', 'axisymmetric', 'potential', 'for', 'the', 'milky', 'way', 'galaxy', 'the', 'metalrich', 'population', 'is', 'more', 'distended', 'towards', 'high', 'radial', 'action', 'j_r', 'as', 'compared', 'to', 'azimuthal', 'or', 'vertical', 'action', 'j_phi', 'or', 'j_z', 'it', 'has', 'a', 'mild', 'prograde', 'rotation', 'langle', 'v_phi', 'rangle', 'approx', '25', 'km', 's1', 'is', 'radially', 'anisotropic', 'and', 'highly', 'flattened', 'with', 'axis', 'ratio', 'q', 'approx', '06', '07', 'the', 'metalpoor', 'population', 'is', 'more', 'evenly', 'distributed', 'in', 'all', 'three', 'actions', 'it', 'has', 'larger', 'prograde', 'rotation', 'langle', 'v_phi', 'rangle', 'approx', '50', 'km', 's1', 'a', 'mild', 'radial', 'anisotropy', 'and', 'a', 'roundish', 'morphology', 'qapprox', '09', 'we', 'identify', 'two', 'further', 'components', 'of', 'the', 'halo', 'in', 'action', 'space', 'there', 'is', 'a', 'high', 'energy', 'retrograde', 'component', 'that', 'is', 'only', 'present', 'in', 'the', 'metalrich', 'stars', 'this', 'is', 'suggestive', 'of', 'an', 'origin', 'in', 'a', 'retrograde', 'encounter', 'possibly', 'the', 'one', 'that', 'created', 'the', 'stripped', 'dwarf', 'galaxy', 'nucleus', 'omegacentauri', 'also', 'visible', 'as', 'a', 'distinct', 'entity', 'in', 'action', 'space', 'is', 'a', 'resonant', 'component', 'which', 'is', 'flattened', 'and', 'prograde', 'it', 'extends', 'over', 'a', 'range', 'of', 'metallicities', 'down', 'to', 'feh', 'approx', '3', 'it', 'has', 'a', 'net', 'outward', 'radial', 'velocity', 'langle', 'v_r', 'rangle', 'approx', '12', 'km', 's1', 'within', 'the', 'solar', 'circle', 'at', 'z', '35', 'kpc', 'the', 'existence', 'of', 'resonant', 'stars', 'at', 'such', 'extremely', 'low', 'metallicities', 'has', 'not', 'been', 'seen', 'before']] | [-0.1295340327288155, 0.19465679742165212, -0.07660466236878218, 0.06709936867065897, -0.09062933980983735, -0.06631592584847018, -0.014281796788881447, 0.44825475397404313, -0.18051777203968525, -0.31507805342716744, 0.0033888781278717433, -0.3106851153160361, 0.017065831625541625, 0.19212736664455354, -0.03237392657083246, -0.0721775372122984, 0.05122731671541591, -0.009898191137039217, -0.07823556224663535, -0.21362833531230904, 0.23493511262513342, 0.00903659894069549, 0.13274647161164435, -0.07386987045556302, 0.10598090581917242, -0.10796846584118672, 0.02375471965825447, -0.0346893894641029, -0.1604288201416532, -0.009132969980166593, 0.19380838438302803, 0.0843615762851863, 0.26131092504047876, -0.2829584136281994, -0.14709442160438654, 0.07119180747761952, 0.2626583563310117, 0.026830271731334267, -0.06780884450473265, -0.25516864879841894, 0.10316356718213074, -0.23337948892442587, -0.24678109545060548, 0.04007100893477024, 0.1312029260972684, -0.02904798502625882, -0.22935776165826055, 0.19232516337851396, 0.054500912739471954, 0.15362293115809314, -0.08878234769773288, -0.14187448642462924, -0.12469936310494519, 0.040305316197100934, 0.049222908558108465, 0.1697291735105586, 0.18738606681639314, -0.09222799478664472, 0.04660188771634216, 0.43628241826514597, -0.11013928215906471, -0.0686371405984175, 0.1707847879502984, -0.23670523088186796, -0.13457852077655003, 0.13742777169682086, 0.14797676910505791, 0.12418087583981947, -0.11974399360998395, 0.031052296336962503, -0.07204926655241019, 0.21231966182081538, 0.08413243557187952, 0.016017565214241594, 0.30480516242432937, 0.0964402835537133, 0.11838344108884695, 0.005425978580889992, -0.2269854885090797, -0.03234210741813949, -0.19861855787948574, -0.09465348079171867, -0.07751343364457884, 0.1021303358066982, -0.19231525133345864, -0.1118833650988796, 0.32973271594690695, 0.09256058992733332, 0.27100941695827097, 0.033745729989826306, 0.2996395104083671, 0.07762131779040941, 0.12765631188777052, 0.17933992566425383, 0.2691063014838521, 0.18608713236710533, 0.06824563774578504, -0.19754013934649897, 0.04143945221819969, -0.029293447334611835] |
1,802.03352 | Weaving Hilbert space fusion frames | A new notion in frame theory, so called weaving frames has been recently
introduced to deal with some problems in signal processing and wireless sensor
networks. Also, fusion frames are an important extension of frames, used in
many areas especially for wireless sensor networks. In this paper, we survey
the notion of weaving Hilbert space fusion frames. This concept can be had
potential applications in wireless sensor networks which require distributed
processing using different fusion frames. Indeed, we present several approaches
for identifying and constructing of weaving fusion frames in terms of local
frames, bounded operators in Hilbert spaces and also dual fusion frames. To
this end, we present some conditions under which a fusion frame with its duals
constitute some pair of woven fusion frames. As a result, we show that Riesz
fusion bases are woven with all of their duals. Finally, we obtain some new
results on fusion frames and weaving fusion frames under operator
perturbations.
| math.FA | a new notion in frame theory so called weaving frames has been recently introduced to deal with some problems in signal processing and wireless sensor networks also fusion frames are an important extension of frames used in many areas especially for wireless sensor networks in this paper we survey the notion of weaving hilbert space fusion frames this concept can be had potential applications in wireless sensor networks which require distributed processing using different fusion frames indeed we present several approaches for identifying and constructing of weaving fusion frames in terms of local frames bounded operators in hilbert spaces and also dual fusion frames to this end we present some conditions under which a fusion frame with its duals constitute some pair of woven fusion frames as a result we show that riesz fusion bases are woven with all of their duals finally we obtain some new results on fusion frames and weaving fusion frames under operator perturbations | [['a', 'new', 'notion', 'in', 'frame', 'theory', 'so', 'called', 'weaving', 'frames', 'has', 'been', 'recently', 'introduced', 'to', 'deal', 'with', 'some', 'problems', 'in', 'signal', 'processing', 'and', 'wireless', 'sensor', 'networks', 'also', 'fusion', 'frames', 'are', 'an', 'important', 'extension', 'of', 'frames', 'used', 'in', 'many', 'areas', 'especially', 'for', 'wireless', 'sensor', 'networks', 'in', 'this', 'paper', 'we', 'survey', 'the', 'notion', 'of', 'weaving', 'hilbert', 'space', 'fusion', 'frames', 'this', 'concept', 'can', 'be', 'had', 'potential', 'applications', 'in', 'wireless', 'sensor', 'networks', 'which', 'require', 'distributed', 'processing', 'using', 'different', 'fusion', 'frames', 'indeed', 'we', 'present', 'several', 'approaches', 'for', 'identifying', 'and', 'constructing', 'of', 'weaving', 'fusion', 'frames', 'in', 'terms', 'of', 'local', 'frames', 'bounded', 'operators', 'in', 'hilbert', 'spaces', 'and', 'also', 'dual', 'fusion', 'frames', 'to', 'this', 'end', 'we', 'present', 'some', 'conditions', 'under', 'which', 'a', 'fusion', 'frame', 'with', 'its', 'duals', 'constitute', 'some', 'pair', 'of', 'woven', 'fusion', 'frames', 'as', 'a', 'result', 'we', 'show', 'that', 'riesz', 'fusion', 'bases', 'are', 'woven', 'with', 'all', 'of', 'their', 'duals', 'finally', 'we', 'obtain', 'some', 'new', 'results', 'on', 'fusion', 'frames', 'and', 'weaving', 'fusion', 'frames', 'under', 'operator', 'perturbations']] | [-0.11174579842688068, 0.09799781116987416, -0.0602081872344524, 0.03832982965712613, -0.04381227181764626, -0.13383458228192374, -0.049936387752760436, 0.4874204534542146, -0.3110775465287174, -0.1840785895710033, 0.09637121071146, -0.22038848055055058, -0.20704457347422744, 0.1563322224795724, -0.2102425418016088, 0.11059751962805225, 0.1389876722028078, 0.11909847933492518, -0.0665566174009862, -0.283353111744988, 0.34216903702759693, 0.1037659767920835, 0.3040792951610859, 0.013910036223875712, 0.11372509796195958, 0.029578715925328906, -0.08602524026521022, 0.005360174349242456, -0.10739391476758262, 0.2257156160960705, 0.3419966956181857, 0.1751783959688383, 0.3117599003252727, -0.4312462094829335, -0.24517657007149693, 0.1526269999780704, 0.11249795727007374, 0.07606748151710799, -0.11636319458764637, -0.32760551149214184, 0.12997768252875797, -0.20673696844708883, 0.035871864308100604, -0.13389979127302318, 0.02862708032119406, 0.04301642201534366, -0.32469975090102304, -0.01668075586505576, 0.06710614541639821, 0.06796259483428602, -0.155904288976188, -0.035749781748598226, 0.06689350012854874, 0.11392473167728019, -0.013256967981357741, 0.006267754782486377, 0.1335571630993457, -0.10290009061116254, -0.14047211790575256, 0.40742117786614956, 0.004172727653146663, -0.24109307587105497, 0.19740167933129288, -0.05220520993564985, -0.18232961965111805, 0.02993496342140686, 0.19304107736112386, 0.12993421857657877, -0.1883768230187412, 0.053949041267019944, -0.0504525526459152, 0.0472904939699588, 0.18581131964485761, 0.1673413110171928, 0.16386937579918134, 0.14364348446561284, 0.09141292224919624, 0.14148840536083437, -0.08738721428362393, -0.07703607172898276, -0.35462291530463136, -0.16079538107460625, -0.14684161028155726, -0.06771143501671621, -0.03213822170893096, -0.12303262834048158, 0.37808174947335654, 0.15513672010348284, 0.22363222417380377, 0.04757628620593349, 0.2632106879101241, 0.03963357463252106, 0.12203040707096033, 0.06667665670673022, 0.20507253059466027, 0.15721358637962066, 0.13212313772108453, -0.021132231041600433, -0.062143460365566366, 0.16290666990796668] |
1,802.03353 | Extragalactic archaeology with the C, N, and O chemical abundances | We predict how the C, N, and O abundances within the interstellar medium of
galaxies evolve as functions of the galaxy star formation history (SFH). We
adopt a hydrodynamical cosmological simulation, focusing on three star-forming
disc galaxies with different SFHs. By assuming failed supernovae, we can
predict an increasing trend of the gas-phase N/O--O/H abundance diagram, which
was not produced in our previous simulations without failed supernovae. At high
redshifts, contrary to the predictions of classical chemical evolution models
with instantaneous mixing approximation, we find almost flat trends in the
N/O--O/H diagram, which are due to the contribution of intermediate-mass stars
together with an inhomogeneous chemical enrichment. Finally, we also predict
that the average N/O and C/O steadily increase as functions of time, while the
average C/N decreases, due to the mass and metallicity dependence of the yields
of asymptotic giant branch stars; such variations are more marked during more
intense star formation episodes. Our predictions on the CNO abundance evolution
can be used to study the SFH of disc galaxies with the James Webb Space
Telescope.
| astro-ph.GA | we predict how the c n and o abundances within the interstellar medium of galaxies evolve as functions of the galaxy star formation history sfh we adopt a hydrodynamical cosmological simulation focusing on three starforming disc galaxies with different sfhs by assuming failed supernovae we can predict an increasing trend of the gasphase nooh abundance diagram which was not produced in our previous simulations without failed supernovae at high redshifts contrary to the predictions of classical chemical evolution models with instantaneous mixing approximation we find almost flat trends in the nooh diagram which are due to the contribution of intermediatemass stars together with an inhomogeneous chemical enrichment finally we also predict that the average no and co steadily increase as functions of time while the average cn decreases due to the mass and metallicity dependence of the yields of asymptotic giant branch stars such variations are more marked during more intense star formation episodes our predictions on the cno abundance evolution can be used to study the sfh of disc galaxies with the james webb space telescope | [['we', 'predict', 'how', 'the', 'c', 'n', 'and', 'o', 'abundances', 'within', 'the', 'interstellar', 'medium', 'of', 'galaxies', 'evolve', 'as', 'functions', 'of', 'the', 'galaxy', 'star', 'formation', 'history', 'sfh', 'we', 'adopt', 'a', 'hydrodynamical', 'cosmological', 'simulation', 'focusing', 'on', 'three', 'starforming', 'disc', 'galaxies', 'with', 'different', 'sfhs', 'by', 'assuming', 'failed', 'supernovae', 'we', 'can', 'predict', 'an', 'increasing', 'trend', 'of', 'the', 'gasphase', 'nooh', 'abundance', 'diagram', 'which', 'was', 'not', 'produced', 'in', 'our', 'previous', 'simulations', 'without', 'failed', 'supernovae', 'at', 'high', 'redshifts', 'contrary', 'to', 'the', 'predictions', 'of', 'classical', 'chemical', 'evolution', 'models', 'with', 'instantaneous', 'mixing', 'approximation', 'we', 'find', 'almost', 'flat', 'trends', 'in', 'the', 'nooh', 'diagram', 'which', 'are', 'due', 'to', 'the', 'contribution', 'of', 'intermediatemass', 'stars', 'together', 'with', 'an', 'inhomogeneous', 'chemical', 'enrichment', 'finally', 'we', 'also', 'predict', 'that', 'the', 'average', 'no', 'and', 'co', 'steadily', 'increase', 'as', 'functions', 'of', 'time', 'while', 'the', 'average', 'cn', 'decreases', 'due', 'to', 'the', 'mass', 'and', 'metallicity', 'dependence', 'of', 'the', 'yields', 'of', 'asymptotic', 'giant', 'branch', 'stars', 'such', 'variations', 'are', 'more', 'marked', 'during', 'more', 'intense', 'star', 'formation', 'episodes', 'our', 'predictions', 'on', 'the', 'cno', 'abundance', 'evolution', 'can', 'be', 'used', 'to', 'study', 'the', 'sfh', 'of', 'disc', 'galaxies', 'with', 'the', 'james', 'webb', 'space', 'telescope']] | [-0.04281436973238248, 0.12533613371858138, -0.08436510561686536, 0.09836984303711498, -0.0779555426071277, -0.02071384909841637, 0.05714630825434532, 0.4546850074482503, -0.1459648607697964, -0.34944805114774696, 0.0023554950777578067, -0.28300364548077356, -0.05214982348925692, 0.14526285992219706, -0.03238121690342037, -0.03964981688896857, 0.0787812883986718, -0.09172190037045606, -0.08647123009287411, -0.3404663747326487, 0.3264900449174062, 0.10307608719646805, 0.17075454019073208, -0.049849715494250844, -0.0034101755390506723, -0.13752944342065918, -0.09577562710754363, -0.033863102883201796, -0.18783368510582996, 0.0023562283160449083, 0.22086057180662835, 0.14547829300501927, 0.19393751562946598, -0.4179012968815274, -0.24700749598148852, 0.10693876938841775, 0.21925214635955412, 0.08610938911426202, -0.09711051300060501, -0.21725533190472734, 0.050934292665435435, -0.19716658867306291, -0.16098171912362577, 0.06412319168132746, 0.033443526535868476, 0.058631291112791493, -0.23231301117474001, 0.12754629985912766, 0.004140160498038292, 0.08162253794239276, -0.11014735809458935, -0.09109362508735941, -0.12917648081465147, 0.11193301136497577, 0.02289829060361631, 0.08305566756865063, 0.17336818306985716, -0.14242358024805615, 0.002170645092524546, 0.4111515239912406, -0.14659423555417175, -0.01316094838377446, 0.24519565703063192, -0.21424721791750967, -0.17176452511395354, 0.09547562614651554, 0.1502044592960343, 0.12170192426449414, -0.12106916842598069, 0.011879283460291197, 0.022283598599103043, 0.19336994849066486, 0.04841700428965275, 0.02647326634034296, 0.2866120435676332, 0.12788082710348891, 0.03146542627055272, 0.05387098677811544, -0.1442511438294761, -0.08901678216196386, -0.22193304497201397, -0.11809908410029138, -0.09558340177297761, 0.10200615874355157, -0.17802107940787398, -0.138682240828093, 0.31619302499092233, 0.10027498214230689, 0.25256469893916433, 0.08061227756605015, 0.2775975970162005, 0.08005089337620516, 0.10724746840834976, 0.09288537322864526, 0.2788005829551968, 0.18849967467719636, 0.09771827264033826, -0.2983195791073607, 0.15821302371325846, 0.01538377767823384] |
1,802.03354 | Electron Spin Coherences in Rare-Earth Optically Excited States for
Microwave to Optical Quantum Transducers | Efficient and reversible optical to microwave coherent transducers are
required to enable entanglement transfer between superconducting qubits and
light for quantum networks. Rare-earth-doped crystals that possess narrow
optical and spin transitions are a promising way to implement these devices.
Current approaches use ground-state electron spin transitions that have
coherence lifetimes ($T_2$) often limited by spin flip-flop processes and/or
spectral diffusion, even at very low temperatures. Here, we investigate spin
coherence in an optically excited state of an Er$^{3+}$:Y$_2$SiO$_5$ crystal at
temperatures from 1.6 to 3.5 K and under a weak 8.7 mT magnetic field. Spin
coherence and population lifetimes of up to 1.6 $\mu$s and 1.2 ms,
respectively, are measured by 2- and 3-pulse optically-detected spin echo
experiments. Analysis of the dephasing processes suggest that ms $T_2$ can be
reached at lower temperatures for the excited-state spins, whereas ground-state
spin states could be limited to a few $\mu$s due to resonant interactions with
the other Er$^{3+}$ spins in the lattice (spin diffusion). We propose a quantum
transducer scheme with the potential for close to unit efficiency that exploits
the specific advantages offered by the spin states of optically excited
electronic energy levels.
| quant-ph | efficient and reversible optical to microwave coherent transducers are required to enable entanglement transfer between superconducting qubits and light for quantum networks rareearthdoped crystals that possess narrow optical and spin transitions are a promising way to implement these devices current approaches use groundstate electron spin transitions that have coherence lifetimes t_2 often limited by spin flipflop processes andor spectral diffusion even at very low temperatures here we investigate spin coherence in an optically excited state of an er3y_2sio_5 crystal at temperatures from 16 to 35 k and under a weak 87 mt magnetic field spin coherence and population lifetimes of up to 16 mus and 12 ms respectively are measured by 2 and 3pulse opticallydetected spin echo experiments analysis of the dephasing processes suggest that ms t_2 can be reached at lower temperatures for the excitedstate spins whereas groundstate spin states could be limited to a few mus due to resonant interactions with the other er3 spins in the lattice spin diffusion we propose a quantum transducer scheme with the potential for close to unit efficiency that exploits the specific advantages offered by the spin states of optically excited electronic energy levels | [['efficient', 'and', 'reversible', 'optical', 'to', 'microwave', 'coherent', 'transducers', 'are', 'required', 'to', 'enable', 'entanglement', 'transfer', 'between', 'superconducting', 'qubits', 'and', 'light', 'for', 'quantum', 'networks', 'rareearthdoped', 'crystals', 'that', 'possess', 'narrow', 'optical', 'and', 'spin', 'transitions', 'are', 'a', 'promising', 'way', 'to', 'implement', 'these', 'devices', 'current', 'approaches', 'use', 'groundstate', 'electron', 'spin', 'transitions', 'that', 'have', 'coherence', 'lifetimes', 't_2', 'often', 'limited', 'by', 'spin', 'flipflop', 'processes', 'andor', 'spectral', 'diffusion', 'even', 'at', 'very', 'low', 'temperatures', 'here', 'we', 'investigate', 'spin', 'coherence', 'in', 'an', 'optically', 'excited', 'state', 'of', 'an', 'er3y_2sio_5', 'crystal', 'at', 'temperatures', 'from', '16', 'to', '35', 'k', 'and', 'under', 'a', 'weak', '87', 'mt', 'magnetic', 'field', 'spin', 'coherence', 'and', 'population', 'lifetimes', 'of', 'up', 'to', '16', 'mus', 'and', '12', 'ms', 'respectively', 'are', 'measured', 'by', '2', 'and', '3pulse', 'opticallydetected', 'spin', 'echo', 'experiments', 'analysis', 'of', 'the', 'dephasing', 'processes', 'suggest', 'that', 'ms', 't_2', 'can', 'be', 'reached', 'at', 'lower', 'temperatures', 'for', 'the', 'excitedstate', 'spins', 'whereas', 'groundstate', 'spin', 'states', 'could', 'be', 'limited', 'to', 'a', 'few', 'mus', 'due', 'to', 'resonant', 'interactions', 'with', 'the', 'other', 'er3', 'spins', 'in', 'the', 'lattice', 'spin', 'diffusion', 'we', 'propose', 'a', 'quantum', 'transducer', 'scheme', 'with', 'the', 'potential', 'for', 'close', 'to', 'unit', 'efficiency', 'that', 'exploits', 'the', 'specific', 'advantages', 'offered', 'by', 'the', 'spin', 'states', 'of', 'optically', 'excited', 'electronic', 'energy', 'levels']] | [-0.11922238575910644, 0.2810456340001413, 0.018228063853105898, 0.032358098091208376, 0.014913958333636401, -0.18163180722816227, 0.0994684544299768, 0.4777393087085026, -0.2439434433132798, -0.31018952413433, 0.047330059303324866, -0.2878187064391871, 0.0003493635388925516, 0.2178894504419683, 0.06186445447140917, 0.035031375856002946, 0.01896031324516419, -0.013950473175100342, -0.07904514859546907, -0.1696175976479329, 0.23084183080800358, 0.0368580356722911, 0.29947214421069174, 0.08053583949943761, 0.10882263205712661, -0.025757752375284326, 0.1287560755154118, -0.06307630522618031, -0.09682250893168505, 0.08187553070282168, 0.28743234830229386, -0.011593322378757875, 0.1847573870133298, -0.4607304156234022, -0.19287223014301466, 0.05301005706860451, 0.14492634965684678, 0.18818055538091963, -0.027941117029210243, -0.2837994107200454, 0.049245760177958196, -0.15726200087313677, -0.09070770928390932, -0.13568479132663924, 0.03438975688974703, -0.008560174529217571, -0.22943304056631555, 0.11020467868244548, 0.05824811186539591, 0.06943473998398986, -0.045810529715784774, -0.1067780295694926, -0.015711439549098333, 0.08324281291424995, -0.0349863853395315, 0.03959297674979704, 0.18323518944574366, -0.07915378268231166, -0.17884523251511078, 0.30161921330667, -0.08181023182017573, -0.09118321709077766, 0.21230811926094853, -0.1774343998695258, -0.07513758579443675, 0.18473125438322313, 0.12080450921500112, 0.11561213401849575, -0.14864379160280805, -0.006051918457311937, 0.07676970972170238, 0.20807183755096048, 0.05471045515029497, 0.17448506200586658, 0.2463553699926706, 0.15729989354864907, 0.04458978388841691, 0.12557196294892492, -0.16115405803187363, -0.07173063487546945, -0.1655941530286024, -0.14024833251899813, -0.21205384969653096, 0.14295256097041906, -0.042042983278179236, -0.058280066178478286, 0.3852539746968091, 0.14934980255149335, 0.16043295213603415, -0.0024565105777583085, 0.26693039024151705, 0.10406106366766228, 0.09529333004077974, 0.06515909764614965, 0.2508804873020078, 0.21488020479106731, 0.09786887323328604, -0.3290862972244213, 0.003739156176986095, -0.06500054630017378] |
1,802.03355 | Directed polymers in heavy-tail random environment | We study the directed polymer model in dimension ${1+1}$ when the environment
is heavy-tailed, with a decay exponent $\alpha\in(0,2)$. We give all possible
scaling limits of the model in the weak-coupling regime, i.e., when the inverse
temperature temperature $\beta=\beta_n$ vanishes as the size of the system $n$
goes to infinity. When $\alpha\in(1/2,2)$, we show that all possible
transversal fluctuations $\sqrt{n} \leq h_n \leq n$ can be achieved by tuning
properly $\beta_n$, allowing to interpolate between all super-diffusive scales.
Moreover, we determine the scaling limit of the model, answering a conjecture
by Dey and Zygouras [cf:DZ] - we actually identify five different regimes. On
the other hand, when $\alpha<1/2$, we show that there are only two regimes: the
transversal fluctuations are either $\sqrt{n}$ or $n$. As a key ingredient, we
use the Entropy-controlled Last Passage Percolation (E-LPP), introduced in a
companion paper [cf:BT_ELPP].
| math.PR | we study the directed polymer model in dimension 11 when the environment is heavytailed with a decay exponent alphain02 we give all possible scaling limits of the model in the weakcoupling regime ie when the inverse temperature temperature betabeta_n vanishes as the size of the system n goes to infinity when alphain122 we show that all possible transversal fluctuations sqrtn leq h_n leq n can be achieved by tuning properly beta_n allowing to interpolate between all superdiffusive scales moreover we determine the scaling limit of the model answering a conjecture by dey and zygouras cfdz we actually identify five different regimes on the other hand when alpha12 we show that there are only two regimes the transversal fluctuations are either sqrtn or n as a key ingredient we use the entropycontrolled last passage percolation elpp introduced in a companion paper cfbt_elpp | [['we', 'study', 'the', 'directed', 'polymer', 'model', 'in', 'dimension', '11', 'when', 'the', 'environment', 'is', 'heavytailed', 'with', 'a', 'decay', 'exponent', 'alphain02', 'we', 'give', 'all', 'possible', 'scaling', 'limits', 'of', 'the', 'model', 'in', 'the', 'weakcoupling', 'regime', 'ie', 'when', 'the', 'inverse', 'temperature', 'temperature', 'betabeta_n', 'vanishes', 'as', 'the', 'size', 'of', 'the', 'system', 'n', 'goes', 'to', 'infinity', 'when', 'alphain122', 'we', 'show', 'that', 'all', 'possible', 'transversal', 'fluctuations', 'sqrtn', 'leq', 'h_n', 'leq', 'n', 'can', 'be', 'achieved', 'by', 'tuning', 'properly', 'beta_n', 'allowing', 'to', 'interpolate', 'between', 'all', 'superdiffusive', 'scales', 'moreover', 'we', 'determine', 'the', 'scaling', 'limit', 'of', 'the', 'model', 'answering', 'a', 'conjecture', 'by', 'dey', 'and', 'zygouras', 'cfdz', 'we', 'actually', 'identify', 'five', 'different', 'regimes', 'on', 'the', 'other', 'hand', 'when', 'alpha12', 'we', 'show', 'that', 'there', 'are', 'only', 'two', 'regimes', 'the', 'transversal', 'fluctuations', 'are', 'either', 'sqrtn', 'or', 'n', 'as', 'a', 'key', 'ingredient', 'we', 'use', 'the', 'entropycontrolled', 'last', 'passage', 'percolation', 'elpp', 'introduced', 'in', 'a', 'companion', 'paper', 'cfbt_elpp']] | [-0.15215704722932594, 0.21960894698071676, -0.03994424448533477, 0.06287505908745944, -9.48210761313984e-05, -0.21782106231993942, 0.04586399246695424, 0.34405594514956805, -0.26568864012712284, -0.252436900511384, 0.09029840745685813, -0.3050815259938484, -0.12780936339678353, 0.17026852632817976, -0.007151975435964928, 0.02554760717869024, -0.01846707606797709, 0.03722408308899235, -0.018777091342866804, -0.2649658225846532, 0.2903740474087981, -0.00715763944796944, 0.24795639275929288, 0.05002533056540415, 0.06120553724544794, -0.006268664261048851, 0.03620018796337878, 0.030982119572239324, -0.2078125013543767, 0.003033997569753624, 0.203190068315427, 0.04385362962014316, 0.2601545158335391, -0.360709824195296, -0.19603779230451704, 0.161139501927263, 0.2194778971504146, 0.0696818024486728, 0.057547280468176774, -0.2185428655545419, 0.09045029400337679, -0.143561053171973, -0.1611793184420094, -0.04995042422224822, 0.06816962119260364, 0.016307086334135794, -0.28157612564973533, 0.0770273105111247, 0.12542622261560823, 0.015589461337453137, 0.00018132259206408088, -0.10030285124786828, 0.00820365168072064, 0.1501901113815085, 0.0677165149955887, 0.0180786656376714, 0.10240361219450064, -0.10881931755198714, -0.07805940228760899, 0.32006842675550345, -0.08481275024378727, -0.16900867971793665, 0.17177311659393393, -0.20762358541490838, -0.1485533787875765, 0.07007196653798661, 0.12567242154481767, 0.12543215019874931, -0.07752498915386455, 0.15184095666892758, -0.0482528030355324, 0.18425183683661195, 0.09339118083281552, 0.004456920877975576, 0.11238504580550772, 0.1502829778679263, 0.08685290593626525, 0.14474603492614252, -0.09186806011198581, -0.07464850084558267, -0.3217497130801134, -0.13152442937579883, -0.20241708377537126, 0.11190927703693673, -0.16517957882698445, -0.11746126011370078, 0.3211252040174954, 0.1886921063894132, 0.2637788891819689, 0.10770523386514362, 0.22544714003999936, 0.13397103570990593, 0.0051459589192424625, 0.13648999821709687, 0.20201980408883707, 0.11862695615341448, 0.04379608177045798, -0.19366563915494173, 0.0357475423712886, 0.09483423266518752] |
1,802.03356 | Tidal evolution of the Moon from a high-obliquity, high-angular-momentum
Earth | In the giant impact hypothesis for lunar origin, the Moon accreted from an
equatorial circum-terrestrial disk; however the current lunar orbital
inclination of 5 degrees requires a subsequent dynamical process that is still
debated. In addition, the giant impact theory has been challenged by the Moon's
unexpectedly Earth-like isotopic composition. Here, we show that tidal
dissipation due to lunar obliquity was an important effect during the Moon's
tidal evolution, and the past lunar inclination must have been very large,
defying theoretical explanations. We present a new tidal evolution model
starting with the Moon in an equatorial orbit around an initially
fast-spinning, high-obliquity Earth, which is a probable outcome of giant
impacts. Using numerical modeling, we show that the solar perturbations on the
Moon's orbit naturally induce a large lunar inclination and remove angular
momentum from the Earth-Moon system. Our tidal evolution model supports recent
high-angular momentum giant impact scenarios to explain the Moon's isotopic
composition and provides a new pathway to reach Earth's climatically favorable
low obliquity.
| astro-ph.EP | in the giant impact hypothesis for lunar origin the moon accreted from an equatorial circumterrestrial disk however the current lunar orbital inclination of 5 degrees requires a subsequent dynamical process that is still debated in addition the giant impact theory has been challenged by the moons unexpectedly earthlike isotopic composition here we show that tidal dissipation due to lunar obliquity was an important effect during the moons tidal evolution and the past lunar inclination must have been very large defying theoretical explanations we present a new tidal evolution model starting with the moon in an equatorial orbit around an initially fastspinning highobliquity earth which is a probable outcome of giant impacts using numerical modeling we show that the solar perturbations on the moons orbit naturally induce a large lunar inclination and remove angular momentum from the earthmoon system our tidal evolution model supports recent highangular momentum giant impact scenarios to explain the moons isotopic composition and provides a new pathway to reach earths climatically favorable low obliquity | [['in', 'the', 'giant', 'impact', 'hypothesis', 'for', 'lunar', 'origin', 'the', 'moon', 'accreted', 'from', 'an', 'equatorial', 'circumterrestrial', 'disk', 'however', 'the', 'current', 'lunar', 'orbital', 'inclination', 'of', '5', 'degrees', 'requires', 'a', 'subsequent', 'dynamical', 'process', 'that', 'is', 'still', 'debated', 'in', 'addition', 'the', 'giant', 'impact', 'theory', 'has', 'been', 'challenged', 'by', 'the', 'moons', 'unexpectedly', 'earthlike', 'isotopic', 'composition', 'here', 'we', 'show', 'that', 'tidal', 'dissipation', 'due', 'to', 'lunar', 'obliquity', 'was', 'an', 'important', 'effect', 'during', 'the', 'moons', 'tidal', 'evolution', 'and', 'the', 'past', 'lunar', 'inclination', 'must', 'have', 'been', 'very', 'large', 'defying', 'theoretical', 'explanations', 'we', 'present', 'a', 'new', 'tidal', 'evolution', 'model', 'starting', 'with', 'the', 'moon', 'in', 'an', 'equatorial', 'orbit', 'around', 'an', 'initially', 'fastspinning', 'highobliquity', 'earth', 'which', 'is', 'a', 'probable', 'outcome', 'of', 'giant', 'impacts', 'using', 'numerical', 'modeling', 'we', 'show', 'that', 'the', 'solar', 'perturbations', 'on', 'the', 'moons', 'orbit', 'naturally', 'induce', 'a', 'large', 'lunar', 'inclination', 'and', 'remove', 'angular', 'momentum', 'from', 'the', 'earthmoon', 'system', 'our', 'tidal', 'evolution', 'model', 'supports', 'recent', 'highangular', 'momentum', 'giant', 'impact', 'scenarios', 'to', 'explain', 'the', 'moons', 'isotopic', 'composition', 'and', 'provides', 'a', 'new', 'pathway', 'to', 'reach', 'earths', 'climatically', 'favorable', 'low', 'obliquity']] | [-0.14737294561178757, 0.1947932262283828, -0.12029649180075723, 0.07767373822533122, -0.12824441147912405, 0.01894332463978539, 0.0019468494647734626, 0.3222983033426976, -0.20762687840103033, -0.34624077033943046, 0.059747047544579705, -0.2316258022238216, -0.1612925092817959, 0.19889703688273083, -0.10935651733188662, 0.00842923093601102, 0.16039175111911969, -0.045910793190688165, -0.051221168990397525, -0.21875227108621456, 0.2423221455959458, 0.17894735973897183, 0.059626898597256686, 0.027419798282493732, 0.08926437049834016, -0.07562086824745966, 0.031782519928330255, -0.0690822337648112, -0.17843383776987198, 0.03439797920733969, 0.1649262722163192, 0.12081833453960493, 0.21158852850917928, -0.4704560396389779, -0.22837435808848355, 0.027450079272618284, 0.12773825182205814, 0.0710948771472273, -0.09735202852951663, -0.25764721037518834, 0.03867884994133147, -0.2784314506023587, -0.2335051629513859, 0.00182238247658232, 0.13606524875967535, -0.033468876623068966, -0.2396543657875614, 0.059646494095464665, 0.11173527375679926, 0.16021526394088467, -0.1371902800137233, -0.14820062089781139, -0.0888954229683554, 0.09320609907837149, 0.13920059824807843, 0.02111091268176358, 0.20654190282621784, -0.02373849536978199, -0.023411449284744475, 0.3965909317356094, -0.08405646619325627, -0.06525466712135933, 0.24649903144754334, -0.2501936902593219, -0.13897127693541303, 0.16686067811330546, 0.1948261843090821, 0.10189015240949428, -0.15759760444191936, 0.05061372089695358, -0.010421337840052511, 0.16984671257536657, 0.11041707169225518, 0.018194309117908248, 0.44882038226741516, 0.15807939573988586, 0.07359005699999363, 0.05554561573498977, -0.239494717131999, -0.08878139621706423, -0.13361354466405012, -0.08227192922802029, -0.15010633210311392, 0.07812567936487616, -0.08338093285807506, -0.10615046467899741, 0.33623493049003766, 0.18106593170989596, 0.18943292566736836, -0.041637492502069176, 0.3318654087722067, 0.03194239098246873, 0.08274001507423148, 0.09246783457629516, 0.37351172270175226, 0.12225189019959352, 0.08181549229765099, -0.28880546554577297, 0.18389576651061143, -0.012300611504292238] |
1,802.03357 | A Kulikov-Type Classification Theorem for a One Parameter Family of
K3-Surfaces Over a p-ADIC Field and a Good Reduction Criterion | In this paper, we prove a $p$-adic analogous of the Kulikov-Persson-Pinkham
classification theorem [Persson:1981wp] for the central fiber of a degeneration
of $K3$-surfaces in terms of the nilpotency degree of the monodromy of the
family.
Namely, let $X_K$ be a be a smooth, projective $K3$-surface which has a
minimal semi-stable model $X$ over $\mathcal O_K$.
If we let $N_{st}$ be the monodromy operator on
$D_{st}(H^2_{et}}(X_{\overline K},\mathbb Q_p))$, then we prove that the degree
of nilpotency of $N_{st}$ determines the type of the special fiber of $X$. As a
consequence we give a criterion for the good reduction of the semi-stable
$K3$-surface $X_K$ over the $p$-adic field $K$ in terms of its $p$-adic
representation $H^2_{\text{et}}(X_{\overline K},\mathbb Q_p)$, which is similar
to the criterion of good reduction for $p$-adic abelian varieties and curves
given by Coleman-Iovita and Andreatta-Iovita-Kim.
| math.AG math.NT | in this paper we prove a padic analogous of the kulikovperssonpinkham classification theorem persson1981wp for the central fiber of a degeneration of k3surfaces in terms of the nilpotency degree of the monodromy of the family namely let x_k be a be a smooth projective k3surface which has a minimal semistable model x over mathcal o_k if we let n_st be the monodromy operator on d_sth2_etx_overline kmathbb q_p then we prove that the degree of nilpotency of n_st determines the type of the special fiber of x as a consequence we give a criterion for the good reduction of the semistable k3surface x_k over the padic field k in terms of its padic representation h2_textetx_overline kmathbb q_p which is similar to the criterion of good reduction for padic abelian varieties and curves given by colemaniovita and andreattaiovitakim | [['in', 'this', 'paper', 'we', 'prove', 'a', 'padic', 'analogous', 'of', 'the', 'kulikovperssonpinkham', 'classification', 'theorem', 'persson1981wp', 'for', 'the', 'central', 'fiber', 'of', 'a', 'degeneration', 'of', 'k3surfaces', 'in', 'terms', 'of', 'the', 'nilpotency', 'degree', 'of', 'the', 'monodromy', 'of', 'the', 'family', 'namely', 'let', 'x_k', 'be', 'a', 'be', 'a', 'smooth', 'projective', 'k3surface', 'which', 'has', 'a', 'minimal', 'semistable', 'model', 'x', 'over', 'mathcal', 'o_k', 'if', 'we', 'let', 'n_st', 'be', 'the', 'monodromy', 'operator', 'on', 'd_sth2_etx_overline', 'kmathbb', 'q_p', 'then', 'we', 'prove', 'that', 'the', 'degree', 'of', 'nilpotency', 'of', 'n_st', 'determines', 'the', 'type', 'of', 'the', 'special', 'fiber', 'of', 'x', 'as', 'a', 'consequence', 'we', 'give', 'a', 'criterion', 'for', 'the', 'good', 'reduction', 'of', 'the', 'semistable', 'k3surface', 'x_k', 'over', 'the', 'padic', 'field', 'k', 'in', 'terms', 'of', 'its', 'padic', 'representation', 'h2_textetx_overline', 'kmathbb', 'q_p', 'which', 'is', 'similar', 'to', 'the', 'criterion', 'of', 'good', 'reduction', 'for', 'padic', 'abelian', 'varieties', 'and', 'curves', 'given', 'by', 'colemaniovita', 'and', 'andreattaiovitakim']] | [-0.22180722973381098, 0.04261893262513555, -0.14954441161468052, 0.006555091081043849, -0.05445137618897626, -0.13924437663876094, 0.007107103932111595, 0.27777633630097487, -0.32168695049790236, -0.15957263396479762, 0.07698818177271348, -0.2063681186767868, -0.12056351223817238, 0.22457803638043025, -0.1932373311298971, -0.034736820278563896, -0.006769291198669145, 0.1800348448782013, -0.0830125922193894, -0.3373846561433031, 0.38401948880547515, -0.06818366095181913, 0.22065893141015505, 0.06146904523126208, 0.14251314171650356, 0.0518885351323451, 0.04726463680227216, -0.05080384966344215, -0.16862178795031818, 0.149009209830099, 0.3308411652670027, 0.05006508216118583, 0.22741731895277134, -0.32173833513202577, -0.16333921711820248, 0.31760148941181027, 0.14373302777441074, -0.040421761753252496, 0.010469075846664894, -0.23067664821417286, 0.1822901103609743, -0.17100377040400278, -0.1931312046192873, -0.07622273310374182, 0.08124208837264002, 0.05535447387687432, -0.28860909804845086, 0.003535792654236922, 0.11294314020958085, 0.20164351351559162, -0.04546231030074593, -0.09877841154543253, -0.09651302903030927, 0.0033269417078162617, 0.001857645792635874, 0.10023478802938302, 0.05944463134241792, -0.10868144121128492, -0.07944337996797493, 0.37495996897028255, -0.12397917016910819, -0.17768603477340478, 0.056931019345155126, -0.15978631352504286, -0.14864242715187945, 0.12508264423724122, 0.10680440848048489, 0.18971493410376403, 0.026530847125328504, 0.21461935590576522, -0.1656168558348257, 0.0896540762283481, 0.09294751334505585, -0.004723307099909736, 0.142605769333358, 0.0884566661901772, 0.06278469810047402, 0.1329321221430571, -0.01743604200354849, 0.005398874421818898, -0.41350583095963184, -0.22852984077941912, -0.11421649768375433, 0.17962270291665425, -0.17562686629535165, -0.15638271007830135, 0.43966662467528994, 0.05226985399181453, 0.21098736830127354, 0.13692605953412848, 0.18219218233313697, 0.10830112805213922, 0.04410403133728183, 0.015757582934859852, 0.08635707213543356, 0.23265094172675163, -0.07536224955513787, -0.16170910611354675, -0.01882024554070085, 0.19907511103755007] |
1,802.03358 | Deep Learning for Malicious Flow Detection | Cyber security has grown up to be a hot issue in recent years. How to
identify potential malware becomes a challenging task. To tackle this
challenge, we adopt deep learning approaches and perform flow detection on real
data. However, real data often encounters an issue of imbalanced data
distribution which will lead to a gradient dilution issue. When training a
neural network, this problem will not only result in a bias toward the majority
class but show the inability to learn from the minority classes. In this paper,
we propose an end-to-end trainable Tree-Shaped Deep Neural Network (TSDNN)
which classifies the data in a layer-wise manner. To better learn from the
minority classes, we propose a Quantity Dependent Backpropagation (QDBP)
algorithm which incorporates the knowledge of the disparity between classes. We
evaluate our method on an imbalanced data set. Experimental result demonstrates
that our approach outperforms the state-of-the-art methods and justifies that
the proposed method is able to overcome the difficulty of imbalanced learning.
We also conduct a partial flow experiment which shows the feasibility of
real-time detection and a zero-shot learning experiment which justifies the
generalization capability of deep learning in cyber security.
| cs.LG cs.CR stat.ML | cyber security has grown up to be a hot issue in recent years how to identify potential malware becomes a challenging task to tackle this challenge we adopt deep learning approaches and perform flow detection on real data however real data often encounters an issue of imbalanced data distribution which will lead to a gradient dilution issue when training a neural network this problem will not only result in a bias toward the majority class but show the inability to learn from the minority classes in this paper we propose an endtoend trainable treeshaped deep neural network tsdnn which classifies the data in a layerwise manner to better learn from the minority classes we propose a quantity dependent backpropagation qdbp algorithm which incorporates the knowledge of the disparity between classes we evaluate our method on an imbalanced data set experimental result demonstrates that our approach outperforms the stateoftheart methods and justifies that the proposed method is able to overcome the difficulty of imbalanced learning we also conduct a partial flow experiment which shows the feasibility of realtime detection and a zeroshot learning experiment which justifies the generalization capability of deep learning in cyber security | [['cyber', 'security', 'has', 'grown', 'up', 'to', 'be', 'a', 'hot', 'issue', 'in', 'recent', 'years', 'how', 'to', 'identify', 'potential', 'malware', 'becomes', 'a', 'challenging', 'task', 'to', 'tackle', 'this', 'challenge', 'we', 'adopt', 'deep', 'learning', 'approaches', 'and', 'perform', 'flow', 'detection', 'on', 'real', 'data', 'however', 'real', 'data', 'often', 'encounters', 'an', 'issue', 'of', 'imbalanced', 'data', 'distribution', 'which', 'will', 'lead', 'to', 'a', 'gradient', 'dilution', 'issue', 'when', 'training', 'a', 'neural', 'network', 'this', 'problem', 'will', 'not', 'only', 'result', 'in', 'a', 'bias', 'toward', 'the', 'majority', 'class', 'but', 'show', 'the', 'inability', 'to', 'learn', 'from', 'the', 'minority', 'classes', 'in', 'this', 'paper', 'we', 'propose', 'an', 'endtoend', 'trainable', 'treeshaped', 'deep', 'neural', 'network', 'tsdnn', 'which', 'classifies', 'the', 'data', 'in', 'a', 'layerwise', 'manner', 'to', 'better', 'learn', 'from', 'the', 'minority', 'classes', 'we', 'propose', 'a', 'quantity', 'dependent', 'backpropagation', 'qdbp', 'algorithm', 'which', 'incorporates', 'the', 'knowledge', 'of', 'the', 'disparity', 'between', 'classes', 'we', 'evaluate', 'our', 'method', 'on', 'an', 'imbalanced', 'data', 'set', 'experimental', 'result', 'demonstrates', 'that', 'our', 'approach', 'outperforms', 'the', 'stateoftheart', 'methods', 'and', 'justifies', 'that', 'the', 'proposed', 'method', 'is', 'able', 'to', 'overcome', 'the', 'difficulty', 'of', 'imbalanced', 'learning', 'we', 'also', 'conduct', 'a', 'partial', 'flow', 'experiment', 'which', 'shows', 'the', 'feasibility', 'of', 'realtime', 'detection', 'and', 'a', 'zeroshot', 'learning', 'experiment', 'which', 'justifies', 'the', 'generalization', 'capability', 'of', 'deep', 'learning', 'in', 'cyber', 'security']] | [-0.061979951980902115, -0.007105296615084929, -0.08499000980130707, 0.06576508643168684, -0.12813614995684475, -0.1570226473340881, 0.07136395290308428, 0.4139981947567624, -0.2871011167468775, -0.3474594871198254, 0.044445257086408674, -0.2685988128456908, -0.21278095983628495, 0.18832648360936824, -0.16276601235828517, 0.08327847136630832, 0.13462934516367872, 0.0033693209455426163, -0.0643678124639943, -0.307964906343841, 0.34263196270452073, 0.031710316369602275, 0.37364048897264485, 0.0720633670668273, 0.12886423971031036, -0.04452191501331981, -0.016749973025828997, -0.006496904113494868, -0.04995646267987771, 0.16978646386814944, 0.34146449695981573, 0.20031650881477012, 0.37278554736985825, -0.38802917455905117, -0.23892054390247117, 0.13666458967054496, 0.14959846137207933, 0.14649245195020436, -0.05090944094740735, -0.3231474535423331, 0.07475191661554466, -0.20349944302021564, -0.039515236581792124, -0.14941813207830515, -0.05073699324566405, -0.05265735272405436, -0.2802906585105423, 0.02628959932781072, 0.08135028954347945, 0.036528793461078145, -0.034341659784937896, -0.06446544848343667, 0.07420001340627398, 0.13218510095293823, 0.05698451967934185, 0.07020653497117262, 0.12314535842839784, -0.17819572035383166, -0.12866940371410843, 0.3397155972197652, -0.05399306069739396, -0.18461959113483317, 0.18874264655217607, -0.01088564604287967, -0.1845665200841419, 0.09809090527899873, 0.26457618724968296, 0.13591385589461424, -0.16935740826291598, -0.010940387797442478, -0.06360901527902267, 0.19233926910965238, -0.018224611403032515, -0.05156475188262751, 0.17121543625641303, 0.28609474732002127, 0.07017530060935921, 0.15228278979035773, -0.1512794827358448, -0.08531454805536971, -0.18761506574810483, -0.08816219702172627, -0.19514507546288465, 0.012863632600859395, -0.040710963109252894, -0.15640703373674114, 0.38061638199724257, 0.28796434643057484, 0.24120863649053112, 0.10466045546309033, 0.3662939078058116, 0.017740452197131162, 0.11172277932564612, 0.10806622021209478, 0.211471583568103, 0.015297794767927067, 0.1560962883480291, -0.19480565932281024, 0.1043210230642823, 0.017616605897880316] |
1,802.03359 | Minimum weight codewords in dual Algebraic-Geometric codes from the
Giulietti-Korchm\'aros curve | In this paper we investigate the number of minimum weight codewords of some
dual Algebraic-Geometric codes associated with the Giulietti-Korchm\'aros
maximal curve, by computing the maximal number of intersections between the
Giulietti-Korchm\'aros curve and lines, plane conics and plane cubics.
| math.CO cs.IT math.IT | in this paper we investigate the number of minimum weight codewords of some dual algebraicgeometric codes associated with the giuliettikorchmaros maximal curve by computing the maximal number of intersections between the giuliettikorchmaros curve and lines plane conics and plane cubics | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'number', 'of', 'minimum', 'weight', 'codewords', 'of', 'some', 'dual', 'algebraicgeometric', 'codes', 'associated', 'with', 'the', 'giuliettikorchmaros', 'maximal', 'curve', 'by', 'computing', 'the', 'maximal', 'number', 'of', 'intersections', 'between', 'the', 'giuliettikorchmaros', 'curve', 'and', 'lines', 'plane', 'conics', 'and', 'plane', 'cubics']] | [-0.28215842831414195, 0.03607927322154865, -0.01950499808881432, 0.03603806803876068, -0.06672212867997587, -0.13178366201464087, 0.07657459365727845, 0.33115495882811957, -0.3295068500563502, -0.24308466410730034, 0.1047763114765985, -0.29713446185924114, -0.17992998296394944, 0.22984499521553517, -0.1625026013236493, 0.07192459552898071, 0.06030859868042171, 0.025597929116338493, -0.1340165230911225, -0.3373126981779933, 0.3910225396044552, 0.021194662619382142, 0.2451638959348202, 0.0013981040567159653, 0.05170245452318341, 0.07325493430253119, -0.004628401680383832, -0.00407090438529849, -0.19351527877151967, 0.18873897003941237, 0.28065059133805337, 0.19380651018582284, 0.09226740580052137, -0.33124819414224477, -0.16770913251675665, 0.26808091446291654, 0.14219207011628895, 0.022986024850979447, 0.028438860131427646, -0.10819603318814189, 0.09239707752130925, -0.08303850004449487, -0.20467246217885987, 0.050844158860854805, 0.02687746291048825, 0.10727779101580381, -0.13774971652310342, -0.07628122492460535, 0.04224357786588371, 0.2296110826311633, 0.012968086497858166, -0.12801531053846701, -0.09371150662191212, 0.00922952214605175, -0.003514910233207047, 0.08027855260297656, -0.007979129499290138, -0.0952675501757767, -0.10930199464783072, 0.3555218601599336, 0.023009356670081617, -0.1733358572702855, 0.056561021227389575, -0.15480511264177038, -0.04332574186846614, 0.17862281461711974, 0.17132844865554944, 0.14837768152356148, -0.060466703656129536, 0.11042027206567581, -0.1315638429252431, 0.05770677572581917, 0.15846729928161948, 0.04773592552519403, 0.19404571373015642, -0.035131926229223606, 0.08253513530362397, 0.21245211915374967, -0.08759302226972068, -0.05593319780891761, -0.36948982290923593, -0.18394199914764614, -0.14485389053006656, 0.03624325689743273, -0.17528638404255617, -0.15272439825348555, 0.44874536562711, 0.026083149877376855, 0.2649152956902981, 0.09464294279459864, 0.22999929168727248, 0.027223551739007236, 0.04220907415729016, 0.174345974822063, 0.1330605527771695, 0.21216907171183266, -0.08363488996401429, -0.24766014819033444, -0.0222724207349529, 0.221552934194915] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.