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.0106 | Magnetotransport in Layered Dirac Fermion System Coupled with Magnetic
Moments | We theoretically investigate the magnetotransport of Dirac fermions coupled
with localized moments to understand the physical properties of the Dirac
material EuMnBi$_2$. Using an interlayer hopping form, which simplifies the
complicated interaction between the layers of Dirac fermions and the layers of
magnetic moments in EuMnBi$_2$, the theory reproduces most of the features
observed in this system. The hysteresis observed in EuMnBi$_2$ can be caused by
the valley splitting that is induced by the spin-orbit coupling and the
external magnetic field with the molecular field created by localized moments.
Our theory suggests that the magnetotransport in EuMnBi$_2$ is due to the
interplay among Dirac fermions, localized moments, and spin-orbit coupling.
| cond-mat.str-el | we theoretically investigate the magnetotransport of dirac fermions coupled with localized moments to understand the physical properties of the dirac material eumnbi_2 using an interlayer hopping form which simplifies the complicated interaction between the layers of dirac fermions and the layers of magnetic moments in eumnbi_2 the theory reproduces most of the features observed in this system the hysteresis observed in eumnbi_2 can be caused by the valley splitting that is induced by the spinorbit coupling and the external magnetic field with the molecular field created by localized moments our theory suggests that the magnetotransport in eumnbi_2 is due to the interplay among dirac fermions localized moments and spinorbit coupling | [['we', 'theoretically', 'investigate', 'the', 'magnetotransport', 'of', 'dirac', 'fermions', 'coupled', 'with', 'localized', 'moments', 'to', 'understand', 'the', 'physical', 'properties', 'of', 'the', 'dirac', 'material', 'eumnbi_2', 'using', 'an', 'interlayer', 'hopping', 'form', 'which', 'simplifies', 'the', 'complicated', 'interaction', 'between', 'the', 'layers', 'of', 'dirac', 'fermions', 'and', 'the', 'layers', 'of', 'magnetic', 'moments', 'in', 'eumnbi_2', 'the', 'theory', 'reproduces', 'most', 'of', 'the', 'features', 'observed', 'in', 'this', 'system', 'the', 'hysteresis', 'observed', 'in', 'eumnbi_2', 'can', 'be', 'caused', 'by', 'the', 'valley', 'splitting', 'that', 'is', 'induced', 'by', 'the', 'spinorbit', 'coupling', 'and', 'the', 'external', 'magnetic', 'field', 'with', 'the', 'molecular', 'field', 'created', 'by', 'localized', 'moments', 'our', 'theory', 'suggests', 'that', 'the', 'magnetotransport', 'in', 'eumnbi_2', 'is', 'due', 'to', 'the', 'interplay', 'among', 'dirac', 'fermions', 'localized', 'moments', 'and', 'spinorbit', 'coupling']] | [-0.22121402687308464, 0.23813336766655663, -0.012153621861414814, 0.04684381394075569, -0.043482098863883455, -0.0968979167751968, 0.03658324045510116, 0.3425017353782261, -0.27599554242756724, -0.33121741412376815, -0.0736787455029447, -0.2993111199106682, -0.19211740243587305, 0.12370443811470812, 0.08510040833868764, -0.03914078018860891, -0.032871616083535955, -0.03462148498616774, -0.08584497976116837, -0.20104861631671983, 0.3567260557023639, 0.02079667932861908, 0.2855533648197624, 0.09448341863991862, 0.020918484197252177, 0.004261973506601697, 0.1087704146894711, 0.018600403136489065, -0.05713357392087346, 0.10568072711202231, 0.16803477540961467, -0.13113711901347747, 0.17228716344318606, -0.47305621128867975, -0.19598975799639118, -0.02760589923709631, 0.1498494445515627, 0.1101837019213814, -0.07261939776045355, -0.34230607280677017, 0.03190478834069588, -0.10223739575594663, -0.15164899735880846, -0.11109496936921708, -0.060649273635565555, -0.0011272506195713174, -0.2760484704155136, 0.1019003695808351, 0.059227988157760016, 0.0877381770289503, -0.06366024953948164, -0.08711636121786961, -0.11026813301935115, 0.08760248507711697, 0.11370267123407261, 0.014652976325967095, 0.10874419681389223, -0.1638179375874725, -0.11849932162175801, 0.396685833924196, -0.09170280117118224, -0.1605974590067159, 0.17035793342034924, -0.18660109744364903, -0.058586170397360214, 0.11295875811272046, 0.11511827414347367, 0.10078156033784828, -0.16414306096108208, 0.12405430963104168, -0.01892151567576961, 0.1306885547851297, 0.01017613247544928, 0.07901056036353112, 0.2928772952068936, 0.1348189965398474, 0.012677139721133492, 0.13417435001306743, -0.1301987642184527, -0.0979493199466643, -0.22067583246495237, -0.1504461586306041, -0.2587213025005026, 0.059655933577398006, -0.06722035659860756, -0.18279240933373908, 0.4553031758341769, 0.18986458821984178, 0.18090753123926168, -0.09533581580776214, 0.22973196135664528, 0.1546595335271294, 0.10915953206237067, 0.042681712679702534, 0.31121108667840336, 0.22455421742686832, 0.10356797930699858, -0.35064673908901484, 0.051223711140284484, 0.04885064794427969] |
1,802.01061 | Power Allocation Strategy of Maximizing Secrecy Rate for Secure
Directional Modulation Networks | In this paper, given the beamforming vector of confidential messages and
artificial noise (AN) projection matrix and total power constraint, a power
allocation (PA) strategy of maximizing secrecy rate (Max-SR) is proposed for
secure directional modulation (DM) networks. By the method of Lagrange
multiplier, the analytic expression of the proposed PA strategy is derived. To
confirm the benefit from the Max-SR-based PA strategy, we take the null-space
projection (NSP) beamforming scheme as an example and derive its closed-form
expression of optimal PA strategy. From simulation results, we find the
following facts: in the medium and high signal-to-noise-ratio (SNR) regions,
compared with three typical PA parameters such $\beta=0.1, 0.5$, and $0.9$, the
optimal PA shows a substantial SR performance gain with maximum gain percent up
to more than $60\%$. Additionally, as the PA factor increases from 0 to 1, the
achievable SR increases accordingly in the low SNR region whereas it first
increases and then decreases in the medium and high SNR regions, where the SR
can be approximately viewed as a convex function of the PA factor. Finally, as
the number of antennas increases, the optimal PA factor becomes large and tends
to one in the medium and high SNR region. In other words, the contribution of
AN to SR can be trivial in such a situation.
| cs.IT cs.CR math.IT | in this paper given the beamforming vector of confidential messages and artificial noise an projection matrix and total power constraint a power allocation pa strategy of maximizing secrecy rate maxsr is proposed for secure directional modulation dm networks by the method of lagrange multiplier the analytic expression of the proposed pa strategy is derived to confirm the benefit from the maxsrbased pa strategy we take the nullspace projection nsp beamforming scheme as an example and derive its closedform expression of optimal pa strategy from simulation results we find the following facts in the medium and high signaltonoiseratio snr regions compared with three typical pa parameters such beta01 05 and 09 the optimal pa shows a substantial sr performance gain with maximum gain percent up to more than 60 additionally as the pa factor increases from 0 to 1 the achievable sr increases accordingly in the low snr region whereas it first increases and then decreases in the medium and high snr regions where the sr can be approximately viewed as a convex function of the pa factor finally as the number of antennas increases the optimal pa factor becomes large and tends to one in the medium and high snr region in other words the contribution of an to sr can be trivial in such a situation | [['in', 'this', 'paper', 'given', 'the', 'beamforming', 'vector', 'of', 'confidential', 'messages', 'and', 'artificial', 'noise', 'an', 'projection', 'matrix', 'and', 'total', 'power', 'constraint', 'a', 'power', 'allocation', 'pa', 'strategy', 'of', 'maximizing', 'secrecy', 'rate', 'maxsr', 'is', 'proposed', 'for', 'secure', 'directional', 'modulation', 'dm', 'networks', 'by', 'the', 'method', 'of', 'lagrange', 'multiplier', 'the', 'analytic', 'expression', 'of', 'the', 'proposed', 'pa', 'strategy', 'is', 'derived', 'to', 'confirm', 'the', 'benefit', 'from', 'the', 'maxsrbased', 'pa', 'strategy', 'we', 'take', 'the', 'nullspace', 'projection', 'nsp', 'beamforming', 'scheme', 'as', 'an', 'example', 'and', 'derive', 'its', 'closedform', 'expression', 'of', 'optimal', 'pa', 'strategy', 'from', 'simulation', 'results', 'we', 'find', 'the', 'following', 'facts', 'in', 'the', 'medium', 'and', 'high', 'signaltonoiseratio', 'snr', 'regions', 'compared', 'with', 'three', 'typical', 'pa', 'parameters', 'such', 'beta01', '05', 'and', '09', 'the', 'optimal', 'pa', 'shows', 'a', 'substantial', 'sr', 'performance', 'gain', 'with', 'maximum', 'gain', 'percent', 'up', 'to', 'more', 'than', '60', 'additionally', 'as', 'the', 'pa', 'factor', 'increases', 'from', '0', 'to', '1', 'the', 'achievable', 'sr', 'increases', 'accordingly', 'in', 'the', 'low', 'snr', 'region', 'whereas', 'it', 'first', 'increases', 'and', 'then', 'decreases', 'in', 'the', 'medium', 'and', 'high', 'snr', 'regions', 'where', 'the', 'sr', 'can', 'be', 'approximately', 'viewed', 'as', 'a', 'convex', 'function', 'of', 'the', 'pa', 'factor', 'finally', 'as', 'the', 'number', 'of', 'antennas', 'increases', 'the', 'optimal', 'pa', 'factor', 'becomes', 'large', 'and', 'tends', 'to', 'one', 'in', 'the', 'medium', 'and', 'high', 'snr', 'region', 'in', 'other', 'words', 'the', 'contribution', 'of', 'an', 'to', 'sr', 'can', 'be', 'trivial', 'in', 'such', 'a', 'situation']] | [-0.13165642038775668, 0.033005851415442454, -0.028069931043622393, 0.026856587098639768, -0.02531733248206028, -0.16409762871572403, 0.1055468606802471, 0.37230453369449135, -0.3072653240599687, -0.28674870135512687, 0.07144414478992715, -0.2829179279366077, -0.10989058884593693, 0.1459346360807777, -0.07423188484891499, 0.008516650200396759, -0.010384791648161976, 0.04567196719138641, -0.06986687038847271, -0.22701613152727346, 0.24860335139480108, 0.15958457235333132, 0.3100587719204163, 0.03454089498026641, 0.13456482978546302, -0.004292995920641934, -0.0027339430644470093, 0.018851173142643854, -0.08452098534218278, 0.05676184704578999, 0.2812261517651172, 0.18535317249889313, 0.25567765032044715, -0.34954857942217066, -0.1850305864225245, 0.08470532002845882, 0.18392430463777767, 0.0769214085087663, -0.030647185908458562, -0.2060589629798886, 0.13633660164972147, -0.23820163057556515, -0.09523115448623516, 0.010909182846296096, -0.02533063221845724, 0.043839342891361516, -0.3580923122041255, 0.07057975899078883, 0.036370142147427904, 0.05100328861563294, -0.05674687966637538, -0.19768009332107828, 0.026249996688285912, 0.09963607149957507, 0.05490884542059912, 0.07121384554947899, 0.1332509330585944, -0.15008186465840684, -0.059268498579816274, 0.3741177985082484, -0.07558971958261046, -0.19517648695209236, 0.1429337879041365, -0.16356548550430927, -0.05585341458262755, 0.21463788261516364, 0.21215202269646666, 0.09923593244618839, -0.10134094233917831, 0.007103496842453886, -0.0235819695366512, 0.2103679974895419, 0.0800107437308826, 0.08420011451623093, 0.11922957727370818, 0.156081357082628, 0.12669053641729988, 0.14987313150454107, -0.15723077937878702, -0.05617868579510185, -0.24620597642260017, -0.13377705472090315, -0.16300915442601158, 0.01006739573009933, -0.1798776022984654, -0.03184910278623984, 0.32527752171428664, 0.11141527830235039, 0.19501786292271894, 0.06116673183041038, 0.35249031318731056, 0.16476954721508297, 0.009708440873375232, 0.11292013806760898, 0.274694223088402, 0.1223141792245399, 0.10950756665853853, -0.21222770157490028, 0.053504627770356215, -0.016146624861802492] |
1,802.01062 | Regional Complexity Analysis of Algorithms for Nonconvex Smooth
Optimization | A strategy is proposed for characterizing the worst-case performance of
algorithms for solving nonconvex smooth optimization problems. Contemporary
analyses characterize worst-case performance by providing, under certain
assumptions on an objective function, an upper bound on the number of
iterations (or function or derivative evaluations) required until a pth-order
stationarity condition is approximately satisfied. This arguably leads to
conservative characterizations based on anomalous objectives rather than on
ones that are typically encountered in practice. By contrast, the strategy
proposed in this paper characterizes worst-case performance separately over
regions comprising a search space. These regions are defined generically based
on properties of derivative values. In this manner, one can analyze the
worst-case performance of an algorithm independently from any particular class
of objectives. Then, once given a class of objectives, one can obtain an
informative, fine-tuned complexity analysis merely by delineating the types of
regions that comprise the search spaces for functions in the class. Regions
defined by first- and second-order derivatives are discussed in detail and
example complexity analyses are provided for a few fundamental first- and
second-order algorithms when employed to minimize convex and nonconvex
objectives of interest. It is also explained how the strategy can be
generalized to regions defined by higher-order derivatives and for analyzing
the behavior of higher-order algorithms.
| math.OC | a strategy is proposed for characterizing the worstcase performance of algorithms for solving nonconvex smooth optimization problems contemporary analyses characterize worstcase performance by providing under certain assumptions on an objective function an upper bound on the number of iterations or function or derivative evaluations required until a pthorder stationarity condition is approximately satisfied this arguably leads to conservative characterizations based on anomalous objectives rather than on ones that are typically encountered in practice by contrast the strategy proposed in this paper characterizes worstcase performance separately over regions comprising a search space these regions are defined generically based on properties of derivative values in this manner one can analyze the worstcase performance of an algorithm independently from any particular class of objectives then once given a class of objectives one can obtain an informative finetuned complexity analysis merely by delineating the types of regions that comprise the search spaces for functions in the class regions defined by first and secondorder derivatives are discussed in detail and example complexity analyses are provided for a few fundamental first and secondorder algorithms when employed to minimize convex and nonconvex objectives of interest it is also explained how the strategy can be generalized to regions defined by higherorder derivatives and for analyzing the behavior of higherorder algorithms | [['a', 'strategy', 'is', 'proposed', 'for', 'characterizing', 'the', 'worstcase', 'performance', 'of', 'algorithms', 'for', 'solving', 'nonconvex', 'smooth', 'optimization', 'problems', 'contemporary', 'analyses', 'characterize', 'worstcase', 'performance', 'by', 'providing', 'under', 'certain', 'assumptions', 'on', 'an', 'objective', 'function', 'an', 'upper', 'bound', 'on', 'the', 'number', 'of', 'iterations', 'or', 'function', 'or', 'derivative', 'evaluations', 'required', 'until', 'a', 'pthorder', 'stationarity', 'condition', 'is', 'approximately', 'satisfied', 'this', 'arguably', 'leads', 'to', 'conservative', 'characterizations', 'based', 'on', 'anomalous', 'objectives', 'rather', 'than', 'on', 'ones', 'that', 'are', 'typically', 'encountered', 'in', 'practice', 'by', 'contrast', 'the', 'strategy', 'proposed', 'in', 'this', 'paper', 'characterizes', 'worstcase', 'performance', 'separately', 'over', 'regions', 'comprising', 'a', 'search', 'space', 'these', 'regions', 'are', 'defined', 'generically', 'based', 'on', 'properties', 'of', 'derivative', 'values', 'in', 'this', 'manner', 'one', 'can', 'analyze', 'the', 'worstcase', 'performance', 'of', 'an', 'algorithm', 'independently', 'from', 'any', 'particular', 'class', 'of', 'objectives', 'then', 'once', 'given', 'a', 'class', 'of', 'objectives', 'one', 'can', 'obtain', 'an', 'informative', 'finetuned', 'complexity', 'analysis', 'merely', 'by', 'delineating', 'the', 'types', 'of', 'regions', 'that', 'comprise', 'the', 'search', 'spaces', 'for', 'functions', 'in', 'the', 'class', 'regions', 'defined', 'by', 'first', 'and', 'secondorder', 'derivatives', 'are', 'discussed', 'in', 'detail', 'and', 'example', 'complexity', 'analyses', 'are', 'provided', 'for', 'a', 'few', 'fundamental', 'first', 'and', 'secondorder', 'algorithms', 'when', 'employed', 'to', 'minimize', 'convex', 'and', 'nonconvex', 'objectives', 'of', 'interest', 'it', 'is', 'also', 'explained', 'how', 'the', 'strategy', 'can', 'be', 'generalized', 'to', 'regions', 'defined', 'by', 'higherorder', 'derivatives', 'and', 'for', 'analyzing', 'the', 'behavior', 'of', 'higherorder', 'algorithms']] | [-0.09643702183214219, 0.03709339181577374, -0.05605683531634123, 0.0977343802366687, -0.07485063799178088, -0.12996021788435513, 0.04467532096347192, 0.37243105142535465, -0.24962771057485128, -0.33231415871073894, 0.1279833600746538, -0.2304069051883658, -0.18259080654484625, 0.23614974600759353, -0.10676007803292277, 0.07734037088709367, 0.03430724253807709, 0.031037324429972906, -0.09860314814404603, -0.3087290017843633, 0.3168817135412764, 0.019760712354668013, 0.25061751252154485, 0.016366184085886488, 0.07219117475653787, -0.017123543119216163, -0.010055663630411354, 0.06841016991207001, -0.13656918557377518, 0.11843302498026839, 0.27999554495195383, 0.18026235581481093, 0.3397523267238559, -0.39612223080552694, -0.18026557532226983, 0.14281009053833396, 0.1279054945636813, 0.019740350955201068, -0.016593283195518626, -0.26695228521799985, 0.08004432971746318, -0.08744178692050243, -0.07424625418509163, -0.10757572785731545, -0.03309141516571267, 0.02881616463704597, -0.3142945996072706, 0.025459341694823827, 0.05501394296468033, 0.031816453553098124, -0.05862710964075237, -0.13127318394089224, 0.03096562026305792, 0.08251226045598192, 0.05263109210953292, 0.003232142769397711, 0.11016989729964649, -0.11844266821709373, -0.14196136386247948, 0.3661929922099313, -0.04324802583807537, -0.257883687163176, 0.17120624397977977, -0.08576830135403588, -0.15331697838714803, 0.14834838360635536, 0.19791224648525832, 0.1761737112636801, -0.1740186566321255, 0.08154654529089556, -0.004016098443348453, 0.1542137990978037, 0.07211386345168751, 0.06545268056611091, 0.14461925637332793, 0.1674116994407704, 0.1433974084299374, 0.1622426271738423, -0.0147611754781672, -0.1281745918564617, -0.31335378716313195, -0.10364925118414729, -0.19334036974622956, -0.04186629956612311, -0.08321533170889762, -0.13390884822056592, 0.3954957261273005, 0.1086325342470411, 0.17416253175041727, 0.10969931271612504, 0.3234116926718995, 0.13966215561382375, 0.04509694033460516, 0.09706171554675817, 0.2208409620973914, 0.06617148848632702, 0.053154399152296014, -0.1671655302524637, 0.15363262280619172, 0.09813676965269172] |
1,802.01063 | Cantor Julia sets with Hausdorff dimension two | We prove the existence of Cantor Julia sets with Hausdorff dimension two. In
particular, such examples can be found in cubic polynomials. The proof is based
on the characterization of the parameter spaces and dynamical planes of cubic
polynomials by Branner-Hubbard, and the parabolic bifurcation theory developed
by Shishikura in 1990s.
| math.DS math.CV | we prove the existence of cantor julia sets with hausdorff dimension two in particular such examples can be found in cubic polynomials the proof is based on the characterization of the parameter spaces and dynamical planes of cubic polynomials by brannerhubbard and the parabolic bifurcation theory developed by shishikura in 1990s | [['we', 'prove', 'the', 'existence', 'of', 'cantor', 'julia', 'sets', 'with', 'hausdorff', 'dimension', 'two', 'in', 'particular', 'such', 'examples', 'can', 'be', 'found', 'in', 'cubic', 'polynomials', 'the', 'proof', 'is', 'based', 'on', 'the', 'characterization', 'of', 'the', 'parameter', 'spaces', 'and', 'dynamical', 'planes', 'of', 'cubic', 'polynomials', 'by', 'brannerhubbard', 'and', 'the', 'parabolic', 'bifurcation', 'theory', 'developed', 'by', 'shishikura', 'in', '1990s']] | [-0.16766046616705318, 0.09773363170268781, -0.08288973694046338, 0.057644120648083295, -0.06917772211097911, -0.0971514838953119, 0.0017656695540519613, 0.2634414501999523, -0.2637186119807701, -0.1921076249678199, 0.15289395088192953, -0.2837354784064433, -0.20802709913136913, 0.252052986373504, -0.1009481839525203, 0.06558942279833205, 0.008043851630360472, 0.02621309459209442, -0.0705420663945523, -0.3310162903850569, 0.4164777508133328, -0.07974140218221674, 0.2092386033459037, 0.056111004742264166, 0.09453424902669355, -0.023120903638282828, -0.014010304365964496, 0.02656762922803561, -0.20993512182259091, 0.1128184901077903, 0.2611087517922415, 0.08397392359534826, 0.2337354734978255, -0.34682218215483074, -0.15591652122070537, 0.15882194230296448, 0.12210333878722261, 0.029364789982198502, -0.0212381849928266, -0.2999267235544382, 0.06013499502567392, -0.09010649286210537, -0.2286569260188616, -0.12538395290646484, 0.023142053216111427, 0.07696186277704935, -0.22683418002983957, 0.007598020793760524, 0.10947283724603682, 0.1772665789570002, -0.04139761483369797, -0.07262404717724114, -0.10066284673909347, 0.0026495381527781195, -0.008213102840361934, 0.004667468652056128, 0.01898827576352393, 0.007695081260274439, -0.17561788482628032, 0.3536135532308881, -0.04769700897775371, -0.23798016016257414, 0.18469985741117567, -0.20602333702731365, -0.1571799660758937, 0.11603725568605952, 0.1341375190941286, 0.09746537291828324, -0.0845117311121202, 0.21997881698759966, -0.0838037435440164, 0.1123791018902671, 0.1556486755646035, -0.0038582515701943753, 0.10148666988985211, 0.11493458117212296, 0.07974158169007768, 0.1843482670990531, 0.012936482667082957, -0.08479169734603013, -0.2770201295395108, -0.1305535012381334, -0.18914232744524875, 0.03971748070462661, -0.16880771870138214, -0.22185570228041387, 0.4030950827451021, 0.05249283438110176, 0.15242799497483409, 0.05980436755892109, 0.20620665719330894, 0.09319120566999796, 0.019990824911670358, 0.06043365810182877, 0.21267247725935542, 0.17813572341430128, 0.01763594843100245, -0.11410473105406352, 0.020019455365471395, 0.28355882851881725] |
1,802.01064 | Leading and second order homogenization of an elastic scattering problem
for highly oscillating anisotropic medium | We consider the scattering of elastic waves by highly oscillating anisotropic
periodic media with bounded support. Applying the two-scale homogenization, we
first obtain a constant coefficient second-order partial differential elliptic
equation that describes the wave propagation of the effective or overall wave
field. We study the rate of convergence by introducing complimentary boundary
correctors. To account for dispersion induced by the periodic structure, we
further pursue a higher-order homogenization. We then investigate the rate of
convergence and formally obtain a fourth-order differential equation that
demonstrates the anisotropic dispersion
| math.AP | we consider the scattering of elastic waves by highly oscillating anisotropic periodic media with bounded support applying the twoscale homogenization we first obtain a constant coefficient secondorder partial differential elliptic equation that describes the wave propagation of the effective or overall wave field we study the rate of convergence by introducing complimentary boundary correctors to account for dispersion induced by the periodic structure we further pursue a higherorder homogenization we then investigate the rate of convergence and formally obtain a fourthorder differential equation that demonstrates the anisotropic dispersion | [['we', 'consider', 'the', 'scattering', 'of', 'elastic', 'waves', 'by', 'highly', 'oscillating', 'anisotropic', 'periodic', 'media', 'with', 'bounded', 'support', 'applying', 'the', 'twoscale', 'homogenization', 'we', 'first', 'obtain', 'a', 'constant', 'coefficient', 'secondorder', 'partial', 'differential', 'elliptic', 'equation', 'that', 'describes', 'the', 'wave', 'propagation', 'of', 'the', 'effective', 'or', 'overall', 'wave', 'field', 'we', 'study', 'the', 'rate', 'of', 'convergence', 'by', 'introducing', 'complimentary', 'boundary', 'correctors', 'to', 'account', 'for', 'dispersion', 'induced', 'by', 'the', 'periodic', 'structure', 'we', 'further', 'pursue', 'a', 'higherorder', 'homogenization', 'we', 'then', 'investigate', 'the', 'rate', 'of', 'convergence', 'and', 'formally', 'obtain', 'a', 'fourthorder', 'differential', 'equation', 'that', 'demonstrates', 'the', 'anisotropic', 'dispersion']] | [-0.2072125618684698, 0.09766193174503067, -0.08737837893634358, 0.054238100186921656, -0.13374987350438128, -0.0675256433526308, -0.010686719919745387, 0.32585913090389856, -0.33466582611965184, -0.20205818360078742, 0.101052283806811, -0.2853629635435275, -0.1853597125128462, 0.14678185591632922, 0.027033459215255625, 0.12281280067558824, 0.04217118762475862, -0.012931097727480599, -0.07882767527851021, -0.18368338723666966, 0.3891537967455489, -0.008138502498199656, 0.2621137991822748, 0.04843659637580541, 0.1241723844379356, 0.06285843405533921, -0.052181333377534014, 0.05051906002600762, -0.21669457033253406, 0.13130416694647548, 0.19641809588277034, -0.02842857560608536, 0.2567287383902691, -0.4456351705911485, -0.25509778961581603, 0.016996564400456424, 0.15797919762024487, 0.14645874383859336, -0.08237252267479728, -0.29371779575012624, 0.06389105204090645, -0.12524057902522723, -0.2294396386555904, -0.10011322190191342, -0.01550313528092705, 0.09832283943118951, -0.29569192254844395, 0.15837393109045064, 0.09328823794864795, 0.02134712618532252, -0.11113254232755439, -0.03325010712300851, 0.0037637384349099275, 0.02795981004865925, 0.05765332387818489, -0.017920621525263414, 0.034642752003326845, -0.11303165581458333, -0.04344088805902919, 0.36355360683096066, -0.18399477636293424, -0.2469042804600163, 0.08414714083879847, -0.15260888229286965, -0.02533094874392687, 0.16081312751736154, 0.2454224997411736, 0.12958790759809993, -0.18515364006651164, 0.07533569496312835, 0.000545045107256473, 0.17852278945925223, 0.1268738827308301, -0.04004765319934284, 0.10202497024808756, 0.1582607320213521, 0.09469656440408224, 0.1534168160023083, -0.03407466153095646, -0.07327499957649376, -0.32245890076526185, -0.15131778920327965, -0.09902358117555692, 0.07820674346922632, -0.12435373251570457, -0.20947607580588243, 0.3705143356187777, 0.142713680238971, 0.1494524429700422, 0.06960813285232606, 0.2517483360239897, 0.2588362697173249, -0.023205570651705122, 0.0813693697775968, 0.2974313726616939, 0.19246452693584037, 0.1218521842860024, -0.28514408181019296, 0.03468231879047711, 0.1256975477238236] |
1,802.01065 | Detecting Group Anomalies in Tera-Scale Multi-Aspect Data via
Dense-Subtensor Mining | How can we detect fraudulent lockstep behavior in large-scale multi-aspect
data (i.e., tensors)? Can we detect it when data are too large to fit in memory
or even on a disk? Past studies have shown that dense subtensors in real-world
tensors (e.g., social media, Wikipedia, TCP dumps, etc.) signal anomalous or
fraudulent behavior such as retweet boosting, bot activities, and network
attacks. Thus, various approaches, including tensor decomposition and search,
have been proposed for detecting dense subtensors rapidly and accurately.
However, existing methods have low accuracy, or they assume that tensors are
small enough to fit in main memory, which is unrealistic in many real-world
applications such as social media and web. To overcome these limitations, we
propose D-CUBE, a disk-based dense-subtensor detection method, which also can
run in a distributed manner across multiple machines. Compared to
state-of-the-art methods, D-CUBE is (1) Memory Efficient: requires up to 1,561X
less memory and handles 1,000X larger data (2.6TB), (2) Fast: up to 7X faster
due to its near-linear scalability, (3) Provably Accurate: gives a guarantee on
the densities of the detected subtensors, and (4) Effective: spotted network
attacks from TCP dumps and synchronized behavior in rating data most
accurately.
| cs.DB cs.DC cs.SI | how can we detect fraudulent lockstep behavior in largescale multiaspect data ie tensors can we detect it when data are too large to fit in memory or even on a disk past studies have shown that dense subtensors in realworld tensors eg social media wikipedia tcp dumps etc signal anomalous or fraudulent behavior such as retweet boosting bot activities and network attacks thus various approaches including tensor decomposition and search have been proposed for detecting dense subtensors rapidly and accurately however existing methods have low accuracy or they assume that tensors are small enough to fit in main memory which is unrealistic in many realworld applications such as social media and web to overcome these limitations we propose dcube a diskbased densesubtensor detection method which also can run in a distributed manner across multiple machines compared to stateoftheart methods dcube is 1 memory efficient requires up to 1561x less memory and handles 1000x larger data 26tb 2 fast up to 7x faster due to its nearlinear scalability 3 provably accurate gives a guarantee on the densities of the detected subtensors and 4 effective spotted network attacks from tcp dumps and synchronized behavior in rating data most accurately | [['how', 'can', 'we', 'detect', 'fraudulent', 'lockstep', 'behavior', 'in', 'largescale', 'multiaspect', 'data', 'ie', 'tensors', 'can', 'we', 'detect', 'it', 'when', 'data', 'are', 'too', 'large', 'to', 'fit', 'in', 'memory', 'or', 'even', 'on', 'a', 'disk', 'past', 'studies', 'have', 'shown', 'that', 'dense', 'subtensors', 'in', 'realworld', 'tensors', 'eg', 'social', 'media', 'wikipedia', 'tcp', 'dumps', 'etc', 'signal', 'anomalous', 'or', 'fraudulent', 'behavior', 'such', 'as', 'retweet', 'boosting', 'bot', 'activities', 'and', 'network', 'attacks', 'thus', 'various', 'approaches', 'including', 'tensor', 'decomposition', 'and', 'search', 'have', 'been', 'proposed', 'for', 'detecting', 'dense', 'subtensors', 'rapidly', 'and', 'accurately', 'however', 'existing', 'methods', 'have', 'low', 'accuracy', 'or', 'they', 'assume', 'that', 'tensors', 'are', 'small', 'enough', 'to', 'fit', 'in', 'main', 'memory', 'which', 'is', 'unrealistic', 'in', 'many', 'realworld', 'applications', 'such', 'as', 'social', 'media', 'and', 'web', 'to', 'overcome', 'these', 'limitations', 'we', 'propose', 'dcube', 'a', 'diskbased', 'densesubtensor', 'detection', 'method', 'which', 'also', 'can', 'run', 'in', 'a', 'distributed', 'manner', 'across', 'multiple', 'machines', 'compared', 'to', 'stateoftheart', 'methods', 'dcube', 'is', '1', 'memory', 'efficient', 'requires', 'up', 'to', '1561x', 'less', 'memory', 'and', 'handles', '1000x', 'larger', 'data', '26tb', '2', 'fast', 'up', 'to', '7x', 'faster', 'due', 'to', 'its', 'nearlinear', 'scalability', '3', 'provably', 'accurate', 'gives', 'a', 'guarantee', 'on', 'the', 'densities', 'of', 'the', 'detected', 'subtensors', 'and', '4', 'effective', 'spotted', 'network', 'attacks', 'from', 'tcp', 'dumps', 'and', 'synchronized', 'behavior', 'in', 'rating', 'data', 'most', 'accurately']] | [-0.1046364694883562, 0.06258616481005147, -0.03113135108400194, 0.09484583150821056, -0.11763841670952238, -0.19135747769050607, 0.048136694191177325, 0.45169514273149297, -0.24921976861162304, -0.371363944124392, 0.1507386955145756, -0.31972132594001806, -0.1589121678424039, 0.18818245605042339, -0.08346497493534416, 0.07489834287079032, 0.08081839907645565, 0.033713712875452856, -0.031222725072851617, -0.28671015107094494, 0.23225219598035185, 0.043630569688399734, 0.31110704413761586, 0.0503213046581878, 0.06342306712128644, -0.07235843188383799, -0.06046469445108105, 0.03734076901647435, -0.01269984736427432, 0.08796734634556413, 0.3384620440444554, 0.2045013450323748, 0.27838345641059054, -0.47153427432646455, -0.22173879701720992, 0.12391093305849768, 0.18632441019714682, 0.09354417126976222, -0.0147287707485393, -0.28711876162020583, 0.157814602542803, -0.2122910984416166, -0.041528503487328276, -0.19256978244616738, 0.03108859850698602, 0.019454890289031853, -0.2489153716818804, 0.05793693353759231, 0.044307686351287685, 0.02432887372620807, 0.0029267771823629353, -0.09289697205081351, 0.04623831174823638, 0.13860433134469372, 0.059942066326218936, 0.02277538726903191, 0.16069988866178223, -0.15185121478052022, -0.12427291397807025, 0.3955823350697756, -0.059183053404528445, -0.15795587520499127, 0.2360543517789506, -0.05349263345304223, -0.1496494609704145, 0.13903318903560163, 0.27586736251148825, 0.10791560606766953, -0.14851486749538118, -0.009023084651622394, 0.011748489246886108, 0.1822722719684627, 0.07105546903354835, 0.014073631757409456, 0.14384623786396125, 0.1848781088249489, 0.07787603939032499, 0.07631328020553277, -0.10149225636058938, -0.0689876063837257, -0.14436867070107087, -0.09676758094368798, -0.16994464149477786, 0.03250341090378495, -0.13195957716252263, -0.15125951061751958, 0.3469344923493558, 0.21980676113042175, 0.19504393737363515, 0.07076917186162804, 0.367915646941161, -0.002288117847578197, 0.15838570814800554, 0.164569871382519, 0.16949287721090325, 0.004310460638773349, 0.1643766546813944, -0.12922362380027386, 0.13883385831158915, -0.047611501043873655] |
1,802.01066 | Generalized Jacobians of modular and Drinfeld modular curves | We consider the generalized Jacobian $\widetilde{J}$ of the modular curve
$X_0(N)$ of level $N$ with respect to a reduced divisor consisting of all
cusps. Supposing $N$ is square free, we explicitly determine the structure of
the $\mathbb{Q}$-rational torsion points on $\widetilde{J}$ up to $6$-primary
torsion. The result turns out to be very different from the case of prime power
level previously studied by Yang and the second author. We also obtain an
analogous result for Drinfeld modular curves. Our proof relies on similar
results for classical Jacobians due to Ohta, Papikian and the first author. We
also discuss the Hecke action on $\widetilde{J}$ and its Eisenstein property.
| math.NT | we consider the generalized jacobian widetildej of the modular curve x_0n of level n with respect to a reduced divisor consisting of all cusps supposing n is square free we explicitly determine the structure of the mathbbqrational torsion points on widetildej up to 6primary torsion the result turns out to be very different from the case of prime power level previously studied by yang and the second author we also obtain an analogous result for drinfeld modular curves our proof relies on similar results for classical jacobians due to ohta papikian and the first author we also discuss the hecke action on widetildej and its eisenstein property | [['we', 'consider', 'the', 'generalized', 'jacobian', 'widetildej', 'of', 'the', 'modular', 'curve', 'x_0n', 'of', 'level', 'n', 'with', 'respect', 'to', 'a', 'reduced', 'divisor', 'consisting', 'of', 'all', 'cusps', 'supposing', 'n', 'is', 'square', 'free', 'we', 'explicitly', 'determine', 'the', 'structure', 'of', 'the', 'mathbbqrational', 'torsion', 'points', 'on', 'widetildej', 'up', 'to', '6primary', 'torsion', 'the', 'result', 'turns', 'out', 'to', 'be', 'very', 'different', 'from', 'the', 'case', 'of', 'prime', 'power', 'level', 'previously', 'studied', 'by', 'yang', 'and', 'the', 'second', 'author', 'we', 'also', 'obtain', 'an', 'analogous', 'result', 'for', 'drinfeld', 'modular', 'curves', 'our', 'proof', 'relies', 'on', 'similar', 'results', 'for', 'classical', 'jacobians', 'due', 'to', 'ohta', 'papikian', 'and', 'the', 'first', 'author', 'we', 'also', 'discuss', 'the', 'hecke', 'action', 'on', 'widetildej', 'and', 'its', 'eisenstein', 'property']] | [-0.1730855683409521, 0.039602209472471964, -0.10784849494186072, 0.046090725303038885, -0.09653399632101492, -0.12731338681582854, 0.020627664201146097, 0.2790740181621656, -0.28647617535349335, -0.2542877811219165, 0.06921100632819119, -0.26340041167700207, -0.17485266359839238, 0.25002225751127555, -0.12486062983472673, 0.010558584139941542, 0.003677492469268025, 0.10749518602014572, -0.07736203186038249, -0.3563704885814761, 0.41680819256547486, 0.04772078327753335, 0.21334139846555256, 0.05406062968540937, 0.08489153076859438, 0.02451507894010371, -0.025423564564849618, -0.0701913128317035, -0.14022394327692828, 0.13601968355283564, 0.2419766355130189, 0.021311887408132262, 0.14739786067599747, -0.3704617156488997, -0.11261599787229777, 0.15101062617141683, 0.09036541142377932, 0.03478330484688071, 0.030613354713664793, -0.2514415909426357, 0.12264205074983316, -0.17822416374055705, -0.19738997299804018, -0.09277280969193803, 0.022814416418836084, 0.017640792958016665, -0.20651894900783072, -0.002215607786432506, 0.08989795085859818, 0.13168581975799687, -0.06426163646063048, -0.14936879998565, -0.026839994335599807, 0.08365019145070242, 0.044573049923132685, 0.036218414714072285, 0.04367244306881473, -0.09968974294445976, -0.07795749400590793, 0.356553473632853, -0.0716456802966038, -0.1756299152390434, 0.10931194345862165, -0.14487021797301494, -0.18293425627492088, 0.1053723707918148, 0.10341357651500488, 0.1415449351573117, -0.04062512040825754, 0.16784677153534502, -0.10388082304512555, 0.1107659681457455, 0.14672006626162054, -0.08403097134399808, 0.1095730912693741, 0.038777271285653114, 0.05340708773758895, 0.15941422708763056, -0.02604379457035014, -0.05417790016343923, -0.3421401761709449, -0.19740375530255852, -0.1399014337649481, 0.12963373528547445, -0.09146770076644453, -0.13561066895512477, 0.40854852388279056, 0.07176980087346889, 0.21603313942861585, 0.11601187680180203, 0.19795756773003992, 0.12103816407034174, 0.0704306519265234, 0.0656474966441615, 0.17081955944205512, 0.19264754893495437, -0.030270043518921395, -0.18252892856829897, -0.030809091254717338, 0.18067763645623652] |
1,802.01067 | Computation of a Theoretical Membrane Phase Diagram, and the Role of
Phase in Lipid Raft-Mediated Protein Organization | Lipid phase heterogeneity in the plasma membrane is thought to be crucial for
many aspects of cell signaling, but the physical basis of participating
membrane domains such as "lipid rafts" remains controversial. Here we consider
a lattice model yielding a phase diagram that includes several states proposed
to be relevant for the cell membrane, including microemulsion - which can be
related to membrane curvature - and Ising critical behavior. Using a neural
network-based machine learning approach, we compute the full phase diagram of
this lattice model. We analyze selected regions of this phase diagram in the
context of a signaling initiation event in mast cells: recruitment of the
membrane-anchored tyrosine kinase Lyn to a cluster of transmembrane of
IgE-Fc{\epsilon}RI receptors. We find that model membrane systems in
microemulsion and Ising critical states can mediate roughly equal levels of
kinase recruitment (binding energy ~ -0.6 kBT), whereas a membrane near a
tricritical point can mediate much stronger kinase recruitment (-1.7 kBT). By
comparing several models for lipid heterogeneity within a single theoretical
framework, this work points to testable differences between existing models. We
also suggest the tricritical point as a new possibility for the basis of
membrane domains that facilitate preferential partitioning of signaling
components.
| physics.bio-ph q-bio.SC | lipid phase heterogeneity in the plasma membrane is thought to be crucial for many aspects of cell signaling but the physical basis of participating membrane domains such as lipid rafts remains controversial here we consider a lattice model yielding a phase diagram that includes several states proposed to be relevant for the cell membrane including microemulsion which can be related to membrane curvature and ising critical behavior using a neural networkbased machine learning approach we compute the full phase diagram of this lattice model we analyze selected regions of this phase diagram in the context of a signaling initiation event in mast cells recruitment of the membraneanchored tyrosine kinase lyn to a cluster of transmembrane of igefcepsilonri receptors we find that model membrane systems in microemulsion and ising critical states can mediate roughly equal levels of kinase recruitment binding energy 06 kbt whereas a membrane near a tricritical point can mediate much stronger kinase recruitment 17 kbt by comparing several models for lipid heterogeneity within a single theoretical framework this work points to testable differences between existing models we also suggest the tricritical point as a new possibility for the basis of membrane domains that facilitate preferential partitioning of signaling components | [['lipid', 'phase', 'heterogeneity', 'in', 'the', 'plasma', 'membrane', 'is', 'thought', 'to', 'be', 'crucial', 'for', 'many', 'aspects', 'of', 'cell', 'signaling', 'but', 'the', 'physical', 'basis', 'of', 'participating', 'membrane', 'domains', 'such', 'as', 'lipid', 'rafts', 'remains', 'controversial', 'here', 'we', 'consider', 'a', 'lattice', 'model', 'yielding', 'a', 'phase', 'diagram', 'that', 'includes', 'several', 'states', 'proposed', 'to', 'be', 'relevant', 'for', 'the', 'cell', 'membrane', 'including', 'microemulsion', 'which', 'can', 'be', 'related', 'to', 'membrane', 'curvature', 'and', 'ising', 'critical', 'behavior', 'using', 'a', 'neural', 'networkbased', 'machine', 'learning', 'approach', 'we', 'compute', 'the', 'full', 'phase', 'diagram', 'of', 'this', 'lattice', 'model', 'we', 'analyze', 'selected', 'regions', 'of', 'this', 'phase', 'diagram', 'in', 'the', 'context', 'of', 'a', 'signaling', 'initiation', 'event', 'in', 'mast', 'cells', 'recruitment', 'of', 'the', 'membraneanchored', 'tyrosine', 'kinase', 'lyn', 'to', 'a', 'cluster', 'of', 'transmembrane', 'of', 'igefcepsilonri', 'receptors', 'we', 'find', 'that', 'model', 'membrane', 'systems', 'in', 'microemulsion', 'and', 'ising', 'critical', 'states', 'can', 'mediate', 'roughly', 'equal', 'levels', 'of', 'kinase', 'recruitment', 'binding', 'energy', '06', 'kbt', 'whereas', 'a', 'membrane', 'near', 'a', 'tricritical', 'point', 'can', 'mediate', 'much', 'stronger', 'kinase', 'recruitment', '17', 'kbt', 'by', 'comparing', 'several', 'models', 'for', 'lipid', 'heterogeneity', 'within', 'a', 'single', 'theoretical', 'framework', 'this', 'work', 'points', 'to', 'testable', 'differences', 'between', 'existing', 'models', 'we', 'also', 'suggest', 'the', 'tricritical', 'point', 'as', 'a', 'new', 'possibility', 'for', 'the', 'basis', 'of', 'membrane', 'domains', 'that', 'facilitate', 'preferential', 'partitioning', 'of', 'signaling', 'components']] | [-0.12629946646513418, 0.18657718991395086, -0.02957676800666377, 0.053519008533330636, -0.01786126424995018, -0.18053303881781177, 0.11029581432710983, 0.37703400265425446, -0.23917486113263295, -0.24364223880227656, 0.018004481547977777, -0.25018838034709917, -0.23807080808270256, 0.13883830759325064, -0.03061446570442058, 0.010232337969355285, 0.02624777492135763, -0.00515006294939667, 0.04406044106930494, -0.15769043523294385, 0.2391268109669909, 0.032603574064560235, 0.2988778215716593, 0.10064727536402643, 0.07375856623810251, -0.05568796392850345, 0.07650361814536154, 0.019950080844573677, -0.17380063591601355, 0.10598693966574502, 0.2686603547521008, 0.0722714055411052, 0.25058755502104757, -0.4405966542009264, -0.30244292444549503, 0.10372655953746289, 0.2121253464836627, 0.13597455054157762, -0.03345619576983154, -0.24021091244183482, 0.05899264026986202, -0.1795725674420828, -0.09189213730627671, -0.06076629570685327, 0.0041784723033197226, 0.03470922246575356, -0.24496018098696368, 0.13796551372492105, 0.018362243432784454, 0.08859612493310123, -0.11130372515995987, -0.12463712451979518, -0.05749430233205203, 0.15790302923531271, 0.0349798056576401, 0.06362099631864111, 0.2398844349803403, -0.13625593391014262, -0.12863439134089277, 0.3575198450451717, 0.006332752453163266, -0.18530988694663392, 0.19138936517294497, -0.09997491937829181, -0.15110369487665593, 0.13748932698275895, 0.16873902388324497, 0.06725293402792885, -0.1773483876127284, 0.008862203192547895, 0.018851317582884802, 0.20766796205105492, 0.07155147000565193, -0.02875157691538334, 0.23824244341813028, 0.24558630458894185, 0.00680140788837889, 0.16380098364606965, -0.096128415025305, -0.1633751893506269, -0.24314934636000543, -0.16898179300129412, -0.12834658804349602, 0.007352677474264055, -0.10546878843553714, -0.20610576163977384, 0.39829133067280054, 0.10825472700176761, 0.1959441583287844, 0.023130314573063516, 0.19023176416871138, -0.004463828884763643, 0.09696347094839439, 0.005398147928062826, 0.19492194179911165, 0.1010282685351558, 0.10579345625359565, -0.24349558078683914, 0.07507109398953617, 0.061856083772145215] |
1,802.01068 | On real-space Density Functional Theory for non-orthogonal crystal
systems: Kronecker product formulation of the kinetic energy operator | We present an accurate and efficient real-space Density Functional Theory
(DFT) framework for the ab-initio study of non-orthogonal crystal systems.
Specifically, employing a local reformulation of the electrostatics, we develop
a novel Kronecker product formulation of the real-space kinetic energy operator
that significantly reduces the number of operations associated with the
Laplacian-vector multiplication, the dominant cost in practical computations.
In particular, we reduce the scaling with respect to finite-difference order
from quadratic to linear, thereby significantly bridging the gap in
computational cost between non-orthogonal and orthogonal systems. We verify the
accuracy and efficiency of the proposed methodology through selected examples.
| physics.comp-ph cond-mat.mtrl-sci | we present an accurate and efficient realspace density functional theory dft framework for the abinitio study of nonorthogonal crystal systems specifically employing a local reformulation of the electrostatics we develop a novel kronecker product formulation of the realspace kinetic energy operator that significantly reduces the number of operations associated with the laplacianvector multiplication the dominant cost in practical computations in particular we reduce the scaling with respect to finitedifference order from quadratic to linear thereby significantly bridging the gap in computational cost between nonorthogonal and orthogonal systems we verify the accuracy and efficiency of the proposed methodology through selected examples | [['we', 'present', 'an', 'accurate', 'and', 'efficient', 'realspace', 'density', 'functional', 'theory', 'dft', 'framework', 'for', 'the', 'abinitio', 'study', 'of', 'nonorthogonal', 'crystal', 'systems', 'specifically', 'employing', 'a', 'local', 'reformulation', 'of', 'the', 'electrostatics', 'we', 'develop', 'a', 'novel', 'kronecker', 'product', 'formulation', 'of', 'the', 'realspace', 'kinetic', 'energy', 'operator', 'that', 'significantly', 'reduces', 'the', 'number', 'of', 'operations', 'associated', 'with', 'the', 'laplacianvector', 'multiplication', 'the', 'dominant', 'cost', 'in', 'practical', 'computations', 'in', 'particular', 'we', 'reduce', 'the', 'scaling', 'with', 'respect', 'to', 'finitedifference', 'order', 'from', 'quadratic', 'to', 'linear', 'thereby', 'significantly', 'bridging', 'the', 'gap', 'in', 'computational', 'cost', 'between', 'nonorthogonal', 'and', 'orthogonal', 'systems', 'we', 'verify', 'the', 'accuracy', 'and', 'efficiency', 'of', 'the', 'proposed', 'methodology', 'through', 'selected', 'examples']] | [-0.1310429409183938, 0.020831741823143363, -0.06542240615200365, 0.03563699298161976, -0.038210236029981665, -0.10146447082021923, 0.09581939703573218, 0.3641764110499861, -0.27844039921771097, -0.31567045190016446, 0.011710221090147065, -0.2332554334711996, -0.20469781645394938, 0.1714268879249993, -0.025874346090160837, 0.10158495675546653, 0.05261882746385203, -0.031119417733127118, -0.16353437575779742, -0.21044000074022798, 0.29292589070209574, 0.1259050028436262, 0.31543285283407035, 0.031657801397765674, 0.07781932139392904, 0.054553612335255804, -0.04250366122207858, 0.03320313869702696, -0.10992506464316823, 0.20930302649209595, 0.27718257955675285, 0.07993155478904343, 0.3171387675848573, -0.4937564188031235, -0.1888292371342429, 0.044891503401984924, 0.12450804444726067, 0.11297704225330792, -0.05514841047209697, -0.21936388661840348, 0.07405022068555947, -0.22182662616662605, -0.104368564419359, -0.1507486322320847, -0.07007916163502619, 0.013061812568474749, -0.2750356301072646, 0.11335345074496787, -0.009766582079758548, 0.03792824567003985, -0.0706975788943413, -0.1134665943987931, 0.008283254163659583, 0.07117027231971874, -0.01305186909141614, 0.00529235446322333, 0.08507726846187554, -0.09208065024906337, -0.12697455331311572, 0.3801351809742475, -0.03993825655491703, -0.2395722517071085, 0.1883983448279476, -0.07895236748924497, -0.12209176862226667, 0.13937196894219578, 0.18393779979169725, 0.10307336829113539, -0.10965938657884383, 0.11554635275035363, 0.007509238099575871, 0.18027632222793094, 0.03339997748609143, 0.04950503963563177, 0.11142811699855057, 0.15324097479260856, 0.09268727623904595, 0.15713107454675165, -0.05855396213515596, -0.13601401190960197, -0.26792170681209876, -0.19520085262745557, -0.220219996400328, -0.005556989871576956, -0.12092125423283744, -0.14441781767615766, 0.42425505871498825, 0.1644479684729242, 0.110975807923071, 0.10141142698080101, 0.3225779388325684, 0.17363481214175921, 0.0711063279939646, 0.0749957292726395, 0.17352201292912164, 0.16270176135944298, 0.05378891951451548, -0.31138429817781227, -0.02206368636189386, 0.09392461796159471] |
1,802.01069 | The Distance and the near-IR extinction of the Monoceros Supernova
Remnant | Supernova remnants (SNRs) embody the information of the influence on dust
properties by the supernova explosion. Based on the color indexes from the
2MASS photometric survey and the stellar parameters from the
SDSS$-$DR12$/$APOGEE and LAMOST$-$DR2$/$LEGUE spectroscopic surveys, the
near-infrared extinction law and the distance of the Monoceros SNR are derived
together with its nearby two nebulas -- the Rosette Nebula and NGC 2264. The
distance is found at the position of the sharp increase of interstellar
extinction with distance and the nebular extinction is calculated by
subtracting the foreground interstellar extinction. The distance of the
Monoceros SNR is determined to be $1.98\,$kpc, larger than previous values.
Meanwhile, the distance of the Rosette Nebula is $1.55\,$kpc, generally
consistent with previous work. The distance between these two nebulas suggests
no interaction between them. The distance of NGC 2264, $1.20\,$kpc, exceeds
previous values. The color excess ratio, $E_{\rm JH}/E_{\rm JK_S}$, is 0.657
for the Monoceros SNR, consistent with the average value 0.652 for the Milky
Way (Xue et al. 2016). The consistency is resulted from that the SNR material
is dominated by interstellar dust rather than the supernova ejecta. $E_{\rm
JH}/E_{\rm JK_S}$ equals to 0.658 for the Rosette Nebula, further proving the
universality of the near-infrared extinction law.
| astro-ph.GA astro-ph.SR | supernova remnants snrs embody the information of the influence on dust properties by the supernova explosion based on the color indexes from the 2mass photometric survey and the stellar parameters from the sdssdr12apogee and lamostdr2legue spectroscopic surveys the nearinfrared extinction law and the distance of the monoceros snr are derived together with its nearby two nebulas the rosette nebula and ngc 2264 the distance is found at the position of the sharp increase of interstellar extinction with distance and the nebular extinction is calculated by subtracting the foreground interstellar extinction the distance of the monoceros snr is determined to be 198kpc larger than previous values meanwhile the distance of the rosette nebula is 155kpc generally consistent with previous work the distance between these two nebulas suggests no interaction between them the distance of ngc 2264 120kpc exceeds previous values the color excess ratio e_rm jhe_rm jk_s is 0657 for the monoceros snr consistent with the average value 0652 for the milky way xue et al 2016 the consistency is resulted from that the snr material is dominated by interstellar dust rather than the supernova ejecta e_rm jhe_rm jk_s equals to 0658 for the rosette nebula further proving the universality of the nearinfrared extinction law | [['supernova', 'remnants', 'snrs', 'embody', 'the', 'information', 'of', 'the', 'influence', 'on', 'dust', 'properties', 'by', 'the', 'supernova', 'explosion', 'based', 'on', 'the', 'color', 'indexes', 'from', 'the', '2mass', 'photometric', 'survey', 'and', 'the', 'stellar', 'parameters', 'from', 'the', 'sdssdr12apogee', 'and', 'lamostdr2legue', 'spectroscopic', 'surveys', 'the', 'nearinfrared', 'extinction', 'law', 'and', 'the', 'distance', 'of', 'the', 'monoceros', 'snr', 'are', 'derived', 'together', 'with', 'its', 'nearby', 'two', 'nebulas', 'the', 'rosette', 'nebula', 'and', 'ngc', '2264', 'the', 'distance', 'is', 'found', 'at', 'the', 'position', 'of', 'the', 'sharp', 'increase', 'of', 'interstellar', 'extinction', 'with', 'distance', 'and', 'the', 'nebular', 'extinction', 'is', 'calculated', 'by', 'subtracting', 'the', 'foreground', 'interstellar', 'extinction', 'the', 'distance', 'of', 'the', 'monoceros', 'snr', 'is', 'determined', 'to', 'be', '198kpc', 'larger', 'than', 'previous', 'values', 'meanwhile', 'the', 'distance', 'of', 'the', 'rosette', 'nebula', 'is', '155kpc', 'generally', 'consistent', 'with', 'previous', 'work', 'the', 'distance', 'between', 'these', 'two', 'nebulas', 'suggests', 'no', 'interaction', 'between', 'them', 'the', 'distance', 'of', 'ngc', '2264', '120kpc', 'exceeds', 'previous', 'values', 'the', 'color', 'excess', 'ratio', 'e_rm', 'jhe_rm', 'jk_s', 'is', '0657', 'for', 'the', 'monoceros', 'snr', 'consistent', 'with', 'the', 'average', 'value', '0652', 'for', 'the', 'milky', 'way', 'xue', 'et', 'al', '2016', 'the', 'consistency', 'is', 'resulted', 'from', 'that', 'the', 'snr', 'material', 'is', 'dominated', 'by', 'interstellar', 'dust', 'rather', 'than', 'the', 'supernova', 'ejecta', 'e_rm', 'jhe_rm', 'jk_s', 'equals', 'to', '0658', 'for', 'the', 'rosette', 'nebula', 'further', 'proving', 'the', 'universality', 'of', 'the', 'nearinfrared', 'extinction', 'law']] | [-0.04696221093792995, 0.03507365428518052, -0.08331401956401709, 0.06822383236386954, -0.0853620941016936, -0.05825922066449291, 0.05087023631730141, 0.43594935869402957, -0.19939588421645263, -0.3330134903927418, -0.005203867840317238, -0.30800653324283733, -0.014544037594036623, 0.17190513891553638, -0.07050134683724003, -0.06942388085978261, 0.05713353449633966, -0.09320272712243928, -0.029020179922747157, -0.2672530994045012, 0.29168079110248146, 0.12616372861160963, 0.16682439541204297, -0.015303786079672099, 0.051201135333159446, -0.11598491424111405, -0.06970461632002785, -0.043706461662577106, -0.1748071470184471, 0.08578127803694871, 0.13241664276214615, 0.14882354869159184, 0.15749666145696972, -0.2890887559965403, -0.2452532711645795, 0.07926826525333742, 0.1985166511107989, -0.0027553386424169547, 0.013334991990687382, -0.3024398476788492, 0.06208764436899336, -0.17717990667836722, -0.20140109688626848, 0.19896800147670538, 0.08362633726474913, 0.05740165526771711, -0.22503966062959999, 0.16872686098654274, -0.03937294847694122, 0.13880978850706602, -0.13919576731889105, -0.17507350987947612, -0.06517259216387615, 0.09423622233332182, 0.018738942033837015, 0.1139341237557337, 0.142508837667228, -0.1511772570701203, 0.02429024418204496, 0.41666425924249595, -0.002542454985263193, 0.052379962149331334, 0.19057810593001318, -0.18561484560492741, -0.11168032119078844, 0.15916831055573763, 0.06313222220562624, 0.06517896364888968, -0.18612265039818607, 0.033173201510134726, -0.049761010331543856, 0.17815999100290503, 0.06440736482982909, 0.094979832266042, 0.25329454706022236, 0.06041520480725049, 0.03433576249282318, 0.12910984504927947, -0.28891190036327574, -0.058370395730963365, -0.2446392237066498, -0.0861617729086617, -0.17959533345290563, 0.09321606932019796, -0.2321162640179285, -0.08422797235349815, 0.29681886815127323, 0.1190034825604108, 0.22178608713662157, 0.04877844901586121, 0.32020442661913956, 0.07733007046074201, 0.09397594604083817, 0.17083185916117422, 0.37472398800486134, 0.18986888753245537, 0.08818800752568576, -0.26575193634125016, 0.16590346578000623, 0.05980668619458535] |
1,802.0107 | A Highly Accelerated Parallel Multi-GPU based Reconstruction Algorithm
for Generating Accurate Relative Stopping Powers | Low-dose Proton Computed Tomography (pCT) is an evolving imaging modality
that is used in proton therapy planning which addresses the range uncertainty
problem. The goal of pCT is generating a 3D map of Relative Stopping Power
(RSP) measurements with high accuracy within clinically required time frames.
Generating accurate RSP values within the shortest amount of time is considered
a key goal when developing a pCT software. The existing pCT softwares have
successfully met this time frame and even succeeded this time goal, but
requiring clusters with hundreds of processors.
This paper describes a novel reconstruction technique using two Graphics
Processing Unit (GPU) cores, such as is available on a single Nvidia P100. The
proposed reconstruction technique is tested on both simulated and experimental
datasets and on two different systems namely Nvidia K40 and P100 GPUs from IBM
and Cray. The experimental results demonstrate that our proposed reconstruction
method meets both the timing and accuracy with the benefit of having reasonable
cost, and efficient use of power.
| physics.med-ph cs.DC | lowdose proton computed tomography pct is an evolving imaging modality that is used in proton therapy planning which addresses the range uncertainty problem the goal of pct is generating a 3d map of relative stopping power rsp measurements with high accuracy within clinically required time frames generating accurate rsp values within the shortest amount of time is considered a key goal when developing a pct software the existing pct softwares have successfully met this time frame and even succeeded this time goal but requiring clusters with hundreds of processors this paper describes a novel reconstruction technique using two graphics processing unit gpu cores such as is available on a single nvidia p100 the proposed reconstruction technique is tested on both simulated and experimental datasets and on two different systems namely nvidia k40 and p100 gpus from ibm and cray the experimental results demonstrate that our proposed reconstruction method meets both the timing and accuracy with the benefit of having reasonable cost and efficient use of power | [['lowdose', 'proton', 'computed', 'tomography', 'pct', 'is', 'an', 'evolving', 'imaging', 'modality', 'that', 'is', 'used', 'in', 'proton', 'therapy', 'planning', 'which', 'addresses', 'the', 'range', 'uncertainty', 'problem', 'the', 'goal', 'of', 'pct', 'is', 'generating', 'a', '3d', 'map', 'of', 'relative', 'stopping', 'power', 'rsp', 'measurements', 'with', 'high', 'accuracy', 'within', 'clinically', 'required', 'time', 'frames', 'generating', 'accurate', 'rsp', 'values', 'within', 'the', 'shortest', 'amount', 'of', 'time', 'is', 'considered', 'a', 'key', 'goal', 'when', 'developing', 'a', 'pct', 'software', 'the', 'existing', 'pct', 'softwares', 'have', 'successfully', 'met', 'this', 'time', 'frame', 'and', 'even', 'succeeded', 'this', 'time', 'goal', 'but', 'requiring', 'clusters', 'with', 'hundreds', 'of', 'processors', 'this', 'paper', 'describes', 'a', 'novel', 'reconstruction', 'technique', 'using', 'two', 'graphics', 'processing', 'unit', 'gpu', 'cores', 'such', 'as', 'is', 'available', 'on', 'a', 'single', 'nvidia', 'p100', 'the', 'proposed', 'reconstruction', 'technique', 'is', 'tested', 'on', 'both', 'simulated', 'and', 'experimental', 'datasets', 'and', 'on', 'two', 'different', 'systems', 'namely', 'nvidia', 'k40', 'and', 'p100', 'gpus', 'from', 'ibm', 'and', 'cray', 'the', 'experimental', 'results', 'demonstrate', 'that', 'our', 'proposed', 'reconstruction', 'method', 'meets', 'both', 'the', 'timing', 'and', 'accuracy', 'with', 'the', 'benefit', 'of', 'having', 'reasonable', 'cost', 'and', 'efficient', 'use', 'of', 'power']] | [-0.06774369053155498, 0.03357549210674065, -0.055879184745844024, 0.01614471979324246, -0.03069236051958862, -0.15293855024207137, 0.02186776392501274, 0.4361683614327606, -0.2229807135447052, -0.39411903733769094, 0.1220718460446448, -0.2599758041927209, -0.061527082143934916, 0.27489673769303474, -0.06477031643019922, 0.16150905526495968, 0.17896301081089908, 0.03793826547776719, -0.0688208636749923, -0.25961890391579756, 0.20275233961509945, 0.09442270006872265, 0.32208838144945634, 0.040570650633679796, 0.1589704620657511, 0.0029734684973506324, -0.0065990413794383765, -0.010091447613639644, -0.043113597214705146, 0.15452984175665854, 0.26662568331006015, 0.21485612677769308, 0.2867102633785816, -0.45290502973170166, -0.1907854800909219, 0.07711487995034241, 0.12176458279851891, 0.047288572690705626, -0.11042555111477219, -0.23379093090476222, 0.08352749311948666, -0.1589079335183242, -0.03502063739681736, -0.09567510465816427, -0.017495564081290937, -0.002540337919055608, -0.2750655236844736, 0.049541916917022095, -0.03934489732518959, 0.0623197947314615, -0.06815918173265072, -0.13877671016576554, 0.06574946547246886, 0.14839223805055476, -0.025338306424841958, 0.11586565406802278, 0.15429210660317128, -0.09917520568285317, -0.14165165131148624, 0.4075101855020207, -0.018468266972957784, -0.19075828472380976, 0.1734241673004735, -0.08539673655310713, -0.1555556250954922, 0.1227767925515928, 0.17862641053408923, 0.12713463703753897, -0.17383438242076552, 0.04096795258382952, 0.009622596681162894, 0.23007916966425143, 0.08081884868162494, -0.02164158284529505, 0.14543661890068957, 0.26125078819866054, 0.00708077233481075, 0.1271760965135027, -0.17162570156611456, -0.061855440690737576, -0.22148521795675316, -0.17104400065368117, -0.21644030549810325, -0.03191978617077581, -0.08494766345410677, -0.0978084095720067, 0.40564600579126414, 0.20943072877532568, 0.14579435640452318, 0.07481408877373975, 0.41161992991096286, 0.057816165321961, 0.11981873531792178, 0.09955441117488656, 0.14541463800201035, 0.0277239230053965, 0.13873746108224458, -0.22045279269847257, 0.04728955912112023, 0.007091377648603485] |
1,802.01071 | Hierarchical Adversarially Learned Inference | We propose a novel hierarchical generative model with a simple Markovian
structure and a corresponding inference model. Both the generative and
inference model are trained using the adversarial learning paradigm. We
demonstrate that the hierarchical structure supports the learning of
progressively more abstract representations as well as providing semantically
meaningful reconstructions with different levels of fidelity. Furthermore, we
show that minimizing the Jensen-Shanon divergence between the generative and
inference network is enough to minimize the reconstruction error. The resulting
semantically meaningful hierarchical latent structure discovery is exemplified
on the CelebA dataset. There, we show that the features learned by our model in
an unsupervised way outperform the best handcrafted features. Furthermore, the
extracted features remain competitive when compared to several recent deep
supervised approaches on an attribute prediction task on CelebA. Finally, we
leverage the model's inference network to achieve state-of-the-art performance
on a semi-supervised variant of the MNIST digit classification task.
| stat.ML cs.LG | we propose a novel hierarchical generative model with a simple markovian structure and a corresponding inference model both the generative and inference model are trained using the adversarial learning paradigm we demonstrate that the hierarchical structure supports the learning of progressively more abstract representations as well as providing semantically meaningful reconstructions with different levels of fidelity furthermore we show that minimizing the jensenshanon divergence between the generative and inference network is enough to minimize the reconstruction error the resulting semantically meaningful hierarchical latent structure discovery is exemplified on the celeba dataset there we show that the features learned by our model in an unsupervised way outperform the best handcrafted features furthermore the extracted features remain competitive when compared to several recent deep supervised approaches on an attribute prediction task on celeba finally we leverage the models inference network to achieve stateoftheart performance on a semisupervised variant of the mnist digit classification task | [['we', 'propose', 'a', 'novel', 'hierarchical', 'generative', 'model', 'with', 'a', 'simple', 'markovian', 'structure', 'and', 'a', 'corresponding', 'inference', 'model', 'both', 'the', 'generative', 'and', 'inference', 'model', 'are', 'trained', 'using', 'the', 'adversarial', 'learning', 'paradigm', 'we', 'demonstrate', 'that', 'the', 'hierarchical', 'structure', 'supports', 'the', 'learning', 'of', 'progressively', 'more', 'abstract', 'representations', 'as', 'well', 'as', 'providing', 'semantically', 'meaningful', 'reconstructions', 'with', 'different', 'levels', 'of', 'fidelity', 'furthermore', 'we', 'show', 'that', 'minimizing', 'the', 'jensenshanon', 'divergence', 'between', 'the', 'generative', 'and', 'inference', 'network', 'is', 'enough', 'to', 'minimize', 'the', 'reconstruction', 'error', 'the', 'resulting', 'semantically', 'meaningful', 'hierarchical', 'latent', 'structure', 'discovery', 'is', 'exemplified', 'on', 'the', 'celeba', 'dataset', 'there', 'we', 'show', 'that', 'the', 'features', 'learned', 'by', 'our', 'model', 'in', 'an', 'unsupervised', 'way', 'outperform', 'the', 'best', 'handcrafted', 'features', 'furthermore', 'the', 'extracted', 'features', 'remain', 'competitive', 'when', 'compared', 'to', 'several', 'recent', 'deep', 'supervised', 'approaches', 'on', 'an', 'attribute', 'prediction', 'task', 'on', 'celeba', 'finally', 'we', 'leverage', 'the', 'models', 'inference', 'network', 'to', 'achieve', 'stateoftheart', 'performance', 'on', 'a', 'semisupervised', 'variant', 'of', 'the', 'mnist', 'digit', 'classification', 'task']] | [-0.006020449545375365, -0.0393822918740625, -0.06865066307517209, 0.11383387110177673, -0.12624689750067009, -0.16955313376322584, 0.03703204801269366, 0.48757470462863384, -0.30071840370319, -0.3419226698430353, 0.037949478599138706, -0.27003042826330975, -0.23041332536377013, 0.17084982488794545, -0.1426178364919523, 0.07507148025768784, 0.1523840251519639, 0.07395056844229418, -0.09152120513700586, -0.2818980054442746, 0.31129794790314536, 0.060522188295994726, 0.38407182528049144, -0.025094915300877273, 0.15032073050296227, -0.0704864286526572, 0.002905819889795231, -0.019405330371993938, -0.0635778049770938, 0.2149089147707472, 0.28601958111838893, 0.21467645513812864, 0.31293177260637384, -0.38715299708296935, -0.23924583597506985, 0.07854874698004048, 0.1158337925689442, 0.12869056041879384, -0.021003431639512297, -0.384739789952475, 0.0767694624006062, -0.18354056764541096, 0.0977198654375235, -0.23120484683941436, -0.0858781000830564, -0.05774509300183701, -0.3049051792963598, 0.07877159138259135, 0.11561713663104456, 0.04933236416821417, -0.08425744444952886, -0.12850371414127662, -0.0065497281581261444, 0.12733858317924865, 0.004652806047632016, 0.0607140318300624, 0.12142653117801896, -0.2210229288462678, -0.18521708618898533, 0.32678242050429906, -0.09095199445858414, -0.22141391116555928, 0.19854669143004636, 0.013216598281073138, -0.17021844024144994, 0.04929206968211618, 0.22467444472223227, 0.12691707508967834, -0.14883714580096957, 0.0010753006166564056, -0.08116267135023679, 0.2068913518535402, 0.006001669040415436, -0.03264678456808293, 0.16888353884898702, 0.3247258441865836, 0.01367571910438863, 0.1587739948169512, -0.16647236453565328, -0.09513443994709585, -0.21102907737153337, -0.046539559730598215, -0.1884275590970279, -0.03932023420929909, -0.15111836230990824, -0.16859079307821384, 0.41412955696547504, 0.26236258968282, 0.2829316558337795, 0.17830590040447483, 0.33632071853590834, 0.02317702883508326, 0.09214206513532094, 0.12406057146864968, 0.1654676721541603, 0.007162091743482865, 0.05865593490766754, -0.16607772210600638, 0.12635651413323726, 0.03569011350076547] |
1,802.01072 | First Principles Study of Structural and Optical Properties of B$_{12}$
Isomers | In this work we undertake a comprehensive numerical study of the ground state
structures and optical absorption spectra of isomers of B$_{12}$ cluster.
Geometry optimization was performed at the coupled-cluster-singles-doubles
(CCSD) level of theory, employing cc-pVDZ extended basis sets. Once the
geometry of a given isomer was optimized, its ground state energy was
calculated more accurately at the coupled-cluster-singles-doubles along with
perturbative treatment of triples (CCSD(T)) level of theory, employing larger
cc-pVTZ basis sets. Thus, our computed values of binding energies of various
isomers are expected to be quite accurate. Our geometry optimization reveals
eleven distinct isomers, along with their point group, and electronic ground
state symmetries. We also performed vibrational frequency analysis on the three
lowest energy isomers, and found them to be stable. Therefore, we computed the
linear optical absorption spectra of these isomers of B$_{12}$, employing
large-scale multi-reference singles-doubles configuration-interaction (MRSDCI)
approach, and found a strong structure-property relationship. This implies that
the spectral fingerprints of the geometries can be utilized for optical
detection, and characterization, of various isomers of B$_{12}$. We also
explored the stability of the isomer with with the structure of a perfect
icosahedron, with $I_{h}$ symmetry. In bulk boron icosahedron is the basic
structural unit, but, our vibrational frequency analysis reveals that it is
unstable in the isolated form. We speculate that this instability could be due
to Jahn-Teller distortion because five-fold degenerate HOMO orbitals in $I_{h}$
structure are unfilled.
| physics.atm-clus cond-mat.mtrl-sci physics.chem-ph | in this work we undertake a comprehensive numerical study of the ground state structures and optical absorption spectra of isomers of b_12 cluster geometry optimization was performed at the coupledclustersinglesdoubles ccsd level of theory employing ccpvdz extended basis sets once the geometry of a given isomer was optimized its ground state energy was calculated more accurately at the coupledclustersinglesdoubles along with perturbative treatment of triples ccsdt level of theory employing larger ccpvtz basis sets thus our computed values of binding energies of various isomers are expected to be quite accurate our geometry optimization reveals eleven distinct isomers along with their point group and electronic ground state symmetries we also performed vibrational frequency analysis on the three lowest energy isomers and found them to be stable therefore we computed the linear optical absorption spectra of these isomers of b_12 employing largescale multireference singlesdoubles configurationinteraction mrsdci approach and found a strong structureproperty relationship this implies that the spectral fingerprints of the geometries can be utilized for optical detection and characterization of various isomers of b_12 we also explored the stability of the isomer with with the structure of a perfect icosahedron with i_h symmetry in bulk boron icosahedron is the basic structural unit but our vibrational frequency analysis reveals that it is unstable in the isolated form we speculate that this instability could be due to jahnteller distortion because fivefold degenerate homo orbitals in i_h structure are unfilled | [['in', 'this', 'work', 'we', 'undertake', 'a', 'comprehensive', 'numerical', 'study', 'of', 'the', 'ground', 'state', 'structures', 'and', 'optical', 'absorption', 'spectra', 'of', 'isomers', 'of', 'b_12', 'cluster', 'geometry', 'optimization', 'was', 'performed', 'at', 'the', 'coupledclustersinglesdoubles', 'ccsd', 'level', 'of', 'theory', 'employing', 'ccpvdz', 'extended', 'basis', 'sets', 'once', 'the', 'geometry', 'of', 'a', 'given', 'isomer', 'was', 'optimized', 'its', 'ground', 'state', 'energy', 'was', 'calculated', 'more', 'accurately', 'at', 'the', 'coupledclustersinglesdoubles', 'along', 'with', 'perturbative', 'treatment', 'of', 'triples', 'ccsdt', 'level', 'of', 'theory', 'employing', 'larger', 'ccpvtz', 'basis', 'sets', 'thus', 'our', 'computed', 'values', 'of', 'binding', 'energies', 'of', 'various', 'isomers', 'are', 'expected', 'to', 'be', 'quite', 'accurate', 'our', 'geometry', 'optimization', 'reveals', 'eleven', 'distinct', 'isomers', 'along', 'with', 'their', 'point', 'group', 'and', 'electronic', 'ground', 'state', 'symmetries', 'we', 'also', 'performed', 'vibrational', 'frequency', 'analysis', 'on', 'the', 'three', 'lowest', 'energy', 'isomers', 'and', 'found', 'them', 'to', 'be', 'stable', 'therefore', 'we', 'computed', 'the', 'linear', 'optical', 'absorption', 'spectra', 'of', 'these', 'isomers', 'of', 'b_12', 'employing', 'largescale', 'multireference', 'singlesdoubles', 'configurationinteraction', 'mrsdci', 'approach', 'and', 'found', 'a', 'strong', 'structureproperty', 'relationship', 'this', 'implies', 'that', 'the', 'spectral', 'fingerprints', 'of', 'the', 'geometries', 'can', 'be', 'utilized', 'for', 'optical', 'detection', 'and', 'characterization', 'of', 'various', 'isomers', 'of', 'b_12', 'we', 'also', 'explored', 'the', 'stability', 'of', 'the', 'isomer', 'with', 'with', 'the', 'structure', 'of', 'a', 'perfect', 'icosahedron', 'with', 'i_h', 'symmetry', 'in', 'bulk', 'boron', 'icosahedron', 'is', 'the', 'basic', 'structural', 'unit', 'but', 'our', 'vibrational', 'frequency', 'analysis', 'reveals', 'that', 'it', 'is', 'unstable', 'in', 'the', 'isolated', 'form', 'we', 'speculate', 'that', 'this', 'instability', 'could', 'be', 'due', 'to', 'jahnteller', 'distortion', 'because', 'fivefold', 'degenerate', 'homo', 'orbitals', 'in', 'i_h', 'structure', 'are', 'unfilled']] | [-0.11380524408225463, 0.07878663762806891, -0.07675404275138663, 0.07178574689399275, 0.0017000646280666066, -0.09962903090123819, 0.06802237433138598, 0.4210597701593597, -0.22974988643247157, -0.28817611358438927, 0.02529265736349118, -0.28429880481622277, -0.12091778258397044, 0.13564809503901398, 0.06504841967740566, 0.0236571824179219, 0.07313826767594403, 0.0032917052073579314, -0.08624839200190483, -0.18098915387870362, 0.276202929023112, 0.10417671202090927, 0.2880501538986722, 0.058602173688312054, 0.03109892786970028, -0.026996547882604357, 0.05584758111777214, 0.029460846959875945, -0.14386704821598145, 0.18002505316876638, 0.28623548716915626, 0.0342314382079734, 0.19306675688379532, -0.4183204451846516, -0.17632721729067147, 0.042183075331024125, 0.12846022928914685, 0.16380323889965298, -0.013046932034779033, -0.2652035753469532, 0.07231874741204919, -0.15926463103904906, -0.1488391666704964, -0.1399228607610855, -0.01067666701065042, 0.015803476930874534, -0.19427348266835284, 0.09311458967107698, -0.01900110442418223, 0.10396627298731388, -0.15195671296588933, -0.17458337139284524, -0.10868887233738907, 0.08247608544790529, 0.003613309064107891, -0.003925235614401455, 0.13927549928572014, -0.04718756178119339, -0.11247663732228053, 0.4290126702692519, -0.004153735137695813, -0.13398880447145614, 0.1727285857650558, -0.1605429888730789, -0.17312497263833976, 0.19003218066337335, 0.08107743235792503, 0.1320226920975579, -0.09811464844432731, 0.06161254533426239, -0.001839016291559634, 0.20915702636153177, 0.08886587000491782, 0.05954339977803552, 0.18302549069158286, 0.1448536308354929, 0.03010429575259232, 0.14227698415589446, -0.11255804524355484, -0.08985166759110796, -0.21702330340193504, -0.1221700733423439, -0.1593970596893794, 0.05356800458672592, -0.041893703938333984, -0.184569138683315, 0.41669584622976774, 0.04948278323699457, 0.1529591496144302, -0.037463546909678444, 0.24072460001722598, 0.09022074991699834, 0.05729974682231903, 0.02783334516108227, 0.27295868741109586, 0.1650503154975386, 0.0001750937809781609, -0.26694194968634594, 0.024172071408297326, 0.05620288488188456] |
1,802.01073 | Weighted Hamming Metric Structures | A weighted Hamming metric is introduced in [4] and it showed that the binary
generalized Goppa code is a perfect code in some weighted Hamming metric. In
this paper, we study the weight structures which admit the binary Hamming code
and the extended binary Hamming code to be perfect codes in the weighted
Hamming metric. And, we also give some structures of a 2-perfect code and how
to construct a 2-perfect code in some weighted Hamming metric.
| cs.IT math.IT | a weighted hamming metric is introduced in 4 and it showed that the binary generalized goppa code is a perfect code in some weighted hamming metric in this paper we study the weight structures which admit the binary hamming code and the extended binary hamming code to be perfect codes in the weighted hamming metric and we also give some structures of a 2perfect code and how to construct a 2perfect code in some weighted hamming metric | [['a', 'weighted', 'hamming', 'metric', 'is', 'introduced', 'in', '4', 'and', 'it', 'showed', 'that', 'the', 'binary', 'generalized', 'goppa', 'code', 'is', 'a', 'perfect', 'code', 'in', 'some', 'weighted', 'hamming', 'metric', 'in', 'this', 'paper', 'we', 'study', 'the', 'weight', 'structures', 'which', 'admit', 'the', 'binary', 'hamming', 'code', 'and', 'the', 'extended', 'binary', 'hamming', 'code', 'to', 'be', 'perfect', 'codes', 'in', 'the', 'weighted', 'hamming', 'metric', 'and', 'we', 'also', 'give', 'some', 'structures', 'of', 'a', '2perfect', 'code', 'and', 'how', 'to', 'construct', 'a', '2perfect', 'code', 'in', 'some', 'weighted', 'hamming', 'metric']] | [-0.15312986262142658, 0.058958023072934, -0.07745387153579043, 0.1751335773741004, -0.04279110846774919, -0.20643862003049293, 0.02692340833419184, 0.4277945687728269, -0.35130668176313884, -0.23237179964780807, 0.10157793449304466, -0.28534871249084737, -0.20838772259386523, 0.13482160426301326, -0.12549239672817192, 0.09469667135120986, 0.14823189619686697, 0.10246839913423929, -0.14506358244795015, -0.37834343246438285, 0.3989006589203105, 0.1871238276286825, 0.15608889899706443, 0.05431123455841239, 0.0741865470787728, 0.0004473311294402395, -0.04985412850661518, 0.03918259353800253, -0.20610605694654824, 0.11800147210816284, 0.2645930228875829, 0.2506222829416201, 0.18657577068049025, -0.2656053060230303, -0.2429688235611788, 0.1470645038144929, 0.034375684958725394, 0.13625697887581228, -0.016189426752170184, -0.177094570371661, 0.17222552071627859, -0.23402440180252124, -0.0042048342792051175, 0.022549382749606262, -0.00021531158308317136, 0.024828773980669967, -0.23670417288100565, -0.058781334408029746, 0.1177050628784028, 0.02686916690851961, -0.1067623006446021, -0.11665264286052485, 0.034520346502011474, 0.07160496289007269, -0.10537589910476432, 0.15489584896048264, -0.06278916158677116, -0.003635176926149757, -0.13860929894031254, 0.4129860857864479, -0.04292244142429395, -0.29463669343234655, 0.07493934151414153, -0.0627640826603422, -0.1018263567480948, 0.0444881741997677, 0.23628784901789063, 0.1610691433699874, -0.08465042763522693, 0.09988716027892933, -0.09497823759719923, 0.17101654889328138, 0.15455598214810545, 0.10001049835428402, 0.13521213957725406, 0.016661877223810594, 0.033186181121832366, 0.2760384156801073, -0.050521568352864546, -0.08458770753501298, -0.23903621643684902, -0.18467522072515075, -0.16999743986487775, 0.04346662113902631, -0.2227825127994073, -0.2807839320271046, 0.38049655872118937, 0.06804684531427437, 0.15560614130861888, 0.11326513198875617, 0.21021073565261994, -0.04000504641467101, 0.09297934822834932, 0.22166043452241205, 0.13783580155449, 0.17009272879932996, -0.05602395637323717, -0.14654285616737295, 0.034789576538756806, 0.181329045819675] |
1,802.01074 | Pair-Linking for Collective Entity Disambiguation: Two Could Be Better
Than All | Collective entity disambiguation aims to jointly resolve multiple mentions by
linking them to their associated entities in a knowledge base. Previous works
are primarily based on the underlying assumption that entities within the same
document are highly related. However, the extend to which these mentioned
entities are actually connected in reality is rarely studied and therefore
raises interesting research questions. For the first time, we show that the
semantic relationships between the mentioned entities are in fact less dense
than expected. This could be attributed to several reasons such as noise, data
sparsity and knowledge base incompleteness. As a remedy, we introduce MINTREE,
a new tree-based objective for the entity disambiguation problem. The key
intuition behind MINTREE is the concept of coherence relaxation which utilizes
the weight of a minimum spanning tree to measure the coherence between
entities. Based on this new objective, we design a novel entity disambiguation
algorithms which we call Pair-Linking. Instead of considering all the given
mentions, Pair-Linking iteratively selects a pair with the highest confidence
at each step for decision making. Via extensive experiments, we show that our
approach is not only more accurate but also surprisingly faster than many
state-of-the-art collective linking algorithms.
| cs.IR cs.CL | collective entity disambiguation aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base previous works are primarily based on the underlying assumption that entities within the same document are highly related however the extend to which these mentioned entities are actually connected in reality is rarely studied and therefore raises interesting research questions for the first time we show that the semantic relationships between the mentioned entities are in fact less dense than expected this could be attributed to several reasons such as noise data sparsity and knowledge base incompleteness as a remedy we introduce mintree a new treebased objective for the entity disambiguation problem the key intuition behind mintree is the concept of coherence relaxation which utilizes the weight of a minimum spanning tree to measure the coherence between entities based on this new objective we design a novel entity disambiguation algorithms which we call pairlinking instead of considering all the given mentions pairlinking iteratively selects a pair with the highest confidence at each step for decision making via extensive experiments we show that our approach is not only more accurate but also surprisingly faster than many stateoftheart collective linking algorithms | [['collective', 'entity', 'disambiguation', 'aims', 'to', 'jointly', 'resolve', 'multiple', 'mentions', 'by', 'linking', 'them', 'to', 'their', 'associated', 'entities', 'in', 'a', 'knowledge', 'base', 'previous', 'works', 'are', 'primarily', 'based', 'on', 'the', 'underlying', 'assumption', 'that', 'entities', 'within', 'the', 'same', 'document', 'are', 'highly', 'related', 'however', 'the', 'extend', 'to', 'which', 'these', 'mentioned', 'entities', 'are', 'actually', 'connected', 'in', 'reality', 'is', 'rarely', 'studied', 'and', 'therefore', 'raises', 'interesting', 'research', 'questions', 'for', 'the', 'first', 'time', 'we', 'show', 'that', 'the', 'semantic', 'relationships', 'between', 'the', 'mentioned', 'entities', 'are', 'in', 'fact', 'less', 'dense', 'than', 'expected', 'this', 'could', 'be', 'attributed', 'to', 'several', 'reasons', 'such', 'as', 'noise', 'data', 'sparsity', 'and', 'knowledge', 'base', 'incompleteness', 'as', 'a', 'remedy', 'we', 'introduce', 'mintree', 'a', 'new', 'treebased', 'objective', 'for', 'the', 'entity', 'disambiguation', 'problem', 'the', 'key', 'intuition', 'behind', 'mintree', 'is', 'the', 'concept', 'of', 'coherence', 'relaxation', 'which', 'utilizes', 'the', 'weight', 'of', 'a', 'minimum', 'spanning', 'tree', 'to', 'measure', 'the', 'coherence', 'between', 'entities', 'based', 'on', 'this', 'new', 'objective', 'we', 'design', 'a', 'novel', 'entity', 'disambiguation', 'algorithms', 'which', 'we', 'call', 'pairlinking', 'instead', 'of', 'considering', 'all', 'the', 'given', 'mentions', 'pairlinking', 'iteratively', 'selects', 'a', 'pair', 'with', 'the', 'highest', 'confidence', 'at', 'each', 'step', 'for', 'decision', 'making', 'via', 'extensive', 'experiments', 'we', 'show', 'that', 'our', 'approach', 'is', 'not', 'only', 'more', 'accurate', 'but', 'also', 'surprisingly', 'faster', 'than', 'many', 'stateoftheart', 'collective', 'linking', 'algorithms']] | [-0.10040796048251373, 0.07122790074533769, -0.05433772935480031, 0.11852963754332856, -0.17013399855016262, -0.1322822991928776, 0.08786717970911083, 0.42576426513809806, -0.28995257095542504, -0.32728742003005923, 0.05801105635952167, -0.2675490536760104, -0.17365460434744162, 0.16150693208018205, -0.09488362381542054, 0.036271421744625276, 0.07869221492218997, 0.10403400269363, -0.048889931694363356, -0.2410449702339956, 0.3513691476179845, 0.07395325385289371, 0.30446086368206793, 0.039435392524574314, 0.11338618012123888, -0.008539748543561413, -0.08054823562417765, 0.0045489621068573165, -0.06173951839870829, 0.1805147814752326, 0.33343083896026543, 0.21748018505165193, 0.34481754522477537, -0.3880919896416026, -0.19254763912277173, 0.08526151419704694, 0.15399578370645567, 0.10028076747510355, 0.007758846142087581, -0.2905680467681912, 0.09933867043848646, -0.14311379259026746, -0.018675826049083608, -0.08969369534282534, -0.005957679340833335, 0.029644056962599724, -0.2165298100896558, 0.04783592356453404, 0.10424766018466675, 0.030740655164428168, -0.05197486102930861, -0.11584734918578023, 0.04490928457657509, 0.1544492815734658, 0.04403481951697261, 0.027155275567704196, 0.10603934981704212, -0.12621519381539698, -0.15618254720389388, 0.3894410511823891, -0.011770738357457044, -0.20705282384633716, 0.21889863646622312, -0.06345502131850209, -0.19424941832776452, 0.08809551286988604, 0.14237365319492853, 0.1171269314543097, -0.2018197066514625, -0.029717360023376035, -0.07668697863561928, 0.19844240530720217, 0.09166104438345936, 0.034265973888867096, 0.20526378274171939, 0.20552742249819303, 0.08210652194613459, 0.10532126210684306, -0.04600826656929841, -0.09546504860334949, -0.25752976975258357, -0.14185431912867294, -0.20086499786318804, -0.016124548063643614, -0.06718434945329774, -0.12998119226850682, 0.3610688285419935, 0.23971152047952873, 0.23668397660958132, 0.060713117121397354, 0.3080715124310954, 0.03443549243499274, 0.09324644616542639, 0.11152174793713286, 0.18616457754358423, 0.038305750269168604, 0.0836458738330695, -0.15156366667582602, 0.13345642967417312, 0.0677536989108371] |
1,802.01075 | Mean-variance portfolio selection and variance hedging with random
coefficients: closed-loop equilibrium strategy | In this paper, both dynamic mean-variance portfolio selection problems and
dynamic variance hedging problems are discussed under non-Markovian framework.
Explicit closed-loop equilibrium strategies of these problems are respectively
obtained via a unified approach for the first time. Several new interesting
facts arise in mean-variance problems with constant risk aversion. For example,
it is shown that equilibrium strategies are still allowed to rely on initial
wealth as long as risk-free return rate is random. In addition, the closed-loop
equilibrium strategy and open-loop equilibrium strategy have the same
connection with initial wealth in non-Markovian setting, and they happen to
equal to each other if only risk-free return rate is deterministic.
| math.OC | in this paper both dynamic meanvariance portfolio selection problems and dynamic variance hedging problems are discussed under nonmarkovian framework explicit closedloop equilibrium strategies of these problems are respectively obtained via a unified approach for the first time several new interesting facts arise in meanvariance problems with constant risk aversion for example it is shown that equilibrium strategies are still allowed to rely on initial wealth as long as riskfree return rate is random in addition the closedloop equilibrium strategy and openloop equilibrium strategy have the same connection with initial wealth in nonmarkovian setting and they happen to equal to each other if only riskfree return rate is deterministic | [['in', 'this', 'paper', 'both', 'dynamic', 'meanvariance', 'portfolio', 'selection', 'problems', 'and', 'dynamic', 'variance', 'hedging', 'problems', 'are', 'discussed', 'under', 'nonmarkovian', 'framework', 'explicit', 'closedloop', 'equilibrium', 'strategies', 'of', 'these', 'problems', 'are', 'respectively', 'obtained', 'via', 'a', 'unified', 'approach', 'for', 'the', 'first', 'time', 'several', 'new', 'interesting', 'facts', 'arise', 'in', 'meanvariance', 'problems', 'with', 'constant', 'risk', 'aversion', 'for', 'example', 'it', 'is', 'shown', 'that', 'equilibrium', 'strategies', 'are', 'still', 'allowed', 'to', 'rely', 'on', 'initial', 'wealth', 'as', 'long', 'as', 'riskfree', 'return', 'rate', 'is', 'random', 'in', 'addition', 'the', 'closedloop', 'equilibrium', 'strategy', 'and', 'openloop', 'equilibrium', 'strategy', 'have', 'the', 'same', 'connection', 'with', 'initial', 'wealth', 'in', 'nonmarkovian', 'setting', 'and', 'they', 'happen', 'to', 'equal', 'to', 'each', 'other', 'if', 'only', 'riskfree', 'return', 'rate', 'is', 'deterministic']] | [-0.08190706001348896, 0.06617160357051978, -0.10612193038859577, 0.13040865785916578, -0.08821217608810575, -0.23571436259360914, 0.09737967998565485, 0.4459979157135994, -0.32046542568477215, -0.25163436911168025, 0.19974435397199597, -0.22103180991985868, -0.1497670994485142, 0.20830216992180794, -0.14281118635295165, 0.09494305070903566, 0.060523291939817786, 0.005032457161211857, 0.03748734500711887, -0.31666033540817873, 0.28650544825251456, 0.04821992331805328, 0.2874640861129457, -0.0009844382708521422, 0.13455839562704097, -0.020941051451868756, 0.006663781405357575, 0.054026012125649246, -0.14978173757393692, 0.05740193043311592, 0.30727001660313735, 0.15110176971130487, 0.40589100723930943, -0.41190288779843187, -0.1769596831355658, 0.164398469970803, 0.05727283823890267, 0.1205482068600961, -0.025287600519799593, -0.23764934254534267, 0.0251737159970044, -0.16927522212224883, -0.10547237832388082, -0.09568170668272716, 0.0022743740463974297, 0.04401135429981406, -0.3383422805324059, 0.10758523798560621, 0.033110584003022976, -0.0024061776801115936, -0.10631072928232176, -0.15867442055174183, 0.005132885179827335, 0.1386031322741743, 0.12293707212234882, -0.04649751590720067, 0.1492608582549211, -0.09782730690332958, -0.19306196503479173, 0.35356788529531546, -0.047048007051839875, -0.21908100815144954, 0.15332829226153316, -0.0901947303166337, -0.11854277259704692, 0.13860471492969534, 0.1820047638611868, 0.11272349300647706, -0.22682668689715987, 0.0632841783490558, -0.052511892832289624, 0.11160883190179313, 0.06362201303191897, 0.06719407340494434, 0.15543307332942882, 0.16071584732789132, 0.19130660786026124, 0.11751515858136204, 0.02758102520170656, -0.2530303572399404, -0.30389214758933697, -0.06950136442200919, -0.11621815461182484, 0.051378299913334625, -0.12114760160181538, -0.14552264665851705, 0.30057697612102385, 0.14768307155895014, 0.10358962400264486, 0.11551178325209077, 0.2810085184216775, 0.14933427405776456, -0.06757677349701731, 0.09611139765130011, 0.21509847757234066, 0.0257662249625557, 0.1297288553452947, -0.22224540676473192, 0.17487803106713626, 0.021241860569851403] |
1,802.01076 | Diffusive real-time dynamics of a particle with Berry curvatures | We study theoretically the influence of Berry phase on the real-time dynamics
of the single particle focusing on the diffusive dynamics, i.e., the
time-dependence of the distribution function. Our model can be applied to the
real-time dynamics of intraband relaxation and diffusion of optically excited
excitons, trions or particle-hole pair. We found that the dynamics at the early
stage is deeply influenced by the Berry curvatures in real-space ($B$),
momentum-space ($\Omega$), and also the crossed space between these two ($C$).
For example, it is found that $\Omega$ induces the rotation of the wave packet
and causes the time-dependence of the mean square displacement of the particle
to be linear in time $t$ at the initial stage; it is qualitatively different
from the $t^3$ dependence in the absence of the Berry curvatures. It is also
found that $\Omega$ and $C$ modifies the characteristic time scale of the
thermal equilibration of momentum distribution. Moreover, the dynamics under
various combinations of $B$, $\Omega$ and $C$ shows singular behaviors such as
the critical slowing down or speeding up of the momentum equilibration and the
reversals of the direction of rotations. The relevance of our model for
time-resolved experiments in transition metal dichalcogenides is also
discussed.
| cond-mat.mes-hall cond-mat.stat-mech | we study theoretically the influence of berry phase on the realtime dynamics of the single particle focusing on the diffusive dynamics ie the timedependence of the distribution function our model can be applied to the realtime dynamics of intraband relaxation and diffusion of optically excited excitons trions or particlehole pair we found that the dynamics at the early stage is deeply influenced by the berry curvatures in realspace b momentumspace omega and also the crossed space between these two c for example it is found that omega induces the rotation of the wave packet and causes the timedependence of the mean square displacement of the particle to be linear in time t at the initial stage it is qualitatively different from the t3 dependence in the absence of the berry curvatures it is also found that omega and c modifies the characteristic time scale of the thermal equilibration of momentum distribution moreover the dynamics under various combinations of b omega and c shows singular behaviors such as the critical slowing down or speeding up of the momentum equilibration and the reversals of the direction of rotations the relevance of our model for timeresolved experiments in transition metal dichalcogenides is also discussed | [['we', 'study', 'theoretically', 'the', 'influence', 'of', 'berry', 'phase', 'on', 'the', 'realtime', 'dynamics', 'of', 'the', 'single', 'particle', 'focusing', 'on', 'the', 'diffusive', 'dynamics', 'ie', 'the', 'timedependence', 'of', 'the', 'distribution', 'function', 'our', 'model', 'can', 'be', 'applied', 'to', 'the', 'realtime', 'dynamics', 'of', 'intraband', 'relaxation', 'and', 'diffusion', 'of', 'optically', 'excited', 'excitons', 'trions', 'or', 'particlehole', 'pair', 'we', 'found', 'that', 'the', 'dynamics', 'at', 'the', 'early', 'stage', 'is', 'deeply', 'influenced', 'by', 'the', 'berry', 'curvatures', 'in', 'realspace', 'b', 'momentumspace', 'omega', 'and', 'also', 'the', 'crossed', 'space', 'between', 'these', 'two', 'c', 'for', 'example', 'it', 'is', 'found', 'that', 'omega', 'induces', 'the', 'rotation', 'of', 'the', 'wave', 'packet', 'and', 'causes', 'the', 'timedependence', 'of', 'the', 'mean', 'square', 'displacement', 'of', 'the', 'particle', 'to', 'be', 'linear', 'in', 'time', 't', 'at', 'the', 'initial', 'stage', 'it', 'is', 'qualitatively', 'different', 'from', 'the', 't3', 'dependence', 'in', 'the', 'absence', 'of', 'the', 'berry', 'curvatures', 'it', 'is', 'also', 'found', 'that', 'omega', 'and', 'c', 'modifies', 'the', 'characteristic', 'time', 'scale', 'of', 'the', 'thermal', 'equilibration', 'of', 'momentum', 'distribution', 'moreover', 'the', 'dynamics', 'under', 'various', 'combinations', 'of', 'b', 'omega', 'and', 'c', 'shows', 'singular', 'behaviors', 'such', 'as', 'the', 'critical', 'slowing', 'down', 'or', 'speeding', 'up', 'of', 'the', 'momentum', 'equilibration', 'and', 'the', 'reversals', 'of', 'the', 'direction', 'of', 'rotations', 'the', 'relevance', 'of', 'our', 'model', 'for', 'timeresolved', 'experiments', 'in', 'transition', 'metal', 'dichalcogenides', 'is', 'also', 'discussed']] | [-0.15746524209036164, 0.2057458597156613, -0.10254750110727934, 0.04381375440769361, -0.00889857118573985, -0.09281801476736382, 0.025557839779637347, 0.36677801657227144, -0.30666713085748365, -0.2577621099082707, 0.03816288170539102, -0.2801775275474757, -0.14151701734480054, 0.1688670599080196, 0.058979301062987106, 0.024744242061374346, 0.000392041303476884, 0.028452861192288684, -0.07078792954405853, -0.201296874549036, 0.3126325909215123, 0.023014684226271228, 0.28388956387003705, 0.0937753487161166, 0.07272045070129396, 0.0023222301521370957, 0.032445526204595516, 0.0005890579188453376, -0.13383387056446783, 0.017840233529496253, 0.16355904540630864, 0.035056413088772276, 0.21870313097829397, -0.41306206986159827, -0.19024727186674614, 0.06744585158210711, 0.15275793849370115, 0.10558628161271005, -0.021792980290333098, -0.2827309349931739, 0.018412189877856134, -0.09837148590152388, -0.13248365771764453, -0.06604937333335627, 0.07415607367382751, 0.022216124382490914, -0.23848739767386878, 0.12971832309470196, 0.07669857945710198, 0.03830424603769806, -0.06516030429867073, -0.09363238906849232, -0.08249994652607566, 0.11144470451492353, 0.0808070691149515, 0.046808131987840604, 0.16763204684833166, -0.12930169430751334, -0.0788441811414871, 0.39568146642654284, -0.10516601417964297, -0.17923737132912548, 0.1612611041353339, -0.21030256993007562, -0.05693565502146546, 0.1609789486997645, 0.1537132942724732, 0.1465137739600938, -0.09460140263374468, 0.07746025684824798, 0.006778117023777351, 0.12105159906656551, 0.057220484587637274, 0.04533957161787731, 0.1982307365414367, 0.15309554165164332, 0.043723646235137956, 0.13108099124594755, -0.1390829180107818, -0.12492801480699535, -0.31485806646483455, -0.1523538811597973, -0.1969783985257538, 0.07510693264169217, -0.0850356752928914, -0.1405977241460938, 0.4275847857294428, 0.11979435961832528, 0.20874602177564927, -0.001505548018610003, 0.25701444451488664, 0.13722908254817073, 0.037954240543906816, 0.06887420837128007, 0.2407125715601874, 0.11922021835708796, 0.12065312957196538, -0.3503015629069148, 0.07601309463205697, 0.015788411083330043] |
1,802.01077 | Equilibrium controls in time inconsistent stochastic linear quadratic
problems | This paper deals with a class of time inconsistent stochastic linear
quadratic (SLQ) optimal control problems in Markovian framework. Three notions,
i.e., closed-loop equilibrium controls/strategies, open-loop equilibrium
controls and their closed-loop representations, are characterized in unified
manners. These results indicate clearer and deeper distinctions among these
notions. For example, in particular time consistent setting, the open-loop
equilibrium controls are fully characterized by first-order, second-order
necessary optimality conditions, and become needlessly optimal, while the
closed-loop equilibrium controls naturally reduce into closed-loop optimal
controls.
| math.OC | this paper deals with a class of time inconsistent stochastic linear quadratic slq optimal control problems in markovian framework three notions ie closedloop equilibrium controlsstrategies openloop equilibrium controls and their closedloop representations are characterized in unified manners these results indicate clearer and deeper distinctions among these notions for example in particular time consistent setting the openloop equilibrium controls are fully characterized by firstorder secondorder necessary optimality conditions and become needlessly optimal while the closedloop equilibrium controls naturally reduce into closedloop optimal controls | [['this', 'paper', 'deals', 'with', 'a', 'class', 'of', 'time', 'inconsistent', 'stochastic', 'linear', 'quadratic', 'slq', 'optimal', 'control', 'problems', 'in', 'markovian', 'framework', 'three', 'notions', 'ie', 'closedloop', 'equilibrium', 'controlsstrategies', 'openloop', 'equilibrium', 'controls', 'and', 'their', 'closedloop', 'representations', 'are', 'characterized', 'in', 'unified', 'manners', 'these', 'results', 'indicate', 'clearer', 'and', 'deeper', 'distinctions', 'among', 'these', 'notions', 'for', 'example', 'in', 'particular', 'time', 'consistent', 'setting', 'the', 'openloop', 'equilibrium', 'controls', 'are', 'fully', 'characterized', 'by', 'firstorder', 'secondorder', 'necessary', 'optimality', 'conditions', 'and', 'become', 'needlessly', 'optimal', 'while', 'the', 'closedloop', 'equilibrium', 'controls', 'naturally', 'reduce', 'into', 'closedloop', 'optimal', 'controls']] | [-0.1453191369059093, 0.08271487529194098, -0.07696294033738935, 0.11411299302823336, -0.043645851127228436, -0.2437584819789562, 0.060812401762059716, 0.36499908225277417, -0.33718061769082225, -0.2685064197414451, 0.15842440339627412, -0.1870101861437254, -0.20231072014818588, 0.18229619682663017, -0.16356955952568691, 0.15943912725987625, 0.04956299920543385, -0.035509001509642896, -0.08147862873810494, -0.2019055074678711, 0.3262262022824107, 0.008023465029251428, 0.2894546506397518, -0.07013691068960377, 0.14954916605105004, -0.030647395891539843, -0.016381202305862565, 0.07142104410830839, -0.14203783309800022, 0.04266226336641674, 0.3472003813166125, 0.10126662748164417, 0.38106168981032146, -0.45233394969024776, -0.15853809750420444, 0.12568967778488627, 0.10830922020034416, 0.07925145814725612, -0.013234902115791668, -0.2921290881011957, 0.10777798623427243, -0.09358488020981535, -0.13184050164173966, -0.12954969102815714, -0.09017810358861346, 0.021178690497447264, -0.3642195832030273, 0.0889803337186207, 0.10716632274726842, 0.08574447911922578, -0.169941212910078, -0.07492184215282768, -0.009169472870129494, 0.13566124844824734, -0.004271685893152967, -0.08292268936372833, 0.15013043271423673, -0.09136426336430933, -0.1327019685557411, 0.29429452315570764, 0.0005126102011144897, -0.20613772967071445, 0.1769087777565015, -0.07073758271764274, -0.10449522886321777, 0.1604260385243429, 0.16026876148204378, 0.1298441653036409, -0.22055467334288506, 0.047993787976102556, -0.0032566213336439782, 0.1319201149687424, 0.0573405932267139, 0.09241734676775926, 0.1432705307609321, 0.14100029064560837, 0.2070141129805074, 0.1539877391518036, 0.12211927633594584, -0.3115620207455423, -0.32742294717442105, -0.07182724253033046, -0.03187564462940726, -0.024515951795354027, -0.10793689631423654, -0.10074925477283052, 0.3419588415619032, 0.13056803511363674, 0.1016178880530743, 0.1369352323509017, 0.28849140308038507, 0.1434461717252378, -0.05368405208279045, 0.1082137257527606, 0.27626981147001556, 0.09593484137080793, 0.11307015712947849, -0.2794431791537338, 0.12079888424134733, 0.055619407180742715] |
1,802.01078 | Uniqueness of equilibrium strategies in dynamic mean-variance problems
with random coefficients | This paper is concerned with the uniqueness issue of open-loop equilibrium
investment strategies of dynamic mean-variance portfolio selection problems
with random coefficients. A unified method is developed to treat both the
problems with deterministic risk-free return rate, state-dependent risk
aversion, and that with full random coefficients, constant risk aversion. To do
so, some new necessity conditions for the existence of equilibrium investment
strategies are established, which considerably extends the analogue in [9] with
distinctive ideas. Some new interesting facts are revealed. For example, if
risk-free return rate is random, it is shown that there exists a unique
open-loop equilibrium investment strategy relying on initial wealth, even when
risk aversion is merely a constant but not state-dependent.
| math.OC | this paper is concerned with the uniqueness issue of openloop equilibrium investment strategies of dynamic meanvariance portfolio selection problems with random coefficients a unified method is developed to treat both the problems with deterministic riskfree return rate statedependent risk aversion and that with full random coefficients constant risk aversion to do so some new necessity conditions for the existence of equilibrium investment strategies are established which considerably extends the analogue in 9 with distinctive ideas some new interesting facts are revealed for example if riskfree return rate is random it is shown that there exists a unique openloop equilibrium investment strategy relying on initial wealth even when risk aversion is merely a constant but not statedependent | [['this', 'paper', 'is', 'concerned', 'with', 'the', 'uniqueness', 'issue', 'of', 'openloop', 'equilibrium', 'investment', 'strategies', 'of', 'dynamic', 'meanvariance', 'portfolio', 'selection', 'problems', 'with', 'random', 'coefficients', 'a', 'unified', 'method', 'is', 'developed', 'to', 'treat', 'both', 'the', 'problems', 'with', 'deterministic', 'riskfree', 'return', 'rate', 'statedependent', 'risk', 'aversion', 'and', 'that', 'with', 'full', 'random', 'coefficients', 'constant', 'risk', 'aversion', 'to', 'do', 'so', 'some', 'new', 'necessity', 'conditions', 'for', 'the', 'existence', 'of', 'equilibrium', 'investment', 'strategies', 'are', 'established', 'which', 'considerably', 'extends', 'the', 'analogue', 'in', '9', 'with', 'distinctive', 'ideas', 'some', 'new', 'interesting', 'facts', 'are', 'revealed', 'for', 'example', 'if', 'riskfree', 'return', 'rate', 'is', 'random', 'it', 'is', 'shown', 'that', 'there', 'exists', 'a', 'unique', 'openloop', 'equilibrium', 'investment', 'strategy', 'relying', 'on', 'initial', 'wealth', 'even', 'when', 'risk', 'aversion', 'is', 'merely', 'a', 'constant', 'but', 'not', 'statedependent']] | [-0.10374966147456094, 0.07618356779908184, -0.10186016103573914, 0.11543758956570949, -0.12849468716765464, -0.25119388488458533, 0.11762792887748219, 0.4116406158929498, -0.29954677733496343, -0.2088782593080019, 0.19198827945139532, -0.2467490092305274, -0.16176755145063687, 0.1761595078127796, -0.1756826712858285, 0.06520285470218494, 0.048957268536845545, 0.008904892760569808, 0.0367010810255908, -0.3123443184404409, 0.31962808308287943, 0.06595867546275258, 0.28514541914798963, 0.029286518972404682, 0.1541749035100581, -0.0022235913784243166, -0.024053738845897645, 0.05691615531245118, -0.16910249060323435, 0.10292721549370165, 0.29702311934269, 0.13593909677102006, 0.444848306416855, -0.360417201617283, -0.20013401586690854, 0.18056115468739178, 0.017362675790129036, 0.09579640721344261, -0.06274961148376641, -0.21839319778493896, 0.009818984817809844, -0.17444739452837205, -0.17724139913254225, -0.08177824071126766, 0.016781260998084628, 0.02662237065619436, -0.36550877704525947, 0.0917341619296449, 0.054934202016989606, 0.03804717864038359, -0.11137935230588733, -0.1477541663635779, 0.005000458436151003, 0.10341694692459864, 0.1372033748354217, -0.03574535121402607, 0.13545507653455796, -0.09628752698712371, -0.187492515400036, 0.3378311185615844, -0.059746038112468244, -0.23006934386774383, 0.14857362475495078, -0.11855143720910338, -0.11526099539458237, 0.15939249047720483, 0.12723126364390142, 0.07610668586205756, -0.21781852606602178, 0.07237704895820131, -0.07291116437107999, 0.16545470516550645, 0.07446439903036788, 0.04946692743948821, 0.14539403830662948, 0.13375815296955085, 0.2141713638055331, 0.09873650889795531, 0.03428263651761066, -0.21272973529994488, -0.28978345197111627, -0.07587163303808132, -0.12594671115572242, 0.10466301149564719, -0.11676649999358703, -0.17952142758691353, 0.2870939992978398, 0.13657074645844064, 0.10118738958483627, 0.14236130306581518, 0.2784102001048801, 0.14352340300182073, -0.04069675831594615, 0.09908030109463967, 0.20616522822820116, 0.020716261789042116, 0.1272205884191047, -0.1939302756619672, 0.21468058731085782, 0.038540782900687694] |
1,802.01079 | General maximum principles for optimal control problems of stochastic
Volterra integral equations | Optimal control problems of forward stochastic Volterra integral equations
(SVIEs) are formulated and studied. When control region is arbitrary subset of
Euclidean space and control enters into the diffusion, necessary conditions of
Pontryagin's type for optimal controls are established via spike variation. Our
conclusions naturally cover the analogue of stochastic differential equations
(SDEs), and our developed methodology drops the reliance on It\^o formula and
second-order adjoint equations. Some new features, that are concealed in the
SDEs framework, are revealed in our situation. For example, instead of using
second-order adjoint equations, it is more appropriate to introduce
second-order adjoint processes. Moreover, the conventional way of using one
second-order adjoint equation is inadequate here. In other words, two adjoint
processes, which just merge into the solution of second-order adjoint equation
in SDEs situation, are actually required and proposed in our setting.
| math.OC | optimal control problems of forward stochastic volterra integral equations svies are formulated and studied when control region is arbitrary subset of euclidean space and control enters into the diffusion necessary conditions of pontryagins type for optimal controls are established via spike variation our conclusions naturally cover the analogue of stochastic differential equations sdes and our developed methodology drops the reliance on ito formula and secondorder adjoint equations some new features that are concealed in the sdes framework are revealed in our situation for example instead of using secondorder adjoint equations it is more appropriate to introduce secondorder adjoint processes moreover the conventional way of using one secondorder adjoint equation is inadequate here in other words two adjoint processes which just merge into the solution of secondorder adjoint equation in sdes situation are actually required and proposed in our setting | [['optimal', 'control', 'problems', 'of', 'forward', 'stochastic', 'volterra', 'integral', 'equations', 'svies', 'are', 'formulated', 'and', 'studied', 'when', 'control', 'region', 'is', 'arbitrary', 'subset', 'of', 'euclidean', 'space', 'and', 'control', 'enters', 'into', 'the', 'diffusion', 'necessary', 'conditions', 'of', 'pontryagins', 'type', 'for', 'optimal', 'controls', 'are', 'established', 'via', 'spike', 'variation', 'our', 'conclusions', 'naturally', 'cover', 'the', 'analogue', 'of', 'stochastic', 'differential', 'equations', 'sdes', 'and', 'our', 'developed', 'methodology', 'drops', 'the', 'reliance', 'on', 'ito', 'formula', 'and', 'secondorder', 'adjoint', 'equations', 'some', 'new', 'features', 'that', 'are', 'concealed', 'in', 'the', 'sdes', 'framework', 'are', 'revealed', 'in', 'our', 'situation', 'for', 'example', 'instead', 'of', 'using', 'secondorder', 'adjoint', 'equations', 'it', 'is', 'more', 'appropriate', 'to', 'introduce', 'secondorder', 'adjoint', 'processes', 'moreover', 'the', 'conventional', 'way', 'of', 'using', 'one', 'secondorder', 'adjoint', 'equation', 'is', 'inadequate', 'here', 'in', 'other', 'words', 'two', 'adjoint', 'processes', 'which', 'just', 'merge', 'into', 'the', 'solution', 'of', 'secondorder', 'adjoint', 'equation', 'in', 'sdes', 'situation', 'are', 'actually', 'required', 'and', 'proposed', 'in', 'our', 'setting']] | [-0.09254794105452122, 0.07275203165962645, -0.09311612546308964, 0.11065086178174513, -0.1470728283191262, -0.16814997421528644, 0.008180787548949213, 0.33205403065801586, -0.3314647984663969, -0.23804367103856866, 0.15517472981077118, -0.2575800462619172, -0.17312373449027108, 0.2065888679307123, -0.089180085604101, 0.1026862542114585, 0.03864212658263041, 0.028579950752749068, -0.0690456001540187, -0.2445273283123295, 0.3438217775201074, -0.08176526362481325, 0.24887945250088375, -0.03519621093595481, 0.19615148792070322, 0.002164825294301778, -0.03627764305059353, -0.003957714835068791, -0.09466881818076692, 0.10373383292428934, 0.30463756478823506, 0.07156085655889541, 0.2997946219815724, -0.4476581911785879, -0.22164968566199683, 0.0666790634960584, 0.1484003474533497, 0.08817153476242759, -0.04906212889382268, -0.30247331611758127, 0.06970833564190652, -0.12025698713715309, -0.14085283999304302, -0.09313347083060881, -0.025948852378254134, 0.043414060023876475, -0.3189255628377145, 0.08891480893193596, 0.07722764905454402, 0.01820890083099189, -0.0985422333887191, -0.08780556290909863, -0.020091219164053167, 0.06747226743301735, 0.014367429915802095, -0.036818790600459644, 0.09026046443909434, -0.10365112840393693, -0.10231395409294013, 0.35103118330564187, -0.07358841534174196, -0.2918086414616825, 0.14785666891333202, -0.12371578874687354, -0.10799386589517952, 0.15204748370266263, 0.14482307662188576, 0.19039025731836917, -0.21218214833156115, 0.1139548998418858, -0.00900849886238575, 0.11017491008438494, 0.05966092232425792, 0.0002994627955005221, 0.08328718742679643, 0.1542651331089302, 0.11299197649772184, 0.10490188591791304, 0.013744218688309733, -0.22767609600112707, -0.3676937363933826, -0.1494208748884283, -0.0926318535702708, 0.027866233597455572, -0.09831392354333177, -0.13207299804206993, 0.307231673947198, 0.15608289997022518, 0.11479389682358158, 0.04134634858844262, 0.2826970077113019, 0.23913002042673473, -0.0009803624951915033, 0.0484957856942724, 0.19303133701538647, 0.19250635193843071, 0.11956318781670669, -0.2130456333912477, 0.07222437589645278, 0.17598422436023373] |
1,802.0108 | Characterizations of equilibrium controls in time inconsistent
mean-field stochastic linear quadratic problems. I | In this paper, a class of time inconsistent linear quadratic optimal control
problems of mean-field stochastic differential equations (SDEs) is considered
under Markovian framework. Open-loop equilibrium controls and their particular
closed-loop representations are introduced and characterized via variational
ideas. Several interesting features are revealed and a system of coupled
Riccati equations is derived. In contrast with the analogue optimal control
problems of SDEs, the mean-field terms in state equation, which is another
reason of time inconsistency, prompts us to define above two notions in new
manners. An interesting result, which is almost trivial in the counterpart
problems of SDEs, is given and plays significant role in the previous
characterizations. As application, the uniqueness of open-loop equilibrium
controls is discussed.
| math.OC | in this paper a class of time inconsistent linear quadratic optimal control problems of meanfield stochastic differential equations sdes is considered under markovian framework openloop equilibrium controls and their particular closedloop representations are introduced and characterized via variational ideas several interesting features are revealed and a system of coupled riccati equations is derived in contrast with the analogue optimal control problems of sdes the meanfield terms in state equation which is another reason of time inconsistency prompts us to define above two notions in new manners an interesting result which is almost trivial in the counterpart problems of sdes is given and plays significant role in the previous characterizations as application the uniqueness of openloop equilibrium controls is discussed | [['in', 'this', 'paper', 'a', 'class', 'of', 'time', 'inconsistent', 'linear', 'quadratic', 'optimal', 'control', 'problems', 'of', 'meanfield', 'stochastic', 'differential', 'equations', 'sdes', 'is', 'considered', 'under', 'markovian', 'framework', 'openloop', 'equilibrium', 'controls', 'and', 'their', 'particular', 'closedloop', 'representations', 'are', 'introduced', 'and', 'characterized', 'via', 'variational', 'ideas', 'several', 'interesting', 'features', 'are', 'revealed', 'and', 'a', 'system', 'of', 'coupled', 'riccati', 'equations', 'is', 'derived', 'in', 'contrast', 'with', 'the', 'analogue', 'optimal', 'control', 'problems', 'of', 'sdes', 'the', 'meanfield', 'terms', 'in', 'state', 'equation', 'which', 'is', 'another', 'reason', 'of', 'time', 'inconsistency', 'prompts', 'us', 'to', 'define', 'above', 'two', 'notions', 'in', 'new', 'manners', 'an', 'interesting', 'result', 'which', 'is', 'almost', 'trivial', 'in', 'the', 'counterpart', 'problems', 'of', 'sdes', 'is', 'given', 'and', 'plays', 'significant', 'role', 'in', 'the', 'previous', 'characterizations', 'as', 'application', 'the', 'uniqueness', 'of', 'openloop', 'equilibrium', 'controls', 'is', 'discussed']] | [-0.16515598037209706, 0.05456481039430652, -0.0951172559475135, 0.0872984852792476, -0.07966527713760108, -0.1808451589376924, 0.014269835651194787, 0.3108326027075909, -0.33756864027848016, -0.2715696300215581, 0.12950821683405578, -0.24392105767331204, -0.199791135031636, 0.20934340745961966, -0.13354284407868355, 0.10831869174061078, 0.03484087621307924, 0.003597914769525538, -0.07339929576822314, -0.2302878644990445, 0.3463643781386879, 0.00014169122084599584, 0.24616625685902202, -0.01839785966797176, 0.19055235288849398, -0.02592809500462305, -0.01982914434135461, 0.02970228946039907, -0.12861318358400164, 0.07449640368870578, 0.3225239853476401, 0.06405034153370046, 0.3429185163069266, -0.39724040608618316, -0.18847263949931042, 0.1204617714251102, 0.12780573594695968, 0.11467432015880692, -0.04128558037043432, -0.2849841880134675, 0.052927213745434305, -0.1170594645898883, -0.1849520857751119, -0.06690139428344595, -0.01994947743202959, 0.04412204275659027, -0.2952970248028761, 0.10476980396123807, 0.09906816321910367, 0.05813630182734307, -0.13074542771430075, -0.08081847333306243, 0.00649282564272118, 0.09217672201045671, 0.05453874380523417, -0.02781867252334076, 0.101323278616926, -0.10918529352619305, -0.18168993569722697, 0.33901284748547467, -0.06318575837414618, -0.24206734790678033, 0.1871022848165868, -0.06737408794055716, -0.12932050215792568, 0.13548707629420928, 0.14483189906831048, 0.15831375962412847, -0.22157906903689648, 0.1283950701712028, -0.05806498481117252, 0.12663322646354772, 0.0408708376950827, 0.055080508965873666, 0.0928448942360789, 0.1630189001712823, 0.1506979559282107, 0.15873478201977095, 0.05583159905709639, -0.24409425793559986, -0.31566138075617683, -0.12532127746224342, -0.08299652432842854, 0.051091807310375534, -0.07777496633861418, -0.14924805034578098, 0.3550131314770639, 0.14795524359508536, 0.11794290872400298, 0.03580049189867084, 0.23456399528967106, 0.2160310852683752, -0.04668367693326416, 0.053322634092305136, 0.23769451088287688, 0.20040953548296409, 0.11666684089025028, -0.2260118791864825, 0.10631996969606321, 0.09635245190549861] |
1,802.01081 | A search for technosignatures from 14 planetary systems in the Kepler
field with the Green Bank Telescope at 1.15-1.73 GHz | Analysis of Kepler mission data suggests that the Milky Way includes billions
of Earth-like planets in the habitable zone of their host star. Current
technology enables the detection of technosignatures emitted from a large
fraction of the Galaxy. We describe a search for technosignatures that is
sensitive to Arecibo-class transmitters located within ~420 ly of Earth and
transmitters that are 1000 times more effective than Arecibo within ~13 000 ly
of Earth. Our observations focused on 14 planetary systems in the Kepler field
and used the L-band receiver (1.15-1.73 GHz) of the 100 m diameter Green Bank
Telescope. Each source was observed for a total integration time of 5 minutes.
We obtained power spectra at a frequency resolution of 3 Hz and examined
narrowband signals with Doppler drift rates between +/-9 Hz/s. We flagged any
detection with a signal-to-noise ratio in excess of 10 as a candidate signal
and identified approximately 850 000 candidates. Most (99%) of these candidate
signals were automatically classified as human-generated radio-frequency
interference (RFI). A large fraction (>99%) of the remaining candidate signals
were also flagged as anthropogenic RFI because they have frequencies that
overlap those used by global navigation satellite systems, satellite downlinks,
or other interferers detected in heavily polluted regions of the spectrum. All
19 remaining candidate signals were scrutinized and none were attributable to
an extraterrestrial source.
| astro-ph.EP | analysis of kepler mission data suggests that the milky way includes billions of earthlike planets in the habitable zone of their host star current technology enables the detection of technosignatures emitted from a large fraction of the galaxy we describe a search for technosignatures that is sensitive to areciboclass transmitters located within 420 ly of earth and transmitters that are 1000 times more effective than arecibo within 13 000 ly of earth our observations focused on 14 planetary systems in the kepler field and used the lband receiver 115173 ghz of the 100 m diameter green bank telescope each source was observed for a total integration time of 5 minutes we obtained power spectra at a frequency resolution of 3 hz and examined narrowband signals with doppler drift rates between 9 hzs we flagged any detection with a signaltonoise ratio in excess of 10 as a candidate signal and identified approximately 850 000 candidates most 99 of these candidate signals were automatically classified as humangenerated radiofrequency interference rfi a large fraction 99 of the remaining candidate signals were also flagged as anthropogenic rfi because they have frequencies that overlap those used by global navigation satellite systems satellite downlinks or other interferers detected in heavily polluted regions of the spectrum all 19 remaining candidate signals were scrutinized and none were attributable to an extraterrestrial source | [['analysis', 'of', 'kepler', 'mission', 'data', 'suggests', 'that', 'the', 'milky', 'way', 'includes', 'billions', 'of', 'earthlike', 'planets', 'in', 'the', 'habitable', 'zone', 'of', 'their', 'host', 'star', 'current', 'technology', 'enables', 'the', 'detection', 'of', 'technosignatures', 'emitted', 'from', 'a', 'large', 'fraction', 'of', 'the', 'galaxy', 'we', 'describe', 'a', 'search', 'for', 'technosignatures', 'that', 'is', 'sensitive', 'to', 'areciboclass', 'transmitters', 'located', 'within', '420', 'ly', 'of', 'earth', 'and', 'transmitters', 'that', 'are', '1000', 'times', 'more', 'effective', 'than', 'arecibo', 'within', '13', '000', 'ly', 'of', 'earth', 'our', 'observations', 'focused', 'on', '14', 'planetary', 'systems', 'in', 'the', 'kepler', 'field', 'and', 'used', 'the', 'lband', 'receiver', '115173', 'ghz', 'of', 'the', '100', 'm', 'diameter', 'green', 'bank', 'telescope', 'each', 'source', 'was', 'observed', 'for', 'a', 'total', 'integration', 'time', 'of', '5', 'minutes', 'we', 'obtained', 'power', 'spectra', 'at', 'a', 'frequency', 'resolution', 'of', '3', 'hz', 'and', 'examined', 'narrowband', 'signals', 'with', 'doppler', 'drift', 'rates', 'between', '9', 'hzs', 'we', 'flagged', 'any', 'detection', 'with', 'a', 'signaltonoise', 'ratio', 'in', 'excess', 'of', '10', 'as', 'a', 'candidate', 'signal', 'and', 'identified', 'approximately', '850', '000', 'candidates', 'most', '99', 'of', 'these', 'candidate', 'signals', 'were', 'automatically', 'classified', 'as', 'humangenerated', 'radiofrequency', 'interference', 'rfi', 'a', 'large', 'fraction', '99', 'of', 'the', 'remaining', 'candidate', 'signals', 'were', 'also', 'flagged', 'as', 'anthropogenic', 'rfi', 'because', 'they', 'have', 'frequencies', 'that', 'overlap', 'those', 'used', 'by', 'global', 'navigation', 'satellite', 'systems', 'satellite', 'downlinks', 'or', 'other', 'interferers', 'detected', 'in', 'heavily', 'polluted', 'regions', 'of', 'the', 'spectrum', 'all', '19', 'remaining', 'candidate', 'signals', 'were', 'scrutinized', 'and', 'none', 'were', 'attributable', 'to', 'an', 'extraterrestrial', 'source']] | [-0.1376693605868511, 0.12514328705583466, 0.013519090270992738, 0.0499172549851308, -0.08907625078001304, -0.10219338988289572, 0.10920113946944643, 0.38051228234460494, -0.14630994123148708, -0.40537977238764633, 0.12879195440610922, -0.3471301636146801, -0.07360428951781343, 0.22867559678516947, -0.022376035591839132, 0.009296204317424044, 0.07373209133862753, -0.012894156781184647, 0.012627255495612484, -0.2581212242712846, 0.18177120869261892, 0.12314797779922751, 0.17619356077567144, -0.07357812937518067, 0.06801949424075533, -0.06467828913780584, -0.10103395430429897, -0.06788160326378839, -0.0673260148138758, 0.03122886021302694, 0.3195479605850336, 0.1815488517938836, 0.21581504215289177, -0.34668160890237437, -0.19933484298563017, 0.10284533646893226, 0.1399408972702568, 0.015399006426099452, -0.05866107803347011, -0.3365119018745063, 0.12390476355627011, -0.1871392280052139, -0.13335920686346922, 0.06542064249935048, 0.06312235871692784, 0.041847327317169926, -0.21295418776519312, 0.08575725370440171, -0.0147729029151116, 0.1214575276380774, -0.11810801976133843, -0.16439461489501703, -0.036868972993804025, 0.12209406747327496, -0.03166454774642212, 0.01529718534433627, 0.19378863269807184, -0.07855367110220811, -0.06479326943732663, 0.39115174550789633, -0.1042667316577134, -0.040683873362738536, 0.21698735369123448, -0.21449894963780436, -0.12864858745849012, 0.23544958496029983, 0.17541272453344972, 0.11690195026673242, -0.2038983635469088, -0.02202688728229495, 0.03487803139760545, 0.23368823050043067, 0.13966245491263196, 0.09275143233507815, 0.3069243828078044, 0.11208192508055216, 0.06815400573546654, 0.08142164683096355, -0.2977516706710417, 0.015367386927660386, -0.20291073649370758, -0.09072620790034348, -0.17184572575324392, 0.06796498779524202, -0.06812441534002737, -0.06090903086881447, 0.3768983629672696, 0.15206936095014786, 0.17443654261768568, 0.03166325362755808, 0.30538261481686624, 0.050474745557047764, 0.1335171142197175, 0.07792371775438958, 0.30140186353326515, 0.10064102712754361, 0.10143642621597292, -0.13183794362126505, 0.03508238748202587, -0.07912372642087641] |
1,802.01082 | About chromatic uniqueness of some complete tripartite graphs | Let $P(G, x)$ be the chromatic polynomial of a graph $G$. A graph $G$ is
called \textit{chromatically unique} if for any graph $H,\, P(G, x) = P(H, x)$
implies that $G$ and $H$ are isomorphic. In this paper we show that full
tripartite graph $K(n_1, n_2, n_3)$ is chromatically unique if $n_1 \geq n_2
\geq n_2 \geq n_3 \geq 2, n_1 - n_3 \leq 5$ and $n_1 + n_2 + n_3 \not \equiv 2
\mod{3}$.
| math.CO | let pg x be the chromatic polynomial of a graph g a graph g is called textitchromatically unique if for any graph h pg x ph x implies that g and h are isomorphic in this paper we show that full tripartite graph kn_1 n_2 n_3 is chromatically unique if n_1 geq n_2 geq n_2 geq n_3 geq 2 n_1 n_3 leq 5 and n_1 n_2 n_3 not equiv 2 mod3 | [['let', 'pg', 'x', 'be', 'the', 'chromatic', 'polynomial', 'of', 'a', 'graph', 'g', 'a', 'graph', 'g', 'is', 'called', 'textitchromatically', 'unique', 'if', 'for', 'any', 'graph', 'h', 'pg', 'x', 'ph', 'x', 'implies', 'that', 'g', 'and', 'h', 'are', 'isomorphic', 'in', 'this', 'paper', 'we', 'show', 'that', 'full', 'tripartite', 'graph', 'kn_1', 'n_2', 'n_3', 'is', 'chromatically', 'unique', 'if', 'n_1', 'geq', 'n_2', 'geq', 'n_2', 'geq', 'n_3', 'geq', '2', 'n_1', 'n_3', 'leq', '5', 'and', 'n_1', 'n_2', 'n_3', 'not', 'equiv', '2', 'mod3']] | [-0.23014809069750103, 0.2917377929189715, 0.027507561987832836, -0.014695221358282573, -0.0048816314480011015, -0.2956418299615599, -0.06748987391314375, 0.43114253948780074, -0.2448781424242517, -0.2599226669273407, 0.06334301312386557, -0.3489103230337302, -0.08648779184517005, 0.043104407067100205, -0.018153486584407696, -0.15481063060840403, 0.005524181126468424, 0.08796327106276716, 0.0010255353349814381, -0.26133316343117075, 0.23675713554510605, -0.18959077725699847, 0.030070712169011433, 0.10553362269116484, 0.1015991463867502, -0.057337252200459654, 0.1088762977902872, -0.08136157413769135, -0.2746195627481464, -0.03620337967531405, 0.27919667773623613, 0.1369869742218567, 0.19490419695511516, -0.3173041909771121, -0.0922108412673022, 0.38398921499163774, 0.17862781156799284, -0.19517531553688255, 0.0243840965617826, -0.14273184721452603, 0.23159803801040718, -0.1245799448773049, -0.04866908245004606, 0.012541552777807026, 0.23104686273828798, -0.07598812309890121, -0.4059931242339097, 0.03668523340256534, 0.13508865001031023, 0.04695319580386622, 0.12443566334474346, -0.2992891071607237, -0.18138965500005777, 0.006276794614783232, -0.10371755415141798, 0.06652487514108635, -0.013591213094448482, -0.033669969131090285, -0.04242928858940908, 0.3935094767290613, -0.13499261663578774, -0.14661641432431297, 0.04042776497215896, -0.20320381809943827, -0.24725842351039898, 0.161656533435419, 0.03874413292531086, 0.23612805707650125, 0.027189157822209854, 0.24995563048160757, -0.192489605774914, 0.2144227966234304, 0.13933863492844545, -0.037317434042368244, 0.07385044515240884, 0.02073302827573017, 0.1430183390452378, 0.023584298943034442, 0.028893927733103435, 0.2906552474081948, -0.32480018261982047, -0.20111829000592663, -0.26936791851387726, 0.24401495068868034, -0.18242212818839346, -0.0305306534215376, 0.3307200090932673, 0.030199071216950382, 0.17955085041298383, 0.0614646600721323, 0.1533015589499711, 0.03773307275242996, -0.12438223660802064, 0.1949422022840683, -0.021684353658254597, 0.23125955668966408, -0.09074851408924746, -0.15502560329016135, 0.0017878936563173065, 0.1179399727506266] |
1,802.01083 | Mesoscopic Description of the Equal Load Sharing Fiber Bundle Model | One aim of the equal load sharing fiber bundle model is to describe the
critical behavior of failure events. One way of accomplishing this, is through
a discrete recursive dynamics. We introduce a continuous mesoscopic equation
catching the critical behavior found through recursive dynamics. It allows us
to link the model with the unifying framework of absorbing phase transitions
traditionally used in the study of non-equilibrium phase transitions. Moreover,
it highlights the analogy between equal load sharing and spinodal nucleation.
Consequently, this work is a first step towards the quest of a field theory for
fiber bundle models.
| cond-mat.stat-mech | one aim of the equal load sharing fiber bundle model is to describe the critical behavior of failure events one way of accomplishing this is through a discrete recursive dynamics we introduce a continuous mesoscopic equation catching the critical behavior found through recursive dynamics it allows us to link the model with the unifying framework of absorbing phase transitions traditionally used in the study of nonequilibrium phase transitions moreover it highlights the analogy between equal load sharing and spinodal nucleation consequently this work is a first step towards the quest of a field theory for fiber bundle models | [['one', 'aim', 'of', 'the', 'equal', 'load', 'sharing', 'fiber', 'bundle', 'model', 'is', 'to', 'describe', 'the', 'critical', 'behavior', 'of', 'failure', 'events', 'one', 'way', 'of', 'accomplishing', 'this', 'is', 'through', 'a', 'discrete', 'recursive', 'dynamics', 'we', 'introduce', 'a', 'continuous', 'mesoscopic', 'equation', 'catching', 'the', 'critical', 'behavior', 'found', 'through', 'recursive', 'dynamics', 'it', 'allows', 'us', 'to', 'link', 'the', 'model', 'with', 'the', 'unifying', 'framework', 'of', 'absorbing', 'phase', 'transitions', 'traditionally', 'used', 'in', 'the', 'study', 'of', 'nonequilibrium', 'phase', 'transitions', 'moreover', 'it', 'highlights', 'the', 'analogy', 'between', 'equal', 'load', 'sharing', 'and', 'spinodal', 'nucleation', 'consequently', 'this', 'work', 'is', 'a', 'first', 'step', 'towards', 'the', 'quest', 'of', 'a', 'field', 'theory', 'for', 'fiber', 'bundle', 'models']] | [-0.15706254667792546, 0.11626880008689298, -0.14677615999244153, 0.04060498967752507, -0.07599847555654693, -0.16621524473766283, 0.0956811779808272, 0.3428886960336596, -0.27071032528195305, -0.24854572071712844, 0.04733582385649372, -0.23811753927412257, -0.20327887019589164, 0.12949361357415018, -0.02169628783862468, 0.0614275921858391, -0.007766443428260331, 0.023587944816408336, -0.02953491737704952, -0.17128573264926672, 0.33285815054455736, 0.03842207050064997, 0.3529601464504186, 0.022686633671044697, 0.10081691762581836, 0.0009287959059738383, 0.011538135519783412, -0.015732956204411327, -0.15802771322505207, 0.1050049244920362, 0.26341035464299367, 0.07149866155861896, 0.3047334323352089, -0.4224363661428191, -0.2345704607931631, 0.13628053729783515, 0.1299031033128386, 0.09711475569365204, 0.006896812896415287, -0.21552548273371494, 0.022513636273845117, -0.1624411761152501, -0.17693720215772504, -0.053868917263664155, -0.0028903607857575144, -0.002553764300667966, -0.21212262124754488, 0.0268468173524859, 0.0682296742190968, 0.06178160919332687, -0.03821474521917443, 0.009231548803877465, -0.0031053566787277863, 0.15154116785115734, 0.024035575913683493, 0.030409782229238475, 0.14690222590686564, -0.11678400734791114, -0.12645515330059795, 0.4149727391041055, -0.034222704776543746, -0.15489825938961335, 0.16331852461705554, -0.10496373524015047, -0.13021932018217536, 0.16861984861672533, 0.14859649500980668, 0.10771629983578257, -0.14545286712901934, 0.011614526291164018, 0.013073794486723384, 0.13521338585046672, 0.017174780280899485, -0.02143226277881435, 0.21993313964494332, 0.25563855065336943, 0.06939948574943962, 0.1748827781186116, -0.050799026055385034, -0.1921717092984033, -0.30507689535769883, -0.21829914075455495, -0.14274132345584506, 0.053716187738357304, -0.06531759900767332, -0.14211705281418197, 0.4287787890156769, 0.16155180870080177, 0.2020602296296583, 0.06095048358511864, 0.30412020282439733, 0.11881851376870609, 0.028559864156556373, 0.022660427769570023, 0.20644647500249652, 0.15365235394399082, 0.12106178751647738, -0.22437335161625274, 0.07285224662485476, 0.10054573124958849] |
1,802.01084 | Thermodynamic Geometry of Normal (Exotic) BTZ Black Hole Regarding to
the Fluctuation of Cosmological Constant | We construct the thermodynamic geometry of $2+1$ dimensional normal (exotic)
BTZ black hole regarding to the fluctuation of cosmological constant. We argue
that while the thermodynamic geometry of black hole without fluctuation of
cosmological constant is a two dimensional flat spaces, the three dimensional
thermodynamics parameters space including the cosmological constant as a
fluctuating parameter will be curved. Some consequence of the fluctuation of
cosmological constant will be investigated. We show that such fluctuation leads
to a thermodynamics curvature which is correctly singular at critical surface
of the system. Also, we consider the validity of first thermodynamics law
regarding to the fluctuation of cosmological constant.
| gr-qc | we construct the thermodynamic geometry of 21 dimensional normal exotic btz black hole regarding to the fluctuation of cosmological constant we argue that while the thermodynamic geometry of black hole without fluctuation of cosmological constant is a two dimensional flat spaces the three dimensional thermodynamics parameters space including the cosmological constant as a fluctuating parameter will be curved some consequence of the fluctuation of cosmological constant will be investigated we show that such fluctuation leads to a thermodynamics curvature which is correctly singular at critical surface of the system also we consider the validity of first thermodynamics law regarding to the fluctuation of cosmological constant | [['we', 'construct', 'the', 'thermodynamic', 'geometry', 'of', '21', 'dimensional', 'normal', 'exotic', 'btz', 'black', 'hole', 'regarding', 'to', 'the', 'fluctuation', 'of', 'cosmological', 'constant', 'we', 'argue', 'that', 'while', 'the', 'thermodynamic', 'geometry', 'of', 'black', 'hole', 'without', 'fluctuation', 'of', 'cosmological', 'constant', 'is', 'a', 'two', 'dimensional', 'flat', 'spaces', 'the', 'three', 'dimensional', 'thermodynamics', 'parameters', 'space', 'including', 'the', 'cosmological', 'constant', 'as', 'a', 'fluctuating', 'parameter', 'will', 'be', 'curved', 'some', 'consequence', 'of', 'the', 'fluctuation', 'of', 'cosmological', 'constant', 'will', 'be', 'investigated', 'we', 'show', 'that', 'such', 'fluctuation', 'leads', 'to', 'a', 'thermodynamics', 'curvature', 'which', 'is', 'correctly', 'singular', 'at', 'critical', 'surface', 'of', 'the', 'system', 'also', 'we', 'consider', 'the', 'validity', 'of', 'first', 'thermodynamics', 'law', 'regarding', 'to', 'the', 'fluctuation', 'of', 'cosmological', 'constant']] | [-0.16512006730218196, 0.1370524192140216, -0.09146237559173079, 0.11276365367119157, -0.08145545836360682, -0.14101223032478066, 0.007402256974906084, 0.2649195211008191, -0.23686058843242272, -0.25550781196049815, 0.10045373215384426, -0.2796105215414649, -0.09535502241480918, 0.18089367023536138, -0.03535783191078475, 0.04927179531327316, -0.060175889269227074, 0.06279683111989427, -0.10923772672900842, -0.2579463327270267, 0.4277285742795184, 0.0873646312260202, 0.24726560360619, 0.03916335905059463, 0.11129715674157653, -0.04557882409675845, 0.006318864993573654, 0.14090658910544812, -0.2472001115354942, 0.04972539818180459, 0.18930303084974487, 0.060428154273402125, 0.21551882340794518, -0.3739076738911016, -0.3006156608817123, 0.09510320801553981, 0.10693046636879444, 0.18012818011255669, -0.04249186412364777, -0.21733061016670296, 0.05052828647950221, -0.1773506964246432, -0.18914089735065187, -0.09273160997600782, 0.004117973805183456, -0.024853364290070852, -0.18290136144274757, 0.17108047203953555, 0.06518119748770482, -0.04503912931929032, -0.1275160974867287, -0.045362142858184164, -0.04766903489916807, 0.11387391622133908, 0.11771139360498636, -0.0115784336990189, 0.15754632506868801, -0.09836971489539359, -0.0921282329973543, 0.3711360295369689, -0.10118335064811011, -0.19531950642399135, 0.12544658774332632, -0.233108909450294, -0.1644427350633556, 0.05076223331547919, 0.11733072887928712, 0.10262640379514779, -0.1410721773192996, 0.17600404520829518, 0.027268216659181884, 0.1938005667445915, 0.10492548013017292, 0.029671669813493888, 0.32588429212392794, 0.12543878388546761, 0.048435983363361586, 0.14719203614541107, -0.054045783289309056, -0.1375593162912299, -0.38008602309439865, -0.20423188626854902, -0.178246072750716, 0.18419489036535933, -0.22249316764285876, -0.22575448116819774, 0.3160960252041973, 0.11884325356056381, 0.17822718408313534, 0.029299942586970117, 0.24469848154556184, 0.07011351322733043, -0.03398902318440378, 0.0711618764946858, 0.3110333392454777, 0.13591856296573365, 0.11637120110514973, -0.23896614154357285, -0.06175917257870814, 0.10347389745570365] |
1,802.01085 | INLA goes extreme: Bayesian tail regression for the estimation of high
spatio-temporal quantiles | This work has been motivated by the challenge of the 2017 conference on
Extreme-Value Analysis (EVA2017), with the goal of predicting daily
precipitation quantiles at the $99.8\%$ level for each month at observed and
unobserved locations. We here develop a Bayesian generalized additive modeling
framework tailored to estimate complex trends in marginal extremes observed
over space and time. Our approach is based on a set of regression equations
linked to the exceedance probability above a high threshold and to the size of
the excess, the latter being modeled using the generalized Pareto (GP)
distribution suggested by Extreme-Value Theory. Latent random effects are
modeled additively and semi-parametrically using Gaussian process priors, which
provides high flexibility and interpretability. Fast and accurate estimation of
posterior distributions may be performed thanks to the Integrated Nested
Laplace approximation (INLA), efficiently implemented in the R-INLA software,
which we also use for determining a nonstationary threshold based on a model
for the body of the distribution. We show that the GP distribution meets the
theoretical requirements of INLA, and we then develop a penalized complexity
prior specification for the tail index, which is a crucial parameter for
extrapolating tail event probabilities. This prior concentrates mass close to a
light exponential tail while allowing heavier tails by penalizing the distance
to the exponential distribution. We illustrate this methodology through the
modeling of spatial and seasonal trends in daily precipitation data provided by
the EVA2017 challenge. Capitalizing on R-INLA's fast computation capacities and
large distributed computing resources, we conduct an extensive cross-validation
study to select model parameters governing the smoothness of trends. Our
results outperform simple benchmarks and are comparable to the best-scoring
approach.
| stat.ME | this work has been motivated by the challenge of the 2017 conference on extremevalue analysis eva2017 with the goal of predicting daily precipitation quantiles at the 998 level for each month at observed and unobserved locations we here develop a bayesian generalized additive modeling framework tailored to estimate complex trends in marginal extremes observed over space and time our approach is based on a set of regression equations linked to the exceedance probability above a high threshold and to the size of the excess the latter being modeled using the generalized pareto gp distribution suggested by extremevalue theory latent random effects are modeled additively and semiparametrically using gaussian process priors which provides high flexibility and interpretability fast and accurate estimation of posterior distributions may be performed thanks to the integrated nested laplace approximation inla efficiently implemented in the rinla software which we also use for determining a nonstationary threshold based on a model for the body of the distribution we show that the gp distribution meets the theoretical requirements of inla and we then develop a penalized complexity prior specification for the tail index which is a crucial parameter for extrapolating tail event probabilities this prior concentrates mass close to a light exponential tail while allowing heavier tails by penalizing the distance to the exponential distribution we illustrate this methodology through the modeling of spatial and seasonal trends in daily precipitation data provided by the eva2017 challenge capitalizing on rinlas fast computation capacities and large distributed computing resources we conduct an extensive crossvalidation study to select model parameters governing the smoothness of trends our results outperform simple benchmarks and are comparable to the bestscoring approach | [['this', 'work', 'has', 'been', 'motivated', 'by', 'the', 'challenge', 'of', 'the', '2017', 'conference', 'on', 'extremevalue', 'analysis', 'eva2017', 'with', 'the', 'goal', 'of', 'predicting', 'daily', 'precipitation', 'quantiles', 'at', 'the', '998', 'level', 'for', 'each', 'month', 'at', 'observed', 'and', 'unobserved', 'locations', 'we', 'here', 'develop', 'a', 'bayesian', 'generalized', 'additive', 'modeling', 'framework', 'tailored', 'to', 'estimate', 'complex', 'trends', 'in', 'marginal', 'extremes', 'observed', 'over', 'space', 'and', 'time', 'our', 'approach', 'is', 'based', 'on', 'a', 'set', 'of', 'regression', 'equations', 'linked', 'to', 'the', 'exceedance', 'probability', 'above', 'a', 'high', 'threshold', 'and', 'to', 'the', 'size', 'of', 'the', 'excess', 'the', 'latter', 'being', 'modeled', 'using', 'the', 'generalized', 'pareto', 'gp', 'distribution', 'suggested', 'by', 'extremevalue', 'theory', 'latent', 'random', 'effects', 'are', 'modeled', 'additively', 'and', 'semiparametrically', 'using', 'gaussian', 'process', 'priors', 'which', 'provides', 'high', 'flexibility', 'and', 'interpretability', 'fast', 'and', 'accurate', 'estimation', 'of', 'posterior', 'distributions', 'may', 'be', 'performed', 'thanks', 'to', 'the', 'integrated', 'nested', 'laplace', 'approximation', 'inla', 'efficiently', 'implemented', 'in', 'the', 'rinla', 'software', 'which', 'we', 'also', 'use', 'for', 'determining', 'a', 'nonstationary', 'threshold', 'based', 'on', 'a', 'model', 'for', 'the', 'body', 'of', 'the', 'distribution', 'we', 'show', 'that', 'the', 'gp', 'distribution', 'meets', 'the', 'theoretical', 'requirements', 'of', 'inla', 'and', 'we', 'then', 'develop', 'a', 'penalized', 'complexity', 'prior', 'specification', 'for', 'the', 'tail', 'index', 'which', 'is', 'a', 'crucial', 'parameter', 'for', 'extrapolating', 'tail', 'event', 'probabilities', 'this', 'prior', 'concentrates', 'mass', 'close', 'to', 'a', 'light', 'exponential', 'tail', 'while', 'allowing', 'heavier', 'tails', 'by', 'penalizing', 'the', 'distance', 'to', 'the', 'exponential', 'distribution', 'we', 'illustrate', 'this', 'methodology', 'through', 'the', 'modeling', 'of', 'spatial', 'and', 'seasonal', 'trends', 'in', 'daily', 'precipitation', 'data', 'provided', 'by', 'the', 'eva2017', 'challenge', 'capitalizing', 'on', 'rinlas', 'fast', 'computation', 'capacities', 'and', 'large', 'distributed', 'computing', 'resources', 'we', 'conduct', 'an', 'extensive', 'crossvalidation', 'study', 'to', 'select', 'model', 'parameters', 'governing', 'the', 'smoothness', 'of', 'trends', 'our', 'results', 'outperform', 'simple', 'benchmarks', 'and', 'are', 'comparable', 'to', 'the', 'bestscoring', 'approach']] | [-0.019566912293379157, 0.046637825418649866, -0.12420642155315384, 0.113673396446609, -0.07170780825624552, -0.11426302135279368, 0.09170936670358812, 0.40668513787381105, -0.25612089115906356, -0.3280145373767606, 0.10275200643530287, -0.24568654061209177, -0.12526474793023185, 0.17583572466057001, -0.0788858809930013, 0.11807784772795071, 0.041360908258899966, -0.013662918685158763, -0.040432529714969294, -0.24410540680315113, 0.2727474644372061, 0.11897638828040022, 0.31749554535690216, 0.0050033091591513024, 0.10386540275969203, 0.006667270936841674, -0.07949941504658183, -0.021520376465016137, -0.12832821543750844, 0.16982664739561862, 0.23973062678199, 0.1560523488453153, 0.33036851083406166, -0.3909144234737017, -0.24462721079014021, 0.10726931760417524, 0.12692783744378544, 0.02249142759111435, -0.014519726881169717, -0.2817455235966636, 0.05226178374141455, -0.19307058939548738, -0.13022687461577714, -0.08926206244313849, 0.001359677787636479, 0.03822821082536138, -0.33474221716250885, 0.09232072341004541, 0.03951133076609838, 0.05555520899339521, -0.03458507492969919, -0.14404777375589436, 0.01614159526306847, 0.09597949781953409, 0.059217656921226755, -0.014468519675534225, 0.12785839661955833, -0.09781355619008697, -0.09457929405844272, 0.3242091248782757, -0.07264876029388875, -0.19956887612609894, 0.14928216568960695, -0.1285756154611322, -0.14951195443440848, 0.12139583598286244, 0.23660526571733484, 0.08956860046321698, -0.175431790646523, 0.06266697608510108, -0.009936064049151358, 0.15849630740276585, 0.03230492481437763, -0.04224897182900527, 0.1906677747653914, 0.20437344477762814, 0.043247830135167004, 0.12403150192570161, -0.14098799437786216, -0.12970233834507564, -0.27867828879498524, -0.0999072502230056, -0.20955897460612588, -0.02815806054436289, -0.12826721869678429, -0.1807268407243919, 0.4036240303954213, 0.18832787895889616, 0.2129645860063194, 0.11226274516404267, 0.2955827646789131, 0.14246470650372986, 0.014815865270965269, 0.10831355754168132, 0.1529149087747332, 0.08620784125686881, 0.04959608960554787, -0.17278241679395423, 0.15433561285215386, 0.0044414994360129885] |
1,802.01086 | All-optical Nanoscale Control of Photon Correlations: Dressed States
Assisted Quantum Interference Effects | We propose an all-optical scheme to control the photon statistics using
hybrid quantum plasmonic system. With the aid of dressed states assisted
quantum interference effects, it is shown that the photon correlations of a
signal field can be continuously modulated from bunching to antibunching under
the control of a pump field. Apart from the exact multimode model, a
single-mode model and an analytical treatment are also provided to help us
identify the roles of multimode coupling and quantum interference between
probability amplitudes. The proposed scheme, in contrast to the cavity quantum
electrodynamics methods, works well even in the bad cavity limit. These
findings suggest that this composite system provides a feasible nanophotonic
platform for active modulation of photon statistics and for future quantum
devices.
| quant-ph | we propose an alloptical scheme to control the photon statistics using hybrid quantum plasmonic system with the aid of dressed states assisted quantum interference effects it is shown that the photon correlations of a signal field can be continuously modulated from bunching to antibunching under the control of a pump field apart from the exact multimode model a singlemode model and an analytical treatment are also provided to help us identify the roles of multimode coupling and quantum interference between probability amplitudes the proposed scheme in contrast to the cavity quantum electrodynamics methods works well even in the bad cavity limit these findings suggest that this composite system provides a feasible nanophotonic platform for active modulation of photon statistics and for future quantum devices | [['we', 'propose', 'an', 'alloptical', 'scheme', 'to', 'control', 'the', 'photon', 'statistics', 'using', 'hybrid', 'quantum', 'plasmonic', 'system', 'with', 'the', 'aid', 'of', 'dressed', 'states', 'assisted', 'quantum', 'interference', 'effects', 'it', 'is', 'shown', 'that', 'the', 'photon', 'correlations', 'of', 'a', 'signal', 'field', 'can', 'be', 'continuously', 'modulated', 'from', 'bunching', 'to', 'antibunching', 'under', 'the', 'control', 'of', 'a', 'pump', 'field', 'apart', 'from', 'the', 'exact', 'multimode', 'model', 'a', 'singlemode', 'model', 'and', 'an', 'analytical', 'treatment', 'are', 'also', 'provided', 'to', 'help', 'us', 'identify', 'the', 'roles', 'of', 'multimode', 'coupling', 'and', 'quantum', 'interference', 'between', 'probability', 'amplitudes', 'the', 'proposed', 'scheme', 'in', 'contrast', 'to', 'the', 'cavity', 'quantum', 'electrodynamics', 'methods', 'works', 'well', 'even', 'in', 'the', 'bad', 'cavity', 'limit', 'these', 'findings', 'suggest', 'that', 'this', 'composite', 'system', 'provides', 'a', 'feasible', 'nanophotonic', 'platform', 'for', 'active', 'modulation', 'of', 'photon', 'statistics', 'and', 'for', 'future', 'quantum', 'devices']] | [-0.16485709966547157, 0.16789445069439207, -0.12921250989330152, 0.048028476565612495, -0.02060294898194937, -0.22574710773093806, 0.08082916052831758, 0.40549241772462286, -0.22592620176052855, -0.28409469154928135, -0.009605714782787066, -0.2583005337209831, -0.16235621966001007, 0.27302332699858406, -0.03163468861396635, 0.11329555034547323, 0.02510422003275204, -0.015053495783509025, 0.02532947666928052, -0.1799452726770523, 0.27106247762323266, 0.06209209864309448, 0.3513817881804801, 0.03792379674221945, 0.1020413110475807, 0.03711412212766346, 0.05163305728215604, -0.030944048027102385, -0.061423173737914054, 0.10171554717676519, 0.2605318339793162, 0.04450584225912368, 0.26729765648563064, -0.44646398222915107, -0.2418632418590395, 0.05862853247972746, 0.16161960996912733, 0.19433358240677345, -0.06457911367948738, -0.3297819859092875, 0.0016140072491966308, -0.175685594961725, -0.1259735123564878, -0.07969463520848583, -0.07092368394519473, -0.006558328840201871, -0.31771808754532566, 0.026869664640417474, 0.024495934351204684, 0.010001565367283841, 0.013122120044441075, -0.0006244863935505911, 0.040031582746098957, 0.11158288197381602, -0.05597677395769184, -0.008192222152325896, 0.15482878161879676, -0.15762744275965698, -0.1831592238816102, 0.32902148633166367, -0.06493088591002649, -0.18205757137207734, 0.1460239788303302, -0.12491738517588426, -0.031849100463835885, 0.13668278654973443, 0.1654208312787476, 0.07723593348336796, -0.12577096411522717, 0.030731300031484644, 0.015085741147143585, 0.21599026146765438, 0.03694277008124176, 0.1731908040857243, 0.2395660992366292, 0.14353292563840025, 0.03330201505412979, 0.17084542308810108, -0.09956638747826219, -0.13186293928283116, -0.3165675271227355, -0.1619788057634592, -0.1805807000116235, 0.045293109882022106, -0.061405210237177425, -0.12527286255006462, 0.37479354567926015, 0.18937836435338062, 0.11147639528667976, -0.015154487855221716, 0.32764087450660523, 0.16882346571993925, 0.06104441676495386, 0.019046668496523655, 0.2977038957253699, 0.18708223799964593, 0.08694432386677832, -0.2996007583532182, -0.019388162557245982, -0.03964042966629589] |
1,802.01087 | Topological interface states mediated by spontaneous symmetry breaking | We propose a one-dimensional nonlinear system of coupled anharmonic
oscillators that dynamically undergoes a topological transition switching from
the {disordered} and topologically trivial phase into the nontrivial one due to
the spontaneous symmetry breaking. The topological transition is accompanied by
the formation of the topological interface state in the spectrum of linearized
excitations of the stationary phase. Our findings thus highlight the potential
of the nonlinear systems for hosting the topological phases and uncover a
fundamental link between the spontaneous symmetry breaking mechanism and
topological edge states.
| cond-mat.mes-hall physics.optics | we propose a onedimensional nonlinear system of coupled anharmonic oscillators that dynamically undergoes a topological transition switching from the disordered and topologically trivial phase into the nontrivial one due to the spontaneous symmetry breaking the topological transition is accompanied by the formation of the topological interface state in the spectrum of linearized excitations of the stationary phase our findings thus highlight the potential of the nonlinear systems for hosting the topological phases and uncover a fundamental link between the spontaneous symmetry breaking mechanism and topological edge states | [['we', 'propose', 'a', 'onedimensional', 'nonlinear', 'system', 'of', 'coupled', 'anharmonic', 'oscillators', 'that', 'dynamically', 'undergoes', 'a', 'topological', 'transition', 'switching', 'from', 'the', 'disordered', 'and', 'topologically', 'trivial', 'phase', 'into', 'the', 'nontrivial', 'one', 'due', 'to', 'the', 'spontaneous', 'symmetry', 'breaking', 'the', 'topological', 'transition', 'is', 'accompanied', 'by', 'the', 'formation', 'of', 'the', 'topological', 'interface', 'state', 'in', 'the', 'spectrum', 'of', 'linearized', 'excitations', 'of', 'the', 'stationary', 'phase', 'our', 'findings', 'thus', 'highlight', 'the', 'potential', 'of', 'the', 'nonlinear', 'systems', 'for', 'hosting', 'the', 'topological', 'phases', 'and', 'uncover', 'a', 'fundamental', 'link', 'between', 'the', 'spontaneous', 'symmetry', 'breaking', 'mechanism', 'and', 'topological', 'edge', 'states']] | [-0.26036430061420146, 0.2632514921862675, -0.06918470381662764, 0.0031519983818181843, -0.05612109282492906, -0.1691854729359948, 0.10612816911661761, 0.3040241529822521, -0.2976811621552226, -0.23306660431212392, 0.06662919297252365, -0.3025001568783974, -0.22264613039877224, 0.07567939000075748, 0.07078429951396739, 0.047638835353327205, -0.05482894165077429, -0.016409819637928372, -0.08566962700369286, -0.10992779633586948, 0.3540082898033761, -0.060880495074751045, 0.35327617151812574, 0.06459755356819637, 0.033952774035733664, -0.056312585759780175, 0.09735197231746225, -0.042830701782261074, -0.13225570704626394, 0.06223285726697088, 0.20837442333884965, -0.04651065023037894, 0.16540279738262467, -0.4550367270264475, -0.25005114293689357, 0.05141416862714051, 0.12168554446777735, 0.16441778693048434, -0.1254843733241332, -0.39187457960569994, 0.057186200465450344, -0.1535357034540382, -0.13180567846023317, -0.0964893604543103, -0.00499748022713024, -0.06331583676022082, -0.19205789956506394, 0.11520362551184907, 0.10670348823380967, 0.041363462080493914, -0.07219574139614043, 0.05271344090378362, -0.16878761947101475, 0.11350244982168078, 0.03417065604750452, 0.00408560098630601, 0.08264921299695711, -0.1685815430674488, -0.16516748296187914, 0.42817201514610614, -0.022161118517597687, -0.112530667784399, 0.21602291999727316, -0.10913851735969582, -0.12010056059272296, 0.1931499690245623, 0.14152005344064605, 0.0669935492573884, -0.051361142368666055, 0.06527135607682104, 0.05018980509933384, 0.18414220138655002, -0.04144815383639572, 0.09183800793734603, 0.30860658323970336, 0.18616328534038587, 0.08111588783219628, 0.2359481443083663, -0.031576057532052886, -0.17027647213892605, -0.29645332163092736, -0.16641186714043904, -0.21005721170797773, 0.05239596935631386, -0.05876527424723087, -0.20426752871095105, 0.5110401845183866, 0.11173879181104444, 0.18341194122665744, -0.035258401501569205, 0.22900112971513606, 0.16350804011995806, 0.043997608103800094, 0.01009502640829004, 0.25885672402707327, 0.17050957675734213, 0.06811085237115193, -0.323829943980572, 0.014601005343305504, 0.07031746930175128] |
1,802.01088 | Sense-and-Predict: Harnessing Spatial Interference Correlation for
Cognitive Radio Networks | Cognitive radio (CR) is a key enabler realizing future networks to achieve
higher spectral efficiency by allowing spectrum sharing between different
wireless networks. It is important to explore whether spectrum access
opportunities are available, but conventional CR based on transmitter (TX)
sensing cannot be used to this end because the paired receiver (RX) may
experience different levels of interference, according to the extent of their
separation, blockages, and beam directions. To address this problem, this paper
proposes a novel form of medium access control (MAC) termed sense-and-predict
(SaP), whereby each secondary TX predicts the interference level at the RX
based on the sensed interference at the TX; this can be quantified in terms of
a spatial interference correlation between the two locations. Using stochastic
geometry, the spatial interference correlation can be expressed in the form of
a conditional coverage probability, such that the signal-to-interference ratio
(SIR) at the RX is no less than a predetermined threshold given the sensed
interference at the TX, defined as an opportunistic probability (OP). The
secondary TX randomly accesses the spectrum depending on OP. We optimize the
SaP framework to maximize the area spectral efficiencies (ASEs) of secondary
networks while guaranteeing the service quality of the primary networks.
Testbed experiments using USRP and MATLAB simulations show that SaP affords
higher ASEs compared with CR without prediction.
| cs.IT cs.NI math.IT | cognitive radio cr is a key enabler realizing future networks to achieve higher spectral efficiency by allowing spectrum sharing between different wireless networks it is important to explore whether spectrum access opportunities are available but conventional cr based on transmitter tx sensing cannot be used to this end because the paired receiver rx may experience different levels of interference according to the extent of their separation blockages and beam directions to address this problem this paper proposes a novel form of medium access control mac termed senseandpredict sap whereby each secondary tx predicts the interference level at the rx based on the sensed interference at the tx this can be quantified in terms of a spatial interference correlation between the two locations using stochastic geometry the spatial interference correlation can be expressed in the form of a conditional coverage probability such that the signaltointerference ratio sir at the rx is no less than a predetermined threshold given the sensed interference at the tx defined as an opportunistic probability op the secondary tx randomly accesses the spectrum depending on op we optimize the sap framework to maximize the area spectral efficiencies ases of secondary networks while guaranteeing the service quality of the primary networks testbed experiments using usrp and matlab simulations show that sap affords higher ases compared with cr without prediction | [['cognitive', 'radio', 'cr', 'is', 'a', 'key', 'enabler', 'realizing', 'future', 'networks', 'to', 'achieve', 'higher', 'spectral', 'efficiency', 'by', 'allowing', 'spectrum', 'sharing', 'between', 'different', 'wireless', 'networks', 'it', 'is', 'important', 'to', 'explore', 'whether', 'spectrum', 'access', 'opportunities', 'are', 'available', 'but', 'conventional', 'cr', 'based', 'on', 'transmitter', 'tx', 'sensing', 'can', 'not', 'be', 'used', 'to', 'this', 'end', 'because', 'the', 'paired', 'receiver', 'rx', 'may', 'experience', 'different', 'levels', 'of', 'interference', 'according', 'to', 'the', 'extent', 'of', 'their', 'separation', 'blockages', 'and', 'beam', 'directions', 'to', 'address', 'this', 'problem', 'this', 'paper', 'proposes', 'a', 'novel', 'form', 'of', 'medium', 'access', 'control', 'mac', 'termed', 'senseandpredict', 'sap', 'whereby', 'each', 'secondary', 'tx', 'predicts', 'the', 'interference', 'level', 'at', 'the', 'rx', 'based', 'on', 'the', 'sensed', 'interference', 'at', 'the', 'tx', 'this', 'can', 'be', 'quantified', 'in', 'terms', 'of', 'a', 'spatial', 'interference', 'correlation', 'between', 'the', 'two', 'locations', 'using', 'stochastic', 'geometry', 'the', 'spatial', 'interference', 'correlation', 'can', 'be', 'expressed', 'in', 'the', 'form', 'of', 'a', 'conditional', 'coverage', 'probability', 'such', 'that', 'the', 'signaltointerference', 'ratio', 'sir', 'at', 'the', 'rx', 'is', 'no', 'less', 'than', 'a', 'predetermined', 'threshold', 'given', 'the', 'sensed', 'interference', 'at', 'the', 'tx', 'defined', 'as', 'an', 'opportunistic', 'probability', 'op', 'the', 'secondary', 'tx', 'randomly', 'accesses', 'the', 'spectrum', 'depending', 'on', 'op', 'we', 'optimize', 'the', 'sap', 'framework', 'to', 'maximize', 'the', 'area', 'spectral', 'efficiencies', 'ases', 'of', 'secondary', 'networks', 'while', 'guaranteeing', 'the', 'service', 'quality', 'of', 'the', 'primary', 'networks', 'testbed', 'experiments', 'using', 'usrp', 'and', 'matlab', 'simulations', 'show', 'that', 'sap', 'affords', 'higher', 'ases', 'compared', 'with', 'cr', 'without', 'prediction']] | [-0.20697865792659714, 0.031790663880715886, -0.03834025196339177, 0.0532843788945626, -0.059836348954891594, -0.21985521740427585, 0.09413381928959398, 0.4173916965065634, -0.28687426471046057, -0.293426693094751, 0.04551858466742265, -0.2549629930777652, -0.15132919966340133, 0.12347591846519702, -0.07885868602318528, 0.0026185844263179876, 0.008531549945473671, 0.05665968408454125, -0.04670486430556153, -0.2088942465285994, 0.29643376063285776, 0.1663679411704336, 0.3666352614617118, 0.0628828689713048, 0.07847793485623747, 0.01701348914229627, -0.03866917477884831, -0.031610133454849684, -0.046746308457228034, 0.09082363718621247, 0.28234990215249256, 0.17893370516214738, 0.2544873215856528, -0.40721316885927955, -0.26146188235791123, 0.10930820992975011, 0.18691021007445127, 0.00027300146560087734, -0.0005181624029438555, -0.2648446442458222, 0.13586050504897573, -0.19438820579236718, -0.05365951604007562, 0.026554176419535103, -0.08812611178511846, 0.06363882616186531, -0.3045962860795134, 0.005992702839525239, -0.023590699883338014, 0.03521783819329415, -0.022383549255929988, -0.11661051250404228, -0.018380301814090158, 0.19212366126918096, -0.017131091199806846, 0.022971897494133215, 0.12402795600953483, -0.08958714862029611, -0.11501640908586544, 0.3781680330598297, 0.005232998343462196, -0.19672060100892685, 0.17769599262818828, -0.12765170226918693, -0.09610204467111651, 0.168957946570253, 0.22474694584772345, 0.05955104604026311, -0.18316702256074, 0.0034524522531078077, 0.023684904706238755, 0.18134454278932774, 0.1107266570614731, 0.10566840163217141, 0.2036382232906457, 0.17694515518094012, 0.12554419563653377, 0.1117185817455148, -0.13963562192719817, -0.054174327198837406, -0.2158254398332226, -0.10186915287360279, -0.20543089062259934, 0.04478520934099418, -0.08280358239742337, -0.06560399360971618, 0.3740330379334072, 0.12188323924151498, 0.17636657449968868, 0.06287831005248413, 0.38593906159112357, 0.12043946208084651, 0.04140436531853656, 0.10803656182694354, 0.17010414251653116, 0.08647513746919229, 0.1605793181459137, -0.2253668334064331, 0.1105751192674141, -0.015267696025111287] |
1,802.01089 | An Energy-aware Mutation Testing Framework for EAST-ADL Architectural
Models | Early design artifacts of embedded systems, such as architectural models,
represent convenient abstractions for reasoning about a system's structure and
functionality. One such example is the Electronic Architecture and Software
Tools-Architecture Description Language (EAST-ADL), a domain-specific
architectural language that targets the automotive industry. EAST-ADL is used
to represent both hardware and software elements, as well as related
extra-functional information (e.g., timing properties, triggering information,
resource consumption). Testing architectural models is an important activity in
engineering large-scale industrial systems, which sparks a growing research
interest. The main contributions of this paper are: (i) an approach for
creating energy-related mutants for EAST-ADL architectural models, (ii) a
method for overcoming the equivalent mutant problem (i.e., the problem of
finding a test case which can distinguish the observable behavior of a mutant
from the original one), (iii) a test generation approach based on UPPAAL
Statistical Model Checker (SMC), and (iv) a test selection criteria based on
mutation analysis using our MATS tool.
| cs.SE | early design artifacts of embedded systems such as architectural models represent convenient abstractions for reasoning about a systems structure and functionality one such example is the electronic architecture and software toolsarchitecture description language eastadl a domainspecific architectural language that targets the automotive industry eastadl is used to represent both hardware and software elements as well as related extrafunctional information eg timing properties triggering information resource consumption testing architectural models is an important activity in engineering largescale industrial systems which sparks a growing research interest the main contributions of this paper are i an approach for creating energyrelated mutants for eastadl architectural models ii a method for overcoming the equivalent mutant problem ie the problem of finding a test case which can distinguish the observable behavior of a mutant from the original one iii a test generation approach based on uppaal statistical model checker smc and iv a test selection criteria based on mutation analysis using our mats tool | [['early', 'design', 'artifacts', 'of', 'embedded', 'systems', 'such', 'as', 'architectural', 'models', 'represent', 'convenient', 'abstractions', 'for', 'reasoning', 'about', 'a', 'systems', 'structure', 'and', 'functionality', 'one', 'such', 'example', 'is', 'the', 'electronic', 'architecture', 'and', 'software', 'toolsarchitecture', 'description', 'language', 'eastadl', 'a', 'domainspecific', 'architectural', 'language', 'that', 'targets', 'the', 'automotive', 'industry', 'eastadl', 'is', 'used', 'to', 'represent', 'both', 'hardware', 'and', 'software', 'elements', 'as', 'well', 'as', 'related', 'extrafunctional', 'information', 'eg', 'timing', 'properties', 'triggering', 'information', 'resource', 'consumption', 'testing', 'architectural', 'models', 'is', 'an', 'important', 'activity', 'in', 'engineering', 'largescale', 'industrial', 'systems', 'which', 'sparks', 'a', 'growing', 'research', 'interest', 'the', 'main', 'contributions', 'of', 'this', 'paper', 'are', 'i', 'an', 'approach', 'for', 'creating', 'energyrelated', 'mutants', 'for', 'eastadl', 'architectural', 'models', 'ii', 'a', 'method', 'for', 'overcoming', 'the', 'equivalent', 'mutant', 'problem', 'ie', 'the', 'problem', 'of', 'finding', 'a', 'test', 'case', 'which', 'can', 'distinguish', 'the', 'observable', 'behavior', 'of', 'a', 'mutant', 'from', 'the', 'original', 'one', 'iii', 'a', 'test', 'generation', 'approach', 'based', 'on', 'uppaal', 'statistical', 'model', 'checker', 'smc', 'and', 'iv', 'a', 'test', 'selection', 'criteria', 'based', 'on', 'mutation', 'analysis', 'using', 'our', 'mats', 'tool']] | [-0.08282360152465998, -0.01788433801192215, -0.07253784704716153, 0.10745736954371878, -0.0973059083720681, -0.21612891251114524, 0.018067249628121278, 0.36865552883297886, -0.25305208313289235, -0.345639995100558, 0.13438122283154208, -0.21808728609852504, -0.1896974096240796, 0.23021226555960264, -0.08933150409320428, 0.06401379664790384, 0.08791332469606523, -0.02389561835451016, 0.010305218999185095, -0.19235513907275903, 0.2547844956053575, 0.043117086486119754, 0.32469225560380205, 0.012581167938365678, 0.07848732377651628, -0.025083692765136244, -0.01657386233727596, -0.010760189920877385, -0.06340267155105345, 0.17317103513495724, 0.31904020058867505, 0.26434503140960147, 0.3192034753804706, -0.41160536212194115, -0.2053781341535935, 0.04997601710959889, 0.12210592540204569, 0.1011649348582497, -0.058960225209178534, -0.28070948208729696, 0.05731272015566374, -0.2207617939089849, -0.09316851308266781, -0.07669308143638216, 0.011795987339836217, 0.02859309260958841, -0.25553859390094463, -0.03928921639824369, 0.09228527383466553, 0.10903104148200078, -0.05849108833428116, -0.1100823889978847, -0.01755796030911196, 0.1458460950310443, 0.0022747077850126633, 0.009017662816995363, 0.19532449559455406, -0.15013555062276304, -0.17782377788743634, 0.4043296117763403, 0.016629390931646726, -0.18789834659072055, 0.21346163530507758, 0.03121560672891273, -0.20943577584341927, 0.05405380209658746, 0.21670068189454306, 0.07310498505701002, -0.22195412174711052, 0.05526631241545651, 0.046013159119779136, 0.2159246746257873, 0.027402821966820652, 0.029071752067987518, 0.25006302354181076, 0.2900830912385225, 0.012212277799370182, 0.1309633456648084, -0.03661072166980642, -0.09313077241728071, -0.2739276064094156, -0.17287358203250322, -0.11316643777202554, 0.0008963732542707377, -0.07069451430075428, -0.20711496602565904, 0.40339759196255615, 0.19049888081362198, 0.09492789178042654, 0.052130653869930155, 0.3501492929161982, 0.035012038452788045, 0.10334765225380364, 0.04553485404889865, 0.10541276520735045, 0.0412020465198928, 0.12789537870046344, -0.18589015829875163, 0.16108501021851115, 0.03529392856552865] |
1,802.0109 | An oversampled collocation approach of the Wave Based Method for
Helmholtz problems | The Wave Based Method (WBM) is a Trefftz method for the simulation of wave
problems in vibroacoustics. Like other Trefftz methods, it employs a
non-standard discretisation basis consisting of solutions of the partial
differential equation (PDE) at hand. We analyse the convergence and numerical
stability of the Wave Based Method for Helmholtz problems using tools from
approximation theory. We show that the set of discretisation functions more
closely resembles a frame, a redundant set of functions, than a basis. The
redundancy of a frame typically leads to ill-conditioning, which indeed is
common in Trefftz methods. Recent theoretical results on frames for function
approximation suggest that the associated ill-conditioned system matrix can be
successfully regularised, with error bounds available, when using a discrete
least squares approach. While the original Wave Based Method is based on a
weighted residual formulation, in this paper we pursue an oversampled
collocation approach instead. We show that, for smooth scattering obstacles in
two dimensions, the results closely follow the theory of frames. We identify
cases where the method achieves very high accuracy whilst providing a solution
with small norm coefficients, in spite of ill-conditioning. Moreover, the
accurate results are reliably maintained even in parameter regimes associated
with extremely high ill-conditioning.
| math.NA | the wave based method wbm is a trefftz method for the simulation of wave problems in vibroacoustics like other trefftz methods it employs a nonstandard discretisation basis consisting of solutions of the partial differential equation pde at hand we analyse the convergence and numerical stability of the wave based method for helmholtz problems using tools from approximation theory we show that the set of discretisation functions more closely resembles a frame a redundant set of functions than a basis the redundancy of a frame typically leads to illconditioning which indeed is common in trefftz methods recent theoretical results on frames for function approximation suggest that the associated illconditioned system matrix can be successfully regularised with error bounds available when using a discrete least squares approach while the original wave based method is based on a weighted residual formulation in this paper we pursue an oversampled collocation approach instead we show that for smooth scattering obstacles in two dimensions the results closely follow the theory of frames we identify cases where the method achieves very high accuracy whilst providing a solution with small norm coefficients in spite of illconditioning moreover the accurate results are reliably maintained even in parameter regimes associated with extremely high illconditioning | [['the', 'wave', 'based', 'method', 'wbm', 'is', 'a', 'trefftz', 'method', 'for', 'the', 'simulation', 'of', 'wave', 'problems', 'in', 'vibroacoustics', 'like', 'other', 'trefftz', 'methods', 'it', 'employs', 'a', 'nonstandard', 'discretisation', 'basis', 'consisting', 'of', 'solutions', 'of', 'the', 'partial', 'differential', 'equation', 'pde', 'at', 'hand', 'we', 'analyse', 'the', 'convergence', 'and', 'numerical', 'stability', 'of', 'the', 'wave', 'based', 'method', 'for', 'helmholtz', 'problems', 'using', 'tools', 'from', 'approximation', 'theory', 'we', 'show', 'that', 'the', 'set', 'of', 'discretisation', 'functions', 'more', 'closely', 'resembles', 'a', 'frame', 'a', 'redundant', 'set', 'of', 'functions', 'than', 'a', 'basis', 'the', 'redundancy', 'of', 'a', 'frame', 'typically', 'leads', 'to', 'illconditioning', 'which', 'indeed', 'is', 'common', 'in', 'trefftz', 'methods', 'recent', 'theoretical', 'results', 'on', 'frames', 'for', 'function', 'approximation', 'suggest', 'that', 'the', 'associated', 'illconditioned', 'system', 'matrix', 'can', 'be', 'successfully', 'regularised', 'with', 'error', 'bounds', 'available', 'when', 'using', 'a', 'discrete', 'least', 'squares', 'approach', 'while', 'the', 'original', 'wave', 'based', 'method', 'is', 'based', 'on', 'a', 'weighted', 'residual', 'formulation', 'in', 'this', 'paper', 'we', 'pursue', 'an', 'oversampled', 'collocation', 'approach', 'instead', 'we', 'show', 'that', 'for', 'smooth', 'scattering', 'obstacles', 'in', 'two', 'dimensions', 'the', 'results', 'closely', 'follow', 'the', 'theory', 'of', 'frames', 'we', 'identify', 'cases', 'where', 'the', 'method', 'achieves', 'very', 'high', 'accuracy', 'whilst', 'providing', 'a', 'solution', 'with', 'small', 'norm', 'coefficients', 'in', 'spite', 'of', 'illconditioning', 'moreover', 'the', 'accurate', 'results', 'are', 'reliably', 'maintained', 'even', 'in', 'parameter', 'regimes', 'associated', 'with', 'extremely', 'high', 'illconditioning']] | [-0.08344878854090805, 0.006245216086016644, -0.11856581008360795, 0.06372420520033213, -0.06271454327118893, -0.12727297557855718, 0.018291192778669224, 0.36638460392315014, -0.2646364383096322, -0.2569692682054843, 0.13512252265354618, -0.26920378418735175, -0.20122040277712194, 0.2276475812586974, -0.07380253946244278, 0.11579201967163268, 0.12810411776858838, 0.0184674477056308, -0.13738949423856742, -0.23014001647585675, 0.32722914531169567, 0.024909549232974063, 0.27985657823121396, 0.003862970629615673, 0.13947592254079805, -0.02740524024771088, -0.037167764878283965, 0.04306301928768424, -0.06700916882936343, 0.1582235867767047, 0.2602135669268832, 0.11527109006419778, 0.3284544798582062, -0.4292426519324163, -0.2166565292527415, 0.05580800447576478, 0.14702731969780014, 0.13153231387938527, -0.03995983861878973, -0.24585188870939115, 0.0871450139797982, -0.1354686270796639, -0.14743965645959856, -0.10900456420894639, -0.049262770800851285, 0.05534506716517795, -0.3329490846783087, 0.12733901379283005, 0.01665865134119111, 0.023801847761205863, -0.0704773212714559, -0.11738350636761763, 0.04963262207799263, 0.025155383876242957, 0.047340852949156555, 0.024930221428090305, 0.05209514129377317, -0.09250706717641294, -0.08491568640673387, 0.39411758481269227, -0.07191848550792201, -0.28497020183496324, 0.17472206530225115, -0.10868881038371839, -0.12173151582999922, 0.1609904024457244, 0.1799795190990884, 0.16858347319865452, -0.1165163857516674, 0.071943346084285, -0.03901742055855792, 0.1790066634729395, 0.06921891008238948, 0.01774237237587644, 0.1011833876837045, 0.17797649482935074, 0.1075629532746925, 0.09869021362957188, -0.06474252351258389, -0.09561072879781325, -0.3059053224529706, -0.11300911656379707, -0.203607456879599, -0.03364989254652185, -0.10549731684773624, -0.188678576226926, 0.37014223283211534, 0.17478007161145226, 0.16909413819666952, 0.08337274999597438, 0.31337787181038557, 0.15773187051244725, 0.04333176427405538, 0.08633784249461457, 0.20955461691425858, 0.12176406117128756, 0.06498421013598357, -0.21260851542876266, 0.029170316589799912, 0.15637320071440555] |
1,802.01091 | Some sharp results on the generalized Tur\'an numbers | For graphs $T, H$, let $ex(n,T,H)$ denote the maximum number of copies of $T$
in an $n$-vertex $H$-free graph. In this paper we prove some sharp results on
this generalization of Tur\'an numbers, where our focus is for the graphs $T,H$
satisfying $\chi(T)<\chi(H)$. This can be dated back to Erd\H{o}s, where he
generalized the celebrated Tur\'an's theorem by showing that for any $r\geq m$,
the Tur\'an graph $T_r(n)$ uniquely attains $ex(n,K_m,K_{r+1})$. For general
graphs $H$ with $\chi(H)=r+1>m$, Alon and Shikhelman showed that
$ex(n,K_m,H)=\binom{r}{m}(\frac{n}{r})^m+o(n^m)$. Here we determine this error
term $o(n^m)$ up to a constant factor. We prove that
$ex(n,K_m,H)=\binom{r}{m}(\frac{n}{r})^m+biex(n,H)\cdot\Theta(n^{m-2})$, where
$biex(n,H)$ is the Tur\'an number of the decomposition family of $H$. As a
special case, we extend Erd\H{o}s' result, by showing that $T_r(n)$ uniquely
attains $ex(n,K_m,H)$ for any edge-critical graph $H$. We also consider $T$
being non-clique, where even the simplest case seems to be intricate. Following
from a more general result, we show that for all $s\leq t$, $T_2(n)$ maximizes
the number of $K_{s,t}$ in $n$-vertex triangle-free graphs if and only if
$t<s+\frac12+\sqrt{2s+\frac14}$.
| math.CO | for graphs t h let exnth denote the maximum number of copies of t in an nvertex hfree graph in this paper we prove some sharp results on this generalization of turan numbers where our focus is for the graphs th satisfying chitchih this can be dated back to erdhos where he generalized the celebrated turans theorem by showing that for any rgeq m the turan graph t_rn uniquely attains exnk_mk_r1 for general graphs h with chihr1m alon and shikhelman showed that exnk_mhbinomrmfracnrmonm here we determine this error term onm up to a constant factor we prove that exnk_mhbinomrmfracnrmbiexnhcdotthetanm2 where biexnh is the turan number of the decomposition family of h as a special case we extend erdhos result by showing that t_rn uniquely attains exnk_mh for any edgecritical graph h we also consider t being nonclique where even the simplest case seems to be intricate following from a more general result we show that for all sleq t t_2n maximizes the number of k_st in nvertex trianglefree graphs if and only if tsfrac12sqrt2sfrac14 | [['for', 'graphs', 't', 'h', 'let', 'exnth', 'denote', 'the', 'maximum', 'number', 'of', 'copies', 'of', 't', 'in', 'an', 'nvertex', 'hfree', 'graph', 'in', 'this', 'paper', 'we', 'prove', 'some', 'sharp', 'results', 'on', 'this', 'generalization', 'of', 'turan', 'numbers', 'where', 'our', 'focus', 'is', 'for', 'the', 'graphs', 'th', 'satisfying', 'chitchih', 'this', 'can', 'be', 'dated', 'back', 'to', 'erdhos', 'where', 'he', 'generalized', 'the', 'celebrated', 'turans', 'theorem', 'by', 'showing', 'that', 'for', 'any', 'rgeq', 'm', 'the', 'turan', 'graph', 't_rn', 'uniquely', 'attains', 'exnk_mk_r1', 'for', 'general', 'graphs', 'h', 'with', 'chihr1m', 'alon', 'and', 'shikhelman', 'showed', 'that', 'exnk_mhbinomrmfracnrmonm', 'here', 'we', 'determine', 'this', 'error', 'term', 'onm', 'up', 'to', 'a', 'constant', 'factor', 'we', 'prove', 'that', 'exnk_mhbinomrmfracnrmbiexnhcdotthetanm2', 'where', 'biexnh', 'is', 'the', 'turan', 'number', 'of', 'the', 'decomposition', 'family', 'of', 'h', 'as', 'a', 'special', 'case', 'we', 'extend', 'erdhos', 'result', 'by', 'showing', 'that', 't_rn', 'uniquely', 'attains', 'exnk_mh', 'for', 'any', 'edgecritical', 'graph', 'h', 'we', 'also', 'consider', 't', 'being', 'nonclique', 'where', 'even', 'the', 'simplest', 'case', 'seems', 'to', 'be', 'intricate', 'following', 'from', 'a', 'more', 'general', 'result', 'we', 'show', 'that', 'for', 'all', 'sleq', 't', 't_2n', 'maximizes', 'the', 'number', 'of', 'k_st', 'in', 'nvertex', 'trianglefree', 'graphs', 'if', 'and', 'only', 'if', 'tsfrac12sqrt2sfrac14']] | [-0.130934369714338, 0.14663133156762784, -0.023315027491612867, 0.02613929886455563, -0.08337768830754089, -0.17077060602040905, 0.058229446050598085, 0.3177914801194812, -0.2768255986950614, -0.3256075177849694, 0.08108139383028064, -0.30022110501727595, -0.1551686372946609, 0.1542574781120162, -0.14983927040276201, -0.03244832036170092, 0.10894881223582409, 0.10967972986470682, 0.03792544675878051, -0.32008317641360035, 0.2860942287822113, -0.04732397640420293, 0.13503620043453393, 0.12716218622570688, 0.03949240045621991, 0.04141325041313063, 0.051396855892204316, 0.06866139454315558, -0.22747785055866132, 0.04720290395798105, 0.25517872437044525, 0.16658336099688753, 0.26072480574137336, -0.3331836805594238, -0.17168176315273298, 0.24179295307646195, 0.1341791880817971, 0.044091849810810706, 0.01636872731006323, -0.20211503465913913, 0.15844020585698837, -0.09107779077056682, -0.10231752538525281, -0.008260014159322688, 0.11933481058839596, -0.0003299843096597628, -0.3348129018576759, 0.021625911866166546, 0.15171037727233136, 0.01402056471799204, 0.06292198175056414, -0.16421770444704276, -0.016472469709079826, 0.06068657726952524, -0.03840453696479513, 0.08435059967380243, -0.01102963851299137, -0.08364390829916704, -0.13552588207477873, 0.3353765562384841, -0.07366216276969874, -0.1298589161399639, 0.04578315584398242, -0.18867256284663173, -0.248680394453307, 0.07062078706256933, 0.08401827953445415, 0.2020005758174441, -0.062231773083013565, 0.17373172590494945, -0.16462100920916506, 0.11366109427868981, 0.1879708525414268, -0.01899067716546018, 0.06136005402288654, 0.08379604896304733, 0.16740010183191661, 0.20531626776651, 0.021734243241547973, 0.019882388850391813, -0.3082892955309062, -0.16534234698805395, -0.26934735303194346, 0.14575948508343461, -0.1743000251084044, -0.14975287875894344, 0.355063864893534, 0.10670269603530566, 0.1848457330527405, 0.14908261488784444, 0.17741273235191, 0.08685326961461794, -0.004747151474778851, 0.22150666914654502, 0.13367734975516654, 0.19749632920561866, -0.008255916328705622, -0.15896256848760515, 0.05953799307939004, 0.1614921002084333] |
1,802.01092 | On homogeneous geodesics and weakly symmetric spaces | In this paper, we establish a sufficient condition for a geodesic in a
Riemannian manifold to be homogeneous, i.e. an orbit of an $1$-parameter
isometry group. As an application of this result, we provide a new proof of the
fact that every weakly symmetric space is geodesic orbit manifold, i.e. all its
geodesics are homogeneous. We also study general properties of homogeneous
geodesics, in particular, the structure of the closure of a given homogeneous
geodesic. We present several examples where this closure is a torus of
dimension $\geq 2$ which is (respectively, is not) totally geodesic in the
ambient manifold. Finally, we discuss homogeneous geodesics in Lie groups
supplied with left-invariant Riemannian metrics.
| math.DG | in this paper we establish a sufficient condition for a geodesic in a riemannian manifold to be homogeneous ie an orbit of an 1parameter isometry group as an application of this result we provide a new proof of the fact that every weakly symmetric space is geodesic orbit manifold ie all its geodesics are homogeneous we also study general properties of homogeneous geodesics in particular the structure of the closure of a given homogeneous geodesic we present several examples where this closure is a torus of dimension geq 2 which is respectively is not totally geodesic in the ambient manifold finally we discuss homogeneous geodesics in lie groups supplied with leftinvariant riemannian metrics | [['in', 'this', 'paper', 'we', 'establish', 'a', 'sufficient', 'condition', 'for', 'a', 'geodesic', 'in', 'a', 'riemannian', 'manifold', 'to', 'be', 'homogeneous', 'ie', 'an', 'orbit', 'of', 'an', '1parameter', 'isometry', 'group', 'as', 'an', 'application', 'of', 'this', 'result', 'we', 'provide', 'a', 'new', 'proof', 'of', 'the', 'fact', 'that', 'every', 'weakly', 'symmetric', 'space', 'is', 'geodesic', 'orbit', 'manifold', 'ie', 'all', 'its', 'geodesics', 'are', 'homogeneous', 'we', 'also', 'study', 'general', 'properties', 'of', 'homogeneous', 'geodesics', 'in', 'particular', 'the', 'structure', 'of', 'the', 'closure', 'of', 'a', 'given', 'homogeneous', 'geodesic', 'we', 'present', 'several', 'examples', 'where', 'this', 'closure', 'is', 'a', 'torus', 'of', 'dimension', 'geq', '2', 'which', 'is', 'respectively', 'is', 'not', 'totally', 'geodesic', 'in', 'the', 'ambient', 'manifold', 'finally', 'we', 'discuss', 'homogeneous', 'geodesics', 'in', 'lie', 'groups', 'supplied', 'with', 'leftinvariant', 'riemannian', 'metrics']] | [-0.22685654590779966, 0.10646387891763043, -0.09189563764638342, 0.045504925530445064, -0.14682745741086856, -0.08555727768936648, -0.04684145307370288, 0.40582284110441674, -0.27498345637479715, -0.1720942551912987, 0.13134731933684707, -0.25499427080797277, -0.16856227897775186, 0.197578070067133, -0.11372237609682885, -0.03143123902464945, 0.08924408031182479, 0.1401595584700498, -0.1267912397882283, -0.2604200247061167, 0.4636015857742951, -0.004090879396823919, 0.1991765665702225, 0.043294606050394015, 0.13774729966787638, -0.02610762683114251, 0.03298052686546822, 0.06733358504566925, -0.1900930759908175, 0.12095800599503635, 0.23129208941132126, 0.11684004282702452, 0.195309285150709, -0.3566317723647267, -0.19231014466325266, 0.19318993615843685, 0.1386665133058827, 0.03570452542147245, -0.05936838638766842, -0.2946075521475446, 0.1179623056442139, -0.11132621498102635, -0.21163189652235767, -0.06301094376506795, 0.048561755683174175, -0.020103503288536342, -0.1995412472628296, 0.01182424742908761, 0.17179686539864117, 0.10855158607978209, -0.11858959795713457, -0.0030304416282662906, 0.001395101753780536, 0.08843664593265219, 0.022605390312661112, 0.04493937060129788, 0.06379147511402113, -0.012107865204437084, -0.0811065068649771, 0.41190319685924764, -0.07524851086782292, -0.31739300494370737, 0.1381804072792617, -0.16431075421087774, -0.15960227922676543, 0.09361816847087008, 0.1686890690908891, 0.2194555331654105, -0.14810467557621032, 0.17834606706947748, -0.11979221599588616, 0.07117158222626235, 0.06184729710798216, -0.03697511083312514, 0.11926030866447342, 0.14612341074858157, 0.18312171704869354, 0.13569654262958475, -0.019543468857398338, -0.03334030241960973, -0.3904668978885212, -0.2559462509002635, -0.13826841327044453, 0.16179372044087004, -0.1519359118692511, -0.21134211497373087, 0.3629698184467193, 0.014434713153250976, 0.2179388379002303, 0.09205176065901534, 0.22827676612784906, 0.03759217458886333, -0.02468771798602116, 0.16813877246350842, 0.19567779377432523, 0.16889899302339922, -0.03162164669648736, -0.11092161867907682, -0.06134753791714268, 0.12111617331351854] |
1,802.01093 | Museum Exhibit Identification Challenge for Domain Adaptation and Beyond | In this paper, we approach an open problem of artwork identification and
propose a new dataset dubbed Open Museum Identification Challenge (Open MIC).
It contains photos of exhibits captured in 10 distinct exhibition spaces of
several museums which showcase paintings, timepieces, sculptures, glassware,
relics, science exhibits, natural history pieces, ceramics, pottery, tools and
indigenous crafts. The goal of Open MIC is to stimulate research in domain
adaptation, egocentric recognition and few-shot learning by providing a testbed
complementary to the famous Office dataset which reaches 90% accuracy. To form
our dataset, we captured a number of images per art piece with a mobile phone
and wearable cameras to form the source and target data splits, respectively.
To achieve robust baselines, we build on a recent approach that aligns
per-class scatter matrices of the source and target CNN streams [15]. Moreover,
we exploit the positive definite nature of such representations by using
end-to-end Bregman divergences and the Riemannian metric. We present baselines
such as training/evaluation per exhibition and training/evaluation on the
combined set covering 866 exhibit identities. As each exhibition poses distinct
challenges e.g., quality of lighting, motion blur, occlusions, clutter,
viewpoint and scale variations, rotations, glares, transparency, non-planarity,
clipping, we break down results w.r.t. these factors.
| cs.CV | in this paper we approach an open problem of artwork identification and propose a new dataset dubbed open museum identification challenge open mic it contains photos of exhibits captured in 10 distinct exhibition spaces of several museums which showcase paintings timepieces sculptures glassware relics science exhibits natural history pieces ceramics pottery tools and indigenous crafts the goal of open mic is to stimulate research in domain adaptation egocentric recognition and fewshot learning by providing a testbed complementary to the famous office dataset which reaches 90 accuracy to form our dataset we captured a number of images per art piece with a mobile phone and wearable cameras to form the source and target data splits respectively to achieve robust baselines we build on a recent approach that aligns perclass scatter matrices of the source and target cnn streams 15 moreover we exploit the positive definite nature of such representations by using endtoend bregman divergences and the riemannian metric we present baselines such as trainingevaluation per exhibition and trainingevaluation on the combined set covering 866 exhibit identities as each exhibition poses distinct challenges eg quality of lighting motion blur occlusions clutter viewpoint and scale variations rotations glares transparency nonplanarity clipping we break down results wrt these factors | [['in', 'this', 'paper', 'we', 'approach', 'an', 'open', 'problem', 'of', 'artwork', 'identification', 'and', 'propose', 'a', 'new', 'dataset', 'dubbed', 'open', 'museum', 'identification', 'challenge', 'open', 'mic', 'it', 'contains', 'photos', 'of', 'exhibits', 'captured', 'in', '10', 'distinct', 'exhibition', 'spaces', 'of', 'several', 'museums', 'which', 'showcase', 'paintings', 'timepieces', 'sculptures', 'glassware', 'relics', 'science', 'exhibits', 'natural', 'history', 'pieces', 'ceramics', 'pottery', 'tools', 'and', 'indigenous', 'crafts', 'the', 'goal', 'of', 'open', 'mic', 'is', 'to', 'stimulate', 'research', 'in', 'domain', 'adaptation', 'egocentric', 'recognition', 'and', 'fewshot', 'learning', 'by', 'providing', 'a', 'testbed', 'complementary', 'to', 'the', 'famous', 'office', 'dataset', 'which', 'reaches', '90', 'accuracy', 'to', 'form', 'our', 'dataset', 'we', 'captured', 'a', 'number', 'of', 'images', 'per', 'art', 'piece', 'with', 'a', 'mobile', 'phone', 'and', 'wearable', 'cameras', 'to', 'form', 'the', 'source', 'and', 'target', 'data', 'splits', 'respectively', 'to', 'achieve', 'robust', 'baselines', 'we', 'build', 'on', 'a', 'recent', 'approach', 'that', 'aligns', 'perclass', 'scatter', 'matrices', 'of', 'the', 'source', 'and', 'target', 'cnn', 'streams', '15', 'moreover', 'we', 'exploit', 'the', 'positive', 'definite', 'nature', 'of', 'such', 'representations', 'by', 'using', 'endtoend', 'bregman', 'divergences', 'and', 'the', 'riemannian', 'metric', 'we', 'present', 'baselines', 'such', 'as', 'trainingevaluation', 'per', 'exhibition', 'and', 'trainingevaluation', 'on', 'the', 'combined', 'set', 'covering', '866', 'exhibit', 'identities', 'as', 'each', 'exhibition', 'poses', 'distinct', 'challenges', 'eg', 'quality', 'of', 'lighting', 'motion', 'blur', 'occlusions', 'clutter', 'viewpoint', 'and', 'scale', 'variations', 'rotations', 'glares', 'transparency', 'nonplanarity', 'clipping', 'we', 'break', 'down', 'results', 'wrt', 'these', 'factors']] | [-0.09783475408539065, 0.020862746481399692, -0.07246426983148008, 0.04339348731113051, -0.13379246413021983, -0.15475492432032392, 0.033971427983849944, 0.43051996230801093, -0.25366307840455526, -0.3881451295276372, 0.08752103156203969, -0.3337347854429217, -0.15032597239921563, 0.18509118067823463, -0.18938992025599402, 0.019917630628145194, 0.11541950256813929, 0.008840005668760533, -0.03771565251274785, -0.26488498629844603, 0.27060869543011584, 0.005189363408859226, 0.3025657684398602, 0.057248659268605395, 0.17313547762150214, -0.025579069128297084, -0.047804112372391704, -0.018801406985009785, -0.06557833312956914, 0.16382578636035416, 0.3038632572148996, 0.21868762768925495, 0.2754850798131277, -0.3767867426883744, -0.15953765634333816, 0.029764276655826403, 0.12989113211829564, 0.05440476510108481, -0.08199592402369359, -0.3832858029465696, 0.0500724821163814, -0.15992228811912573, -0.07148623522556391, -0.09140731742552283, 0.02144449165111769, -0.04055912188713008, -0.227842303118043, 0.0483493072418635, 0.04166860961174564, 0.11659927192185797, -0.07557878063282748, -0.12968730684879481, 0.06627412944272235, 0.19936043463777103, 0.02871819985804579, 0.07932828115160341, 0.1605422205334548, -0.17435172962621942, -0.12825997652768606, 0.37098088398093904, -0.050439186299808175, -0.15398160579025894, 0.19797670985780544, -0.06607688385506731, -0.13644789347763345, 0.09926516356280268, 0.2167484781082803, 0.08387428119926904, -0.15728428545153111, 0.008711839623984403, -0.052776216410577705, 0.17973818651641446, 0.12025811735642564, 0.037218226001723045, 0.2019400900381557, 0.22576367986198534, 0.044081610259113474, 0.15043601750127453, -0.14348306506350914, -0.03708801861326511, -0.21644905476659462, -0.11443554962619175, -0.14292622625188373, 0.03842850663555573, -0.09111613830467813, -0.15060389933838922, 0.39843133742694015, 0.20354288383572366, 0.17941763716870315, 0.053684492951110746, 0.30582497144738835, -0.042343212876498434, 0.11144077003266273, 0.08926997065025183, 0.11799402305779895, 0.005663204437761165, 0.13155385039617024, -0.13779616780073464, 0.027941064409484778, 0.020955552442714024] |
1,802.01094 | Tempered distributions and Schwartz functions on definable manifolds | We define the spaces of Schwartz functions, tempered functions and tempered
distributions on manifolds definable in polynomially bounded o-minimal
structures. We show that all the classical properties that these spaces have in
the Nash category, as first studied in Fokko du Cloux's work, also hold in this
generalized setting. We also show that on manifolds definable in o-minimal
structures that are not polynomially bounded, such a theory can not be
constructed. We present some possible applications, mainly in representation
theory.
| math.RT math.FA math.GT | we define the spaces of schwartz functions tempered functions and tempered distributions on manifolds definable in polynomially bounded ominimal structures we show that all the classical properties that these spaces have in the nash category as first studied in fokko du clouxs work also hold in this generalized setting we also show that on manifolds definable in ominimal structures that are not polynomially bounded such a theory can not be constructed we present some possible applications mainly in representation theory | [['we', 'define', 'the', 'spaces', 'of', 'schwartz', 'functions', 'tempered', 'functions', 'and', 'tempered', 'distributions', 'on', 'manifolds', 'definable', 'in', 'polynomially', 'bounded', 'ominimal', 'structures', 'we', 'show', 'that', 'all', 'the', 'classical', 'properties', 'that', 'these', 'spaces', 'have', 'in', 'the', 'nash', 'category', 'as', 'first', 'studied', 'in', 'fokko', 'du', 'clouxs', 'work', 'also', 'hold', 'in', 'this', 'generalized', 'setting', 'we', 'also', 'show', 'that', 'on', 'manifolds', 'definable', 'in', 'ominimal', 'structures', 'that', 'are', 'not', 'polynomially', 'bounded', 'such', 'a', 'theory', 'can', 'not', 'be', 'constructed', 'we', 'present', 'some', 'possible', 'applications', 'mainly', 'in', 'representation', 'theory']] | [-0.10800099046900868, 0.10196959023148967, -0.1220471197918344, 0.17412152068946177, -0.08672918736910781, -0.04749360996394012, -0.05245400092397363, 0.43952389820837057, -0.3496365267246102, -0.15456302132075414, 0.08471143333904016, -0.2045013855378597, -0.2279838083837277, 0.22547846783000308, -0.14768546915804157, 0.042854122132456936, 0.028406316462235574, 0.06316561120538375, -0.07590431331444937, -0.3231668262623059, 0.4425643697882501, -0.10841589901769438, 0.21534089594840622, 0.05915709581369391, 0.05329284825338385, -0.03299592740427798, 0.007705619827342721, 0.05823247963323807, -0.19227373683026647, 0.12182422728540424, 0.3487940131364247, 0.11887478322172776, 0.2635240435603266, -0.43528808338137776, -0.20791385230870965, 0.2150959810719658, 0.1447802490901011, 0.008062276093719097, -0.046802436971726515, -0.30486380017529696, 0.13501638631957272, -0.16658156824250442, -0.12834490119264677, -0.1670200890646531, 0.025752948334392827, 0.07196335413326056, -0.18441795403710926, 0.0022897188938282528, 0.13936980047191566, 0.05631307115814147, -0.12013904840494387, -0.09532230399931088, -0.02110475693972638, 0.030447376903910667, -0.05525575723881141, 0.03505211652447589, 0.10023267130152537, -0.07249953741959941, -0.1497696672972196, 0.3201668016278209, -0.10496962299713722, -0.2800891891312905, 0.16587462045553808, -0.2169401867983815, -0.26186363083662656, 0.033178016035936966, 0.12347253046643275, 0.2148416838966883, -0.05133663891599728, 0.2488331965414079, -0.139244929027672, 0.0976038728780949, 0.14274681164309955, 0.10590186731842084, 0.03262204866713056, 0.07282918966255891, 0.09301550840684332, 0.1441028050120132, 0.07286902136790256, -0.0988361657207581, -0.3557100316318564, -0.13867590313729566, -0.16085398765668893, 0.055139867260899894, -0.07724905141180781, -0.24397620334266087, 0.31640754568462187, 0.11337795171167296, 0.16318147440846914, 0.16029969261338314, 0.1882278858176552, 0.05290872905588446, 0.02607281671431011, 0.12084035464347555, 0.161501376998972, 0.14768087493781096, 0.03336414589713781, -0.062252615770259395, 0.043079188669649646, 0.13095082238858316] |
1,802.01095 | Josephson-based threshold detector for L\'evy distributed fluctuations | We propose a threshold detector for L\'evy distributed fluctuations based on
a Josephson junction. The L\'evy noise current added to a linearly ramped bias
current results in clear changes in the distribution of switching currents out
of the zero-voltage state of the junction. We observe that the analysis of the
cumulative distribution function of the switching currents supplies information
on both the characteristics shape parameter $\alpha$ of the L\'evy statistics
and the intensity of the fluctuations. Moreover, we discuss a theoretical model
which allows to extract characteristic features of the L\'evy fluctuations from
a measured distribution of switching currents. In view of this results, this
system can effectively find an application as a detector for a L\'evy signal
embedded in a noisy background.
| cond-mat.mes-hall cond-mat.supr-con | we propose a threshold detector for levy distributed fluctuations based on a josephson junction the levy noise current added to a linearly ramped bias current results in clear changes in the distribution of switching currents out of the zerovoltage state of the junction we observe that the analysis of the cumulative distribution function of the switching currents supplies information on both the characteristics shape parameter alpha of the levy statistics and the intensity of the fluctuations moreover we discuss a theoretical model which allows to extract characteristic features of the levy fluctuations from a measured distribution of switching currents in view of this results this system can effectively find an application as a detector for a levy signal embedded in a noisy background | [['we', 'propose', 'a', 'threshold', 'detector', 'for', 'levy', 'distributed', 'fluctuations', 'based', 'on', 'a', 'josephson', 'junction', 'the', 'levy', 'noise', 'current', 'added', 'to', 'a', 'linearly', 'ramped', 'bias', 'current', 'results', 'in', 'clear', 'changes', 'in', 'the', 'distribution', 'of', 'switching', 'currents', 'out', 'of', 'the', 'zerovoltage', 'state', 'of', 'the', 'junction', 'we', 'observe', 'that', 'the', 'analysis', 'of', 'the', 'cumulative', 'distribution', 'function', 'of', 'the', 'switching', 'currents', 'supplies', 'information', 'on', 'both', 'the', 'characteristics', 'shape', 'parameter', 'alpha', 'of', 'the', 'levy', 'statistics', 'and', 'the', 'intensity', 'of', 'the', 'fluctuations', 'moreover', 'we', 'discuss', 'a', 'theoretical', 'model', 'which', 'allows', 'to', 'extract', 'characteristic', 'features', 'of', 'the', 'levy', 'fluctuations', 'from', 'a', 'measured', 'distribution', 'of', 'switching', 'currents', 'in', 'view', 'of', 'this', 'results', 'this', 'system', 'can', 'effectively', 'find', 'an', 'application', 'as', 'a', 'detector', 'for', 'a', 'levy', 'signal', 'embedded', 'in', 'a', 'noisy', 'background']] | [-0.16017854761907724, 0.13263351454816444, -0.13033190802708874, 0.06138699261539775, -0.02010983916574983, -0.10030102054399204, 0.06276496736961228, 0.3544004538841356, -0.2684786545008145, -0.26462403262730655, 0.05527816185106834, -0.2892355140227857, -0.12614153647734747, 0.18840860776656224, -0.050627981562439986, 0.04019514435705373, -0.015630565110472887, 0.021369022841572882, -0.04961373978691948, -0.13916137611599472, 0.29410209590890934, 0.0574566511043567, 0.3358371552700798, 0.016482630865724105, 0.137028421990846, -0.02589433604465207, -0.031079864515582235, 0.022722125225662578, -0.12349704389368814, 0.06334510084003356, 0.20816120962665333, 0.03191958742625103, 0.23283374895780853, -0.41476833456900064, -0.2066533236529648, 0.10574265335860654, 0.11126430119137938, 0.10912305152524505, -0.05090736200449973, -0.3060815592894588, 0.0488636667416166, -0.16318851018067054, -0.11509778009106715, -0.0343790886946386, 0.032326786457068796, 0.07395880541771771, -0.31727316745413026, 0.048946734673033156, 0.09594061181547378, 0.01187159981563445, -0.02702582839969167, -0.1107101502158202, -0.016548897276019176, 0.09389635351509219, 0.021073063357536326, -0.0072461607519582645, 0.23199517270777284, -0.18665643763346068, -0.12892829209596404, 0.24682723843621288, -0.12041730177399468, -0.219382903909659, 0.10110242503536183, -0.19434451303497804, -0.08695980565380154, 0.13878569185612646, 0.17614846354600314, 0.08109604395505768, -0.18200652761483277, 0.052455987538517705, 0.025747403070875783, 0.17301905688231553, 0.01999068206055014, 0.016615981379963035, 0.22716183548725052, 0.1943651619433554, 0.11798099500725304, 0.1868282220831777, -0.17522506156512271, -0.10017961338616727, -0.3463275426074984, -0.11715010354083365, -0.18910695341362702, 0.09962955901656693, -0.07536532419790018, -0.19951793646091612, 0.4659307896636608, 0.21029092128789886, 0.23318937557893313, 0.060946491032997825, 0.28395743955047875, 0.16663747783504215, 0.008078452351132059, 0.025891068913951154, 0.17661922132762953, 0.13739983804289221, 0.144980304533752, -0.23500977498782058, 0.10272214019375785, -0.06881614867219232] |
1,802.01096 | Software Engineers vs. Machine Learning Algorithms: An Empirical Study
Assessing Performance and Reuse Tasks | Several papers have recently contained reports on applying machine learning
(ML) to the automation of software engineering (SE) tasks, such as project
management, modeling and development. However, there appear to be no approaches
comparing how software engineers fare against machine-learning algorithms as
applied to specific software development tasks. Such a comparison is essential
to gain insight into which tasks are better performed by humans and which by
machine learning and how cooperative work or human-in-the-loop processes can be
implemented more effectively. In this paper, we present an empirical study that
compares how software engineers and machine-learning algorithms perform and
reuse tasks. The empirical study involves the synthesis of the control
structure of an autonomous streetlight application. Our approach consists of
four steps. First, we solved the problem using machine learning to determine
specific performance and reuse tasks. Second, we asked software engineers with
different domain knowledge levels to provide a solution to the same tasks.
Third, we compared how software engineers fare against machine-learning
algorithms when accomplishing the performance and reuse tasks based on criteria
such as energy consumption and safety. Finally, we analyzed the results to
understand which tasks are better performed by either humans or algorithms so
that they can work together more effectively. Such an understanding and the
resulting human-in-the-loop approaches, which take into account the strengths
and weaknesses of humans and machine-learning algorithms, are fundamental not
only to provide a basis for cooperative work in support of software
engineering, but also, in other areas.
| cs.SE cs.AI cs.HC cs.LG cs.NE | several papers have recently contained reports on applying machine learning ml to the automation of software engineering se tasks such as project management modeling and development however there appear to be no approaches comparing how software engineers fare against machinelearning algorithms as applied to specific software development tasks such a comparison is essential to gain insight into which tasks are better performed by humans and which by machine learning and how cooperative work or humanintheloop processes can be implemented more effectively in this paper we present an empirical study that compares how software engineers and machinelearning algorithms perform and reuse tasks the empirical study involves the synthesis of the control structure of an autonomous streetlight application our approach consists of four steps first we solved the problem using machine learning to determine specific performance and reuse tasks second we asked software engineers with different domain knowledge levels to provide a solution to the same tasks third we compared how software engineers fare against machinelearning algorithms when accomplishing the performance and reuse tasks based on criteria such as energy consumption and safety finally we analyzed the results to understand which tasks are better performed by either humans or algorithms so that they can work together more effectively such an understanding and the resulting humanintheloop approaches which take into account the strengths and weaknesses of humans and machinelearning algorithms are fundamental not only to provide a basis for cooperative work in support of software engineering but also in other areas | [['several', 'papers', 'have', 'recently', 'contained', 'reports', 'on', 'applying', 'machine', 'learning', 'ml', 'to', 'the', 'automation', 'of', 'software', 'engineering', 'se', 'tasks', 'such', 'as', 'project', 'management', 'modeling', 'and', 'development', 'however', 'there', 'appear', 'to', 'be', 'no', 'approaches', 'comparing', 'how', 'software', 'engineers', 'fare', 'against', 'machinelearning', 'algorithms', 'as', 'applied', 'to', 'specific', 'software', 'development', 'tasks', 'such', 'a', 'comparison', 'is', 'essential', 'to', 'gain', 'insight', 'into', 'which', 'tasks', 'are', 'better', 'performed', 'by', 'humans', 'and', 'which', 'by', 'machine', 'learning', 'and', 'how', 'cooperative', 'work', 'or', 'humanintheloop', 'processes', 'can', 'be', 'implemented', 'more', 'effectively', 'in', 'this', 'paper', 'we', 'present', 'an', 'empirical', 'study', 'that', 'compares', 'how', 'software', 'engineers', 'and', 'machinelearning', 'algorithms', 'perform', 'and', 'reuse', 'tasks', 'the', 'empirical', 'study', 'involves', 'the', 'synthesis', 'of', 'the', 'control', 'structure', 'of', 'an', 'autonomous', 'streetlight', 'application', 'our', 'approach', 'consists', 'of', 'four', 'steps', 'first', 'we', 'solved', 'the', 'problem', 'using', 'machine', 'learning', 'to', 'determine', 'specific', 'performance', 'and', 'reuse', 'tasks', 'second', 'we', 'asked', 'software', 'engineers', 'with', 'different', 'domain', 'knowledge', 'levels', 'to', 'provide', 'a', 'solution', 'to', 'the', 'same', 'tasks', 'third', 'we', 'compared', 'how', 'software', 'engineers', 'fare', 'against', 'machinelearning', 'algorithms', 'when', 'accomplishing', 'the', 'performance', 'and', 'reuse', 'tasks', 'based', 'on', 'criteria', 'such', 'as', 'energy', 'consumption', 'and', 'safety', 'finally', 'we', 'analyzed', 'the', 'results', 'to', 'understand', 'which', 'tasks', 'are', 'better', 'performed', 'by', 'either', 'humans', 'or', 'algorithms', 'so', 'that', 'they', 'can', 'work', 'together', 'more', 'effectively', 'such', 'an', 'understanding', 'and', 'the', 'resulting', 'humanintheloop', 'approaches', 'which', 'take', 'into', 'account', 'the', 'strengths', 'and', 'weaknesses', 'of', 'humans', 'and', 'machinelearning', 'algorithms', 'are', 'fundamental', 'not', 'only', 'to', 'provide', 'a', 'basis', 'for', 'cooperative', 'work', 'in', 'support', 'of', 'software', 'engineering', 'but', 'also', 'in', 'other', 'areas']] | [-0.03245567195004358, -0.007515368941025564, -0.09109666009965213, 0.06292088519638547, -0.13306403161980485, -0.194113764574427, 0.046766685223893115, 0.45531771161220214, -0.23966873269188801, -0.3662858588492822, 0.10630870895009668, -0.22717331736046925, -0.19068665095668114, 0.25287173026682513, -0.10912938610846667, 0.09722224387871893, 0.11460273950511538, -0.0025526018196298374, -0.042509515856619856, -0.3029895761245409, 0.2850964469985984, 0.06285471805967088, 0.3341071061179163, 0.04761536224454883, 0.03526611665173279, -0.011420855059916236, -0.037701335588568134, -0.005009112743894581, -0.09876112879751399, 0.176373615967928, 0.3835690194422281, 0.2537547179313022, 0.3753253427222899, -0.44715223099465146, -0.20623357942080886, 0.08357746042650539, 0.18758806224859617, 0.0806342927618367, -0.019062830637768098, -0.28978209594935783, 0.07513919207390006, -0.1873559356848087, -0.03952911974077946, -0.1761188108044175, -0.05046901279336467, 0.013622583770984973, -0.2285486145733539, -0.05072040868881121, 0.07635895659777558, 0.11527552163824137, -0.04322368880971392, -0.13699537697474393, 0.03533736201331231, 0.22546392476889832, 0.06338168264777674, 0.025152353177729406, 0.17316557901066837, -0.15294344231452386, -0.21629354267179407, 0.4020529375807476, 0.004112458104213044, -0.19658293417463577, 0.24886668010271693, 0.023522067982382953, -0.18875642118387317, 0.04470531728122429, 0.24937977118941726, 0.0837856370838819, -0.19382833601285465, 0.019393631025464445, 0.07154436991078711, 0.1992784233307579, 0.024608645300656134, -0.030059313343607855, 0.1726334272178742, 0.2174310184247426, 0.03813931875888575, 0.11360365079611215, -0.0005462524039964927, -0.07789147081822609, -0.19493551427490918, -0.13860949566814038, -0.15200212407246352, -0.02152894880062465, -0.015873639992646106, -0.12975584525946784, 0.3806629606960002, 0.2287626464480981, 0.13038632646627227, 0.04650472220681939, 0.38263630664903625, 0.062123182054367745, 0.09319639131027076, 0.10896205260542784, 0.1905769149514541, 0.01077879850115431, 0.14829450324064625, -0.19205775562834526, 0.08135256798243196, -0.004912923170283799] |
1,802.01097 | More on Weinberg's No Go Theorem in Quantum Gravity | We complement Weinberg's no go theorem on the cosmological constant problem
in quantum gravity by generalizing it to the case of a scale-invariant theory.
Our analysis makes use of the effective action and the BRST symmetry in a
manifestly covariant quantum gravity instead of the classical Lagrangian
density and the $GL(4)$ symmetry in classical gravity. In this sense, our proof
is very general since it does not depend on details of quantum gravity and
holds true for general gravitational theories which are invariant under
diffeomorphisms. As an application of our theorem, we comment on an idea that
in the asymptotic safety scenario the functional renormalization flow drives a
cosmological constant to zero, solving the cosmological constant problem
without reference to fine tuning of parameters. Finally, we also comment on the
possibility of extending the Weinberg theorem in quantum gravity to the case
where the translational invariance is spontaneously broken.
| hep-th gr-qc | we complement weinbergs no go theorem on the cosmological constant problem in quantum gravity by generalizing it to the case of a scaleinvariant theory our analysis makes use of the effective action and the brst symmetry in a manifestly covariant quantum gravity instead of the classical lagrangian density and the gl4 symmetry in classical gravity in this sense our proof is very general since it does not depend on details of quantum gravity and holds true for general gravitational theories which are invariant under diffeomorphisms as an application of our theorem we comment on an idea that in the asymptotic safety scenario the functional renormalization flow drives a cosmological constant to zero solving the cosmological constant problem without reference to fine tuning of parameters finally we also comment on the possibility of extending the weinberg theorem in quantum gravity to the case where the translational invariance is spontaneously broken | [['we', 'complement', 'weinbergs', 'no', 'go', 'theorem', 'on', 'the', 'cosmological', 'constant', 'problem', 'in', 'quantum', 'gravity', 'by', 'generalizing', 'it', 'to', 'the', 'case', 'of', 'a', 'scaleinvariant', 'theory', 'our', 'analysis', 'makes', 'use', 'of', 'the', 'effective', 'action', 'and', 'the', 'brst', 'symmetry', 'in', 'a', 'manifestly', 'covariant', 'quantum', 'gravity', 'instead', 'of', 'the', 'classical', 'lagrangian', 'density', 'and', 'the', 'gl4', 'symmetry', 'in', 'classical', 'gravity', 'in', 'this', 'sense', 'our', 'proof', 'is', 'very', 'general', 'since', 'it', 'does', 'not', 'depend', 'on', 'details', 'of', 'quantum', 'gravity', 'and', 'holds', 'true', 'for', 'general', 'gravitational', 'theories', 'which', 'are', 'invariant', 'under', 'diffeomorphisms', 'as', 'an', 'application', 'of', 'our', 'theorem', 'we', 'comment', 'on', 'an', 'idea', 'that', 'in', 'the', 'asymptotic', 'safety', 'scenario', 'the', 'functional', 'renormalization', 'flow', 'drives', 'a', 'cosmological', 'constant', 'to', 'zero', 'solving', 'the', 'cosmological', 'constant', 'problem', 'without', 'reference', 'to', 'fine', 'tuning', 'of', 'parameters', 'finally', 'we', 'also', 'comment', 'on', 'the', 'possibility', 'of', 'extending', 'the', 'weinberg', 'theorem', 'in', 'quantum', 'gravity', 'to', 'the', 'case', 'where', 'the', 'translational', 'invariance', 'is', 'spontaneously', 'broken']] | [-0.15146245656460022, 0.12695952459420515, -0.13700969213144792, 0.0872975819151936, -0.1254687157097029, -0.1488029658524851, 0.01760798186648187, 0.27555047166252494, -0.2223897474386648, -0.2662620341011492, 0.07429972305681382, -0.21742754432704026, -0.1592226931450251, 0.15737177370641156, -0.09518772473827554, 0.05241241527333756, -0.030908292914184447, 0.05626128288298445, -0.09977380535877842, -0.2440435484148587, 0.347945405139069, 0.06668013750087945, 0.26751268034388354, 0.08668489295218902, 0.10548586449226452, 0.032645842447976935, -0.010916797978641002, -0.003086450672239665, -0.14452893415571624, 0.0698834325334576, 0.18420813460490548, 0.08582262147918043, 0.2301591532242378, -0.41247558929401157, -0.23863269034351203, 0.08094998247665197, 0.10035166785983532, 0.18750728835154876, -0.03223655993864692, -0.29863587729695357, 0.07842861203439283, -0.15347478946908408, -0.17931714761164663, -0.08959505306994354, -0.014071758836507797, -0.11338520545891301, -0.22020063794924308, 0.09861715370671974, 0.08374770599473642, 0.037417571322879935, -0.060602458993960544, -0.011948850680917701, 0.0030438768718041628, 0.07471278398891523, 0.11853052821047855, 0.04772753552096152, 0.14764423156313397, -0.14367163516799825, -0.09849756278782058, 0.43093512915449855, -0.10977078920609987, -0.2580231926138294, 0.14697534904108953, -0.11127064866482611, -0.22589134146543782, 0.017605054613371574, 0.0748280459677413, 0.15807633650107872, -0.08745481325438459, 0.21873491585462498, -0.051698520802267695, 0.1466831048066109, 0.09283118085363792, 0.03479724661351397, 0.20957360484937343, 0.07028738913695085, 0.1037007112551368, 0.08191283694749711, 0.014615332210848996, -0.16100258133280398, -0.40835886476123895, -0.15245539952544557, -0.17922373856699106, 0.10169366607530396, -0.13036854474560355, -0.17224533027452074, 0.351136664134894, 0.17012020279168957, 0.11661205350752644, 0.10014429714783851, 0.2667695549316704, 0.11315935240330287, 0.06385898454608584, 0.06481408324223886, 0.28721034743248064, 0.16687400617102324, 0.07246530702065726, -0.25100450625255605, -0.03843749267199145, 0.12476912794178414] |
1,802.01098 | Geometric equivalence of $\pi$-torsion free nilpotent groups | In this paper we study the property of geometric equivalence of groups
introduced by B. Plotkin \cite{P1, P2}. Sufficient and necessary conditions are
presented for a $\pi$-torsion-free nilpotent group to be geometrically
equivalent to its $\pi$-completion.
We prove that a relatively free nilpotent $\pi$-torsion-free group and its
$\pi$-completion define the same quasi-variety. Examples of $\pi$-torsion-free
nilpotent groups that are geometrically equivalent to their $\pi$-completions
are given.
| math.AG math.GR | in this paper we study the property of geometric equivalence of groups introduced by b plotkin citep1 p2 sufficient and necessary conditions are presented for a pitorsionfree nilpotent group to be geometrically equivalent to its picompletion we prove that a relatively free nilpotent pitorsionfree group and its picompletion define the same quasivariety examples of pitorsionfree nilpotent groups that are geometrically equivalent to their picompletions are given | [['in', 'this', 'paper', 'we', 'study', 'the', 'property', 'of', 'geometric', 'equivalence', 'of', 'groups', 'introduced', 'by', 'b', 'plotkin', 'citep1', 'p2', 'sufficient', 'and', 'necessary', 'conditions', 'are', 'presented', 'for', 'a', 'pitorsionfree', 'nilpotent', 'group', 'to', 'be', 'geometrically', 'equivalent', 'to', 'its', 'picompletion', 'we', 'prove', 'that', 'a', 'relatively', 'free', 'nilpotent', 'pitorsionfree', 'group', 'and', 'its', 'picompletion', 'define', 'the', 'same', 'quasivariety', 'examples', 'of', 'pitorsionfree', 'nilpotent', 'groups', 'that', 'are', 'geometrically', 'equivalent', 'to', 'their', 'picompletions', 'are', 'given']] | [-0.16769784348942932, 0.1290630070189576, -0.089746181082557, 0.08711408042267615, -0.11518607926850635, -0.15808965067660052, -0.007460283701278506, 0.42393719363543725, -0.3087777229292052, -0.21782974917293776, 0.1524149995973511, -0.18496621938215363, -0.11921720506830348, 0.17369966726336214, -0.1935269016299456, -0.038937971267538764, 0.023942201693971005, 0.10347752113427434, -0.08479997481308169, -0.3028983238434035, 0.35458937302113525, -0.021782850048371723, 0.19392721771099974, 0.025250895017211044, 0.11473140359989234, -0.0323682895580691, -0.01862193658460109, 0.02268601402581211, -0.18222768357257352, 0.13365466180183586, 0.27762237043371274, 0.0753467333510459, 0.21139146224226033, -0.33848088548060445, -0.10214725221019416, 0.19351868675873865, 0.12184913424656742, 0.00342205466909541, -0.06274268018185264, -0.276089317327927, 0.19735503178976832, -0.18136824439797136, -0.14829700538474652, -0.0919228081059243, 0.08498076631850193, 0.0105691271102322, -0.22110573095195588, 0.022155367577123265, 0.12854198839456316, 0.1243625149012558, -0.06450162527506195, -0.03901964236242098, -0.06938387806867323, 0.11345089989758673, -0.0012343960208079173, -0.05126548696324111, 0.08299833391275671, -0.008431701784184764, -0.08557362682444768, 0.42397008647048284, -0.0066065556029715235, -0.21880426748640955, 0.19810184882953763, -0.1361730256605716, -0.1780363609940405, 0.10556214364496844, 0.08416840060067082, 0.18823940280292714, -0.11900630169030693, 0.1608338206840147, -0.13722821169843277, 0.031188011742270892, 0.04715252638838831, 0.00900580652708572, 0.07375019572542182, 0.04271341220194858, 0.08099096340204899, 0.13827531478582097, 0.10011489075859861, 0.0393682877932276, -0.37500827985682655, -0.20095934551800526, -0.08525612536403868, 0.07279506869732387, -0.04305164599449315, -0.14038519907949698, 0.38477287122181486, 0.10991150394658603, 0.1463426114873044, 0.13506703667729789, 0.16679269879583328, 0.05929214216765046, 0.05519652811695807, 0.06343590973743371, 0.1465216025872718, 0.2636927642364291, -0.10327078591263483, -0.15042149889031572, -0.035306434834464676, 0.17288947525981163] |
1,802.01099 | Equivalent Bergman Spaces with Inequivalent Weights | We give a proof that every space of weighted square-integrable holomorphic
functions admits an equivalent weight whose Bergman kernel has zeroes. Here the
weights are equivalent in the sense that they determine the same space of
holomorphic functions. Additionally, a family of radial weights in
$L^1(\mathbb{C})$ whose associated Bergman kernels have infinitely many zeroes
is exhibited.
| math.CV | we give a proof that every space of weighted squareintegrable holomorphic functions admits an equivalent weight whose bergman kernel has zeroes here the weights are equivalent in the sense that they determine the same space of holomorphic functions additionally a family of radial weights in l1mathbbc whose associated bergman kernels have infinitely many zeroes is exhibited | [['we', 'give', 'a', 'proof', 'that', 'every', 'space', 'of', 'weighted', 'squareintegrable', 'holomorphic', 'functions', 'admits', 'an', 'equivalent', 'weight', 'whose', 'bergman', 'kernel', 'has', 'zeroes', 'here', 'the', 'weights', 'are', 'equivalent', 'in', 'the', 'sense', 'that', 'they', 'determine', 'the', 'same', 'space', 'of', 'holomorphic', 'functions', 'additionally', 'a', 'family', 'of', 'radial', 'weights', 'in', 'l1mathbbc', 'whose', 'associated', 'bergman', 'kernels', 'have', 'infinitely', 'many', 'zeroes', 'is', 'exhibited']] | [-0.1512116721915928, 0.0908197519562567, -0.09404246996749531, 0.09243856557771903, -0.10564664686945352, -0.09899599750272252, -0.03325287308543921, 0.43581623868508773, -0.271851469847289, -0.10224625304002653, 0.09046811978332699, -0.2651064498180693, -0.21186893280934205, 0.19118987443772228, -0.08913414531641385, 0.0798213077370416, 0.09216874249448831, 0.1216344531964172, -0.158385275721296, -0.2854795820333741, 0.43762713934887537, -0.03135604087094014, 0.16205939863893118, 0.03402043543756008, 0.1594921330826103, -0.029772197836163368, -0.060950227301906454, -0.07755828586258841, -0.1549578648666449, 0.12535351475870068, 0.2759111427786675, 0.07684181766076521, 0.3210373211990703, -0.3707070949291599, -0.15023781827396968, 0.31459989801726557, 0.1637501879341223, -0.10934843232601203, 0.048474355160512704, -0.20437897421758283, 0.046714941920204596, -0.0741528146222911, -0.19860623462802984, -0.14013272573409433, 0.06296650430356915, 0.08467066021297466, -0.26445933753116563, -0.009009157121181489, 0.13938322385603732, 0.035940862142226915, -0.1192906640724025, -0.14062084771523423, -0.0741871301592751, 0.057888601415536624, -0.034846544862640175, 0.11576821730387482, 0.04918727271830325, -0.08137187397276813, -0.11711665923834186, 0.2626797120203264, -0.0753507644107396, -0.33017266677184537, 0.11663613380356268, -0.168373908796771, -0.16057539835402912, 0.15869509010067717, 0.07238525664433837, 0.14864523131400348, -0.08675644827837294, 0.21982090769504958, -0.19980263601649892, 0.06911243175749074, 0.17765773095359857, 0.07697489984672178, 0.12244990202174945, -0.004462545161897486, 0.11806455429283563, 0.14401806106960233, -0.0040473880764858965, -0.07835917934267358, -0.3437454253435135, -0.16078911632807416, -0.21976211756806482, 0.08927880536595528, -0.15653739735399458, -0.32251121051270853, 0.4458481578495015, 0.013925312408669429, 0.26939496397972107, 0.16536135736175558, 0.11586807501840998, 0.1871062461075119, 0.13236253843219442, 0.12177325967191295, 0.1379069407809187, 0.17539436756209895, 0.0037397856146774507, -0.10564361222257668, 0.059412252257937906, 0.20801788026636298] |
1,802.011 | The Deeper Wider Faster program: chasing the fastest bursts in the
Universe | We present the Deeper Wider Faster (DWF) program that coordinates more than
30 multi-wavelength and multi-messenger facilities worldwide and in space to
detect and study fast transients (millisecond-to-hours duration). DWF has four
main components, (1) simultaneous observations, where about 10 major
facilities, from radio to gamma-ray, are coordinated to perform deep,
wide-field, fast-cadenced observations of the same field at the same time.
Radio telescopes search for fast radio bursts while optical imagers and
high-energy instruments search for seconds-to-hours timescale transient events,
(2) real-time (seconds to minutes) supercomputer data processing and candidate
identification, along with real-time (minutes) human inspection of candidates
using sophisticated visualisation technology, (3) rapid-response (minutes)
follow-up spectroscopy and imaging and conventional ToO observations, and (4)
long-term follow up with a global network of 1-4m-class telescopes. The
principal goals of DWF are to discover and study counterparts to fast radio
bursts and gravitational wave events, along with millisecond-to-hour duration
transients at all wavelengths.
| astro-ph.IM astro-ph.HE | we present the deeper wider faster dwf program that coordinates more than 30 multiwavelength and multimessenger facilities worldwide and in space to detect and study fast transients millisecondtohours duration dwf has four main components 1 simultaneous observations where about 10 major facilities from radio to gammaray are coordinated to perform deep widefield fastcadenced observations of the same field at the same time radio telescopes search for fast radio bursts while optical imagers and highenergy instruments search for secondstohours timescale transient events 2 realtime seconds to minutes supercomputer data processing and candidate identification along with realtime minutes human inspection of candidates using sophisticated visualisation technology 3 rapidresponse minutes followup spectroscopy and imaging and conventional too observations and 4 longterm follow up with a global network of 14mclass telescopes the principal goals of dwf are to discover and study counterparts to fast radio bursts and gravitational wave events along with millisecondtohour duration transients at all wavelengths | [['we', 'present', 'the', 'deeper', 'wider', 'faster', 'dwf', 'program', 'that', 'coordinates', 'more', 'than', '30', 'multiwavelength', 'and', 'multimessenger', 'facilities', 'worldwide', 'and', 'in', 'space', 'to', 'detect', 'and', 'study', 'fast', 'transients', 'millisecondtohours', 'duration', 'dwf', 'has', 'four', 'main', 'components', '1', 'simultaneous', 'observations', 'where', 'about', '10', 'major', 'facilities', 'from', 'radio', 'to', 'gammaray', 'are', 'coordinated', 'to', 'perform', 'deep', 'widefield', 'fastcadenced', 'observations', 'of', 'the', 'same', 'field', 'at', 'the', 'same', 'time', 'radio', 'telescopes', 'search', 'for', 'fast', 'radio', 'bursts', 'while', 'optical', 'imagers', 'and', 'highenergy', 'instruments', 'search', 'for', 'secondstohours', 'timescale', 'transient', 'events', '2', 'realtime', 'seconds', 'to', 'minutes', 'supercomputer', 'data', 'processing', 'and', 'candidate', 'identification', 'along', 'with', 'realtime', 'minutes', 'human', 'inspection', 'of', 'candidates', 'using', 'sophisticated', 'visualisation', 'technology', '3', 'rapidresponse', 'minutes', 'followup', 'spectroscopy', 'and', 'imaging', 'and', 'conventional', 'too', 'observations', 'and', '4', 'longterm', 'follow', 'up', 'with', 'a', 'global', 'network', 'of', '14mclass', 'telescopes', 'the', 'principal', 'goals', 'of', 'dwf', 'are', 'to', 'discover', 'and', 'study', 'counterparts', 'to', 'fast', 'radio', 'bursts', 'and', 'gravitational', 'wave', 'events', 'along', 'with', 'millisecondtohour', 'duration', 'transients', 'at', 'all', 'wavelengths']] | [-0.1015374992215059, 0.12340221417936553, -0.01425286809657544, 0.08807418889822376, -0.16234811141168162, -0.14145577071397097, 0.060544934472219154, 0.5009284896788581, -0.18059112603233926, -0.3867970236761483, 0.17909862299765392, -0.3188174124119566, -0.054976335403996976, 0.2714970695783053, 0.038517072349911766, 0.022806254015522914, 0.16757293366639556, -0.09382497243608204, -0.06668647061002085, -0.19899964196163686, 0.14623895740361523, 0.15821028289978156, 0.22308273538993983, -0.06791574140423096, 0.06953672397234821, 0.004106033312144296, -0.1289592299410361, -0.09793429189590556, -0.04949396230998619, 0.05033165886498138, 0.28384399642830327, 0.21614265953809422, 0.23666020736548324, -0.4671007988336902, -0.23346287394317505, 0.07956201968177053, 0.13749593794314605, -0.021893920972255752, 0.015219197203323164, -0.3341241129423998, 0.08209178923010427, -0.133929529530465, -0.17610311357112252, -0.01374129140624564, 0.07900786686191748, 0.06622428133507141, -0.19829740754684946, 0.031164307516043217, -0.09026346244750039, 0.10282358254818558, -0.09273306910892411, -0.04198515072664959, 0.06948611253384976, 0.11072756401606954, 0.04749707402364545, 0.11073608397374918, 0.11849370306739021, -0.1649072390680995, -0.18020649658103519, 0.36601742460148645, -0.028222461786271923, 0.05790696929258938, 0.24361031074795697, -0.20639094302036967, -0.20869391898455836, 0.21491851967653172, 0.21810450938048978, 0.12739115688424782, -0.18609168973045062, -0.08461346071847908, 0.08015592157500467, 0.228611635094221, 0.05818856477381149, 0.09652330515431178, 0.260541642459747, 0.20456618181861086, 0.0913038526191638, 0.07768052078833516, -0.26549618347468257, 0.003989959385671072, -0.2381060978963396, -0.09249002772114621, -0.11803401674490872, 0.07066627840686124, -0.06284710832917594, -0.06869549726623567, 0.4251646605982827, 0.15328642823452118, 0.08997596291850177, 0.08510151974569331, 0.34168376736092887, -0.002755190101264657, 0.16054410686178897, 0.09755289945563914, 0.26978334419791833, 0.026904718544109155, 0.1944447512060229, -0.1491425836055646, -0.04392628482974216, -0.019798027651521985] |
1,802.01101 | Universal quantum noise in adiabatic pumping | We consider charge pumping in a system of parafermions, implemented at
fractional quantum Hall edges. Our pumping protocol leads to a noisy behavior
of the pumped current. As the adiabatic limit is approached, not only does the
noisy behavior persist but the counting statistics of the pumped current
becomes robust and universal. In particular, the resulting Fano factor is given
in terms of the system's topological degeneracy and the pumped quasiparticle
charge. Our results are also applicable to the more conventional Majorana
fermions.
| cond-mat.mes-hall cond-mat.str-el | we consider charge pumping in a system of parafermions implemented at fractional quantum hall edges our pumping protocol leads to a noisy behavior of the pumped current as the adiabatic limit is approached not only does the noisy behavior persist but the counting statistics of the pumped current becomes robust and universal in particular the resulting fano factor is given in terms of the systems topological degeneracy and the pumped quasiparticle charge our results are also applicable to the more conventional majorana fermions | [['we', 'consider', 'charge', 'pumping', 'in', 'a', 'system', 'of', 'parafermions', 'implemented', 'at', 'fractional', 'quantum', 'hall', 'edges', 'our', 'pumping', 'protocol', 'leads', 'to', 'a', 'noisy', 'behavior', 'of', 'the', 'pumped', 'current', 'as', 'the', 'adiabatic', 'limit', 'is', 'approached', 'not', 'only', 'does', 'the', 'noisy', 'behavior', 'persist', 'but', 'the', 'counting', 'statistics', 'of', 'the', 'pumped', 'current', 'becomes', 'robust', 'and', 'universal', 'in', 'particular', 'the', 'resulting', 'fano', 'factor', 'is', 'given', 'in', 'terms', 'of', 'the', 'systems', 'topological', 'degeneracy', 'and', 'the', 'pumped', 'quasiparticle', 'charge', 'our', 'results', 'are', 'also', 'applicable', 'to', 'the', 'more', 'conventional', 'majorana', 'fermions']] | [-0.2076957435529477, 0.19563894640901183, -0.03971903885613723, 0.02935088009865259, -0.006251375909041928, -0.18400799325409245, 0.07376705656944584, 0.32199723998376406, -0.2414457283644791, -0.23838694618049874, 0.045642121286827125, -0.27573125490761663, -0.10761750354263258, 0.2064633900860706, -0.0818603064315057, 0.05604218869296138, -0.0029164432233805397, 0.019329086246238237, -0.07062888346754115, -0.237184245490009, 0.29073013127388725, -0.011802337599458196, 0.3283455429419157, 0.06612912774175765, 0.054249278729759064, -0.016985603176191987, 0.059263797589095245, 0.014063516778994846, -0.09830859385666449, 0.05735918536153903, 0.2663657806970807, -0.04492046798478408, 0.1842812910698444, -0.42760349644056284, -0.18166278193828211, 0.09195553089480803, 0.17591790649030042, 0.1983393952362688, -0.025602953074568693, -0.2896935928904687, 0.04431383131374886, -0.18860901869743704, -0.11102450957398367, -0.09823285630085023, -0.01751726332502103, -0.03862245420712125, -0.2653463994663388, 0.1191344319373588, 0.11676486423351319, 0.017594097372907472, 0.014529930206060589, -0.06755812070472728, -0.05703984003469168, 0.11130962600785656, -0.018113620906047165, -0.004133240556826882, 0.21141154573198004, -0.20397604756191912, -0.14868651951539769, 0.376508813760249, -0.08701141611448522, -0.17942624332675014, 0.15444147310791964, -0.17508636032377023, -0.06470382255670357, 0.14127885378583008, 0.08410904602237405, 0.1172454937035779, -0.08847970908215966, 0.06528194722051855, -0.051728276838829, 0.1674858168530536, 0.025863730859190942, 0.12346104779336826, 0.24229113710483155, 0.17613740192434515, 0.1044731664987483, 0.13343236442509454, -0.08354156054219747, -0.10992824916828828, -0.30056493448834104, -0.13712328647723399, -0.25157453161832616, 0.09326626739695427, -0.011274601848647335, -0.17183797341962176, 0.4540396661284458, 0.1942928960541241, 0.1695258323753993, 0.021077907439433486, 0.2992010126451412, 0.24388108873341502, 0.04817239955875529, 0.05921185203457633, 0.24066016120634165, 0.13589993210127913, 0.11824768068022039, -0.30056277167399875, 0.007200181798403521, -0.0024935049621994236] |
1,802.01102 | Universal kinematic scaling as a probe of factorized long-distance
effects in high-energy quarkonium production | Dimensional analysis reveals general kinematic scaling rules for the
momentum, mass, and energy dependence of Drell-Yan and quarkonium cross
sections. Their application to mid-rapidity LHC data provides strong
experimental evidence supporting the validity of the factorization ansatz, a
cornerstone of non-relativistic QCD, still lacking theoretical demonstration.
Moreover, data-driven patterns emerge for the factorizable long-distance
bound-state formation effects, including a remarkable correlation between the
S-wave quarkonium cross sections and their binding energies. Assuming that this
scaling can be extended to the P-wave case, we obtain precise predictions for
the not yet measured feed-down fractions, thereby providing a complete picture
of the charmonium and bottomonium feed-down structure. This is crucial
information for quantitative interpretations of quarkonium production data,
including studies of the suppression patterns measured in nucleus-nucleus
collisions.
| hep-ph | dimensional analysis reveals general kinematic scaling rules for the momentum mass and energy dependence of drellyan and quarkonium cross sections their application to midrapidity lhc data provides strong experimental evidence supporting the validity of the factorization ansatz a cornerstone of nonrelativistic qcd still lacking theoretical demonstration moreover datadriven patterns emerge for the factorizable longdistance boundstate formation effects including a remarkable correlation between the swave quarkonium cross sections and their binding energies assuming that this scaling can be extended to the pwave case we obtain precise predictions for the not yet measured feeddown fractions thereby providing a complete picture of the charmonium and bottomonium feeddown structure this is crucial information for quantitative interpretations of quarkonium production data including studies of the suppression patterns measured in nucleusnucleus collisions | [['dimensional', 'analysis', 'reveals', 'general', 'kinematic', 'scaling', 'rules', 'for', 'the', 'momentum', 'mass', 'and', 'energy', 'dependence', 'of', 'drellyan', 'and', 'quarkonium', 'cross', 'sections', 'their', 'application', 'to', 'midrapidity', 'lhc', 'data', 'provides', 'strong', 'experimental', 'evidence', 'supporting', 'the', 'validity', 'of', 'the', 'factorization', 'ansatz', 'a', 'cornerstone', 'of', 'nonrelativistic', 'qcd', 'still', 'lacking', 'theoretical', 'demonstration', 'moreover', 'datadriven', 'patterns', 'emerge', 'for', 'the', 'factorizable', 'longdistance', 'boundstate', 'formation', 'effects', 'including', 'a', 'remarkable', 'correlation', 'between', 'the', 'swave', 'quarkonium', 'cross', 'sections', 'and', 'their', 'binding', 'energies', 'assuming', 'that', 'this', 'scaling', 'can', 'be', 'extended', 'to', 'the', 'pwave', 'case', 'we', 'obtain', 'precise', 'predictions', 'for', 'the', 'not', 'yet', 'measured', 'feeddown', 'fractions', 'thereby', 'providing', 'a', 'complete', 'picture', 'of', 'the', 'charmonium', 'and', 'bottomonium', 'feeddown', 'structure', 'this', 'is', 'crucial', 'information', 'for', 'quantitative', 'interpretations', 'of', 'quarkonium', 'production', 'data', 'including', 'studies', 'of', 'the', 'suppression', 'patterns', 'measured', 'in', 'nucleusnucleus', 'collisions']] | [-0.08621940678188814, 0.14954641812604794, -0.1793599000444547, 0.1998795917921049, -0.05426050860079981, -0.10324294436796909, 0.04244579328224063, 0.3382658495582522, -0.16820347550073786, -0.22890821520593904, -0.07117004156397241, -0.3060945382282611, 0.016079787759014242, 0.15317294906292642, 0.09560184755791275, 0.1382241827871887, 0.12317896274469113, -0.011349969155465564, -0.06913022756103486, -0.15850880140224324, 0.32630789261366727, 0.07627704624264013, 0.2873876898268622, 0.2590952765534721, -0.006957714347952297, 0.08057691109374106, -0.05934160265707529, -0.02395197537742437, -0.17509904999632642, 0.10593136722320831, 0.3134773468914246, 0.07380858441585646, 0.12251896210133083, -0.3766452211531855, -0.1600458839509104, 0.09612202344255315, 0.1764463715062159, 0.15631719694531981, -0.06786130877241256, -0.2776798911019421, 0.06462093813359619, -0.22574321201278102, -0.1554718687899396, -0.15846354868410836, 0.02664232757247408, -0.05336168608886914, -0.30840551118377507, 0.15325099049461266, 0.003147783922031522, 0.0826160992691589, -0.06738438237539773, -0.17887957640165936, -0.04781329265004763, 0.06719355515411331, 0.07986990921753681, 0.04145295410102884, 0.1619263959139408, -0.184685660716313, -0.1832788474779273, 0.4084226177295759, -0.0012364340983035545, -0.1275484206391469, 0.1677161579441634, -0.19238763455752403, -0.16234462590341175, 0.13571113723677597, 0.1877371229911371, 0.04613199726944523, -0.18289477890773145, 0.05851377505210361, -0.008015905211250934, 0.1488896037196918, 0.07229675222483892, 0.1603826391422892, 0.19702756480454275, 0.2204949734861859, -0.07608838708302568, 0.044706130050130126, -0.067121274288862, -0.12335775092628504, -0.3876993143663091, -0.10244915490907189, -0.07154603771835802, 0.08097626370600045, -0.07501925740877004, -0.11844942839224896, 0.34704563711651615, 0.08029034382366623, 0.2815502947937819, 0.03210977670766177, 0.3432149178522181, 0.10757707145863346, 0.054889653188486896, 0.04255575288940842, 0.294833650324671, 0.2148955771108232, 0.15269026659902127, -0.26143249873042346, 0.06404062305828409, 0.04183035278655884] |
1,802.01103 | Hybrid 2D Black Phosphorus/Polymer Materials: New Platforms for Device
Fabrication | Hybrid materials, containing a 2D filler embedded in a polymeric matrix, are
an interesting platform for several applications, because of the variety of
properties that the filler can impart to the polymer matrix when dispersed at
the nanoscale. Moreover, novel properties could arise from the interaction
between the two. Mostly the bulk properties of these materials have been
studied so far, especially focusing on how the filler changes the polymeric
matrix properties. Here we propose a complete change of perspective by using
the hybrid nanocomposite material as a platform suitable to engineer the
properties of the filler and to exploit its potential in the fabrication of
devices. As a proof of concept of the versatility and potentiality of the new
method, we applied this approach to prepare black phosphorus nanocomposites
through its dispersion in poly (methyl methacrylate). Black phosphorus is a
very interesting 2D material, whose application have so far been limited by its
very high reactivity to oxygen and water. In this respect, we show that
electronic-grade black phosphorus flakes, already embedded in a protecting
matrix since their exfoliation from the bulk material, are endowed with
significant increased stability, and can be further processed into devices
without degrading their properties.
| cond-mat.mtrl-sci cond-mat.mes-hall physics.chem-ph | hybrid materials containing a 2d filler embedded in a polymeric matrix are an interesting platform for several applications because of the variety of properties that the filler can impart to the polymer matrix when dispersed at the nanoscale moreover novel properties could arise from the interaction between the two mostly the bulk properties of these materials have been studied so far especially focusing on how the filler changes the polymeric matrix properties here we propose a complete change of perspective by using the hybrid nanocomposite material as a platform suitable to engineer the properties of the filler and to exploit its potential in the fabrication of devices as a proof of concept of the versatility and potentiality of the new method we applied this approach to prepare black phosphorus nanocomposites through its dispersion in poly methyl methacrylate black phosphorus is a very interesting 2d material whose application have so far been limited by its very high reactivity to oxygen and water in this respect we show that electronicgrade black phosphorus flakes already embedded in a protecting matrix since their exfoliation from the bulk material are endowed with significant increased stability and can be further processed into devices without degrading their properties | [['hybrid', 'materials', 'containing', 'a', '2d', 'filler', 'embedded', 'in', 'a', 'polymeric', 'matrix', 'are', 'an', 'interesting', 'platform', 'for', 'several', 'applications', 'because', 'of', 'the', 'variety', 'of', 'properties', 'that', 'the', 'filler', 'can', 'impart', 'to', 'the', 'polymer', 'matrix', 'when', 'dispersed', 'at', 'the', 'nanoscale', 'moreover', 'novel', 'properties', 'could', 'arise', 'from', 'the', 'interaction', 'between', 'the', 'two', 'mostly', 'the', 'bulk', 'properties', 'of', 'these', 'materials', 'have', 'been', 'studied', 'so', 'far', 'especially', 'focusing', 'on', 'how', 'the', 'filler', 'changes', 'the', 'polymeric', 'matrix', 'properties', 'here', 'we', 'propose', 'a', 'complete', 'change', 'of', 'perspective', 'by', 'using', 'the', 'hybrid', 'nanocomposite', 'material', 'as', 'a', 'platform', 'suitable', 'to', 'engineer', 'the', 'properties', 'of', 'the', 'filler', 'and', 'to', 'exploit', 'its', 'potential', 'in', 'the', 'fabrication', 'of', 'devices', 'as', 'a', 'proof', 'of', 'concept', 'of', 'the', 'versatility', 'and', 'potentiality', 'of', 'the', 'new', 'method', 'we', 'applied', 'this', 'approach', 'to', 'prepare', 'black', 'phosphorus', 'nanocomposites', 'through', 'its', 'dispersion', 'in', 'poly', 'methyl', 'methacrylate', 'black', 'phosphorus', 'is', 'a', 'very', 'interesting', '2d', 'material', 'whose', 'application', 'have', 'so', 'far', 'been', 'limited', 'by', 'its', 'very', 'high', 'reactivity', 'to', 'oxygen', 'and', 'water', 'in', 'this', 'respect', 'we', 'show', 'that', 'electronicgrade', 'black', 'phosphorus', 'flakes', 'already', 'embedded', 'in', 'a', 'protecting', 'matrix', 'since', 'their', 'exfoliation', 'from', 'the', 'bulk', 'material', 'are', 'endowed', 'with', 'significant', 'increased', 'stability', 'and', 'can', 'be', 'further', 'processed', 'into', 'devices', 'without', 'degrading', 'their', 'properties']] | [-0.0720965490196901, 0.12317588300012985, -0.07586887156977712, -0.03770042559049736, -0.05952095993289455, -0.14126092832493806, 0.03937840473488325, 0.4342662787055643, -0.29146754034604894, -0.31869698957504183, 0.1060703814531264, -0.292831548424762, -0.19084928873046048, 0.19636213958300464, -0.04903024986423367, 0.06312551260584112, 0.020631796212992007, -0.047466618391170876, -0.10175563240555852, -0.1795775503677719, 0.2578681171952807, 0.048660631035280816, 0.3036915405030219, 0.07773314291537178, 0.07805830184184942, -0.03844571230407174, 0.0827224212235294, 0.06177387816312523, -0.12066676270771848, 0.1605761364187865, 0.23905145766969946, 0.018210784336764874, 0.2631931675769463, -0.48350298135027064, -0.24419686924758835, 0.043331045474701, 0.12929853650542042, 0.13120191311695387, -0.15555113949060015, -0.24901323646900073, 0.12594581124099408, -0.1790192524644208, -0.1281327677367079, -0.08667967695481056, 0.001667720096565746, 0.026001973944109174, -0.1568217889783123, 0.0035564397966757937, 0.027146290414341127, 0.013853298096491292, -0.0668997179002406, -0.1233201901131861, -0.07200693665072322, 0.12699105178103876, 0.028563175979417873, -0.0529438058025579, 0.21556212686567536, -0.14508918407071955, -0.042431272452799096, 0.41855282856346065, -0.03206937737410786, -0.17034977830168027, 0.2179562804006522, -0.10533320094546794, -0.12072894055470454, 0.14012227041544903, 0.19037080287906707, 0.1389021717709262, -0.1894039993411983, 0.07301897393013652, 0.006032877541448346, 0.16839124643317985, 0.06401338206780194, 0.11550292887073937, 0.24832158526104517, 0.22317347727804004, -0.006322071413203741, 0.19416524450971157, -0.05352820573369996, 0.004819418850415085, -0.1655307025810824, -0.24779507011842372, -0.23103078167922608, 0.08008479100967113, -0.09967550291507203, -0.20484600232367345, 0.38377642864129735, 0.11900523202742834, 0.18103423988706066, -0.052803236796562354, 0.2462680626739354, 0.021535142495143992, 0.10758582902006546, -0.019338872341615198, 0.2904696509946342, 0.15606933871321194, 0.1305922758696017, -0.20314360090730646, 0.11076042840294355, -0.0029919576803361303] |
1,802.01104 | User Pre-Scheduling and Beamforming with Imperfect CSI in 5G Fog Radio
Access Networks | We investigate the user-to-cell association (or user-clustering) and
beamforming design for Cloud Radio Access Networks (CRANs) and Fog Radio Access
Networks (FogRANs) for 5G. CRAN enables cloud centralized resource and power
allocation optimization over all the small cells served by multiple Access
Points (APs). However, the fronthaul links connecting each AP to the cloud
introduce delays and cause outdated Channel State Information (CSI). By
contrast, FogRAN enables lower latencies and better CSI qualities, at the cost
of local optimization. To alleviate these issues, we propose a hybrid algorithm
exploiting both the centralized feature of the cloud for globally-optimized
pre-scheduling using outdated CSIs and the distributed nature of FogRAN for
accurate beamforming with high quality CSIs. The centralized phase enables to
consider the interference patterns over the global network, while the
distributed phase allows for latency reduction. Simulation results show that
our hybrid algorithm for FogRAN outperforms the centralized algorithm under
imperfect CSI, both in terms of throughput and delays.
| eess.SP cs.NI | we investigate the usertocell association or userclustering and beamforming design for cloud radio access networks crans and fog radio access networks fograns for 5g cran enables cloud centralized resource and power allocation optimization over all the small cells served by multiple access points aps however the fronthaul links connecting each ap to the cloud introduce delays and cause outdated channel state information csi by contrast fogran enables lower latencies and better csi qualities at the cost of local optimization to alleviate these issues we propose a hybrid algorithm exploiting both the centralized feature of the cloud for globallyoptimized prescheduling using outdated csis and the distributed nature of fogran for accurate beamforming with high quality csis the centralized phase enables to consider the interference patterns over the global network while the distributed phase allows for latency reduction simulation results show that our hybrid algorithm for fogran outperforms the centralized algorithm under imperfect csi both in terms of throughput and delays | [['we', 'investigate', 'the', 'usertocell', 'association', 'or', 'userclustering', 'and', 'beamforming', 'design', 'for', 'cloud', 'radio', 'access', 'networks', 'crans', 'and', 'fog', 'radio', 'access', 'networks', 'fograns', 'for', '5g', 'cran', 'enables', 'cloud', 'centralized', 'resource', 'and', 'power', 'allocation', 'optimization', 'over', 'all', 'the', 'small', 'cells', 'served', 'by', 'multiple', 'access', 'points', 'aps', 'however', 'the', 'fronthaul', 'links', 'connecting', 'each', 'ap', 'to', 'the', 'cloud', 'introduce', 'delays', 'and', 'cause', 'outdated', 'channel', 'state', 'information', 'csi', 'by', 'contrast', 'fogran', 'enables', 'lower', 'latencies', 'and', 'better', 'csi', 'qualities', 'at', 'the', 'cost', 'of', 'local', 'optimization', 'to', 'alleviate', 'these', 'issues', 'we', 'propose', 'a', 'hybrid', 'algorithm', 'exploiting', 'both', 'the', 'centralized', 'feature', 'of', 'the', 'cloud', 'for', 'globallyoptimized', 'prescheduling', 'using', 'outdated', 'csis', 'and', 'the', 'distributed', 'nature', 'of', 'fogran', 'for', 'accurate', 'beamforming', 'with', 'high', 'quality', 'csis', 'the', 'centralized', 'phase', 'enables', 'to', 'consider', 'the', 'interference', 'patterns', 'over', 'the', 'global', 'network', 'while', 'the', 'distributed', 'phase', 'allows', 'for', 'latency', 'reduction', 'simulation', 'results', 'show', 'that', 'our', 'hybrid', 'algorithm', 'for', 'fogran', 'outperforms', 'the', 'centralized', 'algorithm', 'under', 'imperfect', 'csi', 'both', 'in', 'terms', 'of', 'throughput', 'and', 'delays']] | [-0.2808015831052118, -0.04997474251012466, -0.007543652468200796, -0.007986717757688847, -0.09359955780243703, -0.22881053014106717, 0.1776464716056777, 0.42881830691828565, -0.28480054107702274, -0.291510023224126, 0.09574777929180533, -0.2056218253132171, -0.1452098181879053, 0.10041826362365702, -0.1325214385428721, 0.07393692410106112, 0.06350613184641027, -0.018744179427291556, -0.023451386694722232, -0.25902935865507193, 0.2774002628369779, 0.14448026868449465, 0.43087204961568876, 0.007940586303007808, 0.08615301581170813, 0.017606908574872383, -0.057237676501268174, -0.04677740924703966, -0.03347530671430397, 0.10076982990926084, 0.3257660561368747, 0.206297783353099, 0.27681233956935297, -0.48174789642832083, -0.24459035772308232, 0.0840919639167797, 0.18254300401394796, 0.03509986698983392, -0.03132536333754279, -0.2781369465078482, 0.16291005993528873, -0.2449932372743252, 0.004664378909536513, -0.019940265249698216, -0.12553710798335493, 0.06590204623603457, -0.3517520301233811, 0.05068815186038424, -0.08354976589815205, -0.003355207443711864, -0.07165665846877096, -0.12364303092709535, 0.03701674899792263, 0.18378846388040287, -0.03316042820810323, -0.012063057260486967, 0.09920417915015321, -0.14444413172543807, -0.14499557184375775, 0.39135104887614586, 0.049678775204559135, -0.18335737259376345, 0.17027439812092987, -0.017173336035791475, -0.12868826734020736, 0.16983963596593044, 0.2507833846856597, 0.021774550518732828, -0.17466132303960857, 0.01706646829821276, 0.03103140350260659, 0.16051171619777277, 0.07697092829372995, 0.16491497905812208, 0.14662398932839799, 0.1893142632024873, 0.18229309352897818, 0.13341237535806977, -0.1411579621790398, -0.14034645208365218, -0.14732143424701977, -0.11507262784613602, -0.18978225272727217, -0.017297094500961768, -0.13185379364326444, -0.07662455819452264, 0.33983180258173945, 0.14153561706114917, 0.10303349157344478, 0.14467336940371497, 0.4477525474251527, 0.038227775212003594, 0.07160536999440496, 0.23098607599782717, 0.15143542279412223, 0.05008357181065497, 0.21682620796250404, -0.22846403404933868, 0.09302470811856257, -0.03843159073960795] |
1,802.01105 | FERMI transient J1544-0649: a flaring radio-weak BL Lac | On May 15th, 2017, the \emph{FERMI}/LAT gamma-ray telescope observed a
transient source not present in any previous high-energy catalogue: J1544-0649.
It was visible for two consecutive weeks, with a flux peak on May 21st.
Subsequently observed by a \emph{Swift}/XRT follow-up starting on May 26, the
X-ray counterpart position was coincident with the optical transient
ASASSN-17gs = AT2017egv, detected on May 25, with a potential host galaxy at
$z$=0.171. We conducted a 4-months follow-up in radio (Effelsberg-100m) and
optical (San Pedro M\'artir, 2.1m) bands, in order to build the overall
Spectral Energy Distribution (SED) of this object. The radio data from 5 to 15
GHz confirmed the flat spectrum of the source, favoring a line of sight close
to jet axis, not showing significant variability in the explored post-burst
time-window. The Rx ratio, common indicator of radio loudness, gives a value at
the border between the radio-loud and radio-quiet AGN populations. The
Ca$_{\rm{II}}$ H\&K break value (0.29$\pm$0.05) is compatible with the range
expected for the long-sought intermediate population between BL Lacs and FRI
radio galaxies. An overall SED fitting from Radio to $\gamma$-ray band shows
properties typical of a low-power BL Lac. As a whole, these results suggest
that this transient could well be a new example of the recently discovered
class of radio-weak BL Lac, showing for the first time a flare in the
gamma/X-ray bands.
| astro-ph.GA astro-ph.HE | on may 15th 2017 the emphfermilat gammaray telescope observed a transient source not present in any previous highenergy catalogue j15440649 it was visible for two consecutive weeks with a flux peak on may 21st subsequently observed by a emphswiftxrt followup starting on may 26 the xray counterpart position was coincident with the optical transient asassn17gs at2017egv detected on may 25 with a potential host galaxy at z0171 we conducted a 4months followup in radio effelsberg100m and optical san pedro martir 21m bands in order to build the overall spectral energy distribution sed of this object the radio data from 5 to 15 ghz confirmed the flat spectrum of the source favoring a line of sight close to jet axis not showing significant variability in the explored postburst timewindow the rx ratio common indicator of radio loudness gives a value at the border between the radioloud and radioquiet agn populations the ca_rmii hk break value 029pm005 is compatible with the range expected for the longsought intermediate population between bl lacs and fri radio galaxies an overall sed fitting from radio to gammaray band shows properties typical of a lowpower bl lac as a whole these results suggest that this transient could well be a new example of the recently discovered class of radioweak bl lac showing for the first time a flare in the gammaxray bands | [['on', 'may', '15th', '2017', 'the', 'emphfermilat', 'gammaray', 'telescope', 'observed', 'a', 'transient', 'source', 'not', 'present', 'in', 'any', 'previous', 'highenergy', 'catalogue', 'j15440649', 'it', 'was', 'visible', 'for', 'two', 'consecutive', 'weeks', 'with', 'a', 'flux', 'peak', 'on', 'may', '21st', 'subsequently', 'observed', 'by', 'a', 'emphswiftxrt', 'followup', 'starting', 'on', 'may', '26', 'the', 'xray', 'counterpart', 'position', 'was', 'coincident', 'with', 'the', 'optical', 'transient', 'asassn17gs', 'at2017egv', 'detected', 'on', 'may', '25', 'with', 'a', 'potential', 'host', 'galaxy', 'at', 'z0171', 'we', 'conducted', 'a', '4months', 'followup', 'in', 'radio', 'effelsberg100m', 'and', 'optical', 'san', 'pedro', 'martir', '21m', 'bands', 'in', 'order', 'to', 'build', 'the', 'overall', 'spectral', 'energy', 'distribution', 'sed', 'of', 'this', 'object', 'the', 'radio', 'data', 'from', '5', 'to', '15', 'ghz', 'confirmed', 'the', 'flat', 'spectrum', 'of', 'the', 'source', 'favoring', 'a', 'line', 'of', 'sight', 'close', 'to', 'jet', 'axis', 'not', 'showing', 'significant', 'variability', 'in', 'the', 'explored', 'postburst', 'timewindow', 'the', 'rx', 'ratio', 'common', 'indicator', 'of', 'radio', 'loudness', 'gives', 'a', 'value', 'at', 'the', 'border', 'between', 'the', 'radioloud', 'and', 'radioquiet', 'agn', 'populations', 'the', 'ca_rmii', 'hk', 'break', 'value', '029pm005', 'is', 'compatible', 'with', 'the', 'range', 'expected', 'for', 'the', 'longsought', 'intermediate', 'population', 'between', 'bl', 'lacs', 'and', 'fri', 'radio', 'galaxies', 'an', 'overall', 'sed', 'fitting', 'from', 'radio', 'to', 'gammaray', 'band', 'shows', 'properties', 'typical', 'of', 'a', 'lowpower', 'bl', 'lac', 'as', 'a', 'whole', 'these', 'results', 'suggest', 'that', 'this', 'transient', 'could', 'well', 'be', 'a', 'new', 'example', 'of', 'the', 'recently', 'discovered', 'class', 'of', 'radioweak', 'bl', 'lac', 'showing', 'for', 'the', 'first', 'time', 'a', 'flare', 'in', 'the', 'gammaxray', 'bands']] | [-0.0835649662345665, 0.0692942534937708, -0.06662276129926119, 0.11588611758160276, -0.1343349010401636, -0.11557973228894823, 0.08828077298576234, 0.48595599976684384, -0.14119181962397565, -0.37615639429780817, 0.08125033418150243, -0.2819847211352797, -0.03235917690371851, 0.2322331953264021, -0.038333406672148684, -0.04974108107212863, 0.05217236656441413, -0.09343237639404833, -0.0068876576949543225, -0.18044151717352622, 0.23134551200494513, 0.13028706479048646, 0.2589812270801412, -0.02404922219164191, 0.07703341809026641, -0.055729061744278385, -0.0869680674834211, -0.04356056641693304, -0.04951517819977657, 0.03148683634748973, 0.2648994613165429, 0.07872077787440236, 0.2175627138920624, -0.29391714208118547, -0.21570116877203396, 0.09334446032907506, 0.14767851782407304, -0.004111459550827981, -0.02242013741361507, -0.31283113280089075, 0.04696507471770586, -0.19459994289588287, -0.180305511647955, 0.12183415830037087, 0.05621116796461438, 0.034795579553897914, -0.17435203745978278, 0.10894544244692618, -0.029019363555061812, 0.08422380846331255, -0.15567552030658982, -0.08188487260405897, -0.053042131898510314, 0.07843080846755125, 0.032103183556993174, 0.08407977693970528, 0.1040908797652623, -0.11272812672728381, -0.13719296100903985, 0.369538753200536, -0.04144538819166157, 0.060472089066725535, 0.21309316113544202, -0.22921519751399927, -0.2347213993780315, 0.17898764946378357, 0.14480788606099373, 0.0804749783934863, -0.13641442815183635, -0.017465910531769758, -0.03845753763837594, 0.2473841083915306, 0.009740939107509929, 0.0632930164542688, 0.302973131820081, 0.12283297426466736, 0.02680868061618247, 0.13940121927416088, -0.2879549428081533, 0.04271315598492981, -0.28104899752321183, -0.06401981595997622, -0.18281376374362907, 0.12904984298401936, -0.08531159806096501, -0.10146565616575129, 0.4480571698145343, 0.043547513865899945, 0.18873459077226595, 0.06038363946445816, 0.25657239629365847, 0.08862556512558346, 0.10053328057303021, 0.14529758482987762, 0.3624336033751932, 0.06167839683044019, 0.15732933102824956, -0.18272308215985947, 0.05377922569393018, -0.002953563611783566] |
1,802.01106 | From identical S- and P-wave pT/M spectra to maximally distinct
polarizations: probing NRQCD with chi states | A global analysis of ATLAS and CMS measurements reveals that, at
mid-rapidity, the directly-produced $\chi_{c1}$, $\chi_{c2}$ and J/$\psi$
mesons have differential cross sections of seemingly identical shapes, when
presented as a function of the mass-rescaled transverse momentum, $p_{\rm
T}/M$. This identity of kinematic behaviours among S- and P-wave quarkonia is
certainly not a natural expectation of non-relativistic QCD (NRQCD), where each
quarkonium state is supposed to reflect a specific family of elementary
production processes, of significantly different $p_{\rm T}$-differential cross
sections. Remarkably, accurate kinematic cancellations among the variegated
NRQCD terms (colour singlets and octets) of its factorization expansion can
lead to a surprisingly good description of the data. This peculiar tuning of
the NRQCD mixtures leads to a clear prediction regarding the $\chi_{c1}$ and
$\chi_{c2}$ polarizations, the only observables not yet measured: they should
be almost maximally different from one another, and from the J/$\psi$
polarization, a striking exception in the global panorama of quarkonium
production. Measurements of the difference between the $\chi_{c1}$, $\chi_{c2}$
and J/$\psi$ polarizations, complementing the observed identity of momentum
dependences, represent a decisive probe of NRQCD.
| hep-ph | a global analysis of atlas and cms measurements reveals that at midrapidity the directlyproduced chi_c1 chi_c2 and jpsi mesons have differential cross sections of seemingly identical shapes when presented as a function of the massrescaled transverse momentum p_rm tm this identity of kinematic behaviours among s and pwave quarkonia is certainly not a natural expectation of nonrelativistic qcd nrqcd where each quarkonium state is supposed to reflect a specific family of elementary production processes of significantly different p_rm tdifferential cross sections remarkably accurate kinematic cancellations among the variegated nrqcd terms colour singlets and octets of its factorization expansion can lead to a surprisingly good description of the data this peculiar tuning of the nrqcd mixtures leads to a clear prediction regarding the chi_c1 and chi_c2 polarizations the only observables not yet measured they should be almost maximally different from one another and from the jpsi polarization a striking exception in the global panorama of quarkonium production measurements of the difference between the chi_c1 chi_c2 and jpsi polarizations complementing the observed identity of momentum dependences represent a decisive probe of nrqcd | [['a', 'global', 'analysis', 'of', 'atlas', 'and', 'cms', 'measurements', 'reveals', 'that', 'at', 'midrapidity', 'the', 'directlyproduced', 'chi_c1', 'chi_c2', 'and', 'jpsi', 'mesons', 'have', 'differential', 'cross', 'sections', 'of', 'seemingly', 'identical', 'shapes', 'when', 'presented', 'as', 'a', 'function', 'of', 'the', 'massrescaled', 'transverse', 'momentum', 'p_rm', 'tm', 'this', 'identity', 'of', 'kinematic', 'behaviours', 'among', 's', 'and', 'pwave', 'quarkonia', 'is', 'certainly', 'not', 'a', 'natural', 'expectation', 'of', 'nonrelativistic', 'qcd', 'nrqcd', 'where', 'each', 'quarkonium', 'state', 'is', 'supposed', 'to', 'reflect', 'a', 'specific', 'family', 'of', 'elementary', 'production', 'processes', 'of', 'significantly', 'different', 'p_rm', 'tdifferential', 'cross', 'sections', 'remarkably', 'accurate', 'kinematic', 'cancellations', 'among', 'the', 'variegated', 'nrqcd', 'terms', 'colour', 'singlets', 'and', 'octets', 'of', 'its', 'factorization', 'expansion', 'can', 'lead', 'to', 'a', 'surprisingly', 'good', 'description', 'of', 'the', 'data', 'this', 'peculiar', 'tuning', 'of', 'the', 'nrqcd', 'mixtures', 'leads', 'to', 'a', 'clear', 'prediction', 'regarding', 'the', 'chi_c1', 'and', 'chi_c2', 'polarizations', 'the', 'only', 'observables', 'not', 'yet', 'measured', 'they', 'should', 'be', 'almost', 'maximally', 'different', 'from', 'one', 'another', 'and', 'from', 'the', 'jpsi', 'polarization', 'a', 'striking', 'exception', 'in', 'the', 'global', 'panorama', 'of', 'quarkonium', 'production', 'measurements', 'of', 'the', 'difference', 'between', 'the', 'chi_c1', 'chi_c2', 'and', 'jpsi', 'polarizations', 'complementing', 'the', 'observed', 'identity', 'of', 'momentum', 'dependences', 'represent', 'a', 'decisive', 'probe', 'of', 'nrqcd']] | [-0.08259480857867851, 0.20879643964034886, -0.18899874734255231, 0.12757380269780005, -0.04616101299199229, -0.13560852623029546, 0.030311037058546597, 0.3338183552526229, -0.19544933777346077, -0.21881060276242942, -0.09580515523365693, -0.34828648810124013, 0.04426098208810728, 0.11656544921274542, 0.04626683978748888, 0.10380908079652178, 0.11364392316041712, 0.038927800599589696, -0.09940058569353614, -0.18820967625139812, 0.28619242615753254, -0.004417222906320288, 0.25104236763683485, 0.1450405584780926, 0.04271882607318024, 0.04023428118199776, -0.060588999681939586, -0.02637744117684288, -0.09691125175717459, 0.061187240256090236, 0.29932315299526774, 0.05806755765559745, 0.10634391601509596, -0.3056202557135644, -0.07012163462327382, 0.13618680139139877, 0.15449753793882592, 0.0899886017790137, 0.006235660381573539, -0.28592570666119704, 0.09321238911663854, -0.20797966776790316, -0.08557308071901679, -0.11715629577699153, 0.04644368126905164, -0.05281814434383501, -0.31351372678946265, 0.10421757953756557, -0.002648683353951565, 0.06648660392283239, -0.026821314667445195, -0.22588285113367454, -0.08862830845472616, 0.04758676999022888, 0.10294374343731008, 0.10133856954280672, 0.16665228796529705, -0.150559647681254, -0.18613980493284554, 0.4187185849130086, -0.03021736098219271, -0.16080912571223505, 0.1570409142032432, -0.23470418269137264, -0.13682619252179712, 0.1577435995259598, 0.18481660209721026, 0.08758030163693924, -0.2021295878631824, 0.05020176776191844, -0.028646427937705256, 0.15766668006746545, 0.11054538803008598, 0.1444216116706128, 0.19896377455156983, 0.12746979992683227, -0.05865541998916123, 0.019760026477469786, -0.03644562888352003, -0.08890169185219468, -0.40778624837406435, -0.14306978148064517, -0.06942816795625167, 0.08603570050141754, -0.08965916181051149, -0.11950237598977775, 0.40375912266226704, 0.04798113021701405, 0.3329687243516592, -0.021399850138936544, 0.3212426007249231, 0.08848713749210615, 0.06841966537264431, 0.07702567731420504, 0.3072131854617271, 0.22441459583071732, 0.16610902685973813, -0.2652030737261553, 0.11078867045173932, 0.009215423452288079] |
1,802.01107 | Gaps in scl for Amalgamated Free Products and RAAGs | We develop a new criterion to tell if a group $G$ has the maximal gap of
$1/2$ in stable commutator length (scl). For amalgamated free products $G = A
\star_C B$ we show that every element $g$ in the commutator subgroup of $G$
which does not conjugate into $A$ or $B$ satisfies $scl(g) \geq 1/2$, provided
that $C$ embeds as a left relatively convex subgroup in both $A$ and $B$. We
deduce from this that every non-trivial element $g$ in the commutator subgroup
of a right-angled Artin group $G$ satisfies $scl(g) \geq 1/2$. This bound is
sharp and is inherited by all fundamental groups of special cube complexes.
We prove these statements by constructing explicit extremal homogeneous
quasimorphisms $\bar{ \phi} : G \to \mathbb{R}$ satisfying $\bar{ \phi }(g)
\geq 1$ and $D(\bar{\phi})\leq 1$. Such maps were previously unknown, even for
non-abelian free groups. For these quasimorphisms $\bar{\phi}$ there is an
action $\rho : G \to Homeo^+(S^1)$ on the circle such that $[\delta^1 \bar{
\phi}]=\rho^*eu^{\mathbb{R}}_b \in H^2_b(G,\mathbb{R})$, for $eu^\mathbb{R}_b$
the real bounded Euler class.
| math.GT math.GR | we develop a new criterion to tell if a group g has the maximal gap of 12 in stable commutator length scl for amalgamated free products g a star_c b we show that every element g in the commutator subgroup of g which does not conjugate into a or b satisfies sclg geq 12 provided that c embeds as a left relatively convex subgroup in both a and b we deduce from this that every nontrivial element g in the commutator subgroup of a rightangled artin group g satisfies sclg geq 12 this bound is sharp and is inherited by all fundamental groups of special cube complexes we prove these statements by constructing explicit extremal homogeneous quasimorphisms bar phi g to mathbbr satisfying bar phi g geq 1 and dbarphileq 1 such maps were previously unknown even for nonabelian free groups for these quasimorphisms barphi there is an action rho g to homeos1 on the circle such that delta1 bar phirhoeumathbbr_b in h2_bgmathbbr for eumathbbr_b the real bounded euler class | [['we', 'develop', 'a', 'new', 'criterion', 'to', 'tell', 'if', 'a', 'group', 'g', 'has', 'the', 'maximal', 'gap', 'of', '12', 'in', 'stable', 'commutator', 'length', 'scl', 'for', 'amalgamated', 'free', 'products', 'g', 'a', 'star_c', 'b', 'we', 'show', 'that', 'every', 'element', 'g', 'in', 'the', 'commutator', 'subgroup', 'of', 'g', 'which', 'does', 'not', 'conjugate', 'into', 'a', 'or', 'b', 'satisfies', 'sclg', 'geq', '12', 'provided', 'that', 'c', 'embeds', 'as', 'a', 'left', 'relatively', 'convex', 'subgroup', 'in', 'both', 'a', 'and', 'b', 'we', 'deduce', 'from', 'this', 'that', 'every', 'nontrivial', 'element', 'g', 'in', 'the', 'commutator', 'subgroup', 'of', 'a', 'rightangled', 'artin', 'group', 'g', 'satisfies', 'sclg', 'geq', '12', 'this', 'bound', 'is', 'sharp', 'and', 'is', 'inherited', 'by', 'all', 'fundamental', 'groups', 'of', 'special', 'cube', 'complexes', 'we', 'prove', 'these', 'statements', 'by', 'constructing', 'explicit', 'extremal', 'homogeneous', 'quasimorphisms', 'bar', 'phi', 'g', 'to', 'mathbbr', 'satisfying', 'bar', 'phi', 'g', 'geq', '1', 'and', 'dbarphileq', '1', 'such', 'maps', 'were', 'previously', 'unknown', 'even', 'for', 'nonabelian', 'free', 'groups', 'for', 'these', 'quasimorphisms', 'barphi', 'there', 'is', 'an', 'action', 'rho', 'g', 'to', 'homeos1', 'on', 'the', 'circle', 'such', 'that', 'delta1', 'bar', 'phirhoeumathbbr_b', 'in', 'h2_bgmathbbr', 'for', 'eumathbbr_b', 'the', 'real', 'bounded', 'euler', 'class']] | [-0.1969265904057231, 0.15750037551797896, -0.08603751734241935, 0.03876928032727261, -0.09801002695550856, -0.17597652655494816, 0.033448814028771194, 0.3951087080005076, -0.3247314474596842, -0.21873227083209926, 0.09101316151480573, -0.2789481030291438, -0.09061014609685614, 0.1814399981139902, -0.11714499190655406, -0.03742370973312599, 0.057894908014593495, 0.1464233755511146, -0.06464990447389614, -0.22192080063314, 0.3345694331840778, -0.13275984237313362, 0.1511731373854667, 0.03599434425094468, 0.09463335278845196, -0.00019623749700883414, 0.011942228759093313, -0.011335135054734586, -0.20669276785606125, 0.051114391586943274, 0.2375339191018438, 0.0828107982271128, 0.23885685500283182, -0.3247119673149963, -0.1516835372680741, 0.2344123410700929, 0.14885868439507996, -0.0527783149511959, -0.07225326211580956, -0.26090884734905023, 0.18451094190287262, -0.15731064923267607, -0.12428020364804868, -0.029190636431709778, 0.16694391094308142, -0.04196661262790118, -0.2848158247763165, 0.022900589987452775, 0.13024421533329722, 0.0840948846425427, -0.01322440531653312, -0.17195705215709478, -0.05467970671269334, 0.11802580296861842, -0.034447240723194154, 0.11972611362187398, 0.08761393632725498, -0.08336822111788063, -0.05801620928033546, 0.396829949326219, -0.10900595080267432, -0.20408578746683576, 0.11626058302111238, -0.2014946771094267, -0.20842986095673832, 0.10249174081226183, 0.06347598492573558, 0.15012383073899735, -0.014340586126124932, 0.22355063929703897, -0.16183334138627203, 0.11904895870426407, 0.08423284070417741, -0.04661716776185789, 0.07418877763535822, 0.04629167371166676, 0.15755782336742258, 0.10999587660032593, 0.033840021723452844, 0.10659940869181754, -0.3920236147905877, -0.19208419458844922, -0.13799916595103437, 0.156575983466007, -0.10929463491062677, -0.1712913488072166, 0.34401477226541816, 0.035437879854926774, 0.13840883324905498, 0.11005883116026528, 0.16224994136240517, 0.03707747718396431, 0.07653424347803693, 0.1719967141901743, 0.08616563733781409, 0.21517455213534664, -0.12282704311977226, -0.15201452122915513, -0.027828579391438537, 0.17536265881861735] |
1,802.01108 | Spherical function regularization for parallel MRI reconstruction | From the optimization point of view, a difficulty with parallel MRI with
simultaneous coil sensitivity estimation is the multiplicative nature of the
non-linear forward operator: the image being reconstructed and the coil
sensitivities compete against each other, causing the optimization process to
be very sensitive to small perturbations. This can, to some extent, be avoided
by regularizing the unknown in a suitably "orthogonal" fashion. In this paper,
we introduce such a regularization based on spherical function bases. To
perform this regularization, we represent efficient recurrence formulas for
spherical Bessel functions and associated Legendre functions. Numerically, we
study the solution of the model with non-linear ADMM. We perform various
numerical simulations to demonstrate the efficacy of the proposed model in
parallel MRI reconstruction.
| math.NA | from the optimization point of view a difficulty with parallel mri with simultaneous coil sensitivity estimation is the multiplicative nature of the nonlinear forward operator the image being reconstructed and the coil sensitivities compete against each other causing the optimization process to be very sensitive to small perturbations this can to some extent be avoided by regularizing the unknown in a suitably orthogonal fashion in this paper we introduce such a regularization based on spherical function bases to perform this regularization we represent efficient recurrence formulas for spherical bessel functions and associated legendre functions numerically we study the solution of the model with nonlinear admm we perform various numerical simulations to demonstrate the efficacy of the proposed model in parallel mri reconstruction | [['from', 'the', 'optimization', 'point', 'of', 'view', 'a', 'difficulty', 'with', 'parallel', 'mri', 'with', 'simultaneous', 'coil', 'sensitivity', 'estimation', 'is', 'the', 'multiplicative', 'nature', 'of', 'the', 'nonlinear', 'forward', 'operator', 'the', 'image', 'being', 'reconstructed', 'and', 'the', 'coil', 'sensitivities', 'compete', 'against', 'each', 'other', 'causing', 'the', 'optimization', 'process', 'to', 'be', 'very', 'sensitive', 'to', 'small', 'perturbations', 'this', 'can', 'to', 'some', 'extent', 'be', 'avoided', 'by', 'regularizing', 'the', 'unknown', 'in', 'a', 'suitably', 'orthogonal', 'fashion', 'in', 'this', 'paper', 'we', 'introduce', 'such', 'a', 'regularization', 'based', 'on', 'spherical', 'function', 'bases', 'to', 'perform', 'this', 'regularization', 'we', 'represent', 'efficient', 'recurrence', 'formulas', 'for', 'spherical', 'bessel', 'functions', 'and', 'associated', 'legendre', 'functions', 'numerically', 'we', 'study', 'the', 'solution', 'of', 'the', 'model', 'with', 'nonlinear', 'admm', 'we', 'perform', 'various', 'numerical', 'simulations', 'to', 'demonstrate', 'the', 'efficacy', 'of', 'the', 'proposed', 'model', 'in', 'parallel', 'mri', 'reconstruction']] | [-0.09659846694414793, 0.03458182225156514, -0.082411415546705, 0.07136282378950619, -0.09809061183334618, -0.1333097791887026, -0.009350190608052263, 0.40191927533902105, -0.3196102256627112, -0.2745996801274233, 0.12102065104170565, -0.226998595887276, -0.18642300857826458, 0.17557079799580158, -0.06304402752494588, 0.10560883167600564, 0.0894282146902816, -0.013277253647502816, -0.09389862353669205, -0.20226428646510314, 0.29725158900083576, 0.08426372535129795, 0.2596823650633641, -0.027281143658672322, 0.11273396431018033, -0.00465137559202973, -0.035491814776266485, 0.012489791696158345, -0.1099387988005383, 0.11788627931268, 0.2554907159097101, 0.11511310965173924, 0.3093374201256904, -0.4449066186140551, -0.17493024006577546, 0.1259657811968908, 0.15126277056816567, 0.09467903236270744, -0.048481013981785746, -0.2760855032161611, 0.10203487061910697, -0.13057487571066184, -0.11204133140587355, -0.14462332202304826, -0.08479804849084162, 0.0370910835555434, -0.3219278650720924, 0.0790885713344562, 0.0262299702446965, 0.03030173271344822, -0.07037999843186164, -0.09169617936122001, 0.04738216784679652, 0.06312310452607353, 0.06945727172963222, 0.058921396390718146, 0.13101325003949346, -0.11956862191723079, -0.10244650815873117, 0.3389222824671229, -0.03794905219606857, -0.32684094838217875, 0.1602579057159391, -0.12241874578347826, -0.10072861306109755, 0.12154573757109828, 0.2071360130584417, 0.14255014756698253, -0.1460400931651658, 0.05705990391062023, 0.0013024526205463488, 0.13539593877317574, 0.06337574132733413, -0.01148773467198747, 0.14265124860494474, 0.1558087160963504, 0.06854191021306714, 0.20648578534305448, -0.12233568307205073, -0.08657591354071362, -0.2773553842037428, -0.11845388231926872, -0.17970786099398478, 0.011290825860475601, -0.12216502537194174, -0.18244814794113645, 0.4272541616753232, 0.18168223684760512, 0.20774588130841978, 0.04902147641214619, 0.35045424125111496, 0.13984103376412246, 0.074988174473592, 0.03021871605048292, 0.22134931562358673, 0.11700967717801267, 0.0779839530892548, -0.23633756333023126, 0.04651687317146141, 0.0875747430168825] |
1,802.01109 | Current-induced nonuniform enhancement of sheet resistance in Ar+
irradiated SrTiO3 | The sheet resistance Rs of Ar+ irradiated SrTiO3 in patterns with a length
scale of several microns increases significantly below 40 K in connection with
driving currents exceeding a certain threshold. The initial lower Rs is
recovered upon warming with accelerated recovery around 70 and 160 K. Scanning
superconducting quantum interference device microscopy shows local irreversible
changes in the spatial distribution of the current with a length scale of
several microns. We attribute the observed nonuniform enhancement of Rs to the
attraction of the charged single-oxygen and dioxygen vacancies by the
crystallographic domain boundaries in SrTiO3. The boundaries, which are nearly
ferroelectric below 40 K, are polarized by the local electrical field
associated with the driven current and the clustered vacancies which suppress
conductivity in their vicinity and yield a noticeable enhancement in the device
resistance when the current path width is on the order of the boundary
extension. The temperatures of accelerated conductivity recovery are associated
with the energy barriers for the diffusion of the two types of vacancies.
| cond-mat.supr-con | the sheet resistance rs of ar irradiated srtio3 in patterns with a length scale of several microns increases significantly below 40 k in connection with driving currents exceeding a certain threshold the initial lower rs is recovered upon warming with accelerated recovery around 70 and 160 k scanning superconducting quantum interference device microscopy shows local irreversible changes in the spatial distribution of the current with a length scale of several microns we attribute the observed nonuniform enhancement of rs to the attraction of the charged singleoxygen and dioxygen vacancies by the crystallographic domain boundaries in srtio3 the boundaries which are nearly ferroelectric below 40 k are polarized by the local electrical field associated with the driven current and the clustered vacancies which suppress conductivity in their vicinity and yield a noticeable enhancement in the device resistance when the current path width is on the order of the boundary extension the temperatures of accelerated conductivity recovery are associated with the energy barriers for the diffusion of the two types of vacancies | [['the', 'sheet', 'resistance', 'rs', 'of', 'ar', 'irradiated', 'srtio3', 'in', 'patterns', 'with', 'a', 'length', 'scale', 'of', 'several', 'microns', 'increases', 'significantly', 'below', '40', 'k', 'in', 'connection', 'with', 'driving', 'currents', 'exceeding', 'a', 'certain', 'threshold', 'the', 'initial', 'lower', 'rs', 'is', 'recovered', 'upon', 'warming', 'with', 'accelerated', 'recovery', 'around', '70', 'and', '160', 'k', 'scanning', 'superconducting', 'quantum', 'interference', 'device', 'microscopy', 'shows', 'local', 'irreversible', 'changes', 'in', 'the', 'spatial', 'distribution', 'of', 'the', 'current', 'with', 'a', 'length', 'scale', 'of', 'several', 'microns', 'we', 'attribute', 'the', 'observed', 'nonuniform', 'enhancement', 'of', 'rs', 'to', 'the', 'attraction', 'of', 'the', 'charged', 'singleoxygen', 'and', 'dioxygen', 'vacancies', 'by', 'the', 'crystallographic', 'domain', 'boundaries', 'in', 'srtio3', 'the', 'boundaries', 'which', 'are', 'nearly', 'ferroelectric', 'below', '40', 'k', 'are', 'polarized', 'by', 'the', 'local', 'electrical', 'field', 'associated', 'with', 'the', 'driven', 'current', 'and', 'the', 'clustered', 'vacancies', 'which', 'suppress', 'conductivity', 'in', 'their', 'vicinity', 'and', 'yield', 'a', 'noticeable', 'enhancement', 'in', 'the', 'device', 'resistance', 'when', 'the', 'current', 'path', 'width', 'is', 'on', 'the', 'order', 'of', 'the', 'boundary', 'extension', 'the', 'temperatures', 'of', 'accelerated', 'conductivity', 'recovery', 'are', 'associated', 'with', 'the', 'energy', 'barriers', 'for', 'the', 'diffusion', 'of', 'the', 'two', 'types', 'of', 'vacancies']] | [-0.1597709886980458, 0.22221040886071836, -0.0031091521835759192, -0.010990947562121075, 0.020858657617981616, -0.13131849411406593, 0.08545579697996014, 0.3983991557688138, -0.29320441932588287, -0.32432319217267824, 0.05378518830957277, -0.30785743993591275, -0.07280062769468014, 0.17099626796573578, -0.008956086916915146, 0.0015998390463963371, -0.0288101533529784, 0.018583962840879525, -0.07374996996137517, -0.22183519624967193, 0.2626897830711733, 0.07548366889244595, 0.32491385179004195, 0.08616399883496514, 0.02914533831079948, -0.0402112958288735, 0.038793479428577, 0.05213831720003009, -0.1264135748390439, 0.08199195397612893, 0.208448380342073, -0.04771039039571632, 0.19583409487341458, -0.4418552616313541, -0.22525427993056338, 0.0212978348191056, 0.11444275732317143, 0.0931825850960749, -0.055263657038810955, -0.23455697429757674, 0.11350606084310796, -0.07636812018484053, -0.12049712085291832, 0.03296618454692852, 0.004950371352520347, 0.01993019281495252, -0.23551333541417022, 0.13479213754387473, 0.060971529964225356, 0.10640521440103914, -0.12053624090336307, -0.1340224939927503, -0.06258065017634595, 0.048138413376611594, 0.0465425727792503, 0.06849443269397557, 0.22968077544156, -0.14346383822277275, -0.10321085605516854, 0.30886630179393576, -0.06683294989579197, -0.09285292827617928, 0.18626133350313767, -0.20677493614579975, -0.0017449130538710498, 0.23815567311197078, 0.11267104695589673, 0.0965174185001903, -0.1308714458075684, 0.06875463916655608, 0.03550542910244404, 0.17045258958796425, 0.1354996750059609, 0.05800712579233054, 0.21060192885178522, 0.1820456388739858, 0.07641961019398016, 0.14067840705606424, -0.1830052150304556, -0.06417305438542331, -0.2621864841688843, -0.15636048840149444, -0.1490799367617948, 0.05754785708595376, -0.128520935758006, -0.18109367439694174, 0.39640211899208244, 0.15636930593768872, 0.23075402283368732, -0.017250605467596703, 0.26035280435031954, 0.09625137073246862, 0.11290743829236095, 0.06777083350775334, 0.21944971423811063, 0.14285886294853228, 0.13071073890669194, -0.28561970998792074, 0.09126644046459148, -0.026597289128791123] |
1,802.0111 | HPC Curriculum and Associated Ressources in the Academic Context | Hardware support for high-performance computing (HPC) has so far been subject
to significant advances. The pervasiveness of HPC systems, mainly made up with
parallel computing units, makes it crucial to spread and vivify effective HPC
curricula. Besides didactic considerations, it appears very important to
implement HPC hardware infrastructures that will serves for practices, and also
for scientific and industrial requests. The latter ensures a valuable
connection with surrounding cutting-edge research activities in other topics
({\em life sciences, physics, data mining, applied mathematics, finance,
quantitative economy, engineering sciences}, to name a few), and also with
industrial entities and services providers from their requests related to HPC
means and expertise. This aspect is very important as it makes an HPC Center
becoming a social actor, while bringing real-life scenarios into the academic
context. The current paper describes the major steps and objectives for a
consistent HPC curriculum, with specific analyses of particular contexts;
suggests how to technically set up operational HPC infrastructures; and
discusses the connection with end-users, all these in both effective and
prospective standpoints.
| cs.DC cs.CY | hardware support for highperformance computing hpc has so far been subject to significant advances the pervasiveness of hpc systems mainly made up with parallel computing units makes it crucial to spread and vivify effective hpc curricula besides didactic considerations it appears very important to implement hpc hardware infrastructures that will serves for practices and also for scientific and industrial requests the latter ensures a valuable connection with surrounding cuttingedge research activities in other topics em life sciences physics data mining applied mathematics finance quantitative economy engineering sciences to name a few and also with industrial entities and services providers from their requests related to hpc means and expertise this aspect is very important as it makes an hpc center becoming a social actor while bringing reallife scenarios into the academic context the current paper describes the major steps and objectives for a consistent hpc curriculum with specific analyses of particular contexts suggests how to technically set up operational hpc infrastructures and discusses the connection with endusers all these in both effective and prospective standpoints | [['hardware', 'support', 'for', 'highperformance', 'computing', 'hpc', 'has', 'so', 'far', 'been', 'subject', 'to', 'significant', 'advances', 'the', 'pervasiveness', 'of', 'hpc', 'systems', 'mainly', 'made', 'up', 'with', 'parallel', 'computing', 'units', 'makes', 'it', 'crucial', 'to', 'spread', 'and', 'vivify', 'effective', 'hpc', 'curricula', 'besides', 'didactic', 'considerations', 'it', 'appears', 'very', 'important', 'to', 'implement', 'hpc', 'hardware', 'infrastructures', 'that', 'will', 'serves', 'for', 'practices', 'and', 'also', 'for', 'scientific', 'and', 'industrial', 'requests', 'the', 'latter', 'ensures', 'a', 'valuable', 'connection', 'with', 'surrounding', 'cuttingedge', 'research', 'activities', 'in', 'other', 'topics', 'em', 'life', 'sciences', 'physics', 'data', 'mining', 'applied', 'mathematics', 'finance', 'quantitative', 'economy', 'engineering', 'sciences', 'to', 'name', 'a', 'few', 'and', 'also', 'with', 'industrial', 'entities', 'and', 'services', 'providers', 'from', 'their', 'requests', 'related', 'to', 'hpc', 'means', 'and', 'expertise', 'this', 'aspect', 'is', 'very', 'important', 'as', 'it', 'makes', 'an', 'hpc', 'center', 'becoming', 'a', 'social', 'actor', 'while', 'bringing', 'reallife', 'scenarios', 'into', 'the', 'academic', 'context', 'the', 'current', 'paper', 'describes', 'the', 'major', 'steps', 'and', 'objectives', 'for', 'a', 'consistent', 'hpc', 'curriculum', 'with', 'specific', 'analyses', 'of', 'particular', 'contexts', 'suggests', 'how', 'to', 'technically', 'set', 'up', 'operational', 'hpc', 'infrastructures', 'and', 'discusses', 'the', 'connection', 'with', 'endusers', 'all', 'these', 'in', 'both', 'effective', 'and', 'prospective', 'standpoints']] | [-0.10416973868840525, 0.05445561848516573, -0.0522530432925102, 0.06550279305978662, -0.16185618329502513, -0.1776969970467721, 0.061230864739879924, 0.4037736602816623, -0.2490877149615846, -0.4034681053336904, 0.09701213581794388, -0.26756160439266635, -0.14804893168095887, 0.24965249415960789, -0.12139057557265452, 0.07974802396822764, 0.11289107757977161, 0.005863706640511579, -0.007036863283840993, -0.28970898281126095, 0.24346594148546974, 0.12571404371518274, 0.37227095430447704, 0.11767232319544678, 0.03487604316337454, -0.042068689243297354, -0.07839883064226694, -0.03286318601867133, -0.07147272501963983, 0.19420528696578082, 0.4586360132284032, 0.23966304133538524, 0.4058665132037003, -0.4573259220237849, -0.13164044920667317, 0.06758478400179702, 0.13377140843911053, 0.026952941451124805, -0.06671216764293525, -0.28283687642805083, 0.0291427312320572, -0.22866809075547523, -0.1152418187787121, -0.11869656478804792, 0.0673411125223007, 0.01187005762052534, -0.1902103817243145, -0.061220988186447736, -0.005740168867794247, 0.11435585519072809, -0.003773007119973486, -0.15024576018661304, 0.03900048514488934, 0.18262458043617083, 0.08580379557763522, 0.02177931795924945, 0.2114288099096668, -0.1749826807520659, -0.14556682976554927, 0.4444056967047253, 0.07644211507612311, -0.12129133110973618, 0.2554707843204691, -0.02739753955813674, -0.2253723882402514, -0.0032321337147513565, 0.22827787795830842, -0.015758416581780493, -0.21960524732456946, 0.0967688821252796, 0.07811607612765292, 0.1325658261372218, 0.04434348369351012, 0.01850981734466949, 0.26724294997277975, 0.2332393549250794, 0.09226813960303633, 0.09703784424947363, 0.03469508384203678, -0.1672808224351463, -0.2013447282693182, -0.15743813006142746, -0.14038014925835987, 0.02387159480174971, -0.048190706352904476, -0.166579366731592, 0.3354128951131436, 0.22438974661970945, 0.04872483375476878, -0.008296853553159216, 0.36261275702969015, 0.00856883482170773, 0.14462164337639133, 0.1433606594895158, 0.14522018780759563, 0.044963877335879844, 0.28558847859011954, -0.10071203776506028, 0.092207503378542, -0.08344264191355304] |
1,802.01111 | The tame fundamental group schemes of curves in positive characteristic | The tame fundamental group scheme for an algebraic variety is the maximal linearly reductive quotient of Nori's fundamental group scheme. In this paper, we study the tame fundamental group schemes of smooth curves defined over algebraically closed fields of positive characteristic and develop the theory of cospecialization maps for them. As a result, we see that the tame fundamental group schemes heavily depend on the curves. We also see that numerical invariants of curves can be reconstructed from the tame fundamental group schemes. | math.AG | the tame fundamental group scheme for an algebraic variety is the maximal linearly reductive quotient of noris fundamental group scheme in this paper we study the tame fundamental group schemes of smooth curves defined over algebraically closed fields of positive characteristic and develop the theory of cospecialization maps for them as a result we see that the tame fundamental group schemes heavily depend on the curves we also see that numerical invariants of curves can be reconstructed from the tame fundamental group schemes | [['the', 'tame', 'fundamental', 'group', 'scheme', 'for', 'an', 'algebraic', 'variety', 'is', 'the', 'maximal', 'linearly', 'reductive', 'quotient', 'of', 'noris', 'fundamental', 'group', 'scheme', 'in', 'this', 'paper', 'we', 'study', 'the', 'tame', 'fundamental', 'group', 'schemes', 'of', 'smooth', 'curves', 'defined', 'over', 'algebraically', 'closed', 'fields', 'of', 'positive', 'characteristic', 'and', 'develop', 'the', 'theory', 'of', 'cospecialization', 'maps', 'for', 'them', 'as', 'a', 'result', 'we', 'see', 'that', 'the', 'tame', 'fundamental', 'group', 'schemes', 'heavily', 'depend', 'on', 'the', 'curves', 'we', 'also', 'see', 'that', 'numerical', 'invariants', 'of', 'curves', 'can', 'be', 'reconstructed', 'from', 'the', 'tame', 'fundamental', 'group', 'schemes']] | [-0.2210360526511199, 0.0709672942717282, -0.17778092640710164, 0.07370216578963291, -0.11183833123846765, -0.1477978983052434, 0.03066381130434842, 0.35776588201792126, -0.37207308869404965, -0.18643799518986817, 0.07704718975232443, -0.15160257475315986, -0.20255362012995834, 0.3186716964266386, -0.1606184179636549, -0.046232054032475114, -0.006192129138991775, 0.08940038716151233, -0.08965269559769924, -0.3280851182609191, 0.44389569355982794, -0.06233420801988567, 0.289099841569382, 0.035077447161437514, 0.1109525623327368, 0.045441916751035726, -0.09075479410555079, 0.005950720060661614, -0.1586220987452859, 0.1171603073837258, 0.34549270453582326, 0.07811385808591113, 0.198856786976243, -0.3617247358547995, -0.2020933943722083, 0.19770570410729713, 0.17635546949816902, 0.04735927104231823, -0.028503776209552335, -0.25017512291221017, 0.14577341836551766, -0.16155091613665762, -0.17292759262294655, -0.08280834630804967, 0.017320490088762647, 0.04136489663576057, -0.1612110626827701, 0.004681525378507641, 0.03947310148126794, 0.17868364733610168, -0.050498535138476325, -0.0524130327422284, -0.007825231044945946, 0.12127215811892984, 0.0235799324547266, 0.04527536453819463, 0.08629226045863961, -0.08101887774025371, -0.11746525145079716, 0.3970846439520997, -0.09346222944265928, -0.19254994300384837, 0.14300906719886755, -0.14112681139215646, -0.14888864857178316, 0.14156905094341163, 0.15994177363723158, 0.19296526096491928, -0.0038677911128265313, 0.18126208362020887, -0.158201082284192, 0.10607926112162061, 0.011904368569782699, 0.01590282774631338, 0.08259269746345838, 0.04387407919605184, 0.08365920206380402, 0.030018665106877326, 0.03221260763512621, -0.020919058491554426, -0.38412029233323525, -0.19124318933653006, -0.06826817297028849, 0.08921947337529924, -0.12549921655897697, -0.15853664552770466, 0.4275827649730946, 0.04122583331899291, 0.10618970496018967, 0.08541177167186895, 0.24392306004617229, 0.08987822904144918, 0.03367453416338168, 0.07299529062584043, 0.11752706918730793, 0.2422045290537448, -0.0947736214568659, -0.19186034407578859, -0.03811390490933175, 0.1934458013954965] |
1,802.01112 | Asymptotic properties for second-order linear evolution problems with
fractional laplacian operators | In this work we study the asymptotic behavior of solutions for a general
linear second-order evolution differential equation in time with fractional
Laplace operators in $\mathbb{R}^n$. We obtain improved decay estimates with
less demand on the initial data when compared to previous results in the
literature. In certain cases, we observe that the dissipative structure of the
equation is of regularity-loss type. Due to that special structure, to get
decay estimates in high frequency region in the Fourier space it is necessary
to impose additional regularity on the initial data to obtain the same decay
estimates as in low frequency region. The results obtained in this work can be
applied to several initial value problems associated to second-order equations,
as for example, wave equation, plate equation, IBq, among others.
| math.AP | in this work we study the asymptotic behavior of solutions for a general linear secondorder evolution differential equation in time with fractional laplace operators in mathbbrn we obtain improved decay estimates with less demand on the initial data when compared to previous results in the literature in certain cases we observe that the dissipative structure of the equation is of regularityloss type due to that special structure to get decay estimates in high frequency region in the fourier space it is necessary to impose additional regularity on the initial data to obtain the same decay estimates as in low frequency region the results obtained in this work can be applied to several initial value problems associated to secondorder equations as for example wave equation plate equation ibq among others | [['in', 'this', 'work', 'we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'solutions', 'for', 'a', 'general', 'linear', 'secondorder', 'evolution', 'differential', 'equation', 'in', 'time', 'with', 'fractional', 'laplace', 'operators', 'in', 'mathbbrn', 'we', 'obtain', 'improved', 'decay', 'estimates', 'with', 'less', 'demand', 'on', 'the', 'initial', 'data', 'when', 'compared', 'to', 'previous', 'results', 'in', 'the', 'literature', 'in', 'certain', 'cases', 'we', 'observe', 'that', 'the', 'dissipative', 'structure', 'of', 'the', 'equation', 'is', 'of', 'regularityloss', 'type', 'due', 'to', 'that', 'special', 'structure', 'to', 'get', 'decay', 'estimates', 'in', 'high', 'frequency', 'region', 'in', 'the', 'fourier', 'space', 'it', 'is', 'necessary', 'to', 'impose', 'additional', 'regularity', 'on', 'the', 'initial', 'data', 'to', 'obtain', 'the', 'same', 'decay', 'estimates', 'as', 'in', 'low', 'frequency', 'region', 'the', 'results', 'obtained', 'in', 'this', 'work', 'can', 'be', 'applied', 'to', 'several', 'initial', 'value', 'problems', 'associated', 'to', 'secondorder', 'equations', 'as', 'for', 'example', 'wave', 'equation', 'plate', 'equation', 'ibq', 'among', 'others']] | [-0.09469850848108763, 0.05490316227587755, -0.09189614554634318, 0.0815980111619865, -0.10744625086590531, -0.10251136881925049, 0.007776081969495863, 0.3344093805353623, -0.27350262897016364, -0.2788530242833076, 0.1586331655680624, -0.2753188011356542, -0.10337427378544817, 0.22633117091754684, -0.05597653599079422, 0.09205565418233164, 0.07541967360248236, 0.052962783971452154, -0.10901612746965839, -0.22632242211693665, 0.33703907913150033, 0.010929408679658081, 0.255596670525847, 0.014398132520000217, 0.054431767735877656, -0.040702254158532014, -0.004431825356732588, -0.022306639342005496, -0.19204966940799295, 0.07925510740642494, 0.24722392924013548, 0.05105656488740351, 0.26840278436793596, -0.42383760868688114, -0.22006958746351302, 0.10374151022188016, 0.14856988378960523, 0.12672192893114698, -0.03391517575983016, -0.2797800283296965, 0.09376145888745668, -0.10910672867794347, -0.18589512861217372, -0.07266589814025792, 0.02404722872597631, 0.04888503553593182, -0.3118342170246251, 0.12991875718944357, 0.049645096602034755, -0.014237583105568774, -0.14402814594723168, -0.09730153198233893, 0.006700336314679589, 0.07440773038183579, 0.08454591204827011, 0.016342745069778175, 0.03886335526476614, -0.14362239416823286, -0.056545498584455345, 0.34546993515687063, -0.12321009682273143, -0.2662066409975523, 0.14711208418157184, -0.2140233337704558, -0.13638173182880564, 0.11727782935031428, 0.2115952992644452, 0.11951118196884636, -0.14953042725176147, 0.07855794250122017, -0.014760950165396025, 0.14823760962462984, 0.0908900249251019, 0.05808685176680228, 0.050089276337530464, 0.13331402668518422, 0.11278092741395085, 0.1439716555605628, -0.02737847404614513, -0.11239571090845857, -0.3262416895595379, -0.1277672043452185, -0.15617117581132334, 0.057373769239688954, -0.08741358596307691, -0.154621959074575, 0.3614758600779169, 0.149637995975354, 0.20050078048734576, 0.04313280519045293, 0.26481743606200325, 0.20888918790114985, 0.03602339119970566, 0.061792145934305154, 0.22884466775576584, 0.13937071405962342, 0.16786044713080628, -0.22081323786551366, 0.05043581473182712, 0.08085260782536352] |
1,802.01113 | On the interplay between multiscaling and stocks dependence | We find a nonlinear dependence between an indicator of the degree of
multiscaling of log-price time series of a stock and the average correlation of
the stock with respect to the other stocks traded in the same market. This
result is a robust stylized fact holding for different financial markets. We
investigate this result conditional on the stocks' capitalization and on the
kurtosis of stocks' log-returns in order to search for possible confounding
effects. We show that a linear dependence with the logarithm of the
capitalization and the logarithm of kurtosis does not explain the observed
stylized fact, which we interpret as being originated from a deeper
relationship.
| q-fin.ST | we find a nonlinear dependence between an indicator of the degree of multiscaling of logprice time series of a stock and the average correlation of the stock with respect to the other stocks traded in the same market this result is a robust stylized fact holding for different financial markets we investigate this result conditional on the stocks capitalization and on the kurtosis of stocks logreturns in order to search for possible confounding effects we show that a linear dependence with the logarithm of the capitalization and the logarithm of kurtosis does not explain the observed stylized fact which we interpret as being originated from a deeper relationship | [['we', 'find', 'a', 'nonlinear', 'dependence', 'between', 'an', 'indicator', 'of', 'the', 'degree', 'of', 'multiscaling', 'of', 'logprice', 'time', 'series', 'of', 'a', 'stock', 'and', 'the', 'average', 'correlation', 'of', 'the', 'stock', 'with', 'respect', 'to', 'the', 'other', 'stocks', 'traded', 'in', 'the', 'same', 'market', 'this', 'result', 'is', 'a', 'robust', 'stylized', 'fact', 'holding', 'for', 'different', 'financial', 'markets', 'we', 'investigate', 'this', 'result', 'conditional', 'on', 'the', 'stocks', 'capitalization', 'and', 'on', 'the', 'kurtosis', 'of', 'stocks', 'logreturns', 'in', 'order', 'to', 'search', 'for', 'possible', 'confounding', 'effects', 'we', 'show', 'that', 'a', 'linear', 'dependence', 'with', 'the', 'logarithm', 'of', 'the', 'capitalization', 'and', 'the', 'logarithm', 'of', 'kurtosis', 'does', 'not', 'explain', 'the', 'observed', 'stylized', 'fact', 'which', 'we', 'interpret', 'as', 'being', 'originated', 'from', 'a', 'deeper', 'relationship']] | [-0.07223517091538438, 0.07300935630781977, -0.15604790458800616, 0.168563443638117, -0.07081651226865317, -0.04925567410989768, 0.08273747002843905, 0.3773232173105633, -0.29003538060243483, -0.2764981370230628, 0.09355815195832057, -0.33934800542408117, -0.1679039981164452, 0.17324067193031725, -0.08269106886453098, -0.009843876326663626, -0.03425702418597346, 0.038731217125637665, 0.00731349296391407, -0.2859331902301939, 0.2793701669935318, 0.03407852810428098, 0.3125930523361873, 0.05896538101930033, 0.13574054699253152, -0.02122646099154803, -0.08740137432566068, 0.026084790224019713, -0.09641686103693953, 0.15801285475026816, 0.21965144359058253, 0.05100865986336161, 0.3240837593804355, -0.38442157710798913, -0.14836103564852643, 0.16787039134565188, 0.04321557485188047, 0.006052492547530198, 0.05423779773344803, -0.23572934905274046, 0.008358098911466423, -0.22192976382656424, -0.12118714046448952, -0.07970109862637603, 0.07867792233203848, 0.05305803204558928, -0.31932099059620805, 0.12654425484921644, 0.06885687482577783, 0.08360530437763643, -0.029424299423462124, -0.1030370177252701, -0.05063198991464796, 0.13296298519277047, 0.18925227804963166, -0.078510497196543, 0.11162898782640696, -0.13640354392204987, -0.16675898491316563, 0.3659435800552644, -0.11448086563959131, -0.11460759371294882, 0.10729145627744772, -0.2207434372027853, -0.1462713537190144, 0.05258804842338173, 0.21195468023695327, 0.011502670857158524, -0.13235261101982798, 0.008075048947055755, -0.09103585761989018, 0.23198131400837424, 0.054462714965834665, 0.00916778730849425, 0.16074125651222723, 0.16502105240188367, 0.08104189988053231, 0.14269979746583245, -0.09480414544318423, -0.1531650332342704, -0.3012951891351905, -0.15662064460640843, -0.18612591675223988, 0.04863146109373365, -0.19525252111836583, -0.20331560537818372, 0.42497986106684915, 0.16172964914908838, 0.21286927718945123, 0.11154745687208897, 0.22509473141851938, 0.15216023241993282, 0.03973344753979257, 0.06520864652055833, 0.1779874615992109, 0.028094512281111546, 0.1447973547037691, -0.19850222936495104, 0.20584420003514323, 0.007834416779654997] |
1,802.01114 | Multicoloring of Graphs to Secure a Secret | Vertex coloring and multicoloring of graphs are a well known subject in graph
theory, as well as their applications. In vertex multicoloring, each vertex is
assigned some subset of a given set of colors. Here we propose a new kind of
vertex multicoloring, motivated by the situation of sharing a secret and
securing it from the actions of some number of attackers. We name the
multicoloring a highly $a$-resistant vertex $k$-multicoloring, where $a$ is the
number of the attackers, and $k$ the number of colors. For small values $a$ we
determine what is the minimal number of vertices a graph must have in order to
allow such a coloring, and what is the minimal number of colors needed.
| math.CO | vertex coloring and multicoloring of graphs are a well known subject in graph theory as well as their applications in vertex multicoloring each vertex is assigned some subset of a given set of colors here we propose a new kind of vertex multicoloring motivated by the situation of sharing a secret and securing it from the actions of some number of attackers we name the multicoloring a highly aresistant vertex kmulticoloring where a is the number of the attackers and k the number of colors for small values a we determine what is the minimal number of vertices a graph must have in order to allow such a coloring and what is the minimal number of colors needed | [['vertex', 'coloring', 'and', 'multicoloring', 'of', 'graphs', 'are', 'a', 'well', 'known', 'subject', 'in', 'graph', 'theory', 'as', 'well', 'as', 'their', 'applications', 'in', 'vertex', 'multicoloring', 'each', 'vertex', 'is', 'assigned', 'some', 'subset', 'of', 'a', 'given', 'set', 'of', 'colors', 'here', 'we', 'propose', 'a', 'new', 'kind', 'of', 'vertex', 'multicoloring', 'motivated', 'by', 'the', 'situation', 'of', 'sharing', 'a', 'secret', 'and', 'securing', 'it', 'from', 'the', 'actions', 'of', 'some', 'number', 'of', 'attackers', 'we', 'name', 'the', 'multicoloring', 'a', 'highly', 'aresistant', 'vertex', 'kmulticoloring', 'where', 'a', 'is', 'the', 'number', 'of', 'the', 'attackers', 'and', 'k', 'the', 'number', 'of', 'colors', 'for', 'small', 'values', 'a', 'we', 'determine', 'what', 'is', 'the', 'minimal', 'number', 'of', 'vertices', 'a', 'graph', 'must', 'have', 'in', 'order', 'to', 'allow', 'such', 'a', 'coloring', 'and', 'what', 'is', 'the', 'minimal', 'number', 'of', 'colors', 'needed']] | [-0.16137663822155446, 0.11966358812461639, -0.031237614726455046, 0.03389523177134708, -0.15058916875819578, -0.16048635696141242, 0.1146217846975999, 0.3587965349875519, -0.276611075720525, -0.358237420818929, 0.10799447158130752, -0.32501267561496333, -0.13970546650796614, 0.085267826111923, -0.15709206730063105, 0.06258002888114725, 0.054876515938868296, 0.14911705848624415, 0.06833309380755086, -0.2717629902186233, 0.31878315596760987, -0.04861172668812475, 0.14352754344922844, 0.07011743793103459, 0.06627091289305224, 0.046005856145398115, -0.022669302335747613, 0.10854570180627293, -0.12748797548581556, 0.08832902799296224, 0.26915119405322036, 0.19581675850625696, 0.3163527373609872, -0.39054579902761455, -0.1655068002031024, 0.1904816103081524, 0.09789981105934893, 0.11398188448069489, -0.041594205078957926, -0.19310669101582006, 0.1324767730718655, -0.18920693838776187, -0.09228222993812685, 0.004371645545249741, 0.05985981481679683, 0.035353309230011856, -0.275808729873649, -0.08741710887186165, 0.010699107185214886, 0.0367172152036801, 0.05548552872918161, -0.1296720398541797, -0.037107258350668665, 0.17458237278985728, -0.023585295521429385, 0.06552930604987617, 0.039884803025854815, -0.21559601096468495, -0.15049825149090512, 0.4266089615251484, 0.03496495703464085, -0.18193306302218215, 0.1485914273372177, -0.09641954980003808, -0.14921079679584964, 0.08165547592115813, 0.11980616706744607, 0.16729027410198388, -0.14427048821455862, 0.07424523178307371, -0.13381142845248867, 0.10911236491439671, 0.07399597152634042, 0.11619007256652775, 0.15997360055816584, 0.15311282120066985, 0.14198134854588465, 0.16376723473538354, -0.03289461478687309, -0.004050205806912533, -0.3403064462773759, -0.10230842124718915, -0.24931623109471823, 0.05910142271474389, -0.1253664393418525, -0.1744886991158449, 0.4558904233452832, 0.13248275578471608, 0.25161235452758085, 0.05833864524350341, 0.26262452024645333, 0.07776102533371786, 0.0994325170177035, 0.13139972047567175, 0.11620287537215486, 0.12054705636070014, -0.00184901786068904, -0.17011637313508204, 0.08973529879485481, 0.11665080170998157] |
1,802.01115 | End2You -- The Imperial Toolkit for Multimodal Profiling by End-to-End
Learning | We introduce End2You -- the Imperial College London toolkit for multimodal
profiling by end-to-end deep learning. End2You is an open-source toolkit
implemented in Python and is based on Tensorflow. It provides capabilities to
train and evaluate models in an end-to-end manner, i.e., using raw input. It
supports input from raw audio, visual, physiological or other types of
information or combination of those, and the output can be of an arbitrary
representation, for either classification or regression tasks. To our
knowledge, this is the first toolkit that provides generic end-to-end learning
for profiling capabilities in either unimodal or multimodal cases. To test our
toolkit, we utilise the RECOLA database as was used in the AVEC 2016 challenge.
Experimental results indicate that End2You can provide comparable results to
state-of-the-art methods despite no need of expert-alike feature
representations, but self-learning these from the data "end to end".
| cs.CV | we introduce end2you the imperial college london toolkit for multimodal profiling by endtoend deep learning end2you is an opensource toolkit implemented in python and is based on tensorflow it provides capabilities to train and evaluate models in an endtoend manner ie using raw input it supports input from raw audio visual physiological or other types of information or combination of those and the output can be of an arbitrary representation for either classification or regression tasks to our knowledge this is the first toolkit that provides generic endtoend learning for profiling capabilities in either unimodal or multimodal cases to test our toolkit we utilise the recola database as was used in the avec 2016 challenge experimental results indicate that end2you can provide comparable results to stateoftheart methods despite no need of expertalike feature representations but selflearning these from the data end to end | [['we', 'introduce', 'end2you', 'the', 'imperial', 'college', 'london', 'toolkit', 'for', 'multimodal', 'profiling', 'by', 'endtoend', 'deep', 'learning', 'end2you', 'is', 'an', 'opensource', 'toolkit', 'implemented', 'in', 'python', 'and', 'is', 'based', 'on', 'tensorflow', 'it', 'provides', 'capabilities', 'to', 'train', 'and', 'evaluate', 'models', 'in', 'an', 'endtoend', 'manner', 'ie', 'using', 'raw', 'input', 'it', 'supports', 'input', 'from', 'raw', 'audio', 'visual', 'physiological', 'or', 'other', 'types', 'of', 'information', 'or', 'combination', 'of', 'those', 'and', 'the', 'output', 'can', 'be', 'of', 'an', 'arbitrary', 'representation', 'for', 'either', 'classification', 'or', 'regression', 'tasks', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'toolkit', 'that', 'provides', 'generic', 'endtoend', 'learning', 'for', 'profiling', 'capabilities', 'in', 'either', 'unimodal', 'or', 'multimodal', 'cases', 'to', 'test', 'our', 'toolkit', 'we', 'utilise', 'the', 'recola', 'database', 'as', 'was', 'used', 'in', 'the', 'avec', '2016', 'challenge', 'experimental', 'results', 'indicate', 'that', 'end2you', 'can', 'provide', 'comparable', 'results', 'to', 'stateoftheart', 'methods', 'despite', 'no', 'need', 'of', 'expertalike', 'feature', 'representations', 'but', 'selflearning', 'these', 'from', 'the', 'data', 'end', 'to', 'end']] | [0.005216794978814121, -0.02543724531975565, -0.09928833317293614, 0.04172019726222932, -0.13526276269481635, -0.18074789518674075, -0.029317389190702006, 0.45993117836605707, -0.24401335962752904, -0.3500503101320544, 0.08445058054041485, -0.29214118093147246, -0.1710159516545721, 0.25406129873344596, -0.10296119548114752, 0.08231973681520198, 0.14549128428547525, 0.04880237378180847, -0.043530380067417176, -0.2647953099410483, 0.2882684887186821, 0.06734170198984096, 0.3520190712248146, 0.03602763514926421, 0.137091625302302, 0.012854147666383167, -0.05159123284306909, -0.06723821921425785, -0.06321454626841316, 0.18096443005299695, 0.348962760654539, 0.2620931648432841, 0.27772255105287835, -0.4191714816818565, -0.18937526792955986, 0.04027437759091107, 0.14263273700153534, 0.1272860603926795, -0.042006100283429014, -0.3425320903442695, 0.08514721405325117, -0.19361205315086202, -0.005351908887001935, -0.16457910173651302, -0.03168289606052805, -0.0031766767718527517, -0.29166826919462324, 0.011493138798420698, 0.06435140605989687, 0.1124291165738406, -0.06442365096718021, -0.11832982258097281, 0.011071382608579499, 0.17974476367366357, -0.021969517396146457, 0.09083519605378633, 0.1210820198478833, -0.15255579600330157, -0.14843291554044158, 0.3405827408210492, -0.10525913088103678, -0.17687730102891652, 0.2303238135318167, 0.01714363751906744, -0.15593416068676702, 0.07197639513695218, 0.2475041043485554, 0.06653065373465208, -0.18392140643907265, 0.04245649122273956, 0.007989822309726561, 0.23188285106829118, 0.014770723987964283, -0.06440387298697343, 0.18881330734387722, 0.2368070295762638, -0.04096465278170924, 0.1487968058491775, -0.09855543719715287, -0.018148901428810885, -0.21341763583707138, -0.15231681469472086, -0.17111793682339904, -0.03322478981186885, -0.041414752100536134, -0.14316889043228412, 0.3473195380754244, 0.24805084215214765, 0.16918258667549668, 0.11305569981644586, 0.36329449212152354, 0.00716144317174068, 0.11780025076750718, 0.12673354933602393, 0.1464239784752504, -0.04422210485995813, 0.14077763298434587, -0.12020782811540953, 0.07919339369818516, 0.024178182243854856] |
1,802.01116 | Object Sorting Using a Global Texture-Shape 3D Feature Descriptor | Object recognition and grasping plays a key role in robotic systems,
especially for the autonomous robots to implement object sorting tasks in a
warehouse. In this paper, we present a global texture-shape 3D feature
descriptor which can be utilized in a system of object recognition and
grasping, and can perform object sorting tasks well. Our proposed descriptor
stems from the clustered viewpoint feature histogram (CVFH), which relies on
the geometrical information of the whole 3D object surface only, and can not
perform well in recognizing the objects with similar geometrical information.
Therefore, we extend the CVFH descriptor with texture and color information to
generate a new global 3D feature descriptor. The proposed descriptor is
evaluated in tasks of recognizing and classifying 3D objects by applying
multi-class support vector machines (SVM) in both public 3D image dataset and
real scenes. The results of evaluation show that the proposed descriptor
achieves a significant better performance for object recognition compared with
the original CVFH. Then, the proposed descriptor is applied in our object
recognition and grasping system, showing that the proposed descriptor helps the
system implement the object recognition, object grasping and object sorting
tasks well.
| cs.CV cs.RO | object recognition and grasping plays a key role in robotic systems especially for the autonomous robots to implement object sorting tasks in a warehouse in this paper we present a global textureshape 3d feature descriptor which can be utilized in a system of object recognition and grasping and can perform object sorting tasks well our proposed descriptor stems from the clustered viewpoint feature histogram cvfh which relies on the geometrical information of the whole 3d object surface only and can not perform well in recognizing the objects with similar geometrical information therefore we extend the cvfh descriptor with texture and color information to generate a new global 3d feature descriptor the proposed descriptor is evaluated in tasks of recognizing and classifying 3d objects by applying multiclass support vector machines svm in both public 3d image dataset and real scenes the results of evaluation show that the proposed descriptor achieves a significant better performance for object recognition compared with the original cvfh then the proposed descriptor is applied in our object recognition and grasping system showing that the proposed descriptor helps the system implement the object recognition object grasping and object sorting tasks well | [['object', 'recognition', 'and', 'grasping', 'plays', 'a', 'key', 'role', 'in', 'robotic', 'systems', 'especially', 'for', 'the', 'autonomous', 'robots', 'to', 'implement', 'object', 'sorting', 'tasks', 'in', 'a', 'warehouse', 'in', 'this', 'paper', 'we', 'present', 'a', 'global', 'textureshape', '3d', 'feature', 'descriptor', 'which', 'can', 'be', 'utilized', 'in', 'a', 'system', 'of', 'object', 'recognition', 'and', 'grasping', 'and', 'can', 'perform', 'object', 'sorting', 'tasks', 'well', 'our', 'proposed', 'descriptor', 'stems', 'from', 'the', 'clustered', 'viewpoint', 'feature', 'histogram', 'cvfh', 'which', 'relies', 'on', 'the', 'geometrical', 'information', 'of', 'the', 'whole', '3d', 'object', 'surface', 'only', 'and', 'can', 'not', 'perform', 'well', 'in', 'recognizing', 'the', 'objects', 'with', 'similar', 'geometrical', 'information', 'therefore', 'we', 'extend', 'the', 'cvfh', 'descriptor', 'with', 'texture', 'and', 'color', 'information', 'to', 'generate', 'a', 'new', 'global', '3d', 'feature', 'descriptor', 'the', 'proposed', 'descriptor', 'is', 'evaluated', 'in', 'tasks', 'of', 'recognizing', 'and', 'classifying', '3d', 'objects', 'by', 'applying', 'multiclass', 'support', 'vector', 'machines', 'svm', 'in', 'both', 'public', '3d', 'image', 'dataset', 'and', 'real', 'scenes', 'the', 'results', 'of', 'evaluation', 'show', 'that', 'the', 'proposed', 'descriptor', 'achieves', 'a', 'significant', 'better', 'performance', 'for', 'object', 'recognition', 'compared', 'with', 'the', 'original', 'cvfh', 'then', 'the', 'proposed', 'descriptor', 'is', 'applied', 'in', 'our', 'object', 'recognition', 'and', 'grasping', 'system', 'showing', 'that', 'the', 'proposed', 'descriptor', 'helps', 'the', 'system', 'implement', 'the', 'object', 'recognition', 'object', 'grasping', 'and', 'object', 'sorting', 'tasks', 'well']] | [-0.047214084498894714, -0.06195671533108301, -0.12705683987951488, 0.015561189957831326, -0.09518355507437566, -0.1841001197535661, -0.024606859356936184, 0.4521757146188368, -0.2235961258605433, -0.3745939087384613, 0.08365387386826721, -0.21576920200216895, -0.2256364935892634, 0.19069696273072623, -0.21761582195176743, 0.13588454701736433, 0.16172724537318572, 0.08523404745331693, -0.04899836811091518, -0.2485890444756175, 0.2929457128872552, 0.006589659712820624, 0.33974169455177616, 0.010126779263373464, 0.1741758094067336, 0.0011900672252522781, -0.05626019075498334, 0.0012512114287043612, 0.016019295049394106, 0.1825983782412853, 0.31699521586172824, 0.1938917306761141, 0.18648187105039446, -0.3394258487193535, -0.21958932315950128, 0.060117112458101474, 0.15900373999223424, 0.11206791759711147, -0.06595012039967212, -0.4329583634098526, 0.11271630741975969, -0.1405578432653177, 0.006403703499472613, -0.15912567019889443, 0.042415388314111624, -0.044453212140979304, -0.2806520785791993, 0.012782521727785934, 0.1344482899300298, 0.0958006212010029, -0.12611558941352996, -0.07255959259115723, -0.008411452107490428, 0.2212581531057367, -0.023316913825207546, 0.08304472540051695, 0.2206305097479344, -0.24644571908447688, -0.1628036619379903, 0.45401245850371197, -0.005680685583987118, -0.2599398841072495, 0.23207985760442776, -0.05015508484939346, -0.14448619339236757, 0.08506051728666837, 0.23593101882822035, 0.1691007019156435, -0.14325816829902274, -0.02152536638732272, -0.08366155480083155, 0.19507670723335954, 0.023375959346594755, -0.010921999846080629, 0.2263338727898372, 0.2990575397716384, 0.04629664995203105, 0.18657645005259837, -0.21048713004893216, -0.054974025702298, -0.18018863956967834, -0.14248764410270573, -0.21592592267067326, -0.09038035896196561, -0.12286242412111885, -0.11781710603584845, 0.40589050710453495, 0.2470299486279449, 0.2117794816804235, 0.06350419089236918, 0.3557591610200082, -0.006295617954795792, 0.14485059457456373, 0.09064448750965919, 0.1781467937865576, -0.033167073019285453, 0.14288395004192958, -0.19714065974282372, 0.07876995934687632, 0.13037455384710483] |
1,802.01117 | Small Cell Association with Networked Flying Platforms: Novel Algorithms
and Performance Bounds | Fifth generation (5G) and beyond-5G (B5G) systems expect coverage and
capacity enhancements along with the consideration of limited power, cost and
spectrum. Densification of small cells (SCs) is a promising approach to cater
these demands of 5G and B5G systems. However, such an ultra dense network of
SCs requires provision of smart backhaul and fronthaul networks. In this paper,
we employ a scalable idea of using networked flying platforms (NFPs) as aerial
hubs to provide fronthaul connectivity to the SCs. We consider the association
problem of SCs and NFPs in a SC network and study the effect of practical
constraints related to the system and NFPs. Mainly, we show that the
association problem is related to the generalized assignment problem (GAP).
Using this relation with the GAP, we show the NP-hard complexity of the
association problem and further derive an upper bound for the maximum
achievable sum data rate. Linear Programming relaxation of the problem is also
studied to compare the results with the derived bounds. Finally, two efficient
(less complex) greedy solutions of the association problem are presented, where
one of them is a distributed solution and the other one is its centralized
version. Numerical results show a favorable performance of the presented
algorithms with respect to the exhaustive search and derived bounds. The
computational complexity comparison of the algorithms with the exhaustive
search is also presented to show that the presented algorithms can be
practically implemented.
| cs.NI | fifth generation 5g and beyond5g b5g systems expect coverage and capacity enhancements along with the consideration of limited power cost and spectrum densification of small cells scs is a promising approach to cater these demands of 5g and b5g systems however such an ultra dense network of scs requires provision of smart backhaul and fronthaul networks in this paper we employ a scalable idea of using networked flying platforms nfps as aerial hubs to provide fronthaul connectivity to the scs we consider the association problem of scs and nfps in a sc network and study the effect of practical constraints related to the system and nfps mainly we show that the association problem is related to the generalized assignment problem gap using this relation with the gap we show the nphard complexity of the association problem and further derive an upper bound for the maximum achievable sum data rate linear programming relaxation of the problem is also studied to compare the results with the derived bounds finally two efficient less complex greedy solutions of the association problem are presented where one of them is a distributed solution and the other one is its centralized version numerical results show a favorable performance of the presented algorithms with respect to the exhaustive search and derived bounds the computational complexity comparison of the algorithms with the exhaustive search is also presented to show that the presented algorithms can be practically implemented | [['fifth', 'generation', '5g', 'and', 'beyond5g', 'b5g', 'systems', 'expect', 'coverage', 'and', 'capacity', 'enhancements', 'along', 'with', 'the', 'consideration', 'of', 'limited', 'power', 'cost', 'and', 'spectrum', 'densification', 'of', 'small', 'cells', 'scs', 'is', 'a', 'promising', 'approach', 'to', 'cater', 'these', 'demands', 'of', '5g', 'and', 'b5g', 'systems', 'however', 'such', 'an', 'ultra', 'dense', 'network', 'of', 'scs', 'requires', 'provision', 'of', 'smart', 'backhaul', 'and', 'fronthaul', 'networks', 'in', 'this', 'paper', 'we', 'employ', 'a', 'scalable', 'idea', 'of', 'using', 'networked', 'flying', 'platforms', 'nfps', 'as', 'aerial', 'hubs', 'to', 'provide', 'fronthaul', 'connectivity', 'to', 'the', 'scs', 'we', 'consider', 'the', 'association', 'problem', 'of', 'scs', 'and', 'nfps', 'in', 'a', 'sc', 'network', 'and', 'study', 'the', 'effect', 'of', 'practical', 'constraints', 'related', 'to', 'the', 'system', 'and', 'nfps', 'mainly', 'we', 'show', 'that', 'the', 'association', 'problem', 'is', 'related', 'to', 'the', 'generalized', 'assignment', 'problem', 'gap', 'using', 'this', 'relation', 'with', 'the', 'gap', 'we', 'show', 'the', 'nphard', 'complexity', 'of', 'the', 'association', 'problem', 'and', 'further', 'derive', 'an', 'upper', 'bound', 'for', 'the', 'maximum', 'achievable', 'sum', 'data', 'rate', 'linear', 'programming', 'relaxation', 'of', 'the', 'problem', 'is', 'also', 'studied', 'to', 'compare', 'the', 'results', 'with', 'the', 'derived', 'bounds', 'finally', 'two', 'efficient', 'less', 'complex', 'greedy', 'solutions', 'of', 'the', 'association', 'problem', 'are', 'presented', 'where', 'one', 'of', 'them', 'is', 'a', 'distributed', 'solution', 'and', 'the', 'other', 'one', 'is', 'its', 'centralized', 'version', 'numerical', 'results', 'show', 'a', 'favorable', 'performance', 'of', 'the', 'presented', 'algorithms', 'with', 'respect', 'to', 'the', 'exhaustive', 'search', 'and', 'derived', 'bounds', 'the', 'computational', 'complexity', 'comparison', 'of', 'the', 'algorithms', 'with', 'the', 'exhaustive', 'search', 'is', 'also', 'presented', 'to', 'show', 'that', 'the', 'presented', 'algorithms', 'can', 'be', 'practically', 'implemented']] | [-0.20497133710398144, 0.011834325031264872, -0.005050729087577397, 0.060592033576448705, -0.07651974915863335, -0.15899522417076245, 0.12108948067302167, 0.37431464789184826, -0.30257194215615724, -0.30933196580418026, 0.13300588520873777, -0.24691904860070785, -0.17353631213709453, 0.19540602812336116, -0.06780261659364709, 0.07182201214047626, 0.08317879135935653, 0.021590261123492382, -0.04334571450533435, -0.26427209907223104, 0.2858417475392588, 0.08405290307240373, 0.3428079811944196, 0.07899334426077098, 0.052992360884061535, -0.050003471465129797, -0.02918509126468679, 0.023324089114282263, -0.10983735213317652, 0.19162156061218472, 0.2801774021985495, 0.18992656417887563, 0.2629159805951875, -0.4225371777815666, -0.20023871398288287, 0.10120105857182168, 0.16520358775517346, 0.04970826864430383, -0.06513143297159622, -0.24809339613763287, 0.1353884696986863, -0.200684129720272, -0.0757566985396371, -0.02604927634135546, -0.025426589015151272, 0.05434739169079669, -0.3021356135747638, 0.01814653690094363, -0.008078229042286632, -0.0014812985442220741, -0.05304488782358097, -0.11719626694293536, 0.03420272663611324, 0.11531583991825205, 0.03863579562208282, 0.0091808042254205, 0.07837959641112335, -0.13105993782622083, -0.15529196895854627, 0.4229126378831242, -0.0008119514973603283, -0.20463946910903735, 0.20164687667793335, -0.05383992059931096, -0.14144309738185257, 0.10108200490803403, 0.21949097608434262, 0.11260344356908894, -0.16701217473752625, 0.04956026292213302, -0.03680341908837348, 0.13871928669527925, 0.023370177604398933, 0.08318227526199605, 0.13829396615204, 0.23948551306673208, 0.14752064288022512, 0.17677563927141254, -0.08963098103083189, -0.0929159108244133, -0.21767939754346965, -0.1429442309340591, -0.1845793912545269, -0.026897130813840934, -0.0855789067512383, -0.10699976922625269, 0.3341137987851095, 0.14771888013576948, 0.14416475844092103, 0.12213822340537958, 0.3470919844381386, 0.12153194271255002, 0.06786512340538345, 0.12036027000363947, 0.21594773769816933, 0.09598067252722592, 0.11406295256642233, -0.23020591178494154, 0.032560398819770256, 0.02138874349536515] |
1,802.01118 | Dark information of black hole radiation raised by dark energy | The "lost" information of black hole through the Hawking radiation was
discovered being stored in the correlation among the non-thermally radiated
particles [Phys. Rev. Lett 85, 5042 (2000), Phys. Lett. B 675, 1 (2009)]. This
correlation information, which has not yet been proved locally observable in
principle, is named by dark information. In this paper, we systematically study
the influences of dark energy on black hole radiation, especially on the dark
information. Calculating the radiation spectrum in the existence of dark energy
by the approach of canonical typicality, which is reconfirmed by the quantum
tunneling method, we find that the dark energy will effectively lower the
Hawking temperature, and thus makes the black hole has longer life time. It is
also discovered that the non-thermal effect of the black hole radiation is
enhanced by dark energy so that the dark information of the radiation is
increased. Our observation shows that, besides the mechanical effect (e.g.,
gravitational lensing effect), the dark energy rises the the stored dark
information, which could be probed by a non-local coincidence measurement
similar to the coincidence counting of the Hanbury-Brown -Twiss experiment in
quantum optics.
| gr-qc quant-ph | the lost information of black hole through the hawking radiation was discovered being stored in the correlation among the nonthermally radiated particles phys rev lett 85 5042 2000 phys lett b 675 1 2009 this correlation information which has not yet been proved locally observable in principle is named by dark information in this paper we systematically study the influences of dark energy on black hole radiation especially on the dark information calculating the radiation spectrum in the existence of dark energy by the approach of canonical typicality which is reconfirmed by the quantum tunneling method we find that the dark energy will effectively lower the hawking temperature and thus makes the black hole has longer life time it is also discovered that the nonthermal effect of the black hole radiation is enhanced by dark energy so that the dark information of the radiation is increased our observation shows that besides the mechanical effect eg gravitational lensing effect the dark energy rises the the stored dark information which could be probed by a nonlocal coincidence measurement similar to the coincidence counting of the hanburybrown twiss experiment in quantum optics | [['the', 'lost', 'information', 'of', 'black', 'hole', 'through', 'the', 'hawking', 'radiation', 'was', 'discovered', 'being', 'stored', 'in', 'the', 'correlation', 'among', 'the', 'nonthermally', 'radiated', 'particles', 'phys', 'rev', 'lett', '85', '5042', '2000', 'phys', 'lett', 'b', '675', '1', '2009', 'this', 'correlation', 'information', 'which', 'has', 'not', 'yet', 'been', 'proved', 'locally', 'observable', 'in', 'principle', 'is', 'named', 'by', 'dark', 'information', 'in', 'this', 'paper', 'we', 'systematically', 'study', 'the', 'influences', 'of', 'dark', 'energy', 'on', 'black', 'hole', 'radiation', 'especially', 'on', 'the', 'dark', 'information', 'calculating', 'the', 'radiation', 'spectrum', 'in', 'the', 'existence', 'of', 'dark', 'energy', 'by', 'the', 'approach', 'of', 'canonical', 'typicality', 'which', 'is', 'reconfirmed', 'by', 'the', 'quantum', 'tunneling', 'method', 'we', 'find', 'that', 'the', 'dark', 'energy', 'will', 'effectively', 'lower', 'the', 'hawking', 'temperature', 'and', 'thus', 'makes', 'the', 'black', 'hole', 'has', 'longer', 'life', 'time', 'it', 'is', 'also', 'discovered', 'that', 'the', 'nonthermal', 'effect', 'of', 'the', 'black', 'hole', 'radiation', 'is', 'enhanced', 'by', 'dark', 'energy', 'so', 'that', 'the', 'dark', 'information', 'of', 'the', 'radiation', 'is', 'increased', 'our', 'observation', 'shows', 'that', 'besides', 'the', 'mechanical', 'effect', 'eg', 'gravitational', 'lensing', 'effect', 'the', 'dark', 'energy', 'rises', 'the', 'the', 'stored', 'dark', 'information', 'which', 'could', 'be', 'probed', 'by', 'a', 'nonlocal', 'coincidence', 'measurement', 'similar', 'to', 'the', 'coincidence', 'counting', 'of', 'the', 'hanburybrown', 'twiss', 'experiment', 'in', 'quantum', 'optics']] | [-0.11779964452845947, 0.17474798495245594, -0.14008322698877207, 0.12199447089889352, -0.08781563303502346, -0.10409438006934665, 0.011016628399451889, 0.29254838483279977, -0.19300846137086708, -0.393119943205011, 0.008750119115344233, -0.3171372513370539, -0.07233380125687709, 0.1868895603807042, -0.03615030877922893, 0.011336879637190905, 0.007776573974831355, 0.02631291902806393, -0.030187695750365496, -0.25157253780998484, 0.28921967323699466, 0.17558828077806288, 0.2714724826956631, 0.0987533300658614, 0.0880514534286386, 0.04139629425850534, -0.04206164337469206, -0.004440649819102079, -0.1711449024371283, 0.026783345429788507, 0.20046684305089965, 0.12177210472580834, 0.24502904055930833, -0.3796924894562277, -0.2653444831742457, 0.14979809204796476, 0.11666792750544291, 0.1378529500518063, -0.08969933605782451, -0.3237493003018831, 0.027912251301348164, -0.22082501625587977, -0.07189987064724192, -0.01692859149020887, 0.05744900694856095, -0.0428068843071482, -0.1922715490366081, 0.1611000214290384, 0.043087104161728236, -0.07449080708323333, -0.04736216668354929, -0.01735080147615422, -0.053767862891108194, -0.0036132389694334024, 0.053773459681511794, 0.020714151845486077, 0.21938230393444577, -0.10262652483852532, -0.09606529860794248, 0.3532932342015325, -0.0818939676863097, -0.10453499237040954, 0.14417739303304603, -0.19264413257469498, -0.09668539825669199, 0.1709064863296965, 0.08736121548812777, 0.12594962884208788, -0.20106627658088372, 0.0941493485647096, -0.03151442441182635, 0.18954251705553068, 0.12262926079460947, 0.10397739688343512, 0.34010990555817017, 0.11841777768528099, -0.00754369467388464, 0.12441894799044662, -0.1301857517889292, -0.05627611930304695, -0.2699175964666422, -0.17494692515105098, -0.24520508547328293, 0.09033097197166484, -0.023089685262887363, -0.07796301813943991, 0.3439027638218942, 0.14433860795100578, 0.15232541509774616, -0.03929785516534355, 0.3061882173691792, 0.10362590037695275, 0.03269895927139149, 0.09787779564047774, 0.37304806568852017, 0.1280101618727068, 0.1637917221529981, -0.28205770193771634, 0.0006982893553665943, -0.0023064201786404566] |
1,802.01119 | Calculation of Dissociation Temperature of Nucleon Using Gaussian
Expansion Method | The first study of the dissociation temperature of nucleon in hot QCD medium
in the framework of constituent quark model is presented. The
temperature-dependent potential energy of the three quark system, taking as the
internal energy of the system are obtained from the free energy of the system,
and the temperature-dependent free energy is derived based on Debye-H\"uckel
theory. The lattice QCD results of the free energy for heavy three-quark system
are employed and extended to the light three-quark system. The Schr\"{o}dinger
equation for nucleon is solved with the help of Gaussian expansion method and
the dissociation temperature of the nucleon is determined according to the
temperature dependence of binding energy and radii. Comparing with the
dissociation temperature of $J/\psi$, the dissociation temperature of nucleon
is higher. So, nucleon is more difficult to melt than Charmonium.
| hep-ph | the first study of the dissociation temperature of nucleon in hot qcd medium in the framework of constituent quark model is presented the temperaturedependent potential energy of the three quark system taking as the internal energy of the system are obtained from the free energy of the system and the temperaturedependent free energy is derived based on debyehuckel theory the lattice qcd results of the free energy for heavy threequark system are employed and extended to the light threequark system the schrodinger equation for nucleon is solved with the help of gaussian expansion method and the dissociation temperature of the nucleon is determined according to the temperature dependence of binding energy and radii comparing with the dissociation temperature of jpsi the dissociation temperature of nucleon is higher so nucleon is more difficult to melt than charmonium | [['the', 'first', 'study', 'of', 'the', 'dissociation', 'temperature', 'of', 'nucleon', 'in', 'hot', 'qcd', 'medium', 'in', 'the', 'framework', 'of', 'constituent', 'quark', 'model', 'is', 'presented', 'the', 'temperaturedependent', 'potential', 'energy', 'of', 'the', 'three', 'quark', 'system', 'taking', 'as', 'the', 'internal', 'energy', 'of', 'the', 'system', 'are', 'obtained', 'from', 'the', 'free', 'energy', 'of', 'the', 'system', 'and', 'the', 'temperaturedependent', 'free', 'energy', 'is', 'derived', 'based', 'on', 'debyehuckel', 'theory', 'the', 'lattice', 'qcd', 'results', 'of', 'the', 'free', 'energy', 'for', 'heavy', 'threequark', 'system', 'are', 'employed', 'and', 'extended', 'to', 'the', 'light', 'threequark', 'system', 'the', 'schrodinger', 'equation', 'for', 'nucleon', 'is', 'solved', 'with', 'the', 'help', 'of', 'gaussian', 'expansion', 'method', 'and', 'the', 'dissociation', 'temperature', 'of', 'the', 'nucleon', 'is', 'determined', 'according', 'to', 'the', 'temperature', 'dependence', 'of', 'binding', 'energy', 'and', 'radii', 'comparing', 'with', 'the', 'dissociation', 'temperature', 'of', 'jpsi', 'the', 'dissociation', 'temperature', 'of', 'nucleon', 'is', 'higher', 'so', 'nucleon', 'is', 'more', 'difficult', 'to', 'melt', 'than', 'charmonium']] | [-0.05120672626157209, 0.21852623286780298, -0.1231620351489469, 0.08488424300209291, -0.009790897203321733, -0.0616764955852619, 0.04453396971203962, 0.336261292494943, -0.19025460054057047, -0.26021011332597804, -0.034808384389821985, -0.3151926419642918, 0.014222150825148942, 0.13134328891379377, 0.09702347182011341, 0.09762087941293002, 0.024883832732859233, 0.09600012915838949, -0.052619380147114175, -0.19833981671014472, 0.3786985662745257, 0.0663234771003344, 0.21417533615877962, 0.22165611823198988, 0.05020625442814301, 0.019688290106440784, 0.011897158124210203, -0.03109746337539785, -0.1319914384477991, 0.10379133231403745, 0.17281585840956884, 0.02260992128525258, 0.1578206905259696, -0.4048025098437553, -0.22297319621600978, 0.05248983536148444, 0.11795252992990701, 0.1354207349804175, -0.003264599315062857, -0.24961682474788496, 0.05862192087121965, -0.20729462278541178, -0.17073702439580196, -0.10525741902015665, -0.035164232687641156, 0.034363749123739955, -0.26967550745672164, 0.1399539651003365, -0.043722452000057435, 0.020462665521978018, -0.16089331248076633, -0.22212557886771667, -0.09430322247584734, 0.06392965575009037, 0.0718220409565701, 0.08005891987019875, 0.19273583570440464, -0.15412813627421307, -0.05400249411639593, 0.4751550257069004, -0.051686469606412336, -0.14139830911817092, 0.12099897330592606, -0.15870188839856864, -0.0561270232360317, 0.18494765978368163, 0.1590169757974389, 0.10092461870312143, -0.21828432121615418, 0.07769058685859337, -0.008534553471048745, 0.18609699363108068, 0.08701365095946718, 0.060793216223828495, 0.17359491409254535, 0.23918465749524973, -0.02264763295705266, 0.11727012968313989, -0.07416586378445465, -0.14958838305627817, -0.3128965158042881, -0.12090073913756949, -0.19792972107568538, 0.032858947969918305, -0.09531149481079089, -0.12349628337987643, 0.4097794790851528, 0.09806712878772113, 0.16942563114742584, -0.015836571120684418, 0.3130568070645334, 0.1891452375215629, 0.052268858060843366, 0.07654283890801974, 0.24064145709031864, 0.22078660564319066, 0.1525619594989728, -0.3417227630869841, -0.022002171752426553, 0.08398999534684289] |
1,802.0112 | The effect of Earth's gravitational field on the muon magic momentum | A recent set of articles considers the effect of Earth's gravity on the
magnetic moments of fermions. The authors conclude that the gravitational
effects cancel out for measurements of the electron anomalous magnetic moment,
but for the muon measurements, given that they are performed on highly
relativistic muons, the effect is large enough to explain the discrepancy
between measured and theoretical values. In this paper this effect is shown to
be too small given experimental resolutions, and has been absorbed into the
systematic uncertainties of experiments performed to date. Future experiments
will require muon momentum tuning at the keV/c level to see this effect.
| hep-ph | a recent set of articles considers the effect of earths gravity on the magnetic moments of fermions the authors conclude that the gravitational effects cancel out for measurements of the electron anomalous magnetic moment but for the muon measurements given that they are performed on highly relativistic muons the effect is large enough to explain the discrepancy between measured and theoretical values in this paper this effect is shown to be too small given experimental resolutions and has been absorbed into the systematic uncertainties of experiments performed to date future experiments will require muon momentum tuning at the kevc level to see this effect | [['a', 'recent', 'set', 'of', 'articles', 'considers', 'the', 'effect', 'of', 'earths', 'gravity', 'on', 'the', 'magnetic', 'moments', 'of', 'fermions', 'the', 'authors', 'conclude', 'that', 'the', 'gravitational', 'effects', 'cancel', 'out', 'for', 'measurements', 'of', 'the', 'electron', 'anomalous', 'magnetic', 'moment', 'but', 'for', 'the', 'muon', 'measurements', 'given', 'that', 'they', 'are', 'performed', 'on', 'highly', 'relativistic', 'muons', 'the', 'effect', 'is', 'large', 'enough', 'to', 'explain', 'the', 'discrepancy', 'between', 'measured', 'and', 'theoretical', 'values', 'in', 'this', 'paper', 'this', 'effect', 'is', 'shown', 'to', 'be', 'too', 'small', 'given', 'experimental', 'resolutions', 'and', 'has', 'been', 'absorbed', 'into', 'the', 'systematic', 'uncertainties', 'of', 'experiments', 'performed', 'to', 'date', 'future', 'experiments', 'will', 'require', 'muon', 'momentum', 'tuning', 'at', 'the', 'kevc', 'level', 'to', 'see', 'this', 'effect']] | [-0.11065651533008526, 0.19079681475040983, -0.06366787455270737, 0.1016799506710987, -0.09298086205262293, -0.06368040562453635, 0.042635803128416354, 0.3551582722264586, -0.2099952904453266, -0.35493312319921494, 0.03452845764441361, -0.33855465871905815, -0.039400733265917275, 0.21541318932132233, -0.015792488952357214, 0.04421146604522398, 0.09167544502376136, 0.012466756645047549, -0.07076994373205399, -0.2579410605390276, 0.2758745227350392, 0.14724446624264265, 0.24947172477479698, 0.1470592656462155, 0.10952883037440117, -0.06014194505885967, -0.06488701191197321, 0.06859833566309179, -0.0994567284771655, 0.057148313619992105, 0.22794371470356883, 0.017034857811912604, 0.20470603220944644, -0.46186144053212647, -0.19668080027269436, 0.10169947789349024, 0.10736394270088126, 0.11536679443568715, -0.07453903742360621, -0.2721878673985275, 0.06905517283119532, -0.1451884826636213, -0.10064254146638932, -0.08936825018484616, 0.030087904430455663, -0.032893655062155816, -0.2914366379958912, 0.06097034461009632, 0.029487062487479985, 0.07743083653989637, -0.03018365964266354, -0.15254230475396785, 0.03082425227542453, 0.10266067368855465, 0.14084619174720447, 0.04631707863571367, 0.14657835147424952, -0.0944361435300309, -0.12218790080452573, 0.3790498259251268, -0.04873306230072257, -0.20659170551135123, 0.1339590783633328, -0.26274974525734346, -0.15002846820460794, 0.13027423169481958, 0.18144471947899432, 0.09690153723564542, -0.14959168839675274, 0.05349559715646093, -0.012333194607669868, 0.15897744616326306, 0.019305284234505254, 0.026803442824053243, 0.2768561313181971, 0.1520017706461305, 0.026262939582099614, 0.07833434764105936, -0.15998790741816743, -0.010423984319803495, -0.296144156983502, -0.09649344831614674, -0.16550118539446187, 0.0571062898046328, 0.016526326406306305, -0.11113929655487667, 0.3628656699783304, 0.20623290707646572, 0.19383259799819694, -0.029787509130241658, 0.3207812344031499, 0.09609271166182137, 0.09865118466171852, 0.010265535740543482, 0.3318559459130307, 0.13258795853188823, 0.1107475001193149, -0.27030973106586526, 0.09322458375087098, 0.007887130042592299] |
1,802.01121 | Symmetric Lie models of a triangle | R. Lawrence and D. Sullivan have constructed a Lie model for an interval from
the geometrical idea of flat connections and flows of gauge transformations.
Their model supports an action of the symmetric group $\Sigma_2$ reflecting the
geometrical symmetry of the interval. In this work, we present a Lie model of
the triangle with an action of the symmetric group $\Sigma_3$ compatible with
the geometrical symmetries of the triangle. We also prove that the model of a
graph consisting of a circuit with $k$ vertices admits a Maurer-Cartan element
stable by the automorphisms of the graph.
| math.AT | r lawrence and d sullivan have constructed a lie model for an interval from the geometrical idea of flat connections and flows of gauge transformations their model supports an action of the symmetric group sigma_2 reflecting the geometrical symmetry of the interval in this work we present a lie model of the triangle with an action of the symmetric group sigma_3 compatible with the geometrical symmetries of the triangle we also prove that the model of a graph consisting of a circuit with k vertices admits a maurercartan element stable by the automorphisms of the graph | [['r', 'lawrence', 'and', 'd', 'sullivan', 'have', 'constructed', 'a', 'lie', 'model', 'for', 'an', 'interval', 'from', 'the', 'geometrical', 'idea', 'of', 'flat', 'connections', 'and', 'flows', 'of', 'gauge', 'transformations', 'their', 'model', 'supports', 'an', 'action', 'of', 'the', 'symmetric', 'group', 'sigma_2', 'reflecting', 'the', 'geometrical', 'symmetry', 'of', 'the', 'interval', 'in', 'this', 'work', 'we', 'present', 'a', 'lie', 'model', 'of', 'the', 'triangle', 'with', 'an', 'action', 'of', 'the', 'symmetric', 'group', 'sigma_3', 'compatible', 'with', 'the', 'geometrical', 'symmetries', 'of', 'the', 'triangle', 'we', 'also', 'prove', 'that', 'the', 'model', 'of', 'a', 'graph', 'consisting', 'of', 'a', 'circuit', 'with', 'k', 'vertices', 'admits', 'a', 'maurercartan', 'element', 'stable', 'by', 'the', 'automorphisms', 'of', 'the', 'graph']] | [-0.19990969071902023, 0.10064288248076991, -0.10704191924499658, -0.01718616268893432, -0.09523910095837589, -0.1227978613023879, 0.02260795946494909, 0.3759544938802719, -0.2869713393689987, -0.26165013479355065, 0.08461199370382626, -0.2558669055385205, -0.14431668480028748, 0.10552096633667436, -0.07004667316020156, -0.014576587379754832, 0.02362106224366774, 0.13563578249886632, -0.10646559241528546, -0.1984470743852095, 0.3699316654819995, 0.010832201165612787, 0.2085511933643526, -0.003777456513565388, 0.152965038549155, -0.005367130463127978, -0.02633100537059363, 0.024439904615671065, -0.13745882423525776, 0.15062188626810288, 0.18614558935223613, 0.07012316482481158, 0.1477221188445886, -0.39534319284333225, -0.17068187529609227, 0.11195921623342049, 0.07611564707864697, 0.044533655761673195, -0.040607299493179504, -0.3082066332475127, 0.08042284875894741, -0.17689872225552486, -0.1677101867444435, 0.004342251893831417, 0.06103656138293445, -0.038248310408865414, -0.229248460692664, 0.008423487847115515, 0.1209394049559099, 0.11357364552047026, -0.029260868233298726, -0.0804301117217013, -0.09106807288480923, 0.08077190896680501, -0.0163093344065904, 0.03618937219289364, 0.06425071755681226, -0.09117520669193861, -0.1509841184306424, 0.43004361318890005, -0.040348144936918594, -0.21444968056069533, 0.11713923987311621, -0.11771201510176373, -0.16139825723075774, 0.0964861376657306, 0.10193898227104607, 0.15178242952970322, -0.08756324640125968, 0.20865488209892646, -0.14105740545589165, 0.10791452892347782, 0.05635968502610922, -0.03936817068218564, 0.16636889654425127, 0.13005224151614433, 0.08032273275845607, 0.14020104671362787, 0.00810897991565677, -0.05875734276681518, -0.3900978837433892, -0.15069369236880448, -0.11555865389527753, 0.06347481352471125, -0.16761646587080273, -0.20794143266781853, 0.4317571919139785, 0.05770868170657195, 0.21556181454191878, 0.09024194242374506, 0.17691752930598645, 0.06549108748246606, 0.07272730140781884, 0.07936173528529859, 0.14749386184970112, 0.2029543503037227, -0.02483935719646979, -0.21399219532819794, -0.04938579561712686, 0.15995148228830658] |
1,802.01122 | Search for lepton-flavor violating decays of heavy resonances and
quantum black holes to e$\mu$ final states in proton-proton collisions at
$\sqrt{s}=$ 13 TeV | A search is reported for heavy resonances decaying into e$\mu$ final states
in proton-proton collisions recorded by the CMS experiment at the CERN LHC at
$\sqrt{s}=$ 13 TeV, corresponding to an integrated luminosity of 35.9
fb$^{-1}$. The search focuses on resonance masses above 200 GeV. With no
evidence found for physics beyond the standard model in the e$\mu$ mass
spectrum, upper limits are set at 95% confidence level on the product of the
cross section and branching fraction for this lepton-flavor violating signal.
Based on these results, resonant $\tau$ sneutrino production in R-parity
violating supersymmetric models is excluded for masses below 1.7 TeV, for
couplings $\lambda_{132} = \lambda_{231} = \lambda'_{311} = 0.01$. Heavy Z$'$
gauge bosons with lepton-flavor violating transitions are excluded for masses
up to 4.4 TeV. The e$\mu$ mass spectrum is also interpreted in terms of
non-resonant contributions from quantum black-hole production in models with
one to six extra spatial dimensions, and lower mass limits are found between
3.6 and 5.6 TeV. In all interpretations used in this analysis, the results of
this search improve previous limits by about 1 TeV. These limits correspond to
the most sensitive values obtained at colliders.
| hep-ex | a search is reported for heavy resonances decaying into emu final states in protonproton collisions recorded by the cms experiment at the cern lhc at sqrts 13 tev corresponding to an integrated luminosity of 359 fb1 the search focuses on resonance masses above 200 gev with no evidence found for physics beyond the standard model in the emu mass spectrum upper limits are set at 95 confidence level on the product of the cross section and branching fraction for this leptonflavor violating signal based on these results resonant tau sneutrino production in rparity violating supersymmetric models is excluded for masses below 17 tev for couplings lambda_132 lambda_231 lambda_311 001 heavy z gauge bosons with leptonflavor violating transitions are excluded for masses up to 44 tev the emu mass spectrum is also interpreted in terms of nonresonant contributions from quantum blackhole production in models with one to six extra spatial dimensions and lower mass limits are found between 36 and 56 tev in all interpretations used in this analysis the results of this search improve previous limits by about 1 tev these limits correspond to the most sensitive values obtained at colliders | [['a', 'search', 'is', 'reported', 'for', 'heavy', 'resonances', 'decaying', 'into', 'emu', 'final', 'states', 'in', 'protonproton', 'collisions', 'recorded', 'by', 'the', 'cms', 'experiment', 'at', 'the', 'cern', 'lhc', 'at', 'sqrts', '13', 'tev', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '359', 'fb1', 'the', 'search', 'focuses', 'on', 'resonance', 'masses', 'above', '200', 'gev', 'with', 'no', 'evidence', 'found', 'for', 'physics', 'beyond', 'the', 'standard', 'model', 'in', 'the', 'emu', 'mass', 'spectrum', 'upper', 'limits', 'are', 'set', 'at', '95', 'confidence', 'level', 'on', 'the', 'product', 'of', 'the', 'cross', 'section', 'and', 'branching', 'fraction', 'for', 'this', 'leptonflavor', 'violating', 'signal', 'based', 'on', 'these', 'results', 'resonant', 'tau', 'sneutrino', 'production', 'in', 'rparity', 'violating', 'supersymmetric', 'models', 'is', 'excluded', 'for', 'masses', 'below', '17', 'tev', 'for', 'couplings', 'lambda_132', 'lambda_231', 'lambda_311', '001', 'heavy', 'z', 'gauge', 'bosons', 'with', 'leptonflavor', 'violating', 'transitions', 'are', 'excluded', 'for', 'masses', 'up', 'to', '44', 'tev', 'the', 'emu', 'mass', 'spectrum', 'is', 'also', 'interpreted', 'in', 'terms', 'of', 'nonresonant', 'contributions', 'from', 'quantum', 'blackhole', 'production', 'in', 'models', 'with', 'one', 'to', 'six', 'extra', 'spatial', 'dimensions', 'and', 'lower', 'mass', 'limits', 'are', 'found', 'between', '36', 'and', '56', 'tev', 'in', 'all', 'interpretations', 'used', 'in', 'this', 'analysis', 'the', 'results', 'of', 'this', 'search', 'improve', 'previous', 'limits', 'by', 'about', '1', 'tev', 'these', 'limits', 'correspond', 'to', 'the', 'most', 'sensitive', 'values', 'obtained', 'at', 'colliders']] | [-0.04967216308324033, 0.2485939671206963, 0.01987590973929284, 0.1831469296730381, -0.015914903983394516, -0.13522019609561228, 0.04938718230105804, 0.2955478052410515, -0.12862689380764347, -0.40358286628380735, 0.037709134630239664, -0.363911053621547, 0.1064727509238242, 0.19859877376361412, 0.110043841052523, 0.0830441145484114, 0.08266468263885125, 0.001478945573871123, -0.02869071471603944, -0.23098236667685845, 0.2340448654840076, 0.07726957938854305, 0.19743762012729618, 0.12863091802090762, 0.02157920346337747, -0.02174576990890931, -0.03852001643192241, -0.12930659276056797, -0.13288957074760122, 0.07253770913883544, 0.23569169778927468, 0.07613967439008659, 0.07791440309015439, -0.3047119722642163, -0.04987119518076763, 0.17983295337236338, 0.1641951672351384, 0.02269062759017849, -0.04678811279975096, -0.37252277067238265, 0.13794448926420685, -0.20314409625914662, -0.10500113708598717, 0.02989486980693479, 0.017218858843292804, -0.12063964383002926, -0.31297549429508126, 0.1394263763818828, -0.06006879278240686, 0.06989234298120248, -0.04260727442414599, -0.24200748095779304, -0.08451359787153358, -0.04694637249501303, 0.11301697767370608, 0.01101662050898588, 0.18690644319545716, -0.13462982138438012, -0.2489778150066218, 0.3474666803333403, -0.06832045136376265, -0.14731913905323266, 0.241252799705414, -0.21045963897399525, -0.1972315086737929, 0.19444959088813196, 0.2842184518998925, 0.028467039209994875, -0.23711527065136173, 0.15745426126553905, 0.01368594179276694, 0.21396969387337486, 0.0997577724369005, 0.08570083908729274, 0.26866110171961716, 0.2267838697830968, 0.02622069605933304, 0.028970493838139016, -0.12278175872919012, -0.04632276169797207, -0.4584737230845271, -0.05949474567983379, -0.06668035496098108, 0.07029725648921002, -0.06926720276045516, -0.007027703131167615, 0.3382735543319599, 0.139183153492458, 0.31804212571141566, 0.05401667640816935, 0.251305057154473, 0.12237719828245897, 0.08893829868843858, 0.06761468135989568, 0.3881495903082628, 0.11976740641786934, 0.14967304554042168, -0.15817177114002604, -0.033198735235813764, 0.04517349630019608] |
1,802.01123 | Strongly interacting dipolar-polaritons | Exciton-polaritons are mutually interacting quantum hybridizations of
confined photons and electronic excitations. Here we demonstrate a system of
optically guided, electrically polarized exciton-polaritons ('dipolaritons')
that displays up to 200-fold enhancement of the polariton-polariton interaction
strength compared to unpolarized polaritons. The magnitude of the dipolar
interaction enhancement can be turned on and off and be easily tuned over a
very wide range by varying the applied polarizing electric-field. The very
large interaction strengths and the very long propagation distances of these
fully-guided dipolaritons open up new opportunities for realizing complex
quantum circuitry and quantum simulators, as well as topological states based
on exciton-polaritons, for which the interactions between polaritons need to be
large and spatially or temporally controlled. The results also raise
fundamental questions on the origin of such large enhancements.
| cond-mat.mes-hall | excitonpolaritons are mutually interacting quantum hybridizations of confined photons and electronic excitations here we demonstrate a system of optically guided electrically polarized excitonpolaritons dipolaritons that displays up to 200fold enhancement of the polaritonpolariton interaction strength compared to unpolarized polaritons the magnitude of the dipolar interaction enhancement can be turned on and off and be easily tuned over a very wide range by varying the applied polarizing electricfield the very large interaction strengths and the very long propagation distances of these fullyguided dipolaritons open up new opportunities for realizing complex quantum circuitry and quantum simulators as well as topological states based on excitonpolaritons for which the interactions between polaritons need to be large and spatially or temporally controlled the results also raise fundamental questions on the origin of such large enhancements | [['excitonpolaritons', 'are', 'mutually', 'interacting', 'quantum', 'hybridizations', 'of', 'confined', 'photons', 'and', 'electronic', 'excitations', 'here', 'we', 'demonstrate', 'a', 'system', 'of', 'optically', 'guided', 'electrically', 'polarized', 'excitonpolaritons', 'dipolaritons', 'that', 'displays', 'up', 'to', '200fold', 'enhancement', 'of', 'the', 'polaritonpolariton', 'interaction', 'strength', 'compared', 'to', 'unpolarized', 'polaritons', 'the', 'magnitude', 'of', 'the', 'dipolar', 'interaction', 'enhancement', 'can', 'be', 'turned', 'on', 'and', 'off', 'and', 'be', 'easily', 'tuned', 'over', 'a', 'very', 'wide', 'range', 'by', 'varying', 'the', 'applied', 'polarizing', 'electricfield', 'the', 'very', 'large', 'interaction', 'strengths', 'and', 'the', 'very', 'long', 'propagation', 'distances', 'of', 'these', 'fullyguided', 'dipolaritons', 'open', 'up', 'new', 'opportunities', 'for', 'realizing', 'complex', 'quantum', 'circuitry', 'and', 'quantum', 'simulators', 'as', 'well', 'as', 'topological', 'states', 'based', 'on', 'excitonpolaritons', 'for', 'which', 'the', 'interactions', 'between', 'polaritons', 'need', 'to', 'be', 'large', 'and', 'spatially', 'or', 'temporally', 'controlled', 'the', 'results', 'also', 'raise', 'fundamental', 'questions', 'on', 'the', 'origin', 'of', 'such', 'large', 'enhancements']] | [-0.14849069097905976, 0.2651310741446566, -0.026189708768646413, 0.058384307133134944, -0.02614003062688623, -0.180439995962751, 0.04174430695878587, 0.4327141735847144, -0.2825647474938007, -0.3287218184762656, -0.005260740858033415, -0.2496982185321665, -0.12222939326658902, 0.26614772486356053, 0.06669340343322865, 0.019083313131343947, 0.029318723520769398, -0.083579893131892, -0.006736898942771115, -0.20129768650025823, 0.2879519059517702, 0.020202621416903512, 0.2975623966772254, 0.16350841557231638, 0.08560413519252641, -0.0027184834461947975, 0.0881600731608364, 0.005519021268168739, -0.06028054976799072, 0.12956151797737595, 0.25120588649892744, -0.049471937101911896, 0.21638461075318877, -0.4678303498644815, -0.19884475036668628, 0.06365722192942287, 0.21869333933446874, 0.17005559352908803, -0.08707496424317504, -0.37163232457499173, -0.0003272197822960772, -0.14911260284743336, -0.11820208595690224, -0.12517697963314925, 0.011967480110452157, 0.05662672877557171, -0.22977921647532273, 0.011195954449552422, 0.02753259152870683, 0.061908107113757334, -0.03653059771479389, -0.04616513072473336, 0.009234776050790913, 0.10712453345551567, -0.009877169013831967, 0.034366979537163535, 0.16252097946026745, -0.17475576339381596, -0.13181116296945847, 0.36860115273112015, -0.11038645979760633, -0.16657362877239668, 0.23966994639504124, -0.10971012472264403, -0.005607910616713208, 0.15313632379993508, 0.21254016033260065, 0.1055511961034102, -0.11170085184203908, 0.04115286889366892, -0.004878760726992474, 0.19140141384672488, 0.06108913907976171, 0.1607205803332807, 0.3066854073427791, 0.166200459595452, 0.028489361495472664, 0.13177757474048743, -0.07244663543515485, -0.10347997029348052, -0.22521177207699808, -0.12116629813703918, -0.183374800683223, 0.10876947063808293, -0.05253481090203281, -0.1587594674255829, 0.3969794876887932, 0.13526144598307477, 0.18454621904782315, -0.05378203317902029, 0.2615343688178605, 0.11977837678557623, 0.11115067557958785, 0.03607788388509044, 0.2904791407207706, 0.17385840630555857, 0.05995594070368815, -0.25369585758118435, 0.014993470165763021, -0.07578274363276455] |
1,802.01124 | Wildly perturbed manifolds: norm resolvent and spectral convergence | Since the publication of the important work of Rauch and Taylor (Potential
and scattering theory on wildly perturbed domains, JFA, 1975) a lot has been
done to analyse wild perturbations of the Laplace operator. Here we present
results concerning the norm convergence of the resolvent. We consider a (not
necessarily compact) manifold with many small balls removed, the number of
balls can increase as the radius is shrinking, the number of balls can also be
infinite. If the distance of the balls shrinks less fast than the radius, then
we show that the Neumann Laplacian converges to the unperturbed Laplacian,
i.e., the obstacles vanish. In the Dirichlet case, we have two cases: if the
balls are too sparse, the limit operator is again the unperturbed one, while if
the balls concentrate at a certain region (they become "solid" in a region),
the limit operator is the Dirichlet Laplacian on the complement outside the
solid region. Our work is based on a norm convergence result for operators
acting in varying Hilbert spaces developed by the second author.
| math.SP math-ph math.FA math.MP | since the publication of the important work of rauch and taylor potential and scattering theory on wildly perturbed domains jfa 1975 a lot has been done to analyse wild perturbations of the laplace operator here we present results concerning the norm convergence of the resolvent we consider a not necessarily compact manifold with many small balls removed the number of balls can increase as the radius is shrinking the number of balls can also be infinite if the distance of the balls shrinks less fast than the radius then we show that the neumann laplacian converges to the unperturbed laplacian ie the obstacles vanish in the dirichlet case we have two cases if the balls are too sparse the limit operator is again the unperturbed one while if the balls concentrate at a certain region they become solid in a region the limit operator is the dirichlet laplacian on the complement outside the solid region our work is based on a norm convergence result for operators acting in varying hilbert spaces developed by the second author | [['since', 'the', 'publication', 'of', 'the', 'important', 'work', 'of', 'rauch', 'and', 'taylor', 'potential', 'and', 'scattering', 'theory', 'on', 'wildly', 'perturbed', 'domains', 'jfa', '1975', 'a', 'lot', 'has', 'been', 'done', 'to', 'analyse', 'wild', 'perturbations', 'of', 'the', 'laplace', 'operator', 'here', 'we', 'present', 'results', 'concerning', 'the', 'norm', 'convergence', 'of', 'the', 'resolvent', 'we', 'consider', 'a', 'not', 'necessarily', 'compact', 'manifold', 'with', 'many', 'small', 'balls', 'removed', 'the', 'number', 'of', 'balls', 'can', 'increase', 'as', 'the', 'radius', 'is', 'shrinking', 'the', 'number', 'of', 'balls', 'can', 'also', 'be', 'infinite', 'if', 'the', 'distance', 'of', 'the', 'balls', 'shrinks', 'less', 'fast', 'than', 'the', 'radius', 'then', 'we', 'show', 'that', 'the', 'neumann', 'laplacian', 'converges', 'to', 'the', 'unperturbed', 'laplacian', 'ie', 'the', 'obstacles', 'vanish', 'in', 'the', 'dirichlet', 'case', 'we', 'have', 'two', 'cases', 'if', 'the', 'balls', 'are', 'too', 'sparse', 'the', 'limit', 'operator', 'is', 'again', 'the', 'unperturbed', 'one', 'while', 'if', 'the', 'balls', 'concentrate', 'at', 'a', 'certain', 'region', 'they', 'become', 'solid', 'in', 'a', 'region', 'the', 'limit', 'operator', 'is', 'the', 'dirichlet', 'laplacian', 'on', 'the', 'complement', 'outside', 'the', 'solid', 'region', 'our', 'work', 'is', 'based', 'on', 'a', 'norm', 'convergence', 'result', 'for', 'operators', 'acting', 'in', 'varying', 'hilbert', 'spaces', 'developed', 'by', 'the', 'second', 'author']] | [-0.10193329149148088, 0.1205876195692161, -0.08793282817119193, 0.05677259713675911, -0.070610160247518, -0.0850578247627709, -0.0022828488402989356, 0.3252933298340808, -0.2542568110008936, -0.20199604323451323, 0.18467068322735775, -0.3297253039199859, -0.10680703572473828, 0.16195667498025365, -0.12831146304283306, 0.05042525708135641, 0.09882724968272007, 0.11182993731927127, -0.06199283030251867, -0.2619949915771775, 0.37805257840558293, 0.021637937956256792, 0.20768420604343357, 0.08074500331845642, 0.04081800851616373, -0.02652507248355753, 3.46675912045281e-05, 0.016678119813222606, -0.14823791952639195, 0.11211473047627475, 0.19320296335577455, 0.05399180058818522, 0.3421931378060518, -0.4255725878366237, -0.20383342360781337, 0.19162971210475502, 0.17463816500094254, 0.03590367784041022, -0.013828415041974618, -0.2704854426966366, 0.08837320387696805, -0.11919677169432609, -0.17992933971320532, -0.04375470416429876, 0.04859993045498744, 0.020298100248262264, -0.270281123214359, 0.06042136913757448, 0.12279183498917105, 0.008354432745942508, -0.08126800375016914, -0.11498050510470587, -0.006161639597848989, 0.1031599350866269, 0.05657911068291552, 0.037065960928554305, 0.1311481761539736, -0.0537447037640959, -0.02390883181148886, 0.3344354241694832, -0.06214296835646978, -0.25069171403513546, 0.14084850650264838, -0.20838625297024424, -0.11036790275829844, 0.07979257052647881, 0.14571567143800415, 0.16230566550406034, -0.08008576537461275, 0.17874263351537098, -0.07428852477063298, 0.11830631341416104, 0.14640982158016413, 0.010464540055677802, 0.12789331732148473, 0.12304901041418569, 0.14985726662648216, 0.14345540395548928, -0.06594595995027869, -0.10932219239707179, -0.3249917814497497, -0.12772875772630374, -0.24833256308656101, 0.04315569846428182, -0.12350905876155593, -0.20672781505643137, 0.34452196151356806, 0.07151310483591673, 0.23855842307040637, 0.06895052714654329, 0.2580188464172269, 0.13295992218693506, 0.05817389115691185, 0.12198183058221317, 0.22526953147660772, 0.15192057110041127, 0.1011285551979778, -0.16689834869562634, 0.018075840097894383, 0.1509480477940418] |
1,802.01125 | The dimension spectrum of graph directed Markov systems | In this paper we study the dimension spectrum of general conformal graph
directed Markov systems modeled by countable state symbolic subshifts of finite
type. We perform a comprehensive study of the dimension spectrum addressing
questions regarding its size and topological structure. As a corollary we
obtain that the dimension spectrum of infinite conformal iterated function
systems is compact and perfect. On the way we revisit the role of the parameter
$\theta$ in graph directed Markov systems and we show that new phenomena arise.
We also establish topological pressure estimates for subsystems in the
abstract setting of symbolic dynamics with countable alphabets. These estimates
play a crucial role in our proofs regarding the dimension spectrum, and they
allow us to study Hausdorff dimension asymptotics for subsystems.
Finally we narrow our focus to the dimension spectrum of conformal iterated
function systems and we prove, among other things, that the iterated function
system resulting from the complex continued fractions algorithm has full
dimension spectrum. We thus give a positive answer to the Texan conjecture for
complex continued fractions.
| math.DS math.CA | in this paper we study the dimension spectrum of general conformal graph directed markov systems modeled by countable state symbolic subshifts of finite type we perform a comprehensive study of the dimension spectrum addressing questions regarding its size and topological structure as a corollary we obtain that the dimension spectrum of infinite conformal iterated function systems is compact and perfect on the way we revisit the role of the parameter theta in graph directed markov systems and we show that new phenomena arise we also establish topological pressure estimates for subsystems in the abstract setting of symbolic dynamics with countable alphabets these estimates play a crucial role in our proofs regarding the dimension spectrum and they allow us to study hausdorff dimension asymptotics for subsystems finally we narrow our focus to the dimension spectrum of conformal iterated function systems and we prove among other things that the iterated function system resulting from the complex continued fractions algorithm has full dimension spectrum we thus give a positive answer to the texan conjecture for complex continued fractions | [['in', 'this', 'paper', 'we', 'study', 'the', 'dimension', 'spectrum', 'of', 'general', 'conformal', 'graph', 'directed', 'markov', 'systems', 'modeled', 'by', 'countable', 'state', 'symbolic', 'subshifts', 'of', 'finite', 'type', 'we', 'perform', 'a', 'comprehensive', 'study', 'of', 'the', 'dimension', 'spectrum', 'addressing', 'questions', 'regarding', 'its', 'size', 'and', 'topological', 'structure', 'as', 'a', 'corollary', 'we', 'obtain', 'that', 'the', 'dimension', 'spectrum', 'of', 'infinite', 'conformal', 'iterated', 'function', 'systems', 'is', 'compact', 'and', 'perfect', 'on', 'the', 'way', 'we', 'revisit', 'the', 'role', 'of', 'the', 'parameter', 'theta', 'in', 'graph', 'directed', 'markov', 'systems', 'and', 'we', 'show', 'that', 'new', 'phenomena', 'arise', 'we', 'also', 'establish', 'topological', 'pressure', 'estimates', 'for', 'subsystems', 'in', 'the', 'abstract', 'setting', 'of', 'symbolic', 'dynamics', 'with', 'countable', 'alphabets', 'these', 'estimates', 'play', 'a', 'crucial', 'role', 'in', 'our', 'proofs', 'regarding', 'the', 'dimension', 'spectrum', 'and', 'they', 'allow', 'us', 'to', 'study', 'hausdorff', 'dimension', 'asymptotics', 'for', 'subsystems', 'finally', 'we', 'narrow', 'our', 'focus', 'to', 'the', 'dimension', 'spectrum', 'of', 'conformal', 'iterated', 'function', 'systems', 'and', 'we', 'prove', 'among', 'other', 'things', 'that', 'the', 'iterated', 'function', 'system', 'resulting', 'from', 'the', 'complex', 'continued', 'fractions', 'algorithm', 'has', 'full', 'dimension', 'spectrum', 'we', 'thus', 'give', 'a', 'positive', 'answer', 'to', 'the', 'texan', 'conjecture', 'for', 'complex', 'continued', 'fractions']] | [-0.1468038390181161, 0.09838043391335241, -0.0814937026207817, 0.09728532422858494, -0.08153108116935125, -0.1141839249410142, 0.05102425446029988, 0.34424986490101994, -0.2798077089701319, -0.21611970920522494, 0.10720904077531705, -0.2626488847944393, -0.18334715781952843, 0.19400699201759872, -0.05402921050139328, 0.06543688598622825, 0.059618307004586375, 0.04708549294128329, -0.043166824397042225, -0.24513957510339685, 0.40176648240745194, 0.00987644816063687, 0.21860485189010914, 0.06768225245284794, 0.08705461446474168, 0.041255784623763773, -0.04771651211194694, 0.03735331516049203, -0.21117418331033705, 0.12501346663138346, 0.2790161644311986, 0.13045569636120363, 0.23903761006725802, -0.3663829170146036, -0.21375649912020556, 0.17013102867265886, 0.14952220406715128, 0.07652410941904988, -0.00814589889166106, -0.2739607330971001, 0.09572483541379714, -0.18284938355035352, -0.19363146631486028, -0.11081297415236396, 0.036351091442522646, -0.01688495592612923, -0.23814812496012805, 0.040388407459818414, 0.1470747771726429, 0.10006769051796746, -0.05466085930432504, -0.07539250814066879, 0.007360254454522811, 0.15534622947506113, 0.003962311264995046, -0.027337975202572543, 0.09076865448552215, -0.0972734615745202, -0.15543440918454193, 0.33572587491034517, -0.04911974788243326, -0.20411459070726715, 0.19510782530381418, -0.18106173006309217, -0.21225692631794546, 0.08775724914599338, 0.19765545416023883, 0.11802393304660445, -0.06159014086775621, 0.16144654028292948, -0.0892062127247624, 0.1756427372516743, 0.0490403153462571, 0.08792834254898313, 0.156904230600801, 0.12292718867926548, 0.11663578085108907, 0.20355585211889293, 0.025629249606120945, -0.09598277164181566, -0.2850046574510099, -0.18654370832192743, -0.14506448586685475, 0.1087976417174073, -0.11905113335967468, -0.1907979824028952, 0.38884470131162596, 0.12528714130442903, 0.19562625868149616, 0.12807258595337814, 0.24649017843706855, 0.13328782283020574, 0.012854109812613534, 0.07087391236405244, 0.1320346838797325, 0.1727845941820107, 0.07418503422603204, -0.1755908326414446, 0.006135655518878123, 0.165225382375092] |
1,802.01126 | Kostant, Steinberg, and the Stokes matrices of the tt*-Toda equations | We propose a Lie-theoretic definition of the tt*-Toda equations for any
complex simple Lie algebra $\mathfrak{g}$, based on the concept of
topological-antitopological fusion which was introduced by Cecotti and Vafa.
Our main result concerns the Stokes data of a certain meromorphic connection,
whose isomonodromic deformations are controlled by these equations. Exploiting
a framework introduced by Boalch, we show that this data has a remarkable
structure, which can be described using Kostant's theory of Cartan subalgebras
in apposition and Steinberg's theory of conjugacy classes of regular elements.
A by-product of this is a convenient visualization of the orbit structure of
the roots under the action of a Coxeter element. As an application, we compute
canonical Stokes data of certain solutions of the tt*-Toda equations in terms
of their asymptotics.
| math.DG hep-th | we propose a lietheoretic definition of the tttoda equations for any complex simple lie algebra mathfrakg based on the concept of topologicalantitopological fusion which was introduced by cecotti and vafa our main result concerns the stokes data of a certain meromorphic connection whose isomonodromic deformations are controlled by these equations exploiting a framework introduced by boalch we show that this data has a remarkable structure which can be described using kostants theory of cartan subalgebras in apposition and steinbergs theory of conjugacy classes of regular elements a byproduct of this is a convenient visualization of the orbit structure of the roots under the action of a coxeter element as an application we compute canonical stokes data of certain solutions of the tttoda equations in terms of their asymptotics | [['we', 'propose', 'a', 'lietheoretic', 'definition', 'of', 'the', 'tttoda', 'equations', 'for', 'any', 'complex', 'simple', 'lie', 'algebra', 'mathfrakg', 'based', 'on', 'the', 'concept', 'of', 'topologicalantitopological', 'fusion', 'which', 'was', 'introduced', 'by', 'cecotti', 'and', 'vafa', 'our', 'main', 'result', 'concerns', 'the', 'stokes', 'data', 'of', 'a', 'certain', 'meromorphic', 'connection', 'whose', 'isomonodromic', 'deformations', 'are', 'controlled', 'by', 'these', 'equations', 'exploiting', 'a', 'framework', 'introduced', 'by', 'boalch', 'we', 'show', 'that', 'this', 'data', 'has', 'a', 'remarkable', 'structure', 'which', 'can', 'be', 'described', 'using', 'kostants', 'theory', 'of', 'cartan', 'subalgebras', 'in', 'apposition', 'and', 'steinbergs', 'theory', 'of', 'conjugacy', 'classes', 'of', 'regular', 'elements', 'a', 'byproduct', 'of', 'this', 'is', 'a', 'convenient', 'visualization', 'of', 'the', 'orbit', 'structure', 'of', 'the', 'roots', 'under', 'the', 'action', 'of', 'a', 'coxeter', 'element', 'as', 'an', 'application', 'we', 'compute', 'canonical', 'stokes', 'data', 'of', 'certain', 'solutions', 'of', 'the', 'tttoda', 'equations', 'in', 'terms', 'of', 'their', 'asymptotics']] | [-0.1661646450374974, 0.04480546070874425, -0.10611768880335148, 0.029730328306868614, -0.12035220078541897, -0.09394335908655194, -0.006626517552831501, 0.2788859658612637, -0.3096945374418283, -0.22926218336942839, 0.10953253406660224, -0.2123441546355025, -0.21734436593487771, 0.18854676364935585, -0.13214859726576833, 0.045905627754109446, 0.07798426287263283, 0.0612959006211895, -0.11712735981745936, -0.228509560929524, 0.4027062973982538, -0.0032632363072480075, 0.23919282160204602, 0.031339985374415846, 0.1634711656397485, 0.007599462809594115, -0.03339796119325911, 0.01346750102675287, -0.13144334382224088, 0.16824964249826735, 0.28223679371694743, 0.11087804252701972, 0.2145032909738802, -0.3748912490736984, -0.14718287662253715, 0.0990756737664924, 0.13410341184862773, 0.07080361393855128, -0.04651260793343681, -0.3093042229702405, 0.08543925749279424, -0.20296672607946675, -0.1908535621514602, -0.10079420673810091, 0.03801971243228763, 0.03701947522131377, -0.24478026587257773, 0.026051711647596676, 0.10004508597012318, 0.11498184354422847, -0.07617885505715094, -0.07397873374793562, -0.04650278633926064, 0.07435288216220215, -0.0022042498167138547, -0.017923439816513564, 0.05951507131703693, -0.09657866802444914, -0.13856303176726215, 0.39898025545699056, -0.04015580334998958, -0.25132117557404854, 0.1294550859802257, -0.12058331868320238, -0.15827881448421977, 0.08995723818952683, 0.11536388313470525, 0.16572613477910636, -0.13559024837832112, 0.18070958096274126, -0.13268153304670705, 0.05795909005973954, 0.09414732431105222, -0.05233602768203127, 0.12589727855629462, 0.1264000740738993, 0.0068243319874454755, 0.127140529269127, 0.025766890901650186, -0.0439078666131536, -0.3530928841937566, -0.183337256537925, -0.12853906386681047, 0.10998126557569776, -0.11823265451289444, -0.19925759569377988, 0.434113577590324, 0.09939423231116962, 0.19763321199297934, 0.06105207059408713, 0.19263977981972857, 0.14697484929092752, 0.09129330738323915, 0.03147666241071079, 0.1574608612791053, 0.23957841622723208, 0.040657552101038164, -0.1916170663353114, -0.006248560963285854, 0.22364257847675617] |
1,802.01127 | Testing Asteroseismic Radii of Dwarfs and Subgiants with Kepler and Gaia | We test asteroseismic radii of Kepler main-sequence and subgiant stars by
deriving their parallaxes which are compared with those of the first Gaia data
release. We compute radii based on the asteroseismic scaling relations as well
as by fitting observed oscillation frequencies to stellar models for a subset
of the sample, and test the impact of using effective temperatures from either
spectroscopy or the infrared flux method. An offset of 3%, showing no
dependency on any stellar parameters, is found between seismic parallaxes
derived from frequency modelling and those from Gaia. For parallaxes based on
radii from the scaling relations, a smaller offset is found on average;
however, the offset becomes temperature dependent which we interpret as
problems with the scaling relations at high stellar temperatures. Using the
hotter infrared flux method temperature scale, there is no indication that
radii from the scaling relations are inaccurate by more than about 5%. Taking
the radii and masses from the modelling of individual frequencies as reference
values, we seek to correct the scaling relations for the observed temperature
trend. This analysis indicates that the scaling relations systematically
overestimate radii and masses at high temperatures, and that they are accurate
to within 5% in radius and 13% in mass for main-sequence stars with
temperatures below 6400 K. However, further analysis is required to test the
validity of the corrections on a star-by-star basis and for more evolved stars.
| astro-ph.SR | we test asteroseismic radii of kepler mainsequence and subgiant stars by deriving their parallaxes which are compared with those of the first gaia data release we compute radii based on the asteroseismic scaling relations as well as by fitting observed oscillation frequencies to stellar models for a subset of the sample and test the impact of using effective temperatures from either spectroscopy or the infrared flux method an offset of 3 showing no dependency on any stellar parameters is found between seismic parallaxes derived from frequency modelling and those from gaia for parallaxes based on radii from the scaling relations a smaller offset is found on average however the offset becomes temperature dependent which we interpret as problems with the scaling relations at high stellar temperatures using the hotter infrared flux method temperature scale there is no indication that radii from the scaling relations are inaccurate by more than about 5 taking the radii and masses from the modelling of individual frequencies as reference values we seek to correct the scaling relations for the observed temperature trend this analysis indicates that the scaling relations systematically overestimate radii and masses at high temperatures and that they are accurate to within 5 in radius and 13 in mass for mainsequence stars with temperatures below 6400 k however further analysis is required to test the validity of the corrections on a starbystar basis and for more evolved stars | [['we', 'test', 'asteroseismic', 'radii', 'of', 'kepler', 'mainsequence', 'and', 'subgiant', 'stars', 'by', 'deriving', 'their', 'parallaxes', 'which', 'are', 'compared', 'with', 'those', 'of', 'the', 'first', 'gaia', 'data', 'release', 'we', 'compute', 'radii', 'based', 'on', 'the', 'asteroseismic', 'scaling', 'relations', 'as', 'well', 'as', 'by', 'fitting', 'observed', 'oscillation', 'frequencies', 'to', 'stellar', 'models', 'for', 'a', 'subset', 'of', 'the', 'sample', 'and', 'test', 'the', 'impact', 'of', 'using', 'effective', 'temperatures', 'from', 'either', 'spectroscopy', 'or', 'the', 'infrared', 'flux', 'method', 'an', 'offset', 'of', '3', 'showing', 'no', 'dependency', 'on', 'any', 'stellar', 'parameters', 'is', 'found', 'between', 'seismic', 'parallaxes', 'derived', 'from', 'frequency', 'modelling', 'and', 'those', 'from', 'gaia', 'for', 'parallaxes', 'based', 'on', 'radii', 'from', 'the', 'scaling', 'relations', 'a', 'smaller', 'offset', 'is', 'found', 'on', 'average', 'however', 'the', 'offset', 'becomes', 'temperature', 'dependent', 'which', 'we', 'interpret', 'as', 'problems', 'with', 'the', 'scaling', 'relations', 'at', 'high', 'stellar', 'temperatures', 'using', 'the', 'hotter', 'infrared', 'flux', 'method', 'temperature', 'scale', 'there', 'is', 'no', 'indication', 'that', 'radii', 'from', 'the', 'scaling', 'relations', 'are', 'inaccurate', 'by', 'more', 'than', 'about', '5', 'taking', 'the', 'radii', 'and', 'masses', 'from', 'the', 'modelling', 'of', 'individual', 'frequencies', 'as', 'reference', 'values', 'we', 'seek', 'to', 'correct', 'the', 'scaling', 'relations', 'for', 'the', 'observed', 'temperature', 'trend', 'this', 'analysis', 'indicates', 'that', 'the', 'scaling', 'relations', 'systematically', 'overestimate', 'radii', 'and', 'masses', 'at', 'high', 'temperatures', 'and', 'that', 'they', 'are', 'accurate', 'to', 'within', '5', 'in', 'radius', 'and', '13', 'in', 'mass', 'for', 'mainsequence', 'stars', 'with', 'temperatures', 'below', '6400', 'k', 'however', 'further', 'analysis', 'is', 'required', 'to', 'test', 'the', 'validity', 'of', 'the', 'corrections', 'on', 'a', 'starbystar', 'basis', 'and', 'for', 'more', 'evolved', 'stars']] | [-0.02689747544986374, 0.1505592943769211, -0.0950880360413105, 0.11337000189814717, -0.08273368404900774, -0.06297408456002619, 0.11726799451726232, 0.3983337616864988, -0.14694283564594832, -0.40430762441234386, 0.07737953891294037, -0.32323094745107156, -0.025365723194950757, 0.2859566533571466, -0.021227869681736573, 0.021457506174858202, 0.06077846172463862, 0.001389767704135243, -0.10888110482520325, -0.18388969342898023, 0.3051134201797082, 0.06325948016935999, 0.19745357645318865, -0.028948306607359902, 0.0256834520864241, -0.10068389622970148, -0.07175376737846974, 0.033839816548564335, -0.17135996999800518, 0.056747916677689296, 0.21895206042318022, 0.10679387110780846, 0.1967610206841392, -0.3402142679555022, -0.18574243421279923, 0.052416639723517795, 0.15984004729308504, 0.07948700792658975, -0.032227300905171744, -0.231586847721817, 0.07117285225045016, -0.15230385163164836, -0.15987656551309207, -0.03793571367067226, 0.0878976153764636, 0.04034008400494907, -0.2592640727520623, 0.1421067499197732, 0.005016826380024406, 0.1552732174165864, -0.13234438400002235, -0.1878295092308458, -0.07238922919780809, 0.13876506571553926, 0.030767229426295516, 0.034323369309385406, 0.12809758104899147, -0.09031946009540177, -0.008084462670252679, 0.4000221533819716, -0.0706938900512351, -0.08256314940592076, 0.19742508040483486, -0.18286296046200268, -0.11948434203650128, 0.09734348281029057, 0.1560566846697413, 0.10147904295553552, -0.19072832781573798, -0.015176956746925381, 0.045375526770255824, 0.23552876748540935, 0.09431355572503773, 0.04317908179252706, 0.2904637305937866, 0.1352581728958188, 0.023948892365467357, 0.04399837326416944, -0.18113759480753636, -0.034729504208774006, -0.25815611076244016, -0.04635850380594654, -0.15542507645218295, 0.04464524414568664, -0.16571594715821855, -0.10864146172485135, 0.3009886330370098, 0.19009753724639403, 0.2267386693626325, 0.11922947269804934, 0.3097082787966158, 0.13385645450152298, 0.1534112202707044, 0.12533808322623372, 0.3014685864025291, 0.1724518937147916, 0.07019533610882911, -0.24861550317046807, 0.042394126069910346, 0.024008549210873056] |
1,802.01128 | The Discontinuous Asymptotic Telegrapher's Equation ($P_1$)
Approximation | Modeling the propagation of radiative heat-waves in optically thick material
using a diffusive approximation is a well-known problem. In optically thin
material, classic methods, such as classic diffusion or classic $P_1$, yield
the wrong heat wave propagation behavior, and higher order approximation might
be required, making the solution harder to obtain. The asymptotic $P_1$
approximation [Heizler, {\em NSE} 166, 17 (2010)] yields the correct particle
velocity but fails to model the correct behavior in highly anisotropic media,
such as problems that involve sharp boundary between media or strong sources.
However, the solution for the two-region Milne problem of two adjacent
half-spaces divided by a sharp boundary, yields a discontinuity in the
asymptotic solutions, that makes it possible to solve steady-state problems,
especially in neutronics. In this work we expand the time-dependent asymptotic
$P_1$ approximation to a highly anisotropic media, using the discontinuity jump
conditions of the energy density, yielding a modified discontinuous $P_1$
equations in general geometry. We introduce numerical solutions for two
fundamental benchmarks in plane symmetry. The results thus obtained are more
accurate than those attained by other methods, such as Flux-Limiters or
Variable Eddington Factor.
| physics.comp-ph cond-mat.stat-mech | modeling the propagation of radiative heatwaves in optically thick material using a diffusive approximation is a wellknown problem in optically thin material classic methods such as classic diffusion or classic p_1 yield the wrong heat wave propagation behavior and higher order approximation might be required making the solution harder to obtain the asymptotic p_1 approximation heizler em nse 166 17 2010 yields the correct particle velocity but fails to model the correct behavior in highly anisotropic media such as problems that involve sharp boundary between media or strong sources however the solution for the tworegion milne problem of two adjacent halfspaces divided by a sharp boundary yields a discontinuity in the asymptotic solutions that makes it possible to solve steadystate problems especially in neutronics in this work we expand the timedependent asymptotic p_1 approximation to a highly anisotropic media using the discontinuity jump conditions of the energy density yielding a modified discontinuous p_1 equations in general geometry we introduce numerical solutions for two fundamental benchmarks in plane symmetry the results thus obtained are more accurate than those attained by other methods such as fluxlimiters or variable eddington factor | [['modeling', 'the', 'propagation', 'of', 'radiative', 'heatwaves', 'in', 'optically', 'thick', 'material', 'using', 'a', 'diffusive', 'approximation', 'is', 'a', 'wellknown', 'problem', 'in', 'optically', 'thin', 'material', 'classic', 'methods', 'such', 'as', 'classic', 'diffusion', 'or', 'classic', 'p_1', 'yield', 'the', 'wrong', 'heat', 'wave', 'propagation', 'behavior', 'and', 'higher', 'order', 'approximation', 'might', 'be', 'required', 'making', 'the', 'solution', 'harder', 'to', 'obtain', 'the', 'asymptotic', 'p_1', 'approximation', 'heizler', 'em', 'nse', '166', '17', '2010', 'yields', 'the', 'correct', 'particle', 'velocity', 'but', 'fails', 'to', 'model', 'the', 'correct', 'behavior', 'in', 'highly', 'anisotropic', 'media', 'such', 'as', 'problems', 'that', 'involve', 'sharp', 'boundary', 'between', 'media', 'or', 'strong', 'sources', 'however', 'the', 'solution', 'for', 'the', 'tworegion', 'milne', 'problem', 'of', 'two', 'adjacent', 'halfspaces', 'divided', 'by', 'a', 'sharp', 'boundary', 'yields', 'a', 'discontinuity', 'in', 'the', 'asymptotic', 'solutions', 'that', 'makes', 'it', 'possible', 'to', 'solve', 'steadystate', 'problems', 'especially', 'in', 'neutronics', 'in', 'this', 'work', 'we', 'expand', 'the', 'timedependent', 'asymptotic', 'p_1', 'approximation', 'to', 'a', 'highly', 'anisotropic', 'media', 'using', 'the', 'discontinuity', 'jump', 'conditions', 'of', 'the', 'energy', 'density', 'yielding', 'a', 'modified', 'discontinuous', 'p_1', 'equations', 'in', 'general', 'geometry', 'we', 'introduce', 'numerical', 'solutions', 'for', 'two', 'fundamental', 'benchmarks', 'in', 'plane', 'symmetry', 'the', 'results', 'thus', 'obtained', 'are', 'more', 'accurate', 'than', 'those', 'attained', 'by', 'other', 'methods', 'such', 'as', 'fluxlimiters', 'or', 'variable', 'eddington', 'factor']] | [-0.09738373244492546, 0.07887793472285735, -0.08367451039058241, 0.10288581646665095, -0.09550200087481482, -0.1516064411841014, 0.03772094472744726, 0.3676648472789376, -0.26922704919644774, -0.28822037089556296, 0.1020013342884165, -0.2825400417043085, -0.11048161589919046, 0.20428594021826366, -0.024532161775060037, 0.10117594103881701, 0.0387643392186582, -0.028199881043803086, -0.07900836672988736, -0.1688907290662559, 0.276162053002692, 0.003696298407251264, 0.2765738919930144, 0.010043168936004454, 0.06278493561667395, -0.027024423438348474, 0.005461105695840987, 0.054404707730095335, -0.14755174760212736, 0.07195507490106007, 0.25992936284883933, 0.04195971182114221, 0.2721953701207982, -0.45022227179463253, -0.25362845932576744, 0.07237777644320127, 0.16612394180716597, 0.09467285494618914, -0.03549989028673502, -0.22865256443769139, 0.04053507177072034, -0.1253654453878535, -0.18341768383596935, -0.04191322250411233, 0.0017006807564633256, 0.016162456914080296, -0.28955796251059784, 0.1521762583310153, 0.09502050934737936, -0.005840492868088783, -0.07077949527865227, -0.12073592446871441, 0.01896898158113746, 0.06245541678776437, 0.06733056310163363, 0.007556549628280143, 0.078803256029552, -0.14458844646497723, -0.0672365467382824, 0.40414196567580024, -0.06870889346052103, -0.2218929704734408, 0.2012359752378272, -0.12270354914178892, -0.061729078963000505, 0.17722099401893462, 0.15373299262837511, 0.17689474325883575, -0.12938986570489677, 0.044289546769378796, -0.02208579344266246, 0.13625907808552212, 0.10179565552955762, -0.020015772609824543, 0.13588977266690708, 0.11661381283426349, 0.07255717752411722, 0.12994680501474565, -0.059019910024708126, -0.1044558012415406, -0.2842884358724599, -0.1287017906224573, -0.15018304177736713, 0.07092791320380996, -0.14808113836018147, -0.21654553776376576, 0.3230759561295935, 0.142237985613731, 0.17219948326362008, 0.0010120133436060845, 0.29294622699197204, 0.15580877278530522, -0.022861384379211813, 0.12670570336292214, 0.2672312068927256, 0.12895109058596832, 0.11278552230440371, -0.19142708757812565, 0.08613765725920744, 0.09984810081718958] |
1,802.01129 | Searching for Representative Modes on Hypergraphs for Robust Geometric
Model Fitting | In this paper, we propose a simple and effective {geometric} model fitting
method to fit and segment multi-structure data even in the presence of severe
outliers. We cast the task of geometric model fitting as a representative
mode-seeking problem on hypergraphs. Specifically, a hypergraph is firstly
constructed, where the vertices represent model hypotheses and the hyperedges
denote data points. The hypergraph involves higher-order similarities (instead
of pairwise similarities used on a simple graph), and it can characterize
complex relationships between model hypotheses and data points. {In addition,
we develop a hypergraph reduction technique to remove "insignificant" vertices
while retaining as many "significant" vertices as possible in the hypergraph}.
Based on the {simplified hypergraph, we then propose a novel mode-seeking
algorithm to search for representative modes within reasonable time. Finally,
the} proposed mode-seeking algorithm detects modes according to two key
elements, i.e., the weighting scores of vertices and the similarity analysis
between vertices. Overall, the proposed fitting method is able to efficiently
and effectively estimate the number and the parameters of model instances in
the data simultaneously. Experimental results demonstrate that the proposed
method achieves significant superiority over {several} state-of-the-art model
fitting methods on both synthetic data and real images.
| cs.CV | in this paper we propose a simple and effective geometric model fitting method to fit and segment multistructure data even in the presence of severe outliers we cast the task of geometric model fitting as a representative modeseeking problem on hypergraphs specifically a hypergraph is firstly constructed where the vertices represent model hypotheses and the hyperedges denote data points the hypergraph involves higherorder similarities instead of pairwise similarities used on a simple graph and it can characterize complex relationships between model hypotheses and data points in addition we develop a hypergraph reduction technique to remove insignificant vertices while retaining as many significant vertices as possible in the hypergraph based on the simplified hypergraph we then propose a novel modeseeking algorithm to search for representative modes within reasonable time finally the proposed modeseeking algorithm detects modes according to two key elements ie the weighting scores of vertices and the similarity analysis between vertices overall the proposed fitting method is able to efficiently and effectively estimate the number and the parameters of model instances in the data simultaneously experimental results demonstrate that the proposed method achieves significant superiority over several stateoftheart model fitting methods on both synthetic data and real images | [['in', 'this', 'paper', 'we', 'propose', 'a', 'simple', 'and', 'effective', 'geometric', 'model', 'fitting', 'method', 'to', 'fit', 'and', 'segment', 'multistructure', 'data', 'even', 'in', 'the', 'presence', 'of', 'severe', 'outliers', 'we', 'cast', 'the', 'task', 'of', 'geometric', 'model', 'fitting', 'as', 'a', 'representative', 'modeseeking', 'problem', 'on', 'hypergraphs', 'specifically', 'a', 'hypergraph', 'is', 'firstly', 'constructed', 'where', 'the', 'vertices', 'represent', 'model', 'hypotheses', 'and', 'the', 'hyperedges', 'denote', 'data', 'points', 'the', 'hypergraph', 'involves', 'higherorder', 'similarities', 'instead', 'of', 'pairwise', 'similarities', 'used', 'on', 'a', 'simple', 'graph', 'and', 'it', 'can', 'characterize', 'complex', 'relationships', 'between', 'model', 'hypotheses', 'and', 'data', 'points', 'in', 'addition', 'we', 'develop', 'a', 'hypergraph', 'reduction', 'technique', 'to', 'remove', 'insignificant', 'vertices', 'while', 'retaining', 'as', 'many', 'significant', 'vertices', 'as', 'possible', 'in', 'the', 'hypergraph', 'based', 'on', 'the', 'simplified', 'hypergraph', 'we', 'then', 'propose', 'a', 'novel', 'modeseeking', 'algorithm', 'to', 'search', 'for', 'representative', 'modes', 'within', 'reasonable', 'time', 'finally', 'the', 'proposed', 'modeseeking', 'algorithm', 'detects', 'modes', 'according', 'to', 'two', 'key', 'elements', 'ie', 'the', 'weighting', 'scores', 'of', 'vertices', 'and', 'the', 'similarity', 'analysis', 'between', 'vertices', 'overall', 'the', 'proposed', 'fitting', 'method', 'is', 'able', 'to', 'efficiently', 'and', 'effectively', 'estimate', 'the', 'number', 'and', 'the', 'parameters', 'of', 'model', 'instances', 'in', 'the', 'data', 'simultaneously', 'experimental', 'results', 'demonstrate', 'that', 'the', 'proposed', 'method', 'achieves', 'significant', 'superiority', 'over', 'several', 'stateoftheart', 'model', 'fitting', 'methods', 'on', 'both', 'synthetic', 'data', 'and', 'real', 'images']] | [-0.04888925985222561, -0.012527340273115427, -0.08006203464283865, 0.08303790492059467, -0.09173074569880738, -0.1693046898744888, 0.08811531264168776, 0.40464739202891464, -0.25030413556413433, -0.3846979735971396, 0.043891084485163157, -0.30528699852357705, -0.17990153709493212, 0.13785086621661394, -0.09965858572623669, 0.06585688020065239, 0.13096248310927452, 0.031218026591530397, -0.01780699042810464, -0.24538457010192305, 0.29707779499337117, 0.013508151701871474, 0.2982285074028537, 0.03248787219823343, 0.12176005931947867, 0.01093015371910741, -0.04813226536103529, 0.06908104018785437, -0.10252742841390071, 0.13671172490687433, 0.2395203637597432, 0.18712190023375366, 0.25571984064826114, -0.41659011923937345, -0.19193844709208413, 0.17312952807996815, 0.13466405001323875, 0.08029586615054939, -0.018547407078823477, -0.2686257594353964, 0.09403241396034558, -0.10991287631586419, -0.041507054932284446, -0.12177078198201617, 5.182174406477704e-05, -0.01795397024284627, -0.3244709773375255, 0.03749795512564775, 0.04756503963337547, 0.020903644676147096, -0.03120155577447228, -0.1403153167368292, -0.006007397499394103, 0.09548467486727065, 0.004949091377916124, 0.015268182070766712, 0.07469629347745572, -0.09554478658091782, -0.149216366907811, 0.3816011105874675, -0.06392892241687397, -0.1999901239444319, 0.166143205951684, -0.04670329654271055, -0.152462344427111, 0.09607602594374684, 0.22013157493804567, 0.13343197147095173, -0.14586570979231717, 0.0444064795705911, -0.08676833380013704, 0.15961823339138798, 0.03318298344228922, -0.017061889454741123, 0.14230289007888067, 0.18377089051146003, 0.04582893572035175, 0.157944025368115, -0.12339399810810223, -0.06022058831014198, -0.26727590148791147, -0.09298927160026739, -0.21983942353920122, -0.08208410953517872, -0.1804538544368475, -0.15336171949712848, 0.465656806073671, 0.22183664698837016, 0.24656254331342614, 0.0775734429825659, 0.3454270924970358, 0.046416084067404606, 0.07018293758582829, 0.1010614101580185, 0.14587382689245915, 0.09215418455289237, -0.011196513788074947, -0.18737454164917136, 0.07079811919429083, 0.07691439086262455] |
1,802.0113 | Stability of the 5/2 Fractional Quantum Hall State in a Corbino Disc
Sample with In-plane Electric Fields | Among the various geometries to study the fractional quantum Hall effect in
two dimensional electron gas, the Corbino disc owns the advantage to probe the
bulk properties directly. In this work we explore the influence of in-plane
electric fields on the stability of the 5/2 fractional quantum Hall state
realized in Corbino geometry. The effect of weak electric fields is
investigated at ultra-low temperatures in order to compare with a theoretical
proposal of enhanced Pfaffian state under weak electric fields.
| cond-mat.mes-hall | among the various geometries to study the fractional quantum hall effect in two dimensional electron gas the corbino disc owns the advantage to probe the bulk properties directly in this work we explore the influence of inplane electric fields on the stability of the 52 fractional quantum hall state realized in corbino geometry the effect of weak electric fields is investigated at ultralow temperatures in order to compare with a theoretical proposal of enhanced pfaffian state under weak electric fields | [['among', 'the', 'various', 'geometries', 'to', 'study', 'the', 'fractional', 'quantum', 'hall', 'effect', 'in', 'two', 'dimensional', 'electron', 'gas', 'the', 'corbino', 'disc', 'owns', 'the', 'advantage', 'to', 'probe', 'the', 'bulk', 'properties', 'directly', 'in', 'this', 'work', 'we', 'explore', 'the', 'influence', 'of', 'inplane', 'electric', 'fields', 'on', 'the', 'stability', 'of', 'the', '52', 'fractional', 'quantum', 'hall', 'state', 'realized', 'in', 'corbino', 'geometry', 'the', 'effect', 'of', 'weak', 'electric', 'fields', 'is', 'investigated', 'at', 'ultralow', 'temperatures', 'in', 'order', 'to', 'compare', 'with', 'a', 'theoretical', 'proposal', 'of', 'enhanced', 'pfaffian', 'state', 'under', 'weak', 'electric', 'fields']] | [-0.183278256338599, 0.1648825453943573, -0.04521876496146433, 0.015048702515196055, -0.03329910493921488, -0.0989003210386727, 0.007662624042131938, 0.3476024229079485, -0.2571227854990866, -0.3008296879357658, 0.02524062487646006, -0.23204513855744152, -0.08146401995036286, 0.2078885658760555, 0.010246140684466809, 0.0375566127942875, -0.08986126243544276, -0.014562641617521877, -0.09772206611814908, -0.23811454761307688, 0.31857019090093674, 0.033729077674797735, 0.35243792957626285, 0.05887753813804011, 0.08577484358393121, -0.02272474634228274, 0.0455339931184426, 0.07662029144703411, -0.15065057802712545, 0.05593110768822953, 0.20749228573404252, -0.1272222308063647, 0.21186123546212912, -0.48894650584552435, -0.18841222056648804, 0.02963152445736341, 0.0527570027654292, 0.14378417544794503, -0.061912429654330484, -0.29869992269668727, 0.058105101791443306, -0.15623785363859496, -0.179921515006572, -0.07647846561740153, 0.01391200638609007, -0.05171821611438645, -0.23583207480842247, 0.07860458740906325, 0.06453666533780052, 0.07573469235794619, -0.0869351633475162, -0.10938720035192091, -0.029329473969119134, 0.06435214822122362, 0.03214033049007412, 0.017206328391330315, 0.214286717568757, -0.207199203768414, -0.15914453843142837, 0.30747956385603176, -0.09438149857596727, -0.17863404699310195, 0.17666585609549657, -0.2659219672787003, -0.07285370555473492, 0.11050854652421549, 0.17215808046748862, 0.09209535350091755, -0.114484547090251, 0.12733976433519273, -0.016302458991413006, 0.09821192877716385, 0.04934937015641481, 0.11472314511920559, 0.27621775867883114, 0.12248428657039767, 0.04886923863668926, 0.22641139858751558, -0.14165354914439376, -0.09975549429655076, -0.23669854588224554, -0.200682822446106, -0.18387374152662234, 0.12809112777467818, -0.04134557240759022, -0.15568072923633736, 0.40662592912558465, 0.1927939883862564, 0.14721471111406573, -0.10395848948974162, 0.32590338834561405, 0.13003483791835607, 0.03613522299565375, 0.021156688971677794, 0.29590846989303826, 0.23131566642550752, 0.11823113033315166, -0.34478156166587726, 0.017037576597067526, 0.025592071237042546] |
1,802.01131 | A characteristic energy scale in glasses | Glasses feature a broad distribution of relaxation times and activation
energies without an obvious characteristic scale. At the same time, macroscopic
quantities such as Newtonian viscosity and nonlinear plastic deformation, are
interpreted in terms of a characteristic energy scale, e.g. an effective
temperature-dependent activation energy in Arrhenius relations. Nevertheless,
despite its fundamental importance, such a characteristic energy scale has not
been robustly identified. Inspired by the accumulated evidence regarding the
crucial role played by soft quasilocalized excitations in glassy dynamics, we
propose that the bulk average of the glass response to a localized force dipole
defines such a characteristic energy scale. We show that this characteristic
glassy energy scale features remarkable properties: $(i)$ It increases
dramatically with decreasing temperature of equilibrium supercooled states,
significantly surpassing the corresponding increase in the shear modulus,
dismissing the common view that structural variations in supercooled liquids
upon vitrification are minute $(ii)$ Its variation with annealing and system
size is very similar in magnitude and form to that of the energy of the softest
non-phononic vibrational mode, thus establishing a very unusual relation
between a rare glassy fluctuation and a bulk average $(iii)$ It exhibits
striking dependence on spatial dimensionality and system size, due to the
long-ranged fields associated with quasilocalization, which are speculated to
be related to peculiarities of the glass transition in two dimensions. In
addition, we identify a truly-static growing lengthscale associated with the
characteristic glassy energy scale, and discuss possible connections between
the increase of this energy scale and the slowing down of dynamics near the
glass transition temperature. Open questions and future directions are
discussed.
| cond-mat.soft cond-mat.stat-mech | glasses feature a broad distribution of relaxation times and activation energies without an obvious characteristic scale at the same time macroscopic quantities such as newtonian viscosity and nonlinear plastic deformation are interpreted in terms of a characteristic energy scale eg an effective temperaturedependent activation energy in arrhenius relations nevertheless despite its fundamental importance such a characteristic energy scale has not been robustly identified inspired by the accumulated evidence regarding the crucial role played by soft quasilocalized excitations in glassy dynamics we propose that the bulk average of the glass response to a localized force dipole defines such a characteristic energy scale we show that this characteristic glassy energy scale features remarkable properties i it increases dramatically with decreasing temperature of equilibrium supercooled states significantly surpassing the corresponding increase in the shear modulus dismissing the common view that structural variations in supercooled liquids upon vitrification are minute ii its variation with annealing and system size is very similar in magnitude and form to that of the energy of the softest nonphononic vibrational mode thus establishing a very unusual relation between a rare glassy fluctuation and a bulk average iii it exhibits striking dependence on spatial dimensionality and system size due to the longranged fields associated with quasilocalization which are speculated to be related to peculiarities of the glass transition in two dimensions in addition we identify a trulystatic growing lengthscale associated with the characteristic glassy energy scale and discuss possible connections between the increase of this energy scale and the slowing down of dynamics near the glass transition temperature open questions and future directions are discussed | [['glasses', 'feature', 'a', 'broad', 'distribution', 'of', 'relaxation', 'times', 'and', 'activation', 'energies', 'without', 'an', 'obvious', 'characteristic', 'scale', 'at', 'the', 'same', 'time', 'macroscopic', 'quantities', 'such', 'as', 'newtonian', 'viscosity', 'and', 'nonlinear', 'plastic', 'deformation', 'are', 'interpreted', 'in', 'terms', 'of', 'a', 'characteristic', 'energy', 'scale', 'eg', 'an', 'effective', 'temperaturedependent', 'activation', 'energy', 'in', 'arrhenius', 'relations', 'nevertheless', 'despite', 'its', 'fundamental', 'importance', 'such', 'a', 'characteristic', 'energy', 'scale', 'has', 'not', 'been', 'robustly', 'identified', 'inspired', 'by', 'the', 'accumulated', 'evidence', 'regarding', 'the', 'crucial', 'role', 'played', 'by', 'soft', 'quasilocalized', 'excitations', 'in', 'glassy', 'dynamics', 'we', 'propose', 'that', 'the', 'bulk', 'average', 'of', 'the', 'glass', 'response', 'to', 'a', 'localized', 'force', 'dipole', 'defines', 'such', 'a', 'characteristic', 'energy', 'scale', 'we', 'show', 'that', 'this', 'characteristic', 'glassy', 'energy', 'scale', 'features', 'remarkable', 'properties', 'i', 'it', 'increases', 'dramatically', 'with', 'decreasing', 'temperature', 'of', 'equilibrium', 'supercooled', 'states', 'significantly', 'surpassing', 'the', 'corresponding', 'increase', 'in', 'the', 'shear', 'modulus', 'dismissing', 'the', 'common', 'view', 'that', 'structural', 'variations', 'in', 'supercooled', 'liquids', 'upon', 'vitrification', 'are', 'minute', 'ii', 'its', 'variation', 'with', 'annealing', 'and', 'system', 'size', 'is', 'very', 'similar', 'in', 'magnitude', 'and', 'form', 'to', 'that', 'of', 'the', 'energy', 'of', 'the', 'softest', 'nonphononic', 'vibrational', 'mode', 'thus', 'establishing', 'a', 'very', 'unusual', 'relation', 'between', 'a', 'rare', 'glassy', 'fluctuation', 'and', 'a', 'bulk', 'average', 'iii', 'it', 'exhibits', 'striking', 'dependence', 'on', 'spatial', 'dimensionality', 'and', 'system', 'size', 'due', 'to', 'the', 'longranged', 'fields', 'associated', 'with', 'quasilocalization', 'which', 'are', 'speculated', 'to', 'be', 'related', 'to', 'peculiarities', 'of', 'the', 'glass', 'transition', 'in', 'two', 'dimensions', 'in', 'addition', 'we', 'identify', 'a', 'trulystatic', 'growing', 'lengthscale', 'associated', 'with', 'the', 'characteristic', 'glassy', 'energy', 'scale', 'and', 'discuss', 'possible', 'connections', 'between', 'the', 'increase', 'of', 'this', 'energy', 'scale', 'and', 'the', 'slowing', 'down', 'of', 'dynamics', 'near', 'the', 'glass', 'transition', 'temperature', 'open', 'questions', 'and', 'future', 'directions', 'are', 'discussed']] | [-0.12158461876749767, 0.2323184277052915, -0.10709155111103566, 0.07150503715445555, -0.025234795847526668, -0.11571602794698044, 0.019958015764132142, 0.35058173754640104, -0.3036446972365604, -0.300666865775411, 0.06128868422026492, -0.2797552377587911, -0.14021432266136716, 0.13673133458007325, 0.010671316390278551, 0.036943117567826644, -0.024222898151933667, 0.031691760961125096, -0.08192248480411239, -0.15416871850064842, 0.27820945406424336, 0.08307620836951007, 0.32027605445314705, 0.09881006853447616, 0.08266544166359711, -0.03281051475227231, 0.04478343836010688, 0.070681011657033, -0.15435786731585255, 0.051428824968972935, 0.2472036731443509, 2.361243197369869e-05, 0.24241965908246735, -0.4217225323029032, -0.23081481669479134, 0.0978189057169595, 0.1310855618169929, 0.08183625061020862, -0.03534890814978897, -0.2207801114524376, 0.03223942683469046, -0.10300322921653843, -0.16682166616175725, -0.09298075456877775, 0.07372971676963833, 0.024971893346501572, -0.1816905636120337, 0.16834040501480835, 0.07440149014732786, 0.09307386533879308, -0.10833021620496627, -0.11039430184102843, -0.014703624325303474, 0.08150425994288966, 0.11706746368365588, 0.029819074667157663, 0.19679876391698295, -0.17580095256826925, -0.0673994130514929, 0.36267208151349967, -0.053947081724111216, -0.09316561452578753, 0.2507091191681949, -0.13515529378536018, -0.10822202299360387, 0.20183677124088828, 0.1356318062667428, 0.0479294385004323, -0.11225283325532501, 0.03563610497484192, 0.037242388414487126, 0.2122275793239665, 0.07081901327668068, 0.09727724314187512, 0.23870209566225778, 0.2183323951550957, 0.021802850258113307, 0.13494348922849345, -0.10057009016225382, -0.11903215138260169, -0.2779283928437949, -0.15845113708157, -0.20048232748255637, 0.07723060904550727, -0.11802279333019353, -0.15242797492431814, 0.3941522649529912, 0.1293949554533218, 0.231818269985414, 0.03638279139263569, 0.192694046707016, 0.11146531196506905, 0.10246638421482533, 0.06483201595079718, 0.26965532399745745, 0.1084900775467483, 0.13039390573094628, -0.2991696687037774, 0.0733873108543004, 0.0028367688708275446] |
1,802.01132 | The genealogy of an exactly solvable Ornstein-Uhlenbeck type branching
process with selection | We study the genealogy of a solvable population model with $N$ particles on
the real line which evolves according to a discrete-time branching process with
selection. At each time step, every particle gives birth to children around $a$
times its current position, where $a>0$ is a parameter of the model. Then, the
$N$ rightmost new-born children are selected to form the next generation. We
show that the genealogical trees of the process converge to those of a Beta
coalescent as $N \to \infty$. The process we consider can be seen as a
toy-model version of a continuous-time branching process with selection, in
which particles move according to independent Ornstein-Uhlenbeck processes. The
parameter $a$ is akin to the pulling strength of the Ornstein-Uhlenbeck motion.
| math.PR | we study the genealogy of a solvable population model with n particles on the real line which evolves according to a discretetime branching process with selection at each time step every particle gives birth to children around a times its current position where a0 is a parameter of the model then the n rightmost newborn children are selected to form the next generation we show that the genealogical trees of the process converge to those of a beta coalescent as n to infty the process we consider can be seen as a toymodel version of a continuoustime branching process with selection in which particles move according to independent ornsteinuhlenbeck processes the parameter a is akin to the pulling strength of the ornsteinuhlenbeck motion | [['we', 'study', 'the', 'genealogy', 'of', 'a', 'solvable', 'population', 'model', 'with', 'n', 'particles', 'on', 'the', 'real', 'line', 'which', 'evolves', 'according', 'to', 'a', 'discretetime', 'branching', 'process', 'with', 'selection', 'at', 'each', 'time', 'step', 'every', 'particle', 'gives', 'birth', 'to', 'children', 'around', 'a', 'times', 'its', 'current', 'position', 'where', 'a0', 'is', 'a', 'parameter', 'of', 'the', 'model', 'then', 'the', 'n', 'rightmost', 'newborn', 'children', 'are', 'selected', 'to', 'form', 'the', 'next', 'generation', 'we', 'show', 'that', 'the', 'genealogical', 'trees', 'of', 'the', 'process', 'converge', 'to', 'those', 'of', 'a', 'beta', 'coalescent', 'as', 'n', 'to', 'infty', 'the', 'process', 'we', 'consider', 'can', 'be', 'seen', 'as', 'a', 'toymodel', 'version', 'of', 'a', 'continuoustime', 'branching', 'process', 'with', 'selection', 'in', 'which', 'particles', 'move', 'according', 'to', 'independent', 'ornsteinuhlenbeck', 'processes', 'the', 'parameter', 'a', 'is', 'akin', 'to', 'the', 'pulling', 'strength', 'of', 'the', 'ornsteinuhlenbeck', 'motion']] | [-0.05347914483901719, 0.19138154190609125, -0.08580596609858841, 0.036797868205752364, -0.0744237131533796, -0.15960502322778347, 0.09262598781445162, 0.36745261261618234, -0.2840682164712892, -0.2337378324425923, 0.09568809043157966, -0.28401655912005563, -0.09021958832750172, 0.1201111989680723, -0.022515323376510202, 0.009718679512067266, 0.06712306175585382, 0.10339174363894646, 0.060263728262947465, -0.23482127916408566, 0.25484782179469256, 0.06583874484493844, 0.2014116518808968, -0.08090833301194073, 0.12125256897245602, 0.02281162738270028, 0.0019642052267170775, -0.02552873024523421, -0.1383420448370843, 0.03606031355031622, 0.1845549675143831, 0.11099239956909115, 0.3026124943290057, -0.3511011809197243, -0.1520711069472789, 0.1826677137864678, 0.20162954293494303, 0.1141622626559612, 0.01529666751138563, -0.2983586313202977, 0.05159944620899614, -0.13530177298253704, -0.17260910097388474, 0.05658734956286787, 0.06736470505262052, 0.05564470315632236, -0.32779522129549593, 0.04034815323576937, 0.06980232993610264, -0.028100871399043333, -0.014721626238859585, -0.11323624047189497, -0.03939451660764048, 0.1357836612401818, 0.07105670322293067, 0.03684728836538497, 0.20827060771208802, -0.10005983357067878, -0.1709864095224416, 0.37467987829349875, -0.07631799835348274, -0.22835423665620933, 0.17807712199590434, -0.20114089889504863, -0.16420084560986578, 0.12765135185989906, 0.21346201296380865, 0.12900754034034606, -0.16411960685277374, 0.08536193974702279, -0.030624367760464063, 0.11496472713817668, 0.03521658301853189, -0.05770608283412772, 0.19427123670731256, 0.22612728436697063, 0.06656855447818828, 0.16003730707154495, -0.0727795725025812, -0.14536989429526456, -0.30391554259392245, -0.18336200267379363, -0.16274108462664108, 0.10381349449507832, -0.1278865609651174, -0.1926864710772728, 0.3653463832598664, 0.1567070739517912, 0.296885072518655, 0.13927261592116116, 0.21098531629678194, 0.18104020901198492, 0.012277904034751217, 0.03826529211629697, 0.10411529138502551, 0.12025546329285253, 0.08901318823312962, -0.18711795596542155, 0.09431778415431821, 0.07475172953937596] |
1,802.01133 | Repeat-Accumulate Signal Codes | State-constrained signal codes directly encode modulation signals using
signal processing filters, the coefficients of which are constrained over the
rings of formal power series. Although the performance of signal codes is
defined by these signal filters, optimal filters must be found by brute-force
search in terms of symbol error rate because the asymptotic behavior with
different filters has not been investigated. Moreover, computational complexity
of the conventional BCJR used in the decoder increases exponentially as the
number of output constellations increase. We hence propose a new class of
state-constrained signal codes called repeat-accumulate signal codes (RASCs).
To analyze the asymptotic behavior of these codes, we employ Monte Carlo
density evolution (MC-DE). As a result, the optimum filters can be efficiently
found for given parameters of the encoder. We also introduce a low-complexity
decoding algorithm for RASCs called the extended min-sum (EMS) decoder. The
MC-DE analysis shows that the difference between noise thresholds of RASC and
the Shannon limit is within 0.8 dB. Simulation results moreover show that the
EMS decoder can reduce the computational complexity to less than 25 % of that
of conventional decoder without degrading the performance by more than 1 dB.
| cs.IT math.IT | stateconstrained signal codes directly encode modulation signals using signal processing filters the coefficients of which are constrained over the rings of formal power series although the performance of signal codes is defined by these signal filters optimal filters must be found by bruteforce search in terms of symbol error rate because the asymptotic behavior with different filters has not been investigated moreover computational complexity of the conventional bcjr used in the decoder increases exponentially as the number of output constellations increase we hence propose a new class of stateconstrained signal codes called repeataccumulate signal codes rascs to analyze the asymptotic behavior of these codes we employ monte carlo density evolution mcde as a result the optimum filters can be efficiently found for given parameters of the encoder we also introduce a lowcomplexity decoding algorithm for rascs called the extended minsum ems decoder the mcde analysis shows that the difference between noise thresholds of rasc and the shannon limit is within 08 db simulation results moreover show that the ems decoder can reduce the computational complexity to less than 25 of that of conventional decoder without degrading the performance by more than 1 db | [['stateconstrained', 'signal', 'codes', 'directly', 'encode', 'modulation', 'signals', 'using', 'signal', 'processing', 'filters', 'the', 'coefficients', 'of', 'which', 'are', 'constrained', 'over', 'the', 'rings', 'of', 'formal', 'power', 'series', 'although', 'the', 'performance', 'of', 'signal', 'codes', 'is', 'defined', 'by', 'these', 'signal', 'filters', 'optimal', 'filters', 'must', 'be', 'found', 'by', 'bruteforce', 'search', 'in', 'terms', 'of', 'symbol', 'error', 'rate', 'because', 'the', 'asymptotic', 'behavior', 'with', 'different', 'filters', 'has', 'not', 'been', 'investigated', 'moreover', 'computational', 'complexity', 'of', 'the', 'conventional', 'bcjr', 'used', 'in', 'the', 'decoder', 'increases', 'exponentially', 'as', 'the', 'number', 'of', 'output', 'constellations', 'increase', 'we', 'hence', 'propose', 'a', 'new', 'class', 'of', 'stateconstrained', 'signal', 'codes', 'called', 'repeataccumulate', 'signal', 'codes', 'rascs', 'to', 'analyze', 'the', 'asymptotic', 'behavior', 'of', 'these', 'codes', 'we', 'employ', 'monte', 'carlo', 'density', 'evolution', 'mcde', 'as', 'a', 'result', 'the', 'optimum', 'filters', 'can', 'be', 'efficiently', 'found', 'for', 'given', 'parameters', 'of', 'the', 'encoder', 'we', 'also', 'introduce', 'a', 'lowcomplexity', 'decoding', 'algorithm', 'for', 'rascs', 'called', 'the', 'extended', 'minsum', 'ems', 'decoder', 'the', 'mcde', 'analysis', 'shows', 'that', 'the', 'difference', 'between', 'noise', 'thresholds', 'of', 'rasc', 'and', 'the', 'shannon', 'limit', 'is', 'within', '08', 'db', 'simulation', 'results', 'moreover', 'show', 'that', 'the', 'ems', 'decoder', 'can', 'reduce', 'the', 'computational', 'complexity', 'to', 'less', 'than', '25', 'of', 'that', 'of', 'conventional', 'decoder', 'without', 'degrading', 'the', 'performance', 'by', 'more', 'than', '1', 'db']] | [-0.1414262296038275, 0.04782884510057851, -0.08429583401238809, 0.08985224713483601, -0.030511875558859078, -0.20089346929380172, 0.06049360125203719, 0.3902239138309244, -0.30192795446561893, -0.31584729646278925, 0.13497881694691968, -0.23193888756305137, -0.18062214430723905, 0.19983080981472381, -0.10422936493301696, 0.09428508564127677, 0.05931819085743649, 0.03535657578162576, -0.14173232940457156, -0.28708427923570595, 0.21830128435001597, 0.16976714150307223, 0.29473246143965043, -0.062366755643898514, 0.09235316454566996, -0.01061298570922376, -0.021507760161212135, -0.011357637895124902, -0.11054862663085074, 0.062482226010977596, 0.298877160756054, 0.18686637799596872, 0.24242724518228265, -0.363427255214899, -0.24123581927952342, 0.09858412190257566, 0.18207332270746535, 0.10606134917004356, -0.031190411962769286, -0.2335951939951726, 0.1677932688035071, -0.18826818340628637, 0.02719343398942695, -0.012635277876757202, -0.0525680369531726, 0.05479504608278558, -0.2984942778511002, 0.04633519215998728, 0.04819381237273831, 0.049222530889768565, 0.01822933823075048, -0.15822049139886704, 0.013426041173875448, 0.09540323270436045, 0.0024725421793827134, 0.017312879220665437, 0.10060197407262722, -0.08729536036829127, -0.13846629276367012, 0.3160399125294068, -0.07441479592850427, -0.2154314728826772, 0.1348872439184894, -0.08652625529763547, -0.0520602967683043, 0.21388775977691274, 0.21395530552464337, 0.07353469506344948, -0.1278962887316474, 0.05680151861581552, 0.021908274829187748, 0.24619081246798263, 0.08671044601561473, 0.12385135695230977, 0.11406735377934767, 0.14486970370806052, 0.06292835361914251, 0.19757145030560527, -0.12971902284170841, -0.0759939023321592, -0.235091969761839, -0.12456402036968463, -0.19542914515492843, -0.01717062699734977, -0.12333868538065758, -0.1316217499791525, 0.38462872475054094, 0.17994578709796616, 0.14788098776400949, 0.14205823438449308, 0.31919031470394765, 0.13535412027334784, 0.09305417801482671, 0.14501617386868876, 0.21736864903112824, 0.12744702412308004, 0.05164666866081528, -0.21230495887374534, 0.07779122181163603, 0.06704864811264369] |
1,802.01134 | Twisted cubics on cubic fourfolds and stability conditions | We give an interpretation of the Fano variety of lines on a cubic fourfold
and of the hyperkahler eightfold, constructed by Lehn, Lehn, Sorger and van
Straten from twisted cubic curves in a cubic fourfold non containing a plane,
as moduli spaces of Bridgeland stable objects in the Kuznetsov component. As a
consequence, we reprove the categorical version of Torelli Theorem for cubic
fourfolds, we obtain the identification of the period point of LLSvS eightfold
with that of the Fano variety, and we discuss derived Torelli Theorem for cubic
fourfolds.
| math.AG | we give an interpretation of the fano variety of lines on a cubic fourfold and of the hyperkahler eightfold constructed by lehn lehn sorger and van straten from twisted cubic curves in a cubic fourfold non containing a plane as moduli spaces of bridgeland stable objects in the kuznetsov component as a consequence we reprove the categorical version of torelli theorem for cubic fourfolds we obtain the identification of the period point of llsvs eightfold with that of the fano variety and we discuss derived torelli theorem for cubic fourfolds | [['we', 'give', 'an', 'interpretation', 'of', 'the', 'fano', 'variety', 'of', 'lines', 'on', 'a', 'cubic', 'fourfold', 'and', 'of', 'the', 'hyperkahler', 'eightfold', 'constructed', 'by', 'lehn', 'lehn', 'sorger', 'and', 'van', 'straten', 'from', 'twisted', 'cubic', 'curves', 'in', 'a', 'cubic', 'fourfold', 'non', 'containing', 'a', 'plane', 'as', 'moduli', 'spaces', 'of', 'bridgeland', 'stable', 'objects', 'in', 'the', 'kuznetsov', 'component', 'as', 'a', 'consequence', 'we', 'reprove', 'the', 'categorical', 'version', 'of', 'torelli', 'theorem', 'for', 'cubic', 'fourfolds', 'we', 'obtain', 'the', 'identification', 'of', 'the', 'period', 'point', 'of', 'llsvs', 'eightfold', 'with', 'that', 'of', 'the', 'fano', 'variety', 'and', 'we', 'discuss', 'derived', 'torelli', 'theorem', 'for', 'cubic', 'fourfolds']] | [-0.21503548156679347, -0.01567164384560487, -0.10302494182722287, 0.07573794134044914, -0.09799471748940479, -0.13718047365546227, 0.03906053978573071, 0.2985667341462012, -0.24535227845307817, -0.2504040432068404, 0.10261342077767162, -0.2194010947869889, -0.2059822039825193, 0.25643550736431997, -0.16789176647833895, -0.0506387430588516, 0.00636681099422276, -0.03783899310222837, -0.10791669341505328, -0.37394856489943656, 0.42081801188335327, -0.08113680956453566, 0.2241757633373811, 0.06883766451913319, 0.12710553703808716, 0.0791672211626984, 0.054076646662283206, -0.05559229882161939, -0.17522785196571644, 0.15676058331776535, 0.2883499939664361, 2.8702927481257513e-05, 0.06995555626626095, -0.3285863057950909, -0.1674006217201188, 0.16375674789750508, 0.04728855114702261, 0.13064795958527017, -0.02392623045748581, -0.27678469923230703, 0.07525785675460703, -0.1218156187318977, -0.2643918577278179, -0.12820872336919054, -0.004433506529443384, 0.04829908101139276, -0.14579336840157095, 0.018063782852959266, 0.14346687768826658, 0.18532741622047058, -0.06412281940188887, -0.09434752952140034, -0.16504991320851312, -0.017181609767708887, -0.008763784002460372, 0.0343481814855019, 0.026627598539664503, -0.11955894923277116, -0.12861696519794757, 0.4156905512712645, -0.12372899866464097, -0.11308399891334303, 0.08181934336754965, -0.07943323426722979, -0.1843233768713106, 0.18723641758721865, 0.10523875860832213, 0.1663571320097433, 0.00912528686497486, 0.16115617580264494, -0.10453657398858432, 0.0800489173025505, 0.17821838924389208, -0.04325614147296364, 0.13840936626872738, 0.08467521247443523, 0.07170860125850677, 0.16857445377560876, -0.07360230118632735, -0.019581578370429616, -0.36367826582863927, -0.18151456420048234, -0.10487585991301857, 0.20405035240188493, -0.13216891046564402, -0.2178867585496621, 0.4055472391584281, -0.0751877592855625, 0.23181424762928085, 0.03717087372467759, 0.15730276659622872, 0.006956501683387696, 0.01726372840796634, -0.046534196871301434, 0.19090343010350225, 0.23988381276440837, -0.0030031616883247755, -0.12332464119725536, -0.08396818514997034, 0.24154634856922405] |
1,802.01135 | Uncoded Caching and Cross-level Coded Delivery for Non-uniform File
Popularity | Proactive content caching at user devices and coded delivery is studied
considering a non-uniform file popularity distribution. A novel centralized
uncoded caching and coded delivery scheme, which can be applied to large file
libraries, is proposed. The proposed cross-level coded delivery (CLCD) scheme
is shown to achieve a lower average delivery rate than the state of art. In the
proposed CLCD scheme, the same subpacketization is used for all the files in
the library in order to prevent additional zero-padding in the delivery phase,
and unlike the existing schemes in the literature, two users requesting files
from different popularity groups can be served by the same multicast message in
order to reduce the delivery rate. Simulation results indicate significant
reduction in the average delivery rate for typical Zipf distribution parameter
values.
| cs.IT math.IT | proactive content caching at user devices and coded delivery is studied considering a nonuniform file popularity distribution a novel centralized uncoded caching and coded delivery scheme which can be applied to large file libraries is proposed the proposed crosslevel coded delivery clcd scheme is shown to achieve a lower average delivery rate than the state of art in the proposed clcd scheme the same subpacketization is used for all the files in the library in order to prevent additional zeropadding in the delivery phase and unlike the existing schemes in the literature two users requesting files from different popularity groups can be served by the same multicast message in order to reduce the delivery rate simulation results indicate significant reduction in the average delivery rate for typical zipf distribution parameter values | [['proactive', 'content', 'caching', 'at', 'user', 'devices', 'and', 'coded', 'delivery', 'is', 'studied', 'considering', 'a', 'nonuniform', 'file', 'popularity', 'distribution', 'a', 'novel', 'centralized', 'uncoded', 'caching', 'and', 'coded', 'delivery', 'scheme', 'which', 'can', 'be', 'applied', 'to', 'large', 'file', 'libraries', 'is', 'proposed', 'the', 'proposed', 'crosslevel', 'coded', 'delivery', 'clcd', 'scheme', 'is', 'shown', 'to', 'achieve', 'a', 'lower', 'average', 'delivery', 'rate', 'than', 'the', 'state', 'of', 'art', 'in', 'the', 'proposed', 'clcd', 'scheme', 'the', 'same', 'subpacketization', 'is', 'used', 'for', 'all', 'the', 'files', 'in', 'the', 'library', 'in', 'order', 'to', 'prevent', 'additional', 'zeropadding', 'in', 'the', 'delivery', 'phase', 'and', 'unlike', 'the', 'existing', 'schemes', 'in', 'the', 'literature', 'two', 'users', 'requesting', 'files', 'from', 'different', 'popularity', 'groups', 'can', 'be', 'served', 'by', 'the', 'same', 'multicast', 'message', 'in', 'order', 'to', 'reduce', 'the', 'delivery', 'rate', 'simulation', 'results', 'indicate', 'significant', 'reduction', 'in', 'the', 'average', 'delivery', 'rate', 'for', 'typical', 'zipf', 'distribution', 'parameter', 'values']] | [-0.21787955677551904, 0.0022853597052857394, -0.05841321080865324, 0.02917351200003466, -0.03773632345634491, -0.22163337488232773, 0.13072259344391582, 0.3918703008703021, -0.26433285451385863, -0.32224266947239866, 0.07808689427356301, -0.2675278247731139, -0.07195600816012584, 0.14040391610632108, -0.16423774359733329, 0.09770689054508243, 0.009074962358604105, 0.041726944058440456, -0.045614257678678334, -0.3923796312378127, 0.21013834658114947, 0.11308663646697767, 0.4482802743193253, 0.03484697940275651, 0.03042306349064086, 0.014487469081528658, -0.05266567959284135, -0.04113072303463091, -0.09752126408798635, 0.06862741425207476, 0.355727042627427, 0.22856357043912245, 0.2361219771090866, -0.39346089756997055, -0.2537746874745502, 0.04176968185216651, 0.2089145901620157, 0.11706760322382717, -0.1139366020170553, -0.23944191403629245, 0.17859915862682946, -0.29220273635212995, -0.004442215389856354, 0.01878725231964459, -0.03592053740177044, 0.08583619549523952, -0.33444845595563105, -0.01922872277020022, -0.07753731910628447, -0.009856224247767019, -0.053006405073652126, -0.13214701617699723, 0.0037203635767737563, 0.18129513288898638, 0.036170958317978695, 0.03623190558652661, 0.12338734612720766, -0.0920511856205877, -0.0971005609215692, 0.42910849599008877, -0.03940414923999924, -0.2063875712974127, 0.09474033963967605, -0.047434854996210155, -0.08609091328067142, 0.2256546738745226, 0.2670286119475152, 0.09215330248770788, -0.15969385333763536, -0.025072788348143502, 0.007582069786135541, 0.24365739902669145, 0.12299376471300227, 0.09918103377558579, 0.10154903137897567, 0.1955887998432614, 0.10710450378968561, 0.1300648611125558, -0.058158692418301634, -0.15029115230206025, -0.15862135009753497, -0.17561597416543784, -0.20612687685494419, -0.04775908730866373, -0.14370080977716654, -0.03599454357731878, 0.35102605268604764, 0.1533905586855876, 0.10062910827930814, 0.08549479121981232, 0.41689609834390096, 0.07820932196846679, 0.12550003998443598, 0.17906542949905518, 0.11747251490147716, -0.01567174410339185, 0.18669470777922823, -0.18934480669410075, 0.17079659343278397, 0.040198924028280354] |
1,802.01136 | Capabilities and prospects of the East Asia Very Long Baseline
Interferometry Network | The very long baseline interferometry (VLBI) technique offers angular
resolutions superior to any other instruments at other wavelengths, enabling
unique science applications of high-resolution imaging of radio sources and
high-precision astrometry. The East Asia VLBI Network (EAVN) is a collaborative
effort in the East Asian region. The EAVN currently consists of 21 telescopes
with diverse equipment configurations and frequency setups, allowing flexible
subarrays for specific science projects. The EAVN provides the highest
resolution of 0.5 mas at 22 GHz, allowing the fine imaging of jets in active
galactic nuclei, high-accuracy astrometry of masers and pulsars, and precise
spacecraft positioning. The soon-to-be-operational Five-hundredmeter Aperture
Spherical radio Telescope (FAST) will open a new era for the EAVN. This
state-of-the-art VLBI array also provides easy access to and crucial training
for the burgeoning Asian astronomical community. This Perspective summarizes
the status, capabilities and prospects of the EAVN.
| astro-ph.IM | the very long baseline interferometry vlbi technique offers angular resolutions superior to any other instruments at other wavelengths enabling unique science applications of highresolution imaging of radio sources and highprecision astrometry the east asia vlbi network eavn is a collaborative effort in the east asian region the eavn currently consists of 21 telescopes with diverse equipment configurations and frequency setups allowing flexible subarrays for specific science projects the eavn provides the highest resolution of 05 mas at 22 ghz allowing the fine imaging of jets in active galactic nuclei highaccuracy astrometry of masers and pulsars and precise spacecraft positioning the soontobeoperational fivehundredmeter aperture spherical radio telescope fast will open a new era for the eavn this stateoftheart vlbi array also provides easy access to and crucial training for the burgeoning asian astronomical community this perspective summarizes the status capabilities and prospects of the eavn | [['the', 'very', 'long', 'baseline', 'interferometry', 'vlbi', 'technique', 'offers', 'angular', 'resolutions', 'superior', 'to', 'any', 'other', 'instruments', 'at', 'other', 'wavelengths', 'enabling', 'unique', 'science', 'applications', 'of', 'highresolution', 'imaging', 'of', 'radio', 'sources', 'and', 'highprecision', 'astrometry', 'the', 'east', 'asia', 'vlbi', 'network', 'eavn', 'is', 'a', 'collaborative', 'effort', 'in', 'the', 'east', 'asian', 'region', 'the', 'eavn', 'currently', 'consists', 'of', '21', 'telescopes', 'with', 'diverse', 'equipment', 'configurations', 'and', 'frequency', 'setups', 'allowing', 'flexible', 'subarrays', 'for', 'specific', 'science', 'projects', 'the', 'eavn', 'provides', 'the', 'highest', 'resolution', 'of', '05', 'mas', 'at', '22', 'ghz', 'allowing', 'the', 'fine', 'imaging', 'of', 'jets', 'in', 'active', 'galactic', 'nuclei', 'highaccuracy', 'astrometry', 'of', 'masers', 'and', 'pulsars', 'and', 'precise', 'spacecraft', 'positioning', 'the', 'soontobeoperational', 'fivehundredmeter', 'aperture', 'spherical', 'radio', 'telescope', 'fast', 'will', 'open', 'a', 'new', 'era', 'for', 'the', 'eavn', 'this', 'stateoftheart', 'vlbi', 'array', 'also', 'provides', 'easy', 'access', 'to', 'and', 'crucial', 'training', 'for', 'the', 'burgeoning', 'asian', 'astronomical', 'community', 'this', 'perspective', 'summarizes', 'the', 'status', 'capabilities', 'and', 'prospects', 'of', 'the', 'eavn']] | [-0.10792003752227378, 0.07810261808954493, -0.023915085016743286, 0.02777247544348735, -0.17655770726814554, -0.15015132947974688, 0.04356151214846364, 0.45363490995983563, -0.17408980446919747, -0.3450415788167091, 0.14406663024353542, -0.2501737814709232, -0.023194163371776263, 0.2620555519784143, -0.05173778443632263, 0.013626113734240611, 0.16309235112129392, -0.1305917848725445, -0.03189778186940959, -0.15343792964557798, 0.15392042240583814, 0.23669230470342653, 0.29327890017701613, -0.018870773470400462, 0.15296514156124705, -0.06828196565913675, -0.15091254453376665, -0.055073048184313196, -0.07287742880049285, 0.1443332049920764, 0.3881159008940978, 0.19180037957205848, 0.25169153576030906, -0.37613029176877305, -0.1710295692341438, 0.023861074660598607, 0.11454524635011656, 0.034263938512340504, 0.0027008468213562784, -0.35012202347478977, -0.02098813618067652, -0.2197248654218612, -0.2360745235053184, 0.010677606597627428, 0.05422689811280974, 0.050025422946660666, -0.21204748141483268, 0.0026964936802290717, -0.09017415301405363, 0.14621284091560222, -0.06945947451530012, -0.16730972425035245, 0.07789145725521981, 0.1955300057502268, -0.0526115474196711, 0.09232203069084383, 0.09203691965529134, -0.14151735689614775, -0.12972427253982613, 0.3628650845054511, -0.0013753619481373083, -0.024269300401744017, 0.227746916010038, -0.24145255255402176, -0.2300006908566489, 0.13810895865138334, 0.1772900701506988, 0.10681783764662182, -0.1601943647744577, 0.04131355099052344, 0.023472851539564715, 0.2136522527626175, 0.09230673303697388, 0.10919225220796425, 0.3012447462944718, 0.24477182493147837, 0.14157953365849188, 0.08826207542886397, -0.31885746547340094, -0.028280647990938563, -0.20737756919311165, -0.07312913061529919, -0.11068132445151052, 0.05317741567334095, -0.11055535965349193, -0.04248591149152563, 0.4036267685827675, 0.12756786690676875, 0.03325592603052517, 0.004935983592038649, 0.3881783063256449, -0.11131014830882212, 0.12111364884653708, 0.07349990731450384, 0.3016006477125041, 0.0824382358191574, 0.24134352868683376, -0.15847899372546145, -0.0010198229253031573, -0.04021455340211156] |
1,802.01137 | On some variants of the club principle | We study some asymptotic variants of the club principle. Along the way, we
construct some forcings and use them to separate several of these principles
| math.LO | we study some asymptotic variants of the club principle along the way we construct some forcings and use them to separate several of these principles | [['we', 'study', 'some', 'asymptotic', 'variants', 'of', 'the', 'club', 'principle', 'along', 'the', 'way', 'we', 'construct', 'some', 'forcings', 'and', 'use', 'them', 'to', 'separate', 'several', 'of', 'these', 'principles']] | [-0.10886245101690292, 0.04563414201140404, -0.11241919245570899, 0.13541860431432723, -0.14261953812092543, -0.06388741537928581, 0.10816045314073562, 0.4389808228611946, -0.34933468014001845, -0.2522367250919342, 0.14884358022361993, -0.2783652603626251, -0.19588662326335907, 0.19255745138973, -0.05274290591478348, 0.022532153278589248, 0.035686965007334946, -0.003605285435914993, -0.022064413167536257, -0.20575585544109345, 0.3554073610901833, -0.05843298010528088, 0.21211098596453667, -0.027229275032877923, 0.1140918086282909, -0.061574190221726895, -0.05344507437199354, 0.060431229546666146, -0.24722349166870117, 0.19679015398025512, 0.17793684087693692, 0.20105958193540574, 0.32957369565963746, -0.45923325181007385, -0.15833052780479193, 0.10505084663629533, 0.03303873211145401, 0.17343859389424324, -0.0007487039547413588, -0.22561088599264623, 0.09783552666660399, -0.19408629834651947, -0.20389871165156365, -0.15467439271509648, -0.0983477546274662, 0.0858770617004484, -0.15064932767301797, -0.027892167307436468, 0.11329456374049186, 0.05666217338293791, -0.030721577145159246, -0.12067023172974586, 0.05591885970905423, 0.17826113916933536, 0.12637113071978093, -0.09451376022771, 0.08950111266225576, -0.044286873219534756, -0.13380642250180244, 0.33348686814308165, -0.05213644325733185, -0.16828367844223976, 0.27070297371596097, -0.123374537602067, -0.25778687208890916, -0.022802479043602945, 0.14634329110383987, 0.09492493629455566, -0.2036328453011811, 0.017317263779696078, -0.048323429673910144, 0.06337862506508828, 0.1248660958558321, 0.07277313642203807, 0.1344371672347188, 0.06547785406932234, 0.06492194645106793, 0.17723136251792312, -0.08700596430455335, -0.08753948271274567, -0.3617881041765213, -0.16146129481494426, -0.040043054036796095, 0.016399888247251512, -0.11331883208767976, -0.14624008387327195, 0.43551252633333204, 0.20063843028619885, 0.16336548835039139, 0.10500574536621571, 0.26295690387487414, 0.0303275662753731, 0.009233700931072236, 0.04620876159518957, 0.2040574942273088, 0.18238405585289003, 0.03965738423168659, -0.15034837447106839, 0.027809317894279956, 0.10218090001493692] |
1,802.01138 | Secure Range Queries for Multiple Users | Order-preserving encryption allows encrypting data, while still enabling
efficient range queries on the encrypted data. Moreover, it does not require
any change to the database management system, because comparison operates on
ciphertexts as on plaintexts. This makes order-preserving encryption schemes
very suitable for data outsourcing in cloud computing scenarios. However, all
order-preserving encryption schemes are necessarily symmetric limiting the use
case to one client and one server. Imagine a scenario where a Data Owner
encrypts its data before outsourcing it to the Cloud Service Provider and a
Data Analyst wants to execute private range queries on this data. This scenario
occurs in many cases of collaborative machine learning where data source and
processor are different entities. Then either the Data Owner must reveal its
encryption key or the Data Analyst must reveal the private queries. In this
paper, we overcome this limitation by allowing the equivalent of a public-key
order-preserving encryption. We present a secure multiparty protocol that
enables secure range queries for multiple users. In this scheme, the Data
Analyst cooperates with the Data Owner and the Cloud Service Provider in order
to order-preserving encrypt the private range queries without revealing any
other information to the parties. We implemented our scheme and observed that
if the database size of the Data Owner has 1 million entries it takes only
about 0.3 s on average via a loopback interface (1.3 s via a LAN) to encrypt an
input of the Data Analyst.
| cs.CR | orderpreserving encryption allows encrypting data while still enabling efficient range queries on the encrypted data moreover it does not require any change to the database management system because comparison operates on ciphertexts as on plaintexts this makes orderpreserving encryption schemes very suitable for data outsourcing in cloud computing scenarios however all orderpreserving encryption schemes are necessarily symmetric limiting the use case to one client and one server imagine a scenario where a data owner encrypts its data before outsourcing it to the cloud service provider and a data analyst wants to execute private range queries on this data this scenario occurs in many cases of collaborative machine learning where data source and processor are different entities then either the data owner must reveal its encryption key or the data analyst must reveal the private queries in this paper we overcome this limitation by allowing the equivalent of a publickey orderpreserving encryption we present a secure multiparty protocol that enables secure range queries for multiple users in this scheme the data analyst cooperates with the data owner and the cloud service provider in order to orderpreserving encrypt the private range queries without revealing any other information to the parties we implemented our scheme and observed that if the database size of the data owner has 1 million entries it takes only about 03 s on average via a loopback interface 13 s via a lan to encrypt an input of the data analyst | [['orderpreserving', 'encryption', 'allows', 'encrypting', 'data', 'while', 'still', 'enabling', 'efficient', 'range', 'queries', 'on', 'the', 'encrypted', 'data', 'moreover', 'it', 'does', 'not', 'require', 'any', 'change', 'to', 'the', 'database', 'management', 'system', 'because', 'comparison', 'operates', 'on', 'ciphertexts', 'as', 'on', 'plaintexts', 'this', 'makes', 'orderpreserving', 'encryption', 'schemes', 'very', 'suitable', 'for', 'data', 'outsourcing', 'in', 'cloud', 'computing', 'scenarios', 'however', 'all', 'orderpreserving', 'encryption', 'schemes', 'are', 'necessarily', 'symmetric', 'limiting', 'the', 'use', 'case', 'to', 'one', 'client', 'and', 'one', 'server', 'imagine', 'a', 'scenario', 'where', 'a', 'data', 'owner', 'encrypts', 'its', 'data', 'before', 'outsourcing', 'it', 'to', 'the', 'cloud', 'service', 'provider', 'and', 'a', 'data', 'analyst', 'wants', 'to', 'execute', 'private', 'range', 'queries', 'on', 'this', 'data', 'this', 'scenario', 'occurs', 'in', 'many', 'cases', 'of', 'collaborative', 'machine', 'learning', 'where', 'data', 'source', 'and', 'processor', 'are', 'different', 'entities', 'then', 'either', 'the', 'data', 'owner', 'must', 'reveal', 'its', 'encryption', 'key', 'or', 'the', 'data', 'analyst', 'must', 'reveal', 'the', 'private', 'queries', 'in', 'this', 'paper', 'we', 'overcome', 'this', 'limitation', 'by', 'allowing', 'the', 'equivalent', 'of', 'a', 'publickey', 'orderpreserving', 'encryption', 'we', 'present', 'a', 'secure', 'multiparty', 'protocol', 'that', 'enables', 'secure', 'range', 'queries', 'for', 'multiple', 'users', 'in', 'this', 'scheme', 'the', 'data', 'analyst', 'cooperates', 'with', 'the', 'data', 'owner', 'and', 'the', 'cloud', 'service', 'provider', 'in', 'order', 'to', 'orderpreserving', 'encrypt', 'the', 'private', 'range', 'queries', 'without', 'revealing', 'any', 'other', 'information', 'to', 'the', 'parties', 'we', 'implemented', 'our', 'scheme', 'and', 'observed', 'that', 'if', 'the', 'database', 'size', 'of', 'the', 'data', 'owner', 'has', '1', 'million', 'entries', 'it', 'takes', 'only', 'about', '03', 's', 'on', 'average', 'via', 'a', 'loopback', 'interface', '13', 's', 'via', 'a', 'lan', 'to', 'encrypt', 'an', 'input', 'of', 'the', 'data', 'analyst']] | [-0.18891439486818373, -0.03697980951448308, -0.06900364852487302, 0.06640318187034482, -0.1273658170618794, -0.27691192784700697, 0.17616971063741274, 0.39095220769455363, -0.31986920521902457, -0.326936778718267, 0.14812151737239843, -0.3285561912599398, -0.01187260825598751, 0.1720979281206623, -0.14337851907596116, 0.08581025106591858, 0.05428883405825631, 0.04734385809149162, 0.008680412447544715, -0.33557560758429245, 0.3217913054674479, 0.024514030597811518, 0.31329848326565624, 0.023196673836589844, 0.05957584635956859, 0.03915833380512993, -0.048302674712228384, -0.11895933261661232, -0.056593386684691105, 0.11115899711220972, 0.3517605268804372, 0.2563937658709589, 0.28834843762557616, -0.43325199531237324, -0.12538906538921307, 0.1313130964201775, 0.16002315233946462, 0.08415484105425403, -0.07008244121670415, -0.30732394176273614, 0.11173960651715541, -0.227995285575763, -0.014362628652506378, -0.08316149947826158, 0.01150843241128855, -0.04013256337142488, -0.341658744451105, -0.035780455849050694, 0.0046822704251640096, 0.05452319846704048, 0.01343889904765543, 0.015675391757010274, 0.0025877812530937768, 0.1845869501583155, -0.00025773018719782393, 0.0403303583710616, 0.1645425789439204, -0.09024375302944147, -0.11421445453893547, 0.4118767157601085, 0.031140436998987955, -0.1448848224735688, 0.12495108483520852, -0.06577416315428482, -0.1531894042037335, 0.09567207795729445, 0.1881500387305494, 0.056877840859940555, -0.17404918976258948, 0.06825220457461956, -0.07806247388289794, 0.2830780221891112, 0.06904436702010691, 0.062064912569928486, 0.14120239238658813, 0.12738211332697205, 0.0879698193621002, 0.09722572325729796, -0.05612582139130143, -0.10202343151413966, -0.2133304218971844, -0.1567069060199948, -0.2170310655309557, -0.009843291349726833, -0.1066858058134243, -0.12084647577856321, 0.3255840884166525, 0.23166771793029894, 0.1705339185870445, 0.03999596007922587, 0.42253823659944634, -0.01258977031294826, 0.1420359865007999, 0.1913660655716003, 0.07895004023770871, -0.032241232563791536, 0.20734064406331693, -0.10197992561662123, 0.17147306363436987, -0.035907215777445926] |
1,802.01139 | Two-dimensional algebra in lattice gauge theory | We provide a visual and intuitive introduction to effectively calculating in
2-groups along with explicit examples coming from non-abelian 1- and 2-form
gauge theory. In particular, we utilize string diagrams, tools similar to
tensor networks, to compute the parallel transport along a surface using
approximations on a lattice. Although this work is mainly intended as
expository, we prove a convergence theorem for the surface transport in the
continuum limit. Locality is used to define infinitesimal parallel transport
and two- dimensional algebra is used to derive finite versions along arbitrary
surfaces with sufficient orientation data. The correct surface ordering is
dictated by two-dimensional algebra and leads to an interesting diagrammatic
picture for gauge fields interacting with particles and strings on a lattice.
The surface ordering is inherently complicated, but we prove a simplification
theorem confirming earlier results of Schreiber and Waldorf. Assuming little
background, we present a simple way to understand some abstract concepts of
higher category theory. In doing so, we review all the necessary categorical
concepts from the tensor network point of view as well as many aspects of
higher gauge theory.
| hep-th hep-lat math-ph math.MP | we provide a visual and intuitive introduction to effectively calculating in 2groups along with explicit examples coming from nonabelian 1 and 2form gauge theory in particular we utilize string diagrams tools similar to tensor networks to compute the parallel transport along a surface using approximations on a lattice although this work is mainly intended as expository we prove a convergence theorem for the surface transport in the continuum limit locality is used to define infinitesimal parallel transport and two dimensional algebra is used to derive finite versions along arbitrary surfaces with sufficient orientation data the correct surface ordering is dictated by twodimensional algebra and leads to an interesting diagrammatic picture for gauge fields interacting with particles and strings on a lattice the surface ordering is inherently complicated but we prove a simplification theorem confirming earlier results of schreiber and waldorf assuming little background we present a simple way to understand some abstract concepts of higher category theory in doing so we review all the necessary categorical concepts from the tensor network point of view as well as many aspects of higher gauge theory | [['we', 'provide', 'a', 'visual', 'and', 'intuitive', 'introduction', 'to', 'effectively', 'calculating', 'in', '2groups', 'along', 'with', 'explicit', 'examples', 'coming', 'from', 'nonabelian', '1', 'and', '2form', 'gauge', 'theory', 'in', 'particular', 'we', 'utilize', 'string', 'diagrams', 'tools', 'similar', 'to', 'tensor', 'networks', 'to', 'compute', 'the', 'parallel', 'transport', 'along', 'a', 'surface', 'using', 'approximations', 'on', 'a', 'lattice', 'although', 'this', 'work', 'is', 'mainly', 'intended', 'as', 'expository', 'we', 'prove', 'a', 'convergence', 'theorem', 'for', 'the', 'surface', 'transport', 'in', 'the', 'continuum', 'limit', 'locality', 'is', 'used', 'to', 'define', 'infinitesimal', 'parallel', 'transport', 'and', 'two', 'dimensional', 'algebra', 'is', 'used', 'to', 'derive', 'finite', 'versions', 'along', 'arbitrary', 'surfaces', 'with', 'sufficient', 'orientation', 'data', 'the', 'correct', 'surface', 'ordering', 'is', 'dictated', 'by', 'twodimensional', 'algebra', 'and', 'leads', 'to', 'an', 'interesting', 'diagrammatic', 'picture', 'for', 'gauge', 'fields', 'interacting', 'with', 'particles', 'and', 'strings', 'on', 'a', 'lattice', 'the', 'surface', 'ordering', 'is', 'inherently', 'complicated', 'but', 'we', 'prove', 'a', 'simplification', 'theorem', 'confirming', 'earlier', 'results', 'of', 'schreiber', 'and', 'waldorf', 'assuming', 'little', 'background', 'we', 'present', 'a', 'simple', 'way', 'to', 'understand', 'some', 'abstract', 'concepts', 'of', 'higher', 'category', 'theory', 'in', 'doing', 'so', 'we', 'review', 'all', 'the', 'necessary', 'categorical', 'concepts', 'from', 'the', 'tensor', 'network', 'point', 'of', 'view', 'as', 'well', 'as', 'many', 'aspects', 'of', 'higher', 'gauge', 'theory']] | [-0.11379633336251632, 0.11708599257054217, -0.11195261769067964, 0.12035229731137391, -0.13053042600134926, -0.12948723516014757, 0.022570449686507423, 0.3815813343157697, -0.26103919436213624, -0.27594410751747794, 0.07282774045279687, -0.23973016692870971, -0.18289305165389685, 0.1532876724886194, -0.09794935497297534, -0.002353849423835512, 0.03377538581271885, 0.04007011924153372, -0.09503494921175996, -0.23315805108210103, 0.32194066628854456, 0.036980225335643754, 0.29120399521490753, 0.07520385301236795, 0.1165495142881387, 0.0453791746340407, -0.05660274386777456, 0.04320277726020705, -0.1579707068705402, 0.15545845141092346, 0.26537834442617586, 0.05446213469306221, 0.18199259696001585, -0.45666611842973964, -0.19264800980931424, 0.05491169125937139, 0.14398965603752123, 0.16694452803928017, -0.025768022789604595, -0.2522147340862885, 0.09574648127713002, -0.16371149312745514, -0.14692145518772812, -0.1178761652672073, -0.005724702623311451, -0.025418336993042644, -0.2130955687464505, 0.020932249263020567, 0.081716063852254, 0.1266052180931705, -0.05114304476441139, -0.08951249031115914, -0.024254583030979816, 0.09656253784050137, 0.0553740854744031, 0.0645563159916611, 0.11672320254299728, -0.12720269804027298, -0.12802479048342255, 0.3924171142076534, -0.06385944029977901, -0.23562352035622128, 0.21804909430357725, -0.09432409912642967, -0.16853102633368244, 0.09853875919504733, 0.12199822278525375, 0.10786103222966373, -0.13309893122227873, 0.13624387883385286, -0.03851116654244277, 0.1000556769748053, 0.06482780295235863, 0.040878101908525484, 0.19992094763295085, 0.11672281376416974, 0.06494928099936424, 0.1563202321002657, 0.007219631705799552, -0.10829471315567692, -0.3426420166325129, -0.16882411550343687, -0.13638187746219643, 0.10097207642246872, -0.06675951388270768, -0.18595452675509364, 0.35582483345846255, 0.1668537367104115, 0.18532586330913714, 0.073448436061185, 0.26132335811929747, 0.09361408903458171, 0.04624634070030561, 0.06050909941893865, 0.1470456890556058, 0.22131026577575977, 0.07125153677802676, -0.12726116546364807, -0.0240492835358457, 0.1545233529155229] |
1,802.0114 | Non-perturbative evaluation for anomalous dimension in 2-dimensional
O(3) sigma model | We calculate the wave-function renormalization in 2-dimensional O(3) sigma
model, non- perturbatively. It is evaluated in a box with a finite spatial
extent. We determine the anomalous dimension in the finite volume scheme
through an analysis of the step scaling function. Results are compared with a
perturbative evaluation, and the reasonable behavior is confirmed.
| hep-lat | we calculate the wavefunction renormalization in 2dimensional o3 sigma model non perturbatively it is evaluated in a box with a finite spatial extent we determine the anomalous dimension in the finite volume scheme through an analysis of the step scaling function results are compared with a perturbative evaluation and the reasonable behavior is confirmed | [['we', 'calculate', 'the', 'wavefunction', 'renormalization', 'in', '2dimensional', 'o3', 'sigma', 'model', 'non', 'perturbatively', 'it', 'is', 'evaluated', 'in', 'a', 'box', 'with', 'a', 'finite', 'spatial', 'extent', 'we', 'determine', 'the', 'anomalous', 'dimension', 'in', 'the', 'finite', 'volume', 'scheme', 'through', 'an', 'analysis', 'of', 'the', 'step', 'scaling', 'function', 'results', 'are', 'compared', 'with', 'a', 'perturbative', 'evaluation', 'and', 'the', 'reasonable', 'behavior', 'is', 'confirmed']] | [-0.11792204715311527, 0.09530557888474842, -0.1299947660278391, 0.08868110178607619, -0.0020944250109433023, -0.10787201835773885, 0.038582222074856634, 0.3657357127716144, -0.18560869074254124, -0.22102230457864977, 0.07989947108715703, -0.315718905310388, -0.1090027502850043, 0.15485858754686047, 0.02642171117649586, 0.07877970933245874, 0.006581935979839828, 0.05735122200308575, -0.10487994144636172, -0.23109715435377978, 0.30021721423017206, 0.017222460701035475, 0.30448075646051653, 0.09395517330375258, 0.09392905897564358, -0.015458300489828818, -0.07527724167125092, 0.06895898863742198, -0.14142026910903277, 0.037092150408878095, 0.19470467425115337, 0.000607510927322976, 0.23235556770426533, -0.3592898291018274, -0.21903387228882853, 0.0621741248846606, 0.15185076026763353, 0.14502235652482207, -0.007078215221150054, -0.2631248014944571, 0.10507502593100071, -0.2088526534433994, -0.20736256365974745, -0.10374533195324519, -0.0049954416333801216, -0.06280950712540222, -0.265508904432257, 0.09451145006136762, -0.0236092749638138, 0.09160120276458285, -0.04090595044437106, -0.06654647301399598, -0.00942278019135335, 0.12381070649415185, 0.04297819050434218, 0.05648785959756761, 0.09923427159622035, -0.11798936721903307, -0.0847276098879606, 0.39891884902802605, -0.11172642981357596, -0.29315529907277477, 0.14414530407844317, -0.198565983592912, -0.10057283404145252, 0.12905161255211742, 0.12433870919058218, 0.12713898925317657, -0.13611773939596283, 0.14947472793735667, -0.05246607484554665, 0.19417578337662336, -0.004754009303050461, -0.026851365618683672, 0.12818116546367053, 0.21168615486196898, 0.013495169062581327, 0.16876925102379, -0.07093167110104803, -0.12547765575625278, -0.37160221832217993, -0.15186563427387564, -0.17940944653970223, 0.03749799827777746, -0.14319605096561308, -0.17627599361111168, 0.36182088830692344, 0.13637624730149078, 0.2268229493940318, 0.06535951310285816, 0.266942820649732, 0.19615770155494963, 0.07512003909451542, 0.06411543283266602, 0.18249779169585695, 0.1128370094984011, 0.005353195213333324, -0.283002734856887, 0.007936334953194967, 0.13009216227672166] |
1,802.01141 | Simultaneous Selection of Multiple Important Single Nucleotide
Polymorphisms in Familial Genome Wide Association Studies Data | We propose a resampling-based fast variable selection technique for detecting
relevant single nucleotide polymorphisms (SNP) in a multi-marker mixed effect
model. Due to computational complexity, current practice primarily involves
testing the effect of one SNP at a time, commonly termed as `single SNP
association analysis'. Joint modeling of genetic variants within a gene or
pathway may have better power to detect associated genetic variants, especially
the ones with weak effects. In this paper, we propose a computationally
efficient model selection approach -- based on the e-values framework -- for
single SNP detection in families while utilizing information on multiple SNPs
simultaneously. To overcome computational bottleneck of traditional model
selection methods, our method trains one single model, and utilizes a fast and
scalable bootstrap procedure. We illustrate through numerical studies that our
proposed method is more effective in detecting SNPs associated with a trait
than either single-marker analysis using family data or model selection methods
that ignore the familial dependency structure. Further, we perform gene-level
analysis in Minnesota Center for Twin and Family Research (MCTFR) dataset using
our method to detect several SNPs using this that have been implicated to be
associated with alcohol consumption.
| stat.AP | we propose a resamplingbased fast variable selection technique for detecting relevant single nucleotide polymorphisms snp in a multimarker mixed effect model due to computational complexity current practice primarily involves testing the effect of one snp at a time commonly termed as single snp association analysis joint modeling of genetic variants within a gene or pathway may have better power to detect associated genetic variants especially the ones with weak effects in this paper we propose a computationally efficient model selection approach based on the evalues framework for single snp detection in families while utilizing information on multiple snps simultaneously to overcome computational bottleneck of traditional model selection methods our method trains one single model and utilizes a fast and scalable bootstrap procedure we illustrate through numerical studies that our proposed method is more effective in detecting snps associated with a trait than either singlemarker analysis using family data or model selection methods that ignore the familial dependency structure further we perform genelevel analysis in minnesota center for twin and family research mctfr dataset using our method to detect several snps using this that have been implicated to be associated with alcohol consumption | [['we', 'propose', 'a', 'resamplingbased', 'fast', 'variable', 'selection', 'technique', 'for', 'detecting', 'relevant', 'single', 'nucleotide', 'polymorphisms', 'snp', 'in', 'a', 'multimarker', 'mixed', 'effect', 'model', 'due', 'to', 'computational', 'complexity', 'current', 'practice', 'primarily', 'involves', 'testing', 'the', 'effect', 'of', 'one', 'snp', 'at', 'a', 'time', 'commonly', 'termed', 'as', 'single', 'snp', 'association', 'analysis', 'joint', 'modeling', 'of', 'genetic', 'variants', 'within', 'a', 'gene', 'or', 'pathway', 'may', 'have', 'better', 'power', 'to', 'detect', 'associated', 'genetic', 'variants', 'especially', 'the', 'ones', 'with', 'weak', 'effects', 'in', 'this', 'paper', 'we', 'propose', 'a', 'computationally', 'efficient', 'model', 'selection', 'approach', 'based', 'on', 'the', 'evalues', 'framework', 'for', 'single', 'snp', 'detection', 'in', 'families', 'while', 'utilizing', 'information', 'on', 'multiple', 'snps', 'simultaneously', 'to', 'overcome', 'computational', 'bottleneck', 'of', 'traditional', 'model', 'selection', 'methods', 'our', 'method', 'trains', 'one', 'single', 'model', 'and', 'utilizes', 'a', 'fast', 'and', 'scalable', 'bootstrap', 'procedure', 'we', 'illustrate', 'through', 'numerical', 'studies', 'that', 'our', 'proposed', 'method', 'is', 'more', 'effective', 'in', 'detecting', 'snps', 'associated', 'with', 'a', 'trait', 'than', 'either', 'singlemarker', 'analysis', 'using', 'family', 'data', 'or', 'model', 'selection', 'methods', 'that', 'ignore', 'the', 'familial', 'dependency', 'structure', 'further', 'we', 'perform', 'genelevel', 'analysis', 'in', 'minnesota', 'center', 'for', 'twin', 'and', 'family', 'research', 'mctfr', 'dataset', 'using', 'our', 'method', 'to', 'detect', 'several', 'snps', 'using', 'this', 'that', 'have', 'been', 'implicated', 'to', 'be', 'associated', 'with', 'alcohol', 'consumption']] | [-0.041659682831959796, -0.0058566929331343425, -0.06093086226549196, 0.1009454077936856, -0.10627896681942633, -0.21356404986183503, 0.12547227792398954, 0.4114513944148233, -0.2592192053035098, -0.3067961736876321, 0.08121908381765121, -0.2645355211325774, -0.19384782876494636, 0.19626993614641067, -0.06788109148190798, 0.05058836073003477, 0.13349309087681926, 0.006327296393972478, 0.014765512290116595, -0.21353052704178385, 0.24804781439567083, 0.08372870514806556, 0.34716320985830146, -0.02974466214593696, 0.09585436151522261, 0.008748070001112003, -0.0671216876344069, 0.03633572677223894, -0.05536009821926679, 0.18635015384857787, 0.2823051567814362, 0.1876198874137021, 0.3777098427587924, -0.3997787633481877, -0.2630296960546586, 0.1302265703335012, 0.15115391653227178, 0.15705592005244015, -0.08089991458975036, -0.25658529434157046, 0.10130406897515058, -0.16951169563322574, -0.03935198231713577, -0.1289631419962174, -0.06298151628702486, -0.016174566021225856, -0.29500694716943576, 0.14676648878758944, -0.012854947696599226, 0.09341892141750768, -0.00813732409702712, -0.14171683752026998, 0.029312109377382226, 0.07583799893281569, 0.05252020963479912, 0.0024692374275458095, 0.12620880214350397, -0.08226565678456896, -0.18598544604855738, 0.3274927785246339, -0.041123765239746334, -0.24280421519897094, 0.21951667102127287, -0.06435418945590132, -0.23986628832001436, 0.11825515128378021, 0.22475995097407384, 0.14723799324496403, -0.22423507908242754, -0.017154833042724547, 0.005119958288330389, 0.20271705641582805, 0.051692574972433875, -0.025984403228779374, 0.17080317525389163, 0.250913410623999, 0.014483200044273154, 0.1434311770497037, -0.19038918596098053, -0.07348453062096316, -0.1880256185041569, -0.10931697937071716, -0.11722353527913679, -0.040711859793181676, -0.06274852680607614, -0.1808783350236665, 0.39994590368710065, 0.17315752604596416, 0.1603247177284701, 0.06799109086982513, 0.30854789442995467, 0.038004321342726285, 0.14537078012516233, 0.017716295044182945, 0.12043123125637832, 0.04615952242655973, 0.01696042046563602, -0.25779764311155307, 0.1441488307640324, 0.043330654652642187] |
1,802.01142 | The evolution of grain mantles and silicate dust growth at high redshift | In dense molecular clouds, interstellar grains are covered by mantles of iced
molecules. The formation of the grain mantles has two important consequences:
it removes species from the gas phase and promotes the synthesis of new
molecules on the grain surfaces. The composition of the mantle is a strong
function of the environment which the cloud belongs to. Therefore, clouds in
high-zeta galaxies, where conditions -like temperature, metallicity and cosmic
rays flux- are different from those in the Milky Way, will have different grain
mantles. In the last years, several authors have suggested that silicate grains
might grow by accretion of silicon bearing species on smaller seeds. This would
occur simultaneously to the formation of the iced mantles and be greatly
affected by its composition as a function of time. In this work, we present a
numerical study of the grain mantle formation in high-zeta galaxies and we
quantitatively address the possibility of silicate growth. We find that the
mantle thickness decreases with increasing redshift, from about 120 to 20
layers for z varying from 0 to 8. Furthermore, the mantle composition is also a
strong function of the cloud redshift, with the relative importance of CO, CO2,
ammonia, methane and methanol highly varying with z. Finally, being Si-bearing
species always a very minor component of the mantle, the formation of silicates
in molecular clouds is practically impossible.
| astro-ph.GA astro-ph.CO | in dense molecular clouds interstellar grains are covered by mantles of iced molecules the formation of the grain mantles has two important consequences it removes species from the gas phase and promotes the synthesis of new molecules on the grain surfaces the composition of the mantle is a strong function of the environment which the cloud belongs to therefore clouds in highzeta galaxies where conditions like temperature metallicity and cosmic rays flux are different from those in the milky way will have different grain mantles in the last years several authors have suggested that silicate grains might grow by accretion of silicon bearing species on smaller seeds this would occur simultaneously to the formation of the iced mantles and be greatly affected by its composition as a function of time in this work we present a numerical study of the grain mantle formation in highzeta galaxies and we quantitatively address the possibility of silicate growth we find that the mantle thickness decreases with increasing redshift from about 120 to 20 layers for z varying from 0 to 8 furthermore the mantle composition is also a strong function of the cloud redshift with the relative importance of co co2 ammonia methane and methanol highly varying with z finally being sibearing species always a very minor component of the mantle the formation of silicates in molecular clouds is practically impossible | [['in', 'dense', 'molecular', 'clouds', 'interstellar', 'grains', 'are', 'covered', 'by', 'mantles', 'of', 'iced', 'molecules', 'the', 'formation', 'of', 'the', 'grain', 'mantles', 'has', 'two', 'important', 'consequences', 'it', 'removes', 'species', 'from', 'the', 'gas', 'phase', 'and', 'promotes', 'the', 'synthesis', 'of', 'new', 'molecules', 'on', 'the', 'grain', 'surfaces', 'the', 'composition', 'of', 'the', 'mantle', 'is', 'a', 'strong', 'function', 'of', 'the', 'environment', 'which', 'the', 'cloud', 'belongs', 'to', 'therefore', 'clouds', 'in', 'highzeta', 'galaxies', 'where', 'conditions', 'like', 'temperature', 'metallicity', 'and', 'cosmic', 'rays', 'flux', 'are', 'different', 'from', 'those', 'in', 'the', 'milky', 'way', 'will', 'have', 'different', 'grain', 'mantles', 'in', 'the', 'last', 'years', 'several', 'authors', 'have', 'suggested', 'that', 'silicate', 'grains', 'might', 'grow', 'by', 'accretion', 'of', 'silicon', 'bearing', 'species', 'on', 'smaller', 'seeds', 'this', 'would', 'occur', 'simultaneously', 'to', 'the', 'formation', 'of', 'the', 'iced', 'mantles', 'and', 'be', 'greatly', 'affected', 'by', 'its', 'composition', 'as', 'a', 'function', 'of', 'time', 'in', 'this', 'work', 'we', 'present', 'a', 'numerical', 'study', 'of', 'the', 'grain', 'mantle', 'formation', 'in', 'highzeta', 'galaxies', 'and', 'we', 'quantitatively', 'address', 'the', 'possibility', 'of', 'silicate', 'growth', 'we', 'find', 'that', 'the', 'mantle', 'thickness', 'decreases', 'with', 'increasing', 'redshift', 'from', 'about', '120', 'to', '20', 'layers', 'for', 'z', 'varying', 'from', '0', 'to', '8', 'furthermore', 'the', 'mantle', 'composition', 'is', 'also', 'a', 'strong', 'function', 'of', 'the', 'cloud', 'redshift', 'with', 'the', 'relative', 'importance', 'of', 'co', 'co2', 'ammonia', 'methane', 'and', 'methanol', 'highly', 'varying', 'with', 'z', 'finally', 'being', 'sibearing', 'species', 'always', 'a', 'very', 'minor', 'component', 'of', 'the', 'mantle', 'the', 'formation', 'of', 'silicates', 'in', 'molecular', 'clouds', 'is', 'practically', 'impossible']] | [-0.05530294453940535, 0.19071900415073553, -0.03605372002719184, -0.0013706207942975833, -0.011680340339775832, -0.017710917081222334, 0.057484471691417946, 0.410098584088604, -0.25215996908996485, -0.30653985332598727, 0.05970310326923196, -0.25812522270016175, -0.05833826752933797, 0.1166226264208852, -0.013391723177412244, -0.025485717320857998, 0.03016706497925622, -0.12499113141175822, -0.026502474109035407, -0.2842603549052162, 0.3291117769173569, 0.09426272076768882, 0.17388402994627347, 0.09507140329991574, 0.029256292036476967, -0.16104233825365, -0.01731590428353551, -0.04319142369116632, -0.18670054431212704, 0.09770207407480452, 0.22131571288228827, 0.09436894832714667, 0.18832073305255478, -0.47962152538409014, -0.27084609438547763, 0.07582629876277219, 0.13872192809110986, 0.0868198757376151, -0.06406111032104499, -0.20945181237921054, 0.049421000865646596, -0.1639047067950323, -0.15011986732416976, 0.06269274069876121, 0.059910173738062115, 0.029033297435143567, -0.2180290656613466, 0.10793679760729347, 0.05678719821900765, 0.08734875677083413, -0.11892600119293181, -0.16725717240478843, -0.1216975466381198, 0.08177490686725793, 0.048589978608162665, 0.023233048849640232, 0.25861822283492975, -0.13544537905970408, 0.028317003043685767, 0.43908548594114527, -0.09009021137706086, -0.05270537569298846, 0.2909776881003373, -0.19934641601867042, -0.1673787903139549, 0.20320134500733913, 0.14886840336453333, 0.12632048230894338, -0.15030066851130894, 0.030746098517891497, -0.04520529446571208, 0.19497157533218326, 0.11579048188518634, 0.024546335989081885, 0.31082831642928377, 0.17806337286091814, 0.05481259906211192, 0.13827439762942442, -0.14940449014198925, -0.05504406480720283, -0.18362530386611095, -0.21201821936467513, -0.16024435702422882, 0.04073884839035439, -0.1458241839238841, -0.13414651455060966, 0.2884251040971088, 0.12983567839095872, 0.2218772826543226, -0.0005833656610550144, 0.2727701876485572, 0.02160270071116614, 0.11884509087066306, 0.056716171272286516, 0.25802676035791833, 0.12968068637481306, 0.11992202260308957, -0.21369149043241237, 0.19476439286460193, -0.012883711429065572] |
1,802.01143 | The Power of Trading Polarity: Evidence from China Stock Market Crash | The imbalance of buying and selling functions profoundly in the formation of
market trends, however, a fine-granularity investigation of the imbalance is
still missing. This paper investigates a unique transaction dataset that
enables us to inspect the imbalance of buying and selling on the man-times
level at high frequency, what we call 'trading polarity', for a large
cross-section of stocks from Shenzhen Stock Exchange. The trading polarity
measures the market sentiment toward stocks from a view of very essence of
trading desire. When using the polarity to examine market crash, we find that
trading polarity successfully reflects the changing of market-level behavior in
terms of its flipping times, depth, and length. We further investigate the
relationship between polarity and return. At market-level, trading polarity is
negatively correlated with returns, while at stock-level, this correlation
changes according to market conditions, which becomes a good signal of market
psychology transition. Also, the significant correlation disclosed by the
market polarity and market emotion implies that our presented polarity, which
essentially calculated in the context of high-frequency trading data, can
real-timely reflect the sentiment of the market. The trading polarity indeed
provides a new way to understand and foresee the market behavior.
| q-fin.CP q-fin.TR | the imbalance of buying and selling functions profoundly in the formation of market trends however a finegranularity investigation of the imbalance is still missing this paper investigates a unique transaction dataset that enables us to inspect the imbalance of buying and selling on the mantimes level at high frequency what we call trading polarity for a large crosssection of stocks from shenzhen stock exchange the trading polarity measures the market sentiment toward stocks from a view of very essence of trading desire when using the polarity to examine market crash we find that trading polarity successfully reflects the changing of marketlevel behavior in terms of its flipping times depth and length we further investigate the relationship between polarity and return at marketlevel trading polarity is negatively correlated with returns while at stocklevel this correlation changes according to market conditions which becomes a good signal of market psychology transition also the significant correlation disclosed by the market polarity and market emotion implies that our presented polarity which essentially calculated in the context of highfrequency trading data can realtimely reflect the sentiment of the market the trading polarity indeed provides a new way to understand and foresee the market behavior | [['the', 'imbalance', 'of', 'buying', 'and', 'selling', 'functions', 'profoundly', 'in', 'the', 'formation', 'of', 'market', 'trends', 'however', 'a', 'finegranularity', 'investigation', 'of', 'the', 'imbalance', 'is', 'still', 'missing', 'this', 'paper', 'investigates', 'a', 'unique', 'transaction', 'dataset', 'that', 'enables', 'us', 'to', 'inspect', 'the', 'imbalance', 'of', 'buying', 'and', 'selling', 'on', 'the', 'mantimes', 'level', 'at', 'high', 'frequency', 'what', 'we', 'call', 'trading', 'polarity', 'for', 'a', 'large', 'crosssection', 'of', 'stocks', 'from', 'shenzhen', 'stock', 'exchange', 'the', 'trading', 'polarity', 'measures', 'the', 'market', 'sentiment', 'toward', 'stocks', 'from', 'a', 'view', 'of', 'very', 'essence', 'of', 'trading', 'desire', 'when', 'using', 'the', 'polarity', 'to', 'examine', 'market', 'crash', 'we', 'find', 'that', 'trading', 'polarity', 'successfully', 'reflects', 'the', 'changing', 'of', 'marketlevel', 'behavior', 'in', 'terms', 'of', 'its', 'flipping', 'times', 'depth', 'and', 'length', 'we', 'further', 'investigate', 'the', 'relationship', 'between', 'polarity', 'and', 'return', 'at', 'marketlevel', 'trading', 'polarity', 'is', 'negatively', 'correlated', 'with', 'returns', 'while', 'at', 'stocklevel', 'this', 'correlation', 'changes', 'according', 'to', 'market', 'conditions', 'which', 'becomes', 'a', 'good', 'signal', 'of', 'market', 'psychology', 'transition', 'also', 'the', 'significant', 'correlation', 'disclosed', 'by', 'the', 'market', 'polarity', 'and', 'market', 'emotion', 'implies', 'that', 'our', 'presented', 'polarity', 'which', 'essentially', 'calculated', 'in', 'the', 'context', 'of', 'highfrequency', 'trading', 'data', 'can', 'realtimely', 'reflect', 'the', 'sentiment', 'of', 'the', 'market', 'the', 'trading', 'polarity', 'indeed', 'provides', 'a', 'new', 'way', 'to', 'understand', 'and', 'foresee', 'the', 'market', 'behavior']] | [-0.10997930481386631, 0.09596864011057067, -0.09475672493458331, 0.14333004622057693, -0.09497264359499202, -0.13314993687684543, 0.15911653006903, 0.41434773353418125, -0.28313217408590247, -0.2909644270467586, 0.1161756588127488, -0.3300229819952366, -0.1398367748653382, 0.13978235509736253, -0.10908006283889055, -0.0667068671399713, 0.027766803147501705, 0.022284961160939646, 0.049788072719670756, -0.2510959061436336, 0.29757398933882717, 0.07176101250278753, 0.38087351966202837, 0.09993314293702853, 0.11139452591785662, -0.010694465631158235, -0.05768990323437167, 0.010815076914892866, -0.06541200077635105, 0.16966103766472518, 0.2833299213281074, 0.0850240911366706, 0.33735491974836157, -0.42030410334160645, -0.0980258308982323, 0.10510929695873032, 0.06742353660184122, 0.03383946399439664, -0.003824360534241519, -0.2550286541299261, 0.050787386911100296, -0.21628429865963833, -0.05003149562860964, -0.07190837811669047, 0.06699463100047763, -0.00021517247810105304, -0.2826949162288694, 0.05751567224107236, 0.04035253479078259, 0.09011445011098668, -0.07106477324070755, -0.06673580545394384, -0.05686501808075676, 0.2121537904533829, 0.18046549978166743, -0.05693140599235158, 0.17105723876918943, -0.16556035047132983, -0.18415101058241076, 0.3801179813009869, -0.07181144918353517, -0.10650628245406851, 0.10451616596949008, -0.1991685581628771, -0.09205229927128009, 0.10879320611447557, 0.20887077722239988, -0.006923723694047478, -0.1462362977282592, -0.010857351600149282, -0.046933960580007775, 0.21961451251871078, 0.0873321525346891, -0.04580715011334834, 0.2496181852184236, 0.17711134698660805, 0.13337179137028984, 0.1537118871929124, -0.08544598868688012, -0.16032507098591933, -0.22771526585553878, -0.1117304442828454, -0.1316625921850179, 0.05234552128720529, -0.12894647393736283, -0.18754029271106437, 0.46184803294882026, 0.1708927724135982, 0.1673621947291432, 0.07326956850670989, 0.23915228455029813, 0.09466929226866491, 0.022060347932208443, 0.08733408344062238, 0.1699029401463178, -0.023058133243616746, 0.24439000321993815, -0.22248732629436135, 0.21761486215814563, -0.02401697293125554] |
1,802.01144 | Human Action Adverb Recognition: ADHA Dataset and A Three-Stream Hybrid
Model | We introduce the first benchmark for a new problem --- recognizing human
action adverbs (HAA): "Adverbs Describing Human Actions" (ADHA). This is the
first step for computer vision to change over from pattern recognition to real
AI. We demonstrate some key features of ADHA: a semantically complete set of
adverbs describing human actions, a set of common, describable human actions,
and an exhaustive labeling of simultaneously emerging actions in each video. We
commit an in-depth analysis on the implementation of current effective models
in action recognition and image captioning on adverb recognition, and the
results show that such methods are unsatisfactory. Moreover, we propose a novel
three-stream hybrid model to deal the HAA problem, which achieves a better
result.
| cs.CV | we introduce the first benchmark for a new problem recognizing human action adverbs haa adverbs describing human actions adha this is the first step for computer vision to change over from pattern recognition to real ai we demonstrate some key features of adha a semantically complete set of adverbs describing human actions a set of common describable human actions and an exhaustive labeling of simultaneously emerging actions in each video we commit an indepth analysis on the implementation of current effective models in action recognition and image captioning on adverb recognition and the results show that such methods are unsatisfactory moreover we propose a novel threestream hybrid model to deal the haa problem which achieves a better result | [['we', 'introduce', 'the', 'first', 'benchmark', 'for', 'a', 'new', 'problem', 'recognizing', 'human', 'action', 'adverbs', 'haa', 'adverbs', 'describing', 'human', 'actions', 'adha', 'this', 'is', 'the', 'first', 'step', 'for', 'computer', 'vision', 'to', 'change', 'over', 'from', 'pattern', 'recognition', 'to', 'real', 'ai', 'we', 'demonstrate', 'some', 'key', 'features', 'of', 'adha', 'a', 'semantically', 'complete', 'set', 'of', 'adverbs', 'describing', 'human', 'actions', 'a', 'set', 'of', 'common', 'describable', 'human', 'actions', 'and', 'an', 'exhaustive', 'labeling', 'of', 'simultaneously', 'emerging', 'actions', 'in', 'each', 'video', 'we', 'commit', 'an', 'indepth', 'analysis', 'on', 'the', 'implementation', 'of', 'current', 'effective', 'models', 'in', 'action', 'recognition', 'and', 'image', 'captioning', 'on', 'adverb', 'recognition', 'and', 'the', 'results', 'show', 'that', 'such', 'methods', 'are', 'unsatisfactory', 'moreover', 'we', 'propose', 'a', 'novel', 'threestream', 'hybrid', 'model', 'to', 'deal', 'the', 'haa', 'problem', 'which', 'achieves', 'a', 'better', 'result']] | [-0.07588089624877577, -4.3208570509628096e-05, -0.07650394295934208, 0.034678620480886914, -0.11265855617979068, -0.14446661551482975, 0.017324657050667772, 0.4216187913286484, -0.2493004748692452, -0.31470850941141026, 0.04574593661897579, -0.2819239652510417, -0.24120566804332944, 0.20094036425945302, -0.2075728567325021, 0.0662721388152469, 0.13730517416497914, 0.12052396256121475, -0.030737968633282868, -0.2528619758954461, 0.26993245671708455, -0.020495912060141563, 0.2888915261443136, 0.03411846273673414, 0.1452029571331785, -0.0076507951795928555, -0.03237777280471272, -0.028544410341024652, -0.06251587562877892, 0.20048404955976026, 0.30664317584656386, 0.2142780075733692, 0.3135189881856095, -0.37424511596623616, -0.19013220833819675, 0.05864118847017318, 0.13445042097798976, 0.12629555056159683, -0.04293531835497499, -0.3875279681188828, 0.1079293791149443, -0.1881112145591464, 0.0190253200846077, -0.14212745701168047, 0.03022231139495211, -0.07088199112726123, -0.2930755584374449, -0.011059620679342345, 0.09659830704962803, 0.14227905617859135, -0.11535993297988849, -0.07286911185878187, 0.07684666925836038, 0.24381834952066006, 0.021402004607006024, 0.05945309099614999, 0.13245402262703973, -0.20737513622576845, -0.20172417713270002, 0.42218899938388393, -0.039810482917700785, -0.21417287406432678, 0.20550279667348428, -0.0281381625366413, -0.1954418860723154, 0.06532446264932563, 0.21233532286517448, 0.1663140244781971, -0.1511689740789549, 0.008687968719533597, -0.09092050041782401, 0.1847468110716949, 0.04615273776018235, -0.024929818322376934, 0.18374949258010267, 0.27019173746249814, 0.036651382380622925, 0.11537096440847332, -0.02921796678881145, -0.06729320701511608, -0.25219191074118774, -0.12390064515599633, -0.11786243041298526, 0.01495663580480742, -0.07519896672133423, -0.1793208114321391, 0.424440191143145, 0.23243196890294804, 0.17643401296256836, 0.10469509840062899, 0.32560597210175407, 0.03158408006227978, 0.0637783995134977, 0.04696826564574267, 0.08890258149915746, -0.062337325546511654, 0.0741257678112607, -0.2100377297472856, 0.051948016608070774, 0.11592342064842202] |
1,802.01145 | The S-PASS view of polarized Galactic Synchrotron at 2.3 GHz as a
contaminant to CMB observations | We analyze the Southern Sky emission in linear polarization at 2.3 GHz as
observed by the S-band Polarization All Sky Survey S-PASS. Our purpose is to
study the properties of the diffuse Galactic polarized synchrotron as a
contaminant to CMB B-mode observations. We study the angular distribution of
the S-PASS signal at intermediate and high Galactic latitudes by means of
angular power spectra. Power spectra, show a decay of the spectral amplitude as
a function of multipole for \ell<200, typical of the diffuse emission. Spectra
can be approximated by a power law C_{\ell}\propto\ell^{alpha}, with alpha~-3,
and characterized by a B-to-E ratio of ~0.5. We study the synchrotron SED in
polarization by computing power spectra of the low frequency WMAP and Planck
maps. Results show that the SED, in the frequency range 2.3-33 GHz, is
compatible with a power law with beta_s=-3.22\pm0.08. Combining S-PASS
polarization maps with those coming from WMAP and Planck we derived a map of
the synchrotron spectral index at angular resolution of 2{\deg} on about 30% of
the sky. The recovered distribution peaks at the value around -3.2. We also
measure a significant spatial correlation between synchrotron and thermal dust
signals, as traced by the Planck 353 GHz channel. This correlation reaches
about 40% on the larger angular scales, decaying considerably at the degree
scales. Finally, we use the S-PASS maps to assess the polarized synchrotron
contamination to CMB observations of the B-modes. Moreover, by combining S-PASS
data with Planck 353 GHz observations, we recover a map of the minimum level of
total polarized foreground contamination to B-modes, finding that there is no
region of the sky, at any frequency, where this contamination lies below
equivalent tenor-to-scalar ratio ~10^-3. This result confirms the importance of
observing both high and low frequency foregrounds in CMB B-mode measurements.
| astro-ph.GA astro-ph.CO astro-ph.IM | we analyze the southern sky emission in linear polarization at 23 ghz as observed by the sband polarization all sky survey spass our purpose is to study the properties of the diffuse galactic polarized synchrotron as a contaminant to cmb bmode observations we study the angular distribution of the spass signal at intermediate and high galactic latitudes by means of angular power spectra power spectra show a decay of the spectral amplitude as a function of multipole for ell200 typical of the diffuse emission spectra can be approximated by a power law c_ellproptoellalpha with alpha3 and characterized by a btoe ratio of 05 we study the synchrotron sed in polarization by computing power spectra of the low frequency wmap and planck maps results show that the sed in the frequency range 2333 ghz is compatible with a power law with beta_s322pm008 combining spass polarization maps with those coming from wmap and planck we derived a map of the synchrotron spectral index at angular resolution of 2deg on about 30 of the sky the recovered distribution peaks at the value around 32 we also measure a significant spatial correlation between synchrotron and thermal dust signals as traced by the planck 353 ghz channel this correlation reaches about 40 on the larger angular scales decaying considerably at the degree scales finally we use the spass maps to assess the polarized synchrotron contamination to cmb observations of the bmodes moreover by combining spass data with planck 353 ghz observations we recover a map of the minimum level of total polarized foreground contamination to bmodes finding that there is no region of the sky at any frequency where this contamination lies below equivalent tenortoscalar ratio 103 this result confirms the importance of observing both high and low frequency foregrounds in cmb bmode measurements | [['we', 'analyze', 'the', 'southern', 'sky', 'emission', 'in', 'linear', 'polarization', 'at', '23', 'ghz', 'as', 'observed', 'by', 'the', 'sband', 'polarization', 'all', 'sky', 'survey', 'spass', 'our', 'purpose', 'is', 'to', 'study', 'the', 'properties', 'of', 'the', 'diffuse', 'galactic', 'polarized', 'synchrotron', 'as', 'a', 'contaminant', 'to', 'cmb', 'bmode', 'observations', 'we', 'study', 'the', 'angular', 'distribution', 'of', 'the', 'spass', 'signal', 'at', 'intermediate', 'and', 'high', 'galactic', 'latitudes', 'by', 'means', 'of', 'angular', 'power', 'spectra', 'power', 'spectra', 'show', 'a', 'decay', 'of', 'the', 'spectral', 'amplitude', 'as', 'a', 'function', 'of', 'multipole', 'for', 'ell200', 'typical', 'of', 'the', 'diffuse', 'emission', 'spectra', 'can', 'be', 'approximated', 'by', 'a', 'power', 'law', 'c_ellproptoellalpha', 'with', 'alpha3', 'and', 'characterized', 'by', 'a', 'btoe', 'ratio', 'of', '05', 'we', 'study', 'the', 'synchrotron', 'sed', 'in', 'polarization', 'by', 'computing', 'power', 'spectra', 'of', 'the', 'low', 'frequency', 'wmap', 'and', 'planck', 'maps', 'results', 'show', 'that', 'the', 'sed', 'in', 'the', 'frequency', 'range', '2333', 'ghz', 'is', 'compatible', 'with', 'a', 'power', 'law', 'with', 'beta_s322pm008', 'combining', 'spass', 'polarization', 'maps', 'with', 'those', 'coming', 'from', 'wmap', 'and', 'planck', 'we', 'derived', 'a', 'map', 'of', 'the', 'synchrotron', 'spectral', 'index', 'at', 'angular', 'resolution', 'of', '2deg', 'on', 'about', '30', 'of', 'the', 'sky', 'the', 'recovered', 'distribution', 'peaks', 'at', 'the', 'value', 'around', '32', 'we', 'also', 'measure', 'a', 'significant', 'spatial', 'correlation', 'between', 'synchrotron', 'and', 'thermal', 'dust', 'signals', 'as', 'traced', 'by', 'the', 'planck', '353', 'ghz', 'channel', 'this', 'correlation', 'reaches', 'about', '40', 'on', 'the', 'larger', 'angular', 'scales', 'decaying', 'considerably', 'at', 'the', 'degree', 'scales', 'finally', 'we', 'use', 'the', 'spass', 'maps', 'to', 'assess', 'the', 'polarized', 'synchrotron', 'contamination', 'to', 'cmb', 'observations', 'of', 'the', 'bmodes', 'moreover', 'by', 'combining', 'spass', 'data', 'with', 'planck', '353', 'ghz', 'observations', 'we', 'recover', 'a', 'map', 'of', 'the', 'minimum', 'level', 'of', 'total', 'polarized', 'foreground', 'contamination', 'to', 'bmodes', 'finding', 'that', 'there', 'is', 'no', 'region', 'of', 'the', 'sky', 'at', 'any', 'frequency', 'where', 'this', 'contamination', 'lies', 'below', 'equivalent', 'tenortoscalar', 'ratio', '103', 'this', 'result', 'confirms', 'the', 'importance', 'of', 'observing', 'both', 'high', 'and', 'low', 'frequency', 'foregrounds', 'in', 'cmb', 'bmode', 'measurements']] | [-0.08237749943953655, 0.1162573196562165, -0.05335217950455213, 0.0779120906461346, -0.048999233397860394, -0.05512363086257256, 0.03888631336217336, 0.3882660985932196, -0.2561852708449035, -0.32731540404039167, 0.06878327588803308, -0.33662912588629684, 0.012269570154406257, 0.20894609555854635, 0.03331865793305165, -0.01433606429195221, -0.023685905027945164, -0.11768982730711162, -0.025181928217821455, -0.16866523956483373, 0.2916073894475476, 0.20491574506149074, 0.2680407116884145, 0.01144611057272907, 0.11926467078856302, -0.06169851250251976, -0.1256706233499414, 0.002924603267209762, -0.10579119993958788, 0.05771121010973544, 0.2574456954003959, 0.12004485094438354, 0.13931334532986758, -0.28627764580739756, -0.2163831382453189, 0.12237376151566978, 0.09038833124026403, 0.0682184013293393, 0.009098207320370791, -0.24905205928854707, 0.08301699754280843, -0.13900867513804183, -0.14841320242859043, 0.010144151542020046, 0.0023803583109530354, 0.002934076096389001, -0.25148362276160113, 0.15024551201791314, 0.021306766480428434, 0.11421042352459014, -0.08466237283122363, -0.14030785161323087, -0.062059829981555625, 0.0501415400915795, 0.01104973622724035, 0.07609477431278565, 0.1488585797848843, -0.12106881304801899, -0.06852036107576184, 0.36481157282083215, -0.13885451350025674, -0.05336985018862001, 0.10147632568575427, -0.2881373263856049, -0.15559647492354073, 0.17582732414929353, 0.14918505243357208, 0.04200516544401811, -0.11052463658512136, 0.06372684674175709, 0.0072516493017832605, 0.25638862702190496, 0.1427586596443365, 0.06624145706349953, 0.3052041766581015, 0.06257974330683129, 0.10409402166003898, 0.16509787954224306, -0.26863968361453233, 0.04129048921167851, -0.27696474857363945, -0.011827464973143601, -0.21002364081875186, 0.1058460823473347, -0.13642655742617119, -0.05348693789219705, 0.42002294847931143, 0.1183792583950227, 0.22727183241286647, 0.10006982056281956, 0.38179432882185455, 0.10035912786152656, 0.05943492951416174, 0.08151905559776824, 0.3087991946945125, 0.1585030341931319, 0.13529375091163537, -0.20963961254268632, -0.019841073126674203, -0.08359242699945629] |
1,802.01146 | Optical modulation of coherent phonon emission in optomechanical
cavities | Optomechanical structures are well suited to study photon-phonon
interactions, and they also turn out to be potential building blocks for
phononic circuits and quantum computing. In phononic circuits, in which
information is carried and processed by phonons, optomechanical structures
could be used as interfaces to photons and electrons thanks to their excellent
coupling efficiency. Among the components required for phononic circuits, such
structures could be used to create coherent phonon sources and detectors.
Complex functions other than emission or detection remain challenging and
addressing a single structure in a full network proves a formidable challenge.
Here, we propose and demonstrate a way to modulate the coherent emission from
optomechanical crystals by external optical pumping, effectively creating a
phonon switch working at ambient conditions of pressure and temperature and the
working speed of which (5 MHz) is only limited by the mechanical motion of the
optomechanical structure. We additionally demonstrate two other switching
schemes: harmonic switching in which the mechanical mode remains active but
different harmonics of the optical force are used, and switching to- and from
the chaotic regime. Furthermore, the method presented here allows to select any
single structure without affecting its surroundings, which is an important step
towards freely controllable networks of optomechanical phonon emitters.
| physics.optics cond-mat.mes-hall | optomechanical structures are well suited to study photonphonon interactions and they also turn out to be potential building blocks for phononic circuits and quantum computing in phononic circuits in which information is carried and processed by phonons optomechanical structures could be used as interfaces to photons and electrons thanks to their excellent coupling efficiency among the components required for phononic circuits such structures could be used to create coherent phonon sources and detectors complex functions other than emission or detection remain challenging and addressing a single structure in a full network proves a formidable challenge here we propose and demonstrate a way to modulate the coherent emission from optomechanical crystals by external optical pumping effectively creating a phonon switch working at ambient conditions of pressure and temperature and the working speed of which 5 mhz is only limited by the mechanical motion of the optomechanical structure we additionally demonstrate two other switching schemes harmonic switching in which the mechanical mode remains active but different harmonics of the optical force are used and switching to and from the chaotic regime furthermore the method presented here allows to select any single structure without affecting its surroundings which is an important step towards freely controllable networks of optomechanical phonon emitters | [['optomechanical', 'structures', 'are', 'well', 'suited', 'to', 'study', 'photonphonon', 'interactions', 'and', 'they', 'also', 'turn', 'out', 'to', 'be', 'potential', 'building', 'blocks', 'for', 'phononic', 'circuits', 'and', 'quantum', 'computing', 'in', 'phononic', 'circuits', 'in', 'which', 'information', 'is', 'carried', 'and', 'processed', 'by', 'phonons', 'optomechanical', 'structures', 'could', 'be', 'used', 'as', 'interfaces', 'to', 'photons', 'and', 'electrons', 'thanks', 'to', 'their', 'excellent', 'coupling', 'efficiency', 'among', 'the', 'components', 'required', 'for', 'phononic', 'circuits', 'such', 'structures', 'could', 'be', 'used', 'to', 'create', 'coherent', 'phonon', 'sources', 'and', 'detectors', 'complex', 'functions', 'other', 'than', 'emission', 'or', 'detection', 'remain', 'challenging', 'and', 'addressing', 'a', 'single', 'structure', 'in', 'a', 'full', 'network', 'proves', 'a', 'formidable', 'challenge', 'here', 'we', 'propose', 'and', 'demonstrate', 'a', 'way', 'to', 'modulate', 'the', 'coherent', 'emission', 'from', 'optomechanical', 'crystals', 'by', 'external', 'optical', 'pumping', 'effectively', 'creating', 'a', 'phonon', 'switch', 'working', 'at', 'ambient', 'conditions', 'of', 'pressure', 'and', 'temperature', 'and', 'the', 'working', 'speed', 'of', 'which', '5', 'mhz', 'is', 'only', 'limited', 'by', 'the', 'mechanical', 'motion', 'of', 'the', 'optomechanical', 'structure', 'we', 'additionally', 'demonstrate', 'two', 'other', 'switching', 'schemes', 'harmonic', 'switching', 'in', 'which', 'the', 'mechanical', 'mode', 'remains', 'active', 'but', 'different', 'harmonics', 'of', 'the', 'optical', 'force', 'are', 'used', 'and', 'switching', 'to', 'and', 'from', 'the', 'chaotic', 'regime', 'furthermore', 'the', 'method', 'presented', 'here', 'allows', 'to', 'select', 'any', 'single', 'structure', 'without', 'affecting', 'its', 'surroundings', 'which', 'is', 'an', 'important', 'step', 'towards', 'freely', 'controllable', 'networks', 'of', 'optomechanical', 'phonon', 'emitters']] | [-0.13891320279574446, 0.18175226507168815, -0.05198548790792921, 0.003346402294245427, -0.0824524887110858, -0.19116640625440556, 0.07267082232311547, 0.4618352532458766, -0.2952711460414536, -0.29584763593215874, 0.0625981461107146, -0.2475419390299453, -0.1359388051972981, 0.2620234528662196, 0.008114200531124239, 0.06710977023433679, 0.03718397065947633, -0.0464075768933348, 0.021899386813553672, -0.16113556273549273, 0.2415803353457401, 0.07240039401671934, 0.3151668098626955, 0.04434393419420733, 0.12047627852028371, -0.04014968034779824, 0.037072600576360734, -0.017235602653733847, -0.06735048677203143, 0.1379603384544056, 0.2951184120197929, 0.005699424741222807, 0.247976174250758, -0.47543642835034694, -0.2258709320395843, 0.07437434213478929, 0.16423824108301344, 0.17094901158892806, -0.03759015170443389, -0.2713556975049781, 0.03812698391603603, -0.12876098820712453, -0.10862837901455913, -0.11971874505347248, -0.019493223287183163, 0.010921299668447371, -0.22170111643131327, 0.03791177596383422, 0.04177415925776867, 0.03533389843586418, -0.03709203808805748, -0.0316700737491466, -0.017209694825409762, 0.13171181263253634, -0.06300485766816723, -0.006274740409065524, 0.22012276952897292, -0.14083452246619776, -0.1271831746188393, 0.4125306835524054, -0.040004556155372704, -0.16151027317982222, 0.22462537867503, -0.11339996395529145, -0.05610297209974648, 0.12895206165621462, 0.18624712943615715, 0.07545617938374624, -0.16964345191946198, 0.0036704190593361313, 0.07589937130592152, 0.20952013773384734, 0.08636517711613634, 0.121306746793182, 0.2313731418616602, 0.17672792745412189, 0.04116435699664132, 0.18253176378430394, -0.07571884688745806, -0.02628500673443007, -0.23786481727445544, -0.15171435095171854, -0.1826535604767904, 0.056636375717026885, -0.05234347098960557, -0.13408928785157043, 0.3967946420180733, 0.1467180540816125, 0.13082708765590645, -0.024935046771871926, 0.3178448543775881, 0.09152680930553864, 0.12466788625655074, 0.06348297408453508, 0.3065388260391239, 0.15228961444243896, 0.07479796693142918, -0.2515422111154412, 0.0162252239142837, -0.04425867286101343] |
1,802.01147 | Identifying the global terror hubs and vulnerable motifs using complex
network dynamics | Terrorism instills fear in the minds of people and takes away the freedom of
individuals to act as they will. Terrorism has turned out to be an
international menace today. Here, we study the terrorist attack incidents which
occurred in the last half-century across the globe from the open source, Global
Terrorism Database, and develop a view on their spatio-temporal dynamics. We
construct a complex network of global terrorism and study its growth dynamics,
along with the statistical properties of the anti-social network, which are
quite intriguing. Normally, each nation pursues its own vision of international
security based upon its mandate and particular notions of politics and its
policies to counter the threat of terrorism that could naturally include the
use of tactical measures and strategic negotiations, or even physical power. We
study the network resilience against targeted attacks and random failures,
which could guide the counterterrorist outfits in designing strategies to fight
terrorism. We then use a disparity filter method to isolate backbone of the
network, and identify the terror hubs and vulnerable motifs of global
terrorism. We also examine evolution of the hubs and motifs in a few exemplary
cases like Afghanistan, Colombia, India, Israel, Pakistan and the United
Kingdom. The dynamics of the terror hubs and the vulnerable motifs that we
discover in the network backbone turn out to be very significant, and may
provide deep insight on their formations and spreading, and thereby help in
contending terrorism or framing public policies that can check their spread.
| physics.soc-ph cs.SI | terrorism instills fear in the minds of people and takes away the freedom of individuals to act as they will terrorism has turned out to be an international menace today here we study the terrorist attack incidents which occurred in the last halfcentury across the globe from the open source global terrorism database and develop a view on their spatiotemporal dynamics we construct a complex network of global terrorism and study its growth dynamics along with the statistical properties of the antisocial network which are quite intriguing normally each nation pursues its own vision of international security based upon its mandate and particular notions of politics and its policies to counter the threat of terrorism that could naturally include the use of tactical measures and strategic negotiations or even physical power we study the network resilience against targeted attacks and random failures which could guide the counterterrorist outfits in designing strategies to fight terrorism we then use a disparity filter method to isolate backbone of the network and identify the terror hubs and vulnerable motifs of global terrorism we also examine evolution of the hubs and motifs in a few exemplary cases like afghanistan colombia india israel pakistan and the united kingdom the dynamics of the terror hubs and the vulnerable motifs that we discover in the network backbone turn out to be very significant and may provide deep insight on their formations and spreading and thereby help in contending terrorism or framing public policies that can check their spread | [['terrorism', 'instills', 'fear', 'in', 'the', 'minds', 'of', 'people', 'and', 'takes', 'away', 'the', 'freedom', 'of', 'individuals', 'to', 'act', 'as', 'they', 'will', 'terrorism', 'has', 'turned', 'out', 'to', 'be', 'an', 'international', 'menace', 'today', 'here', 'we', 'study', 'the', 'terrorist', 'attack', 'incidents', 'which', 'occurred', 'in', 'the', 'last', 'halfcentury', 'across', 'the', 'globe', 'from', 'the', 'open', 'source', 'global', 'terrorism', 'database', 'and', 'develop', 'a', 'view', 'on', 'their', 'spatiotemporal', 'dynamics', 'we', 'construct', 'a', 'complex', 'network', 'of', 'global', 'terrorism', 'and', 'study', 'its', 'growth', 'dynamics', 'along', 'with', 'the', 'statistical', 'properties', 'of', 'the', 'antisocial', 'network', 'which', 'are', 'quite', 'intriguing', 'normally', 'each', 'nation', 'pursues', 'its', 'own', 'vision', 'of', 'international', 'security', 'based', 'upon', 'its', 'mandate', 'and', 'particular', 'notions', 'of', 'politics', 'and', 'its', 'policies', 'to', 'counter', 'the', 'threat', 'of', 'terrorism', 'that', 'could', 'naturally', 'include', 'the', 'use', 'of', 'tactical', 'measures', 'and', 'strategic', 'negotiations', 'or', 'even', 'physical', 'power', 'we', 'study', 'the', 'network', 'resilience', 'against', 'targeted', 'attacks', 'and', 'random', 'failures', 'which', 'could', 'guide', 'the', 'counterterrorist', 'outfits', 'in', 'designing', 'strategies', 'to', 'fight', 'terrorism', 'we', 'then', 'use', 'a', 'disparity', 'filter', 'method', 'to', 'isolate', 'backbone', 'of', 'the', 'network', 'and', 'identify', 'the', 'terror', 'hubs', 'and', 'vulnerable', 'motifs', 'of', 'global', 'terrorism', 'we', 'also', 'examine', 'evolution', 'of', 'the', 'hubs', 'and', 'motifs', 'in', 'a', 'few', 'exemplary', 'cases', 'like', 'afghanistan', 'colombia', 'india', 'israel', 'pakistan', 'and', 'the', 'united', 'kingdom', 'the', 'dynamics', 'of', 'the', 'terror', 'hubs', 'and', 'the', 'vulnerable', 'motifs', 'that', 'we', 'discover', 'in', 'the', 'network', 'backbone', 'turn', 'out', 'to', 'be', 'very', 'significant', 'and', 'may', 'provide', 'deep', 'insight', 'on', 'their', 'formations', 'and', 'spreading', 'and', 'thereby', 'help', 'in', 'contending', 'terrorism', 'or', 'framing', 'public', 'policies', 'that', 'can', 'check', 'their', 'spread']] | [-0.13365117548946218, 0.0544940796162373, -0.10287646839140828, 0.12214886997620683, -0.10359039978988199, -0.13735846770426116, 0.11203098997855222, 0.35115727121440554, -0.26413264102770023, -0.2928146368610751, 0.15560758526317298, -0.3267403752739395, -0.2271899564012167, 0.12919782804340185, -0.13020289857800765, -0.002146596452277378, 0.0363800407398537, 0.03550972464790354, 0.07113604834368714, -0.275228599460429, 0.292899291528516, 0.09967112003888254, 0.30894165836745896, 0.05838070214299642, 0.059848039985136936, -0.005205972217412359, -0.0566331477560866, -0.009892447968429979, -0.08645359633149029, 0.13340544972351817, 0.32932221660218447, 0.22831058461054501, 0.3651238525731407, -0.4737241325009779, -0.1880861093186358, 0.11813464231441269, 0.11340178519367693, 0.09279955974938983, 0.010144553337074128, -0.3682485461407098, 0.0669476372534858, -0.22557977208845229, -0.13035082186284255, -0.08558414945702432, 0.005360526762445491, 0.04989861248268645, -0.191298325340372, -0.008275281883945435, 0.004049399749835931, 0.09466066683668747, -0.006951813539303091, -0.0560650477657117, -0.08542858500007436, 0.24936976907288574, 0.08241517697068224, -0.03021313567051148, 0.19545311868297363, -0.17992934146914705, -0.14346239816731246, 0.3572289258948561, 0.020457682012763607, -0.09667931921241513, 0.2013707120227721, -0.07297591262508228, -0.17430726930229778, 0.04696955498173294, 0.2689088768574473, 0.05596862442623852, -0.1491600407921451, -0.017868651085333098, -0.024246297795867854, 0.14593519842047356, 0.08540166096306447, 0.024851543157469916, 0.23062708715433217, 0.19319302282468173, 0.10694890035022739, 0.1002452295193127, -0.08883307757951042, -0.1310947810025721, -0.19172313448086561, -0.10413109929951649, -0.07436810338301172, 0.03494115725603099, -0.06431597167908647, -0.15670512733601963, 0.431644709032762, 0.1849479847868164, 0.1402438181044766, 0.02345398441553172, 0.25247098165040605, -0.03804049274770087, 0.09011500926751898, 0.10435764007382543, 0.20263326078107258, 0.01023379247027812, 0.16627100761792807, -0.1565944505453364, 0.16702743293904515, -0.024066705497128544] |
1,802.01148 | Spectral Characterizations of Solvability and Stability for Delay
Differential-Algebraic Equations | The solvability and stability analysis of linear time invariant systems of
delay differential-algebraic equations (DDAEs) is analyzed. The behavior
approach is applied to DDAEs in order to establish characterizations of their
solvability in terms of spectral conditions. Furthermore, examples are
delivered to demonstrate that the eigenvalue-based approach to analyze the
exponential stability of dynamical system is only valid for a special class of
DDAEs, namely non-advanced. Then, a new concept of weak stability is proposed
and studied for DDAEs whose matrix coefficients pairwise commute.
| math.DS | the solvability and stability analysis of linear time invariant systems of delay differentialalgebraic equations ddaes is analyzed the behavior approach is applied to ddaes in order to establish characterizations of their solvability in terms of spectral conditions furthermore examples are delivered to demonstrate that the eigenvaluebased approach to analyze the exponential stability of dynamical system is only valid for a special class of ddaes namely nonadvanced then a new concept of weak stability is proposed and studied for ddaes whose matrix coefficients pairwise commute | [['the', 'solvability', 'and', 'stability', 'analysis', 'of', 'linear', 'time', 'invariant', 'systems', 'of', 'delay', 'differentialalgebraic', 'equations', 'ddaes', 'is', 'analyzed', 'the', 'behavior', 'approach', 'is', 'applied', 'to', 'ddaes', 'in', 'order', 'to', 'establish', 'characterizations', 'of', 'their', 'solvability', 'in', 'terms', 'of', 'spectral', 'conditions', 'furthermore', 'examples', 'are', 'delivered', 'to', 'demonstrate', 'that', 'the', 'eigenvaluebased', 'approach', 'to', 'analyze', 'the', 'exponential', 'stability', 'of', 'dynamical', 'system', 'is', 'only', 'valid', 'for', 'a', 'special', 'class', 'of', 'ddaes', 'namely', 'nonadvanced', 'then', 'a', 'new', 'concept', 'of', 'weak', 'stability', 'is', 'proposed', 'and', 'studied', 'for', 'ddaes', 'whose', 'matrix', 'coefficients', 'pairwise', 'commute']] | [-0.169273476217346, 0.012491377945764956, -0.08496501235044505, 0.06968134703922522, -0.05807068416321403, -0.15485930716175675, -0.010866074793388596, 0.32282427522909257, -0.2913190067622317, -0.2520206788307931, 0.14954424909237457, -0.23249269274893744, -0.16735698437565064, 0.2012635743447456, -0.06935028382857521, 0.12611854604883008, 0.04921352551935847, 0.07874540241536157, -0.11526410492327828, -0.26608643707740737, 0.329804057771542, 0.004441955609314413, 0.26993139617773426, 0.041042982796992526, 0.14349212785846138, -0.018010508754369187, -0.018078796172806298, 0.05816832783699305, -0.135034691039294, 0.09876488702629793, 0.25013908593500234, 0.10759055875915002, 0.2696902291422867, -0.35831110314073333, -0.1957330618682037, 0.10827461951019535, 0.10152876637988241, 0.05831418578030474, -0.01161490542342864, -0.2834703359775335, 0.1659887340480843, -0.14718590818166014, -0.16361437111262636, -0.12844828509372178, 0.02400031115814864, 0.07964454705445433, -0.31261814823261946, 0.07905945475269334, 0.09800267452198777, 0.059151985699378226, -0.10413765340078487, -0.056247011367063296, 0.00142660950231983, 0.09412084399801061, 0.037734164438401184, -0.10106047231659114, 0.046623884604862297, -0.06836839722531163, -0.09238406284768359, 0.37296093762459526, -0.07529309310344418, -0.23465284625494695, 0.1834736557183675, -0.09412492406610624, -0.12460713293010661, 0.11625453852908124, 0.20798303395599485, 0.14260784726230855, -0.20177206758364855, 0.10875745091996862, -0.02595914406589715, 0.1582313491233501, 0.06421761492446783, 0.0745645882786218, 0.056076021741581966, 0.1435301688903696, 0.0974079801992749, 0.16748888586389732, 0.005940002450966333, -0.13947106419826846, -0.29958256228591307, -0.13534058131142912, -0.15587528346734772, 0.020141661875454867, -0.06915234400103912, -0.1613593250681388, 0.4295863372284964, 0.13081580098067602, 0.1383293850111764, 0.10229684532260949, 0.23494481964104147, 0.18345863097179008, -0.003637136552056455, 0.020581573067237874, 0.23620283510535955, 0.2014525090175939, 0.08404444172103183, -0.2376493753371648, 0.06784540277355945, 0.15193260604156608] |
1,802.01149 | A note on the existence of proper weakly cyclic $Z$ symmetric manifolds | The object of the present note is to discuss about the defining condition of
weakly cyclic Ricci symmetric manifolds and weakly cyclic $Z$-symmetric
manifolds \cite{DMS15} and the existence of such notion by proper examples.
| math.DG | the object of the present note is to discuss about the defining condition of weakly cyclic ricci symmetric manifolds and weakly cyclic zsymmetric manifolds citedms15 and the existence of such notion by proper examples | [['the', 'object', 'of', 'the', 'present', 'note', 'is', 'to', 'discuss', 'about', 'the', 'defining', 'condition', 'of', 'weakly', 'cyclic', 'ricci', 'symmetric', 'manifolds', 'and', 'weakly', 'cyclic', 'zsymmetric', 'manifolds', 'citedms15', 'and', 'the', 'existence', 'of', 'such', 'notion', 'by', 'proper', 'examples']] | [-0.22467317082213634, 0.1408909575371636, -0.049795364340146385, 0.058913715430676486, -0.1425128991179394, -0.14402902950391624, -0.07717952101886498, 0.35622109862213786, -0.276282933879305, -0.22933697519880353, 0.17413972447993178, -0.21306935875591906, -0.16701964593746446, 0.14070506312065956, -0.14805562516222848, -0.034439934361161606, 0.08839696747335521, 0.11689278641433427, -0.08648236005595236, -0.24373625534953494, 0.5197901626427969, 0.024411895989694378, 0.1947018706211538, 0.10956551776634472, 0.159448101777922, -0.02183954728146394, -0.06403248134831135, 0.009565606628629294, -0.2065434264527126, 0.11612287843882134, 0.22559140938701053, 0.11143028171676578, 0.189360629089854, -0.33471800821522874, -0.1793022116815502, 0.1846264503670461, 0.06325963430219528, 0.054216423495249313, -0.03191750418310138, -0.3155377543333805, 0.15327332513124653, -0.11223970206849503, -0.19582213631965165, -0.0841320412741466, 0.031926474392865646, 0.04305847519726464, -0.17523163748961507, 0.043989665919181076, 0.2093917236409404, 0.08835997327343759, -0.05576817869124087, -0.037034871987998486, -0.03367705804747388, 0.04735625140143163, 0.04898670142883378, -0.020213468254289844, 0.0928638589878877, -0.09296087486048539, -0.09350739961320703, 0.35858119866161636, -0.07708332557795626, -0.22995661419223656, 0.17655168202790347, -0.06646695607482936, -0.12140858591054425, 0.06436112939351887, 0.09238664208996025, 0.23884554839495456, -0.11003773688395141, 0.10797871760389005, -0.0949489941651171, 0.06759035616591008, 0.09468755038511573, 0.04857191773639484, 0.16095889325846324, 0.09434162531838272, 0.16076236933639104, 0.1814509807013427, 0.009692685140180402, -0.09993107196395144, -0.3720095218582587, -0.1873381414140264, -0.09761221089513239, 0.1225355604211941, -0.13202703080870296, -0.2037568644930919, 0.39534092158304923, 0.009609286193594788, 0.1784313161377654, 0.11750132745752732, 0.19552905654365366, -0.0010241291231729767, -0.0095302543010224, 0.08414885163250746, 0.17538444398704803, 0.2535374378009389, 0.013528537484958317, -0.1711662774482234, -0.019369086998543054, 0.16000462134340496] |
1,802.0115 | Desingularization of First Order Linear Difference Systems with Rational
Function Coefficients | It is well known that for a first order system of linear difference equations
with rational function coefficients, a solution that is holomorphic in some
left half plane can be analytically continued to a meromorphic solution in the
whole complex plane. The poles stem from the singularities of the rational
function coefficients of the system. Just as for differential equations, not
all of these singularities necessarily lead to poles in solutions, as they
might be what is called removable. In our work, we show how to detect and
remove these singularities and further study the connection between poles of
solutions and removable singularities. We describe two algorithms to
(partially) desingularize a given difference system and present a
characterization of removable singularities in terms of shifts of the original
system.
| cs.SC | it is well known that for a first order system of linear difference equations with rational function coefficients a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole complex plane the poles stem from the singularities of the rational function coefficients of the system just as for differential equations not all of these singularities necessarily lead to poles in solutions as they might be what is called removable in our work we show how to detect and remove these singularities and further study the connection between poles of solutions and removable singularities we describe two algorithms to partially desingularize a given difference system and present a characterization of removable singularities in terms of shifts of the original system | [['it', 'is', 'well', 'known', 'that', 'for', 'a', 'first', 'order', 'system', 'of', 'linear', 'difference', 'equations', 'with', 'rational', 'function', 'coefficients', 'a', 'solution', 'that', 'is', 'holomorphic', 'in', 'some', 'left', 'half', 'plane', 'can', 'be', 'analytically', 'continued', 'to', 'a', 'meromorphic', 'solution', 'in', 'the', 'whole', 'complex', 'plane', 'the', 'poles', 'stem', 'from', 'the', 'singularities', 'of', 'the', 'rational', 'function', 'coefficients', 'of', 'the', 'system', 'just', 'as', 'for', 'differential', 'equations', 'not', 'all', 'of', 'these', 'singularities', 'necessarily', 'lead', 'to', 'poles', 'in', 'solutions', 'as', 'they', 'might', 'be', 'what', 'is', 'called', 'removable', 'in', 'our', 'work', 'we', 'show', 'how', 'to', 'detect', 'and', 'remove', 'these', 'singularities', 'and', 'further', 'study', 'the', 'connection', 'between', 'poles', 'of', 'solutions', 'and', 'removable', 'singularities', 'we', 'describe', 'two', 'algorithms', 'to', 'partially', 'desingularize', 'a', 'given', 'difference', 'system', 'and', 'present', 'a', 'characterization', 'of', 'removable', 'singularities', 'in', 'terms', 'of', 'shifts', 'of', 'the', 'original', 'system']] | [-0.18108987140260788, 0.01197534971401211, -0.11531996053585768, 0.0924798544819373, -0.10549672653306594, -0.10474306022632839, 0.019437147609441895, 0.3080239040098449, -0.30273943868747283, -0.2082142795457743, 0.14550496801349755, -0.32077303898697646, -0.22427429305028546, 0.17974277406699898, -0.07554027391958607, 0.0513853469571142, 0.04082630276806335, 0.038090925497659876, -0.08832895467256362, -0.25513168548544246, 0.400988399794744, -0.03509416333724593, 0.15298642950717273, 0.07982990559724759, 0.12191344436272517, -0.03967107511161603, 0.007662384236563546, 0.03468344041846635, -0.12159370937506044, 0.060498730248822144, 0.3014228735227398, 0.11009826426675846, 0.22162578253494214, -0.4107409541949976, -0.15734544638977493, 0.1374061662972681, 0.2003534813194947, 0.07246769338037616, -0.004508382033433967, -0.2118972156759958, 0.09667896581615155, -0.11071488635195781, -0.2306123020185172, -0.08989938129779211, -0.010871061284542662, 0.06837372573060092, -0.2213358165689044, 0.05121357512277688, 0.08880158417854574, 0.03385228348188391, -0.0695382067536603, -0.06664902959091142, -0.03795418208970349, 0.12735741568888112, 0.022878388487168746, 0.04145916892295025, 0.04123986615662196, -0.1315561740355956, -0.09600822685842308, 0.35477520316088385, -0.060583675472434005, -0.28665427480961464, 0.16739684809721256, -0.21697050879543373, -0.09265281644815854, 0.1629914568823784, 0.15259531889717246, 0.16616600405699175, -0.14473528830811036, 0.07982698143748639, -0.028974456142258735, 0.1301237559667969, 0.13528499750658696, -0.00029441072107401007, 0.18965889713474254, 0.049099939927195246, 0.0742959113206801, 0.11377098502829498, 0.004674578043578063, -0.09245704243667136, -0.35971479301608, -0.18508652171351073, -0.11787414565491093, 0.06096164748452102, -0.04948774725875579, -0.22285523681446565, 0.411846764616726, 0.09660606102498118, 0.24014720624644859, 0.03910333328598807, 0.25995944166021756, 0.16253225139591324, 0.06667550468894963, 0.031569098187393924, 0.21554502088133454, 0.11491676568696203, 0.06945264437632967, -0.1894906552367692, 0.025306506522808424, 0.10464867620996034] |
1,802.01151 | Uniqueness in law for stable-like processes of variable order | Let $d\ge1$. Consider a stable-like operator of variable order \begin{align*}
\mathcal{A}f(x) & =\int_{\mathbb{R}^{d} \backslash\{0\}} \left[f(x+h) -f(x)
-\mathbf{1}_{\{|h|\le1\}}h \cdot\nabla
f(x)\right]\frac{n(x,h)}{|h|^{d+\alpha(x)}} \mathrm{d}h, \end{align*} where
$0<\inf_{x}\alpha(x) \le \sup_{x}\alpha(x)<2$ and $n(x,h)$ satisfies \[
n(x,h)=n(x,-h),\quad0<\kappa_{1}\le n(x,h)\le\kappa_{2},\quad\forall x,h\in
\mathbb{R}^{d}, \] with $\kappa_{1}$ and $\kappa_{2}$ being some positive
constants. Under some further mild conditions on the functions $n(x,h)$ and
$\alpha(x)$, we show the uniqueness of solutions to the martingale problem for
$\mathcal{A}$.
| math.PR | let dge1 consider a stablelike operator of variable order beginalign mathcalafx int_mathbbrd backslash0 leftfxh fx mathbf1_hle1h cdotnabla fxrightfracnxhhdalphax mathrmdh endalign where 0inf_xalphax le sup_xalphax2 and nxh satisfies nxhnxhquad0kappa_1le nxhlekappa_2quadforall xhin mathbbrd with kappa_1 and kappa_2 being some positive constants under some further mild conditions on the functions nxh and alphax we show the uniqueness of solutions to the martingale problem for mathcala | [['let', 'dge1', 'consider', 'a', 'stablelike', 'operator', 'of', 'variable', 'order', 'beginalign', 'mathcalafx', 'int_mathbbrd', 'backslash0', 'leftfxh', 'fx', 'mathbf1_hle1h', 'cdotnabla', 'fxrightfracnxhhdalphax', 'mathrmdh', 'endalign', 'where', '0inf_xalphax', 'le', 'sup_xalphax2', 'and', 'nxh', 'satisfies', 'nxhnxhquad0kappa_1le', 'nxhlekappa_2quadforall', 'xhin', 'mathbbrd', 'with', 'kappa_1', 'and', 'kappa_2', 'being', 'some', 'positive', 'constants', 'under', 'some', 'further', 'mild', 'conditions', 'on', 'the', 'functions', 'nxh', 'and', 'alphax', 'we', 'show', 'the', 'uniqueness', 'of', 'solutions', 'to', 'the', 'martingale', 'problem', 'for', 'mathcala']] | [-0.18597140594148168, 0.07941311537562047, -0.0050095198356418635, 0.05430802220807356, -0.041026261420555266, -0.22185697084219724, -0.01846448436160298, 0.3497646783122464, -0.3384190571366572, -0.041748770987432376, 0.16731987023433925, -0.3696858345293531, -0.075224692257596, 0.17958379967832097, -0.09169992242081493, 0.0646847670295221, -0.006961765406908942, 0.056100049759170004, -0.06564171979313388, -0.21364782323750356, 0.3790619293063441, -0.1755472527926459, 0.11816631515017327, 0.09659318557789769, 0.1828462185849454, -0.0013223005659586074, 0.09805592538346079, -0.060435337977776046, -0.33484595973391595, -0.0017881520918807854, 0.2068359206120173, 0.09812080696699958, 0.3304319467541634, -0.347383164659179, -0.10024618614903268, 0.28052025907399025, 0.11278154635254074, -0.18039609608696958, -0.009674693396150628, -0.32332689348863913, 0.16085271902071932, -0.024084016625933787, -0.15605971072891764, -0.08545068057947884, 0.08400182543760713, 0.12492935195126954, -0.5047938592147594, 0.12988668780627788, 0.1039731636022528, 0.014432617848939901, -0.12541585344382944, -0.22957542447336748, -0.03212573387495735, -0.024899163429497505, 0.05793812710965308, 0.10311054141379382, 0.00448269570501996, -0.0490069050780114, -0.0032202262139203503, 0.3236007836610809, -0.08178227954754132, -0.3229190310938101, 0.04874502603585521, -0.25175603815153536, -0.20384590030081717, 0.0081385969019988, 0.0897706947837244, 0.18108007055250744, -0.1054516620568785, 0.25652105897760896, -0.09834264483595011, 0.13864021365959928, 0.11266322322555032, 0.03947524032464214, -0.007595086835470854, 0.02451642719553966, 0.13522203104894645, 0.11551256340873592, 0.04761102381413437, -0.014157439499874325, -0.3943985295938511, -0.1281005379460825, -0.09703310710542343, 0.2156488711982235, -0.19631792935365858, -0.13014944653738947, 0.26152688308673744, 0.07717187742830492, 0.15687739801611386, 0.16115746758513005, 0.09100546183831551, 0.17656599538510337, -0.08550050558851045, 0.08769589934644162, 0.016980743562681692, 0.17422018645733012, 0.0839649083038025, -0.19759211383358227, 0.08024054312822866, 0.14901277886740133] |
1,802.01152 | Testing to distinguish measures on metric spaces | We study the problem of distinguishing between two distributions on a metric
space; i.e., given metric measure spaces $({\mathbb X}, d, \mu_1)$ and
$({\mathbb X}, d, \mu_2)$, we are interested in the problem of determining from
finite data whether or not $\mu_1$ is $\mu_2$. The key is to use pairwise
distances between observations and, employing a reconstruction theorem of
Gromov, we can perform such a test using a two sample Kolmogorov--Smirnov test.
A real analysis using phylogenetic trees and flu data is presented.
| stat.ME cs.CG stat.ML | we study the problem of distinguishing between two distributions on a metric space ie given metric measure spaces mathbb x d mu_1 and mathbb x d mu_2 we are interested in the problem of determining from finite data whether or not mu_1 is mu_2 the key is to use pairwise distances between observations and employing a reconstruction theorem of gromov we can perform such a test using a two sample kolmogorovsmirnov test a real analysis using phylogenetic trees and flu data is presented | [['we', 'study', 'the', 'problem', 'of', 'distinguishing', 'between', 'two', 'distributions', 'on', 'a', 'metric', 'space', 'ie', 'given', 'metric', 'measure', 'spaces', 'mathbb', 'x', 'd', 'mu_1', 'and', 'mathbb', 'x', 'd', 'mu_2', 'we', 'are', 'interested', 'in', 'the', 'problem', 'of', 'determining', 'from', 'finite', 'data', 'whether', 'or', 'not', 'mu_1', 'is', 'mu_2', 'the', 'key', 'is', 'to', 'use', 'pairwise', 'distances', 'between', 'observations', 'and', 'employing', 'a', 'reconstruction', 'theorem', 'of', 'gromov', 'we', 'can', 'perform', 'such', 'a', 'test', 'using', 'a', 'two', 'sample', 'kolmogorovsmirnov', 'test', 'a', 'real', 'analysis', 'using', 'phylogenetic', 'trees', 'and', 'flu', 'data', 'is', 'presented']] | [-0.14862211923821864, 0.07769844463341925, -0.10481070720377457, 0.11134364404182612, -0.039742508342108095, -0.1551469015462481, 0.04213077089109694, 0.39244708750980445, -0.2588943063719086, -0.25778749428061115, 0.09336093544864646, -0.36123967649841526, -0.10890205819103642, 0.1788883952687618, -0.08681646874034216, 0.05654164367770574, 0.07415175152810519, 0.05706807237163366, -0.08967503979353302, -0.23727429743452244, 0.37903654979295043, -0.05478101962032807, 0.25226743685373343, 0.03474128805661956, 0.12336031203045993, -0.006542308822678155, -0.0654268835626363, 0.018598486865374138, -0.1930629893652085, 0.0972896363804992, 0.24951067013688474, 0.2119683436544455, 0.27693425214860634, -0.30831474001778514, -0.16119508845843825, 0.2533711850508509, 0.10643542970317495, -0.02337599170944059, 0.010417431602759444, -0.30880713728761455, 0.09582791332694063, -0.08745338653315263, -0.0915900646787451, -0.06346432361415172, 0.06428590867982571, 0.021578241069520634, -0.3210132341125015, 0.05876816360347242, 0.036537927115358505, 0.0880095869055893, -0.03087700130866773, -0.11188092977032964, -0.028315387711108447, 0.1522494153574064, 0.0227486786786018, 0.10938871985985842, 0.055607556808650135, -0.0034340587164084597, -0.10842959279845278, 0.3905540909169309, -0.0719952109123928, -0.2869149622036122, 0.14568678280675268, -0.18230285827653953, -0.14916928892349263, 0.0018774096192006606, 0.19039181553680135, 0.17636649924364076, -0.12255472321826291, 0.12266977831331384, -0.06229609099542161, 0.11387586617191513, 0.07291037940521197, -0.031486740436808894, 0.1546592724071928, 0.15784080465694508, 0.04767006100155413, 0.11548841311961008, -0.12277591696110027, -0.011181861725327256, -0.30920885308050966, -0.13419461272746683, -0.23914306955299822, 0.10194192219021343, -0.15649935403920806, -0.16859977950442986, 0.3267956941321223, 0.10588266666002392, 0.2306132733215948, 0.08675217392843172, 0.23754302921693726, 0.027515978754374636, -0.06194788739169353, 0.07695444968966655, 0.09455255077904966, 0.15722346786095434, -0.024062851595366936, -0.1259576685822019, 0.059473862922021066, 0.11306548242861159] |
1,802.01153 | Painlev\'e IV Critical Asymptotics for Orthogonal Polynomials in the
Complex Plane | We study the asymptotic behaviour of orthogonal polynomials in the complex
plane that are associated to a certain normal matrix model. The model depends
on a parameter and the asymptotic distribution of the eigenvalues undergoes a
transition for a special value of the parameter, where it develops a
corner-type singularity. In the double scaling limit near the transition we
determine the asymptotic behaviour of the orthogonal polynomials in terms of a
solution of the Painlev\'e IV equation. We determine the Fredholm determinant
associated to such solution and we compute it numerically on the real line,
showing also that the corresponding Painlev\'e transcendent is pole-free on a
semiaxis.
| math-ph math.MP | we study the asymptotic behaviour of orthogonal polynomials in the complex plane that are associated to a certain normal matrix model the model depends on a parameter and the asymptotic distribution of the eigenvalues undergoes a transition for a special value of the parameter where it develops a cornertype singularity in the double scaling limit near the transition we determine the asymptotic behaviour of the orthogonal polynomials in terms of a solution of the painleve iv equation we determine the fredholm determinant associated to such solution and we compute it numerically on the real line showing also that the corresponding painleve transcendent is polefree on a semiaxis | [['we', 'study', 'the', 'asymptotic', 'behaviour', 'of', 'orthogonal', 'polynomials', 'in', 'the', 'complex', 'plane', 'that', 'are', 'associated', 'to', 'a', 'certain', 'normal', 'matrix', 'model', 'the', 'model', 'depends', 'on', 'a', 'parameter', 'and', 'the', 'asymptotic', 'distribution', 'of', 'the', 'eigenvalues', 'undergoes', 'a', 'transition', 'for', 'a', 'special', 'value', 'of', 'the', 'parameter', 'where', 'it', 'develops', 'a', 'cornertype', 'singularity', 'in', 'the', 'double', 'scaling', 'limit', 'near', 'the', 'transition', 'we', 'determine', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'orthogonal', 'polynomials', 'in', 'terms', 'of', 'a', 'solution', 'of', 'the', 'painleve', 'iv', 'equation', 'we', 'determine', 'the', 'fredholm', 'determinant', 'associated', 'to', 'such', 'solution', 'and', 'we', 'compute', 'it', 'numerically', 'on', 'the', 'real', 'line', 'showing', 'also', 'that', 'the', 'corresponding', 'painleve', 'transcendent', 'is', 'polefree', 'on', 'a', 'semiaxis']] | [-0.18045763682713298, 0.025151731693359946, -0.102269555476851, 0.05337329400011347, -0.07908816894986362, -0.11163549677460133, 0.04345429046340635, 0.30095318514879826, -0.25156899003712374, -0.17882038739065978, 0.13265893265504877, -0.3081264672735619, -0.20302035109462024, 0.15556924579073197, 0.0030963258017028604, 0.0485598731211552, 0.024013990051086957, 0.10656970232794775, -0.142326891718206, -0.17868677815683534, 0.37149512849608873, -0.012520465199078354, 0.2537644683909994, 0.0199028647147885, 0.10511905887973642, -0.03647813780558846, 0.031283094082027674, -0.030628711213662386, -0.1649060724527525, 0.04462996406576413, 0.22192298310099465, 0.09200180573040777, 0.2068412715316724, -0.32066779014454266, -0.10906289183647833, 0.16600952973310776, 0.18895101293521088, 0.05120104879018999, 0.005708854642226665, -0.2586172581345679, 0.06858411906112995, -0.14685424263415006, -0.25307322624270046, -0.03855316235605523, 0.01535705252437391, 0.06681094358884077, -0.28764929808676243, 0.06921826837182907, 0.057414394124437156, 0.0358515817532751, -0.0504261481044727, -0.07389142367309917, -0.019329454627967327, 0.07530817388617825, 0.05131172100691316, -0.04096308425634612, 0.05005530439068076, -0.15353194244802174, -0.031062913553737033, 0.36283494172526404, -0.0677392301715423, -0.2305147943791942, 0.10492723804646145, -0.19894578248897793, -0.13428058863016906, 0.13225699081760178, 0.15032184897774012, 0.15128696150207352, -0.06934475437433363, 0.15057837709492924, -0.06008474458287531, 0.10748747435929341, 0.07300504873437093, -0.03380823446106966, 0.14395544344611536, 0.09789027144836489, 0.03742683801591118, 0.1585723433217086, -0.06325238026900513, -0.15999269992043483, -0.35597894671503627, -0.2131448175636268, -0.19604394503621053, 0.07230835246514077, -0.17412278597067962, -0.24903925644042335, 0.46189161289100333, 0.11193242461951537, 0.2415975694474982, 0.06450183539015945, 0.19124975938907016, 0.23265572673876153, 0.004103244769726401, 0.03507843046562276, 0.22074138454953643, 0.15546949097677787, 0.08135183540686408, -0.2717135802616374, 0.05686024646927541, 0.14250162325877802] |
1,802.01154 | Full counting statistics in the free Dirac theory | We study charge transport and fluctuations of the (3+1)-dimensional massive
free Dirac theory. In particular, we focus on the steady state that emerges
following a local quench whereby two independently thermalized halves of the
system are connected and let to evolve unitarily for a long time. Based on the
two-time von Neumann measurement statistics and exact computations, the scaled
cumulant generating function associated with the charge transport is derived.
We find that it can be written as a generalization of Levitov-Lesovik formula
to the case in three spatial dimensions. In the massless case, we note that
only the first four scaled cumulants are nonzero. Our results provide also a
direct confirmation for the validity of the extended fluctuation relation in
higher dimensions. An application of our approach to Lifshitz fermions is also
briefly discussed.
| cond-mat.stat-mech cond-mat.str-el hep-th | we study charge transport and fluctuations of the 31dimensional massive free dirac theory in particular we focus on the steady state that emerges following a local quench whereby two independently thermalized halves of the system are connected and let to evolve unitarily for a long time based on the twotime von neumann measurement statistics and exact computations the scaled cumulant generating function associated with the charge transport is derived we find that it can be written as a generalization of levitovlesovik formula to the case in three spatial dimensions in the massless case we note that only the first four scaled cumulants are nonzero our results provide also a direct confirmation for the validity of the extended fluctuation relation in higher dimensions an application of our approach to lifshitz fermions is also briefly discussed | [['we', 'study', 'charge', 'transport', 'and', 'fluctuations', 'of', 'the', '31dimensional', 'massive', 'free', 'dirac', 'theory', 'in', 'particular', 'we', 'focus', 'on', 'the', 'steady', 'state', 'that', 'emerges', 'following', 'a', 'local', 'quench', 'whereby', 'two', 'independently', 'thermalized', 'halves', 'of', 'the', 'system', 'are', 'connected', 'and', 'let', 'to', 'evolve', 'unitarily', 'for', 'a', 'long', 'time', 'based', 'on', 'the', 'twotime', 'von', 'neumann', 'measurement', 'statistics', 'and', 'exact', 'computations', 'the', 'scaled', 'cumulant', 'generating', 'function', 'associated', 'with', 'the', 'charge', 'transport', 'is', 'derived', 'we', 'find', 'that', 'it', 'can', 'be', 'written', 'as', 'a', 'generalization', 'of', 'levitovlesovik', 'formula', 'to', 'the', 'case', 'in', 'three', 'spatial', 'dimensions', 'in', 'the', 'massless', 'case', 'we', 'note', 'that', 'only', 'the', 'first', 'four', 'scaled', 'cumulants', 'are', 'nonzero', 'our', 'results', 'provide', 'also', 'a', 'direct', 'confirmation', 'for', 'the', 'validity', 'of', 'the', 'extended', 'fluctuation', 'relation', 'in', 'higher', 'dimensions', 'an', 'application', 'of', 'our', 'approach', 'to', 'lifshitz', 'fermions', 'is', 'also', 'briefly', 'discussed']] | [-0.14025068639016558, 0.17035759664446884, -0.10929150466890589, 0.0764468885843517, -0.007364450842698119, -0.1223625094497771, -0.006096822783913908, 0.31210925532400663, -0.2130260844037298, -0.2320754269151879, 0.07627879880340908, -0.2958776036680523, -0.12463385106842798, 0.19697957750889403, -0.004682784257178653, 0.01834114924735223, 0.026837985143785447, 0.046879182771454676, -0.11781915665496447, -0.25447647230970716, 0.3397803350791349, 0.00914201305339933, 0.29143062141487625, 0.06799738541586019, 0.08571113438220389, 0.025906975528767417, -0.01156633670803215, 0.05653704848373309, -0.14463708038113224, 0.07036973286851017, 0.2036434337149249, 0.04771039431911212, 0.21734605427247597, -0.42727592306684203, -0.18245141452122757, 0.08361443733004158, 0.16556379474254687, 0.11817229414052928, -0.03890273160884963, -0.26091384482848, 0.07594068467603135, -0.2120888578434433, -0.17033613822422922, -0.08099844470036341, 0.007310697765423179, -0.0026457411873001438, -0.2558132276189194, 0.13701584202683975, 0.054765758867403355, 0.006423201106698078, -0.0650309111267926, -0.07987336734737228, -0.028988961175556726, 0.12129351788951057, 0.04096463422911935, 0.006610290712065327, 0.10751382616320763, -0.09834974440885012, -0.1146798302721816, 0.33621336127381163, -0.09487542194321251, -0.23446864210270735, 0.1787300902112985, -0.18304425389714427, -0.1488406899378204, 0.04579822570363532, 0.12043373309833401, 0.12371474788385207, -0.15658164130690605, 0.06524290637775157, -0.06518413271379671, 0.1309506415264375, 0.043571843324340324, 0.040510015037438986, 0.20705675068415647, 0.1256142660763476, 0.042707527146688594, 0.1651538268101763, -0.03880915107985666, -0.1292905734049212, -0.3638924158720383, -0.19089466915987155, -0.2347252320206321, 0.08878821420219185, -0.08534339918447016, -0.1562268826693519, 0.3986439425706752, 0.17628628330013313, 0.16784935117240496, 0.07854895404915312, 0.2497429183454934, 0.18819385819196172, 0.022310200397536825, 0.07069419149948812, 0.1938514048485572, 0.1548679670676895, 0.1029947912250993, -0.23252831341841243, -0.027090351931305965, 0.10883805632014383] |
1,802.01155 | Higher regularity of the "tangential" fields in the relativistic
Vlasov-Maxwell system | It is shown that the "tangential" electric and magnetic fields, in the
Glassey-Strauss representation formulas, are in fact bounded in $L^\infty_{{\rm
loc},\,t} L^{2+\delta}_x$ for some $\delta>0$.
| math.AP | it is shown that the tangential electric and magnetic fields in the glasseystrauss representation formulas are in fact bounded in linfty_rm loct l2delta_x for some delta0 | [['it', 'is', 'shown', 'that', 'the', 'tangential', 'electric', 'and', 'magnetic', 'fields', 'in', 'the', 'glasseystrauss', 'representation', 'formulas', 'are', 'in', 'fact', 'bounded', 'in', 'linfty_rm', 'loct', 'l2delta_x', 'for', 'some', 'delta0']] | [-0.1756775438738987, 0.17330622144043445, -0.03898721382021904, 0.078539226972498, -0.07589344710111617, -0.08832787722349167, -0.06356345830019564, 0.4069486147165298, -0.27226668417453764, -0.25143081799149514, 0.06236342512536794, -0.25755913242697714, -0.1394340543448925, 0.2602522912621498, -0.06375044388405512, -0.010603067465126514, -0.02105233956128359, 0.1275933676213026, -0.03229738506488502, -0.21391986921429634, 0.2519434580206871, -0.10527939230203628, 0.2523151504993439, 0.115740936268121, 0.08044499462470413, -0.06351146830245852, 0.04835234943777323, 0.03344139763619751, -0.08346955658082152, 0.04600068774074316, 0.2461372097581625, 0.052260209638625384, 0.22076360926032065, -0.3852326621860266, -0.16211182165890933, 0.11252968698740005, 0.12429798102006316, 0.09234479576349258, -0.06066034268587828, -0.2609360782057047, 0.12875066572800278, -0.09881378473713993, -0.14952541064471006, -0.1040630104392767, 0.1096837736107409, 0.08567509777843953, -0.306442831158638, 0.07210279017686844, 0.1625477677816525, 0.06733865208923817, -0.17839680826291443, -0.15119382422417402, -0.026804995220154525, 0.025534815937280655, 0.08514837416820228, 0.1036793901771307, 0.04231836134102195, -0.16873722050338982, -0.021783763989806176, 0.3073411246016622, -0.04913745066151023, -0.2730123060941696, 0.06708220966160297, -0.23402845721691848, -0.13344597890973092, 0.11068845331668854, 0.055543894991278646, 0.11329999163746834, -0.1194766078516841, 0.20445330340182408, -0.05552927233278751, 0.05918371349573135, 0.1206500373594463, -0.007339091207832098, 0.13629359107464553, 0.017561497166752815, 0.11646677739918232, 0.10121114070992916, -0.04222935082623735, -0.05617878101766109, -0.32692634433507917, -0.13494024297222496, -0.2041364149749279, 0.012396095544099808, -0.09626861123309936, -0.15827903291559778, 0.29122315868735316, 0.14492848485708237, 0.13827770311385393, 0.01836920365691185, 0.25622822374105453, 0.13394194349646568, 0.08057592270895839, 0.13437017800286413, 0.24362318358034826, 0.2285917802900076, 0.11926624864339828, -0.1543894703127444, 0.06091732437722385, 0.05796350231568795] |
1,802.01156 | Dynamic density shaping of light driven bacteria | Many motile microorganisms react to environmental light cues with a variety
of motility responses guiding cells towards better conditions for survival and
growth. The use of spatial light modulators could help to elucidate the
mechanisms of photo-movements while, at the same time, providing an efficient
strategy to achieve spatial and temporal control of cell concentration. Here we
demonstrate that millions of bacteria, genetically modified to swim smoothly
with a light controllable speed, can be arranged into complex and
reconfigurable density patterns using a digital light projector. We show that a
homogeneous sea of freely swimming bacteria can be made to morph between
complex shapes. We model non-local effects arising from memory in light
response and show how these can be mitigated by a feedback control strategy
resulting in the detailed reproduction of grayscale density images.
| physics.bio-ph cond-mat.soft | many motile microorganisms react to environmental light cues with a variety of motility responses guiding cells towards better conditions for survival and growth the use of spatial light modulators could help to elucidate the mechanisms of photomovements while at the same time providing an efficient strategy to achieve spatial and temporal control of cell concentration here we demonstrate that millions of bacteria genetically modified to swim smoothly with a light controllable speed can be arranged into complex and reconfigurable density patterns using a digital light projector we show that a homogeneous sea of freely swimming bacteria can be made to morph between complex shapes we model nonlocal effects arising from memory in light response and show how these can be mitigated by a feedback control strategy resulting in the detailed reproduction of grayscale density images | [['many', 'motile', 'microorganisms', 'react', 'to', 'environmental', 'light', 'cues', 'with', 'a', 'variety', 'of', 'motility', 'responses', 'guiding', 'cells', 'towards', 'better', 'conditions', 'for', 'survival', 'and', 'growth', 'the', 'use', 'of', 'spatial', 'light', 'modulators', 'could', 'help', 'to', 'elucidate', 'the', 'mechanisms', 'of', 'photomovements', 'while', 'at', 'the', 'same', 'time', 'providing', 'an', 'efficient', 'strategy', 'to', 'achieve', 'spatial', 'and', 'temporal', 'control', 'of', 'cell', 'concentration', 'here', 'we', 'demonstrate', 'that', 'millions', 'of', 'bacteria', 'genetically', 'modified', 'to', 'swim', 'smoothly', 'with', 'a', 'light', 'controllable', 'speed', 'can', 'be', 'arranged', 'into', 'complex', 'and', 'reconfigurable', 'density', 'patterns', 'using', 'a', 'digital', 'light', 'projector', 'we', 'show', 'that', 'a', 'homogeneous', 'sea', 'of', 'freely', 'swimming', 'bacteria', 'can', 'be', 'made', 'to', 'morph', 'between', 'complex', 'shapes', 'we', 'model', 'nonlocal', 'effects', 'arising', 'from', 'memory', 'in', 'light', 'response', 'and', 'show', 'how', 'these', 'can', 'be', 'mitigated', 'by', 'a', 'feedback', 'control', 'strategy', 'resulting', 'in', 'the', 'detailed', 'reproduction', 'of', 'grayscale', 'density', 'images']] | [-0.08073450472907845, 0.19856268886935902, -0.11534382426874962, 0.016325793740749637, -0.0884274494531912, -0.1688847366977594, 0.03551079204250405, 0.4637808504048735, -0.2993884628096512, -0.31119690871095534, 0.050309848928226354, -0.23242462902510566, -0.21017873844951948, 0.1962196891936265, -0.12292108613491476, 0.006826007826455326, 0.022039157636428892, -0.05626687917114694, 0.04116035371309897, -0.21433060593666758, 0.21617329402812827, 0.01695462927194451, 0.2943567848493303, 0.020209180919189395, 0.13890382171427804, -0.01747620213818528, -0.008698280699161896, 0.030732912630878333, -0.07877489809199226, 0.11775557638611645, 0.23699129701404373, 0.1362425869542744, 0.24999328741462556, -0.5232096222688013, -0.26647882284001456, 0.10017195109794014, 0.17721214739661387, 0.15395952884364986, -0.07919904150402368, -0.27855871357857737, 0.04635135512521018, -0.1041034134973619, -0.17804915290117376, -0.11242651265225749, -0.018772464262064435, 0.0816096115112853, -0.2687540390570439, 0.03789313402332699, -0.015105740990795528, 0.0609124340047476, -0.04960063746921829, -0.04527832710170256, -0.08029305164132323, 0.17119208857792415, -0.0051655187384475635, -0.021418299380022644, 0.23051927828424568, -0.14513913223801403, -0.08552368521454062, 0.3750315411711362, -0.053344672858548256, -0.23945122707718566, 0.2025000822049246, -0.14050069419013808, -0.039882617794088464, 0.13629499712173562, 0.26776090391855967, 0.07290298012154761, -0.16457900317010485, -0.05630378909026787, 0.005902151165377182, 0.21149155637944367, 0.10150640874183667, 0.04707466380726268, 0.23724455299088731, 0.21511229202881066, 0.05036724385164275, 0.10330502446063224, -0.06902505686061818, -0.05817110396560226, -0.19536713846271106, -0.1534633747851059, -0.11565561975880678, 0.04180744380356549, -0.1148545357686252, -0.12415163281526584, 0.4106011365526425, 0.13649793626017756, 0.20556917872085279, 0.05337885118075716, 0.30637654863687147, 0.01707209319348878, 0.09802659930411114, 0.018636547390427163, 0.17859734761278465, 0.06091376608272375, 0.12005725948213002, -0.26084541821845375, 0.0744792068431001, -0.016388272755404016] |
1,802.01157 | Quantum Approximate Optimization with Parallelizable Gates | The quantum approximate optimization algorithm (QAOA) has been introduced as
a heuristic digital quantum computing scheme to find approximate solutions of
combinatorial problems with shallow circuits. We present a scheme to
parallelize this approach for arbitrary all-to-all connected problem graphs in
a layout of quantum bits (qubits) with nearest neighbor interactions. The
protocol consisting of single qubit operations that encode the optimization
problem and all interactions are problem-independent pair-wise CNOT gates among
nearest neighbors. This allows for a parallelizable implementation in quantum
devices with a square lattice geometry. The basis of this proposal is a lattice
gauge model which also introduces additional parameters and protocols for QAOA
to improve the efficiency.
| quant-ph | the quantum approximate optimization algorithm qaoa has been introduced as a heuristic digital quantum computing scheme to find approximate solutions of combinatorial problems with shallow circuits we present a scheme to parallelize this approach for arbitrary alltoall connected problem graphs in a layout of quantum bits qubits with nearest neighbor interactions the protocol consisting of single qubit operations that encode the optimization problem and all interactions are problemindependent pairwise cnot gates among nearest neighbors this allows for a parallelizable implementation in quantum devices with a square lattice geometry the basis of this proposal is a lattice gauge model which also introduces additional parameters and protocols for qaoa to improve the efficiency | [['the', 'quantum', 'approximate', 'optimization', 'algorithm', 'qaoa', 'has', 'been', 'introduced', 'as', 'a', 'heuristic', 'digital', 'quantum', 'computing', 'scheme', 'to', 'find', 'approximate', 'solutions', 'of', 'combinatorial', 'problems', 'with', 'shallow', 'circuits', 'we', 'present', 'a', 'scheme', 'to', 'parallelize', 'this', 'approach', 'for', 'arbitrary', 'alltoall', 'connected', 'problem', 'graphs', 'in', 'a', 'layout', 'of', 'quantum', 'bits', 'qubits', 'with', 'nearest', 'neighbor', 'interactions', 'the', 'protocol', 'consisting', 'of', 'single', 'qubit', 'operations', 'that', 'encode', 'the', 'optimization', 'problem', 'and', 'all', 'interactions', 'are', 'problemindependent', 'pairwise', 'cnot', 'gates', 'among', 'nearest', 'neighbors', 'this', 'allows', 'for', 'a', 'parallelizable', 'implementation', 'in', 'quantum', 'devices', 'with', 'a', 'square', 'lattice', 'geometry', 'the', 'basis', 'of', 'this', 'proposal', 'is', 'a', 'lattice', 'gauge', 'model', 'which', 'also', 'introduces', 'additional', 'parameters', 'and', 'protocols', 'for', 'qaoa', 'to', 'improve', 'the', 'efficiency']] | [-0.1755077128911072, 0.0628125566636791, -0.03095432010642882, 0.031108932637269736, -0.06484874174720398, -0.27746977901237235, 0.11644465970672532, 0.4218373918100386, -0.26580256844560307, -0.3301958848160129, 0.042898901419395265, -0.2328281183623518, -0.1740109055042938, 0.17894185877505792, -0.03348941151010762, 0.11865688428316298, 0.10246083736923095, -0.010173561462612302, -0.08714168415050104, -0.32735050102142066, 0.21304130406949567, 0.02479747096538074, 0.25646951503481147, 0.020449073483898968, 0.15666814142133337, 0.03816697521655409, 0.04564512148499489, -0.01261505821870791, -0.08074595070862775, 0.1636888095060246, 0.266050532611238, 0.125347701729871, 0.26931206823267917, -0.4356091623404273, -0.1758304483567675, 0.11791977983991708, 0.14369779487501258, 0.20226716264759334, -0.02227670298144641, -0.2548620928338989, 0.07586424993686713, -0.18575508618173567, -0.05965905376751425, -0.11047325002423881, 0.01049574147406462, 0.008069327176624053, -0.3032523826905736, 0.006099244950681103, 0.04158566660679843, 0.005600966336960728, 0.05651947383353013, -0.059925876719340146, 0.1002082839683705, 0.09928217128984765, -0.11496674398123916, 0.04209173786944735, 0.10568091802735317, -0.0922865020048276, -0.25620939789826536, 0.37260185527774664, 0.04212639677162106, -0.24192572405209412, 0.11536755649633035, 0.024065020599041705, -0.13859366022704825, 0.06936259675133336, 0.17893027457584804, 0.12137461041712815, -0.17182883354289843, 0.1402817518557296, -0.024758334938638115, 0.1956759943450625, 0.005612235327528135, 0.09304329475622859, 0.15038213315881319, 0.16708753708968158, 0.14908946348303878, 0.19771866958487677, -0.02419590440301879, -0.18875951138283084, -0.24709234880031766, -0.15672080593208806, -0.24423391628813268, 0.04123755987326673, -0.1271554458829226, -0.19362248019483108, 0.3988168619990402, 0.15383667893275652, 0.15982686128333076, 0.06428123702744006, 0.3525220903542799, 0.06760365965562193, 0.11640744624441271, 0.1348244557870334, 0.1545523111330899, 0.16869882183770338, 0.05401091705504302, -0.23115397209872132, 0.01671234587929002, 0.13910644412930082] |
1,802.01158 | A geometric description of Discrete Exterior Calculus for general
triangulations | We revisit the theory of Discrete Exterior Calculus (DEC) in 2D for general
triangulations, relying only on Vector Calculus and Matrix Algebra. We present
DEC numerical solutions of the Poisson equation and compare them against those
found using the Finite Element Method with linear elements (FEML).
| math.DG | we revisit the theory of discrete exterior calculus dec in 2d for general triangulations relying only on vector calculus and matrix algebra we present dec numerical solutions of the poisson equation and compare them against those found using the finite element method with linear elements feml | [['we', 'revisit', 'the', 'theory', 'of', 'discrete', 'exterior', 'calculus', 'dec', 'in', '2d', 'for', 'general', 'triangulations', 'relying', 'only', 'on', 'vector', 'calculus', 'and', 'matrix', 'algebra', 'we', 'present', 'dec', 'numerical', 'solutions', 'of', 'the', 'poisson', 'equation', 'and', 'compare', 'them', 'against', 'those', 'found', 'using', 'the', 'finite', 'element', 'method', 'with', 'linear', 'elements', 'feml']] | [-0.06745112146147424, -0.002818882625756992, -0.0838605887360043, 0.03732678741216659, -0.12768223364320067, -0.1347409628616232, 0.021459240613815687, 0.3421641192916367, -0.3113485866743657, -0.2401344643905759, 0.13826893753009953, -0.2727166903515657, -0.1718276040421592, 0.14755340477244722, -0.08291244107402033, 0.0790008186466164, 0.07224323455658224, 0.047399340238836074, -0.14565152595233585, -0.18818461009197765, 0.3506301301324533, -0.019390426182912455, 0.213519214031597, -0.05336169062389268, 0.1638714474418925, 0.02122860491896669, -0.1424064438790083, 0.006835418732629882, -0.15981299538786212, 0.13160067317076027, 0.2207791460626241, 0.06385385687980387, 0.19357212860551146, -0.503554755780432, -0.16831394098699093, 0.06600499600172043, 0.10409012917015288, 0.09414953773634302, -0.07420071375090628, -0.3108492450167735, 0.14557870436045858, -0.17285131178796292, -0.1436668597575691, -0.06880959140447279, 0.024890047394567065, 0.031640288647678164, -0.23320713653746578, 0.08109008700897297, 0.025233612209558488, 0.1146960285699202, -0.12560949141366615, -0.18208658951593357, -0.0007082528745134671, 0.026785728707909583, -0.03148843850940466, -0.0304850234132674, 0.02682458840103613, -0.01623506595691045, -0.1628926462183396, 0.36978224251005387, -0.056751579439474474, -0.3160444363537762, 0.1253933096718457, -0.1663988961527745, -0.13547710152860318, 0.07659198997749223, 0.13653198471292854, 0.19930195695617134, -0.08873942353659206, 0.21819455846885427, -0.05169273714741899, 0.1256657440836231, 0.08843376785516739, -0.044823115457418475, 0.10496189561155107, 0.100517886897756, 0.03870270560599036, 0.08401233115130001, -0.07293743114827925, -0.2019648286410504, -0.35998493830362954, -0.14282726746880345, -0.08989086849614977, 0.023616806572924056, -0.16989634607129522, -0.19439277719292375, 0.3331182695718275, 0.12608979820377297, 0.09731649317675167, 0.10510107963863347, 0.2630668403373824, 0.17135456386539671, 0.02672622226592567, 0.10319519634875986, 0.18336263460417587, 0.2536732075115045, 0.1070472687172393, -0.1625460382654435, -0.03080871214883195, 0.22043861684699853] |
1,802.01159 | Mining Twitter Conversations around E-commerce Promotional Events | With Social Media platforms establishing themselves as the de facto
destinations for their customers views and opinions, brands around the World
are investing heavily on invigorating their customer connects by utilizing such
platforms to their fullest. In this paper, we develop a novel technique for
mining conversations in Twitter by weaving together all conversations around an
event into one unified graph (Conversation Graph, henceforth). The structure of
the Conversation Graph emerges as a variant of the BOWTIE structure (dubbed
ASKEWBOWTIE henceforth) as a result of the complex communication patterns
amongst these players. Finally, we investigate the structural properties of the
ASKEWBOWTIE structure to understand the configuration of the components and
their temporal evolution.
| cs.SI | with social media platforms establishing themselves as the de facto destinations for their customers views and opinions brands around the world are investing heavily on invigorating their customer connects by utilizing such platforms to their fullest in this paper we develop a novel technique for mining conversations in twitter by weaving together all conversations around an event into one unified graph conversation graph henceforth the structure of the conversation graph emerges as a variant of the bowtie structure dubbed askewbowtie henceforth as a result of the complex communication patterns amongst these players finally we investigate the structural properties of the askewbowtie structure to understand the configuration of the components and their temporal evolution | [['with', 'social', 'media', 'platforms', 'establishing', 'themselves', 'as', 'the', 'de', 'facto', 'destinations', 'for', 'their', 'customers', 'views', 'and', 'opinions', 'brands', 'around', 'the', 'world', 'are', 'investing', 'heavily', 'on', 'invigorating', 'their', 'customer', 'connects', 'by', 'utilizing', 'such', 'platforms', 'to', 'their', 'fullest', 'in', 'this', 'paper', 'we', 'develop', 'a', 'novel', 'technique', 'for', 'mining', 'conversations', 'in', 'twitter', 'by', 'weaving', 'together', 'all', 'conversations', 'around', 'an', 'event', 'into', 'one', 'unified', 'graph', 'conversation', 'graph', 'henceforth', 'the', 'structure', 'of', 'the', 'conversation', 'graph', 'emerges', 'as', 'a', 'variant', 'of', 'the', 'bowtie', 'structure', 'dubbed', 'askewbowtie', 'henceforth', 'as', 'a', 'result', 'of', 'the', 'complex', 'communication', 'patterns', 'amongst', 'these', 'players', 'finally', 'we', 'investigate', 'the', 'structural', 'properties', 'of', 'the', 'askewbowtie', 'structure', 'to', 'understand', 'the', 'configuration', 'of', 'the', 'components', 'and', 'their', 'temporal', 'evolution']] | [-0.14013850081034682, 0.06635497899379433, -0.09547015133483167, 0.09183052481384948, -0.1521983537526632, -0.09390997369773686, 0.07873481315116145, 0.42815023533661256, -0.28420135609974917, -0.3238265607897616, 0.0889736379983581, -0.3246188532391732, -0.19913172960620035, 0.10654966550963846, -0.06696478574409742, -0.009452676053412936, 0.01083519543013112, 0.06763272911140865, 0.034982692788947715, -0.23815195588262708, 0.353620077625171, 0.04169690619138154, 0.3056740639900619, 0.01540823884054341, 0.07777564310553399, 0.05340056677602909, -0.06736353112448176, -0.004552715686573223, -0.11125291769223457, 0.16083533811509948, 0.30926309849389577, 0.2174203667408702, 0.34895852325611154, -0.4383441529829394, -0.17642089353599164, 0.06385448188944297, 0.14180789541199126, 0.06174810959571253, -0.014563622817778113, -0.3683211375366558, 0.08225982117212631, -0.19770489759658547, -0.08546974630179731, -0.06638716684908352, -0.006214184711941264, 0.03586929763921282, -0.17990384576365945, -0.02866876745935191, 0.06197455571964383, 0.07440271933393722, -0.006970444444397633, -0.0480537123829973, -0.012822369304062291, 0.22179888366213577, 0.060578170499171725, -0.04461598290469159, 0.1266856107437475, -0.1732896877346899, -0.19104078397662802, 0.41255614048039374, -0.010239636134462092, -0.11312651841647246, 0.17064567495730112, -0.03449169391215864, -0.15477412053045225, 0.017724358919076623, 0.24375227753665638, 0.08600589196113023, -0.18958156639868817, 0.009490368310997093, -0.04527738478288732, 0.14791564469818363, 0.09642857537520202, 0.05440731809728525, 0.23619814893992788, 0.2159615654196717, 0.06971744379942803, 0.10500783752650023, 0.01638619190886278, -0.12171346638775007, -0.16866475703745065, -0.17167929438450796, -0.1504416873371652, 0.00872200819748369, -0.14162949827811894, -0.18819256778806448, 0.4183469268916683, 0.12066924528811465, 0.21085374367169357, 0.0515401544388045, 0.26456621775975114, -0.009641855031209574, 0.07653489066711204, 0.10676772770979866, 0.13131033386188476, 0.05009708591228859, 0.20616684139452196, -0.13488865004910622, 0.1214403248116882, 0.02664497579045763] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.