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.0656 | An implementation of the maximum-caliber principle by replica-averaged
time-resolved restrained simulations | Inferential methods can be used to integrate experimental informations and
molecular simulations. The maximum entropy principle provides a framework for
using equilibrium experimental data and it has been shown that replica-averaged
simulations, restrained using a static potential, are a practical and powerful
implementation of such principle. Here we show that replica-averaged
simulations restrained using a time-dependent potential are equivalent to the
principle of maximum caliber, the dynamic version of the principle of maximum
entropy, and thus may allow to integrate time-resolved data in molecular
dynamics simulations. We provide an analytical proof of the equivalence as well
as a computational validation making use of simple models and synthetic data.
Some limitations and possible solutions are also discussed.
| q-bio.BM cond-mat.stat-mech | inferential methods can be used to integrate experimental informations and molecular simulations the maximum entropy principle provides a framework for using equilibrium experimental data and it has been shown that replicaaveraged simulations restrained using a static potential are a practical and powerful implementation of such principle here we show that replicaaveraged simulations restrained using a timedependent potential are equivalent to the principle of maximum caliber the dynamic version of the principle of maximum entropy and thus may allow to integrate timeresolved data in molecular dynamics simulations we provide an analytical proof of the equivalence as well as a computational validation making use of simple models and synthetic data some limitations and possible solutions are also discussed | [['inferential', 'methods', 'can', 'be', 'used', 'to', 'integrate', 'experimental', 'informations', 'and', 'molecular', 'simulations', 'the', 'maximum', 'entropy', 'principle', 'provides', 'a', 'framework', 'for', 'using', 'equilibrium', 'experimental', 'data', 'and', 'it', 'has', 'been', 'shown', 'that', 'replicaaveraged', 'simulations', 'restrained', 'using', 'a', 'static', 'potential', 'are', 'a', 'practical', 'and', 'powerful', 'implementation', 'of', 'such', 'principle', 'here', 'we', 'show', 'that', 'replicaaveraged', 'simulations', 'restrained', 'using', 'a', 'timedependent', 'potential', 'are', 'equivalent', 'to', 'the', 'principle', 'of', 'maximum', 'caliber', 'the', 'dynamic', 'version', 'of', 'the', 'principle', 'of', 'maximum', 'entropy', 'and', 'thus', 'may', 'allow', 'to', 'integrate', 'timeresolved', 'data', 'in', 'molecular', 'dynamics', 'simulations', 'we', 'provide', 'an', 'analytical', 'proof', 'of', 'the', 'equivalence', 'as', 'well', 'as', 'a', 'computational', 'validation', 'making', 'use', 'of', 'simple', 'models', 'and', 'synthetic', 'data', 'some', 'limitations', 'and', 'possible', 'solutions', 'are', 'also', 'discussed']] | [-0.05486784833626364, 0.026769509299156835, -0.1401071702048444, 0.10420901078338686, -0.09416966867355402, -0.13255938929669037, 0.07177735805478797, 0.3877073115456784, -0.27103077735457765, -0.3258482857174322, 0.1380796484320359, -0.2675755385293119, -0.14401859560932376, 0.25642573439695854, -0.02078523155988047, 0.12379575796882834, 0.11245189732953645, -0.0019669301780818947, -0.04686675600047844, -0.18388267701262967, 0.24031511775887848, 0.09085940898052956, 0.28059225592745896, 0.1176235645462089, 0.12959470013626279, -0.03863289518477885, -0.006629744736608444, 0.11853046444849226, -0.16842587411022242, 0.14278705644558118, 0.23327894604769603, 0.20889923575113675, 0.26990119398065043, -0.465131958260348, -0.24368074476686225, 0.08685548351709976, 0.12498735139052498, 0.16846155552520303, -0.07579407543189039, -0.2335980860516429, 0.08025307183382674, -0.18484302999639654, -0.1354171299628848, -0.17675483139362513, -0.006284565501437898, 0.06701920925753943, -0.2984643118259938, 0.07232417103915124, -0.0012727511971126915, 0.054321449446050746, -0.0485015854835837, -0.08080862388586658, -0.0193120407353139, 0.10232265121630278, 0.0038988786798558736, -0.022092885443973437, 0.11966399556810134, -0.05529920323016612, -0.16730423867212316, 0.3910377277878293, -0.056836094966632104, -0.20852346430745042, 0.21256527847103907, -0.033624018950943364, -0.1316043860564956, 0.07770618723129462, 0.1486736944378272, 0.12938492795811934, -0.18795833068086945, 0.04766011051527273, -0.034204825007340366, 0.14526772977816954, 0.006331506418064237, 0.008805356110985341, 0.19222710323683395, 0.18444012337887103, 0.024726564583384937, 0.16368212365941553, -0.10341659308362164, -0.13520904897820418, -0.29908780329615664, -0.1590758448041845, -0.19655159791817137, 0.045375641639622155, -0.09321796072554048, -0.10765215807278812, 0.34097473166490855, 0.2151713316959917, 0.13682161801772422, 0.06908168977028445, 0.3181341801067455, 0.11495789915339596, 0.04031758402523242, 0.05633834519897375, 0.2468577523079084, 0.1593187321876094, 0.04997869371028062, -0.19374077215692714, 0.05992454430088401, 0.015202277297105053] |
1,802.06561 | Star formation across cosmic time with radio surveys. The promise of the
SKA | This lecture briefly reviews the major recent advances in radio astronomy
made possible by ultra-deep surveys, reaching microJansky flux density levels.
A giant step forward in many fields, including the study of the evolution of
the cosmic star formation history is expected with the advent of the Square
Kilometer Array (SKA).
| astro-ph.GA astro-ph.CO | this lecture briefly reviews the major recent advances in radio astronomy made possible by ultradeep surveys reaching microjansky flux density levels a giant step forward in many fields including the study of the evolution of the cosmic star formation history is expected with the advent of the square kilometer array ska | [['this', 'lecture', 'briefly', 'reviews', 'the', 'major', 'recent', 'advances', 'in', 'radio', 'astronomy', 'made', 'possible', 'by', 'ultradeep', 'surveys', 'reaching', 'microjansky', 'flux', 'density', 'levels', 'a', 'giant', 'step', 'forward', 'in', 'many', 'fields', 'including', 'the', 'study', 'of', 'the', 'evolution', 'of', 'the', 'cosmic', 'star', 'formation', 'history', 'is', 'expected', 'with', 'the', 'advent', 'of', 'the', 'square', 'kilometer', 'array', 'ska']] | [-0.13656202367707795, 0.14551985048341984, 0.024043082697864843, 0.05275127826733332, -0.10367848011938964, 0.04085797019412413, -0.04566625293855574, 0.3819412703023237, -0.20070372016041302, -0.354719564245612, 0.1918476563010949, -0.29689309117840784, -0.1258577715523322, 0.18646690135310387, 0.0371180091820219, -0.03299033371549027, 0.12043617616462357, -0.09893489424504485, -0.05811546081973824, -0.33279659478769946, 0.22990016089569704, 0.205302810917298, 0.2844951929634108, 0.016509353297342565, 0.11215811929501154, -0.05838211959994891, -0.16618000581750975, -0.03423260821613903, -0.169002398556354, 0.09816500177040842, 0.281849563231363, 0.18870433723079225, 0.3109222845557858, -0.49061663001410516, -0.21580979052711935, 0.04358930639265215, 0.14847384133905756, 0.06792448184398167, -0.07765785201142232, -0.27829899249927087, -0.053824533781438484, -0.20691922347645694, -0.21582528520558103, 0.11155374956262462, 0.036642576166081665, 0.08426165341070908, -0.10569845080174797, 0.04572459111245824, -0.031645517520076945, 0.05292285365216872, -0.016808599601705176, -0.18251306512484364, 0.06767701083684668, 0.11184043985992378, 0.028213229501738633, 0.13844836506463004, 0.11123607538220491, -0.2632724980631953, -0.13616645909553649, 0.36916514637642633, -0.0937889323104173, 0.06487025002784588, 0.15432403684940701, -0.26637968770684856, -0.23908144617270605, 0.10989119897724367, 0.18267095417660825, 0.030709726598990315, -0.1720665523818895, 0.07446927305164874, 0.060652990028828235, 0.14595508896837048, 0.04845423234955353, 0.06381996903641551, 0.4091030049923004, 0.23236121301192278, 0.09290312535777762, 0.10610888795196718, -0.20269055609755657, -0.053193229612410436, -0.25342696850352425, -0.10009713432587244, -0.1826432066439998, 0.13397937720897152, -0.034866271951400185, -0.11634112950231806, 0.37490798383220736, 0.13549966040049113, 0.12073507982616623, 0.00635005283059881, 0.3251634973521326, 0.02466653546720159, 0.10944456996067482, -0.006002130744723128, 0.2744700638371903, 0.19606177954861492, 0.16348711006325103, -0.16299995357243746, 0.019733885908042828, 0.005909393808585317] |
1,802.06562 | CUPID-0: the first array of enriched scintillating bolometers for
0\nu\beta\beta decay investigations | The CUPID-0 detector hosted at the Laboratori Nazionali del Gran Sasso,
Italy, is the first large array of enriched scintillating cryogenic detectors
for the investigation of $^{82}$Se neutrinoless double-beta decay
(0$\nu\beta\beta$). CUPID-0 aims at measuring a background index in the region
of interest (RoI) for 0$\nu\beta\beta$ at the level of 10$^{-3}$ c/keV/kg/y,
the lowest value ever measured using cryogenic detectors. This result can be
achieved by a state of the art technology for background suppression and
thorough protocols and procedures for detector preparation and construction. In
this paper, the different phases of the detector design and construction will
be presented, from the material selection (for the absorber production) to the
new and innovative detector structure. The successful construction of the
detector lead to promising detector performance which are here preliminarily
discussed
| physics.ins-det | the cupid0 detector hosted at the laboratori nazionali del gran sasso italy is the first large array of enriched scintillating cryogenic detectors for the investigation of 82se neutrinoless doublebeta decay 0nubetabeta cupid0 aims at measuring a background index in the region of interest roi for 0nubetabeta at the level of 103 ckevkgy the lowest value ever measured using cryogenic detectors this result can be achieved by a state of the art technology for background suppression and thorough protocols and procedures for detector preparation and construction in this paper the different phases of the detector design and construction will be presented from the material selection for the absorber production to the new and innovative detector structure the successful construction of the detector lead to promising detector performance which are here preliminarily discussed | [['the', 'cupid0', 'detector', 'hosted', 'at', 'the', 'laboratori', 'nazionali', 'del', 'gran', 'sasso', 'italy', 'is', 'the', 'first', 'large', 'array', 'of', 'enriched', 'scintillating', 'cryogenic', 'detectors', 'for', 'the', 'investigation', 'of', '82se', 'neutrinoless', 'doublebeta', 'decay', '0nubetabeta', 'cupid0', 'aims', 'at', 'measuring', 'a', 'background', 'index', 'in', 'the', 'region', 'of', 'interest', 'roi', 'for', '0nubetabeta', 'at', 'the', 'level', 'of', '103', 'ckevkgy', 'the', 'lowest', 'value', 'ever', 'measured', 'using', 'cryogenic', 'detectors', 'this', 'result', 'can', 'be', 'achieved', 'by', 'a', 'state', 'of', 'the', 'art', 'technology', 'for', 'background', 'suppression', 'and', 'thorough', 'protocols', 'and', 'procedures', 'for', 'detector', 'preparation', 'and', 'construction', 'in', 'this', 'paper', 'the', 'different', 'phases', 'of', 'the', 'detector', 'design', 'and', 'construction', 'will', 'be', 'presented', 'from', 'the', 'material', 'selection', 'for', 'the', 'absorber', 'production', 'to', 'the', 'new', 'and', 'innovative', 'detector', 'structure', 'the', 'successful', 'construction', 'of', 'the', 'detector', 'lead', 'to', 'promising', 'detector', 'performance', 'which', 'are', 'here', 'preliminarily', 'discussed']] | [-0.041197771382016635, 0.16183029184064182, -0.06345451290432651, 0.01973300911172723, 0.006462780457849686, -0.16377613674849273, 0.01658216280450758, 0.30341234980151055, -0.13898268203036143, -0.3586848732227316, 0.10291007103828284, -0.336800194101838, -0.04141683913050936, 0.22791192089923873, -0.011600226466767848, 0.09750545783541524, 0.09678573910540973, -0.0183413903372219, -0.08083395305304573, -0.24197895215788426, 0.23349095529948288, 0.23844939917146873, 0.3523114928724961, 0.05458441848436801, 0.13952894248247433, -0.04436862739877632, -0.034120854052553815, -0.10547735623012368, -0.11748732674078873, 0.05620019151829183, 0.3870206427599232, 0.14357308785860928, 0.16817131441874572, -0.40487288339779925, -0.09096375708221995, 0.11070840360525136, 0.0825107135818913, 0.04209387663017528, -0.12648142292052328, -0.38320838771044063, 0.10424209827772127, -0.22450252576449062, -0.12656200425341152, 0.035638912312256604, -0.05081519973643411, -0.04833498938510624, -0.24823453575238372, -0.044512670999392864, -0.04096114598751928, 0.006931592232789486, -0.014461279271815258, -0.20233109555063913, 0.11324368466963418, 0.06939056471993144, -0.026194821894527053, 0.012941688500891009, 0.19091867584233674, -0.12304904597314396, -0.07306283953814552, 0.2884490337097444, -0.052218605749882185, -0.07064286575007897, 0.1288569069395845, -0.19926587079188232, -0.13895153575935043, 0.19016063429701788, 0.19885040565322226, 0.11999539222496633, -0.2112367360427295, 0.060091501554527964, 0.07681464819739071, 0.18281457758544442, 0.09326389016619382, 0.07090513312186186, 0.2557071111612738, 0.33929334739491773, 0.05223135840720855, 0.08391097188264561, -0.18564242561920904, 0.022396760373018108, -0.3829053243478903, -0.20736887528126738, -0.10946023566648364, 0.01247685624895474, 0.012429785775580408, -0.10271555239227242, 0.41241651948344393, 0.09705317355961038, 0.0798205946572125, -0.05011597755454624, 0.3009869707103532, 0.007940933355488455, 0.07225091565185442, -0.055425345335299005, 0.3539323299156072, 0.09936645351923429, 0.11538372012571646, -0.23552876241469325, 0.08702848759623101, 0.05623591057530855] |
1,802.06563 | Sharp bilinear estimates and its application to a system of quadratic
derivative nonlinear Schr\"odinger equations | In the present paper, we consider the Cauchy problem of the system of
quadratic derivative nonlinear Schr\"odinger equations for the spatial
dimension $d=2$ and $3$. This system was introduced by M. Colin and T. Colin
(2004). The first author obtained some well-posedness results in the Sobolev
space $H^{s}$. But under some condition for the coefficient of Laplacian, this
result is not optimal. We improve the bilinear estimate by using the nonlinear
version of the classical Loomis-Whitney inequality, and prove the
well-posedness in $H^s$ for $s\ge 1/2$ if $d=2$, and $s>1/2$ if $d=3$.
| math.AP | in the present paper we consider the cauchy problem of the system of quadratic derivative nonlinear schrodinger equations for the spatial dimension d2 and 3 this system was introduced by m colin and t colin 2004 the first author obtained some wellposedness results in the sobolev space hs but under some condition for the coefficient of laplacian this result is not optimal we improve the bilinear estimate by using the nonlinear version of the classical loomiswhitney inequality and prove the wellposedness in hs for sge 12 if d2 and s12 if d3 | [['in', 'the', 'present', 'paper', 'we', 'consider', 'the', 'cauchy', 'problem', 'of', 'the', 'system', 'of', 'quadratic', 'derivative', 'nonlinear', 'schrodinger', 'equations', 'for', 'the', 'spatial', 'dimension', 'd2', 'and', '3', 'this', 'system', 'was', 'introduced', 'by', 'm', 'colin', 'and', 't', 'colin', '2004', 'the', 'first', 'author', 'obtained', 'some', 'wellposedness', 'results', 'in', 'the', 'sobolev', 'space', 'hs', 'but', 'under', 'some', 'condition', 'for', 'the', 'coefficient', 'of', 'laplacian', 'this', 'result', 'is', 'not', 'optimal', 'we', 'improve', 'the', 'bilinear', 'estimate', 'by', 'using', 'the', 'nonlinear', 'version', 'of', 'the', 'classical', 'loomiswhitney', 'inequality', 'and', 'prove', 'the', 'wellposedness', 'in', 'hs', 'for', 'sge', '12', 'if', 'd2', 'and', 's12', 'if', 'd3']] | [-0.11263445716948532, 0.0560998677569644, -0.0225749562491926, 0.07290056387959655, -0.049821231296569436, -0.1626992323132151, -0.05293364838175678, 0.2574618690768662, -0.2686907098041442, -0.2435366760574929, 0.18192856572315338, -0.2894184896621205, -0.16890462982764406, 0.1574252016574104, -0.08310156605084953, 0.09662772021471502, 0.042075549100485186, 0.03093116418154829, -0.07319234613501265, -0.3232646602352717, 0.3682665435354347, -0.037696281113945275, 0.18038043216296026, 0.05455059101286284, 0.11297370979825602, 0.06256231844789632, 0.012885986528683292, -0.026805138170185153, -0.2255019131445569, 0.11061369606329169, 0.19973284583893078, 0.06934311030731212, 0.2703665951874269, -0.38328774979985925, -0.2098009006484695, 0.14429787735191538, 0.10125812554084089, 0.05791383786329433, -0.0066557445426714485, -0.3218015774720065, 0.08888243764269409, -0.08241818506655324, -0.19489600001226948, -0.047786230768036585, 0.07015472089203642, 0.005901751958805582, -0.31204529115221585, 0.15953410168826257, 0.1630168709013125, 0.04790349436275985, -0.16888927472704698, -0.09243541680347256, 0.000600927529613609, 0.025023243459619825, 0.01454829629991487, 0.04988152331308178, -0.03784864730424369, -0.08334838759923435, -0.09119177774688147, 0.31256604074682715, -0.09707526456179988, -0.23619829511026974, 0.10908695723375549, -0.1802911791221603, -0.16452516425077035, 0.036490115945466445, 0.10526989597786704, 0.16143155314089003, -0.12359679016568091, 0.22190911536681993, -0.07200257064592418, 0.15453399896986134, 0.12008375031671123, 0.005989888359023177, -0.009979268605567759, 0.10359823801453509, 0.15110278124516102, 0.16628357386165907, -0.046233126185024565, -0.05556251666933784, -0.3189746167956163, -0.21085715501407243, -0.20890275000989356, 0.08806411873782687, -0.12814910379276387, -0.08485935310423172, 0.344002391915242, 0.11600543320895193, 0.161116549168187, 0.08461546534469919, 0.19174622069366035, 0.17182858096455914, -0.04703253932783137, 0.1240604001795873, 0.2145713813502959, 0.1650509161763298, 0.20010430936742088, -0.2203070802219293, 0.002988808132890288, 0.22847218247656914] |
1,802.06564 | A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems | This paper studies a 4-approximation algorithm for k-prize collecting Steiner
tree problems. This problem generalizes both k-minimum spanning tree problems
and prize collecting Steiner tree problems. Our proposed algorithm employs two
2-approximation algorithms for k-minimum spanning tree problems and prize
collecting Steiner tree problems. Also our algorithm framework can be applied
to a special case of k-prize collecting traveling salesman problems.
| cs.CC cs.DM math.OC | this paper studies a 4approximation algorithm for kprize collecting steiner tree problems this problem generalizes both kminimum spanning tree problems and prize collecting steiner tree problems our proposed algorithm employs two 2approximation algorithms for kminimum spanning tree problems and prize collecting steiner tree problems also our algorithm framework can be applied to a special case of kprize collecting traveling salesman problems | [['this', 'paper', 'studies', 'a', '4approximation', 'algorithm', 'for', 'kprize', 'collecting', 'steiner', 'tree', 'problems', 'this', 'problem', 'generalizes', 'both', 'kminimum', 'spanning', 'tree', 'problems', 'and', 'prize', 'collecting', 'steiner', 'tree', 'problems', 'our', 'proposed', 'algorithm', 'employs', 'two', '2approximation', 'algorithms', 'for', 'kminimum', 'spanning', 'tree', 'problems', 'and', 'prize', 'collecting', 'steiner', 'tree', 'problems', 'also', 'our', 'algorithm', 'framework', 'can', 'be', 'applied', 'to', 'a', 'special', 'case', 'of', 'kprize', 'collecting', 'traveling', 'salesman', 'problems']] | [-0.12466797396793204, 0.011056657659552865, -0.015475111161121878, 0.0978857996613103, -0.2107865191301552, -0.20915827603410866, 0.13937117503285093, 0.36865427357665564, -0.3519918857600098, -0.4121003462222673, 0.12070858548000707, -0.3023033776375765, -0.26111415104340696, 0.24029207172787795, -0.08277774472736706, 0.17282190290674315, 0.27486216033793104, -0.05198511474971044, 0.02370753265538458, -0.38637763847423306, 0.21154964753126693, 0.005626085324812744, 0.22802529547174097, 0.10253175333836827, 0.189755518044645, 0.09038738230780019, -0.00903305358458626, 0.11757765164188409, -0.11508826928418446, 0.0940779790388799, 0.39431178317231647, 0.3108696632592355, 0.31635133969455453, -0.3113741191514468, -0.1692735243379533, 0.2357644929661084, 0.16904726633959907, 0.12570857633915494, -0.004886635318714179, -0.1892259524053878, 0.03195380612860544, -0.05930506859479819, -0.05891089591245025, 0.06724586179164255, -0.008520984327641585, -0.061038136719015694, -0.2834641708976636, -0.029902003773081637, 0.0049649350723977815, -0.05385624456329871, -0.01785536222475565, -0.247364036675732, 0.1329252881282088, 0.02361944093668865, -0.057213897990473245, 0.09348382232552868, -0.0004664390205831851, -0.048580001716075814, -0.36833647499650213, 0.4228379283163507, 0.04416154817504398, -0.11761141824141397, 0.11417301826305308, 0.05405357410594568, -0.3030311568182404, 0.14335987089651683, 0.2854039921283217, 0.2300450250632682, -0.1826222685118348, 0.12506618404216369, -0.16920850037644475, 0.04601251777514058, 0.22029488890479176, -0.14563778454785126, 0.07185879736444202, 0.27581521349375027, 0.2534399314830869, 0.19395597813990345, 0.029536849424495536, -0.08424335959667371, -0.13796665449232115, -0.043957080913044635, -0.155655747058533, -0.12552546185709662, -0.18740426365757692, -0.2508058222168583, 0.36611040037567333, 0.14928303904420995, 0.08132294630947506, 0.2080554555533296, 0.2856600934608003, 0.04747709092463098, -0.009806991696862851, 0.2368657806162107, 0.08658842884114612, 0.10736789791134455, 0.14571114885226144, -0.16485798284727132, 0.049945300145043156, 0.20439558469895588] |
1,802.06565 | A Study of Position Bias in Digital Library Recommender Systems | "Position bias" describes the tendency of users to interact with items on top
of a list with higher probability than with items at a lower position in the
list, regardless of the items' actual relevance. In the domain of recommender
systems, particularly recommender systems in digital libraries, position bias
has received little attention. We conduct a study in a real-world recommender
system that delivered ten million related-article recommendations to the users
of the digital library Sowiport, and the reference manager JabRef.
Recommendations were randomly chosen to be shuffled or non-shuffled, and we
compared click-through rate (CTR) for each rank of the recommendations.
According to our analysis, the CTR for the highest rank in the case of Sowiport
is 53% higher than expected in a hypothetical non-biased situation (0.189% vs.
0.123%). Similarly, in the case of Jabref the highest rank received a CTR of
1.276%, which is 87% higher than expected (0.683%). A chi-squared test confirms
the strong relationship between the rank of the recommendation shown to the
user and whether the user decided to click it (p < 0.01 for both Jabref and
Sowiport). Our study confirms the findings from other domains, that
recommendations in the top positions are more often clicked, regardless of
their actual relevance.
| cs.DL cs.IR | position bias describes the tendency of users to interact with items on top of a list with higher probability than with items at a lower position in the list regardless of the items actual relevance in the domain of recommender systems particularly recommender systems in digital libraries position bias has received little attention we conduct a study in a realworld recommender system that delivered ten million relatedarticle recommendations to the users of the digital library sowiport and the reference manager jabref recommendations were randomly chosen to be shuffled or nonshuffled and we compared clickthrough rate ctr for each rank of the recommendations according to our analysis the ctr for the highest rank in the case of sowiport is 53 higher than expected in a hypothetical nonbiased situation 0189 vs 0123 similarly in the case of jabref the highest rank received a ctr of 1276 which is 87 higher than expected 0683 a chisquared test confirms the strong relationship between the rank of the recommendation shown to the user and whether the user decided to click it p 001 for both jabref and sowiport our study confirms the findings from other domains that recommendations in the top positions are more often clicked regardless of their actual relevance | [['position', 'bias', 'describes', 'the', 'tendency', 'of', 'users', 'to', 'interact', 'with', 'items', 'on', 'top', 'of', 'a', 'list', 'with', 'higher', 'probability', 'than', 'with', 'items', 'at', 'a', 'lower', 'position', 'in', 'the', 'list', 'regardless', 'of', 'the', 'items', 'actual', 'relevance', 'in', 'the', 'domain', 'of', 'recommender', 'systems', 'particularly', 'recommender', 'systems', 'in', 'digital', 'libraries', 'position', 'bias', 'has', 'received', 'little', 'attention', 'we', 'conduct', 'a', 'study', 'in', 'a', 'realworld', 'recommender', 'system', 'that', 'delivered', 'ten', 'million', 'relatedarticle', 'recommendations', 'to', 'the', 'users', 'of', 'the', 'digital', 'library', 'sowiport', 'and', 'the', 'reference', 'manager', 'jabref', 'recommendations', 'were', 'randomly', 'chosen', 'to', 'be', 'shuffled', 'or', 'nonshuffled', 'and', 'we', 'compared', 'clickthrough', 'rate', 'ctr', 'for', 'each', 'rank', 'of', 'the', 'recommendations', 'according', 'to', 'our', 'analysis', 'the', 'ctr', 'for', 'the', 'highest', 'rank', 'in', 'the', 'case', 'of', 'sowiport', 'is', '53', 'higher', 'than', 'expected', 'in', 'a', 'hypothetical', 'nonbiased', 'situation', '0189', 'vs', '0123', 'similarly', 'in', 'the', 'case', 'of', 'jabref', 'the', 'highest', 'rank', 'received', 'a', 'ctr', 'of', '1276', 'which', 'is', '87', 'higher', 'than', 'expected', '0683', 'a', 'chisquared', 'test', 'confirms', 'the', 'strong', 'relationship', 'between', 'the', 'rank', 'of', 'the', 'recommendation', 'shown', 'to', 'the', 'user', 'and', 'whether', 'the', 'user', 'decided', 'to', 'click', 'it', 'p', '001', 'for', 'both', 'jabref', 'and', 'sowiport', 'our', 'study', 'confirms', 'the', 'findings', 'from', 'other', 'domains', 'that', 'recommendations', 'in', 'the', 'top', 'positions', 'are', 'more', 'often', 'clicked', 'regardless', 'of', 'their', 'actual', 'relevance']] | [-0.07062703194550989, 0.014746740566021422, -0.019955227003864397, 0.07025130645928496, -0.10728287734517192, -0.16794389904499418, 0.12620447146501845, 0.3875080657606127, -0.18800646853633224, -0.33995549828268407, 0.06940248825746338, -0.368810930459692, -0.10202536727301777, 0.19529216057938956, -0.08048130394209449, -0.008554635156036878, 0.041070245184208744, 0.1363381089858438, -0.06834376547712742, -0.346275756333205, 0.2717755791918579, 0.1105459436547102, 0.32256040698479543, 0.012588698381739783, 0.03303685857646065, 0.01634149461325894, -0.08008143942428345, -0.013538449817860964, -0.08041590970135919, 0.12013991387651825, 0.2915832479961398, 0.16563111237227554, 0.3288836562120151, -0.3234271546144311, -0.11333122821070435, 0.08395399591976369, 0.1132315828305919, 0.06099770628540527, -0.046233756865570665, -0.2883785603045509, 0.1474771347396621, -0.23079753813856257, -0.04791150926640712, 0.023309169024251765, 0.024629766160122506, 0.03863769875720098, -0.27790079534326384, 0.01838725438886663, 0.012997530681853433, 0.08168308372132299, -0.048968854877052874, -0.16063913774460828, -0.029918855746708266, 0.16768185507119973, 0.06675751391434814, 0.03154608487356, 0.14133043678522836, -0.15297686861509957, -0.12616206853673226, 0.42348122975630004, -0.019909445686967158, -0.1810613396794041, 0.18618973910229325, -0.16888924236750094, -0.10539357628241726, 0.11346484461526682, 0.2272992449261748, 0.08622264377545656, -0.11945216029246405, -0.01956536642321181, -0.0527261463993388, 0.2219128939913722, 0.07093740224883688, -0.014421799657979935, 0.20372919315563107, 0.1734550233294324, 0.04245864907961066, 0.09869124041160388, -0.0434927410122416, -0.06595316841721353, -0.20721579607712423, -0.15483374655723753, -0.1676120196310122, 0.022135301221093934, -0.10879510585758154, -0.11246086013114374, 0.39432106847852105, 0.176905685659816, 0.18640548375139876, 0.046364726951323085, 0.2710102589187644, 0.055781812917032256, 0.06137051595624809, 0.06337867470276429, 0.18232449680686041, 0.023013503528654392, 0.159303934020331, -0.14140686402296102, 0.11938837228638188, 0.0012383565647391284] |
1,802.06566 | Power-of-$d$-Choices with Memory: Fluid Limit and Optimality | In multi-server distributed queueing systems, the access of stochastically
arriving jobs to resources is often regulated by a dispatcher, also known as
load balancer. A fundamental problem consists in designing a load balancing
algorithm that minimizes the delays experienced by jobs. During the last two
decades, the power-of-$d$-choice algorithm, based on the idea of dispatching
each job to the least loaded server out of $d$ servers randomly sampled at the
arrival of the job itself, has emerged as a breakthrough in the foundations of
this area due to its versatility and appealing asymptotic properties. In this
paper, we consider the power-of-$d$-choice algorithm with the addition of a
local memory that keeps track of the latest observations collected over time on
the sampled servers. Then, each job is sent to a server with the lowest
observation. We show that this algorithm is asymptotically optimal in the sense
that the load balancer can always assign each job to an idle server in the
large-system limit. This holds true if and only if the system load $\lambda$ is
less than $1-\frac{1}{d}$. If this condition is not satisfied, we show that
queue lengths are tightly bounded by $\left\lceil - \frac{ \log
(1-\lambda)}{\log (\lambda d +1)} \right\rceil$. This is in contrast with the
classic version of the power-of-$d$-choice algorithm, where at the fluid scale
a strictly positive proportion of servers containing $i$ jobs exists for all
$i\ge 0$, in equilibrium. Our results quantify and highlight the importance of
using memory as a means to enhance performance in randomized load balancing.
| math.PR cs.PF | in multiserver distributed queueing systems the access of stochastically arriving jobs to resources is often regulated by a dispatcher also known as load balancer a fundamental problem consists in designing a load balancing algorithm that minimizes the delays experienced by jobs during the last two decades the powerofdchoice algorithm based on the idea of dispatching each job to the least loaded server out of d servers randomly sampled at the arrival of the job itself has emerged as a breakthrough in the foundations of this area due to its versatility and appealing asymptotic properties in this paper we consider the powerofdchoice algorithm with the addition of a local memory that keeps track of the latest observations collected over time on the sampled servers then each job is sent to a server with the lowest observation we show that this algorithm is asymptotically optimal in the sense that the load balancer can always assign each job to an idle server in the largesystem limit this holds true if and only if the system load lambda is less than 1frac1d if this condition is not satisfied we show that queue lengths are tightly bounded by leftlceil frac log 1lambdalog lambda d 1 rightrceil this is in contrast with the classic version of the powerofdchoice algorithm where at the fluid scale a strictly positive proportion of servers containing i jobs exists for all ige 0 in equilibrium our results quantify and highlight the importance of using memory as a means to enhance performance in randomized load balancing | [['in', 'multiserver', 'distributed', 'queueing', 'systems', 'the', 'access', 'of', 'stochastically', 'arriving', 'jobs', 'to', 'resources', 'is', 'often', 'regulated', 'by', 'a', 'dispatcher', 'also', 'known', 'as', 'load', 'balancer', 'a', 'fundamental', 'problem', 'consists', 'in', 'designing', 'a', 'load', 'balancing', 'algorithm', 'that', 'minimizes', 'the', 'delays', 'experienced', 'by', 'jobs', 'during', 'the', 'last', 'two', 'decades', 'the', 'powerofdchoice', 'algorithm', 'based', 'on', 'the', 'idea', 'of', 'dispatching', 'each', 'job', 'to', 'the', 'least', 'loaded', 'server', 'out', 'of', 'd', 'servers', 'randomly', 'sampled', 'at', 'the', 'arrival', 'of', 'the', 'job', 'itself', 'has', 'emerged', 'as', 'a', 'breakthrough', 'in', 'the', 'foundations', 'of', 'this', 'area', 'due', 'to', 'its', 'versatility', 'and', 'appealing', 'asymptotic', 'properties', 'in', 'this', 'paper', 'we', 'consider', 'the', 'powerofdchoice', 'algorithm', 'with', 'the', 'addition', 'of', 'a', 'local', 'memory', 'that', 'keeps', 'track', 'of', 'the', 'latest', 'observations', 'collected', 'over', 'time', 'on', 'the', 'sampled', 'servers', 'then', 'each', 'job', 'is', 'sent', 'to', 'a', 'server', 'with', 'the', 'lowest', 'observation', 'we', 'show', 'that', 'this', 'algorithm', 'is', 'asymptotically', 'optimal', 'in', 'the', 'sense', 'that', 'the', 'load', 'balancer', 'can', 'always', 'assign', 'each', 'job', 'to', 'an', 'idle', 'server', 'in', 'the', 'largesystem', 'limit', 'this', 'holds', 'true', 'if', 'and', 'only', 'if', 'the', 'system', 'load', 'lambda', 'is', 'less', 'than', '1frac1d', 'if', 'this', 'condition', 'is', 'not', 'satisfied', 'we', 'show', 'that', 'queue', 'lengths', 'are', 'tightly', 'bounded', 'by', 'leftlceil', 'frac', 'log', '1lambdalog', 'lambda', 'd', '1', 'rightrceil', 'this', 'is', 'in', 'contrast', 'with', 'the', 'classic', 'version', 'of', 'the', 'powerofdchoice', 'algorithm', 'where', 'at', 'the', 'fluid', 'scale', 'a', 'strictly', 'positive', 'proportion', 'of', 'servers', 'containing', 'i', 'jobs', 'exists', 'for', 'all', 'ige', '0', 'in', 'equilibrium', 'our', 'results', 'quantify', 'and', 'highlight', 'the', 'importance', 'of', 'using', 'memory', 'as', 'a', 'means', 'to', 'enhance', 'performance', 'in', 'randomized', 'load', 'balancing']] | [-0.1767373615447367, 0.10486776474176117, -0.07029447313361166, 0.001686466196256261, -0.03870213822376663, -0.2097530195060822, 0.12187659028697656, 0.37068116871847046, -0.2817981210537255, -0.29484622262506965, 0.10278326067805571, -0.28006210481186233, -0.08960673228157537, 0.14152385289263394, -0.12248865590548136, 0.03869332525821861, 0.07619928098990515, 0.09398030346983433, 0.02520022282583846, -0.3230140541956413, 0.25304764532484114, 0.06343725880253173, 0.2841009648963957, 0.024101422378970755, 0.09647129803511595, 0.006503724447813713, -0.007972411770236842, -0.0017070284571557763, -0.10068067564102492, 0.062151319993380826, 0.25568301813761957, 0.15979649285584438, 0.35156275187840774, -0.4190497054637129, -0.14107593702520096, 0.14444394634217986, 0.1605239894503491, 0.02364240948938661, -0.0007336710238762732, -0.21566874708699446, 0.14044838642843793, -0.14977689514154688, -0.08371292398263154, 0.018840988451201055, 0.04018890986353942, 0.048559108072714435, -0.2881984688628729, 0.016719599689485408, 0.030857584830964842, -0.004184824734231428, -0.04496935920421189, -0.09193355089842549, 0.013189852763418226, 0.13501470451361486, 0.062114929922187465, 0.04449901915486119, 0.12662701385598335, -0.095737571563823, -0.11825806412537257, 0.4032748228064664, -0.0266730386678001, -0.1733962393907224, 0.1256107083847007, -0.0818134536061229, -0.17342782399242018, 0.10118992260328331, 0.17464512276891914, 0.10001548548277082, -0.1560592763587862, 0.07095493907446138, -0.058362968599087454, 0.18563117232452708, 0.08767739059482073, 0.01092950007434757, 0.13810742408635893, 0.1998525055029267, 0.12944075835513927, 0.14778953878345738, -0.04485996038882092, -0.10979844146363792, -0.264839466552191, -0.16117430657322984, -0.23921481649507306, 0.04687207453938003, -0.08392118773427062, -0.11468769271399766, 0.3464731399398593, 0.13806713334402987, 0.1942380400640624, 0.13474420194850406, 0.33893381356075036, 0.0946119482054316, 0.059748941136243204, 0.20135680024534286, 0.1387696347701999, 0.021006402939545095, 0.1335845219062841, -0.21631876703366518, 0.11816892196195171, 0.025609249358297795] |
1,802.06567 | On superintegrable monopole systems | Superintegrable systems with monopole interactions in flat and curved spaces
have attracted much attention. For example, models in spaces with a Taub-NUT
metric are well-known to admit the Kepler-type symmetries and provide
non-trivial generalizations of the usual Kepler problems. In this paper, we
overview new families of superintegrable Kepler, MIC-harmonic oscillator and
deformed Kepler systems interacting with Yang-Coulomb monopoles in the flat and
curved Taub-NUT spaces. We present their higher-order, algebraically
independent integrals of motion via the direct and constructive approaches
which prove the superintegrability of the models. The integrals form symmetry
polynomial algebras of the systems with structure constants involving Casimir
operators of certain Lie algebras. Such algebraic approaches provide a deeper
understanding to the degeneracies of the energy spectra and connection between
wave functions and differential equations and geometry.
| math-ph math.MP | superintegrable systems with monopole interactions in flat and curved spaces have attracted much attention for example models in spaces with a taubnut metric are wellknown to admit the keplertype symmetries and provide nontrivial generalizations of the usual kepler problems in this paper we overview new families of superintegrable kepler micharmonic oscillator and deformed kepler systems interacting with yangcoulomb monopoles in the flat and curved taubnut spaces we present their higherorder algebraically independent integrals of motion via the direct and constructive approaches which prove the superintegrability of the models the integrals form symmetry polynomial algebras of the systems with structure constants involving casimir operators of certain lie algebras such algebraic approaches provide a deeper understanding to the degeneracies of the energy spectra and connection between wave functions and differential equations and geometry | [['superintegrable', 'systems', 'with', 'monopole', 'interactions', 'in', 'flat', 'and', 'curved', 'spaces', 'have', 'attracted', 'much', 'attention', 'for', 'example', 'models', 'in', 'spaces', 'with', 'a', 'taubnut', 'metric', 'are', 'wellknown', 'to', 'admit', 'the', 'keplertype', 'symmetries', 'and', 'provide', 'nontrivial', 'generalizations', 'of', 'the', 'usual', 'kepler', 'problems', 'in', 'this', 'paper', 'we', 'overview', 'new', 'families', 'of', 'superintegrable', 'kepler', 'micharmonic', 'oscillator', 'and', 'deformed', 'kepler', 'systems', 'interacting', 'with', 'yangcoulomb', 'monopoles', 'in', 'the', 'flat', 'and', 'curved', 'taubnut', 'spaces', 'we', 'present', 'their', 'higherorder', 'algebraically', 'independent', 'integrals', 'of', 'motion', 'via', 'the', 'direct', 'and', 'constructive', 'approaches', 'which', 'prove', 'the', 'superintegrability', 'of', 'the', 'models', 'the', 'integrals', 'form', 'symmetry', 'polynomial', 'algebras', 'of', 'the', 'systems', 'with', 'structure', 'constants', 'involving', 'casimir', 'operators', 'of', 'certain', 'lie', 'algebras', 'such', 'algebraic', 'approaches', 'provide', 'a', 'deeper', 'understanding', 'to', 'the', 'degeneracies', 'of', 'the', 'energy', 'spectra', 'and', 'connection', 'between', 'wave', 'functions', 'and', 'differential', 'equations', 'and', 'geometry']] | [-0.17078933362202106, 0.103076612292469, -0.06168412153994778, 0.12315019409488602, -0.16131680254213057, -0.1397650439988907, -0.05558542584563172, 0.3330878007815767, -0.24375939444560585, -0.2685873998215294, 0.0779710763830777, -0.2986828657222613, -0.20056646105563197, 0.2038787554981514, -0.07500034173637743, 0.05074374090155004, 0.06842980612218665, 0.038081639560511804, -0.15105933548868386, -0.2524104068279693, 0.4048270630323193, -0.015612134244292974, 0.2023735429224281, -0.004658033100902351, 0.11467383947678422, 0.022585145572826038, 0.003395196962177412, -0.012197500535550009, -0.17824717698519238, 0.15789806340707338, 0.2584510057094753, 0.03261779355037849, 0.16445666954866858, -0.39262901346078355, -0.20788653096795537, 0.14429634919688675, 0.18108110059450827, 0.08922421463359972, -0.03145197164871595, -0.34904542036766883, -0.03333726882906133, -0.16891500093433864, -0.1788188918664312, -0.14841071228347436, 0.06311250940491339, 0.04078339460796414, -0.19297346750404046, 0.06488732990048086, 0.1074748276839502, 0.11133145818927588, -0.15029161562254467, -0.09004496226179634, -0.05479061869079716, 0.06920747923529671, 0.029249684897585566, -0.017220998996911385, 0.0478249017250518, -0.09120757945187617, -0.18429702761021394, 0.3872683403786016, -0.0097197666853126, -0.28526292309762186, 0.1581834765321767, -0.1438438908076127, -0.1555137610283346, 0.0855318248975766, 0.16063399692217087, 0.1531931258034217, -0.09440102452414025, 0.18226021324917105, 0.005467577981482658, 0.06099405572998501, 0.07790207012933288, 0.09559922048267518, 0.2259045609607155, 0.08588602269452264, 0.06572518984161545, 0.1447720668911365, 0.03445890096890676, -0.1591895814626904, -0.31181636735892904, -0.15629143743417653, -0.08413837987303961, 0.08425044589744835, -0.11337973679862881, -0.2164011011824353, 0.38375502813586126, 0.0789924091268473, 0.1579451576454693, 0.0656328110872121, 0.22678000907918425, 0.10610271916006699, 0.09285947011662861, 0.039881823840373344, 0.24770079026325742, 0.2224567919571436, 0.10507485894699588, -0.15835347209651848, -0.1261542194673102, 0.15197567822667593] |
1,802.06568 | An Obstruction to Higher-Dimensional Kernel of Dirac Operators | This paper provides a $K$-theoretic obstruction for higher kernel dimension
for Dirac operators. For this we use a fibre-wise Dirac operator that gives
rise to a family of Fredholm operators representing a class in topological
$K$-theory. Then Chern classes of this $K$-class contain some information about
the kernel of the operators.
| math.KT math.DG | this paper provides a ktheoretic obstruction for higher kernel dimension for dirac operators for this we use a fibrewise dirac operator that gives rise to a family of fredholm operators representing a class in topological ktheory then chern classes of this kclass contain some information about the kernel of the operators | [['this', 'paper', 'provides', 'a', 'ktheoretic', 'obstruction', 'for', 'higher', 'kernel', 'dimension', 'for', 'dirac', 'operators', 'for', 'this', 'we', 'use', 'a', 'fibrewise', 'dirac', 'operator', 'that', 'gives', 'rise', 'to', 'a', 'family', 'of', 'fredholm', 'operators', 'representing', 'a', 'class', 'in', 'topological', 'ktheory', 'then', 'chern', 'classes', 'of', 'this', 'kclass', 'contain', 'some', 'information', 'about', 'the', 'kernel', 'of', 'the', 'operators']] | [-0.16945849315208547, 0.08053622639500628, -0.08406187337994411, 0.1427602723592381, -0.14751391230132796, -0.14697172741095224, 0.01744132501064051, 0.2912307013483608, -0.27107479456154737, -0.19380427338182926, 0.07337084814550027, -0.2993263823776871, -0.22350793130988, 0.1819396877807437, -0.1292276129710908, 0.026835413184016943, 0.03345630526104394, 0.07306603042810571, -0.17568226795935749, -0.20961673937591851, 0.5151301340437403, -0.05137357196094943, 0.1676716688910828, 0.10627203697667402, 0.1102664758674983, -0.02783110067613569, 0.016217532823337058, -0.04166572811721148, -0.10200982356935342, 0.2075771025436766, 0.3328915171909566, 0.025061913332262754, 0.23327727102692805, -0.3429538622936782, -0.1682821810975963, 0.1907981183087709, 0.10403178146510732, 0.06885518396601957, -0.021595627617310074, -0.2983571882268377, 0.09943899715903635, -0.21350417965475252, -0.16332878227181294, -0.14583928691332831, 0.015227130295790951, -0.0880953410969061, -0.2790636924990252, 0.015611612247120515, 0.12355443835258484, 0.09780874495924104, -0.09806377552084479, -0.07130641050125454, -0.030605508489351646, 0.07784390234726243, -0.037755163852125406, -0.01325773242541461, 0.022851502988487482, -0.1078572458468889, -0.13060430650982788, 0.3293776034900243, -0.06379423410558671, -0.2575002876566906, 0.0914669306948781, -0.11316299217515717, -0.181198132388732, 0.13031819919306858, 0.097684442211746, 0.16319973788717212, -0.08574555190645304, 0.16296773391100122, -0.11582597699381557, 0.06167706507075505, 0.06503179952429206, 0.12270874006892829, 0.13557962836770743, 0.07865492204277247, 0.19253697768584185, 0.1635275816033576, 0.012661751195350113, -0.034950439281779905, -0.359980663978586, -0.306899347360812, -0.1512773019973846, 0.17471232482542595, -0.10712120813938479, -0.26461956637235834, 0.5335741459446794, 0.1559002664232371, 0.23002191723379142, 0.12543415269065722, 0.18101209423997822, 0.15845708568196962, 0.09528390907079858, 0.040905511467808894, 0.09138675665256896, 0.18590362936112226, 0.12064878651689664, -0.10916602292883337, -0.052793488901692866, 0.27514157419129476] |
1,802.06569 | Non-Hermiticity and conservation of orthogonal relation in dielectric
microcavity | Non-Hermitian properties of open quantum systems and their applications have
attracted much attention in recent years. While most of the studies focus on
the characteristic nature of non-Hermitian systems, here we focus on the
following issue: A non-Hermitian system can be a subsystem of a Hermitian
system as one can clearly see in Feshbach projective operator (FPO) formalism.
In this case, the orthogonality of the eigenvectors of the total (Hermitian)
system must be sustained, despite the eigenvectors of the subsystem
(non-Hermitian) satisfy the bi-orthogonal condition. Therefore, one can predict
that there must exist some remarkable processes that relate the non-Hermitian
subsystem and the rest part, and ultimately preserve the Hermiticity of the
total system. In this paper, we study such processes in open elliptical
microcavities. The inner part of the cavity is a non-Hermitian system, and the
outer part is the coupled bath in FPO formalism. We investigate the correlation
between the inner- and the outer-part behaviors associated with the avoided
resonance crossings (ARCs), and analyze the results in terms of a trade-off
between the relative difference of self-energies and collective Lamb shifts.
These results come from the conservation of the orthogonality in the total
Hermitian quantum system.
| quant-ph physics.optics | nonhermitian properties of open quantum systems and their applications have attracted much attention in recent years while most of the studies focus on the characteristic nature of nonhermitian systems here we focus on the following issue a nonhermitian system can be a subsystem of a hermitian system as one can clearly see in feshbach projective operator fpo formalism in this case the orthogonality of the eigenvectors of the total hermitian system must be sustained despite the eigenvectors of the subsystem nonhermitian satisfy the biorthogonal condition therefore one can predict that there must exist some remarkable processes that relate the nonhermitian subsystem and the rest part and ultimately preserve the hermiticity of the total system in this paper we study such processes in open elliptical microcavities the inner part of the cavity is a nonhermitian system and the outer part is the coupled bath in fpo formalism we investigate the correlation between the inner and the outerpart behaviors associated with the avoided resonance crossings arcs and analyze the results in terms of a tradeoff between the relative difference of selfenergies and collective lamb shifts these results come from the conservation of the orthogonality in the total hermitian quantum system | [['nonhermitian', 'properties', 'of', 'open', 'quantum', 'systems', 'and', 'their', 'applications', 'have', 'attracted', 'much', 'attention', 'in', 'recent', 'years', 'while', 'most', 'of', 'the', 'studies', 'focus', 'on', 'the', 'characteristic', 'nature', 'of', 'nonhermitian', 'systems', 'here', 'we', 'focus', 'on', 'the', 'following', 'issue', 'a', 'nonhermitian', 'system', 'can', 'be', 'a', 'subsystem', 'of', 'a', 'hermitian', 'system', 'as', 'one', 'can', 'clearly', 'see', 'in', 'feshbach', 'projective', 'operator', 'fpo', 'formalism', 'in', 'this', 'case', 'the', 'orthogonality', 'of', 'the', 'eigenvectors', 'of', 'the', 'total', 'hermitian', 'system', 'must', 'be', 'sustained', 'despite', 'the', 'eigenvectors', 'of', 'the', 'subsystem', 'nonhermitian', 'satisfy', 'the', 'biorthogonal', 'condition', 'therefore', 'one', 'can', 'predict', 'that', 'there', 'must', 'exist', 'some', 'remarkable', 'processes', 'that', 'relate', 'the', 'nonhermitian', 'subsystem', 'and', 'the', 'rest', 'part', 'and', 'ultimately', 'preserve', 'the', 'hermiticity', 'of', 'the', 'total', 'system', 'in', 'this', 'paper', 'we', 'study', 'such', 'processes', 'in', 'open', 'elliptical', 'microcavities', 'the', 'inner', 'part', 'of', 'the', 'cavity', 'is', 'a', 'nonhermitian', 'system', 'and', 'the', 'outer', 'part', 'is', 'the', 'coupled', 'bath', 'in', 'fpo', 'formalism', 'we', 'investigate', 'the', 'correlation', 'between', 'the', 'inner', 'and', 'the', 'outerpart', 'behaviors', 'associated', 'with', 'the', 'avoided', 'resonance', 'crossings', 'arcs', 'and', 'analyze', 'the', 'results', 'in', 'terms', 'of', 'a', 'tradeoff', 'between', 'the', 'relative', 'difference', 'of', 'selfenergies', 'and', 'collective', 'lamb', 'shifts', 'these', 'results', 'come', 'from', 'the', 'conservation', 'of', 'the', 'orthogonality', 'in', 'the', 'total', 'hermitian', 'quantum', 'system']] | [-0.18654173038279018, 0.12071609722375116, -0.06398620241500362, 0.04702217436649583, -0.01931987481775007, -0.12370919032599142, 0.012536053699817546, 0.3415010310098002, -0.25771184658662255, -0.2530134668376184, 0.08095575928114204, -0.3012814340934233, -0.1857465044571783, 0.15870896643944876, -0.05224330562420867, 0.07060896078091716, 0.09911655536688149, 0.04281352819037633, -0.11541227760226136, -0.1851857924913856, 0.3686296351564427, 0.03328100982418453, 0.21748286895359856, 0.0663658172148515, 0.049505026533616464, 0.004798844616596747, 0.03092002732246512, -0.04310390729024404, -0.08164692412148468, 0.11115106543046281, 0.2329376583396824, 0.09127693883886542, 0.2709190160591118, -0.42416486154413885, -0.1811885684305294, 0.12718163117427717, 0.15818732824338827, 0.09140819213658835, -0.0008231911048612962, -0.2844476489846435, 0.016547495137072273, -0.17176115866165462, -0.1558256703311333, -0.042723913390702105, 0.024955846184648273, -0.010736002608242378, -0.18883236990583063, 0.05813996319781349, 0.10174754366057136, 0.06540826979949317, -0.046111445715227586, -0.0795681616676515, -0.02281207487697365, 0.11662610670118922, 0.012668340130017676, -0.036727962734394076, 0.11982152127717255, -0.08291748332593477, -0.09207260568662679, 0.3998672092483953, -0.027926480898520713, -0.19895513046231836, 0.1773345306365177, -0.16528258898714088, -0.1109718400373528, 0.09061807974458042, 0.17990355578020703, 0.08273572039218959, -0.14595943434878883, 0.13020550998102995, -0.057418128513176035, 0.1421030764432737, 0.040567072886841915, 0.11069198135248941, 0.21445171174950747, 0.0845532437381946, 0.056456816501473314, 0.14870238118226442, -0.012121459864599705, -0.15513680911754643, -0.2856920932706521, -0.16878889236694603, -0.2094381928709665, 0.04936567002218311, -0.04688808020867814, -0.1419702465457823, 0.4446129689388203, 0.14121205729169, 0.2170146052593911, -0.018763715366014476, 0.23651230233166404, 0.17224239596022256, 0.08583945588025292, 0.05222117713172779, 0.2796749032843056, 0.18215589326442716, 0.10195923987964187, -0.2927199831815093, 0.011263258637027871, 0.03328702816353979] |
1,802.0657 | On the Stable Ergodicity of Berger-Carrasco's example | We prove the stable ergodicity of an example of a volume-preserving,
partially hyperbolic diffeomorphism introduced by Pierre Berger and Pablo
Carrasco. This example is robustly non-uniformly hyperbolic, with two
dimensional center, almost every point has both positive and negative Lyapunov
exponents along the center direction and does not admit a dominated splitting
of the center direction. The main novelty of our proof is that we do not use
accessibility.
| math.DS | we prove the stable ergodicity of an example of a volumepreserving partially hyperbolic diffeomorphism introduced by pierre berger and pablo carrasco this example is robustly nonuniformly hyperbolic with two dimensional center almost every point has both positive and negative lyapunov exponents along the center direction and does not admit a dominated splitting of the center direction the main novelty of our proof is that we do not use accessibility | [['we', 'prove', 'the', 'stable', 'ergodicity', 'of', 'an', 'example', 'of', 'a', 'volumepreserving', 'partially', 'hyperbolic', 'diffeomorphism', 'introduced', 'by', 'pierre', 'berger', 'and', 'pablo', 'carrasco', 'this', 'example', 'is', 'robustly', 'nonuniformly', 'hyperbolic', 'with', 'two', 'dimensional', 'center', 'almost', 'every', 'point', 'has', 'both', 'positive', 'and', 'negative', 'lyapunov', 'exponents', 'along', 'the', 'center', 'direction', 'and', 'does', 'not', 'admit', 'a', 'dominated', 'splitting', 'of', 'the', 'center', 'direction', 'the', 'main', 'novelty', 'of', 'our', 'proof', 'is', 'that', 'we', 'do', 'not', 'use', 'accessibility']] | [-0.16480194194161374, 0.1378455608359798, -0.08314655814319849, 0.045322737651472184, -0.1009669374924261, -0.14605866446821153, -0.018646307262605515, 0.37215503123825067, -0.2766502671942547, -0.1680624281744594, 0.11821329781272705, -0.2830466702040555, -0.16969678442979205, 0.19894118319717707, -0.13235041221090849, 0.014477024867158869, 0.044353363927507744, 0.013238552350388922, -0.026694446650293212, -0.2131800801658571, 0.3600718465404234, 0.015841199061495885, 0.2671051737987369, 0.10450779149929683, 0.16974938779637433, 0.03903452340729427, -0.01638052750216878, 0.056849811874006104, -0.12295590208742542, 0.10889730112208729, 0.22254163389890522, 0.07533093005675229, 0.2759275882018973, -0.2910105413803662, -0.18537539751201437, 0.16921479831301217, 0.14709517263226968, 0.08321300425661216, -0.11393312181589073, -0.30235227545642335, 0.13656818874828194, -0.11460227951866345, -0.23050436029966542, -0.0448220416876501, -0.01803727974386319, 0.013649397813107656, -0.17433608935444037, 0.05509979300119955, 0.18765626912531647, 0.08771398894326843, -0.1007117812278802, -0.056163676501508206, -0.08942575736200788, 0.1277829279711443, 0.04040372481002756, 0.037728026068931365, 0.10793517129681329, 0.035938013670944936, -0.14209841313920374, 0.33800165892403194, -0.06494833416629421, -0.2425486620893513, 0.21208878285319044, -0.1667142183303941, -0.1860110752986393, 0.1348969240848353, 0.08693791281404918, 0.12152436594276325, -0.07687423934998072, 0.17495027690386886, -0.09357506004364594, 0.14650464764048776, 0.10746738247141457, -0.10639699709777167, 0.1453961018520151, 0.03947089884794601, 0.21230869696043647, 0.0911431717855073, -0.039953738612973175, -0.10639883824151711, -0.3120501769733602, -0.1851896056095543, -0.17160939684380655, 0.13320024445884104, -0.06833388974178967, -0.1809682661694461, 0.3747885316826295, 0.059624157139889736, 0.1917767006148031, 0.08601684498506179, 0.24681670787285312, 0.07493339577838239, 0.03763087074258837, 0.15016905141427464, 0.21551310214335503, 0.13729001742963126, 0.06337462018068502, -0.16885439104711017, 0.02514482554777161, 0.17232814270012212] |
1,802.06571 | Implementing distributed {\lambda}-calculus interpreter | This paper describes how one can implement distributed {\lambda}-calculus
interpreter from scratch. At first, we describe how to implement a monadic
parser, than the Krivine Machine is introduced for the interpretation part and
as for distribution, the actor model is used. In this work we are not providing
general solution for parallelism, but we consider particular patterns, which
always can be parallelized. As a result, the basic extensible implementation of
call-by-name distributed machine is introduced and prototype is presented. We
achieved computation speed improvement in some cases, but efficient distributed
version is not achieved, problems are discussed in evaluation section. This
work provides a foundation for further research, completing the implementation
it is possible to add concurrency for non-determinism, improve the interpreter
using call-by-need semantic or study optimal auto parallelization to generalize
what could be done efficiently in parallel.
| cs.PL | this paper describes how one can implement distributed lambdacalculus interpreter from scratch at first we describe how to implement a monadic parser than the krivine machine is introduced for the interpretation part and as for distribution the actor model is used in this work we are not providing general solution for parallelism but we consider particular patterns which always can be parallelized as a result the basic extensible implementation of callbyname distributed machine is introduced and prototype is presented we achieved computation speed improvement in some cases but efficient distributed version is not achieved problems are discussed in evaluation section this work provides a foundation for further research completing the implementation it is possible to add concurrency for nondeterminism improve the interpreter using callbyneed semantic or study optimal auto parallelization to generalize what could be done efficiently in parallel | [['this', 'paper', 'describes', 'how', 'one', 'can', 'implement', 'distributed', 'lambdacalculus', 'interpreter', 'from', 'scratch', 'at', 'first', 'we', 'describe', 'how', 'to', 'implement', 'a', 'monadic', 'parser', 'than', 'the', 'krivine', 'machine', 'is', 'introduced', 'for', 'the', 'interpretation', 'part', 'and', 'as', 'for', 'distribution', 'the', 'actor', 'model', 'is', 'used', 'in', 'this', 'work', 'we', 'are', 'not', 'providing', 'general', 'solution', 'for', 'parallelism', 'but', 'we', 'consider', 'particular', 'patterns', 'which', 'always', 'can', 'be', 'parallelized', 'as', 'a', 'result', 'the', 'basic', 'extensible', 'implementation', 'of', 'callbyname', 'distributed', 'machine', 'is', 'introduced', 'and', 'prototype', 'is', 'presented', 'we', 'achieved', 'computation', 'speed', 'improvement', 'in', 'some', 'cases', 'but', 'efficient', 'distributed', 'version', 'is', 'not', 'achieved', 'problems', 'are', 'discussed', 'in', 'evaluation', 'section', 'this', 'work', 'provides', 'a', 'foundation', 'for', 'further', 'research', 'completing', 'the', 'implementation', 'it', 'is', 'possible', 'to', 'add', 'concurrency', 'for', 'nondeterminism', 'improve', 'the', 'interpreter', 'using', 'callbyneed', 'semantic', 'or', 'study', 'optimal', 'auto', 'parallelization', 'to', 'generalize', 'what', 'could', 'be', 'done', 'efficiently', 'in', 'parallel']] | [-0.08402390733508648, 0.02828712947666645, -0.08191877287618227, 0.09321217980527272, -0.16430560236783337, -0.20936050184620478, 0.024223722980639115, 0.42036332592046516, -0.31078655279757417, -0.31310972615929067, 0.08826013591823925, -0.18622337359425833, -0.13852805284642541, 0.2211276984726675, -0.13887171114593067, 0.06505400870370565, 0.09067140969451142, -0.0007026009931624365, -0.03393220160995684, -0.2858452541107084, 0.25226130716003503, 0.07807349019496293, 0.2580160801700926, 0.0597780555563731, 0.08426395099963524, 0.010175559116969648, -0.030517931886874943, 0.016487671088405008, -0.08153481775452551, 0.1570536417102696, 0.34616325079235616, 0.22992896435366902, 0.2768884121847386, -0.41970051565080235, -0.141344919619854, 0.0624900298601807, 0.1705219666038057, 0.1428087074609001, -0.017599137445489656, -0.24403707766838426, 0.12593434051871835, -0.2214840544628904, -0.09525275923539515, -0.1608266342605511, -0.011185867665000527, -0.041767475978310535, -0.24162913497751778, -0.014095877123018392, 0.11918895272873074, 0.06980042225553942, -0.0016562437384034232, -0.07075862284572192, 0.0758990298273216, 0.10117720921939279, -0.025857506370969223, 0.07818876692469118, 0.12868009641994355, -0.05849721386740587, -0.17100010515465366, 0.40133383561917346, -0.05116531094287023, -0.24647212183947187, 0.14535465468016032, 0.00782290422324118, -0.18796953811852946, 0.02741478372318335, 0.1960491343341071, 0.1112087165162959, -0.1759969195495058, 0.10529688952688342, -0.013810085186319385, 0.19161789225776205, 0.07649247802077062, -0.006435185866413651, 0.1341102733008778, 0.24681202371323333, 0.048813047251838305, 0.1979190599027893, 0.026232295214004223, -0.12383678391711492, -0.30226999290769907, -0.20218873734204032, -0.12691807421761825, -0.02749708091162594, 0.002176055202483394, -0.12956920837005265, 0.36066209494384177, 0.23353215848202918, 0.11991289935054646, 0.13139433884849142, 0.34698514053062035, 0.09387716105402105, 0.09781329275825791, 0.13697645328302446, 0.18107261259226873, 0.05718633070045399, 0.17377563762954243, -0.13402141148740385, 0.12093263851451895, 0.08028126734421126] |
1,802.06572 | Measurements of differential cross sections of top quark pair production
in association with jets in ${pp}$ collisions at $\sqrt{s}=13$ TeV using the
ATLAS detector | Measurements of differential cross sections of top quark pair production in
association with jets by the ATLAS experiment at the LHC are presented. The
measurements are performed as functions of the top quark transverse momentum,
the transverse momentum of the top quark-antitop quark system and the
out-of-plane transverse momentum using data from $pp$ collisions at
$\sqrt{s}=13$ TeV collected by the ATLAS detector at the LHC in 2015 and
corresponding to an integrated luminosity of 3.2 fb$^{-1}$. The top quark pair
events are selected in the lepton (electron or muon) + jets channel. The
measured cross sections, which are compared to several predictions, allow a
detailed study of top quark production.
| hep-ex | measurements of differential cross sections of top quark pair production in association with jets by the atlas experiment at the lhc are presented the measurements are performed as functions of the top quark transverse momentum the transverse momentum of the top quarkantitop quark system and the outofplane transverse momentum using data from pp collisions at sqrts13 tev collected by the atlas detector at the lhc in 2015 and corresponding to an integrated luminosity of 32 fb1 the top quark pair events are selected in the lepton electron or muon jets channel the measured cross sections which are compared to several predictions allow a detailed study of top quark production | [['measurements', 'of', 'differential', 'cross', 'sections', 'of', 'top', 'quark', 'pair', 'production', 'in', 'association', 'with', 'jets', 'by', 'the', 'atlas', 'experiment', 'at', 'the', 'lhc', 'are', 'presented', 'the', 'measurements', 'are', 'performed', 'as', 'functions', 'of', 'the', 'top', 'quark', 'transverse', 'momentum', 'the', 'transverse', 'momentum', 'of', 'the', 'top', 'quarkantitop', 'quark', 'system', 'and', 'the', 'outofplane', 'transverse', 'momentum', 'using', 'data', 'from', 'pp', 'collisions', 'at', 'sqrts13', 'tev', 'collected', 'by', 'the', 'atlas', 'detector', 'at', 'the', 'lhc', 'in', '2015', 'and', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '32', 'fb1', 'the', 'top', 'quark', 'pair', 'events', 'are', 'selected', 'in', 'the', 'lepton', 'electron', 'or', 'muon', 'jets', 'channel', 'the', 'measured', 'cross', 'sections', 'which', 'are', 'compared', 'to', 'several', 'predictions', 'allow', 'a', 'detailed', 'study', 'of', 'top', 'quark', 'production']] | [-0.042523959457563855, 0.23317469039479707, -0.08048053127627268, 0.14240606879401538, -0.015203997729932544, -0.09015000817210723, -0.017081568741963968, 0.33852764211069036, -0.16286746764348614, -0.34282741680120427, -0.03385426029800093, -0.42670202979611027, 0.1725601577825189, 0.16638161613243735, 0.14122212257374217, 0.17508160103871315, 0.1918935040238365, -0.019776144211559935, -0.04492429783567786, -0.23878755762793677, 0.3093736886145995, 0.09483219155420859, 0.24583062714966084, 0.1374815906855036, 0.10384578012141261, 0.0632631074900187, -0.13022077380123342, -0.08247895299077586, -0.0642479566331194, 0.0555792971090004, 0.2514082742138136, -0.004253894452833467, 0.05802525309236781, -0.36450526073437045, 0.006860385211270854, 0.07758056412933877, 0.09675790494980498, 0.042510682681394324, -0.063504459082011, -0.3080121358615105, 0.149920713259942, -0.26806557144003884, -0.09271324795877768, 0.011937786480066952, -0.012545115443774395, -0.02143374662544509, -0.3202887008104611, 0.0973118437686935, -0.09204595184160604, 0.10516930606509386, 0.025344107416458428, -0.2178518330727928, -0.1980463421765577, -0.030681066010233567, 0.09516151037920888, 0.09301277619562354, 0.24208154404294435, -0.1825641838465041, -0.2733349731554174, 0.2921438648244711, -0.03144563607768052, -0.1872214222913263, 0.18974794057269012, -0.25534471302914125, -0.05658329217004831, 0.16194329550489783, 0.3478445360540516, 0.07169737191267174, -0.27678715523453085, 0.06968741938881404, -0.010945737249804315, 0.14324702781676832, 0.09168345340596581, 0.04826600670154827, 0.21809390418800628, 0.2429793581045319, -0.04251820889853493, 0.06185685000619506, -0.19855036584798386, -0.06218492845073342, -0.49232112164436664, -0.10506995414228489, -0.0634486341452295, 0.019984583275530626, -0.0188060615778172, -0.021135960132125074, 0.39560480208860505, 0.04603660561109858, 0.37555266739110704, -0.06358719252252572, 0.3188950391033561, 0.09791830568078526, 0.0978399168428344, 0.09386311596500929, 0.3469322805327398, 0.1780261539000397, 0.24969100366622485, -0.21192105104758716, 0.01709836705898245, 0.06935761661130797] |
1,802.06573 | Deep Residual Network for Joint Demosaicing and Super-Resolution | In digital photography, two image restoration tasks have been studied
extensively and resolved independently: demosaicing and super-resolution. Both
these tasks are related to resolution limitations of the camera. Performing
super-resolution on a demosaiced images simply exacerbates the artifacts
introduced by demosaicing. In this paper, we show that such accumulation of
errors can be easily averted by jointly performing demosaicing and
super-resolution. To this end, we propose a deep residual network for learning
an end-to-end mapping between Bayer images and high-resolution images. By
training on high-quality samples, our deep residual demosaicing and
super-resolution network is able to recover high-quality super-resolved images
from low-resolution Bayer mosaics in a single step without producing the
artifacts common to such processing when the two operations are done
separately. We perform extensive experiments to show that our deep residual
network achieves demosaiced and super-resolved images that are superior to the
state-of-the-art both qualitatively and in terms of PSNR and SSIM metrics.
| cs.CV | in digital photography two image restoration tasks have been studied extensively and resolved independently demosaicing and superresolution both these tasks are related to resolution limitations of the camera performing superresolution on a demosaiced images simply exacerbates the artifacts introduced by demosaicing in this paper we show that such accumulation of errors can be easily averted by jointly performing demosaicing and superresolution to this end we propose a deep residual network for learning an endtoend mapping between bayer images and highresolution images by training on highquality samples our deep residual demosaicing and superresolution network is able to recover highquality superresolved images from lowresolution bayer mosaics in a single step without producing the artifacts common to such processing when the two operations are done separately we perform extensive experiments to show that our deep residual network achieves demosaiced and superresolved images that are superior to the stateoftheart both qualitatively and in terms of psnr and ssim metrics | [['in', 'digital', 'photography', 'two', 'image', 'restoration', 'tasks', 'have', 'been', 'studied', 'extensively', 'and', 'resolved', 'independently', 'demosaicing', 'and', 'superresolution', 'both', 'these', 'tasks', 'are', 'related', 'to', 'resolution', 'limitations', 'of', 'the', 'camera', 'performing', 'superresolution', 'on', 'a', 'demosaiced', 'images', 'simply', 'exacerbates', 'the', 'artifacts', 'introduced', 'by', 'demosaicing', 'in', 'this', 'paper', 'we', 'show', 'that', 'such', 'accumulation', 'of', 'errors', 'can', 'be', 'easily', 'averted', 'by', 'jointly', 'performing', 'demosaicing', 'and', 'superresolution', 'to', 'this', 'end', 'we', 'propose', 'a', 'deep', 'residual', 'network', 'for', 'learning', 'an', 'endtoend', 'mapping', 'between', 'bayer', 'images', 'and', 'highresolution', 'images', 'by', 'training', 'on', 'highquality', 'samples', 'our', 'deep', 'residual', 'demosaicing', 'and', 'superresolution', 'network', 'is', 'able', 'to', 'recover', 'highquality', 'superresolved', 'images', 'from', 'lowresolution', 'bayer', 'mosaics', 'in', 'a', 'single', 'step', 'without', 'producing', 'the', 'artifacts', 'common', 'to', 'such', 'processing', 'when', 'the', 'two', 'operations', 'are', 'done', 'separately', 'we', 'perform', 'extensive', 'experiments', 'to', 'show', 'that', 'our', 'deep', 'residual', 'network', 'achieves', 'demosaiced', 'and', 'superresolved', 'images', 'that', 'are', 'superior', 'to', 'the', 'stateoftheart', 'both', 'qualitatively', 'and', 'in', 'terms', 'of', 'psnr', 'and', 'ssim', 'metrics']] | [-0.017842691915194973, -0.04007933956783591, -0.08098840405494949, 0.045300609477053035, -0.04298478940781814, -0.15381397660882548, -0.006010735357253283, 0.5359308895186271, -0.28977213266383234, -0.3512924338125599, 0.122271120846515, -0.28453999537414587, -0.2205388132114499, 0.1820005594430875, -0.21273162648130475, 0.11459964880829349, 0.1398130261919041, -0.0490164475026997, -0.10322785688095476, -0.3001788633531629, 0.25719008512119307, 0.04030907307572669, 0.3583681348047761, -0.008796378994494482, 0.1567287659637776, -0.014218998053324184, -0.05546900971482197, 0.034033974447725886, -0.02425941375605998, 0.14739886798524585, 0.30574803511472115, 0.17806984553436195, 0.2505635049078443, -0.4487188397693673, -0.27541134861949224, 0.061167091569479776, 0.1819829353545275, 0.1038541115905627, -0.07530634149793365, -0.3678892255438114, 0.11399474677331502, -0.0666018573641838, 0.07245399705225639, -0.16277372914524688, -0.07066686896932939, -0.01683245030737001, -0.30426256806023566, 0.06643088867285234, 0.03792133958389362, 0.07722428407873107, -0.03185040504653372, -0.08944491690231694, 0.03965927067888426, 0.20893246922858844, -0.0223069725378593, 0.08598745191542834, 0.10181622938526903, -0.2285108567665185, -0.10833218631645043, 0.34203739382716175, -0.07425507375045247, -0.1815358382844506, 0.1807516091837992, -0.055570758052864204, -0.13133684634017984, 0.13396115494310684, 0.1655315017560497, 0.11975391989184264, -0.1689915142157701, -0.02169258337699218, -0.027873877082872235, 0.182479636109848, 0.11025199567552145, 0.011585435510485196, 0.15289523731917143, 0.20341825975086905, -0.00031997970597562835, 0.16781771570228016, -0.227288262355537, 0.03893009782616609, -0.1747301635362841, -0.0970117583447836, -0.2191266954931266, -0.023784450212724847, -0.06696922795198784, -0.08336378506756102, 0.4007234010370631, 0.23391667145054812, 0.24469628588911269, 0.08332416308082007, 0.4195701723227436, 0.011843048908072067, 0.1562315650266029, 0.01095381362844575, 0.19627274312931142, 0.01781448765560449, 0.12485483993990712, -0.175816868195992, -0.012533756785606052, 0.0321022947706903] |
1,802.06574 | The Discretized Adiabatic Theorem | A discretized version of the adiabatic theorem is described with the help of
a rule relating a Hermitian operator to its expectation value and variance. The
simple initial operator X with known ground state is transformed in a series of
N small steps into a more complicated final operator Z with unknown ground
state. Each operator along the discretised path in the space of Hermitian
matrices is used to measure the state, initially the ground state of X.
Measurements similar to the Zeno effect or Renninger's negative measurements
modify the state incrementally. This process eventually leads to an eigenstate
combination of Z. In the limit of vanishing step size the state stays with
overwhelming probability in the ground state of each of the N observables.
| quant-ph | a discretized version of the adiabatic theorem is described with the help of a rule relating a hermitian operator to its expectation value and variance the simple initial operator x with known ground state is transformed in a series of n small steps into a more complicated final operator z with unknown ground state each operator along the discretised path in the space of hermitian matrices is used to measure the state initially the ground state of x measurements similar to the zeno effect or renningers negative measurements modify the state incrementally this process eventually leads to an eigenstate combination of z in the limit of vanishing step size the state stays with overwhelming probability in the ground state of each of the n observables | [['a', 'discretized', 'version', 'of', 'the', 'adiabatic', 'theorem', 'is', 'described', 'with', 'the', 'help', 'of', 'a', 'rule', 'relating', 'a', 'hermitian', 'operator', 'to', 'its', 'expectation', 'value', 'and', 'variance', 'the', 'simple', 'initial', 'operator', 'x', 'with', 'known', 'ground', 'state', 'is', 'transformed', 'in', 'a', 'series', 'of', 'n', 'small', 'steps', 'into', 'a', 'more', 'complicated', 'final', 'operator', 'z', 'with', 'unknown', 'ground', 'state', 'each', 'operator', 'along', 'the', 'discretised', 'path', 'in', 'the', 'space', 'of', 'hermitian', 'matrices', 'is', 'used', 'to', 'measure', 'the', 'state', 'initially', 'the', 'ground', 'state', 'of', 'x', 'measurements', 'similar', 'to', 'the', 'zeno', 'effect', 'or', 'renningers', 'negative', 'measurements', 'modify', 'the', 'state', 'incrementally', 'this', 'process', 'eventually', 'leads', 'to', 'an', 'eigenstate', 'combination', 'of', 'z', 'in', 'the', 'limit', 'of', 'vanishing', 'step', 'size', 'the', 'state', 'stays', 'with', 'overwhelming', 'probability', 'in', 'the', 'ground', 'state', 'of', 'each', 'of', 'the', 'n', 'observables']] | [-0.13002265181585831, 0.17838739763465128, -0.10050244414578041, 0.037708536530786776, -0.02364826445738154, -0.1392875307224571, 0.09149311661237716, 0.323853618014724, -0.28382645609822393, -0.23617066060391917, 0.1023075801072522, -0.28943295962357474, -0.03156224662539429, 0.0988746830694107, -0.019890572342480862, 0.08535396372251618, 0.10384031509109322, 0.11280089832801041, -0.10423810466853602, -0.21654587448574603, 0.3503436220043729, 0.04522109213623128, 0.2424845376160867, -0.03402775877921452, 0.1355734030761185, 0.029404897047507185, 0.030436724214063536, -0.0145006055698163, -0.062450509756144454, 0.07258587120281111, 0.21392530042888416, 0.10196588483578976, 0.2667191367363557, -0.40294162984637005, -0.13917122946511354, 0.15975499144218291, 0.11390406171032678, 0.11035889511807792, 0.026053452721938694, -0.3350356652855783, 0.034906757116738345, -0.1484702118398291, -0.20226330546692253, -0.045059715788210594, 0.022432288979255265, -0.04516201598509666, -0.2837200675163448, 0.07557718875637699, 0.05671753151334762, -0.022507299225957643, -0.07991234153873407, -0.14833628007721517, -0.046835419937833064, 0.1290565089326382, 0.0170441212434408, 0.08706092432229555, 0.10252680821764854, -0.12496461355570523, -0.09318955553575389, 0.326808438026121, -0.09650202695610782, -0.22009834216817492, 0.10668898397125304, -0.16423754071846844, -0.08728768693793926, 0.14437064783827913, 0.11350323080043909, 0.1295138739289776, -0.0929922760678305, 0.1104617653966289, -0.0303449253326342, 0.1766510337756406, -0.017215742106218974, 0.03938049689919177, 0.14285397860992582, 0.12340758456247708, 0.12018989429118172, 0.15411505892482255, -0.039006795212175815, -0.13561010306640978, -0.31913666045218103, -0.19275301009897264, -0.22888938343385234, 0.12017085560740182, -0.08596654388020397, -0.1994804700821518, 0.39341535982150105, 0.1099665250531548, 0.27731303260811874, 0.031065089571770402, 0.2705148782866496, 0.17824047156271614, 0.01760966923827636, 0.0508407533296474, 0.17694605882429787, 0.17146508118528273, 0.08971888922725714, -0.22682292967839468, 0.09335148643567076, 0.09261949707363401] |
1,802.06575 | On the Decidability of Reachability in Linear Time-Invariant Systems | We consider the decidability of state-to-state reachability in linear
time-invariant control systems over discrete time. We analyse this problem with
respect to the allowable control sets, which in general are assumed to be
defined by boolean combinations of linear inequalities. Decidability of the
version of the reachability problem in which control sets are affine subspaces
of $\mathbb{R}^n$ is a fundamental result in control theory. Our first result
is that reachability is undecidable if the set of controls is a finite union of
affine subspaces. We also consider versions of the reachability problem in
which (i)~the set of controls consists of a single affine subspace together
with the origin and (ii)~the set of controls is a convex polytope. In these two
cases we respectively show that the reachability problem is as hard as Skolem's
Problem and the Positivity Problem for linear recurrence sequences (whose
decidability has been open for several decades). Our main contribution is to
show decidability of a version of the reachability problem in which control
sets are convex polytopes, under certain spectral assumptions on the transition
matrix.
| math.OC cs.DM cs.LO cs.SY | we consider the decidability of statetostate reachability in linear timeinvariant control systems over discrete time we analyse this problem with respect to the allowable control sets which in general are assumed to be defined by boolean combinations of linear inequalities decidability of the version of the reachability problem in which control sets are affine subspaces of mathbbrn is a fundamental result in control theory our first result is that reachability is undecidable if the set of controls is a finite union of affine subspaces we also consider versions of the reachability problem in which ithe set of controls consists of a single affine subspace together with the origin and iithe set of controls is a convex polytope in these two cases we respectively show that the reachability problem is as hard as skolems problem and the positivity problem for linear recurrence sequences whose decidability has been open for several decades our main contribution is to show decidability of a version of the reachability problem in which control sets are convex polytopes under certain spectral assumptions on the transition matrix | [['we', 'consider', 'the', 'decidability', 'of', 'statetostate', 'reachability', 'in', 'linear', 'timeinvariant', 'control', 'systems', 'over', 'discrete', 'time', 'we', 'analyse', 'this', 'problem', 'with', 'respect', 'to', 'the', 'allowable', 'control', 'sets', 'which', 'in', 'general', 'are', 'assumed', 'to', 'be', 'defined', 'by', 'boolean', 'combinations', 'of', 'linear', 'inequalities', 'decidability', 'of', 'the', 'version', 'of', 'the', 'reachability', 'problem', 'in', 'which', 'control', 'sets', 'are', 'affine', 'subspaces', 'of', 'mathbbrn', 'is', 'a', 'fundamental', 'result', 'in', 'control', 'theory', 'our', 'first', 'result', 'is', 'that', 'reachability', 'is', 'undecidable', 'if', 'the', 'set', 'of', 'controls', 'is', 'a', 'finite', 'union', 'of', 'affine', 'subspaces', 'we', 'also', 'consider', 'versions', 'of', 'the', 'reachability', 'problem', 'in', 'which', 'ithe', 'set', 'of', 'controls', 'consists', 'of', 'a', 'single', 'affine', 'subspace', 'together', 'with', 'the', 'origin', 'and', 'iithe', 'set', 'of', 'controls', 'is', 'a', 'convex', 'polytope', 'in', 'these', 'two', 'cases', 'we', 'respectively', 'show', 'that', 'the', 'reachability', 'problem', 'is', 'as', 'hard', 'as', 'skolems', 'problem', 'and', 'the', 'positivity', 'problem', 'for', 'linear', 'recurrence', 'sequences', 'whose', 'decidability', 'has', 'been', 'open', 'for', 'several', 'decades', 'our', 'main', 'contribution', 'is', 'to', 'show', 'decidability', 'of', 'a', 'version', 'of', 'the', 'reachability', 'problem', 'in', 'which', 'control', 'sets', 'are', 'convex', 'polytopes', 'under', 'certain', 'spectral', 'assumptions', 'on', 'the', 'transition', 'matrix']] | [-0.14299296565593206, 0.05489290030621117, -0.02367603286642935, 0.05280979700755931, -0.04881439922512743, -0.1300285036035673, 0.04470474498252795, 0.33954462091641385, -0.38088171379952873, -0.23236024511006384, 0.1695585878645252, -0.2593864555803632, -0.11919372519426173, 0.20380514749851306, -0.1500941182814497, 0.12901028146441798, 0.05736987832309314, 0.05078408901199865, -0.06147958896533903, -0.28665174525452247, 0.37175521626027935, -0.08600346113986976, 0.19526699242603512, 0.043363010420726725, 0.1076678469849948, 0.04349393572387748, 0.023369182361674876, 0.05389361474449009, -0.09866870349631111, 0.11852335501345156, 0.31503108846785904, 0.20601213510751765, 0.31873049685866806, -0.3711935607560354, -0.15554906926299938, 0.16735531701498232, 0.11892372478604805, 0.08870615717836568, 0.0182345640493099, -0.24994344028316479, 0.10826355542508917, -0.09699824349967731, -0.08384363301483362, -0.028063724302639925, 0.02509577790348057, 0.033020098360682, -0.2818442123458206, 0.02651395780465555, 0.10867654151340436, 0.06369017520672303, -0.1287821068509102, -0.0757274168599449, 0.0055471367109046635, 0.07906297536296301, 0.0032919118253711883, 0.01534943861819221, 0.06517188847012943, -0.0435900731036939, -0.20102449724003257, 0.3902997724795142, 0.007422878464174004, -0.2584950283284211, 0.1449009090838902, -0.10917024408251193, -0.1982765544437434, 0.11027282751659608, 0.17001513647196512, 0.13453581956262028, -0.14570543431682126, 0.1602192021010173, -0.1619451719820083, 0.15378925841829777, 0.07649352161510321, 0.052244176387373234, 0.11708032863225018, 0.18978295572018822, 0.17987243398730043, 0.20579564410285223, 0.035364017315214116, -0.11230238024977832, -0.3254225202341819, -0.09803315274047993, -0.1251248877525444, 0.032728959936336434, -0.08321044693929247, -0.19222607410528472, 0.38219377315244196, 0.1016612340099121, 0.15916456295926562, 0.1660140612742775, 0.2604176925531687, 0.14308647086963192, 0.004815228863205636, 0.06557137952784503, 0.16986734936450862, 0.18038632812410302, 0.012376342145023691, -0.2319538028333232, 0.10693917766619244, 0.13510031565274605] |
1,802.06576 | Simulating and assessing boson sampling experiments with phase-space
representations | The search for new, application-specific quantum computers designed to
outperform any classical computer is driven by the ending of Moore's law and
the quantum advantages potentially obtainable. Photonic networks are promising
examples, with experimental demonstrations and potential for obtaining a
quantum computer to solve problems believed classically impossible. This
introduces a challenge: how does one design or understand such photonic
networks? One must be able to calculate observables using general methods
capable of treating arbitrary inputs, dissipation and noise. We develop novel
complex phase-space software for simulating these photonic networks, and apply
this to boson sampling experiments. Our techniques give sampling errors orders
of magnitude lower than experimental correlation measurements for the same
number of samples. We show that these techniques remove systematic errors in
previous algorithms for estimating correlations, with large improvements in
errors in some cases. In addition, we obtain a scalable channel-combination
strategy for assessment of boson sampling devices.
| quant-ph | the search for new applicationspecific quantum computers designed to outperform any classical computer is driven by the ending of moores law and the quantum advantages potentially obtainable photonic networks are promising examples with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible this introduces a challenge how does one design or understand such photonic networks one must be able to calculate observables using general methods capable of treating arbitrary inputs dissipation and noise we develop novel complex phasespace software for simulating these photonic networks and apply this to boson sampling experiments our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples we show that these techniques remove systematic errors in previous algorithms for estimating correlations with large improvements in errors in some cases in addition we obtain a scalable channelcombination strategy for assessment of boson sampling devices | [['the', 'search', 'for', 'new', 'applicationspecific', 'quantum', 'computers', 'designed', 'to', 'outperform', 'any', 'classical', 'computer', 'is', 'driven', 'by', 'the', 'ending', 'of', 'moores', 'law', 'and', 'the', 'quantum', 'advantages', 'potentially', 'obtainable', 'photonic', 'networks', 'are', 'promising', 'examples', 'with', 'experimental', 'demonstrations', 'and', 'potential', 'for', 'obtaining', 'a', 'quantum', 'computer', 'to', 'solve', 'problems', 'believed', 'classically', 'impossible', 'this', 'introduces', 'a', 'challenge', 'how', 'does', 'one', 'design', 'or', 'understand', 'such', 'photonic', 'networks', 'one', 'must', 'be', 'able', 'to', 'calculate', 'observables', 'using', 'general', 'methods', 'capable', 'of', 'treating', 'arbitrary', 'inputs', 'dissipation', 'and', 'noise', 'we', 'develop', 'novel', 'complex', 'phasespace', 'software', 'for', 'simulating', 'these', 'photonic', 'networks', 'and', 'apply', 'this', 'to', 'boson', 'sampling', 'experiments', 'our', 'techniques', 'give', 'sampling', 'errors', 'orders', 'of', 'magnitude', 'lower', 'than', 'experimental', 'correlation', 'measurements', 'for', 'the', 'same', 'number', 'of', 'samples', 'we', 'show', 'that', 'these', 'techniques', 'remove', 'systematic', 'errors', 'in', 'previous', 'algorithms', 'for', 'estimating', 'correlations', 'with', 'large', 'improvements', 'in', 'errors', 'in', 'some', 'cases', 'in', 'addition', 'we', 'obtain', 'a', 'scalable', 'channelcombination', 'strategy', 'for', 'assessment', 'of', 'boson', 'sampling', 'devices']] | [-0.08420417468612458, 0.10470381308198962, -0.06171805664144506, 0.11128768976045378, -0.06625256923008833, -0.2112539454535982, 0.04906127175828134, 0.3852811085602996, -0.24775975872608308, -0.34118112797435646, 0.0876284781080171, -0.25286963975229704, -0.15992484211001162, 0.29119393262790133, -0.09094790753211505, 0.13822764059565715, 0.10218748646334973, -0.05088396008983748, -0.08679283524258988, -0.27622517091623006, 0.2580214843542519, 0.041684903951503635, 0.2874421317911698, 0.006087876794650065, 0.090555242911931, -0.0016059818714610394, -0.042679830185995, 0.009361154049108655, -0.12834479399388757, 0.1515760815105654, 0.3010155682726486, 0.10859898412723513, 0.29605789530393206, -0.4515024800738628, -0.23376290580652506, 0.14327794929583934, 0.1428167690640155, 0.18198947168097196, -0.08939487798854906, -0.27996924686066754, 0.09358753532091069, -0.15486828000623956, -0.10289878201883344, -0.1776126345005873, -0.028093067762620796, -0.01188170017415522, -0.2779880492016673, 0.040759213005087724, 0.021291000410815736, 0.023744676496512844, 0.028528806422231875, -0.11599318943964008, 0.10352793215798671, 0.135343194838971, -0.04442830089578368, 0.012343307033440234, 0.15789063657411923, -0.13258303061400584, -0.23686967729953184, 0.37801244679764406, 0.0004991861625955385, -0.21561549609181602, 0.1816519695405065, -0.08018901709479508, -0.15676717825900047, 0.10760761686255353, 0.19482974066639577, 0.07091083739436461, -0.1466565664506067, 0.0371212358732973, 0.05379078317964018, 0.1721140515669835, 0.01859809383703704, 0.07337554474708174, 0.17338847820508288, 0.17469006837869913, 0.06337256414703223, 0.13677335426516657, -0.07734114029722301, -0.11421064163144949, -0.2710134701137215, -0.1499204473903045, -0.18729311315688174, 0.033350566815313516, -0.07599936879127416, -0.16398616405882385, 0.3557705016041927, 0.24678477608954955, 0.15025787470578555, 0.08228631786360646, 0.360946492557198, 0.08229412045021424, 0.11731596216937182, 0.08289084579511885, 0.22651024099955155, 0.10777710546702393, 0.09460457146093743, -0.16555579608176768, 0.052335580320572415, -0.00863087320984002] |
1,802.06577 | The exact asymptotics for hitting probability of a remote orthant by a
multivariate L\'evy process: the Cram\'er case | For a multivariate L\'evy process satisfying the Cram\'er moment condition
and having a drift vector with at least one negative component, we derive the
exact asymptotics of the probability of ever hitting the positive orthant that
is being translated to infinity along a fixed vector with positive components.
This problem is motivated by the multivariate ruin problem introduced in F.
Avram et al. (2008) in the two-dimensional case. Our solution relies on the
analysis from Y. Pan and K. Borovkov (2017) for multivariate random walks and
an appropriate time discretization.
| math.PR | for a multivariate levy process satisfying the cramer moment condition and having a drift vector with at least one negative component we derive the exact asymptotics of the probability of ever hitting the positive orthant that is being translated to infinity along a fixed vector with positive components this problem is motivated by the multivariate ruin problem introduced in f avram et al 2008 in the twodimensional case our solution relies on the analysis from y pan and k borovkov 2017 for multivariate random walks and an appropriate time discretization | [['for', 'a', 'multivariate', 'levy', 'process', 'satisfying', 'the', 'cramer', 'moment', 'condition', 'and', 'having', 'a', 'drift', 'vector', 'with', 'at', 'least', 'one', 'negative', 'component', 'we', 'derive', 'the', 'exact', 'asymptotics', 'of', 'the', 'probability', 'of', 'ever', 'hitting', 'the', 'positive', 'orthant', 'that', 'is', 'being', 'translated', 'to', 'infinity', 'along', 'a', 'fixed', 'vector', 'with', 'positive', 'components', 'this', 'problem', 'is', 'motivated', 'by', 'the', 'multivariate', 'ruin', 'problem', 'introduced', 'in', 'f', 'avram', 'et', 'al', '2008', 'in', 'the', 'twodimensional', 'case', 'our', 'solution', 'relies', 'on', 'the', 'analysis', 'from', 'y', 'pan', 'and', 'k', 'borovkov', '2017', 'for', 'multivariate', 'random', 'walks', 'and', 'an', 'appropriate', 'time', 'discretization']] | [-0.09447116293013096, 0.09371851693932613, -0.09805795727815066, 0.030309196167804153, -0.07964642398938951, -0.15353360949601563, 0.06360740924525696, 0.3183072846382856, -0.2452944308390013, -0.2301229275866515, 0.12090178437582734, -0.3010584684088826, -0.11189826698456373, 0.1272916731243539, -0.08836403493252065, 0.10782707232671479, 0.019033833554325006, 0.022399858343932363, -0.0031476483654437793, -0.293569172732532, 0.31718457197873956, 0.06284671916315952, 0.24836860435704392, -0.006104192427463002, 0.1739772562228609, 0.06304457903218766, -0.0733819732164395, -0.011979916665910018, -0.13696528741929798, 0.0819440836733621, 0.2093878332965283, 0.10838531476652456, 0.31893927871973976, -0.3615643694168992, -0.17974121128726336, 0.15691279369251182, 0.07715482691613336, 0.0453998068606274, -0.03212830076226965, -0.31538237626923044, 0.08322753799665306, -0.10009930478926334, -0.15431369099662537, 0.0047542964780910146, 0.09662169377422995, 0.022361110306034486, -0.3593988973233435, 0.09964092230010364, 0.13252303934293902, 0.06068100721264879, -0.041736218048673536, -0.17344397665518854, 0.02364122824251859, 0.0421065223041094, 0.07037906013914229, 0.06315683690675845, 0.028497726371925738, -0.03975013491645869, -0.11515604253444407, 0.29201019745734, -0.09554051628543271, -0.25038029490452673, 0.13775906140476257, -0.16886279708705842, -0.1491976703568879, 0.11925283492439323, 0.16007349313133293, 0.14076415542513132, -0.11840957498902248, 0.17366493165092026, -0.07155022611841559, 0.0671464041974913, 0.12469804197963741, -0.08488258155994118, 0.14647364555081974, 0.09310787985515263, 0.14050630791712643, 0.12534832959580752, -0.0629305026287006, -0.09447767296611952, -0.30992230927416436, -0.1733907768696857, -0.23877099766395987, 0.0893147012982, -0.12127977218947814, -0.19437762637519174, 0.3600730922487047, 0.09073853391843538, 0.2384543685759935, 0.13652583949474825, 0.22883606099057943, 0.19499203242594376, -0.060865951453646025, 0.10795248833536687, 0.0978009369948672, 0.17361932130944396, 0.12770895234102175, -0.14216665628417913, 0.12189866620012456, 0.13238574019633234] |
1,802.06578 | When Sheep Shop: Measuring Herding Effects in Product Ratings with
Natural Experiments | As online shopping becomes ever more prevalent, customers rely increasingly
on product rating websites for making purchase decisions. The reliability of
online ratings, however, is potentially compromised by the so-called herding
effect: when rating a product, customers may be biased to follow other
customers' previous ratings of the same product. This is problematic because it
skews long-term customer perception through haphazard early ratings. The study
of herding poses methodological challenges. In particular, observational
studies are impeded by the lack of counterfactuals: simply correlating early
with subsequent ratings is insufficient because we cannot know what the
subsequent ratings would have looked like had the first ratings been different.
The methodology introduced here exploits a setting that comes close to an
experiment, although it is purely observational---a natural experiment. Our key
methodological device consists in studying the same product on two separate
rating sites, focusing on products that received a high first rating on one
site, and a low first rating on the other. This largely controls for confounds
such as a product's inherent quality, advertising, and producer identity, and
lets us isolate the effect of the first rating on subsequent ratings. In a case
study, we focus on beers as products and jointly study two beer rating sites,
but our method applies to any pair of sites across which products can be
matched. We find clear evidence of herding in beer ratings. For instance, if a
beer receives a very high first rating, its second rating is on average half a
standard deviation higher, compared to a situation where the identical beer
receives a very low first rating. Moreover, herding effects tend to last a long
time and are noticeable even after 20 or more ratings. Our results have
important implications for the design of better rating systems.
| cs.CY cs.SI | as online shopping becomes ever more prevalent customers rely increasingly on product rating websites for making purchase decisions the reliability of online ratings however is potentially compromised by the socalled herding effect when rating a product customers may be biased to follow other customers previous ratings of the same product this is problematic because it skews longterm customer perception through haphazard early ratings the study of herding poses methodological challenges in particular observational studies are impeded by the lack of counterfactuals simply correlating early with subsequent ratings is insufficient because we cannot know what the subsequent ratings would have looked like had the first ratings been different the methodology introduced here exploits a setting that comes close to an experiment although it is purely observationala natural experiment our key methodological device consists in studying the same product on two separate rating sites focusing on products that received a high first rating on one site and a low first rating on the other this largely controls for confounds such as a products inherent quality advertising and producer identity and lets us isolate the effect of the first rating on subsequent ratings in a case study we focus on beers as products and jointly study two beer rating sites but our method applies to any pair of sites across which products can be matched we find clear evidence of herding in beer ratings for instance if a beer receives a very high first rating its second rating is on average half a standard deviation higher compared to a situation where the identical beer receives a very low first rating moreover herding effects tend to last a long time and are noticeable even after 20 or more ratings our results have important implications for the design of better rating systems | [['as', 'online', 'shopping', 'becomes', 'ever', 'more', 'prevalent', 'customers', 'rely', 'increasingly', 'on', 'product', 'rating', 'websites', 'for', 'making', 'purchase', 'decisions', 'the', 'reliability', 'of', 'online', 'ratings', 'however', 'is', 'potentially', 'compromised', 'by', 'the', 'socalled', 'herding', 'effect', 'when', 'rating', 'a', 'product', 'customers', 'may', 'be', 'biased', 'to', 'follow', 'other', 'customers', 'previous', 'ratings', 'of', 'the', 'same', 'product', 'this', 'is', 'problematic', 'because', 'it', 'skews', 'longterm', 'customer', 'perception', 'through', 'haphazard', 'early', 'ratings', 'the', 'study', 'of', 'herding', 'poses', 'methodological', 'challenges', 'in', 'particular', 'observational', 'studies', 'are', 'impeded', 'by', 'the', 'lack', 'of', 'counterfactuals', 'simply', 'correlating', 'early', 'with', 'subsequent', 'ratings', 'is', 'insufficient', 'because', 'we', 'can', 'not', 'know', 'what', 'the', 'subsequent', 'ratings', 'would', 'have', 'looked', 'like', 'had', 'the', 'first', 'ratings', 'been', 'different', 'the', 'methodology', 'introduced', 'here', 'exploits', 'a', 'setting', 'that', 'comes', 'close', 'to', 'an', 'experiment', 'although', 'it', 'is', 'purely', 'observationala', 'natural', 'experiment', 'our', 'key', 'methodological', 'device', 'consists', 'in', 'studying', 'the', 'same', 'product', 'on', 'two', 'separate', 'rating', 'sites', 'focusing', 'on', 'products', 'that', 'received', 'a', 'high', 'first', 'rating', 'on', 'one', 'site', 'and', 'a', 'low', 'first', 'rating', 'on', 'the', 'other', 'this', 'largely', 'controls', 'for', 'confounds', 'such', 'as', 'a', 'products', 'inherent', 'quality', 'advertising', 'and', 'producer', 'identity', 'and', 'lets', 'us', 'isolate', 'the', 'effect', 'of', 'the', 'first', 'rating', 'on', 'subsequent', 'ratings', 'in', 'a', 'case', 'study', 'we', 'focus', 'on', 'beers', 'as', 'products', 'and', 'jointly', 'study', 'two', 'beer', 'rating', 'sites', 'but', 'our', 'method', 'applies', 'to', 'any', 'pair', 'of', 'sites', 'across', 'which', 'products', 'can', 'be', 'matched', 'we', 'find', 'clear', 'evidence', 'of', 'herding', 'in', 'beer', 'ratings', 'for', 'instance', 'if', 'a', 'beer', 'receives', 'a', 'very', 'high', 'first', 'rating', 'its', 'second', 'rating', 'is', 'on', 'average', 'half', 'a', 'standard', 'deviation', 'higher', 'compared', 'to', 'a', 'situation', 'where', 'the', 'identical', 'beer', 'receives', 'a', 'very', 'low', 'first', 'rating', 'moreover', 'herding', 'effects', 'tend', 'to', 'last', 'a', 'long', 'time', 'and', 'are', 'noticeable', 'even', 'after', '20', 'or', 'more', 'ratings', 'our', 'results', 'have', 'important', 'implications', 'for', 'the', 'design', 'of', 'better', 'rating', 'systems']] | [-0.07291957199720898, 0.06908742091428373, -0.06381443546464045, 0.11055596486660604, -0.1444974679669196, -0.17423103810801494, 0.0986220707445835, 0.41338305209797843, -0.1998022708920127, -0.3074157196269543, 0.1286437575915446, -0.3364939459079017, -0.15094365208779748, 0.15981814730520477, -0.11772387294311967, -0.035845648222963516, 0.09282323087468392, 0.09491542164904225, -0.027254972224333873, -0.30998045581460365, 0.3205298192027693, 0.09635728038337885, 0.3121579767650492, 0.05165549703977174, 0.06624825909319851, 0.00813174099968715, -0.10003264635638255, 0.017794583498434435, -0.05143732137638826, 0.08105497246065063, 0.2826458334833421, 0.159759092427671, 0.38036442071400106, -0.4120146468193944, -0.1516062393259282, 0.10607042704373347, 0.11215797475906032, 0.07387181536901291, -0.05357246023811704, -0.286806173021325, 0.05047043635720005, -0.25038738357317114, -0.038467437740703825, -0.068585357343408, 0.02682851862651531, 0.0031613857855374364, -0.2684500925176266, 0.039501327348274086, 0.03090151025776858, 0.04161148053603341, -0.03310700705367445, -0.15086832761087202, -0.0006537574420993527, 0.22041883773175508, 0.1087019737776187, -0.042120576591579, 0.14334866403592655, -0.1365782942086684, -0.13408399979162158, 0.4270995107513887, -0.03143484538392813, -0.13533032308991133, 0.19713518713516268, -0.11834974577595551, -0.1558189460919913, 0.09052566627686473, 0.2117554519767638, 0.07542230125582504, -0.1463752977720243, -0.05372902082266781, -0.055541997010308486, 0.1930299185373999, 0.05869591767548486, -0.014581047330892046, 0.2040414366650047, 0.17977712873560736, 0.0637414608737109, 0.07871133006790886, -0.020195131375131382, -0.07594715899502488, -0.19044150274265745, -0.13562198011800397, -0.16349683897467862, 0.08101005986516532, -0.0935797455619377, -0.16142037815785956, 0.36787265380185963, 0.1688362370442712, 0.1953065436747339, 0.026845300579831626, 0.33828808260401116, 0.08847267678307733, 0.07285390335044224, 0.032095939373700984, 0.20280513547436155, -0.005235756193961861, 0.13895906637632838, -0.136141987156177, 0.20845770277239709, 0.014276305929701211] |
1,802.06579 | Convexity-Increasing Morphs of Planar Graphs | We study the problem of convexifying drawings of planar graphs. Given any
planar straight-line drawing of an internally 3-connected graph, we show how to
morph the drawing to one with strictly convex faces while maintaining planarity
at all times. Our morph is convexity-increasing, meaning that once an angle is
convex, it remains convex. We give an efficient algorithm that constructs such
a morph as a composition of a linear number of steps where each step either
moves vertices along horizontal lines or moves vertices along vertical lines.
Moreover, we show that a linear number of steps is worst-case optimal.
To obtain our result, we use a well-known technique by Hong and Nagamochi for
finding redrawings with convex faces while preserving y-coordinates. Using a
variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and
Nagamochi's result which comes with a better running time. This is of
independent interest, as Hong and Nagamochi's technique serves as a building
block in existing morphing algorithms.
| cs.CG | we study the problem of convexifying drawings of planar graphs given any planar straightline drawing of an internally 3connected graph we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times our morph is convexityincreasing meaning that once an angle is convex it remains convex we give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines moreover we show that a linear number of steps is worstcase optimal to obtain our result we use a wellknown technique by hong and nagamochi for finding redrawings with convex faces while preserving ycoordinates using a variant of tuttes graph drawing algorithm we obtain a new proof of hong and nagamochis result which comes with a better running time this is of independent interest as hong and nagamochis technique serves as a building block in existing morphing algorithms | [['we', 'study', 'the', 'problem', 'of', 'convexifying', 'drawings', 'of', 'planar', 'graphs', 'given', 'any', 'planar', 'straightline', 'drawing', 'of', 'an', 'internally', '3connected', 'graph', 'we', 'show', 'how', 'to', 'morph', 'the', 'drawing', 'to', 'one', 'with', 'strictly', 'convex', 'faces', 'while', 'maintaining', 'planarity', 'at', 'all', 'times', 'our', 'morph', 'is', 'convexityincreasing', 'meaning', 'that', 'once', 'an', 'angle', 'is', 'convex', 'it', 'remains', 'convex', 'we', 'give', 'an', 'efficient', 'algorithm', 'that', 'constructs', 'such', 'a', 'morph', 'as', 'a', 'composition', 'of', 'a', 'linear', 'number', 'of', 'steps', 'where', 'each', 'step', 'either', 'moves', 'vertices', 'along', 'horizontal', 'lines', 'or', 'moves', 'vertices', 'along', 'vertical', 'lines', 'moreover', 'we', 'show', 'that', 'a', 'linear', 'number', 'of', 'steps', 'is', 'worstcase', 'optimal', 'to', 'obtain', 'our', 'result', 'we', 'use', 'a', 'wellknown', 'technique', 'by', 'hong', 'and', 'nagamochi', 'for', 'finding', 'redrawings', 'with', 'convex', 'faces', 'while', 'preserving', 'ycoordinates', 'using', 'a', 'variant', 'of', 'tuttes', 'graph', 'drawing', 'algorithm', 'we', 'obtain', 'a', 'new', 'proof', 'of', 'hong', 'and', 'nagamochis', 'result', 'which', 'comes', 'with', 'a', 'better', 'running', 'time', 'this', 'is', 'of', 'independent', 'interest', 'as', 'hong', 'and', 'nagamochis', 'technique', 'serves', 'as', 'a', 'building', 'block', 'in', 'existing', 'morphing', 'algorithms']] | [-0.1188434823676481, 0.06471633594235483, -0.07258327839525867, -0.016897479911705027, -0.11966104165836011, -0.15886595940957807, 0.06721967105574397, 0.4234515768678292, -0.2766216060042566, -0.3152448927277919, 0.09867566079118213, -0.2914908998732611, -0.1679777548581894, 0.17080701785653785, -0.13403389054229078, 0.037763521914017495, 0.10514080059072524, -0.002507202032236209, -0.005369358510935899, -0.25834257873707966, 0.25812548269974706, -0.02431175487051987, 0.20327678063062962, 0.0584152357375122, 0.13546861319727502, 0.06244704691600633, 0.018510475143738183, 0.10690608742915858, -0.12553123850949355, 0.10772917581713463, 0.2606974458538852, 0.21853607313837445, 0.25985663810814297, -0.4203575160007299, -0.12838273588278742, 0.12483661363236838, 0.1224464724644417, 0.12143349247588342, -0.05407824524336998, -0.20478357835123256, 0.08130399878310351, -0.04352178138981556, -0.11892702970480235, -0.010205126292309406, 0.03118080868507209, -0.02319340983128048, -0.2913656870180868, -0.05195697961282564, 0.1476854539551535, 0.05514768557333798, 0.05828688686976776, -0.12530049740666557, -0.03742030069741033, 0.136393387932099, 0.0029764056098372646, 0.11626130347255825, 0.08178278551905514, -0.08226952302451852, -0.17682522173207368, 0.37225809820597955, -0.031173812803922233, -0.19767217055796096, 0.14057370967677105, -0.06718849926111028, -0.17509908928183018, 0.11244129948028773, 0.1413894203283263, 0.15470954296844347, -0.08728078180368735, 0.08060609229286461, -0.12710475666818688, 0.1409584596834105, 0.13448323990270403, -0.04418439202311431, 0.1344962789682868, 0.1622318865775466, 0.20728623846354924, 0.20917471638889348, -0.016192046951456283, -0.04168559361237639, -0.27543262829237636, -0.17059685699844165, -0.19298198266368452, 0.011155576287531612, -0.163464714714882, -0.22919670417644547, 0.40748012185050464, 0.08381328261341692, 0.23673358547460774, 0.15366552700216285, 0.3157580466304692, 0.06965324194647765, 0.04694743364505609, 0.1596798325212013, 0.14446648116720992, 0.0879638148717559, 0.017872059616543676, -0.13777342185042568, 0.06752004112284746, 0.1413748856165348] |
1,802.0658 | Desynchronization induced by time-varying network | The synchronous dynamics of an array of excitable oscillators, coupled via a
generic graph, is studied. Non homogeneous perturbations can grow and destroy
synchrony, via a self-consistent instability which is solely instigated by the
intrinsic network dynamics. By acting on the characteristic time-scale of the
network modulation, one can make the examined system to behave as its
(partially) averaged analog. This result if formally obtained by proving an
extended version of the averaging theorem, which allows for partial averages to
be carried out. As a byproduct of the analysis, oscillation death are reported
to follow the onset of the network driven instability.
| cond-mat.dis-nn cond-mat.stat-mech nlin.PS physics.soc-ph q-bio.NC | the synchronous dynamics of an array of excitable oscillators coupled via a generic graph is studied non homogeneous perturbations can grow and destroy synchrony via a selfconsistent instability which is solely instigated by the intrinsic network dynamics by acting on the characteristic timescale of the network modulation one can make the examined system to behave as its partially averaged analog this result if formally obtained by proving an extended version of the averaging theorem which allows for partial averages to be carried out as a byproduct of the analysis oscillation death are reported to follow the onset of the network driven instability | [['the', 'synchronous', 'dynamics', 'of', 'an', 'array', 'of', 'excitable', 'oscillators', 'coupled', 'via', 'a', 'generic', 'graph', 'is', 'studied', 'non', 'homogeneous', 'perturbations', 'can', 'grow', 'and', 'destroy', 'synchrony', 'via', 'a', 'selfconsistent', 'instability', 'which', 'is', 'solely', 'instigated', 'by', 'the', 'intrinsic', 'network', 'dynamics', 'by', 'acting', 'on', 'the', 'characteristic', 'timescale', 'of', 'the', 'network', 'modulation', 'one', 'can', 'make', 'the', 'examined', 'system', 'to', 'behave', 'as', 'its', 'partially', 'averaged', 'analog', 'this', 'result', 'if', 'formally', 'obtained', 'by', 'proving', 'an', 'extended', 'version', 'of', 'the', 'averaging', 'theorem', 'which', 'allows', 'for', 'partial', 'averages', 'to', 'be', 'carried', 'out', 'as', 'a', 'byproduct', 'of', 'the', 'analysis', 'oscillation', 'death', 'are', 'reported', 'to', 'follow', 'the', 'onset', 'of', 'the', 'network', 'driven', 'instability']] | [-0.18761736629348175, 0.14776846736369373, -0.0865658128944536, 0.05405930560835473, -0.04288622923651893, -0.11796377476889129, 0.028302912764689502, 0.2988301745282632, -0.30858728340735625, -0.2547821081517374, 0.14334751604417084, -0.21526301396778424, -0.17649036500255996, 0.1835963979372572, 0.00035734716620223193, -0.006227287274954256, 0.05186236635142682, 0.03959713992890993, 0.00010574665651017545, -0.2082314279045129, 0.3068001174422748, 0.08930606148308418, 0.25955901030387146, -0.04699646942283246, 0.09109006620322664, 0.019188556055465312, -0.021225433787513598, 0.04179883512380697, -0.08611319553764428, 0.04423639101350643, 0.19584838953596773, 0.08652223486398511, 0.2581376324626891, -0.46556749213121684, -0.24176471299656174, 0.115472484457617, 0.1777951856678484, 0.12990823951686786, 0.01868970398808254, -0.31480051358869554, 0.0672842629993444, -0.16766397772338607, -0.17274414696365448, -0.07104612031595453, -0.006918531363172566, 0.05279366940479068, -0.2703638820379388, 0.09491525307827282, 0.11189884933022161, 0.04879134805078673, -0.04034740443731768, -0.004898699127165053, -0.06997445806879185, 0.11952578533422567, 0.0059890211011995285, 0.024888764441415082, 0.15727443756951093, -0.04238253381267628, -0.09987621802800134, 0.33390826650657784, -0.1208562314414474, -0.1849927663182219, 0.1712764154083333, -0.09978216979196113, -0.08672153016132321, 0.14289464120862677, 0.15450895889936125, 0.09325638705608892, -0.16670221261972307, 0.007026709277780873, -0.04261887897554712, 0.17566364020675274, 0.07492849976280887, 0.012532349867636667, 0.196457573819869, 0.19775300586650915, 0.062123502018021456, 0.16748763714099815, -0.023521372872089746, -0.1370205193821925, -0.2588658260921126, -0.06874887026987933, -0.16593697784222006, 0.10712200528417039, -0.04121997984318524, -0.18353122428023055, 0.4056087503045359, 0.11426306738262522, 0.19089874835210105, 0.02737169580616276, 0.24165704143781433, 0.1556545233276362, 0.07730144872238823, 0.049624447893424364, 0.26718326491833316, 0.18879652462269672, 0.09853794767210881, -0.2394721392249944, 0.0735116517057131, 0.08844804080367527] |
1,802.06581 | Dynamic Cloud Network Control under Reconfiguration Delay and Cost | Network virtualization and programmability allow operators to deploy a wide
range of services over a common physical infrastructure and elastically
allocate cloud and network resources according to changing requirements. While
the elastic reconfiguration of virtual resources enables dynamically scaling
capacity in order to support service demands with minimal operational cost,
reconfiguration operations make resources unavailable during a given time
period and may incur additional cost. In this paper, we address the dynamic
cloud network control problem under non-negligible reconfiguration delay and
cost. We show that while the capacity region remains unchanged regardless of
the reconfiguration delay/cost values, a reconfiguration-agnostic policy may
fail to guarantee throughput-optimality and minimum cost under nonzero
reconfiguration delay/cost. We then present an adaptive dynamic cloud network
control policy that allows network nodes to make local flow scheduling and
resource allocation decisions while controlling the frequency of
reconfiguration in order to support any input rate in the capacity region and
achieve arbitrarily close to minimum cost for any finite reconfiguration
delay/cost values.
| cs.NI | network virtualization and programmability allow operators to deploy a wide range of services over a common physical infrastructure and elastically allocate cloud and network resources according to changing requirements while the elastic reconfiguration of virtual resources enables dynamically scaling capacity in order to support service demands with minimal operational cost reconfiguration operations make resources unavailable during a given time period and may incur additional cost in this paper we address the dynamic cloud network control problem under nonnegligible reconfiguration delay and cost we show that while the capacity region remains unchanged regardless of the reconfiguration delaycost values a reconfigurationagnostic policy may fail to guarantee throughputoptimality and minimum cost under nonzero reconfiguration delaycost we then present an adaptive dynamic cloud network control policy that allows network nodes to make local flow scheduling and resource allocation decisions while controlling the frequency of reconfiguration in order to support any input rate in the capacity region and achieve arbitrarily close to minimum cost for any finite reconfiguration delaycost values | [['network', 'virtualization', 'and', 'programmability', 'allow', 'operators', 'to', 'deploy', 'a', 'wide', 'range', 'of', 'services', 'over', 'a', 'common', 'physical', 'infrastructure', 'and', 'elastically', 'allocate', 'cloud', 'and', 'network', 'resources', 'according', 'to', 'changing', 'requirements', 'while', 'the', 'elastic', 'reconfiguration', 'of', 'virtual', 'resources', 'enables', 'dynamically', 'scaling', 'capacity', 'in', 'order', 'to', 'support', 'service', 'demands', 'with', 'minimal', 'operational', 'cost', 'reconfiguration', 'operations', 'make', 'resources', 'unavailable', 'during', 'a', 'given', 'time', 'period', 'and', 'may', 'incur', 'additional', 'cost', 'in', 'this', 'paper', 'we', 'address', 'the', 'dynamic', 'cloud', 'network', 'control', 'problem', 'under', 'nonnegligible', 'reconfiguration', 'delay', 'and', 'cost', 'we', 'show', 'that', 'while', 'the', 'capacity', 'region', 'remains', 'unchanged', 'regardless', 'of', 'the', 'reconfiguration', 'delaycost', 'values', 'a', 'reconfigurationagnostic', 'policy', 'may', 'fail', 'to', 'guarantee', 'throughputoptimality', 'and', 'minimum', 'cost', 'under', 'nonzero', 'reconfiguration', 'delaycost', 'we', 'then', 'present', 'an', 'adaptive', 'dynamic', 'cloud', 'network', 'control', 'policy', 'that', 'allows', 'network', 'nodes', 'to', 'make', 'local', 'flow', 'scheduling', 'and', 'resource', 'allocation', 'decisions', 'while', 'controlling', 'the', 'frequency', 'of', 'reconfiguration', 'in', 'order', 'to', 'support', 'any', 'input', 'rate', 'in', 'the', 'capacity', 'region', 'and', 'achieve', 'arbitrarily', 'close', 'to', 'minimum', 'cost', 'for', 'any', 'finite', 'reconfiguration', 'delaycost', 'values']] | [-0.2563813400011873, 0.08699968136165918, -0.013490179141915245, -0.004506119734908613, -0.12939028863414623, -0.1877882968770658, 0.2011523125288588, 0.4245733597838297, -0.3208934804651795, -0.3389466843829013, 0.11337112854149692, -0.17105721583082015, -0.10545671326761338, 0.1190839911748587, -0.16887967318378774, 0.1352386900669932, 0.08572708106480494, 0.02958444474554598, -0.00560223179047348, -0.24531050707020502, 0.2708506679464779, 0.11332490483707772, 0.32987374565336947, 0.09458097857181778, 0.0694214303796066, 0.010517125900993804, 0.029085693633000696, -0.010931573386586955, -0.08416958005146603, 0.09461697648356032, 0.33475774536462977, 0.18497308323773123, 0.34395687052662055, -0.5076078617854453, -0.20728885126726065, 0.13787080737671292, 0.11522463584608375, 0.020751045913174296, 0.030589138436636593, -0.17737701268321493, 0.11407515849270744, -0.2390379733860311, -0.085782650909273, -0.09463091156723705, 0.010224805625223713, 0.030677886047337004, -0.34008108965893524, -0.05681521918556494, -0.05113870838498015, 0.007335101336626927, -0.10563555372227268, -0.04776331576768581, -0.006806255058419504, 0.18085787765306943, 0.00819553552967746, 0.03870174880977152, 0.16814329878500914, -0.152765853047263, -0.11567611478428107, 0.37753174656138916, 0.028814304020914543, -0.15629230764064164, 0.17002854420215732, -0.04498161267625486, -0.13392472509067596, 0.15839006892893825, 0.24603562792138448, 0.02354530356937974, -0.17644028800536832, 0.04701985044563871, 0.04893863881106216, 0.2043692907318473, 0.0728895728016363, 0.10647603579251687, 0.1518765343466728, 0.19199940570198545, 0.20955535591432325, 0.16399494084109348, -0.03399992416323185, -0.13099330153157254, -0.2312227424983753, -0.12250369695219689, -0.16697263351369013, 0.0014658586467082453, -0.124196605902398, -0.1137851368687002, 0.3679650393201084, 0.18184634779222172, 0.15965129767413955, 0.16895443704605695, 0.36946154258600095, 0.08613957848581599, 0.12719828674753222, 0.23074501761229618, 0.1239609299767081, 7.07981057419646e-05, 0.1844090856732403, -0.24707977187666452, 0.15644755476830874, -0.015205829327630743] |
1,802.06582 | Algebraic non-integrability of magnetic billiards on the Sphere and
Hyperbolic plane | We consider billiard ball motion in a convex domain on a constant curvature
surface influenced by the constant magnetic field. We examine the existence of
integral of motion which is polynomial in velocities. We prove that if such an
integral exists then the boundary curve of the domain determines an algebraic
curve in $\mathbf{C}^3$ which must be nonsingular. Using this fact we deduce
that for any domain different from round disc for all but finitely many values
of the magnitude of the magnetic field billiard motion does not have Polynomial
in velocities integral of motion.
| math.DG math.DS nlin.SI | we consider billiard ball motion in a convex domain on a constant curvature surface influenced by the constant magnetic field we examine the existence of integral of motion which is polynomial in velocities we prove that if such an integral exists then the boundary curve of the domain determines an algebraic curve in mathbfc3 which must be nonsingular using this fact we deduce that for any domain different from round disc for all but finitely many values of the magnitude of the magnetic field billiard motion does not have polynomial in velocities integral of motion | [['we', 'consider', 'billiard', 'ball', 'motion', 'in', 'a', 'convex', 'domain', 'on', 'a', 'constant', 'curvature', 'surface', 'influenced', 'by', 'the', 'constant', 'magnetic', 'field', 'we', 'examine', 'the', 'existence', 'of', 'integral', 'of', 'motion', 'which', 'is', 'polynomial', 'in', 'velocities', 'we', 'prove', 'that', 'if', 'such', 'an', 'integral', 'exists', 'then', 'the', 'boundary', 'curve', 'of', 'the', 'domain', 'determines', 'an', 'algebraic', 'curve', 'in', 'mathbfc3', 'which', 'must', 'be', 'nonsingular', 'using', 'this', 'fact', 'we', 'deduce', 'that', 'for', 'any', 'domain', 'different', 'from', 'round', 'disc', 'for', 'all', 'but', 'finitely', 'many', 'values', 'of', 'the', 'magnitude', 'of', 'the', 'magnetic', 'field', 'billiard', 'motion', 'does', 'not', 'have', 'polynomial', 'in', 'velocities', 'integral', 'of', 'motion']] | [-0.19395807929128964, 0.10818928845525234, -0.11871660414567971, -0.004441053210262289, -0.13218616687771964, -0.07697934230313973, -0.052307646493724685, 0.39417715289412025, -0.3438620529078106, -0.2171628773212433, 0.12240974796797208, -0.2203636181322818, -0.11571779039916286, 0.2442281277097286, -0.11944109428812691, 0.01224933854849796, 0.06439713537296717, 0.10561635761343419, -0.048038333837695894, -0.25281075781775997, 0.37047991604405517, -0.1176362475677532, 0.16904764358905403, 0.05455626159946018, 0.147177627557849, 0.024825556040246118, 0.036939132309697094, 0.0778889517297354, -0.20376706632684566, 0.07127429036661348, 0.18406445215000433, 0.07146391659192344, 0.221232769376737, -0.4338311152532697, -0.2100924593297408, 0.16209895364900537, 0.17131908344937133, 0.06705352678607673, -0.04150609615255157, -0.24637778960366516, 0.08762368027051474, -0.08552006713332648, -0.19328630866700822, -0.0436575789044195, 0.08858341855700425, 0.039013689175802974, -0.23652604844995795, 0.06107495333801242, 0.08958747761046633, 0.1056510915662697, -0.13252148027977648, -0.05976844477799147, 0.010925986571237445, 0.09147340264369516, 0.04762560402741656, 0.07572479900269907, 0.12458220032103201, -0.12830858708091794, -0.08269772219392373, 0.3746559149882895, -0.095605259959368, -0.2512307611313906, 0.11713069670417524, -0.23348991871573666, -0.09192537570352409, 0.16856698245999027, 0.14387221768141745, 0.129449610261524, -0.12157322703167162, 0.1562870972098763, -0.07897486950721631, 0.1370562084757307, 0.10901585963376342, -0.04037462996239675, 0.20094645643567152, 0.046407393021310896, 0.1274367763302933, 0.11844530606213859, -0.08515447262238632, -0.08994788995032456, -0.35493367894532835, -0.19163212060254622, -0.2173188554056167, 0.08322413660294223, -0.12275798516744311, -0.21654171577872747, 0.3630804561791902, 0.09259555443497176, 0.20560724956003276, 0.04111328733183364, 0.25842463026353296, 0.12713505857762822, 0.048655188885180556, 0.14882018659362925, 0.22825189815100996, 0.07822694339383235, 0.03751218802929717, -0.22703822286789643, 0.03447401452750126, 0.10159901777242726] |
1,802.06583 | Surface-mode-assisted amplification of radiative heat transfer between
nanoparticles | We show that the radiative heat flux between two nanoparticles can be
significantly amplified when they are placed in proximity of a planar substrate
supporting a surface resonance. The amplification factor goes beyond two orders
of magnitude in the case of dielectric nanoparticles, whereas it is lower in
the case of metallic nanoparticles. We analyze how this effect depends on the
frequency and on the particles-surface distance, by clearly identifying the
signature of the surface mode producing the amplification. Finally, we show how
the presence of a graphene sheet on top of the substrate can modify the effect,
by making an amplification of two orders of magnitude possible also in the case
of metallic nanoparticles. This long range amplification effect should play an
important role in the thermal relaxation dynamics of nanoparticle networks.
| cond-mat.mes-hall | we show that the radiative heat flux between two nanoparticles can be significantly amplified when they are placed in proximity of a planar substrate supporting a surface resonance the amplification factor goes beyond two orders of magnitude in the case of dielectric nanoparticles whereas it is lower in the case of metallic nanoparticles we analyze how this effect depends on the frequency and on the particlessurface distance by clearly identifying the signature of the surface mode producing the amplification finally we show how the presence of a graphene sheet on top of the substrate can modify the effect by making an amplification of two orders of magnitude possible also in the case of metallic nanoparticles this long range amplification effect should play an important role in the thermal relaxation dynamics of nanoparticle networks | [['we', 'show', 'that', 'the', 'radiative', 'heat', 'flux', 'between', 'two', 'nanoparticles', 'can', 'be', 'significantly', 'amplified', 'when', 'they', 'are', 'placed', 'in', 'proximity', 'of', 'a', 'planar', 'substrate', 'supporting', 'a', 'surface', 'resonance', 'the', 'amplification', 'factor', 'goes', 'beyond', 'two', 'orders', 'of', 'magnitude', 'in', 'the', 'case', 'of', 'dielectric', 'nanoparticles', 'whereas', 'it', 'is', 'lower', 'in', 'the', 'case', 'of', 'metallic', 'nanoparticles', 'we', 'analyze', 'how', 'this', 'effect', 'depends', 'on', 'the', 'frequency', 'and', 'on', 'the', 'particlessurface', 'distance', 'by', 'clearly', 'identifying', 'the', 'signature', 'of', 'the', 'surface', 'mode', 'producing', 'the', 'amplification', 'finally', 'we', 'show', 'how', 'the', 'presence', 'of', 'a', 'graphene', 'sheet', 'on', 'top', 'of', 'the', 'substrate', 'can', 'modify', 'the', 'effect', 'by', 'making', 'an', 'amplification', 'of', 'two', 'orders', 'of', 'magnitude', 'possible', 'also', 'in', 'the', 'case', 'of', 'metallic', 'nanoparticles', 'this', 'long', 'range', 'amplification', 'effect', 'should', 'play', 'an', 'important', 'role', 'in', 'the', 'thermal', 'relaxation', 'dynamics', 'of', 'nanoparticle', 'networks']] | [-0.14968774778500313, 0.1766124120739264, -0.03114788580657632, 0.02756846754963397, -0.022566652860294915, -0.06396684635458796, 0.048500840181738815, 0.3952695166861469, -0.253327746085371, -0.32300027028064837, 0.05480765916008474, -0.2877972759800314, -0.16748408839163004, 0.23675175058429665, 0.017454952888797517, -0.03612275012787767, -8.467064507192734e-05, -0.002420791936332755, -0.027494173902210383, -0.2121690979975304, 0.3158233655108647, 0.07352602999361063, 0.30869887938553636, 0.11986215466591106, 0.02368011795492335, -0.006916311784703849, 0.05979256923522123, 0.03406789516112908, -0.11078164275854899, 0.07347733685111796, 0.1863272294021127, -0.03949105013673419, 0.24858678346429247, -0.489069593618765, -0.20062906881371004, 0.07044959557242692, 0.17234966072966484, 0.1361070150601198, -0.0499517434818148, -0.22446351796988342, 0.0529131918905698, -0.10615226697391887, -0.10915803197404426, -0.008446970058492187, 0.0009209341215230806, -0.018641835939364904, -0.2198339938856379, 0.06705459877985324, 0.1312029715318755, 0.03773736513473771, -0.03771120982569163, -0.08786191628843715, -0.03271485362766367, 0.1098595069869947, 0.06542503686267248, -0.02261234032145391, 0.2240329047799054, -0.14498157898373337, -0.08869265173350206, 0.35379432030304364, -0.11286803391262903, -0.16741422417037416, 0.18619686367773366, -0.18706875072199514, -0.013821574869904329, 0.14880062169818717, 0.17490451865226284, 0.1310291284074386, -0.11111373678134194, 0.03858686556685081, 0.008448303451366497, 0.21079828997696468, 0.11724097913512113, 0.05649295495117478, 0.22663440004654342, 0.2232847371558433, 0.05079085722734982, 0.20536133533195508, -0.13836111129564937, -0.03639066535811942, -0.24536428053044912, -0.16830175864919455, -0.17478766407403976, 0.056017091335723475, -0.12098976806682361, -0.17351230195102593, 0.39683514706451783, 0.15911441805038715, 0.17088536989423586, -0.04667667958137551, 0.2727493104810657, 0.12164919719339884, 0.07879933508494022, 0.02771133884512396, 0.34593236728599575, 0.1399592207268473, 0.062257541129259734, -0.2771715705501706, 0.09621638668150725, -0.00028587240111929447] |
1,802.06584 | High precision wavefront control in point spread function engineering
for single emitter localization | Point Spread Function (PSF) engineering is used in single emitter
localization to measure the emitter position in 3D and possibly other
parameters such as the emission color or dipole orientation as well. Advanced
PSF models such as spline fits to experimental PSFs or the vectorial PSF model
can be used in the corresponding localization algorithms in order to model the
intricate spot shape and deformations correctly. The complexity of the optical
architecture and fit model makes PSF engineering approaches particularly
sensitive to optical aberrations. Here, we present a calibration and alignment
protocol for fluorescence microscopes equipped with a spatial light modulator
(SLM) with the goal of establishing a wavefront error well below the
diffraction limit for optimum application of complex engineered PSFs. We
achieve high-precision wavefront control, to a level below 20 m$\lambda$
wavefront aberration over a 30 minute time window after the calibration
procedure, using a separate light path for calibrating the pixel-to-pixel
variations of the SLM, and alignment of the SLM with respect to the optical
axis and Fourier plane within 3 $\mu$m ($x/y$) and 100 $\mu$m ($z$) error.
Aberrations are retrieved from a fit of the vectorial PSF model to a bead
$z$-stack and compensated with a residual wavefront error comparable to the
error of the SLM calibration step. This well-calibrated and corrected setup
makes it possible to create complex `3D+$\lambda$' PSFs that fit very well to
the vectorial PSF model. Proof-of-principle bead experiments show precisions
below 10~nm in $x$, $y$, and $\lambda$, and below 20~nm in $z$ over an axial
range of 1 $\mu$m with 2000 signal photons and 12 background photons.
| physics.optics | point spread function psf engineering is used in single emitter localization to measure the emitter position in 3d and possibly other parameters such as the emission color or dipole orientation as well advanced psf models such as spline fits to experimental psfs or the vectorial psf model can be used in the corresponding localization algorithms in order to model the intricate spot shape and deformations correctly the complexity of the optical architecture and fit model makes psf engineering approaches particularly sensitive to optical aberrations here we present a calibration and alignment protocol for fluorescence microscopes equipped with a spatial light modulator slm with the goal of establishing a wavefront error well below the diffraction limit for optimum application of complex engineered psfs we achieve highprecision wavefront control to a level below 20 mlambda wavefront aberration over a 30 minute time window after the calibration procedure using a separate light path for calibrating the pixeltopixel variations of the slm and alignment of the slm with respect to the optical axis and fourier plane within 3 mum xy and 100 mum z error aberrations are retrieved from a fit of the vectorial psf model to a bead zstack and compensated with a residual wavefront error comparable to the error of the slm calibration step this wellcalibrated and corrected setup makes it possible to create complex 3dlambda psfs that fit very well to the vectorial psf model proofofprinciple bead experiments show precisions below 10nm in x y and lambda and below 20nm in z over an axial range of 1 mum with 2000 signal photons and 12 background photons | [['point', 'spread', 'function', 'psf', 'engineering', 'is', 'used', 'in', 'single', 'emitter', 'localization', 'to', 'measure', 'the', 'emitter', 'position', 'in', '3d', 'and', 'possibly', 'other', 'parameters', 'such', 'as', 'the', 'emission', 'color', 'or', 'dipole', 'orientation', 'as', 'well', 'advanced', 'psf', 'models', 'such', 'as', 'spline', 'fits', 'to', 'experimental', 'psfs', 'or', 'the', 'vectorial', 'psf', 'model', 'can', 'be', 'used', 'in', 'the', 'corresponding', 'localization', 'algorithms', 'in', 'order', 'to', 'model', 'the', 'intricate', 'spot', 'shape', 'and', 'deformations', 'correctly', 'the', 'complexity', 'of', 'the', 'optical', 'architecture', 'and', 'fit', 'model', 'makes', 'psf', 'engineering', 'approaches', 'particularly', 'sensitive', 'to', 'optical', 'aberrations', 'here', 'we', 'present', 'a', 'calibration', 'and', 'alignment', 'protocol', 'for', 'fluorescence', 'microscopes', 'equipped', 'with', 'a', 'spatial', 'light', 'modulator', 'slm', 'with', 'the', 'goal', 'of', 'establishing', 'a', 'wavefront', 'error', 'well', 'below', 'the', 'diffraction', 'limit', 'for', 'optimum', 'application', 'of', 'complex', 'engineered', 'psfs', 'we', 'achieve', 'highprecision', 'wavefront', 'control', 'to', 'a', 'level', 'below', '20', 'mlambda', 'wavefront', 'aberration', 'over', 'a', '30', 'minute', 'time', 'window', 'after', 'the', 'calibration', 'procedure', 'using', 'a', 'separate', 'light', 'path', 'for', 'calibrating', 'the', 'pixeltopixel', 'variations', 'of', 'the', 'slm', 'and', 'alignment', 'of', 'the', 'slm', 'with', 'respect', 'to', 'the', 'optical', 'axis', 'and', 'fourier', 'plane', 'within', '3', 'mum', 'xy', 'and', '100', 'mum', 'z', 'error', 'aberrations', 'are', 'retrieved', 'from', 'a', 'fit', 'of', 'the', 'vectorial', 'psf', 'model', 'to', 'a', 'bead', 'zstack', 'and', 'compensated', 'with', 'a', 'residual', 'wavefront', 'error', 'comparable', 'to', 'the', 'error', 'of', 'the', 'slm', 'calibration', 'step', 'this', 'wellcalibrated', 'and', 'corrected', 'setup', 'makes', 'it', 'possible', 'to', 'create', 'complex', '3dlambda', 'psfs', 'that', 'fit', 'very', 'well', 'to', 'the', 'vectorial', 'psf', 'model', 'proofofprinciple', 'bead', 'experiments', 'show', 'precisions', 'below', '10nm', 'in', 'x', 'y', 'and', 'lambda', 'and', 'below', '20nm', 'in', 'z', 'over', 'an', 'axial', 'range', 'of', '1', 'mum', 'with', '2000', 'signal', 'photons', 'and', '12', 'background', 'photons']] | [-0.03704536712359426, 0.08743577548374097, -0.07098865730266245, 0.0699774357424346, -0.0328500072691449, -0.175376266240195, 0.033365438054403604, 0.508297279870735, -0.27368535981074255, -0.3530245842194659, 0.08254209318602422, -0.2733383602620858, -0.0884474057396698, 0.20856737169823697, -0.08700422453869766, 0.11478966797442826, 0.04035934210877936, -0.06006051035123473, -0.07614366089296966, -0.18636069627795018, 0.21129190208530932, 0.09035341114086926, 0.24914549407373482, -0.016603196375423446, 0.13621684356662883, 0.06366724517846585, -0.0264753576438382, -0.016919789927185708, -0.10478506030194694, 0.08664815561903008, 0.22257329561405229, 0.052060752662935486, 0.1831564552906268, -0.34238945875527727, -0.21090548983423638, 0.07218484645533674, 0.1630883192357976, 0.09423558403439117, -0.014172196340250765, -0.27479822686082633, 0.04118339516492099, -0.08951651951614416, -0.16941903120715102, -0.032374119370262015, -0.02066221522905354, 0.044553746892807056, -0.2946322566043269, 0.04249746350940528, 0.020208483124327548, 0.10968153655599311, -0.023867557396374223, -0.10432982899035538, -0.016570104071694725, 0.11128195428359762, -0.04645201044359227, 0.12272708326290396, 0.17407440318251555, -0.14175393680760742, -0.059904889448299865, 0.39824815789624207, -0.07658357976052804, -0.17425887727020484, 0.09120247560742153, -0.16610292408896504, -0.02024245295533032, 0.19657500295302358, 0.17354520049895036, 0.0701436967009081, -0.13072043809477452, 0.012208046583142482, 0.057665279811195465, 0.2856727806153874, 0.10172435062462991, 0.06939108030659691, 0.19976625092503866, 0.1884575163558969, 0.06880621377484135, 0.10300756162537683, -0.2502931779777666, -0.021753814229785624, -0.30514451848180474, -0.09859057068473326, -0.1629558018167099, 0.023227063301107232, -0.12691917834596989, -0.1445792316828134, 0.3903266529886509, 0.18272449922449183, 0.17151825704682128, 0.05084465962070269, 0.3674757958020804, 0.06196142820386603, 0.11586723579137745, -0.01772391193300345, 0.2629374381659974, 0.13147103742164787, 0.08012485136321904, -0.1748120622507314, 0.010837248571322494, -0.011311998233234264] |
1,802.06585 | Strong Convexity in Stochastic Programs with Deviation Risk Measures | We give sufficient conditions for the expected excess and the upper
semideviation of recourse functions to be strongly convex. This is done in the
setting of two-stage stochastic programs with complete linear recourse and
random right-hand side. This work extends results on strong convexity of
risk-neutral models.
| math.OC | we give sufficient conditions for the expected excess and the upper semideviation of recourse functions to be strongly convex this is done in the setting of twostage stochastic programs with complete linear recourse and random righthand side this work extends results on strong convexity of riskneutral models | [['we', 'give', 'sufficient', 'conditions', 'for', 'the', 'expected', 'excess', 'and', 'the', 'upper', 'semideviation', 'of', 'recourse', 'functions', 'to', 'be', 'strongly', 'convex', 'this', 'is', 'done', 'in', 'the', 'setting', 'of', 'twostage', 'stochastic', 'programs', 'with', 'complete', 'linear', 'recourse', 'and', 'random', 'righthand', 'side', 'this', 'work', 'extends', 'results', 'on', 'strong', 'convexity', 'of', 'riskneutral', 'models']] | [-0.08807872879774646, 0.025055879439683036, -0.10795349731763944, 0.1092189192410281, -0.1440308336911604, -0.1588944612427595, 0.07687419614298864, 0.35950578465819993, -0.26825622103593133, -0.23441911481836059, 0.14879831871602367, -0.23007271891618344, -0.1185300753035761, 0.16008076277819086, -0.12773207404670564, 0.07619458936313366, 0.03801081646630104, -0.009522088149443586, -0.071763800486843, -0.30855753357482557, 0.3162635270743928, 0.04551044304637199, 0.20354421405082054, 0.092772684317637, 0.08643306750170093, 0.06701783709069516, -0.027359625686237468, 0.05935983096269217, -0.1552616932944573, 0.14117456732833006, 0.22638175972748828, 0.13915813578530511, 0.30040581881048833, -0.46893716399419183, -0.16688185534935365, 0.1565046271388518, 0.021028927516841153, 0.05885679187609794, -0.017284763117439726, -0.25332406229101756, 0.058822069435994676, -0.09773285861345048, -0.11534143232324338, -0.04061257702476801, -0.08950203095384418, 0.04714782031728549, -0.3739095058371412, 0.07811431994939104, 0.14938226082619835, 0.06576392559292528, -0.0791069946271625, -0.13509058167642735, 0.0300309754650485, 0.016370546112352228, 0.03729475905345951, 0.02120049912581577, 0.07575417716710016, -0.07626797939512006, -0.14240027971050523, 0.33168722990345445, -0.0986501428873298, -0.2405652606740911, 0.20093930235251467, -0.1537110150018905, -0.1575360282651208, 0.1292286066615835, 0.2053987016267282, 0.18491702764592272, -0.18070009334924372, 0.15844263203016065, -0.08900752485274001, 0.12380847728196928, 0.04134534416284333, 0.037575850193884146, 0.13721011428439872, 0.10673933425680437, 0.17715140770962265, 0.20168224011022756, 0.02641028568162236, -0.11106043942569893, -0.3473971568127262, -0.08331373993782921, -0.13718637318766497, 0.04192689539706136, -0.0966815503724068, -0.1510406130568144, 0.3188958394618586, 0.12342959454164226, 0.18776913954222457, 0.16391156473137597, 0.29830494665719093, 0.20521893314992454, -0.00048253728829799816, 0.07022409893057131, 0.1996818730567998, 0.1516455449758375, 0.0668821816055223, -0.18842318129943722, 0.13738046176335278, 0.05388869196572836] |
1,802.06586 | On the Cauchy problem for the Zakharov-Rubenchik/Benney-Roskes system | We address various issues concerning the Cauchy problem for the
Zakharov-Rubenchik system (known as the Benney-Roskes system in water waves
theory), which models the interaction of short and long waves in many physical
situations. Motivated by the transverse stability/instability of the
one-dimensional solitary wave (line solitary), we study the Cauchy problem in
the background of a line solitary wave.
| math.AP | we address various issues concerning the cauchy problem for the zakharovrubenchik system known as the benneyroskes system in water waves theory which models the interaction of short and long waves in many physical situations motivated by the transverse stabilityinstability of the onedimensional solitary wave line solitary we study the cauchy problem in the background of a line solitary wave | [['we', 'address', 'various', 'issues', 'concerning', 'the', 'cauchy', 'problem', 'for', 'the', 'zakharovrubenchik', 'system', 'known', 'as', 'the', 'benneyroskes', 'system', 'in', 'water', 'waves', 'theory', 'which', 'models', 'the', 'interaction', 'of', 'short', 'and', 'long', 'waves', 'in', 'many', 'physical', 'situations', 'motivated', 'by', 'the', 'transverse', 'stabilityinstability', 'of', 'the', 'onedimensional', 'solitary', 'wave', 'line', 'solitary', 'we', 'study', 'the', 'cauchy', 'problem', 'in', 'the', 'background', 'of', 'a', 'line', 'solitary', 'wave']] | [-0.23515207388258555, 0.08887157667624324, -0.022646896688169556, 0.13688426316111235, -0.04494273466499228, -0.06484371329772107, -0.046852275674035285, 0.3075341967571723, -0.2820580021331185, -0.21138215050705822, 0.15103541323792583, -0.27897793018634903, -0.1841076641555941, 0.19522921963219056, 0.04516222661263064, 0.15885218376653237, 0.06069429630511686, -0.01036062546629916, -0.02929449363881232, -0.13512878907484965, 0.3972188684550163, 0.019152707534662465, 0.2518338195718171, 0.08195096370355602, 0.08153941031349332, 0.0442598000936733, -0.001231967528726448, 0.000588802130598771, -0.13784501362559304, 0.03989010203319291, 0.2708992968401346, 0.11114331276008957, 0.281451027693325, -0.4947258743800615, -0.32484152607554406, 0.08111998999466825, 0.1661721170969765, 0.18199096915614382, -0.00914640950137063, -0.3525771119125318, -0.010323407831029934, -0.13274636903875753, -0.23617541334967604, 0.06381967185440947, 0.05458839955788694, 0.140569386248101, -0.14627905573957323, 0.1036227155096927, 0.08399058499357157, 0.0025017591062606427, -0.1507066285008924, -0.03867700367169291, -0.0005878668641998319, 0.04490984545759203, 0.1587966635757894, -0.013954467601714688, 0.006724278385375152, -0.19358587975760824, -0.08636540773155152, 0.4192749336361885, -0.06924730897962786, -0.22160229825398378, 0.19721583798200937, -0.1218299027695729, -0.09212555937272937, 0.16845681992147052, 0.2278490816161298, 0.13813092662511686, -0.11891558473897085, 0.0573534665275937, -0.08976944486902651, 0.14069687751103438, 0.14323496807105185, 0.022091691349551343, 0.25863459882767575, 0.17401645420805403, 0.04594070795952065, 0.13266785478774915, -0.06652012300726615, -0.06907535046992595, -0.2996936879659954, -0.12716199813835455, -0.1285617842682098, 0.016570230824934123, -0.01980371318993428, -0.2139077444577165, 0.45095393470112694, 0.1653663633358583, 0.15090938175521923, 0.009203300143494025, 0.23536415106469863, 0.13178361742348785, -0.07056414167674487, 0.041310508441376056, 0.22976078038316286, 0.16574098503527543, 0.18301865179500168, -0.23296544468847283, -0.019501957944349238, 0.06701876064599083] |
1,802.06587 | Real holomorphic sections of the Deligne-Hitchin twistor space | We study the holomorphic sections of the Deligne-Hitchin moduli space of a
compact Riemann surface that are invariant under the natural anti-holomorphic
involutions of the moduli space. Their relationships with the harmonic maps are
established. As a bi-product, a question of Simpson on such sections, posed in
\cite{Si2}, is answered.
| math.DG math.AG | we study the holomorphic sections of the delignehitchin moduli space of a compact riemann surface that are invariant under the natural antiholomorphic involutions of the moduli space their relationships with the harmonic maps are established as a biproduct a question of simpson on such sections posed in citesi2 is answered | [['we', 'study', 'the', 'holomorphic', 'sections', 'of', 'the', 'delignehitchin', 'moduli', 'space', 'of', 'a', 'compact', 'riemann', 'surface', 'that', 'are', 'invariant', 'under', 'the', 'natural', 'antiholomorphic', 'involutions', 'of', 'the', 'moduli', 'space', 'their', 'relationships', 'with', 'the', 'harmonic', 'maps', 'are', 'established', 'as', 'a', 'biproduct', 'a', 'question', 'of', 'simpson', 'on', 'such', 'sections', 'posed', 'in', 'citesi2', 'is', 'answered']] | [-0.20288726260020798, 0.11027651928289205, -0.06652641167141954, 0.15706132620582547, -0.09322373371343223, -0.05666389260250999, 0.006774772129648802, 0.37174894371811223, -0.3004055117466012, -0.19951623480538933, 0.11253832730854273, -0.26183463948569735, -0.17852451701705552, 0.25416081132633345, -0.12596988078320817, 0.07633042388728686, 0.011636903808851327, 0.029677951252278015, -0.11799358709107097, -0.3373895875316075, 0.508979317333017, -0.02770191566942602, 0.17430381168972472, 0.08479457737626128, 0.13027264185401857, -0.027055116522372986, -0.07498917712506895, -0.040242369401943395, -0.15391713522011724, 0.20190030874266307, 0.2918963813203938, 0.07571937751062975, 0.1539378636041466, -0.3470962145270742, -0.18241076657966693, 0.16285350966286294, 0.06382460040705544, -0.04967830923138833, 0.014291940910304536, -0.3021087877984558, 0.049481032520760686, -0.04274577436474513, -0.13488192162571513, -0.11145416717520173, 0.06790032893495292, 0.01207473877418254, -0.1648738385767353, -0.011186426619485932, 0.08620453264792355, 0.1301323466421086, -0.11416719751242473, -0.06993587092705528, -0.1465256782438682, 0.09872220543080143, 0.05447330253141723, 0.09245961078214554, 0.10459086809269323, -0.09128981965536974, -0.09988654932311299, 0.39564747912619186, -0.11294179010604109, -0.29947133723418323, 0.12711789135878182, -0.13503688015043736, -0.1453468416418348, 0.09031120144134881, 0.13269058356479724, 0.19683380945756726, -0.04276267796450732, 0.2211700259346743, -0.16231567355595072, 0.06451159652455576, 0.16554572767749123, -0.027216131542334144, 0.16972660068042425, 0.1597645678272357, 0.0680474044222917, 0.10175731589029334, -0.012905134890722682, -0.02791118742517975, -0.3898523982842358, -0.24932621923104234, -0.08338961568756068, 0.13658655229100616, -0.058786898252687285, -0.19681596358743858, 0.3675096395938676, -0.021920885377544528, 0.2842068171166644, 0.09650975638734442, 0.182465419933504, 0.0573331010551667, 0.03533155413591588, -0.0034939317051701398, 0.15675481233973892, 0.2075607415136634, 0.005369745888652242, -0.1215149002928971, -0.011075300174024033, 0.2042131627510701] |
1,802.06588 | A Machine Learning Approach to Air Traffic Route Choice Modelling | Air Traffic Flow and Capacity Management (ATFCM) is one of the constituent
parts of Air Traffic Management (ATM). The goal of ATFCM is to make airport and
airspace capacity meet traffic demand and, when capacity opportunities are
exhausted, optimise traffic flows to meet the available capacity. One of the
key enablers of ATFCM is the accurate estimation of future traffic demand. The
available information (schedules, flight plans, etc.) and its associated level
of uncertainty differ across the different ATFCM planning phases, leading to
qualitative differences between the types of forecasting that are feasible at
each time horizon. While abundant research has been conducted on tactical
trajectory prediction (i.e., during the day of operations), trajectory
prediction in the pre-tactical phase, when few or no flight plans are
available, has received much less attention. As a consequence, the methods
currently in use for pre-tactical traffic forecast are still rather
rudimentary, often resulting in suboptimal ATFCM decision making. This paper
proposes a machine learning approach for the prediction of airlines route
choices between two airports as a function of route characteristics, such as
flight efficiency, air navigation charges and expected level of congestion.
Different predictive models based on multinomial logistic regression and
decision trees are formulated and calibrated with historical traffic data, and
a critical evaluation of each model is conducted. We analyse the predictive
power of each model in terms of its ability to forecast traffic volumes at the
level of charging zones, proving significant potential to enhance pre-tactical
traffic forecast. We conclude by discussing the limitations and room for
improvement of the proposed approach, as well as the future developments
required to produce reliable traffic forecasts at a higher spatial and temporal
resolution.
| cs.AI | air traffic flow and capacity management atfcm is one of the constituent parts of air traffic management atm the goal of atfcm is to make airport and airspace capacity meet traffic demand and when capacity opportunities are exhausted optimise traffic flows to meet the available capacity one of the key enablers of atfcm is the accurate estimation of future traffic demand the available information schedules flight plans etc and its associated level of uncertainty differ across the different atfcm planning phases leading to qualitative differences between the types of forecasting that are feasible at each time horizon while abundant research has been conducted on tactical trajectory prediction ie during the day of operations trajectory prediction in the pretactical phase when few or no flight plans are available has received much less attention as a consequence the methods currently in use for pretactical traffic forecast are still rather rudimentary often resulting in suboptimal atfcm decision making this paper proposes a machine learning approach for the prediction of airlines route choices between two airports as a function of route characteristics such as flight efficiency air navigation charges and expected level of congestion different predictive models based on multinomial logistic regression and decision trees are formulated and calibrated with historical traffic data and a critical evaluation of each model is conducted we analyse the predictive power of each model in terms of its ability to forecast traffic volumes at the level of charging zones proving significant potential to enhance pretactical traffic forecast we conclude by discussing the limitations and room for improvement of the proposed approach as well as the future developments required to produce reliable traffic forecasts at a higher spatial and temporal resolution | [['air', 'traffic', 'flow', 'and', 'capacity', 'management', 'atfcm', 'is', 'one', 'of', 'the', 'constituent', 'parts', 'of', 'air', 'traffic', 'management', 'atm', 'the', 'goal', 'of', 'atfcm', 'is', 'to', 'make', 'airport', 'and', 'airspace', 'capacity', 'meet', 'traffic', 'demand', 'and', 'when', 'capacity', 'opportunities', 'are', 'exhausted', 'optimise', 'traffic', 'flows', 'to', 'meet', 'the', 'available', 'capacity', 'one', 'of', 'the', 'key', 'enablers', 'of', 'atfcm', 'is', 'the', 'accurate', 'estimation', 'of', 'future', 'traffic', 'demand', 'the', 'available', 'information', 'schedules', 'flight', 'plans', 'etc', 'and', 'its', 'associated', 'level', 'of', 'uncertainty', 'differ', 'across', 'the', 'different', 'atfcm', 'planning', 'phases', 'leading', 'to', 'qualitative', 'differences', 'between', 'the', 'types', 'of', 'forecasting', 'that', 'are', 'feasible', 'at', 'each', 'time', 'horizon', 'while', 'abundant', 'research', 'has', 'been', 'conducted', 'on', 'tactical', 'trajectory', 'prediction', 'ie', 'during', 'the', 'day', 'of', 'operations', 'trajectory', 'prediction', 'in', 'the', 'pretactical', 'phase', 'when', 'few', 'or', 'no', 'flight', 'plans', 'are', 'available', 'has', 'received', 'much', 'less', 'attention', 'as', 'a', 'consequence', 'the', 'methods', 'currently', 'in', 'use', 'for', 'pretactical', 'traffic', 'forecast', 'are', 'still', 'rather', 'rudimentary', 'often', 'resulting', 'in', 'suboptimal', 'atfcm', 'decision', 'making', 'this', 'paper', 'proposes', 'a', 'machine', 'learning', 'approach', 'for', 'the', 'prediction', 'of', 'airlines', 'route', 'choices', 'between', 'two', 'airports', 'as', 'a', 'function', 'of', 'route', 'characteristics', 'such', 'as', 'flight', 'efficiency', 'air', 'navigation', 'charges', 'and', 'expected', 'level', 'of', 'congestion', 'different', 'predictive', 'models', 'based', 'on', 'multinomial', 'logistic', 'regression', 'and', 'decision', 'trees', 'are', 'formulated', 'and', 'calibrated', 'with', 'historical', 'traffic', 'data', 'and', 'a', 'critical', 'evaluation', 'of', 'each', 'model', 'is', 'conducted', 'we', 'analyse', 'the', 'predictive', 'power', 'of', 'each', 'model', 'in', 'terms', 'of', 'its', 'ability', 'to', 'forecast', 'traffic', 'volumes', 'at', 'the', 'level', 'of', 'charging', 'zones', 'proving', 'significant', 'potential', 'to', 'enhance', 'pretactical', 'traffic', 'forecast', 'we', 'conclude', 'by', 'discussing', 'the', 'limitations', 'and', 'room', 'for', 'improvement', 'of', 'the', 'proposed', 'approach', 'as', 'well', 'as', 'the', 'future', 'developments', 'required', 'to', 'produce', 'reliable', 'traffic', 'forecasts', 'at', 'a', 'higher', 'spatial', 'and', 'temporal', 'resolution']] | [-0.10851023397540528, 0.0949541715251163, -0.04996886510870102, 0.06248232710475749, -0.07344698085464497, -0.15924418476700836, 0.11955922548469249, 0.4052318697663169, -0.24165795583621408, -0.3345626967377855, 0.16797051203929644, -0.30861148980309105, -0.11039424567906093, 0.21602967999799585, -0.13550610889322356, 0.12310440581954904, 0.08927070454889181, 0.05729670763834783, -0.020234542106218795, -0.2515320494384604, 0.22868962766576215, 0.10310441823692741, 0.3658893224634626, 0.07780843029865427, 0.11143034051258302, -0.02136067037490454, -0.06747404752127456, -0.011789064647973323, -0.07264196012881341, 0.1364466702057369, 0.33326460405291114, 0.18618755768992812, 0.3056202005654415, -0.4513567683967293, -0.2571492528729471, 0.12110559174713369, 0.09440398935008966, 0.033077159923739094, 0.005961356875288518, -0.2613107205008599, 0.05878739973450912, -0.21489319793842007, -0.08843600384210705, -0.07207552427822288, -0.010445351226929021, 0.0346180852574828, -0.26062271061042946, 0.027189159640342207, -0.029758708419010755, 0.08555246548188837, -0.041221826897062205, -0.11083143070201448, -0.05344972641418642, 0.2194974970104295, 0.08162804033379367, -0.005473640125351364, 0.1470870834701787, -0.15891754448476597, -0.13229978259042705, 0.4207837322697123, 0.007722796415678946, -0.14653514401495113, 0.16053427177306318, -0.07604938424247068, -0.12232945004233707, 0.11899635070781735, 0.2501442557488112, 0.04614816872210652, -0.17792691109119502, -0.036800831505543294, 0.03950234930566017, 0.13267690321622114, 0.06383120945608574, 0.002233631837475675, 0.22097925447977762, 0.27007275406215075, 0.1387071624771421, 0.08842373223758983, -0.10220946020348466, -0.12852145296336542, -0.23812462319661234, -0.12008576332429442, -0.12206318789221188, -0.02144136639965817, -0.09520657739140909, -0.1031639483569071, 0.3854499362121792, 0.21075768016835225, 0.14024488781355915, 0.08901228276603601, 0.3759581884435305, 0.06773307592507306, 0.03664724654039196, 0.10091388218454911, 0.16487394226054455, 0.0032559999443115073, 0.17578065052301564, -0.1875247405462152, 0.1451407623236193, -0.003363926852855118] |
1,802.06589 | Constraints on $\gamma$-CDM interactions matching the Planck data
precision | The Planck experiment has measured the Cosmic Microwave Background (CMB)
angular spectrum with unprecedented accuracy, and these results are likely to
remain the state-of-the art for a decade or more. Since these measurements are
going to be used to forecast Euclid's ability to test alternative dark matter
models, we aim to set the final CMB constraint on the cross section of dark
matter-photon scattering in the early universe. As the formalism has not been
published in the literature yet, we present the key steps to derive the full
set of linearized Einstein and Boltzmann equations and elucidate necessary
modifications to the line of sight and the tight coupling approximation. These
approximation schemes are commonly used in Boltzmann codes to reduce
computational costs, but the tight coupling regime has been neglected in
previous works related to dark matter-photon interactions. Our computations
account for a dark matter sound speed, which was neglected in previous work. We
find that its effect is negligible on the CMB spectra but fairly important on
the linear matter power spectrum. We then analyze the Planck data, with and
without the 2015 polarization data at high multipoles. In both cases our
constraint on the ratio of the elastic scattering cross section to the dark
matter mass becomes more stringent with respect to previous constraints. The
change is about 35\% when the full Planck dataset is added (which includes
E-mode polarization at high multipoles and the lensing potential power
spectrum) and about 20\%. when we only account for the polarization data at low
multipoles and the full temperature spectrum. Our most conservative limit reads
as $\sigma_{\mathrm{DM}-\gamma} \leq 2.25\times
10^{-6}\,\sigma_\mathrm{Th}\left(m_\mathrm{DM}/\mathrm{GeV}\right)$ at 95\%
confidence. We do not expect this limit to change by adding the recently
published SPT data.
| astro-ph.CO | the planck experiment has measured the cosmic microwave background cmb angular spectrum with unprecedented accuracy and these results are likely to remain the stateofthe art for a decade or more since these measurements are going to be used to forecast euclids ability to test alternative dark matter models we aim to set the final cmb constraint on the cross section of dark matterphoton scattering in the early universe as the formalism has not been published in the literature yet we present the key steps to derive the full set of linearized einstein and boltzmann equations and elucidate necessary modifications to the line of sight and the tight coupling approximation these approximation schemes are commonly used in boltzmann codes to reduce computational costs but the tight coupling regime has been neglected in previous works related to dark matterphoton interactions our computations account for a dark matter sound speed which was neglected in previous work we find that its effect is negligible on the cmb spectra but fairly important on the linear matter power spectrum we then analyze the planck data with and without the 2015 polarization data at high multipoles in both cases our constraint on the ratio of the elastic scattering cross section to the dark matter mass becomes more stringent with respect to previous constraints the change is about 35 when the full planck dataset is added which includes emode polarization at high multipoles and the lensing potential power spectrum and about 20 when we only account for the polarization data at low multipoles and the full temperature spectrum our most conservative limit reads as sigma_mathrmdmgamma leq 225times 106sigma_mathrmthleftm_mathrmdmmathrmgevright at 95 confidence we do not expect this limit to change by adding the recently published spt data | [['the', 'planck', 'experiment', 'has', 'measured', 'the', 'cosmic', 'microwave', 'background', 'cmb', 'angular', 'spectrum', 'with', 'unprecedented', 'accuracy', 'and', 'these', 'results', 'are', 'likely', 'to', 'remain', 'the', 'stateofthe', 'art', 'for', 'a', 'decade', 'or', 'more', 'since', 'these', 'measurements', 'are', 'going', 'to', 'be', 'used', 'to', 'forecast', 'euclids', 'ability', 'to', 'test', 'alternative', 'dark', 'matter', 'models', 'we', 'aim', 'to', 'set', 'the', 'final', 'cmb', 'constraint', 'on', 'the', 'cross', 'section', 'of', 'dark', 'matterphoton', 'scattering', 'in', 'the', 'early', 'universe', 'as', 'the', 'formalism', 'has', 'not', 'been', 'published', 'in', 'the', 'literature', 'yet', 'we', 'present', 'the', 'key', 'steps', 'to', 'derive', 'the', 'full', 'set', 'of', 'linearized', 'einstein', 'and', 'boltzmann', 'equations', 'and', 'elucidate', 'necessary', 'modifications', 'to', 'the', 'line', 'of', 'sight', 'and', 'the', 'tight', 'coupling', 'approximation', 'these', 'approximation', 'schemes', 'are', 'commonly', 'used', 'in', 'boltzmann', 'codes', 'to', 'reduce', 'computational', 'costs', 'but', 'the', 'tight', 'coupling', 'regime', 'has', 'been', 'neglected', 'in', 'previous', 'works', 'related', 'to', 'dark', 'matterphoton', 'interactions', 'our', 'computations', 'account', 'for', 'a', 'dark', 'matter', 'sound', 'speed', 'which', 'was', 'neglected', 'in', 'previous', 'work', 'we', 'find', 'that', 'its', 'effect', 'is', 'negligible', 'on', 'the', 'cmb', 'spectra', 'but', 'fairly', 'important', 'on', 'the', 'linear', 'matter', 'power', 'spectrum', 'we', 'then', 'analyze', 'the', 'planck', 'data', 'with', 'and', 'without', 'the', '2015', 'polarization', 'data', 'at', 'high', 'multipoles', 'in', 'both', 'cases', 'our', 'constraint', 'on', 'the', 'ratio', 'of', 'the', 'elastic', 'scattering', 'cross', 'section', 'to', 'the', 'dark', 'matter', 'mass', 'becomes', 'more', 'stringent', 'with', 'respect', 'to', 'previous', 'constraints', 'the', 'change', 'is', 'about', '35', 'when', 'the', 'full', 'planck', 'dataset', 'is', 'added', 'which', 'includes', 'emode', 'polarization', 'at', 'high', 'multipoles', 'and', 'the', 'lensing', 'potential', 'power', 'spectrum', 'and', 'about', '20', 'when', 'we', 'only', 'account', 'for', 'the', 'polarization', 'data', 'at', 'low', 'multipoles', 'and', 'the', 'full', 'temperature', 'spectrum', 'our', 'most', 'conservative', 'limit', 'reads', 'as', 'sigma_mathrmdmgamma', 'leq', '225times', '106sigma_mathrmthleftm_mathrmdmmathrmgevright', 'at', '95', 'confidence', 'we', 'do', 'not', 'expect', 'this', 'limit', 'to', 'change', 'by', 'adding', 'the', 'recently', 'published', 'spt', 'data']] | [-0.09590075959913902, 0.08039390639128437, -0.08040164430870779, 0.11149473661488456, -0.10447816700931847, -0.09553000146777114, 0.012583251347296409, 0.3412903761816817, -0.2123096515070419, -0.3688623349964244, 0.06618363357074168, -0.32917967508058554, -0.018695516793881185, 0.19045388350919398, 0.009109064405849139, 0.07394866802476484, 0.036213592294004414, 0.009718915730083062, -0.03478570884399741, -0.30544741602184683, 0.2845159687600066, 0.16848311242093886, 0.27883128286257935, 0.07398935112128542, 0.07531442957233403, -0.023635842785291322, -0.06935738482173871, 0.009247379868834064, -0.15097480915724223, 0.07040130950907779, 0.23897942501972066, 0.10285257320961805, 0.17443956837295782, -0.42004237411840056, -0.21227720747835133, 0.12404719526127267, 0.133329165303246, 0.16282289575417427, -0.0053638118353608825, -0.2581591017803151, 0.061965510266132076, -0.16283475312280593, -0.08253248621566364, -0.0881765726115229, 0.009098505327751586, -0.03779156871426564, -0.2338393212970138, 0.11289677631852406, 0.021712418512109068, -0.0014420577334695972, -0.06220166887591391, -0.15295270426928267, -0.014642172401862127, 0.06200447741597142, 0.057506978843120775, 0.03915662465737547, 0.1261851362056926, -0.12762054656729935, -0.05235785566851614, 0.4113035722134205, -0.11863300493117292, -0.15188072551647527, 0.1559753329525669, -0.18800701364513384, -0.17027806465585643, 0.12622242458767122, 0.180173996101635, 0.04977568363041415, -0.1493291058476853, 0.10631943223649926, 0.013952686253957894, 0.20524489548272237, 0.07572754538924127, 0.043746118579496195, 0.24693741900944052, 0.1321116624480615, 0.04966377976417242, 0.057321286229481856, -0.11811060969346573, -0.03866412853203401, -0.29251103956981767, -0.06158747337881927, -0.1560709515103738, 0.029768042827380815, -0.07616146932106947, -0.09889431327412074, 0.350755640675177, 0.1760606738523795, 0.19457884167237174, 0.07403346919047588, 0.37106777992835466, 0.10723469967856576, 0.067849607022896, 0.05913076953077831, 0.348428213383133, 0.13722670946507942, 0.12254889179517717, -0.19440342214648854, 0.023088212528793544, -0.03352649201965855] |
1,802.0659 | Geomagnetic storm forecasting service StormFocus: 5 years online | Forecasting geomagnetic storms is highly important for many space weather
applications. In this study we review performance of the geomagnetic storm
forecasting service StormFocus during 2011--2016. The service was implemented
in 2011 at SpaceWeather.Ru and predicts the expected strength of geomagnetic
storms as measured by $Dst$ index several hours ahead. The forecast is based on
L1 solar wind and IMF measurements and is updated every hour. The solar maximum
of cycle 24 is weak, so most of the statistics are on rather moderate storms.
We verify quality of selection criteria, as well as reliability of real-time
input data in comparison with the final values, available in archives. In
real-time operation 87% of storms were correctly predicted while the reanalysis
running on final OMNI data predicts successfully 97% of storms. Thus the main
reasons for prediction errors are discrepancies between real-time and final
data (Dst, solar wind and IMF) due to processing errors, specifics of datasets.
| physics.space-ph | forecasting geomagnetic storms is highly important for many space weather applications in this study we review performance of the geomagnetic storm forecasting service stormfocus during 20112016 the service was implemented in 2011 at spaceweatherru and predicts the expected strength of geomagnetic storms as measured by dst index several hours ahead the forecast is based on l1 solar wind and imf measurements and is updated every hour the solar maximum of cycle 24 is weak so most of the statistics are on rather moderate storms we verify quality of selection criteria as well as reliability of realtime input data in comparison with the final values available in archives in realtime operation 87 of storms were correctly predicted while the reanalysis running on final omni data predicts successfully 97 of storms thus the main reasons for prediction errors are discrepancies between realtime and final data dst solar wind and imf due to processing errors specifics of datasets | [['forecasting', 'geomagnetic', 'storms', 'is', 'highly', 'important', 'for', 'many', 'space', 'weather', 'applications', 'in', 'this', 'study', 'we', 'review', 'performance', 'of', 'the', 'geomagnetic', 'storm', 'forecasting', 'service', 'stormfocus', 'during', '20112016', 'the', 'service', 'was', 'implemented', 'in', '2011', 'at', 'spaceweatherru', 'and', 'predicts', 'the', 'expected', 'strength', 'of', 'geomagnetic', 'storms', 'as', 'measured', 'by', 'dst', 'index', 'several', 'hours', 'ahead', 'the', 'forecast', 'is', 'based', 'on', 'l1', 'solar', 'wind', 'and', 'imf', 'measurements', 'and', 'is', 'updated', 'every', 'hour', 'the', 'solar', 'maximum', 'of', 'cycle', '24', 'is', 'weak', 'so', 'most', 'of', 'the', 'statistics', 'are', 'on', 'rather', 'moderate', 'storms', 'we', 'verify', 'quality', 'of', 'selection', 'criteria', 'as', 'well', 'as', 'reliability', 'of', 'realtime', 'input', 'data', 'in', 'comparison', 'with', 'the', 'final', 'values', 'available', 'in', 'archives', 'in', 'realtime', 'operation', '87', 'of', 'storms', 'were', 'correctly', 'predicted', 'while', 'the', 'reanalysis', 'running', 'on', 'final', 'omni', 'data', 'predicts', 'successfully', '97', 'of', 'storms', 'thus', 'the', 'main', 'reasons', 'for', 'prediction', 'errors', 'are', 'discrepancies', 'between', 'realtime', 'and', 'final', 'data', 'dst', 'solar', 'wind', 'and', 'imf', 'due', 'to', 'processing', 'errors', 'specifics', 'of', 'datasets']] | [-0.10531850592263677, 0.14571717740766996, -0.016166033705672114, 0.13993645555399103, -0.01050277387577237, -0.06524092889713501, 0.04785662216706554, 0.4022514159529427, -0.14623719947853922, -0.4350104750700149, 0.16155399263949055, -0.27022396538747484, -0.11519156246646947, 0.2602250483134317, -0.14334483672765821, 0.08158933397185049, 0.16032872629790185, 0.010458296125304271, -0.021212338795010426, -0.2590223941465024, 0.1700768138592442, 0.1467588755052561, 0.2829493382714348, 0.02033603799778944, 0.05659729333402699, -0.0355722915941965, -0.07769179918797188, -0.04657797202307372, -0.04081325182612085, 0.05880943206717181, 0.23536897025198913, 0.19444187909206437, 0.27386842464139455, -0.4313397514198228, -0.22849326722591726, 0.030888378963306595, 0.05229404389483891, -0.01692444331754909, 0.01500493449880285, -0.2620661741828704, 0.06044838396037983, -0.17132779402719975, -0.06182690249342057, -0.010143111076425104, 0.07432616474350391, 0.05362046579868393, -0.32931334670827866, 0.07492126725664289, -0.03943741981630987, 0.17150317606047477, -0.11238452321788893, -0.10441986696332012, -0.06989510994544557, 0.16009252755507047, 0.13150683041735023, 0.03192647407896622, 0.1633030696969108, -0.09853354601107318, -0.10667738255137711, 0.42800621695670427, -0.06990706432135958, -0.030268146452536573, 0.16056304243301936, -0.16427431201708376, -0.18589545595550946, 0.1344806011492277, 0.21364918190474605, 0.011769259717065104, -0.15376480079858618, -0.007525310658749339, 0.005651304486140706, 0.16837538885914421, 0.06337016689426758, -0.022223023394901866, 0.20649769472633944, 0.19441852650036, 0.06835747931382369, 0.08723715170107027, -0.20521027053207208, -0.05517466492445689, -0.26505546979575717, -0.09171023281769343, -0.1323915432245378, -0.005850096956790224, -0.1215782060581404, -0.14487886304961017, 0.4390997576186421, 0.23309293318710295, 0.15703789040361063, 0.012264015467295704, 0.33225513055153627, 0.08143223657157102, 0.041716432043447674, 0.1251760434353225, 0.2645050560952061, 0.07235260810885652, 0.20174332278829335, -0.15582669374770394, 0.18296951749453358, 0.045556267784311884] |
1,802.06591 | Closing the loop on multisensory interactions: A neural architecture for
multisensory causal inference and recalibration | When the brain receives input from multiple sensory systems, it is faced with
the question of whether it is appropriate to process the inputs in combination,
as if they originated from the same event, or separately, as if they originated
from distinct events. Furthermore, it must also have a mechanism through which
it can keep sensory inputs calibrated to maintain the accuracy of its internal
representations. We have developed a neural network architecture capable of i)
approximating optimal multisensory spatial integration, based on Bayesian
causal inference, and ii) recalibrating the spatial encoding of sensory
systems. The architecture is based on features of the dorsal processing
hierarchy, including the spatial tuning properties of unisensory neurons and
the convergence of different sensory inputs onto multisensory neurons.
Furthermore, we propose that these unisensory and multisensory neurons play
dual roles in i) encoding spatial location as separate or integrated estimates
and ii) accumulating evidence for the independence or relatedness of
multisensory stimuli. We further propose that top-down feedback connections
spanning the dorsal pathway play key a role in recalibrating spatial encoding
at the level of early unisensory cortices. Our proposed architecture provides
possible explanations for a number of human electrophysiological and
neuroimaging results and generates testable predictions linking neurophysiology
with behaviour.
| cs.NE q-bio.NC | when the brain receives input from multiple sensory systems it is faced with the question of whether it is appropriate to process the inputs in combination as if they originated from the same event or separately as if they originated from distinct events furthermore it must also have a mechanism through which it can keep sensory inputs calibrated to maintain the accuracy of its internal representations we have developed a neural network architecture capable of i approximating optimal multisensory spatial integration based on bayesian causal inference and ii recalibrating the spatial encoding of sensory systems the architecture is based on features of the dorsal processing hierarchy including the spatial tuning properties of unisensory neurons and the convergence of different sensory inputs onto multisensory neurons furthermore we propose that these unisensory and multisensory neurons play dual roles in i encoding spatial location as separate or integrated estimates and ii accumulating evidence for the independence or relatedness of multisensory stimuli we further propose that topdown feedback connections spanning the dorsal pathway play key a role in recalibrating spatial encoding at the level of early unisensory cortices our proposed architecture provides possible explanations for a number of human electrophysiological and neuroimaging results and generates testable predictions linking neurophysiology with behaviour | [['when', 'the', 'brain', 'receives', 'input', 'from', 'multiple', 'sensory', 'systems', 'it', 'is', 'faced', 'with', 'the', 'question', 'of', 'whether', 'it', 'is', 'appropriate', 'to', 'process', 'the', 'inputs', 'in', 'combination', 'as', 'if', 'they', 'originated', 'from', 'the', 'same', 'event', 'or', 'separately', 'as', 'if', 'they', 'originated', 'from', 'distinct', 'events', 'furthermore', 'it', 'must', 'also', 'have', 'a', 'mechanism', 'through', 'which', 'it', 'can', 'keep', 'sensory', 'inputs', 'calibrated', 'to', 'maintain', 'the', 'accuracy', 'of', 'its', 'internal', 'representations', 'we', 'have', 'developed', 'a', 'neural', 'network', 'architecture', 'capable', 'of', 'i', 'approximating', 'optimal', 'multisensory', 'spatial', 'integration', 'based', 'on', 'bayesian', 'causal', 'inference', 'and', 'ii', 'recalibrating', 'the', 'spatial', 'encoding', 'of', 'sensory', 'systems', 'the', 'architecture', 'is', 'based', 'on', 'features', 'of', 'the', 'dorsal', 'processing', 'hierarchy', 'including', 'the', 'spatial', 'tuning', 'properties', 'of', 'unisensory', 'neurons', 'and', 'the', 'convergence', 'of', 'different', 'sensory', 'inputs', 'onto', 'multisensory', 'neurons', 'furthermore', 'we', 'propose', 'that', 'these', 'unisensory', 'and', 'multisensory', 'neurons', 'play', 'dual', 'roles', 'in', 'i', 'encoding', 'spatial', 'location', 'as', 'separate', 'or', 'integrated', 'estimates', 'and', 'ii', 'accumulating', 'evidence', 'for', 'the', 'independence', 'or', 'relatedness', 'of', 'multisensory', 'stimuli', 'we', 'further', 'propose', 'that', 'topdown', 'feedback', 'connections', 'spanning', 'the', 'dorsal', 'pathway', 'play', 'key', 'a', 'role', 'in', 'recalibrating', 'spatial', 'encoding', 'at', 'the', 'level', 'of', 'early', 'unisensory', 'cortices', 'our', 'proposed', 'architecture', 'provides', 'possible', 'explanations', 'for', 'a', 'number', 'of', 'human', 'electrophysiological', 'and', 'neuroimaging', 'results', 'and', 'generates', 'testable', 'predictions', 'linking', 'neurophysiology', 'with', 'behaviour']] | [-0.06205173742711085, 0.0856739474080305, -0.06301378342885398, 0.06766832853724697, -0.10618854683637169, -0.17465590824404562, 0.04662985440286254, 0.42541988154396343, -0.2807626822774393, -0.3117473177805291, 0.07393120091851657, -0.2513146705403564, -0.2567200959954807, 0.15551325047483155, -0.085195956091455, 0.026665161971164787, 0.07068183078489082, 0.060430852173274194, 0.010622571440411345, -0.21361803131207266, 0.30480756053075664, 0.06423957430496632, 0.2918018685764316, -0.031496522741220445, 0.18786336401936368, -0.008630695148227188, -0.0640827992859022, -0.03568703656710216, -0.04395299517654461, 0.16876747429703817, 0.28407105449857056, 0.23324318730794252, 0.3185816569701467, -0.48613575369047657, -0.2390034044519121, 0.08266061956202386, 0.15561942151941108, 0.08363395838777238, -0.04242030467167677, -0.2960304532038129, 0.08971874643306153, -0.1292533834424356, -0.011210258008298073, -0.08435437293354296, 0.021492552527356983, 0.01616780643513521, -0.29661067990487183, 0.06190433510402577, 0.07870465125731116, 0.07955976853435094, -0.05741846082891801, -0.07265531824528271, -0.066103932361123, 0.2285159211455347, 0.014611119088229773, 0.03295003384217318, 0.17929057069212775, -0.15714671909989078, -0.1453736443972386, 0.28398815130787913, 0.01533613677006125, -0.2087679324325192, 0.23000665535421475, -0.0764586157379177, -0.15131739303604633, 0.07327277526475381, 0.19288733399783572, 0.03476782096324912, -0.14672675643011912, -0.0035954307943890725, 0.004927070086466481, 0.20129860344664577, 0.07526277542645157, 0.07553842429809524, 0.22630416180776514, 0.22350382649087783, -0.00845765098389508, 0.1064167218114101, -0.11780606097303295, -0.08652449294430956, -0.27157602758638355, -0.0871680606552231, -0.13164924232374678, -0.00043126661836615074, -0.11747059268285835, -0.1222676649050796, 0.39029759360288363, 0.1827183494920525, 0.2215072149163391, 0.07669623952262229, 0.29006566884275076, 0.057587715634032366, 0.12237250450593622, 0.05846459699394226, 0.1543048275589655, 0.0731839947267503, 0.10194399658869502, -0.21506407909018802, 0.1507999159121247, 0.037433286117623754] |
1,802.06592 | Singular weighted Sobolev spaces and diffusion processes: an example
(due to V.V. Zhikov) | We consider the Sobolev space over $\mathbb{R}^d$ of square integrable
functions whose gradient is also square integrable with respect to some
positive weight. Tt is well known that smooth functions are dense in the
weighted Sobolev space when the weight is uniformly bounded from below and
above. This may not be the case when the weight is unbounded. In this paper, we
focus on a class of two dimensional weights where the density of smooth
functions does not hold. This class was originally introduced by V.V. Zhikov;
such weights have a unique singularity point of non-zero capacity. Following
V.V. Zhikov, we first give a detailed analytical description of the weighted
Sobolev space. Then, we explain how to use Dirichlet forms theory to associate
a diffusion process to such a degenerate non-regular space.
| math.PR math.FA | we consider the sobolev space over mathbbrd of square integrable functions whose gradient is also square integrable with respect to some positive weight tt is well known that smooth functions are dense in the weighted sobolev space when the weight is uniformly bounded from below and above this may not be the case when the weight is unbounded in this paper we focus on a class of two dimensional weights where the density of smooth functions does not hold this class was originally introduced by vv zhikov such weights have a unique singularity point of nonzero capacity following vv zhikov we first give a detailed analytical description of the weighted sobolev space then we explain how to use dirichlet forms theory to associate a diffusion process to such a degenerate nonregular space | [['we', 'consider', 'the', 'sobolev', 'space', 'over', 'mathbbrd', 'of', 'square', 'integrable', 'functions', 'whose', 'gradient', 'is', 'also', 'square', 'integrable', 'with', 'respect', 'to', 'some', 'positive', 'weight', 'tt', 'is', 'well', 'known', 'that', 'smooth', 'functions', 'are', 'dense', 'in', 'the', 'weighted', 'sobolev', 'space', 'when', 'the', 'weight', 'is', 'uniformly', 'bounded', 'from', 'below', 'and', 'above', 'this', 'may', 'not', 'be', 'the', 'case', 'when', 'the', 'weight', 'is', 'unbounded', 'in', 'this', 'paper', 'we', 'focus', 'on', 'a', 'class', 'of', 'two', 'dimensional', 'weights', 'where', 'the', 'density', 'of', 'smooth', 'functions', 'does', 'not', 'hold', 'this', 'class', 'was', 'originally', 'introduced', 'by', 'vv', 'zhikov', 'such', 'weights', 'have', 'a', 'unique', 'singularity', 'point', 'of', 'nonzero', 'capacity', 'following', 'vv', 'zhikov', 'we', 'first', 'give', 'a', 'detailed', 'analytical', 'description', 'of', 'the', 'weighted', 'sobolev', 'space', 'then', 'we', 'explain', 'how', 'to', 'use', 'dirichlet', 'forms', 'theory', 'to', 'associate', 'a', 'diffusion', 'process', 'to', 'such', 'a', 'degenerate', 'nonregular', 'space']] | [-0.08886266172736544, 0.11908489883397565, -0.03705031103031202, 0.06654547206194779, -0.1071341595309081, -0.12584777289620516, -0.0035971914634997534, 0.3881554890452235, -0.3333540302524908, -0.1491630541078683, 0.13056345800578129, -0.26238687605258415, -0.16409626211018555, 0.16287612566498644, -0.0920689073990974, 0.05781224844218796, 0.026811514988146497, 0.0780067470305684, -0.1107002638234531, -0.2885314048158541, 0.4177608635086058, 0.001240583256620801, 0.19211167157768752, 0.051180007525324596, 0.0853637812062075, -0.0094799760722019, 0.006050666473156801, 0.01441337342398721, -0.18646617148585914, 0.11133267487281101, 0.2532886697180485, 0.06150332529619901, 0.30286334039445856, -0.35573853964381147, -0.22736538152534966, 0.20496491611684728, 0.12613440632015804, 0.03849152883754648, 5.450735559200191e-05, -0.23741354933537712, 0.11064624274325924, -0.1291017546177362, -0.15689274414696477, -0.07247748005443788, 0.010256607136618572, 0.07387099248642864, -0.30747909240325855, 0.06408279797456502, 0.1042115148200978, 0.024460034448455906, -0.11205647167904924, -0.11832655551067243, -0.014672779388175431, 0.0555732685911194, -0.019814566300986124, 0.10534657946008144, 0.024310299265903956, -0.09262635077379167, -0.0789605995823601, 0.32193974070392095, -0.06946233474423713, -0.27880891813247494, 0.1589952475822594, -0.17372465148130714, -0.1345520044013745, 0.10553466060347008, 0.1660477107824673, 0.12375408205711706, -0.10791177739090264, 0.164646957383163, -0.0813156918977091, 0.1154298022414547, 0.0781742920076023, 0.012495111187242648, 0.12752336590677837, 0.09930945758947707, 0.1384986136937655, 0.16641845390338197, -0.04242571125293828, -0.1173248502820956, -0.36444360647124774, -0.1689581855792891, -0.2158122355132505, 0.11182288475582468, -0.07685270811998635, -0.22080564970207034, 0.3623950353005167, 0.062331587298875536, 0.2484899916735506, 0.10355896161248286, 0.19226330681174825, 0.15002387657295913, 0.04286295395683159, 0.08847626322919193, 0.162928186328138, 0.11569538720791708, 0.07483756137662567, -0.12859171169464279, 0.028104882187934974, 0.13418394458957747] |
1,802.06593 | Electron pairing: from metastable electron pair to bipolaron | Starting from the shell structure in atoms and the significant correlation
within electron pairs, we distinguish the exchange-correlation effects between
two electrons of opposite spins occupying the same orbital from the average
correlation among many electrons in a crystal. In the periodic potential of the
crystal with lattice constant larger than the effective Bohr radius of the
valence electrons, these correlated electron pairs can form a metastable energy
band above the corresponding single-electron band separated by an energy gap.
In order to determine if these metastable electron pairs can be stabilized, we
calculate the many-electron exchange-correlation renormalization and the
polaron correction to the two-band system with single electrons and electron
pairs. We find that the electron-phonon interaction is essential to
counterbalance the Coulomb repulsion and to stabilize the electron pairs. The
interplay of the electron-electron and electron-phonon interactions, manifested
in the exchange-correlation energies, polaron effects, and screening, is
responsible for the formation of electron pairs (bipolarons) that are located
on the Fermi surface of the single-electron band.
| cond-mat.str-el | starting from the shell structure in atoms and the significant correlation within electron pairs we distinguish the exchangecorrelation effects between two electrons of opposite spins occupying the same orbital from the average correlation among many electrons in a crystal in the periodic potential of the crystal with lattice constant larger than the effective bohr radius of the valence electrons these correlated electron pairs can form a metastable energy band above the corresponding singleelectron band separated by an energy gap in order to determine if these metastable electron pairs can be stabilized we calculate the manyelectron exchangecorrelation renormalization and the polaron correction to the twoband system with single electrons and electron pairs we find that the electronphonon interaction is essential to counterbalance the coulomb repulsion and to stabilize the electron pairs the interplay of the electronelectron and electronphonon interactions manifested in the exchangecorrelation energies polaron effects and screening is responsible for the formation of electron pairs bipolarons that are located on the fermi surface of the singleelectron band | [['starting', 'from', 'the', 'shell', 'structure', 'in', 'atoms', 'and', 'the', 'significant', 'correlation', 'within', 'electron', 'pairs', 'we', 'distinguish', 'the', 'exchangecorrelation', 'effects', 'between', 'two', 'electrons', 'of', 'opposite', 'spins', 'occupying', 'the', 'same', 'orbital', 'from', 'the', 'average', 'correlation', 'among', 'many', 'electrons', 'in', 'a', 'crystal', 'in', 'the', 'periodic', 'potential', 'of', 'the', 'crystal', 'with', 'lattice', 'constant', 'larger', 'than', 'the', 'effective', 'bohr', 'radius', 'of', 'the', 'valence', 'electrons', 'these', 'correlated', 'electron', 'pairs', 'can', 'form', 'a', 'metastable', 'energy', 'band', 'above', 'the', 'corresponding', 'singleelectron', 'band', 'separated', 'by', 'an', 'energy', 'gap', 'in', 'order', 'to', 'determine', 'if', 'these', 'metastable', 'electron', 'pairs', 'can', 'be', 'stabilized', 'we', 'calculate', 'the', 'manyelectron', 'exchangecorrelation', 'renormalization', 'and', 'the', 'polaron', 'correction', 'to', 'the', 'twoband', 'system', 'with', 'single', 'electrons', 'and', 'electron', 'pairs', 'we', 'find', 'that', 'the', 'electronphonon', 'interaction', 'is', 'essential', 'to', 'counterbalance', 'the', 'coulomb', 'repulsion', 'and', 'to', 'stabilize', 'the', 'electron', 'pairs', 'the', 'interplay', 'of', 'the', 'electronelectron', 'and', 'electronphonon', 'interactions', 'manifested', 'in', 'the', 'exchangecorrelation', 'energies', 'polaron', 'effects', 'and', 'screening', 'is', 'responsible', 'for', 'the', 'formation', 'of', 'electron', 'pairs', 'bipolarons', 'that', 'are', 'located', 'on', 'the', 'fermi', 'surface', 'of', 'the', 'singleelectron', 'band']] | [-0.14343225870080695, 0.21546443382880726, -0.025879086052767463, 0.1541594366116371, 0.043612048980740906, -0.13935697963182442, 0.07272358516699629, 0.37812974231462637, -0.2625043177391642, -0.317262702303643, -0.11827233398659434, -0.37782811243812037, -0.032441498522094624, 0.12864468638746146, 0.09866996215305063, -0.04801909216752131, 0.023837403476887946, -0.030570586920230687, -0.13230199747423302, -0.19544966864360575, 0.3369063984484706, 0.06357442312121034, 0.2623746174660896, 0.1714304824287217, 0.032051950249776334, 0.06053654256856772, 0.11971448497389427, 0.0004002104992950391, -0.11540894344503766, 0.10882786709346814, 0.24607076581384887, -0.1338897921384764, 0.243920618357293, -0.47020165246359247, -0.16969807239174062, 0.02579944608398451, 0.14618545802990476, 0.15751867706352052, -0.04769299246585498, -0.2760615952502557, -0.010768751401878046, -0.16960637382939905, -0.11725015636856952, -0.04638401470788403, 0.016535035552021987, 0.04712494640627842, -0.25161950962379587, 0.12966428235822222, 0.016992514525696324, -0.02698299940117819, -0.13268598238379878, -0.08799635161001593, -0.08438636919812573, 0.0896338438001757, 0.06313237647420007, 0.04790458954385521, 0.16737252836600838, -0.08609260817220112, -0.07234519683479884, 0.4068355221569003, -0.049825950906054996, -0.12465024875577338, 0.19044481866719748, -0.20017101098490533, -0.013391836295406261, 0.20791623949262866, 0.10110777308035107, 0.048874334819771034, -0.15461031609656803, 0.08389517189558417, 0.005405672210335597, 0.17021594195442644, 0.06353752393537608, 0.11605252856305036, 0.26974997114568594, 0.13331917872998172, 0.0412382346903487, 0.08228822977597194, -0.16577072866319562, -0.07211022686302483, -0.24419292008635327, -0.12920316503505908, -0.2628677561795506, 0.04567833599623315, -0.04986960474421928, -0.1835481361039875, 0.4342026095734533, 0.0949692168289762, 0.15301340589966222, -0.09896649114096058, 0.20426264249937173, 0.13115345867919528, 0.08975693916282923, 0.0715153306850907, 0.2787571074563067, 0.12200288010013853, 0.0014295469172031223, -0.35204768391510105, -0.004974536076299623, 0.06594814454947046] |
1,802.06594 | Quasismoooth hypersurfaces in toric varieties | We provide a combinatorial characterization of monomial linear systems on
toric varieties whose general member is quasismooth. This is given both in
terms of the Newton polytope and in terms of the matrix of exponents of a
monomial basis.
| math.AG | we provide a combinatorial characterization of monomial linear systems on toric varieties whose general member is quasismooth this is given both in terms of the newton polytope and in terms of the matrix of exponents of a monomial basis | [['we', 'provide', 'a', 'combinatorial', 'characterization', 'of', 'monomial', 'linear', 'systems', 'on', 'toric', 'varieties', 'whose', 'general', 'member', 'is', 'quasismooth', 'this', 'is', 'given', 'both', 'in', 'terms', 'of', 'the', 'newton', 'polytope', 'and', 'in', 'terms', 'of', 'the', 'matrix', 'of', 'exponents', 'of', 'a', 'monomial', 'basis']] | [-0.17586214658923638, -0.019314357342246253, -0.0730300796433137, 0.00795610059494487, -0.0604448960795521, -0.12776271552325058, -0.018871677952866334, 0.2556660593612693, -0.3331412380704513, -0.15626660447854263, 0.11222614040478873, -0.23184348017168352, -0.1971504911004255, 0.19955009128898382, -0.16531156644654962, 0.02361284564129817, 0.034886092329636596, 0.058787876496073574, -0.1436530759538306, -0.38204814340823734, 0.4189755061211494, 0.013682904724891368, 0.19795980994613507, 0.03392478140691916, 0.14516907890972036, 0.012647274499520278, -0.009405129660780612, 0.03087258300720117, -0.1560774838599639, 0.2008358321379488, 0.32293431613689816, 0.15216686809435487, 0.18144562639869177, -0.36012023763778883, -0.06795755585130209, 0.21769540938429344, 0.0945857542160994, 0.056858556249584906, 0.01285286461158345, -0.1596051268160152, 0.06914473415758365, -0.1456553320854138, -0.21258163175139672, -0.1110574955610224, 0.03346144030682552, 0.08973490967391393, -0.3004554253376017, 0.00029761788363640127, 0.09840255157831006, 0.21963024557305452, -0.03326744674585569, -0.12866297120359751, -0.03375508750860508, -0.005208393343939231, -0.09326750203632773, 0.03411654913081573, 0.029603695049165532, -0.13524828439888856, -0.159557983565789, 0.4526579992320293, -0.025303706395415924, -0.2622273962180584, 0.09953517882296672, -0.18965798432532793, -0.14692701319925106, 0.13597027083429006, 0.1375767803297211, 0.1716284391303093, -0.07798074575093313, 0.1722341602987562, -0.15496244109593904, 0.03987464547539369, 0.05454591248566524, 0.06686560719614275, 0.18236266649686372, 0.11095915113886197, 0.0554844595444126, 0.18624975589605477, 0.04395654693078727, -0.07047079991883574, -0.35442391792551065, -0.19212108723914775, -0.19985370939740768, 0.12409520497879921, -0.2000783444378519, -0.24669584426551294, 0.49850293096059406, -0.02692524446413303, 0.17471615683573943, 0.12398419220549747, 0.2030369971329585, 0.10247372807218479, -0.004142291031968899, 0.020783439839784153, 0.16562812856565684, 0.18799529181650051, -0.033966574973116316, -0.1626458893983792, 0.0793552410382873, 0.239134301049396] |
1,802.06595 | Acoustic scaling of linear and mode-coupled anisotropic flow;
implications for precision extraction of the specific shear viscosity | The $\mathrm{n^{th}}$-order linear flow coefficients $\mathrm{v^L_n \,
(n=2,3,4,5)}$, and the corresponding nonlinear mode-coupled ($\mathrm{mc}$)
coefficients $\mathrm{v^{mc}_{4,(2,2)}}$, $\mathrm{v^{mc}_{5,(2,3)}}$,
$\mathrm{v^{mc}_{6,(3,3)}}$ and $\mathrm{v^{mc}_{6,(2,2,2)}}$, are studied for
Pb+Pb collisions at $\sqrt{s_{_{\rm NN}}} = 2.76$ TeV. Both sets of
coefficients indicate a common acoustic scaling pattern of exponential viscous
modulation, with a rate proportional to the square of the harmonic numbers and
the mean transverse momenta (respectively), and inversely proportional to the
cube root of the charged particle multiplicity ($\mathrm{(N_{ch})^{1/3}}$),
that characterizes the dimensionless size of the systems produced in the
collisions. These patterns and their associated scaling parameters, provide new
stringent constraints for eccentricity independent estimates of the specific
shear viscosity ($\eta/s$) and the viscous correction to the thermal
distribution function for the matter produced in the collisions. They also give
crucial constraints for extraction of the initial-state eccentricity spectrum.
| nucl-ex nucl-th | the mathrmnthorder linear flow coefficients mathrmvl_n n2345 and the corresponding nonlinear modecoupled mathrmmc coefficients mathrmvmc_422 mathrmvmc_523 mathrmvmc_633 and mathrmvmc_6222 are studied for pbpb collisions at sqrts__rm nn 276 tev both sets of coefficients indicate a common acoustic scaling pattern of exponential viscous modulation with a rate proportional to the square of the harmonic numbers and the mean transverse momenta respectively and inversely proportional to the cube root of the charged particle multiplicity mathrmn_ch13 that characterizes the dimensionless size of the systems produced in the collisions these patterns and their associated scaling parameters provide new stringent constraints for eccentricity independent estimates of the specific shear viscosity etas and the viscous correction to the thermal distribution function for the matter produced in the collisions they also give crucial constraints for extraction of the initialstate eccentricity spectrum | [['the', 'mathrmnthorder', 'linear', 'flow', 'coefficients', 'mathrmvl_n', 'n2345', 'and', 'the', 'corresponding', 'nonlinear', 'modecoupled', 'mathrmmc', 'coefficients', 'mathrmvmc_422', 'mathrmvmc_523', 'mathrmvmc_633', 'and', 'mathrmvmc_6222', 'are', 'studied', 'for', 'pbpb', 'collisions', 'at', 'sqrts__rm', 'nn', '276', 'tev', 'both', 'sets', 'of', 'coefficients', 'indicate', 'a', 'common', 'acoustic', 'scaling', 'pattern', 'of', 'exponential', 'viscous', 'modulation', 'with', 'a', 'rate', 'proportional', 'to', 'the', 'square', 'of', 'the', 'harmonic', 'numbers', 'and', 'the', 'mean', 'transverse', 'momenta', 'respectively', 'and', 'inversely', 'proportional', 'to', 'the', 'cube', 'root', 'of', 'the', 'charged', 'particle', 'multiplicity', 'mathrmn_ch13', 'that', 'characterizes', 'the', 'dimensionless', 'size', 'of', 'the', 'systems', 'produced', 'in', 'the', 'collisions', 'these', 'patterns', 'and', 'their', 'associated', 'scaling', 'parameters', 'provide', 'new', 'stringent', 'constraints', 'for', 'eccentricity', 'independent', 'estimates', 'of', 'the', 'specific', 'shear', 'viscosity', 'etas', 'and', 'the', 'viscous', 'correction', 'to', 'the', 'thermal', 'distribution', 'function', 'for', 'the', 'matter', 'produced', 'in', 'the', 'collisions', 'they', 'also', 'give', 'crucial', 'constraints', 'for', 'extraction', 'of', 'the', 'initialstate', 'eccentricity', 'spectrum']] | [-0.15738324818223537, 0.1957586878302714, -0.10859028235935266, 0.09135729782024606, -0.02858896610060973, -0.10220198433787103, -0.07545085870642362, 0.26366352124346626, -0.28562539263022324, -0.27672607715921627, 0.03394424795387461, -0.34079504515680054, 0.002128301631836664, 0.19405386830395502, 0.034090951048133394, 0.13291975319947277, 0.06410504930878118, 0.04763096027535438, -0.031144566264831357, -0.21379674147326677, 0.2847896706856166, 0.12459561256100497, 0.23971616943913793, 0.10719020750525127, 0.10973511101116264, 0.03739805353642811, -0.050329567288004216, 0.009238826729068976, -0.21255889815299833, 0.07516288816340319, 0.20212330079511814, 0.0015730291132289465, 0.16117009671501045, -0.375058164457894, -0.13931011160584314, 0.1163059888917598, 0.1302710725438027, 0.05009988740470911, -0.018276009582988327, -0.1916824239546374, 0.09331111001619508, -0.19153381323456645, -0.1544134151892707, -0.02497954775268833, 0.07894013842774762, 0.09540965119081121, -0.3303630845219318, 0.20458537309281788, 0.045613714917895516, 0.05032285459206572, -0.07145419688747516, -0.17907590688102776, -0.06988465091923163, 0.052963961107981586, 0.09429215008599891, 0.02974619035653415, 0.16723757345480697, -0.16049742307199816, -0.08040699512801236, 0.3892462957827818, -0.03980718296213401, -0.2180508488035273, 0.1842895427659627, -0.19046786519151832, -0.08630452993407195, 0.14711020957116808, 0.26958985617088654, 0.07187682140382036, -0.14126651993553554, 0.020226641821431086, 0.009197913683093493, 0.19199621881957032, 0.10144749973782353, 0.06416291708777112, 0.20348507395043733, 0.10357657291497739, 0.021659156802805172, 0.11513634689433115, -0.1047918773004471, -0.07013056912488999, -0.35226243384005057, -0.0721796155419378, -0.17134423832970833, 0.002268801256644702, -0.19258101321022314, -0.11930643208694482, 0.3606771409459826, 0.09300779958363227, 0.27117074456062196, 0.057910909915032484, 0.25877158389064586, 0.16487875028646418, 0.05796174353010775, 0.09733596005741948, 0.2754148327937675, 0.1650838826668434, 0.14845414754254596, -0.3015869274062829, 0.03417258107266019, 0.07843417205904621] |
1,802.06596 | Numerical construction and critical behavior of Kaluza-Klein black holes | The idea of extra dimensions provides a promising approach to overcome
various problems in modern physics. This includes theoretical as well as
phenomenological aspects, such as the unification of the fundamental
interactions or the hierarchy problem. Based on the seminal works by Kaluza and
Klein that were published nearly 100 years ago, we denote theories with at
least one compact periodic dimension as Kaluza-Klein theories. From a
gravitational point of view the question arises, what are the fundamental
solutions to Einstein's field equations of general relativity under these
assumptions. In particular, in this work we are concerned with black hole
solutions in Kaluza-Klein theory. Considering only the static case without
electric charge, it turns out that there is a much richer phase space than in
the usual four-dimensional theory, where only the Schwarzschild solution
exists. There are at least two types of solutions with a completely different
horizon topology: localized black holes with an ordinary spherical horizon and
black strings with a horizon that wraps the compact dimension. Several
arguments favor the conjecture that the solution branches of both types are
connected via a singular topology changing solution that is controlled by the
so-called double-cone metric. We study the regime close to this singular
transit solution in five and six spacetime dimensions with the help of a highly
accurate numerical scheme that we describe in detail. Consequently, for the
first time we are able to show that in this regime the black objects exhibit a
critical behavior, indicating that physical quantities are governed by
universal critical exponents. Such exponents were already derived from the
double-cone metric. We show that our data confirms these values extremely well.
This provides compelling evidence in favor of the double-cone metric as the
local model of the transit solution.
| gr-qc hep-th | the idea of extra dimensions provides a promising approach to overcome various problems in modern physics this includes theoretical as well as phenomenological aspects such as the unification of the fundamental interactions or the hierarchy problem based on the seminal works by kaluza and klein that were published nearly 100 years ago we denote theories with at least one compact periodic dimension as kaluzaklein theories from a gravitational point of view the question arises what are the fundamental solutions to einsteins field equations of general relativity under these assumptions in particular in this work we are concerned with black hole solutions in kaluzaklein theory considering only the static case without electric charge it turns out that there is a much richer phase space than in the usual fourdimensional theory where only the schwarzschild solution exists there are at least two types of solutions with a completely different horizon topology localized black holes with an ordinary spherical horizon and black strings with a horizon that wraps the compact dimension several arguments favor the conjecture that the solution branches of both types are connected via a singular topology changing solution that is controlled by the socalled doublecone metric we study the regime close to this singular transit solution in five and six spacetime dimensions with the help of a highly accurate numerical scheme that we describe in detail consequently for the first time we are able to show that in this regime the black objects exhibit a critical behavior indicating that physical quantities are governed by universal critical exponents such exponents were already derived from the doublecone metric we show that our data confirms these values extremely well this provides compelling evidence in favor of the doublecone metric as the local model of the transit solution | [['the', 'idea', 'of', 'extra', 'dimensions', 'provides', 'a', 'promising', 'approach', 'to', 'overcome', 'various', 'problems', 'in', 'modern', 'physics', 'this', 'includes', 'theoretical', 'as', 'well', 'as', 'phenomenological', 'aspects', 'such', 'as', 'the', 'unification', 'of', 'the', 'fundamental', 'interactions', 'or', 'the', 'hierarchy', 'problem', 'based', 'on', 'the', 'seminal', 'works', 'by', 'kaluza', 'and', 'klein', 'that', 'were', 'published', 'nearly', '100', 'years', 'ago', 'we', 'denote', 'theories', 'with', 'at', 'least', 'one', 'compact', 'periodic', 'dimension', 'as', 'kaluzaklein', 'theories', 'from', 'a', 'gravitational', 'point', 'of', 'view', 'the', 'question', 'arises', 'what', 'are', 'the', 'fundamental', 'solutions', 'to', 'einsteins', 'field', 'equations', 'of', 'general', 'relativity', 'under', 'these', 'assumptions', 'in', 'particular', 'in', 'this', 'work', 'we', 'are', 'concerned', 'with', 'black', 'hole', 'solutions', 'in', 'kaluzaklein', 'theory', 'considering', 'only', 'the', 'static', 'case', 'without', 'electric', 'charge', 'it', 'turns', 'out', 'that', 'there', 'is', 'a', 'much', 'richer', 'phase', 'space', 'than', 'in', 'the', 'usual', 'fourdimensional', 'theory', 'where', 'only', 'the', 'schwarzschild', 'solution', 'exists', 'there', 'are', 'at', 'least', 'two', 'types', 'of', 'solutions', 'with', 'a', 'completely', 'different', 'horizon', 'topology', 'localized', 'black', 'holes', 'with', 'an', 'ordinary', 'spherical', 'horizon', 'and', 'black', 'strings', 'with', 'a', 'horizon', 'that', 'wraps', 'the', 'compact', 'dimension', 'several', 'arguments', 'favor', 'the', 'conjecture', 'that', 'the', 'solution', 'branches', 'of', 'both', 'types', 'are', 'connected', 'via', 'a', 'singular', 'topology', 'changing', 'solution', 'that', 'is', 'controlled', 'by', 'the', 'socalled', 'doublecone', 'metric', 'we', 'study', 'the', 'regime', 'close', 'to', 'this', 'singular', 'transit', 'solution', 'in', 'five', 'and', 'six', 'spacetime', 'dimensions', 'with', 'the', 'help', 'of', 'a', 'highly', 'accurate', 'numerical', 'scheme', 'that', 'we', 'describe', 'in', 'detail', 'consequently', 'for', 'the', 'first', 'time', 'we', 'are', 'able', 'to', 'show', 'that', 'in', 'this', 'regime', 'the', 'black', 'objects', 'exhibit', 'a', 'critical', 'behavior', 'indicating', 'that', 'physical', 'quantities', 'are', 'governed', 'by', 'universal', 'critical', 'exponents', 'such', 'exponents', 'were', 'already', 'derived', 'from', 'the', 'doublecone', 'metric', 'we', 'show', 'that', 'our', 'data', 'confirms', 'these', 'values', 'extremely', 'well', 'this', 'provides', 'compelling', 'evidence', 'in', 'favor', 'of', 'the', 'doublecone', 'metric', 'as', 'the', 'local', 'model', 'of', 'the', 'transit', 'solution']] | [-0.14306760821681547, 0.10502898156747648, -0.08162981485033274, 0.10047357726377296, -0.07602427089048334, -0.15703616870351794, 0.02216282374143195, 0.30823137444130394, -0.21550687104241834, -0.28928740818661697, 0.1156779728571688, -0.30327791680160554, -0.17850716698987626, 0.20202399610397628, -0.04919549071591911, 0.03356504836867724, 0.017964628777311493, 0.03846114187986039, -0.07363387724649174, -0.2390546335745286, 0.3837721077234288, 0.028665449883674785, 0.2534059121631415, 0.020804280064941453, 0.09220608261828256, -0.02618862787850809, 0.004909326927419625, 0.08107141409531397, -0.14241221384494268, 0.08220628713341556, 0.24091949409195296, 0.10619146623565054, 0.2336016642341555, -0.41824786524370716, -0.24024640745404144, 0.08098897803653994, 0.14710649030938822, 0.14056354333396343, -0.06313876986905907, -0.26349328278300993, 0.10134169663782516, -0.154390352667265, -0.18159045627638445, -0.06308783044334546, 0.031479259429429814, -0.032081679460041375, -0.20215669613280873, 0.07818872245586142, 0.05811484775515463, 0.0069139153683925566, -0.09727993906379778, -0.0706814346006647, -0.003363268357641412, 0.0946685982041289, 0.12000276894525619, 0.027267476767903434, 0.0825076276075323, -0.1139013436551643, -0.1362823823777338, 0.3793536698965191, -0.050614743335913495, -0.21017129549227628, 0.2145942953806434, -0.1785054622015276, -0.1268834000022537, 0.11239342876277598, 0.11402253859967855, 0.17074874808954799, -0.12384045126330785, 0.13087549103130142, -0.051640941083532614, 0.1575304201165995, 0.09656286041242812, 0.04513619861943286, 0.2679672198675788, 0.14930911171392594, 0.06277705405579032, 0.11191681141610302, -0.02345119685577672, -0.13713036227945974, -0.3310413790081127, -0.1203937202744597, -0.13165475592669734, 0.08552468417934617, -0.1345890681542948, -0.1634561139916, 0.3534991713252993, 0.13203311954913216, 0.18904986489583187, 0.033541654198601535, 0.25159404882046776, 0.10291864213788704, 0.044349152333464245, 0.09342730320122118, 0.29053526101665583, 0.0803123647877693, 0.10559711039824994, -0.1614927655465261, -0.010912651872439753, 0.09995566011203745] |
1,802.06597 | Twist-3 contributions to wide-angle photoproduction of pions | We investigate wide-angle pi^0 photoproduction within the handbag approach to
twist-3 accuracy. In contrast to earlier work both the 2-particle as well as
the 3-particle twist-3 contributions are taken into account. It is shown that
both are needed for consistent results that respect gauge invariance and
crossing properties. The numerical studies reveal the dominance of the twist-3
contribution. With it fair agreement with the recent CLAS measurement of the
pi^0 cross section is obtained. We briefly comment also on wide-angle
photoproduction of other pseudoscalar mesons.
| hep-ph nucl-th | we investigate wideangle pi0 photoproduction within the handbag approach to twist3 accuracy in contrast to earlier work both the 2particle as well as the 3particle twist3 contributions are taken into account it is shown that both are needed for consistent results that respect gauge invariance and crossing properties the numerical studies reveal the dominance of the twist3 contribution with it fair agreement with the recent clas measurement of the pi0 cross section is obtained we briefly comment also on wideangle photoproduction of other pseudoscalar mesons | [['we', 'investigate', 'wideangle', 'pi0', 'photoproduction', 'within', 'the', 'handbag', 'approach', 'to', 'twist3', 'accuracy', 'in', 'contrast', 'to', 'earlier', 'work', 'both', 'the', '2particle', 'as', 'well', 'as', 'the', '3particle', 'twist3', 'contributions', 'are', 'taken', 'into', 'account', 'it', 'is', 'shown', 'that', 'both', 'are', 'needed', 'for', 'consistent', 'results', 'that', 'respect', 'gauge', 'invariance', 'and', 'crossing', 'properties', 'the', 'numerical', 'studies', 'reveal', 'the', 'dominance', 'of', 'the', 'twist3', 'contribution', 'with', 'it', 'fair', 'agreement', 'with', 'the', 'recent', 'clas', 'measurement', 'of', 'the', 'pi0', 'cross', 'section', 'is', 'obtained', 'we', 'briefly', 'comment', 'also', 'on', 'wideangle', 'photoproduction', 'of', 'other', 'pseudoscalar', 'mesons']] | [-0.06697958583039615, 0.1631041159908123, -0.12374421312638065, 0.13719728777239867, -0.07855341528706691, -0.048692946508526805, -0.01835781081634409, 0.4072745140422793, -0.14240876303109176, -0.16207836175898965, -0.07227734936099937, -0.381333649980233, -0.07152155203854337, 0.1513845507055521, 0.05557386133107631, 0.10466816313564778, 0.10007208439877585, -0.011977599076378872, -0.02067017293370822, -0.22353596705558149, 0.3409598885158844, 0.061612846789991155, 0.267104748767965, 0.18654048660879627, 0.020922458741594763, 0.07034425846136669, -0.10755718274808981, -0.006035533974714139, -0.10705927295476773, 0.0668592185658567, 0.2715293089037432, 0.05172478643739048, 0.08746944497175077, -0.3554707190569709, -0.12050304341896931, 0.028817993621615804, 0.16091621240929646, 0.08260139107485027, -0.017817949872080456, -0.3386714294004966, 0.06530140221173711, -0.21703225538572846, -0.12974128009450128, -0.15095254232120864, -0.03612191453028251, -0.04311597385882016, -0.29278601314324665, 0.07434131220113212, -0.021151936984182718, 0.0016342471079791292, -0.050715786737718566, -0.2589296390631181, -0.01210407575537615, 0.036840825133463914, 0.1665605015011833, 0.15082646722302717, 0.11214349403813043, -0.14349129089318655, -0.18939593331340482, 0.43230747790897595, -0.008729725361199063, -0.18458029719836572, 0.0860369108398171, -0.24007457926431122, -0.19007539268418708, 0.14059574555824786, 0.1644881858873893, 0.04426175910630263, -0.19780951651936288, 0.05861961577457431, -0.0794905853786451, 0.15188864670584307, 0.09304435639642179, 0.07769379721986992, 0.1179113979341791, 0.1718021251480369, -0.07393592908321057, 0.06436909398077713, -0.08085705889936756, -0.13473876009640448, -0.4171919410062187, -0.08456199175732977, -0.06980617284117376, 0.06061400540501756, -0.04432060603747446, -0.05342449602938038, 0.3182355925879058, 0.13347587463829447, 0.2887215827317799, 0.051069990008631175, 0.3889341239105253, 0.11667803820523927, 0.05857386421412229, 0.05853423402261208, 0.31708577141604005, 0.20578787502120524, 0.11289883578634437, -0.2649523934130283, 0.059622792939326784, 0.0038482195204671693] |
1,802.06598 | The quest for Casimir repulsion between Chern-Simons surfaces | In this paper we critically reconsider the Casimir repulsion between surfaces
that carry the Chern-Simons interaction (corresponding to the Hall type
conductivity). We present a derivation of the Lifshitz formula valid for
arbitrary planar geometries and discuss its properties. This analysis allows us
to resolve some contradictions in the previous literature. We compute the
Casimir energy for two surfaces that have constant longitudinal and Hall
conductivities. The repulsion is possible only if both surfaces have Hall
conductivities of the same sign. However, there is a critical value of the
longitudinal conductivity above which the repulsion disappears. We also
consider a model where both parity odd and parity even terms in the
conductivity are produced by the polarization tensor of surface modes. In
contrast to the previous publications L. Chen and S.-L. Wan, Phys. Rev. B84,
075149 (2011); B85, 115102 (2012), we include the parity anomaly term. This
term ensures that the conductivities vanish for infinitely massive surface
modes. We find that at least for a single mode regardless of the sign and value
of its mass, there is no Casimir repulsion.
| cond-mat.mes-hall hep-th quant-ph | in this paper we critically reconsider the casimir repulsion between surfaces that carry the chernsimons interaction corresponding to the hall type conductivity we present a derivation of the lifshitz formula valid for arbitrary planar geometries and discuss its properties this analysis allows us to resolve some contradictions in the previous literature we compute the casimir energy for two surfaces that have constant longitudinal and hall conductivities the repulsion is possible only if both surfaces have hall conductivities of the same sign however there is a critical value of the longitudinal conductivity above which the repulsion disappears we also consider a model where both parity odd and parity even terms in the conductivity are produced by the polarization tensor of surface modes in contrast to the previous publications l chen and sl wan phys rev b84 075149 2011 b85 115102 2012 we include the parity anomaly term this term ensures that the conductivities vanish for infinitely massive surface modes we find that at least for a single mode regardless of the sign and value of its mass there is no casimir repulsion | [['in', 'this', 'paper', 'we', 'critically', 'reconsider', 'the', 'casimir', 'repulsion', 'between', 'surfaces', 'that', 'carry', 'the', 'chernsimons', 'interaction', 'corresponding', 'to', 'the', 'hall', 'type', 'conductivity', 'we', 'present', 'a', 'derivation', 'of', 'the', 'lifshitz', 'formula', 'valid', 'for', 'arbitrary', 'planar', 'geometries', 'and', 'discuss', 'its', 'properties', 'this', 'analysis', 'allows', 'us', 'to', 'resolve', 'some', 'contradictions', 'in', 'the', 'previous', 'literature', 'we', 'compute', 'the', 'casimir', 'energy', 'for', 'two', 'surfaces', 'that', 'have', 'constant', 'longitudinal', 'and', 'hall', 'conductivities', 'the', 'repulsion', 'is', 'possible', 'only', 'if', 'both', 'surfaces', 'have', 'hall', 'conductivities', 'of', 'the', 'same', 'sign', 'however', 'there', 'is', 'a', 'critical', 'value', 'of', 'the', 'longitudinal', 'conductivity', 'above', 'which', 'the', 'repulsion', 'disappears', 'we', 'also', 'consider', 'a', 'model', 'where', 'both', 'parity', 'odd', 'and', 'parity', 'even', 'terms', 'in', 'the', 'conductivity', 'are', 'produced', 'by', 'the', 'polarization', 'tensor', 'of', 'surface', 'modes', 'in', 'contrast', 'to', 'the', 'previous', 'publications', 'l', 'chen', 'and', 'sl', 'wan', 'phys', 'rev', 'b84', '075149', '2011', 'b85', '115102', '2012', 'we', 'include', 'the', 'parity', 'anomaly', 'term', 'this', 'term', 'ensures', 'that', 'the', 'conductivities', 'vanish', 'for', 'infinitely', 'massive', 'surface', 'modes', 'we', 'find', 'that', 'at', 'least', 'for', 'a', 'single', 'mode', 'regardless', 'of', 'the', 'sign', 'and', 'value', 'of', 'its', 'mass', 'there', 'is', 'no', 'casimir', 'repulsion']] | [-0.18080542730843888, 0.15735745364761072, -0.06029956158108791, 0.019228144351122432, -0.07296425781041051, -0.14427086452604923, 0.03150153481765707, 0.3292568902844074, -0.19813019338495738, -0.2819871246897975, 0.040624499185707985, -0.30299999405554817, -0.15626025988132428, 0.14544748200504265, -0.028082905030242224, 0.00830833892944118, 0.007419848129122034, 0.002707541095581967, -0.07114825455905016, -0.24196897540111406, 0.310085653324804, 0.008408421168283315, 0.2754973184535873, 0.14083333662613529, 0.05504003230237803, 0.037606740673462855, 0.030667040023598924, 0.06502544596354222, -0.1605875458701334, 0.04460503082519512, 0.21776971452532587, -0.03427743692960403, 0.1855603604884454, -0.41208538723141785, -0.18842960930138036, 0.10986602542578508, 0.0774086177968238, 0.1382101303266944, -0.02056976400482255, -0.21114609880612217, 0.05013416398722449, -0.18232455611874104, -0.13374214392290684, -0.07829014824796988, 0.1035122378617421, -0.07131327348748254, -0.2334371938828025, 0.15470852978204314, 0.07408768032689178, 0.04231150223426105, -0.08286416587743689, -0.157498156798837, -0.0358899166890779, 0.10286183893295557, 0.1035776603992966, 0.01946690524329936, 0.0860422257328791, -0.14420922067765585, -0.11941603720500316, 0.3410172069538905, -0.0540569202438538, -0.1973436398733428, 0.2067214013480545, -0.17845677012869016, -0.10257738056545818, 0.10141857588200637, 0.11443760361022956, 0.10109448899234015, -0.11278004330119856, 0.15802955184250228, -0.050185453495291694, 0.1337440771846798, 0.12101189838722348, 0.008800723768807115, 0.21561146779480136, 0.06778116041583701, 0.051878561226744724, 0.12932783529922035, -0.09474741652940905, -0.03883492654253203, -0.3383181329202635, -0.19270277019941662, -0.19519440269448232, 0.06722262456451215, -0.03994935787341092, -0.18115581019700885, 0.3773578400905738, 0.17685741644884997, 0.20442744636909474, 0.0498394896725047, 0.24491788403198705, 0.14703209267658646, 0.07941724125012319, 0.10812435700855993, 0.2904441254010213, 0.14716118277706122, 0.11399840266416474, -0.2952540990943349, -0.00368315699983742, 0.06578499463506501] |
1,802.06599 | Study of Rydberg blockade in thermal vapor | We present the experimental demonstration of Rydberg blockade in thermal
atomic vapor where the atoms are not necessarily be frozen. We show that not
all the interacting atoms but only the atoms with same velocity collectively
participate in the blockade process. Using this observation, we formulated a
suitable model based on super atom picture to study blockade interaction in
thermal vapor. We performed an experiment to measure Rydberg population in
rubidium thermal vapor using optical heterodyne detection technique and density
dependent suppression of Rydberg population is observed in suitable
experimental parameter regime. Further analysis of the experimental data using
the model verifies the scaling law for van der Waals interaction strength
$(C_{6})$ with principal quantum number of the Rydberg state with $11\%$ error.
Our result suggests multi-photon excitation in thermal vapor with suitable
laser configuration to probe Rydberg blockade interaction based optical
nonlinearity and many body effects.
| physics.atom-ph quant-ph | we present the experimental demonstration of rydberg blockade in thermal atomic vapor where the atoms are not necessarily be frozen we show that not all the interacting atoms but only the atoms with same velocity collectively participate in the blockade process using this observation we formulated a suitable model based on super atom picture to study blockade interaction in thermal vapor we performed an experiment to measure rydberg population in rubidium thermal vapor using optical heterodyne detection technique and density dependent suppression of rydberg population is observed in suitable experimental parameter regime further analysis of the experimental data using the model verifies the scaling law for van der waals interaction strength c_6 with principal quantum number of the rydberg state with 11 error our result suggests multiphoton excitation in thermal vapor with suitable laser configuration to probe rydberg blockade interaction based optical nonlinearity and many body effects | [['we', 'present', 'the', 'experimental', 'demonstration', 'of', 'rydberg', 'blockade', 'in', 'thermal', 'atomic', 'vapor', 'where', 'the', 'atoms', 'are', 'not', 'necessarily', 'be', 'frozen', 'we', 'show', 'that', 'not', 'all', 'the', 'interacting', 'atoms', 'but', 'only', 'the', 'atoms', 'with', 'same', 'velocity', 'collectively', 'participate', 'in', 'the', 'blockade', 'process', 'using', 'this', 'observation', 'we', 'formulated', 'a', 'suitable', 'model', 'based', 'on', 'super', 'atom', 'picture', 'to', 'study', 'blockade', 'interaction', 'in', 'thermal', 'vapor', 'we', 'performed', 'an', 'experiment', 'to', 'measure', 'rydberg', 'population', 'in', 'rubidium', 'thermal', 'vapor', 'using', 'optical', 'heterodyne', 'detection', 'technique', 'and', 'density', 'dependent', 'suppression', 'of', 'rydberg', 'population', 'is', 'observed', 'in', 'suitable', 'experimental', 'parameter', 'regime', 'further', 'analysis', 'of', 'the', 'experimental', 'data', 'using', 'the', 'model', 'verifies', 'the', 'scaling', 'law', 'for', 'van', 'der', 'waals', 'interaction', 'strength', 'c_6', 'with', 'principal', 'quantum', 'number', 'of', 'the', 'rydberg', 'state', 'with', '11', 'error', 'our', 'result', 'suggests', 'multiphoton', 'excitation', 'in', 'thermal', 'vapor', 'with', 'suitable', 'laser', 'configuration', 'to', 'probe', 'rydberg', 'blockade', 'interaction', 'based', 'optical', 'nonlinearity', 'and', 'many', 'body', 'effects']] | [-0.10974643359968096, 0.20760927547561717, -0.05859372031171711, -0.029327511889909036, 0.03114118754584976, -0.18813216108765426, 0.10225099118800238, 0.3993008809075469, -0.2223734958604181, -0.2820786903580638, -0.05209303111769259, -0.2796128934033874, -0.09650560565052085, 0.17899169854274918, 0.029690472139869216, 0.06580704210332411, 0.07186622183206079, -0.05630154225525453, 0.06122164766076116, -0.196579840228272, 0.27357988622511553, 0.06854257087910637, 0.2979258574406002, 0.10723539903921513, 0.08578787852778752, 0.010597645432203628, 0.06878689244440218, -0.01610355247699079, -0.1250459570931148, 0.0885039267896795, 0.23714785672111285, -0.00853636163068289, 0.23689359871886012, -0.4940198393804686, -0.20467468129699024, 0.07738007794508114, 0.14376897235768435, 0.22461832653126065, -0.06622338730233665, -0.3249511709024965, -0.08331653812177936, -0.1920673376975619, -0.12312922348604113, -0.10952466569815567, -0.00973933311115925, 0.047556606267078395, -0.2900235167432095, 0.10424216637438556, 0.020383814194946087, 0.08176569089445533, -0.09195448783048916, -0.054950575550169155, 0.023893493112037274, 0.02505000481551488, -0.084477265590531, -0.015324431894423098, 0.25562843051343065, -0.09240693038766634, -0.07634919792172962, 0.3803964066350845, -0.14415941259120496, -0.08635357573634761, 0.19091469372882425, -0.20330844391264072, -0.09047691583978709, 0.12633238363295135, 0.08573255743071133, 0.07612803220048231, -0.1336893802413679, 0.04218500049477506, -0.040829726755397304, 0.2383398979357412, 0.10840783260293863, 0.11833108355588957, 0.18339141519094, 0.18630572658374298, 0.02187143050119927, 0.14178654297372187, -0.12394136785795647, -0.10773283795954115, -0.2500795185610297, -0.13200758046788943, -0.25225885560954636, 0.06340137631477959, -0.0518884636700505, -0.1533780734903705, 0.3338172232833545, 0.16341220894765082, 0.18327995060410882, -0.06693396191144375, 0.3194811314734041, 0.11580341226392787, 0.023496251219889897, -0.01883994854454483, 0.3113314981546988, 0.1615815429257698, 0.05500443728615333, -0.3212030324451372, 0.030805821128214905, 0.02578864763110724] |
1,802.066 | Ultrafast perturbation maps as a quantitative tool for testing of
multi-port photonic devices | Advanced photonic probing techniques are of great importance for the
development of non-contact wafer-scale testing of photonic chips. Ultrafast
photomodulation has been identified as a powerful new tool capable of remotely
mapping photonic devices through a scanning perturbation. Here, we develop
photomodulation maps into a quantitative technique through a general and
rigorous method based on Lorentz reciprocity that allows the prediction of
transmittance perturbation maps for arbitrary linear photonic systems with
great accuracy and minimal computational cost. Excellent agreement is obtained
between predicted and experimental maps of various optical
multimode-interference devices, thereby allowing direct comparison of a device
under test with a physical model of an ideal design structure. In addition to
constituting a promising route for optical testing in photonics manufacturing,
ultrafast perturbation mapping may be used for design optimization of photonic
structures with reconfigurable functionalities.
| physics.optics cond-mat.mes-hall | advanced photonic probing techniques are of great importance for the development of noncontact waferscale testing of photonic chips ultrafast photomodulation has been identified as a powerful new tool capable of remotely mapping photonic devices through a scanning perturbation here we develop photomodulation maps into a quantitative technique through a general and rigorous method based on lorentz reciprocity that allows the prediction of transmittance perturbation maps for arbitrary linear photonic systems with great accuracy and minimal computational cost excellent agreement is obtained between predicted and experimental maps of various optical multimodeinterference devices thereby allowing direct comparison of a device under test with a physical model of an ideal design structure in addition to constituting a promising route for optical testing in photonics manufacturing ultrafast perturbation mapping may be used for design optimization of photonic structures with reconfigurable functionalities | [['advanced', 'photonic', 'probing', 'techniques', 'are', 'of', 'great', 'importance', 'for', 'the', 'development', 'of', 'noncontact', 'waferscale', 'testing', 'of', 'photonic', 'chips', 'ultrafast', 'photomodulation', 'has', 'been', 'identified', 'as', 'a', 'powerful', 'new', 'tool', 'capable', 'of', 'remotely', 'mapping', 'photonic', 'devices', 'through', 'a', 'scanning', 'perturbation', 'here', 'we', 'develop', 'photomodulation', 'maps', 'into', 'a', 'quantitative', 'technique', 'through', 'a', 'general', 'and', 'rigorous', 'method', 'based', 'on', 'lorentz', 'reciprocity', 'that', 'allows', 'the', 'prediction', 'of', 'transmittance', 'perturbation', 'maps', 'for', 'arbitrary', 'linear', 'photonic', 'systems', 'with', 'great', 'accuracy', 'and', 'minimal', 'computational', 'cost', 'excellent', 'agreement', 'is', 'obtained', 'between', 'predicted', 'and', 'experimental', 'maps', 'of', 'various', 'optical', 'multimodeinterference', 'devices', 'thereby', 'allowing', 'direct', 'comparison', 'of', 'a', 'device', 'under', 'test', 'with', 'a', 'physical', 'model', 'of', 'an', 'ideal', 'design', 'structure', 'in', 'addition', 'to', 'constituting', 'a', 'promising', 'route', 'for', 'optical', 'testing', 'in', 'photonics', 'manufacturing', 'ultrafast', 'perturbation', 'mapping', 'may', 'be', 'used', 'for', 'design', 'optimization', 'of', 'photonic', 'structures', 'with', 'reconfigurable', 'functionalities']] | [-0.12271530006204129, 0.06996556756059684, -0.08631232229698285, -0.01281743357771227, -0.06994218429249219, -0.2210647743777372, 0.059571325905648446, 0.44880047988708077, -0.23350147726288176, -0.3104752938805391, 0.08326152872006573, -0.23151305632039593, -0.19954164946958533, 0.3256742911608479, 0.0022869722623213686, 0.1853225759901654, 0.034686822156586194, -0.11432166236986899, -0.06775080112728414, -0.12532019586155108, 0.2122021228158915, 0.0977062490535044, 0.3500684277832453, 0.04898809937217533, 0.13280634073581657, 0.045693085613225666, -0.021647609968888846, 0.003633225439390277, -0.108043823495042, 0.20703082047882215, 0.2917451575425837, 0.061160640477764365, 0.3052285397579373, -0.4775201075792532, -0.25597603285603004, 0.04853672766544418, 0.12391822557059212, 0.12141780753839104, -0.1601435388207285, -0.28235806357663346, 0.07610521907661356, -0.1508622182368794, -0.13291501558213734, -0.15910982331500717, -0.0052726476432700805, -0.0009467002887771849, -0.2537403740558041, -0.0163892997400527, -0.034978231024818826, 0.09416573585750644, -0.03806259545394021, -0.02023296468969955, 0.003594890150399057, 0.12394139187081772, -0.11787726098298341, 0.014928700340747395, 0.15253591903670252, -0.1221051133607569, -0.17597709774204037, 0.4059678700286895, -0.04782481781919213, -0.15084299552665256, 0.19912957930201253, -0.07328900916721015, -0.10023182948455489, 0.11865057141746066, 0.19419107192387694, 0.06625589773551945, -0.1702394745666157, 0.047475928257935104, 0.018043001726790166, 0.18510823215097738, 0.058496108990820014, 0.1192626180828644, 0.24436688819824828, 0.2684920946570962, 0.06585182546405122, 0.15332293391967303, -0.08049807857605629, -0.010510752747958416, -0.25351646311088083, -0.2127249558620593, -0.18163074632962783, 0.05345237677273176, -0.10552904027998225, -0.14536302147077068, 0.39829761522602947, 0.14750887631346224, 0.1135494737091529, 0.0031167604416516364, 0.3561084929833134, 0.06143711199761396, 0.12034672135076321, -0.0326509855735554, 0.2418566981188419, 0.16923142788479761, 0.08460116739768316, -0.1699780422315919, 0.05845794488799155, -0.016468751668820485] |
1,802.06601 | Limit cycles of a Li\'enard system with symmetry allowing for
discontinuity | This paper presents new results on the limit cycles of a Li\'enard system
with symmetry allowing for discontinuity. Our results generalize and improve
the results in [33,34]. The results in [34] are only valid for the smooth
system. We emphasize that our main results are valid for discontinuous systems.
Moreover, we show the presence and an explicit upper bound for the amplitude of
the two limit cycles, and we estimate the position of the double-limit-cycle
bifurcation surface in the parameter space. Until now, there is no result to
determine the amplitude of the two limit cycles. The existing results on the
amplitude of limit cycles guarantee that the Li\'enard system has a unique
limit cycle. Finally, some applications and examples are provided to show the
effectiveness of our results. We revisit a co-dimension-3 Li\'enard oscillator
(see [21,32]) in Application 1. Li and Rousseau [21] studied the limit cycles
of such a system when the parameters are small. However, for the general case
of the parameters (in particular, the parameters are large), the upper bound of
the limit cycles remains open. We completely provide the bifurcation diagram
for the one-equilibrium case. Moreover, we determine the amplitude of the two
limit cycles and estimate the position of the double-limit-cycle bifurcation
surface for the one-equilibrium case. Application 2 is presented to study the
limit cycles of a class of the Filippov system.
| math.CA | this paper presents new results on the limit cycles of a lienard system with symmetry allowing for discontinuity our results generalize and improve the results in 3334 the results in 34 are only valid for the smooth system we emphasize that our main results are valid for discontinuous systems moreover we show the presence and an explicit upper bound for the amplitude of the two limit cycles and we estimate the position of the doublelimitcycle bifurcation surface in the parameter space until now there is no result to determine the amplitude of the two limit cycles the existing results on the amplitude of limit cycles guarantee that the lienard system has a unique limit cycle finally some applications and examples are provided to show the effectiveness of our results we revisit a codimension3 lienard oscillator see 2132 in application 1 li and rousseau 21 studied the limit cycles of such a system when the parameters are small however for the general case of the parameters in particular the parameters are large the upper bound of the limit cycles remains open we completely provide the bifurcation diagram for the oneequilibrium case moreover we determine the amplitude of the two limit cycles and estimate the position of the doublelimitcycle bifurcation surface for the oneequilibrium case application 2 is presented to study the limit cycles of a class of the filippov system | [['this', 'paper', 'presents', 'new', 'results', 'on', 'the', 'limit', 'cycles', 'of', 'a', 'lienard', 'system', 'with', 'symmetry', 'allowing', 'for', 'discontinuity', 'our', 'results', 'generalize', 'and', 'improve', 'the', 'results', 'in', '3334', 'the', 'results', 'in', '34', 'are', 'only', 'valid', 'for', 'the', 'smooth', 'system', 'we', 'emphasize', 'that', 'our', 'main', 'results', 'are', 'valid', 'for', 'discontinuous', 'systems', 'moreover', 'we', 'show', 'the', 'presence', 'and', 'an', 'explicit', 'upper', 'bound', 'for', 'the', 'amplitude', 'of', 'the', 'two', 'limit', 'cycles', 'and', 'we', 'estimate', 'the', 'position', 'of', 'the', 'doublelimitcycle', 'bifurcation', 'surface', 'in', 'the', 'parameter', 'space', 'until', 'now', 'there', 'is', 'no', 'result', 'to', 'determine', 'the', 'amplitude', 'of', 'the', 'two', 'limit', 'cycles', 'the', 'existing', 'results', 'on', 'the', 'amplitude', 'of', 'limit', 'cycles', 'guarantee', 'that', 'the', 'lienard', 'system', 'has', 'a', 'unique', 'limit', 'cycle', 'finally', 'some', 'applications', 'and', 'examples', 'are', 'provided', 'to', 'show', 'the', 'effectiveness', 'of', 'our', 'results', 'we', 'revisit', 'a', 'codimension3', 'lienard', 'oscillator', 'see', '2132', 'in', 'application', '1', 'li', 'and', 'rousseau', '21', 'studied', 'the', 'limit', 'cycles', 'of', 'such', 'a', 'system', 'when', 'the', 'parameters', 'are', 'small', 'however', 'for', 'the', 'general', 'case', 'of', 'the', 'parameters', 'in', 'particular', 'the', 'parameters', 'are', 'large', 'the', 'upper', 'bound', 'of', 'the', 'limit', 'cycles', 'remains', 'open', 'we', 'completely', 'provide', 'the', 'bifurcation', 'diagram', 'for', 'the', 'oneequilibrium', 'case', 'moreover', 'we', 'determine', 'the', 'amplitude', 'of', 'the', 'two', 'limit', 'cycles', 'and', 'estimate', 'the', 'position', 'of', 'the', 'doublelimitcycle', 'bifurcation', 'surface', 'for', 'the', 'oneequilibrium', 'case', 'application', '2', 'is', 'presented', 'to', 'study', 'the', 'limit', 'cycles', 'of', 'a', 'class', 'of', 'the', 'filippov', 'system']] | [-0.18476319378448858, 0.0826201465866244, -0.04407777621527202, 0.051094560377403266, 0.003761732934249772, -0.07367683838432033, 0.09956418895731783, 0.2892460377017657, -0.20698509513090055, -0.2790708573328124, 0.17577557473158878, -0.25770647186837675, -0.1822693332621, 0.2687717973978983, -0.07332767084344394, 0.022254296551562018, 0.10385153380119139, 0.05834074130708662, -0.033716122414916755, -0.24819237187297807, 0.32879566500170365, -0.017241040566522214, 0.2298943095530073, 0.06584197776909503, 0.07321740121063258, -0.006025230805906985, 0.016885125651541683, 0.0025307544855038737, -0.18428511247692062, 0.08666610861817996, 0.2105360744965987, 0.07731959319725219, 0.1987746493352784, -0.38193563095293936, -0.1866859606260227, 0.11631836251252227, 0.1334670477722668, 0.1505144934128556, 0.005380731025296781, -0.22705143592320381, 0.0965519784639279, -0.14383326365302007, -0.19147099376552634, -0.06555946023513873, 0.05727022822532389, 0.05143621972296387, -0.26665041983955434, 0.03766969308464063, 0.13435607214561768, 0.0662105903834001, -0.08189415380772617, -0.1035735673084855, -0.018394915694370864, 0.1618603367830575, 0.040029140112714634, -0.005409425458767348, 0.07815311296273851, -0.12118326035121249, -0.09238802750491433, 0.3433307573695977, -0.08813023094941551, -0.16640964991775237, 0.19140762933115993, -0.1558906747483545, -0.17064041883788175, 0.10998004037472937, 0.12929253658693698, 0.11988631744972533, -0.1083257025762901, 0.1157905227240796, -0.042581849563866854, 0.15461948558015542, 0.07327729340849651, 0.00843637474372776, 0.1420224499060876, 0.169313879110333, 0.09827782532717619, 0.1486190127902147, -0.09981312004849315, -0.0862127661353184, -0.3359803674866756, -0.13610274836472752, -0.14336771418754427, 0.026916681323200464, -0.11410553494946928, -0.14370289316607845, 0.40486565054497786, 0.15467119617387654, 0.19860713411950404, 0.07782632242991692, 0.24711026082643203, 0.17682086390805327, -0.014105015093357199, 0.0865548443235457, 0.3027430518495385, 0.14661436191863483, 0.08295968649288019, -0.20195615105537904, 0.0012242790456447336, 0.08480750094064408] |
1,802.06602 | Group Theoretical Hidden Structure of Supergravity Theories in Higher
Dimensions | The purpose of my PhD thesis is to investigate different group theoretical
and geometrical aspects of supergravity theories. To this aim, several research
topics are explored: On one side, the construction of supergravity models in
diverse space-time dimensions, including the study of boundary contributions,
and the disclosure of the hidden gauge structure of these theories; on the
other side, the analysis of the algebraic links among different superalgebras
related to supergravity theories.
In the first three chapters, we give a general introduction and furnish the
theoretical background necessary for a clearer understanding of the thesis. We
then move to the original results of my PhD research activity: We start from
the development of the so called $AdS$-Lorentz supergravity in $D=4$ by
adopting the so called rheonomic approach and discuss on boundary contributions
to the theory. Subsequently, we focus on the analysis of the hidden gauge
structure of supersymmetric Free Differential Algebras. More precisely, we
concentrate on the hidden superalgebras underlying $D=11$ and $D=7$
supergravities, exploring the symmetries hidden in the theories and the
physical role of the nilpotent fermionic generators naturally appearing in the
aforementioned superalgebras. After that, we move to the pure algebraic and
group theoretical description of (super)algebras, focusing on new analytic
formulations of the so called $S$-expansion method. The final chapter contains
the summary of the results of my doctoral studies presented in the thesis and
possible future developments. In the Appendices, we collect notation, useful
formulas, and detailed calculations.
| hep-th | the purpose of my phd thesis is to investigate different group theoretical and geometrical aspects of supergravity theories to this aim several research topics are explored on one side the construction of supergravity models in diverse spacetime dimensions including the study of boundary contributions and the disclosure of the hidden gauge structure of these theories on the other side the analysis of the algebraic links among different superalgebras related to supergravity theories in the first three chapters we give a general introduction and furnish the theoretical background necessary for a clearer understanding of the thesis we then move to the original results of my phd research activity we start from the development of the so called adslorentz supergravity in d4 by adopting the so called rheonomic approach and discuss on boundary contributions to the theory subsequently we focus on the analysis of the hidden gauge structure of supersymmetric free differential algebras more precisely we concentrate on the hidden superalgebras underlying d11 and d7 supergravities exploring the symmetries hidden in the theories and the physical role of the nilpotent fermionic generators naturally appearing in the aforementioned superalgebras after that we move to the pure algebraic and group theoretical description of superalgebras focusing on new analytic formulations of the so called sexpansion method the final chapter contains the summary of the results of my doctoral studies presented in the thesis and possible future developments in the appendices we collect notation useful formulas and detailed calculations | [['the', 'purpose', 'of', 'my', 'phd', 'thesis', 'is', 'to', 'investigate', 'different', 'group', 'theoretical', 'and', 'geometrical', 'aspects', 'of', 'supergravity', 'theories', 'to', 'this', 'aim', 'several', 'research', 'topics', 'are', 'explored', 'on', 'one', 'side', 'the', 'construction', 'of', 'supergravity', 'models', 'in', 'diverse', 'spacetime', 'dimensions', 'including', 'the', 'study', 'of', 'boundary', 'contributions', 'and', 'the', 'disclosure', 'of', 'the', 'hidden', 'gauge', 'structure', 'of', 'these', 'theories', 'on', 'the', 'other', 'side', 'the', 'analysis', 'of', 'the', 'algebraic', 'links', 'among', 'different', 'superalgebras', 'related', 'to', 'supergravity', 'theories', 'in', 'the', 'first', 'three', 'chapters', 'we', 'give', 'a', 'general', 'introduction', 'and', 'furnish', 'the', 'theoretical', 'background', 'necessary', 'for', 'a', 'clearer', 'understanding', 'of', 'the', 'thesis', 'we', 'then', 'move', 'to', 'the', 'original', 'results', 'of', 'my', 'phd', 'research', 'activity', 'we', 'start', 'from', 'the', 'development', 'of', 'the', 'so', 'called', 'adslorentz', 'supergravity', 'in', 'd4', 'by', 'adopting', 'the', 'so', 'called', 'rheonomic', 'approach', 'and', 'discuss', 'on', 'boundary', 'contributions', 'to', 'the', 'theory', 'subsequently', 'we', 'focus', 'on', 'the', 'analysis', 'of', 'the', 'hidden', 'gauge', 'structure', 'of', 'supersymmetric', 'free', 'differential', 'algebras', 'more', 'precisely', 'we', 'concentrate', 'on', 'the', 'hidden', 'superalgebras', 'underlying', 'd11', 'and', 'd7', 'supergravities', 'exploring', 'the', 'symmetries', 'hidden', 'in', 'the', 'theories', 'and', 'the', 'physical', 'role', 'of', 'the', 'nilpotent', 'fermionic', 'generators', 'naturally', 'appearing', 'in', 'the', 'aforementioned', 'superalgebras', 'after', 'that', 'we', 'move', 'to', 'the', 'pure', 'algebraic', 'and', 'group', 'theoretical', 'description', 'of', 'superalgebras', 'focusing', 'on', 'new', 'analytic', 'formulations', 'of', 'the', 'so', 'called', 'sexpansion', 'method', 'the', 'final', 'chapter', 'contains', 'the', 'summary', 'of', 'the', 'results', 'of', 'my', 'doctoral', 'studies', 'presented', 'in', 'the', 'thesis', 'and', 'possible', 'future', 'developments', 'in', 'the', 'appendices', 'we', 'collect', 'notation', 'useful', 'formulas', 'and', 'detailed', 'calculations']] | [-0.09609709854607582, 0.09142961697686472, -0.0782824679231846, 0.08751757194215255, -0.14028071164471623, -0.13206216506659985, -0.00658819446897847, 0.30314580797708357, -0.2003649554115724, -0.2764028208771023, 0.10937786910543026, -0.2786997637611818, -0.192828343336091, 0.1255331741264588, -0.0975670402199715, -0.012712150154857601, 0.0057856177282615455, 0.0666023124480781, -0.10461117168280024, -0.3024170567408978, 0.37216379146049483, 0.0347417630513923, 0.26330233782284546, 0.04046205942492181, 0.07918644683826485, 0.012492299461239037, -0.09919170198440859, -0.032154837922181614, -0.17936339159499123, 0.19824712875264663, 0.25645217106173906, 0.13432538610741251, 0.21371820694987315, -0.46703510693899153, -0.18020598261620477, 0.03252483041690655, 0.1441887860941421, 0.13255595438922047, -0.015882383622221913, -0.2964559801827365, 0.03818927190880724, -0.15855477912420476, -0.14268861732679447, -0.06511518675469843, -0.004333305354670855, -0.07136590470398926, -0.1622799495129689, 0.010809233187699744, 0.07359055515451533, 0.10003441854337793, -0.0656974237845059, -0.14727675133518187, -0.035817869506784, 0.10538744947915214, 0.10018414445149562, -0.007996859603346835, 0.10899297054282125, -0.1598387828896564, -0.1608923858294164, 0.3617097310819606, 0.001511219749035536, -0.19518418703964813, 0.17224397146384474, -0.13792657912823797, -0.24680413088355013, 0.05225317111744741, 0.16134152575990054, 0.1608591973496536, -0.1557567603737614, 0.1560643419962081, -0.025505072333027873, 0.07840924171746207, 0.036362136618345364, 0.046166326768491264, 0.20712753098243425, 0.14569213524256708, -0.010555332042698446, 0.13698139072921886, 0.013366492982539866, -0.12369884842831388, -0.4334031491283588, -0.15899439703075718, -0.07896938270682262, 0.06048406848258534, -0.05139984107625895, -0.1273544344115895, 0.4613572962384732, 0.19603311233969842, 0.1319254889869641, 0.032387379417004286, 0.23826182472285787, 0.04846277596369585, 0.05527507950630376, 0.025182547930191146, 0.2112668805368582, 0.19014837934037693, 0.08665378995617246, -0.17259011055637963, -0.06813286816885258, 0.14332004989700492] |
1,802.06603 | Size-based termination of higher-order rewriting | We provide a general and modular criterion for the termination of
simply-typed $\lambda$ -calculus extended with function symbols defined by
user-defined rewrite rules. Following a work of Hughes, Pareto and Sabry for
functions defined with a fixpoint operator and pattern-matching, several
criteria use typing rules for bounding the height of arguments in function
calls. In this paper, we extend this approach to rewriting-based function
definitions and more general user-defined notions of size.
| cs.LO | we provide a general and modular criterion for the termination of simplytyped lambda calculus extended with function symbols defined by userdefined rewrite rules following a work of hughes pareto and sabry for functions defined with a fixpoint operator and patternmatching several criteria use typing rules for bounding the height of arguments in function calls in this paper we extend this approach to rewritingbased function definitions and more general userdefined notions of size | [['we', 'provide', 'a', 'general', 'and', 'modular', 'criterion', 'for', 'the', 'termination', 'of', 'simplytyped', 'lambda', 'calculus', 'extended', 'with', 'function', 'symbols', 'defined', 'by', 'userdefined', 'rewrite', 'rules', 'following', 'a', 'work', 'of', 'hughes', 'pareto', 'and', 'sabry', 'for', 'functions', 'defined', 'with', 'a', 'fixpoint', 'operator', 'and', 'patternmatching', 'several', 'criteria', 'use', 'typing', 'rules', 'for', 'bounding', 'the', 'height', 'of', 'arguments', 'in', 'function', 'calls', 'in', 'this', 'paper', 'we', 'extend', 'this', 'approach', 'to', 'rewritingbased', 'function', 'definitions', 'and', 'more', 'general', 'userdefined', 'notions', 'of', 'size']] | [-0.0789484108406921, 0.015520662631994734, -0.11560892859577304, 0.13602128780459882, -0.15017580353499702, -0.16580690702863243, 0.13401814871758688, 0.32162670670853305, -0.2907996511397262, -0.282931975244234, 0.044050320927959144, -0.19074215949513018, -0.1420133946618686, 0.16830769337765458, -0.10445915438079585, 0.09655657842651838, -0.012478986108261678, -0.001834099028605528, -0.10825404973972279, -0.21178807858248344, 0.3878510854329862, -0.013681451233828234, 0.18259875771279135, 0.07218638680771822, 0.06166802196003118, 0.09411545167677104, -0.082311482867226, 0.03198006461995343, -0.1938048052834347, 0.16062013012075718, 0.27423513973028296, 0.26412675051122075, 0.3219144235028782, -0.3903517963416461, -0.13562626779700318, 0.05785376890303774, 0.08709538848294567, 0.02546127394230603, 0.04144511998775771, -0.2594696840226081, 0.10612630398504229, -0.2210569493246213, -0.14300358249521297, -0.09081043538430499, 0.04403034191879366, 0.07837629745093484, -0.3077031511347741, -0.026079119260733325, 0.15052547865909421, 0.1291315569024947, -0.0716696350549076, -0.08592283194270244, 0.030818810369560704, 0.033032268408634186, -0.031585408866198525, 0.022036340941364568, 0.09232332118942092, -0.0876586747342824, -0.17444634929092395, 0.30797011983425665, -0.033940792449154995, -0.27059225923019564, 0.13682789753915536, -0.04036029194766241, -0.16535335468749204, 0.04010448064299352, 0.09521623915902132, 0.2035129053078385, -0.1557618419562156, 0.10406932150362991, -0.04163695663090847, 0.14707072359225196, 0.15732895581620848, 0.04459259480063338, 0.11133341966584946, 0.1454992142971605, 0.060322969091228314, 0.1903953497013491, 0.05281758862030175, -0.08121581097495639, -0.3765223756587754, -0.18253447844795623, -0.08548549053213922, -0.03332877768358836, -0.09989393017329146, -0.23621688157113063, 0.3916339828994953, 0.1373650420023801, 0.15666073600894176, 0.20550236052885237, 0.2792927009221684, 0.17524103180039674, 0.1231456251354454, 0.03905470542506211, 0.09486249087947524, 0.11989116720441315, 0.08501513224715988, -0.11512757786032227, 0.08324087449970345, 0.18065205136210555] |
1,802.06604 | Learning High-level Representations from Demonstrations | Hierarchical learning (HL) is key to solving complex sequential decision
problems with long horizons and sparse rewards. It allows learning agents to
break-up large problems into smaller, more manageable subtasks. A common
approach to HL, is to provide the agent with a number of high-level skills that
solve small parts of the overall problem. A major open question, however, is
how to identify a suitable set of reusable skills. We propose a principled
approach that uses human demonstrations to infer a set of subgoals based on
changes in the demonstration dynamics. Using these subgoals, we decompose the
learning problem into an abstract high-level representation and a set of
low-level subtasks. The abstract description captures the overall problem
structure, while subtasks capture desired skills. We demonstrate that we can
jointly optimize over both levels of learning. We show that the resulting
method significantly outperforms previous baselines on two challenging
problems: the Atari 2600 game Montezuma's Revenge, and a simulated robotics
problem moving the ant robot through a maze.
| cs.AI | hierarchical learning hl is key to solving complex sequential decision problems with long horizons and sparse rewards it allows learning agents to breakup large problems into smaller more manageable subtasks a common approach to hl is to provide the agent with a number of highlevel skills that solve small parts of the overall problem a major open question however is how to identify a suitable set of reusable skills we propose a principled approach that uses human demonstrations to infer a set of subgoals based on changes in the demonstration dynamics using these subgoals we decompose the learning problem into an abstract highlevel representation and a set of lowlevel subtasks the abstract description captures the overall problem structure while subtasks capture desired skills we demonstrate that we can jointly optimize over both levels of learning we show that the resulting method significantly outperforms previous baselines on two challenging problems the atari 2600 game montezumas revenge and a simulated robotics problem moving the ant robot through a maze | [['hierarchical', 'learning', 'hl', 'is', 'key', 'to', 'solving', 'complex', 'sequential', 'decision', 'problems', 'with', 'long', 'horizons', 'and', 'sparse', 'rewards', 'it', 'allows', 'learning', 'agents', 'to', 'breakup', 'large', 'problems', 'into', 'smaller', 'more', 'manageable', 'subtasks', 'a', 'common', 'approach', 'to', 'hl', 'is', 'to', 'provide', 'the', 'agent', 'with', 'a', 'number', 'of', 'highlevel', 'skills', 'that', 'solve', 'small', 'parts', 'of', 'the', 'overall', 'problem', 'a', 'major', 'open', 'question', 'however', 'is', 'how', 'to', 'identify', 'a', 'suitable', 'set', 'of', 'reusable', 'skills', 'we', 'propose', 'a', 'principled', 'approach', 'that', 'uses', 'human', 'demonstrations', 'to', 'infer', 'a', 'set', 'of', 'subgoals', 'based', 'on', 'changes', 'in', 'the', 'demonstration', 'dynamics', 'using', 'these', 'subgoals', 'we', 'decompose', 'the', 'learning', 'problem', 'into', 'an', 'abstract', 'highlevel', 'representation', 'and', 'a', 'set', 'of', 'lowlevel', 'subtasks', 'the', 'abstract', 'description', 'captures', 'the', 'overall', 'problem', 'structure', 'while', 'subtasks', 'capture', 'desired', 'skills', 'we', 'demonstrate', 'that', 'we', 'can', 'jointly', 'optimize', 'over', 'both', 'levels', 'of', 'learning', 'we', 'show', 'that', 'the', 'resulting', 'method', 'significantly', 'outperforms', 'previous', 'baselines', 'on', 'two', 'challenging', 'problems', 'the', 'atari', '2600', 'game', 'montezumas', 'revenge', 'and', 'a', 'simulated', 'robotics', 'problem', 'moving', 'the', 'ant', 'robot', 'through', 'a', 'maze']] | [-0.04683165245446862, 0.013938326654278863, -0.10266113918118491, 0.07561725568135051, -0.17310036716056976, -0.17155227763578296, 0.03910887438973306, 0.4456754064488554, -0.30810145111643, -0.3651005244161376, 0.0389437041402945, -0.2239894183202888, -0.19111132215775414, 0.17563432731671247, -0.14610693771615177, 0.07372694838412865, 0.16053194374481808, 0.013239745492802955, -0.03317094145030408, -0.2557446093780886, 0.302706714819916, -0.030406826089309183, 0.24790871386488755, 0.013966299908536815, 0.18821569897156365, 0.0034099566302517384, 0.015527971973503288, 0.02008990062579156, -0.04408773547543832, 0.17664692834795007, 0.37530505349775944, 0.2561028948901388, 0.4193443142583114, -0.4418205423503668, -0.17450158743391336, 0.06475775250272747, 0.1250761243010018, 0.09460235478058122, 0.019574916237964528, -0.3449873533378729, 0.07518087941762841, -0.13213329680520527, -0.0069389537305844405, -0.12009850530717857, -0.005143769229009391, -0.061108632326547146, -0.28722658407808876, -0.04308546787688319, 0.06218717363523598, 0.01718190881914409, -0.10053640337483846, -0.11346796237791103, 0.05539685868223136, 0.1954118031813222, 0.012660851823389083, 0.04402576676224119, 0.1773285702425808, -0.16137586531234893, -0.18769120914627335, 0.4021175162208651, 0.00028811748178597695, -0.21109796183819543, 0.22656706792112818, -0.020994676042816598, -0.15352327226588647, 0.1161383101326263, 0.25400877427198215, 0.1583775444692391, -0.14791396205643928, 0.03260383981560262, -0.0762287084358984, 0.227606254281939, 0.019996326015899683, -0.05320166246017475, 0.1833841268832009, 0.2809749808550037, 0.09885551939400548, 0.1486174824987789, -0.029398766669729157, -0.14043684070232787, -0.211100322333817, -0.1179654900832269, -0.12735835835895318, -0.02597165033695271, -0.09039270356731437, -0.13549718501403213, 0.3927678065318726, 0.2116797327431348, 0.1946019523464768, 0.13002838694049926, 0.3549571991702932, 0.06343222335132584, 0.06093862191474199, 0.11760613620964375, 0.12416405183357929, 0.0007429262762610427, 0.11172615117491028, -0.2282051783261408, 0.0827509720369192, 0.04096833775851675] |
1,802.06605 | A Helium-Surface Interaction Potential of Bi$_2$Te$_3$(111) from
Ultrahigh-Resolution Spin-Echo Measurements | We have determined an atom-surface interaction potential for the
He$-$Bi$_2$Te$_3$(111) system by analysing ultrahigh resolution measurements of
selective adsorption resonances. The experimental measurements were obtained
using $^3$He spin-echo spectrometry. Following an initial free-particle model
analysis, we use elastic close-coupling calculations to obtain a
three-dimensional potential. The three-dimensional potential is then further
refined based on the experimental data set, giving rise to an optimised
potential which fully reproduces the experimental data. Based on this analysis,
the He$-$Bi$_2$Te$_3$(111) interaction potential can be described by a
corrugated Morse potential with a well depth $D=(6.22\pm0.05)~\mathrm{meV}$, a
stiffness $\kappa =(0.92\pm0.01)~\mathrm{\AA}^{-1}$ and a surface electronic
corrugation of $(9.6\pm0.2)$% of the lattice constant. The improved
uncertainties of the atom-surface interaction potential should also enable the
use in inelastic close-coupled calculations in order to eventually study the
temperature dependence and the line width of selective adsorption resonances.
| cond-mat.mtrl-sci cond-mat.mes-hall | we have determined an atomsurface interaction potential for the hebi_2te_3111 system by analysing ultrahigh resolution measurements of selective adsorption resonances the experimental measurements were obtained using 3he spinecho spectrometry following an initial freeparticle model analysis we use elastic closecoupling calculations to obtain a threedimensional potential the threedimensional potential is then further refined based on the experimental data set giving rise to an optimised potential which fully reproduces the experimental data based on this analysis the hebi_2te_3111 interaction potential can be described by a corrugated morse potential with a well depth d622pm005mathrmmev a stiffness kappa 092pm001mathrmaa1 and a surface electronic corrugation of 96pm02 of the lattice constant the improved uncertainties of the atomsurface interaction potential should also enable the use in inelastic closecoupled calculations in order to eventually study the temperature dependence and the line width of selective adsorption resonances | [['we', 'have', 'determined', 'an', 'atomsurface', 'interaction', 'potential', 'for', 'the', 'hebi_2te_3111', 'system', 'by', 'analysing', 'ultrahigh', 'resolution', 'measurements', 'of', 'selective', 'adsorption', 'resonances', 'the', 'experimental', 'measurements', 'were', 'obtained', 'using', '3he', 'spinecho', 'spectrometry', 'following', 'an', 'initial', 'freeparticle', 'model', 'analysis', 'we', 'use', 'elastic', 'closecoupling', 'calculations', 'to', 'obtain', 'a', 'threedimensional', 'potential', 'the', 'threedimensional', 'potential', 'is', 'then', 'further', 'refined', 'based', 'on', 'the', 'experimental', 'data', 'set', 'giving', 'rise', 'to', 'an', 'optimised', 'potential', 'which', 'fully', 'reproduces', 'the', 'experimental', 'data', 'based', 'on', 'this', 'analysis', 'the', 'hebi_2te_3111', 'interaction', 'potential', 'can', 'be', 'described', 'by', 'a', 'corrugated', 'morse', 'potential', 'with', 'a', 'well', 'depth', 'd622pm005mathrmmev', 'a', 'stiffness', 'kappa', '092pm001mathrmaa1', 'and', 'a', 'surface', 'electronic', 'corrugation', 'of', '96pm02', 'of', 'the', 'lattice', 'constant', 'the', 'improved', 'uncertainties', 'of', 'the', 'atomsurface', 'interaction', 'potential', 'should', 'also', 'enable', 'the', 'use', 'in', 'inelastic', 'closecoupled', 'calculations', 'in', 'order', 'to', 'eventually', 'study', 'the', 'temperature', 'dependence', 'and', 'the', 'line', 'width', 'of', 'selective', 'adsorption', 'resonances']] | [-0.0992354763803809, 0.11799584365562352, -0.1121270591879625, 0.029310538054708003, -0.03945335736776243, -0.1294422339919065, 0.06902353634446193, 0.38763827356204056, -0.2469501830637455, -0.2961376258736796, 0.033876416852016616, -0.30820200386554447, -0.11508884652754042, 0.18769805718373173, 0.05520349820908993, 0.09845904325510361, 0.08859100049003653, -0.018771877507123152, -0.060313195316816, -0.17631611051454918, 0.30065920894770926, 0.12384528901302881, 0.25050584971904755, 0.1750499516544836, 0.026661763542832166, 0.05588819764714355, 0.017695717607388525, 0.030101685576252084, -0.20172687333230097, 0.1417874755449037, 0.17998337239303291, -0.009989730992924366, 0.17593364686307275, -0.4486244647562115, -0.2460275013416783, 0.0363094864652923, 0.14745013586092573, 0.1647228938657721, -0.07910661492409851, -0.3046640383510558, 0.010568427491877506, -0.1513837219677247, -0.1611015547662904, -0.13472741537852517, 0.014693459890324122, 0.06048186572178253, -0.2761108319886696, 0.05684669036917743, -0.03203262944632808, 0.08532490244440634, -0.14769886408015084, -0.1164144656243873, -0.024118892148262197, 0.08302042382046469, -0.0050325445516326865, 0.05063089116914337, 0.16671623547783873, -0.07954812978234475, -0.08196507384583576, 0.3777785500400324, -0.11072863225821655, -0.1756475706202058, 0.16273033346827906, -0.11905078700250153, -0.06752489048834723, 0.1580159899695262, 0.15433864100009148, 0.0723957513465977, -0.16246518918743996, 0.07453007991657003, 0.022633118773011295, 0.1916795111080604, 0.0623432887203769, -0.005615291501040945, 0.16876833457256488, 0.21858951405608165, -0.004055059585744626, 0.10096705121026416, -0.13924663520154001, -0.03928104983364691, -0.27168740740101505, -0.11791414115816848, -0.19523515123804447, 0.032285865328497074, -0.06727048448515438, -0.16862328517521774, 0.3888478968570481, 0.13206432851851543, 0.22145832826230508, -0.0017938296816228374, 0.2897184054148314, 0.12049729982836245, 0.05594860709015169, -0.03262741737582012, 0.27550074130074304, 0.1677760562508492, 0.08296055320316731, -0.27509022665248295, 0.0242716590005126, 0.015331138669054455] |
1,802.06606 | A variational approach to Navier-Stokes | We present a variational resolution of the incompressible Navier-Stokes
system by means of stabilized Weighted-Inertia-Dissipation-Energy (WIDE)
functionals. The minimization of these parameter-dependent functionals
corresponds to an elliptic-in-time regularization of the system. By passing to
the limit in the regularization parameter along subsequences of WIDE minimizers
one recovers a classical Leray-Hopf weak solution.
| math.AP cond-mat.other | we present a variational resolution of the incompressible navierstokes system by means of stabilized weightedinertiadissipationenergy wide functionals the minimization of these parameterdependent functionals corresponds to an ellipticintime regularization of the system by passing to the limit in the regularization parameter along subsequences of wide minimizers one recovers a classical lerayhopf weak solution | [['we', 'present', 'a', 'variational', 'resolution', 'of', 'the', 'incompressible', 'navierstokes', 'system', 'by', 'means', 'of', 'stabilized', 'weightedinertiadissipationenergy', 'wide', 'functionals', 'the', 'minimization', 'of', 'these', 'parameterdependent', 'functionals', 'corresponds', 'to', 'an', 'ellipticintime', 'regularization', 'of', 'the', 'system', 'by', 'passing', 'to', 'the', 'limit', 'in', 'the', 'regularization', 'parameter', 'along', 'subsequences', 'of', 'wide', 'minimizers', 'one', 'recovers', 'a', 'classical', 'lerayhopf', 'weak', 'solution']] | [-0.18726156487451484, 0.014775768737594014, -0.09617139011913654, 0.06268140430763072, -0.012345525454364572, -0.10569719933703833, 0.006421933740413948, 0.2690141846736272, -0.3808748144291195, -0.26519970407746, 0.11441777156227652, -0.2728348830166985, -0.06894138616089728, 0.15602326550173992, -0.0979954251088202, 0.15671477597389444, 0.09460659595388993, -0.03787956427892342, -0.1304472404733008, -0.2084485684503235, 0.3415091914289138, -0.01616911935236524, 0.24006097860561282, -0.038834731258890205, 0.17997809996207556, 0.03308870751118543, 0.08498895697880025, 0.04493738979320316, -0.18782841498214825, 0.12055228168473524, 0.2326466351765774, 0.0507421567762161, 0.3658385048346484, -0.37483224367686346, -0.2602071889183101, 0.08405777238601563, 0.15519940429458431, 0.09375749634323167, 0.01114426746818365, -0.29747325585534173, 0.10179764544591308, -0.1455066647179717, -0.1626778204980142, -0.14369861376197898, -0.05581993960282382, 0.115070103631154, -0.2823476460123179, 0.1424441301610832, 0.05230951506425353, 0.03907761713672502, -0.16599259629626484, -0.0892368108079787, -0.0040890470845624804, 0.03469253073939506, 0.11990721633329111, 0.055469817468239105, 0.0715916841199585, -0.15333146891355806, -0.040018469990030225, 0.34545093343830574, -0.11783757472556888, -0.2594651848342562, 0.18137999423140405, -0.06655123174263566, -0.09681699297610014, 0.1905849294773504, 0.10518764174890284, 0.19751388191555938, -0.16152754787574797, 0.1516487775644397, -0.039348151343052876, 0.1680194780449657, 0.04516352879285228, -0.0012760637373681746, 0.1111203180078198, 0.17038386295019997, 0.21695115196281203, 0.16160803364918513, -0.0891620596395988, -0.13832048228120103, -0.3661674766929126, -0.12708730674257465, -0.21382134597675473, 0.06455282888411745, -0.15777039235485169, -0.22788593284420522, 0.35032376639691054, 0.131722235334261, 0.15812924506106213, 0.046505214372540224, 0.20104900166830597, 0.17377552594624313, 0.018433770146586148, 0.0441313942074867, 0.24371179065429696, 0.1661121944632089, 0.0806710244539906, -0.2038437961007231, -0.03291331453467993, 0.21248644610465156] |
1,802.06607 | Harmonic functions, conjugate harmonic functions and the Hardy space
$H^1$ in the rational Dunkl setting | In this work we extend the theory of the classical Hardy space $H^1$ to the
rational Dunkl setting. Specifically, let $\Delta$ be the Dunkl Laplacian on a
Euclidean space $\mathbb{R}^N$. On the half-space
$\mathbb{R}_+\times\mathbb{R}^N$, we consider systems of conjugate
$(\partial_t^2+\Delta_{\mathbf{x}})$-harmonic functions satisfying an
appropriate uniform $L^1$ condition. We prove that the boundary values of such
harmonic functions, which constitute the real Hardy space $H^1$, can be
characterized in several different ways, namely by means of atoms, Riesz
transforms, maximal functions or Littlewood-Paley square functions.
| math.FA | in this work we extend the theory of the classical hardy space h1 to the rational dunkl setting specifically let delta be the dunkl laplacian on a euclidean space mathbbrn on the halfspace mathbbr_timesmathbbrn we consider systems of conjugate partial_t2delta_mathbfxharmonic functions satisfying an appropriate uniform l1 condition we prove that the boundary values of such harmonic functions which constitute the real hardy space h1 can be characterized in several different ways namely by means of atoms riesz transforms maximal functions or littlewoodpaley square functions | [['in', 'this', 'work', 'we', 'extend', 'the', 'theory', 'of', 'the', 'classical', 'hardy', 'space', 'h1', 'to', 'the', 'rational', 'dunkl', 'setting', 'specifically', 'let', 'delta', 'be', 'the', 'dunkl', 'laplacian', 'on', 'a', 'euclidean', 'space', 'mathbbrn', 'on', 'the', 'halfspace', 'mathbbr_timesmathbbrn', 'we', 'consider', 'systems', 'of', 'conjugate', 'partial_t2delta_mathbfxharmonic', 'functions', 'satisfying', 'an', 'appropriate', 'uniform', 'l1', 'condition', 'we', 'prove', 'that', 'the', 'boundary', 'values', 'of', 'such', 'harmonic', 'functions', 'which', 'constitute', 'the', 'real', 'hardy', 'space', 'h1', 'can', 'be', 'characterized', 'in', 'several', 'different', 'ways', 'namely', 'by', 'means', 'of', 'atoms', 'riesz', 'transforms', 'maximal', 'functions', 'or', 'littlewoodpaley', 'square', 'functions']] | [-0.10930352330828233, 0.137567004173456, -0.04703761299890352, 0.0883248871655158, -0.0877471152783894, -0.06487910985015333, -0.028839862574652837, 0.3531326441912026, -0.32946944424723523, -0.11797721000535913, 0.11747202882401236, -0.28543311185998527, -0.15313947755877474, 0.19606986961884015, -0.07623266894938197, 0.09718273682736298, 0.005225289737942015, 0.034034871246393136, -0.15502800182836904, -0.26012306955995085, 0.4216081697050845, -0.06787132836378566, 0.17834999783691474, 0.012409791222591771, 0.07861904023646764, 0.033161251639617924, 0.0032990286126732826, -0.056966355409424914, -0.21714103340340576, 0.1744758348071539, 0.22636738831245498, 0.0781564965713542, 0.33909482772393923, -0.4379960395304895, -0.2143237057579227, 0.25673470014660826, 0.16221250132544013, -0.08101811562238898, 0.016184679533513945, -0.3317979366245975, 0.014867881588387961, -0.07343558388444163, -0.18254722761012976, -0.09853810613702346, -0.020290659536130545, 0.08856044055485143, -0.353580185711929, 0.0809540490040601, 0.08318829043518479, 0.07652420492661072, -0.14862392024597063, -0.1386568844204814, 0.004315739997276445, 0.036387059732522, -0.04964795320936501, 0.1084234950802766, 0.08290618797764182, -0.012235992130959725, -0.11278939879323333, 0.339573905417105, -0.06597896506328409, -0.33796724250040405, 0.10558177754510104, -0.2241266745443615, -0.1063201230575853, -0.00615845497970174, 0.1477004325744219, 0.13999315428479417, -0.09499635506512188, 0.2120269484386393, -0.11474371557095565, 0.1058852101148038, 0.14407088517824687, 0.05163152533492482, 0.05106956940485028, 0.0438174307346344, 0.19115487627526065, 0.18623294220476344, 0.007212636280001323, -0.0923700841234588, -0.38008985323149985, -0.19683765390569843, -0.2341258199204032, 0.0750578682778812, -0.15890435514852358, -0.18267156215520894, 0.3342900861156877, 0.03430721522294689, 0.18392256202982601, 0.0816422030883387, 0.19423184501824947, 0.17928933861052118, 0.05885183173458933, 0.032280620278381716, 0.14183927451192244, 0.16397157428138776, 0.05604449581218565, -0.13556961012186436, -0.0630152091134067, 0.2189769512496707] |
1,802.06608 | Classical Lie symmetries and reductions for a generalized NLS equation
in 2+1 dimensions | A non-isospectral linear problem for an integrable 2+1 generalization of the
non linear Schr\"odinger equation, which includes dispersive terms of third and
fourth order, is presented. The classical symmetries of the Lax pair and the
related reductions are carefully studied. We obtain several reductions of the
Lax pair that yield in some cases non-isospectral problems in 1+1 dimensions.
| nlin.SI | a nonisospectral linear problem for an integrable 21 generalization of the non linear schrodinger equation which includes dispersive terms of third and fourth order is presented the classical symmetries of the lax pair and the related reductions are carefully studied we obtain several reductions of the lax pair that yield in some cases nonisospectral problems in 11 dimensions | [['a', 'nonisospectral', 'linear', 'problem', 'for', 'an', 'integrable', '21', 'generalization', 'of', 'the', 'non', 'linear', 'schrodinger', 'equation', 'which', 'includes', 'dispersive', 'terms', 'of', 'third', 'and', 'fourth', 'order', 'is', 'presented', 'the', 'classical', 'symmetries', 'of', 'the', 'lax', 'pair', 'and', 'the', 'related', 'reductions', 'are', 'carefully', 'studied', 'we', 'obtain', 'several', 'reductions', 'of', 'the', 'lax', 'pair', 'that', 'yield', 'in', 'some', 'cases', 'nonisospectral', 'problems', 'in', '11', 'dimensions']] | [-0.13167849053018565, 0.033587706779332524, 0.012095311255162132, 0.11890997398235224, -0.07849622846195667, -0.14627569148734468, -0.08302675845936455, 0.2797706194928494, -0.30433658440597355, -0.2487743215250044, 0.11557752378726506, -0.32893061592918016, -0.1511435536346559, 0.1936021203110958, -0.008358277524982033, 0.10631807119553459, 0.060798825872740866, 0.05300489430925969, -0.16552145384920205, -0.3278302826180026, 0.35911405377154204, -0.06306968481934244, 0.20352287391393348, 0.018580109972892136, 0.157735899853488, 0.014796201200906894, -0.06235635818528204, -0.0215110518216722, -0.08979886635429936, 0.10322379598450236, 0.24639789679826335, 0.030813243075530846, 0.19032221321209236, -0.3594555818347325, -0.1840740341917965, 0.11053176498008442, 0.14008802623520122, 0.1329663592101685, -0.018193271171686978, -0.28863691583532713, 0.04830268670901142, -0.16539618253290397, -0.19431103340446435, -0.059201453182171904, 0.026679698409962243, 0.06509026762997282, -0.25761184472076853, 0.13139622093274675, 0.14343631428923329, 0.01383031880736937, -0.09133402870743182, -0.0820910351768393, -0.050423124668605886, 0.02950243969801171, 0.004506678854372224, -0.06461234173159404, -0.04606276747353118, -0.10848803021383055, -0.17989913237698632, 0.4401680935366914, -0.04208719281375344, -0.2990648375567177, 0.1662402999735887, -0.041465101297944784, -0.16521759639526234, 0.12461433034582899, 0.15149287086237093, 0.10554144601337612, -0.20337848278597512, 0.12985245170320608, -0.08274342222460385, 0.12152032672973542, 0.14275889537811023, 0.039794480241433686, 0.10402902411618109, 0.09492376231556308, 0.06428764664752666, 0.16327261631698187, 0.008415716804628229, -0.16515707147532496, -0.38435632831834515, -0.14939237607578779, -0.08174281655650201, 0.046499106278321864, -0.09502068866026218, -0.14590088607229548, 0.4092526473104954, 0.06604784993948576, 0.15400351732086134, 0.04668974905507639, 0.143499075659904, 0.24344155956701985, 0.027982773716914756, 0.025755815047385364, 0.22715044101340906, 0.225041215500698, 0.12615311263803522, -0.24716608816605254, -0.12695639028117575, 0.1878621009146345] |
1,802.06609 | On the computation of Shannon Entropy from Counting Bloom Filters | In this short note a method for computing the naive plugin estimator of
discrete entropy from a counting Bloom filter will be presented. The method
does work reasonably as long as the collision probability in the bloom filter
is kept low.
| cs.IT eess.SP math.IT | in this short note a method for computing the naive plugin estimator of discrete entropy from a counting bloom filter will be presented the method does work reasonably as long as the collision probability in the bloom filter is kept low | [['in', 'this', 'short', 'note', 'a', 'method', 'for', 'computing', 'the', 'naive', 'plugin', 'estimator', 'of', 'discrete', 'entropy', 'from', 'a', 'counting', 'bloom', 'filter', 'will', 'be', 'presented', 'the', 'method', 'does', 'work', 'reasonably', 'as', 'long', 'as', 'the', 'collision', 'probability', 'in', 'the', 'bloom', 'filter', 'is', 'kept', 'low']] | [-0.055493997409939766, 0.06803484674452281, -0.16849838151800922, 0.11062867694148203, -0.03887976590748422, -0.18000960284162584, 0.0682640508521439, 0.3905588597422693, -0.2711229386012547, -0.29151147797067717, 0.13772442626267126, -0.2219165353695067, -0.14009642825893512, 0.1842327478182752, -0.17325344445501886, 0.10401908935206693, 0.0691271337975816, 0.049182774567204275, -0.029452675374270213, -0.25755794593928066, 0.17737974321878539, 0.14932656792424073, 0.28996861489807685, 0.035167717079563836, 0.10514061118862252, 0.056434367567573376, -0.10528337576131268, 0.017285030834921975, -0.07061119862582262, 0.07750089823200208, 0.27778340898817633, 0.14965775658989824, 0.3334316827084233, -0.326254215591201, -0.14045810258788308, 0.09696692730322844, 0.17140396730974317, 0.15076318982897735, -0.036292355053308537, -0.2416292820580122, 0.11882514690571441, -0.26489460213882166, -0.09566883893865274, -0.05210356977654666, -0.02210836298763752, 0.09417099151306035, -0.2996042899605704, 0.061252295195761065, 0.08318653640269143, 0.014713025220283648, 0.024388264455809827, -0.1121781948590424, 0.031430739841264925, 0.04753743693595979, 0.025351749818272342, 0.03038159803282924, 0.11550426555842888, -0.04609876972759461, -0.10122661887690788, 0.3011441636921429, -0.12453274006342016, -0.20745055872674395, 0.15133897994684692, -0.055663799736421646, -0.11991797005984842, 0.14367562697110017, 0.14628079053150808, 0.15587035673329744, -0.19116910510673757, 0.08081654312228216, -0.05625551248469004, 0.15564183651174351, 0.05410047241191312, 0.05862730418945231, 0.16923809178718707, 0.16880536129380144, 0.1295099004694238, 0.1101428771862851, -0.14485947061159715, -0.0558735808618821, -0.36503463420199184, -0.16903950937274026, -0.32193073096526104, 4.304437784523499e-05, -0.04844446236085964, -0.2203549540987829, 0.3568630100983172, 0.19198068903713691, 0.217943559855041, 0.12779018958099186, 0.3559623717716554, 0.15284315325751355, 0.07489092080149709, 0.1000189515875607, 0.14554135528642956, 0.059584942510033524, 0.15238839067609572, -0.147344596155851, 0.06480669342662866, 0.11611247737324093] |
1,802.0661 | Non-perturbative method to compute thermal correlations in
one-dimensional systems | We develop a highly efficient method to numerically simulate thermal
fluctuations and correlations in non-relativistic continuous bosonic
one-dimensional systems. The method is suitable for arbitrary local
interactions as long as the system remains dynamically stable. We start by
proving the equivalence of describing the systems through the transfer matrix
formalism and a Fokker-Planck equation for a distribution evolving in space.
The Fokker-Planck equation is known to be equivalent to a stochastic
differential (It\={o}) equation. The latter is very suitable for computer
simulations, allowing the calculation of any desired correlation function. As
an illustration, we apply our method to the case of two tunnel-coupled
quasi-condensates of bosonic atoms. The results are compared to the predictions
of the sine-Gordon model for which we develop analytic expressions directly
from the transfer matrix formalism.
| cond-mat.quant-gas cond-mat.stat-mech | we develop a highly efficient method to numerically simulate thermal fluctuations and correlations in nonrelativistic continuous bosonic onedimensional systems the method is suitable for arbitrary local interactions as long as the system remains dynamically stable we start by proving the equivalence of describing the systems through the transfer matrix formalism and a fokkerplanck equation for a distribution evolving in space the fokkerplanck equation is known to be equivalent to a stochastic differential ito equation the latter is very suitable for computer simulations allowing the calculation of any desired correlation function as an illustration we apply our method to the case of two tunnelcoupled quasicondensates of bosonic atoms the results are compared to the predictions of the sinegordon model for which we develop analytic expressions directly from the transfer matrix formalism | [['we', 'develop', 'a', 'highly', 'efficient', 'method', 'to', 'numerically', 'simulate', 'thermal', 'fluctuations', 'and', 'correlations', 'in', 'nonrelativistic', 'continuous', 'bosonic', 'onedimensional', 'systems', 'the', 'method', 'is', 'suitable', 'for', 'arbitrary', 'local', 'interactions', 'as', 'long', 'as', 'the', 'system', 'remains', 'dynamically', 'stable', 'we', 'start', 'by', 'proving', 'the', 'equivalence', 'of', 'describing', 'the', 'systems', 'through', 'the', 'transfer', 'matrix', 'formalism', 'and', 'a', 'fokkerplanck', 'equation', 'for', 'a', 'distribution', 'evolving', 'in', 'space', 'the', 'fokkerplanck', 'equation', 'is', 'known', 'to', 'be', 'equivalent', 'to', 'a', 'stochastic', 'differential', 'ito', 'equation', 'the', 'latter', 'is', 'very', 'suitable', 'for', 'computer', 'simulations', 'allowing', 'the', 'calculation', 'of', 'any', 'desired', 'correlation', 'function', 'as', 'an', 'illustration', 'we', 'apply', 'our', 'method', 'to', 'the', 'case', 'of', 'two', 'tunnelcoupled', 'quasicondensates', 'of', 'bosonic', 'atoms', 'the', 'results', 'are', 'compared', 'to', 'the', 'predictions', 'of', 'the', 'sinegordon', 'model', 'for', 'which', 'we', 'develop', 'analytic', 'expressions', 'directly', 'from', 'the', 'transfer', 'matrix', 'formalism']] | [-0.09412440280071818, 0.1045391621651316, -0.11965804844243953, 0.10825638126563997, -0.029771677734187017, -0.15503454282655954, -0.006312977386495242, 0.35086289273145105, -0.28017410348670985, -0.26601431207158244, 0.06152379907345256, -0.2649521311745048, -0.15853867826875873, 0.19475734338271788, 0.029605890867801812, 0.10102013689824021, 0.05865826739105754, 0.003039565927778872, -0.09946506148687778, -0.1956005850305351, 0.32266032877736367, 0.03243571501941635, 0.25166284213415707, 0.0005339011746960191, 0.12366213449276983, 0.031011613490073406, 0.009866777922098453, -0.013302441618557518, -0.11418570536188781, 0.11106314827831319, 0.2304669089615345, 0.051124552386597945, 0.24249663503768926, -0.44511100651266483, -0.22215260593936995, 0.0777390571570812, 0.16906432180213204, 0.1995136024027418, -0.02483156977687031, -0.2800712865114642, 0.03977440544224989, -0.2027419170185637, -0.17532775631675926, -0.11841832950281408, 0.03745779171406936, 0.028841900491478063, -0.3075958356798555, 0.09098958764314795, 0.03391686414296811, -0.02032773127318181, -0.09590070477928608, -0.041636289673176806, -0.0011690724264973632, 0.1074370094225742, -0.029695816938944446, 0.001187176164239645, 0.11996486962486345, -0.11446741882783289, -0.08289874923872188, 0.3851475175828315, -0.119484635677117, -0.2717710930442151, 0.18110159366176679, -0.10156886797183408, -0.08274561662513476, 0.11829912431824666, 0.14426994915299404, 0.16523463268979238, -0.2078332799450996, 0.09201258089518748, -0.032160810889819494, 0.1274313582517117, -0.009354658793801299, -0.010425836376201075, 0.16989779894670043, 0.16357125599796957, 0.03634310732774723, 0.18052667520600013, -0.02272136712160248, -0.17532964811588708, -0.3013900053472473, -0.17685644850095672, -0.18992412177702556, 0.06567611176377305, -0.07513299071780728, -0.1858136576295902, 0.3610774100650675, 0.18407450477377726, 0.17269735181560883, 0.0754377121809879, 0.2969865390744347, 0.2125063599087298, 0.006575269588770775, 0.040474283028967106, 0.18412702908166326, 0.20408799048298254, 0.09306940488481465, -0.24642369639522468, 0.01990545735573575, 0.09030897426060759] |
1,802.06611 | $PI$-eigenfunctions of the Star graphs | We consider the symmetric group $\mathrm{Sym}_n,\,n\geqslant 2$, generated by
the set $S$ of transpositions $(1~i),\,2 \leqslant i \leqslant n$, and the
Cayley graph $S_n=Cay(\mathrm{Sym}_n,S)$ called the Star graph. For any
positive integers $n\geqslant 3$ and $m$ with $n > 2m$, we present a family of
$PI$-eigenfunctions of $S_n$ with eigenvalue $n-m-1$. We establish a connection
of these functions with the standard basis of a Specht module. In the case of
largest non-principal eigenvalue $n-2$ we prove that any eigenfunction of $S_n$
can be reconstructed by its values on the second neighbourhood of a vertex.
| math.CO math.RT | we consider the symmetric group mathrmsym_nngeqslant 2 generated by the set s of transpositions 1i2 leqslant i leqslant n and the cayley graph s_ncaymathrmsym_ns called the star graph for any positive integers ngeqslant 3 and m with n 2m we present a family of pieigenfunctions of s_n with eigenvalue nm1 we establish a connection of these functions with the standard basis of a specht module in the case of largest nonprincipal eigenvalue n2 we prove that any eigenfunction of s_n can be reconstructed by its values on the second neighbourhood of a vertex | [['we', 'consider', 'the', 'symmetric', 'group', 'mathrmsym_nngeqslant', '2', 'generated', 'by', 'the', 'set', 's', 'of', 'transpositions', '1i2', 'leqslant', 'i', 'leqslant', 'n', 'and', 'the', 'cayley', 'graph', 's_ncaymathrmsym_ns', 'called', 'the', 'star', 'graph', 'for', 'any', 'positive', 'integers', 'ngeqslant', '3', 'and', 'm', 'with', 'n', '2m', 'we', 'present', 'a', 'family', 'of', 'pieigenfunctions', 'of', 's_n', 'with', 'eigenvalue', 'nm1', 'we', 'establish', 'a', 'connection', 'of', 'these', 'functions', 'with', 'the', 'standard', 'basis', 'of', 'a', 'specht', 'module', 'in', 'the', 'case', 'of', 'largest', 'nonprincipal', 'eigenvalue', 'n2', 'we', 'prove', 'that', 'any', 'eigenfunction', 'of', 's_n', 'can', 'be', 'reconstructed', 'by', 'its', 'values', 'on', 'the', 'second', 'neighbourhood', 'of', 'a', 'vertex']] | [-0.20088579553817765, 0.1267730603413133, -0.013731982621751475, 0.0026080499539214573, -0.043366086334408666, -0.13079345894433306, 0.011172956637933516, 0.3493600526950165, -0.2540574740158038, -0.25504401819047967, 0.09876876145344897, -0.32213919354456194, -0.11709198164701294, 0.10455637648335417, -0.015447924122884033, -0.0018019569809470074, 0.07940311903615346, 0.15616745706856922, -0.07642887010150118, -0.24217765223237508, 0.3731617524466488, -0.06757650550538569, 0.11583576581880367, -0.0043105840829483575, 0.1019743751587995, 0.00795726827084181, 0.0015324261301102933, -0.0029787964114312377, -0.18781091742980455, 0.1168609071481094, 0.23537776330381296, 0.16051967567868866, 0.24305619612294302, -0.3562370545827271, -0.100198358506634, 0.23632683936673937, 0.1411209152435905, -0.02479041392883558, -0.029107942317842684, -0.24645583803786406, 0.19830037234089432, -0.1660972892652067, -0.14451150706540164, 0.019007864083801763, 0.10057736831204442, 0.01506230647393157, -0.3353171104125762, 0.01255525358994439, 0.11467839836069707, 0.0790998681940222, 0.018178115016780794, -0.21372421271052588, -0.03523046415288713, 0.0981248514622115, -0.04985168461787274, 0.039299264098936165, 0.030227340820632623, -0.06545572456370076, -0.11624473839830816, 0.355514625387575, -0.06800899124086908, -0.20427213484693443, 0.06626279921051156, -0.23266436277857322, -0.1609893005780792, 0.07276341388148538, 0.09239064026205393, 0.18106775668062522, -0.03259813145137905, 0.18391609980248627, -0.14319767245206605, 0.15103459646375955, 0.08577244220238724, -0.03266870541749208, 0.10988548678461085, 0.08336133434531394, 0.10246741101982888, 0.16726838743308914, -0.03928021215467473, 0.05553421516787638, -0.35653899568185377, -0.17491187637650898, -0.2459511845006367, 0.13835716323947975, -0.1867016211928397, -0.16382106653613487, 0.4182680236657014, 0.04628117744067914, 0.2145170501957836, 0.1346321465301045, 0.136437859783849, 0.08666891165046947, 0.04414293972063768, 0.12944327821180726, 0.06506347362203209, 0.18462969047237146, -0.0594831127725709, -0.19312384283317913, -0.008975546514050345, 0.1832344250758754] |
1,802.06612 | Nonlinear Breit-Wheeler pair creation with bremsstrahlung $\gamma$ rays | Electron-positron pairs are produced through the Breit-Wheeler process when
energetic photons traverse electromagnetic fields of sufficient strength. Here
we consider a possible experimental geometry for observation of pair creation
in the highly nonlinear regime, in which bremsstrahlung of an ultrarelativistic
electron beam in a high-$Z$ target is used to produce $\gamma$ rays that
collide with a counterpropagating laser pulse. We show how the target thickness
may be chosen to optimize the yield of Breit-Wheeler positrons, and verify our
analytical predictions with simulations of the cascade in the material and in
the laser pulse. The electron beam energy and laser intensity required are well
within the capability of today's high-intensity laser facilities.
| physics.plasm-ph hep-ph | electronpositron pairs are produced through the breitwheeler process when energetic photons traverse electromagnetic fields of sufficient strength here we consider a possible experimental geometry for observation of pair creation in the highly nonlinear regime in which bremsstrahlung of an ultrarelativistic electron beam in a highz target is used to produce gamma rays that collide with a counterpropagating laser pulse we show how the target thickness may be chosen to optimize the yield of breitwheeler positrons and verify our analytical predictions with simulations of the cascade in the material and in the laser pulse the electron beam energy and laser intensity required are well within the capability of todays highintensity laser facilities | [['electronpositron', 'pairs', 'are', 'produced', 'through', 'the', 'breitwheeler', 'process', 'when', 'energetic', 'photons', 'traverse', 'electromagnetic', 'fields', 'of', 'sufficient', 'strength', 'here', 'we', 'consider', 'a', 'possible', 'experimental', 'geometry', 'for', 'observation', 'of', 'pair', 'creation', 'in', 'the', 'highly', 'nonlinear', 'regime', 'in', 'which', 'bremsstrahlung', 'of', 'an', 'ultrarelativistic', 'electron', 'beam', 'in', 'a', 'highz', 'target', 'is', 'used', 'to', 'produce', 'gamma', 'rays', 'that', 'collide', 'with', 'a', 'counterpropagating', 'laser', 'pulse', 'we', 'show', 'how', 'the', 'target', 'thickness', 'may', 'be', 'chosen', 'to', 'optimize', 'the', 'yield', 'of', 'breitwheeler', 'positrons', 'and', 'verify', 'our', 'analytical', 'predictions', 'with', 'simulations', 'of', 'the', 'cascade', 'in', 'the', 'material', 'and', 'in', 'the', 'laser', 'pulse', 'the', 'electron', 'beam', 'energy', 'and', 'laser', 'intensity', 'required', 'are', 'well', 'within', 'the', 'capability', 'of', 'todays', 'highintensity', 'laser', 'facilities']] | [-0.07880137720237579, 0.24475956083653466, -0.06539360390606898, 0.08210734974103993, -0.009645361027487361, -0.11617599383231487, -0.007657167975799189, 0.48639615487542237, -0.24999135348375315, -0.3013719618404368, -0.050199864623094864, -0.28836692400645836, 0.014686788478446705, 0.2676286505912677, 0.04911715603802722, 0.06464857214575147, 0.09280296661765189, -0.034410137876129905, 0.047980972333404294, -0.16158980967451794, 0.27930395466145463, 0.16755665947792228, 0.2765007317024241, 0.06415093269803233, 0.11191750948762035, 0.02068149070842779, 0.010673496580623963, -0.07582074344191733, -0.08848822102621082, 0.06782436725339508, 0.2575195450419644, 0.08813011796981399, 0.20986157118737161, -0.5045585845269867, -0.22263817582279444, 0.07316407883489454, 0.13992234261974962, 0.1008642148740405, -0.11212073213437589, -0.27047160700769035, 0.011151425947376468, -0.1467660368118133, -0.1610334521025285, 0.0060820856240687065, -0.03065499438912616, 0.13886527814860414, -0.33180661972712827, -0.02703858128547467, 0.010428391340889272, -0.04309628348743023, -0.029840902991693567, 0.006963512524626813, -0.024433730052666622, 0.018653528706374083, 0.05402750354171059, 0.057026587749688745, 0.20574214564099372, -0.17216254478930873, -0.106936061276576, 0.4007322992458268, -0.049406039874648325, -0.1377567179052176, 0.1666321529564238, -0.20582373971371232, -0.033132360656619876, 0.2336879285463543, 0.20254683292781314, 0.12416927743417856, -0.11201545209186005, 0.0077398364240228125, 0.0027769016991327474, 0.16405735808626018, 0.1336022095339423, 0.07109889339001195, 0.24296875568190673, 0.1834211941233727, 0.0030543786129570223, 0.15660821133280625, -0.1405983323730562, 0.0021605209551273366, -0.33821011784377397, -0.1141155939281767, -0.1527524059722284, 0.07403615077324044, -0.0030140622045953867, -0.09841640232768548, 0.387861887890812, 0.15289866070678407, 0.15106308204331645, -0.07416971500329506, 0.3241844956536551, 0.13225049126803087, -0.011100282131165668, 0.03978546707144192, 0.3100413308890016, 0.12928302702703723, 0.08858942179437224, -0.24201916901579312, 0.01699673193129333, -0.01617867038333537] |
1,802.06613 | Before Name-calling: Dynamics and Triggers of Ad Hominem Fallacies in
Web Argumentation | Arguing without committing a fallacy is one of the main requirements of an
ideal debate. But even when debating rules are strictly enforced and fallacious
arguments punished, arguers often lapse into attacking the opponent by an ad
hominem argument. As existing research lacks solid empirical investigation of
the typology of ad hominem arguments as well as their potential causes, this
paper fills this gap by (1) performing several large-scale annotation studies,
(2) experimenting with various neural architectures and validating our working
hypotheses, such as controversy or reasonableness, and (3) providing linguistic
insights into triggers of ad hominem using explainable neural network
architectures.
| cs.CL | arguing without committing a fallacy is one of the main requirements of an ideal debate but even when debating rules are strictly enforced and fallacious arguments punished arguers often lapse into attacking the opponent by an ad hominem argument as existing research lacks solid empirical investigation of the typology of ad hominem arguments as well as their potential causes this paper fills this gap by 1 performing several largescale annotation studies 2 experimenting with various neural architectures and validating our working hypotheses such as controversy or reasonableness and 3 providing linguistic insights into triggers of ad hominem using explainable neural network architectures | [['arguing', 'without', 'committing', 'a', 'fallacy', 'is', 'one', 'of', 'the', 'main', 'requirements', 'of', 'an', 'ideal', 'debate', 'but', 'even', 'when', 'debating', 'rules', 'are', 'strictly', 'enforced', 'and', 'fallacious', 'arguments', 'punished', 'arguers', 'often', 'lapse', 'into', 'attacking', 'the', 'opponent', 'by', 'an', 'ad', 'hominem', 'argument', 'as', 'existing', 'research', 'lacks', 'solid', 'empirical', 'investigation', 'of', 'the', 'typology', 'of', 'ad', 'hominem', 'arguments', 'as', 'well', 'as', 'their', 'potential', 'causes', 'this', 'paper', 'fills', 'this', 'gap', 'by', '1', 'performing', 'several', 'largescale', 'annotation', 'studies', '2', 'experimenting', 'with', 'various', 'neural', 'architectures', 'and', 'validating', 'our', 'working', 'hypotheses', 'such', 'as', 'controversy', 'or', 'reasonableness', 'and', '3', 'providing', 'linguistic', 'insights', 'into', 'triggers', 'of', 'ad', 'hominem', 'using', 'explainable', 'neural', 'network', 'architectures']] | [-0.11310498360867179, 0.04168493044706716, -0.057599243661849805, 0.10462782406686151, -0.14852767175589088, -0.20376541113739113, 0.11094772352002524, 0.3839843430288947, -0.22377426183717972, -0.35241998289481247, 0.13998602289190093, -0.24352334183352622, -0.17110023459668575, 0.14806284902082517, -0.10681726660413465, 0.03699634119056829, 0.07519330312082968, 0.007047766985574571, -0.0332265635975406, -0.24172690310423253, 0.33833474694465354, 0.07487060312218595, 0.2823741254996103, 0.0867161750194091, 0.03554354029440201, -0.027992639424380763, -0.07250505599589778, 0.001679241115810571, -0.07011140175255956, 0.1399313249592992, 0.2702065265373244, 0.2479790408800513, 0.41590733468385027, -0.4953095758204708, -0.23052429647581413, 0.05084839774212699, 0.15573493572698888, 0.06067820084696211, -0.034081042815394015, -0.32072706065500284, 0.06566364253354766, -0.19973763242585235, -0.08653999002890127, -0.11358207802355663, 0.008828081356564372, -0.00960926859095545, -0.23165921035619214, 0.006981935098509092, 0.16295400192526843, 0.15633346555330377, -0.0802735984797986, -0.1432608782295322, 0.008142365722474412, 0.14759282055593298, 0.12385910901639813, 0.05442846920064623, 0.1471675854858638, -0.16542395879053465, -0.16458308310847325, 0.3772910690617443, 0.03321258146039183, -0.16634099813417927, 0.18932472817175608, 0.010510134773494878, -0.1167727813890001, 0.03618261174501685, 0.08150915286416133, 0.05146632323705471, -0.1538505563588806, 0.005714783540092372, -0.011467960778402515, 0.1630923385814865, 0.06247405721206624, 0.01661265246330364, 0.22862222929033313, 0.2597063842326366, -0.013801362144179864, 0.07292771820984043, -0.015522891520706955, -0.09397593088964425, -0.248670482371777, -0.11702652872161995, -0.1434440700577037, 0.07630996912312095, -0.07197176976925301, -0.1425264259791094, 0.3185993196848448, 0.1728616891046156, 0.15826202902999376, 0.0649358562973563, 0.3400720843842419, 0.01841037385373164, 0.09376033398986675, 0.06700907039483732, 0.19571074285535234, 0.006725742110503044, 0.11521496939113235, -0.11115422031593204, 0.12998347194971388, 0.02095653244464527] |
1,802.06614 | Chern forms of hermitian metrics with analytic singularities on vector
bundles | We define Chern and Segre forms, or rather currents, associated with a
Griffiths positive singular hermitian metric $h$ with analytic singularities on
a holomorphic vector bundle $E$. The currents are constructed as pushforwards
of generalized Monge-Amp\`ere products on the projectivization of $E$. The
Chern and Segre currents represent the Chern and Segre classes of $E$,
respectively, and coincide with the Chern and Segre forms of $E$ and $h$, where
$h$ is smooth. Moreover, our currents coincide with the Chern and Segre forms
constructed by the first three authors and Ruppenthal in the cases when these
are defined.
| math.CV math.AG | we define chern and segre forms or rather currents associated with a griffiths positive singular hermitian metric h with analytic singularities on a holomorphic vector bundle e the currents are constructed as pushforwards of generalized mongeampere products on the projectivization of e the chern and segre currents represent the chern and segre classes of e respectively and coincide with the chern and segre forms of e and h where h is smooth moreover our currents coincide with the chern and segre forms constructed by the first three authors and ruppenthal in the cases when these are defined | [['we', 'define', 'chern', 'and', 'segre', 'forms', 'or', 'rather', 'currents', 'associated', 'with', 'a', 'griffiths', 'positive', 'singular', 'hermitian', 'metric', 'h', 'with', 'analytic', 'singularities', 'on', 'a', 'holomorphic', 'vector', 'bundle', 'e', 'the', 'currents', 'are', 'constructed', 'as', 'pushforwards', 'of', 'generalized', 'mongeampere', 'products', 'on', 'the', 'projectivization', 'of', 'e', 'the', 'chern', 'and', 'segre', 'currents', 'represent', 'the', 'chern', 'and', 'segre', 'classes', 'of', 'e', 'respectively', 'and', 'coincide', 'with', 'the', 'chern', 'and', 'segre', 'forms', 'of', 'e', 'and', 'h', 'where', 'h', 'is', 'smooth', 'moreover', 'our', 'currents', 'coincide', 'with', 'the', 'chern', 'and', 'segre', 'forms', 'constructed', 'by', 'the', 'first', 'three', 'authors', 'and', 'ruppenthal', 'in', 'the', 'cases', 'when', 'these', 'are', 'defined']] | [-0.24503050780428262, 0.09224762771191308, 0.026988599585214008, 0.04775845079590605, -0.07360444091318641, -0.17593788755281517, -0.027298692429515842, 0.31241169092633453, -0.23461191556513464, -0.18695913993481858, 0.05392226959884283, -0.2944312080605111, -0.17164898129461412, 0.17666004619240994, -0.04433878627605736, 0.04974724618174756, -0.0010817597067216411, 0.03758163232608543, -0.14294407718504468, -0.3079258582086671, 0.5018654293768728, -0.08650101757787827, 0.20130740198267935, 0.06946772972878534, 0.10775571161260207, -0.04468675856818057, -0.02038736537603351, -0.0074895357743306095, -0.14888046952546574, 0.14981584228614034, 0.30132816248806193, 0.03310966939898208, 0.10487481536498915, -0.36667080557284254, -0.10441077950720985, 0.18500674723812457, 0.005649431249670063, -0.07010106322316763, 0.07494670553569449, -0.3242254692595452, 0.07671719577168308, -0.13865699812352736, -0.11208048516709823, -0.1479992703825701, 0.09675829381255123, 0.07673931847481678, -0.22709138223338718, 0.01393050766637316, 0.09291961818234995, 0.1125448632374173, -0.06850087290998393, -0.14954656526970211, -0.19856792709955093, 0.00889014803548586, 0.030799636158917565, 0.041515779947076226, 0.07550922789475105, -0.13021865611275038, -0.15992510754828496, 0.3527311464737674, -0.12294471573841292, -0.27807285586216796, 0.10277659329100668, -0.1617160662620639, -0.08939080207831769, 0.14808201368820542, 0.08082287508295849, 0.19835486600156096, 0.05672466613441429, 0.18783853195782285, -0.07094345955677757, -0.058753346267621964, 0.12313413284330939, -0.015048903451922039, 0.1596666383605528, -0.023953577428377077, 0.07571465492340697, 0.11943428151425906, -0.0470053726464054, -0.043857370954356156, -0.3965872232414161, -0.30691773772317293, -0.1882575474543652, 0.22681508956156904, -0.0673178072211158, -0.15480667436107373, 0.46553986923148233, -0.021755826853526134, 0.2874075862249204, 0.10752768115101692, 0.21367866456421325, 0.09357756886068576, 0.056247030035592616, 0.07453543879576803, 0.17267826740377737, 0.22526665965415305, 0.04198296169245926, -0.11089789887652539, -0.011917182093990656, 0.1838718474318739] |
1,802.06615 | On the evolutionary status of high-latitude variable V534 Lyr | Based on the high resolution spectral monitoring conducted at the 6-m BTA
telescope, we study the optical spectrum of the high-latitude variable V534
Lyr. Heliocentric radial velocities Vr corresponding to the positions of all
metal absorption components, as well as the NaI D and H$\alpha$ lines were
measured during all the observational dates. The analysis of the velocity field
examining the lines of various nature revealed a low-amplitude variability of
Vr based on the lines with a high excitation potential, which are formed in
deep layers of the stellar atmosphere, and allowed to estimate the systemic
velocity of Vsys$\approx-125$ km/s (V(lsr)$\approx-105$ km/s). The distance
estimate of d$\approx$6 kpc for the star leads us to its absolute magnitude of
Mv$\approx -5.3^{m}$, what corresponds to the MK spectral classification. The
previously undetected for this star spectral phenomenon was revealed: at
certain times a splitting of the profiles of low-excited absorptions is
observed, reaching $\Delta$Vr=20$\div$50 km/s. A combination of the parameters:
reduced metallicity [Met/H]$_{\odot}=-0.28$, increased nitrogen abundance
[N/Fe]=+1.10, large spatial velocity, high luminosity, a strong variability of
the emission-absorption profiles of HI lines, splitting of metal absorptions at
different observation moments and the variability of the velocity field in the
atmosphere allow us to consider V534 Lyr as a pulsating star in the instability
band near the HB and belonging to the thick disk of our Galaxy.
| astro-ph.SR | based on the high resolution spectral monitoring conducted at the 6m bta telescope we study the optical spectrum of the highlatitude variable v534 lyr heliocentric radial velocities vr corresponding to the positions of all metal absorption components as well as the nai d and halpha lines were measured during all the observational dates the analysis of the velocity field examining the lines of various nature revealed a lowamplitude variability of vr based on the lines with a high excitation potential which are formed in deep layers of the stellar atmosphere and allowed to estimate the systemic velocity of vsysapprox125 kms vlsrapprox105 kms the distance estimate of dapprox6 kpc for the star leads us to its absolute magnitude of mvapprox 53m what corresponds to the mk spectral classification the previously undetected for this star spectral phenomenon was revealed at certain times a splitting of the profiles of lowexcited absorptions is observed reaching deltavr20div50 kms a combination of the parameters reduced metallicity meth_odot028 increased nitrogen abundance nfe110 large spatial velocity high luminosity a strong variability of the emissionabsorption profiles of hi lines splitting of metal absorptions at different observation moments and the variability of the velocity field in the atmosphere allow us to consider v534 lyr as a pulsating star in the instability band near the hb and belonging to the thick disk of our galaxy | [['based', 'on', 'the', 'high', 'resolution', 'spectral', 'monitoring', 'conducted', 'at', 'the', '6m', 'bta', 'telescope', 'we', 'study', 'the', 'optical', 'spectrum', 'of', 'the', 'highlatitude', 'variable', 'v534', 'lyr', 'heliocentric', 'radial', 'velocities', 'vr', 'corresponding', 'to', 'the', 'positions', 'of', 'all', 'metal', 'absorption', 'components', 'as', 'well', 'as', 'the', 'nai', 'd', 'and', 'halpha', 'lines', 'were', 'measured', 'during', 'all', 'the', 'observational', 'dates', 'the', 'analysis', 'of', 'the', 'velocity', 'field', 'examining', 'the', 'lines', 'of', 'various', 'nature', 'revealed', 'a', 'lowamplitude', 'variability', 'of', 'vr', 'based', 'on', 'the', 'lines', 'with', 'a', 'high', 'excitation', 'potential', 'which', 'are', 'formed', 'in', 'deep', 'layers', 'of', 'the', 'stellar', 'atmosphere', 'and', 'allowed', 'to', 'estimate', 'the', 'systemic', 'velocity', 'of', 'vsysapprox125', 'kms', 'vlsrapprox105', 'kms', 'the', 'distance', 'estimate', 'of', 'dapprox6', 'kpc', 'for', 'the', 'star', 'leads', 'us', 'to', 'its', 'absolute', 'magnitude', 'of', 'mvapprox', '53m', 'what', 'corresponds', 'to', 'the', 'mk', 'spectral', 'classification', 'the', 'previously', 'undetected', 'for', 'this', 'star', 'spectral', 'phenomenon', 'was', 'revealed', 'at', 'certain', 'times', 'a', 'splitting', 'of', 'the', 'profiles', 'of', 'lowexcited', 'absorptions', 'is', 'observed', 'reaching', 'deltavr20div50', 'kms', 'a', 'combination', 'of', 'the', 'parameters', 'reduced', 'metallicity', 'meth_odot028', 'increased', 'nitrogen', 'abundance', 'nfe110', 'large', 'spatial', 'velocity', 'high', 'luminosity', 'a', 'strong', 'variability', 'of', 'the', 'emissionabsorption', 'profiles', 'of', 'hi', 'lines', 'splitting', 'of', 'metal', 'absorptions', 'at', 'different', 'observation', 'moments', 'and', 'the', 'variability', 'of', 'the', 'velocity', 'field', 'in', 'the', 'atmosphere', 'allow', 'us', 'to', 'consider', 'v534', 'lyr', 'as', 'a', 'pulsating', 'star', 'in', 'the', 'instability', 'band', 'near', 'the', 'hb', 'and', 'belonging', 'to', 'the', 'thick', 'disk', 'of', 'our', 'galaxy']] | [-0.08064675637918602, 0.08156420836598112, -0.05125923486021175, 0.04344691533629817, -0.0840849518669226, -0.08245442546602269, 0.06043255919670359, 0.422855323077076, -0.18788236860914534, -0.3425023153842496, 0.05517378357223977, -0.2750159921038344, 0.005013144039872309, 0.16714485544556132, -0.0202680012594943, -0.017215192510371305, 0.05654911117744632, -0.034555126446152655, -0.05297711899038404, -0.19776614838068513, 0.28218464240705576, 0.05916120023067816, 0.20425791147135897, -0.0019433562357099381, 0.06989363063540724, -0.09844435295262546, -0.06373136271550148, -0.006358008251818655, -0.13688049019590295, 0.08767239076917542, 0.20287075780194114, 0.10293847343699006, 0.22099422545957, -0.31256292983393735, -0.2226144256570411, 0.04162903521123722, 0.17886136252033152, 0.0332860659599882, 0.01588254723497408, -0.2930209178270565, 0.02563212838517588, -0.12068373490668212, -0.2226801694120729, 0.07129547513883423, 0.0733088970764247, 0.06429754446057982, -0.22912938642332814, 0.11165456832343436, 0.0038955190862503108, 0.1816988505877951, -0.11631426308371441, -0.11804357264190912, -0.103192526660644, 0.09352441965084937, 0.046348145578694704, 0.02776332254008459, 0.13756262771224742, -0.11437955971929047, -0.004130760352213487, 0.39421983757724605, -0.14656432548697382, 0.020827232397399104, 0.22187411171358284, -0.21646644108868376, -0.13224010010459028, 0.20894070610153936, 0.17799812517046962, 0.11455275626374511, -0.1131397828791739, -0.009478186051300899, -0.015035296559626996, 0.20715510667004208, 0.1029754202894832, 0.08196346315721544, 0.2661594799504167, 0.08168069061583891, 0.040767509496415895, 0.07174921515925908, -0.3108512710486711, -0.01956300491669767, -0.24125052640145575, -0.12598384154181178, -0.10234457345386208, 0.052676683500370323, -0.1240374770754392, -0.15960694434492056, 0.4182223459507373, 0.10682250683721914, 0.24326618841452594, -0.0013420113919656378, 0.28672172415449665, 0.14145567778312532, 0.11036155325213999, 0.08410535475990467, 0.3044892627685503, 0.22943174856805448, 0.13675777946008127, -0.28220749997395883, 0.07611918642026096, 0.0036057681219837695] |
1,802.06616 | Suppression of photo-oxidation of organic chromophores by strong
coupling to plasmonic nanoantennas | Intermixed light-matter quasiparticles - polaritons - possess unique optical
properties owned to their compositional nature. These intriguing hybrid states
have been extensively studied over the past decades in a wide range of
realizations aiming at both basic science and emerging applications. However,
recently it has been demonstrated that not only optical, but also
material-related properties, such as chemical reactivity and charge transport,
may be significantly altered in the strong coupling regime of light-matter
interactions. Here, we show that a nanoscale system, comprised of a plasmonic
nanoprism strongly coupled to excitons in J-aggregated form of organic
chromophores, experiences modified excited state dynamics and therefore
modified photo-chemical reactivity. Our experimental results reveal that
photobleaching, one of the most fundamental photochemical reactions, can be
effectively controlled and suppressed by the degree of plasmon-exciton coupling
and detuning. In particular, we observe a 100-fold stabilization of organic
dyes for the red-detuned nanoparticles. Our findings contribute to
understanding of photochemical properties in the strong coupling regime and may
find important implications for the performance and improved stability of
optical devices incorporating organic dyes.
| physics.optics cond-mat.mes-hall physics.chem-ph | intermixed lightmatter quasiparticles polaritons possess unique optical properties owned to their compositional nature these intriguing hybrid states have been extensively studied over the past decades in a wide range of realizations aiming at both basic science and emerging applications however recently it has been demonstrated that not only optical but also materialrelated properties such as chemical reactivity and charge transport may be significantly altered in the strong coupling regime of lightmatter interactions here we show that a nanoscale system comprised of a plasmonic nanoprism strongly coupled to excitons in jaggregated form of organic chromophores experiences modified excited state dynamics and therefore modified photochemical reactivity our experimental results reveal that photobleaching one of the most fundamental photochemical reactions can be effectively controlled and suppressed by the degree of plasmonexciton coupling and detuning in particular we observe a 100fold stabilization of organic dyes for the reddetuned nanoparticles our findings contribute to understanding of photochemical properties in the strong coupling regime and may find important implications for the performance and improved stability of optical devices incorporating organic dyes | [['intermixed', 'lightmatter', 'quasiparticles', 'polaritons', 'possess', 'unique', 'optical', 'properties', 'owned', 'to', 'their', 'compositional', 'nature', 'these', 'intriguing', 'hybrid', 'states', 'have', 'been', 'extensively', 'studied', 'over', 'the', 'past', 'decades', 'in', 'a', 'wide', 'range', 'of', 'realizations', 'aiming', 'at', 'both', 'basic', 'science', 'and', 'emerging', 'applications', 'however', 'recently', 'it', 'has', 'been', 'demonstrated', 'that', 'not', 'only', 'optical', 'but', 'also', 'materialrelated', 'properties', 'such', 'as', 'chemical', 'reactivity', 'and', 'charge', 'transport', 'may', 'be', 'significantly', 'altered', 'in', 'the', 'strong', 'coupling', 'regime', 'of', 'lightmatter', 'interactions', 'here', 'we', 'show', 'that', 'a', 'nanoscale', 'system', 'comprised', 'of', 'a', 'plasmonic', 'nanoprism', 'strongly', 'coupled', 'to', 'excitons', 'in', 'jaggregated', 'form', 'of', 'organic', 'chromophores', 'experiences', 'modified', 'excited', 'state', 'dynamics', 'and', 'therefore', 'modified', 'photochemical', 'reactivity', 'our', 'experimental', 'results', 'reveal', 'that', 'photobleaching', 'one', 'of', 'the', 'most', 'fundamental', 'photochemical', 'reactions', 'can', 'be', 'effectively', 'controlled', 'and', 'suppressed', 'by', 'the', 'degree', 'of', 'plasmonexciton', 'coupling', 'and', 'detuning', 'in', 'particular', 'we', 'observe', 'a', '100fold', 'stabilization', 'of', 'organic', 'dyes', 'for', 'the', 'reddetuned', 'nanoparticles', 'our', 'findings', 'contribute', 'to', 'understanding', 'of', 'photochemical', 'properties', 'in', 'the', 'strong', 'coupling', 'regime', 'and', 'may', 'find', 'important', 'implications', 'for', 'the', 'performance', 'and', 'improved', 'stability', 'of', 'optical', 'devices', 'incorporating', 'organic', 'dyes']] | [-0.11795442780878927, 0.18516067135546888, -0.04766933972714469, 0.011437098508467898, -0.021806117495787994, -0.17107903039881162, 0.03848159685597888, 0.4201255296011056, -0.26126021582965875, -0.30697797646213854, 0.008631995532196015, -0.2539133339188993, -0.18456973641046456, 0.2212019975909165, 0.011502861209612872, 0.028864583179487712, 0.040912608918068666, -0.08058135492194976, 0.013685953259201987, -0.19509208706685707, 0.2321705564563828, 0.04662282344086894, 0.2905618267767464, 0.16369429059193602, 0.04823484871536493, -0.03329246198492391, 0.08182379422709346, -0.004301193497542824, -0.11263789798993717, 0.13947817017823191, 0.2777315671622221, -0.015137847933386054, 0.25166633001661726, -0.46664101145097187, -0.3009373442921788, 0.06824978653645043, 0.18618042741103896, 0.12654091752450247, -0.13174236311710308, -0.2731588630697557, 0.019937982924415596, -0.13392551297795893, -0.1275894156031011, -0.11755725365398186, 0.01441850530515824, 0.06133268301208903, -0.23204167999593275, 0.026018815531362115, 0.04521421736904553, 0.05163236678802475, -0.06461483201253161, -0.11924554262509836, -0.06770854324102402, 0.10852643803959447, -0.00655151757744274, -0.049481890999179864, 0.20558243322053127, -0.17058240098679173, -0.1109157049057207, 0.37801645398139955, -0.08889468386370157, -0.10673157314636877, 0.26169372870320723, -0.14371491643999304, -0.10430863915809563, 0.1518522417092962, 0.16951956920059663, 0.12693630190832275, -0.1466848479836647, 0.05029666078044102, 0.011530577998076167, 0.208414089697014, 0.06855172614433935, 0.19277950848452746, 0.24758545961896225, 0.2175939039649841, -0.014688278908974358, 0.10838898668809893, -0.03152985578136785, -0.10106306340545416, -0.16014170846768788, -0.17831186086471593, -0.1680745998477297, 0.06975487305391913, -0.03138252083686114, -0.11638439308585866, 0.40737678538874855, 0.15429454827282046, 0.1251263501122594, -0.07209263493972165, 0.238154419703143, 0.07346995375850904, 0.10216023976914584, -0.008262524642050266, 0.33563483504445424, 0.1465475660336337, 0.10182879434033697, -0.2905591398557382, 0.10066712433073137, -0.025779453390943154] |
1,802.06617 | Construction of the raising operator for Rosen-Morse eigenstates in
terms of the Weyl fractional integral | The raising operator relating adjacent bound states for the general,
non-symmetric Rosen-Morse potential is constructed explicitly. It is
demonstrated that, in constrast to the symmetric (modified P\"oschl-Teller)
potential, the operator is non-local and must be expressed applying techniques
from fractional calculus. A recurrence relation between adjacent states is
derived applying the Weyl fractional integral, which, in contrast to standard
recurrence relations, allows the efficient numerical computation of the
coefficients of all Jacobi polynomials necessary for the evaluation of the
bound state wave functions, providing an application of fractional calculus to
exactly solvable quantum systems.
| math-ph math.MP | the raising operator relating adjacent bound states for the general nonsymmetric rosenmorse potential is constructed explicitly it is demonstrated that in constrast to the symmetric modified poschlteller potential the operator is nonlocal and must be expressed applying techniques from fractional calculus a recurrence relation between adjacent states is derived applying the weyl fractional integral which in contrast to standard recurrence relations allows the efficient numerical computation of the coefficients of all jacobi polynomials necessary for the evaluation of the bound state wave functions providing an application of fractional calculus to exactly solvable quantum systems | [['the', 'raising', 'operator', 'relating', 'adjacent', 'bound', 'states', 'for', 'the', 'general', 'nonsymmetric', 'rosenmorse', 'potential', 'is', 'constructed', 'explicitly', 'it', 'is', 'demonstrated', 'that', 'in', 'constrast', 'to', 'the', 'symmetric', 'modified', 'poschlteller', 'potential', 'the', 'operator', 'is', 'nonlocal', 'and', 'must', 'be', 'expressed', 'applying', 'techniques', 'from', 'fractional', 'calculus', 'a', 'recurrence', 'relation', 'between', 'adjacent', 'states', 'is', 'derived', 'applying', 'the', 'weyl', 'fractional', 'integral', 'which', 'in', 'contrast', 'to', 'standard', 'recurrence', 'relations', 'allows', 'the', 'efficient', 'numerical', 'computation', 'of', 'the', 'coefficients', 'of', 'all', 'jacobi', 'polynomials', 'necessary', 'for', 'the', 'evaluation', 'of', 'the', 'bound', 'state', 'wave', 'functions', 'providing', 'an', 'application', 'of', 'fractional', 'calculus', 'to', 'exactly', 'solvable', 'quantum', 'systems']] | [-0.14857513450601317, 0.089549913870058, -0.076381270704355, 0.10775869622073592, -0.11416568102295253, -0.1873364275113303, -0.008163181074741396, 0.2928412288645322, -0.31319544929020265, -0.24481215839214782, 0.07860298602138349, -0.27360963457071424, -0.18954763727936338, 0.2085020001977682, -0.017847757295772256, 0.09344404862519909, 0.02088215719522076, 0.045713024086348635, -0.13250168122380893, -0.21964242400482614, 0.3312453644330356, -0.008093171977150709, 0.21724752915349413, 0.04875980673773967, 0.0918905426589574, 0.011832494052136912, -0.024659109908710928, -0.031060053060386093, -0.11586296318900496, 0.13972444119219213, 0.24053228939784335, 0.04936755579361256, 0.22898776260541476, -0.42992602633510496, -0.15135215880705954, 0.1309198950060663, 0.155466241004104, 0.08162304475046496, -0.0191439552173177, -0.3147747022139424, 0.02505360397589492, -0.1766427381563575, -0.2072285602483502, -0.09755567330470745, 0.06369979326375463, 0.026314895149280735, -0.30113109450866565, 0.12036458865189528, 0.057772375229607396, 0.0030927808487096163, -0.08084274453985346, -0.11838537434665883, -0.026895912408709845, 0.09567847360975723, -0.04546051223742518, -5.1567702494720194e-05, 0.04307236273257815, -0.08738116760480594, -0.14614975361334298, 0.33924846217392923, -0.053324971645277865, -0.2894956584861304, 0.11540600481849322, -0.10850466367729167, -0.10126829118606576, 0.0674194040450644, 0.07347418596234886, 0.11557186084819283, -0.16219134094748408, 0.14492706674648984, -0.029216895375166713, 0.10241469558937713, 0.13399140931111067, 0.04164754772036178, 0.13305821733678036, 0.03585204167014107, 0.08447993582391992, 0.16893872609634467, 0.008597427325204332, -0.1895920982376296, -0.34375919238168823, -0.18526010222341668, -0.22561811495379128, 0.03599771939046517, -0.11415066969803252, -0.16968472793381265, 0.38697052818346533, 0.10469933003533949, 0.1115147112274265, 0.06033784130642666, 0.22910015493571917, 0.29498296855215694, 0.08787002761233995, 0.05083016660857074, 0.1847338970277478, 0.22737776086804398, 0.07485364113954153, -0.22699850880568154, 0.016577540543871595, 0.1622407311434917] |
1,802.06618 | Holographic Calculation of BMSFT Mutual and 3-partite Information | We use flat-space holography to calculate the mutual information and the
3-partite information of a two-dimensional BMS-invariant field theory
(BMSFT$_2$). This theory is the putative holographic dual of the
three-dimensional asymptotically flat spacetimes. We find a bound in which
entangling transition occurs for zero and finite temperature BMSFTs. We also
show that the holographic 3-partite information is always non-positive which
indicates that the holographic mutual information is monogamous.
| hep-th | we use flatspace holography to calculate the mutual information and the 3partite information of a twodimensional bmsinvariant field theory bmsft_2 this theory is the putative holographic dual of the threedimensional asymptotically flat spacetimes we find a bound in which entangling transition occurs for zero and finite temperature bmsfts we also show that the holographic 3partite information is always nonpositive which indicates that the holographic mutual information is monogamous | [['we', 'use', 'flatspace', 'holography', 'to', 'calculate', 'the', 'mutual', 'information', 'and', 'the', '3partite', 'information', 'of', 'a', 'twodimensional', 'bmsinvariant', 'field', 'theory', 'bmsft_2', 'this', 'theory', 'is', 'the', 'putative', 'holographic', 'dual', 'of', 'the', 'threedimensional', 'asymptotically', 'flat', 'spacetimes', 'we', 'find', 'a', 'bound', 'in', 'which', 'entangling', 'transition', 'occurs', 'for', 'zero', 'and', 'finite', 'temperature', 'bmsfts', 'we', 'also', 'show', 'that', 'the', 'holographic', '3partite', 'information', 'is', 'always', 'nonpositive', 'which', 'indicates', 'that', 'the', 'holographic', 'mutual', 'information', 'is', 'monogamous']] | [-0.16577048378883663, 0.1773089779625562, -0.17286699117076668, 0.11361603087844384, -0.08923893015493047, -0.19905081154976154, -0.006639180666146179, 0.30357037622933136, -0.1948397967851523, -0.19307989145057614, 0.07660943007089593, -0.33124681838759873, -0.1826813013264627, 0.09984455603372419, -0.06583758497215582, 0.019885669010832455, -0.029423779469322075, 0.13204615391000654, -0.13714051878107994, -0.22903544924250155, 0.34477559066462243, 0.029869595373218708, 0.35568082818027696, 0.15286013754931363, 0.11872730078175664, 0.043743365218467785, 0.03690642396439657, 0.09048206352092551, -0.260551496868588, 0.1059492196866565, 0.25824656653584854, 0.13123980321159417, 0.17262401798683585, -0.37862891599423054, -0.2663604834709655, 0.11017856991207792, 0.13081704846152922, 0.1946849745070336, -0.05273127100592705, -0.2419596413630202, 0.04602281342853199, -0.17191125375613797, -0.12009756752487386, -0.06624241260755243, -0.0027434298941498678, -0.11897454261215347, -0.27122588879005477, 0.10652347083095899, 0.07344315181288755, 0.03332381339207517, -0.02798948044691122, 0.023312498208586916, -0.07873038337636513, 0.1002240855613667, 0.003429265470582653, 0.04488668282459857, 0.09629159803135377, -0.12353274468544194, -0.09183035750704055, 0.2791734001401699, -0.07959326620524128, -0.19378791111662533, 0.1272731127647796, -0.18363786157164158, -0.09103532718268759, 0.06622092861851508, 0.0831604791014935, 0.18761409745043653, -0.10994023832520752, 0.10034257488035964, -0.07461328262632544, 0.1650695001960478, 0.06775118077568935, 0.12188590320522164, 0.26522710100945196, 0.05912365897551574, 0.05761694810776548, 0.22652153789319776, -0.05921169322435603, -0.13943279292840144, -0.3506545546944394, -0.21886057465665296, -0.26536908941907866, 0.09026975586841052, -0.16571918420782877, -0.18009345730145773, 0.30599057984848815, 0.16233688876540822, 0.14313177129423077, 0.07698932495038731, 0.26828190730179124, 0.09153748135202366, 0.026581713802773844, 0.13207977004067012, 0.27886961833714985, 0.16402679204827908, 0.06974561882177086, -0.2517431725740828, -0.06728245632610086, 0.11398810852375446] |
1,802.06619 | Ensemble computation approach to the Hough transform | It is demonstrated that the classical Hough transform with shift-elevation
parametrization of digital straight lines has additive complexity of at most
$\mathcal{O}(n^3 / \log n)$ on a $n\times n$ image. The proof is constructive
and uses ensemble computation approach to build summation circuits. The
proposed method has similarities with the fast Hough transform (FHT) and may be
considered a form of the "divide and conquer" technique. It is based on the
fact that lines with close slopes can be decomposed into common components,
allowing generalization for other pattern families. When applied to FHT
patterns, the algorithm yields exactly the $\Theta(n^2\log n)$ FHT asymptotics
which might suggest that the actual classical Hough transform circuits could
smaller size than $\Theta(n^3/ \log n)$.
| cs.CC cs.CV | it is demonstrated that the classical hough transform with shiftelevation parametrization of digital straight lines has additive complexity of at most mathcalon3 log n on a ntimes n image the proof is constructive and uses ensemble computation approach to build summation circuits the proposed method has similarities with the fast hough transform fht and may be considered a form of the divide and conquer technique it is based on the fact that lines with close slopes can be decomposed into common components allowing generalization for other pattern families when applied to fht patterns the algorithm yields exactly the thetan2log n fht asymptotics which might suggest that the actual classical hough transform circuits could smaller size than thetan3 log n | [['it', 'is', 'demonstrated', 'that', 'the', 'classical', 'hough', 'transform', 'with', 'shiftelevation', 'parametrization', 'of', 'digital', 'straight', 'lines', 'has', 'additive', 'complexity', 'of', 'at', 'most', 'mathcalon3', 'log', 'n', 'on', 'a', 'ntimes', 'n', 'image', 'the', 'proof', 'is', 'constructive', 'and', 'uses', 'ensemble', 'computation', 'approach', 'to', 'build', 'summation', 'circuits', 'the', 'proposed', 'method', 'has', 'similarities', 'with', 'the', 'fast', 'hough', 'transform', 'fht', 'and', 'may', 'be', 'considered', 'a', 'form', 'of', 'the', 'divide', 'and', 'conquer', 'technique', 'it', 'is', 'based', 'on', 'the', 'fact', 'that', 'lines', 'with', 'close', 'slopes', 'can', 'be', 'decomposed', 'into', 'common', 'components', 'allowing', 'generalization', 'for', 'other', 'pattern', 'families', 'when', 'applied', 'to', 'fht', 'patterns', 'the', 'algorithm', 'yields', 'exactly', 'the', 'thetan2log', 'n', 'fht', 'asymptotics', 'which', 'might', 'suggest', 'that', 'the', 'actual', 'classical', 'hough', 'transform', 'circuits', 'could', 'smaller', 'size', 'than', 'thetan3', 'log', 'n']] | [-0.06949245310151729, 0.05762921248452138, -0.1471164781655485, 0.06029688222314057, -0.10199622281085131, -0.19566591245011758, 0.03825027356713505, 0.36999214552658594, -0.25135665050396, -0.3032023974425964, 0.07024822195684063, -0.2764445996085592, -0.177067151103737, 0.24899155404260856, -0.06895185115927696, 0.052992526912406655, 0.03251270306596564, 0.02661886759066828, -0.051378622475490604, -0.2780106529806567, 0.22295529371466866, 0.016823128457733635, 0.3168703243175869, -0.0690973027514578, 0.0752168010833468, -0.0022308758383032755, -0.04564765817288435, -0.013454022106366287, -0.03846983509072866, 0.09630709315770526, 0.25337155736288275, 0.176713420184708, 0.23164880439497026, -0.4082848736700618, -0.16088911305256662, 0.15179282635592428, 0.22705030241996935, 0.05389246580849986, 0.012271333215521428, -0.2427998591013158, 0.09920684925144364, -0.06744885124301664, -0.10036923382796299, -0.07132966064263956, 0.05902059690363831, -0.005078993714019909, -0.2618059826209762, -0.002246819041921931, 0.09640009111085496, -0.025539309819701515, 0.052368591569158865, -0.1665352419910605, 0.0580561183258828, 0.07066128117952819, -0.029034604521673488, 0.051064339725861045, 0.11762139452542415, -0.032436932089849047, -0.10573112345063838, 0.35727338955374593, -0.041909668707684415, -0.2038551717838746, 0.13460651674442056, -0.09552817000865431, -0.12857904837671982, 0.17233366912657047, 0.13458429160133256, 0.10908168130869961, -0.06164740085450368, 0.10370709507388726, -0.0724748563183219, 0.20575628049229666, 0.11969407264269509, 0.0015808696842799753, 0.13808934045639837, 0.10012591971771129, 0.08895089552027195, 0.1629634202666131, -0.0944370064308267, -0.10985829179190983, -0.24412022876726874, -0.1708432801849193, -0.2093810511445153, 0.044800191711223986, -0.1222344864969057, -0.18313446187935137, 0.3414628850828888, 0.10908431705024282, 0.2204281944126459, 0.10926303048953571, 0.31512706243567234, 0.15431105856629784, 0.1404340361852704, 0.08886546510177017, 0.11612813739832174, 0.13229884860654345, 0.029675134690478444, -0.20176110252781407, 0.058140937567952924, 0.16931879840854366] |
1,802.0662 | Spiral density waves and vertical circulation in protoplanetary discs | Spiral density waves dominate several facets of accretion disc dynamics ---
planet-disc interactions and gravitational instability (GI) most prominently.
Though they have been examined thoroughly in two-dimensional simulations, their
vertical structures in the non-linear regime are somewhat unexplored. This
neglect is unwarranted given that any strong vertical motions associated with
these waves could profoundly impact dust dynamics, dust sedimentation, planet
formation, and the emissivity of the disc surface. In this paper we combine
linear calculations and shearing box simulations in order to investigate the
vertical structure of spiral waves for various polytropic stratifications and
wave amplitudes. For sub-adiabatic profiles we find that spiral waves develop a
pair of counter-rotating poloidal rolls. Particularly strong in the nonlinear
regime, these vortical structures issue from the baroclinicity supported by the
background vertical entropy gradient. They are also intimately connected to the
disk's g-modes which appear to interact nonlinearly with the density waves.
Furthermore, we demonstrate that the poloidal rolls are ubiquitous in
gravitoturbulence, emerging in the vicinity of GI spiral wakes, and potentially
transporting grains off the disk midplane. Other than hindering sedimentation
and planet formation, this phenomena may bear on observations of the disk's
scattered infrared luminosity. The vortical features could also impact on the
turbulent dynamo operating in young protoplanetary discs subject to GI, or
possibly even galactic discs.
| astro-ph.EP astro-ph.HE | spiral density waves dominate several facets of accretion disc dynamics planetdisc interactions and gravitational instability gi most prominently though they have been examined thoroughly in twodimensional simulations their vertical structures in the nonlinear regime are somewhat unexplored this neglect is unwarranted given that any strong vertical motions associated with these waves could profoundly impact dust dynamics dust sedimentation planet formation and the emissivity of the disc surface in this paper we combine linear calculations and shearing box simulations in order to investigate the vertical structure of spiral waves for various polytropic stratifications and wave amplitudes for subadiabatic profiles we find that spiral waves develop a pair of counterrotating poloidal rolls particularly strong in the nonlinear regime these vortical structures issue from the baroclinicity supported by the background vertical entropy gradient they are also intimately connected to the disks gmodes which appear to interact nonlinearly with the density waves furthermore we demonstrate that the poloidal rolls are ubiquitous in gravitoturbulence emerging in the vicinity of gi spiral wakes and potentially transporting grains off the disk midplane other than hindering sedimentation and planet formation this phenomena may bear on observations of the disks scattered infrared luminosity the vortical features could also impact on the turbulent dynamo operating in young protoplanetary discs subject to gi or possibly even galactic discs | [['spiral', 'density', 'waves', 'dominate', 'several', 'facets', 'of', 'accretion', 'disc', 'dynamics', 'planetdisc', 'interactions', 'and', 'gravitational', 'instability', 'gi', 'most', 'prominently', 'though', 'they', 'have', 'been', 'examined', 'thoroughly', 'in', 'twodimensional', 'simulations', 'their', 'vertical', 'structures', 'in', 'the', 'nonlinear', 'regime', 'are', 'somewhat', 'unexplored', 'this', 'neglect', 'is', 'unwarranted', 'given', 'that', 'any', 'strong', 'vertical', 'motions', 'associated', 'with', 'these', 'waves', 'could', 'profoundly', 'impact', 'dust', 'dynamics', 'dust', 'sedimentation', 'planet', 'formation', 'and', 'the', 'emissivity', 'of', 'the', 'disc', 'surface', 'in', 'this', 'paper', 'we', 'combine', 'linear', 'calculations', 'and', 'shearing', 'box', 'simulations', 'in', 'order', 'to', 'investigate', 'the', 'vertical', 'structure', 'of', 'spiral', 'waves', 'for', 'various', 'polytropic', 'stratifications', 'and', 'wave', 'amplitudes', 'for', 'subadiabatic', 'profiles', 'we', 'find', 'that', 'spiral', 'waves', 'develop', 'a', 'pair', 'of', 'counterrotating', 'poloidal', 'rolls', 'particularly', 'strong', 'in', 'the', 'nonlinear', 'regime', 'these', 'vortical', 'structures', 'issue', 'from', 'the', 'baroclinicity', 'supported', 'by', 'the', 'background', 'vertical', 'entropy', 'gradient', 'they', 'are', 'also', 'intimately', 'connected', 'to', 'the', 'disks', 'gmodes', 'which', 'appear', 'to', 'interact', 'nonlinearly', 'with', 'the', 'density', 'waves', 'furthermore', 'we', 'demonstrate', 'that', 'the', 'poloidal', 'rolls', 'are', 'ubiquitous', 'in', 'gravitoturbulence', 'emerging', 'in', 'the', 'vicinity', 'of', 'gi', 'spiral', 'wakes', 'and', 'potentially', 'transporting', 'grains', 'off', 'the', 'disk', 'midplane', 'other', 'than', 'hindering', 'sedimentation', 'and', 'planet', 'formation', 'this', 'phenomena', 'may', 'bear', 'on', 'observations', 'of', 'the', 'disks', 'scattered', 'infrared', 'luminosity', 'the', 'vortical', 'features', 'could', 'also', 'impact', 'on', 'the', 'turbulent', 'dynamo', 'operating', 'in', 'young', 'protoplanetary', 'discs', 'subject', 'to', 'gi', 'or', 'possibly', 'even', 'galactic', 'discs']] | [-0.18033052347643377, 0.19113032166172284, -0.06382458624542661, 0.1112812509393311, -0.10896589966332068, -0.014028930279087224, -0.07267160226498658, 0.37315711307377997, -0.26463391291769434, -0.25870846593022895, 0.06265667033454721, -0.23790327397557104, -0.12239601457285511, 0.17747843026586976, -0.010721945855122763, 0.014200415345840156, 0.023777246247217367, -0.1375905123092921, 0.022054856044373343, -0.2074489691262541, 0.33086918557088496, 0.057386400975278376, 0.16840508994581993, -0.014837260044197024, -0.004398849494497759, -0.12483017781131348, -0.036139700306399215, 0.03428513779034538, -0.22367945159320726, 0.025371416684343107, 0.22018016736915824, 0.024244970997177442, 0.23757132866649464, -0.5331392132930355, -0.2695884055925816, 0.037292616310945714, 0.22861528205084464, 0.1033317894349733, -0.06412267066272241, -0.22192389111802807, 0.04892405404919578, -0.1434190491158601, -0.17719881715143554, 0.0023044080050739412, 0.06131070125461792, 0.030940527890375408, -0.22541399334352422, 0.117990482304286, 0.09537047995597742, 0.077638443950734, -0.09845077122501548, -0.05198029013917125, -0.13103053294761163, 0.04705920858815106, 0.08492881493441211, 0.04198892714781901, 0.2510527532015528, -0.19481119484649242, -0.04006689001080765, 0.3945500340435036, -0.07823193227876746, -0.14922740402275242, 0.2803281913876259, -0.2557226771226985, -0.09043845817154866, 0.17794117919053487, 0.21137145141966873, 0.08921239759841684, -0.05670187012898663, 0.001947860047328479, -0.036900660189333766, 0.14360854432549036, 0.15028275923013756, 0.027801128484154215, 0.38308767056787896, 0.10894984613931287, 0.03367596794314648, 0.10263267065068998, -0.16283196124408075, -0.10561258519016858, -0.211639968368272, -0.07216402866302513, -0.08071409008108414, 0.01431676531380873, -0.0857065039390992, -0.19418987793813583, 0.3205189869829243, 0.1348435893394096, 0.1559914215360575, 2.150178977078007e-05, 0.30409386465626376, 0.07997526506161583, 0.09682456209659061, 0.16981364758728149, 0.3364582412236709, 0.18256285179874213, 0.10233382131337845, -0.28345024897416515, 0.07388784087446522, 2.084230823862937e-05] |
1,802.06621 | A Natural Generalization of Stable Matching Solved via New Insights into
Ideal Cuts | We study a natural generalization of stable matching to the maximum weight
stable matching problem and we obtain a combinatorial polynomial time algorithm
for it by reducing it to the problem of finding a maximum weight ideal cut in a
DAG. We give the first polynomial time algorithm for the latter problem; this
algorithm is also combinatorial.
The combinatorial nature of our algorithms not only means that they are
efficient but also that they enable us to obtain additional structural and
algorithmic results:
- We show that the set, $\cal M'$, of maximum weight stable matchings forms a
sublattice $\cal L'$ of the lattice $\cal L$ of all stable matchings.
- We give an efficient algorithm for finding boy-optimal and girl-optimal
matchings in $\cal M'$.
- We generalize the notion of rotation, a central structural notion in the
context of the stable matching problem, to meta-rotation. Just as rotations
help traverse the lattice of all stable matchings, macro-rotations help
traverse the sublattice over $\cal M'$.
| cs.DS | we study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a dag we give the first polynomial time algorithm for the latter problem this algorithm is also combinatorial the combinatorial nature of our algorithms not only means that they are efficient but also that they enable us to obtain additional structural and algorithmic results we show that the set cal m of maximum weight stable matchings forms a sublattice cal l of the lattice cal l of all stable matchings we give an efficient algorithm for finding boyoptimal and girloptimal matchings in cal m we generalize the notion of rotation a central structural notion in the context of the stable matching problem to metarotation just as rotations help traverse the lattice of all stable matchings macrorotations help traverse the sublattice over cal m | [['we', 'study', 'a', 'natural', 'generalization', 'of', 'stable', 'matching', 'to', 'the', 'maximum', 'weight', 'stable', 'matching', 'problem', 'and', 'we', 'obtain', 'a', 'combinatorial', 'polynomial', 'time', 'algorithm', 'for', 'it', 'by', 'reducing', 'it', 'to', 'the', 'problem', 'of', 'finding', 'a', 'maximum', 'weight', 'ideal', 'cut', 'in', 'a', 'dag', 'we', 'give', 'the', 'first', 'polynomial', 'time', 'algorithm', 'for', 'the', 'latter', 'problem', 'this', 'algorithm', 'is', 'also', 'combinatorial', 'the', 'combinatorial', 'nature', 'of', 'our', 'algorithms', 'not', 'only', 'means', 'that', 'they', 'are', 'efficient', 'but', 'also', 'that', 'they', 'enable', 'us', 'to', 'obtain', 'additional', 'structural', 'and', 'algorithmic', 'results', 'we', 'show', 'that', 'the', 'set', 'cal', 'm', 'of', 'maximum', 'weight', 'stable', 'matchings', 'forms', 'a', 'sublattice', 'cal', 'l', 'of', 'the', 'lattice', 'cal', 'l', 'of', 'all', 'stable', 'matchings', 'we', 'give', 'an', 'efficient', 'algorithm', 'for', 'finding', 'boyoptimal', 'and', 'girloptimal', 'matchings', 'in', 'cal', 'm', 'we', 'generalize', 'the', 'notion', 'of', 'rotation', 'a', 'central', 'structural', 'notion', 'in', 'the', 'context', 'of', 'the', 'stable', 'matching', 'problem', 'to', 'metarotation', 'just', 'as', 'rotations', 'help', 'traverse', 'the', 'lattice', 'of', 'all', 'stable', 'matchings', 'macrorotations', 'help', 'traverse', 'the', 'sublattice', 'over', 'cal', 'm']] | [-0.14914615768618747, 0.09308653342608683, -0.08579117195279914, 0.06617893072440513, -0.11196457169054053, -0.12088673661280235, 0.10359098948538303, 0.39362322779584535, -0.3292869707640213, -0.3215178981765256, 0.08650125950188789, -0.2230375685340053, -0.152921651731705, 0.1356796767589153, -0.08365419479322773, 0.06098339757941003, 0.08803774616268428, 0.06766107346556044, -0.056069828704586384, -0.3007475334820868, 0.25204099803467434, 0.03334070313604006, 0.21257920843207195, 0.036784612638522174, 0.0854342588093839, 0.031549403903699376, 0.014668802430122337, 0.05095940708666097, -0.1908101302628605, 0.14875457252529037, 0.2567240094995904, 0.1627511426134483, 0.21456420188180253, -0.3752817376339926, -0.11997398802615655, 0.1908444597362246, 0.13426199152953686, 0.1061964048709296, 0.00416052404531761, -0.17497207197254594, 0.15822946190055978, -0.11707275730404484, -0.11521426717532633, -0.08080024968927042, 0.05641850646396604, -0.03819167296714562, -0.3124937820218834, -0.00010628989769464147, 0.11735908677978323, 0.016101804456273478, -0.023930623424475234, -0.11432980411815681, -0.016592241381589747, 0.07157037380340073, -0.031580227302664396, 0.03578156668875555, 0.0323222175865328, -0.09469906466311621, -0.14484166028272785, 0.39475895294660257, -0.007025743940774399, -0.1794617326953743, 0.11393083709799036, -0.09245683936272524, -0.1724407670730607, 0.14406655112257863, 0.1403297179030797, 0.2097345956636569, -0.06162621782314551, 0.10097457560352521, -0.13545262601294356, 0.1081418597929274, 0.12202057516190541, 0.039460612039517944, 0.1624036004318844, 0.13078897783114232, 0.19970680273998576, 0.16954741324740166, 0.011057348833478328, -0.0784627908834881, -0.2783124481528243, -0.15842829059361468, -0.1732660085213359, 0.02961554842173266, -0.15103764103512246, -0.2001267897872891, 0.3999437966820183, 0.1334356652348762, 0.22759957559689692, 0.10825047849477092, 0.2301699488255773, 0.08609104396628373, 0.019199604722612267, 0.12653097516526998, 0.16020647947281552, 0.14695685970025207, 0.023444356487421436, -0.23210859089526878, 0.03208120571743384, 0.1335837440771534] |
1,802.06622 | Setting the photoelectron clock through molecular alignment | The interaction of strong laser fields with matter intrinsically provides
powerful tools to image transient dynamics with an extremely high
spatiotemporal resolution. Here, we study strong-field ionisation of
laser-aligned molecules and show a full real-time picture of the photoelectron
dynamics in the combined action of the laser field and the molecular
interaction. We demonstrate that the molecule has a dramatic impact on the
overall strong-field dynamics: it sets the clock for the emission of electrons
with a given rescattering kinetic energy. This result represents a benchmark
for the seminal statements of molecular-frame strong-field physics and has
strong impact on the interpretation of self-diffraction experiments.
Furthermore, the resulting encoding of the time-energy relation in
molecular-frame photoelectron momentum distributions shows the way of probing
the molecular potential in real-time and accessing a deeper understanding of
electron transport during strong-field interactions.
| physics.atom-ph physics.atm-clus physics.chem-ph | the interaction of strong laser fields with matter intrinsically provides powerful tools to image transient dynamics with an extremely high spatiotemporal resolution here we study strongfield ionisation of laseraligned molecules and show a full realtime picture of the photoelectron dynamics in the combined action of the laser field and the molecular interaction we demonstrate that the molecule has a dramatic impact on the overall strongfield dynamics it sets the clock for the emission of electrons with a given rescattering kinetic energy this result represents a benchmark for the seminal statements of molecularframe strongfield physics and has strong impact on the interpretation of selfdiffraction experiments furthermore the resulting encoding of the timeenergy relation in molecularframe photoelectron momentum distributions shows the way of probing the molecular potential in realtime and accessing a deeper understanding of electron transport during strongfield interactions | [['the', 'interaction', 'of', 'strong', 'laser', 'fields', 'with', 'matter', 'intrinsically', 'provides', 'powerful', 'tools', 'to', 'image', 'transient', 'dynamics', 'with', 'an', 'extremely', 'high', 'spatiotemporal', 'resolution', 'here', 'we', 'study', 'strongfield', 'ionisation', 'of', 'laseraligned', 'molecules', 'and', 'show', 'a', 'full', 'realtime', 'picture', 'of', 'the', 'photoelectron', 'dynamics', 'in', 'the', 'combined', 'action', 'of', 'the', 'laser', 'field', 'and', 'the', 'molecular', 'interaction', 'we', 'demonstrate', 'that', 'the', 'molecule', 'has', 'a', 'dramatic', 'impact', 'on', 'the', 'overall', 'strongfield', 'dynamics', 'it', 'sets', 'the', 'clock', 'for', 'the', 'emission', 'of', 'electrons', 'with', 'a', 'given', 'rescattering', 'kinetic', 'energy', 'this', 'result', 'represents', 'a', 'benchmark', 'for', 'the', 'seminal', 'statements', 'of', 'molecularframe', 'strongfield', 'physics', 'and', 'has', 'strong', 'impact', 'on', 'the', 'interpretation', 'of', 'selfdiffraction', 'experiments', 'furthermore', 'the', 'resulting', 'encoding', 'of', 'the', 'timeenergy', 'relation', 'in', 'molecularframe', 'photoelectron', 'momentum', 'distributions', 'shows', 'the', 'way', 'of', 'probing', 'the', 'molecular', 'potential', 'in', 'realtime', 'and', 'accessing', 'a', 'deeper', 'understanding', 'of', 'electron', 'transport', 'during', 'strongfield', 'interactions']] | [-0.12442192645824474, 0.10740231902541447, -0.1266184618997732, 0.08514203053166874, -0.003584097561331979, -0.07432800576941151, 0.03996203455777056, 0.37051105318402033, -0.23883536497832855, -0.32099654571240954, -0.03697949055281967, -0.2576236682842769, -0.09517782381263332, 0.21107076764768123, 0.022141900423077353, 0.02693762630224228, 0.07538637502179683, -0.038017047400437834, -0.023072402981663312, -0.135486213311526, 0.2717513963613875, 0.12857251163855518, 0.26446824865348206, 0.1258928186886107, 0.11587971572399787, 0.043751500541870686, -0.011739784482178156, -0.013469180915558683, -0.11368729273622655, 0.11638909945790858, 0.1961670574450366, 0.10165362885437798, 0.2527972173175194, -0.46799354562940804, -0.24847676007724975, 0.009807127593692554, 0.1297821521124654, 0.14806364830313384, -0.10557463403149639, -0.2981355853540742, -0.039034313603263836, -0.14342440767348677, -0.12009729895794737, -0.1117873955855443, 0.02822720532160441, 0.05167975244483492, -0.24461586968897356, 0.0557916363367163, 0.038679786782333817, 0.05217745531674312, -0.056761049876407975, -0.011192007631441389, -0.015305732903273209, 0.10583985856383284, 0.017536774278530662, 0.059179084971074714, 0.16416599805402718, -0.20474617742339446, -0.12609143066051268, 0.4227198981612489, -0.08702788726372672, -0.11425414552534188, 0.21648333899329242, -0.2360953707281716, -0.13465719184824737, 0.1801837837337044, 0.13968754785162382, 0.12716262049271146, -0.12176005159626188, 0.08137703069107796, -0.007897849923566631, 0.18074072963571636, 0.056243380395007196, 0.11119721888267584, 0.2289138838675791, 0.21729211046097233, 0.002906305344262417, 0.10708474150548379, -0.15291721014258708, -0.1025500144654264, -0.25132375388014794, -0.13620429385817892, -0.13986496442078572, 0.09836061409357395, -0.06414675127092304, -0.13027179561069477, 0.41712221989840054, 0.14629328211405032, 0.1423135029145287, -0.025778038110044123, 0.3319401264703576, 0.11480101907922738, -0.0005196087109599856, 0.007470911868132543, 0.27749947643420403, 0.139123582146198, 0.09986738727826193, -0.30004207631978, 0.05962398789647589, 0.013723752370266162] |
1,802.06623 | On some random walk problems | In the first part of this thesis, we study a Markov chain on $\mathbb{R}_+
\times S$, where $\mathbb{R}_+$ is the non-negative real numbers and $S$ is a
finite set, in which when the $\mathbb{R}_+$-coordinate is large, the
$S$-coordinate of the process is approximately Markov with stationary
distribution $\pi_i$ on $S$. Denoting by $\mu_i(x)$ the mean drift of the
$\mathbb{R}_+$-coordinate of the process at $(x,i) \in \mathbb{R}_+ \times S$,
we give an exhaustive recurrence classification in the case where $\sum_{i}
\pi_i \mu_i (x) \to 0$, which is the critical regime for the
recurrence-transience phase transition. If $\mu_i(x) \to 0$ for all $i$, it is
natural to study the Lamperti case where $\mu_i(x) = O(1/x)$; in that case the
recurrence classification is known, but we prove new results on existence and
non-existence of moments of return times. If $\mu_i (x) \to d_i$ for $d_i \neq
0$ for at least some $i$, then it is natural to study the generalized Lamperti
case where $\mu_i (x) = d_i + O (1/x)$. By exploiting a transformation which
maps the generalized Lamperti case to the Lamperti case, we obtain a recurrence
classification and an existence of moments result for the former.
In the second part of the thesis, for a random walk $S_n$ on $\mathbb{R}^d$
we study the asymptotic behaviour of the associated centre of mass process $G_n
= n^{-1} \sum_{i=1}^n S_i$. For lattice distributions we give conditions for a
local limit theorem to hold. We prove that if the increments of the walk have
zero mean and finite second moment, $G_n$ is recurrent if $d=1$ and transient
if $d \geq 2$. In the transient case we show that $G_n$ has diffusive rate of
escape. These results extend work of Grill, who considered simple symmetric
random walk. We also give a class of random walks with symmetric heavy-tailed
increments for which $G_n$ is transient in $d=1$.
| math.PR | in the first part of this thesis we study a markov chain on mathbbr_ times s where mathbbr_ is the nonnegative real numbers and s is a finite set in which when the mathbbr_coordinate is large the scoordinate of the process is approximately markov with stationary distribution pi_i on s denoting by mu_ix the mean drift of the mathbbr_coordinate of the process at xi in mathbbr_ times s we give an exhaustive recurrence classification in the case where sum_i pi_i mu_i x to 0 which is the critical regime for the recurrencetransience phase transition if mu_ix to 0 for all i it is natural to study the lamperti case where mu_ix o1x in that case the recurrence classification is known but we prove new results on existence and nonexistence of moments of return times if mu_i x to d_i for d_i neq 0 for at least some i then it is natural to study the generalized lamperti case where mu_i x d_i o 1x by exploiting a transformation which maps the generalized lamperti case to the lamperti case we obtain a recurrence classification and an existence of moments result for the former in the second part of the thesis for a random walk s_n on mathbbrd we study the asymptotic behaviour of the associated centre of mass process g_n n1 sum_i1n s_i for lattice distributions we give conditions for a local limit theorem to hold we prove that if the increments of the walk have zero mean and finite second moment g_n is recurrent if d1 and transient if d geq 2 in the transient case we show that g_n has diffusive rate of escape these results extend work of grill who considered simple symmetric random walk we also give a class of random walks with symmetric heavytailed increments for which g_n is transient in d1 | [['in', 'the', 'first', 'part', 'of', 'this', 'thesis', 'we', 'study', 'a', 'markov', 'chain', 'on', 'mathbbr_', 'times', 's', 'where', 'mathbbr_', 'is', 'the', 'nonnegative', 'real', 'numbers', 'and', 's', 'is', 'a', 'finite', 'set', 'in', 'which', 'when', 'the', 'mathbbr_coordinate', 'is', 'large', 'the', 'scoordinate', 'of', 'the', 'process', 'is', 'approximately', 'markov', 'with', 'stationary', 'distribution', 'pi_i', 'on', 's', 'denoting', 'by', 'mu_ix', 'the', 'mean', 'drift', 'of', 'the', 'mathbbr_coordinate', 'of', 'the', 'process', 'at', 'xi', 'in', 'mathbbr_', 'times', 's', 'we', 'give', 'an', 'exhaustive', 'recurrence', 'classification', 'in', 'the', 'case', 'where', 'sum_i', 'pi_i', 'mu_i', 'x', 'to', '0', 'which', 'is', 'the', 'critical', 'regime', 'for', 'the', 'recurrencetransience', 'phase', 'transition', 'if', 'mu_ix', 'to', '0', 'for', 'all', 'i', 'it', 'is', 'natural', 'to', 'study', 'the', 'lamperti', 'case', 'where', 'mu_ix', 'o1x', 'in', 'that', 'case', 'the', 'recurrence', 'classification', 'is', 'known', 'but', 'we', 'prove', 'new', 'results', 'on', 'existence', 'and', 'nonexistence', 'of', 'moments', 'of', 'return', 'times', 'if', 'mu_i', 'x', 'to', 'd_i', 'for', 'd_i', 'neq', '0', 'for', 'at', 'least', 'some', 'i', 'then', 'it', 'is', 'natural', 'to', 'study', 'the', 'generalized', 'lamperti', 'case', 'where', 'mu_i', 'x', 'd_i', 'o', '1x', 'by', 'exploiting', 'a', 'transformation', 'which', 'maps', 'the', 'generalized', 'lamperti', 'case', 'to', 'the', 'lamperti', 'case', 'we', 'obtain', 'a', 'recurrence', 'classification', 'and', 'an', 'existence', 'of', 'moments', 'result', 'for', 'the', 'former', 'in', 'the', 'second', 'part', 'of', 'the', 'thesis', 'for', 'a', 'random', 'walk', 's_n', 'on', 'mathbbrd', 'we', 'study', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'associated', 'centre', 'of', 'mass', 'process', 'g_n', 'n1', 'sum_i1n', 's_i', 'for', 'lattice', 'distributions', 'we', 'give', 'conditions', 'for', 'a', 'local', 'limit', 'theorem', 'to', 'hold', 'we', 'prove', 'that', 'if', 'the', 'increments', 'of', 'the', 'walk', 'have', 'zero', 'mean', 'and', 'finite', 'second', 'moment', 'g_n', 'is', 'recurrent', 'if', 'd1', 'and', 'transient', 'if', 'd', 'geq', '2', 'in', 'the', 'transient', 'case', 'we', 'show', 'that', 'g_n', 'has', 'diffusive', 'rate', 'of', 'escape', 'these', 'results', 'extend', 'work', 'of', 'grill', 'who', 'considered', 'simple', 'symmetric', 'random', 'walk', 'we', 'also', 'give', 'a', 'class', 'of', 'random', 'walks', 'with', 'symmetric', 'heavytailed', 'increments', 'for', 'which', 'g_n', 'is', 'transient', 'in', 'd1']] | [-0.12895471819853746, 0.16580684509615679, -0.0486263070419869, 0.031754569893410065, -0.006777201733533658, -0.1549749482693942, 0.03596065739615595, 0.3602583250639583, -0.27386371292070383, -0.14801112838390776, 0.11598993631329363, -0.30712467168147367, -0.1236044569093174, 0.128428037305746, -0.043390417304133476, -0.008974016001493688, 0.005570673761931948, 0.10786109432361995, -0.03295043687826157, -0.27337353804880704, 0.2976376130291279, -0.04346569996019765, 0.20325023200502923, 0.026526357034324773, 0.10575906513258815, 0.012482711850525506, 0.03652188223307295, -0.0417110089614403, -0.18753528947676315, 0.026083412069638618, 0.19893242327612065, 0.0859565992361799, 0.26067106421044695, -0.3400714063676062, -0.1496782836358191, 0.21542609156241788, 0.1442818616827329, 0.02074021804816047, 0.006877328320162895, -0.2693999590621531, 0.1352935497865105, -0.12050677568832827, -0.1599849859279964, -0.02374964081560523, 0.14599516312363467, 0.055301110951071666, -0.3542229448859062, 0.08556585373302297, 0.14749967340026904, 0.042495956927274654, 0.0009033137961333386, -0.14727419385156942, -0.003987291560727446, 0.088829062017479, 0.05905069855623498, 0.05652212954104994, 0.05698692560229402, -0.08450224908986403, -0.08163791855803258, 0.364287986459661, -0.08514209538454713, -0.20650800572954775, 0.1168880310585628, -0.22500413263770538, -0.20689064340385932, 0.10504472973373007, 0.14096836234728982, 0.18393329804568412, -0.11386151230245185, 0.1484512736314369, -0.08464161063136619, 0.09007008990738541, 0.07853738352765932, -0.013768435597383217, 0.11303525181807535, 0.11904103503626424, 0.11604101540371654, 0.14246244164293304, -0.05596992091197381, -0.07406739550460056, -0.36387462886826444, -0.16304216829350743, -0.22632219669982803, 0.1690826691022094, -0.11410113027465972, -0.14966953212845754, 0.33712209625400946, 0.12547685350457222, 0.206489748556682, 0.14000775763503234, 0.1801885966404822, 0.150431190607919, -0.05391659727624429, 0.09034575784679356, 0.10155485613506327, 0.14432084752593702, 0.06715875201602924, -0.1636557739429264, 0.05778311295860928, 0.12837196132236653] |
1,802.06624 | Osteoarthritis Disease Detection System using Self Organizing Maps
Method based on Ossa Manus X-Ray | Osteoarthritis is a disease found in the world, including in Indonesia. The
purpose of this study was to detect the disease Osteoarthritis using Self
Organizing mapping (SOM), and to know the procedure of artificial intelligence
on the methods of Self Organizing Mapping (SOM). In this system, there are
several stages to preserve to detect disease Osteoarthritis using Self
Organizing maps is the result of photographic images rontgen Ossa Manus normal
and sick with the resolution (150 x 200 pixels) do the repair phase contrast,
the Gray scale, thresholding process, Histogram of process , and do the last
process, where the process of doing training (Training) and testing on images
that have kept the shape data (.text). the conclusion is the result of testing
by using a data image, where 42 of data have 12 Normal image data and image
data 30 sick. On the results of the process of training data there are 8 X-ray
image revealed normal right and 19 data x-ray image of pain expressed is
correct. Then the accuracy on the process of training was 96.42%, and in the
process of testing normal true image 4 obtained revealed Normal, 9 data pain
stated true pain and 1 data imagery hurts stated incorrectly, then the accuracy
gained from the results of testing are 92,8%.
| cs.CV | osteoarthritis is a disease found in the world including in indonesia the purpose of this study was to detect the disease osteoarthritis using self organizing mapping som and to know the procedure of artificial intelligence on the methods of self organizing mapping som in this system there are several stages to preserve to detect disease osteoarthritis using self organizing maps is the result of photographic images rontgen ossa manus normal and sick with the resolution 150 x 200 pixels do the repair phase contrast the gray scale thresholding process histogram of process and do the last process where the process of doing training training and testing on images that have kept the shape data text the conclusion is the result of testing by using a data image where 42 of data have 12 normal image data and image data 30 sick on the results of the process of training data there are 8 xray image revealed normal right and 19 data xray image of pain expressed is correct then the accuracy on the process of training was 9642 and in the process of testing normal true image 4 obtained revealed normal 9 data pain stated true pain and 1 data imagery hurts stated incorrectly then the accuracy gained from the results of testing are 928 | [['osteoarthritis', 'is', 'a', 'disease', 'found', 'in', 'the', 'world', 'including', 'in', 'indonesia', 'the', 'purpose', 'of', 'this', 'study', 'was', 'to', 'detect', 'the', 'disease', 'osteoarthritis', 'using', 'self', 'organizing', 'mapping', 'som', 'and', 'to', 'know', 'the', 'procedure', 'of', 'artificial', 'intelligence', 'on', 'the', 'methods', 'of', 'self', 'organizing', 'mapping', 'som', 'in', 'this', 'system', 'there', 'are', 'several', 'stages', 'to', 'preserve', 'to', 'detect', 'disease', 'osteoarthritis', 'using', 'self', 'organizing', 'maps', 'is', 'the', 'result', 'of', 'photographic', 'images', 'rontgen', 'ossa', 'manus', 'normal', 'and', 'sick', 'with', 'the', 'resolution', '150', 'x', '200', 'pixels', 'do', 'the', 'repair', 'phase', 'contrast', 'the', 'gray', 'scale', 'thresholding', 'process', 'histogram', 'of', 'process', 'and', 'do', 'the', 'last', 'process', 'where', 'the', 'process', 'of', 'doing', 'training', 'training', 'and', 'testing', 'on', 'images', 'that', 'have', 'kept', 'the', 'shape', 'data', 'text', 'the', 'conclusion', 'is', 'the', 'result', 'of', 'testing', 'by', 'using', 'a', 'data', 'image', 'where', '42', 'of', 'data', 'have', '12', 'normal', 'image', 'data', 'and', 'image', 'data', '30', 'sick', 'on', 'the', 'results', 'of', 'the', 'process', 'of', 'training', 'data', 'there', 'are', '8', 'xray', 'image', 'revealed', 'normal', 'right', 'and', '19', 'data', 'xray', 'image', 'of', 'pain', 'expressed', 'is', 'correct', 'then', 'the', 'accuracy', 'on', 'the', 'process', 'of', 'training', 'was', '9642', 'and', 'in', 'the', 'process', 'of', 'testing', 'normal', 'true', 'image', '4', 'obtained', 'revealed', 'normal', '9', 'data', 'pain', 'stated', 'true', 'pain', 'and', '1', 'data', 'imagery', 'hurts', 'stated', 'incorrectly', 'then', 'the', 'accuracy', 'gained', 'from', 'the', 'results', 'of', 'testing', 'are', '928']] | [-0.03446976369697198, 0.03203431471849971, -0.0705497009732144, 0.08753430608776228, -0.053444998431732185, -0.12354750319672617, 0.06469372246291996, 0.40726998366607886, -0.23072595174201357, -0.3423507096674381, 0.1582720650003637, -0.32545133558989553, -0.1377644356331425, 0.1716474399950023, -0.12514135771444146, 0.052117054623949555, 0.10251923228128695, 0.059944932659467064, -0.009514466077832618, -0.30065228227206764, 0.3082899550837355, 0.03930834177313067, 0.34388902621560163, -0.002695757490201545, 0.12567284603399867, -0.0114189521977984, -0.09502319076498576, -0.05051434394015882, -0.05410822576143207, 0.12035134463557895, 0.31239049112262474, 0.2293569881845038, 0.26687459240147204, -0.399448570524268, -0.17636860842803415, 0.08962974023481639, 0.10950088088877254, 0.059801867782649856, -0.035900964932909736, -0.3317773683180272, 0.10544099964960063, -0.08624679468377568, -0.04558680524192576, -0.0472641177868969, -0.00782974739121754, -0.038802058723188954, -0.26641399111924474, 0.09666936148937459, 0.07438630868457782, 0.16155931592958284, -0.09210239866521087, -0.09821493283707754, -0.031603764484640855, 0.1778812514980949, 0.05215019844660968, 0.093036872062596, 0.15976202508263582, -0.15194497048032815, -0.08931839055088764, 0.3614265605492491, -0.012705261127131296, -0.12036658356735754, 0.1668638113999254, -0.1111770279753621, -0.1335372147336165, 0.16572841966826415, 0.150496924183432, 0.06188331965243383, -0.19925901375081337, 0.015937063781798166, -2.3458547345821707e-05, 0.18265453162887288, 0.09597977443091012, -0.10037559512106291, 0.12995346820970097, 0.19507503033038492, -0.025857618875460515, 0.10594029388988407, -0.19487673507242556, -0.002014351309115338, -0.2186039586998566, -0.1406301104435216, -0.1911089125356064, 0.0003265548091487819, -0.09490930307558147, -0.14212399118846641, 0.3639446568834932, 0.17872407461381015, 0.21213267330832325, 0.05763236936968817, 0.27791706713992104, 0.026513473187603862, 0.1136147833355561, 0.00801957140243809, 0.19172064596218683, 0.039196942097637494, 0.12652748139758765, -0.14198444184558598, 0.07788767621900554, -0.0016153483638461207] |
1,802.06625 | PRUNE: Dynamic and Decidable Dataflow for Signal Processing on
Heterogeneous Platforms | The majority of contemporary mobile devices and personal computers are based
on heterogeneous computing platforms that consist of a number of CPU cores and
one or more Graphics Processing Units (GPUs). Despite the high volume of these
devices, there are few existing programming frameworks that target full and
simultaneous utilization of all CPU and GPU devices of the platform.
This article presents a dataflow-flavored Model of Computation (MoC) that has
been developed for deploying signal processing applications to heterogeneous
platforms. The presented MoC is dynamic and allows describing applications with
data dependent run-time behavior. On top of the MoC, formal design rules are
presented that enable application descriptions to be simultaneously dynamic and
decidable. Decidability guarantees compile-time application analyzability for
deadlock freedom and bounded memory.
The presented MoC and the design rules are realized in a novel Open Source
programming environment "PRUNE" and demonstrated with representative
application examples from the domains of image processing, computer vision and
wireless communications. Experimental results show that the proposed approach
outperforms the state-of-the-art in analyzability, flexibility and performance.
| cs.DC | the majority of contemporary mobile devices and personal computers are based on heterogeneous computing platforms that consist of a number of cpu cores and one or more graphics processing units gpus despite the high volume of these devices there are few existing programming frameworks that target full and simultaneous utilization of all cpu and gpu devices of the platform this article presents a dataflowflavored model of computation moc that has been developed for deploying signal processing applications to heterogeneous platforms the presented moc is dynamic and allows describing applications with data dependent runtime behavior on top of the moc formal design rules are presented that enable application descriptions to be simultaneously dynamic and decidable decidability guarantees compiletime application analyzability for deadlock freedom and bounded memory the presented moc and the design rules are realized in a novel open source programming environment prune and demonstrated with representative application examples from the domains of image processing computer vision and wireless communications experimental results show that the proposed approach outperforms the stateoftheart in analyzability flexibility and performance | [['the', 'majority', 'of', 'contemporary', 'mobile', 'devices', 'and', 'personal', 'computers', 'are', 'based', 'on', 'heterogeneous', 'computing', 'platforms', 'that', 'consist', 'of', 'a', 'number', 'of', 'cpu', 'cores', 'and', 'one', 'or', 'more', 'graphics', 'processing', 'units', 'gpus', 'despite', 'the', 'high', 'volume', 'of', 'these', 'devices', 'there', 'are', 'few', 'existing', 'programming', 'frameworks', 'that', 'target', 'full', 'and', 'simultaneous', 'utilization', 'of', 'all', 'cpu', 'and', 'gpu', 'devices', 'of', 'the', 'platform', 'this', 'article', 'presents', 'a', 'dataflowflavored', 'model', 'of', 'computation', 'moc', 'that', 'has', 'been', 'developed', 'for', 'deploying', 'signal', 'processing', 'applications', 'to', 'heterogeneous', 'platforms', 'the', 'presented', 'moc', 'is', 'dynamic', 'and', 'allows', 'describing', 'applications', 'with', 'data', 'dependent', 'runtime', 'behavior', 'on', 'top', 'of', 'the', 'moc', 'formal', 'design', 'rules', 'are', 'presented', 'that', 'enable', 'application', 'descriptions', 'to', 'be', 'simultaneously', 'dynamic', 'and', 'decidable', 'decidability', 'guarantees', 'compiletime', 'application', 'analyzability', 'for', 'deadlock', 'freedom', 'and', 'bounded', 'memory', 'the', 'presented', 'moc', 'and', 'the', 'design', 'rules', 'are', 'realized', 'in', 'a', 'novel', 'open', 'source', 'programming', 'environment', 'prune', 'and', 'demonstrated', 'with', 'representative', 'application', 'examples', 'from', 'the', 'domains', 'of', 'image', 'processing', 'computer', 'vision', 'and', 'wireless', 'communications', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'outperforms', 'the', 'stateoftheart', 'in', 'analyzability', 'flexibility', 'and', 'performance']] | [-0.16835089610294693, 0.006207568910123641, -0.030583171105292233, -0.008456980963668252, -0.12884862059081306, -0.1929105801879283, 0.04533721854091983, 0.42432978463956733, -0.25495047772803203, -0.35374260816529307, 0.14587439235597258, -0.2534781913098918, -0.1551968509437667, 0.27350030654255364, -0.09280438053356403, 0.11374012640047539, 0.12298715192652335, 0.0054789306434420496, -0.032022024180492485, -0.2832804250913118, 0.20263350626448373, 0.022846690405999993, 0.3598228443058671, 0.08220619905061718, 0.08841932403809268, -0.022549933460514152, -0.01849474179130478, -0.0019433230963788624, -0.042049011815518664, 0.20318558924653798, 0.3343358890105017, 0.20757682793073873, 0.2907618400479285, -0.4866830569535838, -0.19201882725656894, 0.02416003946311815, 0.11750425625998914, 0.04594073700583998, -0.09827501516874322, -0.2726043652570833, 0.12139893550899504, -0.20687805514125224, -0.0384459564354805, -0.13394004782403393, 0.011656041816953634, 0.0504432287339035, -0.23190548646161493, -0.01805157442119597, 0.02139139371756545, 0.08856261077365903, -0.02212402098662438, -0.13192296141457094, 0.0411143447158083, 0.14324385886089985, -0.026071665821343962, -0.03276977207070227, 0.17438521061760154, -0.1343396156932082, -0.19820274235922952, 0.4087566821216848, 0.01828404111421608, -0.18248479259052353, 0.2275448558566758, -0.021064305807547267, -0.1738245705925897, 0.08443424247092207, 0.22452613022286078, 0.08773539518948235, -0.16762590426090307, 0.10348429658074697, 0.04311482508187694, 0.1976616830730574, 0.05463484034340592, 0.07900708468867779, 0.1819579417984179, 0.27335422459149983, 0.04320895524474798, 0.1393947825713939, -0.04850505875165149, -0.12984593694146745, -0.22128680939220882, -0.16879798851421404, -0.19319085133022418, -0.04967150344133829, -0.08584313264906991, -0.14457344326777438, 0.36320012483767344, 0.21088532450934602, 0.08700814151987056, 0.08672204896043233, 0.38209710539334774, 0.027636092428031857, 0.15852309683219373, 0.13804048213924716, 0.12163393759044867, 0.04401377803710629, 0.19581363433864335, -0.18437346758528186, 0.05539932919160134, -0.02499014329452221] |
1,802.06626 | The Cosmic-Ray Spectra: News on their Knees | In a comprehensive model of Cosmic Rays (CRs) proposed a decade ago, the
energies of the spectral "knees" of the various CR species were predicted to be
proportional to mass, rather than charge. The model also predicts the knees to
occur at an energy of two to four million times the particle's rest mass.
Recent data allow one to verify this prediction, particularly for Fe and
lighter-nuclei CRs. But the most stringent test involves the putative knee in
the CR electron spectrum, since the mass ratio of electrons to protons (and
nuclei) is so very different from their charge ratio(s). Very recent results on
the spectra of positrons and electrons at the highest measured energies
corroborate the existence of an electron knee, with the expected shape and at
the predicted energy.
| hep-ph astro-ph.HE | in a comprehensive model of cosmic rays crs proposed a decade ago the energies of the spectral knees of the various cr species were predicted to be proportional to mass rather than charge the model also predicts the knees to occur at an energy of two to four million times the particles rest mass recent data allow one to verify this prediction particularly for fe and lighternuclei crs but the most stringent test involves the putative knee in the cr electron spectrum since the mass ratio of electrons to protons and nuclei is so very different from their charge ratios very recent results on the spectra of positrons and electrons at the highest measured energies corroborate the existence of an electron knee with the expected shape and at the predicted energy | [['in', 'a', 'comprehensive', 'model', 'of', 'cosmic', 'rays', 'crs', 'proposed', 'a', 'decade', 'ago', 'the', 'energies', 'of', 'the', 'spectral', 'knees', 'of', 'the', 'various', 'cr', 'species', 'were', 'predicted', 'to', 'be', 'proportional', 'to', 'mass', 'rather', 'than', 'charge', 'the', 'model', 'also', 'predicts', 'the', 'knees', 'to', 'occur', 'at', 'an', 'energy', 'of', 'two', 'to', 'four', 'million', 'times', 'the', 'particles', 'rest', 'mass', 'recent', 'data', 'allow', 'one', 'to', 'verify', 'this', 'prediction', 'particularly', 'for', 'fe', 'and', 'lighternuclei', 'crs', 'but', 'the', 'most', 'stringent', 'test', 'involves', 'the', 'putative', 'knee', 'in', 'the', 'cr', 'electron', 'spectrum', 'since', 'the', 'mass', 'ratio', 'of', 'electrons', 'to', 'protons', 'and', 'nuclei', 'is', 'so', 'very', 'different', 'from', 'their', 'charge', 'ratios', 'very', 'recent', 'results', 'on', 'the', 'spectra', 'of', 'positrons', 'and', 'electrons', 'at', 'the', 'highest', 'measured', 'energies', 'corroborate', 'the', 'existence', 'of', 'an', 'electron', 'knee', 'with', 'the', 'expected', 'shape', 'and', 'at', 'the', 'predicted', 'energy']] | [-0.04753752952405753, 0.16596054468648688, -0.034407003891940874, 0.13606935422867536, 0.019713812994842345, -0.08842112925620033, 0.021106045331376104, 0.35613398698086923, -0.20734272273705126, -0.38860588494974835, -0.02956469542114064, -0.33503879182255614, 0.026772396642571458, 0.20738508173694403, 0.03987766050088864, -0.005663666078068602, 0.03373389613922112, 0.04161966301035136, -0.06362718151022609, -0.20937289564798658, 0.2891579500077149, 0.20858044676267756, 0.27922066778231125, 0.11977973988799091, 0.0663384054760592, -0.056811445768779285, -0.021496159072893744, -0.03572427363922963, -0.09677170592073638, 0.10793911199479435, 0.19396291280595157, 0.06983614119414527, 0.18872299003056608, -0.4388946039029039, -0.20952654036003737, 0.11806506185899847, 0.1509777311146116, 0.06337989686558453, -0.06125068644939277, -0.225488018273161, 0.08956511664705781, -0.15892177633224772, -0.16513653911220338, 0.031345150923320596, -0.0018915698003883546, 0.026281440465782697, -0.2398894434239572, 0.10302184492219776, 0.004646595696417185, 0.008007202104020577, -0.12084290168534678, -0.1397817512938323, -0.04512916647990306, 0.0933083194343803, 0.1538844095149006, 0.020472740014800084, 0.16643541414792148, -0.10230698508676142, -0.08984920215219833, 0.4165962445263106, -0.024656718795645596, -0.07978352256692373, 0.22703057194952495, -0.21239982743819172, -0.13160852665941303, 0.22348263025498735, 0.1450853718373065, 0.1032078611700294, -0.17104357454137734, 0.015021003580365616, -0.009024189004244712, 0.1541831830014976, 0.05010638391742339, 0.023390450779026233, 0.2500643260991917, 0.14877261019293936, 0.021632007896327056, 0.00036852590094965237, -0.16535886334649358, -0.019474489277658553, -0.21182991679972754, -0.13719613133177447, -0.181878540749984, 0.04376093195034907, -0.06845915330744062, -0.09056773393844755, 0.4440351839642972, 0.12168163677650647, 0.259707958666751, 0.01881712370981964, 0.29040043861963427, 0.086835938369712, 0.05610461861719019, 0.08887098974978122, 0.3253258702524293, 0.12100013840692835, 0.1318788714742718, -0.20817302605764082, 0.03661508560717965, 0.015207439138052555] |
1,802.06627 | Robustness of Rotation-Equivariant Networks to Adversarial Perturbations | Deep neural networks have been shown to be vulnerable to adversarial
examples: very small perturbations of the input having a dramatic impact on the
predictions. A wealth of adversarial attacks and distance metrics to quantify
the similarity between natural and adversarial images have been proposed,
recently enlarging the scope of adversarial examples with geometric
transformations beyond pixel-wise attacks. In this context, we investigate the
robustness to adversarial attacks of new Convolutional Neural Network
architectures providing equivariance to rotations. We found that
rotation-equivariant networks are significantly less vulnerable to
geometric-based attacks than regular networks on the MNIST, CIFAR-10, and
ImageNet datasets.
| cs.CV cs.CR cs.LG | deep neural networks have been shown to be vulnerable to adversarial examples very small perturbations of the input having a dramatic impact on the predictions a wealth of adversarial attacks and distance metrics to quantify the similarity between natural and adversarial images have been proposed recently enlarging the scope of adversarial examples with geometric transformations beyond pixelwise attacks in this context we investigate the robustness to adversarial attacks of new convolutional neural network architectures providing equivariance to rotations we found that rotationequivariant networks are significantly less vulnerable to geometricbased attacks than regular networks on the mnist cifar10 and imagenet datasets | [['deep', 'neural', 'networks', 'have', 'been', 'shown', 'to', 'be', 'vulnerable', 'to', 'adversarial', 'examples', 'very', 'small', 'perturbations', 'of', 'the', 'input', 'having', 'a', 'dramatic', 'impact', 'on', 'the', 'predictions', 'a', 'wealth', 'of', 'adversarial', 'attacks', 'and', 'distance', 'metrics', 'to', 'quantify', 'the', 'similarity', 'between', 'natural', 'and', 'adversarial', 'images', 'have', 'been', 'proposed', 'recently', 'enlarging', 'the', 'scope', 'of', 'adversarial', 'examples', 'with', 'geometric', 'transformations', 'beyond', 'pixelwise', 'attacks', 'in', 'this', 'context', 'we', 'investigate', 'the', 'robustness', 'to', 'adversarial', 'attacks', 'of', 'new', 'convolutional', 'neural', 'network', 'architectures', 'providing', 'equivariance', 'to', 'rotations', 'we', 'found', 'that', 'rotationequivariant', 'networks', 'are', 'significantly', 'less', 'vulnerable', 'to', 'geometricbased', 'attacks', 'than', 'regular', 'networks', 'on', 'the', 'mnist', 'cifar10', 'and', 'imagenet', 'datasets']] | [-0.09015007144655102, -0.03061043846420944, -0.017397553119808437, 0.1436753950093407, -0.08560183310415596, -0.228266700678505, 0.02140794773120433, 0.45537838111515155, -0.228241204591468, -0.325206254273653, 0.06263696682988666, -0.3040034275688231, -0.29202817033510653, 0.19885041396599262, -0.2326223810762167, 0.15496164857409894, 0.09474369480274618, 0.013611871774774045, -0.0822542987135239, -0.37100964279845355, 0.3399160215444863, 0.0798714415563154, 0.34382947720587254, 0.01813753283699043, 0.0964859741833061, -0.15839556776336394, 0.024049082463607194, 0.0036681415780913085, -0.048212074435214164, 0.13101775548886507, 0.2680728515195369, 0.18719045367557555, 0.3480068155378103, -0.4468447075318545, -0.2817452979716472, 0.14662137125618757, 0.07812139133224263, 0.17047917207833962, -0.03446620860369876, -0.46398413153365253, 0.1609202596032992, -0.20922182845883072, 0.04108442828990519, -0.20882952301762997, 0.0280958243238274, 0.015185765856876969, -0.24191960947588087, -0.028701450265944003, 0.09910912933875807, 0.07919289611279964, 0.013300711098127067, -0.0767478125076741, -0.05445917547680437, 0.13769172080792486, 0.06625569101597648, 0.03309522954747081, 0.16299831109121443, -0.19765823580266442, -0.15938399286940694, 0.3061764763295651, -0.029126888574828626, -0.2010349422879517, 0.19787443002685903, 0.015299531035125255, -0.1604679701058194, 0.08710159853100777, 0.327162589719519, 0.1141905921883881, -0.1274956734199077, -0.014501212152536027, -0.01784677208866924, 0.15978543570265175, 0.10084513017442077, 0.051365574174560606, 0.10288481689058245, 0.24277239782735704, 0.04179181842133403, 0.193025063945679, -0.1703885218920186, -0.09572604835964739, -0.1565420360956341, 0.010822889502160251, -0.17771550212986767, 0.04117227062350139, -0.12689283312720362, -0.14229408548300854, 0.41842113398946823, 0.247089155332651, 0.2338172739185393, 0.14952233157353476, 0.35067785661667583, -0.06250812228303403, 0.2030498979613185, 0.1252722962060943, 0.2650280350772664, 0.07892069960013032, 0.08047939155367204, -0.09694134010002017, 0.1420782429818064, -0.007683877050876618] |
1,802.06628 | A remark on the ultrapower algebra of the hyperfinite factor | On page 43 in \cite{Po83} Sorin Popa asked whether the following property
holds: \emph{If $\omega$ is a free ultrafilter on $\mathbb N$ and $\mathcal
R_1\subseteq \mathcal R$ is an irreducible inclusion of hyperfinite II$_1$
factors such that $\mathcal R'\cap \mathcal R^\omega\subseteq \mathcal
R^\omega_1$ does it follows that $\mathcal R_1=\mathcal R$?} In this short note
we provide an affirmative answer to this question.
| math.OA math.FA | on page 43 in citepo83 sorin popa asked whether the following property holds emphif omega is a free ultrafilter on mathbb n and mathcal r_1subseteq mathcal r is an irreducible inclusion of hyperfinite ii_1 factors such that mathcal rcap mathcal romegasubseteq mathcal romega_1 does it follows that mathcal r_1mathcal r in this short note we provide an affirmative answer to this question | [['on', 'page', '43', 'in', 'citepo83', 'sorin', 'popa', 'asked', 'whether', 'the', 'following', 'property', 'holds', 'emphif', 'omega', 'is', 'a', 'free', 'ultrafilter', 'on', 'mathbb', 'n', 'and', 'mathcal', 'r_1subseteq', 'mathcal', 'r', 'is', 'an', 'irreducible', 'inclusion', 'of', 'hyperfinite', 'ii_1', 'factors', 'such', 'that', 'mathcal', 'rcap', 'mathcal', 'romegasubseteq', 'mathcal', 'romega_1', 'does', 'it', 'follows', 'that', 'mathcal', 'r_1mathcal', 'r', 'in', 'this', 'short', 'note', 'we', 'provide', 'an', 'affirmative', 'answer', 'to', 'this', 'question']] | [-0.19694523428077415, 0.09949990273976178, -0.024452811241213044, 0.04282790823381836, -0.08775892535666541, -0.19925577366345767, -0.020177585353001445, 0.35092155808993314, -0.3249190054455046, -0.11562232827862441, 0.04312114261674805, -0.32404311335945535, -0.08369345868685109, 0.15493367377755438, -0.24229000549037324, -0.06485033303625502, 0.04422567631670479, 0.10983449217155024, -0.024758918865946895, -0.30442415567714787, 0.3526076891033326, -0.04834383349644683, 0.17608568961811016, 0.1511421524130313, 0.06165658479745863, -0.007123771313009626, 0.023067322433373685, -0.039849984506934374, -0.2732274528147388, 0.05205488003399697, 0.3071665204114328, 0.21508908058690318, 0.2701794160056417, -0.29613531456660414, -0.031893083304798196, 0.24489125923521943, 0.17995193210367302, -0.11613165148360244, 0.03485360260563508, -0.23241453201083814, 0.11623718509040142, -0.19065250224291774, -0.0894655400415551, -0.052017266431949656, 0.26568856462836266, -0.09918037598352816, -0.3476415646846517, -0.008117685276004722, 0.2391004317866291, 0.08126037957746599, -0.040809068690701306, -0.08077123524400137, -0.027282393774238682, 0.05112546064370012, -0.04056140571235843, 0.19031225505553312, 0.06157402771572441, 0.001189291927079528, -0.07554588600464354, 0.3471083391805069, -0.0852719742362782, -0.17184967475956092, 0.08439276423463124, -0.17619847350011944, -0.23725750941341206, 0.043944775631998556, 0.021541426854081832, 0.17022673836198904, -0.0069711171687478046, 0.2994777457936572, -0.24686824666115187, 0.15580981900576124, 0.10986222484606807, 0.007485043809954393, 0.030139296643151823, 0.07545901669220904, 0.049575130846371114, 0.07042189376523435, 0.13731146236818473, 0.13476759496823712, -0.3709250616335894, -0.14527293548808765, -0.11324934612454499, 0.3031667576060962, -0.0810964147684113, -0.1471150948397689, 0.2692602553357512, 0.10563834128364669, 0.1747959842076683, 0.10249578774417356, 0.12624150700867176, 0.02662474083935179, -0.01721581920855126, 0.1514001770765852, 0.060380501546344514, 0.14360095771282153, -0.05958769503602032, -0.16949928321449434, -0.01583731479121972, 0.23836888960104877] |
1,802.06629 | SEAGLE - I: A pipeline for simulating and modeling strong lenses from
cosmological hydrodynamic simulations | In this paper we introduce the SEAGLE (i.e. Simulating EAGLE LEnses) program,
that approaches the study of galaxy formation through strong gravitational
lensing, using a suite of high-resolution hydrodynamic simulations, Evolution
and Assembly of GaLaxies and their Environments (EAGLE) project. We introduce
the simulation and analysis pipeline and present the first set of results from
our analysis of early-type galaxies. We identify and extract an ensemble of
simulated lens galaxies and use the GLAMER ray-tracing lensing code to create
mock lenses similar to those observed in the SLACS and SL2S surveys, using a
range of source parameters and galaxy orientations, including observational
effects such as the Point-Spread-Function (PSF), pixelization and noise levels,
representative of single-orbit observations with the Hubble Space Telescope
(HST) using the ACS-F814W filter. We subsequently model these mock lenses using
the code LENSED, treating them in the same way as observed lenses. We also
estimate the mass model parameters directly from the projected surface mass
density of the simulated galaxy, using an identical mass model family. We
perform a three-way comparison of all the measured quantities with real lenses.
We find the average total density slope of EAGLE lenses, $t=2.26\; (0.25\;
\rm{rms})$ to be higher than SL2S, $t=2.16$ or SLACS, $t=2.08$. We find a very
strong correlation between the external shear ($\gamma$) and the complex
ellipticity ($\epsilon$), with $\gamma \sim \epsilon/4$. This correlation
indicates a degeneracy in the lens mass modeling. We also see a dispersion
between lens modeling and direct fitting results, indicating systematical
biases.
| astro-ph.CO astro-ph.GA | in this paper we introduce the seagle ie simulating eagle lenses program that approaches the study of galaxy formation through strong gravitational lensing using a suite of highresolution hydrodynamic simulations evolution and assembly of galaxies and their environments eagle project we introduce the simulation and analysis pipeline and present the first set of results from our analysis of earlytype galaxies we identify and extract an ensemble of simulated lens galaxies and use the glamer raytracing lensing code to create mock lenses similar to those observed in the slacs and sl2s surveys using a range of source parameters and galaxy orientations including observational effects such as the pointspreadfunction psf pixelization and noise levels representative of singleorbit observations with the hubble space telescope hst using the acsf814w filter we subsequently model these mock lenses using the code lensed treating them in the same way as observed lenses we also estimate the mass model parameters directly from the projected surface mass density of the simulated galaxy using an identical mass model family we perform a threeway comparison of all the measured quantities with real lenses we find the average total density slope of eagle lenses t226 025 rmrms to be higher than sl2s t216 or slacs t208 we find a very strong correlation between the external shear gamma and the complex ellipticity epsilon with gamma sim epsilon4 this correlation indicates a degeneracy in the lens mass modeling we also see a dispersion between lens modeling and direct fitting results indicating systematical biases | [['in', 'this', 'paper', 'we', 'introduce', 'the', 'seagle', 'ie', 'simulating', 'eagle', 'lenses', 'program', 'that', 'approaches', 'the', 'study', 'of', 'galaxy', 'formation', 'through', 'strong', 'gravitational', 'lensing', 'using', 'a', 'suite', 'of', 'highresolution', 'hydrodynamic', 'simulations', 'evolution', 'and', 'assembly', 'of', 'galaxies', 'and', 'their', 'environments', 'eagle', 'project', 'we', 'introduce', 'the', 'simulation', 'and', 'analysis', 'pipeline', 'and', 'present', 'the', 'first', 'set', 'of', 'results', 'from', 'our', 'analysis', 'of', 'earlytype', 'galaxies', 'we', 'identify', 'and', 'extract', 'an', 'ensemble', 'of', 'simulated', 'lens', 'galaxies', 'and', 'use', 'the', 'glamer', 'raytracing', 'lensing', 'code', 'to', 'create', 'mock', 'lenses', 'similar', 'to', 'those', 'observed', 'in', 'the', 'slacs', 'and', 'sl2s', 'surveys', 'using', 'a', 'range', 'of', 'source', 'parameters', 'and', 'galaxy', 'orientations', 'including', 'observational', 'effects', 'such', 'as', 'the', 'pointspreadfunction', 'psf', 'pixelization', 'and', 'noise', 'levels', 'representative', 'of', 'singleorbit', 'observations', 'with', 'the', 'hubble', 'space', 'telescope', 'hst', 'using', 'the', 'acsf814w', 'filter', 'we', 'subsequently', 'model', 'these', 'mock', 'lenses', 'using', 'the', 'code', 'lensed', 'treating', 'them', 'in', 'the', 'same', 'way', 'as', 'observed', 'lenses', 'we', 'also', 'estimate', 'the', 'mass', 'model', 'parameters', 'directly', 'from', 'the', 'projected', 'surface', 'mass', 'density', 'of', 'the', 'simulated', 'galaxy', 'using', 'an', 'identical', 'mass', 'model', 'family', 'we', 'perform', 'a', 'threeway', 'comparison', 'of', 'all', 'the', 'measured', 'quantities', 'with', 'real', 'lenses', 'we', 'find', 'the', 'average', 'total', 'density', 'slope', 'of', 'eagle', 'lenses', 't226', '025', 'rmrms', 'to', 'be', 'higher', 'than', 'sl2s', 't216', 'or', 'slacs', 't208', 'we', 'find', 'a', 'very', 'strong', 'correlation', 'between', 'the', 'external', 'shear', 'gamma', 'and', 'the', 'complex', 'ellipticity', 'epsilon', 'with', 'gamma', 'sim', 'epsilon4', 'this', 'correlation', 'indicates', 'a', 'degeneracy', 'in', 'the', 'lens', 'mass', 'modeling', 'we', 'also', 'see', 'a', 'dispersion', 'between', 'lens', 'modeling', 'and', 'direct', 'fitting', 'results', 'indicating', 'systematical', 'biases']] | [-0.05972216307704688, 0.012732149773686705, -0.10861204926222258, 0.10549188534954379, -0.08740308478314307, -0.03985164604974208, -0.01645496933669478, 0.4176789731069728, -0.17387318742446234, -0.40242490376971785, 0.019682058097878624, -0.29857141617685556, -0.1240559604207863, 0.22314295328039005, 0.04025409065165984, 0.04490186966436564, 0.08305413128290952, -0.14082538331935152, -0.09560539648337595, -0.26538950014433854, 0.3382131231883846, 0.09388325476759403, 0.19540582289828606, -0.0765560246368519, 0.11304394077983414, -0.004618500493663425, -0.12406683040469824, 0.04897034741386096, -0.1998708427123705, 0.027056196488852262, 0.19715600448458256, 0.13197224107990804, 0.20889124246772195, -0.3162807493172891, -0.18112746952483277, 0.08643554158310299, 0.14550518655966296, 0.11302839252801009, -0.08572794946166305, -0.31448621530330084, 0.06097139451379857, -0.18854265317862823, -0.1294003757686339, 0.00632021450661848, -0.041448817408517705, 0.07257553308173541, -0.245786145417264, 0.13287936682625842, -0.031797082472562056, 0.08565325427563769, -0.084362276377477, -0.08034459739870041, -0.05200618074407236, 0.12022983403275263, -0.017140782164833432, 0.05068079426934271, 0.16987998052843709, -0.14518850091863883, -0.017312330727705914, 0.42373979636291464, -0.07585252407008113, -0.09167909801013951, 0.18506220559643002, -0.18668184074674365, -0.15719644748414943, 0.05505414563135748, 0.20932546525918802, 0.08523369230008894, -0.13781889286426613, 0.013886860359248278, -0.02135230858259659, 0.25733310987955327, 0.04350477849423397, 0.0002971565549249463, 0.2797408621499628, 0.10947457735653829, 0.0273648086156635, 0.11940320826910406, -0.2320330346683775, 0.010613679851035084, -0.26502220844849944, -0.10151993533354023, -0.1420787168217281, 0.06868504097429486, -0.14176811320967467, -0.1552127486783782, 0.34415677175131915, 0.17565416093041633, 0.20408041410074906, 0.12276317035115217, 0.3490141964685477, 0.04740923900949458, 0.11994076112941762, 0.03302276665421172, 0.2850526224041251, 0.1472920369877877, 0.03611648645248172, -0.216590736889601, -0.007856398651025212, -0.019918705085788656] |
1,802.0663 | Ultrafast Preparation and Detection of Ring Currents in Single Atoms | Quantum particles can penetrate potential barriers by tunneling (1). If that
barrier is rotating, the tunneling process is modified (2,3). This is typical
for electrons in atoms, molecules or solids exposed to strong circularly
polarized laser pulses (4,5). Here we measure how the transmission probability
through a rotating tunnel depends on the sign of the magnetic quantum number m
of the electron and thus on the initial sense of rotation of its quantum phase.
We further show that the electron keeps part of that rotary motion on its way
through the tunnel by measuring m-dependent modification of the electron
emission pattern. These findings are relevant for attosecond metrology as well
as for interpretation of strong field electron emission from atoms and
molecules (6-13) and directly demonstrates the creation of ring currents in
bound states of ions with attosecond precision. In solids, this could open a
way to inducing and controlling ring-current related topological phenomena
(14).
| physics.atom-ph | quantum particles can penetrate potential barriers by tunneling 1 if that barrier is rotating the tunneling process is modified 23 this is typical for electrons in atoms molecules or solids exposed to strong circularly polarized laser pulses 45 here we measure how the transmission probability through a rotating tunnel depends on the sign of the magnetic quantum number m of the electron and thus on the initial sense of rotation of its quantum phase we further show that the electron keeps part of that rotary motion on its way through the tunnel by measuring mdependent modification of the electron emission pattern these findings are relevant for attosecond metrology as well as for interpretation of strong field electron emission from atoms and molecules 613 and directly demonstrates the creation of ring currents in bound states of ions with attosecond precision in solids this could open a way to inducing and controlling ringcurrent related topological phenomena 14 | [['quantum', 'particles', 'can', 'penetrate', 'potential', 'barriers', 'by', 'tunneling', '1', 'if', 'that', 'barrier', 'is', 'rotating', 'the', 'tunneling', 'process', 'is', 'modified', '23', 'this', 'is', 'typical', 'for', 'electrons', 'in', 'atoms', 'molecules', 'or', 'solids', 'exposed', 'to', 'strong', 'circularly', 'polarized', 'laser', 'pulses', '45', 'here', 'we', 'measure', 'how', 'the', 'transmission', 'probability', 'through', 'a', 'rotating', 'tunnel', 'depends', 'on', 'the', 'sign', 'of', 'the', 'magnetic', 'quantum', 'number', 'm', 'of', 'the', 'electron', 'and', 'thus', 'on', 'the', 'initial', 'sense', 'of', 'rotation', 'of', 'its', 'quantum', 'phase', 'we', 'further', 'show', 'that', 'the', 'electron', 'keeps', 'part', 'of', 'that', 'rotary', 'motion', 'on', 'its', 'way', 'through', 'the', 'tunnel', 'by', 'measuring', 'mdependent', 'modification', 'of', 'the', 'electron', 'emission', 'pattern', 'these', 'findings', 'are', 'relevant', 'for', 'attosecond', 'metrology', 'as', 'well', 'as', 'for', 'interpretation', 'of', 'strong', 'field', 'electron', 'emission', 'from', 'atoms', 'and', 'molecules', '613', 'and', 'directly', 'demonstrates', 'the', 'creation', 'of', 'ring', 'currents', 'in', 'bound', 'states', 'of', 'ions', 'with', 'attosecond', 'precision', 'in', 'solids', 'this', 'could', 'open', 'a', 'way', 'to', 'inducing', 'and', 'controlling', 'ringcurrent', 'related', 'topological', 'phenomena', '14']] | [-0.12385017399422148, 0.24188938920761083, -0.044310347432597215, 0.04299095772059988, 0.014248563133954228, -0.14801678443992777, 0.07321283641851858, 0.40117535263590226, -0.2740048021637508, -0.3283572321600438, -0.002193156931422312, -0.29519064476495827, -0.08832195038489948, 0.23207643932841307, 0.005108431764793667, 0.03045439543489778, 0.021820335215798205, -0.027056721486635023, -0.0069305821210025, -0.17971681955863128, 0.30175909771608167, 0.06843559228733496, 0.24669238906837515, 0.11754448789734297, 0.0877605683545207, 0.015816029829469013, 0.06690515240944632, -0.02436930462476108, -0.09929197802817466, 0.10108758817021864, 0.18721029528888403, 0.03232449333957554, 0.20681829653777084, -0.4862652512859892, -0.20117775379534955, 0.025733362314151072, 0.1716097900613707, 0.1429675500658522, -0.1109883692198699, -0.28663382877886007, 0.020980775362340272, -0.12229500301696311, -0.149709422994018, -0.0687862404065763, 0.05799736185437794, 0.07252389914015997, -0.2361896443422642, 0.060096259401240325, 0.05342316888983349, 0.04424408932712365, -0.04837707114895781, -0.025787180114247195, -0.011297611614943227, 0.07186234959661235, 0.019867415303120983, 0.06215702342595179, 0.23456572841054626, -0.14236348264815904, -0.12685161344964033, 0.3827602245766282, -0.10028948643027091, -0.12961234095470084, 0.17984373022669128, -0.22292093311242953, -0.03963402538959469, 0.15474883636290376, 0.11599270839473934, 0.12722848917587432, -0.11513914585161905, 0.051283134100656325, -0.019607671418578013, 0.14607929711021458, 0.11527795138672091, 0.08286792204666932, 0.268507211977108, 0.13596701045073084, 0.06480024199854952, 0.11577607248909771, -0.16566725151444023, -0.07012951665697015, -0.2549411907985613, -0.18874127166111374, -0.20187862234359438, 0.1095333191408933, -0.027141673320695732, -0.1268296569371112, 0.4073120032485526, 0.1301506546294988, 0.151329379232431, -0.06846787248943727, 0.2900067157408392, 0.11616122810466384, 0.03254053954038068, 0.017670691258261925, 0.2513397856034919, 0.1724705919169809, 0.07443401950725971, -0.2712683092346173, 0.06446546139256037, -0.009538752639170301] |
1,802.06631 | Temperature Dependent Magnetism in Artificial Honeycomb Lattice of
Connected Elements | Artificial magnetic honeycomb lattices are expected to exhibit a broad and
tunable range of novel magnetic phenomena that would be difficult to achieve in
natural materials, such as long-range spin ice, entropy-driven magnetic
charge-ordered state and spin-order due to the spin chirality. Eventually, the
spin correlation is expected to develop into a unique spin solid state density
ground state, manifested by the distribution of the pairs of vortex states of
opposite chirality. Here we report the creation of a new artificial permalloy
honeycomb lattice of ultra-small connecting bonds, with a typical size of
$\simeq$ 12 nm. Detail magnetic and neutron scattering measurements on the
newly fabricated honeycomb lattice demonstrate the evolution of magnetic
correlation as a function of temperature. At low enough temperature, neutron
scattering measurements and micromagnetic simulation suggest the development of
loop state of vortex configuration in this system.
| cond-mat.mes-hall | artificial magnetic honeycomb lattices are expected to exhibit a broad and tunable range of novel magnetic phenomena that would be difficult to achieve in natural materials such as longrange spin ice entropydriven magnetic chargeordered state and spinorder due to the spin chirality eventually the spin correlation is expected to develop into a unique spin solid state density ground state manifested by the distribution of the pairs of vortex states of opposite chirality here we report the creation of a new artificial permalloy honeycomb lattice of ultrasmall connecting bonds with a typical size of simeq 12 nm detail magnetic and neutron scattering measurements on the newly fabricated honeycomb lattice demonstrate the evolution of magnetic correlation as a function of temperature at low enough temperature neutron scattering measurements and micromagnetic simulation suggest the development of loop state of vortex configuration in this system | [['artificial', 'magnetic', 'honeycomb', 'lattices', 'are', 'expected', 'to', 'exhibit', 'a', 'broad', 'and', 'tunable', 'range', 'of', 'novel', 'magnetic', 'phenomena', 'that', 'would', 'be', 'difficult', 'to', 'achieve', 'in', 'natural', 'materials', 'such', 'as', 'longrange', 'spin', 'ice', 'entropydriven', 'magnetic', 'chargeordered', 'state', 'and', 'spinorder', 'due', 'to', 'the', 'spin', 'chirality', 'eventually', 'the', 'spin', 'correlation', 'is', 'expected', 'to', 'develop', 'into', 'a', 'unique', 'spin', 'solid', 'state', 'density', 'ground', 'state', 'manifested', 'by', 'the', 'distribution', 'of', 'the', 'pairs', 'of', 'vortex', 'states', 'of', 'opposite', 'chirality', 'here', 'we', 'report', 'the', 'creation', 'of', 'a', 'new', 'artificial', 'permalloy', 'honeycomb', 'lattice', 'of', 'ultrasmall', 'connecting', 'bonds', 'with', 'a', 'typical', 'size', 'of', 'simeq', '12', 'nm', 'detail', 'magnetic', 'and', 'neutron', 'scattering', 'measurements', 'on', 'the', 'newly', 'fabricated', 'honeycomb', 'lattice', 'demonstrate', 'the', 'evolution', 'of', 'magnetic', 'correlation', 'as', 'a', 'function', 'of', 'temperature', 'at', 'low', 'enough', 'temperature', 'neutron', 'scattering', 'measurements', 'and', 'micromagnetic', 'simulation', 'suggest', 'the', 'development', 'of', 'loop', 'state', 'of', 'vortex', 'configuration', 'in', 'this', 'system']] | [-0.1782909037532113, 0.2748383465586296, -0.029923625551296254, 0.019481375195905037, -0.0494343958256753, -0.11444965348057184, 0.04694101289211911, 0.4111802914437461, -0.2707621101653269, -0.31150087030647416, 0.030891572856360794, -0.2800321787503277, -0.09290879874338284, 0.15421995965777135, 0.10093362696785876, 0.030142269711545173, -0.004668134727006686, -0.017861488917578303, -0.08788016035406461, -0.1620600273798002, 0.288758304070001, 0.029598594620057667, 0.3264209401120055, 0.09723667766740347, 0.07788077961151482, 0.0006423341853425224, 0.13187138905008952, 0.01967355139811147, -0.14022219646252496, 0.05149462631885425, 0.20099679803548393, -0.0641576193887344, 0.15523826727868184, -0.49160709471197417, -0.1940598743009969, 0.030863739371775313, 0.15289202864539433, 0.156355003842833, -0.05979862586258257, -0.2859432087923856, 0.027897927742897274, -0.16848574028555172, -0.16729580753991471, -0.11940517534620743, 0.0215523145524851, 0.018528444944312862, -0.2585059625719152, 0.06754799459644771, 0.06449745710879723, 0.09408054186414319, -0.0948298372285348, -0.12842872095086236, -0.08631583699520598, 0.045873241617958596, 0.004673248049571899, 0.07552415793695559, 0.16612266411951987, -0.15119410626398702, -0.17101264427207966, 0.35069516747661517, -0.03921942329628671, -0.07642306172097406, 0.16287241907664807, -0.20310170389711857, -0.06279416619106493, 0.17008931747743372, 0.15521800469157968, 0.08073076406982563, -0.11306607641332539, -0.007230006475191471, -0.03975132058113681, 0.19064709726153006, 0.019604217102552984, 0.10477238102875491, 0.333929204150823, 0.24045491384025267, 0.04492449280574706, 0.1760823708613806, -0.1786187209523529, -0.08679668084513528, -0.20387700062033767, -0.1651439260285189, -0.24810834333353432, 0.09208746175017499, -0.05928815641656769, -0.2183024084644643, 0.37294844830745555, 0.1614343879070688, 0.17567396157954535, -0.0589203810557089, 0.22051323830737923, 0.053691927589647845, 0.07895984137364735, -0.006391270308266559, 0.24056011444974876, 0.20712977441371228, 0.1300518587330713, -0.3030387833086998, 0.04293119297065633, -0.02821229483621816] |
1,802.06632 | Large Scale Liquid Metal Batteries | Liquid metal batteries are possible candidates for large scale energy storage
offering a possible breakthrough of intermittent wind and solar energy
exploitations. The major concern over their practical implementation is the
operation at elevated temperatures and sensitivity to liquid motion. The
concept of liquid metal battery bears a close similarity to aluminium
electrolytic production cells. The two liquid layer MHD effects can be
projected to the three liquid layer self-segregated structure of the batteries.
This paper presents numerical models for the three density-stratified
electrically conductive liquid layers using 3D and shallow layer approximation
accounting for specific MHD effects during periods of battery activity. It is
demonstrated that a stable operation of these batteries can be achieved if
reusing an infrastructure of existing aluminium electrolysis pot lines. The
basic principles of the MHD processes in the cells are illustrated by the
numerical example cases.
| physics.app-ph physics.flu-dyn | liquid metal batteries are possible candidates for large scale energy storage offering a possible breakthrough of intermittent wind and solar energy exploitations the major concern over their practical implementation is the operation at elevated temperatures and sensitivity to liquid motion the concept of liquid metal battery bears a close similarity to aluminium electrolytic production cells the two liquid layer mhd effects can be projected to the three liquid layer selfsegregated structure of the batteries this paper presents numerical models for the three densitystratified electrically conductive liquid layers using 3d and shallow layer approximation accounting for specific mhd effects during periods of battery activity it is demonstrated that a stable operation of these batteries can be achieved if reusing an infrastructure of existing aluminium electrolysis pot lines the basic principles of the mhd processes in the cells are illustrated by the numerical example cases | [['liquid', 'metal', 'batteries', 'are', 'possible', 'candidates', 'for', 'large', 'scale', 'energy', 'storage', 'offering', 'a', 'possible', 'breakthrough', 'of', 'intermittent', 'wind', 'and', 'solar', 'energy', 'exploitations', 'the', 'major', 'concern', 'over', 'their', 'practical', 'implementation', 'is', 'the', 'operation', 'at', 'elevated', 'temperatures', 'and', 'sensitivity', 'to', 'liquid', 'motion', 'the', 'concept', 'of', 'liquid', 'metal', 'battery', 'bears', 'a', 'close', 'similarity', 'to', 'aluminium', 'electrolytic', 'production', 'cells', 'the', 'two', 'liquid', 'layer', 'mhd', 'effects', 'can', 'be', 'projected', 'to', 'the', 'three', 'liquid', 'layer', 'selfsegregated', 'structure', 'of', 'the', 'batteries', 'this', 'paper', 'presents', 'numerical', 'models', 'for', 'the', 'three', 'densitystratified', 'electrically', 'conductive', 'liquid', 'layers', 'using', '3d', 'and', 'shallow', 'layer', 'approximation', 'accounting', 'for', 'specific', 'mhd', 'effects', 'during', 'periods', 'of', 'battery', 'activity', 'it', 'is', 'demonstrated', 'that', 'a', 'stable', 'operation', 'of', 'these', 'batteries', 'can', 'be', 'achieved', 'if', 'reusing', 'an', 'infrastructure', 'of', 'existing', 'aluminium', 'electrolysis', 'pot', 'lines', 'the', 'basic', 'principles', 'of', 'the', 'mhd', 'processes', 'in', 'the', 'cells', 'are', 'illustrated', 'by', 'the', 'numerical', 'example', 'cases']] | [-0.13335596174690348, 0.17449664514813928, 0.01828633196009192, 0.008501262290068758, -0.0034028930494456855, -0.17639995432576874, 0.07436084551949868, 0.3884322528635532, -0.27880346581248017, -0.3352324854267735, 0.10348371740899534, -0.28696452255764954, -0.07478947295728598, 0.2090235747278891, -0.04374891622516681, 0.06692651697618127, 0.06180245719167968, -0.08071251372145948, -0.05151081474704511, -0.19583454451517163, 0.2456154744403148, 0.11129890799417462, 0.3117088517370883, 0.07419092355387837, 0.09502047119485083, -0.1412583948424558, 0.049728769976662104, 0.00879209241653806, -0.08557351275444937, 0.07842983859328842, 0.2937036137957453, 0.020798550151340977, 0.23987791548043647, -0.5512105007196816, -0.2680845926974861, 0.011542536828234057, 0.0923386176024944, 0.08373291667245007, -0.10662207113001758, -0.19844645419171159, 0.06061047151632292, -0.2228068085846452, -0.1466487758665044, -0.052781873514619985, 0.0037282430689821256, 0.03271583148194674, -0.2502580563932113, 0.033881559850759545, 0.04847263771889757, 0.05133450510059024, -0.08417593646289545, -0.14561734598418566, -0.05279765403370412, 0.11818969515021104, 0.04624157788520548, -0.05546304051318324, 0.23331473365550678, -0.12063469602496849, -0.06196368135459406, 0.3798330280221474, -0.014654457778997824, -0.13912259689843753, 0.21369537586201978, -0.11734720127424225, -0.03650926831375125, 0.18428376656760212, 0.1609875276802816, 0.09903145993364529, -0.16421807187233894, -0.0019486967230733798, -0.018539643072536294, 0.14509903579707664, 0.059023865997056724, -0.001624494733643049, 0.2773642260548462, 0.31976539144148186, 0.02370148718366924, 0.1100166424470265, -0.14452215634830767, -0.07582327784252235, -0.243033746801584, -0.2201752537618798, -0.1326226354593044, 0.029828838087474063, -0.07244739212183049, -0.16164414293434418, 0.3853513983530845, 0.11852002686431097, 0.06803065867320647, -0.034352530194052926, 0.34653774950600846, 0.05514230852303895, 0.06708719509712775, 0.08070012625236339, 0.2556241690509126, 0.12303694421064738, 0.15522415102639853, -0.22780164784725598, 0.11270895598023395, 0.05727764733896499] |
1,802.06633 | Technological research in the EU is less efficient than the world
average. EU research policy risks Europeans' future | We have studied the efficiency of research in the EU by a percentile-based
citation approach that analyzes the distribution of country papers among the
world papers. Going up in the citation scale, the frequency of papers from
efficient countries increases while the frequency from inefficient countries
decreases. In the percentile-based approach, this trend, which is permanent at
any citation level, is measured by the ep index that equals the Ptop 1%/Ptop
10% ratio. By using the ep index we demonstrate that EU research on
fast-evolving technological topics is less efficient than the world average and
that the EU is far from being able to compete with the most advanced countries.
The ep index also shows that the USA is well ahead of the EU in both fast- and
slow-evolving technologies, which suggests that the advantage of the USA over
the EU in innovation is due to low research efficiency in the EU. In accord
with some previous studies, our results show that the European Commission's
ongoing claims about the excellence of EU research are based on a wrong
diagnosis. The EU must focus its research policy on the improvement of its
inefficient research. Otherwise, the future of Europeans is at risk.
| cs.DL | we have studied the efficiency of research in the eu by a percentilebased citation approach that analyzes the distribution of country papers among the world papers going up in the citation scale the frequency of papers from efficient countries increases while the frequency from inefficient countries decreases in the percentilebased approach this trend which is permanent at any citation level is measured by the ep index that equals the ptop 1ptop 10 ratio by using the ep index we demonstrate that eu research on fastevolving technological topics is less efficient than the world average and that the eu is far from being able to compete with the most advanced countries the ep index also shows that the usa is well ahead of the eu in both fast and slowevolving technologies which suggests that the advantage of the usa over the eu in innovation is due to low research efficiency in the eu in accord with some previous studies our results show that the european commissions ongoing claims about the excellence of eu research are based on a wrong diagnosis the eu must focus its research policy on the improvement of its inefficient research otherwise the future of europeans is at risk | [['we', 'have', 'studied', 'the', 'efficiency', 'of', 'research', 'in', 'the', 'eu', 'by', 'a', 'percentilebased', 'citation', 'approach', 'that', 'analyzes', 'the', 'distribution', 'of', 'country', 'papers', 'among', 'the', 'world', 'papers', 'going', 'up', 'in', 'the', 'citation', 'scale', 'the', 'frequency', 'of', 'papers', 'from', 'efficient', 'countries', 'increases', 'while', 'the', 'frequency', 'from', 'inefficient', 'countries', 'decreases', 'in', 'the', 'percentilebased', 'approach', 'this', 'trend', 'which', 'is', 'permanent', 'at', 'any', 'citation', 'level', 'is', 'measured', 'by', 'the', 'ep', 'index', 'that', 'equals', 'the', 'ptop', '1ptop', '10', 'ratio', 'by', 'using', 'the', 'ep', 'index', 'we', 'demonstrate', 'that', 'eu', 'research', 'on', 'fastevolving', 'technological', 'topics', 'is', 'less', 'efficient', 'than', 'the', 'world', 'average', 'and', 'that', 'the', 'eu', 'is', 'far', 'from', 'being', 'able', 'to', 'compete', 'with', 'the', 'most', 'advanced', 'countries', 'the', 'ep', 'index', 'also', 'shows', 'that', 'the', 'usa', 'is', 'well', 'ahead', 'of', 'the', 'eu', 'in', 'both', 'fast', 'and', 'slowevolving', 'technologies', 'which', 'suggests', 'that', 'the', 'advantage', 'of', 'the', 'usa', 'over', 'the', 'eu', 'in', 'innovation', 'is', 'due', 'to', 'low', 'research', 'efficiency', 'in', 'the', 'eu', 'in', 'accord', 'with', 'some', 'previous', 'studies', 'our', 'results', 'show', 'that', 'the', 'european', 'commissions', 'ongoing', 'claims', 'about', 'the', 'excellence', 'of', 'eu', 'research', 'are', 'based', 'on', 'a', 'wrong', 'diagnosis', 'the', 'eu', 'must', 'focus', 'its', 'research', 'policy', 'on', 'the', 'improvement', 'of', 'its', 'inefficient', 'research', 'otherwise', 'the', 'future', 'of', 'europeans', 'is', 'at', 'risk']] | [-0.05688622556673597, 0.10589227862492316, -0.0364795612433373, 0.049784403737756104, -0.03853544399689827, -0.06590766647020964, 0.1114237781897206, 0.37007519275174666, -0.198084601190002, -0.30109675478742426, 0.09202495839823524, -0.36721084775618423, -0.1249931750470426, 0.23509522481124157, -0.08481040097136594, -0.03810059110020947, 0.05725425971384118, 0.04895900045732158, -0.015991193039960522, -0.28986332499791856, 0.27399289082436257, 0.12825147164096334, 0.3933536057622551, 0.06744563897332205, 0.020090074395414572, -0.0640334777122167, -0.07807240237969783, 0.012238289194471723, -0.07126690468854878, 0.17945182993633663, 0.31310692433637555, 0.19176129600613487, 0.3710642880830333, -0.37192807938136047, -0.1664921860386098, 0.04908199985535001, 0.09865932753450007, 0.02950668068902202, -0.025879812655600732, -0.2536500016714086, 0.08887188110398783, -0.21699517984504826, -0.11712607188412368, -0.001969902483680889, 0.055100107511702044, 0.030906825536691194, -0.20809950710019218, 0.06535995539834129, 0.0260592311516582, 0.10390161559800032, -0.03530764802307564, -0.17780378084611054, -0.021875642745488852, 0.13361386281564533, 0.14429668714432747, 0.04986105097446652, 0.12276720710803085, -0.11470134356807936, -0.13617308132862907, 0.3661098754145767, -0.07114752945901145, -0.0716330822622731, 0.15363083759804805, -0.20372602271487067, -0.14889870310069445, 0.06638612638194881, 0.1724225195398526, 0.07427302774406933, -0.12982230984147208, 0.08988467015307888, -0.00635483365590174, 0.16249049936325274, 0.05625860912294768, -0.02997927425485385, 0.19424959503448552, 0.18726199654214104, 0.08895390695569354, 0.052407581593733675, -0.08011847029758346, -0.11010908855762375, -0.21470340688586534, -0.15409068997958722, -0.15255226510583925, 0.011398127648848386, -0.07688483662991644, -0.09962291829756006, 0.3983045652667856, 0.17057943881615698, 0.13335476894207748, -0.014603035715198023, 0.2867730711458073, 0.07204151336026457, 0.09879155883836986, 0.11663111908848037, 0.27452114304067243, 0.021410281092499445, 0.19939619046811427, -0.18321338926217326, 0.159590592320035, -0.036456026756976866] |
1,802.06634 | The Magnetic Field in the central parsec of the Galaxy | We present a polarisation map of the warm dust emission from the minispiral
in the central parsec of the Galactic centre. The observations were made at a
wavelength of 12.5 microns with CanariCam mounted on the 10.4-m Gran Telescopio
Canarias. The magnetic field traced by the polarised emission from aligned dust
grains is consistent with previous observations, but the increased resolution
of the present data reveals considerably more information on the detailed
structure of the B field and its correspondence with the filamentary emission
seen in both mid-infrared continuum emission and free-free emission at cm
wavelengths. The magnetic field appears to be compressed and pushed by the
outflows from luminous stars in the Northern Arm, but it is not disordered by
them. We identify some magnetically coherent filaments that cross the Northern
Arm at a Position Angle of ~45 degrees, and which may trace orbits inclined to
the primary orientation of the Northern Arm and circumnuclear disk. In the
East-West bar, the magnetic fields implied by the polarization in the lower
intensity regions lie predominantly along the bar at a Position Angle of 130 -
140 degrees. In contrast to the Northern Arm, the brighter regions of the bar
tend to have lower degrees of polarization with a greater divergence in
position angle compared to the local diffuse emission. It appears that the
diffuse emission in the East-West bar traces the underlying field and that the
bright compact sources are unrelated objects presumably projected onto the bar
and with different field orientations
| astro-ph.GA | we present a polarisation map of the warm dust emission from the minispiral in the central parsec of the galactic centre the observations were made at a wavelength of 125 microns with canaricam mounted on the 104m gran telescopio canarias the magnetic field traced by the polarised emission from aligned dust grains is consistent with previous observations but the increased resolution of the present data reveals considerably more information on the detailed structure of the b field and its correspondence with the filamentary emission seen in both midinfrared continuum emission and freefree emission at cm wavelengths the magnetic field appears to be compressed and pushed by the outflows from luminous stars in the northern arm but it is not disordered by them we identify some magnetically coherent filaments that cross the northern arm at a position angle of 45 degrees and which may trace orbits inclined to the primary orientation of the northern arm and circumnuclear disk in the eastwest bar the magnetic fields implied by the polarization in the lower intensity regions lie predominantly along the bar at a position angle of 130 140 degrees in contrast to the northern arm the brighter regions of the bar tend to have lower degrees of polarization with a greater divergence in position angle compared to the local diffuse emission it appears that the diffuse emission in the eastwest bar traces the underlying field and that the bright compact sources are unrelated objects presumably projected onto the bar and with different field orientations | [['we', 'present', 'a', 'polarisation', 'map', 'of', 'the', 'warm', 'dust', 'emission', 'from', 'the', 'minispiral', 'in', 'the', 'central', 'parsec', 'of', 'the', 'galactic', 'centre', 'the', 'observations', 'were', 'made', 'at', 'a', 'wavelength', 'of', '125', 'microns', 'with', 'canaricam', 'mounted', 'on', 'the', '104m', 'gran', 'telescopio', 'canarias', 'the', 'magnetic', 'field', 'traced', 'by', 'the', 'polarised', 'emission', 'from', 'aligned', 'dust', 'grains', 'is', 'consistent', 'with', 'previous', 'observations', 'but', 'the', 'increased', 'resolution', 'of', 'the', 'present', 'data', 'reveals', 'considerably', 'more', 'information', 'on', 'the', 'detailed', 'structure', 'of', 'the', 'b', 'field', 'and', 'its', 'correspondence', 'with', 'the', 'filamentary', 'emission', 'seen', 'in', 'both', 'midinfrared', 'continuum', 'emission', 'and', 'freefree', 'emission', 'at', 'cm', 'wavelengths', 'the', 'magnetic', 'field', 'appears', 'to', 'be', 'compressed', 'and', 'pushed', 'by', 'the', 'outflows', 'from', 'luminous', 'stars', 'in', 'the', 'northern', 'arm', 'but', 'it', 'is', 'not', 'disordered', 'by', 'them', 'we', 'identify', 'some', 'magnetically', 'coherent', 'filaments', 'that', 'cross', 'the', 'northern', 'arm', 'at', 'a', 'position', 'angle', 'of', '45', 'degrees', 'and', 'which', 'may', 'trace', 'orbits', 'inclined', 'to', 'the', 'primary', 'orientation', 'of', 'the', 'northern', 'arm', 'and', 'circumnuclear', 'disk', 'in', 'the', 'eastwest', 'bar', 'the', 'magnetic', 'fields', 'implied', 'by', 'the', 'polarization', 'in', 'the', 'lower', 'intensity', 'regions', 'lie', 'predominantly', 'along', 'the', 'bar', 'at', 'a', 'position', 'angle', 'of', '130', '140', 'degrees', 'in', 'contrast', 'to', 'the', 'northern', 'arm', 'the', 'brighter', 'regions', 'of', 'the', 'bar', 'tend', 'to', 'have', 'lower', 'degrees', 'of', 'polarization', 'with', 'a', 'greater', 'divergence', 'in', 'position', 'angle', 'compared', 'to', 'the', 'local', 'diffuse', 'emission', 'it', 'appears', 'that', 'the', 'diffuse', 'emission', 'in', 'the', 'eastwest', 'bar', 'traces', 'the', 'underlying', 'field', 'and', 'that', 'the', 'bright', 'compact', 'sources', 'are', 'unrelated', 'objects', 'presumably', 'projected', 'onto', 'the', 'bar', 'and', 'with', 'different', 'field', 'orientations']] | [-0.10990950932672462, 0.1177333489847017, -0.05644035565043499, 0.03693744888718414, -0.08866071211456125, -0.05470692209780691, -0.0015499514297571079, 0.4530379398469906, -0.2289332395523371, -0.3079781248364078, 0.06950495557929574, -0.28655658162614533, 0.011746868871493761, 0.15816294381278045, 0.008498317001765943, -0.09046263429563514, -0.0009635497455993497, -0.05640348861971684, -0.003209525620030514, -0.17063154222024418, 0.2798416159501618, 0.10150952353717321, 0.19236351264013624, -0.005155536892732969, 0.07498731184797176, -0.08343818471154785, -0.05106652022127908, -0.015536976918815617, -0.10338127216556925, 0.08382481211458752, 0.21510736347385775, 0.06037785999098444, 0.1368257802664358, -0.39272442754298686, -0.1543721534456479, 0.03768376826932023, 0.15567656650416187, 0.028123927586044064, -0.014123136799796893, -0.3328526745043858, 0.03675663014278741, -0.0908647569075442, -0.21166407103572352, 0.1164855995326557, 0.04767861912830314, -0.003963822053663759, -0.20024364515123294, 0.0929612651104627, 0.0015828904363723746, 0.13160868884162585, -0.07041312775071859, -0.12771203621954794, -0.09693617665438924, 0.0546988958392693, 0.03652046718245068, 0.1651346114583766, 0.24554734930685496, -0.15796182836142492, -0.05169373847668493, 0.37619023719631817, -0.08550479432727504, -0.039233973948284984, 0.22271648061042465, -0.29948635449270306, -0.12877353780301828, 0.24805903842902755, 0.14481871378741623, 0.11763334421318514, -0.10562577631724099, 0.01830494515732324, -0.05889931880865261, 0.1860002047026092, 0.09783471624489384, 0.06650637059177521, 0.3338211151008055, 0.058066896106574714, 0.05368137591846837, 0.14517641802683873, -0.29351086235446094, -0.0647847037873717, -0.2579076330550154, -0.09260607583900965, -0.09355577981596687, 0.048159774124821315, -0.11226123792312499, -0.07565115173825014, 0.35576926504792383, 0.10830920163831448, 0.23142324674195533, 0.005234575873533954, 0.34103615176251745, 0.02731123065995238, 0.1481121711229323, 0.1451878360179494, 0.33930889535957365, 0.1966464285779581, 0.1130378128574842, -0.2273413779564662, 0.048756157790600094, -0.06141999689954893] |
1,802.06635 | Optical tristability and ultrafast Fano switching in nonlinear
magneto-plasmonic nanoparticles | We consider light scattering by a coated magneto-plasmonic nanoparticle
(MPNP) with a Kerr-type nonlinear plasmonic shell and a magneto-optic core.
Such structure features two plasmon dipole modes, associated with electronic
oscillations on the inner and outer surfaces of the shell. Driven in a
nonlinear regime, each mode exhibits a bistable response. Bistability of an
inner plasmon leads to switching between this state and a Fano resonance (Fano
switching). Once the external light intensity exceeds the critical value, the
bistability zones of both eigen modes overlap yielding optical tristability
characterized by three stable steady states for a given wavelength and light
intensity. We develop a dynamic theory of transitions between nonlinear steady
states and estimate the characteristic switching time as short as 0.5 ps. We
also show that the magneto-optical (MO) effect allows red- and blue- spectral
shift of the Fano profile for right- and left- circular polarizations of the
external light, rendering Fano switching sensitive to the light polarization.
Specifically, one can reach Fano switching for the right circular polarization
while cancelling it for the left circular polarization. Our results point to a
novel class of ultrafast Fano switchers tunable by magnetic field for
applications in nanophotonics.
| physics.optics nlin.AO | we consider light scattering by a coated magnetoplasmonic nanoparticle mpnp with a kerrtype nonlinear plasmonic shell and a magnetooptic core such structure features two plasmon dipole modes associated with electronic oscillations on the inner and outer surfaces of the shell driven in a nonlinear regime each mode exhibits a bistable response bistability of an inner plasmon leads to switching between this state and a fano resonance fano switching once the external light intensity exceeds the critical value the bistability zones of both eigen modes overlap yielding optical tristability characterized by three stable steady states for a given wavelength and light intensity we develop a dynamic theory of transitions between nonlinear steady states and estimate the characteristic switching time as short as 05 ps we also show that the magnetooptical mo effect allows red and blue spectral shift of the fano profile for right and left circular polarizations of the external light rendering fano switching sensitive to the light polarization specifically one can reach fano switching for the right circular polarization while cancelling it for the left circular polarization our results point to a novel class of ultrafast fano switchers tunable by magnetic field for applications in nanophotonics | [['we', 'consider', 'light', 'scattering', 'by', 'a', 'coated', 'magnetoplasmonic', 'nanoparticle', 'mpnp', 'with', 'a', 'kerrtype', 'nonlinear', 'plasmonic', 'shell', 'and', 'a', 'magnetooptic', 'core', 'such', 'structure', 'features', 'two', 'plasmon', 'dipole', 'modes', 'associated', 'with', 'electronic', 'oscillations', 'on', 'the', 'inner', 'and', 'outer', 'surfaces', 'of', 'the', 'shell', 'driven', 'in', 'a', 'nonlinear', 'regime', 'each', 'mode', 'exhibits', 'a', 'bistable', 'response', 'bistability', 'of', 'an', 'inner', 'plasmon', 'leads', 'to', 'switching', 'between', 'this', 'state', 'and', 'a', 'fano', 'resonance', 'fano', 'switching', 'once', 'the', 'external', 'light', 'intensity', 'exceeds', 'the', 'critical', 'value', 'the', 'bistability', 'zones', 'of', 'both', 'eigen', 'modes', 'overlap', 'yielding', 'optical', 'tristability', 'characterized', 'by', 'three', 'stable', 'steady', 'states', 'for', 'a', 'given', 'wavelength', 'and', 'light', 'intensity', 'we', 'develop', 'a', 'dynamic', 'theory', 'of', 'transitions', 'between', 'nonlinear', 'steady', 'states', 'and', 'estimate', 'the', 'characteristic', 'switching', 'time', 'as', 'short', 'as', '05', 'ps', 'we', 'also', 'show', 'that', 'the', 'magnetooptical', 'mo', 'effect', 'allows', 'red', 'and', 'blue', 'spectral', 'shift', 'of', 'the', 'fano', 'profile', 'for', 'right', 'and', 'left', 'circular', 'polarizations', 'of', 'the', 'external', 'light', 'rendering', 'fano', 'switching', 'sensitive', 'to', 'the', 'light', 'polarization', 'specifically', 'one', 'can', 'reach', 'fano', 'switching', 'for', 'the', 'right', 'circular', 'polarization', 'while', 'cancelling', 'it', 'for', 'the', 'left', 'circular', 'polarization', 'our', 'results', 'point', 'to', 'a', 'novel', 'class', 'of', 'ultrafast', 'fano', 'switchers', 'tunable', 'by', 'magnetic', 'field', 'for', 'applications', 'in', 'nanophotonics']] | [-0.16458451930849535, 0.1786699994440754, -0.04284812190373745, 0.01830047352752426, -0.06850464230753141, -0.19253961001357375, 0.043253871472788794, 0.4336195432387179, -0.24721481722926125, -0.24718168703130053, 0.0260961589776925, -0.26818170112111256, -0.1641325751265752, 0.2135744002378229, 0.0009555253294783498, 0.028641475196738684, -0.020862589779352476, -0.035381215494504285, -0.02772900573779276, -0.10141959622606332, 0.29383930543391507, -0.019453952915825867, 0.29603547957692733, 0.05143760505893509, 0.09560858945688469, 0.02340245187793135, 0.10687443750867913, 0.0019342392963135075, -0.10228398651309958, 0.09778761191158862, 0.23049569102524198, -0.02575729737237928, 0.23189846528481295, -0.42109996446309056, -0.19066194640141604, 0.053496966582869517, 0.1496399302227035, 0.1393794158821084, -0.070934003562345, -0.2704873133384561, 0.02356775006076066, -0.08839799998550284, -0.180944961819533, -0.04440626584414185, 0.0437702269530926, 0.02625106541211788, -0.2800724771772606, 0.04369033278934634, 0.07945581043947507, 0.0695901235168431, -0.05351816920940599, -0.06249578160749096, -0.0737980480310578, 0.03899989319199384, -0.00782241220355535, -0.02424007075895475, 0.19120749147835797, -0.13699249046036813, -0.10839594603305787, 0.32228089387760245, -0.12331626089827541, -0.11136494740503391, 0.11163128434732406, -0.19020700011506375, 0.014157070239372363, 0.196446995666903, 0.18079956340825723, 0.1285991705764974, -0.07394171356451627, 0.017968362379585143, 0.014380367100844515, 0.19304274206553812, 0.15238890537240443, 0.10799887267693045, 0.2618958569595089, 0.17903421266325914, 0.06846291297422674, 0.14097821411941447, -0.16374567462347667, -0.04028048765902327, -0.26473198215557536, -0.1019259695977748, -0.1253611276044125, 0.08998832715273986, -0.08934837444704605, -0.17707401423757602, 0.4637474431159911, 0.040775370082066296, 0.20790448633429173, -0.017864047702866356, 0.30623189257256933, 0.14550470414767655, 0.03552157350527454, 0.045169531476452265, 0.32329268285030793, 0.1899380869064291, 0.09201307759057674, -0.32395283543140757, 0.007795227661393205, -0.05140971722728974] |
1,802.06636 | Maximal Exploration of Trees with Energy-Constrained Agents | We consider the problem of exploring an unknown tree with a team of $k$
initially colocated mobile agents. Each agent has limited energy and cannot, as
a result, traverse more than $B$ edges. The goal is to maximize the number of
nodes collectively visited by all agents during the execution. Initially, the
agents have no knowledge about the structure of the tree, but they gradually
discover the topology as they traverse new edges. We assume that the agents can
communicate with each other at arbitrary distances. Therefore the knowledge
obtained by one agent after traversing an edge is instantaneously transmitted
to the other agents. We propose an algorithm that divides the tree into
subtrees during the exploration process and makes a careful trade-off between
breadth-first and depth-first exploration. We show that our algorithm is
3-competitive compared to an optimal solution that we could obtain if we knew
the map of the tree in advance. While it is easy to see that no algorithm can
be better than 2-competitive, we give a non-trivial lower bound of 2.17 on the
competitive ratio of any online algorithm.
| cs.DS | we consider the problem of exploring an unknown tree with a team of k initially colocated mobile agents each agent has limited energy and cannot as a result traverse more than b edges the goal is to maximize the number of nodes collectively visited by all agents during the execution initially the agents have no knowledge about the structure of the tree but they gradually discover the topology as they traverse new edges we assume that the agents can communicate with each other at arbitrary distances therefore the knowledge obtained by one agent after traversing an edge is instantaneously transmitted to the other agents we propose an algorithm that divides the tree into subtrees during the exploration process and makes a careful tradeoff between breadthfirst and depthfirst exploration we show that our algorithm is 3competitive compared to an optimal solution that we could obtain if we knew the map of the tree in advance while it is easy to see that no algorithm can be better than 2competitive we give a nontrivial lower bound of 217 on the competitive ratio of any online algorithm | [['we', 'consider', 'the', 'problem', 'of', 'exploring', 'an', 'unknown', 'tree', 'with', 'a', 'team', 'of', 'k', 'initially', 'colocated', 'mobile', 'agents', 'each', 'agent', 'has', 'limited', 'energy', 'and', 'can', 'not', 'as', 'a', 'result', 'traverse', 'more', 'than', 'b', 'edges', 'the', 'goal', 'is', 'to', 'maximize', 'the', 'number', 'of', 'nodes', 'collectively', 'visited', 'by', 'all', 'agents', 'during', 'the', 'execution', 'initially', 'the', 'agents', 'have', 'no', 'knowledge', 'about', 'the', 'structure', 'of', 'the', 'tree', 'but', 'they', 'gradually', 'discover', 'the', 'topology', 'as', 'they', 'traverse', 'new', 'edges', 'we', 'assume', 'that', 'the', 'agents', 'can', 'communicate', 'with', 'each', 'other', 'at', 'arbitrary', 'distances', 'therefore', 'the', 'knowledge', 'obtained', 'by', 'one', 'agent', 'after', 'traversing', 'an', 'edge', 'is', 'instantaneously', 'transmitted', 'to', 'the', 'other', 'agents', 'we', 'propose', 'an', 'algorithm', 'that', 'divides', 'the', 'tree', 'into', 'subtrees', 'during', 'the', 'exploration', 'process', 'and', 'makes', 'a', 'careful', 'tradeoff', 'between', 'breadthfirst', 'and', 'depthfirst', 'exploration', 'we', 'show', 'that', 'our', 'algorithm', 'is', '3competitive', 'compared', 'to', 'an', 'optimal', 'solution', 'that', 'we', 'could', 'obtain', 'if', 'we', 'knew', 'the', 'map', 'of', 'the', 'tree', 'in', 'advance', 'while', 'it', 'is', 'easy', 'to', 'see', 'that', 'no', 'algorithm', 'can', 'be', 'better', 'than', '2competitive', 'we', 'give', 'a', 'nontrivial', 'lower', 'bound', 'of', '217', 'on', 'the', 'competitive', 'ratio', 'of', 'any', 'online', 'algorithm']] | [-0.13649138229886523, 0.13451930373510648, -0.09571874149244379, 0.04005903303282016, -0.13304709053431785, -0.1701473858509515, 0.1297045168441695, 0.4367453762606994, -0.29128233063085057, -0.35447343250585567, 0.0609872574987192, -0.2942578231563439, -0.14730948554351925, 0.11482730309504109, -0.07294865933347594, -0.018245637059413098, 0.0975868960508976, 0.12078821061028017, 0.03074744158248241, -0.29678085586056113, 0.2633977246860898, 0.07453560485076663, 0.21839360101903613, 0.009594361222273595, 0.11717240168285128, 0.04816563541849924, -0.004797469561516836, 0.013891100672048491, -0.109935328637201, 0.07071168723176359, 0.2598325219810814, 0.20707190847401885, 0.302879080550141, -0.4476088748036607, -0.15387378514970879, 0.16280853855549485, 0.1632026825219745, 0.1096345334603275, 0.013098956844879541, -0.2635128225124366, 0.1209560504749518, -0.13200067945982555, -0.07236105061664774, -0.02932300679637371, 0.00569868082230961, -0.009325632222965863, -0.27144776568464885, -0.056440797976746754, 0.0672156915606654, -0.01873743907624, -0.05515648152905743, -0.11447035750072147, -0.03387409864069038, 0.1814348254352808, 0.0022707236098515726, 0.07539082584348884, 0.11592720008857951, -0.1215418813926344, -0.1623409354404823, 0.3502464233595576, -0.027520219602376675, -0.16982888648714367, 0.19579159142197788, -0.09237939498412448, -0.1275236065625339, 0.14563871175050735, 0.1901394923063423, 0.12848194417468198, -0.1388315676941184, 0.05044366534881143, -0.060344413262666076, 0.18141464918877023, 0.07196832728144285, -0.01142164772200222, 0.1704340369667153, 0.16973828895621607, 0.2049447129971373, 0.14332681144210133, -0.018561748194986502, -0.08068575411531571, -0.23181236322868515, -0.1619929851841408, -0.219935327345455, 0.004625464137722235, -0.11952810750596188, -0.12174461001681315, 0.3578043540536955, 0.1703611766189538, 0.22526583984443868, 0.086307501943933, 0.31932033688031336, 0.07344096117728466, 0.06273446647305596, 0.18769117873287886, 0.2050812313459008, 0.004174743227446704, 0.06151846234208426, -0.1646724107209593, 0.1588492276977647, 0.028806939703487865] |
1,802.06637 | On the (in)efficiency of MFG equilibria | Mean field games (MFG) are dynamic games with infinitely many infinitesimal
agents. In this context, we study the efficiency of Nash MFG equilibria:
Namely, we compare the social cost of a MFG equilibrium with the minimal cost a
global planner can achieve. We find a structure condition on the game under
which there exists efficient MFG equilibria and, in case this condition is not
fulfilled, quantify how inefficient MFG equilibria are.
| math.OC | mean field games mfg are dynamic games with infinitely many infinitesimal agents in this context we study the efficiency of nash mfg equilibria namely we compare the social cost of a mfg equilibrium with the minimal cost a global planner can achieve we find a structure condition on the game under which there exists efficient mfg equilibria and in case this condition is not fulfilled quantify how inefficient mfg equilibria are | [['mean', 'field', 'games', 'mfg', 'are', 'dynamic', 'games', 'with', 'infinitely', 'many', 'infinitesimal', 'agents', 'in', 'this', 'context', 'we', 'study', 'the', 'efficiency', 'of', 'nash', 'mfg', 'equilibria', 'namely', 'we', 'compare', 'the', 'social', 'cost', 'of', 'a', 'mfg', 'equilibrium', 'with', 'the', 'minimal', 'cost', 'a', 'global', 'planner', 'can', 'achieve', 'we', 'find', 'a', 'structure', 'condition', 'on', 'the', 'game', 'under', 'which', 'there', 'exists', 'efficient', 'mfg', 'equilibria', 'and', 'in', 'case', 'this', 'condition', 'is', 'not', 'fulfilled', 'quantify', 'how', 'inefficient', 'mfg', 'equilibria', 'are']] | [-0.2015836449523627, 0.030219992147233914, -0.13592209851920184, 0.14664952812919682, -0.047247682999767046, -0.1813236405272824, 0.0793320861526988, 0.42792628493658463, -0.28717493273737565, -0.26738386826825816, 0.09518565628415263, -0.22848512696653184, -0.20393422529311248, 0.041076540605912745, -0.15610128521761843, 0.01195588815485088, 0.1349634549016474, 0.05861956874748141, 0.044175563778557726, -0.26454992084370427, 0.3321220851339347, -0.028737503484311238, 0.24156953250779442, 0.03839698079137237, 0.14200588964371824, -0.025868532103551944, 0.10757165633037057, 0.1625828127783369, -0.20489284200725003, 0.05063003549535929, 0.3257533931763659, 0.18528708828691864, 0.42871992578926743, -0.4287095945328474, -0.153974064855351, 0.23412537844326925, 0.0869626678316526, 0.10240485036293123, -0.03775575200364676, -0.22439433408337056, 0.12474095305873895, -0.16253506039387325, -0.1510709261941448, -0.0865011054720782, -0.05693207566239412, 0.07043005955982691, -0.34026936526020046, 0.011755697639055655, 0.023623265680188025, 0.12134983275138156, -0.12128737184520759, -0.057621933008268685, -0.06176157239299845, 0.12148028650832637, 0.042664453239691716, -0.07518698051112743, 0.15583055442802504, -0.1859915665036041, -0.2066837168457708, 0.4086822900973575, -0.08723652441526802, -0.2638260540355679, 0.18278495799487746, -0.08827963792784534, -0.12346223654704247, 0.10387457559593546, 0.15723598150300308, 0.17966829628878744, -0.12953257907106555, 0.13516721459889364, -0.1315809245923088, 0.15446751429633776, 0.04127248141809668, 0.006591451734724179, 0.10839709905828808, 0.12605224880324284, 0.271843698334021, 0.15511900082912664, 0.07071790533569891, -0.30676518585270557, -0.2731707095706337, -0.09269275175223887, -0.07491257549984984, 0.09459056354043383, -0.1273188610349267, -0.13623390672072558, 0.32299042127134514, 0.13961376929590086, 0.04270696367176486, 0.12424457563631709, 0.26654682009854735, 0.15832128729277722, -0.09030834062707047, 0.17505227033914605, 0.2682176823465442, 0.09116150941175054, 0.14213934166251985, -0.24327835766598582, 0.12317875311644354, 0.06599831848706998] |
1,802.06638 | Rare events and Poisson point processes | The aim of the present work is to show that the results obtained earlier on
the approximation of distributions of sums of independent terms by the
accompanying compound Poisson laws may be interpreted as rather sharp
quantitative estimates for the closeness between the sample containing
independent observations of rare events and the Poisson point process which is
obtained after a Poissonization of the initial sample.
| math.PR | the aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent terms by the accompanying compound poisson laws may be interpreted as rather sharp quantitative estimates for the closeness between the sample containing independent observations of rare events and the poisson point process which is obtained after a poissonization of the initial sample | [['the', 'aim', 'of', 'the', 'present', 'work', 'is', 'to', 'show', 'that', 'the', 'results', 'obtained', 'earlier', 'on', 'the', 'approximation', 'of', 'distributions', 'of', 'sums', 'of', 'independent', 'terms', 'by', 'the', 'accompanying', 'compound', 'poisson', 'laws', 'may', 'be', 'interpreted', 'as', 'rather', 'sharp', 'quantitative', 'estimates', 'for', 'the', 'closeness', 'between', 'the', 'sample', 'containing', 'independent', 'observations', 'of', 'rare', 'events', 'and', 'the', 'poisson', 'point', 'process', 'which', 'is', 'obtained', 'after', 'a', 'poissonization', 'of', 'the', 'initial', 'sample']] | [-0.091233018388112, 0.08847557020445283, -0.11780796122665589, 0.06211577502827612, -0.01627721324061545, -0.044976459622669676, 0.10850749152999084, 0.3328649519154659, -0.24822741866541598, -0.31297773758952435, 0.08891607730721052, -0.27681143547479925, -0.09942085843246717, 0.20776460950191206, -0.04260787107050419, 0.030807235550421936, 0.07586008893469205, 0.060813046612132056, -0.07477293416248777, -0.2430620811593074, 0.3382762915239884, 0.09937623368146328, 0.25721908915214814, -0.01811809571316609, 0.07548693945774665, 0.008661970531997772, -0.10408265865766085, 0.008677718329888123, -0.13946041198718237, 0.10156979913321826, 0.2130791500640603, 0.08295807860088714, 0.22829987924689285, -0.3779970019758016, -0.19798225392229282, 0.07081109295742442, 0.133389425833817, 0.045057333223163507, -0.03219967769064869, -0.30175004173786596, 0.09423363126384524, -0.09450959087206194, -0.16184000494674994, -0.026652066946889347, -0.0011984824346235165, 0.09347019828855992, -0.3055729633501659, 0.13747986030693238, 0.1263273239708864, 0.04033887865594946, -0.0641907838674692, -0.1636417258065194, -0.003918792020816069, 0.10673337383195758, 0.07823368430522701, 0.00438349990066714, 0.10017941692270911, -0.0761916634053565, -0.12262852138911302, 0.34875693957392984, -0.06087085060202158, -0.16159079576341007, 0.17019798334401387, -0.18047604259246816, -0.13390662129968406, 0.1440844670439569, 0.14477731240913272, 0.12332077665397755, -0.1869057994049329, 0.03393125852766948, -0.05461917152771583, 0.09240587271544008, 0.024357290121798332, 0.019978632340924098, 0.1663117629977373, 0.12149513802276207, 0.0404214199202565, 0.16660588875305482, -0.07814445177881191, -0.10358280377605787, -0.37395698164518065, -0.138359603472054, -0.22436301510494489, 0.08866455778121375, -0.13904585200697722, -0.18059399537742138, 0.34653387995293505, 0.11564503102742422, 0.2662029888480902, 0.048138533749331074, 0.22207361431075975, 0.15400246490473643, 0.00554860017907161, 0.0013507772917644336, 0.20566581239780554, 0.13866725398155932, 0.07786025718714182, -0.14681997661693738, 0.1504336359552466, 0.06427036267347061] |
1,802.06639 | Approximation of multivariate periodic functions based on sampling along
multiple rank-1 lattices | In this work, we consider the approximate reconstruction of high-dimensional
periodic functions based on sampling values. As sampling schemes, we utilize
so-called reconstructing multiple rank-1 lattices, which combine several
preferable properties such as easy constructability, the existence of
high-dimensional fast Fourier transform algorithms, high reliability, and low
oversampling factors. Especially, we show error estimates for functions from
Sobolev Hilbert spaces of generalized mixed smoothness. For instance, when
measuring the sampling error in the $L_2$-norm, we show sampling error
estimates where the exponent of the main part reaches those of the optimal
sampling rate except for an offset of $1/2+\varepsilon$, i.e., the exponent is
almost a factor of two better up to the mentioned offset compared to single
rank-1 lattice sampling. Various numerical tests in medium and high dimensions
demonstrate the high performance and confirm the obtained theoretical results
of multiple rank-1 lattice sampling.
| math.NA | in this work we consider the approximate reconstruction of highdimensional periodic functions based on sampling values as sampling schemes we utilize socalled reconstructing multiple rank1 lattices which combine several preferable properties such as easy constructability the existence of highdimensional fast fourier transform algorithms high reliability and low oversampling factors especially we show error estimates for functions from sobolev hilbert spaces of generalized mixed smoothness for instance when measuring the sampling error in the l_2norm we show sampling error estimates where the exponent of the main part reaches those of the optimal sampling rate except for an offset of 12varepsilon ie the exponent is almost a factor of two better up to the mentioned offset compared to single rank1 lattice sampling various numerical tests in medium and high dimensions demonstrate the high performance and confirm the obtained theoretical results of multiple rank1 lattice sampling | [['in', 'this', 'work', 'we', 'consider', 'the', 'approximate', 'reconstruction', 'of', 'highdimensional', 'periodic', 'functions', 'based', 'on', 'sampling', 'values', 'as', 'sampling', 'schemes', 'we', 'utilize', 'socalled', 'reconstructing', 'multiple', 'rank1', 'lattices', 'which', 'combine', 'several', 'preferable', 'properties', 'such', 'as', 'easy', 'constructability', 'the', 'existence', 'of', 'highdimensional', 'fast', 'fourier', 'transform', 'algorithms', 'high', 'reliability', 'and', 'low', 'oversampling', 'factors', 'especially', 'we', 'show', 'error', 'estimates', 'for', 'functions', 'from', 'sobolev', 'hilbert', 'spaces', 'of', 'generalized', 'mixed', 'smoothness', 'for', 'instance', 'when', 'measuring', 'the', 'sampling', 'error', 'in', 'the', 'l_2norm', 'we', 'show', 'sampling', 'error', 'estimates', 'where', 'the', 'exponent', 'of', 'the', 'main', 'part', 'reaches', 'those', 'of', 'the', 'optimal', 'sampling', 'rate', 'except', 'for', 'an', 'offset', 'of', '12varepsilon', 'ie', 'the', 'exponent', 'is', 'almost', 'a', 'factor', 'of', 'two', 'better', 'up', 'to', 'the', 'mentioned', 'offset', 'compared', 'to', 'single', 'rank1', 'lattice', 'sampling', 'various', 'numerical', 'tests', 'in', 'medium', 'and', 'high', 'dimensions', 'demonstrate', 'the', 'high', 'performance', 'and', 'confirm', 'the', 'obtained', 'theoretical', 'results', 'of', 'multiple', 'rank1', 'lattice', 'sampling']] | [-0.1003544843036004, 0.06410916491626954, -0.04376396042509721, 0.1070849278980827, -0.01608081967032586, -0.12849132685394554, 0.0792857714573742, 0.41418083023826974, -0.29195438775761456, -0.2613065368788955, 0.15884053268082363, -0.21911761973873822, -0.11937362835351768, 0.23134397933995546, -0.10048994109917016, 0.12438359305881684, 0.06683512491180554, -0.004242296346912642, -0.1443535044131527, -0.288158833278812, 0.29148347204277564, 0.058511063107289374, 0.31855526275711354, -0.0229540609012169, 0.12172148463974049, 0.02710693982801029, -0.060264315091438224, -0.02458601737219085, -0.13873821067773587, 0.12804208704355088, 0.2332052083920453, 0.08520174842210604, 0.2985789598734281, -0.33054378806203083, -0.19639989268034697, 0.12697500490316457, 0.15701695258071371, 0.08079192709540818, -0.055532192004603576, -0.26063814511770134, 0.09378840398430903, -0.11373988725244999, -0.09587661916788152, -0.12437016801205236, -0.08287511844598278, 0.0612558139532062, -0.3565425460936723, 0.1098224936945403, 0.025888180399274492, 0.051653220301975944, -0.07625026924379326, -0.1880876878797487, 0.0574542548551413, 0.12005307336791314, 0.02328697215664767, 0.024769616420738973, 0.07811076955713488, -0.11712933243968739, -0.13428184649275315, 0.3551300742461548, -0.04049717752471358, -0.22693516317286067, 0.16721555143692432, -0.17019573702652763, -0.13742570850307811, 0.1507805832213937, 0.19455290536259437, 0.10618080001102982, -0.06792147921195166, 0.05231386509791531, -0.01918528312686961, 0.1507015605457127, 0.08571093937811944, 0.07819035654184181, 0.05858493333363293, 0.14508280749562996, 0.11151443682350479, 0.1417754158008049, -0.11660195773929827, -0.0916141316345958, -0.2764449666190723, -0.13014312128868552, -0.24769096279034872, 0.00752648288201723, -0.1958234847114801, -0.18361980654950533, 0.35132294194121566, 0.14443713434405261, 0.2024297762623096, 0.10568944985532182, 0.3040319224591595, 0.11462061630294926, 0.000996827294437827, 0.09414719941234542, 0.2070475385159619, 0.12160829763852998, 0.018484378835980916, -0.19218639460379272, 0.026340619807450713, 0.08622080283695376] |
1,802.0664 | Finding Influential Training Samples for Gradient Boosted Decision Trees | We address the problem of finding influential training samples for a
particular case of tree ensemble-based models, e.g., Random Forest (RF) or
Gradient Boosted Decision Trees (GBDT). A natural way of formalizing this
problem is studying how the model's predictions change upon leave-one-out
retraining, leaving out each individual training sample. Recent work has shown
that, for parametric models, this analysis can be conducted in a
computationally efficient way. We propose several ways of extending this
framework to non-parametric GBDT ensembles under the assumption that tree
structures remain fixed. Furthermore, we introduce a general scheme of
obtaining further approximations to our method that balance the trade-off
between performance and computational complexity. We evaluate our approaches on
various experimental setups and use-case scenarios and demonstrate both the
quality of our approach to finding influential training samples in comparison
to the baselines and its computational efficiency.
| cs.LG stat.ML | we address the problem of finding influential training samples for a particular case of tree ensemblebased models eg random forest rf or gradient boosted decision trees gbdt a natural way of formalizing this problem is studying how the models predictions change upon leaveoneout retraining leaving out each individual training sample recent work has shown that for parametric models this analysis can be conducted in a computationally efficient way we propose several ways of extending this framework to nonparametric gbdt ensembles under the assumption that tree structures remain fixed furthermore we introduce a general scheme of obtaining further approximations to our method that balance the tradeoff between performance and computational complexity we evaluate our approaches on various experimental setups and usecase scenarios and demonstrate both the quality of our approach to finding influential training samples in comparison to the baselines and its computational efficiency | [['we', 'address', 'the', 'problem', 'of', 'finding', 'influential', 'training', 'samples', 'for', 'a', 'particular', 'case', 'of', 'tree', 'ensemblebased', 'models', 'eg', 'random', 'forest', 'rf', 'or', 'gradient', 'boosted', 'decision', 'trees', 'gbdt', 'a', 'natural', 'way', 'of', 'formalizing', 'this', 'problem', 'is', 'studying', 'how', 'the', 'models', 'predictions', 'change', 'upon', 'leaveoneout', 'retraining', 'leaving', 'out', 'each', 'individual', 'training', 'sample', 'recent', 'work', 'has', 'shown', 'that', 'for', 'parametric', 'models', 'this', 'analysis', 'can', 'be', 'conducted', 'in', 'a', 'computationally', 'efficient', 'way', 'we', 'propose', 'several', 'ways', 'of', 'extending', 'this', 'framework', 'to', 'nonparametric', 'gbdt', 'ensembles', 'under', 'the', 'assumption', 'that', 'tree', 'structures', 'remain', 'fixed', 'furthermore', 'we', 'introduce', 'a', 'general', 'scheme', 'of', 'obtaining', 'further', 'approximations', 'to', 'our', 'method', 'that', 'balance', 'the', 'tradeoff', 'between', 'performance', 'and', 'computational', 'complexity', 'we', 'evaluate', 'our', 'approaches', 'on', 'various', 'experimental', 'setups', 'and', 'usecase', 'scenarios', 'and', 'demonstrate', 'both', 'the', 'quality', 'of', 'our', 'approach', 'to', 'finding', 'influential', 'training', 'samples', 'in', 'comparison', 'to', 'the', 'baselines', 'and', 'its', 'computational', 'efficiency']] | [-0.05791168574852726, 0.03176092859878615, -0.09060507561112721, 0.07542574067495868, -0.09464592025029128, -0.15253464929381763, 0.15252874880521136, 0.44549848855688023, -0.2565210319540978, -0.34133989434897694, 0.06811049341393466, -0.2294404085699495, -0.18098311702121647, 0.19640999936524753, -0.08917857545030701, 0.10981583014868161, 0.1360619212012295, -0.025489229591680575, -0.06331985010000245, -0.322851489117317, 0.2896692137383706, 0.09130751688059394, 0.35792346568485084, 0.004989431526734155, 0.10557248338835536, -0.03062097191398677, -0.039395658913153137, 0.04069737199094746, -0.09791598281365375, 0.1700256541778392, 0.28486378651481814, 0.2053951166693929, 0.33490161858564177, -0.3868243513639322, -0.24820146718147126, 0.1443155144436539, 0.13864621636976726, 0.15026118528990115, -0.04892784854400434, -0.24591236430467792, 0.08456554832637075, -0.1608419957460015, -0.04640132015069517, -0.14679653577871257, -0.049241806611653186, -0.03125894543799487, -0.2955383537841922, 0.03222514826428288, 0.07960405456182267, 0.03361911971408587, -0.01491536391928297, -0.12548431734981055, 0.06059496801011134, 0.10897525950413119, 0.04675219073839538, 0.007506274465158894, 0.12195633736054798, -0.13103616219684538, -0.1620917941811592, 0.35299425174187465, -0.03186478533853705, -0.22514775011792676, 0.22703652053426665, -0.035576795735819775, -0.18862087374644262, 0.04301342554064793, 0.22872952048803544, 0.15136889260346917, -0.16192581181225557, 0.05254639547572217, -0.03514954441884806, 0.14193809219355974, 0.07397298173575134, -0.040216280790159833, 0.13882540851681643, 0.25008548866351743, 0.06138179074790511, 0.18060189403407928, -0.07329366310382379, -0.07279724810741373, -0.24407534368850708, -0.10458113054477877, -0.13106053695733938, -0.015262399093488921, -0.12778313140428815, -0.15401000485953328, 0.3992486464868288, 0.25706531478977807, 0.19536616511226118, 0.1430540450236441, 0.3574375274031052, 0.06609771694984756, 0.025855443404557612, 0.07525352966300883, 0.18968050565792027, 0.06862909768193544, 0.05751159487591757, -0.18689391105207842, 0.10481297290131736, 0.03610209171770961] |
1,802.06641 | Enhancing performance of coherent OTDR systems with polarization
diversity complementary codes | Monitoring the optical phase change in a fiber enables a wide range of
applications where fast phase variations are induced by acoustic signals or
vibrations in general. However, the quality of the estimated fiber response
strongly depends on the method used to modulate the light sent to the fiber and
capture the variations of the optical field. In this paper, we show that
distributed optical fiber sensing systems can advantageously exploit techniques
from the telecommunication domain, as those used in coherent optical
transmission, to enhance their performance in detecting mechanical events,
while jointly offering a simpler setup than widespread pulse-cloning or
spectral-sweep based schemes with acousto-optic modulators. We periodically
capture an overall fiber Jones matrix estimate thanks to a novel probing
technique using two mutually orthogonal complementary (Golay) pairs of binary
sequences applied simultaneously in phase and quadrature on two orthogonal
polarization states. A perfect channel response estimation of the sensor array
is achieved, subject to conditions detailed in the paper, thus enhancing the
sensitivity and bandwidth of coherent phase-OTDR systems. High sensitivity,
linear response, and bandwidth coverage up to 18 kHz are demonstrated with a
sensor array composed of 10 fiber Bragg gratings (FBGs).
| eess.SP | monitoring the optical phase change in a fiber enables a wide range of applications where fast phase variations are induced by acoustic signals or vibrations in general however the quality of the estimated fiber response strongly depends on the method used to modulate the light sent to the fiber and capture the variations of the optical field in this paper we show that distributed optical fiber sensing systems can advantageously exploit techniques from the telecommunication domain as those used in coherent optical transmission to enhance their performance in detecting mechanical events while jointly offering a simpler setup than widespread pulsecloning or spectralsweep based schemes with acoustooptic modulators we periodically capture an overall fiber jones matrix estimate thanks to a novel probing technique using two mutually orthogonal complementary golay pairs of binary sequences applied simultaneously in phase and quadrature on two orthogonal polarization states a perfect channel response estimation of the sensor array is achieved subject to conditions detailed in the paper thus enhancing the sensitivity and bandwidth of coherent phaseotdr systems high sensitivity linear response and bandwidth coverage up to 18 khz are demonstrated with a sensor array composed of 10 fiber bragg gratings fbgs | [['monitoring', 'the', 'optical', 'phase', 'change', 'in', 'a', 'fiber', 'enables', 'a', 'wide', 'range', 'of', 'applications', 'where', 'fast', 'phase', 'variations', 'are', 'induced', 'by', 'acoustic', 'signals', 'or', 'vibrations', 'in', 'general', 'however', 'the', 'quality', 'of', 'the', 'estimated', 'fiber', 'response', 'strongly', 'depends', 'on', 'the', 'method', 'used', 'to', 'modulate', 'the', 'light', 'sent', 'to', 'the', 'fiber', 'and', 'capture', 'the', 'variations', 'of', 'the', 'optical', 'field', 'in', 'this', 'paper', 'we', 'show', 'that', 'distributed', 'optical', 'fiber', 'sensing', 'systems', 'can', 'advantageously', 'exploit', 'techniques', 'from', 'the', 'telecommunication', 'domain', 'as', 'those', 'used', 'in', 'coherent', 'optical', 'transmission', 'to', 'enhance', 'their', 'performance', 'in', 'detecting', 'mechanical', 'events', 'while', 'jointly', 'offering', 'a', 'simpler', 'setup', 'than', 'widespread', 'pulsecloning', 'or', 'spectralsweep', 'based', 'schemes', 'with', 'acoustooptic', 'modulators', 'we', 'periodically', 'capture', 'an', 'overall', 'fiber', 'jones', 'matrix', 'estimate', 'thanks', 'to', 'a', 'novel', 'probing', 'technique', 'using', 'two', 'mutually', 'orthogonal', 'complementary', 'golay', 'pairs', 'of', 'binary', 'sequences', 'applied', 'simultaneously', 'in', 'phase', 'and', 'quadrature', 'on', 'two', 'orthogonal', 'polarization', 'states', 'a', 'perfect', 'channel', 'response', 'estimation', 'of', 'the', 'sensor', 'array', 'is', 'achieved', 'subject', 'to', 'conditions', 'detailed', 'in', 'the', 'paper', 'thus', 'enhancing', 'the', 'sensitivity', 'and', 'bandwidth', 'of', 'coherent', 'phaseotdr', 'systems', 'high', 'sensitivity', 'linear', 'response', 'and', 'bandwidth', 'coverage', 'up', 'to', '18', 'khz', 'are', 'demonstrated', 'with', 'a', 'sensor', 'array', 'composed', 'of', '10', 'fiber', 'bragg', 'gratings', 'fbgs']] | [-0.1611316523461331, 0.12241985681923022, -0.03775122753965358, -0.04111943360051858, -0.06039642011091928, -0.17063285877763215, 0.054338843019650085, 0.4720409258734435, -0.27404596901033074, -0.28072309265553486, 0.11877633914809849, -0.24393287272444772, -0.16689230760948703, 0.25387958435991703, -0.09067223947689247, 0.09107373048846057, 0.054097548316349275, -0.019891887224124122, -0.05239770708794822, -0.18549053477181587, 0.23281011517550118, 0.05390512408970002, 0.3739858322078362, -0.0128446652367226, 0.12556469275659765, 0.07124894441464373, -0.04230030501639703, -0.028263281603358337, -0.07078952084600587, 0.15461402127857582, 0.2894740433342425, 0.0655012036777407, 0.22043028901680373, -0.41520644818471436, -0.2334026678969773, 0.1065985738193073, 0.13433413018598608, 0.08854975176776254, -0.021793484544105013, -0.2784943952556205, 0.0641118432267831, -0.15980975700707253, -0.10186239100827758, -0.052485659574207, -0.04290315412981727, 0.07069069044428034, -0.2792047800612636, -0.0008258586118851478, 0.005744625286752125, 0.06544874783624739, -0.020343481592135504, -0.03868652448424351, 0.03909855141682783, 0.10750113476630456, -0.059743030345998704, -0.005488150212840992, 0.1560526226297346, -0.11131569921902458, -0.09608618936181301, 0.379505304152796, -0.10518131729054403, -0.1613688991261976, 0.16469200112775675, -0.11987895006798983, -0.030517003807290166, 0.19496802019299744, 0.22283538124793267, 0.09139208325116972, -0.14511862338743717, -0.03441614340408705, 0.0659875939018093, 0.24541256262455136, 0.1273272823455045, 0.14695988686829273, 0.2143313996384677, 0.1815423819668164, 0.07236846006223156, 0.15757688285642266, -0.13776708470565305, -0.011065466757524215, -0.20499125145427874, -0.09996274168952368, -0.17868683580066622, 0.014049929382357126, -0.06735663528737253, -0.12034195492742583, 0.42633410895844764, 0.1256838273475296, 0.16398904064825123, -0.006787751381731748, 0.3407479444673906, 0.08045337206992069, 0.08797662055864446, -0.00555506566161057, 0.29170793835025205, 0.1659081312257816, 0.11774872934741627, -0.2153666479759219, 0.013251854747068137, -0.030454153235041304] |
1,802.06642 | Interfacing planar superconducting qubits with high overtone bulk
acoustic phonons | Mechanical resonators are a promising way for interfacing qubits in order to
realize hybrid quantum systems that offer great possibilities for applications.
Mechanical systems can have very long energy lifetimes, and they can be further
interfaced to other systems. Moreover, integration of mechanical oscillator
with qubits creates a potential platform for exploration of quantum physics in
macroscopic mechanical degrees of freedom. Utilization of high overtone bulk
acoustic resonators coupled to superconducting qubits is an intriguing platform
towards these goals. These resonators exhibit a combination of high frequency
and high quality factors. They can reach their quantum ground state at dilution
refrigeration temperatures and they can be strongly coupled to superconducting
qubits via their piezoelectric effect. In this report, we demonstrate our
system where bulk acoustic phonons of a high overtone resonator are coupled to
a transmon qubit in a planar circuit architecture. We show that the bulk
acoustic phonons are interacting with the qubit in the simple design
architecture at the quantum level, representing further progress towards
quantum control of mechanical motion.
| cond-mat.mes-hall | mechanical resonators are a promising way for interfacing qubits in order to realize hybrid quantum systems that offer great possibilities for applications mechanical systems can have very long energy lifetimes and they can be further interfaced to other systems moreover integration of mechanical oscillator with qubits creates a potential platform for exploration of quantum physics in macroscopic mechanical degrees of freedom utilization of high overtone bulk acoustic resonators coupled to superconducting qubits is an intriguing platform towards these goals these resonators exhibit a combination of high frequency and high quality factors they can reach their quantum ground state at dilution refrigeration temperatures and they can be strongly coupled to superconducting qubits via their piezoelectric effect in this report we demonstrate our system where bulk acoustic phonons of a high overtone resonator are coupled to a transmon qubit in a planar circuit architecture we show that the bulk acoustic phonons are interacting with the qubit in the simple design architecture at the quantum level representing further progress towards quantum control of mechanical motion | [['mechanical', 'resonators', 'are', 'a', 'promising', 'way', 'for', 'interfacing', 'qubits', 'in', 'order', 'to', 'realize', 'hybrid', 'quantum', 'systems', 'that', 'offer', 'great', 'possibilities', 'for', 'applications', 'mechanical', 'systems', 'can', 'have', 'very', 'long', 'energy', 'lifetimes', 'and', 'they', 'can', 'be', 'further', 'interfaced', 'to', 'other', 'systems', 'moreover', 'integration', 'of', 'mechanical', 'oscillator', 'with', 'qubits', 'creates', 'a', 'potential', 'platform', 'for', 'exploration', 'of', 'quantum', 'physics', 'in', 'macroscopic', 'mechanical', 'degrees', 'of', 'freedom', 'utilization', 'of', 'high', 'overtone', 'bulk', 'acoustic', 'resonators', 'coupled', 'to', 'superconducting', 'qubits', 'is', 'an', 'intriguing', 'platform', 'towards', 'these', 'goals', 'these', 'resonators', 'exhibit', 'a', 'combination', 'of', 'high', 'frequency', 'and', 'high', 'quality', 'factors', 'they', 'can', 'reach', 'their', 'quantum', 'ground', 'state', 'at', 'dilution', 'refrigeration', 'temperatures', 'and', 'they', 'can', 'be', 'strongly', 'coupled', 'to', 'superconducting', 'qubits', 'via', 'their', 'piezoelectric', 'effect', 'in', 'this', 'report', 'we', 'demonstrate', 'our', 'system', 'where', 'bulk', 'acoustic', 'phonons', 'of', 'a', 'high', 'overtone', 'resonator', 'are', 'coupled', 'to', 'a', 'transmon', 'qubit', 'in', 'a', 'planar', 'circuit', 'architecture', 'we', 'show', 'that', 'the', 'bulk', 'acoustic', 'phonons', 'are', 'interacting', 'with', 'the', 'qubit', 'in', 'the', 'simple', 'design', 'architecture', 'at', 'the', 'quantum', 'level', 'representing', 'further', 'progress', 'towards', 'quantum', 'control', 'of', 'mechanical', 'motion']] | [-0.1925869031709776, 0.23033637983183347, -0.008175074639946742, -0.07874735423886937, -0.0647516950455949, -0.23243461405793422, 0.05121200587221443, 0.43478788097042503, -0.23680958690035137, -0.31429607715717583, 0.012174821127108623, -0.30423418085123305, -0.1088445950475478, 0.2679154808189027, -0.014138364297989113, 0.09747056474605965, 0.06619119306019139, -0.022887156161189966, -0.03131015292506903, -0.19934372138502726, 0.2092191378428969, 0.043412300540800315, 0.34276721354703915, 0.023654185744478952, 0.10609707009821567, -0.0872962024403996, 0.14974407402820192, -0.02273151530548497, -0.08279854069820261, 0.1426123044653904, 0.3300469513538532, -3.397706787773343e-05, 0.2680673518672932, -0.4923113013650182, -0.22326541374312975, 0.024233839539594428, 0.15804543369991142, 0.20351046570008188, -0.043835136026880425, -0.26634708095103676, 0.030435228476647373, -0.16969058448502924, -0.12143721667031736, -0.15967432130128145, -0.018534247703893586, -0.009296396460254179, -0.18591696300630478, 0.0348500685710839, 0.020358185189083045, 0.04613071534414451, -0.010591230051981848, -0.04481990757969555, 0.010785995648231704, 0.10943587396705393, -0.10593800933972045, -0.01954890952528817, 0.1921730538407817, -0.14187581722386355, -0.1676065992661427, 0.37343264351663896, -0.039014685787341755, -0.1728610960133157, 0.2397891681744219, -0.10916037167162569, -0.08220023090063139, 0.07044521650992507, 0.20080627543786758, 0.035883091923477516, -0.1646462414517923, 0.02055741222825735, 0.11054636859930618, 0.20904629812900757, 0.03432935230612625, 0.19404186861221354, 0.30610791584043656, 0.22903073026506274, 0.03606013265617062, 0.18029101361685737, -0.026893825063124557, -0.04492184141011865, -0.26286773753980563, -0.20135566432619206, -0.20920775498285196, 0.10490756755191183, -0.07216457497346455, -0.14787246580343955, 0.38667497632288655, 0.14207123578553152, 0.11644601049226556, -0.03768038159496216, 0.2898165318447566, 0.12646771529161502, 0.1167932563125654, 0.039677342109593325, 0.32252042488530713, 0.16837090193997895, 0.08501771027777279, -0.30776087788940776, -0.03445209441557635, -0.04499289789778549] |
1,802.06643 | Electrically Conductive Diamond Membrane for Electrochemical Separation
Processes | Electrochemically switchable selective membranes play an important role in
selective filtration processes such as water desalination, industrial waste
treatment and hemodialysis. Currently, membranes for these purposes need to be
optimized in terms of electrical conductivity and stability against fouling and
corrosion. In this paper, we report the fabrication of boron-doped diamond
membrane by template diamond growth on quartz fiber filters. The morphology and
quality of the diamond coating are characterized via SEM and Raman
spectroscopy. The membrane is heavily boron doped (> 1021 cm-3) with > 3 V
potential window in aqueous electrolyte. By applying a membrane potential
against the electrolyte, redox active species can be removed via flow-through
electrolysis. Compared to planar diamond electrodes, the ~250 times surface
enlargement provided by such a membrane ensures an effective removal of target
chemicals from the input electrolyte. The high stability of diamond enables the
membrane to not only work at high membrane bias but also to be self-cleaning
via in situ electrochemical oxidation. Therefore, we believe that the diamond
membrane presented in this paper will provide a solution to future selective
filtration applications especially in extreme conditions.
| physics.app-ph cond-mat.mtrl-sci | electrochemically switchable selective membranes play an important role in selective filtration processes such as water desalination industrial waste treatment and hemodialysis currently membranes for these purposes need to be optimized in terms of electrical conductivity and stability against fouling and corrosion in this paper we report the fabrication of borondoped diamond membrane by template diamond growth on quartz fiber filters the morphology and quality of the diamond coating are characterized via sem and raman spectroscopy the membrane is heavily boron doped 1021 cm3 with 3 v potential window in aqueous electrolyte by applying a membrane potential against the electrolyte redox active species can be removed via flowthrough electrolysis compared to planar diamond electrodes the 250 times surface enlargement provided by such a membrane ensures an effective removal of target chemicals from the input electrolyte the high stability of diamond enables the membrane to not only work at high membrane bias but also to be selfcleaning via in situ electrochemical oxidation therefore we believe that the diamond membrane presented in this paper will provide a solution to future selective filtration applications especially in extreme conditions | [['electrochemically', 'switchable', 'selective', 'membranes', 'play', 'an', 'important', 'role', 'in', 'selective', 'filtration', 'processes', 'such', 'as', 'water', 'desalination', 'industrial', 'waste', 'treatment', 'and', 'hemodialysis', 'currently', 'membranes', 'for', 'these', 'purposes', 'need', 'to', 'be', 'optimized', 'in', 'terms', 'of', 'electrical', 'conductivity', 'and', 'stability', 'against', 'fouling', 'and', 'corrosion', 'in', 'this', 'paper', 'we', 'report', 'the', 'fabrication', 'of', 'borondoped', 'diamond', 'membrane', 'by', 'template', 'diamond', 'growth', 'on', 'quartz', 'fiber', 'filters', 'the', 'morphology', 'and', 'quality', 'of', 'the', 'diamond', 'coating', 'are', 'characterized', 'via', 'sem', 'and', 'raman', 'spectroscopy', 'the', 'membrane', 'is', 'heavily', 'boron', 'doped', '1021', 'cm3', 'with', '3', 'v', 'potential', 'window', 'in', 'aqueous', 'electrolyte', 'by', 'applying', 'a', 'membrane', 'potential', 'against', 'the', 'electrolyte', 'redox', 'active', 'species', 'can', 'be', 'removed', 'via', 'flowthrough', 'electrolysis', 'compared', 'to', 'planar', 'diamond', 'electrodes', 'the', '250', 'times', 'surface', 'enlargement', 'provided', 'by', 'such', 'a', 'membrane', 'ensures', 'an', 'effective', 'removal', 'of', 'target', 'chemicals', 'from', 'the', 'input', 'electrolyte', 'the', 'high', 'stability', 'of', 'diamond', 'enables', 'the', 'membrane', 'to', 'not', 'only', 'work', 'at', 'high', 'membrane', 'bias', 'but', 'also', 'to', 'be', 'selfcleaning', 'via', 'in', 'situ', 'electrochemical', 'oxidation', 'therefore', 'we', 'believe', 'that', 'the', 'diamond', 'membrane', 'presented', 'in', 'this', 'paper', 'will', 'provide', 'a', 'solution', 'to', 'future', 'selective', 'filtration', 'applications', 'especially', 'in', 'extreme', 'conditions']] | [-0.023773582190346053, 0.14808552427379967, -0.008539949003929707, -0.08449951546967698, 0.007234662996463316, -0.18679245449311566, 0.07899691762767085, 0.4732961240401694, -0.2518051779125412, -0.2733017439250429, 0.1131271634534958, -0.2754949794414089, -0.15880504674176968, 0.17482197181696235, -0.12093540949686228, 0.05069941881052016, 0.046732374179397164, -0.0977392404543618, 0.045274377730295426, -0.19413930538323018, 0.18217064946657047, 0.10750293532518022, 0.33421087316895387, 0.14499699089387635, 0.0959574502131031, -0.00571747779284361, 0.06842292995070634, 0.01956923966645263, -0.1530190897895844, 0.12723858788376674, 0.3117408989878047, -0.037817087163642536, 0.2323562726682133, -0.5302871778384661, -0.2679128681420875, 0.04578672023996225, 0.13188573735438378, 0.13123618100855863, -0.14865312040289966, -0.20755415806944139, 0.09195688253732995, -0.14413291837880263, -0.11980383624287914, -0.05409445710297998, -0.012476949326177735, 0.019871913391714614, -0.24165666798058816, 0.06644549118462474, 0.020069221604068804, 0.06918490894199551, -0.12071342074752624, -0.12256419609563993, -0.08212063156837679, 0.08691359372333744, -0.000421965913594012, -0.009610965174468456, 0.34678341134997975, -0.09988568707257914, -0.04704590993123534, 0.3425189222148417, -0.06801566512718715, -0.1657766219906752, 0.2001578019060063, -0.10422183217673117, -0.05942632029283508, 0.16677761890423426, 0.09968558379256612, 0.12102665662409297, -0.2367646393629358, 0.03310572706465356, 0.08336169305671913, 0.17327038744722656, 0.1803361137281172, 0.033845234664825155, 0.2166175494836036, 0.2522602585529018, 0.06290706207864391, 0.18237316420962327, -0.08965281038114842, 0.04907604229494767, -0.21282920107225198, -0.22748183170029812, -0.13649106448840187, 0.09006307426099501, -0.10668252734427844, -0.2027641320196183, 0.33994726511477696, 0.08476742104223535, 0.11270930726617656, -0.08970037253912659, 0.2583622993931741, 0.0091107166340605, 0.0731486958431323, -0.0529311351666642, 0.2388980812848667, 0.14826158813514706, 0.126894447221117, -0.26294001181984483, 0.10149044118082637, 0.007146527881875796] |
1,802.06644 | Limits and colimits of crossed groups | Although the notion of crossed groups was originally introduced only in the
simplicial case, the definition makes sense in the other categories. For
instance, Batanin and Markl studied crossed interval groups to investigate
symmetries on the Hochschild cohomology in view of operads. The aim of this
paper is to make a comprehensive understanding of crossed groups for arbitrary
base categories. In particular, we focus on the local presentability of the
category of crossed groups, monadicity, and the basechange theorem along
certain sorts of functors. The paper also contains the classification of
crossed interval groups, which Batanin and Markl concerned about.
| math.CT | although the notion of crossed groups was originally introduced only in the simplicial case the definition makes sense in the other categories for instance batanin and markl studied crossed interval groups to investigate symmetries on the hochschild cohomology in view of operads the aim of this paper is to make a comprehensive understanding of crossed groups for arbitrary base categories in particular we focus on the local presentability of the category of crossed groups monadicity and the basechange theorem along certain sorts of functors the paper also contains the classification of crossed interval groups which batanin and markl concerned about | [['although', 'the', 'notion', 'of', 'crossed', 'groups', 'was', 'originally', 'introduced', 'only', 'in', 'the', 'simplicial', 'case', 'the', 'definition', 'makes', 'sense', 'in', 'the', 'other', 'categories', 'for', 'instance', 'batanin', 'and', 'markl', 'studied', 'crossed', 'interval', 'groups', 'to', 'investigate', 'symmetries', 'on', 'the', 'hochschild', 'cohomology', 'in', 'view', 'of', 'operads', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'make', 'a', 'comprehensive', 'understanding', 'of', 'crossed', 'groups', 'for', 'arbitrary', 'base', 'categories', 'in', 'particular', 'we', 'focus', 'on', 'the', 'local', 'presentability', 'of', 'the', 'category', 'of', 'crossed', 'groups', 'monadicity', 'and', 'the', 'basechange', 'theorem', 'along', 'certain', 'sorts', 'of', 'functors', 'the', 'paper', 'also', 'contains', 'the', 'classification', 'of', 'crossed', 'interval', 'groups', 'which', 'batanin', 'and', 'markl', 'concerned', 'about']] | [-0.19054362347582354, 0.053914686797070316, -0.06597196873277426, 0.0915898055024445, -0.09929005600512028, -0.07992948587518185, 0.010492875308264047, 0.3793284611776471, -0.3349714678898454, -0.24237422423437238, 0.0818966673524119, -0.1959825038909912, -0.12557489518541842, 0.16113543250598014, -0.20881226913537831, -0.09255650859326124, 0.05263886719942093, 0.1452929854299873, -0.05915004249662161, -0.2697214074805379, 0.4630426125274971, 0.008492439445108175, 0.27924987621605396, 0.04503495036624372, 0.06118268875870854, 0.05880705410148948, -0.10421967699658126, 0.007962593669071793, -0.15894729933119378, 0.143792427983135, 0.31556139543652534, 0.025202827909961343, 0.21821898493100889, -0.35941280860279223, -0.10410564674064517, 0.1360308139305562, 0.08401359914336354, 0.019558681252528912, -0.00013414665969321504, -0.3311899103759788, 0.08791520242579282, -0.2442565637920052, -0.09341155056841671, -0.015353109147399664, 0.07798245025333017, -0.002697140194941312, -0.20282652419060468, -0.03448458544939058, 0.12350028954446315, 0.14239055312238633, -0.10654856256674976, -0.060192018719390034, -0.05779825228499249, 0.14461049062840176, -0.011762381654698402, -0.05534992971341126, 0.11836425340734422, -0.11641601987619651, -0.13863314486225137, 0.3988182834535837, -0.005173433967866003, -0.14780807091738096, 0.18278617335483432, -0.16533164940774442, -0.22897744118236005, 0.08399552420247346, 0.047065054427366707, 0.17705603034235537, -0.0659529929375276, 0.17043390868522693, -0.12110479022376239, 0.0381163733638823, 0.15185805140063166, 0.0233910716092214, 0.11592356943758204, 0.11555222540162503, 0.07639589218422771, 0.19244472899998072, 0.03229389047715813, -0.05850653823465109, -0.3052658009342849, -0.2121707326406613, -0.03291277937591076, 0.0737760169035755, -0.013137770094472217, -0.16802954452345148, 0.4018733237590641, 0.14164989875163883, 0.13873337582335807, 0.11017047429573722, 0.22764994273195044, -0.010579278375953436, 0.07654057072009891, -0.023820462849980687, 0.13042873851023615, 0.28023597538471223, 0.012413943666033447, -0.06331265242770315, -0.005704951584339142, 0.2121150603890419] |
1,802.06645 | Simultaneous Compression and Quantization: A Joint Approach for
Efficient Unsupervised Hashing | For unsupervised data-dependent hashing, the two most important requirements
are to preserve similarity in the low-dimensional feature space and to minimize
the binary quantization loss. A well-established hashing approach is Iterative
Quantization (ITQ), which addresses these two requirements in separate steps.
In this paper, we revisit the ITQ approach and propose novel formulations and
algorithms to the problem. Specifically, we propose a novel approach, named
Simultaneous Compression and Quantization (SCQ), to jointly learn to compress
(reduce dimensionality) and binarize input data in a single formulation under
strict orthogonal constraint. With this approach, we introduce a loss function
and its relaxed version, termed Orthonormal Encoder (OnE) and Orthogonal
Encoder (OgE) respectively, which involve challenging binary and orthogonal
constraints. We propose to attack the optimization using novel algorithms based
on recent advances in cyclic coordinate descent approach. Comprehensive
experiments on unsupervised image retrieval demonstrate that our proposed
methods consistently outperform other state-of-the-art hashing methods.
Notably, our proposed methods outperform recent deep neural networks and GAN
based hashing in accuracy, while being very computationally-efficient.
| cs.CV | for unsupervised datadependent hashing the two most important requirements are to preserve similarity in the lowdimensional feature space and to minimize the binary quantization loss a wellestablished hashing approach is iterative quantization itq which addresses these two requirements in separate steps in this paper we revisit the itq approach and propose novel formulations and algorithms to the problem specifically we propose a novel approach named simultaneous compression and quantization scq to jointly learn to compress reduce dimensionality and binarize input data in a single formulation under strict orthogonal constraint with this approach we introduce a loss function and its relaxed version termed orthonormal encoder one and orthogonal encoder oge respectively which involve challenging binary and orthogonal constraints we propose to attack the optimization using novel algorithms based on recent advances in cyclic coordinate descent approach comprehensive experiments on unsupervised image retrieval demonstrate that our proposed methods consistently outperform other stateoftheart hashing methods notably our proposed methods outperform recent deep neural networks and gan based hashing in accuracy while being very computationallyefficient | [['for', 'unsupervised', 'datadependent', 'hashing', 'the', 'two', 'most', 'important', 'requirements', 'are', 'to', 'preserve', 'similarity', 'in', 'the', 'lowdimensional', 'feature', 'space', 'and', 'to', 'minimize', 'the', 'binary', 'quantization', 'loss', 'a', 'wellestablished', 'hashing', 'approach', 'is', 'iterative', 'quantization', 'itq', 'which', 'addresses', 'these', 'two', 'requirements', 'in', 'separate', 'steps', 'in', 'this', 'paper', 'we', 'revisit', 'the', 'itq', 'approach', 'and', 'propose', 'novel', 'formulations', 'and', 'algorithms', 'to', 'the', 'problem', 'specifically', 'we', 'propose', 'a', 'novel', 'approach', 'named', 'simultaneous', 'compression', 'and', 'quantization', 'scq', 'to', 'jointly', 'learn', 'to', 'compress', 'reduce', 'dimensionality', 'and', 'binarize', 'input', 'data', 'in', 'a', 'single', 'formulation', 'under', 'strict', 'orthogonal', 'constraint', 'with', 'this', 'approach', 'we', 'introduce', 'a', 'loss', 'function', 'and', 'its', 'relaxed', 'version', 'termed', 'orthonormal', 'encoder', 'one', 'and', 'orthogonal', 'encoder', 'oge', 'respectively', 'which', 'involve', 'challenging', 'binary', 'and', 'orthogonal', 'constraints', 'we', 'propose', 'to', 'attack', 'the', 'optimization', 'using', 'novel', 'algorithms', 'based', 'on', 'recent', 'advances', 'in', 'cyclic', 'coordinate', 'descent', 'approach', 'comprehensive', 'experiments', 'on', 'unsupervised', 'image', 'retrieval', 'demonstrate', 'that', 'our', 'proposed', 'methods', 'consistently', 'outperform', 'other', 'stateoftheart', 'hashing', 'methods', 'notably', 'our', 'proposed', 'methods', 'outperform', 'recent', 'deep', 'neural', 'networks', 'and', 'gan', 'based', 'hashing', 'in', 'accuracy', 'while', 'being', 'very', 'computationallyefficient']] | [-0.059294272900411955, -0.042718669986461254, -0.09657318588368029, 0.056019929569209134, -0.12323923794925758, -0.2421195617038212, 0.04501343257139758, 0.46962497059844044, -0.3003092860695443, -0.2807015442093344, 0.06039240353533791, -0.2160646973330288, -0.24267792966344792, 0.13382632523088864, -0.1671644232551736, 0.1417489517946477, 0.1221168698764771, -0.010438187215313838, -0.16159746242409342, -0.3210859906366803, 0.3002275890004903, 0.05176118101597197, 0.40554963384635134, -0.02834687203002756, 0.17390752476245186, 0.03271190587387622, -0.04466971486830017, -0.027066232103000704, -0.060382027895408016, 0.2139006163890893, 0.3046748890958138, 0.21563236905555977, 0.3083932687833426, -0.4024454536384832, -0.23153853935069726, 0.07533127343151391, 0.14024719469554242, 0.12032743585731681, -0.06185376679399514, -0.2806172534041869, 0.0879567186293677, -0.1597818582759876, 0.08048364381327659, -0.17910429525967927, -0.08946107376955058, -0.024581794454430213, -0.32964203427123634, 0.04482737880020419, 0.09292293895476454, -0.02656704344247517, -0.05916819575770992, -0.143471867083, 0.11690036120840855, 0.05580849351350501, 0.011829866846609447, 0.09138786691044898, 0.08496238539480108, -0.08494993517984097, -0.18342667180916827, 0.3582028260792208, -0.0628879595852909, -0.24957875771824495, 0.1711519163031109, 0.039726591607071024, -0.2136480215806187, 0.07861153222620487, 0.25995170872941703, 0.16913939276111056, -0.14987272628016596, 0.02476751304616912, -0.013414010253043203, 0.15004193702541097, 0.05329343982787029, 0.06020997633765403, 0.12574987459522047, 0.21347206454636933, 0.08926311620560132, 0.16752475038291995, -0.12866481221335455, -0.10093647785408542, -0.1746964597984691, -0.08617106279527104, -0.1981113098550871, -0.06112034271378615, -0.08097334566847109, -0.14052346379304514, 0.37918371031583664, 0.22998004454073676, 0.23629390100583608, 0.09255394796917095, 0.41158480655772295, 0.03905784530968171, 0.11422468310668629, 0.1288489689478618, 0.19276293033559683, 0.061962438530795146, 0.08201926169584761, -0.2030902364596245, 0.04005122287416754, 0.14311333328801376] |
1,802.06646 | Seesaw mechanism in magnetic compactifications | In this paper, we explore a new avenue to a natural explanation of the
observed tiny neutrino masses with a dynamical realization of the
three-generation structure in the neutrino sector. Under the magnetized
background based on $T^2/Z_2$, matter consists of multiply-degenerated zero
modes and the whole intergenerational structure is dynamically determined. In
this sense, we can conclude that our scenario is favored by minimality, where
no degree of freedom remains to deform the intergenerational structure by hand
freely. Under the consideration of brane-localized Majorana-type mass terms for
an $SU(2)_L$ singlet neutrino, it is sufficient to introduce one Higgs doublet
for reproducing the observed neutrino data. In all reasonable flux
configurations with three right-handed neutrinos, phenomenologically acceptable
parameter configurations are found.
| hep-ph | in this paper we explore a new avenue to a natural explanation of the observed tiny neutrino masses with a dynamical realization of the threegeneration structure in the neutrino sector under the magnetized background based on t2z_2 matter consists of multiplydegenerated zero modes and the whole intergenerational structure is dynamically determined in this sense we can conclude that our scenario is favored by minimality where no degree of freedom remains to deform the intergenerational structure by hand freely under the consideration of branelocalized majoranatype mass terms for an su2_l singlet neutrino it is sufficient to introduce one higgs doublet for reproducing the observed neutrino data in all reasonable flux configurations with three righthanded neutrinos phenomenologically acceptable parameter configurations are found | [['in', 'this', 'paper', 'we', 'explore', 'a', 'new', 'avenue', 'to', 'a', 'natural', 'explanation', 'of', 'the', 'observed', 'tiny', 'neutrino', 'masses', 'with', 'a', 'dynamical', 'realization', 'of', 'the', 'threegeneration', 'structure', 'in', 'the', 'neutrino', 'sector', 'under', 'the', 'magnetized', 'background', 'based', 'on', 't2z_2', 'matter', 'consists', 'of', 'multiplydegenerated', 'zero', 'modes', 'and', 'the', 'whole', 'intergenerational', 'structure', 'is', 'dynamically', 'determined', 'in', 'this', 'sense', 'we', 'can', 'conclude', 'that', 'our', 'scenario', 'is', 'favored', 'by', 'minimality', 'where', 'no', 'degree', 'of', 'freedom', 'remains', 'to', 'deform', 'the', 'intergenerational', 'structure', 'by', 'hand', 'freely', 'under', 'the', 'consideration', 'of', 'branelocalized', 'majoranatype', 'mass', 'terms', 'for', 'an', 'su2_l', 'singlet', 'neutrino', 'it', 'is', 'sufficient', 'to', 'introduce', 'one', 'higgs', 'doublet', 'for', 'reproducing', 'the', 'observed', 'neutrino', 'data', 'in', 'all', 'reasonable', 'flux', 'configurations', 'with', 'three', 'righthanded', 'neutrinos', 'phenomenologically', 'acceptable', 'parameter', 'configurations', 'are', 'found']] | [-0.15750996499251918, 0.26337733074835357, -0.01418066063715818, 0.146866565097726, -0.10136722869576276, -0.1422009747406906, 0.009059942764730952, 0.34252022444700997, -0.19010630956686594, -0.3073468202208521, 0.03891844327459816, -0.2121400078893111, -0.0819051883128636, 0.13355189714455554, -0.004197964303884185, -0.018234577585606516, 0.03196400029490851, 0.023576286824874015, -0.0638602074732644, -0.24640746827984714, 0.35244141045973454, 0.041612660451674784, 0.24701053065740886, 0.049032415614557304, 0.12557553106375008, -0.04948312881160058, 0.0071352082676402915, -0.0804505181741439, -0.11641696717878931, 0.0620265301363934, 0.16268009472513148, 0.08886841503793702, 0.1311837559577641, -0.38807501115624893, -0.20441519660765634, 0.1768996618735064, 0.13184999805648162, 0.08716449798136156, -0.0788865337009393, -0.28564670834565115, 0.08600625465428378, -0.18207766295192046, -0.17678063676864722, -0.08005955698508613, -0.04325516732456554, -0.11167906852392089, -0.3207024171700928, 0.07067974405206677, -0.030695362542139587, -0.007211347634927565, -0.06718651844705102, -0.1279754811083945, -0.06769897960744672, 0.03432533924444383, 0.1569831328908717, -0.027420585403735397, 0.10315475024418913, -0.16675865556653433, -0.0796946169301758, 0.44587694776064457, -0.08450468540672965, -0.20214335401928904, 0.13506047377202532, -0.15719138116755782, -0.1636852277090632, 0.11366412688453659, 0.10971689736861892, 0.07773481693290987, -0.19413249244856717, 0.14259853539548173, -0.11904607013556637, 0.17959060332103938, 0.0312575957573512, 0.037609933163313305, 0.309998842191045, 0.21981356008870512, 0.08903947951342567, 0.04795845802247274, -0.051766962632771675, -0.08845218876376748, -0.3646554290825705, -0.10919409678826313, -0.08331463409356867, 0.059258406201158374, -0.06376612918173108, -0.13805391514055557, 0.45466106091508596, 0.13849265961379534, 0.23810410448702193, -0.022253945264784313, 0.2739551124092536, 0.038305227431965634, 0.08082148342534211, 0.0491745386961378, 0.286108009227622, 0.11195451448409341, 0.058195980645309224, -0.2266624584645346, 0.012534539613671241, 0.04260581025869405] |
1,802.06647 | Benchmarking the performance of controllers for power grid transient
stability | As the energy transition transforms power grids across the globe, it poses
several challenges regarding grid design and control. In particular, high
levels of intermittent renewable generation complicate the task of continuously
balancing power supply and demand, requiring sufficient control actions.
Although there exist several proposals to control the grid, most of them have
not demonstrated to be cost efficient in terms of optimal control theory. Here,
we mathematically formulate an optimal centralized (therefore non-local)
control problem for stable operation of power grids and determine the minimal
amount of active power necessary to guarantee a stable service within the
operational constraints, minimizing a suitable cost function at the same time.
This optimal control can be used to benchmark control proposals and we
demonstrate this benchmarking process by investigating the performance of three
distributed controllers, two of which are fully decentralized, that have been
recently studied in the physics and power systems engineering literature. Our
results show that cost efficient controllers distribute the controlled response
amongst all nodes in the power grid. Additionally, superior performance can be
achieved by incorporating sufficient information about the disturbance causing
the instability. Overall, our results can help design and benchmark secure and
cost-efficient controllers.
| math.OC cs.SY | as the energy transition transforms power grids across the globe it poses several challenges regarding grid design and control in particular high levels of intermittent renewable generation complicate the task of continuously balancing power supply and demand requiring sufficient control actions although there exist several proposals to control the grid most of them have not demonstrated to be cost efficient in terms of optimal control theory here we mathematically formulate an optimal centralized therefore nonlocal control problem for stable operation of power grids and determine the minimal amount of active power necessary to guarantee a stable service within the operational constraints minimizing a suitable cost function at the same time this optimal control can be used to benchmark control proposals and we demonstrate this benchmarking process by investigating the performance of three distributed controllers two of which are fully decentralized that have been recently studied in the physics and power systems engineering literature our results show that cost efficient controllers distribute the controlled response amongst all nodes in the power grid additionally superior performance can be achieved by incorporating sufficient information about the disturbance causing the instability overall our results can help design and benchmark secure and costefficient controllers | [['as', 'the', 'energy', 'transition', 'transforms', 'power', 'grids', 'across', 'the', 'globe', 'it', 'poses', 'several', 'challenges', 'regarding', 'grid', 'design', 'and', 'control', 'in', 'particular', 'high', 'levels', 'of', 'intermittent', 'renewable', 'generation', 'complicate', 'the', 'task', 'of', 'continuously', 'balancing', 'power', 'supply', 'and', 'demand', 'requiring', 'sufficient', 'control', 'actions', 'although', 'there', 'exist', 'several', 'proposals', 'to', 'control', 'the', 'grid', 'most', 'of', 'them', 'have', 'not', 'demonstrated', 'to', 'be', 'cost', 'efficient', 'in', 'terms', 'of', 'optimal', 'control', 'theory', 'here', 'we', 'mathematically', 'formulate', 'an', 'optimal', 'centralized', 'therefore', 'nonlocal', 'control', 'problem', 'for', 'stable', 'operation', 'of', 'power', 'grids', 'and', 'determine', 'the', 'minimal', 'amount', 'of', 'active', 'power', 'necessary', 'to', 'guarantee', 'a', 'stable', 'service', 'within', 'the', 'operational', 'constraints', 'minimizing', 'a', 'suitable', 'cost', 'function', 'at', 'the', 'same', 'time', 'this', 'optimal', 'control', 'can', 'be', 'used', 'to', 'benchmark', 'control', 'proposals', 'and', 'we', 'demonstrate', 'this', 'benchmarking', 'process', 'by', 'investigating', 'the', 'performance', 'of', 'three', 'distributed', 'controllers', 'two', 'of', 'which', 'are', 'fully', 'decentralized', 'that', 'have', 'been', 'recently', 'studied', 'in', 'the', 'physics', 'and', 'power', 'systems', 'engineering', 'literature', 'our', 'results', 'show', 'that', 'cost', 'efficient', 'controllers', 'distribute', 'the', 'controlled', 'response', 'amongst', 'all', 'nodes', 'in', 'the', 'power', 'grid', 'additionally', 'superior', 'performance', 'can', 'be', 'achieved', 'by', 'incorporating', 'sufficient', 'information', 'about', 'the', 'disturbance', 'causing', 'the', 'instability', 'overall', 'our', 'results', 'can', 'help', 'design', 'and', 'benchmark', 'secure', 'and', 'costefficient', 'controllers']] | [-0.15401723010034943, 0.052344705823568476, -0.03974919726407558, 0.03626482924082483, -0.06358493464161179, -0.17851002080993136, 0.08450424889320199, 0.4001587025245567, -0.2915193297784429, -0.36962640897549887, 0.1529701768184296, -0.21172765577586378, -0.12352566548562305, 0.23177767695183982, -0.13746116286840981, 0.14313526581750538, 0.04411013002551849, -0.02710357656580719, -0.015701137941468733, -0.26418183985676374, 0.24438522267974352, 0.09795902763030037, 0.35721285888064075, 0.04042604082643087, 0.10490630249534945, -0.053525280463626264, -0.01657258356972855, 0.030088779284564975, -0.08052518092314935, 0.1374378122907628, 0.3309453732156237, 0.14904599139775762, 0.340232799288316, -0.4751397595885935, -0.22451261637191844, 0.12843674561067311, 0.12409162288531661, 0.04960914894098407, -0.07745715865547109, -0.19781596453429842, 0.11050158392067007, -0.2081978558550996, -0.08337265866265711, -0.12395361769621509, -0.023424391943643142, 0.06360042928811631, -0.31435580368401794, 0.0030111859098600983, 0.019909871171167746, 0.035766700074432334, -0.06912209797795656, -0.06798004546090398, -0.03718041392726515, 0.20115102314151562, -0.0019070596795999469, -0.037376369913015045, 0.15711584881073257, -0.1206822549765134, -0.1558933931697703, 0.37336925613745375, 0.03311843862499686, -0.2113320463285524, 0.15037525539876118, -0.06595498271141408, -0.13011340709665237, 0.12048328381579314, 0.21456001077699077, 0.09772845396968588, -0.19141899545597446, 0.03133299589261235, 0.022958222842171562, 0.18467833802201106, 0.040042293089530875, 0.07746751350204427, 0.1822272258361418, 0.2024860106427316, 0.18252085104126053, 0.12784170350539567, -0.01694027849735725, -0.13555813144925213, -0.24574841579642315, -0.10181291240393817, -0.15486631544842736, -0.000930171881041293, -0.0732362226650485, -0.1020144313835918, 0.40978715068487515, 0.18950238823188684, 0.13127613462854046, 0.05628211928771963, 0.3709828029199499, 0.13456657953529932, 0.05916055056954449, 0.1315173866088624, 0.23758572960815313, 0.023880100070765645, 0.12358000054581081, -0.24421420095964622, 0.07984496981324395, -0.020052767056859468] |
1,802.06648 | Superior Structural, Elastic and Electronic Properties of 2D Titanium
Nitride MXenes Over Carbide MXenes: A Comprehensive First Principles Study | The structural, elastic and electronic properties of two-dimensional (2D)
titanium carbide/nitride based pristine (Tin+1Cn/Tin+1Nn) and functionalized
MXenes (Tin+1CnT2/Tin+1NnT2, T stands for the terminal groups: -F, -O and -OH,
n = 1, 2, 3) are investigated by density functional theory calculations.
Carbide-based MXenes possess larger lattice constants and monolayer thicknesses
than nitride-based MXenes. The in-plane Young's moduli of Tin+1Nn are larger
than those of Tin+1Cn, whereas in both systems they decrease with the increase
of the monolayer thickness. Cohesive energy calculations indicate that MXenes
with a larger monolayer thickness have a better structural stability.
Adsorption energy calculations imply that Tin+1Nn have stronger preference to
adhere to the terminal groups, which suggests more active surfaces for
nitride-based MXenes. More importantly, nearly free electron states are
observed to exist outside the surfaces of -OH functionalized carbide/nitride
based MXenes, especially in Tin+1Nn(OH)2, which provide almost perfect
transmission channels without nuclear scattering for electron transport. The
overall electrical conductivity of nitride-based MXenes is determined to be
higher than that of carbide-based MXenes. The exceptional properties of
titanium nitride-based MXenes, including strong surface adsorption, high
elastic constant and Young's modulus, and good metallic conductivity, make them
promising materials for catalysis and energy storage applications.
| cond-mat.mtrl-sci | the structural elastic and electronic properties of twodimensional 2d titanium carbidenitride based pristine tin1cntin1nn and functionalized mxenes tin1cnt2tin1nnt2 t stands for the terminal groups f o and oh n 1 2 3 are investigated by density functional theory calculations carbidebased mxenes possess larger lattice constants and monolayer thicknesses than nitridebased mxenes the inplane youngs moduli of tin1nn are larger than those of tin1cn whereas in both systems they decrease with the increase of the monolayer thickness cohesive energy calculations indicate that mxenes with a larger monolayer thickness have a better structural stability adsorption energy calculations imply that tin1nn have stronger preference to adhere to the terminal groups which suggests more active surfaces for nitridebased mxenes more importantly nearly free electron states are observed to exist outside the surfaces of oh functionalized carbidenitride based mxenes especially in tin1nnoh2 which provide almost perfect transmission channels without nuclear scattering for electron transport the overall electrical conductivity of nitridebased mxenes is determined to be higher than that of carbidebased mxenes the exceptional properties of titanium nitridebased mxenes including strong surface adsorption high elastic constant and youngs modulus and good metallic conductivity make them promising materials for catalysis and energy storage applications | [['the', 'structural', 'elastic', 'and', 'electronic', 'properties', 'of', 'twodimensional', '2d', 'titanium', 'carbidenitride', 'based', 'pristine', 'tin1cntin1nn', 'and', 'functionalized', 'mxenes', 'tin1cnt2tin1nnt2', 't', 'stands', 'for', 'the', 'terminal', 'groups', 'f', 'o', 'and', 'oh', 'n', '1', '2', '3', 'are', 'investigated', 'by', 'density', 'functional', 'theory', 'calculations', 'carbidebased', 'mxenes', 'possess', 'larger', 'lattice', 'constants', 'and', 'monolayer', 'thicknesses', 'than', 'nitridebased', 'mxenes', 'the', 'inplane', 'youngs', 'moduli', 'of', 'tin1nn', 'are', 'larger', 'than', 'those', 'of', 'tin1cn', 'whereas', 'in', 'both', 'systems', 'they', 'decrease', 'with', 'the', 'increase', 'of', 'the', 'monolayer', 'thickness', 'cohesive', 'energy', 'calculations', 'indicate', 'that', 'mxenes', 'with', 'a', 'larger', 'monolayer', 'thickness', 'have', 'a', 'better', 'structural', 'stability', 'adsorption', 'energy', 'calculations', 'imply', 'that', 'tin1nn', 'have', 'stronger', 'preference', 'to', 'adhere', 'to', 'the', 'terminal', 'groups', 'which', 'suggests', 'more', 'active', 'surfaces', 'for', 'nitridebased', 'mxenes', 'more', 'importantly', 'nearly', 'free', 'electron', 'states', 'are', 'observed', 'to', 'exist', 'outside', 'the', 'surfaces', 'of', 'oh', 'functionalized', 'carbidenitride', 'based', 'mxenes', 'especially', 'in', 'tin1nnoh2', 'which', 'provide', 'almost', 'perfect', 'transmission', 'channels', 'without', 'nuclear', 'scattering', 'for', 'electron', 'transport', 'the', 'overall', 'electrical', 'conductivity', 'of', 'nitridebased', 'mxenes', 'is', 'determined', 'to', 'be', 'higher', 'than', 'that', 'of', 'carbidebased', 'mxenes', 'the', 'exceptional', 'properties', 'of', 'titanium', 'nitridebased', 'mxenes', 'including', 'strong', 'surface', 'adsorption', 'high', 'elastic', 'constant', 'and', 'youngs', 'modulus', 'and', 'good', 'metallic', 'conductivity', 'make', 'them', 'promising', 'materials', 'for', 'catalysis', 'and', 'energy', 'storage', 'applications']] | [-0.11051039187429798, 0.17509242467626573, -0.01556926952901656, 0.0009482287787635214, -0.007218090610371696, -0.20960835901596558, 0.069821366953427, 0.4611702317066451, -0.22139611910466875, -0.29665412308362427, -0.009804231704769548, -0.3328386820069263, -0.13904142658911134, 0.19365050301458392, 0.047379833453940964, 0.05329914715144292, -0.010719630650426975, -0.07627219891421394, -0.11128451406312663, -0.23391100680566437, 0.2382040522012012, 0.06736054378851174, 0.3320118284848317, 0.0990028915552314, -0.04451447768659188, -0.037136524681632636, 0.13356918991770023, 0.059121520748785725, -0.21340138003812634, 0.16929072075463072, 0.2627568033624874, -0.13110385608746025, 0.18028743535516753, -0.4932784183744203, -0.2574705621621833, 0.01767728787664541, 0.08168287903178857, 0.08152029848972916, -0.07784577632688168, -0.1931776457402126, 0.13778129497434569, -0.10691429305299328, -0.11781472397155729, -0.10084584678853394, 0.034131022145547876, 0.05197986039374931, -0.18629925439833964, 0.11718788719366467, -0.0006266532234216809, 0.10517049018465624, -0.1451882166398699, -0.2416823744113562, -0.1638213838672354, 0.051857190423462755, 0.020528972125489008, 0.00034752859618199407, 0.23132195959370289, -0.13062061160487473, -0.047646271821269126, 0.42327824357167754, -0.029405633265952698, -0.07540528907698688, 0.19000850243139125, -0.16624452484089133, -0.07282283296069456, 0.21712081283380194, 0.08171375026857411, 0.12851192302036066, -0.08345682195772136, 0.049234750769630804, -0.013375428825879656, 0.1673857758844779, 0.11961900267168564, 0.11533606924743653, 0.1671312229828564, 0.17557571678503697, 0.08478568075840712, 0.061114337723381894, -0.04740436537398848, 0.004963996967980786, -0.16203664682273353, -0.2553241989407787, -0.16128805130917243, 0.10278635072674622, -0.10049671290644688, -0.20834851841486635, 0.31516911271989106, 0.05189548945054412, 0.1300251558039611, -0.00354254605844814, 0.1950911653644489, 0.05863214943006083, 0.12416460530995022, 0.03731067901940415, 0.28548113626265337, 0.19490175713568178, 0.04278567010566356, -0.20933374416954056, 0.09118044802613517, 0.001345853810321796] |
1,802.06649 | Localization of the Standard Model via Higgs mechanism and a finite
electroweak monopole from non-compact five dimensions | We propose a minimal and self-contained model in non-compact flat five
dimensions which localizes the Standard Model (SM) on a domain wall.
Localization of gauge fields is achieved by the condensation of Higgs field via
a Higgs dependent gauge kinetic term in five-dimensional Lagrangian. The domain
wall connecting vacua with unbroken gauge symmetry drives the Higgs
condensation which provides both electroweak symmetry breaking and gauge field
localization at the same time. Our model predicts higher-dimensional
interactions $|H|^{2n}(F_{\mu\nu})^2$ in the low-energy effective theory. This
leads to two expectations: The one is a new tree-level contribution to $H \to
\gamma\gamma$ ($H \to gg$) decay whose signature is testable in future LHC
experiment. The other is a finite electroweak monopole which may be accessible
to the MoEDAL experiment. Interactions of translational Nambu-Goldstone boson
is shown to satisfy a low-energy theorem.
| hep-ph hep-th | we propose a minimal and selfcontained model in noncompact flat five dimensions which localizes the standard model sm on a domain wall localization of gauge fields is achieved by the condensation of higgs field via a higgs dependent gauge kinetic term in fivedimensional lagrangian the domain wall connecting vacua with unbroken gauge symmetry drives the higgs condensation which provides both electroweak symmetry breaking and gauge field localization at the same time our model predicts higherdimensional interactions h2nf_munu2 in the lowenergy effective theory this leads to two expectations the one is a new treelevel contribution to h to gammagamma h to gg decay whose signature is testable in future lhc experiment the other is a finite electroweak monopole which may be accessible to the moedal experiment interactions of translational nambugoldstone boson is shown to satisfy a lowenergy theorem | [['we', 'propose', 'a', 'minimal', 'and', 'selfcontained', 'model', 'in', 'noncompact', 'flat', 'five', 'dimensions', 'which', 'localizes', 'the', 'standard', 'model', 'sm', 'on', 'a', 'domain', 'wall', 'localization', 'of', 'gauge', 'fields', 'is', 'achieved', 'by', 'the', 'condensation', 'of', 'higgs', 'field', 'via', 'a', 'higgs', 'dependent', 'gauge', 'kinetic', 'term', 'in', 'fivedimensional', 'lagrangian', 'the', 'domain', 'wall', 'connecting', 'vacua', 'with', 'unbroken', 'gauge', 'symmetry', 'drives', 'the', 'higgs', 'condensation', 'which', 'provides', 'both', 'electroweak', 'symmetry', 'breaking', 'and', 'gauge', 'field', 'localization', 'at', 'the', 'same', 'time', 'our', 'model', 'predicts', 'higherdimensional', 'interactions', 'h2nf_munu2', 'in', 'the', 'lowenergy', 'effective', 'theory', 'this', 'leads', 'to', 'two', 'expectations', 'the', 'one', 'is', 'a', 'new', 'treelevel', 'contribution', 'to', 'h', 'to', 'gammagamma', 'h', 'to', 'gg', 'decay', 'whose', 'signature', 'is', 'testable', 'in', 'future', 'lhc', 'experiment', 'the', 'other', 'is', 'a', 'finite', 'electroweak', 'monopole', 'which', 'may', 'be', 'accessible', 'to', 'the', 'moedal', 'experiment', 'interactions', 'of', 'translational', 'nambugoldstone', 'boson', 'is', 'shown', 'to', 'satisfy', 'a', 'lowenergy', 'theorem']] | [-0.1459715901848326, 0.2815579760559451, -0.09125620233638021, 0.13727029537275323, -0.1365976397287073, -0.20579561041599578, -0.01970266941369867, 0.3196676352424273, -0.2035822693792665, -0.25102092177001073, 0.02274783719022868, -0.24712006708004458, -0.0658588936614037, 0.06642852805260405, 0.02422154731774593, 0.029204946483814102, 0.0028059084006064735, 0.056378624838544056, -0.03713188920108437, -0.24813202708837173, 0.27238180615377666, 0.015645521786716604, 0.2831289690289208, 0.10839953221832677, 0.08264543597504277, 0.008885108992484781, 0.012968752053840196, -0.055732418187236524, -0.11881252674035803, 0.1063684016425053, 0.1879325694308671, 0.010316416741047493, 0.12133072504280683, -0.36911717068184824, -0.19329925223941888, 0.1286911758070346, 0.17636404350153445, 0.1726575674418949, -0.05868360907548135, -0.35337774436373043, 0.07105822423738359, -0.17991868950604625, -0.14107713753850581, -0.06473994301460848, -0.05882367295356851, -0.1697944414884071, -0.3332377806689371, 0.07507341547063655, 0.0012950147031327052, 0.06310018097899635, -0.012939057689543594, -0.042496545767575944, -0.08538683747824774, 0.007969520886356751, 0.1676708173498114, 0.09948294317034785, 0.15241263206082614, -0.20505774193546078, -0.16279697665638249, 0.43441295677193387, -0.12245341455940541, -0.19579186234178075, 0.1944557371111039, -0.14376054723705986, -0.12280724358456876, 0.15802774684305085, 0.13759855064649051, 0.07674989342579946, -0.14708750475513035, 0.2406085543531363, -0.025928702616297147, 0.14409945587463238, 0.03296893313937985, 0.023825878575307262, 0.2619518797762473, 0.17717674434157638, 0.06583451684084995, 0.09400240049367045, -0.015401528516496696, -0.12352098694057478, -0.469147676766357, -0.12416969716329784, -0.11403790924883009, 0.07014133134062457, -0.07560112170754377, -0.1383599366807389, 0.39869297209524496, 0.12482375072346151, 0.20540235441534177, 0.03591324659732088, 0.2281013366608771, 0.0903769679584109, 0.1276730002136901, -0.013020268665380119, 0.29546973692349104, 0.13813161431137225, 0.0878229061148458, -0.23449321501710288, -0.1058063818662263, 0.1669219897936701] |
1,802.0665 | On a saddle point problem arising from magneto-elastic coupling | This paper deals with the analysis of a coupled problem arising from linear
magneto-elastostaticity. The model, which can be derived by an energy
principle, gives valuable insight into the coupling mechanism and features a
saddle point structure with the elastic displacement and magnetic scalar
potential as independent variables. As main results, the existence and
uniqueness of the solution are proven for the continuous and discrete cases and
special properties of the corresponding bilinear forms are shown. In
particular, the coupled magneto-elastic bilinear form satisfies an inf-sup
condition that is essential for the stability of the problem.
| math.AP | this paper deals with the analysis of a coupled problem arising from linear magnetoelastostaticity the model which can be derived by an energy principle gives valuable insight into the coupling mechanism and features a saddle point structure with the elastic displacement and magnetic scalar potential as independent variables as main results the existence and uniqueness of the solution are proven for the continuous and discrete cases and special properties of the corresponding bilinear forms are shown in particular the coupled magnetoelastic bilinear form satisfies an infsup condition that is essential for the stability of the problem | [['this', 'paper', 'deals', 'with', 'the', 'analysis', 'of', 'a', 'coupled', 'problem', 'arising', 'from', 'linear', 'magnetoelastostaticity', 'the', 'model', 'which', 'can', 'be', 'derived', 'by', 'an', 'energy', 'principle', 'gives', 'valuable', 'insight', 'into', 'the', 'coupling', 'mechanism', 'and', 'features', 'a', 'saddle', 'point', 'structure', 'with', 'the', 'elastic', 'displacement', 'and', 'magnetic', 'scalar', 'potential', 'as', 'independent', 'variables', 'as', 'main', 'results', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'solution', 'are', 'proven', 'for', 'the', 'continuous', 'and', 'discrete', 'cases', 'and', 'special', 'properties', 'of', 'the', 'corresponding', 'bilinear', 'forms', 'are', 'shown', 'in', 'particular', 'the', 'coupled', 'magnetoelastic', 'bilinear', 'form', 'satisfies', 'an', 'infsup', 'condition', 'that', 'is', 'essential', 'for', 'the', 'stability', 'of', 'the', 'problem']] | [-0.1399664564340032, 0.07646339853986558, -0.08627196223916192, 0.047910255007445814, -0.08482714443908711, -0.12370062445927607, -0.014306932666927183, 0.2848022867165702, -0.33592674093517033, -0.2507344243165694, 0.1295509537816734, -0.2590424796100706, -0.17750928566644067, 0.1998760574619825, 0.0020881090901399913, 0.06021383674325127, 0.047419957806797405, 0.060794915626511764, -0.05000759433023631, -0.1749652992762429, 0.3677316419584186, 0.021944495623833254, 0.2765808754061398, 0.08174778327934051, 0.12418706542567202, 0.013533445847171702, 0.0272808919807798, 0.01878803567851719, -0.10807627776528916, 0.1193778239068036, 0.21145175740514932, 0.058067153951101076, 0.26913882839580766, -0.42464359522257983, -0.19684675983030742, 0.11199842154685603, 0.1139568000345638, 0.07914013787031811, -0.07781798260188416, -0.2723205915407131, 0.08426095945270438, -0.08672411018296292, -0.18165077768560303, -0.1103183421355329, -0.032645609969959445, 0.05500632556351392, -0.34861389932676073, 0.10070096662905263, 0.11452387673780322, 0.014168548711428516, -0.1638484710435334, -0.0955176893817751, -0.04977140368060454, 0.10323228823315156, 0.08585236506953248, 0.007088299625014004, 0.04166609214520768, -0.11703082943384192, -0.0738741164353039, 0.399165174796393, -0.05746273891510148, -0.2358678721969849, 0.16353468053582076, -0.03432132760185356, -0.11661587369530217, 0.11256390355747978, 0.16806073594152143, 0.11178949879188287, -0.18264141994540728, 0.13575802334326956, -0.0641821388608629, 0.1453091151929632, 0.033017426199818914, 0.05996341145548381, 0.19439236623921285, 0.14779890619193842, 0.09273947291443811, 0.17987735573520983, -0.028042494565689642, -0.13109602464461012, -0.3583472708338185, -0.14014237068936622, -0.1362012245349194, 0.050657045156204776, -0.1181698713640033, -0.1671092495919622, 0.3969950855047883, 0.08267310188691082, 0.1781435210221006, 0.027375149228119927, 0.25083544477820396, 0.18243599555847284, 0.02393372726724728, 0.03735128133802822, 0.25989445658694754, 0.20710677454542173, 0.0885808893087271, -0.21650654151300458, 0.05345467989774127, 0.11247188979759812] |
1,802.06651 | CalcuList: a Functional Language Extended with Imperative Features | CalcuList (Calculator with List manipulation), is an educational language for
teaching functional programming extended with some imperative and side-effect
features, which are enabled under explicit request by the programmer. In
addition to strings and lists, the language natively supports json objects. The
language adopts a Python-like syntax and enables interactive computation
sessions with the user through a REPL (Read-Evaluate-Print-Loop) shell. The
object code produced by a compilation is a program that will be eventually
executed by the CalcuList Virtual Machine (CLVM).
| cs.PL | calculist calculator with list manipulation is an educational language for teaching functional programming extended with some imperative and sideeffect features which are enabled under explicit request by the programmer in addition to strings and lists the language natively supports json objects the language adopts a pythonlike syntax and enables interactive computation sessions with the user through a repl readevaluateprintloop shell the object code produced by a compilation is a program that will be eventually executed by the calculist virtual machine clvm | [['calculist', 'calculator', 'with', 'list', 'manipulation', 'is', 'an', 'educational', 'language', 'for', 'teaching', 'functional', 'programming', 'extended', 'with', 'some', 'imperative', 'and', 'sideeffect', 'features', 'which', 'are', 'enabled', 'under', 'explicit', 'request', 'by', 'the', 'programmer', 'in', 'addition', 'to', 'strings', 'and', 'lists', 'the', 'language', 'natively', 'supports', 'json', 'objects', 'the', 'language', 'adopts', 'a', 'pythonlike', 'syntax', 'and', 'enables', 'interactive', 'computation', 'sessions', 'with', 'the', 'user', 'through', 'a', 'repl', 'readevaluateprintloop', 'shell', 'the', 'object', 'code', 'produced', 'by', 'a', 'compilation', 'is', 'a', 'program', 'that', 'will', 'be', 'eventually', 'executed', 'by', 'the', 'calculist', 'virtual', 'machine', 'clvm']] | [-0.10228832144486277, 0.053684802562202094, -0.10739065369738168, 0.08359665951023712, -0.21122128094889617, -0.20832898434079988, 0.10044740267882221, 0.41526580273516867, -0.27896955717158944, -0.37419158248629075, 0.07147754777657897, -0.2450105384984789, -0.08832651770085488, 0.18401123819211007, -0.08188553933800186, 0.03655071210845275, 0.1239091505933749, 0.04740620495163297, -0.008092124477690575, -0.2522332925214677, 0.29395344928152073, 0.08772992144191735, 0.22711555825509622, 0.01269942290673498, 0.057227968900023324, 0.05108956131152809, -0.05360947839768702, -0.006194848992316493, -0.022503164171499328, 0.17838984115147277, 0.3778791161205031, 0.3006953843011472, 0.2919049503183679, -0.4470990658982804, -0.1347593378833201, -0.057825360493121765, 0.11771051642656523, 0.12098025828201667, -0.054601171107558334, -0.34166975106161673, 0.10403725181363131, -0.2437500591193767, -0.004947383845175959, -0.09607355105445574, 0.0260727646282727, -0.0017890282784049447, -0.23822277639287917, -0.13494292101945335, 0.0749185800308815, 0.1370153011797045, -0.007852938058357196, -0.03227346823060591, -0.010013005218321555, 0.12461828905476355, -0.006585183020338024, 0.08373040359736861, 0.16819390444403612, -0.11199086011191339, -0.1782650961578934, 0.4187980331480503, -0.026336785877662663, -0.20079169157083684, 0.20890153001221878, 0.024856401196877032, -0.14474530202508168, 0.13496042627498114, 0.1481408993774829, 0.08536287263574961, -0.19595833263654067, 0.11704230249482575, 0.008637557732359519, 0.2696911356148408, 0.07042365627191764, -0.022010987428458112, 0.27690724410900946, 0.1904643550515175, -0.026198673981094833, 0.18815572765551655, 0.0016608891126356628, -0.0487443893951805, -0.27443401093937847, -0.21177820900399974, -0.10152563119405195, -0.0697041875146648, -0.0564244207552723, -0.16872339913817613, 0.3428967219262727, 0.11795019143947254, 0.06100297041274117, 0.13209346716604686, 0.3199450745259559, 0.019361118871050787, 0.1689594488860549, 0.15211722696365446, 0.03973244442864885, -0.004407088024125092, 0.17798962980190194, -0.15151747878438696, 0.14724206077670188, 0.056745292294133255] |
1,802.06652 | Matrix Exponential Learning Schemes with Low Informational Exchange | We consider a distributed resource allocation problem in networks where each
transmitter-receiver pair aims at maximizing its local utility function by
adjusting its action matrix, which belongs to a given feasible set. This
problem has been addressed recently by applying a matrix exponential learning
(MXL) algorithm which has a very appealing convergence rate. In this learning
algorithm, however, each transmitter must know an estimate of the gradient
matrix of the local utility. The knowledge of the gradient matrix at the
transmitters incurs a high signaling overhead especially that the matrix size
increases with the dimension of the action matrix. In this paper, we therefore
investigate two strategies in order to decrease the informational exchange per
iteration of the algorithm. In the first strategy, each receiver sends at each
iteration part of the elements of the gradient matrix with respect to a certain
probability. In the second strategy, each receiver feeds back sporadically the
whole gradient matrix. We focus on the analysis of the convergence of the MXL
algorithm to optimum under these two strategies. We prove that the algorithm
can still converge to optimum almost surely. Upper bounds of the average
convergence rate are also derived in both situations with general step-size
setting, from which we can clearly see the impact of the incompleteness of the
feedback information. The proposed algorithms are applied to solve the energy
efficiency maximization problem in a multicarrier multi-user MIMO network.
Simulation results further corroborate our claim.
| cs.IT cs.GT math.IT | we consider a distributed resource allocation problem in networks where each transmitterreceiver pair aims at maximizing its local utility function by adjusting its action matrix which belongs to a given feasible set this problem has been addressed recently by applying a matrix exponential learning mxl algorithm which has a very appealing convergence rate in this learning algorithm however each transmitter must know an estimate of the gradient matrix of the local utility the knowledge of the gradient matrix at the transmitters incurs a high signaling overhead especially that the matrix size increases with the dimension of the action matrix in this paper we therefore investigate two strategies in order to decrease the informational exchange per iteration of the algorithm in the first strategy each receiver sends at each iteration part of the elements of the gradient matrix with respect to a certain probability in the second strategy each receiver feeds back sporadically the whole gradient matrix we focus on the analysis of the convergence of the mxl algorithm to optimum under these two strategies we prove that the algorithm can still converge to optimum almost surely upper bounds of the average convergence rate are also derived in both situations with general stepsize setting from which we can clearly see the impact of the incompleteness of the feedback information the proposed algorithms are applied to solve the energy efficiency maximization problem in a multicarrier multiuser mimo network simulation results further corroborate our claim | [['we', 'consider', 'a', 'distributed', 'resource', 'allocation', 'problem', 'in', 'networks', 'where', 'each', 'transmitterreceiver', 'pair', 'aims', 'at', 'maximizing', 'its', 'local', 'utility', 'function', 'by', 'adjusting', 'its', 'action', 'matrix', 'which', 'belongs', 'to', 'a', 'given', 'feasible', 'set', 'this', 'problem', 'has', 'been', 'addressed', 'recently', 'by', 'applying', 'a', 'matrix', 'exponential', 'learning', 'mxl', 'algorithm', 'which', 'has', 'a', 'very', 'appealing', 'convergence', 'rate', 'in', 'this', 'learning', 'algorithm', 'however', 'each', 'transmitter', 'must', 'know', 'an', 'estimate', 'of', 'the', 'gradient', 'matrix', 'of', 'the', 'local', 'utility', 'the', 'knowledge', 'of', 'the', 'gradient', 'matrix', 'at', 'the', 'transmitters', 'incurs', 'a', 'high', 'signaling', 'overhead', 'especially', 'that', 'the', 'matrix', 'size', 'increases', 'with', 'the', 'dimension', 'of', 'the', 'action', 'matrix', 'in', 'this', 'paper', 'we', 'therefore', 'investigate', 'two', 'strategies', 'in', 'order', 'to', 'decrease', 'the', 'informational', 'exchange', 'per', 'iteration', 'of', 'the', 'algorithm', 'in', 'the', 'first', 'strategy', 'each', 'receiver', 'sends', 'at', 'each', 'iteration', 'part', 'of', 'the', 'elements', 'of', 'the', 'gradient', 'matrix', 'with', 'respect', 'to', 'a', 'certain', 'probability', 'in', 'the', 'second', 'strategy', 'each', 'receiver', 'feeds', 'back', 'sporadically', 'the', 'whole', 'gradient', 'matrix', 'we', 'focus', 'on', 'the', 'analysis', 'of', 'the', 'convergence', 'of', 'the', 'mxl', 'algorithm', 'to', 'optimum', 'under', 'these', 'two', 'strategies', 'we', 'prove', 'that', 'the', 'algorithm', 'can', 'still', 'converge', 'to', 'optimum', 'almost', 'surely', 'upper', 'bounds', 'of', 'the', 'average', 'convergence', 'rate', 'are', 'also', 'derived', 'in', 'both', 'situations', 'with', 'general', 'stepsize', 'setting', 'from', 'which', 'we', 'can', 'clearly', 'see', 'the', 'impact', 'of', 'the', 'incompleteness', 'of', 'the', 'feedback', 'information', 'the', 'proposed', 'algorithms', 'are', 'applied', 'to', 'solve', 'the', 'energy', 'efficiency', 'maximization', 'problem', 'in', 'a', 'multicarrier', 'multiuser', 'mimo', 'network', 'simulation', 'results', 'further', 'corroborate', 'our', 'claim']] | [-0.13006894532514135, 0.02007016508551632, -0.07620111379237492, 0.024198899186535717, -0.05181380869889986, -0.1798581253979663, 0.10478272503059095, 0.3909177473507637, -0.31072951289863626, -0.2636760895687429, 0.12197451248056879, -0.25205542679783727, -0.17546681238916578, 0.11809590088649968, -0.10035634579036908, 0.06418337336547042, 0.06090856679669035, 0.0892206635893792, -0.07153113013588484, -0.3095673599621004, 0.2931954274218614, 0.0984453405619191, 0.307823712038923, 0.021740684257618204, 0.14043484401527392, -0.007789883328686384, -0.012467033144140478, -0.013521933781891322, -0.08585976886791263, 0.10452100278185257, 0.27788437155560275, 0.2020064504684357, 0.3736490333368155, -0.38926378412226076, -0.17657880347283664, 0.1498661957708118, 0.15648847996990373, 0.09918319069624547, -0.05262579972334283, -0.2305528467630752, 0.12494041134068389, -0.16847518363136274, -0.06398497366604745, -0.0038028359605568993, -0.0620077280924186, 0.03649322260185757, -0.33961870752213413, 0.024396084369163122, 0.022828779788495405, -0.005655015302241841, -0.060108560236548036, -0.13433209306912589, 0.031823008350088944, 0.14484991736889025, 0.05002929074526187, 0.02116860804092216, 0.13303819310289522, -0.09522125766947404, -0.10916944619552964, 0.34222975345655565, -0.05196521129634247, -0.22641671960211304, 0.12383829834042377, -0.10970566221508044, -0.1426897643059194, 0.15363317449415517, 0.20753137767820018, 0.11754497821050242, -0.14723051648802502, 0.08186966009786321, -0.04381514658616502, 0.1624200215581458, 0.04597237999820389, 0.03921999449361585, 0.11297002999008102, 0.16176130628013166, 0.16711968016687564, 0.15528540850197511, -0.06751130435332918, -0.1190212777149979, -0.25724022181643064, -0.12848450371000747, -0.23731308473728227, 0.005336541938884107, -0.13624566664903864, -0.08793747742912417, 0.38197078404722984, 0.1599368042098974, 0.1868643318841711, 0.11335892250043655, 0.34338514690772315, 0.1394308872241551, 0.04070789267983449, 0.14177368134836843, 0.21336531769272618, 0.11417210623833605, 0.11680932722847201, -0.25063304282536764, 0.11648136807109176, 0.07110048094687384] |
1,802.06653 | A Type-Based Complexity Analysis of Object Oriented Programs | A type system is introduced for a generic Object Oriented programming
language in order to infer resource upper bounds. A sound andcomplete
characterization of the set of polynomial time computable functions is
obtained. As a consequence, the heap-space and thestack-space requirements of
typed programs are also bounded polynomially. This type system is inspired by
previous works on ImplicitComputational Complexity, using tiering and
non-interference techniques. The presented methodology has several advantages.
First, itprovides explicit big $O$ polynomial upper bounds to the programmer,
hence its use could allow the programmer to avoid memory errors.Second, type
checking is decidable in polynomial time. Last, it has a good expressivity
since it analyzes most object oriented featureslike inheritance, overload,
override and recursion. Moreover it can deal with loops guarded by objects and
can also be extended tostatements that alter the control flow like break or
return.
| cs.PL cs.LO | a type system is introduced for a generic object oriented programming language in order to infer resource upper bounds a sound andcomplete characterization of the set of polynomial time computable functions is obtained as a consequence the heapspace and thestackspace requirements of typed programs are also bounded polynomially this type system is inspired by previous works on implicitcomputational complexity using tiering and noninterference techniques the presented methodology has several advantages first itprovides explicit big o polynomial upper bounds to the programmer hence its use could allow the programmer to avoid memory errorssecond type checking is decidable in polynomial time last it has a good expressivity since it analyzes most object oriented featureslike inheritance overload override and recursion moreover it can deal with loops guarded by objects and can also be extended tostatements that alter the control flow like break or return | [['a', 'type', 'system', 'is', 'introduced', 'for', 'a', 'generic', 'object', 'oriented', 'programming', 'language', 'in', 'order', 'to', 'infer', 'resource', 'upper', 'bounds', 'a', 'sound', 'andcomplete', 'characterization', 'of', 'the', 'set', 'of', 'polynomial', 'time', 'computable', 'functions', 'is', 'obtained', 'as', 'a', 'consequence', 'the', 'heapspace', 'and', 'thestackspace', 'requirements', 'of', 'typed', 'programs', 'are', 'also', 'bounded', 'polynomially', 'this', 'type', 'system', 'is', 'inspired', 'by', 'previous', 'works', 'on', 'implicitcomputational', 'complexity', 'using', 'tiering', 'and', 'noninterference', 'techniques', 'the', 'presented', 'methodology', 'has', 'several', 'advantages', 'first', 'itprovides', 'explicit', 'big', 'o', 'polynomial', 'upper', 'bounds', 'to', 'the', 'programmer', 'hence', 'its', 'use', 'could', 'allow', 'the', 'programmer', 'to', 'avoid', 'memory', 'errorssecond', 'type', 'checking', 'is', 'decidable', 'in', 'polynomial', 'time', 'last', 'it', 'has', 'a', 'good', 'expressivity', 'since', 'it', 'analyzes', 'most', 'object', 'oriented', 'featureslike', 'inheritance', 'overload', 'override', 'and', 'recursion', 'moreover', 'it', 'can', 'deal', 'with', 'loops', 'guarded', 'by', 'objects', 'and', 'can', 'also', 'be', 'extended', 'tostatements', 'that', 'alter', 'the', 'control', 'flow', 'like', 'break', 'or', 'return']] | [-0.13323471943420687, 0.04280960199220064, -0.08183586044951265, 0.10718786813182182, -0.1840879787880003, -0.20583405642581165, 0.06833078197546695, 0.35094346649440605, -0.31919576812805117, -0.32152124583595115, 0.15419506433041752, -0.19893582745742305, -0.11185265100855184, 0.22140683171941541, -0.13907120468557105, 0.06812685204335467, 0.05351385574952412, 0.04893112983869711, -0.04041276375511031, -0.28291970001239525, 0.2767309111812593, 0.014486524798116065, 0.21810287482427307, 0.04774507735260671, 0.06304993961510577, -0.031803981887694815, -0.025578061299034414, 0.04765985633029526, -0.1053821533427445, 0.1307347245300819, 0.2985467095771818, 0.23323681620404796, 0.2570880400647122, -0.4376383965512864, -0.16879752717029892, 0.10609017572491745, 0.15875094307278445, 0.09087518239183758, -0.010450131358767868, -0.2735793637041759, 0.11871366171320354, -0.19290588752723725, -0.09592804532232029, -0.09761963690862172, 0.047520934810679885, 0.005792129266642986, -0.23170959237259217, -0.03877663811278369, 0.12168327169632889, 0.06372233514483192, -0.01684315870183387, -0.05986521367676892, -0.0037545282551248497, 0.09541385506167728, 0.0035227341647434953, 0.04853164491810857, 0.10569572821259499, -0.08305594040592082, -0.15801282765088195, 0.3422866064032778, -0.0430987408775066, -0.20830728417556538, 0.2128303960049735, -0.059849159128585815, -0.1807989184954729, 0.1180473064791054, 0.14383333947253937, 0.11248781517519146, -0.15043026332820492, 0.16004902058407047, -0.04261648866761112, 0.2164823496084016, 0.1240681497471169, 0.045950637699658035, 0.13884482013159677, 0.17099304652695818, 0.0803590201863781, 0.16114616224846864, 0.025121441183618753, -0.06431986430057682, -0.27890477599085944, -0.16829061395352132, -0.1421434267886207, -0.02624176183358339, -0.08982690711482953, -0.16447164694764616, 0.35271375023416784, 0.1348886510525319, 0.12333365230772056, 0.16409450980197443, 0.3077996185634117, 0.15036696804649305, 0.11195919987976663, 0.09770210483286501, 0.14428501055817491, 0.0955458594086979, 0.12812211327438586, -0.1734453367858887, 0.1796916614328616, 0.1156860492405564] |
1,802.06654 | Globular cluster chemistry in fast rotating dwarf stars belonging to
intermediate age open clusters | (shortened) The peculiar chemistry observed in the multiple populations of
Galactic globular clusters is not generally found in other systems like dwarf
galaxies and open clusters, and at the moment no model can fully explain its
presence. Exploring the boundaries of the multiple population phenomenon and
the variation of its extent in the space of cluster mass, age, metallicity, and
compactness has proven to be a fruitful line of investigation. In the framework
of a larger project to search for multiple population in open clusters, based
on literature and survey data, I found peculiar chemical abundance patterns in
a sample of intermediate age open clusters with publicly available data. More
specifically, fast rotating dwarf stars (v sini > 50km/s) belonging to four
clusters display a bimodality in either [Na/Fe], [O/Fe] or both. Additionally,
two clusters show a Na-O anticorrelation in the fast rotating stars and one
cluster shows a large [Mg/Fe] variation among the stars with high [Na/Fe],
reaching the extreme Mg depletion observed in NGC 2808. Even considering that
the sample sizes are small, these patterns call for attention in the light of a
possible connection with the multiple population phenomenon of globular
clusters. The specific chemistry observed in these fast rotating dwarf stars is
thought to be produced by a complex interplay of different diffusion and mixing
mechanisms, like rotational mixing and mass loss, in turn influenced by
metallicity, binarity, mass, age, variability, and so on. However, with the
sample in hand, it was not possible to identify which stellar parameters cause
the observed Na and O bimodality and Na-O anticorrelation, suggesting that
other stellar properties might be important besides stellar rotation.
| astro-ph.SR | shortened the peculiar chemistry observed in the multiple populations of galactic globular clusters is not generally found in other systems like dwarf galaxies and open clusters and at the moment no model can fully explain its presence exploring the boundaries of the multiple population phenomenon and the variation of its extent in the space of cluster mass age metallicity and compactness has proven to be a fruitful line of investigation in the framework of a larger project to search for multiple population in open clusters based on literature and survey data i found peculiar chemical abundance patterns in a sample of intermediate age open clusters with publicly available data more specifically fast rotating dwarf stars v sini 50kms belonging to four clusters display a bimodality in either nafe ofe or both additionally two clusters show a nao anticorrelation in the fast rotating stars and one cluster shows a large mgfe variation among the stars with high nafe reaching the extreme mg depletion observed in ngc 2808 even considering that the sample sizes are small these patterns call for attention in the light of a possible connection with the multiple population phenomenon of globular clusters the specific chemistry observed in these fast rotating dwarf stars is thought to be produced by a complex interplay of different diffusion and mixing mechanisms like rotational mixing and mass loss in turn influenced by metallicity binarity mass age variability and so on however with the sample in hand it was not possible to identify which stellar parameters cause the observed na and o bimodality and nao anticorrelation suggesting that other stellar properties might be important besides stellar rotation | [['shortened', 'the', 'peculiar', 'chemistry', 'observed', 'in', 'the', 'multiple', 'populations', 'of', 'galactic', 'globular', 'clusters', 'is', 'not', 'generally', 'found', 'in', 'other', 'systems', 'like', 'dwarf', 'galaxies', 'and', 'open', 'clusters', 'and', 'at', 'the', 'moment', 'no', 'model', 'can', 'fully', 'explain', 'its', 'presence', 'exploring', 'the', 'boundaries', 'of', 'the', 'multiple', 'population', 'phenomenon', 'and', 'the', 'variation', 'of', 'its', 'extent', 'in', 'the', 'space', 'of', 'cluster', 'mass', 'age', 'metallicity', 'and', 'compactness', 'has', 'proven', 'to', 'be', 'a', 'fruitful', 'line', 'of', 'investigation', 'in', 'the', 'framework', 'of', 'a', 'larger', 'project', 'to', 'search', 'for', 'multiple', 'population', 'in', 'open', 'clusters', 'based', 'on', 'literature', 'and', 'survey', 'data', 'i', 'found', 'peculiar', 'chemical', 'abundance', 'patterns', 'in', 'a', 'sample', 'of', 'intermediate', 'age', 'open', 'clusters', 'with', 'publicly', 'available', 'data', 'more', 'specifically', 'fast', 'rotating', 'dwarf', 'stars', 'v', 'sini', '50kms', 'belonging', 'to', 'four', 'clusters', 'display', 'a', 'bimodality', 'in', 'either', 'nafe', 'ofe', 'or', 'both', 'additionally', 'two', 'clusters', 'show', 'a', 'nao', 'anticorrelation', 'in', 'the', 'fast', 'rotating', 'stars', 'and', 'one', 'cluster', 'shows', 'a', 'large', 'mgfe', 'variation', 'among', 'the', 'stars', 'with', 'high', 'nafe', 'reaching', 'the', 'extreme', 'mg', 'depletion', 'observed', 'in', 'ngc', '2808', 'even', 'considering', 'that', 'the', 'sample', 'sizes', 'are', 'small', 'these', 'patterns', 'call', 'for', 'attention', 'in', 'the', 'light', 'of', 'a', 'possible', 'connection', 'with', 'the', 'multiple', 'population', 'phenomenon', 'of', 'globular', 'clusters', 'the', 'specific', 'chemistry', 'observed', 'in', 'these', 'fast', 'rotating', 'dwarf', 'stars', 'is', 'thought', 'to', 'be', 'produced', 'by', 'a', 'complex', 'interplay', 'of', 'different', 'diffusion', 'and', 'mixing', 'mechanisms', 'like', 'rotational', 'mixing', 'and', 'mass', 'loss', 'in', 'turn', 'influenced', 'by', 'metallicity', 'binarity', 'mass', 'age', 'variability', 'and', 'so', 'on', 'however', 'with', 'the', 'sample', 'in', 'hand', 'it', 'was', 'not', 'possible', 'to', 'identify', 'which', 'stellar', 'parameters', 'cause', 'the', 'observed', 'na', 'and', 'o', 'bimodality', 'and', 'nao', 'anticorrelation', 'suggesting', 'that', 'other', 'stellar', 'properties', 'might', 'be', 'important', 'besides', 'stellar', 'rotation']] | [-0.07122545777146291, 0.15083676799722426, -0.07364830817351793, 0.14550274845567487, -0.08920731401218497, -0.09955377935264738, 0.07408523885362642, 0.4408547900917329, -0.19644082307277397, -0.3903523261757779, 0.025580119996181528, -0.2585551775045243, -0.05977238752839118, 0.1937506428686049, -0.06317104900904186, -0.05856141415526988, 0.09561341735935214, -0.027419683586587727, -0.013751155756083027, -0.2670215769183068, 0.3112985787046698, 0.012019931477103929, 0.1946286422425656, -0.04732241665077952, 0.002791443908750847, -0.12281651624679675, -0.05826868796584643, 0.018626852106749022, -0.09959931115752245, 0.044069002756222934, 0.23581672054817798, 0.14041105679819707, 0.22727856091172485, -0.3438759791548204, -0.21626755614822982, 0.08343460500554178, 0.23614656990786312, 0.05885976565713506, -0.14099014125878012, -0.2586938480154915, 0.03959583858839977, -0.13805726471002258, -0.20114713502645273, 0.04900826256715389, 0.08469033555721271, 0.038051292003002765, -0.21060030147238828, 0.15272204120619556, 0.039311616662113615, 0.12727210230889965, -0.11031364813507125, -0.14440727494883046, -0.07700852138730578, 0.11022383652818508, 0.032042539991193615, 0.046188722379103084, 0.13787624435396967, -0.10106124140786164, -0.014455249115582488, 0.4043842982978393, -0.07614840601226348, -0.05225804176182834, 0.2647161745473115, -0.21816795870351294, -0.19761316818969782, 0.06267956675639233, 0.1740893205378764, 0.10998635997675059, -0.19924459882394407, 0.0038903921558146428, -0.018097207596655184, 0.207751345775097, 0.05551308261967459, 0.061163210841799806, 0.29260927361466893, 0.13985251362142137, 0.03471278861649471, 0.05515444944395203, -0.1873025876476733, -0.0914296855652814, -0.15543549440821613, -0.11381609136777701, -0.0953816563179273, 0.03058709294141625, -0.14041971696495725, -0.17095742693969182, 0.31716842677328233, 0.10299334327368136, 0.23376889491109212, -0.007504932785358949, 0.2523838416929101, 0.04873519684503626, 0.14894711193645666, 0.10317278052117307, 0.26320602221673717, 0.1772470536723651, 0.08456519584345458, -0.29655081571946296, 0.14440292169104565, -0.0450875815085132] |
1,802.06655 | Tied Multitask Learning for Neural Speech Translation | We explore multitask models for neural translation of speech, augmenting them
in order to reflect two intuitive notions. First, we introduce a model where
the second task decoder receives information from the decoder of the first
task, since higher-level intermediate representations should provide useful
information. Second, we apply regularization that encourages transitivity and
invertibility. We show that the application of these notions on jointly trained
models improves performance on the tasks of low-resource speech transcription
and translation. It also leads to better performance when using attention
information for word discovery over unsegmented input.
| cs.CL | we explore multitask models for neural translation of speech augmenting them in order to reflect two intuitive notions first we introduce a model where the second task decoder receives information from the decoder of the first task since higherlevel intermediate representations should provide useful information second we apply regularization that encourages transitivity and invertibility we show that the application of these notions on jointly trained models improves performance on the tasks of lowresource speech transcription and translation it also leads to better performance when using attention information for word discovery over unsegmented input | [['we', 'explore', 'multitask', 'models', 'for', 'neural', 'translation', 'of', 'speech', 'augmenting', 'them', 'in', 'order', 'to', 'reflect', 'two', 'intuitive', 'notions', 'first', 'we', 'introduce', 'a', 'model', 'where', 'the', 'second', 'task', 'decoder', 'receives', 'information', 'from', 'the', 'decoder', 'of', 'the', 'first', 'task', 'since', 'higherlevel', 'intermediate', 'representations', 'should', 'provide', 'useful', 'information', 'second', 'we', 'apply', 'regularization', 'that', 'encourages', 'transitivity', 'and', 'invertibility', 'we', 'show', 'that', 'the', 'application', 'of', 'these', 'notions', 'on', 'jointly', 'trained', 'models', 'improves', 'performance', 'on', 'the', 'tasks', 'of', 'lowresource', 'speech', 'transcription', 'and', 'translation', 'it', 'also', 'leads', 'to', 'better', 'performance', 'when', 'using', 'attention', 'information', 'for', 'word', 'discovery', 'over', 'unsegmented', 'input']] | [-0.03818419293790896, 0.017212367446352076, -0.0583488365775475, 0.1121973815043607, -0.17867445690877815, -0.2123706802094896, 0.0572788182117786, 0.4636767298503909, -0.3003169123924548, -0.2967044780824474, 0.04149956328629126, -0.26726790286240076, -0.23375661488902824, 0.1897630389899977, -0.15840939842965654, 0.07806476435914475, 0.14236817966930077, 0.13722449821771762, -0.1084615161632418, -0.30618292650818746, 0.3299403658377067, 0.02905500014262494, 0.32106123454067653, 0.0251447549840856, 0.16258248285720905, -0.005350332627052902, -0.03430702738709227, -0.10569025179551493, -0.07046257909866155, 0.19256912506315657, 0.32516648761669276, 0.23358355669344785, 0.32045905637274424, -0.3837820455552109, -0.20843327155597108, 0.07776971322594471, 0.1318243148471279, 0.12043365244052663, 0.0025101580021161867, -0.34288689442059045, 0.10031790998814408, -0.18395508973989436, 0.12712682006249745, -0.16059833802082527, -0.06506460688267184, -0.035052717704656386, -0.2964877691019767, 0.03385966583824797, 0.16828179404938154, 0.07348715258331628, -0.07375297363927608, -0.09399848285141171, 0.00910023653439136, 0.21015484300999082, 0.06852793961798431, 0.04959895671470471, 0.10041192287118525, -0.1800150367761812, -0.15327904681845378, 0.37197062448267976, -0.07069775152085249, -0.26047855215046994, 0.18760716513059633, -0.031223007602997684, -0.21151730604970487, 0.033093492119943585, 0.27194492410748233, 0.052593522740187505, -0.14012503592245487, 0.00296213599147215, -0.029021287897741922, 0.22283291354930648, 0.08901901843567048, 0.04255615325108852, 0.16150851067410962, 0.25896294784271506, 0.018130477377644148, 0.20436636132178126, -0.08633463752927929, -0.06261387753791066, -0.2349657650275897, -0.11346646627130848, -0.15745768366351484, -0.039683856480624724, -0.08913955390822613, -0.09488420772005714, 0.41677592212073905, 0.2744548710123185, 0.19998416238995168, 0.17004977762498844, 0.3286100959265104, 0.013733598263433544, 0.10561646305785705, 0.09382655479449538, 0.15144760554195733, 0.026916819234048168, 0.1089428024484165, -0.1480474107008758, 0.1104067523352882, 0.11311815564911212] |
1,802.06656 | Cost-efficient QoS-Aware Data Acquisition Point Placement for Advanced
Metering Infrastructure | In an advanced metering infrastructure (AMI), data acquisition points (DAPs)
are responsible for collecting traffic from several smart meters and automated
devices and transmitting them to the utility control center. Although the
problem of optimized data collector placement has already been addressed for
wireless broadband and sensor networks, DAP placement is quite a new research
area for AMIs. In this paper, we investigate the minimum required number of
DAPs and their optimized locations on top of the existing utility poles in a
distribution grid such that smart grid quality of service requirements can best
be provided. In order to solve the problem for large-scale AMIs, we devise a
novel heuristic algorithm using a greedy approach for identifying potential
pole locations for DAP placement and the Dijkstra shortest path algorithm for
constructing reliable routes. We employ the characteristics of medium access
schemes from the IEEE 802.15.4g smart utility network (SUN) standard, and
consider mission-critical and non-critical smart grid traffic. The performance
and time-complexity of our algorithm are compared with those obtained by the
IBM CPLEX software for small scenarios. Finally, we apply our devised DAP
placement algorithm to examples of realistic smart grid AMI topologies.
| cs.NI | in an advanced metering infrastructure ami data acquisition points daps are responsible for collecting traffic from several smart meters and automated devices and transmitting them to the utility control center although the problem of optimized data collector placement has already been addressed for wireless broadband and sensor networks dap placement is quite a new research area for amis in this paper we investigate the minimum required number of daps and their optimized locations on top of the existing utility poles in a distribution grid such that smart grid quality of service requirements can best be provided in order to solve the problem for largescale amis we devise a novel heuristic algorithm using a greedy approach for identifying potential pole locations for dap placement and the dijkstra shortest path algorithm for constructing reliable routes we employ the characteristics of medium access schemes from the ieee 802154g smart utility network sun standard and consider missioncritical and noncritical smart grid traffic the performance and timecomplexity of our algorithm are compared with those obtained by the ibm cplex software for small scenarios finally we apply our devised dap placement algorithm to examples of realistic smart grid ami topologies | [['in', 'an', 'advanced', 'metering', 'infrastructure', 'ami', 'data', 'acquisition', 'points', 'daps', 'are', 'responsible', 'for', 'collecting', 'traffic', 'from', 'several', 'smart', 'meters', 'and', 'automated', 'devices', 'and', 'transmitting', 'them', 'to', 'the', 'utility', 'control', 'center', 'although', 'the', 'problem', 'of', 'optimized', 'data', 'collector', 'placement', 'has', 'already', 'been', 'addressed', 'for', 'wireless', 'broadband', 'and', 'sensor', 'networks', 'dap', 'placement', 'is', 'quite', 'a', 'new', 'research', 'area', 'for', 'amis', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'minimum', 'required', 'number', 'of', 'daps', 'and', 'their', 'optimized', 'locations', 'on', 'top', 'of', 'the', 'existing', 'utility', 'poles', 'in', 'a', 'distribution', 'grid', 'such', 'that', 'smart', 'grid', 'quality', 'of', 'service', 'requirements', 'can', 'best', 'be', 'provided', 'in', 'order', 'to', 'solve', 'the', 'problem', 'for', 'largescale', 'amis', 'we', 'devise', 'a', 'novel', 'heuristic', 'algorithm', 'using', 'a', 'greedy', 'approach', 'for', 'identifying', 'potential', 'pole', 'locations', 'for', 'dap', 'placement', 'and', 'the', 'dijkstra', 'shortest', 'path', 'algorithm', 'for', 'constructing', 'reliable', 'routes', 'we', 'employ', 'the', 'characteristics', 'of', 'medium', 'access', 'schemes', 'from', 'the', 'ieee', '802154g', 'smart', 'utility', 'network', 'sun', 'standard', 'and', 'consider', 'missioncritical', 'and', 'noncritical', 'smart', 'grid', 'traffic', 'the', 'performance', 'and', 'timecomplexity', 'of', 'our', 'algorithm', 'are', 'compared', 'with', 'those', 'obtained', 'by', 'the', 'ibm', 'cplex', 'software', 'for', 'small', 'scenarios', 'finally', 'we', 'apply', 'our', 'devised', 'dap', 'placement', 'algorithm', 'to', 'examples', 'of', 'realistic', 'smart', 'grid', 'ami', 'topologies']] | [-0.16209395517657843, -0.021642893395272634, -0.01323698873613862, 0.0479173934807364, -0.09320761714072734, -0.19182397464864495, 0.12224386510176227, 0.42577180725165253, -0.23645594776390902, -0.3771547538064266, 0.13997361355821133, -0.2708704651226627, -0.15044354026355428, 0.23210990812914167, -0.1238080066727677, 0.12915868563288002, 0.07338504178251666, -0.02887079621534891, 0.016659830052223434, -0.2678735653418623, 0.2566013095823208, 0.08165399552626931, 0.3505779171140546, 0.044956528273751295, 0.06922340676202945, 0.024009651977356543, -0.027889665228271267, 0.010028025405023035, -0.07462829582706375, 0.15158378232844713, 0.3150552888991977, 0.20109931291291372, 0.2844658668678968, -0.44717002296192965, -0.21059506948689877, 0.09941682465636253, 0.13370472246930581, 0.0666490862184624, -0.08160625875099933, -0.26905204865290094, 0.14085311764836736, -0.21938020568534036, -0.11536119485126478, -0.0352018584974998, -0.03719398221411197, 0.07844464156361673, -0.3175592465191076, -0.06127885939345883, -0.07597303581351675, 0.049978725725562924, -0.04729241594876382, -0.13576139469384915, 0.018982095682482027, 0.18401269522408709, -0.021783866402644837, -0.004335873449037884, 0.14378535224443273, -0.10109189010727089, -0.15816908733499443, 0.39880985839273103, 0.04704429758405023, -0.16472417483748047, 0.11915680160233269, 0.01915172031969604, -0.13240867714190113, 0.09563350279747938, 0.25092919230692745, 0.10448395233381771, -0.20503375677083055, 0.030611660278407095, 0.00998739209605159, 0.12953206533195158, 0.058105821576490614, 0.013119719787428416, 0.1794589573776888, 0.2529995125426472, 0.17317120072195413, 0.10840436493811424, -0.11178614231507497, -0.10527261814170087, -0.21010050175643954, -0.10962946375788532, -0.20665787943334854, -0.020742899092840793, -0.11397207661235097, -0.11005321990968804, 0.3831337981138359, 0.21732289420797882, 0.12491882376799872, 0.08968770686160638, 0.405456150702196, 0.05832292296057519, 0.07156538209362785, 0.15219084171390093, 0.15716656655776784, -0.006263846240773642, 0.20122301015626504, -0.17523786549123457, 0.049667401963101765, 0.05011068037204406] |
1,802.06657 | On the product formula and convolution associated with the index
Whittaker transform | We deduce a product formula for the Whittaker $W$ function whose kernel does
not depend on the second parameter. Making use of this formula, we define the
positivity-preserving convolution operator associated with the index Whittaker
transform, which is seen to be a direct generalization of the
Kontorovich-Lebedev convolution. The mapping properties of this convolution
operator are investigated; in particular, a Banach algebra property is
established and then applied to yield an analogue of the Wiener-L\'evy theorem
for the index Whittaker transform. We show how our results can be used to prove
the existence of a unique solution for a class of convolution-type integral
equations.
| math.CA | we deduce a product formula for the whittaker w function whose kernel does not depend on the second parameter making use of this formula we define the positivitypreserving convolution operator associated with the index whittaker transform which is seen to be a direct generalization of the kontorovichlebedev convolution the mapping properties of this convolution operator are investigated in particular a banach algebra property is established and then applied to yield an analogue of the wienerlevy theorem for the index whittaker transform we show how our results can be used to prove the existence of a unique solution for a class of convolutiontype integral equations | [['we', 'deduce', 'a', 'product', 'formula', 'for', 'the', 'whittaker', 'w', 'function', 'whose', 'kernel', 'does', 'not', 'depend', 'on', 'the', 'second', 'parameter', 'making', 'use', 'of', 'this', 'formula', 'we', 'define', 'the', 'positivitypreserving', 'convolution', 'operator', 'associated', 'with', 'the', 'index', 'whittaker', 'transform', 'which', 'is', 'seen', 'to', 'be', 'a', 'direct', 'generalization', 'of', 'the', 'kontorovichlebedev', 'convolution', 'the', 'mapping', 'properties', 'of', 'this', 'convolution', 'operator', 'are', 'investigated', 'in', 'particular', 'a', 'banach', 'algebra', 'property', 'is', 'established', 'and', 'then', 'applied', 'to', 'yield', 'an', 'analogue', 'of', 'the', 'wienerlevy', 'theorem', 'for', 'the', 'index', 'whittaker', 'transform', 'we', 'show', 'how', 'our', 'results', 'can', 'be', 'used', 'to', 'prove', 'the', 'existence', 'of', 'a', 'unique', 'solution', 'for', 'a', 'class', 'of', 'convolutiontype', 'integral', 'equations']] | [-0.07584987265559343, 0.026141721546082408, -0.16277515662659425, 0.10391547092988801, -0.14016055971240768, -0.09491990395158958, -0.015330339899474684, 0.35512573054382723, -0.36501948506786275, -0.17978836614817667, 0.13581716852730516, -0.2070643364523466, -0.1869443544598583, 0.2421570311103446, -0.08311442739795893, 0.04193067161563354, 0.06384989100759132, 0.07826283888649553, -0.12439661904220255, -0.20105796227625644, 0.35907210670232487, -0.00993900063174526, 0.24661048456954843, 0.059979333846758194, 0.1289398628197467, 0.03420373338471668, -0.04904482756347324, -0.04425843197476262, -0.14034814826356104, 0.14451908440633604, 0.2486467318488464, 0.08194118716010752, 0.24145260306361777, -0.35706110703400695, -0.15721618751278862, 0.16427098631930465, 0.10838312105401061, -0.007869974888028363, -0.03600211819446905, -0.26153520627233845, 0.0966304501455922, -0.21613330837303343, -0.18208704111076748, -0.09910999522365344, 0.013070796965621412, 0.0390291308106568, -0.34147438566791466, 0.049926676626245566, 0.11504634751830824, 0.000930589051327283, -0.10359189724281001, -0.08773667431132008, -0.013575269274252396, 0.08291048547163463, -0.005291771257851416, 0.02874965997538171, 0.07365122688217805, -0.08926746531729944, -0.10602331126686365, 0.32788852404337376, -0.09646763256079374, -0.28068329324909985, 0.11573366210527289, -0.15111971977883235, -0.1626617656707262, 0.05975580730368025, 0.10889349816940151, 0.14625431552009943, -0.103121595367646, 0.1416762962913848, -0.11265201406338467, 0.12733694519220778, 0.08421704596212994, 0.03455805569851341, 0.08158481987014127, 0.08466270427407625, 0.08384484681860507, 0.19386737533988288, -0.022147314388488527, -0.03280805201771168, -0.3361573744578681, -0.24598158008526438, -0.21542123149937162, 0.10070160188269466, -0.08178571664995196, -0.229735016298946, 0.41312320773991257, 0.10737580511844359, 0.1871886897357539, 0.11136904570314353, 0.1900658290004895, 0.2513224021856261, 0.10816551828667378, 0.02651466990713603, 0.1799487861795709, 0.221972757713117, 0.05374365879777962, -0.1422986202829074, 0.01855656477318217, 0.22574772766361442] |
1,802.06658 | High precision displacement sensing of monolithic piezoelectric disk
resonators using a single-electron transistor | A single-electron transistor (SET) can be used as an extremely sensitive
charge detector. Mechanical displacements can be converted into charge, and
hence, SETs can become sensitive detectors of mechanical oscillations. For
studying small-energy oscillations, an important approach to realize the
mechanical resonators is to use piezoelectric materials. Besides coupling to
traditional electric circuitry, the strain-generated piezoelectric charge
allows for measuring ultrasmall oscillations via SET detection. Here, we
explore the usage of SETs to detect the shear-mode oscillations of a
6-mm-diameter quartz disk resonator with a resonance frequency around 9 MHz. We
measure the mechanical oscillations using either a conventional DC SET, or use
the SET as a homodyne or heterodyne mixer, or finally, as a radio-frequency
single-electron transistor (RF-SET). The RF-SET readout is shown to be the most
sensitive method, allowing us to measure mechanical displacement amplitudes
below 1E-13 m. We conclude that a detection based on a SET offers a potential
to reach the sensitivity at the quantum limit of the mechanical vibrations.
| cond-mat.mes-hall | a singleelectron transistor set can be used as an extremely sensitive charge detector mechanical displacements can be converted into charge and hence sets can become sensitive detectors of mechanical oscillations for studying smallenergy oscillations an important approach to realize the mechanical resonators is to use piezoelectric materials besides coupling to traditional electric circuitry the straingenerated piezoelectric charge allows for measuring ultrasmall oscillations via set detection here we explore the usage of sets to detect the shearmode oscillations of a 6mmdiameter quartz disk resonator with a resonance frequency around 9 mhz we measure the mechanical oscillations using either a conventional dc set or use the set as a homodyne or heterodyne mixer or finally as a radiofrequency singleelectron transistor rfset the rfset readout is shown to be the most sensitive method allowing us to measure mechanical displacement amplitudes below 1e13 m we conclude that a detection based on a set offers a potential to reach the sensitivity at the quantum limit of the mechanical vibrations | [['a', 'singleelectron', 'transistor', 'set', 'can', 'be', 'used', 'as', 'an', 'extremely', 'sensitive', 'charge', 'detector', 'mechanical', 'displacements', 'can', 'be', 'converted', 'into', 'charge', 'and', 'hence', 'sets', 'can', 'become', 'sensitive', 'detectors', 'of', 'mechanical', 'oscillations', 'for', 'studying', 'smallenergy', 'oscillations', 'an', 'important', 'approach', 'to', 'realize', 'the', 'mechanical', 'resonators', 'is', 'to', 'use', 'piezoelectric', 'materials', 'besides', 'coupling', 'to', 'traditional', 'electric', 'circuitry', 'the', 'straingenerated', 'piezoelectric', 'charge', 'allows', 'for', 'measuring', 'ultrasmall', 'oscillations', 'via', 'set', 'detection', 'here', 'we', 'explore', 'the', 'usage', 'of', 'sets', 'to', 'detect', 'the', 'shearmode', 'oscillations', 'of', 'a', '6mmdiameter', 'quartz', 'disk', 'resonator', 'with', 'a', 'resonance', 'frequency', 'around', '9', 'mhz', 'we', 'measure', 'the', 'mechanical', 'oscillations', 'using', 'either', 'a', 'conventional', 'dc', 'set', 'or', 'use', 'the', 'set', 'as', 'a', 'homodyne', 'or', 'heterodyne', 'mixer', 'or', 'finally', 'as', 'a', 'radiofrequency', 'singleelectron', 'transistor', 'rfset', 'the', 'rfset', 'readout', 'is', 'shown', 'to', 'be', 'the', 'most', 'sensitive', 'method', 'allowing', 'us', 'to', 'measure', 'mechanical', 'displacement', 'amplitudes', 'below', '1e13', 'm', 'we', 'conclude', 'that', 'a', 'detection', 'based', 'on', 'a', 'set', 'offers', 'a', 'potential', 'to', 'reach', 'the', 'sensitivity', 'at', 'the', 'quantum', 'limit', 'of', 'the', 'mechanical', 'vibrations']] | [-0.14534356760491335, 0.15034049366515295, -0.04473700237253474, -0.005061715736375823, -0.07844152692475437, -0.1795959517698919, 0.08360688087679906, 0.36285981641691406, -0.2406743573704677, -0.29139876835634587, 0.06163124803074256, -0.3032811772507467, -0.10031373229993071, 0.2749772717109824, -0.025361610779877936, 0.056229554057081035, 0.024897316062569987, 0.0007974580878874769, -0.019960438652987373, -0.0888205835779692, 0.20477476944847975, 0.08401126182209816, 0.3188833340594292, 0.03234334089350419, 0.1310799455853685, -0.04874019283243673, 0.07129332506569264, 0.029361589857733544, -0.0805468299773498, 0.0730152931373371, 0.2502174499188837, 0.030562206984923027, 0.2428697794072192, -0.4580054377826552, -0.1660322515943582, 0.11639329077917393, 0.13581179524053255, 0.14726016750950136, -0.0072440479524192155, -0.28276953596713733, 0.059805419485740086, -0.1626207454756684, -0.11679871861081294, -0.1428216963885697, -0.011297714160640298, 0.001965093900691028, -0.2693421418281318, 0.02132552953000054, -0.009325717416315995, 0.022064830136289935, -0.03241617008820923, -0.058364233046620626, 0.014940820470521296, 0.06171275855668671, -0.06961534223174332, 0.027813157960657538, 0.28664142537839066, -0.0705100376256684, -0.11503252090403328, 0.35335130523171643, -0.08201032188285522, -0.19109518333326703, 0.18339157190150868, -0.15771533697441129, -0.014226947663880793, 0.13098319498017247, 0.15708588357198477, 0.060640159625176306, -0.19172086594496957, -0.009105710931090683, 0.06560585718389232, 0.21850903650722753, 0.13544104277029817, 0.1081337526298335, 0.28986486518341636, 0.22544422667519545, 0.07968925823239081, 0.169226300701453, -0.16701487021055073, 0.05651905324402047, -0.2615657774501561, -0.12789156101356594, -0.19483793265025282, 0.12161901878210267, -0.02437338644319234, -0.1963866442320854, 0.4177499195721782, 0.15833082221007194, 0.14413715441665256, -0.026462936158763405, 0.330740282673498, 0.11388951156586251, 0.12615792858681138, -0.0270721295354083, 0.2968162008960743, 0.19402643888153964, 0.08630024995597332, -0.27592667500936874, -0.005015992712557178, -0.022193993729205778] |
1,802.06659 | Discovery of a bright microlensing event with planetary features towards
the Taurus region: a super Earth planet | The transient event labeled as TCP J05074264+2447555 recently discovered
towards the Taurus region was quickly recognized to be an ongoing microlensing
event on a source located at distance of only $700-800$ pc from Earth. Here, we
show that observations with high sampling rate close to the time of maximum
magnification revealed features that imply the presence of a binary lens system
with very low mass ratio components. We present a complete description of the
binary lens system which hosts an Earth-like planet with most likely mass of
$9.2\pm 6.6$ M$_{\oplus}$. Furthermore, the source estimated location and
detailed Monte Carlo simulations allowed us to classify the event as due to the
closest lens system, being at a distance of $\simeq 380$ pc and mass $\simeq
0.25$ M$_{\odot}$.
| astro-ph.EP | the transient event labeled as tcp j050742642447555 recently discovered towards the taurus region was quickly recognized to be an ongoing microlensing event on a source located at distance of only 700800 pc from earth here we show that observations with high sampling rate close to the time of maximum magnification revealed features that imply the presence of a binary lens system with very low mass ratio components we present a complete description of the binary lens system which hosts an earthlike planet with most likely mass of 92pm 66 m_oplus furthermore the source estimated location and detailed monte carlo simulations allowed us to classify the event as due to the closest lens system being at a distance of simeq 380 pc and mass simeq 025 m_odot | [['the', 'transient', 'event', 'labeled', 'as', 'tcp', 'j050742642447555', 'recently', 'discovered', 'towards', 'the', 'taurus', 'region', 'was', 'quickly', 'recognized', 'to', 'be', 'an', 'ongoing', 'microlensing', 'event', 'on', 'a', 'source', 'located', 'at', 'distance', 'of', 'only', '700800', 'pc', 'from', 'earth', 'here', 'we', 'show', 'that', 'observations', 'with', 'high', 'sampling', 'rate', 'close', 'to', 'the', 'time', 'of', 'maximum', 'magnification', 'revealed', 'features', 'that', 'imply', 'the', 'presence', 'of', 'a', 'binary', 'lens', 'system', 'with', 'very', 'low', 'mass', 'ratio', 'components', 'we', 'present', 'a', 'complete', 'description', 'of', 'the', 'binary', 'lens', 'system', 'which', 'hosts', 'an', 'earthlike', 'planet', 'with', 'most', 'likely', 'mass', 'of', '92pm', '66', 'm_oplus', 'furthermore', 'the', 'source', 'estimated', 'location', 'and', 'detailed', 'monte', 'carlo', 'simulations', 'allowed', 'us', 'to', 'classify', 'the', 'event', 'as', 'due', 'to', 'the', 'closest', 'lens', 'system', 'being', 'at', 'a', 'distance', 'of', 'simeq', '380', 'pc', 'and', 'mass', 'simeq', '025', 'm_odot']] | [-0.12247728821262717, 0.08441324970708229, -0.052273665066808465, 0.05698460728302598, -0.07874245221354068, -0.11001505199074745, 0.09804785302840173, 0.37437612745165827, -0.20120920546445994, -0.3920308538172394, 0.10440570748352912, -0.3231200951039791, -0.04967315173521638, 0.20358861766941846, -0.035624685553557356, 0.005693801143206656, 0.12177280961768702, 0.017902794463559985, -0.07978063344582915, -0.21916969825699925, 0.24824852128326894, 0.15150836868956685, 0.13993786910548806, 0.009273796565830708, 0.12359422365948558, -0.03423330671805888, -0.017235221200156955, -0.027734908279031516, -0.16746095579548273, 0.012517510306090116, 0.22014757527969778, 0.117532801207155, 0.18815228399634362, -0.2863244100064039, -0.18766963236778975, 0.07730598975159228, 0.1591006503207609, 0.03571294345636852, -0.05720733196008951, -0.3079993081931025, 0.13256441159546375, -0.2181456636786461, -0.17979182116314768, 0.08056013092026114, 0.06859455326199532, -0.004286299150437116, -0.23703985204175115, 0.11476205368153751, -0.019172872483730317, 0.05817795291123912, -0.06511195810697973, -0.09568797167856247, -0.05344370857824106, 0.0796681183213368, 0.024437641106545924, 0.12153476676344871, 0.15557315522059798, -0.08012063475698232, -0.039433964870870114, 0.3797483793348074, -0.03511855918355286, -0.028272395256906748, 0.2523520001247525, -0.19886796667426826, -0.1338176283054054, 0.1968939963169396, 0.2014180364497006, 0.14397564755938946, -0.18263230471313, -0.049152601371286436, 0.007691641628742218, 0.27130446650180967, 0.04962252475693822, 0.028928754158318044, 0.3553096802979708, 0.17055510949343444, 0.04812856327876216, 0.08813383769523353, -0.26137615386210383, -0.06227653764002025, -0.2100030677616596, -0.10871694354712963, -0.18654421029146762, 0.08520410111360252, -0.1387610899952706, -0.12375176122039556, 0.2932342953905463, 0.1676902963295579, 0.23854714531451462, 0.0667933544376865, 0.25726619753241536, 0.06133286960981786, 0.12063170532882214, 0.10390094736963511, 0.2952206048965454, 0.1271376165933907, 0.068082015927881, -0.19393759057857096, 0.07799058115109801, 0.004061349250376225] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.