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.0596 | Study of Knowledge-Aided Iterative Detection and Decoding for Multiuser
MIMO Systems | In this work, we consider the problem of reduced latency of low-density
parity-check (LDPC) codes with iterative detection and decoding (IDD) receiver
in multiuser multiple-antenna systems. The proposed knowledge-aided IDD
(KA-IDD) system employs a minimum mean-square error detector with refined
iterative processing and a reweighted belief propagation (BP) decoding
algorithm. We present reweighted BP decoding algorithms, which exploit the
knowledge of short cycles in the graph structure and reweighting factors
derived from the expansion of hypergraphs. Simulation results show that the
proposed KA-IDD scheme and algorithms outperform prior art and require a
reduced number of decoding iterations.
| cs.IT math.IT | in this work we consider the problem of reduced latency of lowdensity paritycheck ldpc codes with iterative detection and decoding idd receiver in multiuser multipleantenna systems the proposed knowledgeaided idd kaidd system employs a minimum meansquare error detector with refined iterative processing and a reweighted belief propagation bp decoding algorithm we present reweighted bp decoding algorithms which exploit the knowledge of short cycles in the graph structure and reweighting factors derived from the expansion of hypergraphs simulation results show that the proposed kaidd scheme and algorithms outperform prior art and require a reduced number of decoding iterations | [['in', 'this', 'work', 'we', 'consider', 'the', 'problem', 'of', 'reduced', 'latency', 'of', 'lowdensity', 'paritycheck', 'ldpc', 'codes', 'with', 'iterative', 'detection', 'and', 'decoding', 'idd', 'receiver', 'in', 'multiuser', 'multipleantenna', 'systems', 'the', 'proposed', 'knowledgeaided', 'idd', 'kaidd', 'system', 'employs', 'a', 'minimum', 'meansquare', 'error', 'detector', 'with', 'refined', 'iterative', 'processing', 'and', 'a', 'reweighted', 'belief', 'propagation', 'bp', 'decoding', 'algorithm', 'we', 'present', 'reweighted', 'bp', 'decoding', 'algorithms', 'which', 'exploit', 'the', 'knowledge', 'of', 'short', 'cycles', 'in', 'the', 'graph', 'structure', 'and', 'reweighting', 'factors', 'derived', 'from', 'the', 'expansion', 'of', 'hypergraphs', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'kaidd', 'scheme', 'and', 'algorithms', 'outperform', 'prior', 'art', 'and', 'require', 'a', 'reduced', 'number', 'of', 'decoding', 'iterations']] | [-0.21181878886724773, -0.029447081611540755, -0.09835779324762131, 0.028240500962802846, -0.010443772743210981, -0.24934028122868193, 0.10468304810653392, 0.4234633529534269, -0.2758264134883096, -0.2905673667163539, 0.08864247421611493, -0.2068208652499475, -0.2443375460313339, 0.10270279356229463, -0.12682080940882626, 0.16000756655672663, 0.17684840283258574, 0.050897888062325744, -0.183961072792054, -0.3400503809088964, 0.18440011625031108, 0.17960179229512027, 0.2926945007455192, -0.04461478992904487, 0.1283129467261269, 0.06202308321126589, -0.025535664122894798, -0.05178894079045245, -0.11510801301130988, 0.0841465179771675, 0.3167053768313245, 0.2672924840332646, 0.26166370325035565, -0.4051424084721427, -0.25785169388584206, 0.07476895609625468, 0.18281623305213687, 0.14633038011011912, -0.04415913147263621, -0.2631960939615965, 0.15725976356403215, -0.20735744580038284, 0.06479346648250756, 0.007190136699692199, -0.13947735000891906, 0.060472610303641934, -0.3330175785525506, 0.019927986811748462, 0.0651842470525911, 0.023763340339064597, 0.021443905014740795, -0.2104863402911609, 0.14185218048330986, 0.02328664322481736, -0.023402099346889086, 0.047368555099360256, 0.10865731513323752, -0.08456907720660399, -0.16902925450550882, 0.30051091822893605, -0.025506630434507602, -0.18501230721656037, 0.09357603329822028, 0.0051731563776756, -0.14051330996873349, 0.2421507073076148, 0.29313241686475905, 0.12325372713568963, -0.10397047165254326, 0.03680879403193677, 0.004412459807568474, 0.1720186953040722, 0.08880590390610067, 0.09967700336618643, 0.0672974764614513, 0.19354460218325442, 0.10573579459206055, 0.16844786452619653, -0.12960162778679085, -0.08259219505186928, -0.20154566382989286, -0.08816232153851734, -0.2282486943430022, -0.058417652535105224, -0.15145092369225735, -0.1708111827114695, 0.37830199168785933, 0.2107016590031746, 0.10096418927178571, 0.1797938341458671, 0.3845728056113187, 0.04693456909766323, 0.05158566201203748, 0.261496124298949, 0.17168108092032766, 0.19310944121527043, 0.048713669425954946, -0.27631785835041417, 0.06554071241009392, 0.13817632854334078] |
1,802.05961 | Unified approach to discretization of flow in fractured porous media | In this paper, we introduce a mortar-based approach to discretizing flow in
fractured porous media, which we term the mixed-dimensional flux coupling
scheme. Our formulation is agnostic to the discretizations used to discretize
the fluid flow equations in the porous medium and in the fractures, and as such
it represents a unified approach to integrated fractured geometries into any
existing discretization framework. In particular, several existing
discretization approaches for fractured porous media can be seen as special
instances of the approach proposed herein.
We provide an abstract stability theory for our approach, which provides
explicit guidance into the grids used to discretize the fractures and the
porous medium, as dependent on discretization methods chosen for the respective
domains. The theoretical results are sustained by numerical examples, wherein
we utilize our framework to simulate flow in 2D and 3D fractured media using
control volume methods (both two-point and multi-point flux), Lagrangian finite
element methods, mixed finite element methods, and virtual element methods. As
expected, regardless of the ambient methods chosen, our approach leads to
stable and convergent discretizations for the fractured problems considered,
within the limits of the discretization schemes.
| math.NA | in this paper we introduce a mortarbased approach to discretizing flow in fractured porous media which we term the mixeddimensional flux coupling scheme our formulation is agnostic to the discretizations used to discretize the fluid flow equations in the porous medium and in the fractures and as such it represents a unified approach to integrated fractured geometries into any existing discretization framework in particular several existing discretization approaches for fractured porous media can be seen as special instances of the approach proposed herein we provide an abstract stability theory for our approach which provides explicit guidance into the grids used to discretize the fractures and the porous medium as dependent on discretization methods chosen for the respective domains the theoretical results are sustained by numerical examples wherein we utilize our framework to simulate flow in 2d and 3d fractured media using control volume methods both twopoint and multipoint flux lagrangian finite element methods mixed finite element methods and virtual element methods as expected regardless of the ambient methods chosen our approach leads to stable and convergent discretizations for the fractured problems considered within the limits of the discretization schemes | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'mortarbased', 'approach', 'to', 'discretizing', 'flow', 'in', 'fractured', 'porous', 'media', 'which', 'we', 'term', 'the', 'mixeddimensional', 'flux', 'coupling', 'scheme', 'our', 'formulation', 'is', 'agnostic', 'to', 'the', 'discretizations', 'used', 'to', 'discretize', 'the', 'fluid', 'flow', 'equations', 'in', 'the', 'porous', 'medium', 'and', 'in', 'the', 'fractures', 'and', 'as', 'such', 'it', 'represents', 'a', 'unified', 'approach', 'to', 'integrated', 'fractured', 'geometries', 'into', 'any', 'existing', 'discretization', 'framework', 'in', 'particular', 'several', 'existing', 'discretization', 'approaches', 'for', 'fractured', 'porous', 'media', 'can', 'be', 'seen', 'as', 'special', 'instances', 'of', 'the', 'approach', 'proposed', 'herein', 'we', 'provide', 'an', 'abstract', 'stability', 'theory', 'for', 'our', 'approach', 'which', 'provides', 'explicit', 'guidance', 'into', 'the', 'grids', 'used', 'to', 'discretize', 'the', 'fractures', 'and', 'the', 'porous', 'medium', 'as', 'dependent', 'on', 'discretization', 'methods', 'chosen', 'for', 'the', 'respective', 'domains', 'the', 'theoretical', 'results', 'are', 'sustained', 'by', 'numerical', 'examples', 'wherein', 'we', 'utilize', 'our', 'framework', 'to', 'simulate', 'flow', 'in', '2d', 'and', '3d', 'fractured', 'media', 'using', 'control', 'volume', 'methods', 'both', 'twopoint', 'and', 'multipoint', 'flux', 'lagrangian', 'finite', 'element', 'methods', 'mixed', 'finite', 'element', 'methods', 'and', 'virtual', 'element', 'methods', 'as', 'expected', 'regardless', 'of', 'the', 'ambient', 'methods', 'chosen', 'our', 'approach', 'leads', 'to', 'stable', 'and', 'convergent', 'discretizations', 'for', 'the', 'fractured', 'problems', 'considered', 'within', 'the', 'limits', 'of', 'the', 'discretization', 'schemes']] | [-0.02383142710475132, 0.038839039445481324, -0.1071614282740716, 0.026054264544113043, -0.059296383822158454, -0.10887665544795071, -0.011473449822818673, 0.4070230872132518, -0.29375799436696826, -0.26438218458714163, 0.1234505364369165, -0.23607421035883314, -0.1379024903054666, 0.18627849234109548, -0.07473135034013738, 0.11308487721884801, 0.048642198035017924, -0.07724057841520296, -0.07068639435988673, -0.21444833223296805, 0.3046672305320092, -0.03857101725929595, 0.32075385463503286, 0.07949391457480082, 0.14553752455716715, -0.05853210840661554, -0.07571208712823213, 0.0948974281732746, -0.1408525505326094, 0.14162887455870773, 0.29260482525755155, 0.0432464463259787, 0.2673276411369443, -0.48246538206102685, -0.3147562984661992, 0.030934217837366693, 0.1684904255374196, 0.12628727734022022, -0.043517816413634836, -0.27596467867632335, 0.0654239849400449, -0.15904840587222197, -0.13616285392856028, -0.10942273771209504, -0.05267918539515875, 0.0063179762370790295, -0.3051118959643026, 0.072395258716263, 0.03662471458479326, 0.013054244225210648, -0.09833066162722622, -0.101634735141217, 0.006421040820373976, 0.12938925089343065, 0.02404630259719697, -0.03126991153855689, 0.10493878528421269, -0.07435948360495225, -0.07449780385990805, 0.47664372182260467, -0.06500272556366597, -0.3166542491340574, 0.2012729055812939, -0.029356038452997963, -0.07720874612804185, 0.12675924633166435, 0.26381959993530935, 0.17859440069259244, -0.1338724532967156, 0.03535026606411346, -0.058132413977836354, 0.11941378806380833, 0.0120938105844308, -0.03641203189754185, 0.09030157918150121, 0.2317301474073208, 0.08054431762417501, 0.08964289584075735, -0.04794082490162567, -0.13947669189284614, -0.3246553491025747, -0.17201611659727356, -0.15305463552098483, -0.02003666879163381, -0.13820365708059087, -0.22655409560390213, 0.33735925232083397, 0.16619925189049953, 0.10773136274656281, 0.013399759388003658, 0.3442772033010074, 0.10284029472956156, 0.06072865048066733, 0.10350443264023658, 0.1723175269744775, 0.15686630514980432, 0.16844755253987387, -0.21449635557562827, 0.026126065689939113, 0.165034294918556] |
1,802.05962 | Enhancement of Noisy Speech Exploiting an Exponential Model Based
Threshold and a Custom Thresholding Function in Perceptual Wavelet Packet
Domain | For enhancement of noisy speech, a method of threshold determination based on
modeling of Teager energy (TE) operated perceptual wavelet packet (PWP)
coefficients of the noisy speech by exponential distribution is presented. A
custom thresholding function based on the combination of mu-law and semisoft
thresholding functions is designed and exploited to apply the statistically
derived threshold upon the PWP coefficients. The effectiveness of the proposed
method is evaluated for car and multi-talker babble noise corrupted speech
signals through performing extensive simulations using the NOIZEUS database.
The proposed method outperforms some of the state-of-the-art speech enhancement
methods both at high and low levels of SNRs in terms of the standard objective
measures and the subjective evaluations including formal listening tests.
| eess.AS | for enhancement of noisy speech a method of threshold determination based on modeling of teager energy te operated perceptual wavelet packet pwp coefficients of the noisy speech by exponential distribution is presented a custom thresholding function based on the combination of mulaw and semisoft thresholding functions is designed and exploited to apply the statistically derived threshold upon the pwp coefficients the effectiveness of the proposed method is evaluated for car and multitalker babble noise corrupted speech signals through performing extensive simulations using the noizeus database the proposed method outperforms some of the stateoftheart speech enhancement methods both at high and low levels of snrs in terms of the standard objective measures and the subjective evaluations including formal listening tests | [['for', 'enhancement', 'of', 'noisy', 'speech', 'a', 'method', 'of', 'threshold', 'determination', 'based', 'on', 'modeling', 'of', 'teager', 'energy', 'te', 'operated', 'perceptual', 'wavelet', 'packet', 'pwp', 'coefficients', 'of', 'the', 'noisy', 'speech', 'by', 'exponential', 'distribution', 'is', 'presented', 'a', 'custom', 'thresholding', 'function', 'based', 'on', 'the', 'combination', 'of', 'mulaw', 'and', 'semisoft', 'thresholding', 'functions', 'is', 'designed', 'and', 'exploited', 'to', 'apply', 'the', 'statistically', 'derived', 'threshold', 'upon', 'the', 'pwp', 'coefficients', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method', 'is', 'evaluated', 'for', 'car', 'and', 'multitalker', 'babble', 'noise', 'corrupted', 'speech', 'signals', 'through', 'performing', 'extensive', 'simulations', 'using', 'the', 'noizeus', 'database', 'the', 'proposed', 'method', 'outperforms', 'some', 'of', 'the', 'stateoftheart', 'speech', 'enhancement', 'methods', 'both', 'at', 'high', 'and', 'low', 'levels', 'of', 'snrs', 'in', 'terms', 'of', 'the', 'standard', 'objective', 'measures', 'and', 'the', 'subjective', 'evaluations', 'including', 'formal', 'listening', 'tests']] | [-0.0642205860623268, -0.020978073045580078, -0.08907450412932251, 0.029528664658824373, -0.04177672373123091, -0.147504740398565, 0.06787112340362382, 0.40544367900916506, -0.2012265876890356, -0.2753064233336222, 0.09299586635345139, -0.2940077579212414, -0.1981034740383009, 0.25008450934033405, -0.08900134179334179, 0.1525878632947912, 0.10334706056996115, 0.03152993116860411, -0.0731279496455706, -0.24238369666419515, 0.25110047003678315, 0.1092782732404518, 0.3736627745880362, 0.013757877771844383, 0.1746327263770719, 0.0033350418450921273, -0.11097770741408956, -0.06209176822387938, -0.025238104894397265, 0.09723143022851784, 0.2777052477780855, 0.1953086263300585, 0.27912896222380157, -0.36565821991153374, -0.19176285795695266, 0.06761103884136978, 0.10947164015046187, 0.01928764089409794, -0.052456886450830506, -0.37368424551389295, 0.11881779719856661, -0.150967924026068, 0.039474556625609385, -0.09961488141733058, -0.0720681229942799, 0.05228460017795197, -0.34928282093601065, 0.12135869488726612, 0.037710109344065317, 0.11014557214837302, -0.060174549700880126, -0.18005480277625954, 0.03833859784728182, 0.11546384524104006, 0.028861539896201938, 0.008882002681963333, 0.192796119465297, -0.1378280151197139, -0.12368218402795009, 0.35338950843526784, -0.13100859715198285, -0.24238832964867102, 0.18086389828856816, -0.05196719492605629, -0.08770905688264165, 0.16645859697630175, 0.21384260837896532, 0.10335005358831972, -0.1512092096347581, 0.01420317725606161, 0.021692295973541355, 0.20682142506071813, 0.08636692770563081, 0.00541320482284582, 0.08585849761211571, 0.1675531897584305, -0.029795854038875864, 0.15750830661223716, -0.1408244966012778, -0.010164567154681529, -0.23094666545120843, -0.06457055594083391, -0.24471788412006965, -0.07829424309027734, -0.11280312686471343, -0.1586077068267124, 0.4130015616547786, 0.18553736189208112, 0.14171155383262565, 0.10017091287480973, 0.37726405691825043, 0.13303888443967, 0.025549635866328198, 0.027140587892277194, 0.1837769370154818, 0.07132477146972503, 0.0946257422822958, -0.23115023914646327, 0.11673652744625046, 0.05014395221926961] |
1,802.05963 | Continuous dependence of the pressure field with respect to endpoints
for ideal incompressible fluids | In the Brenier variational model for perfect fluids, the datum is the joint
law of the initial and final positions of the particles. In this paper, we show
that both the optimal action and the pressure field are H\"older continuous
with respect to this datum metrized in Monge-Kantorovic distance.
| math.AP math.OC | in the brenier variational model for perfect fluids the datum is the joint law of the initial and final positions of the particles in this paper we show that both the optimal action and the pressure field are holder continuous with respect to this datum metrized in mongekantorovic distance | [['in', 'the', 'brenier', 'variational', 'model', 'for', 'perfect', 'fluids', 'the', 'datum', 'is', 'the', 'joint', 'law', 'of', 'the', 'initial', 'and', 'final', 'positions', 'of', 'the', 'particles', 'in', 'this', 'paper', 'we', 'show', 'that', 'both', 'the', 'optimal', 'action', 'and', 'the', 'pressure', 'field', 'are', 'holder', 'continuous', 'with', 'respect', 'to', 'this', 'datum', 'metrized', 'in', 'mongekantorovic', 'distance']] | [-0.12433437170693651, 0.10314518872958918, -0.12891903786415546, 0.012708057908942768, -0.03323165833717212, -0.08997179606618981, -0.013655121979051424, 0.3706871477576594, -0.3427473503591803, -0.259723106938812, 0.07058846788762214, -0.2522758379733811, -0.08004418514610734, 0.12293381769268308, -0.11318464833311737, 0.08775476849405095, 0.06779092393117025, 0.09495295068093886, -0.05060385900530188, -0.21206681626305604, 0.4027313630892119, 0.035296829912113026, 0.2818170407942186, 0.03391767563395357, 0.15117913349725617, -0.0054461046917519225, 0.016644596190114196, 0.03266877681016922, -0.17435626461110587, 0.10428034311432081, 0.17978803266305476, 0.06633189545633893, 0.26292114340079326, -0.37150320523263264, -0.1841544161628311, 0.1375037403195165, 0.04675145551057843, 0.11592576862312853, -0.01751107695357253, -0.29116540592319023, 0.0861609442702805, -0.13235327737250677, -0.16731580472939336, -0.00898486509686336, 0.047879638375889044, 0.0957978474131475, -0.31434443057514727, 0.120027754882661, 0.07605359600468849, 0.033140036064044885, -0.18319912705919705, -0.07633053686004132, -0.046127622736094054, 0.1087842322109888, 0.07977380666852696, 0.09830543124310982, 0.07685450577992015, -0.16104018595069647, -0.058360258650888376, 0.3776084954539935, -0.08187736481583367, -0.23864357534330338, 0.15988687031009854, -0.1699811483073669, -0.11186431898386218, 0.08251599859795533, 0.17528096163490167, 0.14044927007565397, -0.1328634115634486, 0.11732669504272053, -0.06727337503495316, 0.11806394047259043, 0.062110156199196354, -0.04224603923406297, 0.12007059257787962, 0.08772608926907803, 0.1121503579391477, 0.15948563669614182, -0.05970021733082831, -0.11469866490612428, -0.3687796196900308, -0.2107098413980566, -0.19191351269061366, 0.02317923542189722, -0.12611280304978814, -0.16401381538404772, 0.3764836951158941, 0.1470126677013468, 0.1912587216453782, 0.10655071978302051, 0.25112424449374277, 0.09365250880364329, -0.050781077259064965, 0.10234840413128647, 0.24846740887733176, 0.127759353723377, 0.12049849040340632, -0.1962322273514777, 0.04449213601765223, 0.08501337722797568] |
1,802.05964 | Negative refractive index in cubic noncentrosymmetric superconductors | We study the negative refractive index in cubic noncentrosymmetric
superconductors. We consider the Maxwell equations under the Meissner effect,
and magnetoelectric effect arising due to broken inversion symmetry. We derive
dispersion relations of electromagnetic waves, and show that the refractive
index becomes negative at frequencies just below the Higgs gap. We find that
the chiral mechanism of the negative refractive index, which is usually
discussed in chiral materials with negative permittivity can be applied to
superconductors with positive permittivity by replacing the plasma gap with the
Higgs gap. Estimation from the experimental values of the penetration depth of
LiPt$_3$B indicates that the negative refractive index may appear in UV
regions. LiPt$_3$B may exhibit the negative refractive index at wavelengths
shorter than any other material observed so far.
| cond-mat.supr-con hep-th physics.optics | we study the negative refractive index in cubic noncentrosymmetric superconductors we consider the maxwell equations under the meissner effect and magnetoelectric effect arising due to broken inversion symmetry we derive dispersion relations of electromagnetic waves and show that the refractive index becomes negative at frequencies just below the higgs gap we find that the chiral mechanism of the negative refractive index which is usually discussed in chiral materials with negative permittivity can be applied to superconductors with positive permittivity by replacing the plasma gap with the higgs gap estimation from the experimental values of the penetration depth of lipt_3b indicates that the negative refractive index may appear in uv regions lipt_3b may exhibit the negative refractive index at wavelengths shorter than any other material observed so far | [['we', 'study', 'the', 'negative', 'refractive', 'index', 'in', 'cubic', 'noncentrosymmetric', 'superconductors', 'we', 'consider', 'the', 'maxwell', 'equations', 'under', 'the', 'meissner', 'effect', 'and', 'magnetoelectric', 'effect', 'arising', 'due', 'to', 'broken', 'inversion', 'symmetry', 'we', 'derive', 'dispersion', 'relations', 'of', 'electromagnetic', 'waves', 'and', 'show', 'that', 'the', 'refractive', 'index', 'becomes', 'negative', 'at', 'frequencies', 'just', 'below', 'the', 'higgs', 'gap', 'we', 'find', 'that', 'the', 'chiral', 'mechanism', 'of', 'the', 'negative', 'refractive', 'index', 'which', 'is', 'usually', 'discussed', 'in', 'chiral', 'materials', 'with', 'negative', 'permittivity', 'can', 'be', 'applied', 'to', 'superconductors', 'with', 'positive', 'permittivity', 'by', 'replacing', 'the', 'plasma', 'gap', 'with', 'the', 'higgs', 'gap', 'estimation', 'from', 'the', 'experimental', 'values', 'of', 'the', 'penetration', 'depth', 'of', 'lipt_3b', 'indicates', 'that', 'the', 'negative', 'refractive', 'index', 'may', 'appear', 'in', 'uv', 'regions', 'lipt_3b', 'may', 'exhibit', 'the', 'negative', 'refractive', 'index', 'at', 'wavelengths', 'shorter', 'than', 'any', 'other', 'material', 'observed', 'so', 'far']] | [-0.14867170275561511, 0.251888592700474, -0.03825051330402494, 0.03375322372838855, -0.14620691614598036, -0.17212978019937872, 0.0045640311017632485, 0.4357057686150074, -0.2198599378000945, -0.32084088034927843, 0.02255916975159198, -0.30659848622232677, -0.18026552011817693, 0.14789844458736479, -0.013734273411333561, 0.013440987681155094, -0.09477092433441431, -0.007304854184389115, -0.057274918841198084, -0.14138450757972895, 0.33114841249585153, 0.014603890791535377, 0.29927300693839787, 0.09793235928704962, 0.008829109876416623, -0.031216551523655652, 0.03314012997597456, 0.06377093582600356, -0.12308084893488558, 0.07310664991289377, 0.2411876143924892, -0.08406185851618647, 0.18795463619596559, -0.3786699265241623, -0.26459923438727856, 0.08623567261174321, 0.0964694055095315, 0.1070395494652912, -0.09119170022755861, -0.2564281273856759, 0.06814455662854016, -0.10967382286116481, -0.1691634409688413, -0.012543951079249382, 0.0059128708951175215, -0.08350504444725812, -0.2607844963409007, 0.11088354352861643, 0.001648915410041809, 0.07046826491970569, -0.10865747440978885, -0.175701937045902, -0.06655260164290666, 0.02670267891138792, 0.13262921102996916, -0.07067306256759912, 0.12510503082815558, -0.15698972080647947, -0.07669364098086953, 0.3938883354663849, -0.08680845812641201, -0.11476381627097726, 0.10983620282821357, -0.21571703153476118, -0.016848335832357408, 0.17506900388002394, 0.1581385938078165, 0.07020672833546997, -0.01766166166216135, 0.07272533766832202, -0.016608811765909195, 0.23747458629868926, 0.13938069681078197, 0.061316266026347876, 0.2528751207217574, 0.06976399061456323, 0.046818406365811825, 0.16086651224968954, -0.07049565092194826, 0.03345322252437472, -0.2820598978549242, -0.14992567464709283, -0.1954836038276553, 0.0561592072583735, -0.1361781239818083, -0.21362555257230997, 0.3718987017273903, 0.14621965411119164, 0.17317990142293274, 0.006485122817568481, 0.2526270813345909, 0.19603425467852503, 0.13543844700604676, 0.0450970501974225, 0.3333583695217967, 0.15019744542147964, 0.17857241501286625, -0.26153140038624406, 0.06657353017432616, 0.04006167980283499] |
1,802.05965 | An extremely red and two other nearby L dwarf candidates previously
overlooked in 2MASS, WISE, and other surveys | We present three new nearby L dwarf candidates, found in a continued combined
color/proper motion search using WISE, 2MASS, and other survey data, where we
included extended WISE sources and looked closer to the Galactic plane region.
Their spectral types and distances were estimated from photometric comparisons
to well-known L dwarfs with trigonometric parallaxes. The first object, 2MASS
J07555430-3259589, is an extremely red L7.5p dwarf candidate at a photometric
distance of about 16 pc. Its position, proper motion and distance are
consistent with membership in the Carina-Near young moving group. The second
one, 2MASS J07414279-0506464, is resolved in Gaia DR1 as a close binary
(separation 0.3 arcsec), and we classify it as a equal-mass binary candidate
consisting of two L5 dwarfs at 19 pc. Our nearest new neighbor, 2MASS
J19251275+0700362, is an L7 dwarf candidate at 10 pc.
| astro-ph.SR | we present three new nearby l dwarf candidates found in a continued combined colorproper motion search using wise 2mass and other survey data where we included extended wise sources and looked closer to the galactic plane region their spectral types and distances were estimated from photometric comparisons to wellknown l dwarfs with trigonometric parallaxes the first object 2mass j075554303259589 is an extremely red l75p dwarf candidate at a photometric distance of about 16 pc its position proper motion and distance are consistent with membership in the carinanear young moving group the second one 2mass j074142790506464 is resolved in gaia dr1 as a close binary separation 03 arcsec and we classify it as a equalmass binary candidate consisting of two l5 dwarfs at 19 pc our nearest new neighbor 2mass j192512750700362 is an l7 dwarf candidate at 10 pc | [['we', 'present', 'three', 'new', 'nearby', 'l', 'dwarf', 'candidates', 'found', 'in', 'a', 'continued', 'combined', 'colorproper', 'motion', 'search', 'using', 'wise', '2mass', 'and', 'other', 'survey', 'data', 'where', 'we', 'included', 'extended', 'wise', 'sources', 'and', 'looked', 'closer', 'to', 'the', 'galactic', 'plane', 'region', 'their', 'spectral', 'types', 'and', 'distances', 'were', 'estimated', 'from', 'photometric', 'comparisons', 'to', 'wellknown', 'l', 'dwarfs', 'with', 'trigonometric', 'parallaxes', 'the', 'first', 'object', '2mass', 'j075554303259589', 'is', 'an', 'extremely', 'red', 'l75p', 'dwarf', 'candidate', 'at', 'a', 'photometric', 'distance', 'of', 'about', '16', 'pc', 'its', 'position', 'proper', 'motion', 'and', 'distance', 'are', 'consistent', 'with', 'membership', 'in', 'the', 'carinanear', 'young', 'moving', 'group', 'the', 'second', 'one', '2mass', 'j074142790506464', 'is', 'resolved', 'in', 'gaia', 'dr1', 'as', 'a', 'close', 'binary', 'separation', '03', 'arcsec', 'and', 'we', 'classify', 'it', 'as', 'a', 'equalmass', 'binary', 'candidate', 'consisting', 'of', 'two', 'l5', 'dwarfs', 'at', '19', 'pc', 'our', 'nearest', 'new', 'neighbor', '2mass', 'j192512750700362', 'is', 'an', 'l7', 'dwarf', 'candidate', 'at', '10', 'pc']] | [-0.06411497623993279, 0.041973786562578684, -0.08573642780364894, 0.08281850325179968, -0.19164719354402995, -0.10712093848443187, 0.14293107966464116, 0.4391583899494761, -0.1991237035688402, -0.36503192604477724, 0.06779744964937415, -0.379337573437882, 0.00740499797958269, 0.18756138907055675, -0.0652853920449826, -0.03702926009227939, 0.10418349780392513, -0.029474903613940548, -0.06042681045051831, -0.28170203578783504, 0.23823617209694278, 0.02128967949981565, 0.04243433739774541, -0.18151469536667772, 0.05807855974886316, -0.06633194846990727, -0.1628424668851406, -0.04032688697021621, -0.16966212906791314, 0.005794310386278736, 0.23502434757642393, 0.05448384952745331, 0.2073282343271378, -0.2111916521272219, -0.1325955580426519, 0.04708652516806137, 0.1903882736701574, -0.007000009981596516, -0.05928538923035376, -0.358184492064348, 0.13037042148800485, -0.18307804505848116, -0.20718435111191513, 0.047898992057715944, 0.1498874310814991, 0.049223197804791716, -0.1943329616750368, 0.11566595484002201, 0.011494298500300789, 0.15119360143548127, -0.16239322453768534, -0.20303264537951282, -0.04130576568509716, 0.12788120682399942, -0.09056644756590197, 0.17695030181168286, 0.08240293115881313, -0.06651212925911505, -0.0638144335904117, 0.421233209711847, -0.05433411629689829, -0.013018771046911603, 0.27490341601156587, -0.13916468805869792, -0.17394120410543434, 0.10464129112402426, 0.1301364710366826, 0.16282006162227436, -0.25832212851619535, -0.0221445584837382, 0.00566648531474048, 0.21149201597323392, 0.07560931635784235, 0.07344862407963, 0.3575086998892253, 0.11790113134914314, 0.06046033151614577, 0.09623899715196745, -0.38543506229379726, -0.041865586251048234, -0.25502146712639856, -0.06971344521960744, -0.17190176713429808, 0.05582275248693872, -0.157561821935489, -0.09882457087593112, 0.2691636871435304, 0.09754963211607494, 0.21205863175712136, 0.03728719311418818, 0.28772642925979375, -0.007700508999909316, 0.1454198348679955, 0.13282261695365297, 0.3006787867521617, 0.13897523610790108, 0.05449465805761961, -0.16196176215138378, -0.038054286054015826, 0.040233081387383726] |
1,802.05966 | Multilevel quadrature for elliptic problems on random domains by the
coupling of FEM and BEM | Elliptic boundary value problems which are posed on a random domain can be
mapped to a fixed, nominal domain. The randomness is thus transferred to the
diffusion matrix and the loading. While this domain mapping method is quite
efficient for theory and practice, since only a single domain discretisation is
needed, it also requires the knowledge of the domain mapping.
However, in certain applications, the random domain is only described by its
random boundary, while the quantity of interest is defined on a fixed,
deterministic subdomain. In this setting, it thus becomes necessary to compute
a random domain mapping on the whole domain, such that the domain mapping is
the identity on the fixed subdomain and maps the boundary of the chosen fixed,
nominal domain on to the random boundary.
To overcome the necessity of computing such a mapping, we therefore couple
the finite element method on the fixed subdomain with the boundary element
method on the random boundary. We verify the required regularity of the
solution with respect to the random domain mapping for the use of multilevel
quadrature, derive the coupling formulation, and show by numerical results that
the approach is feasible.
| math.NA cs.NA | elliptic boundary value problems which are posed on a random domain can be mapped to a fixed nominal domain the randomness is thus transferred to the diffusion matrix and the loading while this domain mapping method is quite efficient for theory and practice since only a single domain discretisation is needed it also requires the knowledge of the domain mapping however in certain applications the random domain is only described by its random boundary while the quantity of interest is defined on a fixed deterministic subdomain in this setting it thus becomes necessary to compute a random domain mapping on the whole domain such that the domain mapping is the identity on the fixed subdomain and maps the boundary of the chosen fixed nominal domain on to the random boundary to overcome the necessity of computing such a mapping we therefore couple the finite element method on the fixed subdomain with the boundary element method on the random boundary we verify the required regularity of the solution with respect to the random domain mapping for the use of multilevel quadrature derive the coupling formulation and show by numerical results that the approach is feasible | [['elliptic', 'boundary', 'value', 'problems', 'which', 'are', 'posed', 'on', 'a', 'random', 'domain', 'can', 'be', 'mapped', 'to', 'a', 'fixed', 'nominal', 'domain', 'the', 'randomness', 'is', 'thus', 'transferred', 'to', 'the', 'diffusion', 'matrix', 'and', 'the', 'loading', 'while', 'this', 'domain', 'mapping', 'method', 'is', 'quite', 'efficient', 'for', 'theory', 'and', 'practice', 'since', 'only', 'a', 'single', 'domain', 'discretisation', 'is', 'needed', 'it', 'also', 'requires', 'the', 'knowledge', 'of', 'the', 'domain', 'mapping', 'however', 'in', 'certain', 'applications', 'the', 'random', 'domain', 'is', 'only', 'described', 'by', 'its', 'random', 'boundary', 'while', 'the', 'quantity', 'of', 'interest', 'is', 'defined', 'on', 'a', 'fixed', 'deterministic', 'subdomain', 'in', 'this', 'setting', 'it', 'thus', 'becomes', 'necessary', 'to', 'compute', 'a', 'random', 'domain', 'mapping', 'on', 'the', 'whole', 'domain', 'such', 'that', 'the', 'domain', 'mapping', 'is', 'the', 'identity', 'on', 'the', 'fixed', 'subdomain', 'and', 'maps', 'the', 'boundary', 'of', 'the', 'chosen', 'fixed', 'nominal', 'domain', 'on', 'to', 'the', 'random', 'boundary', 'to', 'overcome', 'the', 'necessity', 'of', 'computing', 'such', 'a', 'mapping', 'we', 'therefore', 'couple', 'the', 'finite', 'element', 'method', 'on', 'the', 'fixed', 'subdomain', 'with', 'the', 'boundary', 'element', 'method', 'on', 'the', 'random', 'boundary', 'we', 'verify', 'the', 'required', 'regularity', 'of', 'the', 'solution', 'with', 'respect', 'to', 'the', 'random', 'domain', 'mapping', 'for', 'the', 'use', 'of', 'multilevel', 'quadrature', 'derive', 'the', 'coupling', 'formulation', 'and', 'show', 'by', 'numerical', 'results', 'that', 'the', 'approach', 'is', 'feasible']] | [-0.09938493187625691, 0.0692281043228991, -0.06420009568232812, -0.002245256471442846, -0.11050270159474392, -0.12226363611599603, 0.07139061416616932, 0.3838285256906883, -0.32245535772058576, -0.2401411306372839, 0.20050837006479905, -0.23254675308204034, -0.1034345823560947, 0.18108292247202323, -0.07601745462419522, 0.09433306215454575, 0.07147393744443688, 0.043070863545920275, -0.060838686385115165, -0.21303343256400206, 0.35863793192229704, -0.0363108339124196, 0.2961933740772326, 0.06037663342401184, 0.1346945767074862, 0.0003655523790998298, -0.035384604702559636, 0.030583892779703224, -0.09787925854890869, 0.14341496347963387, 0.21638090096260468, 0.09232813712526305, 0.303339691736649, -0.4021347716508299, -0.24581875187373653, 0.09647018669326742, 0.12669118752069386, 0.10409765491518912, -0.02466950989832391, -0.26934484392404556, 0.12844290506315523, -0.0843082224354916, -0.11747407840178396, -0.054806868766540104, -0.014622410639314, -0.002539419193425667, -0.323399168192577, 0.008586102389561291, 0.061204269182743486, 0.03593149609844556, -0.061727264532987415, -0.06173319686876284, 0.015096152837378616, 0.15501087599616384, 0.009989964304079023, 0.09835685135619043, 0.10650315102833063, -0.1059716662329612, -0.040974207503298665, 0.3962044044560993, -0.03146182635760645, -0.3230168518043824, 0.20113730784889655, -0.13932717656812718, -0.07993635728465605, 0.0990344334715382, 0.13789892335633566, 0.14862219103343172, -0.13726725609380194, 0.1486480780997564, -0.042385521389246374, 0.17880402387782318, 0.06405879408553165, -0.042642054533269066, 0.13558139378377765, 0.1474737839763696, 0.16986207474387952, 0.15125878485574953, -0.05150592255948553, -0.11445772344697766, -0.3445397288989775, -0.13558936378193692, -0.28341993931968956, 0.00906821235428689, -0.13472789112981362, -0.21118356327384652, 0.3875353205757043, 0.1587674689560783, 0.1889576386353097, 0.04638590789268024, 0.2804407431028745, 0.161542192735162, 0.06852245419382204, 0.05620881144471044, 0.13797075576965034, 0.10767358385108065, 0.10373583192260187, -0.2282287910479822, 0.07464422586076346, 0.0979030333944241] |
1,802.05967 | Dynamics of a prey-predator system with modified Leslie-Gower and
Holling type II schemes incorporating a prey refuge | We study a modified version of a prey-predator system with modified
Leslie-Gower and Holling type II functional response studied by M.A.
Aziz-Alaoui and M. Daher-Okiye. The modification consists in incorporating a
refuge for preys, and substantially complicates the dynamics of the system. We
study the local and global dynamics and the existence of cycles. We also
investigate conditions for extinction or existence of a stationary
distribution, in the case of a stochastic perturbation of the system.
| math.PR math.DS | we study a modified version of a preypredator system with modified lesliegower and holling type ii functional response studied by ma azizalaoui and m daherokiye the modification consists in incorporating a refuge for preys and substantially complicates the dynamics of the system we study the local and global dynamics and the existence of cycles we also investigate conditions for extinction or existence of a stationary distribution in the case of a stochastic perturbation of the system | [['we', 'study', 'a', 'modified', 'version', 'of', 'a', 'preypredator', 'system', 'with', 'modified', 'lesliegower', 'and', 'holling', 'type', 'ii', 'functional', 'response', 'studied', 'by', 'ma', 'azizalaoui', 'and', 'm', 'daherokiye', 'the', 'modification', 'consists', 'in', 'incorporating', 'a', 'refuge', 'for', 'preys', 'and', 'substantially', 'complicates', 'the', 'dynamics', 'of', 'the', 'system', 'we', 'study', 'the', 'local', 'and', 'global', 'dynamics', 'and', 'the', 'existence', 'of', 'cycles', 'we', 'also', 'investigate', 'conditions', 'for', 'extinction', 'or', 'existence', 'of', 'a', 'stationary', 'distribution', 'in', 'the', 'case', 'of', 'a', 'stochastic', 'perturbation', 'of', 'the', 'system']] | [-0.16494629298647245, 0.039792116874208056, -0.08602517984807491, 0.06464121294518312, 0.016811221245055397, -0.11274209241693219, 0.04728003119428952, 0.2721067990610997, -0.24023217236312727, -0.27017399463181696, 0.12299006831211348, -0.23276417932162682, -0.1788466970032702, 0.11780405468617876, -0.041726489004989466, -0.01170868493616581, 0.03743881183986863, 0.0035101567301899193, -0.05191556377957265, -0.1775892941917603, 0.3629062214493752, 0.03230018310248852, 0.23668402704099814, -0.020350871918102104, 0.10556361333777507, 0.06906884361989796, -0.01746854801817487, 0.07587321030596893, -0.16070313962797325, 0.1079754193034023, 0.08785918733725945, 0.10234688566842427, 0.29620682870348297, -0.42428001542886096, -0.2314745068922639, 0.10244727810223897, 0.09000086117070168, 0.11015960257461604, -0.04215497497158746, -0.2646127794465671, 0.07878212222208579, -0.16975118827074767, -0.18682573406025768, -0.027903257962316276, 0.03105776450286309, 0.09123917089775205, -0.3014887869606415, 0.09581318070141909, 0.08783025946468115, 0.05856406473865112, -0.10598430447901289, -0.04862536582009246, -0.03226137646163503, 0.09486298927105963, 0.0007454980040589969, -0.06356648214161396, 0.10359154946481187, -0.16527383086582026, -0.06724670976400375, 0.3655911406998833, -0.1546197522835185, -0.18608507859520615, 0.2016793051113685, -0.11706579932322105, -0.14206724752982458, 0.08619653690606356, 0.18959529294321933, 0.12780096351169049, -0.18037118954351172, 0.09033068539807573, -0.02465414000985523, 0.14700094076494377, 0.04551561747367183, -0.0081760378057758, 0.14438103700677554, 0.20420217686953643, 0.07988185543256501, 0.1576344406666855, -0.0845077251495483, -0.12952296174441774, -0.2907517480353514, -0.16179558993627627, -0.10179950408327083, 0.06014626320451498, -0.06289702889102046, -0.15343300602088372, 0.4447821831703186, 0.09237953969587882, 0.16991368681192398, 0.05490020435924332, 0.20384925784543156, 0.12734728332608938, 0.0009120173566043377, 0.054738670258472365, 0.19693123439947763, 0.1287301074558248, 0.12721108256528774, -0.2938743255287409, 0.07241708030303319, 0.09677077734222014] |
1,802.05968 | Information Theory: A Tutorial Introduction | Shannon's mathematical theory of communication defines fundamental limits on
how much information can be transmitted between the different components of any
man-made or biological system. This paper is an informal but rigorous
introduction to the main ideas implicit in Shannon's theory. An annotated
reading list is provided for further reading.
| cs.IT math.IT stat.ML | shannons mathematical theory of communication defines fundamental limits on how much information can be transmitted between the different components of any manmade or biological system this paper is an informal but rigorous introduction to the main ideas implicit in shannons theory an annotated reading list is provided for further reading | [['shannons', 'mathematical', 'theory', 'of', 'communication', 'defines', 'fundamental', 'limits', 'on', 'how', 'much', 'information', 'can', 'be', 'transmitted', 'between', 'the', 'different', 'components', 'of', 'any', 'manmade', 'or', 'biological', 'system', 'this', 'paper', 'is', 'an', 'informal', 'but', 'rigorous', 'introduction', 'to', 'the', 'main', 'ideas', 'implicit', 'in', 'shannons', 'theory', 'an', 'annotated', 'reading', 'list', 'is', 'provided', 'for', 'further', 'reading']] | [-0.11336488922592253, 0.1181327979505295, -0.09213996723294259, 0.09681163124972954, -0.1620363206602633, -0.17785261211916803, 0.0702382061793469, 0.3221718084253371, -0.3269935615360737, -0.30857228867709635, 0.05873418622417376, -0.28999698418192565, -0.19947047796100378, 0.20751435592304915, -0.21102222232148052, -0.022507259584963323, 0.019762546438723803, 0.08573220228310674, -0.010191197153180837, -0.26804264072328804, 0.27401195873040707, 0.07721941094845533, 0.3105870260298252, 0.08003960375674068, 0.08428753612563014, 0.013938074731267989, -0.08067201524972915, -0.042681835424155, -0.1268155910819769, 0.22450514818541706, 0.34101185775361953, 0.2601023924071342, 0.32507970206439496, -0.4786326140537858, -0.2346474445005879, 0.04527556261979043, 0.16949943507090212, 0.14658429224044084, 0.0023640032834373412, -0.29354543551802637, 0.057504426939412955, -0.13426985416561366, -0.03290404751896858, -0.051932111475616695, 0.030415697656571865, -0.03422914378345013, -0.19680705692619085, -0.011871001832187176, 0.1279941111803055, 0.18288903001695872, 0.011475333317066542, -0.07443563333479687, 0.048443549619987605, 0.19931775446515532, 0.021005192501470447, 0.02404449610738084, 0.1293168093636632, -0.10551011342089624, -0.13075209077447653, 0.3458099665492773, 0.03609759031794965, -0.2596770264580846, 0.20287234377115965, -0.008756341934204102, -0.12439861479680986, 0.09256019744090736, 0.15762234970927239, 0.03310514129698276, -0.21886923763900995, 0.04452660109847784, -0.04901007875800133, 0.2675098761729896, 0.10266125213354826, 0.09018204734660686, 0.22361451813951136, 0.18500043921172618, 0.024881803108000894, 0.1053008291660808, 0.04503684156108648, -0.12671097462996841, -0.33933678686618807, -0.17329982355237006, -0.2263063615374267, 0.0791993220988661, -0.07521538068540394, -0.1377352168224752, 0.3206643284112215, 0.20406299746595324, 0.06764143240638078, 0.07425187077373266, 0.3620258110761643, 0.1298753504641354, -0.002956043697195128, 0.029156325347721578, 0.1592383973952383, 0.16231972861569374, 0.14464885751716794, -0.08542664868757129, 0.08733022311702371, 0.05692200461402536] |
1,802.05969 | Paxos Consensus, Deconstructed and Abstracted (Extended Version) | Lamport's Paxos algorithm is a classic consensus protocol for state machine
replication in environments that admit crash failures. Many versions of Paxos
exploit the protocol's intrinsic properties for the sake of gaining better
run-time performance, thus widening the gap between the original description of
the algorithm, which was proven correct, and its real-world implementations. In
this work, we address the challenge of specifying and verifying complex
Paxos-based systems by (a) devising composable specifications for
implementations of Paxos's single-decree version, and (b) engineering
disciplines to reason about protocol-aware, semantics-preserving optimisations
to single-decree Paxos. In a nutshell, our approach elaborates on the
deconstruction of single-decree Paxos by Boichat et al. We provide novel
non-deterministic specifications for each module in the deconstruction and
prove that the implementations refine the corresponding specifications, such
that the proofs of the modules that remain unchanged can be reused across
different implementations. We further reuse this result and show how to obtain
a verified implementation of Multi-Paxos from a verified implementation of
single-decree Paxos, by a series of novel protocol-aware transformations of the
network semantics, which we prove to be behaviour-preserving.
| cs.DC | lamports paxos algorithm is a classic consensus protocol for state machine replication in environments that admit crash failures many versions of paxos exploit the protocols intrinsic properties for the sake of gaining better runtime performance thus widening the gap between the original description of the algorithm which was proven correct and its realworld implementations in this work we address the challenge of specifying and verifying complex paxosbased systems by a devising composable specifications for implementations of paxoss singledecree version and b engineering disciplines to reason about protocolaware semanticspreserving optimisations to singledecree paxos in a nutshell our approach elaborates on the deconstruction of singledecree paxos by boichat et al we provide novel nondeterministic specifications for each module in the deconstruction and prove that the implementations refine the corresponding specifications such that the proofs of the modules that remain unchanged can be reused across different implementations we further reuse this result and show how to obtain a verified implementation of multipaxos from a verified implementation of singledecree paxos by a series of novel protocolaware transformations of the network semantics which we prove to be behaviourpreserving | [['lamports', 'paxos', 'algorithm', 'is', 'a', 'classic', 'consensus', 'protocol', 'for', 'state', 'machine', 'replication', 'in', 'environments', 'that', 'admit', 'crash', 'failures', 'many', 'versions', 'of', 'paxos', 'exploit', 'the', 'protocols', 'intrinsic', 'properties', 'for', 'the', 'sake', 'of', 'gaining', 'better', 'runtime', 'performance', 'thus', 'widening', 'the', 'gap', 'between', 'the', 'original', 'description', 'of', 'the', 'algorithm', 'which', 'was', 'proven', 'correct', 'and', 'its', 'realworld', 'implementations', 'in', 'this', 'work', 'we', 'address', 'the', 'challenge', 'of', 'specifying', 'and', 'verifying', 'complex', 'paxosbased', 'systems', 'by', 'a', 'devising', 'composable', 'specifications', 'for', 'implementations', 'of', 'paxoss', 'singledecree', 'version', 'and', 'b', 'engineering', 'disciplines', 'to', 'reason', 'about', 'protocolaware', 'semanticspreserving', 'optimisations', 'to', 'singledecree', 'paxos', 'in', 'a', 'nutshell', 'our', 'approach', 'elaborates', 'on', 'the', 'deconstruction', 'of', 'singledecree', 'paxos', 'by', 'boichat', 'et', 'al', 'we', 'provide', 'novel', 'nondeterministic', 'specifications', 'for', 'each', 'module', 'in', 'the', 'deconstruction', 'and', 'prove', 'that', 'the', 'implementations', 'refine', 'the', 'corresponding', 'specifications', 'such', 'that', 'the', 'proofs', 'of', 'the', 'modules', 'that', 'remain', 'unchanged', 'can', 'be', 'reused', 'across', 'different', 'implementations', 'we', 'further', 'reuse', 'this', 'result', 'and', 'show', 'how', 'to', 'obtain', 'a', 'verified', 'implementation', 'of', 'multipaxos', 'from', 'a', 'verified', 'implementation', 'of', 'singledecree', 'paxos', 'by', 'a', 'series', 'of', 'novel', 'protocolaware', 'transformations', 'of', 'the', 'network', 'semantics', 'which', 'we', 'prove', 'to', 'be', 'behaviourpreserving']] | [-0.13425378785071915, -0.004205176276388948, -0.10428238537828516, 0.05266770161883437, -0.07653306525684477, -0.1815104495822426, 0.06301643755859253, 0.3762462450680453, -0.2737754745637821, -0.31520586296416525, 0.1029515957808403, -0.16066325229577014, -0.1640339307356938, 0.21330909151258728, -0.1431729634417294, 0.07473532732169004, 0.09956009514557, -0.05875963623640024, -0.07739902980230208, -0.2773605934474305, 0.2521201870378169, 0.05783958733211891, 0.2965487444099538, 0.05120923656803769, 0.09039856845190405, 0.006753562067702995, 0.005993605089275031, -0.014768653180497027, -0.08860916064290575, 0.13256075632284972, 0.30594663468954364, 0.24566713531694098, 0.2917778887291694, -0.4054816674523045, -0.14776241314576616, 0.058667892942662926, 0.13167126573896681, 0.12588303512893617, -0.009134317140157371, -0.2985567495216454, 0.13361156066910848, -0.21933427902703387, -0.07954876571009195, -0.12653115733563067, -0.024620165247157964, 0.0322689469949233, -0.23232467551637628, -0.026464268403887416, 0.13664336148883585, 0.06675494449764656, -0.0027398076149057495, -0.09075351659853698, 0.029324398262884115, 0.10311892867093521, -0.022532348327245044, -0.012789278525947568, 0.12289099407241831, -0.08794385914862489, -0.21654720285936005, 0.3663601054856814, 0.014660063392206943, -0.16785900980216586, 0.1772407896910383, 0.005016843255026547, -0.19085803800444612, 0.035444565663665696, 0.14381425403183398, 0.09589810850483745, -0.15269951136944057, 0.07223105604998382, -0.03690081693273683, 0.18503138295754623, 0.06701050082211221, 0.05908265162790038, 0.13968511800510633, 0.19328250521247656, 0.05760046929431892, 0.15171104917229886, 0.03981842354327628, -0.11105947960044554, -0.25268983743907936, -0.19265874730053686, -0.14200403678423448, -0.005467381868147234, -0.054967255367589826, -0.172551307602208, 0.4147866846129881, 0.24435751459837043, 0.15305293157863217, 0.13721527630452188, 0.3478509792043468, 0.029348538276042228, 0.07840890501750707, 0.15181309510121258, 0.1678738739554817, 0.06988044361149445, 0.14334109010091622, -0.17030327088022656, 0.13348403007999146, 0.07015666239712824] |
1,802.0597 | High-precision measurements of $n=2\to n=1$ transition energies and
level widths in He- and Be-like Argon Ions | We performed a reference-free measurement of the transition energies of the
$1s 2p\,^1P\_1\to 1s^2 \,^1S\_0$ line in He-like argon, and of the $1s 2s^2
2p\,^1P\_1\to 1s^2 2s^2\,^1S\_0$ line in Be-like argon ions. The highly-charged
ions were produced in the plasma of an Electron-Cyclotron Resonance Ion Source.
Both energy measurements were performed with an accuracy better than 3 parts in
$10^6$, using a double flat-crystal spectrometer, without reference to any
theoretical or experimental energy. The $1s 2s^2 2p\,^1P\_1\to 1s^2
2s^2\,^1S\_0$ transition measurement is the first reference-free measurement
for this core-excited transition. The $1s 2p\,^1P\_1\to 1s^2 \,^1S\_0$
transition measurement confirms recent measurement performed at the Heidelberg
Electron-Beam Ion Trap (EBIT). The width measurement in the He-like transition
provides test of a purely radiative decay calculations. In the case of the
Be-like argon transition, the width results from the sum of a radiative channel
and three main Auger channels. We also performed Multiconfiguration Dirac-Fock
(MCDF) calculations of transition energies and rates and have done an extensive
comparison with theory and other experimental data. For both measurements
reported here, we find agreement with the most recent theoretical calculations
within the combined theoretical and experimental uncertainties.
| physics.atom-ph | we performed a referencefree measurement of the transition energies of the 1s 2p1p_1to 1s2 1s_0 line in helike argon and of the 1s 2s2 2p1p_1to 1s2 2s21s_0 line in belike argon ions the highlycharged ions were produced in the plasma of an electroncyclotron resonance ion source both energy measurements were performed with an accuracy better than 3 parts in 106 using a double flatcrystal spectrometer without reference to any theoretical or experimental energy the 1s 2s2 2p1p_1to 1s2 2s21s_0 transition measurement is the first referencefree measurement for this coreexcited transition the 1s 2p1p_1to 1s2 1s_0 transition measurement confirms recent measurement performed at the heidelberg electronbeam ion trap ebit the width measurement in the helike transition provides test of a purely radiative decay calculations in the case of the belike argon transition the width results from the sum of a radiative channel and three main auger channels we also performed multiconfiguration diracfock mcdf calculations of transition energies and rates and have done an extensive comparison with theory and other experimental data for both measurements reported here we find agreement with the most recent theoretical calculations within the combined theoretical and experimental uncertainties | [['we', 'performed', 'a', 'referencefree', 'measurement', 'of', 'the', 'transition', 'energies', 'of', 'the', '1s', '2p1p_1to', '1s2', '1s_0', 'line', 'in', 'helike', 'argon', 'and', 'of', 'the', '1s', '2s2', '2p1p_1to', '1s2', '2s21s_0', 'line', 'in', 'belike', 'argon', 'ions', 'the', 'highlycharged', 'ions', 'were', 'produced', 'in', 'the', 'plasma', 'of', 'an', 'electroncyclotron', 'resonance', 'ion', 'source', 'both', 'energy', 'measurements', 'were', 'performed', 'with', 'an', 'accuracy', 'better', 'than', '3', 'parts', 'in', '106', 'using', 'a', 'double', 'flatcrystal', 'spectrometer', 'without', 'reference', 'to', 'any', 'theoretical', 'or', 'experimental', 'energy', 'the', '1s', '2s2', '2p1p_1to', '1s2', '2s21s_0', 'transition', 'measurement', 'is', 'the', 'first', 'referencefree', 'measurement', 'for', 'this', 'coreexcited', 'transition', 'the', '1s', '2p1p_1to', '1s2', '1s_0', 'transition', 'measurement', 'confirms', 'recent', 'measurement', 'performed', 'at', 'the', 'heidelberg', 'electronbeam', 'ion', 'trap', 'ebit', 'the', 'width', 'measurement', 'in', 'the', 'helike', 'transition', 'provides', 'test', 'of', 'a', 'purely', 'radiative', 'decay', 'calculations', 'in', 'the', 'case', 'of', 'the', 'belike', 'argon', 'transition', 'the', 'width', 'results', 'from', 'the', 'sum', 'of', 'a', 'radiative', 'channel', 'and', 'three', 'main', 'auger', 'channels', 'we', 'also', 'performed', 'multiconfiguration', 'diracfock', 'mcdf', 'calculations', 'of', 'transition', 'energies', 'and', 'rates', 'and', 'have', 'done', 'an', 'extensive', 'comparison', 'with', 'theory', 'and', 'other', 'experimental', 'data', 'for', 'both', 'measurements', 'reported', 'here', 'we', 'find', 'agreement', 'with', 'the', 'most', 'recent', 'theoretical', 'calculations', 'within', 'the', 'combined', 'theoretical', 'and', 'experimental', 'uncertainties']] | [-0.03457652815588365, 0.17050444010938628, 0.01421494878028856, 0.033513340706503046, 0.10713366004857795, -0.14758382985582916, 0.06882933843990603, 0.42016301855093835, -0.1071021093076329, -0.28892217782272406, -0.01872228072341824, -0.3870863050358926, 0.07923697510823188, 0.13705458513251384, 0.1245391267564828, 0.103944104406812, 0.10373000429787171, -0.011874814534252655, -0.10245101227478676, -0.09633059163470582, 0.2400033833381003, 0.13923183172278067, 0.2511519035251314, 0.1353536499200964, -0.006604278535114026, -0.018609591309622378, 0.0022447515054757057, -0.08413176966284973, -0.16506687091096336, 0.06353534381173512, 0.2569445228796569, 0.06106711790442262, 0.1885842650309595, -0.43415853003264254, -0.15362040142660366, 0.030235188167191146, 0.13395946270527795, 0.14833237460682763, -0.09472625191367344, -0.3363866463537616, -0.004441641272942862, -0.18390565858519983, -0.06957386191739305, -0.019143698941818707, -0.009066168933190132, 0.015075423520092526, -0.31646994026426556, 0.07781650051392289, -0.021869579026248812, 0.08709734882837124, -0.11334119231015911, -0.20381219015902893, 0.012917968449402229, 0.04499328159970958, -0.027985445606517386, 0.05347503756821467, 0.1730508446207036, -0.02508214664894171, -0.137213005377126, 0.3849723035157585, -0.09789870934798907, -0.04978279786608645, 0.12576854710999866, -0.21261173207556625, -0.14224181342406775, 0.23626519315900446, 0.08652247108289904, 0.1357656659641308, -0.08619987651588717, 0.027060311907507403, 0.010080133980452157, 0.22359906330038654, 0.07373770126092848, 0.03461973415165792, 0.08733559524669697, 0.14025606888380507, -0.09264135147025565, 0.08087005288658922, -0.18377843981179656, -0.04977068830408273, -0.3028463174988813, -0.14075635064451794, -0.15280239092410391, 0.03212405964354277, 0.011774265395534708, -0.09419354074756513, 0.3536343719293388, 0.09180908160362178, 0.19396518986350345, -0.05654875246846941, 0.3196715733197308, 0.1045502972391712, -0.02009134418672409, -0.0007818763129686186, 0.3208298535117909, 0.20760094387095948, 0.11148312857559838, -0.3131671726492755, 0.05421936632065756, 0.03274642009317329] |
1,802.05971 | Gamma rays from Dark Matter Annihilation in Three-loop Radiative
Neutrino Mass Generation Models | We present the Sommerfeld enhanced Dark Matter (DM) annihilation into gamma
ray for a class of three-loop radiative neutrino mass models with large
electroweak multiplets where the DM mass is in O(TeV) range. We show that in
this model, the DM annihilation rate becomes more prominent for larger
multiplets and it is already within the reach of currently operating Imaging
Atmospheric Cherenkov telescopes (IACTs), High Energy Stereoscopic System
(H.E.S.S.). Furthermore, Cherenkov Telescope Array (CTA), which will begin
operating in 2030, will improve this sensitivity by a factor of
$\mathcal{O}{(10)}$ and may exclude a large portion of parameter space of this
radiative neutrino mass model with larger electroweak multiplet. This implies
that the only viable option is the model with lowest electroweak multiplets
i.e. singlets of $SU(2)_{L}$ where the DM annihilation rate is not Sommerfeld
enhanced and hence it is not yet constrained by the indirect detection limits
from H.E.S.S. or future CTA.
| hep-ph astro-ph.HE | we present the sommerfeld enhanced dark matter dm annihilation into gamma ray for a class of threeloop radiative neutrino mass models with large electroweak multiplets where the dm mass is in otev range we show that in this model the dm annihilation rate becomes more prominent for larger multiplets and it is already within the reach of currently operating imaging atmospheric cherenkov telescopes iacts high energy stereoscopic system hess furthermore cherenkov telescope array cta which will begin operating in 2030 will improve this sensitivity by a factor of mathcalo10 and may exclude a large portion of parameter space of this radiative neutrino mass model with larger electroweak multiplet this implies that the only viable option is the model with lowest electroweak multiplets ie singlets of su2_l where the dm annihilation rate is not sommerfeld enhanced and hence it is not yet constrained by the indirect detection limits from hess or future cta | [['we', 'present', 'the', 'sommerfeld', 'enhanced', 'dark', 'matter', 'dm', 'annihilation', 'into', 'gamma', 'ray', 'for', 'a', 'class', 'of', 'threeloop', 'radiative', 'neutrino', 'mass', 'models', 'with', 'large', 'electroweak', 'multiplets', 'where', 'the', 'dm', 'mass', 'is', 'in', 'otev', 'range', 'we', 'show', 'that', 'in', 'this', 'model', 'the', 'dm', 'annihilation', 'rate', 'becomes', 'more', 'prominent', 'for', 'larger', 'multiplets', 'and', 'it', 'is', 'already', 'within', 'the', 'reach', 'of', 'currently', 'operating', 'imaging', 'atmospheric', 'cherenkov', 'telescopes', 'iacts', 'high', 'energy', 'stereoscopic', 'system', 'hess', 'furthermore', 'cherenkov', 'telescope', 'array', 'cta', 'which', 'will', 'begin', 'operating', 'in', '2030', 'will', 'improve', 'this', 'sensitivity', 'by', 'a', 'factor', 'of', 'mathcalo10', 'and', 'may', 'exclude', 'a', 'large', 'portion', 'of', 'parameter', 'space', 'of', 'this', 'radiative', 'neutrino', 'mass', 'model', 'with', 'larger', 'electroweak', 'multiplet', 'this', 'implies', 'that', 'the', 'only', 'viable', 'option', 'is', 'the', 'model', 'with', 'lowest', 'electroweak', 'multiplets', 'ie', 'singlets', 'of', 'su2_l', 'where', 'the', 'dm', 'annihilation', 'rate', 'is', 'not', 'sommerfeld', 'enhanced', 'and', 'hence', 'it', 'is', 'not', 'yet', 'constrained', 'by', 'the', 'indirect', 'detection', 'limits', 'from', 'hess', 'or', 'future', 'cta']] | [-0.09438841508496185, 0.2699983010074663, 0.013286941307964489, 0.17039268871073882, -0.12904174039125027, -0.13560137861579852, 0.0009243096344442548, 0.3510602506882462, -0.1830621099461017, -0.3868952797094703, 0.06701475127652214, -0.25824561134274854, 0.0008750276465434581, 0.20115028460330855, 0.057247835557638224, -0.002630463929993934, 0.10195504332047053, -0.007572889985136786, -0.038476468820590526, -0.26407548544413756, 0.26730027166807924, 0.14439744064216747, 0.1669964634347707, 0.102360300594132, 0.08269363794457413, -0.05316651676701823, -0.019540594731408515, -0.10655219306097838, -0.08675515566258248, 0.06426978672511484, 0.24944444362022536, 0.09716164033551122, 0.11536657189074169, -0.3434692064398213, -0.20727018057981408, 0.2130341789758715, 0.18897544232344157, 0.037738191024369656, -0.04360386775088524, -0.350039127871002, 0.05179761254686654, -0.2671175555656909, -0.12120794326452405, 0.007687223949592169, -0.03848386304085388, -0.08944858017830963, -0.29779585642666606, 0.07218202335858032, -0.048538143136906194, -0.038680769740542596, -0.05311096045816636, -0.153381207209589, -0.03486899527687408, -0.03122681740971625, 0.10112973319069408, -0.006607068408476679, 0.16105073079540344, -0.25061244894689144, -0.050697056784165875, 0.4161652190194122, -0.10394702022619497, -0.08750793925106623, 0.14105974539109556, -0.2009448846434488, -0.17539633676642552, 0.21715205888214864, 0.15631483398120558, 0.06594244401601732, -0.17497667083884344, 0.1723543990324527, -0.03740834734574156, 0.2263513808582885, 0.03443184401380437, 0.03840199500126274, 0.3058957151676479, 0.25393289724352625, 0.15686763093904837, 0.01371876080520451, -0.1809307359171247, -0.016354870942641833, -0.3526358923347863, -0.15408082495713116, -0.12432272705298505, 0.06750302341798058, -0.054415047600406594, -0.07352702808566391, 0.34940054757508304, 0.15360047743180125, 0.17697677094838582, 0.013690862466893649, 0.32907008251564357, 0.07607577561008695, 0.1309030308866089, 0.022838409858339122, 0.3680773829416323, 0.07171806986872598, 0.11079263038271547, -0.21175203723741057, -0.015997348756890892, 0.021767350532555657] |
1,802.05972 | Non-wandering Fatou components for strongly attracting polynomial skew
products | We show a partial generalization of Sullivan's non-wandering domain theorem
in complex dimension two. More precisely, we show the non-existence of
wandering Fatou components for polynomial skew products of $ \mathbb{C}^2$ with
an invariant attracting fiber, under the assumption that the multiplier $
\lambda $ is small. We actually show a stronger result, namely that every
forward orbit of any vertical Fatou disk intersects a bulging Fatou component.
| math.DS math.CV | we show a partial generalization of sullivans nonwandering domain theorem in complex dimension two more precisely we show the nonexistence of wandering fatou components for polynomial skew products of mathbbc2 with an invariant attracting fiber under the assumption that the multiplier lambda is small we actually show a stronger result namely that every forward orbit of any vertical fatou disk intersects a bulging fatou component | [['we', 'show', 'a', 'partial', 'generalization', 'of', 'sullivans', 'nonwandering', 'domain', 'theorem', 'in', 'complex', 'dimension', 'two', 'more', 'precisely', 'we', 'show', 'the', 'nonexistence', 'of', 'wandering', 'fatou', 'components', 'for', 'polynomial', 'skew', 'products', 'of', 'mathbbc2', 'with', 'an', 'invariant', 'attracting', 'fiber', 'under', 'the', 'assumption', 'that', 'the', 'multiplier', 'lambda', 'is', 'small', 'we', 'actually', 'show', 'a', 'stronger', 'result', 'namely', 'that', 'every', 'forward', 'orbit', 'of', 'any', 'vertical', 'fatou', 'disk', 'intersects', 'a', 'bulging', 'fatou', 'component']] | [-0.27628956109536096, 0.06441320048201865, -0.10972591656475113, 0.05566134568339644, -0.08791177358048466, -0.12764191580936313, -0.05359336397825525, 0.356858646722797, -0.32555282356647347, -0.030868299627819888, 0.08897811899212404, -0.2612216541615243, -0.1390540986106946, 0.23940173496420566, -0.11711499557758753, 0.020538363949610637, 0.10935604942675967, 0.04751862021019826, -0.04990925325367313, -0.224723994703247, 0.42066599281074907, -0.1457381567470013, 0.17995608556442536, 0.08198830913304567, 0.14447358990661227, 0.004047446576162027, 0.01608040633683021, 0.001529574043189104, -0.17400311745385316, 0.09032072806104015, 0.19885658325914007, 0.1130607310288514, 0.2656235026482206, -0.37596784688738316, -0.16123267489557083, 0.2250590958345968, 0.12605383410639032, -0.041304465458513455, -0.008756540766066441, -0.24722721813103327, 0.1520047007415157, -0.14606896461202548, -0.2735879461066081, -0.05648640856290093, 0.11210213950476967, 0.019087076115493592, -0.26525226743676916, 0.01584257769326751, 0.28119331712906176, 0.13381055775926842, -0.07373590354736034, -0.043333988959112994, -0.10546759007355341, 0.03557908610046769, 0.045286422978656794, 0.07379993173078848, 0.13948955616036143, -0.03000911669089244, -0.0745509455123773, 0.30650404351405225, -0.14521583080148467, -0.28560268927652105, 0.1907346384313244, -0.21640151320025325, -0.1982142553736384, 0.16990700850549798, 0.08144856667002806, 0.10216272602824925, -0.06618907704161336, 0.14584187002709278, -0.18129457934007334, 0.17661060639298878, 0.1850085631586038, -0.01999204333585042, 0.14115255043770258, 0.07452813681358328, 0.24174266934222452, 0.19691708327915805, -0.02844695129360144, -0.02981377419514152, -0.34016555989017855, -0.18548583838945398, -0.11076931980653451, 0.13122727015557198, -0.1332138170403106, -0.21223080476316122, 0.37061783700035167, 0.0615797646343708, 0.21461760695047605, 0.0687111118915849, 0.29696378372251414, 0.058424812293826386, 0.05313948140694545, 0.13657871638782895, 0.148357604830884, 0.17536420771995417, -0.02319632235627908, -0.11023834647360042, 0.03346000462770462, 0.15231037564718952] |
1,802.05973 | Information Rates and Error Exponents for Probabilistic Amplitude
Shaping | Probabilistic Amplitude Shaping (PAS) is a coded-modulation scheme in which
the encoder is a concatenation of a distribution matcher with a systematic
Forward Error Correction (FEC) code. For reduced computational complexity the
decoder can be chosen as a concatenation of a mismatched FEC decoder and
dematcher. This work studies the theoretic limits of PAS. The classical joint
source-channel coding (JSCC) setup is modified to include systematic FEC and
the mismatched FEC decoder. At each step error exponents and achievable rates
for the corresponding setup are derived.
| cs.IT math.IT | probabilistic amplitude shaping pas is a codedmodulation scheme in which the encoder is a concatenation of a distribution matcher with a systematic forward error correction fec code for reduced computational complexity the decoder can be chosen as a concatenation of a mismatched fec decoder and dematcher this work studies the theoretic limits of pas the classical joint sourcechannel coding jscc setup is modified to include systematic fec and the mismatched fec decoder at each step error exponents and achievable rates for the corresponding setup are derived | [['probabilistic', 'amplitude', 'shaping', 'pas', 'is', 'a', 'codedmodulation', 'scheme', 'in', 'which', 'the', 'encoder', 'is', 'a', 'concatenation', 'of', 'a', 'distribution', 'matcher', 'with', 'a', 'systematic', 'forward', 'error', 'correction', 'fec', 'code', 'for', 'reduced', 'computational', 'complexity', 'the', 'decoder', 'can', 'be', 'chosen', 'as', 'a', 'concatenation', 'of', 'a', 'mismatched', 'fec', 'decoder', 'and', 'dematcher', 'this', 'work', 'studies', 'the', 'theoretic', 'limits', 'of', 'pas', 'the', 'classical', 'joint', 'sourcechannel', 'coding', 'jscc', 'setup', 'is', 'modified', 'to', 'include', 'systematic', 'fec', 'and', 'the', 'mismatched', 'fec', 'decoder', 'at', 'each', 'step', 'error', 'exponents', 'and', 'achievable', 'rates', 'for', 'the', 'corresponding', 'setup', 'are', 'derived']] | [-0.17237805930334468, 0.015428209334860967, -0.11889743432944078, 0.10843464588410719, -0.0019085774100710486, -0.31147686815495756, 0.13490122806843977, 0.40421316406261826, -0.3195842812216819, -0.22754171323897535, 0.08716540035336863, -0.19935649487753074, -0.1110295194856346, 0.17071531401124113, -0.16575214766009255, 0.14507991507606105, 0.03566828869055783, 0.010983088321788886, -0.1500036490507164, -0.2555998470092755, 0.20340005463519847, 0.20645238917191014, 0.35789879285838716, -0.04156516545430519, 0.1069455903597436, -0.010237719901555847, -0.026412564394778983, -0.07823991604950713, -0.12594133498536986, 0.11087258999658273, 0.30369529262358363, 0.10450272121856552, 0.22094717205956924, -0.33034387737685855, -0.2560442207641033, -0.014361379881995881, 0.13403495933947174, 0.19315353471401342, -0.028319293687250034, -0.22176166697740987, 0.14451873644666616, -0.2380476810828631, 0.08557363593041203, 0.07648323933312366, -0.1067382771532636, 0.03476857441832138, -0.3475720256345, 0.03126294149334954, 0.09895716295685879, 0.054127693327880186, 0.018784997573252336, -0.16099964282583706, 0.041940033744457504, 0.1571582684639928, -0.036409487425306336, 0.09224857011983215, 0.08520814306969039, -0.03245868360445033, -0.11580185208816168, 0.31779804531224937, -0.02865761965729816, -0.26614660753457003, 0.0713222750359713, -0.03399860125771442, -0.11057983862972537, 0.15649952011204563, 0.22621591072962727, 0.03604862620670966, -0.13806559982710265, 0.04889548026488249, 0.010600600727335659, 0.25506158754077934, 0.1350443250835375, 0.11057071670413364, 0.12119414891267932, 0.1556663717641387, 0.008550899238650536, 0.18054717395665817, -0.1759013402340717, -0.09794840540162959, -0.34030869426638927, -0.129761521046613, -0.1627060099569864, -0.05153573999387147, -0.1180643228169999, -0.13795749921091768, 0.29935461054108514, 0.07586877789486438, 0.09450652747046809, 0.14999647089686288, 0.38111471891576465, 0.1027564914926865, 0.05152015225571949, 0.12551598220543805, 0.19338750532289511, 0.1601450809245106, 0.030605242901676617, -0.21517625253452638, 0.13562269554321849, 0.11444226158024787] |
1,802.05974 | A Combinatorial Problem Arising From Ecology: the Maximum Empower
Problem | The ecologist H. T. Odum introduced a principle of physics, called Maximum
Empower, in order to explain self-organization in a system (e.g. physical,
biological, social, economical, mathematical, ...). The concept of empower
relies on emergy, which is a second notion introduced by Odum for comparing
energy systems on the same basis. The roots of these notions trace back to the
50's (with the work of H. T. Odum and R. C. Pinkerton) and is becoming now an
important sustainability indicator in the ecologist community. In 2012, Le
Corre and Truffet developed a recursive method, based on max-plus algebra, to
compute emergy of a system. Recently, using this max-plus algebra approach, it
has been shown that the Maximum Empower Principle can be formalized as a new
combinatorial optimization problem (called the Maximum Empower Problem).
In this paper we show that the Maximum Empower Problem can be solved by
finding a maximum weighted clique in a cograph, which leads to an
exponential-time algorithm in the worst-case. We also provide a polynomial-time
algorithm when there is no cycle in the graph modeling the system. Finally, we
prove that the Maximum Empower Problem is #P-hard in the general case, i.e. it
is as hard as computing the permanent of a matrix.
| cs.DM q-bio.PE | the ecologist h t odum introduced a principle of physics called maximum empower in order to explain selforganization in a system eg physical biological social economical mathematical the concept of empower relies on emergy which is a second notion introduced by odum for comparing energy systems on the same basis the roots of these notions trace back to the 50s with the work of h t odum and r c pinkerton and is becoming now an important sustainability indicator in the ecologist community in 2012 le corre and truffet developed a recursive method based on maxplus algebra to compute emergy of a system recently using this maxplus algebra approach it has been shown that the maximum empower principle can be formalized as a new combinatorial optimization problem called the maximum empower problem in this paper we show that the maximum empower problem can be solved by finding a maximum weighted clique in a cograph which leads to an exponentialtime algorithm in the worstcase we also provide a polynomialtime algorithm when there is no cycle in the graph modeling the system finally we prove that the maximum empower problem is phard in the general case ie it is as hard as computing the permanent of a matrix | [['the', 'ecologist', 'h', 't', 'odum', 'introduced', 'a', 'principle', 'of', 'physics', 'called', 'maximum', 'empower', 'in', 'order', 'to', 'explain', 'selforganization', 'in', 'a', 'system', 'eg', 'physical', 'biological', 'social', 'economical', 'mathematical', 'the', 'concept', 'of', 'empower', 'relies', 'on', 'emergy', 'which', 'is', 'a', 'second', 'notion', 'introduced', 'by', 'odum', 'for', 'comparing', 'energy', 'systems', 'on', 'the', 'same', 'basis', 'the', 'roots', 'of', 'these', 'notions', 'trace', 'back', 'to', 'the', '50s', 'with', 'the', 'work', 'of', 'h', 't', 'odum', 'and', 'r', 'c', 'pinkerton', 'and', 'is', 'becoming', 'now', 'an', 'important', 'sustainability', 'indicator', 'in', 'the', 'ecologist', 'community', 'in', '2012', 'le', 'corre', 'and', 'truffet', 'developed', 'a', 'recursive', 'method', 'based', 'on', 'maxplus', 'algebra', 'to', 'compute', 'emergy', 'of', 'a', 'system', 'recently', 'using', 'this', 'maxplus', 'algebra', 'approach', 'it', 'has', 'been', 'shown', 'that', 'the', 'maximum', 'empower', 'principle', 'can', 'be', 'formalized', 'as', 'a', 'new', 'combinatorial', 'optimization', 'problem', 'called', 'the', 'maximum', 'empower', 'problem', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'maximum', 'empower', 'problem', 'can', 'be', 'solved', 'by', 'finding', 'a', 'maximum', 'weighted', 'clique', 'in', 'a', 'cograph', 'which', 'leads', 'to', 'an', 'exponentialtime', 'algorithm', 'in', 'the', 'worstcase', 'we', 'also', 'provide', 'a', 'polynomialtime', 'algorithm', 'when', 'there', 'is', 'no', 'cycle', 'in', 'the', 'graph', 'modeling', 'the', 'system', 'finally', 'we', 'prove', 'that', 'the', 'maximum', 'empower', 'problem', 'is', 'phard', 'in', 'the', 'general', 'case', 'ie', 'it', 'is', 'as', 'hard', 'as', 'computing', 'the', 'permanent', 'of', 'a', 'matrix']] | [-0.08765570565489778, 0.048871237478891216, -0.09384715269826462, 0.07897956119838864, -0.10006293135366458, -0.13617558636492594, 0.05694970844642205, 0.3289452124679205, -0.31225827050294874, -0.3123286507530686, 0.11441002751634383, -0.2221096138784881, -0.20891556395537347, 0.1820697599437599, -0.11310470566283637, 0.057368734365274364, 0.06524433414269165, 0.07219146810687152, -0.017079896822549782, -0.24237915647387911, 0.2627290502343528, 0.06322474970696859, 0.25433691832985655, 0.09768188420646623, 0.10688296012242562, 0.017154476241272528, 0.004123347309217149, 0.07001113545779578, -0.12422365620078185, 0.13733875354656072, 0.2852707970510785, 0.23100053564435347, 0.33776178599024814, -0.38111330592986564, -0.17136914411208173, 0.15228890735135578, 0.12845326098863105, 0.055882061670726055, -0.007916265131344143, -0.22141748103746853, 0.10206725779354718, -0.1896742903821481, -0.09632726851850748, -0.03819467788893163, 0.05418749331889272, -0.026295804078508095, -0.2697360588685043, 0.004362356897949141, 0.07578377077908383, 0.06250059240789828, -0.00777025106043427, -0.09454462578743879, 0.02131153739573361, 0.08002998428741658, -0.020846618781112793, 0.04291718984114043, 0.058922500073380187, -0.0859182364873442, -0.15795463035864682, 0.38984633388691675, -0.0289527601000337, -0.17596500135037144, 0.13400482190156573, -0.0685297473603129, -0.16181892984291063, 0.08925381233555027, 0.17207368972309517, 0.14704377838415003, -0.15927282854489236, 0.12071551087194844, -0.08269911578984238, 0.1374254373847233, 0.06693475870598181, -0.032386099911972825, 0.15307544332737213, 0.17317740262517997, 0.1354385866728205, 0.15309363507092746, -6.496250474204619e-05, -0.07351483835829604, -0.24211488501397052, -0.18618685839350754, -0.22181787299033365, 0.034389919529477245, -0.07522144891738529, -0.16486843792289638, 0.37860144823606984, 0.1624245778406404, 0.16090831898755448, 0.07310662053379358, 0.25419481809926675, 0.14082878404217042, 0.06017326503448809, 0.11765983608541979, 0.2227688050125817, 0.1512922431301216, 0.11241467792184695, -0.1905929351023766, 0.1038798847402373, 0.14202229406538547] |
1,802.05975 | Nonparametric Bayesian estimation of multivariate Hawkes processes | This paper studies nonparametric estimation of parameters of multivariate
Hawkes processes. We consider the Bayesian setting and derive posterior
concentration rates. First rates are derived for L1-metrics for stochastic
intensities of the Hawkes process. We then deduce rates for the L1-norm of
interactions functions of the process. Our results are exemplified by using
priors based on piecewise constant functions, with regular or random partitions
and priors based on mixtures of Betas distributions. Numerical illustrations
are then proposed with in mind applications for inferring functional
connec-tivity graphs of neurons.
| math.ST stat.TH | this paper studies nonparametric estimation of parameters of multivariate hawkes processes we consider the bayesian setting and derive posterior concentration rates first rates are derived for l1metrics for stochastic intensities of the hawkes process we then deduce rates for the l1norm of interactions functions of the process our results are exemplified by using priors based on piecewise constant functions with regular or random partitions and priors based on mixtures of betas distributions numerical illustrations are then proposed with in mind applications for inferring functional connectivity graphs of neurons | [['this', 'paper', 'studies', 'nonparametric', 'estimation', 'of', 'parameters', 'of', 'multivariate', 'hawkes', 'processes', 'we', 'consider', 'the', 'bayesian', 'setting', 'and', 'derive', 'posterior', 'concentration', 'rates', 'first', 'rates', 'are', 'derived', 'for', 'l1metrics', 'for', 'stochastic', 'intensities', 'of', 'the', 'hawkes', 'process', 'we', 'then', 'deduce', 'rates', 'for', 'the', 'l1norm', 'of', 'interactions', 'functions', 'of', 'the', 'process', 'our', 'results', 'are', 'exemplified', 'by', 'using', 'priors', 'based', 'on', 'piecewise', 'constant', 'functions', 'with', 'regular', 'or', 'random', 'partitions', 'and', 'priors', 'based', 'on', 'mixtures', 'of', 'betas', 'distributions', 'numerical', 'illustrations', 'are', 'then', 'proposed', 'with', 'in', 'mind', 'applications', 'for', 'inferring', 'functional', 'connectivity', 'graphs', 'of', 'neurons']] | [-0.029876102457872068, 0.06767862033762637, -0.048164964549848276, 0.09925601240027537, -0.03913979207690077, -0.1141389322563492, 0.07555220285885507, 0.42871758234740676, -0.26780890108717753, -0.23290625761594924, 0.1275363031483052, -0.24493534673519177, -0.1786865201730538, 0.20910896856509065, -0.05795150240562085, 0.12592517698033787, 0.053374335921808395, -0.012832638925348205, -0.06425000219766436, -0.24458489145537646, 0.36433787823751057, 0.057598684111545825, 0.2778212647007286, -0.02835812397172739, 0.13987948595085878, 0.04392411798003248, -0.09118872662556582, -0.03948131680151384, -0.19065203489307528, 0.15005479120360365, 0.25287414596672975, 0.17257841163309526, 0.29515320700111575, -0.42847406444535857, -0.2709414752350114, 0.13297368065807327, 0.10566597823394816, 0.06286061869869972, -0.05336475816465668, -0.2950330753302223, 0.0341610957777406, -0.12633810909572005, -0.05930007210244885, -0.11725496139976828, -0.007299660094853105, 0.16280346168954482, -0.40852207223745596, 0.13835690793281571, 0.042875892236486246, 0.07321530304335315, -0.06997585876834118, -0.1867469217756699, 0.024815227223517394, 0.08903672050245791, 0.06886786580334642, -0.08630592085356856, 0.1495550568054976, -0.11437323375005574, -0.15776317557266475, 0.28590080970577125, -0.06845486791932891, -0.2573497171283582, 0.1697843175879198, -0.14020953750794476, -0.1953170169947733, 0.07303813298971489, 0.24791168661295682, 0.14786584252470183, -0.20643565050144305, 0.08372005532179884, -0.009085279227041736, 0.10987673840089433, 0.05714003948880167, -0.03359792842904384, 0.11844838930336737, 0.17419383291626114, 0.04491603570380088, 0.15270588400602425, -0.09128606463943062, -0.12676941765065508, -0.28902714723057443, -0.09122457074793591, -0.1927679548061442, -0.0404001943708194, -0.1921993500346334, -0.20577129018867665, 0.3677506570961198, 0.15638624477714044, 0.23098926098439201, 0.19322311702644687, 0.2526228764956153, 0.15904336187844004, -0.050356107065454125, 0.0523166377418514, 0.13982372157190037, 0.18577028557808065, 0.005117857888951127, -0.08972619385083859, 0.15839796932414174, 0.06308722414943421] |
1,802.05976 | AKARI NEP-Deep: galaxy clustering through the AKARI IRC filters | We present a preliminary analysis of clustering of galaxies luminous in the
near- and mid-infrared as seen by seven various ilters of the AKARI IRC
instrument from 2 $\mu$m to 24 $\mu$m in the the AKARI NEP-Deep field. We
compare populations of galaxies detected in different filters and their
clustering properties. We conclude that different AKARI filters allow to trace
different populations composed mainly of star-forming galaxies located in
different environments. In particular, the mid-infrared filters at redshift z
$\sim$ 0.8 and higher trace a population of strongly evolving galaxies located
in massive haloes which might have ended as elliptical galaxies today.
| astro-ph.GA astro-ph.CO | we present a preliminary analysis of clustering of galaxies luminous in the near and midinfrared as seen by seven various ilters of the akari irc instrument from 2 mum to 24 mum in the the akari nepdeep field we compare populations of galaxies detected in different filters and their clustering properties we conclude that different akari filters allow to trace different populations composed mainly of starforming galaxies located in different environments in particular the midinfrared filters at redshift z sim 08 and higher trace a population of strongly evolving galaxies located in massive haloes which might have ended as elliptical galaxies today | [['we', 'present', 'a', 'preliminary', 'analysis', 'of', 'clustering', 'of', 'galaxies', 'luminous', 'in', 'the', 'near', 'and', 'midinfrared', 'as', 'seen', 'by', 'seven', 'various', 'ilters', 'of', 'the', 'akari', 'irc', 'instrument', 'from', '2', 'mum', 'to', '24', 'mum', 'in', 'the', 'the', 'akari', 'nepdeep', 'field', 'we', 'compare', 'populations', 'of', 'galaxies', 'detected', 'in', 'different', 'filters', 'and', 'their', 'clustering', 'properties', 'we', 'conclude', 'that', 'different', 'akari', 'filters', 'allow', 'to', 'trace', 'different', 'populations', 'composed', 'mainly', 'of', 'starforming', 'galaxies', 'located', 'in', 'different', 'environments', 'in', 'particular', 'the', 'midinfrared', 'filters', 'at', 'redshift', 'z', 'sim', '08', 'and', 'higher', 'trace', 'a', 'population', 'of', 'strongly', 'evolving', 'galaxies', 'located', 'in', 'massive', 'haloes', 'which', 'might', 'have', 'ended', 'as', 'elliptical', 'galaxies', 'today']] | [-0.047957657744167465, 0.0861786187967599, -0.0942008672512625, 0.09444928804578462, -0.03543498214924395, -0.04346213463952046, -0.0008366509677270557, 0.509406830967948, -0.09689338807256358, -0.36352631060572543, 0.04551712210327018, -0.3113917797103082, -0.06107817252747493, 0.15167288469593126, -0.014957671714739156, -0.06257803453187837, -0.005329799538681118, -0.15771478500290967, -0.020166555637266662, -0.31471393934202074, 0.3068611239276753, 0.07653507797766736, 0.1919725413830711, -0.1271701092084888, 0.07447926997031906, -0.09967636098937675, -0.1397725507838301, -0.027856678038024076, -0.13872343519655583, 0.023779107958520992, 0.3177170574960142, 0.11811299548290743, 0.26114673886706335, -0.3229289422789128, -0.1735108060079931, 0.08415211111510007, 0.24246403644331685, -0.02585758783481093, -0.06192578070123892, -0.3099715567313799, 0.0806329320127255, -0.14517238844960634, -0.17032363289266383, 0.11139474493811036, 0.007789453732467598, 0.06739991140727064, -0.15341087769126832, 0.1254885918138051, -0.037722602122380294, 0.15111431728190935, -0.12202795908445178, -0.14651924949877038, -0.10869746636898986, 0.10110428254350577, -0.05522931475966874, 0.057357552853219286, 0.21985630435629352, -0.19141042461655666, -0.018838415028398284, 0.3552912568245867, -0.086505903864722, 0.07071203017367585, 0.297978140893254, -0.23039068164082593, -0.21317241901974424, 0.1142650829019523, 0.1870962813644126, 0.13980248312253762, -0.2019036005592287, 0.02286179344421068, -0.0002623297260281178, 0.2210070733349807, 0.0674080087683431, 0.151095678527277, 0.32200916375651367, 0.08812955520023583, 0.032255958451078, 0.14810625127387592, -0.24918413570722436, -0.01536600518565957, -0.21594156270228917, -0.08275084047218656, -0.10758639051173215, 0.08740741104039705, -0.1600424012413887, -0.08868774975935864, 0.3475642344628525, 0.1628099549054583, 0.22941731751002004, 0.06736705670857082, 0.30627571601457526, 0.029295669866283194, 0.1803247384925253, 0.07252097787280189, 0.31225912361451896, 0.09037732235547893, 0.08785077016616222, -0.15495752044123515, -0.03432823648321267, -0.05621147731873483] |
1,802.05977 | Hidden spin current in doped Mott antiferromagnets | We investigate the nature of doped Mott insulators using exact
diagonalization and density matrix renormalization group methods. Persistent
spin currents are revealed in the ground state, which are concomitant with a
nonzero total momentum or angular momentum associated with the doped hole. The
latter determines a nontrivial ground state degeneracy. By further making
superpositions of the degenerate ground states with zero or unidirectional spin
currents, we show that different patterns of spatial charge and spin
modulations will emerge. Such anomaly persists for the odd numbers of holes,
but the spin current, ground state degeneracy, and charge/spin modulations
completely disappear for even numbers of holes, with the two-hole ground state
exhibiting a d-wave symmetry. An understanding of the spin current due to a
many-body Berry-like phase and its impact on the momentum distribution of the
doped holes will be discussed.
| cond-mat.str-el | we investigate the nature of doped mott insulators using exact diagonalization and density matrix renormalization group methods persistent spin currents are revealed in the ground state which are concomitant with a nonzero total momentum or angular momentum associated with the doped hole the latter determines a nontrivial ground state degeneracy by further making superpositions of the degenerate ground states with zero or unidirectional spin currents we show that different patterns of spatial charge and spin modulations will emerge such anomaly persists for the odd numbers of holes but the spin current ground state degeneracy and chargespin modulations completely disappear for even numbers of holes with the twohole ground state exhibiting a dwave symmetry an understanding of the spin current due to a manybody berrylike phase and its impact on the momentum distribution of the doped holes will be discussed | [['we', 'investigate', 'the', 'nature', 'of', 'doped', 'mott', 'insulators', 'using', 'exact', 'diagonalization', 'and', 'density', 'matrix', 'renormalization', 'group', 'methods', 'persistent', 'spin', 'currents', 'are', 'revealed', 'in', 'the', 'ground', 'state', 'which', 'are', 'concomitant', 'with', 'a', 'nonzero', 'total', 'momentum', 'or', 'angular', 'momentum', 'associated', 'with', 'the', 'doped', 'hole', 'the', 'latter', 'determines', 'a', 'nontrivial', 'ground', 'state', 'degeneracy', 'by', 'further', 'making', 'superpositions', 'of', 'the', 'degenerate', 'ground', 'states', 'with', 'zero', 'or', 'unidirectional', 'spin', 'currents', 'we', 'show', 'that', 'different', 'patterns', 'of', 'spatial', 'charge', 'and', 'spin', 'modulations', 'will', 'emerge', 'such', 'anomaly', 'persists', 'for', 'the', 'odd', 'numbers', 'of', 'holes', 'but', 'the', 'spin', 'current', 'ground', 'state', 'degeneracy', 'and', 'chargespin', 'modulations', 'completely', 'disappear', 'for', 'even', 'numbers', 'of', 'holes', 'with', 'the', 'twohole', 'ground', 'state', 'exhibiting', 'a', 'dwave', 'symmetry', 'an', 'understanding', 'of', 'the', 'spin', 'current', 'due', 'to', 'a', 'manybody', 'berrylike', 'phase', 'and', 'its', 'impact', 'on', 'the', 'momentum', 'distribution', 'of', 'the', 'doped', 'holes', 'will', 'be', 'discussed']] | [-0.24684049213713827, 0.28004157919490713, -0.028793555853148023, 0.09707026976234406, -0.020654678023118767, -0.1369854953046218, 0.06332906522861809, 0.33516421256814716, -0.23679993519385298, -0.2761148674641367, 0.061705513926819236, -0.32593094374274284, -0.08069620253652227, 0.11594863943152613, 0.05887316550268865, 0.018142472615921133, 0.008202133151675782, 0.013422610432499175, -0.18184575662284874, -0.16612258036252406, 0.3535106163103428, -0.01103730468253652, 0.2997080100341801, 0.0631643141696913, 0.07367240507222658, 0.02848577820662436, 0.09112720288798588, 0.020156464050356433, -0.08623397944139345, 0.03713300835513744, 0.2528391121752667, -0.032774149310413295, 0.15542379214944277, -0.4582754531674248, -0.18631207373616346, 0.07738683426337277, 0.1301924314792938, 0.2111796386457859, -0.06610950593092887, -0.3383932742055693, 0.021297467500641407, -0.2204439857130428, -0.18430469971377966, -0.15523380452009897, -0.005134376744143397, -0.013471331882873456, -0.2070568271815482, 0.14064333466611964, 0.07426996862100398, 0.01429614214655414, -0.09553688517922415, -0.1521119767692771, -0.14683600223670118, 0.09075993521259629, 0.08315172495585096, 0.029751187220564204, 0.1079374400977541, -0.1683516941040004, -0.14995021637187425, 0.30915037562682046, -0.01606025356504557, -0.176714105725878, 0.15177748214768366, -0.21795192663557827, -0.06853968554290293, 0.16171035862011876, 0.08200439388307629, 0.09762357203658376, -0.04369987785923395, 0.06686925904644425, -0.004818287333842072, 0.1825692810305803, 0.023187987449438237, 0.14749847358869886, 0.330999578253815, 0.11911596432361725, 0.09377246754404774, 0.11530425373997485, -0.13894182131935595, -0.10381133691931191, -0.2147463558496331, -0.1596445454872488, -0.24665977611548182, 0.11453373833030141, -0.014502613335804304, -0.1616262419001876, 0.4466656198014887, 0.1102988359220192, 0.18999638272074165, -0.046431399113833635, 0.22997156482123626, 0.12502239514544283, 0.020890977521755283, 0.06325891948256494, 0.22083434516316106, 0.17108385849630178, 0.08340119993608953, -0.3322089509083722, 0.02670432778959759, 0.025694094996115448] |
1,802.05978 | Manipulating surface magnetic order in iron telluride | Control of emergent magnetic orders in correlated electron materials promises
new opportunities for applications in spintronics. For their technological
exploitation, it is important to understand the role of surfaces and interfaces
to other materials and their impact on the emergent magnetic orders. Here, we
demonstrate for iron telluride, the nonsuperconducting parent compound of the
iron chalcogenide superconductors, determination and manipulation of the
surface magnetic structure by low-temperature spin-polarized scanning tunneling
microscopy. Iron telluride exhibits a complex structural and magnetic phase
diagram as a function of interstitial iron concentration. Several theories have
been put forward to explain the different magnetic orders observed in the phase
diagram, which ascribe a dominant role either to interactions mediated by
itinerant electrons or to local moment interactions. Through the controlled
removal of surface excess iron, we can separate the influence of the excess
iron from that of the change in the lattice structure.
| cond-mat.str-el | control of emergent magnetic orders in correlated electron materials promises new opportunities for applications in spintronics for their technological exploitation it is important to understand the role of surfaces and interfaces to other materials and their impact on the emergent magnetic orders here we demonstrate for iron telluride the nonsuperconducting parent compound of the iron chalcogenide superconductors determination and manipulation of the surface magnetic structure by lowtemperature spinpolarized scanning tunneling microscopy iron telluride exhibits a complex structural and magnetic phase diagram as a function of interstitial iron concentration several theories have been put forward to explain the different magnetic orders observed in the phase diagram which ascribe a dominant role either to interactions mediated by itinerant electrons or to local moment interactions through the controlled removal of surface excess iron we can separate the influence of the excess iron from that of the change in the lattice structure | [['control', 'of', 'emergent', 'magnetic', 'orders', 'in', 'correlated', 'electron', 'materials', 'promises', 'new', 'opportunities', 'for', 'applications', 'in', 'spintronics', 'for', 'their', 'technological', 'exploitation', 'it', 'is', 'important', 'to', 'understand', 'the', 'role', 'of', 'surfaces', 'and', 'interfaces', 'to', 'other', 'materials', 'and', 'their', 'impact', 'on', 'the', 'emergent', 'magnetic', 'orders', 'here', 'we', 'demonstrate', 'for', 'iron', 'telluride', 'the', 'nonsuperconducting', 'parent', 'compound', 'of', 'the', 'iron', 'chalcogenide', 'superconductors', 'determination', 'and', 'manipulation', 'of', 'the', 'surface', 'magnetic', 'structure', 'by', 'lowtemperature', 'spinpolarized', 'scanning', 'tunneling', 'microscopy', 'iron', 'telluride', 'exhibits', 'a', 'complex', 'structural', 'and', 'magnetic', 'phase', 'diagram', 'as', 'a', 'function', 'of', 'interstitial', 'iron', 'concentration', 'several', 'theories', 'have', 'been', 'put', 'forward', 'to', 'explain', 'the', 'different', 'magnetic', 'orders', 'observed', 'in', 'the', 'phase', 'diagram', 'which', 'ascribe', 'a', 'dominant', 'role', 'either', 'to', 'interactions', 'mediated', 'by', 'itinerant', 'electrons', 'or', 'to', 'local', 'moment', 'interactions', 'through', 'the', 'controlled', 'removal', 'of', 'surface', 'excess', 'iron', 'we', 'can', 'separate', 'the', 'influence', 'of', 'the', 'excess', 'iron', 'from', 'that', 'of', 'the', 'change', 'in', 'the', 'lattice', 'structure']] | [-0.14588194960929654, 0.21725501272374312, -0.020740992475357663, 0.06547349094133195, -0.06588788239939793, -0.10729980742168688, 0.08497891464975436, 0.4068318170218452, -0.27948204030257623, -0.3494812946112172, -0.014003803478428037, -0.35234422785720815, -0.12253555187930328, 0.1746988255495986, 0.057905957955439145, -0.013258449302205967, -0.09197047931563763, -0.05710551927709398, -0.1327429192118674, -0.20248282637535217, 0.2808288010151906, 0.04394835204427206, 0.3379934631772591, 0.10197585875898399, 0.030188965416085477, 0.0035924161406787666, 0.08957751553404976, 0.03554348906225248, -0.13324562062666087, 0.1156931105872138, 0.2578597615435216, -0.08640243922127411, 0.18065249194655367, -0.48622103520618704, -0.26058500626036346, 0.02778667289562322, 0.16271833670828995, 0.09814930542268337, -0.13723627498256974, -0.25501234367540154, 0.01753120486958053, -0.14244926080887987, -0.146661519283756, -0.11827527692012892, -0.02065389060000008, 0.0039012456986096664, -0.20928942335288142, 0.060294266769700254, 0.06417908243885315, 0.11864406124663514, -0.11878866595971221, -0.11282537678080434, -0.06986405569556597, 0.071068429030994, 0.06664713434214276, 0.02461794579269465, 0.19308382993551423, -0.1329333659865566, -0.12542147909580553, 0.37026787031995684, -0.019235420499761537, -0.04530751317066166, 0.1893311610470551, -0.19593654555029463, -0.10229388016356293, 0.19994397757801455, 0.14161086795109049, 0.09553491072477521, -0.1560792698331391, 0.06921715493710409, 0.027206195134518517, 0.1644964942258682, 0.01084033924790502, 0.10568304951113926, 0.3001734038556901, 0.21779692969662515, 0.032119750795646794, 0.11719866565820396, -0.13427372375421376, -0.04232967134904922, -0.17573219968786313, -0.2220255353148221, -0.1513304525508067, 0.04606920317589381, -0.06073384729136927, -0.22253713534981315, 0.3886754167442386, 0.1726781239235975, 0.14733355861855327, -0.1864709492444023, 0.2456443509790178, 0.04922134488761249, 0.07905912780945466, -0.04441828650384638, 0.2559557022539446, 0.17477483154633208, 0.10937055397929775, -0.2977241840908883, 0.1629786864300636, 0.03635874798055738] |
1,802.05979 | Shifted double Lie-Rinehart algebras | We generalize the notions of shifted double Poisson and shifted double
Lie-Rinehart structures, defined by Van den Bergh in [VdB08a, VdB08b], to
monoids in a symmetric monoidal abelian category. The main result is that an
n-shifted double Lie-Rinehart structure on a pair (A, M) is equivalent to a
non-shifted double Lie-Rinehart structure on the pair (A, M [--n]).
| math.RA math.AG | we generalize the notions of shifted double poisson and shifted double lierinehart structures defined by van den bergh in vdb08a vdb08b to monoids in a symmetric monoidal abelian category the main result is that an nshifted double lierinehart structure on a pair a m is equivalent to a nonshifted double lierinehart structure on the pair a m n | [['we', 'generalize', 'the', 'notions', 'of', 'shifted', 'double', 'poisson', 'and', 'shifted', 'double', 'lierinehart', 'structures', 'defined', 'by', 'van', 'den', 'bergh', 'in', 'vdb08a', 'vdb08b', 'to', 'monoids', 'in', 'a', 'symmetric', 'monoidal', 'abelian', 'category', 'the', 'main', 'result', 'is', 'that', 'an', 'nshifted', 'double', 'lierinehart', 'structure', 'on', 'a', 'pair', 'a', 'm', 'is', 'equivalent', 'to', 'a', 'nonshifted', 'double', 'lierinehart', 'structure', 'on', 'the', 'pair', 'a', 'm', 'n']] | [-0.2010762644931674, 0.03470554025911302, -0.06576447820823107, 0.13084902556563197, -0.11931503711301568, -0.14979284720279143, -0.0018796211640749658, 0.3814883688464761, -0.3924405913400863, -0.16893086327140086, -0.03590666678584447, -0.1995949633752129, -0.17916089010707634, 0.1831784835002119, -0.1575961108485769, -0.12118791978407119, 0.01965632156601974, 0.08017062848271703, -0.11892919115156733, -0.26209226678890574, 0.46522880751373513, 0.04205305250694177, 0.24996324003274953, -0.017998104453519254, 0.054459432289669554, 0.03776791278505698, -0.004218453308567405, 0.011239591985940933, -0.1719818149105257, 0.11288246563968382, 0.2538663211079048, -0.03932239920166986, 0.2262989501406472, -0.30182181890787824, -0.047342826695447524, 0.09664496089265283, 0.08416289651566851, -0.006590014697784292, -0.024290605818220814, -0.32979214786817984, 0.13310105824244342, -0.2633179663015263, -0.13100372709699773, 0.0359439428263743, 0.07248887220131499, 0.04474172528300967, -0.24602531145085646, -0.057744129261534126, 0.17222461616620421, 0.020787478640808592, -0.011814588547817298, -0.08736132766352966, -0.08414834634666997, 0.023756072282724614, -0.17124905364887258, 0.022578171595731483, 0.14581050894256414, -0.07522894209250808, -0.18832470433387374, 0.3249872203118035, -0.10101153831263739, -0.19651645940029994, 0.09719138023709613, -0.1246209810903695, -0.15435112194557274, 0.13434353785123676, -0.025091890644814287, 0.15128522136780834, -0.026825563601700457, 0.25527577740701546, -0.16804890841844358, 0.062213179861178754, 0.17160297522787005, -0.04339541773411578, 0.1778506716031448, 0.11016617378585838, 0.049809274109845446, 0.14449554250209726, 0.003252156635945929, -0.10151249367377854, -0.31996122430012164, -0.19871136133692094, -0.06835696493674602, 0.1821293859809105, -0.027122972848831393, -0.25186946070919347, 0.32440601841413547, -0.04362651414703578, 0.24077074933198414, 0.09308660171726453, 0.1912680780806113, 0.028508966356249794, 0.09085408915832106, -0.03379263259869601, 0.09323375851714186, 0.3670924570719113, 0.013376052167067038, -0.1170834633355428, -0.06953650995689843, 0.22915503084992192] |
1,802.0598 | WHInter: A Working set algorithm for High-dimensional sparse second
order Interaction models | Learning sparse linear models with two-way interactions is desirable in many
application domains such as genomics. l1-regularised linear models are popular
to estimate sparse models, yet standard implementations fail to address
specifically the quadratic explosion of candidate two-way interactions in high
dimensions, and typically do not scale to genetic data with hundreds of
thousands of features. Here we present WHInter, a working set algorithm to
solve large l1-regularised problems with two-way interactions for binary design
matrices. The novelty of WHInter stems from a new bound to efficiently identify
working sets while avoiding to scan all features, and on fast computations
inspired from solutions to the maximum inner product search problem. We apply
WHInter to simulated and real genetic data and show that it is more scalable
and two orders of magnitude faster than the state of the art.
| q-bio.QM cs.LG stat.ML | learning sparse linear models with twoway interactions is desirable in many application domains such as genomics l1regularised linear models are popular to estimate sparse models yet standard implementations fail to address specifically the quadratic explosion of candidate twoway interactions in high dimensions and typically do not scale to genetic data with hundreds of thousands of features here we present whinter a working set algorithm to solve large l1regularised problems with twoway interactions for binary design matrices the novelty of whinter stems from a new bound to efficiently identify working sets while avoiding to scan all features and on fast computations inspired from solutions to the maximum inner product search problem we apply whinter to simulated and real genetic data and show that it is more scalable and two orders of magnitude faster than the state of the art | [['learning', 'sparse', 'linear', 'models', 'with', 'twoway', 'interactions', 'is', 'desirable', 'in', 'many', 'application', 'domains', 'such', 'as', 'genomics', 'l1regularised', 'linear', 'models', 'are', 'popular', 'to', 'estimate', 'sparse', 'models', 'yet', 'standard', 'implementations', 'fail', 'to', 'address', 'specifically', 'the', 'quadratic', 'explosion', 'of', 'candidate', 'twoway', 'interactions', 'in', 'high', 'dimensions', 'and', 'typically', 'do', 'not', 'scale', 'to', 'genetic', 'data', 'with', 'hundreds', 'of', 'thousands', 'of', 'features', 'here', 'we', 'present', 'whinter', 'a', 'working', 'set', 'algorithm', 'to', 'solve', 'large', 'l1regularised', 'problems', 'with', 'twoway', 'interactions', 'for', 'binary', 'design', 'matrices', 'the', 'novelty', 'of', 'whinter', 'stems', 'from', 'a', 'new', 'bound', 'to', 'efficiently', 'identify', 'working', 'sets', 'while', 'avoiding', 'to', 'scan', 'all', 'features', 'and', 'on', 'fast', 'computations', 'inspired', 'from', 'solutions', 'to', 'the', 'maximum', 'inner', 'product', 'search', 'problem', 'we', 'apply', 'whinter', 'to', 'simulated', 'and', 'real', 'genetic', 'data', 'and', 'show', 'that', 'it', 'is', 'more', 'scalable', 'and', 'two', 'orders', 'of', 'magnitude', 'faster', 'than', 'the', 'state', 'of', 'the', 'art']] | [-0.07522043662388836, 0.060172424624718536, -0.017112376637027516, 0.08446122604415424, -0.12953737396267517, -0.17430398907847977, 0.03138063167845009, 0.3690829049686299, -0.31370102119741633, -0.34742941100985797, 0.13191981221419102, -0.2844783023157267, -0.14843101291540628, 0.23218657255004954, -0.040345762921360266, 0.08508801303447827, 0.10527754763333018, -0.00027932178379748673, -0.08136926270055804, -0.2645462098221555, 0.28736117698580904, 0.03169760711299365, 0.2602887840475887, -0.017256699942449546, 0.10482043050304878, -0.020600639199769562, -0.0243662509122206, 0.005796676338992684, -0.06667829415897251, 0.15857966522504713, 0.3079022386640484, 0.19412296494427958, 0.2949579054736258, -0.44138849189724116, -0.20900759791873177, 0.1574578136582311, 0.14366876471852746, 0.13993560751002995, -0.03254330406097699, -0.23547274111992653, 0.10918546539495069, -0.15509147050798835, -0.06277904955341536, -0.1276282670435595, -0.009375698590541588, 0.012597895387871712, -0.2984439140692463, 0.057682200927314735, 0.017956829141600312, 0.03806055821341408, -0.03574280113218051, -0.13309107275049695, 0.06362294797573294, 0.09519759872380425, 0.03225205639912875, -0.006660763366038308, 0.08294092626858722, -0.13562061589704277, -0.1646244966858135, 0.38074980123543783, -0.05606663438907965, -0.18925529911853922, 0.280840557979365, -0.08268917209181167, -0.1263773847330252, 0.11851452157476589, 0.24637429026873126, 0.1285990901044844, -0.15586463843903722, 0.04759597871923367, -0.009775664883337039, 0.19395982745952686, 0.031023393318344673, 0.012997956193216583, 0.14244360011584564, 0.1935368177775458, 0.08244169334434179, 0.13060062992564567, -0.07105315226534217, -0.13913952853352599, -0.20144389027400927, -0.09687931142509436, -0.1859867459596203, -0.015266689169199226, -0.09686775888975022, -0.18100590470438713, 0.37612037318895625, 0.199517022808055, 0.20442210744230954, 0.08190135628555094, 0.3180771060356432, 0.031042407066599803, 0.12490368063898881, 0.10724022377090638, 0.17613529721069532, 0.08820741439087536, 0.05553857073605554, -0.1685259391396197, 0.05577165991930729, 0.02439351461811491] |
1,802.05981 | Tensor-based Nonlinear Classifier for High-Order Data Analysis | In this paper we propose a tensor-based nonlinear model for high-order data
classification. The advantages of the proposed scheme are that (i) it
significantly reduces the number of weight parameters, and hence of required
training samples, and (ii) it retains the spatial structure of the input
samples. The proposed model, called \textit{Rank}-1 FNN, is based on a
modification of a feedforward neural network (FNN), such that its weights
satisfy the {\it rank}-1 canonical decomposition. We also introduce a new
learning algorithm to train the model, and we evaluate the \textit{Rank}-1 FNN
on third-order hyperspectral data. Experimental results and comparisons
indicate that the proposed model outperforms state of the art classification
methods, including deep learning based ones, especially in cases with small
numbers of available training samples.
| cs.LG stat.ML | in this paper we propose a tensorbased nonlinear model for highorder data classification the advantages of the proposed scheme are that i it significantly reduces the number of weight parameters and hence of required training samples and ii it retains the spatial structure of the input samples the proposed model called textitrank1 fnn is based on a modification of a feedforward neural network fnn such that its weights satisfy the it rank1 canonical decomposition we also introduce a new learning algorithm to train the model and we evaluate the textitrank1 fnn on thirdorder hyperspectral data experimental results and comparisons indicate that the proposed model outperforms state of the art classification methods including deep learning based ones especially in cases with small numbers of available training samples | [['in', 'this', 'paper', 'we', 'propose', 'a', 'tensorbased', 'nonlinear', 'model', 'for', 'highorder', 'data', 'classification', 'the', 'advantages', 'of', 'the', 'proposed', 'scheme', 'are', 'that', 'i', 'it', 'significantly', 'reduces', 'the', 'number', 'of', 'weight', 'parameters', 'and', 'hence', 'of', 'required', 'training', 'samples', 'and', 'ii', 'it', 'retains', 'the', 'spatial', 'structure', 'of', 'the', 'input', 'samples', 'the', 'proposed', 'model', 'called', 'textitrank1', 'fnn', 'is', 'based', 'on', 'a', 'modification', 'of', 'a', 'feedforward', 'neural', 'network', 'fnn', 'such', 'that', 'its', 'weights', 'satisfy', 'the', 'it', 'rank1', 'canonical', 'decomposition', 'we', 'also', 'introduce', 'a', 'new', 'learning', 'algorithm', 'to', 'train', 'the', 'model', 'and', 'we', 'evaluate', 'the', 'textitrank1', 'fnn', 'on', 'thirdorder', 'hyperspectral', 'data', 'experimental', 'results', 'and', 'comparisons', 'indicate', 'that', 'the', 'proposed', 'model', 'outperforms', 'state', 'of', 'the', 'art', 'classification', 'methods', 'including', 'deep', 'learning', 'based', 'ones', 'especially', 'in', 'cases', 'with', 'small', 'numbers', 'of', 'available', 'training', 'samples']] | [-0.036329207615175794, -0.00011473048793812913, -0.06526422605759674, 0.03782346801299061, -0.09517706738552079, -0.17557793389630294, 0.0408913568310034, 0.41710449265496385, -0.25378767450925926, -0.2951356399233543, 0.06864238026901148, -0.2601876555371188, -0.22917035181495932, 0.19320628463455866, -0.07537280993851563, 0.08495820742738884, 0.14692779261648894, 0.053297558420097396, -0.08572855902386964, -0.3117039807698494, 0.32864962894499544, 0.03346845134881498, 0.37626756208896217, -0.013918340722504523, 0.1688183151922966, -0.019703790860911532, -0.03128122233301251, 0.01890725373383365, -0.06117066912884184, 0.163702717124139, 0.23381018575521245, 0.20471276869648136, 0.296231034731928, -0.3874877302667066, -0.22870008172016712, 0.11755973582377567, 0.10109527196337079, 0.12255762350292981, -0.041009592533760776, -0.26150542712439934, 0.11090396966345349, -0.168310678969588, 0.005918875785174614, -0.17136045866796085, -0.04997757531002149, 0.015408694545077461, -0.33753483755853886, 0.05050106939363046, 0.09137672707701343, 0.0045681854244321585, -0.07468833202484905, -0.16943639127777949, 0.010357670065376067, 0.08971251172929882, -0.0015710899869220392, 0.023834271457857423, 0.06530703490810288, -0.18519142341386713, -0.1259465835417711, 0.3421072169176994, -0.05780638014191702, -0.22557006574295943, 0.1690871218076697, -0.026669892140724245, -0.15311154823059275, 0.10045985931367707, 0.21176914508724887, 0.12817267501246063, -0.08870503054077422, 0.0465160574737726, -0.06785875295604309, 0.18158971784155695, -0.007168380702721826, 0.004282253298668131, 0.07014375866480893, 0.26715724246065703, 0.005584173913737158, 0.13635689787934685, -0.17544641573312542, -0.05922745975605663, -0.2618978501132299, -0.11625957564871398, -0.23536171039543866, -0.054590257523100705, -0.1146612463086175, -0.16505393811272487, 0.4547776690180047, 0.2265157700861774, 0.22834707225011963, 0.12788186123174045, 0.35543350057466133, 0.05530761801938136, 0.12438788809888665, 0.10763175040107942, 0.19767402280722896, 0.08067541444794304, 0.08966151155595246, -0.19962763360085628, 0.06780479648155198, 0.06404551437181878] |
1,802.05982 | Residual-Based Detections and Unified Architecture for Massive MIMO
Uplink | Massive multiple-input multiple-output (M-MIMO) technique brings better
energy efficiency and coverage but higher computational complexity than
small-scale MIMO. For linear detections such as minimum mean square error
(MMSE), prohibitive complexity lies in solving large-scale linear equations.
For a better trade-off between bit-error-rate (BER) performance and
computational complexity, iterative linear algorithms like conjugate gradient
(CG) have been applied and have shown their feasibility in recent years. In
this paper, residual-based detection (RBD) algorithms are proposed for M-MIMO
detection, including minimal residual (MINRES) algorithm, generalized minimal
residual (GMRES) algorithm, and conjugate residual (CR) algorithm. RBD
algorithms focus on the minimization of residual norm per iteration, whereas
most existing algorithms focus on the approximation of exact signal. Numerical
results have shown that, for $64$-QAM $128\times 8$ MIMO, RBD algorithms are
only $0.13$ dB away from the exact matrix inversion method when BER$=10^{-4}$.
Stability of RBD algorithms has also been verified in various correlation
conditions. Complexity comparison has shown that, CR algorithm require $87\%$
less complexity than the traditional method for $128\times 60$ MIMO. The
unified hardware architecture is proposed with flexibility, which guarantees a
low-complexity implementation for a family of RBD M-MIMO detectors.
| eess.SP cs.AR cs.CE cs.NA | massive multipleinput multipleoutput mmimo technique brings better energy efficiency and coverage but higher computational complexity than smallscale mimo for linear detections such as minimum mean square error mmse prohibitive complexity lies in solving largescale linear equations for a better tradeoff between biterrorrate ber performance and computational complexity iterative linear algorithms like conjugate gradient cg have been applied and have shown their feasibility in recent years in this paper residualbased detection rbd algorithms are proposed for mmimo detection including minimal residual minres algorithm generalized minimal residual gmres algorithm and conjugate residual cr algorithm rbd algorithms focus on the minimization of residual norm per iteration whereas most existing algorithms focus on the approximation of exact signal numerical results have shown that for 64qam 128times 8 mimo rbd algorithms are only 013 db away from the exact matrix inversion method when ber104 stability of rbd algorithms has also been verified in various correlation conditions complexity comparison has shown that cr algorithm require 87 less complexity than the traditional method for 128times 60 mimo the unified hardware architecture is proposed with flexibility which guarantees a lowcomplexity implementation for a family of rbd mmimo detectors | [['massive', 'multipleinput', 'multipleoutput', 'mmimo', 'technique', 'brings', 'better', 'energy', 'efficiency', 'and', 'coverage', 'but', 'higher', 'computational', 'complexity', 'than', 'smallscale', 'mimo', 'for', 'linear', 'detections', 'such', 'as', 'minimum', 'mean', 'square', 'error', 'mmse', 'prohibitive', 'complexity', 'lies', 'in', 'solving', 'largescale', 'linear', 'equations', 'for', 'a', 'better', 'tradeoff', 'between', 'biterrorrate', 'ber', 'performance', 'and', 'computational', 'complexity', 'iterative', 'linear', 'algorithms', 'like', 'conjugate', 'gradient', 'cg', 'have', 'been', 'applied', 'and', 'have', 'shown', 'their', 'feasibility', 'in', 'recent', 'years', 'in', 'this', 'paper', 'residualbased', 'detection', 'rbd', 'algorithms', 'are', 'proposed', 'for', 'mmimo', 'detection', 'including', 'minimal', 'residual', 'minres', 'algorithm', 'generalized', 'minimal', 'residual', 'gmres', 'algorithm', 'and', 'conjugate', 'residual', 'cr', 'algorithm', 'rbd', 'algorithms', 'focus', 'on', 'the', 'minimization', 'of', 'residual', 'norm', 'per', 'iteration', 'whereas', 'most', 'existing', 'algorithms', 'focus', 'on', 'the', 'approximation', 'of', 'exact', 'signal', 'numerical', 'results', 'have', 'shown', 'that', 'for', '64qam', '128times', '8', 'mimo', 'rbd', 'algorithms', 'are', 'only', '013', 'db', 'away', 'from', 'the', 'exact', 'matrix', 'inversion', 'method', 'when', 'ber104', 'stability', 'of', 'rbd', 'algorithms', 'has', 'also', 'been', 'verified', 'in', 'various', 'correlation', 'conditions', 'complexity', 'comparison', 'has', 'shown', 'that', 'cr', 'algorithm', 'require', '87', 'less', 'complexity', 'than', 'the', 'traditional', 'method', 'for', '128times', '60', 'mimo', 'the', 'unified', 'hardware', 'architecture', 'is', 'proposed', 'with', 'flexibility', 'which', 'guarantees', 'a', 'lowcomplexity', 'implementation', 'for', 'a', 'family', 'of', 'rbd', 'mmimo', 'detectors']] | [-0.14590853402112663, -0.04433796805127588, -0.013355349406271078, 0.05611349663865955, -0.043846452979508926, -0.24824406705037863, 0.03667291808718195, 0.40221701839214397, -0.21413772250956822, -0.324927388074458, 0.12339342408443964, -0.23477027611653, -0.21817008031238974, 0.22456686511123305, -0.10801083426774731, 0.16664455205919074, 0.10585247157215481, 0.015282219847437566, -0.16749490056896493, -0.3153617245708124, 0.17533876932911063, 0.1401728092041113, 0.3639249004049118, -0.013967668755280554, 0.11082647327905294, -0.05661304406643101, -0.011940087430750725, -0.008360861904091306, -0.06509459235315228, 0.08118423336510738, 0.29839860396607526, 0.2316713350647617, 0.3293972504768698, -0.3901310508581686, -0.2357794928965627, 0.12210043045081119, 0.22863540072708574, 0.0667776095886621, -0.09559020659856735, -0.23788905573612149, 0.16509241919296858, -0.20651242289465493, -0.007293654541687044, -0.0612221474004121, -0.07343314468821205, 0.02660802199268743, -0.31205710805903275, 0.09149531455893468, 0.04182608276371544, 0.08903945672831488, -0.007551309039136247, -0.24772372485074418, 0.07248989287357305, 0.01346005394481364, 0.011140481043464096, 0.023607346069107138, 0.07346009519246835, -0.06870269783398028, -0.12426985915542073, 0.32697947338690353, -0.01721438016109883, -0.2555845478184955, 0.17277633479091697, -0.025395790149492246, -0.14646327904075698, 0.23078325798577337, 0.2531992802858382, 0.09014577766579808, -0.14006988121180922, 0.10843143479593059, 0.017714233007084912, 0.17989962688947797, 0.06340656188321571, 0.09956981492765918, 0.05158484385166534, 0.2062887818535307, 0.16136207695552715, 0.11527678145467743, -0.13047162060275988, -0.11701013849279474, -0.15141027969204718, -0.13480242689894067, -0.20162193960554542, -0.03275367706058123, -0.1542807168650032, -0.10437854042492478, 0.3423215903775402, 0.1430927412880082, 0.07631088438857761, 0.17194441862456086, 0.4065231770442099, 0.10785313032594603, 0.07493101332518987, 0.16808889986375575, 0.24241484049954032, 0.15199294884285086, 0.07068648578342858, -0.2536063713684343, 0.05531374517909532, 0.09392018581213302] |
1,802.05983 | Disentangling by Factorising | We define and address the problem of unsupervised learning of disentangled
representations on data generated from independent factors of variation. We
propose FactorVAE, a method that disentangles by encouraging the distribution
of representations to be factorial and hence independent across the dimensions.
We show that it improves upon $\beta$-VAE by providing a better trade-off
between disentanglement and reconstruction quality. Moreover, we highlight the
problems of a commonly used disentanglement metric and introduce a new metric
that does not suffer from them.
| stat.ML cs.LG | we define and address the problem of unsupervised learning of disentangled representations on data generated from independent factors of variation we propose factorvae a method that disentangles by encouraging the distribution of representations to be factorial and hence independent across the dimensions we show that it improves upon betavae by providing a better tradeoff between disentanglement and reconstruction quality moreover we highlight the problems of a commonly used disentanglement metric and introduce a new metric that does not suffer from them | [['we', 'define', 'and', 'address', 'the', 'problem', 'of', 'unsupervised', 'learning', 'of', 'disentangled', 'representations', 'on', 'data', 'generated', 'from', 'independent', 'factors', 'of', 'variation', 'we', 'propose', 'factorvae', 'a', 'method', 'that', 'disentangles', 'by', 'encouraging', 'the', 'distribution', 'of', 'representations', 'to', 'be', 'factorial', 'and', 'hence', 'independent', 'across', 'the', 'dimensions', 'we', 'show', 'that', 'it', 'improves', 'upon', 'betavae', 'by', 'providing', 'a', 'better', 'tradeoff', 'between', 'disentanglement', 'and', 'reconstruction', 'quality', 'moreover', 'we', 'highlight', 'the', 'problems', 'of', 'a', 'commonly', 'used', 'disentanglement', 'metric', 'and', 'introduce', 'a', 'new', 'metric', 'that', 'does', 'not', 'suffer', 'from', 'them']] | [-0.024651446798816323, 0.07837539346655831, -0.1159392922418192, 0.0744624744169414, -0.08144080123747699, -0.12311830576509238, 0.06988058363785968, 0.4206186968833208, -0.296940267609898, -0.3063866555690765, 0.05829271173570305, -0.25578311844728885, -0.1953857068088837, 0.1972374799021054, -0.13176224168855696, 0.025951040686049965, 0.10581286763772368, 0.010580809693783522, -0.12368254086759407, -0.24086517693649512, 0.40086767183383926, 0.02710291198454797, 0.34272953812032936, 0.05064521682797931, 0.18609381361893612, 0.010704815265489743, -0.06230582923162729, 0.0367013921844773, -0.09781020658692796, 0.18705489056155783, 0.26711377904284744, 0.22751208660320116, 0.26393641940667295, -0.36192466486245395, -0.2297314928029664, 0.11898442660458386, 0.14288665228232275, 0.10320256404520478, -0.030329784208151977, -0.30290222793119026, 0.09280523819616064, -0.1387633736943826, -0.017046631351695395, -0.15587914990028368, -0.053834089485462755, -0.011280898506811354, -0.29096614340669474, 0.09186897195759229, 0.0942551594991528, 0.024089025834109636, -0.050456343864789234, -0.087227081914898, 0.06763055950868875, 0.17796311515849084, 0.07288714150490705, 0.05119352141045965, 0.08256206965306774, -0.13000493755098433, -0.13110174631001428, 0.3446250701206736, -0.0754137339652516, -0.24402300345245748, 0.19600237358827144, -0.07930052801966667, -0.1285573159228079, 0.06811260333051905, 0.21243448460008948, 0.10409736568108201, -0.1235835408209823, 0.03214741942647379, -0.02555790706537664, 0.19221063567965757, 0.05609420404070988, 0.029949850350385533, 0.14110694126356976, 0.15174719642382115, 0.06102018313249573, 0.18046840116439852, -0.05700817511569767, -0.023572589689865708, -0.2617096154484898, -0.1348135725944303, -0.18953147967695258, 0.01476367993182066, -0.11985849499396864, -0.14389527053572237, 0.4218672745861113, 0.22596349537780042, 0.26341514656087384, 0.07587679681855661, 0.284616274209111, 0.0687357445829548, 0.08638568682945333, 0.09362211271945853, 0.20557964699692094, 0.030047567893052473, 0.03924030638299882, -0.2107197213859763, 0.08264454606105573, 0.04413000526255928] |
1,802.05984 | On involution $le$-semigroups | We deal with involution ordered semigroups possessing a greatest element, we
introduce the concepts of $*$-regularity, $*$-intra-regularity, $*$-bi-ideal
element and $*$-quasi-ideal element in this type of semigroups and, using the
right and left ideal elements, we give relations between the regularity and
$*$-regularity, between intra-regularity and $*$-intra-regularity. Finally, we
prove that in an involution $*$-regular $\vee e$-semigroup every $*$-bi-ideal
element can be considered as a product of a right and a left ideal element, we
describe the form of the filter generated by an element of an involution
$*$-intra-regular $poe$-semigroup $S$, showing that every $\cal N$-class of $S$
has a greatest element.
| math.GM | we deal with involution ordered semigroups possessing a greatest element we introduce the concepts of regularity intraregularity biideal element and quasiideal element in this type of semigroups and using the right and left ideal elements we give relations between the regularity and regularity between intraregularity and intraregularity finally we prove that in an involution regular vee esemigroup every biideal element can be considered as a product of a right and a left ideal element we describe the form of the filter generated by an element of an involution intraregular poesemigroup s showing that every cal nclass of s has a greatest element | [['we', 'deal', 'with', 'involution', 'ordered', 'semigroups', 'possessing', 'a', 'greatest', 'element', 'we', 'introduce', 'the', 'concepts', 'of', 'regularity', 'intraregularity', 'biideal', 'element', 'and', 'quasiideal', 'element', 'in', 'this', 'type', 'of', 'semigroups', 'and', 'using', 'the', 'right', 'and', 'left', 'ideal', 'elements', 'we', 'give', 'relations', 'between', 'the', 'regularity', 'and', 'regularity', 'between', 'intraregularity', 'and', 'intraregularity', 'finally', 'we', 'prove', 'that', 'in', 'an', 'involution', 'regular', 'vee', 'esemigroup', 'every', 'biideal', 'element', 'can', 'be', 'considered', 'as', 'a', 'product', 'of', 'a', 'right', 'and', 'a', 'left', 'ideal', 'element', 'we', 'describe', 'the', 'form', 'of', 'the', 'filter', 'generated', 'by', 'an', 'element', 'of', 'an', 'involution', 'intraregular', 'poesemigroup', 's', 'showing', 'that', 'every', 'cal', 'nclass', 'of', 's', 'has', 'a', 'greatest', 'element']] | [-0.1344761762302369, 0.10440292979517835, -0.06853868152247741, 0.014437676774105058, -0.04827642828226089, -0.12652929111849517, -0.006597139928489923, 0.39359905168414117, -0.3628841493651271, -0.13032244401983917, 0.1431889188173227, -0.3378760977089405, -0.09794686132110655, 0.12920529568567873, -0.11235768740298227, -0.02695444627664983, 0.044269236291293056, 0.10490056591108442, -0.10570492125116289, -0.17186003577895462, 0.35020368479192254, -0.047228452572599056, 0.14199282146291808, 0.017734367828816176, 0.16532372870482503, -0.049190511680208146, -0.01626154379104264, 0.030762019916437566, -0.17296597575841588, 0.12467456910060719, 0.2557134392741136, 0.10194392035948113, 0.24255432678386568, -0.4101810702373041, -0.08967332140076906, 0.18551480371505022, 0.10715656628832221, -0.04425709278555587, -0.09828955915058031, -0.242664238801226, 0.17048406023997814, -0.21254508482292295, -0.17130295843817295, -0.03932965696789324, 0.10625932830385863, 0.01880367754783947, -0.34257928546518085, -0.03839265932328999, 0.1416057800129056, 0.1342422036640346, 0.004921523230150342, -0.1130226271529682, -0.04100783508270979, 0.07477996905799955, -0.05214272839948535, -0.009681117301806808, 0.008787252175388859, -0.05530400160467252, -0.1149529829248786, 0.36184621926397087, -0.06496562324755359, -0.2502819497510791, 0.1283530911616981, -0.1462670636875555, -0.07965017174370587, 0.039588486000429836, 0.035847812807187435, 0.14021023744018749, -0.06310131525155156, 0.2031216669047717, -0.14428508889861405, 0.1532280337996781, 0.10988785872934387, 0.02225687008816749, 0.10685517895035446, 0.13879809208214283, 0.09314141118898987, 0.11751961567555554, 0.011098709590733051, 0.041390634156996384, -0.36562845995649695, -0.256270537013188, -0.09762774600880221, 0.0835478154712473, -0.10312919345131377, -0.22136573757044972, 0.3783894020016305, 0.13299018897581846, 0.14689271009527147, 0.011836288379272445, 0.17107969014905394, 0.11162908118101768, 0.027524131406098603, 0.08409794659353792, 0.08712649936089292, 0.19036683050217107, -0.02179281393298879, -0.19036165068624541, 0.023713820185512303, 0.2368501087743789] |
1,802.05985 | Some uniqueness results related to the Br\"{u}ck Conjecture | Let f be a non-constant meromorphic function and a = a(z) be a small function
of f. Under certain essential conditions, we obtained similar type conclusion
of Bruck Conjecture, when f and its differential polynomial P[f] shares a with
weight l. Our result improves and generalizes a recent result of Li, Yang, and
Liu.
| math.CV | let f be a nonconstant meromorphic function and a az be a small function of f under certain essential conditions we obtained similar type conclusion of bruck conjecture when f and its differential polynomial pf shares a with weight l our result improves and generalizes a recent result of li yang and liu | [['let', 'f', 'be', 'a', 'nonconstant', 'meromorphic', 'function', 'and', 'a', 'az', 'be', 'a', 'small', 'function', 'of', 'f', 'under', 'certain', 'essential', 'conditions', 'we', 'obtained', 'similar', 'type', 'conclusion', 'of', 'bruck', 'conjecture', 'when', 'f', 'and', 'its', 'differential', 'polynomial', 'pf', 'shares', 'a', 'with', 'weight', 'l', 'our', 'result', 'improves', 'and', 'generalizes', 'a', 'recent', 'result', 'of', 'li', 'yang', 'and', 'liu']] | [-0.17275722912965202, 0.02942964576957923, -0.09950128682660607, -0.0021250102897438236, -0.07552601366725592, -0.1934718947400743, 0.039577530336759564, 0.24989797097613226, -0.2688129444712035, -0.2674158855763106, 0.025162483504006884, -0.2192117503606978, -0.1784007485323357, 0.2321178362054645, -0.1339061748552716, 0.032820937960663425, 0.04939642119801269, 0.03603744183508855, -0.08957484508600999, -0.3283038422957344, 0.31273090129472175, 0.007378489429236583, 0.17877438388993297, 0.07665778529052711, 0.0718649597399218, 0.026333158310801495, -0.04209090365132071, 0.004430642891850955, -0.17223061837326242, 0.07496801648236248, 0.2353814913768251, 0.09182105617562555, 0.2909384547240751, -0.3010059750445609, -0.18912140839021513, 0.17877654606072269, 0.07483297980495922, -0.031108752666216977, -0.019979488681167154, -0.24331074819531082, 0.14800042196897403, -0.1666974405635078, -0.21814956702291965, -0.01408302404408185, 0.08719483562657293, 0.08561125179787851, -0.4000981148543223, 0.06481692112349677, 0.15804597090508016, 0.07092656595368851, -0.05579927518199426, -0.18206402398470156, -0.08276989240252045, 0.029309570699829153, -0.012996325128764476, 0.1935197589040365, 0.05614378943793335, -0.07731337490368564, -0.04047133409822325, 0.27618518919807, -0.14686943364839228, -0.21127950118960076, 0.15781766912495754, -0.1672379802670857, -0.15656408999677537, 0.09214056762954537, 0.035879401797604446, 0.16922130025396087, -0.037283155167934415, 0.217694067180965, -0.15957880625720927, 0.08723816574322728, 0.12399547938960341, -0.025541976586265384, 0.08070830995972567, 0.05068602968437843, 0.06958506544524769, 0.13111677888411818, 0.04085153225317316, 0.0194485702218031, -0.30012233868100735, -0.18179739046982438, -0.1480694485055107, 0.14143033174551883, -0.09498264784990582, -0.1492550338987472, 0.37366507532303483, 0.005594839464943364, 0.2648793814268912, 0.10944096042932767, 0.1544970610477733, 0.15556860446077683, 0.038908748650255634, 0.07199084103318318, 0.0902252170907439, 0.21551445566715216, 0.056068691864328564, -0.16464101024112612, 0.06629487853727901, 0.14840834970884728] |
1,802.05986 | Effect of rainfall and fire frequency on tree--grass dynamics: Capturing
the forest--savanna distributions along biogeographic gradients | In this work, we improve a previous minimalistic tree-grass savanna model by
taking into account water availability, in addition to fire, since both factors
are known to be important for shaping savanna physiognomies along a climatic
gradient. As in our previous models, we consider two nonlinear functions of
grass and tree biomasses to respectively take into account grass-fire
feedbacks, and the response of trees to fire of a given intensity. The novelty
is that rainfall is taken into account in the tree and grass growth functions
and in the biomass carrying capacities. Then, we derive a qualitative analysis
of the ODE model, showing existence of equilibria, and studying their stability
conditions. We also construct a two dimension bifurcation diagram based on
rainfall and fire frequency. This led to summarize different scenarios for the
model including multi-stabilities that are proven possible. Next, to bring more
realism in the model, pulsed fire events are modelled as part of an IDE
(Impulsive differential Equations) system analogous to the ODE system.
Numerical simulations are provided and we discuss some important ecological
outcomes that our ODE and IDE models are able to predict. Notably, the
expansion of forest into tree-poor physiognomies (grassland and savanna) is
systematically predicted when fire return period increases, especially in mesic
and humid climatic areas.
| q-bio.PE math.DS | in this work we improve a previous minimalistic treegrass savanna model by taking into account water availability in addition to fire since both factors are known to be important for shaping savanna physiognomies along a climatic gradient as in our previous models we consider two nonlinear functions of grass and tree biomasses to respectively take into account grassfire feedbacks and the response of trees to fire of a given intensity the novelty is that rainfall is taken into account in the tree and grass growth functions and in the biomass carrying capacities then we derive a qualitative analysis of the ode model showing existence of equilibria and studying their stability conditions we also construct a two dimension bifurcation diagram based on rainfall and fire frequency this led to summarize different scenarios for the model including multistabilities that are proven possible next to bring more realism in the model pulsed fire events are modelled as part of an ide impulsive differential equations system analogous to the ode system numerical simulations are provided and we discuss some important ecological outcomes that our ode and ide models are able to predict notably the expansion of forest into treepoor physiognomies grassland and savanna is systematically predicted when fire return period increases especially in mesic and humid climatic areas | [['in', 'this', 'work', 'we', 'improve', 'a', 'previous', 'minimalistic', 'treegrass', 'savanna', 'model', 'by', 'taking', 'into', 'account', 'water', 'availability', 'in', 'addition', 'to', 'fire', 'since', 'both', 'factors', 'are', 'known', 'to', 'be', 'important', 'for', 'shaping', 'savanna', 'physiognomies', 'along', 'a', 'climatic', 'gradient', 'as', 'in', 'our', 'previous', 'models', 'we', 'consider', 'two', 'nonlinear', 'functions', 'of', 'grass', 'and', 'tree', 'biomasses', 'to', 'respectively', 'take', 'into', 'account', 'grassfire', 'feedbacks', 'and', 'the', 'response', 'of', 'trees', 'to', 'fire', 'of', 'a', 'given', 'intensity', 'the', 'novelty', 'is', 'that', 'rainfall', 'is', 'taken', 'into', 'account', 'in', 'the', 'tree', 'and', 'grass', 'growth', 'functions', 'and', 'in', 'the', 'biomass', 'carrying', 'capacities', 'then', 'we', 'derive', 'a', 'qualitative', 'analysis', 'of', 'the', 'ode', 'model', 'showing', 'existence', 'of', 'equilibria', 'and', 'studying', 'their', 'stability', 'conditions', 'we', 'also', 'construct', 'a', 'two', 'dimension', 'bifurcation', 'diagram', 'based', 'on', 'rainfall', 'and', 'fire', 'frequency', 'this', 'led', 'to', 'summarize', 'different', 'scenarios', 'for', 'the', 'model', 'including', 'multistabilities', 'that', 'are', 'proven', 'possible', 'next', 'to', 'bring', 'more', 'realism', 'in', 'the', 'model', 'pulsed', 'fire', 'events', 'are', 'modelled', 'as', 'part', 'of', 'an', 'ide', 'impulsive', 'differential', 'equations', 'system', 'analogous', 'to', 'the', 'ode', 'system', 'numerical', 'simulations', 'are', 'provided', 'and', 'we', 'discuss', 'some', 'important', 'ecological', 'outcomes', 'that', 'our', 'ode', 'and', 'ide', 'models', 'are', 'able', 'to', 'predict', 'notably', 'the', 'expansion', 'of', 'forest', 'into', 'treepoor', 'physiognomies', 'grassland', 'and', 'savanna', 'is', 'systematically', 'predicted', 'when', 'fire', 'return', 'period', 'increases', 'especially', 'in', 'mesic', 'and', 'humid', 'climatic', 'areas']] | [-0.07466759011759201, 0.0978557421144658, -0.08109246859593051, 0.10010214511338356, -0.042186506664646524, -0.11491175036478256, 0.04639841356713857, 0.3600727606365191, -0.22786841177536796, -0.2763321294848408, 0.13704207066967639, -0.27886706216238616, -0.18782312246593869, 0.19687077877488696, -0.06821645009774892, 0.03155750281487902, 0.05131979837758644, -0.0030241213228908324, 0.050126984647552796, -0.26632370928557414, 0.285880408502583, 0.0501416313949795, 0.23903243422197798, 0.0394513390049161, 0.10749579847490948, -0.043188105434888886, -0.05927491821861449, 0.02536676579288074, -0.14448960187808205, 0.059172451420731485, 0.2625214876445257, 0.1534590593167758, 0.263604843230652, -0.476767439404059, -0.27198387096148163, 0.09892255198487657, 0.11670665667347965, 0.09942959139131874, -0.007637673239237518, -0.2743325192525628, 0.056965704332105814, -0.1668012811314492, -0.10770774331689435, -0.0663002297858752, 0.009570669385028027, 0.0447397594575748, -0.28616948560035477, 0.03228950132934621, 0.06656699818233305, 0.06551646826167902, -0.09731083602112318, -0.1267784925761156, -0.09057760649260932, 0.1625543924798313, 0.03827070418157659, -0.023054673747226063, 0.11474465601301441, -0.12959661697525354, -0.059757928208758436, 0.3657093364767553, -0.07476734980674726, -0.17071463483762706, 0.20376323276265923, -0.129939621963699, -0.15139903004982486, 0.0934645855134087, 0.2320097764754402, 0.04069492302923685, -0.15958683984617458, 0.010104283042407285, -0.007002607021214706, 0.14086786879093519, 0.05795661757944063, -0.04445360228280714, 0.1950680161660005, 0.22202153371181338, 0.05840266481973231, 0.13482613586266304, -0.06107949805335097, -0.13129710954242563, -0.23704709385943024, -0.11766288922822457, -0.05691356952634773, 0.008273187390572968, -0.08232544791105846, -0.16256223307212903, 0.40504220308115085, 0.2012669207133253, 0.18935855634599214, 0.0596376565151981, 0.28876989981647405, 0.13230104882802282, 0.024643369001084162, 0.04163490661331231, 0.20088270535052288, 0.090110523254788, 0.10622463791985952, -0.19709550525904412, 0.1123608057121081, 0.062370399532041376] |
1,802.05987 | The CMS High-Granularity Calorimeter for Operation at the
High-Luminosity LHC | The High Luminosity LHC (HL-LHC) will integrate 10 times more luminosity than
the LHC, posing significant challenges for radiation tolerance and event pileup
on detectors, especially for forward calorimetry, and hallmarks the issue for
future colliders. As part of its HL-LHC upgrade program, the CMS collaboration
is designing a High Granularity Calorimeter to replace the existing endcap
calorimeters. It features unprecedented transverse and longitudinal
segmentation for both electromagnetic (ECAL) and hadronic (HCAL) compartments.
This will facilitate particle-flow calorimetry, where the fine structure of
showers can be measured and used to enhance pileup rejection and particle
identification, whilst still achieving good energy resolution. The ECAL and a
large fraction of HCAL will be based on hexagonal silicon sensors of 0.5 to 1
cm$^2$ cell size, with the remainder of the HCAL based on highly-segmented
scintillators with SiPM readout. The intrinsic high-precision timing
capabilities of the silicon sensors will add an extra dimension to event
reconstruction, especially in terms of pileup rejection. An overview of the
HGCAL project is presented, covering motivation, engineering design, readout
and trigger concepts, and expected performance.
| physics.ins-det hep-ex | the high luminosity lhc hllhc will integrate 10 times more luminosity than the lhc posing significant challenges for radiation tolerance and event pileup on detectors especially for forward calorimetry and hallmarks the issue for future colliders as part of its hllhc upgrade program the cms collaboration is designing a high granularity calorimeter to replace the existing endcap calorimeters it features unprecedented transverse and longitudinal segmentation for both electromagnetic ecal and hadronic hcal compartments this will facilitate particleflow calorimetry where the fine structure of showers can be measured and used to enhance pileup rejection and particle identification whilst still achieving good energy resolution the ecal and a large fraction of hcal will be based on hexagonal silicon sensors of 05 to 1 cm2 cell size with the remainder of the hcal based on highlysegmented scintillators with sipm readout the intrinsic highprecision timing capabilities of the silicon sensors will add an extra dimension to event reconstruction especially in terms of pileup rejection an overview of the hgcal project is presented covering motivation engineering design readout and trigger concepts and expected performance | [['the', 'high', 'luminosity', 'lhc', 'hllhc', 'will', 'integrate', '10', 'times', 'more', 'luminosity', 'than', 'the', 'lhc', 'posing', 'significant', 'challenges', 'for', 'radiation', 'tolerance', 'and', 'event', 'pileup', 'on', 'detectors', 'especially', 'for', 'forward', 'calorimetry', 'and', 'hallmarks', 'the', 'issue', 'for', 'future', 'colliders', 'as', 'part', 'of', 'its', 'hllhc', 'upgrade', 'program', 'the', 'cms', 'collaboration', 'is', 'designing', 'a', 'high', 'granularity', 'calorimeter', 'to', 'replace', 'the', 'existing', 'endcap', 'calorimeters', 'it', 'features', 'unprecedented', 'transverse', 'and', 'longitudinal', 'segmentation', 'for', 'both', 'electromagnetic', 'ecal', 'and', 'hadronic', 'hcal', 'compartments', 'this', 'will', 'facilitate', 'particleflow', 'calorimetry', 'where', 'the', 'fine', 'structure', 'of', 'showers', 'can', 'be', 'measured', 'and', 'used', 'to', 'enhance', 'pileup', 'rejection', 'and', 'particle', 'identification', 'whilst', 'still', 'achieving', 'good', 'energy', 'resolution', 'the', 'ecal', 'and', 'a', 'large', 'fraction', 'of', 'hcal', 'will', 'be', 'based', 'on', 'hexagonal', 'silicon', 'sensors', 'of', '05', 'to', '1', 'cm2', 'cell', 'size', 'with', 'the', 'remainder', 'of', 'the', 'hcal', 'based', 'on', 'highlysegmented', 'scintillators', 'with', 'sipm', 'readout', 'the', 'intrinsic', 'highprecision', 'timing', 'capabilities', 'of', 'the', 'silicon', 'sensors', 'will', 'add', 'an', 'extra', 'dimension', 'to', 'event', 'reconstruction', 'especially', 'in', 'terms', 'of', 'pileup', 'rejection', 'an', 'overview', 'of', 'the', 'hgcal', 'project', 'is', 'presented', 'covering', 'motivation', 'engineering', 'design', 'readout', 'and', 'trigger', 'concepts', 'and', 'expected', 'performance']] | [-0.05523731648419885, 0.15401976023473538, -0.02202863333351369, 0.05013625767906639, -0.06897176539931217, -0.14993782451522, -0.05990355962877, 0.3993706547098453, -0.17313642525595388, -0.3896588752665375, 0.12184086161231175, -0.3516760102821795, 0.02886413523697102, 0.18558568053022964, -0.06257400551405033, 0.13186648007717722, 0.15314759711303108, -0.058458824087891666, -0.06822243274850302, -0.20813299684431508, 0.16078414127891416, 0.2333689639813074, 0.2889779519443218, 0.08220772452355889, 0.172928162207879, 0.023590783072198487, -0.08459066974737957, -0.023636354960750935, -0.09229703102141812, 0.08430313312366615, 0.33927861072432625, 0.11495142188001237, 0.1863549769291519, -0.434592956895927, -0.09488934699404339, 0.07710051789942234, 0.12850516297667178, -0.029210635894381404, -0.08848515431913379, -0.27576577319378587, 0.12832138336272703, -0.2291792797148436, -0.12902263721272964, -0.017452107508297406, -0.031615540249970375, -0.0035588882067474907, -0.2433526821037125, -0.03773055612707937, -0.004049858247455438, 0.03839719736188983, -0.01088393595285568, -0.16087056396336571, 0.03228176601865854, 0.04990060970999493, -0.009137646089614936, 0.04986382341961892, 0.2272276591321625, -0.19883748258245515, -0.1336799428418445, 0.3174802605921205, 0.03539130661736422, -0.17384487716407923, 0.19182017966929313, -0.20197353614025942, -0.10403222653640215, 0.2148822249842069, 0.2539370010500285, 0.025938081371665582, -0.20239587940468176, 0.03797670782578839, 0.1346169531751195, 0.22736190857792365, 0.0667546883774349, 0.12008519648631524, 0.21496062208091912, 0.33747222904030066, 0.09792628178506954, 0.09738164537328728, -0.19578339214769697, 0.04358770687545405, -0.36038057779758004, -0.17335332994083952, -0.11587479696010744, 0.028418604092016898, -0.06475496734346149, -0.1302211954279194, 0.3795355697105217, 0.1393445860990014, 0.15809063862114311, -0.0395406447051811, 0.34601073568509944, 0.029476670830578193, 0.10676558864661935, -0.005378281696330153, 0.296541378609628, 0.09582893041680521, 0.18032471806411865, -0.19691558611480384, 0.044871501731244046, 0.02304904414705058] |
1,802.05988 | On a new limit theorem in probability theory (Translation of 'Sur un
nouveau th\'eor\`eme-limite de la th\'eorie des probabilit\'es') | This is a translation of Harald Cram\'er's article, 'On a new limit theorem
in probability theory', published in French in 1938 and deriving what is
considered by mathematicians to be the first large deviation result. My hope is
that this translation will help disseminate this historically important work,
80 years after its publication.
| math.HO | this is a translation of harald cramers article on a new limit theorem in probability theory published in french in 1938 and deriving what is considered by mathematicians to be the first large deviation result my hope is that this translation will help disseminate this historically important work 80 years after its publication | [['this', 'is', 'a', 'translation', 'of', 'harald', 'cramers', 'article', 'on', 'a', 'new', 'limit', 'theorem', 'in', 'probability', 'theory', 'published', 'in', 'french', 'in', '1938', 'and', 'deriving', 'what', 'is', 'considered', 'by', 'mathematicians', 'to', 'be', 'the', 'first', 'large', 'deviation', 'result', 'my', 'hope', 'is', 'that', 'this', 'translation', 'will', 'help', 'disseminate', 'this', 'historically', 'important', 'work', '80', 'years', 'after', 'its', 'publication']] | [-0.04518977751217361, 0.1183862451217928, -0.13870015273415395, 0.11562144418932357, -0.12836893567077393, -0.10183569958503798, 0.0992387045451598, 0.2732826819168931, -0.2355012794657839, -0.3066544419084236, 0.10439510613829249, -0.2789825192248484, -0.14994038159976592, 0.19044845282398867, -0.21360640193529004, 0.016078799030576605, 0.11673994481844722, 0.02330339840121286, -0.011637626088417645, -0.3482637726965378, 0.25891678058981615, 0.10748446207352967, 0.29494036984067623, 0.07961170624871299, 0.043920737234348396, -0.008024257352962246, -0.08228621763651664, -0.036013690921706414, -0.14631964456587085, 0.18097342812579195, 0.3057670696937251, 0.17483751967830477, 0.3705609478759316, -0.36778753732533176, -0.1468515669364693, 0.05925116490326681, 0.10308594879131976, 0.15403602578356546, -0.022734633157082466, -0.2996787463648702, 0.07577224775384409, -0.22047584096215805, -0.16660654083562065, -0.03506141089843059, 0.11664279812138598, -0.03873787976731107, -0.14011548602083734, 0.043718152038120434, 0.1524501579093202, 0.14154464270005812, 0.016277303282206633, -0.1128228579928993, 0.10407315240294304, 0.12886195940861725, 0.13162609917674004, 0.1362887511100128, 0.03152694498663241, -0.054516718498835305, -0.12009688811200969, 0.39081833613509276, -0.06925081206872216, -0.13484288405908165, 0.10688570508610387, -0.1234286037133128, -0.23402240949700465, 0.04702429547203037, 0.15910001143918567, 0.0879772037689416, -0.2388516803500506, 0.10339376623720317, -0.10122111685714631, 0.13740960161535526, 0.1411266665343406, -0.04464328542070569, 0.18647927156526525, 0.16324207425679801, 0.0012109666570739926, 0.07371163090365886, -0.022571765778164537, -0.10620339038201941, -0.30068997362241995, -0.19976215561816715, -0.18448991118051675, 0.1397949680685997, 0.050053345927153714, -0.07351856446772251, 0.3648223184435716, 0.18755837658174196, 0.10950147979102044, 0.06045961965595917, 0.24277968606296577, 0.08818113228376463, 0.039134151842620854, 0.0330741920042783, 0.26051965499964524, 0.10783458829259956, 0.21208600250933812, -0.038639350499922655, 0.08938180431196431, 0.08338966529886678] |
1,802.05989 | Simplified path integral for supersymmetric quantum mechanics and type-A
trace anomalies | Particles in a curved space are classically described by a nonlinear sigma
model action that can be quantized through path integrals. The latter require a
precise regularization to deal with the derivative interactions arising from
the nonlinear kinetic term. Recently, for maximally symmetric spaces,
simplified path integrals have been developed: they allow to trade the
nonlinear kinetic term with a purely quadratic kinetic term (linear sigma
model). This happens at the expense of introducing a suitable effective scalar
potential, which contains the information on the curvature of the space. The
simplified path integral provides a sensible gain in the efficiency of
perturbative calculations. Here we extend the construction to models with N = 1
supersymmetry on the worldline, which are applicable to the first quantized
description of a Dirac fermion. As an application we use the simplified
worldline path integral to compute the type-A trace anomaly of a Dirac fermion
in d dimensions up to d = 16.
| hep-th gr-qc | particles in a curved space are classically described by a nonlinear sigma model action that can be quantized through path integrals the latter require a precise regularization to deal with the derivative interactions arising from the nonlinear kinetic term recently for maximally symmetric spaces simplified path integrals have been developed they allow to trade the nonlinear kinetic term with a purely quadratic kinetic term linear sigma model this happens at the expense of introducing a suitable effective scalar potential which contains the information on the curvature of the space the simplified path integral provides a sensible gain in the efficiency of perturbative calculations here we extend the construction to models with n 1 supersymmetry on the worldline which are applicable to the first quantized description of a dirac fermion as an application we use the simplified worldline path integral to compute the typea trace anomaly of a dirac fermion in d dimensions up to d 16 | [['particles', 'in', 'a', 'curved', 'space', 'are', 'classically', 'described', 'by', 'a', 'nonlinear', 'sigma', 'model', 'action', 'that', 'can', 'be', 'quantized', 'through', 'path', 'integrals', 'the', 'latter', 'require', 'a', 'precise', 'regularization', 'to', 'deal', 'with', 'the', 'derivative', 'interactions', 'arising', 'from', 'the', 'nonlinear', 'kinetic', 'term', 'recently', 'for', 'maximally', 'symmetric', 'spaces', 'simplified', 'path', 'integrals', 'have', 'been', 'developed', 'they', 'allow', 'to', 'trade', 'the', 'nonlinear', 'kinetic', 'term', 'with', 'a', 'purely', 'quadratic', 'kinetic', 'term', 'linear', 'sigma', 'model', 'this', 'happens', 'at', 'the', 'expense', 'of', 'introducing', 'a', 'suitable', 'effective', 'scalar', 'potential', 'which', 'contains', 'the', 'information', 'on', 'the', 'curvature', 'of', 'the', 'space', 'the', 'simplified', 'path', 'integral', 'provides', 'a', 'sensible', 'gain', 'in', 'the', 'efficiency', 'of', 'perturbative', 'calculations', 'here', 'we', 'extend', 'the', 'construction', 'to', 'models', 'with', 'n', '1', 'supersymmetry', 'on', 'the', 'worldline', 'which', 'are', 'applicable', 'to', 'the', 'first', 'quantized', 'description', 'of', 'a', 'dirac', 'fermion', 'as', 'an', 'application', 'we', 'use', 'the', 'simplified', 'worldline', 'path', 'integral', 'to', 'compute', 'the', 'typea', 'trace', 'anomaly', 'of', 'a', 'dirac', 'fermion', 'in', 'd', 'dimensions', 'up', 'to', 'd', '16']] | [-0.1391480858139216, 0.15257594839847746, -0.08408525376058279, 0.08883846122010325, -0.14142314089127841, -0.14724364016766253, 0.0014671164427477962, 0.32699285466701555, -0.2552353125722267, -0.2745583100686184, 0.06263820681712017, -0.2666256599999869, -0.15513553037099206, 0.13363594168540424, -0.029913805368451927, 0.041635210025840655, 0.04371670697135134, 0.081999429282195, -0.09968696483067618, -0.23834891886844373, 0.31772136581667626, 0.04464382907220473, 0.18638605327429011, 0.03156102053188265, 0.14907587562144423, 0.028837169662344817, -0.0263514695629382, 0.022698597785142154, -0.12617743022327396, 0.1459101419418286, 0.2107865299056077, 0.008018641802780807, 0.21684462486234388, -0.42747408924146724, -0.26346903291768964, 0.08931619618595459, 0.1345091738547079, 0.1097828219898451, -0.011038376551228933, -0.26007934328085053, 0.02801566276153048, -0.1870897330958635, -0.15342787202770033, -0.10113477428783368, -0.00978441255985019, -0.06879234560228024, -0.28475956226854277, 0.08136855204233703, 0.015215192884147072, 0.013165060555715731, -0.03388087717123712, -0.09271635694238238, -0.028028324422522042, 0.0627111053177848, 0.03885188527279892, 0.04712136940081389, 0.08047873716061123, -0.14548827792224564, -0.12853509699254154, 0.3820180617786275, -0.11698817218301627, -0.291885615447357, 0.1511057949078699, -0.10117688397757518, -0.10145996666501443, 0.17180968173062913, 0.13492870366033644, 0.14562032357431376, -0.1751792101153674, 0.17491341276898964, -0.013719440716951609, 0.11908934330224441, 0.04637587187775912, 0.02656917351608475, 0.19200309472048852, 0.12071894088951059, 0.06682955218293966, 0.13107834359293635, -0.03953557881192328, -0.15323014841646326, -0.3767111299153513, -0.17408822852844308, -0.16282987265656582, 0.08431125008008586, -0.10311415076005058, -0.16701031805207142, 0.37958680658648986, 0.11997769961957462, 0.17708652305345124, 0.07639946522137436, 0.24535699166321698, 0.18597435266994394, 0.11182270702332832, 0.04007716342591895, 0.227459635587039, 0.12543487905909737, 0.10883412461500996, -0.22353405512582797, -0.0668370183542347, 0.12467866147963856] |
1,802.0599 | Some determinants of path generating functions, II | We evaluate Hankel determinants of matrices in which the entries are
generating functions for paths consisting of up-steps, down-steps and level
steps with a fixed starting point but variable end point. By specialisation,
these determinant evaluations have numerous corollaries. In particular, one
consequence is that the Hankel determinant of Motzkin prefix numbers equals 1,
regardless of the size of the Hankel matrix.
| math.CO | we evaluate hankel determinants of matrices in which the entries are generating functions for paths consisting of upsteps downsteps and level steps with a fixed starting point but variable end point by specialisation these determinant evaluations have numerous corollaries in particular one consequence is that the hankel determinant of motzkin prefix numbers equals 1 regardless of the size of the hankel matrix | [['we', 'evaluate', 'hankel', 'determinants', 'of', 'matrices', 'in', 'which', 'the', 'entries', 'are', 'generating', 'functions', 'for', 'paths', 'consisting', 'of', 'upsteps', 'downsteps', 'and', 'level', 'steps', 'with', 'a', 'fixed', 'starting', 'point', 'but', 'variable', 'end', 'point', 'by', 'specialisation', 'these', 'determinant', 'evaluations', 'have', 'numerous', 'corollaries', 'in', 'particular', 'one', 'consequence', 'is', 'that', 'the', 'hankel', 'determinant', 'of', 'motzkin', 'prefix', 'numbers', 'equals', '1', 'regardless', 'of', 'the', 'size', 'of', 'the', 'hankel', 'matrix']] | [-0.16736567128194316, 0.1248175288971153, 0.0078315120190382, 0.06522762306755589, -0.02237852981629511, -0.09656496211555937, 0.08294683688830945, 0.34063403759031524, -0.2664458328677762, -0.22984912550647654, 0.16977130275054444, -0.33814149911725716, -0.2073364649550058, 0.12812041001199115, -0.03224721668858922, 0.04855357745902673, 0.08216218580116308, 0.06683625045022176, -0.1452129313894998, -0.26021940726035786, 0.3883450718840616, -0.00770335867174811, 0.14736142904768068, 0.01926904227284174, 0.10448308618018223, 0.00541942156550865, -0.023334784228580013, -0.08613238878282456, -0.03939450936705989, 0.05635169934436318, 0.2729124902417102, 0.17780005849236924, 0.2619230194588102, -0.3909910283870094, -0.08052469446744409, 0.17528357193054211, 0.14823838231724598, 0.0032714925792759223, -0.016411977609799754, -0.20465602893607632, 0.11660744640375337, -0.14541744413755595, -0.16311539569869637, -0.04700781965643288, 0.06307121018518604, 0.1002074361951541, -0.3008873355725119, 0.01908985514854712, 0.032250390617146844, 0.0739058785350813, 0.034922557635112636, -0.278889648210738, 0.0425821665764576, 0.13586756988098064, 0.06294362210563474, -0.01171652221396911, 0.08686487211830794, -0.0937639065339153, -0.12213351014220426, 0.31926660490552744, -0.009028654575588243, -0.23342370896810485, 0.08372043246227774, -0.15909886387206854, -0.1655855791778454, 0.15673850949913745, 0.08768958615274319, 0.11218853057512353, -0.08960026512185353, 0.10894103659102844, -0.12205700375019543, 0.14060431136468035, 0.18365358395291673, 0.03562167877962272, 0.14861259044658753, 0.05238344033263744, 0.06173957237267807, 0.1655882986322526, -0.012009444608983974, -0.104784474614726, -0.3050577281824043, -0.21443806409895902, -0.2867144876790623, 0.11208740130607639, -0.1934076808240441, -0.235820313855525, 0.4197135760989641, 0.12242173096315274, 0.2084990739775446, 0.15693091611836046, 0.19475559864733968, 0.15616232191302604, 0.09558992556131055, 0.02995488721306526, 0.03830204721570255, 0.18525430580015265, 0.04060605688080672, -0.12040308935778035, 0.033070280043888955, 0.22356443951326993] |
1,802.05991 | The N-Tuple Bandit Evolutionary Algorithm for Game Agent Optimisation | This paper describes the N-Tuple Bandit Evolutionary Algorithm (NTBEA), an
optimisation algorithm developed for noisy and expensive discrete
(combinatorial) optimisation problems. The algorithm is applied to two
game-based hyper-parameter optimisation problems. The N-Tuple system directly
models the statistics, approximating the fitness and number of evaluations of
each modelled combination of parameters. The model is simple, efficient and
informative. Results show that the NTBEA significantly outperforms grid search
and an estimation of distribution algorithm.
| cs.NE cs.AI | this paper describes the ntuple bandit evolutionary algorithm ntbea an optimisation algorithm developed for noisy and expensive discrete combinatorial optimisation problems the algorithm is applied to two gamebased hyperparameter optimisation problems the ntuple system directly models the statistics approximating the fitness and number of evaluations of each modelled combination of parameters the model is simple efficient and informative results show that the ntbea significantly outperforms grid search and an estimation of distribution algorithm | [['this', 'paper', 'describes', 'the', 'ntuple', 'bandit', 'evolutionary', 'algorithm', 'ntbea', 'an', 'optimisation', 'algorithm', 'developed', 'for', 'noisy', 'and', 'expensive', 'discrete', 'combinatorial', 'optimisation', 'problems', 'the', 'algorithm', 'is', 'applied', 'to', 'two', 'gamebased', 'hyperparameter', 'optimisation', 'problems', 'the', 'ntuple', 'system', 'directly', 'models', 'the', 'statistics', 'approximating', 'the', 'fitness', 'and', 'number', 'of', 'evaluations', 'of', 'each', 'modelled', 'combination', 'of', 'parameters', 'the', 'model', 'is', 'simple', 'efficient', 'and', 'informative', 'results', 'show', 'that', 'the', 'ntbea', 'significantly', 'outperforms', 'grid', 'search', 'and', 'an', 'estimation', 'of', 'distribution', 'algorithm']] | [-0.05574447371173834, -0.013514567405546189, -0.09522566066818758, 0.0992504427419372, -0.10341601991291408, -0.20563440885342343, 0.0308565915460554, 0.4224159323518545, -0.3202630737140565, -0.3773989782891643, 0.10059734290255837, -0.1947663622108144, -0.23631774467862093, 0.19941246281066438, -0.10923106311886034, 0.11976900880395526, 0.13965715482358781, -0.021635249785055786, -0.0343153546087757, -0.2894371260797054, 0.253060984255927, 0.045511366792915155, 0.27560984582023723, -0.06728484773759166, 0.160155029534559, 0.0259564958748893, -0.05930342662154736, 0.0453308739125135, -0.11819458127558366, 0.1461022635397147, 0.26561387343247933, 0.26549155153268555, 0.35787151110502824, -0.3611504541526378, -0.1528224714239885, 0.17614353578013014, 0.1637085508555174, 0.08819817905117508, -0.03411051524724339, -0.24120675620268767, 0.01727740037005762, -0.14110665096127442, -0.023610726877732177, -0.09329196865814672, -0.05284109021681295, 0.02971874604257427, -0.392071265635461, 0.01998181075749683, 0.01867993314616041, 0.01900113522219406, -0.06987213722182582, -0.19339260589298596, 0.05431291215698904, 0.08949262822624034, -0.0017034766562676557, 0.02980557968840003, 0.15832874430737026, -0.11650874027260907, -0.2246238591123215, 0.3433934973788933, 0.013943735388776576, -0.2529490213828083, 0.15820951097395639, 0.0006980763774522593, -0.1724631347575448, 0.15343800191046067, 0.21290581674695436, 0.17598617526794402, -0.15754725157060254, 0.07584497164344599, -0.07214165476321334, 0.16916285859237254, -0.03647663710560178, -0.05899532595124673, 0.09635251488956348, 0.23567268498976465, 0.13913248699735586, 0.14809510837518938, -0.04079570225931861, -0.1590510206952901, -0.22410999162411185, -0.08747106013839251, -0.2538578740098107, -0.0627439352093448, -0.1657991402144675, -0.21339567465064915, 0.4096766852996719, 0.21015512227067645, 0.17172016287353678, 0.13585459421270749, 0.3633081295960386, 0.12906286713313048, -0.028912708897825698, 0.10287668186069375, 0.1029590297077166, 0.06963653603083336, 0.0964542151179532, -0.2500430459130398, 0.11377726897964595, 0.11334158919266307] |
1,802.05992 | Improved GQ-CNN: Deep Learning Model for Planning Robust Grasps | Recent developments in the field of robot grasping have shown great
improvements in the grasp success rates when dealing with unknown objects. In
this work we improve on one of the most promising approaches, the Grasp Quality
Convolutional Neural Network (GQ-CNN) trained on the DexNet 2.0 dataset. We
propose a new architecture for the GQ-CNN and describe practical improvements
that increase the model validation accuracy from 92.2% to 95.8% and from 85.9%
to 88.0% on respectively image-wise and object-wise training and validation
splits.
| cs.LG cs.AI cs.RO stat.ML | recent developments in the field of robot grasping have shown great improvements in the grasp success rates when dealing with unknown objects in this work we improve on one of the most promising approaches the grasp quality convolutional neural network gqcnn trained on the dexnet 20 dataset we propose a new architecture for the gqcnn and describe practical improvements that increase the model validation accuracy from 922 to 958 and from 859 to 880 on respectively imagewise and objectwise training and validation splits | [['recent', 'developments', 'in', 'the', 'field', 'of', 'robot', 'grasping', 'have', 'shown', 'great', 'improvements', 'in', 'the', 'grasp', 'success', 'rates', 'when', 'dealing', 'with', 'unknown', 'objects', 'in', 'this', 'work', 'we', 'improve', 'on', 'one', 'of', 'the', 'most', 'promising', 'approaches', 'the', 'grasp', 'quality', 'convolutional', 'neural', 'network', 'gqcnn', 'trained', 'on', 'the', 'dexnet', '20', 'dataset', 'we', 'propose', 'a', 'new', 'architecture', 'for', 'the', 'gqcnn', 'and', 'describe', 'practical', 'improvements', 'that', 'increase', 'the', 'model', 'validation', 'accuracy', 'from', '922', 'to', '958', 'and', 'from', '859', 'to', '880', 'on', 'respectively', 'imagewise', 'and', 'objectwise', 'training', 'and', 'validation', 'splits']] | [-0.012184096776237935, -0.049939292808433615, -0.018507738092757135, -0.000618455784973206, -0.06234201333339674, -0.1646153813688062, 0.04556888364345194, 0.45352891976215753, -0.16338716545114182, -0.3820702729814024, 0.0735977821719008, -0.2700255044556436, -0.16682538960173907, 0.23926633317865073, -0.1774511710370341, 0.09146443901566721, 0.1645413713770952, 0.02509605188023703, -0.0689508390966354, -0.3434882322214095, 0.25372407216219656, 0.06258167654236621, 0.34165896183575495, 0.04945375083059252, 0.16319219799465443, -0.040701044257730246, 0.0013594004291906413, -0.03412667703562337, -0.08912198908996266, 0.19218405373310335, 0.26843193633459417, 0.16709580430087734, 0.3023128319217498, -0.3809828358893114, -0.1936922469905701, 0.04284056326856904, 0.11829032162092178, 0.09785559486193829, -0.026415224159024208, -0.362489097081237, 0.11253608113536274, -0.19773702208985047, -0.0013639891003987875, -0.11728298315127571, 0.011835915380135089, -0.01932986259056502, -0.25020725686237755, 0.000659504484564784, 0.037307578834693836, 0.08799276532358434, -0.06893648270865431, -0.17091835795127483, 0.044731009266260696, 0.16014881720324609, 0.007667495071023972, 0.1415066242060927, 0.11735869413353951, -0.20697720642538225, -0.14888925253868057, 0.3405802734981639, -0.06893182528508177, -0.15569428919466682, 0.2053842999893858, -0.05402446702313441, -0.17549420103251215, 0.12319426300812018, 0.26564498516697305, 0.09632333678877857, -0.12688425910909498, -0.014608028299926993, -0.0007489454478070319, 0.16968973455052958, 0.05338139297631401, -0.02254463029262352, 0.15812083534161414, 0.2758295915050275, -0.004379489344084658, 0.12040014045470092, -0.16474126199967262, -0.05833674868546337, -0.2128292726442577, -0.1032097581605685, -0.14284033022809728, -0.01928075563011085, -0.09010743300349126, -0.0730543011243326, 0.40622558423418953, 0.27926789502422494, 0.23052651756611395, 0.10023413242839546, 0.32032175908560856, -0.026473993951656734, 0.11901176319715667, 0.08848127569015844, 0.2657205529668065, 0.025527974747749697, 0.11058944373683308, -0.15707912494664092, 0.05609341152994164, -0.003202146463410323] |
1,802.05993 | Kinetic Theory for Finance Brownian Motion from Microscopic Dynamics | Recent technological development has enabled researchers to study social
phenomena scientifically in detail and financial markets has particularly
attracted physicists since the Brownian motion has played the key role as in
physics. In our previous report (arXiv:1703.06739; to appear in Phys. Rev.
Lett.), we have presented a microscopic model of trend-following high-frequency
traders (HFTs) and its theoretical relation to the dynamics of financial
Brownian motion, directly supported by a data analysis of tracking trajectories
of individual HFTs in a financial market. Here we show the mathematical
foundation for the HFT model paralleling to the traditional kinetic theory in
statistical physics. We first derive the time-evolution equation for the
phase-space distribution for the HFT model exactly, which corresponds to the
Liouville equation in conventional analytical mechanics. By a systematic
reduction of the Liouville equation for the HFT model, the
Bogoliubov-Born-Green-Kirkwood-Yvon hierarchal equations are derived for
financial Brownian motion. We then derive the Boltzmann-like and Langevin-like
equations for the order-book and the price dynamics by making the assumption of
molecular chaos. The qualitative behavior of the model is asymptotically
studied by solving the Boltzmann-like and Langevin-like equations for the large
number of HFTs, which is numerically validated through the Monte-Carlo
simulation. Our kinetic description highlights the parallel mathematical
structure between the financial Brownian motion and the physical Brownian
motion.
| q-fin.TR cond-mat.stat-mech | recent technological development has enabled researchers to study social phenomena scientifically in detail and financial markets has particularly attracted physicists since the brownian motion has played the key role as in physics in our previous report arxiv170306739 to appear in phys rev lett we have presented a microscopic model of trendfollowing highfrequency traders hfts and its theoretical relation to the dynamics of financial brownian motion directly supported by a data analysis of tracking trajectories of individual hfts in a financial market here we show the mathematical foundation for the hft model paralleling to the traditional kinetic theory in statistical physics we first derive the timeevolution equation for the phasespace distribution for the hft model exactly which corresponds to the liouville equation in conventional analytical mechanics by a systematic reduction of the liouville equation for the hft model the bogoliubovborngreenkirkwoodyvon hierarchal equations are derived for financial brownian motion we then derive the boltzmannlike and langevinlike equations for the orderbook and the price dynamics by making the assumption of molecular chaos the qualitative behavior of the model is asymptotically studied by solving the boltzmannlike and langevinlike equations for the large number of hfts which is numerically validated through the montecarlo simulation our kinetic description highlights the parallel mathematical structure between the financial brownian motion and the physical brownian motion | [['recent', 'technological', 'development', 'has', 'enabled', 'researchers', 'to', 'study', 'social', 'phenomena', 'scientifically', 'in', 'detail', 'and', 'financial', 'markets', 'has', 'particularly', 'attracted', 'physicists', 'since', 'the', 'brownian', 'motion', 'has', 'played', 'the', 'key', 'role', 'as', 'in', 'physics', 'in', 'our', 'previous', 'report', 'arxiv170306739', 'to', 'appear', 'in', 'phys', 'rev', 'lett', 'we', 'have', 'presented', 'a', 'microscopic', 'model', 'of', 'trendfollowing', 'highfrequency', 'traders', 'hfts', 'and', 'its', 'theoretical', 'relation', 'to', 'the', 'dynamics', 'of', 'financial', 'brownian', 'motion', 'directly', 'supported', 'by', 'a', 'data', 'analysis', 'of', 'tracking', 'trajectories', 'of', 'individual', 'hfts', 'in', 'a', 'financial', 'market', 'here', 'we', 'show', 'the', 'mathematical', 'foundation', 'for', 'the', 'hft', 'model', 'paralleling', 'to', 'the', 'traditional', 'kinetic', 'theory', 'in', 'statistical', 'physics', 'we', 'first', 'derive', 'the', 'timeevolution', 'equation', 'for', 'the', 'phasespace', 'distribution', 'for', 'the', 'hft', 'model', 'exactly', 'which', 'corresponds', 'to', 'the', 'liouville', 'equation', 'in', 'conventional', 'analytical', 'mechanics', 'by', 'a', 'systematic', 'reduction', 'of', 'the', 'liouville', 'equation', 'for', 'the', 'hft', 'model', 'the', 'bogoliubovborngreenkirkwoodyvon', 'hierarchal', 'equations', 'are', 'derived', 'for', 'financial', 'brownian', 'motion', 'we', 'then', 'derive', 'the', 'boltzmannlike', 'and', 'langevinlike', 'equations', 'for', 'the', 'orderbook', 'and', 'the', 'price', 'dynamics', 'by', 'making', 'the', 'assumption', 'of', 'molecular', 'chaos', 'the', 'qualitative', 'behavior', 'of', 'the', 'model', 'is', 'asymptotically', 'studied', 'by', 'solving', 'the', 'boltzmannlike', 'and', 'langevinlike', 'equations', 'for', 'the', 'large', 'number', 'of', 'hfts', 'which', 'is', 'numerically', 'validated', 'through', 'the', 'montecarlo', 'simulation', 'our', 'kinetic', 'description', 'highlights', 'the', 'parallel', 'mathematical', 'structure', 'between', 'the', 'financial', 'brownian', 'motion', 'and', 'the', 'physical', 'brownian', 'motion']] | [-0.08111265666903583, 0.07943526360732331, -0.1370760915330417, 0.05956215421880457, -0.08545698750229483, -0.08064344688534254, 0.025453665169253428, 0.3160340912053706, -0.2606670050709336, -0.3017027349754547, 0.05989076829044077, -0.2835613156332531, -0.19019804109983077, 0.19894525153385648, -0.05688644077734487, 0.0824043036595362, 0.04120764437377349, -0.01562522167848699, 0.034820666055936644, -0.19384873725573049, 0.2198567568169286, 0.06720017182157824, 0.28926998279186794, 0.010220055221536852, 0.14950129549025507, 0.005380297668226477, -0.05832054687144356, 0.017007744273912436, -0.18370031663734052, 0.12194728228173012, 0.22867499042681796, 0.05727695028245863, 0.33359878507326357, -0.4806421911171465, -0.24023993953812384, 0.05262399019449259, 0.10164117026013425, 0.10509007854313866, -0.025977440250614933, -0.3245163796538556, -0.008771462564322131, -0.1895454129165349, -0.17119215251295827, -0.1098994476649548, 0.0760586959818115, 0.025895936114398797, -0.22975217600496425, 0.13615643124945495, 0.043072295039935315, 0.06401754629418806, -0.050523749242765245, -0.08107285499055353, -0.02175789627600116, 0.11324566805409698, 0.07474963927557433, -0.049098503732777854, 0.1267732676308326, -0.1490324175554431, -0.1585190688859223, 0.39674987138951784, -0.04377617241240201, -0.2442534636906607, 0.16284608412145948, -0.15854735288734514, -0.1446269130942205, 0.10642947800267764, 0.1578257313489707, 0.061807373948222784, -0.23501028384850575, 0.1061713331518048, -0.04373286284573152, 0.10834714037223926, 0.024759763918592834, -0.02356572220472757, 0.18056609128069356, 0.22405281707782437, 0.001916281521078889, 0.1106325099589648, -0.055744171988745046, -0.2599583093111438, -0.2980276011534173, -0.1426046309902126, -0.16329280870613055, 0.07926899281112666, -0.078336986178598, -0.1582933779519172, 0.3716563138058754, 0.18782133263906603, 0.12824287595598166, 0.0438367959674603, 0.2546040815844511, 0.15727338956990192, -0.04901806548446917, 0.08101914169647326, 0.2420809251257365, 0.13107540132693463, 0.17537058505937844, -0.22747476819495205, 0.073843946923228, 0.08420349918392107] |
1,802.05994 | Dimension dependence of factorization problems: bi-parameter Hardy
spaces | Given $1 \leq p,q < \infty$ and $n\in\mathbb{N}_0$, let $H_n^p(H_n^q)$ denote
the canonical finite-dimensional bi-parameter dyadic Hardy space. Let $(V_n :
n\in\mathbb{N}_0)$ denote either $\bigl(H_n^p(H_n^q) : n\in\mathbb{N}_0\bigr)$
or $\bigl( (H_n^p(H_n^q))^* : n\in\mathbb{N}_0\bigr)$. We show that the
identity operator on $V_n$ factors through any operator $T : V_N\to V_N$ which
has large diagonal with respect to the Haar system, where $N$ depends
\emph{linearly} on $n$.
| math.FA | given 1 leq pq infty and ninmathbbn_0 let h_nph_nq denote the canonical finitedimensional biparameter dyadic hardy space let v_n ninmathbbn_0 denote either biglh_nph_nq ninmathbbn_0bigr or bigl h_nph_nq ninmathbbn_0bigr we show that the identity operator on v_n factors through any operator t v_nto v_n which has large diagonal with respect to the haar system where n depends emphlinearly on n | [['given', '1', 'leq', 'pq', 'infty', 'and', 'ninmathbbn_0', 'let', 'h_nph_nq', 'denote', 'the', 'canonical', 'finitedimensional', 'biparameter', 'dyadic', 'hardy', 'space', 'let', 'v_n', 'ninmathbbn_0', 'denote', 'either', 'biglh_nph_nq', 'ninmathbbn_0bigr', 'or', 'bigl', 'h_nph_nq', 'ninmathbbn_0bigr', 'we', 'show', 'that', 'the', 'identity', 'operator', 'on', 'v_n', 'factors', 'through', 'any', 'operator', 't', 'v_nto', 'v_n', 'which', 'has', 'large', 'diagonal', 'with', 'respect', 'to', 'the', 'haar', 'system', 'where', 'n', 'depends', 'emphlinearly', 'on', 'n']] | [-0.1749898056622665, 0.23678994423024496, -0.05055472402358955, -0.05620625214475506, -0.03662609627013499, -0.1951358887314234, -0.06051958918149741, 0.2947185684065774, -0.3330362687976855, -0.10687214213111526, 0.02882896429630664, -0.40705385640755576, -0.0598139400101917, 0.11667265879640461, -0.07260366846842445, -0.04117820960170818, 0.015057875660581971, 0.16781674463846633, -0.1035349780368566, -0.21823155052327323, 0.36734438954659226, -0.09734132692639558, 0.1375598120415267, -0.0024460528731205552, 0.1240669847378191, 0.07352069923039174, 0.036222634960036235, -0.0574085162870173, -0.19777666742736055, 0.022117580023576628, 0.2255012764296723, 0.10545381901671512, 0.3022527129582639, -0.35696647544655036, -0.058255658291702, 0.36248205278841955, 0.2599524629592263, -0.2250620564379958, 0.09563741687562247, -0.31012569287932423, 0.1628688788082657, -0.11731878306084084, -0.11697709773016988, -0.0997575305419851, 0.11735261275591154, 0.0318960950376009, -0.4449590230184906, 0.00972966361298876, 0.09519214337726808, 0.0757898742262766, -0.029696586227729777, -0.23774880995613717, -0.08660027265267552, 0.06025314069669342, -0.04369144690802918, 0.1705776808502258, 0.0651961483395184, 0.03268290360300046, -0.09625500348343882, 0.3518963583024605, -0.10508068778798124, -0.28247037828671484, 0.009846740569216464, -0.30489638447761536, -0.10564924834542117, -0.03153827153849152, 0.1306096358172033, 0.15763735753607075, 0.049215537864925725, 0.3184180071935462, -0.1408983758246561, 0.15682140017754204, 0.07870965473845883, 0.022688186837289976, -0.008938200736664376, -0.005428778921376984, 0.13169373416359414, 0.08654037093357095, 0.03847106829102213, 0.03360224922872939, -0.3511423504436916, -0.13885715010769242, -0.26968810313715125, 0.23442110138119393, -0.24236689494754723, -0.15693287403797204, 0.2791087948980759, 0.06152854279070249, 0.26156205637600133, 0.1297103056600669, 0.17645835739402277, 0.12914517750295829, 0.03948147419207501, 0.11765681186093474, -0.05387318506836891, 0.17317936481591664, -0.022824724283912835, -0.19913816712093804, 0.024534416692507156, 0.27106205537862516] |
1,802.05995 | Optimizing generalized kernels of polygons | Let $\mathcal{O}$ be a set of $k$ orientations in the plane, and let $P$ be a
simple polygon in the plane. Given two points $p,q$ inside $P$, we say that $p$
$\mathcal{O}$-\emph{sees} $q$ if there is an $\mathcal{O}$-\emph{staircase}
contained in $P$ that connects $p$ and~$q$. The \emph{$\mathcal{O}$-Kernel} of
the polygon $P$, denoted by $\mathcal{O}$-$\rm kernel(P)$, is the subset of
points of $P$ which $\mathcal{O}$-see all the other points in $P$. This work
initiates the study of the computation and maintenance of $\mathcal{O}$-$\rm
kernel(P)$ as we rotate the set $\mathcal{O}$ by an angle $\theta$, denoted by
$\mathcal{O}$-$\rm kernel_{\theta}(P)$. In particular, we consider the case
when the set $\mathcal{O}$ is formed by either one or two orthogonal
orientations, $\mathcal{O}=\{0^\circ\}$ or $\mathcal{O}=\{0^\circ,90^\circ\}$.
For these cases and $P$ being a simple polygon, we design efficient algorithms
for computing the $\mathcal{O}$-$\rm kernel_{\theta}(P)$ while $\theta$ varies
in $[-\frac{\pi}{2},\frac{\pi}{2})$, obtaining: (i)~the intervals of
angle~$\theta$ where $\mathcal{O}$-$\rm kernel_{\theta}(P)$ is not empty,
(ii)~a value of angle~$\theta$ where $\mathcal{O}$-$\rm kernel_{\theta}(P)$
optimizes area or perimeter. Further, we show how the algorithms can be
improved when $P$ is a simple orthogonal polygon. In addition, our results are
extended to the case of a set $\mathcal{O}=\{\alpha_1,\dots,\alpha_k\}$.
| cs.CG | let mathcalo be a set of k orientations in the plane and let p be a simple polygon in the plane given two points pq inside p we say that p mathcaloemphsees q if there is an mathcaloemphstaircase contained in p that connects p andq the emphmathcalokernel of the polygon p denoted by mathcalorm kernelp is the subset of points of p which mathcalosee all the other points in p this work initiates the study of the computation and maintenance of mathcalorm kernelp as we rotate the set mathcalo by an angle theta denoted by mathcalorm kernel_thetap in particular we consider the case when the set mathcalo is formed by either one or two orthogonal orientations mathcalo0circ or mathcalo0circ90circ for these cases and p being a simple polygon we design efficient algorithms for computing the mathcalorm kernel_thetap while theta varies in fracpi2fracpi2 obtaining ithe intervals of angletheta where mathcalorm kernel_thetap is not empty iia value of angletheta where mathcalorm kernel_thetap optimizes area or perimeter further we show how the algorithms can be improved when p is a simple orthogonal polygon in addition our results are extended to the case of a set mathcaloalpha_1dotsalpha_k | [['let', 'mathcalo', 'be', 'a', 'set', 'of', 'k', 'orientations', 'in', 'the', 'plane', 'and', 'let', 'p', 'be', 'a', 'simple', 'polygon', 'in', 'the', 'plane', 'given', 'two', 'points', 'pq', 'inside', 'p', 'we', 'say', 'that', 'p', 'mathcaloemphsees', 'q', 'if', 'there', 'is', 'an', 'mathcaloemphstaircase', 'contained', 'in', 'p', 'that', 'connects', 'p', 'andq', 'the', 'emphmathcalokernel', 'of', 'the', 'polygon', 'p', 'denoted', 'by', 'mathcalorm', 'kernelp', 'is', 'the', 'subset', 'of', 'points', 'of', 'p', 'which', 'mathcalosee', 'all', 'the', 'other', 'points', 'in', 'p', 'this', 'work', 'initiates', 'the', 'study', 'of', 'the', 'computation', 'and', 'maintenance', 'of', 'mathcalorm', 'kernelp', 'as', 'we', 'rotate', 'the', 'set', 'mathcalo', 'by', 'an', 'angle', 'theta', 'denoted', 'by', 'mathcalorm', 'kernel_thetap', 'in', 'particular', 'we', 'consider', 'the', 'case', 'when', 'the', 'set', 'mathcalo', 'is', 'formed', 'by', 'either', 'one', 'or', 'two', 'orthogonal', 'orientations', 'mathcalo0circ', 'or', 'mathcalo0circ90circ', 'for', 'these', 'cases', 'and', 'p', 'being', 'a', 'simple', 'polygon', 'we', 'design', 'efficient', 'algorithms', 'for', 'computing', 'the', 'mathcalorm', 'kernel_thetap', 'while', 'theta', 'varies', 'in', 'fracpi2fracpi2', 'obtaining', 'ithe', 'intervals', 'of', 'angletheta', 'where', 'mathcalorm', 'kernel_thetap', 'is', 'not', 'empty', 'iia', 'value', 'of', 'angletheta', 'where', 'mathcalorm', 'kernel_thetap', 'optimizes', 'area', 'or', 'perimeter', 'further', 'we', 'show', 'how', 'the', 'algorithms', 'can', 'be', 'improved', 'when', 'p', 'is', 'a', 'simple', 'orthogonal', 'polygon', 'in', 'addition', 'our', 'results', 'are', 'extended', 'to', 'the', 'case', 'of', 'a', 'set', 'mathcaloalpha_1dotsalpha_k']] | [-0.1925124503672123, 0.12740171005344664, -0.054450741844872634, -0.016539322370145885, -0.05365256183108108, -0.15353474764722502, 0.07183357461407366, 0.3403235378778643, -0.2888896148237917, -0.2440923730750607, 0.05972522635905383, -0.27240944107373555, -0.10618949118329005, 0.17846789289291742, -0.07814114763023099, -0.017951509216800332, 0.01989203735979067, 0.09465280934236944, -0.04518980866091119, -0.2598922254427129, 0.2932372446307757, -0.048827811377123, 0.1927349807228893, 0.0017744377229569686, 0.040335115410077074, 0.04873304639477283, 0.05681808579473808, 0.04772236546340436, -0.14829998153250523, 0.10188053647289053, 0.25486236068213153, 0.13797766053014332, 0.25208952142080915, -0.3764253672729764, -0.10475396735386716, 0.1968817888500376, 0.16839269733625567, 0.004162114134912068, 0.015527946645549188, -0.19835921180072344, 0.15661637120647356, -0.1006493040593341, -0.15096867568790912, -0.0038432932316532567, 0.09867111138947722, 0.007107375718381566, -0.3258089971702753, -0.01079276483279601, 0.08218038212507964, 0.06678296981845051, -0.011068023185038732, -0.1438656949541635, -0.017556110739759687, 0.05790996424265257, -0.0014065227089708463, 0.12150689548450626, 0.0744319381347547, -0.08010794737039961, -0.10586298925595151, 0.41348368790414597, 0.0056863070310403906, -0.23270486829698914, 0.09911378934048116, -0.18078261897899212, -0.09799360771301306, 0.11986514723135365, 0.13629870999720878, 0.17788735220933127, -0.04546399851048288, 0.1771159459206198, -0.0976871492444641, 0.09903900719105473, 0.10713536423346441, -0.05976508330398549, 0.18334748745562846, 0.10220189083419326, 0.10252637786519093, 0.15237607069332929, -0.07564993685680545, -0.01750467491413777, -0.3447503523590664, -0.12440531166826582, -0.18397991060628555, 0.0479251830076262, -0.09584609236699179, -0.13742460291832687, 0.34582372680306434, 0.06694564032627062, 0.25700006731785835, 0.047165582340029585, 0.25146614401342554, 0.09563441740497688, 0.02319845679578268, 0.12495404664530523, 0.13414508403641068, 0.0557928202363352, -0.024544398236968037, -0.18820586641474316, 0.032526445587993495, 0.08693892927840352] |
1,802.05996 | Dephasing mechanisms of diamond-based nuclear-spin memories for quantum
networks | We probe dephasing mechanisms within a quantum network node consisting of a
single nitrogen-vacancy centre electron spin that is hyperfine coupled to
surrounding $^{13} \text{C}$ nuclear-spin quantum memories. Previous studies
have analysed memory dephasing caused by the stochastic electron-spin reset
process, which is a component of optical internode entangling protocols. Here,
we find, by using dynamical decoupling techniques and exploiting phase matching
conditions in the electron-nuclear dynamics, that control infidelities and
quasi-static noise are the major contributors to memory dephasing induced by
the entangling sequence. These insights enable us to demonstrate a 19-fold
improved memory performance which is still not limited by the electron
reinitialization process. We further perform pump-probe studies to investigate
the spin-flip channels during the optical electron spin reset. We find that
spin-flips occur via decay from the meta-stable singlet states with a branching
ratio of 8(1):1:1, in contrast with previous work. These results allow us to
formulate straightforward improvements to diamond-based quantum networks and
similar architectures.
| quant-ph | we probe dephasing mechanisms within a quantum network node consisting of a single nitrogenvacancy centre electron spin that is hyperfine coupled to surrounding 13 textc nuclearspin quantum memories previous studies have analysed memory dephasing caused by the stochastic electronspin reset process which is a component of optical internode entangling protocols here we find by using dynamical decoupling techniques and exploiting phase matching conditions in the electronnuclear dynamics that control infidelities and quasistatic noise are the major contributors to memory dephasing induced by the entangling sequence these insights enable us to demonstrate a 19fold improved memory performance which is still not limited by the electron reinitialization process we further perform pumpprobe studies to investigate the spinflip channels during the optical electron spin reset we find that spinflips occur via decay from the metastable singlet states with a branching ratio of 8111 in contrast with previous work these results allow us to formulate straightforward improvements to diamondbased quantum networks and similar architectures | [['we', 'probe', 'dephasing', 'mechanisms', 'within', 'a', 'quantum', 'network', 'node', 'consisting', 'of', 'a', 'single', 'nitrogenvacancy', 'centre', 'electron', 'spin', 'that', 'is', 'hyperfine', 'coupled', 'to', 'surrounding', '13', 'textc', 'nuclearspin', 'quantum', 'memories', 'previous', 'studies', 'have', 'analysed', 'memory', 'dephasing', 'caused', 'by', 'the', 'stochastic', 'electronspin', 'reset', 'process', 'which', 'is', 'a', 'component', 'of', 'optical', 'internode', 'entangling', 'protocols', 'here', 'we', 'find', 'by', 'using', 'dynamical', 'decoupling', 'techniques', 'and', 'exploiting', 'phase', 'matching', 'conditions', 'in', 'the', 'electronnuclear', 'dynamics', 'that', 'control', 'infidelities', 'and', 'quasistatic', 'noise', 'are', 'the', 'major', 'contributors', 'to', 'memory', 'dephasing', 'induced', 'by', 'the', 'entangling', 'sequence', 'these', 'insights', 'enable', 'us', 'to', 'demonstrate', 'a', '19fold', 'improved', 'memory', 'performance', 'which', 'is', 'still', 'not', 'limited', 'by', 'the', 'electron', 'reinitialization', 'process', 'we', 'further', 'perform', 'pumpprobe', 'studies', 'to', 'investigate', 'the', 'spinflip', 'channels', 'during', 'the', 'optical', 'electron', 'spin', 'reset', 'we', 'find', 'that', 'spinflips', 'occur', 'via', 'decay', 'from', 'the', 'metastable', 'singlet', 'states', 'with', 'a', 'branching', 'ratio', 'of', '8111', 'in', 'contrast', 'with', 'previous', 'work', 'these', 'results', 'allow', 'us', 'to', 'formulate', 'straightforward', 'improvements', 'to', 'diamondbased', 'quantum', 'networks', 'and', 'similar', 'architectures']] | [-0.13809574618035014, 0.19065334703978268, -0.035331193647646114, 0.02506082225016647, -0.0007779019512821856, -0.20034739931491818, 0.09870256786454329, 0.4276310217701508, -0.2556017129389136, -0.2851518527751074, 0.03314320245207106, -0.24204266799098384, -0.11300245037817824, 0.19663704095888626, -0.026498836490073764, 0.07778880946446538, 0.08158177871303926, -0.04257259061765043, -0.04848726847466761, -0.2222744299438577, 0.26061984374767766, 0.0642899932601905, 0.29972714731329175, 0.049885179859193614, 0.09146974622433032, 0.01663743020123187, 0.023198633921865677, -0.058581239913601965, -0.1074964740458102, 0.0706435918460934, 0.2472016425999526, 0.03611736254746083, 0.24087852994624362, -0.5046935901162947, -0.22256052221974018, 0.08020741911605, 0.1472007611840773, 0.2005800187936252, -0.04863445780609014, -0.30631926464233195, 0.03541899395743443, -0.1747222456329871, -0.06408852882062395, -0.11630689733773002, -0.02906329666246783, -0.014341085888562526, -0.27399413972659586, 0.07079120829068827, 0.07573796672151284, 0.0076041537389721515, -0.01760266730034689, -0.02695851803189085, 0.032649854395418496, 0.1185066223940036, -0.024089005426137632, 0.034741935879577815, 0.23182771151077072, -0.07937470185072543, -0.21276323394937757, 0.2915110986375209, -0.07166029139547814, -0.1478645184953, 0.18430381895221606, -0.1323568990817235, -0.11231438228684776, 0.14011409466078728, 0.15226434781208764, 0.08896533392791478, -0.20015064743493902, 0.02926367542262734, 0.037687441424917686, 0.2003846445542602, 0.051020134274068776, 0.16182644638590188, 0.2011562447128056, 0.19203098106590458, 0.04906122118041341, 0.16054407773545282, -0.12543362314642975, -0.13910799385370604, -0.20178129307562545, -0.11078635008226635, -0.1648085133294112, 0.1314709574972029, -0.04221948084200706, -0.08616641572231439, 0.39274614768793936, 0.17449568159096293, 0.17415528318518186, 0.0020449870184017054, 0.3248722669697783, 0.09848893948965384, 0.10333671626406458, 0.06609318418715313, 0.24850376109345876, 0.17826623315542187, 0.09059400293015459, -0.35205270519330745, 0.059753955048274646, -0.022304728739227186] |
1,802.05997 | The BCS-BEC crossover: From ultra-cold Fermi gases to nuclear systems | This report adresses topics and questions of common interest in the fields of
ultra-cold gases and nuclear physics in the context of the BCS-BEC crossover.
The BCS-BEC crossover has recently been realized experimentally, and
essentially in all of its aspects, with ultra-cold Fermi gases. This
realization, in turn, has raised the interest of the nuclear physics community
in the crossover problem, since it represents an unprecedented tool to test
fundamental and unanswered questions of nuclear many-body theory. Here, we
focus on the several aspects of the BCS-BEC crossover, which are of broad joint
interest to both ultra-cold Fermi gases and nuclear matter, and which will
likely help to solve in the future some open problems in nuclear physics
(concerning, for instance, neutron stars). Similarities and differences
occurring in ultra-cold Fermi gases and nuclear matter will then be emphasized,
not only about the relative phenomenologies but also about the theoretical
approaches to be used in the two contexts. After an introduction to present the
key concepts of the BCS-BEC crossover, this report discusses the mean-field
treatment of the superfluid phase, both for homogeneous and inhomogeneous
systems, as well as for symmetric (spin- or isospin-balanced) and asymmetric
(spin- or isospin-imbalanced) matter. Pairing fluctuations in the normal phase
are then considered, with their manifestations in thermodynamic and dynamic
quantities. The last two Sections provide a more specialized discussion of the
BCS-BEC crossover in ultra-cold Fermi gases and nuclear matter, respectively.
The separate discussion in the two contexts aims at cross communicating to both
communities topics and aspects which, albeit arising in one of the two fields,
share a strong common interest.
| cond-mat.quant-gas cond-mat.str-el cond-mat.supr-con nucl-th | this report adresses topics and questions of common interest in the fields of ultracold gases and nuclear physics in the context of the bcsbec crossover the bcsbec crossover has recently been realized experimentally and essentially in all of its aspects with ultracold fermi gases this realization in turn has raised the interest of the nuclear physics community in the crossover problem since it represents an unprecedented tool to test fundamental and unanswered questions of nuclear manybody theory here we focus on the several aspects of the bcsbec crossover which are of broad joint interest to both ultracold fermi gases and nuclear matter and which will likely help to solve in the future some open problems in nuclear physics concerning for instance neutron stars similarities and differences occurring in ultracold fermi gases and nuclear matter will then be emphasized not only about the relative phenomenologies but also about the theoretical approaches to be used in the two contexts after an introduction to present the key concepts of the bcsbec crossover this report discusses the meanfield treatment of the superfluid phase both for homogeneous and inhomogeneous systems as well as for symmetric spin or isospinbalanced and asymmetric spin or isospinimbalanced matter pairing fluctuations in the normal phase are then considered with their manifestations in thermodynamic and dynamic quantities the last two sections provide a more specialized discussion of the bcsbec crossover in ultracold fermi gases and nuclear matter respectively the separate discussion in the two contexts aims at cross communicating to both communities topics and aspects which albeit arising in one of the two fields share a strong common interest | [['this', 'report', 'adresses', 'topics', 'and', 'questions', 'of', 'common', 'interest', 'in', 'the', 'fields', 'of', 'ultracold', 'gases', 'and', 'nuclear', 'physics', 'in', 'the', 'context', 'of', 'the', 'bcsbec', 'crossover', 'the', 'bcsbec', 'crossover', 'has', 'recently', 'been', 'realized', 'experimentally', 'and', 'essentially', 'in', 'all', 'of', 'its', 'aspects', 'with', 'ultracold', 'fermi', 'gases', 'this', 'realization', 'in', 'turn', 'has', 'raised', 'the', 'interest', 'of', 'the', 'nuclear', 'physics', 'community', 'in', 'the', 'crossover', 'problem', 'since', 'it', 'represents', 'an', 'unprecedented', 'tool', 'to', 'test', 'fundamental', 'and', 'unanswered', 'questions', 'of', 'nuclear', 'manybody', 'theory', 'here', 'we', 'focus', 'on', 'the', 'several', 'aspects', 'of', 'the', 'bcsbec', 'crossover', 'which', 'are', 'of', 'broad', 'joint', 'interest', 'to', 'both', 'ultracold', 'fermi', 'gases', 'and', 'nuclear', 'matter', 'and', 'which', 'will', 'likely', 'help', 'to', 'solve', 'in', 'the', 'future', 'some', 'open', 'problems', 'in', 'nuclear', 'physics', 'concerning', 'for', 'instance', 'neutron', 'stars', 'similarities', 'and', 'differences', 'occurring', 'in', 'ultracold', 'fermi', 'gases', 'and', 'nuclear', 'matter', 'will', 'then', 'be', 'emphasized', 'not', 'only', 'about', 'the', 'relative', 'phenomenologies', 'but', 'also', 'about', 'the', 'theoretical', 'approaches', 'to', 'be', 'used', 'in', 'the', 'two', 'contexts', 'after', 'an', 'introduction', 'to', 'present', 'the', 'key', 'concepts', 'of', 'the', 'bcsbec', 'crossover', 'this', 'report', 'discusses', 'the', 'meanfield', 'treatment', 'of', 'the', 'superfluid', 'phase', 'both', 'for', 'homogeneous', 'and', 'inhomogeneous', 'systems', 'as', 'well', 'as', 'for', 'symmetric', 'spin', 'or', 'isospinbalanced', 'and', 'asymmetric', 'spin', 'or', 'isospinimbalanced', 'matter', 'pairing', 'fluctuations', 'in', 'the', 'normal', 'phase', 'are', 'then', 'considered', 'with', 'their', 'manifestations', 'in', 'thermodynamic', 'and', 'dynamic', 'quantities', 'the', 'last', 'two', 'sections', 'provide', 'a', 'more', 'specialized', 'discussion', 'of', 'the', 'bcsbec', 'crossover', 'in', 'ultracold', 'fermi', 'gases', 'and', 'nuclear', 'matter', 'respectively', 'the', 'separate', 'discussion', 'in', 'the', 'two', 'contexts', 'aims', 'at', 'cross', 'communicating', 'to', 'both', 'communities', 'topics', 'and', 'aspects', 'which', 'albeit', 'arising', 'in', 'one', 'of', 'the', 'two', 'fields', 'share', 'a', 'strong', 'common', 'interest']] | [-0.09242017890888624, 0.19792355857958013, -0.08358115930796454, 0.09918818729833342, -0.030112863243452477, -0.14697411774605804, 0.037802124036654575, 0.3265800504364017, -0.2608148534397097, -0.273125188115326, 0.062472726847745366, -0.2882005660908465, -0.09884561516285027, 0.2083302075375936, 0.0034500127413163058, 0.044745695855795874, -0.00641513249094605, 0.029129948886395852, -0.10739206091485064, -0.26205108991493226, 0.36680271579092716, 0.03715149455710797, 0.2614604527318038, 0.1410013645260658, 0.04719770870029688, -0.019711255397003396, -0.01277923885088666, -0.015033075808288348, -0.1410930021586119, 0.10412609948263735, 0.3619496022540152, 0.05223947514419241, 0.2605475751059517, -0.44082890144248205, -0.23779837357202419, 0.09530069512364112, 0.14460221997679287, 0.14642590318878243, -0.07703758165341167, -0.30913876484085184, -0.06911337881894342, -0.19714966746216947, -0.1323378992449016, -0.10365747254432872, 0.02833666487708968, 0.01749971673011612, -0.16213217108463168, 0.06750497504789994, 0.06672573201520797, 0.07409820713705026, -0.06422717876032545, -0.131321068027729, 0.08960710259424032, 0.11131780122973978, 0.06195541122172, 0.019918180930365185, 0.143487753509697, -0.21156644320931228, -0.10102437466691087, 0.4369233092363167, -0.031528394301667026, -0.11006097473454472, 0.245904573937878, -0.19212108845577427, -0.14561813648727098, 0.08932160141114566, 0.17153635680241355, 0.06535949491802953, -0.1676158456313879, 0.07880842202247638, -0.055883625273669794, 0.11869445296671395, 0.019945957533370955, 0.07849611267027326, 0.3024166991927178, 0.19319379913027196, 0.007153030113786235, 0.09474744786433105, -0.09022521985260616, -0.1570959041416785, -0.26427122220726107, -0.1346231888212908, -0.1541927853057378, -0.020042460739971017, 0.009168895410342734, -0.13575885678760538, 0.40324674288854284, 0.1620739940387596, 0.19834857271403017, -0.09580583974703293, 0.2384167171286461, 0.04602693763904666, 0.0029554661403627214, 0.03960583186174456, 0.2546741210938041, 0.18511943660914562, 0.11732955956551477, -0.24867557199019544, 0.032715630250601306, 0.018905761548409] |
1,802.05998 | Abductive reasoning as the basis to reproduce expert criteria in ECG
Atrial Fibrillation identification | Objective: This work aims at providing a new method for the automatic
detection of atrial fibrillation, other arrhythmia and noise on short single
lead ECG signals, emphasizing the importance of the interpretability of the
classification results.
Approach: A morphological and rhythm description of the cardiac behavior is
obtained by a knowledge-based interpretation of the signal using the
\textit{Construe} abductive framework. Then, a set of meaningful features are
extracted for each individual heartbeat and as a summary of the full record.
The feature distributions were used to elucidate the expert criteria underlying
the labeling of the 2017 Physionet/CinC Challenge dataset, enabling a manual
partial relabeling to improve the consistency of the classification rules.
Finally, state-of-the-art machine learning methods are combined to provide an
answer on the basis of the feature values.
Main results: The proposal tied for the first place in the official stage of
the Challenge, with a combined $F_1$ score of 0.83, and was even improved in
the follow-up stage to 0.85 with a significant simplification of the model.
Significance: This approach demonstrates the potential of \textit{Construe}
to provide robust and valuable descriptions of temporal data even with
significant amounts of noise and artifacts. Also, we discuss the importance of
a consistent classification criteria in manually labeled training datasets, and
the fundamental advantages of knowledge-based approaches to formalize and
validate that criteria.
| cs.AI cs.CV | objective this work aims at providing a new method for the automatic detection of atrial fibrillation other arrhythmia and noise on short single lead ecg signals emphasizing the importance of the interpretability of the classification results approach a morphological and rhythm description of the cardiac behavior is obtained by a knowledgebased interpretation of the signal using the textitconstrue abductive framework then a set of meaningful features are extracted for each individual heartbeat and as a summary of the full record the feature distributions were used to elucidate the expert criteria underlying the labeling of the 2017 physionetcinc challenge dataset enabling a manual partial relabeling to improve the consistency of the classification rules finally stateoftheart machine learning methods are combined to provide an answer on the basis of the feature values main results the proposal tied for the first place in the official stage of the challenge with a combined f_1 score of 083 and was even improved in the followup stage to 085 with a significant simplification of the model significance this approach demonstrates the potential of textitconstrue to provide robust and valuable descriptions of temporal data even with significant amounts of noise and artifacts also we discuss the importance of a consistent classification criteria in manually labeled training datasets and the fundamental advantages of knowledgebased approaches to formalize and validate that criteria | [['objective', 'this', 'work', 'aims', 'at', 'providing', 'a', 'new', 'method', 'for', 'the', 'automatic', 'detection', 'of', 'atrial', 'fibrillation', 'other', 'arrhythmia', 'and', 'noise', 'on', 'short', 'single', 'lead', 'ecg', 'signals', 'emphasizing', 'the', 'importance', 'of', 'the', 'interpretability', 'of', 'the', 'classification', 'results', 'approach', 'a', 'morphological', 'and', 'rhythm', 'description', 'of', 'the', 'cardiac', 'behavior', 'is', 'obtained', 'by', 'a', 'knowledgebased', 'interpretation', 'of', 'the', 'signal', 'using', 'the', 'textitconstrue', 'abductive', 'framework', 'then', 'a', 'set', 'of', 'meaningful', 'features', 'are', 'extracted', 'for', 'each', 'individual', 'heartbeat', 'and', 'as', 'a', 'summary', 'of', 'the', 'full', 'record', 'the', 'feature', 'distributions', 'were', 'used', 'to', 'elucidate', 'the', 'expert', 'criteria', 'underlying', 'the', 'labeling', 'of', 'the', '2017', 'physionetcinc', 'challenge', 'dataset', 'enabling', 'a', 'manual', 'partial', 'relabeling', 'to', 'improve', 'the', 'consistency', 'of', 'the', 'classification', 'rules', 'finally', 'stateoftheart', 'machine', 'learning', 'methods', 'are', 'combined', 'to', 'provide', 'an', 'answer', 'on', 'the', 'basis', 'of', 'the', 'feature', 'values', 'main', 'results', 'the', 'proposal', 'tied', 'for', 'the', 'first', 'place', 'in', 'the', 'official', 'stage', 'of', 'the', 'challenge', 'with', 'a', 'combined', 'f_1', 'score', 'of', '083', 'and', 'was', 'even', 'improved', 'in', 'the', 'followup', 'stage', 'to', '085', 'with', 'a', 'significant', 'simplification', 'of', 'the', 'model', 'significance', 'this', 'approach', 'demonstrates', 'the', 'potential', 'of', 'textitconstrue', 'to', 'provide', 'robust', 'and', 'valuable', 'descriptions', 'of', 'temporal', 'data', 'even', 'with', 'significant', 'amounts', 'of', 'noise', 'and', 'artifacts', 'also', 'we', 'discuss', 'the', 'importance', 'of', 'a', 'consistent', 'classification', 'criteria', 'in', 'manually', 'labeled', 'training', 'datasets', 'and', 'the', 'fundamental', 'advantages', 'of', 'knowledgebased', 'approaches', 'to', 'formalize', 'and', 'validate', 'that', 'criteria']] | [-0.045498694785200564, -0.016046288515358418, -0.0902144169678271, 0.06852243914705074, -0.09045389315062856, -0.11602657709936548, 0.0835865629874844, 0.3735539565891095, -0.21483048124710832, -0.32969106518456975, 0.10096587880032044, -0.26488966945289083, -0.14639438338982302, 0.21640681144065008, -0.10986676928376551, 0.07659071251415232, 0.1412261705213475, 0.06841313565698794, -0.05200451757122522, -0.2582988944178557, 0.2840650865030622, 0.06641151223592966, 0.3399347315934314, 0.03988927464544503, 0.11483771665384192, -0.023940917207202053, -0.10273671023678288, -0.010748180066134224, -0.08304440778616538, 0.1723200611768046, 0.29079537487765816, 0.2042434384532239, 0.3228678531603407, -0.3800790444758143, -0.1893517835638844, 0.07069414974152367, 0.09108451501428406, 0.10894954044060261, -0.02804781623896869, -0.3415313319353665, 0.09500918214154594, -0.14820938450558221, -0.05737844445822735, -0.12381040198281744, -0.0032255711114008772, -0.003846137547376671, -0.30484251373729826, 0.0963960455874628, 0.10637342795936129, 0.10873947425416726, -0.09348894898543698, -0.12956723000493947, 0.009476059814388295, 0.18538252968231544, 0.03981498574271489, 0.0584793811394281, 0.09725116335205329, -0.182290730459565, -0.16144562010417327, 0.36938844715577984, -0.04791903033524929, -0.16617813540361315, 0.2046613825181693, -0.05732450623705781, -0.1539207745312631, 0.12151653643453081, 0.18525256215051086, 0.08578631165542754, -0.17067710525562726, -0.030473686678849195, 0.023652542504688463, 0.18514944884580523, 0.03470604247055375, -0.001974232029169798, 0.20307131697807243, 0.24856815787824502, -0.021859718719497323, 0.1309463478484174, -0.13002376040713481, -0.022626104693000134, -0.28400182613773206, -0.1348259200360963, -0.14492404107341533, -0.028351337713193637, -0.09798676539035998, -0.13952735162074614, 0.4513173035611462, 0.23018410213279003, 0.20614949133082786, 0.0637723015883634, 0.31113127217842984, 0.0408507639330067, 0.06410801116484378, -0.013801380078523206, 0.20450863232035443, 0.05155878799347991, 0.0863946607595571, -0.20798821525639807, 0.09806235159991722, 0.04248287807307227] |
1,802.05999 | Hidden Conformal Symmetry in Tree-Level Graviton Scattering | We argue that the scattering of gravitons in ordinary Einstein gravity
possesses a hidden conformal symmetry at tree level in any number of
dimensions. The presence of this conformal symmetry is indicated by the dilaton
soft theorem in string theory, and it is reminiscent of the conformal
invariance of gluon tree-level amplitudes in four dimensions. To motivate the
underlying prescription, we demonstrate that formulating the conformal symmetry
of gluon amplitudes in terms of momenta and polarization vectors requires
manifest reversal and cyclic symmetry. Similarly, our formulation of the
conformal symmetry of graviton amplitudes relies on a manifestly permutation
symmetric form of the amplitude function.
| hep-th gr-qc math-ph math.MP | we argue that the scattering of gravitons in ordinary einstein gravity possesses a hidden conformal symmetry at tree level in any number of dimensions the presence of this conformal symmetry is indicated by the dilaton soft theorem in string theory and it is reminiscent of the conformal invariance of gluon treelevel amplitudes in four dimensions to motivate the underlying prescription we demonstrate that formulating the conformal symmetry of gluon amplitudes in terms of momenta and polarization vectors requires manifest reversal and cyclic symmetry similarly our formulation of the conformal symmetry of graviton amplitudes relies on a manifestly permutation symmetric form of the amplitude function | [['we', 'argue', 'that', 'the', 'scattering', 'of', 'gravitons', 'in', 'ordinary', 'einstein', 'gravity', 'possesses', 'a', 'hidden', 'conformal', 'symmetry', 'at', 'tree', 'level', 'in', 'any', 'number', 'of', 'dimensions', 'the', 'presence', 'of', 'this', 'conformal', 'symmetry', 'is', 'indicated', 'by', 'the', 'dilaton', 'soft', 'theorem', 'in', 'string', 'theory', 'and', 'it', 'is', 'reminiscent', 'of', 'the', 'conformal', 'invariance', 'of', 'gluon', 'treelevel', 'amplitudes', 'in', 'four', 'dimensions', 'to', 'motivate', 'the', 'underlying', 'prescription', 'we', 'demonstrate', 'that', 'formulating', 'the', 'conformal', 'symmetry', 'of', 'gluon', 'amplitudes', 'in', 'terms', 'of', 'momenta', 'and', 'polarization', 'vectors', 'requires', 'manifest', 'reversal', 'and', 'cyclic', 'symmetry', 'similarly', 'our', 'formulation', 'of', 'the', 'conformal', 'symmetry', 'of', 'graviton', 'amplitudes', 'relies', 'on', 'a', 'manifestly', 'permutation', 'symmetric', 'form', 'of', 'the', 'amplitude', 'function']] | [-0.19587261545418116, 0.24070924501687002, -0.12077136148358338, 0.08504719804197801, -0.09985741315624462, -0.09507546822659116, -0.0245807604347087, 0.30556212302942115, -0.17262108483387587, -0.23372257041494146, 0.02581112973656183, -0.22380333859473467, -0.19477776690081766, 0.051506987208715424, -0.006885594764473633, 0.05395079856792178, -0.05002384290967781, 0.07930918363854289, -0.1293113273075925, -0.23250143393390596, 0.36109718752917475, -0.007221392181236297, 0.3070290859412545, 0.05845010876118277, 0.13600564691184375, 0.08896403924938148, -0.04304259171924339, -0.036883421475067735, -0.03375376075522441, 0.0861768701310771, 0.20365220178903726, 0.06774894958988835, 0.08841802007205282, -0.4173321630805731, -0.1836945641620192, 0.046769696968392685, 0.14807209716393396, 0.168542997392181, 0.0064468310231754564, -0.26858255347738474, 0.05842865001446066, -0.13670396025722417, -0.22766697879146355, -0.08912436536719234, -0.0029676786910455962, -0.15517306044841042, -0.2569979625583913, 0.13610857306607962, 0.06793458740531395, 0.05438902139520416, -0.013480515839406647, -0.057382944410514586, -0.10050681542578296, 0.005270022298925771, 0.1742840677884837, 0.06172760417197983, 0.116809114447768, -0.21079101914522022, -0.15848066284357068, 0.3756795142925022, -0.049523369736002326, -0.22850578350391096, 0.11337393608230811, -0.1868421467818105, -0.21786902257456228, 0.1170030035606872, 0.10764016288997552, 0.12672979436599865, -0.11604660959430756, 0.23069971113056034, -0.04333110147406562, 0.14712486558598287, 0.17257891188805494, 0.08177131274267314, 0.26815979240032345, 0.0790331133802493, 0.009592790237198083, 0.1631911520873053, -0.002214004686370922, -0.10074574038243064, -0.4536411806251496, -0.12566810516783825, -0.1433800990052987, 0.10861553215475467, -0.1831129658649633, -0.1530929839489265, 0.37461542826853333, 0.1063090879457517, 0.15344104185575047, 0.09018928846433902, 0.21170647773676768, 0.14521071536560506, 0.1548007175577088, 0.07247825941214195, 0.24449733000409862, 0.19259478758501175, 0.054988313825630866, -0.2910284462850541, -0.07691342590484194, 0.16888836343199587] |
1,802.06 | On the Practical Applications of Information Field Dynamics | In this study we explore a new simulation scheme for partial differential
equations known as Information Field Dynamics (IFD). Information field dynamics
attempts to improve on existing simulation schemes by incorporating Bayesian
field inference into the simulation scheme. The field inference is truly
Bayesian and thus depends on a notion of prior belief. A number of results are
presented, both theoretical and practical. Many small fixes and results on the
general theory are presented, before exploring two general classes of
simulation schemes that are possible in the IFD framework. For both, we present
a set of theoretical results alongside the development of a prototype scheme.
The first class of models corresponds roughly to traditional fixed-grid
numerical PDE solvers. The prior Bayesian assumption in these models is that
the fields are smooth, and their correlation structure does not vary between
locations. For these reasons we call them translation-invariant schemes. We
show the requirements for stability of these schemes, but most importantly we
prove that these schemes indeed converge to the true behaviour of the field in
the limit of high resolutions. Convergence had never been shown for any
previous IFD scheme. We also find the error scaling of these codes and show
that they implement something very analogous to a high-order finite-difference
derivative approximation, which are the most elementary and well-studied
numerical schemes. This is an important result, which proves the validity of
the IFD approach. The second class of schemes, called the SPH-like schemes are
similar to existing Smooth Particle Hydrodynamics codes, in which the
simulation grid moves with the flow of the field being modelled.
| physics.data-an astro-ph.IM | in this study we explore a new simulation scheme for partial differential equations known as information field dynamics ifd information field dynamics attempts to improve on existing simulation schemes by incorporating bayesian field inference into the simulation scheme the field inference is truly bayesian and thus depends on a notion of prior belief a number of results are presented both theoretical and practical many small fixes and results on the general theory are presented before exploring two general classes of simulation schemes that are possible in the ifd framework for both we present a set of theoretical results alongside the development of a prototype scheme the first class of models corresponds roughly to traditional fixedgrid numerical pde solvers the prior bayesian assumption in these models is that the fields are smooth and their correlation structure does not vary between locations for these reasons we call them translationinvariant schemes we show the requirements for stability of these schemes but most importantly we prove that these schemes indeed converge to the true behaviour of the field in the limit of high resolutions convergence had never been shown for any previous ifd scheme we also find the error scaling of these codes and show that they implement something very analogous to a highorder finitedifference derivative approximation which are the most elementary and wellstudied numerical schemes this is an important result which proves the validity of the ifd approach the second class of schemes called the sphlike schemes are similar to existing smooth particle hydrodynamics codes in which the simulation grid moves with the flow of the field being modelled | [['in', 'this', 'study', 'we', 'explore', 'a', 'new', 'simulation', 'scheme', 'for', 'partial', 'differential', 'equations', 'known', 'as', 'information', 'field', 'dynamics', 'ifd', 'information', 'field', 'dynamics', 'attempts', 'to', 'improve', 'on', 'existing', 'simulation', 'schemes', 'by', 'incorporating', 'bayesian', 'field', 'inference', 'into', 'the', 'simulation', 'scheme', 'the', 'field', 'inference', 'is', 'truly', 'bayesian', 'and', 'thus', 'depends', 'on', 'a', 'notion', 'of', 'prior', 'belief', 'a', 'number', 'of', 'results', 'are', 'presented', 'both', 'theoretical', 'and', 'practical', 'many', 'small', 'fixes', 'and', 'results', 'on', 'the', 'general', 'theory', 'are', 'presented', 'before', 'exploring', 'two', 'general', 'classes', 'of', 'simulation', 'schemes', 'that', 'are', 'possible', 'in', 'the', 'ifd', 'framework', 'for', 'both', 'we', 'present', 'a', 'set', 'of', 'theoretical', 'results', 'alongside', 'the', 'development', 'of', 'a', 'prototype', 'scheme', 'the', 'first', 'class', 'of', 'models', 'corresponds', 'roughly', 'to', 'traditional', 'fixedgrid', 'numerical', 'pde', 'solvers', 'the', 'prior', 'bayesian', 'assumption', 'in', 'these', 'models', 'is', 'that', 'the', 'fields', 'are', 'smooth', 'and', 'their', 'correlation', 'structure', 'does', 'not', 'vary', 'between', 'locations', 'for', 'these', 'reasons', 'we', 'call', 'them', 'translationinvariant', 'schemes', 'we', 'show', 'the', 'requirements', 'for', 'stability', 'of', 'these', 'schemes', 'but', 'most', 'importantly', 'we', 'prove', 'that', 'these', 'schemes', 'indeed', 'converge', 'to', 'the', 'true', 'behaviour', 'of', 'the', 'field', 'in', 'the', 'limit', 'of', 'high', 'resolutions', 'convergence', 'had', 'never', 'been', 'shown', 'for', 'any', 'previous', 'ifd', 'scheme', 'we', 'also', 'find', 'the', 'error', 'scaling', 'of', 'these', 'codes', 'and', 'show', 'that', 'they', 'implement', 'something', 'very', 'analogous', 'to', 'a', 'highorder', 'finitedifference', 'derivative', 'approximation', 'which', 'are', 'the', 'most', 'elementary', 'and', 'wellstudied', 'numerical', 'schemes', 'this', 'is', 'an', 'important', 'result', 'which', 'proves', 'the', 'validity', 'of', 'the', 'ifd', 'approach', 'the', 'second', 'class', 'of', 'schemes', 'called', 'the', 'sphlike', 'schemes', 'are', 'similar', 'to', 'existing', 'smooth', 'particle', 'hydrodynamics', 'codes', 'in', 'which', 'the', 'simulation', 'grid', 'moves', 'with', 'the', 'flow', 'of', 'the', 'field', 'being', 'modelled']] | [-0.12391376431662378, 0.035513597572681424, -0.1168308023235954, 0.08587687359024541, -0.058606008473643154, -0.1432276472238437, 0.010050858949521943, 0.39443312124261315, -0.2554186268858963, -0.2966275082865976, 0.10391071497436331, -0.2054919262188223, -0.1531302334830815, 0.23492959312708028, -0.06354851762078843, 0.07948221861525386, 0.058040342237448916, 0.01622563791197707, -0.08433509227541881, -0.27758044979781055, 0.3266653481906034, 0.04802670670884117, 0.3046771353216104, 0.025685781090221595, 0.10654439510522797, -0.03908303622332103, -0.06606771889041653, 0.040430078077358454, -0.15093713439968062, 0.10101119965877173, 0.2403036844204147, 0.13517775015185043, 0.2949185431908535, -0.41362575739270674, -0.2428278634359814, 0.07610983349347733, 0.13557088110543225, 0.1596348624663287, -0.049428044236704424, -0.2392437591445896, 0.11160370421964887, -0.16551496233562676, -0.10043283673354758, -0.11146264599179322, -0.0428103775849109, 0.053952590601061876, -0.28160854133377555, 0.041290851157786815, 0.07116939671697833, 0.030298145534470678, -0.0331252516379123, -0.10724616457163444, 0.019464578579689536, 0.10595910373442578, 0.039971818500374144, -0.000464453101861027, 0.07037626837143007, -0.1251999588876541, -0.13818810692491923, 0.37536045310684957, -0.024595291743863303, -0.23719929249491542, 0.20322782863282932, -0.1182237897191267, -0.14689172317036692, 0.12825510301794016, 0.16372908447640686, 0.1595861595881255, -0.12092685881048827, 0.07376494653531754, -0.055418439024075304, 0.14883774324882565, 0.0046709237677343895, 0.029061977675114318, 0.14324565450397303, 0.1478861619296642, 0.05465321090612736, 0.0748769312086603, -0.05983396417929193, -0.17887718008835538, -0.32601934986821607, -0.14281304836765213, -0.1407777015119791, -0.009477220841558246, -0.08307891395448197, -0.15727492285538727, 0.3654434081010481, 0.20501617515758383, 0.14163772075806025, 0.08665133680629913, 0.3192281314031274, 0.1131799406526316, 0.04981294523063555, 0.10190432712782772, 0.235156486109602, 0.13688430888932485, 0.0704486537250286, -0.18051313393900856, 0.05458581143076409, 0.07688827169608799] |
1,802.06001 | Optimal Hybrid Full-Duplex/Half-Duplex Scheme for Buffer Aided Relay
Systems | Full-duplex (FD) communication has received great interest in recent years
due to the potential of doubling the spectral efficiency. However, how to
alleviate the detrimental effects of the residual self-interference (RSI)
incurred by the FD mode is still a challenging problem. In this paper, focusing
on the statistical throughput maximization, we propose an optimal hybrid
FD/half-duplex (HD) scheme for the one-way FD buffer aided relay system. To
solve this problem, we divide the system into four different transmission modes
and formulate the problem as a binary integer programming problem. By relaxing
the binary variables to be continuous ones, we solve the problem using the
Karush-Kuhn-Tucker (KKT) optimal conditions. We obtain the selection
probability of each mode based on the instantaneous channel outage states. The
proposed scheme not only achieves the optimal FD or HD mode selection, but also
realizes adaptive source-to-relay or relay-to-destination link selection.
Simulation results show that the proposed scheme offers 95% maximum gain over
the HD counterparts.
| cs.IT math.IT | fullduplex fd communication has received great interest in recent years due to the potential of doubling the spectral efficiency however how to alleviate the detrimental effects of the residual selfinterference rsi incurred by the fd mode is still a challenging problem in this paper focusing on the statistical throughput maximization we propose an optimal hybrid fdhalfduplex hd scheme for the oneway fd buffer aided relay system to solve this problem we divide the system into four different transmission modes and formulate the problem as a binary integer programming problem by relaxing the binary variables to be continuous ones we solve the problem using the karushkuhntucker kkt optimal conditions we obtain the selection probability of each mode based on the instantaneous channel outage states the proposed scheme not only achieves the optimal fd or hd mode selection but also realizes adaptive sourcetorelay or relaytodestination link selection simulation results show that the proposed scheme offers 95 maximum gain over the hd counterparts | [['fullduplex', 'fd', 'communication', 'has', 'received', 'great', 'interest', 'in', 'recent', 'years', 'due', 'to', 'the', 'potential', 'of', 'doubling', 'the', 'spectral', 'efficiency', 'however', 'how', 'to', 'alleviate', 'the', 'detrimental', 'effects', 'of', 'the', 'residual', 'selfinterference', 'rsi', 'incurred', 'by', 'the', 'fd', 'mode', 'is', 'still', 'a', 'challenging', 'problem', 'in', 'this', 'paper', 'focusing', 'on', 'the', 'statistical', 'throughput', 'maximization', 'we', 'propose', 'an', 'optimal', 'hybrid', 'fdhalfduplex', 'hd', 'scheme', 'for', 'the', 'oneway', 'fd', 'buffer', 'aided', 'relay', 'system', 'to', 'solve', 'this', 'problem', 'we', 'divide', 'the', 'system', 'into', 'four', 'different', 'transmission', 'modes', 'and', 'formulate', 'the', 'problem', 'as', 'a', 'binary', 'integer', 'programming', 'problem', 'by', 'relaxing', 'the', 'binary', 'variables', 'to', 'be', 'continuous', 'ones', 'we', 'solve', 'the', 'problem', 'using', 'the', 'karushkuhntucker', 'kkt', 'optimal', 'conditions', 'we', 'obtain', 'the', 'selection', 'probability', 'of', 'each', 'mode', 'based', 'on', 'the', 'instantaneous', 'channel', 'outage', 'states', 'the', 'proposed', 'scheme', 'not', 'only', 'achieves', 'the', 'optimal', 'fd', 'or', 'hd', 'mode', 'selection', 'but', 'also', 'realizes', 'adaptive', 'sourcetorelay', 'or', 'relaytodestination', 'link', 'selection', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'scheme', 'offers', '95', 'maximum', 'gain', 'over', 'the', 'hd', 'counterparts']] | [-0.22219979447757812, -0.012314195986950636, -0.04802629119371, 0.017583748204348045, -0.09077396624100705, -0.24749318011831375, 0.157116078069498, 0.36683470703099136, -0.28524364135081665, -0.25186258083232826, 0.11476053058026277, -0.2180045712504934, -0.18641072205039408, 0.14141556733059432, -0.1363159862856539, 0.09455840064669555, 0.09487279661222354, 0.017772560874761652, -0.025793553996280586, -0.28204987631267253, 0.2853463270801043, 0.12414110959185369, 0.356105630678482, 0.026337659548757213, 0.1088469994577298, 0.03901324922851515, 0.0019671233933208124, -0.023252218694747542, -0.1104874125033937, 0.05472851141118708, 0.27810383883433754, 0.19549948913074514, 0.31572787230541494, -0.387112996921693, -0.26725562336948355, 0.12855394122501215, 0.173320331929234, 0.07308692544839292, -0.0387735477540314, -0.2332905927429901, 0.12397392198982292, -0.20333527017779407, -0.02310638337062215, 0.02510502024732366, -0.08066921952362142, -0.018618747566346336, -0.3426888985354336, 0.04441333371899149, 0.014670904635000715, 0.018432990245523997, -0.07649845589661046, -0.1271039619866126, 0.02844402558058969, 0.11497800364656924, 0.024848878411459004, -0.006116076838225126, 0.05901247496663962, -0.06365612707739263, -0.14299688280601078, 0.3902655042145612, -0.023935013031879872, -0.23870763541697143, 0.1629953730149259, -0.0630296563653498, -0.09493023570357535, 0.17240046825751942, 0.220885689774493, 0.0977713185005218, -0.16543711483209106, 0.036743172871625436, -0.022403963050752315, 0.17142677687272523, 0.0735169330190094, 0.1060814659005769, 0.15597118700286314, 0.18847944984891973, 0.1336384349145323, 0.16444516110412613, -0.13257084686291526, -0.0958208665222445, -0.19201822567192264, -0.12023681414506908, -0.19799789182608216, -0.007791325058872261, -0.07479033632921099, -0.059910009213160934, 0.3607529420707876, 0.1453253737055556, 0.10780028574192112, 0.09731381443042145, 0.3831119037778029, 0.17156852987366464, 0.03631079433933955, 0.11837324616206377, 0.26294912559525024, 0.10197427470688035, 0.11521923230666632, -0.3228606550673128, 0.051646426051368925, 0.03511748689595821] |
1,802.06002 | Classification with Quantum Neural Networks on Near Term Processors | We introduce a quantum neural network, QNN, that can represent labeled data,
classical or quantum, and be trained by supervised learning. The quantum
circuit consists of a sequence of parameter dependent unitary transformations
which acts on an input quantum state. For binary classification a single Pauli
operator is measured on a designated readout qubit. The measured output is the
quantum neural network's predictor of the binary label of the input state.
First we look at classifying classical data sets which consist of n-bit strings
with binary labels. The input quantum state is an n-bit computational basis
state corresponding to a sample string. We show how to design a circuit made
from two qubit unitaries that can correctly represent the label of any Boolean
function of n bits. For certain label functions the circuit is exponentially
long. We introduce parameter dependent unitaries that can be adapted by
supervised learning of labeled data. We study an example of real world data
consisting of downsampled images of handwritten digits each of which has been
labeled as one of two distinct digits. We show through classical simulation
that parameters can be found that allow the QNN to learn to correctly
distinguish the two data sets. We then discuss presenting the data as quantum
superpositions of computational basis states corresponding to different label
values. Here we show through simulation that learning is possible. We consider
using our QNN to learn the label of a general quantum state. By example we show
that this can be done. Our work is exploratory and relies on the classical
simulation of small quantum systems. The QNN proposed here was designed with
near-term quantum processors in mind. Therefore it will be possible to run this
QNN on a near term gate model quantum computer where its power can be explored
beyond what can be explored with simulation.
| quant-ph | we introduce a quantum neural network qnn that can represent labeled data classical or quantum and be trained by supervised learning the quantum circuit consists of a sequence of parameter dependent unitary transformations which acts on an input quantum state for binary classification a single pauli operator is measured on a designated readout qubit the measured output is the quantum neural networks predictor of the binary label of the input state first we look at classifying classical data sets which consist of nbit strings with binary labels the input quantum state is an nbit computational basis state corresponding to a sample string we show how to design a circuit made from two qubit unitaries that can correctly represent the label of any boolean function of n bits for certain label functions the circuit is exponentially long we introduce parameter dependent unitaries that can be adapted by supervised learning of labeled data we study an example of real world data consisting of downsampled images of handwritten digits each of which has been labeled as one of two distinct digits we show through classical simulation that parameters can be found that allow the qnn to learn to correctly distinguish the two data sets we then discuss presenting the data as quantum superpositions of computational basis states corresponding to different label values here we show through simulation that learning is possible we consider using our qnn to learn the label of a general quantum state by example we show that this can be done our work is exploratory and relies on the classical simulation of small quantum systems the qnn proposed here was designed with nearterm quantum processors in mind therefore it will be possible to run this qnn on a near term gate model quantum computer where its power can be explored beyond what can be explored with simulation | [['we', 'introduce', 'a', 'quantum', 'neural', 'network', 'qnn', 'that', 'can', 'represent', 'labeled', 'data', 'classical', 'or', 'quantum', 'and', 'be', 'trained', 'by', 'supervised', 'learning', 'the', 'quantum', 'circuit', 'consists', 'of', 'a', 'sequence', 'of', 'parameter', 'dependent', 'unitary', 'transformations', 'which', 'acts', 'on', 'an', 'input', 'quantum', 'state', 'for', 'binary', 'classification', 'a', 'single', 'pauli', 'operator', 'is', 'measured', 'on', 'a', 'designated', 'readout', 'qubit', 'the', 'measured', 'output', 'is', 'the', 'quantum', 'neural', 'networks', 'predictor', 'of', 'the', 'binary', 'label', 'of', 'the', 'input', 'state', 'first', 'we', 'look', 'at', 'classifying', 'classical', 'data', 'sets', 'which', 'consist', 'of', 'nbit', 'strings', 'with', 'binary', 'labels', 'the', 'input', 'quantum', 'state', 'is', 'an', 'nbit', 'computational', 'basis', 'state', 'corresponding', 'to', 'a', 'sample', 'string', 'we', 'show', 'how', 'to', 'design', 'a', 'circuit', 'made', 'from', 'two', 'qubit', 'unitaries', 'that', 'can', 'correctly', 'represent', 'the', 'label', 'of', 'any', 'boolean', 'function', 'of', 'n', 'bits', 'for', 'certain', 'label', 'functions', 'the', 'circuit', 'is', 'exponentially', 'long', 'we', 'introduce', 'parameter', 'dependent', 'unitaries', 'that', 'can', 'be', 'adapted', 'by', 'supervised', 'learning', 'of', 'labeled', 'data', 'we', 'study', 'an', 'example', 'of', 'real', 'world', 'data', 'consisting', 'of', 'downsampled', 'images', 'of', 'handwritten', 'digits', 'each', 'of', 'which', 'has', 'been', 'labeled', 'as', 'one', 'of', 'two', 'distinct', 'digits', 'we', 'show', 'through', 'classical', 'simulation', 'that', 'parameters', 'can', 'be', 'found', 'that', 'allow', 'the', 'qnn', 'to', 'learn', 'to', 'correctly', 'distinguish', 'the', 'two', 'data', 'sets', 'we', 'then', 'discuss', 'presenting', 'the', 'data', 'as', 'quantum', 'superpositions', 'of', 'computational', 'basis', 'states', 'corresponding', 'to', 'different', 'label', 'values', 'here', 'we', 'show', 'through', 'simulation', 'that', 'learning', 'is', 'possible', 'we', 'consider', 'using', 'our', 'qnn', 'to', 'learn', 'the', 'label', 'of', 'a', 'general', 'quantum', 'state', 'by', 'example', 'we', 'show', 'that', 'this', 'can', 'be', 'done', 'our', 'work', 'is', 'exploratory', 'and', 'relies', 'on', 'the', 'classical', 'simulation', 'of', 'small', 'quantum', 'systems', 'the', 'qnn', 'proposed', 'here', 'was', 'designed', 'with', 'nearterm', 'quantum', 'processors', 'in', 'mind', 'therefore', 'it', 'will', 'be', 'possible', 'to', 'run', 'this', 'qnn', 'on', 'a', 'near', 'term', 'gate', 'model', 'quantum', 'computer', 'where', 'its', 'power', 'can', 'be', 'explored', 'beyond', 'what', 'can', 'be', 'explored', 'with', 'simulation']] | [-0.08615493360703587, 0.13825822832017906, -0.06499977218569636, 0.04286411830018569, -0.06685351662440923, -0.19859948932991062, 0.050537232328919206, 0.3849763928939883, -0.2893800394054417, -0.2973420500030274, 0.058709251785010755, -0.2725977289311418, -0.15507039079345544, 0.21462969506631152, -0.07959228238024132, 0.10376626859383592, 0.12322214903485891, 0.09395229851778487, -0.05792843508238355, -0.30654960248205226, 0.31620693153698687, 0.017989931482873273, 0.2558813965416753, -0.04649918444503208, 0.13378904494138416, -0.024708832604833347, 0.023066039854305696, 0.0007053691061844606, -0.05544041443307765, 0.10580738451758837, 0.32384654518113704, 0.19462689389596036, 0.2573367011299545, -0.4448866417072135, -0.19902939798389274, 0.1250065670451847, 0.12072184398021027, 0.1621666746961062, -0.007661480192665363, -0.31462406988766844, 0.11242067388976326, -0.17384357845548357, -0.02380903006655677, -0.13054587078926908, -0.011315611926368544, -0.013711356713378905, -0.27208066573032824, -0.0016975227188992432, 0.05541684648878296, 0.021253475679709585, -0.009053279218379201, -0.07897337456575082, 0.027150668528428488, 0.1615289113812713, -0.05894013570946966, 0.061618591541218105, 0.13214494569639673, -0.12076377541779355, -0.19508454489828078, 0.33391855215101657, -0.025508230686315157, -0.23299666189251875, 0.14639649301288038, -0.07281367382465434, -0.1241799935240432, 0.04297730448376691, 0.19051071836124706, 0.08824287271066432, -0.13921058423368182, 0.07455442051552251, -0.06632164785644519, 0.24158466095028974, 0.03089930651882354, 0.030690914040608846, 0.18375024516537408, 0.1853389544071211, 0.010557173046166629, 0.19977511338554382, -0.11160228504480396, -0.10388739014852864, -0.29919198796256213, -0.1531794151429281, -0.2676373080719044, 0.09374731947578405, -0.08040850145690347, -0.17095023742393464, 0.40259627318646796, 0.17589693611217755, 0.217437199614214, 0.06751419403415829, 0.2906286419105355, 0.10742251310764481, 0.09710647857289895, 0.07408620327626164, 0.17218118244084357, 0.07339142833484476, 0.03884397659083701, -0.19203616183854832, 0.06016673569048752, 0.040736333712789834] |
1,802.06003 | Structured-based Curriculum Learning for End-to-end English-Japanese
Speech Translation | Sequence-to-sequence attentional-based neural network architectures have been
shown to provide a powerful model for machine translation and speech
recognition. Recently, several works have attempted to extend the models for
end-to-end speech translation task. However, the usefulness of these models
were only investigated on language pairs with similar syntax and word order
(e.g., English-French or English-Spanish). In this work, we focus on end-to-end
speech translation tasks on syntactically distant language pairs (e.g.,
English-Japanese) that require distant word reordering.
To guide the encoder-decoder attentional model to learn this difficult
problem, we propose a structured-based curriculum learning strategy.
Unlike conventional curriculum learning that gradually emphasizes difficult
data examples, we formalize learning strategies from easier network structures
to more difficult network structures. Here, we start the training with
end-to-end encoder-decoder for speech recognition or text-based machine
translation task then gradually move to end-to-end speech translation task. The
experiment results show that the proposed approach could provide significant
improvements in comparison with the one without curriculum learning.
| cs.CL cs.SD eess.AS | sequencetosequence attentionalbased neural network architectures have been shown to provide a powerful model for machine translation and speech recognition recently several works have attempted to extend the models for endtoend speech translation task however the usefulness of these models were only investigated on language pairs with similar syntax and word order eg englishfrench or englishspanish in this work we focus on endtoend speech translation tasks on syntactically distant language pairs eg englishjapanese that require distant word reordering to guide the encoderdecoder attentional model to learn this difficult problem we propose a structuredbased curriculum learning strategy unlike conventional curriculum learning that gradually emphasizes difficult data examples we formalize learning strategies from easier network structures to more difficult network structures here we start the training with endtoend encoderdecoder for speech recognition or textbased machine translation task then gradually move to endtoend speech translation task the experiment results show that the proposed approach could provide significant improvements in comparison with the one without curriculum learning | [['sequencetosequence', 'attentionalbased', 'neural', 'network', 'architectures', 'have', 'been', 'shown', 'to', 'provide', 'a', 'powerful', 'model', 'for', 'machine', 'translation', 'and', 'speech', 'recognition', 'recently', 'several', 'works', 'have', 'attempted', 'to', 'extend', 'the', 'models', 'for', 'endtoend', 'speech', 'translation', 'task', 'however', 'the', 'usefulness', 'of', 'these', 'models', 'were', 'only', 'investigated', 'on', 'language', 'pairs', 'with', 'similar', 'syntax', 'and', 'word', 'order', 'eg', 'englishfrench', 'or', 'englishspanish', 'in', 'this', 'work', 'we', 'focus', 'on', 'endtoend', 'speech', 'translation', 'tasks', 'on', 'syntactically', 'distant', 'language', 'pairs', 'eg', 'englishjapanese', 'that', 'require', 'distant', 'word', 'reordering', 'to', 'guide', 'the', 'encoderdecoder', 'attentional', 'model', 'to', 'learn', 'this', 'difficult', 'problem', 'we', 'propose', 'a', 'structuredbased', 'curriculum', 'learning', 'strategy', 'unlike', 'conventional', 'curriculum', 'learning', 'that', 'gradually', 'emphasizes', 'difficult', 'data', 'examples', 'we', 'formalize', 'learning', 'strategies', 'from', 'easier', 'network', 'structures', 'to', 'more', 'difficult', 'network', 'structures', 'here', 'we', 'start', 'the', 'training', 'with', 'endtoend', 'encoderdecoder', 'for', 'speech', 'recognition', 'or', 'textbased', 'machine', 'translation', 'task', 'then', 'gradually', 'move', 'to', 'endtoend', 'speech', 'translation', 'task', 'the', 'experiment', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'could', 'provide', 'significant', 'improvements', 'in', 'comparison', 'with', 'the', 'one', 'without', 'curriculum', 'learning']] | [-0.00841854050231632, 0.007262481903308071, -0.04501136877515819, 0.1152713566159946, -0.19514704974274083, -0.26166801146464425, 0.032842390035511926, 0.5421559601556509, -0.2849948238901561, -0.3409708124880126, -0.0012049072560330388, -0.24970890769618564, -0.21174969898711424, 0.2039775774872396, -0.1786351273651235, 0.1378670282296298, 0.18575181308478933, 0.08656049812307173, -0.06417084866989171, -0.311674917738128, 0.30484532422851773, 0.022048621787689626, 0.38806892942811827, -0.01793957267946098, 0.11878001728982782, -0.05067611624217534, -0.005554630060214549, -0.11630060389288702, -0.05360990950280211, 0.2110613444056071, 0.39311889623263596, 0.24315235711837885, 0.34401282188482585, -0.4346363628981635, -0.23240696175489575, 0.09526395911234431, 0.1546946663997005, 0.16943956089380663, -0.0437263721670206, -0.3840245120198233, 0.07237672022383776, -0.20838170666247607, 0.13747106701630402, -0.16345602958463132, -0.006865034927614033, -0.06351523855191772, -0.22566026508429787, -0.028165348145921597, 0.18991169632354285, 0.1282184324692935, -0.04361377367895329, -0.08958816039084923, 0.05454018765085493, 0.1592967756150756, 0.06829391620558453, 0.13749177131539908, 0.13238461494038348, -0.17714811010519044, -0.19360466429498047, 0.37955001746304334, -0.058465914821863404, -0.24240254098549485, 0.23521557840431342, 0.0458456888794899, -0.22112467847182415, 0.036267270380631086, 0.28393985038273967, 0.06911551502125804, -0.1855292229563929, -0.013546937711362261, -0.01965243947051931, 0.23063661836786195, 0.08204187053197529, -0.0547638777148677, 0.18510564690222964, 0.28806583610130476, -0.03243767577514518, 0.1506708965767757, -0.0931972249658429, -0.05353017702000216, -0.1351492112793494, -0.08676572727272287, -0.14703011553938267, -0.051162565129925494, -0.024264388807750947, -0.09976882474611556, 0.3699315695426776, 0.2636501237226184, 0.16519198180758393, 0.20236428406788037, 0.3417336783139035, -0.005674544401699677, 0.16998033724376, 0.08778916263727296, 0.17351036937179742, -0.05255157321662409, 0.1858389575878391, -0.1442924280752777, 0.10842056264809799, 0.0525290792924352] |
1,802.06004 | GOTaxon: Representing the evolution of biological functions in the Gene
Ontology | The Gene Ontology aims to define the universe of functions known for gene
products, at the molecular, cellular and organism levels. While the ontology is
designed to cover all aspects of biology in a "species independent manner", the
fact remains that many if not most biological functions are restricted in their
taxonomic range. This is simply because functions evolve, i.e. like other
biological characteristics they are gained and lost over evolutionary time.
Here we introduce a general method of representing the evolutionary gain and
loss of biological functions within the Gene Ontology. We then apply a variety
of techniques, including manual curation, logical reasoning over the ontology
structure, and previously published "taxon constraints" to assign evolutionary
gain and loss events to the majority of terms in the GO. These gain and loss
events now almost triple the number of terms with taxon constraints, and
currently cover a total of 76% of GO terms, including 40% of molecular function
terms, 78% of cellular component terms, and 89% of biological process terms.
Database URL: GOTaxon is freely available at
https://github.com/haimingt/GOTaxonConstraint
| q-bio.PE q-bio.GN | the gene ontology aims to define the universe of functions known for gene products at the molecular cellular and organism levels while the ontology is designed to cover all aspects of biology in a species independent manner the fact remains that many if not most biological functions are restricted in their taxonomic range this is simply because functions evolve ie like other biological characteristics they are gained and lost over evolutionary time here we introduce a general method of representing the evolutionary gain and loss of biological functions within the gene ontology we then apply a variety of techniques including manual curation logical reasoning over the ontology structure and previously published taxon constraints to assign evolutionary gain and loss events to the majority of terms in the go these gain and loss events now almost triple the number of terms with taxon constraints and currently cover a total of 76 of go terms including 40 of molecular function terms 78 of cellular component terms and 89 of biological process terms database url gotaxon is freely available at httpsgithubcomhaimingtgotaxonconstraint | [['the', 'gene', 'ontology', 'aims', 'to', 'define', 'the', 'universe', 'of', 'functions', 'known', 'for', 'gene', 'products', 'at', 'the', 'molecular', 'cellular', 'and', 'organism', 'levels', 'while', 'the', 'ontology', 'is', 'designed', 'to', 'cover', 'all', 'aspects', 'of', 'biology', 'in', 'a', 'species', 'independent', 'manner', 'the', 'fact', 'remains', 'that', 'many', 'if', 'not', 'most', 'biological', 'functions', 'are', 'restricted', 'in', 'their', 'taxonomic', 'range', 'this', 'is', 'simply', 'because', 'functions', 'evolve', 'ie', 'like', 'other', 'biological', 'characteristics', 'they', 'are', 'gained', 'and', 'lost', 'over', 'evolutionary', 'time', 'here', 'we', 'introduce', 'a', 'general', 'method', 'of', 'representing', 'the', 'evolutionary', 'gain', 'and', 'loss', 'of', 'biological', 'functions', 'within', 'the', 'gene', 'ontology', 'we', 'then', 'apply', 'a', 'variety', 'of', 'techniques', 'including', 'manual', 'curation', 'logical', 'reasoning', 'over', 'the', 'ontology', 'structure', 'and', 'previously', 'published', 'taxon', 'constraints', 'to', 'assign', 'evolutionary', 'gain', 'and', 'loss', 'events', 'to', 'the', 'majority', 'of', 'terms', 'in', 'the', 'go', 'these', 'gain', 'and', 'loss', 'events', 'now', 'almost', 'triple', 'the', 'number', 'of', 'terms', 'with', 'taxon', 'constraints', 'and', 'currently', 'cover', 'a', 'total', 'of', '76', 'of', 'go', 'terms', 'including', '40', 'of', 'molecular', 'function', 'terms', '78', 'of', 'cellular', 'component', 'terms', 'and', '89', 'of', 'biological', 'process', 'terms', 'database', 'url', 'gotaxon', 'is', 'freely', 'available', 'at', 'httpsgithubcomhaimingtgotaxonconstraint']] | [-0.06766850503018676, 0.08558821838894139, -0.014892150815946727, 0.08299712726450666, -0.076646510387284, -0.07001106131792767, 0.08773045906458389, 0.3600998878881166, -0.2834630137056758, -0.3533238544398707, 0.05671317446831381, -0.25933594012167305, -0.15335872607961806, 0.16670110371937466, -0.061348673176491335, 0.021767541057752995, 0.0941672713670414, 0.05515289136515507, 0.00034840568762526595, -0.28376898847239895, 0.30171026122248307, 0.032181197092127564, 0.2638844885699324, 0.03293537290830335, 0.12575609620067885, -0.023689536361912775, -0.08689622845932635, -0.01989794836911394, -0.10678228806827147, 0.14784506004600023, 0.33748826245904306, 0.27457364958565283, 0.2889656066505598, -0.4126813972173047, -0.23051039563407275, 0.1163409793020533, 0.17155439846365797, 0.08760774814105719, 0.03266281338239258, -0.2078931122986515, 0.08947545295814052, -0.1911031396144112, -0.06863267196538138, -0.0515927601240533, 0.03765550928603096, 0.06203761894423885, -0.21505392537173149, 0.05789475518130613, 0.030573847079226238, 0.11274991540598091, -0.06865729429277549, -0.14932888589167057, -0.044058299043998966, 0.16998990063571415, -0.00030948158729932567, 0.03233873393566517, 0.1822497921212661, -0.13273806315026543, -0.13528063405729798, 0.3984090813054619, -6.167855727570978e-06, -0.22024767795598812, 0.25228969842216675, -0.11620019985870882, -0.15408742532599717, 0.13122935118603477, 0.15146528253270927, 0.0921293608619387, -0.2276665610608523, 0.06245314758482643, 0.02125590316295116, 0.16219983983319253, 0.10997631607361572, 0.08705905310985558, 0.19097226699027073, 0.1798487787124362, 0.02033791213894305, 0.09621041495020935, -0.050594940800113945, -0.12677855708435262, -0.247359981702175, -0.13679013299671086, -0.11153804222505476, 0.04135624218518139, -0.08062715104990109, -0.19670988315589388, 0.38761697873600165, 0.11617624874270405, 0.173712308566213, 0.07462755326096984, 0.2609866142116847, 0.05092730275249447, 0.11153106959086885, 0.017864129551030186, 0.15087785671626494, 0.07176564455122306, 0.10422771974117495, -0.15665299734510799, 0.13891358399731954, 0.00042515624293380165] |
1,802.06005 | Localized interlayer complexes in heterobilayer transition metal
dichalcogenides | We present theoretical results for the radiative rates and doping-dependent
photoluminescence spectrum of interlayer excitonic complexes localized by donor
impurities in MoSe$_2$/WSe$_2$ twisted heterobilayers, supported by quantum
Monte Carlo calculations of binding energies and wave-function overlap
integrals. For closely aligned layers, radiative decay is made possible by the
momentum spread of the localized complexes' wave functions, resulting in few
$\mu$s$^{-1}$ radiative rates. For strongly misaligned layers, the short-range
interaction between the carriers and impurity provides a finite radiative rate
with a strong asymptotic twist angle dependence $\propto \theta^{-8}$. Finally,
phonon-assisted recombination is considered, with emission of optical phonons
in both layers resulting in additional weaker emission lines, redshifted by the
phonon energy.
| cond-mat.mes-hall | we present theoretical results for the radiative rates and dopingdependent photoluminescence spectrum of interlayer excitonic complexes localized by donor impurities in mose_2wse_2 twisted heterobilayers supported by quantum monte carlo calculations of binding energies and wavefunction overlap integrals for closely aligned layers radiative decay is made possible by the momentum spread of the localized complexes wave functions resulting in few mus1 radiative rates for strongly misaligned layers the shortrange interaction between the carriers and impurity provides a finite radiative rate with a strong asymptotic twist angle dependence propto theta8 finally phononassisted recombination is considered with emission of optical phonons in both layers resulting in additional weaker emission lines redshifted by the phonon energy | [['we', 'present', 'theoretical', 'results', 'for', 'the', 'radiative', 'rates', 'and', 'dopingdependent', 'photoluminescence', 'spectrum', 'of', 'interlayer', 'excitonic', 'complexes', 'localized', 'by', 'donor', 'impurities', 'in', 'mose_2wse_2', 'twisted', 'heterobilayers', 'supported', 'by', 'quantum', 'monte', 'carlo', 'calculations', 'of', 'binding', 'energies', 'and', 'wavefunction', 'overlap', 'integrals', 'for', 'closely', 'aligned', 'layers', 'radiative', 'decay', 'is', 'made', 'possible', 'by', 'the', 'momentum', 'spread', 'of', 'the', 'localized', 'complexes', 'wave', 'functions', 'resulting', 'in', 'few', 'mus1', 'radiative', 'rates', 'for', 'strongly', 'misaligned', 'layers', 'the', 'shortrange', 'interaction', 'between', 'the', 'carriers', 'and', 'impurity', 'provides', 'a', 'finite', 'radiative', 'rate', 'with', 'a', 'strong', 'asymptotic', 'twist', 'angle', 'dependence', 'propto', 'theta8', 'finally', 'phononassisted', 'recombination', 'is', 'considered', 'with', 'emission', 'of', 'optical', 'phonons', 'in', 'both', 'layers', 'resulting', 'in', 'additional', 'weaker', 'emission', 'lines', 'redshifted', 'by', 'the', 'phonon', 'energy']] | [-0.14632313594587945, 0.2218416123609391, 0.03604901216450734, 0.12504924439833434, 0.0007470804911073563, -0.14602560823550448, 0.06913497181709058, 0.48395345686003566, -0.2452429950894189, -0.23999870000573406, -0.07397519406471734, -0.318258911653954, -0.04851720652888097, 0.152026315546079, 0.11563957725034665, 0.004469090827374852, 0.07856317584186659, -0.12410003191325814, -0.06877242069718445, -0.1455698069247384, 0.31450733642642653, 0.12247964172586633, 0.25466818027364624, 0.1625295089823859, -0.020488298642573812, 0.02947071556991432, 0.043770203878271526, -0.059601572583362995, -0.18192389098528242, 0.09974517221728872, 0.2256064637419643, -0.07830198628445421, 0.18906949987389712, -0.45377693278715014, -0.20972447168112143, -0.0163015877478756, 0.19863235267777263, 0.1379098417611593, -0.07579072154684192, -0.26686939185102737, -0.017551044812924892, -0.16801062258933339, -0.11000799128565372, -0.03526473422035841, 0.016858219846783738, 0.03865439651001777, -0.2774732777616009, 0.16865570156369358, 0.011892353169969283, 0.05857082593287747, -0.07298531106789596, -0.11037798072253022, -0.14256671254614567, 0.04241215471847681, 0.07318891451099521, 0.01639506168430671, 0.18063870222457418, -0.11286799707990472, -0.10862852311817862, 0.31672040307811195, -0.10659454246654475, -0.11496783703997997, 0.16114819803208644, -0.17735048547547194, -0.03755938938619303, 0.26813032270209597, 0.08520717847776334, 0.1503192756291745, -0.10787836999744675, 0.0577898237892701, 0.03293030463737523, 0.16689015561548462, 0.02869438873053046, 0.1265947060414224, 0.2293479986089681, 0.09847611594263331, -0.010572093745785034, 0.1418048407821126, -0.15163103410200815, -0.11445951095967237, -0.22338926268275827, -0.12469893267552834, -0.1992106257530395, 0.11741205045668071, -0.07870673109638508, -0.16643591306637973, 0.375678254669765, 0.07135675347308279, 0.19109867242929926, 0.007453820291889964, 0.26438062011064695, 0.13841671751080348, 0.08853256213686629, 0.05558282608399168, 0.2864875496015884, 0.2173648673259387, 0.05512347904732451, -0.3296038871527084, 0.03261548279468635, 0.05644119569998501] |
1,802.06006 | Neural Voice Cloning with a Few Samples | Voice cloning is a highly desired feature for personalized speech interfaces.
Neural network based speech synthesis has been shown to generate high quality
speech for a large number of speakers. In this paper, we introduce a neural
voice cloning system that takes a few audio samples as input. We study two
approaches: speaker adaptation and speaker encoding. Speaker adaptation is
based on fine-tuning a multi-speaker generative model with a few cloning
samples. Speaker encoding is based on training a separate model to directly
infer a new speaker embedding from cloning audios and to be used with a
multi-speaker generative model. In terms of naturalness of the speech and its
similarity to original speaker, both approaches can achieve good performance,
even with very few cloning audios. While speaker adaptation can achieve better
naturalness and similarity, the cloning time or required memory for the speaker
encoding approach is significantly less, making it favorable for low-resource
deployment.
| cs.CL cs.LG cs.SD eess.AS | voice cloning is a highly desired feature for personalized speech interfaces neural network based speech synthesis has been shown to generate high quality speech for a large number of speakers in this paper we introduce a neural voice cloning system that takes a few audio samples as input we study two approaches speaker adaptation and speaker encoding speaker adaptation is based on finetuning a multispeaker generative model with a few cloning samples speaker encoding is based on training a separate model to directly infer a new speaker embedding from cloning audios and to be used with a multispeaker generative model in terms of naturalness of the speech and its similarity to original speaker both approaches can achieve good performance even with very few cloning audios while speaker adaptation can achieve better naturalness and similarity the cloning time or required memory for the speaker encoding approach is significantly less making it favorable for lowresource deployment | [['voice', 'cloning', 'is', 'a', 'highly', 'desired', 'feature', 'for', 'personalized', 'speech', 'interfaces', 'neural', 'network', 'based', 'speech', 'synthesis', 'has', 'been', 'shown', 'to', 'generate', 'high', 'quality', 'speech', 'for', 'a', 'large', 'number', 'of', 'speakers', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'neural', 'voice', 'cloning', 'system', 'that', 'takes', 'a', 'few', 'audio', 'samples', 'as', 'input', 'we', 'study', 'two', 'approaches', 'speaker', 'adaptation', 'and', 'speaker', 'encoding', 'speaker', 'adaptation', 'is', 'based', 'on', 'finetuning', 'a', 'multispeaker', 'generative', 'model', 'with', 'a', 'few', 'cloning', 'samples', 'speaker', 'encoding', 'is', 'based', 'on', 'training', 'a', 'separate', 'model', 'to', 'directly', 'infer', 'a', 'new', 'speaker', 'embedding', 'from', 'cloning', 'audios', 'and', 'to', 'be', 'used', 'with', 'a', 'multispeaker', 'generative', 'model', 'in', 'terms', 'of', 'naturalness', 'of', 'the', 'speech', 'and', 'its', 'similarity', 'to', 'original', 'speaker', 'both', 'approaches', 'can', 'achieve', 'good', 'performance', 'even', 'with', 'very', 'few', 'cloning', 'audios', 'while', 'speaker', 'adaptation', 'can', 'achieve', 'better', 'naturalness', 'and', 'similarity', 'the', 'cloning', 'time', 'or', 'required', 'memory', 'for', 'the', 'speaker', 'encoding', 'approach', 'is', 'significantly', 'less', 'making', 'it', 'favorable', 'for', 'lowresource', 'deployment']] | [-0.0387315273809537, 0.010316446586814406, -0.06876060764256914, 0.05087543767801329, -0.15716695976625014, -0.3213100707968818, 0.03897283918166823, 0.4737842322702145, -0.24740829352628102, -0.3106658713024279, 0.04139473784016445, -0.2440750055232799, -0.15549207501288795, 0.2030318009806192, -0.18825038951253156, 0.1556884644839568, 0.11572605246895706, 0.09132816055154597, -0.04068964264845451, -0.28357621239855063, 0.2566100041406205, 0.032689286692237314, 0.4145754850545124, -0.029868991357613017, 0.16971014717944546, -0.05181538800804576, 0.009094946582305741, -0.12034787515604675, 0.03544997382589107, 0.14532184563335274, 0.3697654637780234, 0.26249974349652744, 0.30676589859951914, -0.3570138719839999, -0.21178450892594727, 0.10876819973224895, 0.14803265517142106, 0.19045240803041144, -0.07454202593116743, -0.4069052510531982, 0.11432596170282983, -0.2036126330192503, 0.1348624650295219, -0.13832702697557095, -0.014337382116052625, -0.06234084376112812, -0.30750045001918036, 0.036049351617754376, 0.14163082425615617, 0.10292300789363006, -0.035268995722652983, -0.09347068951026742, 0.04614651575986925, 0.1695071350187426, 0.046847248455213215, 0.08190052357030572, 0.15529037799758763, -0.2058069141481114, -0.14426987618963874, 0.37010973096861466, -0.06586976132095586, -0.2849313727241348, 0.23144376727710056, 0.05266099891855151, -0.12170731179815318, 0.06623016282698357, 0.26203245701050604, 0.07668691823960512, -0.21039347966842645, -0.03834966760334353, -0.021166691623095955, 0.3276519902872962, 0.11766038070033703, 0.008835016105735264, 0.1579601293287615, 0.28447693025250315, -0.008899766008381719, 0.17422699147469498, -0.125969462662137, -0.009217983891873003, -0.1666111753551991, -0.10396108752745506, -0.20298739967190407, 0.0014155117444113478, -0.1017684181120289, -0.12822029627946527, 0.4380407543828735, 0.2173308435125978, 0.19541917386005161, 0.17400541614027476, 0.34965405517632697, 0.025828668110635035, 0.10706182574821552, 0.059697070893795265, 0.16750046879343397, -0.03615732294471039, 0.1319664931302745, -0.14851968214611294, 0.16401791741448613, 0.03118525837644838] |
1,802.06007 | Authorship Attribution Using the Chaos Game Representation | The Chaos Game Representation, a method for creating images from nucleotide
sequences, is modified to make images from chunks of text documents. Machine
learning methods are then applied to train classifiers based on authorship.
Experiments are conducted on several benchmark data sets in English, including
the widely used Federalist Papers, and one in Portuguese. Validation results
for the trained classifiers are competitive with the best methods in prior
literature. The methodology is also successfully applied for text
categorization with encouraging results. One classifier method is moreover seen
to hold promise for the task of digital fingerprinting.
| cs.CL cs.DL cs.IR | the chaos game representation a method for creating images from nucleotide sequences is modified to make images from chunks of text documents machine learning methods are then applied to train classifiers based on authorship experiments are conducted on several benchmark data sets in english including the widely used federalist papers and one in portuguese validation results for the trained classifiers are competitive with the best methods in prior literature the methodology is also successfully applied for text categorization with encouraging results one classifier method is moreover seen to hold promise for the task of digital fingerprinting | [['the', 'chaos', 'game', 'representation', 'a', 'method', 'for', 'creating', 'images', 'from', 'nucleotide', 'sequences', 'is', 'modified', 'to', 'make', 'images', 'from', 'chunks', 'of', 'text', 'documents', 'machine', 'learning', 'methods', 'are', 'then', 'applied', 'to', 'train', 'classifiers', 'based', 'on', 'authorship', 'experiments', 'are', 'conducted', 'on', 'several', 'benchmark', 'data', 'sets', 'in', 'english', 'including', 'the', 'widely', 'used', 'federalist', 'papers', 'and', 'one', 'in', 'portuguese', 'validation', 'results', 'for', 'the', 'trained', 'classifiers', 'are', 'competitive', 'with', 'the', 'best', 'methods', 'in', 'prior', 'literature', 'the', 'methodology', 'is', 'also', 'successfully', 'applied', 'for', 'text', 'categorization', 'with', 'encouraging', 'results', 'one', 'classifier', 'method', 'is', 'moreover', 'seen', 'to', 'hold', 'promise', 'for', 'the', 'task', 'of', 'digital', 'fingerprinting']] | [0.03868982639948004, -0.060925493850127646, -0.09743718789449256, 0.11601793331608765, -0.11040586836047862, -0.19760849941521882, 0.04249307155413063, 0.45915759192093425, -0.2368233261629939, -0.32621341663853903, 0.1003844271867389, -0.3319654146601495, -0.1479778309009577, 0.30430971022471665, -0.12011597315339666, 0.1186767449418671, 0.18705239140085483, 0.0892276652622968, 0.0012433203035279324, -0.38097387003393746, 0.3210235929557759, -0.0033492961457293286, 0.39807393932469975, -0.018911334695784668, 0.06661100743559042, -0.07986361114798408, -0.07243418065880082, -0.012073760538509018, -0.05225108125443129, 0.16284346319918863, 0.39181174506482325, 0.23449516103259826, 0.3082115407150827, -0.3731901346264701, -0.17346171015187314, 0.05934599550735009, 0.11724267210321207, 0.16152990066299314, -0.048871561906937706, -0.3776249870853989, 0.1082547575848079, -0.1285890984103868, 0.05659830221710237, -0.15285620442346523, -0.01566192305548803, 0.040034235739394235, -0.30409458818796437, 0.03949440896578476, 0.04846241898209739, 0.11582193113863468, -0.055315017263944215, -0.17263185430906322, 0.05573586899983256, 0.18477144309956778, 0.07949632516645483, 0.06368869463116617, 0.11843226211831757, -0.13669290361239722, -0.2030159246911736, 0.39820077029105866, -0.08672613688793622, -0.21698062194168174, 0.18871829186284325, -0.0003262410724633618, -0.18595079087015046, 0.08799190270273309, 0.22935522286907623, 0.11757076556647295, -0.17461120889179016, -0.018507955443898313, -0.05672564654562034, 0.22025675482459758, 0.08618982301191672, -0.07183423701085542, 0.13979554883768094, 0.2634364231342548, -0.03880810913580813, 0.1441573579060404, -0.13131283376071798, -0.06053476237544888, -0.16861463962367884, -0.08546625154190941, -0.2160949512767777, -0.09635868662429091, -0.07497699950365228, -0.13642219767023467, 0.3741477807199484, 0.2661916483487738, 0.12944943179425442, 0.07469540814575004, 0.3273267489514853, -0.026364593465175282, 0.13527349998414712, 0.051601283553080926, 0.16028371901300392, 0.03531506822297448, 0.15339372389410671, -0.07425172135331913, 0.09112485900864398, 0.08520420508361176] |
1,802.06008 | The CLIC Detector Concept | The Compact Linear Collider (CLIC) is a concept for a future linear collider
that would provide e$^+$e$^-$ collisions at up to 3 TeV. The physics aims
require a detector system with excellent jet energy and track momentum
resolution, highly efficient flavour tagging and lepton identification
capabilities, full geometrical coverage extending to low polar angles, and
timing information of the order of nanoseconds to reject beam-induced
background. To deal with these requirements, an extensive R&D programme is in
place to overcome current technological limits. The CLIC detector concept
includes a low-mass all-silicon vertex and tracking detector system and
fine-grained calorimeters designed for particle flow analysis techniques,
surrounded by a 4 T solenoid magnet. An overview of the requirements and design
optimisations for the CLIC detector concept is presented.
| physics.ins-det hep-ex | the compact linear collider clic is a concept for a future linear collider that would provide ee collisions at up to 3 tev the physics aims require a detector system with excellent jet energy and track momentum resolution highly efficient flavour tagging and lepton identification capabilities full geometrical coverage extending to low polar angles and timing information of the order of nanoseconds to reject beaminduced background to deal with these requirements an extensive rd programme is in place to overcome current technological limits the clic detector concept includes a lowmass allsilicon vertex and tracking detector system and finegrained calorimeters designed for particle flow analysis techniques surrounded by a 4 t solenoid magnet an overview of the requirements and design optimisations for the clic detector concept is presented | [['the', 'compact', 'linear', 'collider', 'clic', 'is', 'a', 'concept', 'for', 'a', 'future', 'linear', 'collider', 'that', 'would', 'provide', 'ee', 'collisions', 'at', 'up', 'to', '3', 'tev', 'the', 'physics', 'aims', 'require', 'a', 'detector', 'system', 'with', 'excellent', 'jet', 'energy', 'and', 'track', 'momentum', 'resolution', 'highly', 'efficient', 'flavour', 'tagging', 'and', 'lepton', 'identification', 'capabilities', 'full', 'geometrical', 'coverage', 'extending', 'to', 'low', 'polar', 'angles', 'and', 'timing', 'information', 'of', 'the', 'order', 'of', 'nanoseconds', 'to', 'reject', 'beaminduced', 'background', 'to', 'deal', 'with', 'these', 'requirements', 'an', 'extensive', 'rd', 'programme', 'is', 'in', 'place', 'to', 'overcome', 'current', 'technological', 'limits', 'the', 'clic', 'detector', 'concept', 'includes', 'a', 'lowmass', 'allsilicon', 'vertex', 'and', 'tracking', 'detector', 'system', 'and', 'finegrained', 'calorimeters', 'designed', 'for', 'particle', 'flow', 'analysis', 'techniques', 'surrounded', 'by', 'a', '4', 't', 'solenoid', 'magnet', 'an', 'overview', 'of', 'the', 'requirements', 'and', 'design', 'optimisations', 'for', 'the', 'clic', 'detector', 'concept', 'is', 'presented']] | [-0.11049990373018279, 0.12862851722445523, -0.062340393002460325, 0.06125939366000697, -0.1176637831074369, -0.19236007703497537, -0.043789528236966434, 0.36678688301462825, -0.19434630716087545, -0.36077874168152296, 0.08105027287974807, -0.31774209049625657, 0.04088011949403784, 0.1932103186836613, -0.013232575025497458, 0.1423890596020996, 0.12923805549095466, -0.0414076350914868, -0.08315176407872575, -0.17992270989783518, 0.2036574401372061, 0.231483842572564, 0.2612740613628311, 0.07793799851925706, 0.18391096630082357, 0.012299211404293658, -0.0676828307854965, -0.00993289148772326, -0.09406055249902832, 0.08129737718240725, 0.34499843520896994, 0.15587783019300402, 0.19213707624076623, -0.4079736251032024, -0.1274084722711228, 0.06226070869831354, 0.0872279724590187, 0.024371646285995724, -0.10293005775718943, -0.29452312417973686, 0.1164023959711304, -0.2564542520879291, -0.1610192698059882, -0.04106832260181614, -0.018408525401477034, -0.020561697528932214, -0.2812127303992083, -0.06101100025405213, 0.06192897330588243, 0.0535230594870495, 0.006736108530899437, -0.12222452521668821, 0.04362521647644325, 0.016934976722370453, -0.010864572100869314, 0.052643951779326764, 0.20321223286336185, -0.1588147443941039, -0.18716327496437635, 0.3400454106997317, 0.021797424246461725, -0.18625009922296043, 0.23247888660073046, -0.2035561211033189, -0.12358335455087578, 0.18407616711507632, 0.2978662203000052, 0.048213900638905564, -0.23125995686791073, 0.09708789159570395, 0.07681871614030261, 0.1963678000725835, 0.04264048137702048, 0.08580008970470879, 0.2594488810703862, 0.3206209380502307, 0.1521113188226898, 0.10008098736889368, -0.14506603946623312, 0.006424153185134211, -0.391179185741999, -0.11343922833068751, -0.07185005831832844, 0.00926441424361276, -0.012295295150013728, -0.06494991449037875, 0.3905356068926768, 0.11939291416586736, 0.17716189375601885, -0.01258129703511638, 0.34232816913377817, 0.010265017821138181, 0.07714206059729152, 0.04565459671022378, 0.2664951148807753, 0.10681727308391292, 0.19242198347649353, -0.22252851083973701, -0.0009841854411005923, 0.03846799217413847] |
1,802.06009 | Dropout Model Evaluation in MOOCs | The field of learning analytics needs to adopt a more rigorous approach for
predictive model evaluation that matches the complex practice of
model-building. In this work, we present a procedure to statistically test
hypotheses about model performance which goes beyond the state-of-the-practice
in the community to analyze both algorithms and feature extraction methods from
raw data. We apply this method to a series of algorithms and feature sets
derived from a large sample of Massive Open Online Courses (MOOCs). While a
complete comparison of all potential modeling approaches is beyond the scope of
this paper, we show that this approach reveals a large gap in dropout
prediction performance between forum-, assignment-, and clickstream-based
feature extraction methods, where the latter is significantly better than the
former two, which are in turn indistinguishable from one another. This work has
methodological implications for evaluating predictive or AI-based models of
student success, and practical implications for the design and targeting of
at-risk student models and interventions.
| stat.AP cs.CY stat.ME stat.ML | the field of learning analytics needs to adopt a more rigorous approach for predictive model evaluation that matches the complex practice of modelbuilding in this work we present a procedure to statistically test hypotheses about model performance which goes beyond the stateofthepractice in the community to analyze both algorithms and feature extraction methods from raw data we apply this method to a series of algorithms and feature sets derived from a large sample of massive open online courses moocs while a complete comparison of all potential modeling approaches is beyond the scope of this paper we show that this approach reveals a large gap in dropout prediction performance between forum assignment and clickstreambased feature extraction methods where the latter is significantly better than the former two which are in turn indistinguishable from one another this work has methodological implications for evaluating predictive or aibased models of student success and practical implications for the design and targeting of atrisk student models and interventions | [['the', 'field', 'of', 'learning', 'analytics', 'needs', 'to', 'adopt', 'a', 'more', 'rigorous', 'approach', 'for', 'predictive', 'model', 'evaluation', 'that', 'matches', 'the', 'complex', 'practice', 'of', 'modelbuilding', 'in', 'this', 'work', 'we', 'present', 'a', 'procedure', 'to', 'statistically', 'test', 'hypotheses', 'about', 'model', 'performance', 'which', 'goes', 'beyond', 'the', 'stateofthepractice', 'in', 'the', 'community', 'to', 'analyze', 'both', 'algorithms', 'and', 'feature', 'extraction', 'methods', 'from', 'raw', 'data', 'we', 'apply', 'this', 'method', 'to', 'a', 'series', 'of', 'algorithms', 'and', 'feature', 'sets', 'derived', 'from', 'a', 'large', 'sample', 'of', 'massive', 'open', 'online', 'courses', 'moocs', 'while', 'a', 'complete', 'comparison', 'of', 'all', 'potential', 'modeling', 'approaches', 'is', 'beyond', 'the', 'scope', 'of', 'this', 'paper', 'we', 'show', 'that', 'this', 'approach', 'reveals', 'a', 'large', 'gap', 'in', 'dropout', 'prediction', 'performance', 'between', 'forum', 'assignment', 'and', 'clickstreambased', 'feature', 'extraction', 'methods', 'where', 'the', 'latter', 'is', 'significantly', 'better', 'than', 'the', 'former', 'two', 'which', 'are', 'in', 'turn', 'indistinguishable', 'from', 'one', 'another', 'this', 'work', 'has', 'methodological', 'implications', 'for', 'evaluating', 'predictive', 'or', 'aibased', 'models', 'of', 'student', 'success', 'and', 'practical', 'implications', 'for', 'the', 'design', 'and', 'targeting', 'of', 'atrisk', 'student', 'models', 'and', 'interventions']] | [-0.0015575784657682692, -0.011272254714493564, -0.11487950735598201, 0.08580206184407915, -0.09575662309859202, -0.16821027023613638, 0.09928628167365995, 0.3922144667656155, -0.21924933234680882, -0.34011095143299297, 0.0738667628002246, -0.2746204172871336, -0.1811673154675558, 0.22415102469468756, -0.08045811815222043, 0.05230657497756414, 0.1161026758986369, 0.019002098283551126, -0.06819322586973539, -0.27475441184172533, 0.30752464029099214, 0.07231121960888554, 0.3328750483020677, 0.03105170706067211, 0.0555986379662251, -0.021770366228558703, -0.07209134912870316, 0.009303804155820923, -0.0883747073970858, 0.19143702420955583, 0.31112379081727487, 0.21848269334490994, 0.3804106846544313, -0.3600796970900966, -0.21180377561043692, 0.08866597725633786, 0.15276289006741428, 0.1373930047642185, -0.03901454598841009, -0.28278571323734586, 0.07375521414193052, -0.17765347409837226, -0.05815594089767022, -0.11007920573957218, -0.015117380733714549, -0.046426832486126245, -0.284013338505597, 0.03799398761475459, 0.07709877170703333, 0.08597191437060789, -0.05243330829348762, -0.1515789596531656, 0.06766835532602362, 0.15755549700994345, 0.08498307720610514, 0.03265755275056136, 0.11614766888470845, -0.1880020350434742, -0.14582743052312214, 0.3828559219027343, -0.03608321976135355, -0.16763599903860726, 0.21018410449188132, -0.08253670389538412, -0.17292586372447957, 0.07493549877718403, 0.24782559512217778, 0.10521322928993783, -0.18775062214782728, 0.04446871278978167, -0.0016977399014954612, 0.16599041987022511, 0.0025999438587391045, -0.015172054827710764, 0.18546110354306072, 0.2527876039966941, 0.030271057612175897, 0.1100001372396946, -0.06058650212116563, -0.0999868348246637, -0.26560461597505564, -0.150908686637138, -0.14394679562093238, -0.0147235342619582, -0.0804206511659782, -0.15271926198663735, 0.41317393341512415, 0.25264018728334153, 0.17086492419265997, 0.0928106035889699, 0.3303286543590312, 0.045884802769753874, 0.07722540240104293, 0.09523343289652782, 0.20314756490186042, 0.03789777595619237, 0.10736685217884571, -0.15022354016676315, 0.0641365497566829, -0.01198363773125623] |
1,802.0601 | Hitting Probabilities of a Brownian flow with Radial Drift | We consider a stochastic flow $\phi_t(x,\omega)$ in $\mathbb{R}^n$ with
initial point $\phi_0(x,\omega)=x$, driven by a single $n$-dimensional Brownian
motion, and with an outward radial drift of magnitude $\frac{
F(\|\phi_t(x)\|)}{\|\phi_t(x)\|}$, with $F$ nonnegative, bounded and Lipschitz.
We consider initial points $x$ lying in a set of positive distance from the
origin. We show that there exist constants $C^*,c^*>0$ not depending on $n$,
such that if $F>C^*n$ then the image of the initial set under the flow has
probability 0 of hitting the origin. If $0\leq F \leq c^*n^{3/4}$, and if the
initial set has nonempty interior, then the image of the set has positive
probability of hitting the origin.
| math.PR | we consider a stochastic flow phi_txomega in mathbbrn with initial point phi_0xomegax driven by a single ndimensional brownian motion and with an outward radial drift of magnitude frac fphi_txphi_tx with f nonnegative bounded and lipschitz we consider initial points x lying in a set of positive distance from the origin we show that there exist constants cc0 not depending on n such that if fcn then the image of the initial set under the flow has probability 0 of hitting the origin if 0leq f leq cn34 and if the initial set has nonempty interior then the image of the set has positive probability of hitting the origin | [['we', 'consider', 'a', 'stochastic', 'flow', 'phi_txomega', 'in', 'mathbbrn', 'with', 'initial', 'point', 'phi_0xomegax', 'driven', 'by', 'a', 'single', 'ndimensional', 'brownian', 'motion', 'and', 'with', 'an', 'outward', 'radial', 'drift', 'of', 'magnitude', 'frac', 'fphi_txphi_tx', 'with', 'f', 'nonnegative', 'bounded', 'and', 'lipschitz', 'we', 'consider', 'initial', 'points', 'x', 'lying', 'in', 'a', 'set', 'of', 'positive', 'distance', 'from', 'the', 'origin', 'we', 'show', 'that', 'there', 'exist', 'constants', 'cc0', 'not', 'depending', 'on', 'n', 'such', 'that', 'if', 'fcn', 'then', 'the', 'image', 'of', 'the', 'initial', 'set', 'under', 'the', 'flow', 'has', 'probability', '0', 'of', 'hitting', 'the', 'origin', 'if', '0leq', 'f', 'leq', 'cn34', 'and', 'if', 'the', 'initial', 'set', 'has', 'nonempty', 'interior', 'then', 'the', 'image', 'of', 'the', 'set', 'has', 'positive', 'probability', 'of', 'hitting', 'the', 'origin']] | [-0.1450974358818852, 0.13435935424856255, -0.04075247902745524, -0.04161568808306653, -0.018030128477571104, -0.12968076121223232, 0.03281020133111339, 0.3865802647331013, -0.32448319506007606, -0.18616714909260806, 0.10304773706145799, -0.32422748949522007, -0.07728293510109115, 0.13489080944250767, -0.05171026023051057, 0.05863311921712011, 0.0608475059360409, 0.12508038074996036, -0.06364181149715128, -0.23104323897636136, 0.37871855658998427, -0.12508367673637202, 0.14988312138638532, 0.03451083408603713, 0.18204309724163836, -0.0380010805092752, 0.053502136254862234, 0.03553677370879226, -0.21662775571796652, 0.049285457825485185, 0.1524685736020239, 0.16701712951404402, 0.32061493609888625, -0.39763738782718205, -0.17614386670398885, 0.23475943095623875, 0.12706685439619692, -0.014803514260655412, -0.06981376575220985, -0.27067530784272376, 0.14386241482302117, -0.05628188701274876, -0.17739659566163588, 0.010217045740528893, 0.15044554782798514, 0.05512490535441499, -0.3175763096705151, 0.06714074862583612, 0.09922608961978067, 0.03217320889234543, -0.10722820542287081, -0.1541784420931855, -0.08594578842166811, 0.10211253228883904, 0.040875236640344016, 0.13531410952250902, 0.09474189398147595, -0.07545289193960623, -0.06264338240278168, 0.3461213489645161, -0.09546006663451688, -0.27571378620968273, 0.1334196038884469, -0.24924172296036537, -0.09344454714132902, 0.1411781151299902, 0.15459142941892004, 0.1426515906708888, -0.08295327075757086, 0.18725191841020625, -0.1000957861632252, 0.15452855997500592, 0.13107610253679852, -0.015218631910661666, 0.18394142052140802, 0.127545006492605, 0.15635073212727618, 0.10497678136184382, -0.12160290824921013, -0.027345714239905086, -0.3732803854822683, -0.1008394522650633, -0.22699091415583658, 0.17224801556767488, -0.11977260689155418, -0.19126868847972497, 0.32424355775471597, 0.12010646714434887, 0.24700006522023335, 0.07795335006756851, 0.22467499555876622, 0.11718209957885287, -0.04631528324590853, 0.15344539872827367, 0.12966272475806853, 0.07688926271601723, 0.029436186184354413, -0.17655274162881632, 0.09412120721446207, 0.10156645288714991] |
1,802.06011 | A necessary condition for quantum adiabaticity applied to the adiabatic
Grover search | Numerous sufficient conditions for adiabaticity of the evolution of a driven
quantum system have been known for quite a long time. In contrast, necessary
adiabatic conditions are scarce. A practicable necessary condition well-suited
for many-body systems has been proven recently in [Phys. Rev. Lett. 119, 200401
(2017)]. Here we tailor this condition for estimating run times of quantum
adiabatic algorithms. As an illustration, the condition is applied to the
adiabatic algorithm for searching in an unstructured database (adiabatic Grover
search algorithm). We find that thus obtained lower bound on the run time of
this algorithm reproduces $\sqrt N$ scaling ($N$ being the number of database
entries) of the explicitly known optimal run time. This observation highlights
the merits of the new adiabatic condition and its potential relevance to
adiabatic quantum computing.
| quant-ph | numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time in contrast necessary adiabatic conditions are scarce a practicable necessary condition wellsuited for manybody systems has been proven recently in phys rev lett 119 200401 2017 here we tailor this condition for estimating run times of quantum adiabatic algorithms as an illustration the condition is applied to the adiabatic algorithm for searching in an unstructured database adiabatic grover search algorithm we find that thus obtained lower bound on the run time of this algorithm reproduces sqrt n scaling n being the number of database entries of the explicitly known optimal run time this observation highlights the merits of the new adiabatic condition and its potential relevance to adiabatic quantum computing | [['numerous', 'sufficient', 'conditions', 'for', 'adiabaticity', 'of', 'the', 'evolution', 'of', 'a', 'driven', 'quantum', 'system', 'have', 'been', 'known', 'for', 'quite', 'a', 'long', 'time', 'in', 'contrast', 'necessary', 'adiabatic', 'conditions', 'are', 'scarce', 'a', 'practicable', 'necessary', 'condition', 'wellsuited', 'for', 'manybody', 'systems', 'has', 'been', 'proven', 'recently', 'in', 'phys', 'rev', 'lett', '119', '200401', '2017', 'here', 'we', 'tailor', 'this', 'condition', 'for', 'estimating', 'run', 'times', 'of', 'quantum', 'adiabatic', 'algorithms', 'as', 'an', 'illustration', 'the', 'condition', 'is', 'applied', 'to', 'the', 'adiabatic', 'algorithm', 'for', 'searching', 'in', 'an', 'unstructured', 'database', 'adiabatic', 'grover', 'search', 'algorithm', 'we', 'find', 'that', 'thus', 'obtained', 'lower', 'bound', 'on', 'the', 'run', 'time', 'of', 'this', 'algorithm', 'reproduces', 'sqrt', 'n', 'scaling', 'n', 'being', 'the', 'number', 'of', 'database', 'entries', 'of', 'the', 'explicitly', 'known', 'optimal', 'run', 'time', 'this', 'observation', 'highlights', 'the', 'merits', 'of', 'the', 'new', 'adiabatic', 'condition', 'and', 'its', 'potential', 'relevance', 'to', 'adiabatic', 'quantum', 'computing']] | [-0.1459632987149401, 0.10897894598075317, -0.09626811378429295, 0.04527893848894946, -0.027911082091421343, -0.16199876379065273, 0.06789312801210082, 0.35370560963673675, -0.2059150234092283, -0.354310495323921, 0.09104294312908136, -0.1595124186901731, -0.13757253001365838, 0.2522550682583468, -0.06047342575816367, 0.1580238447253064, 0.06981109391954791, 0.01692004252104302, -0.05625473280465728, -0.2956169541242696, 0.18514903346769768, 0.10539950863973643, 0.272434305120615, 0.05886306928982603, 0.054251217320632504, -0.009261613097646138, -0.007056276735632844, -0.052021106285618915, -0.17301787079680925, 0.011662576282716832, 0.23281700644848285, 0.13922345108540998, 0.29208383878394395, -0.45448718369824687, -0.16429662752811236, 0.14905624072963217, 0.1335800824302981, 0.1604559788096497, -0.061770992137612564, -0.3028132827198915, 0.06582330495566983, -0.15309192928243856, -0.1507902297667647, -0.14075708418252758, 0.13946496341190875, -0.03475767965179705, -0.3005730924089901, 0.0904856672437634, 0.07472744435143039, 0.029699854737588467, -0.028287600751660535, -0.07059856409203431, 0.06449124541929888, 0.06781208870633867, -0.029415041750353824, 0.023740953668944877, 0.09910119865942775, -0.07786724952277052, -0.14695767348566455, 0.3754414873737984, -0.036865930533292526, -0.12215019615708303, 0.18489388156085068, -0.0490899903749521, -0.17061645992034477, 0.10836647685531897, 0.15838512897718954, 0.15199967324449362, -0.18052719747434362, 0.15487727866897302, -0.03557977636650432, 0.12679890409300373, 0.08203206951676634, 0.047064373253681166, 0.11365534093600647, 0.14888431335166666, 0.070153271662114, 0.121782589398097, -0.07603765554719015, -0.14068059120433873, -0.3015237009963234, -0.17355693975651906, -0.2661894882339558, 0.05680435614745694, -0.04318203070396042, -0.1360149657094268, 0.3675571020891648, 0.19699265048590325, 0.18000784821324903, 0.04303201070439269, 0.2726742804249507, 0.13678988012821122, 0.003498909666153197, 0.14659851951745004, 0.22633308353691667, 0.12995409607204772, 0.12493578414610437, -0.24312372873572788, 0.06138044261935217, 0.04987609651622199] |
1,802.06012 | WebEye - Automated Collection of Malicious HTTP Traffic | With malware detection techniques increasingly adopting machine learning
approaches, the creation of precise training sets becomes more and more
important. Large data sets of realistic web traffic, correctly classified as
benign or malicious are needed, not only to train classic and deep learning
algorithms, but also to serve as evaluation benchmarks for existing malware
detection products. Interestingly, despite the vast number and versatility of
threats a user may encounter when browsing the web, actual malicious content is
often hard to come by, since prerequisites such as browser and operating system
type and version must be met in order to receive the payload from a malware
distributing server. In combination with privacy constraints on data sets of
actual user traffic, it is difficult for researchers and product developers to
evaluate anti-malware solutions against large-scale data sets of realistic web
traffic. In this paper we present WebEye, a framework that autonomously creates
realistic HTTP traffic, enriches recorded traffic with additional information,
and classifies records as malicious or benign, using different classifiers. We
are using WebEye to collect malicious HTML and JavaScript and show how datasets
created with WebEye can be used to train machine learning based malware
detection algorithms. We regard WebEye and the data sets it creates as a tool
for researchers and product developers to evaluate and improve their AI-based
anti-malware solutions against large-scale benchmarks.
| cs.CR cs.LG | with malware detection techniques increasingly adopting machine learning approaches the creation of precise training sets becomes more and more important large data sets of realistic web traffic correctly classified as benign or malicious are needed not only to train classic and deep learning algorithms but also to serve as evaluation benchmarks for existing malware detection products interestingly despite the vast number and versatility of threats a user may encounter when browsing the web actual malicious content is often hard to come by since prerequisites such as browser and operating system type and version must be met in order to receive the payload from a malware distributing server in combination with privacy constraints on data sets of actual user traffic it is difficult for researchers and product developers to evaluate antimalware solutions against largescale data sets of realistic web traffic in this paper we present webeye a framework that autonomously creates realistic http traffic enriches recorded traffic with additional information and classifies records as malicious or benign using different classifiers we are using webeye to collect malicious html and javascript and show how datasets created with webeye can be used to train machine learning based malware detection algorithms we regard webeye and the data sets it creates as a tool for researchers and product developers to evaluate and improve their aibased antimalware solutions against largescale benchmarks | [['with', 'malware', 'detection', 'techniques', 'increasingly', 'adopting', 'machine', 'learning', 'approaches', 'the', 'creation', 'of', 'precise', 'training', 'sets', 'becomes', 'more', 'and', 'more', 'important', 'large', 'data', 'sets', 'of', 'realistic', 'web', 'traffic', 'correctly', 'classified', 'as', 'benign', 'or', 'malicious', 'are', 'needed', 'not', 'only', 'to', 'train', 'classic', 'and', 'deep', 'learning', 'algorithms', 'but', 'also', 'to', 'serve', 'as', 'evaluation', 'benchmarks', 'for', 'existing', 'malware', 'detection', 'products', 'interestingly', 'despite', 'the', 'vast', 'number', 'and', 'versatility', 'of', 'threats', 'a', 'user', 'may', 'encounter', 'when', 'browsing', 'the', 'web', 'actual', 'malicious', 'content', 'is', 'often', 'hard', 'to', 'come', 'by', 'since', 'prerequisites', 'such', 'as', 'browser', 'and', 'operating', 'system', 'type', 'and', 'version', 'must', 'be', 'met', 'in', 'order', 'to', 'receive', 'the', 'payload', 'from', 'a', 'malware', 'distributing', 'server', 'in', 'combination', 'with', 'privacy', 'constraints', 'on', 'data', 'sets', 'of', 'actual', 'user', 'traffic', 'it', 'is', 'difficult', 'for', 'researchers', 'and', 'product', 'developers', 'to', 'evaluate', 'antimalware', 'solutions', 'against', 'largescale', 'data', 'sets', 'of', 'realistic', 'web', 'traffic', 'in', 'this', 'paper', 'we', 'present', 'webeye', 'a', 'framework', 'that', 'autonomously', 'creates', 'realistic', 'http', 'traffic', 'enriches', 'recorded', 'traffic', 'with', 'additional', 'information', 'and', 'classifies', 'records', 'as', 'malicious', 'or', 'benign', 'using', 'different', 'classifiers', 'we', 'are', 'using', 'webeye', 'to', 'collect', 'malicious', 'html', 'and', 'javascript', 'and', 'show', 'how', 'datasets', 'created', 'with', 'webeye', 'can', 'be', 'used', 'to', 'train', 'machine', 'learning', 'based', 'malware', 'detection', 'algorithms', 'we', 'regard', 'webeye', 'and', 'the', 'data', 'sets', 'it', 'creates', 'as', 'a', 'tool', 'for', 'researchers', 'and', 'product', 'developers', 'to', 'evaluate', 'and', 'improve', 'their', 'aibased', 'antimalware', 'solutions', 'against', 'largescale', 'benchmarks']] | [-0.08534374775028684, -0.00433035558503535, -0.052773255267077025, 0.111261693084509, -0.15456837405554122, -0.2420806896314025, 0.08729347044343336, 0.3968481388170686, -0.24701752622922263, -0.39612093675053783, 0.1319848336864056, -0.33632300530819015, -0.1253427995182574, 0.24752108083417018, -0.1463425556321939, 0.09408078044032057, 0.10670998303633597, 0.043605366617234215, 0.004824431245732639, -0.32770690029280053, 0.3297684785578814, 0.03885976266206449, 0.33573692726592225, 0.04946794230904844, 0.036968256898690016, -0.001284027419363459, -0.07226116688818568, -0.0056364844263427786, -0.02767549453733308, 0.1158244179116769, 0.38883538555444425, 0.30171024276357555, 0.29035476952687733, -0.4453413335316711, -0.17559197855906353, 0.1187660656000177, 0.15327423226295245, 0.11799330198988577, -0.04958229763342792, -0.3768403324153688, 0.1469265860091481, -0.24460545192162195, -0.04097924045183592, -0.16735568701806997, -0.009556830118462029, 0.030441601059089104, -0.25687199432803837, -0.048534679896224085, -0.021769735744326477, 0.0937154672253463, -0.006772547559812665, -0.04894635942402399, -0.014754425512833728, 0.19934050772817702, 0.10326082528672284, -0.004675085154982905, 0.2191819214220676, -0.15136558532967076, -0.14226656993851067, 0.3755950541504555, -0.008364936641624405, -0.14432022600745162, 0.24198222453912926, 0.04404578658234742, -0.14676839475209513, 0.09459755466630061, 0.27638044024093283, 0.08475537144268552, -0.19600883994232088, -0.014050866435281932, 0.006575544704165724, 0.19309757715711992, 0.06371058803258671, 0.0007636390936871369, 0.18432415104160707, 0.22369609388936726, 0.052624969618498454, 0.13138635574012167, -0.07104803928253306, -0.04135546917302741, -0.18375933793528626, -0.11451933670763133, -0.1578305299569749, 0.004109337734019694, -0.07592064391433571, -0.18508731501383913, 0.349320814817523, 0.23169286838266998, 0.13396279596309696, 0.0609416143844525, 0.39624996739129226, -0.0311005902556806, 0.13370841160313124, 0.16069031750162444, 0.11843911744498958, -0.05001813831305804, 0.18576809121657992, -0.0968770100760998, 0.13484088624206683, -0.032219147242657425] |
1,802.06013 | A hybridizable discontinuous Galerkin method for two-phase flow in
heterogeneous porous media | We present a new method for simulating incompressible immiscible two-phase
flow in porous media. The semi-implicit method decouples the wetting phase
pressure and saturation equations. The equations are discretized using a
hybridizable discontinuous Galerkin (HDG) method. The proposed method is of
high order, conserves global/local mass balance, and the number of globally
coupled degrees of freedom is significantly reduced compared to standard
interior penalty discontinuous Galerkin methods. Several numerical examples
illustrate the accuracy and robustness of the method. These examples include
verification of convergence rates by manufactured solutions, common 1D
benchmarks and realistic discontinuous permeability fields.
| cs.CE physics.comp-ph | we present a new method for simulating incompressible immiscible twophase flow in porous media the semiimplicit method decouples the wetting phase pressure and saturation equations the equations are discretized using a hybridizable discontinuous galerkin hdg method the proposed method is of high order conserves globallocal mass balance and the number of globally coupled degrees of freedom is significantly reduced compared to standard interior penalty discontinuous galerkin methods several numerical examples illustrate the accuracy and robustness of the method these examples include verification of convergence rates by manufactured solutions common 1d benchmarks and realistic discontinuous permeability fields | [['we', 'present', 'a', 'new', 'method', 'for', 'simulating', 'incompressible', 'immiscible', 'twophase', 'flow', 'in', 'porous', 'media', 'the', 'semiimplicit', 'method', 'decouples', 'the', 'wetting', 'phase', 'pressure', 'and', 'saturation', 'equations', 'the', 'equations', 'are', 'discretized', 'using', 'a', 'hybridizable', 'discontinuous', 'galerkin', 'hdg', 'method', 'the', 'proposed', 'method', 'is', 'of', 'high', 'order', 'conserves', 'globallocal', 'mass', 'balance', 'and', 'the', 'number', 'of', 'globally', 'coupled', 'degrees', 'of', 'freedom', 'is', 'significantly', 'reduced', 'compared', 'to', 'standard', 'interior', 'penalty', 'discontinuous', 'galerkin', 'methods', 'several', 'numerical', 'examples', 'illustrate', 'the', 'accuracy', 'and', 'robustness', 'of', 'the', 'method', 'these', 'examples', 'include', 'verification', 'of', 'convergence', 'rates', 'by', 'manufactured', 'solutions', 'common', '1d', 'benchmarks', 'and', 'realistic', 'discontinuous', 'permeability', 'fields']] | [-0.09742336682878279, 0.06390250407275744, -0.0714435962048204, -0.01991806858131895, -0.060877743725238055, -0.1666485106688924, -0.022034780364871647, 0.34403301784186624, -0.2720839149163415, -0.28194191072058555, 0.12632456161736627, -0.2540343245976449, -0.10784382944984827, 0.17069098654428672, -0.08133895173765875, 0.16753879539707364, 0.08289654646068811, -0.12310028031546001, -0.13523134821055768, -0.2291363000210064, 0.28164405935967807, -0.047211307362886146, 0.3240664102777373, 0.03218345987261273, 0.17456975438593267, -0.15254914324517208, -0.03224583876241619, 0.08541008295530143, -0.12984561365738045, 0.05373887902290638, 0.24237510182865663, 0.0013945336783460032, 0.3231591387690666, -0.43504171379026957, -0.28834768941548344, 0.03892150411775219, 0.12826422391178008, 0.13112195687911785, -0.10211056480572249, -0.28463040584513993, 0.05623490010718039, -0.18888811122936508, -0.16625696236102763, -0.18572754987690132, -0.1071935064731709, 0.08569224107001598, -0.3289950314598779, 0.17090016097245098, 0.01836454646763741, 0.06113408850311922, -0.08868149745103437, -0.1317935046099592, -0.0524294169008499, 0.027708839916158468, 0.022458695802924922, -0.05748689292037549, 0.0863355171798806, -0.10468205183375782, -0.04279223953684171, 0.41086653076248086, -0.06911151539801115, -0.3107072055766669, 0.2486871024593711, -0.04956537004424414, -0.03363709147864332, 0.24556192703312263, 0.24505992499083126, 0.23460822881922164, -0.1146238427706218, 0.051907166326903585, 0.004922025788497801, 0.17490063584409654, 0.041637848330234796, -0.08944317239608306, 0.05452454424509293, 0.24001917908511436, 0.0884926389408065, 0.11309576448790419, -0.07876342346329086, -0.16893341627777167, -0.3311093785547807, -0.17989866146429753, -0.17900241929358648, -0.08326268986032422, -0.21299941332290473, -0.20112539201121157, 0.3847697302783975, 0.1934338053482255, 0.03065365929796826, 0.04724474111086844, 0.36213594744594957, 0.1256489605390622, -0.006651108754643549, 0.12555037749795397, 0.23168141879917434, 0.18791609866457293, 0.16065266737132333, -0.29651532114561024, 0.03266671146654213, 0.22379868787538726] |
1,802.06014 | Orthogonality-Promoting Distance Metric Learning: Convex Relaxation and
Theoretical Analysis | Distance metric learning (DML), which learns a distance metric from labeled
"similar" and "dissimilar" data pairs, is widely utilized. Recently, several
works investigate orthogonality-promoting regularization (OPR), which
encourages the projection vectors in DML to be close to being orthogonal, to
achieve three effects: (1) high balancedness -- achieving comparable
performance on both frequent and infrequent classes; (2) high compactness --
using a small number of projection vectors to achieve a "good" metric; (3) good
generalizability -- alleviating overfitting to training data. While showing
promising results, these approaches suffer three problems. First, they involve
solving non-convex optimization problems where achieving the global optimal is
NP-hard. Second, it lacks a theoretical understanding why OPR can lead to
balancedness. Third, the current generalization error analysis of OPR is not
directly on the regularizer. In this paper, we address these three issues by
(1) seeking convex relaxations of the original nonconvex problems so that the
global optimal is guaranteed to be achievable; (2) providing a formal analysis
on OPR's capability of promoting balancedness; (3) providing a theoretical
analysis that directly reveals the relationship between OPR and generalization
performance. Experiments on various datasets demonstrate that our convex
methods are more effective in promoting balancedness, compactness, and
generalization, and are computationally more efficient, compared with the
nonconvex methods.
| cs.LG stat.ML | distance metric learning dml which learns a distance metric from labeled similar and dissimilar data pairs is widely utilized recently several works investigate orthogonalitypromoting regularization opr which encourages the projection vectors in dml to be close to being orthogonal to achieve three effects 1 high balancedness achieving comparable performance on both frequent and infrequent classes 2 high compactness using a small number of projection vectors to achieve a good metric 3 good generalizability alleviating overfitting to training data while showing promising results these approaches suffer three problems first they involve solving nonconvex optimization problems where achieving the global optimal is nphard second it lacks a theoretical understanding why opr can lead to balancedness third the current generalization error analysis of opr is not directly on the regularizer in this paper we address these three issues by 1 seeking convex relaxations of the original nonconvex problems so that the global optimal is guaranteed to be achievable 2 providing a formal analysis on oprs capability of promoting balancedness 3 providing a theoretical analysis that directly reveals the relationship between opr and generalization performance experiments on various datasets demonstrate that our convex methods are more effective in promoting balancedness compactness and generalization and are computationally more efficient compared with the nonconvex methods | [['distance', 'metric', 'learning', 'dml', 'which', 'learns', 'a', 'distance', 'metric', 'from', 'labeled', 'similar', 'and', 'dissimilar', 'data', 'pairs', 'is', 'widely', 'utilized', 'recently', 'several', 'works', 'investigate', 'orthogonalitypromoting', 'regularization', 'opr', 'which', 'encourages', 'the', 'projection', 'vectors', 'in', 'dml', 'to', 'be', 'close', 'to', 'being', 'orthogonal', 'to', 'achieve', 'three', 'effects', '1', 'high', 'balancedness', 'achieving', 'comparable', 'performance', 'on', 'both', 'frequent', 'and', 'infrequent', 'classes', '2', 'high', 'compactness', 'using', 'a', 'small', 'number', 'of', 'projection', 'vectors', 'to', 'achieve', 'a', 'good', 'metric', '3', 'good', 'generalizability', 'alleviating', 'overfitting', 'to', 'training', 'data', 'while', 'showing', 'promising', 'results', 'these', 'approaches', 'suffer', 'three', 'problems', 'first', 'they', 'involve', 'solving', 'nonconvex', 'optimization', 'problems', 'where', 'achieving', 'the', 'global', 'optimal', 'is', 'nphard', 'second', 'it', 'lacks', 'a', 'theoretical', 'understanding', 'why', 'opr', 'can', 'lead', 'to', 'balancedness', 'third', 'the', 'current', 'generalization', 'error', 'analysis', 'of', 'opr', 'is', 'not', 'directly', 'on', 'the', 'regularizer', 'in', 'this', 'paper', 'we', 'address', 'these', 'three', 'issues', 'by', '1', 'seeking', 'convex', 'relaxations', 'of', 'the', 'original', 'nonconvex', 'problems', 'so', 'that', 'the', 'global', 'optimal', 'is', 'guaranteed', 'to', 'be', 'achievable', '2', 'providing', 'a', 'formal', 'analysis', 'on', 'oprs', 'capability', 'of', 'promoting', 'balancedness', '3', 'providing', 'a', 'theoretical', 'analysis', 'that', 'directly', 'reveals', 'the', 'relationship', 'between', 'opr', 'and', 'generalization', 'performance', 'experiments', 'on', 'various', 'datasets', 'demonstrate', 'that', 'our', 'convex', 'methods', 'are', 'more', 'effective', 'in', 'promoting', 'balancedness', 'compactness', 'and', 'generalization', 'and', 'are', 'computationally', 'more', 'efficient', 'compared', 'with', 'the', 'nonconvex', 'methods']] | [-0.07340912745583748, -0.013979625422507524, -0.06317274086400154, 0.133153470721303, -0.11211883532480475, -0.18137609678416391, 0.05495278442414415, 0.4036165146941417, -0.28027544407681987, -0.3381613363382634, 0.12681710634338247, -0.26952121157921033, -0.15746111074756636, 0.18063052606370086, -0.14588142001475587, 0.09501502332700924, 0.10209614187899563, -0.008002379075869134, -0.12819935068539365, -0.301247025166001, 0.2830148889843606, 0.055776715672989356, 0.3305082574005475, 0.06014121167192405, 0.10407829296810811, -0.06382439190045035, -0.00010599072439970368, 0.04076387048988608, -0.06821063438952765, 0.18321485551348196, 0.3162349218727673, 0.20450261733427857, 0.3505540035183778, -0.37991042252525276, -0.19940780322000598, 0.12653906809825574, 0.130376148115594, 0.06861896836150128, -0.042979347266275746, -0.24692127569779113, 0.11379075950038348, -0.0977525648518363, -0.032408413506206574, -0.1611003327366125, -0.041392843114238895, -0.007959515258779028, -0.3078217739395298, 0.0786780858233863, 0.07759021388803515, 0.041640013395003755, -0.06867643556241214, -0.1643373653444163, 0.03903232013325443, 0.09743665154515342, 0.07391587412834243, 0.0915108773050803, 0.09737469038188583, -0.11475205055491455, -0.1219867435139136, 0.37707000132204527, -0.005608294532371409, -0.24751922870099402, 0.2448072770274017, -0.06379967837474135, -0.14098152343370912, 0.12697303719800768, 0.19255745616344885, 0.14154858963840317, -0.13549300506666445, 0.014311465914038113, -0.029005024972055374, 0.15808759206230863, 0.07297497037597642, 0.046488979940512105, 0.14177368714420668, 0.20672426186139922, 0.12917458472336735, 0.12599345159819395, -0.05645158187359233, -0.09213859050503473, -0.22136740165464044, -0.08622739911435894, -0.19522400753590408, -0.0040256297766564095, -0.13539384245730737, -0.10590038203041661, 0.35322120697482634, 0.16999434560824755, 0.20687600674829557, 0.10713255440517726, 0.3353952827404418, 0.051569493744259426, 0.06598061156925927, 0.1035738571003329, 0.260048493350807, 0.08249343435823668, 0.06107323764351032, -0.20146718238879766, 0.07920881779084615, 0.05780546312358533] |
1,802.06015 | Interdisciplinarity Revealed by Transitive Reduction of Citation Networks | We investigate the impact of transitive reduction on citation networks. Our hypothesis is that documents which lose fewer citations under transitive reduction are likely to be interdisciplinary, while a large loss of citations suggests a document is primarily cited within a single discipline. We test this hypothesis by using an artificial model of a citation network and by using data on citations from three sources: academic papers, court decisions and patents. Where needed, we applied modularity-based clustering techniques on a network defined using bibliographic coupling to classify documents by topic. A cluster-dependent measure was then used to classify the nodes as interdisciplinary or intradisciplinary. Our results provide strong support for our hypothesis in three of the four cases, with somewhat weaker but still positive support in the case of patents. | physics.soc-ph cs.DL cs.SI | we investigate the impact of transitive reduction on citation networks our hypothesis is that documents which lose fewer citations under transitive reduction are likely to be interdisciplinary while a large loss of citations suggests a document is primarily cited within a single discipline we test this hypothesis by using an artificial model of a citation network and by using data on citations from three sources academic papers court decisions and patents where needed we applied modularitybased clustering techniques on a network defined using bibliographic coupling to classify documents by topic a clusterdependent measure was then used to classify the nodes as interdisciplinary or intradisciplinary our results provide strong support for our hypothesis in three of the four cases with somewhat weaker but still positive support in the case of patents | [['we', 'investigate', 'the', 'impact', 'of', 'transitive', 'reduction', 'on', 'citation', 'networks', 'our', 'hypothesis', 'is', 'that', 'documents', 'which', 'lose', 'fewer', 'citations', 'under', 'transitive', 'reduction', 'are', 'likely', 'to', 'be', 'interdisciplinary', 'while', 'a', 'large', 'loss', 'of', 'citations', 'suggests', 'a', 'document', 'is', 'primarily', 'cited', 'within', 'a', 'single', 'discipline', 'we', 'test', 'this', 'hypothesis', 'by', 'using', 'an', 'artificial', 'model', 'of', 'a', 'citation', 'network', 'and', 'by', 'using', 'data', 'on', 'citations', 'from', 'three', 'sources', 'academic', 'papers', 'court', 'decisions', 'and', 'patents', 'where', 'needed', 'we', 'applied', 'modularitybased', 'clustering', 'techniques', 'on', 'a', 'network', 'defined', 'using', 'bibliographic', 'coupling', 'to', 'classify', 'documents', 'by', 'topic', 'a', 'clusterdependent', 'measure', 'was', 'then', 'used', 'to', 'classify', 'the', 'nodes', 'as', 'interdisciplinary', 'or', 'intradisciplinary', 'our', 'results', 'provide', 'strong', 'support', 'for', 'our', 'hypothesis', 'in', 'three', 'of', 'the', 'four', 'cases', 'with', 'somewhat', 'weaker', 'but', 'still', 'positive', 'support', 'in', 'the', 'case', 'of', 'patents']] | [-0.06889701290092207, 0.07067846022683914, -0.06426033584803502, 0.11745835541541753, -0.11364064275741924, -0.11975934846658809, 0.13334970612777397, 0.37594278844058976, -0.18798644810756163, -0.3313841017020881, 0.05509336250509287, -0.3294456775567328, -0.14807178030447501, 0.18628765659608928, -0.08916219062706124, 0.004469734768188277, 0.10616767397800157, 0.0689273263355302, 0.01763520131154751, -0.36663232565236586, 0.3436524044332463, 0.05305442903479633, 0.35323605206325764, 0.051646982501495575, 0.03994189983309615, -0.03713596973734251, -0.13637617898404655, 0.052560394215712826, -0.07116119802755515, 0.1610926893641703, 0.3033090833765852, 0.20955887550935726, 0.3585543113421331, -0.38366756584610817, -0.21317538200307262, 0.06558453585851447, 0.11588839707578454, 0.06870545690983909, -0.0026145056458623255, -0.3178631621701715, 0.10177803131961083, -0.20611952208054735, -0.028053208813793206, -0.07634017531680622, 0.04789551200937162, 0.02751203049732329, -0.23668414211557645, 0.055187562199006245, 0.05400816179349903, 0.15117190785475018, -0.018922864461259903, -0.11814708646401301, 0.0152471261405812, 0.13440177495890954, 0.10008514518290036, 0.05026691922531716, 0.13052299630272296, -0.11889574176256451, -0.16187861876908777, 0.38774497012874876, -0.05121580992988672, -0.20623628517916037, 0.17120794852646862, -0.07343495576173183, -0.1979719089387461, 0.06370666761730992, 0.22363928867893856, 0.0674347300587814, -0.17405646715345685, -0.015828744725815143, -0.06135848799518259, 0.1993106860927371, 0.07122381670985284, -0.04794064532719957, 0.1946337309326659, 0.18515271843454345, 0.03826411166535185, 0.14162787175087563, -0.04976990809772423, -0.040042308227758304, -0.22705023598590102, -0.11503605702855849, -0.192199282185716, 0.056193320721373424, -0.06784536008873789, -0.1747113396409112, 0.4224561544373458, 0.157904327807356, 0.14565733118459237, 0.05344544512548217, 0.24991663429857225, 0.012587902175854574, 0.1170595134761863, 0.10431971198828645, 0.2008667230983301, 0.06820709362099048, 0.11831890693288152, -0.07185402696017291, 0.10521289655332301, 0.015173839098347942] |
1,802.06016 | Quantum Anisotropic Sigma and Lambda Models as Spin Chains | We consider lambda and anisotropic deformations of the SU(2) principal chiral
model and show how they can be quantized in the Hamiltonian formalism on a
lattice as a suitable spin chain. The spin chain is related to the higher spin
XXZ Heisenberg chain and can be solved by using the Bethe Ansatz. This yields
the spectrum and S-matrix of the excitations. In particular, we find the
S-matrix in the gapped anti-ferromagnetic regime. In this regime, a continuum
limit does not exist and this suggests that the field theories in this regime,
precisely ones with a cyclic RG like the Yang-Baxter deformations, may only
exist as effective theories. In a certain limit, we show that the XXZ type
lambda model gives the symmetric space SU(2)/U(1) lambda model and, hence, we
are able to find its spectrum and S-matrix and show that it gives the S-matrix
of the O(3) sigma model in the appropriate limit. Finally, we show the full
consistency of the S-matrix and the Lagrangian formulations of the lambda
model, by coupling to a conserved charge and computing the way the ground state
energy changes in both pictures.
| hep-th | we consider lambda and anisotropic deformations of the su2 principal chiral model and show how they can be quantized in the hamiltonian formalism on a lattice as a suitable spin chain the spin chain is related to the higher spin xxz heisenberg chain and can be solved by using the bethe ansatz this yields the spectrum and smatrix of the excitations in particular we find the smatrix in the gapped antiferromagnetic regime in this regime a continuum limit does not exist and this suggests that the field theories in this regime precisely ones with a cyclic rg like the yangbaxter deformations may only exist as effective theories in a certain limit we show that the xxz type lambda model gives the symmetric space su2u1 lambda model and hence we are able to find its spectrum and smatrix and show that it gives the smatrix of the o3 sigma model in the appropriate limit finally we show the full consistency of the smatrix and the lagrangian formulations of the lambda model by coupling to a conserved charge and computing the way the ground state energy changes in both pictures | [['we', 'consider', 'lambda', 'and', 'anisotropic', 'deformations', 'of', 'the', 'su2', 'principal', 'chiral', 'model', 'and', 'show', 'how', 'they', 'can', 'be', 'quantized', 'in', 'the', 'hamiltonian', 'formalism', 'on', 'a', 'lattice', 'as', 'a', 'suitable', 'spin', 'chain', 'the', 'spin', 'chain', 'is', 'related', 'to', 'the', 'higher', 'spin', 'xxz', 'heisenberg', 'chain', 'and', 'can', 'be', 'solved', 'by', 'using', 'the', 'bethe', 'ansatz', 'this', 'yields', 'the', 'spectrum', 'and', 'smatrix', 'of', 'the', 'excitations', 'in', 'particular', 'we', 'find', 'the', 'smatrix', 'in', 'the', 'gapped', 'antiferromagnetic', 'regime', 'in', 'this', 'regime', 'a', 'continuum', 'limit', 'does', 'not', 'exist', 'and', 'this', 'suggests', 'that', 'the', 'field', 'theories', 'in', 'this', 'regime', 'precisely', 'ones', 'with', 'a', 'cyclic', 'rg', 'like', 'the', 'yangbaxter', 'deformations', 'may', 'only', 'exist', 'as', 'effective', 'theories', 'in', 'a', 'certain', 'limit', 'we', 'show', 'that', 'the', 'xxz', 'type', 'lambda', 'model', 'gives', 'the', 'symmetric', 'space', 'su2u1', 'lambda', 'model', 'and', 'hence', 'we', 'are', 'able', 'to', 'find', 'its', 'spectrum', 'and', 'smatrix', 'and', 'show', 'that', 'it', 'gives', 'the', 'smatrix', 'of', 'the', 'o3', 'sigma', 'model', 'in', 'the', 'appropriate', 'limit', 'finally', 'we', 'show', 'the', 'full', 'consistency', 'of', 'the', 'smatrix', 'and', 'the', 'lagrangian', 'formulations', 'of', 'the', 'lambda', 'model', 'by', 'coupling', 'to', 'a', 'conserved', 'charge', 'and', 'computing', 'the', 'way', 'the', 'ground', 'state', 'energy', 'changes', 'in', 'both', 'pictures']] | [-0.16374129950603905, 0.17127957376973466, -0.08339165636348202, 0.08703808631918869, -0.03435382609592473, -0.13155078647430352, -0.004882705193557876, 0.3585957405950002, -0.24794580640291122, -0.22825231124706408, 0.07613600760901426, -0.27171887213146273, -0.15102441113769136, 0.1228209029068239, 0.020761581966306696, 0.011890840446365937, 0.040086002212310054, 0.08997462393141333, -0.11553629525835586, -0.1801376181340063, 0.3028958636742244, 0.005942935968669964, 0.2732933238408766, 0.054221400904389934, 0.07618440410241167, 0.03649307023535701, 0.09270315081317057, 0.01587631809262019, -0.14951461167355715, 0.10135338058856352, 0.22806831760743157, 0.029349394152535402, 0.12260755681571492, -0.415950117622839, -0.20707938150859417, 0.09789098946110128, 0.18361114802463177, 0.1871397861693193, 0.04284477517432335, -0.2793762414280246, 0.040275885140216176, -0.22280638679079315, -0.17687246949502336, -0.11237829619463771, -0.0122900988350553, -0.04356675309703705, -0.24468468811531413, 0.09077046147192844, 0.09472647566531607, 0.006447997984496203, -0.06317096825334878, -0.07530504082790279, -0.07138817145568417, 0.08637720823505933, 0.061278748125372894, 0.026862279154072972, 0.08125034661497921, -0.15658466119017017, -0.09613483479281174, 0.38596812286909593, -0.09102699771663422, -0.23177420509424299, 0.14584806084662597, -0.16267872409043002, -0.1532080074613716, 0.07551005830433458, 0.06266078532216658, 0.10543069974123005, -0.13089590686115812, 0.20530023458203242, -0.05842897011229689, 0.15814948366444675, -0.00119957953265452, 0.023304969746064632, 0.22958688311863373, 0.10104086170681416, 0.04429480851320748, 0.14863361920690799, -0.04836863377304906, -0.12575595059055597, -0.3418170060576039, -0.1331086780990982, -0.16090713975643936, 0.08649719540815258, -0.10306581516147646, -0.16610058352903542, 0.3838506490264603, 0.18148738969112044, 0.19041868456778058, 0.054251883557918386, 0.1943282132988122, 0.16010772630428657, 0.06849475583604021, 0.06539763029642462, 0.2456413905242795, 0.15390721507905486, 0.05010912021711231, -0.28341406272127334, -0.04560227303250514, 0.09841629149927263] |
1,802.06017 | Reduced integration and improved segregation of functional brain
networks in Alzheimer's disease | Emerging evidence shows that cognitive deficits in Alzheimer disease (AD) are
associated with disruptions in brain functional connectivity. Thus, the
identification of alterations in AD functional networks has become a topic of
increasing interest. However, to what extent AD induces disruption of the
balance of local and global information processing in the human brain remains
elusive. The main objective of this study is to explore the dynamic topological
changes of AD networks in terms of brain network segregation and integration.
We used electroencephalography (EEG) data recorded from 20 participants (10 AD
patients and 10 healthy controls) during resting state. Functional brain
networks were reconstructed using EEG source connectivity computed in different
frequency bands. Graph theoretical analyses were performed assess differences
between both groups. Results revealed that AD networks, compared to networks of
age matched healthy controls, are characterized by lower global information
processing (integration) and higher local information processing (segregation).
Results showed also significant correlation between the alterations in the AD
patients functional brain networks and their cognitive scores. These findings
may contribute to the development of EEG network-based test that could
strengthen results obtained from currently used neurophysiological tests in
neurodegenerative diseases.
| q-bio.NC | emerging evidence shows that cognitive deficits in alzheimer disease ad are associated with disruptions in brain functional connectivity thus the identification of alterations in ad functional networks has become a topic of increasing interest however to what extent ad induces disruption of the balance of local and global information processing in the human brain remains elusive the main objective of this study is to explore the dynamic topological changes of ad networks in terms of brain network segregation and integration we used electroencephalography eeg data recorded from 20 participants 10 ad patients and 10 healthy controls during resting state functional brain networks were reconstructed using eeg source connectivity computed in different frequency bands graph theoretical analyses were performed assess differences between both groups results revealed that ad networks compared to networks of age matched healthy controls are characterized by lower global information processing integration and higher local information processing segregation results showed also significant correlation between the alterations in the ad patients functional brain networks and their cognitive scores these findings may contribute to the development of eeg networkbased test that could strengthen results obtained from currently used neurophysiological tests in neurodegenerative diseases | [['emerging', 'evidence', 'shows', 'that', 'cognitive', 'deficits', 'in', 'alzheimer', 'disease', 'ad', 'are', 'associated', 'with', 'disruptions', 'in', 'brain', 'functional', 'connectivity', 'thus', 'the', 'identification', 'of', 'alterations', 'in', 'ad', 'functional', 'networks', 'has', 'become', 'a', 'topic', 'of', 'increasing', 'interest', 'however', 'to', 'what', 'extent', 'ad', 'induces', 'disruption', 'of', 'the', 'balance', 'of', 'local', 'and', 'global', 'information', 'processing', 'in', 'the', 'human', 'brain', 'remains', 'elusive', 'the', 'main', 'objective', 'of', 'this', 'study', 'is', 'to', 'explore', 'the', 'dynamic', 'topological', 'changes', 'of', 'ad', 'networks', 'in', 'terms', 'of', 'brain', 'network', 'segregation', 'and', 'integration', 'we', 'used', 'electroencephalography', 'eeg', 'data', 'recorded', 'from', '20', 'participants', '10', 'ad', 'patients', 'and', '10', 'healthy', 'controls', 'during', 'resting', 'state', 'functional', 'brain', 'networks', 'were', 'reconstructed', 'using', 'eeg', 'source', 'connectivity', 'computed', 'in', 'different', 'frequency', 'bands', 'graph', 'theoretical', 'analyses', 'were', 'performed', 'assess', 'differences', 'between', 'both', 'groups', 'results', 'revealed', 'that', 'ad', 'networks', 'compared', 'to', 'networks', 'of', 'age', 'matched', 'healthy', 'controls', 'are', 'characterized', 'by', 'lower', 'global', 'information', 'processing', 'integration', 'and', 'higher', 'local', 'information', 'processing', 'segregation', 'results', 'showed', 'also', 'significant', 'correlation', 'between', 'the', 'alterations', 'in', 'the', 'ad', 'patients', 'functional', 'brain', 'networks', 'and', 'their', 'cognitive', 'scores', 'these', 'findings', 'may', 'contribute', 'to', 'the', 'development', 'of', 'eeg', 'networkbased', 'test', 'that', 'could', 'strengthen', 'results', 'obtained', 'from', 'currently', 'used', 'neurophysiological', 'tests', 'in', 'neurodegenerative', 'diseases']] | [-0.11469475762349182, 0.05499980366159076, -0.05126278334987287, 0.13045738490993264, -0.07152980783655082, -0.1374160803241023, 0.05641493108364816, 0.41690530091852257, -0.21653221703467437, -0.3344195857016765, 0.08500647547273593, -0.290466077201107, -0.2796329010840158, 0.15933876390052584, -0.12258956376270154, 0.036462901795881325, 0.12064887006547534, 0.07395548917174609, -0.004080217677877898, -0.19625433147091711, 0.257847238084726, 0.04326941849123397, 0.3511899553644688, 0.036881208125443966, 0.008635776929938539, -0.04178292952101543, -0.10558602382752252, 0.00504083962027717, -0.09421169452806977, 0.1670511335124629, 0.372433748712686, 0.20789394643485856, 0.36057280629410027, -0.5216730370673646, -0.296783887935619, 0.09563772940351942, 0.14211315673853178, 0.025480837937579562, -0.01674903757686828, -0.3410920497787624, 0.13674166265493887, -0.14283134591816368, -0.023238773807555128, -0.04510543992021483, 0.005160803356511914, -0.017074406165400412, -0.2650911799376261, 0.1605063903185001, -0.05026584165050151, 0.17923391419293966, -0.12518193582290002, -0.08908548213570461, -0.0607109856140351, 0.24666407008756705, 0.08241941670192299, 0.04712211714220267, 0.22850570578485188, -0.16872604717162723, -0.17145215745181705, 0.25986616204401064, 0.03099808772426301, -0.13002943152011676, 0.23396797778104175, -0.10301059277105709, -0.16248352480617984, 0.11193712514950628, 0.18617283198210396, -0.0011249181194414282, -0.21035135337308417, -0.04849703488973997, 0.08658409478876335, 0.18268955146792523, 0.0813754701195526, 0.01674666717211798, 0.13205063986529264, 0.21152771122927339, -0.01694681359469466, 0.08703299143612192, -0.11324272534557873, -0.05655031887587604, -0.18745991739642281, -0.10608522344737704, -0.14452393217871226, 0.04343580755247093, -0.11617440482988468, -0.12094578196275303, 0.41511441757564715, 0.14585808734711106, 0.13637492047149902, 0.03990638269101863, 0.22628369533886333, 0.0016145413751120395, 0.12097638080601093, 0.052543251444658004, 0.20152229933705124, 0.09357860004315226, 0.16704692382008376, -0.2099632576465066, 0.16911182012481354, -0.05307832645213743] |
1,802.06018 | Automated Quality Assessment of (Citizen) Weather Stations | Today we have access to a vast amount of weather, air quality, noise or
radioactivity data collected by individual around the globe. This volunteered
geographic information often contains data of uncertain and of heterogeneous
quality, in particular when compared to official in-situ measurements. This
limits their application, as rigorous, work-intensive data cleaning has to be
performed, which reduces the amount of data and cannot be performed in
real-time. In this paper, we propose dynamically learning the quality of
individual sensors by optimizing a weighted Gaussian process regression using a
genetic algorithm. We chose weather stations as our use case as these are the
most common VGI measurements. The evaluation is done for the south-west of
Germany in August 2016 with temperature data from the Wunderground network and
the Deutsche Wetter Dienst (DWD), in total 1561 stations. Using a 10-fold
cross-validation scheme based on the DWD ground truth, we can show significant
improvements of the predicted sensor reading. In our experiment we were obtain
a 12.5% improvement on the mean absolute error.
| stat.AP | today we have access to a vast amount of weather air quality noise or radioactivity data collected by individual around the globe this volunteered geographic information often contains data of uncertain and of heterogeneous quality in particular when compared to official insitu measurements this limits their application as rigorous workintensive data cleaning has to be performed which reduces the amount of data and cannot be performed in realtime in this paper we propose dynamically learning the quality of individual sensors by optimizing a weighted gaussian process regression using a genetic algorithm we chose weather stations as our use case as these are the most common vgi measurements the evaluation is done for the southwest of germany in august 2016 with temperature data from the wunderground network and the deutsche wetter dienst dwd in total 1561 stations using a 10fold crossvalidation scheme based on the dwd ground truth we can show significant improvements of the predicted sensor reading in our experiment we were obtain a 125 improvement on the mean absolute error | [['today', 'we', 'have', 'access', 'to', 'a', 'vast', 'amount', 'of', 'weather', 'air', 'quality', 'noise', 'or', 'radioactivity', 'data', 'collected', 'by', 'individual', 'around', 'the', 'globe', 'this', 'volunteered', 'geographic', 'information', 'often', 'contains', 'data', 'of', 'uncertain', 'and', 'of', 'heterogeneous', 'quality', 'in', 'particular', 'when', 'compared', 'to', 'official', 'insitu', 'measurements', 'this', 'limits', 'their', 'application', 'as', 'rigorous', 'workintensive', 'data', 'cleaning', 'has', 'to', 'be', 'performed', 'which', 'reduces', 'the', 'amount', 'of', 'data', 'and', 'can', 'not', 'be', 'performed', 'in', 'realtime', 'in', 'this', 'paper', 'we', 'propose', 'dynamically', 'learning', 'the', 'quality', 'of', 'individual', 'sensors', 'by', 'optimizing', 'a', 'weighted', 'gaussian', 'process', 'regression', 'using', 'a', 'genetic', 'algorithm', 'we', 'chose', 'weather', 'stations', 'as', 'our', 'use', 'case', 'as', 'these', 'are', 'the', 'most', 'common', 'vgi', 'measurements', 'the', 'evaluation', 'is', 'done', 'for', 'the', 'southwest', 'of', 'germany', 'in', 'august', '2016', 'with', 'temperature', 'data', 'from', 'the', 'wunderground', 'network', 'and', 'the', 'deutsche', 'wetter', 'dienst', 'dwd', 'in', 'total', '1561', 'stations', 'using', 'a', '10fold', 'crossvalidation', 'scheme', 'based', 'on', 'the', 'dwd', 'ground', 'truth', 'we', 'can', 'show', 'significant', 'improvements', 'of', 'the', 'predicted', 'sensor', 'reading', 'in', 'our', 'experiment', 'we', 'were', 'obtain', 'a', '125', 'improvement', 'on', 'the', 'mean', 'absolute', 'error']] | [-0.07926170330786714, 0.050275162519189974, -0.06954954844794771, 0.05092169313329093, -0.06412672804470157, -0.07791959662155727, 0.12366962638895783, 0.4059912419007242, -0.21189273475909043, -0.3880015442577692, 0.14633278106614814, -0.31543012576166696, -0.10011471397541022, 0.2195785021968737, -0.1425184623170203, 0.07881777514579578, 0.13401102666473072, 0.05056290271466036, -0.03289707033128957, -0.30961704735517415, 0.26159599385108556, 0.11171078554164486, 0.33270160207447746, 0.0055852435968717085, 0.0922867374352769, -0.002041457981400236, -0.07399850852715854, -0.010093169017507524, -0.06421413379804006, 0.13046919920250288, 0.31470336407676514, 0.1707325789432686, 0.2994020913807488, -0.4173791721826915, -0.20992443447701148, 0.1015375420442898, 0.10630429648627533, 0.06948012312510486, -0.03602608970432548, -0.3204750495910446, 0.06137506652157754, -0.18630807812617728, -0.043123676516005446, -0.06114580375473042, -0.0419310332584531, 0.025441479486187357, -0.28561982862684415, 0.07948289940287993, -0.038978035379884514, 0.13246535944625648, -0.053776153348132794, -0.13228924663946826, -0.004432903622007053, 0.17363145905384963, 0.027921337539091783, 0.03903026255839587, 0.14866029068320638, -0.08955682035981259, -0.10686833979065954, 0.36127064416747123, -0.07742060741999314, -0.14933527256059048, 0.15051076681485412, -0.09936923140208044, -0.12518895893308096, 0.11109093004374726, 0.2353325464002259, 0.0734148253741834, -0.19972967117731721, 0.0074172820058959876, -0.03101098554941809, 0.18161545521782893, 0.06445641744986573, -0.00955717800530886, 0.16213783082971073, 0.22747827579471222, 0.05574112728695501, 0.12628602909789416, -0.18961185457311658, -0.05035388128027408, -0.23189293383689563, -0.12454340235776538, -0.18245667900570486, 0.02235839293572911, -0.073023075132907, -0.1258639285241711, 0.3457567748227169, 0.18847275799648014, 0.18989722101161113, 0.00853531359539563, 0.3417960773773227, 0.04110430613967463, 0.08227356565295108, 0.08339318563023682, 0.22955126514294621, 0.018396763548464378, 0.1513246181062781, -0.15015936559982343, 0.10626513627512772, -0.026207281034109155] |
1,802.06019 | Filamentation of Mid-IR pulses in ambient air in the vicinity of
molecular resonances | Properties of filaments ignited by multi-millijoule, 90-fs mid-IR pulses
centered at 3.9 {\mu}m are examined experimentally by monitoring plasma density
and losses as well as spectral dynamics and beam profile evolution at different
focusing strengths. By softening the focusing from strong (f=0.25 m) to loose
(f=7 m) we observe a shift from plasma assisted filamentation to filaments with
low plasma density. In the latter case, filamentation manifests itself by beam
self-symmetrization and spatial self-channeling. Spectral dynamics in the case
of loose focusing is dominated by the non-linear Raman frequency downshift,
which leads to the overlap with the CO2 resonance in the vicinity of 4.2
{\mu}m. The dynamic CO2 absorption in the case of 3.9-{\mu}m filaments with
their low plasma content is the main mechanism of energy losses and either
alone or together with other nonlinear processes contributes to the arrest of
intensity.
| physics.optics | properties of filaments ignited by multimillijoule 90fs midir pulses centered at 39 mum are examined experimentally by monitoring plasma density and losses as well as spectral dynamics and beam profile evolution at different focusing strengths by softening the focusing from strong f025 m to loose f7 m we observe a shift from plasma assisted filamentation to filaments with low plasma density in the latter case filamentation manifests itself by beam selfsymmetrization and spatial selfchanneling spectral dynamics in the case of loose focusing is dominated by the nonlinear raman frequency downshift which leads to the overlap with the co2 resonance in the vicinity of 42 mum the dynamic co2 absorption in the case of 39mum filaments with their low plasma content is the main mechanism of energy losses and either alone or together with other nonlinear processes contributes to the arrest of intensity | [['properties', 'of', 'filaments', 'ignited', 'by', 'multimillijoule', '90fs', 'midir', 'pulses', 'centered', 'at', '39', 'mum', 'are', 'examined', 'experimentally', 'by', 'monitoring', 'plasma', 'density', 'and', 'losses', 'as', 'well', 'as', 'spectral', 'dynamics', 'and', 'beam', 'profile', 'evolution', 'at', 'different', 'focusing', 'strengths', 'by', 'softening', 'the', 'focusing', 'from', 'strong', 'f025', 'm', 'to', 'loose', 'f7', 'm', 'we', 'observe', 'a', 'shift', 'from', 'plasma', 'assisted', 'filamentation', 'to', 'filaments', 'with', 'low', 'plasma', 'density', 'in', 'the', 'latter', 'case', 'filamentation', 'manifests', 'itself', 'by', 'beam', 'selfsymmetrization', 'and', 'spatial', 'selfchanneling', 'spectral', 'dynamics', 'in', 'the', 'case', 'of', 'loose', 'focusing', 'is', 'dominated', 'by', 'the', 'nonlinear', 'raman', 'frequency', 'downshift', 'which', 'leads', 'to', 'the', 'overlap', 'with', 'the', 'co2', 'resonance', 'in', 'the', 'vicinity', 'of', '42', 'mum', 'the', 'dynamic', 'co2', 'absorption', 'in', 'the', 'case', 'of', '39mum', 'filaments', 'with', 'their', 'low', 'plasma', 'content', 'is', 'the', 'main', 'mechanism', 'of', 'energy', 'losses', 'and', 'either', 'alone', 'or', 'together', 'with', 'other', 'nonlinear', 'processes', 'contributes', 'to', 'the', 'arrest', 'of', 'intensity']] | [-0.10005116978984165, 0.20974529894959668, -0.021208756341787892, 0.021153746196037188, -0.02158360206564227, -0.09257592303354455, 0.017442480140480388, 0.4343060869736212, -0.2400622984016503, -0.32167749816848745, 0.06336734103092896, -0.26713109088292264, -0.05960902195437339, 0.1481817585822748, 0.020005249165241486, -0.010277625778605621, 0.004318685304589461, -0.05452944838485775, 0.028391602394285786, -0.1303091534410023, 0.29707089652968705, 0.13518341309458448, 0.28974341141883336, 0.07236496558154772, 0.05278593459692986, 0.0013043398868066488, -0.0069398779651501045, -0.018261148472842964, -0.10616461590288437, 0.048161846831899835, 0.20151788624934852, 0.022030145607288065, 0.25299566951445374, -0.4235468236864477, -0.2706277193872771, 0.02213524039024892, 0.14881175837228142, 0.06390467911293946, -0.03652307599195805, -0.24745614787030534, 0.03311346488856319, -0.09254362543646678, -0.15137813458948032, 0.029558045850337847, 0.013062783511881918, 0.09665719119231284, -0.2482768981785014, 0.1440487346827876, 0.057044562388488186, 0.08152709822794693, -0.060088568977822644, -0.07760957910584798, -0.10048622617403558, 0.038634883558742054, 0.03907471919175831, 0.018219590386159827, 0.20988947669368074, -0.1523627759188589, -0.04174571530893445, 0.389299311464234, -0.12548669231583134, -0.060185006333758, 0.2339954214858944, -0.2176858938022422, -0.059076309698444886, 0.24826862469679958, 0.14102604103517596, 0.08885116590375917, -0.08987732995149639, 0.0028232804436719152, 0.043227041523188243, 0.18194951238515583, 0.13837118921598987, 0.07763389555359448, 0.2319719717412701, 0.1764277489181014, 0.030839369828016428, 0.17387909532239512, -0.14617444888648132, -0.0421606983071652, -0.23166117885662918, -0.05289219117527692, -0.14233748329992313, 0.04785759577635622, -0.04679987726621735, -0.10391381055966992, 0.37174347656495543, 0.0757925294548867, 0.2059958086963203, -0.045769144093408584, 0.30511538846337277, 0.147479486116883, 0.05554169189839529, 0.0658286238440137, 0.2773292133098711, 0.1703223989748369, 0.150010911433998, -0.2805553635993999, 0.016767681854696053, -0.006421696877215004] |
1,802.0602 | On the extremal Betti numbers of binomial edge ideals of block graphs | We compute one of the distinguished extremal Betti number of the binomial
edge ideal of a block graph, and classify all block graphs admitting precisely
one extremal Betti number.
| math.AC math.CO | we compute one of the distinguished extremal betti number of the binomial edge ideal of a block graph and classify all block graphs admitting precisely one extremal betti number | [['we', 'compute', 'one', 'of', 'the', 'distinguished', 'extremal', 'betti', 'number', 'of', 'the', 'binomial', 'edge', 'ideal', 'of', 'a', 'block', 'graph', 'and', 'classify', 'all', 'block', 'graphs', 'admitting', 'precisely', 'one', 'extremal', 'betti', 'number']] | [-0.21057864458396516, 0.09370922602327733, 0.020507801773733104, 0.09665296120761797, -0.1362220430425529, -0.2279970933490529, -0.014461782600345283, 0.25414439239378633, -0.3209038094199937, -0.26207824346834213, 0.15558470160989413, -0.3517423326085354, -0.12868769646718584, 0.10400363504244335, -0.08013472902781234, 0.0647789507076658, 0.07902778648161168, 0.201443903019716, 0.047998100808211444, -0.3380217829544563, 0.3875154633845749, -0.06754875028955526, 0.18644635950953797, -0.02469227829113089, 0.11450804725032428, 0.038187278980581926, -0.0698633449601716, 0.12179212590101464, -0.23935002191313381, 0.15607380616510735, 0.3536826716414813, 0.11563997156918049, 0.11360751651227474, -0.39570880552818033, -0.036490141671022464, 0.3050576872352896, 0.09989801669043713, 0.06647643723910482, 0.05954494275923433, -0.08716155254635317, 0.16209974518880763, -0.19441171966750045, -0.2111679831969327, -0.060016015416075444, 0.033237508273330225, 0.01572957962494472, -0.21370879812005522, -0.05152263614381182, 0.10490484124627607, 0.029228313440649675, 0.0982860416687768, -0.16984036744668565, -0.1124174933848453, 0.13333846816536168, -0.057305474412338485, -0.09511877373182054, 0.10861019277945161, -0.10443654825011718, -0.22872729965581975, 0.2825241921276882, 0.02131735019642731, -0.18290182447125172, 0.059152000680052004, -0.18636536553245167, -0.19211087388725118, 0.12632318576476698, 0.07435216947362341, 0.18893933000749555, 0.032660368782797315, 0.12722553775027587, -0.15295080673591843, -0.01042200676326094, 0.2240431622505702, 0.05397044289214858, 0.20170744502081953, 0.05748216608731911, 0.12504072217591877, 0.23648251943161774, -0.029219706510675365, -0.008924688405260957, -0.2802979609575765, -0.2520378450381345, -0.3093470965134751, 0.14230311907635168, -0.28243921142310335, -0.3268979297115885, 0.5593051992613693, 0.05107432115694572, 0.22928208517360277, 0.160816446878016, 0.22655104087858363, -0.013192138217132667, -0.019251985090046095, 0.19795848968727836, 0.0673974738295736, 0.23662808813668532, -0.09018478035156069, -0.13239326347307911, 0.029952587214587576, 0.26179132995934323] |
1,802.06021 | Gray codes and symmetric chains | We consider the problem of constructing a cyclic listing of all bitstrings of
length $2n+1$ with Hamming weights in the interval $[n+1-\ell,n+\ell]$, where
$1\leq \ell\leq n+1$, by flipping a single bit in each step. This is a
far-ranging generalization of the well-known middle two levels problem (the
case $\ell=1$). We provide a solution for the case $\ell=2$, and we solve a
relaxed version of the problem for general values of $\ell$, by constructing
cycle factors for those instances. The proof of the first result uses the
lexical matchings introduced by Kierstead and Trotter, which we generalize to
arbitrary consecutive levels of the hypercube. The proof of the second result
uses symmetric chain decompositions of the hypercube, a concept known from the
theory of posets. We also present several new constructions of such
decompositions based on lexical matchings. In particular, we construct four
pairwise edge-disjoint symmetric chain decompositions of the $n$-dimensional
hypercube for any $n\geq 12$.
| math.CO cs.DM | we consider the problem of constructing a cyclic listing of all bitstrings of length 2n1 with hamming weights in the interval n1ellnell where 1leq ellleq n1 by flipping a single bit in each step this is a farranging generalization of the wellknown middle two levels problem the case ell1 we provide a solution for the case ell2 and we solve a relaxed version of the problem for general values of ell by constructing cycle factors for those instances the proof of the first result uses the lexical matchings introduced by kierstead and trotter which we generalize to arbitrary consecutive levels of the hypercube the proof of the second result uses symmetric chain decompositions of the hypercube a concept known from the theory of posets we also present several new constructions of such decompositions based on lexical matchings in particular we construct four pairwise edgedisjoint symmetric chain decompositions of the ndimensional hypercube for any ngeq 12 | [['we', 'consider', 'the', 'problem', 'of', 'constructing', 'a', 'cyclic', 'listing', 'of', 'all', 'bitstrings', 'of', 'length', '2n1', 'with', 'hamming', 'weights', 'in', 'the', 'interval', 'n1ellnell', 'where', '1leq', 'ellleq', 'n1', 'by', 'flipping', 'a', 'single', 'bit', 'in', 'each', 'step', 'this', 'is', 'a', 'farranging', 'generalization', 'of', 'the', 'wellknown', 'middle', 'two', 'levels', 'problem', 'the', 'case', 'ell1', 'we', 'provide', 'a', 'solution', 'for', 'the', 'case', 'ell2', 'and', 'we', 'solve', 'a', 'relaxed', 'version', 'of', 'the', 'problem', 'for', 'general', 'values', 'of', 'ell', 'by', 'constructing', 'cycle', 'factors', 'for', 'those', 'instances', 'the', 'proof', 'of', 'the', 'first', 'result', 'uses', 'the', 'lexical', 'matchings', 'introduced', 'by', 'kierstead', 'and', 'trotter', 'which', 'we', 'generalize', 'to', 'arbitrary', 'consecutive', 'levels', 'of', 'the', 'hypercube', 'the', 'proof', 'of', 'the', 'second', 'result', 'uses', 'symmetric', 'chain', 'decompositions', 'of', 'the', 'hypercube', 'a', 'concept', 'known', 'from', 'the', 'theory', 'of', 'posets', 'we', 'also', 'present', 'several', 'new', 'constructions', 'of', 'such', 'decompositions', 'based', 'on', 'lexical', 'matchings', 'in', 'particular', 'we', 'construct', 'four', 'pairwise', 'edgedisjoint', 'symmetric', 'chain', 'decompositions', 'of', 'the', 'ndimensional', 'hypercube', 'for', 'any', 'ngeq', '12']] | [-0.15895122190780164, 0.11202170832880906, -0.014440265453916478, 0.05949521153657274, -0.04059044909043625, -0.13543306376978562, 0.052815573195119495, 0.3282943794249811, -0.2741399080879599, -0.28079518823364336, 0.10656835599696603, -0.26279724161926804, -0.1429106158872631, 0.1353683361523579, -0.08961647195898771, 0.024367807332563135, 0.08427688316139695, 0.05919317168643994, -0.0525298572217973, -0.29076583865068417, 0.3277783108022451, -0.03262505144509789, 0.1970919156326102, 0.01974755705654766, 0.11590576177298896, 0.06880954717431072, -0.027299724358992725, -0.0031786040847443723, -0.19971907129299574, 0.1538768334098027, 0.25468045288648505, 0.15073994105052832, 0.2745433389451113, -0.3775755169789319, -0.12757765854914466, 0.17876317695028138, 0.12800015389840663, 0.1377439714398223, 0.0017503930411495075, -0.21428185584350162, 0.1071058545857305, -0.14285708860911478, -0.08992329617061157, -0.005671033569968414, 0.04178616054380288, 0.011043198533694853, -0.29330955947713033, 0.005261932688503671, 0.1603154133727121, 0.04057134486035241, -0.04215733291484512, -0.19253580548343938, 0.02064109696816145, 0.11085425130720553, -0.03043852860709749, 0.024278954357852215, -0.005795191914484195, -0.05285361178624504, -0.2164279123610974, 0.3639595240669011, -0.028075411891588915, -0.2364341588690877, 0.0720326011416853, -0.09832358947205176, -0.1982848464553668, 0.07086463215119847, 0.09329553030116798, 0.17741761831022412, -0.07226960480291783, 0.10782123928777752, -0.1273786923545715, 0.13382389537185768, 0.17034153184285025, 0.023699059499225083, 0.11686945750753021, 0.12192904812362432, 0.13816625576212324, 0.23314666155387054, -0.04169909288659208, -0.08171485487807106, -0.30124222150287144, -0.1402889663828295, -0.20380122895131808, 0.055838582910258665, -0.15494747638877016, -0.18218193707500838, 0.416971360224408, 0.08599830215137315, 0.18994218349368341, 0.14713842496532922, 0.25260710076568044, 0.06549235166038399, 0.04278820001046996, 0.09254437014037235, 0.10116265657472776, 0.15699832677892592, -0.008389935026689154, -0.14260318505599665, 0.009417750074395112, 0.208093922316133] |
1,802.06022 | Resummation and renormalons in a general Quantum Field Theory | We generalize the concept of Borel resummability and renormalons to a quantum
field theory with an arbitrary number of fields and couplings, starting from
the known notion based on the running coupling constants. An approach to
identify the renormalons is provided by exploiting an analytic solution of the
generic one-loop renormalization group equations in multi-field theories.
Methods to evaluate the regions in coupling space where the theory is
resummable are described. The generalization is then illustrated in a toy model
with two coupled scalar fields, representing the simplest extension of the
one-field analysis presented in the seminal works of the subject. Furthermore,
possible links to realistic theories are briefly discussed.
| hep-th hep-ph | we generalize the concept of borel resummability and renormalons to a quantum field theory with an arbitrary number of fields and couplings starting from the known notion based on the running coupling constants an approach to identify the renormalons is provided by exploiting an analytic solution of the generic oneloop renormalization group equations in multifield theories methods to evaluate the regions in coupling space where the theory is resummable are described the generalization is then illustrated in a toy model with two coupled scalar fields representing the simplest extension of the onefield analysis presented in the seminal works of the subject furthermore possible links to realistic theories are briefly discussed | [['we', 'generalize', 'the', 'concept', 'of', 'borel', 'resummability', 'and', 'renormalons', 'to', 'a', 'quantum', 'field', 'theory', 'with', 'an', 'arbitrary', 'number', 'of', 'fields', 'and', 'couplings', 'starting', 'from', 'the', 'known', 'notion', 'based', 'on', 'the', 'running', 'coupling', 'constants', 'an', 'approach', 'to', 'identify', 'the', 'renormalons', 'is', 'provided', 'by', 'exploiting', 'an', 'analytic', 'solution', 'of', 'the', 'generic', 'oneloop', 'renormalization', 'group', 'equations', 'in', 'multifield', 'theories', 'methods', 'to', 'evaluate', 'the', 'regions', 'in', 'coupling', 'space', 'where', 'the', 'theory', 'is', 'resummable', 'are', 'described', 'the', 'generalization', 'is', 'then', 'illustrated', 'in', 'a', 'toy', 'model', 'with', 'two', 'coupled', 'scalar', 'fields', 'representing', 'the', 'simplest', 'extension', 'of', 'the', 'onefield', 'analysis', 'presented', 'in', 'the', 'seminal', 'works', 'of', 'the', 'subject', 'furthermore', 'possible', 'links', 'to', 'realistic', 'theories', 'are', 'briefly', 'discussed']] | [-0.1420006490816627, 0.12046403347217123, -0.06553626015201347, 0.07857990669355719, -0.08225744411161323, -0.13298842737263222, -0.016537200125498235, 0.2939389540275576, -0.22429113271176268, -0.2622325794617517, 0.06304835574274216, -0.27223461328945847, -0.19307086901705062, 0.18467221569500591, -0.03487613899505125, 0.013879011406503413, -0.03261356464151396, 0.0688475105620989, -0.0560692719983817, -0.26083318152627266, 0.3480331187452608, 0.03634656693918818, 0.24703470952467088, 0.05842833755614766, 0.08753936350294346, 0.010443004899137064, -0.06932858951868268, 0.02815524218449104, -0.1416673777804394, 0.11093764836737595, 0.219218765633232, 0.09089892968928459, 0.22843838918851603, -0.41284784279045983, -0.20754467997563267, 0.060493118438331425, 0.1153261173866826, 0.13263416608129072, -0.027257283165871483, -0.31909045756905585, 0.04146869801232642, -0.17636940915376767, -0.17259083669889, -0.10416189773080853, -0.024544039449586167, -0.04100212428308682, -0.2812899861724005, 0.007567214083199928, -0.017919066505199043, 0.048277732711781984, -0.05443136316591686, -0.06289364607286972, 0.009823069042620172, 0.07908446373366708, 0.093674510964107, 0.03475540689269611, 0.08562613272860031, -0.15771641363991892, -0.1668077146969821, 0.39155296472097756, -0.10699926746513592, -0.25123953000736343, 0.18030483388222343, -0.08079255111259195, -0.14560336337228297, 0.05032160487709516, 0.11891298507844363, 0.15849848261632776, -0.15010273210499264, 0.19928259022194528, -0.030500791437172013, 0.10833291469329814, 0.03272047536362202, 0.011745837799042737, 0.1623858958995397, 0.14470578818112065, 0.001381520677460443, 0.14653336871073608, 0.014025436225133615, -0.18577296906332444, -0.3751279486497061, -0.09694411501356769, -0.16066707336608696, 0.03982615432116724, -0.09975518016203375, -0.17506551912584162, 0.3996125962029835, 0.1750150482007943, 0.17082019567216208, 0.05783694272502026, 0.2633602501089693, 0.1351504054501516, 0.05583233039381854, 0.041987021697189555, 0.25161225392286657, 0.2110738378069406, 0.023390722905345464, -0.1923087588714333, -0.05394405588815245, 0.12202479383040972] |
1,802.06023 | Simple modules over the 4-dimensional Sklyanin Algebras at points of
finite order | In 1982 E.K. Sklyanin defined a family of graded algebras $A(E,\tau)$,
depending on an elliptic curve $E$ and a point $\tau \in E$ that is not
4-torsion. The present paper is concerned with the structure of $A$ when $\tau$
is a point of finite order, $n$ say. It is proved that every simple $A$-module
has dimension $\le n$ and that "almost all" have dimension precisely $n$. There
are enough finite dimensional simple modules to separate elements of $A$; that
is, if $0\ne a \in A$, then there exists a simple module $S$ such that $a.S \ne
0.$ Consequently $A$ satisfies a polynomial identity of degree $2n$ (and none
of lower degree). Combined with results of Levasseur and Stafford it follows
that $A$ is a finite module over its center. Therefore one may associate to $A$
a coherent sheaf, ${\mathcal A}$ say, of finite ${\mathcal O}_S$ algebras where
$S$ is the projective 3-fold determined by the center of $A$. We determine
where ${\mathcal A}$ is Azumaya, and prove that the division algebra ${\rm
Fract}({\mathcal A})$ has rational center. Thus, for each $E$ and each $\tau
\in E$ of order $n \ne 0,2,4$ one obtains a division algebra of degree $s$ over
the rational function field of ${\mathbb P}^3$, where $s=n$ if $n$ is odd, and
$s={{1} \over {2}} n$ if $n$ is even.
The main technical tool in the paper is the notion of a "fat point"
introduced by M. Artin. A key preliminary result is the classification of the
fat points: these are parametrized by a rational 3-fold.
| math.QA math.RA | in 1982 ek sklyanin defined a family of graded algebras aetau depending on an elliptic curve e and a point tau in e that is not 4torsion the present paper is concerned with the structure of a when tau is a point of finite order n say it is proved that every simple amodule has dimension le n and that almost all have dimension precisely n there are enough finite dimensional simple modules to separate elements of a that is if 0ne a in a then there exists a simple module s such that as ne 0 consequently a satisfies a polynomial identity of degree 2n and none of lower degree combined with results of levasseur and stafford it follows that a is a finite module over its center therefore one may associate to a a coherent sheaf mathcal a say of finite mathcal o_s algebras where s is the projective 3fold determined by the center of a we determine where mathcal a is azumaya and prove that the division algebra rm fractmathcal a has rational center thus for each e and each tau in e of order n ne 024 one obtains a division algebra of degree s over the rational function field of mathbb p3 where sn if n is odd and s1 over 2 n if n is even the main technical tool in the paper is the notion of a fat point introduced by m artin a key preliminary result is the classification of the fat points these are parametrized by a rational 3fold | [['in', '1982', 'ek', 'sklyanin', 'defined', 'a', 'family', 'of', 'graded', 'algebras', 'aetau', 'depending', 'on', 'an', 'elliptic', 'curve', 'e', 'and', 'a', 'point', 'tau', 'in', 'e', 'that', 'is', 'not', '4torsion', 'the', 'present', 'paper', 'is', 'concerned', 'with', 'the', 'structure', 'of', 'a', 'when', 'tau', 'is', 'a', 'point', 'of', 'finite', 'order', 'n', 'say', 'it', 'is', 'proved', 'that', 'every', 'simple', 'amodule', 'has', 'dimension', 'le', 'n', 'and', 'that', 'almost', 'all', 'have', 'dimension', 'precisely', 'n', 'there', 'are', 'enough', 'finite', 'dimensional', 'simple', 'modules', 'to', 'separate', 'elements', 'of', 'a', 'that', 'is', 'if', '0ne', 'a', 'in', 'a', 'then', 'there', 'exists', 'a', 'simple', 'module', 's', 'such', 'that', 'as', 'ne', '0', 'consequently', 'a', 'satisfies', 'a', 'polynomial', 'identity', 'of', 'degree', '2n', 'and', 'none', 'of', 'lower', 'degree', 'combined', 'with', 'results', 'of', 'levasseur', 'and', 'stafford', 'it', 'follows', 'that', 'a', 'is', 'a', 'finite', 'module', 'over', 'its', 'center', 'therefore', 'one', 'may', 'associate', 'to', 'a', 'a', 'coherent', 'sheaf', 'mathcal', 'a', 'say', 'of', 'finite', 'mathcal', 'o_s', 'algebras', 'where', 's', 'is', 'the', 'projective', '3fold', 'determined', 'by', 'the', 'center', 'of', 'a', 'we', 'determine', 'where', 'mathcal', 'a', 'is', 'azumaya', 'and', 'prove', 'that', 'the', 'division', 'algebra', 'rm', 'fractmathcal', 'a', 'has', 'rational', 'center', 'thus', 'for', 'each', 'e', 'and', 'each', 'tau', 'in', 'e', 'of', 'order', 'n', 'ne', '024', 'one', 'obtains', 'a', 'division', 'algebra', 'of', 'degree', 's', 'over', 'the', 'rational', 'function', 'field', 'of', 'mathbb', 'p3', 'where', 'sn', 'if', 'n', 'is', 'odd', 'and', 's1', 'over', '2', 'n', 'if', 'n', 'is', 'even', 'the', 'main', 'technical', 'tool', 'in', 'the', 'paper', 'is', 'the', 'notion', 'of', 'a', 'fat', 'point', 'introduced', 'by', 'm', 'artin', 'a', 'key', 'preliminary', 'result', 'is', 'the', 'classification', 'of', 'the', 'fat', 'points', 'these', 'are', 'parametrized', 'by', 'a', 'rational', '3fold']] | [-0.18816199653883814, 0.11242740336871293, -0.09494022094077081, 0.003546012183505809, -0.037073378058266826, -0.19878393817452888, -0.007165770472056465, 0.3253347245927216, -0.3165458262519678, -0.17963861790599367, 0.07803923090568787, -0.26890733317122795, -0.12438839831975201, 0.18706370758263802, -0.09041156499733916, -0.05515054449483614, 0.03930653018414887, 0.14341717591923953, -0.06472148278407985, -0.27901014095641585, 0.34916404798741496, -0.031963211336915265, 0.18417948865771905, 0.0347832131319592, 0.14031005006012265, 0.007424129335049656, 0.012552627182230935, 0.020930713155394187, -0.13596514160062156, 0.0852183182414592, 0.2860898442486359, 0.10699562904028426, 0.2601242957834984, -0.31415776318624467, -0.12611257883372673, 0.21593104774729, 0.16012919448269258, -0.01801379541575443, -0.010908655543516943, -0.168388906182372, 0.1832741640400286, -0.18782450723273314, -0.17055280628301261, -0.0017429200152037083, 0.15190827883679958, -0.0009676388981461059, -0.31807734200106097, -0.031449307323782705, 0.10603676629216352, 0.1261727173041436, -0.008523296786279388, -0.10607781649332537, -0.09794637070262979, 0.051766910214269046, -0.054116546980367275, 0.11062556312845118, 0.05139847394843855, -0.07160033404980481, -0.11833799763371644, 0.37744048419222054, -0.053681824135765055, -0.20588120305035318, 0.12443233357407735, -0.18563210264892405, -0.13385289664074662, 0.14152024211307435, 0.06264209084656613, 0.15091291178578103, -0.03198798103909439, 0.21973922562051484, -0.14882422134132867, 0.14325446898590144, 0.07786417122770217, -0.030992997026260127, 0.13430769131900888, 0.1226235288204407, 0.10427133132429844, 0.0736730389389777, -0.03496086940958776, 0.01615623369707464, -0.3733816329149704, -0.197317740006838, -0.16641479641702972, 0.1702985005168216, -0.1012600512627273, -0.1382963423820911, 0.3734865393053042, 0.04059135985721696, 0.2447557633258839, 0.07238404608870042, 0.22335542934570185, 0.09131800030127124, 0.04325085747950652, 0.08849598009351212, 0.11118935945250996, 0.16486501281542587, -0.01626729124063786, -0.13233508813027584, 0.019476337354717543, 0.14485794672873453] |
1,802.06024 | Towards a Continuous Knowledge Learning Engine for Chatbots | Although chatbots have been very popular in recent years, they still have
some serious weaknesses which limit the scope of their applications. One major
weakness is that they cannot learn new knowledge during the conversation
process, i.e., their knowledge is fixed beforehand and cannot be expanded or
updated during conversation. In this paper, we propose to build a general
knowledge learning engine for chatbots to enable them to continuously and
interactively learn new knowledge during conversations. As time goes by, they
become more and more knowledgeable and better and better at learning and
conversation. We model the task as an open-world knowledge base completion
problem and propose a novel technique called lifelong interactive learning and
inference (LiLi) to solve it. LiLi works by imitating how humans acquire
knowledge and perform inference during an interactive conversation. Our
experimental results show LiLi is highly promising.
| cs.CL cs.AI cs.HC | although chatbots have been very popular in recent years they still have some serious weaknesses which limit the scope of their applications one major weakness is that they cannot learn new knowledge during the conversation process ie their knowledge is fixed beforehand and cannot be expanded or updated during conversation in this paper we propose to build a general knowledge learning engine for chatbots to enable them to continuously and interactively learn new knowledge during conversations as time goes by they become more and more knowledgeable and better and better at learning and conversation we model the task as an openworld knowledge base completion problem and propose a novel technique called lifelong interactive learning and inference lili to solve it lili works by imitating how humans acquire knowledge and perform inference during an interactive conversation our experimental results show lili is highly promising | [['although', 'chatbots', 'have', 'been', 'very', 'popular', 'in', 'recent', 'years', 'they', 'still', 'have', 'some', 'serious', 'weaknesses', 'which', 'limit', 'the', 'scope', 'of', 'their', 'applications', 'one', 'major', 'weakness', 'is', 'that', 'they', 'can', 'not', 'learn', 'new', 'knowledge', 'during', 'the', 'conversation', 'process', 'ie', 'their', 'knowledge', 'is', 'fixed', 'beforehand', 'and', 'can', 'not', 'be', 'expanded', 'or', 'updated', 'during', 'conversation', 'in', 'this', 'paper', 'we', 'propose', 'to', 'build', 'a', 'general', 'knowledge', 'learning', 'engine', 'for', 'chatbots', 'to', 'enable', 'them', 'to', 'continuously', 'and', 'interactively', 'learn', 'new', 'knowledge', 'during', 'conversations', 'as', 'time', 'goes', 'by', 'they', 'become', 'more', 'and', 'more', 'knowledgeable', 'and', 'better', 'and', 'better', 'at', 'learning', 'and', 'conversation', 'we', 'model', 'the', 'task', 'as', 'an', 'openworld', 'knowledge', 'base', 'completion', 'problem', 'and', 'propose', 'a', 'novel', 'technique', 'called', 'lifelong', 'interactive', 'learning', 'and', 'inference', 'lili', 'to', 'solve', 'it', 'lili', 'works', 'by', 'imitating', 'how', 'humans', 'acquire', 'knowledge', 'and', 'perform', 'inference', 'during', 'an', 'interactive', 'conversation', 'our', 'experimental', 'results', 'show', 'lili', 'is', 'highly', 'promising']] | [0.0060057463951344635, 0.0655172127638221, -0.08474540518082935, 0.09202036097298771, -0.23553698086179792, -0.20926136125505357, 0.057546385836883866, 0.4661465803097034, -0.26755451063529173, -0.3833981430607623, 0.10525951243391068, -0.25066783335702175, -0.18252548597399787, 0.18151064410099182, -0.1532293146243319, 0.03919554708830627, 0.10735800034719808, 0.06227308617069804, -0.025203526078659142, -0.2885704075596456, 0.2938704320390163, 0.0802011466488756, 0.28665923997117526, 0.04489710145662057, 0.07141097721097799, 0.007806619089739076, -0.036216383709989745, -0.05772714485125295, -0.0555415666632551, 0.1482016497785386, 0.3736891197104906, 0.253109517756143, 0.39505265897204134, -0.4722083200796925, -0.2211759124593488, 0.10118249251089734, 0.18518455833325098, 0.1164148236231493, -0.04582484143019397, -0.3317036717873195, 0.08764249429845347, -0.20794099884364625, -0.010775135271251202, -0.17852082873357394, -0.0024635051666148777, -0.04745358444894825, -0.2442178803496063, -0.03424724324020268, 0.12125979081952366, 0.04718878923048233, -0.018421545969964617, -0.06906198494312964, 0.058766013102862856, 0.21022304671431152, 0.06087718958352243, 0.08264453092204599, 0.14254687428635, -0.1735173994916138, -0.15354553269671983, 0.359357773576831, -0.027672201173444246, -0.16619230286571487, 0.21214471307326235, -0.00977248570656982, -0.16871533434003078, 0.07176208386904206, 0.23358062671433236, 0.14657436388319936, -0.19764433524346559, -0.004410539914709355, -0.01368352296794283, 0.18842843533975298, 0.030094593082522523, -0.03648376580897783, 0.23628385083043368, 0.22070777957359777, 0.03375314598068081, 0.05982601324754671, -0.0010457186014311195, -0.0846932508533114, -0.17124592141601547, -0.1251180343362021, -0.16724133489910384, -0.008533313977813092, -0.03899366202641776, -0.10385293209993537, 0.34649211710062006, 0.25224547208254705, 0.19231419833055857, 0.0726349802085616, 0.32007203885707364, 0.023607947862835536, 0.09876875045171393, 0.12514380015200005, 0.20320437312033832, -0.01731068643195362, 0.2215249622882954, -0.10405024048262115, 0.14507371172838812, -0.012191626026519927] |
1,802.06025 | A Systematic Study of Cross-Project Defect Prediction With Meta-Learning | The prediction of defects in a target project based on data from external
projects is called Cross-Project Defect Prediction (CPDP). Several methods have
been proposed to improve the predictive performance of CPDP models. However,
there is a lack of comparison among state-of-the-art methods. Moreover,
previous work has shown that the most suitable method for a project can vary
according to the project being predicted. This makes the choice of which method
to use difficult. We provide an extensive experimental comparison of 31 CPDP
methods derived from state-of-the-art approaches, applied to 47 versions of 15
open source software projects. Four methods stood out as presenting the best
performances across datasets. However, the most suitable among these methods
still varies according to the project being predicted. Therefore, we propose
and evaluate a meta-learning solution designed to automatically select and
recommend the most suitable CPDP method for a project. Our results show that
the meta-learning solution is able to learn from previous experiences and
recommend suitable methods dynamically. When compared to the base methods,
however, the proposed solution presented minor difference of performance. These
results provide valuable knowledge about the possibilities and limitations of a
meta-learning solution applied for CPDP.
| cs.SE | the prediction of defects in a target project based on data from external projects is called crossproject defect prediction cpdp several methods have been proposed to improve the predictive performance of cpdp models however there is a lack of comparison among stateoftheart methods moreover previous work has shown that the most suitable method for a project can vary according to the project being predicted this makes the choice of which method to use difficult we provide an extensive experimental comparison of 31 cpdp methods derived from stateoftheart approaches applied to 47 versions of 15 open source software projects four methods stood out as presenting the best performances across datasets however the most suitable among these methods still varies according to the project being predicted therefore we propose and evaluate a metalearning solution designed to automatically select and recommend the most suitable cpdp method for a project our results show that the metalearning solution is able to learn from previous experiences and recommend suitable methods dynamically when compared to the base methods however the proposed solution presented minor difference of performance these results provide valuable knowledge about the possibilities and limitations of a metalearning solution applied for cpdp | [['the', 'prediction', 'of', 'defects', 'in', 'a', 'target', 'project', 'based', 'on', 'data', 'from', 'external', 'projects', 'is', 'called', 'crossproject', 'defect', 'prediction', 'cpdp', 'several', 'methods', 'have', 'been', 'proposed', 'to', 'improve', 'the', 'predictive', 'performance', 'of', 'cpdp', 'models', 'however', 'there', 'is', 'a', 'lack', 'of', 'comparison', 'among', 'stateoftheart', 'methods', 'moreover', 'previous', 'work', 'has', 'shown', 'that', 'the', 'most', 'suitable', 'method', 'for', 'a', 'project', 'can', 'vary', 'according', 'to', 'the', 'project', 'being', 'predicted', 'this', 'makes', 'the', 'choice', 'of', 'which', 'method', 'to', 'use', 'difficult', 'we', 'provide', 'an', 'extensive', 'experimental', 'comparison', 'of', '31', 'cpdp', 'methods', 'derived', 'from', 'stateoftheart', 'approaches', 'applied', 'to', '47', 'versions', 'of', '15', 'open', 'source', 'software', 'projects', 'four', 'methods', 'stood', 'out', 'as', 'presenting', 'the', 'best', 'performances', 'across', 'datasets', 'however', 'the', 'most', 'suitable', 'among', 'these', 'methods', 'still', 'varies', 'according', 'to', 'the', 'project', 'being', 'predicted', 'therefore', 'we', 'propose', 'and', 'evaluate', 'a', 'metalearning', 'solution', 'designed', 'to', 'automatically', 'select', 'and', 'recommend', 'the', 'most', 'suitable', 'cpdp', 'method', 'for', 'a', 'project', 'our', 'results', 'show', 'that', 'the', 'metalearning', 'solution', 'is', 'able', 'to', 'learn', 'from', 'previous', 'experiences', 'and', 'recommend', 'suitable', 'methods', 'dynamically', 'when', 'compared', 'to', 'the', 'base', 'methods', 'however', 'the', 'proposed', 'solution', 'presented', 'minor', 'difference', 'of', 'performance', 'these', 'results', 'provide', 'valuable', 'knowledge', 'about', 'the', 'possibilities', 'and', 'limitations', 'of', 'a', 'metalearning', 'solution', 'applied', 'for', 'cpdp']] | [0.0005704107674235847, -0.05522030984992008, -0.09282150614278646, 0.06763009542273121, -0.10334733080090529, -0.16456433483470365, 0.06767976918461056, 0.4295736461840003, -0.1986409902382349, -0.3534846811030571, 0.11213877380845967, -0.274420303706231, -0.1403075225930779, 0.25549800911454984, -0.09138035164380134, 0.09766359798353742, 0.13021076217159006, 0.03070182835347572, -0.08294702368802603, -0.3076547103068853, 0.28824978144981234, 0.07362892903945395, 0.37103422479656745, 0.03427601595253206, 0.07680669188000697, -0.0832204039517062, -0.09209212758117426, 0.017433028067104627, -0.10214933662991178, 0.16249210616782883, 0.3163238883613017, 0.19508823029919134, 0.3275229317433943, -0.3779131437316159, -0.2067812392299021, 0.05990655994194035, 0.13889848585400097, 0.11330062723465957, -0.06363144987392792, -0.29052085737191935, 0.10735062787162736, -0.18271145785255782, -0.07216476634863367, -0.12726539928882105, -0.027454555861954458, 0.005131424989121101, -0.2665053589297884, -0.0028909727071794837, 0.01973805270810153, 0.021255331386949128, -0.0782971004541812, -0.1733793749752913, 0.037510722654583266, 0.16435178764933261, 0.09053782511119575, 0.07135010080478216, 0.1243072297981926, -0.11423267014906004, -0.16026214262007304, 0.41050237967505065, -0.060543658053455164, -0.19559294407771247, 0.237934628167062, -0.0274539064724698, -0.14804888016846843, 0.10251293348226469, 0.15794845435503624, 0.14630419660718913, -0.18426636095091684, 0.01976159322879225, 0.0017555834666996022, 0.19565507633136445, 0.021298666139544568, -0.042160550647694146, 0.17505920090272947, 0.23890932257934874, 0.05197849705594303, 0.09971088515760065, -0.08035498269748528, -0.08178430305425134, -0.20719966708403553, -0.10426885356209453, -0.15087539747329004, -0.023504067602585693, -0.051357443217214124, -0.12991089095988814, 0.391387219459225, 0.2785666942724079, 0.14989491571423474, 0.029669941554474173, 0.3136790834206539, 0.017519208744433024, 0.108481817647134, 0.08806794415450263, 0.2374799541070074, 0.041973178096465426, 0.08654108722954232, -0.17971569185646316, 0.08289921468464767, 0.007041046116973845] |
1,802.06026 | Parameterized Algorithms for Zero Extension and Metric Labelling
Problems | We consider the problems ZERO EXTENSION and METRIC LABELLING under the
paradigm of parameterized complexity. These are natural, well-studied problems
with important applications, but have previously not received much attention
from parameterized complexity.
Depending on the chosen cost function $\mu$, we find that different
algorithmic approaches can be applied to design FPT-algorithms: for arbitrary
$\mu$ we parameterized by the number of edges that cross the cut (not the cost)
and show how to solve ZERO EXTENSION in time $O(|D|^{O(k^2)} n^4 \log n)$ using
randomized contractions. We improve this running time with respect to both
parameter and input size to $O(|D|^{O(k)} m)$ in the case where $\mu$ is a
metric. We further show that the problem admits a polynomial sparsifier, that
is, a kernel of size $O(k^{|D|+1})$ that is independent of the metric $\mu$.
With the stronger condition that $\mu$ is described by the distances of
leaves in a tree, we parameterize by a gap parameter $(q - p)$ between the cost
of a true solution $q$ and a `discrete relaxation' $p$ and achieve a running
time of $O(|D|^{q-p} |T|m + |T|\phi(n,m))$ where $T$ is the size of the tree
over which $\mu$ is defined and $\phi(n,m)$ is the running time of a max-flow
computation. We achieve a similar running for the more general METRIC
LABELLING, while also allowing $\mu$ to be the distance metric between an
arbitrary subset of nodes in a tree using tools from the theory of VCSPs. We
expect the methods used in the latter result to have further applications.
| cs.DS cs.DM | we consider the problems zero extension and metric labelling under the paradigm of parameterized complexity these are natural wellstudied problems with important applications but have previously not received much attention from parameterized complexity depending on the chosen cost function mu we find that different algorithmic approaches can be applied to design fptalgorithms for arbitrary mu we parameterized by the number of edges that cross the cut not the cost and show how to solve zero extension in time odok2 n4 log n using randomized contractions we improve this running time with respect to both parameter and input size to odok m in the case where mu is a metric we further show that the problem admits a polynomial sparsifier that is a kernel of size okd1 that is independent of the metric mu with the stronger condition that mu is described by the distances of leaves in a tree we parameterize by a gap parameter q p between the cost of a true solution q and a discrete relaxation p and achieve a running time of odqp tm tphinm where t is the size of the tree over which mu is defined and phinm is the running time of a maxflow computation we achieve a similar running for the more general metric labelling while also allowing mu to be the distance metric between an arbitrary subset of nodes in a tree using tools from the theory of vcsps we expect the methods used in the latter result to have further applications | [['we', 'consider', 'the', 'problems', 'zero', 'extension', 'and', 'metric', 'labelling', 'under', 'the', 'paradigm', 'of', 'parameterized', 'complexity', 'these', 'are', 'natural', 'wellstudied', 'problems', 'with', 'important', 'applications', 'but', 'have', 'previously', 'not', 'received', 'much', 'attention', 'from', 'parameterized', 'complexity', 'depending', 'on', 'the', 'chosen', 'cost', 'function', 'mu', 'we', 'find', 'that', 'different', 'algorithmic', 'approaches', 'can', 'be', 'applied', 'to', 'design', 'fptalgorithms', 'for', 'arbitrary', 'mu', 'we', 'parameterized', 'by', 'the', 'number', 'of', 'edges', 'that', 'cross', 'the', 'cut', 'not', 'the', 'cost', 'and', 'show', 'how', 'to', 'solve', 'zero', 'extension', 'in', 'time', 'odok2', 'n4', 'log', 'n', 'using', 'randomized', 'contractions', 'we', 'improve', 'this', 'running', 'time', 'with', 'respect', 'to', 'both', 'parameter', 'and', 'input', 'size', 'to', 'odok', 'm', 'in', 'the', 'case', 'where', 'mu', 'is', 'a', 'metric', 'we', 'further', 'show', 'that', 'the', 'problem', 'admits', 'a', 'polynomial', 'sparsifier', 'that', 'is', 'a', 'kernel', 'of', 'size', 'okd1', 'that', 'is', 'independent', 'of', 'the', 'metric', 'mu', 'with', 'the', 'stronger', 'condition', 'that', 'mu', 'is', 'described', 'by', 'the', 'distances', 'of', 'leaves', 'in', 'a', 'tree', 'we', 'parameterize', 'by', 'a', 'gap', 'parameter', 'q', 'p', 'between', 'the', 'cost', 'of', 'a', 'true', 'solution', 'q', 'and', 'a', 'discrete', 'relaxation', 'p', 'and', 'achieve', 'a', 'running', 'time', 'of', 'odqp', 'tm', 'tphinm', 'where', 't', 'is', 'the', 'size', 'of', 'the', 'tree', 'over', 'which', 'mu', 'is', 'defined', 'and', 'phinm', 'is', 'the', 'running', 'time', 'of', 'a', 'maxflow', 'computation', 'we', 'achieve', 'a', 'similar', 'running', 'for', 'the', 'more', 'general', 'metric', 'labelling', 'while', 'also', 'allowing', 'mu', 'to', 'be', 'the', 'distance', 'metric', 'between', 'an', 'arbitrary', 'subset', 'of', 'nodes', 'in', 'a', 'tree', 'using', 'tools', 'from', 'the', 'theory', 'of', 'vcsps', 'we', 'expect', 'the', 'methods', 'used', 'in', 'the', 'latter', 'result', 'to', 'have', 'further', 'applications']] | [-0.11961758666912214, 0.10670354144986789, -0.08056877797272632, 0.042360576822770744, -0.08279055467148017, -0.1452828149133309, 0.08545058697123246, 0.3713207810708299, -0.2861108830599947, -0.312726468299525, 0.07353567952863736, -0.24451938205459192, -0.1372182940575862, 0.1792827046266189, -0.06351519647852719, 0.06735593205454146, 0.0478977300321335, 0.07838803934258962, -0.06795934369249035, -0.26672401655620587, 0.30529472100921357, 0.036016580254990396, 0.22481071276730305, 0.055557422952043134, 0.08714202989642394, 0.002334656597046954, -0.00800023467102035, 0.08630005316051646, -0.13556954395057913, 0.08704554037772104, 0.2521191175565184, 0.1659459556744619, 0.27058813264555626, -0.36628518994079856, -0.18575308651178774, 0.18348824158803054, 0.10811527833584847, 0.053644391242887945, -0.0006952024502343711, -0.2140547310899398, 0.13508887549888768, -0.11568083390934257, -0.08501461009604751, -0.02812191398106364, 0.06326493859287291, -0.015657400000865032, -0.31220013217440223, 0.010880468325094109, 0.06636945184365642, -0.002012993544112982, -0.016424108988499435, -0.12719104080262209, 0.010758359793467613, 0.10533368007499512, 0.039430558716980514, 0.09838510861211433, 0.07428421799048054, -0.10296250285478536, -0.1335350154251678, 0.38415477054602487, -0.08917387695301597, -0.2547731043229531, 0.16503445701522193, -0.11282009574607378, -0.13685693299043847, 0.10252895860694258, 0.18688209878083895, 0.15317909100553875, -0.09214988408886593, 0.19117594219991352, -0.041957143557398026, 0.1747545977686229, 0.09952194060954242, 0.02198355403332214, 0.09525108328884149, 0.16765223622768816, 0.14292028918294464, 0.15652118847285193, -0.03643676297970086, -0.06128602442558764, -0.28445973965089494, -0.1429342619546621, -0.19991513683907386, 0.05332524448406516, -0.14665142488743962, -0.14709071827885822, 0.37012566593324203, 0.1309294808145832, 0.25251724944926507, 0.12209972629098342, 0.27545662954207356, 0.14489502441497687, 0.0769562830353947, 0.120936150209717, 0.1626781651303475, 0.09232352209387241, 0.04691528292359572, -0.2117792695260993, 0.05522312640261692, 0.06552833069411175] |
1,802.06027 | Inverter Probing for Power Distribution Network Topology Processing | Knowing the connectivity and line parameters of the underlying electric
distribution network is a prerequisite for solving any grid optimization task.
Although distribution grids lack observability and comprehensive metering,
inverters with advanced cyber capabilities currently interface solar panels and
energy storage devices to the grid. Smart inverters have been widely used for
grid control and optimization, yet the fresh idea here is to engage them
towards network topology inference. Being an electric circuit, a distribution
grid can be intentionally probed by instantaneously perturbing inverter
injections. Collecting and processing the incurred voltage deviations across
nodes can potentially unveil the grid topology even without knowing loads.
Using grid probing data and under an approximate grid model, the tasks of
topology recovery and line status verification are posed respectively as
non-convex estimation and detection problems. Leveraging the features of the
Laplacian matrix of a tree graph, probing terminal nodes is analytically shown
to be sufficient for exact topology recovery if voltage data are collected at
all buses. The related non-convex problems are surrogated to convex ones, which
are iteratively solved via closed-form updates based on the alternating
direction method of multipliers and projected gradient descent. Numerical tests
on benchmark feeders demonstrate that grid probing can yield line status error
probabilities of 0.001 by probing 40% of the nodes.
| math.OC | knowing the connectivity and line parameters of the underlying electric distribution network is a prerequisite for solving any grid optimization task although distribution grids lack observability and comprehensive metering inverters with advanced cyber capabilities currently interface solar panels and energy storage devices to the grid smart inverters have been widely used for grid control and optimization yet the fresh idea here is to engage them towards network topology inference being an electric circuit a distribution grid can be intentionally probed by instantaneously perturbing inverter injections collecting and processing the incurred voltage deviations across nodes can potentially unveil the grid topology even without knowing loads using grid probing data and under an approximate grid model the tasks of topology recovery and line status verification are posed respectively as nonconvex estimation and detection problems leveraging the features of the laplacian matrix of a tree graph probing terminal nodes is analytically shown to be sufficient for exact topology recovery if voltage data are collected at all buses the related nonconvex problems are surrogated to convex ones which are iteratively solved via closedform updates based on the alternating direction method of multipliers and projected gradient descent numerical tests on benchmark feeders demonstrate that grid probing can yield line status error probabilities of 0001 by probing 40 of the nodes | [['knowing', 'the', 'connectivity', 'and', 'line', 'parameters', 'of', 'the', 'underlying', 'electric', 'distribution', 'network', 'is', 'a', 'prerequisite', 'for', 'solving', 'any', 'grid', 'optimization', 'task', 'although', 'distribution', 'grids', 'lack', 'observability', 'and', 'comprehensive', 'metering', 'inverters', 'with', 'advanced', 'cyber', 'capabilities', 'currently', 'interface', 'solar', 'panels', 'and', 'energy', 'storage', 'devices', 'to', 'the', 'grid', 'smart', 'inverters', 'have', 'been', 'widely', 'used', 'for', 'grid', 'control', 'and', 'optimization', 'yet', 'the', 'fresh', 'idea', 'here', 'is', 'to', 'engage', 'them', 'towards', 'network', 'topology', 'inference', 'being', 'an', 'electric', 'circuit', 'a', 'distribution', 'grid', 'can', 'be', 'intentionally', 'probed', 'by', 'instantaneously', 'perturbing', 'inverter', 'injections', 'collecting', 'and', 'processing', 'the', 'incurred', 'voltage', 'deviations', 'across', 'nodes', 'can', 'potentially', 'unveil', 'the', 'grid', 'topology', 'even', 'without', 'knowing', 'loads', 'using', 'grid', 'probing', 'data', 'and', 'under', 'an', 'approximate', 'grid', 'model', 'the', 'tasks', 'of', 'topology', 'recovery', 'and', 'line', 'status', 'verification', 'are', 'posed', 'respectively', 'as', 'nonconvex', 'estimation', 'and', 'detection', 'problems', 'leveraging', 'the', 'features', 'of', 'the', 'laplacian', 'matrix', 'of', 'a', 'tree', 'graph', 'probing', 'terminal', 'nodes', 'is', 'analytically', 'shown', 'to', 'be', 'sufficient', 'for', 'exact', 'topology', 'recovery', 'if', 'voltage', 'data', 'are', 'collected', 'at', 'all', 'buses', 'the', 'related', 'nonconvex', 'problems', 'are', 'surrogated', 'to', 'convex', 'ones', 'which', 'are', 'iteratively', 'solved', 'via', 'closedform', 'updates', 'based', 'on', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'and', 'projected', 'gradient', 'descent', 'numerical', 'tests', 'on', 'benchmark', 'feeders', 'demonstrate', 'that', 'grid', 'probing', 'can', 'yield', 'line', 'status', 'error', 'probabilities', 'of', '0001', 'by', 'probing', '40', 'of', 'the', 'nodes']] | [-0.15826129138545503, 0.03588342802331047, -0.016267793310459615, 0.03453119262175765, -0.10072278057138413, -0.20838818433640394, 0.07416689264707181, 0.4101623865093516, -0.3053449604422027, -0.3793835991430421, 0.16766395682230764, -0.27401828150708923, -0.09479454050576964, 0.20423577731301965, -0.0870635448648817, 0.09604835183424658, 0.090890594407223, -0.03829805261217231, -0.04200485285025003, -0.22526282933716618, 0.23608537374584135, 0.0851667599611764, 0.3180002140509354, 0.03680712051640893, 0.09012478713141105, -0.023920329063481023, -0.007708219394661746, 0.04432927524389396, -0.04335406401947948, 0.10915993030269652, 0.2942117416700565, 0.16893812038740794, 0.27252719087829425, -0.5033495876548248, -0.21202110344500735, 0.12890994616426787, 0.14221260893635104, 0.05787969965671817, -0.04393466329960109, -0.270854715032633, 0.10883536912111003, -0.1340145499380522, -0.0797912043182932, -0.08117593904025852, -0.024120365675582095, 0.08548959195288981, -0.3140611299248629, -0.009366661020511285, -0.02203326254953132, 0.08420694022802203, -0.036916288950272054, -0.11623924862333508, -0.055511260253572184, 0.13427398490183445, -0.015662301385143722, -0.00979263985009734, 0.1978267470526314, -0.10091545966042335, -0.13090722333033417, 0.3418253401770841, 0.05151383078056063, -0.21578735468779192, 0.10706180314598389, -0.05727055946982271, -0.09465526415598254, 0.1102608798461598, 0.22535318059543538, 0.10768624329289725, -0.189284814624549, 0.05841679216638684, 0.01696259677843299, 0.14941217762710482, 0.04205596679388437, -0.019939246015666528, 0.21321315748703687, 0.19526701044659456, 0.17997851570483384, 0.09119806053552798, -0.099880408024724, -0.09791320911825223, -0.23025309362037238, -0.07224104032516046, -0.23359895764882568, 0.01958305413163332, -0.11450450103669048, -0.14692166841813623, 0.4182175211218554, 0.1542729653580504, 0.1525668277849205, 0.07085877643224003, 0.36942119615065844, 0.11764955655807023, 0.052096743385719006, 0.135631966779041, 0.1753362555143445, 0.10661174244095767, 0.13623500126305707, -0.2017574454354512, 0.13689911968594548, 0.06261049599473387] |
1,802.06028 | On the Cauchy problem for the linearised Einstein equation | A classical problem in general relativity is the Cauchy problem for the
linearised Einstein equation (the initial value problem for gravitational
waves) on a globally hyperbolic vacuum spacetime. A well-known result is that
it is uniquely solvable up to gauge solutions, given initial data on a
spacelike Cauchy hypersurface. The solution map is an isomorphism between
initial data (modulo gauge producing initial data) and solutions (modulo gauge
solutions). In the first part of this work, we show that the solution map is
actually an isomorphism of locally convex topological vector spaces. This
implies that the equivalence class of solutions depends continuously on the
equivalence class of initial data. We may therefore conclude well-posedness of
the Cauchy problem. In the second part, we show that the linearised constraint
equations can always be solved on a closed manifold with vanishing scalar
curvature. This generalises the classical notion of TT-tensors on flat space
used to produce models of gravitational waves. All our results are proven for
smooth and distributional initial data of arbitrary real Sobolev regularity.
| math.DG gr-qc math-ph math.AP math.MP | a classical problem in general relativity is the cauchy problem for the linearised einstein equation the initial value problem for gravitational waves on a globally hyperbolic vacuum spacetime a wellknown result is that it is uniquely solvable up to gauge solutions given initial data on a spacelike cauchy hypersurface the solution map is an isomorphism between initial data modulo gauge producing initial data and solutions modulo gauge solutions in the first part of this work we show that the solution map is actually an isomorphism of locally convex topological vector spaces this implies that the equivalence class of solutions depends continuously on the equivalence class of initial data we may therefore conclude wellposedness of the cauchy problem in the second part we show that the linearised constraint equations can always be solved on a closed manifold with vanishing scalar curvature this generalises the classical notion of tttensors on flat space used to produce models of gravitational waves all our results are proven for smooth and distributional initial data of arbitrary real sobolev regularity | [['a', 'classical', 'problem', 'in', 'general', 'relativity', 'is', 'the', 'cauchy', 'problem', 'for', 'the', 'linearised', 'einstein', 'equation', 'the', 'initial', 'value', 'problem', 'for', 'gravitational', 'waves', 'on', 'a', 'globally', 'hyperbolic', 'vacuum', 'spacetime', 'a', 'wellknown', 'result', 'is', 'that', 'it', 'is', 'uniquely', 'solvable', 'up', 'to', 'gauge', 'solutions', 'given', 'initial', 'data', 'on', 'a', 'spacelike', 'cauchy', 'hypersurface', 'the', 'solution', 'map', 'is', 'an', 'isomorphism', 'between', 'initial', 'data', 'modulo', 'gauge', 'producing', 'initial', 'data', 'and', 'solutions', 'modulo', 'gauge', 'solutions', 'in', 'the', 'first', 'part', 'of', 'this', 'work', 'we', 'show', 'that', 'the', 'solution', 'map', 'is', 'actually', 'an', 'isomorphism', 'of', 'locally', 'convex', 'topological', 'vector', 'spaces', 'this', 'implies', 'that', 'the', 'equivalence', 'class', 'of', 'solutions', 'depends', 'continuously', 'on', 'the', 'equivalence', 'class', 'of', 'initial', 'data', 'we', 'may', 'therefore', 'conclude', 'wellposedness', 'of', 'the', 'cauchy', 'problem', 'in', 'the', 'second', 'part', 'we', 'show', 'that', 'the', 'linearised', 'constraint', 'equations', 'can', 'always', 'be', 'solved', 'on', 'a', 'closed', 'manifold', 'with', 'vanishing', 'scalar', 'curvature', 'this', 'generalises', 'the', 'classical', 'notion', 'of', 'tttensors', 'on', 'flat', 'space', 'used', 'to', 'produce', 'models', 'of', 'gravitational', 'waves', 'all', 'our', 'results', 'are', 'proven', 'for', 'smooth', 'and', 'distributional', 'initial', 'data', 'of', 'arbitrary', 'real', 'sobolev', 'regularity']] | [-0.18156614545948072, 0.07234964969132575, -0.09418146120319736, 0.10661330603929829, -0.11966324828812755, -0.1082269086803961, -0.06420033193069559, 0.29204540694606185, -0.30933389557267116, -0.23062567396905015, 0.1417333757877619, -0.2653012003028238, -0.12902646186368572, 0.19231716264577614, -0.08042785049970612, 0.09357954829263722, 0.11077084370237382, 0.05177390016077054, -0.10133445279328207, -0.27318340531318863, 0.45054785997709096, -0.0342777985164282, 0.25635470513448205, 0.03319483149172254, 0.15391786504103505, -0.030495659563948826, 0.02276074473956072, 0.02419810809684255, -0.1499775670749079, 0.07780424045463431, 0.2604483160727317, 0.1466236048151949, 0.2404474243669733, -0.38927965137752235, -0.19149061297254927, 0.16489742069392105, 0.10712702180167412, 0.13231617847532895, -0.03723618962850443, -0.31833217665553093, 0.10157967763925994, -0.08529278093671717, -0.1876650586437617, -0.05772850208651985, 0.0372850481781441, -0.017254982154407253, -0.2720975499234103, 0.07581758726323616, 0.08429413540504141, 0.00205235429433416, -0.19716218577138003, -0.008946363395618308, -0.02481345917405076, 0.026503977723785734, 0.08482613248449099, 0.08226554314309807, 0.04964386507050495, -0.11289662961589679, -0.066022205070291, 0.37260682563259767, -0.08810872596424783, -0.31159737318581926, 0.12066542146716676, -0.1268786130489168, -0.13768354574799796, 0.11488853776127617, 0.1403152694840878, 0.17720498292130887, -0.1075096681304922, 0.1939715160362455, -0.0903762840595893, 0.14919429157949401, 0.10231599987705232, -0.045020732971452, 0.1695496128802053, 0.0871888146078957, 0.1492353217606298, 0.1411798971744168, 0.028368629446533115, -0.1023686029285467, -0.38253183515588995, -0.1666476809382008, -0.18076998665538546, 0.13298609253622032, -0.14219622574245283, -0.19918273736835818, 0.35854967224217865, 0.11210020171004655, 0.13449227712467055, 0.13020000926547312, 0.22999646608324753, 0.12014477651511088, 0.009467792956325403, 0.09922219519341914, 0.2378220056867324, 0.12808589770517856, 0.10156031948584267, -0.17529174438129297, -0.011970809205957403, 0.15782990765413324] |
1,802.06029 | Molding Molecular and Material Properties by Strong Light-Matter
Coupling | When atoms come together and bond, we call these new states molecules, and
their properties determine many aspects of our daily life. Strangely enough, it
is conceivable for light and molecules to bond, creating new hybrid
light-matter states with far-reaching consequences for these strongly coupled
materials. Even stranger, there is no `real' light needed to obtain the
effects, it simply appears from the vacuum, creating `something from nothing'.
Surprisingly, the setup required to create these materials has become
moderately straightforward. In its simplest form, one only needs to put a
strongly absorbing material at the appropriate place between two mirrors, and
quantum magic can appear. Only recently has it been discovered that strong
coupling can affect a host of significant effects at a material and molecular
level, which were thought to be independent of the `light' environment: phase
transitions, conductivity, chemical reactions, etc. This review addresses the
fundamentals of this opportunity: the quantum mechanical foundations, the
relevant plasmonic and photonic structures, and a description of the various
applications, connecting materials chemistry with quantum information,
nonlinear optics and chemical reactivity. Ultimately, revealing the interplay
between light and matter in this new regime opens attractive avenues for many
applications in the material, chemical, quantum mechanical and biological
realms.
| cond-mat.mtrl-sci physics.optics quant-ph | when atoms come together and bond we call these new states molecules and their properties determine many aspects of our daily life strangely enough it is conceivable for light and molecules to bond creating new hybrid lightmatter states with farreaching consequences for these strongly coupled materials even stranger there is no real light needed to obtain the effects it simply appears from the vacuum creating something from nothing surprisingly the setup required to create these materials has become moderately straightforward in its simplest form one only needs to put a strongly absorbing material at the appropriate place between two mirrors and quantum magic can appear only recently has it been discovered that strong coupling can affect a host of significant effects at a material and molecular level which were thought to be independent of the light environment phase transitions conductivity chemical reactions etc this review addresses the fundamentals of this opportunity the quantum mechanical foundations the relevant plasmonic and photonic structures and a description of the various applications connecting materials chemistry with quantum information nonlinear optics and chemical reactivity ultimately revealing the interplay between light and matter in this new regime opens attractive avenues for many applications in the material chemical quantum mechanical and biological realms | [['when', 'atoms', 'come', 'together', 'and', 'bond', 'we', 'call', 'these', 'new', 'states', 'molecules', 'and', 'their', 'properties', 'determine', 'many', 'aspects', 'of', 'our', 'daily', 'life', 'strangely', 'enough', 'it', 'is', 'conceivable', 'for', 'light', 'and', 'molecules', 'to', 'bond', 'creating', 'new', 'hybrid', 'lightmatter', 'states', 'with', 'farreaching', 'consequences', 'for', 'these', 'strongly', 'coupled', 'materials', 'even', 'stranger', 'there', 'is', 'no', 'real', 'light', 'needed', 'to', 'obtain', 'the', 'effects', 'it', 'simply', 'appears', 'from', 'the', 'vacuum', 'creating', 'something', 'from', 'nothing', 'surprisingly', 'the', 'setup', 'required', 'to', 'create', 'these', 'materials', 'has', 'become', 'moderately', 'straightforward', 'in', 'its', 'simplest', 'form', 'one', 'only', 'needs', 'to', 'put', 'a', 'strongly', 'absorbing', 'material', 'at', 'the', 'appropriate', 'place', 'between', 'two', 'mirrors', 'and', 'quantum', 'magic', 'can', 'appear', 'only', 'recently', 'has', 'it', 'been', 'discovered', 'that', 'strong', 'coupling', 'can', 'affect', 'a', 'host', 'of', 'significant', 'effects', 'at', 'a', 'material', 'and', 'molecular', 'level', 'which', 'were', 'thought', 'to', 'be', 'independent', 'of', 'the', 'light', 'environment', 'phase', 'transitions', 'conductivity', 'chemical', 'reactions', 'etc', 'this', 'review', 'addresses', 'the', 'fundamentals', 'of', 'this', 'opportunity', 'the', 'quantum', 'mechanical', 'foundations', 'the', 'relevant', 'plasmonic', 'and', 'photonic', 'structures', 'and', 'a', 'description', 'of', 'the', 'various', 'applications', 'connecting', 'materials', 'chemistry', 'with', 'quantum', 'information', 'nonlinear', 'optics', 'and', 'chemical', 'reactivity', 'ultimately', 'revealing', 'the', 'interplay', 'between', 'light', 'and', 'matter', 'in', 'this', 'new', 'regime', 'opens', 'attractive', 'avenues', 'for', 'many', 'applications', 'in', 'the', 'material', 'chemical', 'quantum', 'mechanical', 'and', 'biological', 'realms']] | [-0.09979782522050212, 0.20634031241976666, -0.09258831809817371, 0.05348293218059235, -0.08663360580086518, -0.19699687541881236, 0.07580946724934196, 0.374190012142243, -0.2785074034258181, -0.31635859595087257, 0.05367592515342516, -0.2809681068129331, -0.1821369643450841, 0.21235807202937243, -0.011891689366272207, 0.039373596329682785, 0.02945644996757393, -0.032591070220308396, -0.023217550873331435, -0.20374732677829316, 0.2734233607392243, 0.03427619099132694, 0.2649680694567437, 0.11822302656551117, 0.07185761140573553, -0.019143074990512387, 0.02413280254333886, -0.013821277670218672, -0.09441387341420637, 0.13914831165728403, 0.26389295853972794, 0.04628747177009501, 0.25852427008625084, -0.48238541030334037, -0.25983288343340266, 0.10576703047913327, 0.10987013036462036, 0.17091317152778518, -0.10103985501195585, -0.2582239171809933, -0.007614113347496367, -0.12390423030253428, -0.17340435110285735, -0.10700276498412951, 0.02904423964461334, -0.013211921079240251, -0.18424953076789535, 0.0007567290777286279, 0.024045868306556372, 0.04170440275219803, -0.021836597470733906, -0.1132767555604517, -0.00881506415881958, 0.13603773766925709, 0.0002808315109787057, -0.0056717397747685664, 0.17013481551401535, -0.15993781738069127, -0.08112479048075824, 0.4539598220308284, 0.007714379199066208, -0.12459058025444958, 0.27261361493774267, -0.13966993995585017, -0.14299990675068525, 0.12565600949546404, 0.14543978028560003, 0.06604859400178911, -0.157731940662186, 0.05461703641261019, 0.027804552125337632, 0.16714018204213274, 0.05431320988663554, 0.1437748608052803, 0.29587910426057223, 0.16121869880109302, 0.009173470599581351, 0.12102376125431936, -0.027150431485141364, -0.11084709293887164, -0.2457162056895859, -0.1928820025392817, -0.14796922992670783, 0.06661806369281727, -0.05896102647719231, -0.15536363246552284, 0.3736911819382001, 0.1455509146467502, 0.14578268377933182, -0.07113132479507928, 0.24763388348544396, 0.061697692034463174, 0.08678449431854725, 0.027269391673029338, 0.30346502040487994, 0.15323689151508676, 0.11169277887239835, -0.1988984889179034, 0.09092176574688106, -0.033061720990322674] |
1,802.0603 | Improving the Florentine algorithms: recovering algorithms for Motzkin
and Schr\"oder paths | We present random sampling procedures for Motzkin and Schr\"oder paths,
following previous work on Dyck paths. Our algorithms follow the anticipated
rejection method of the Florentine algorithms (Barcucci et al. 1994+), but
introduce a recovery idea to greatly reduce the probability of rejection. They
use an optimal amount of randomness and achieve a better time complexity than
the Florentine algorithms.
| cs.DS math.CO | we present random sampling procedures for motzkin and schroder paths following previous work on dyck paths our algorithms follow the anticipated rejection method of the florentine algorithms barcucci et al 1994 but introduce a recovery idea to greatly reduce the probability of rejection they use an optimal amount of randomness and achieve a better time complexity than the florentine algorithms | [['we', 'present', 'random', 'sampling', 'procedures', 'for', 'motzkin', 'and', 'schroder', 'paths', 'following', 'previous', 'work', 'on', 'dyck', 'paths', 'our', 'algorithms', 'follow', 'the', 'anticipated', 'rejection', 'method', 'of', 'the', 'florentine', 'algorithms', 'barcucci', 'et', 'al', '1994', 'but', 'introduce', 'a', 'recovery', 'idea', 'to', 'greatly', 'reduce', 'the', 'probability', 'of', 'rejection', 'they', 'use', 'an', 'optimal', 'amount', 'of', 'randomness', 'and', 'achieve', 'a', 'better', 'time', 'complexity', 'than', 'the', 'florentine', 'algorithms']] | [-0.053767615341249915, 0.08838366288755886, -0.09486276356471797, 0.08707193951359239, -0.09063844095473572, -0.11452216283078857, 0.19688405421309932, 0.39528311229452995, -0.24655038646374972, -0.3739489575027157, 0.03941636817466657, -0.22762734525031963, -0.15877603720557892, 0.19561167777973718, -0.20767240826103647, 0.1085026834349511, 0.09997505369454117, -0.0605304988132695, -0.044168337210776065, -0.37299656209346477, 0.1740608963076029, 0.15320647670492782, 0.31513996105009723, -0.07190219720162577, 0.09737602701821065, 0.06263228417453119, -0.09315120195772625, 0.0013437165673506463, -0.20131902140959845, 0.13260489313910573, 0.20989927984537335, 0.22384046869731303, 0.2917943032995119, -0.3940479222495677, -0.18695505872621374, 0.1411602328042105, 0.15506849801009995, 0.14480865403015356, -0.019454678293649046, -0.24197665169456248, 0.042400445875916945, -0.1364628499673711, -0.05780440163640779, -0.037198110799289356, -0.005133375651755576, 0.06403326735460847, -0.2826410469962126, 0.04214141180075831, 0.11881149108758417, 0.022795121501184117, 0.05781235684388143, -0.164464549066783, 0.08744250827910915, 0.07965939019222633, -0.003747608007515891, 0.045040388260099845, 0.07331813083393342, -0.05548449643587662, -0.27173811099413087, 0.31242156514929514, 0.053810637541681576, -0.17412289026808941, 0.1626384260638033, -0.05549306693976208, -0.16353658218947004, 0.18324136610884786, 0.15600459282562704, 0.14434351791012084, -0.09759518169695354, 0.05316581594228934, -0.02800967001308829, 0.14360535041413316, 0.13475391106143342, 0.028690319397818236, 0.04938150038626992, 0.13285644131444269, 0.12382973220704471, 0.1218478206300445, -0.05404894386212957, -0.09471453619446069, -0.20013065606166244, -0.16687443201288077, -0.19645187269769987, 0.006955351214855909, -0.10974130226186697, -0.18583494213299226, 0.34499066962339614, 0.25109051268989757, 0.182710043659781, 0.18914473869727325, 0.28465490952386696, 0.0651406442087491, 0.0013590724665229603, 0.12738937581494703, 0.15974119422025979, 0.11072693975894886, 0.11706126535753325, -0.20800713651766212, 0.12138251877405633, 0.14139016113891187] |
1,802.06031 | A uniqueness result for functions with zero fine gradient on
quasiconnected and finely connected sets | We show that every Sobolev function in $W^{1,p}_{\textrm{loc}}(U)$ on a
$p$-quasiopen set $U \subset {\bf R}^n$ with a.e.-vanishing $p$-fine gradient
is a.e.-constant if and only if $U$ is $p$-quasiconnected. To prove this we use
the theory of Newtonian Sobolev spaces on metric measure spaces, and obtain the
corresponding equivalence also for complete metric spaces equipped with a
doubling measure supporting a $p$-Poincar\'e inequality. On unweighted ${\bf
R}^n$, we also obtain the corresponding result for $p$-finely open sets in
terms of $p$-fine connectedness, using a deep result by Latvala.
| math.AP math.FA | we show that every sobolev function in w1p_textrmlocu on a pquasiopen set u subset bf rn with aevanishing pfine gradient is aeconstant if and only if u is pquasiconnected to prove this we use the theory of newtonian sobolev spaces on metric measure spaces and obtain the corresponding equivalence also for complete metric spaces equipped with a doubling measure supporting a ppoincare inequality on unweighted bf rn we also obtain the corresponding result for pfinely open sets in terms of pfine connectedness using a deep result by latvala | [['we', 'show', 'that', 'every', 'sobolev', 'function', 'in', 'w1p_textrmlocu', 'on', 'a', 'pquasiopen', 'set', 'u', 'subset', 'bf', 'rn', 'with', 'aevanishing', 'pfine', 'gradient', 'is', 'aeconstant', 'if', 'and', 'only', 'if', 'u', 'is', 'pquasiconnected', 'to', 'prove', 'this', 'we', 'use', 'the', 'theory', 'of', 'newtonian', 'sobolev', 'spaces', 'on', 'metric', 'measure', 'spaces', 'and', 'obtain', 'the', 'corresponding', 'equivalence', 'also', 'for', 'complete', 'metric', 'spaces', 'equipped', 'with', 'a', 'doubling', 'measure', 'supporting', 'a', 'ppoincare', 'inequality', 'on', 'unweighted', 'bf', 'rn', 'we', 'also', 'obtain', 'the', 'corresponding', 'result', 'for', 'pfinely', 'open', 'sets', 'in', 'terms', 'of', 'pfine', 'connectedness', 'using', 'a', 'deep', 'result', 'by', 'latvala']] | [-0.10353336543603628, 0.03318690081172979, -0.05038946227710924, 0.09401051449031787, -0.061085133150760314, -0.09440899661017789, 0.060468287337973804, 0.38090634780625504, -0.28674451629688713, -0.19134548249550992, 0.11940499260320248, -0.30331784256814437, -0.1429348889807308, 0.2109628509454153, -0.13806246932779934, 4.4055030117800205e-05, 0.07683813145361197, 0.09530036676427878, -0.09702223692273285, -0.2729297996855076, 0.42342898845787585, -0.10811858978675805, 0.22136270096180616, 0.08186867400819872, 0.1373472776447917, 0.014145135804780839, 0.013001156137267381, 0.054597185637204, -0.21288247740826424, 0.1523650037009775, 0.19360048653569395, 0.14224498000651323, 0.2836788005747453, -0.31874783298418924, -0.19221486162716223, 0.19631417064617077, 0.057752930731685075, -0.028132101722107627, -0.0034454169778015326, -0.34002316359108614, 0.1309476637132006, -0.08795192919349597, -0.13580509068237412, -0.13290946720811872, 0.10060040471445839, 0.04496408518932668, -0.3330960141517866, 0.039605910699371895, 0.07475495266291186, 0.026839642296832653, -0.13238085301615943, -0.03811270435467178, -0.008156327602603002, 0.02956727136143506, -0.034467817910797435, 0.20414661550549446, 0.01875836396931935, -0.026135362658856645, -0.09954837080735116, 0.35002127197789557, -0.12691239928711712, -0.29806232091361357, 0.1350278795271376, -0.1805427446099067, -0.133343934069997, -0.002572833525913733, 0.1537291289617618, 0.13790508929387102, -0.07823897656168283, 0.20886167837163133, -0.12250124872374682, 0.1324508984811765, 0.11385749041298289, 0.06656008305166054, 0.056093358911895826, 0.1257006574054191, 0.20509001488486925, 0.14535638270324763, -0.015482935700910512, -0.011739474072345291, -0.37825669155076697, -0.1689034546782941, -0.1825932953276752, 0.13893892343535466, -0.15647296799471844, -0.195901630193363, 0.29466314846074876, 0.06870946768717265, 0.20265192308543642, 0.13932656573798555, 0.19178771482849563, 0.07615943428543598, 0.005392741391803195, 0.1498903670825386, 0.18276596884530635, 0.14756285525099547, 0.05814259760886615, -0.1013505178457701, -0.00631247633309276, 0.19827663049354782] |
1,802.06032 | Dielectric properties of relaxor-ferroelectric ceramic and single
crystal
Pb(In$_{1/2}$Nb$_{1/2}$)O$_{3}$-Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$-PbTiO$_{3}$
at cryogenic temperatures | We investigate the low temperature behaviour of
Pb(In$_{1/2}$Nb$_{1/2}$)O$_{3}$-Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$-PbTiO$_{3}$
using dielectric permittivity measurements. We compare single crystal plates
measured in the [001] and [111] directions with a polycrystalline ceramic of
the same composition. Poled crystals behave very differently to unpoled
crystals, whereas the dielectric spectrum of the ceramic changes very little on
poling. A large, frequency dependent dielectric relaxation seen in the poled
[001] crystal around 100 K is much less prominent in the [111] crystal, and
doesn't occur in the ceramic. Preparation conditions and the microstructure of
the material play a role in the low temperature dynamics of
relaxor-ferroelectric crystals.
| cond-mat.mtrl-sci | we investigate the low temperature behaviour of pbin_12nb_12o_3pbmg_13nb_23o_3pbtio_3 using dielectric permittivity measurements we compare single crystal plates measured in the 001 and 111 directions with a polycrystalline ceramic of the same composition poled crystals behave very differently to unpoled crystals whereas the dielectric spectrum of the ceramic changes very little on poling a large frequency dependent dielectric relaxation seen in the poled 001 crystal around 100 k is much less prominent in the 111 crystal and doesnt occur in the ceramic preparation conditions and the microstructure of the material play a role in the low temperature dynamics of relaxorferroelectric crystals | [['we', 'investigate', 'the', 'low', 'temperature', 'behaviour', 'of', 'pbin_12nb_12o_3pbmg_13nb_23o_3pbtio_3', 'using', 'dielectric', 'permittivity', 'measurements', 'we', 'compare', 'single', 'crystal', 'plates', 'measured', 'in', 'the', '001', 'and', '111', 'directions', 'with', 'a', 'polycrystalline', 'ceramic', 'of', 'the', 'same', 'composition', 'poled', 'crystals', 'behave', 'very', 'differently', 'to', 'unpoled', 'crystals', 'whereas', 'the', 'dielectric', 'spectrum', 'of', 'the', 'ceramic', 'changes', 'very', 'little', 'on', 'poling', 'a', 'large', 'frequency', 'dependent', 'dielectric', 'relaxation', 'seen', 'in', 'the', 'poled', '001', 'crystal', 'around', '100', 'k', 'is', 'much', 'less', 'prominent', 'in', 'the', '111', 'crystal', 'and', 'doesnt', 'occur', 'in', 'the', 'ceramic', 'preparation', 'conditions', 'and', 'the', 'microstructure', 'of', 'the', 'material', 'play', 'a', 'role', 'in', 'the', 'low', 'temperature', 'dynamics', 'of', 'relaxorferroelectric', 'crystals']] | [-0.13245573090953808, 0.2446079633405639, -0.057984786700795994, -0.09556165379307449, -0.05680814521114408, -0.13689199070719005, 0.05570365431379865, 0.4924082499035079, -0.22808692504585992, -0.2961175386615173, 0.05948647089429538, -0.31186630191149733, -0.03935960113691787, 0.1913061178044764, 0.010145205797420608, 0.04057739315686202, -0.06633836378559771, -0.06062019076386486, -0.11265165344670866, -0.17348644625621312, 0.1852395360362763, 0.08528943223548897, 0.3952358445585376, 0.033497988382787114, 0.0744987996153985, -0.0019305987763359692, 0.1036766011837042, 0.005411375408070256, -0.14719536727426027, 0.020925541319652116, 0.25958619150333107, -0.14333134223095545, 0.18981856512225637, -0.4604344280869371, -0.1922110040046538, 0.01429361536289857, 0.059584252394305426, 0.08577131350848688, -0.11342709510224974, -0.1644392143840892, 0.05044410444062316, -0.03654120809332741, -0.13431338304089327, 0.003863875725955674, -0.048590060544548314, -0.0034306026863479854, -0.16887942220865174, 0.08727350126895489, 0.04978595888289162, 0.11437689389379677, -0.14420673643436396, -0.15509934998775898, -0.0625701657628095, 0.006094000861401472, 0.047765869889502426, 0.03456541446197515, 0.24690475237715725, -0.10289125630839004, -0.021787957410619715, 0.4558805427749199, -0.10170915367251093, -0.10434904352601881, 0.13050817350405408, -0.2505786960210764, -0.07447060524965778, 0.16782498994437658, 0.1734970319302367, 0.15107983885558718, -0.12284190712303789, 0.027149844508985, 0.007289026859169355, 0.25458878144678293, 0.18186013952763092, 0.055647500724804524, 0.19979129951315547, 0.2230638095325875, -0.0774309371757989, 0.19063818910408464, -0.10585053303899865, 0.009387821330679487, -0.19873848086166562, -0.21166385564661463, -0.20142835666510192, 0.045712926754589205, -0.16666709385636483, -0.2547390838576989, 0.3789007031556332, 0.05585026917150103, 0.1808056242980364, -0.07532507005251116, 0.15785942049791116, 0.025885525327693257, 0.11068701342387934, 0.0027986228903473325, 0.29540931953662874, 0.17732002221828683, 0.21474374921503242, -0.2636794869151822, 0.11306330114320824, -0.10948324459369736] |
1,802.06033 | Torsional potentials of glyoxal, oxalyl halides and their thiocarbonyl
derivatives: Challenges for popular density functional approximations | The reliability of popular density functionals was studied for the
description of torsional profiles of 36 molecules: glyoxal, oxalyl halides and
their thiocarbonyl derivatives. HF and \textcolor{black}{eighteen} functionals
of varying complexity, from local density to range-separated hybrid
approximations and double-hybrid, have been considered and benchmarked against
CCSD(T)-level rotational profiles. For molecules containing heavy halogens, all
functionals except M05-2X and M06-2X fail to reproduce barrier heights
accurately and a number of functionals introduce spurious minima. Dispersion
corrections show no improvement. Calibrated torsion-corrected atom-centered
potentials rectify the shortcomings of PBE and also improve on $\sigma$-hole
based intermolecular binding in dimers and crystals.
| physics.chem-ph | the reliability of popular density functionals was studied for the description of torsional profiles of 36 molecules glyoxal oxalyl halides and their thiocarbonyl derivatives hf and textcolorblackeighteen functionals of varying complexity from local density to rangeseparated hybrid approximations and doublehybrid have been considered and benchmarked against ccsdtlevel rotational profiles for molecules containing heavy halogens all functionals except m052x and m062x fail to reproduce barrier heights accurately and a number of functionals introduce spurious minima dispersion corrections show no improvement calibrated torsioncorrected atomcentered potentials rectify the shortcomings of pbe and also improve on sigmahole based intermolecular binding in dimers and crystals | [['the', 'reliability', 'of', 'popular', 'density', 'functionals', 'was', 'studied', 'for', 'the', 'description', 'of', 'torsional', 'profiles', 'of', '36', 'molecules', 'glyoxal', 'oxalyl', 'halides', 'and', 'their', 'thiocarbonyl', 'derivatives', 'hf', 'and', 'textcolorblackeighteen', 'functionals', 'of', 'varying', 'complexity', 'from', 'local', 'density', 'to', 'rangeseparated', 'hybrid', 'approximations', 'and', 'doublehybrid', 'have', 'been', 'considered', 'and', 'benchmarked', 'against', 'ccsdtlevel', 'rotational', 'profiles', 'for', 'molecules', 'containing', 'heavy', 'halogens', 'all', 'functionals', 'except', 'm052x', 'and', 'm062x', 'fail', 'to', 'reproduce', 'barrier', 'heights', 'accurately', 'and', 'a', 'number', 'of', 'functionals', 'introduce', 'spurious', 'minima', 'dispersion', 'corrections', 'show', 'no', 'improvement', 'calibrated', 'torsioncorrected', 'atomcentered', 'potentials', 'rectify', 'the', 'shortcomings', 'of', 'pbe', 'and', 'also', 'improve', 'on', 'sigmahole', 'based', 'intermolecular', 'binding', 'in', 'dimers', 'and', 'crystals']] | [-0.05179316629259352, 0.03596403605076782, -0.06269098971871302, 0.1417566868913127, 0.05112475995222067, -0.1495498755585744, 0.04967067298538824, 0.38970411414320166, -0.16610711888766827, -0.3243616350946274, -0.04539882732391794, -0.33354505631042286, -0.09139962357252482, 0.1431895069223135, -0.0067442681546263554, 0.09526022735666087, 0.029200163742953398, -0.06023639859136273, -0.11869592485117152, -0.23419298556326154, 0.20915127092318492, 0.055921282611807135, 0.2667051199922695, 0.09834099508217595, 0.039934213652196245, -0.029758328942215428, 0.028002793553899577, 0.03412864204159284, -0.16644248655660354, 0.15541700644299705, 0.23905116466290138, -0.022340862251362427, 0.2425471505056076, -0.4977501575300034, -0.2653566255417474, 0.07012213663720684, 0.07956809174062615, 0.1392995045753196, -0.017826630554330397, -0.2535676021287416, 0.04949774129930487, -0.1888147417153727, -0.12789840790433216, -0.17209857240557036, 0.03926382654723018, 0.18534440707732389, -0.2352097021722968, 0.1565350803365173, -0.04509682170650427, 0.08361694666537199, -0.12448401348863511, -0.24939744193800428, -0.09974723320176944, 0.040564144443859286, 0.049357451914631305, -0.003825757484090455, 0.1697574811888502, -0.06028083575693791, -0.07253504960124005, 0.39807383580371103, -0.1163763416178049, -0.1810605906766215, 0.18427084081439657, -0.07177959882872219, -0.15564641073603738, 0.1629252222743123, 0.11536749760976973, 0.1078643102614962, -0.14402467603662095, 0.11178881050325296, 0.08485692426279941, 0.1624430536114155, 0.14876153243784893, 0.05989732184482025, 0.13150483823908948, 0.06894882832297143, 0.043242270515815535, 0.05043310496245233, -0.10799674134320045, -0.10052921476853179, -0.22330994604705298, -0.12756291168192005, -0.17159188037584636, -0.0446054605826577, -0.03351747880546138, -0.23617801611173025, 0.37636658208484347, 0.10173199058292394, 0.11931581027369867, 0.0566965173731776, 0.2291151774413091, 0.08405777067441414, 0.08811975430271173, 0.04634124076271311, 0.21763927062993196, 0.18659701367513218, -0.0004302889202780863, -0.22955372780462371, 0.08564515885441228, 0.04891848861378558] |
1,802.06034 | Fast Summation of Divergent Series and Resurgent Transseries in Quantum
Field Theories from Meijer-G Approximants | We demonstrate that a Meijer-G-function-based resummation approach can be
successfully applied to approximate the Borel sum of divergent series, and thus
to approximate the Borel-\'Ecalle summation of resurgent transseries in quantum
field theory (QFT). The proposed method is shown to vastly outperform the
conventional Borel-Pad\'e and Borel-Pad\'e-\'Ecalle summation methods. The
resulting Meijer-G approximants are easily parameterized by means of a
hypergeometric ansatz and can be thought of as a generalization to arbitrary
order of the Borel-Hypergeometric method [Mera {\it et al.} Phys. Rev. Lett.
{\bf 115}, 143001 (2015)]. Here we illustrate the ability of this technique in
various examples from QFT, traditionally employed as benchmark models for
resummation, such as: 0-dimensional $\phi^4$ theory, $\phi^4$ with degenerate
minima, self-interacting QFT in 0-dimensions, and the computation of one- and
two-instanton contributions in the quantum-mechanical double-well problem.
| hep-th math-ph math.MP quant-ph | we demonstrate that a meijergfunctionbased resummation approach can be successfully applied to approximate the borel sum of divergent series and thus to approximate the borelecalle summation of resurgent transseries in quantum field theory qft the proposed method is shown to vastly outperform the conventional borelpade and borelpadeecalle summation methods the resulting meijerg approximants are easily parameterized by means of a hypergeometric ansatz and can be thought of as a generalization to arbitrary order of the borelhypergeometric method mera it et al phys rev lett bf 115 143001 2015 here we illustrate the ability of this technique in various examples from qft traditionally employed as benchmark models for resummation such as 0dimensional phi4 theory phi4 with degenerate minima selfinteracting qft in 0dimensions and the computation of one and twoinstanton contributions in the quantummechanical doublewell problem | [['we', 'demonstrate', 'that', 'a', 'meijergfunctionbased', 'resummation', 'approach', 'can', 'be', 'successfully', 'applied', 'to', 'approximate', 'the', 'borel', 'sum', 'of', 'divergent', 'series', 'and', 'thus', 'to', 'approximate', 'the', 'borelecalle', 'summation', 'of', 'resurgent', 'transseries', 'in', 'quantum', 'field', 'theory', 'qft', 'the', 'proposed', 'method', 'is', 'shown', 'to', 'vastly', 'outperform', 'the', 'conventional', 'borelpade', 'and', 'borelpadeecalle', 'summation', 'methods', 'the', 'resulting', 'meijerg', 'approximants', 'are', 'easily', 'parameterized', 'by', 'means', 'of', 'a', 'hypergeometric', 'ansatz', 'and', 'can', 'be', 'thought', 'of', 'as', 'a', 'generalization', 'to', 'arbitrary', 'order', 'of', 'the', 'borelhypergeometric', 'method', 'mera', 'it', 'et', 'al', 'phys', 'rev', 'lett', 'bf', '115', '143001', '2015', 'here', 'we', 'illustrate', 'the', 'ability', 'of', 'this', 'technique', 'in', 'various', 'examples', 'from', 'qft', 'traditionally', 'employed', 'as', 'benchmark', 'models', 'for', 'resummation', 'such', 'as', '0dimensional', 'phi4', 'theory', 'phi4', 'with', 'degenerate', 'minima', 'selfinteracting', 'qft', 'in', '0dimensions', 'and', 'the', 'computation', 'of', 'one', 'and', 'twoinstanton', 'contributions', 'in', 'the', 'quantummechanical', 'doublewell', 'problem']] | [-0.039772560646479875, 0.04855216568550812, -0.13307103626609135, 0.06386567020358948, -0.07935647045468124, -0.12238215406138736, 0.022863086827923186, 0.31045144867295255, -0.21734818317569218, -0.29606542427880833, 0.014556358913138796, -0.26376639797997015, -0.23057233016006648, 0.21672535154323738, -0.06790173329175629, 0.12532477841640893, 0.012012082520567884, -0.02227232241465782, -0.0718135139063144, -0.30551912744457904, 0.22690359950782016, 0.03843090852919536, 0.26589846587739885, 0.05901191983228693, 0.07155053567039431, 0.019950787541949046, -0.0032385498464394076, 0.026604383496137765, -0.1183034725973602, 0.08082743533439218, 0.27889587403974125, 0.08044726021605758, 0.2509035927995753, -0.3931271485841045, -0.21954320612578437, 0.08925420927071873, 0.1860778040951118, 0.14360143959593888, 0.056051376501384836, -0.3289138872104769, 0.04596173715813515, -0.2556544066173956, -0.13360124040717403, -0.21447763897908423, 0.008015526248177944, -0.007091486608036436, -0.3043520281628634, 0.09947818949675331, 0.0016595951424768338, 0.006338281152756491, 0.02481477445958612, -0.08443693341329121, 0.01771627643521732, 0.006053226859148708, 0.04292452476220206, 0.08223728789733006, 0.08433136974210637, -0.09197466170567517, -0.18946328191982154, 0.36327714952998436, -0.07417253323991854, -0.2255719363832703, 0.1702890439890325, -0.10502424186023955, -0.128750528778451, 0.10259271958986153, 0.11803826321131335, 0.19012592717526086, -0.13481374574072946, 0.19273518835185455, -0.024162108458292027, 0.07982483771965444, 0.11633709488938061, 0.010984995921787161, 0.16214202294985836, 0.06888480572244869, -0.04608316638220388, 0.12201659250825357, -0.01999942454187056, -0.17192472323032024, -0.32656135737466124, -0.13164035884950023, -0.21578484821243016, 0.07523497797978612, -0.06863430534845415, -0.19666125114644484, 0.39279583643835325, 0.19665028465589365, 0.16819572371717256, 0.04680932044553069, 0.2614492956405649, 0.16611671889863477, 0.0683325681835413, 0.05797285284005249, 0.1967170577155999, 0.17318379540318765, 0.04927956837301071, -0.2065571303362958, -0.06602477476072426, 0.1547387229421964] |
1,802.06035 | Reconstruction of the evolutionary history of gene gains and losses
since the last universal common ancestor | Gene gains and losses have shaped the gene repertoire of species since the
universal last common ancestor to species today. Genes in extant species were
gained at different historical times via de novo creation of new genes,
duplication of existing genes or transfer from genes of another species (HGT),
and get lost gradually. With the increasing number of sequenced genomes, some
comparative analyses have been done to quantify the evolutionary history of
gene gains and losses in restricted lineages like vertebrates, insects, fungi,
plants and so on. Here, we have constructed and analyzed over 10,000 gene
family trees to reconstruct the gene content of ancestral genomes at an
unprecedented scale, covering hundreds of genomes across all domains of life.
This is the most comprehensive genome-wide analysis of all events in gene
evolutionary histories. We find that our results are largely consistent with
earlier, less complete comparative studies on specific lineages such as the
vertebrates, but find significant differences especially in recent evolutionary
histories. We find that the rate of gene gain varies widely among branches of
the species tree, and find that some periods of rapid gene duplication are
associated with great extinctions in geological history.
| q-bio.PE | gene gains and losses have shaped the gene repertoire of species since the universal last common ancestor to species today genes in extant species were gained at different historical times via de novo creation of new genes duplication of existing genes or transfer from genes of another species hgt and get lost gradually with the increasing number of sequenced genomes some comparative analyses have been done to quantify the evolutionary history of gene gains and losses in restricted lineages like vertebrates insects fungi plants and so on here we have constructed and analyzed over 10000 gene family trees to reconstruct the gene content of ancestral genomes at an unprecedented scale covering hundreds of genomes across all domains of life this is the most comprehensive genomewide analysis of all events in gene evolutionary histories we find that our results are largely consistent with earlier less complete comparative studies on specific lineages such as the vertebrates but find significant differences especially in recent evolutionary histories we find that the rate of gene gain varies widely among branches of the species tree and find that some periods of rapid gene duplication are associated with great extinctions in geological history | [['gene', 'gains', 'and', 'losses', 'have', 'shaped', 'the', 'gene', 'repertoire', 'of', 'species', 'since', 'the', 'universal', 'last', 'common', 'ancestor', 'to', 'species', 'today', 'genes', 'in', 'extant', 'species', 'were', 'gained', 'at', 'different', 'historical', 'times', 'via', 'de', 'novo', 'creation', 'of', 'new', 'genes', 'duplication', 'of', 'existing', 'genes', 'or', 'transfer', 'from', 'genes', 'of', 'another', 'species', 'hgt', 'and', 'get', 'lost', 'gradually', 'with', 'the', 'increasing', 'number', 'of', 'sequenced', 'genomes', 'some', 'comparative', 'analyses', 'have', 'been', 'done', 'to', 'quantify', 'the', 'evolutionary', 'history', 'of', 'gene', 'gains', 'and', 'losses', 'in', 'restricted', 'lineages', 'like', 'vertebrates', 'insects', 'fungi', 'plants', 'and', 'so', 'on', 'here', 'we', 'have', 'constructed', 'and', 'analyzed', 'over', '10000', 'gene', 'family', 'trees', 'to', 'reconstruct', 'the', 'gene', 'content', 'of', 'ancestral', 'genomes', 'at', 'an', 'unprecedented', 'scale', 'covering', 'hundreds', 'of', 'genomes', 'across', 'all', 'domains', 'of', 'life', 'this', 'is', 'the', 'most', 'comprehensive', 'genomewide', 'analysis', 'of', 'all', 'events', 'in', 'gene', 'evolutionary', 'histories', 'we', 'find', 'that', 'our', 'results', 'are', 'largely', 'consistent', 'with', 'earlier', 'less', 'complete', 'comparative', 'studies', 'on', 'specific', 'lineages', 'such', 'as', 'the', 'vertebrates', 'but', 'find', 'significant', 'differences', 'especially', 'in', 'recent', 'evolutionary', 'histories', 'we', 'find', 'that', 'the', 'rate', 'of', 'gene', 'gain', 'varies', 'widely', 'among', 'branches', 'of', 'the', 'species', 'tree', 'and', 'find', 'that', 'some', 'periods', 'of', 'rapid', 'gene', 'duplication', 'are', 'associated', 'with', 'great', 'extinctions', 'in', 'geological', 'history']] | [-0.0755052175830185, 0.13904530177320823, -0.010018413043010752, 0.09040677900917884, -0.042213593069697464, -0.0731864655212195, 0.08635826808001314, 0.39674461630591173, -0.23989549312296285, -0.2927491828057991, 0.02884203678695485, -0.3025650490767011, -0.17450138121696038, 0.18216480339321364, -0.10613769690069008, -0.029984333454417447, 0.1793392382191532, 0.03593297765533231, 0.08815300357361723, -0.3065881383206163, 0.2553112263154543, 0.08478047564502197, 0.2677214514198048, -0.043345651406395645, 0.11260345256210266, -0.09816042225622591, -0.12649634657237602, -0.023623621499888142, -0.16881869752277062, 0.13012853225488785, 0.36369598071490017, 0.2871079565470145, 0.2826423057834903, -0.45500883502809675, -0.25187148654635055, 0.1570988202880954, 0.21025415468362293, 0.19369362628714618, -0.055882602878988774, -0.21065440258053986, 0.07349287530072318, -0.159327888828631, -0.033160278633176304, -0.030648851987539923, 0.08172634229829003, 0.06555580615294071, -0.1763565393487866, 0.15885713880784258, -0.04115475004548397, 0.18069244017800773, -0.03165788346027233, -0.21865897590760142, -0.11912286955487858, 0.21186561623649977, 0.11963614247791583, 0.0005209735791883146, 0.16837009568983802, -0.08799107566746713, -0.1504777827328641, 0.2644881069602573, -0.009961204717353898, -0.12994964841791257, 0.2677218469741222, -0.14390977121870585, -0.20779623210012, 0.14320250860045958, 0.15140566801205657, 0.10075102090046797, -0.2502097233094047, 0.0047384713597035, 0.03279272375666365, 0.16361348543373144, 0.1841045917874221, 0.011101155255550556, 0.20789757146582016, 0.19047378199127485, 0.012084861018704441, 0.06991578891935131, -0.06611400415523368, -0.15566386454928743, -0.11567464497472559, -0.1276114055867858, -0.07145742973555069, 0.04100007594774515, -0.127678729088446, -0.2051465298970971, 0.4019578293973238, 0.10698086012676608, 0.21431719033969376, 0.08998660556838387, 0.21380466893457864, -0.03751450186899426, 0.15935568178395684, -0.01131775465613345, 0.12233046483758087, 0.06741013585433021, 0.0831294245091362, -0.24493228875686254, 0.20160086611962916, -0.06036643610022278] |
1,802.06036 | Learning multiagent coordination in the absence of communication
channels | In this work, we develop a reinforcement learning protocol for a multiagent
coordination task in a discrete state and action space: an iterated prisoner's
dilemma game extended into a team based, winner-take all tournament, which
forces the agents to collude in order to maximize their reward. By disallowing
extra communication channels, the agents are forced to embed their coordination
strategy into their actions in the prisoner's dilemma game.
We develop a representation of the iterated prisoners dilemma that makes it
amenable to Q-learning. We find that the reinforcement learning strategy is
able to consistently train agents that can win the winner take all iterated
prisoners dilemma tournament.
By using a game with discrete state and action space, we are able to better
analyze and understand both the dynamics and the communication protocols that
are established between the agents. We find that the agents adapt a number of
interesting behaviors, such as the formation of benevolent dictators, that
minimize inequality of scores. We also find that the agents settle on a
remarkably consistent symbology in their actions, such that agents from
independent trials are able to collude with each other without further
training.
| cs.GT | in this work we develop a reinforcement learning protocol for a multiagent coordination task in a discrete state and action space an iterated prisoners dilemma game extended into a team based winnertake all tournament which forces the agents to collude in order to maximize their reward by disallowing extra communication channels the agents are forced to embed their coordination strategy into their actions in the prisoners dilemma game we develop a representation of the iterated prisoners dilemma that makes it amenable to qlearning we find that the reinforcement learning strategy is able to consistently train agents that can win the winner take all iterated prisoners dilemma tournament by using a game with discrete state and action space we are able to better analyze and understand both the dynamics and the communication protocols that are established between the agents we find that the agents adapt a number of interesting behaviors such as the formation of benevolent dictators that minimize inequality of scores we also find that the agents settle on a remarkably consistent symbology in their actions such that agents from independent trials are able to collude with each other without further training | [['in', 'this', 'work', 'we', 'develop', 'a', 'reinforcement', 'learning', 'protocol', 'for', 'a', 'multiagent', 'coordination', 'task', 'in', 'a', 'discrete', 'state', 'and', 'action', 'space', 'an', 'iterated', 'prisoners', 'dilemma', 'game', 'extended', 'into', 'a', 'team', 'based', 'winnertake', 'all', 'tournament', 'which', 'forces', 'the', 'agents', 'to', 'collude', 'in', 'order', 'to', 'maximize', 'their', 'reward', 'by', 'disallowing', 'extra', 'communication', 'channels', 'the', 'agents', 'are', 'forced', 'to', 'embed', 'their', 'coordination', 'strategy', 'into', 'their', 'actions', 'in', 'the', 'prisoners', 'dilemma', 'game', 'we', 'develop', 'a', 'representation', 'of', 'the', 'iterated', 'prisoners', 'dilemma', 'that', 'makes', 'it', 'amenable', 'to', 'qlearning', 'we', 'find', 'that', 'the', 'reinforcement', 'learning', 'strategy', 'is', 'able', 'to', 'consistently', 'train', 'agents', 'that', 'can', 'win', 'the', 'winner', 'take', 'all', 'iterated', 'prisoners', 'dilemma', 'tournament', 'by', 'using', 'a', 'game', 'with', 'discrete', 'state', 'and', 'action', 'space', 'we', 'are', 'able', 'to', 'better', 'analyze', 'and', 'understand', 'both', 'the', 'dynamics', 'and', 'the', 'communication', 'protocols', 'that', 'are', 'established', 'between', 'the', 'agents', 'we', 'find', 'that', 'the', 'agents', 'adapt', 'a', 'number', 'of', 'interesting', 'behaviors', 'such', 'as', 'the', 'formation', 'of', 'benevolent', 'dictators', 'that', 'minimize', 'inequality', 'of', 'scores', 'we', 'also', 'find', 'that', 'the', 'agents', 'settle', 'on', 'a', 'remarkably', 'consistent', 'symbology', 'in', 'their', 'actions', 'such', 'that', 'agents', 'from', 'independent', 'trials', 'are', 'able', 'to', 'collude', 'with', 'each', 'other', 'without', 'further', 'training']] | [-0.09374383389242774, 0.08699356632239212, -0.1521658965761905, 0.10245541235461285, -0.11482559223976278, -0.221641766215816, 0.12164835289062162, 0.46461310069910516, -0.28538218731821285, -0.28991800366095705, 0.054392268807451724, -0.2607351296315584, -0.21459248128678668, 0.04521693674486657, -0.15525049331027488, -0.012248383717323745, 0.07830913290649613, 0.06313383475882221, 0.08418411286230838, -0.34171875243572547, 0.3346620576982801, -0.0023075914636975963, 0.21696397986906674, -0.028460483214237692, 0.12506989303595967, 0.04308853154582659, 0.044636326159365206, 0.05806895611650452, -0.11411891229047211, 0.08223137963582708, 0.33083084798466744, 0.18183831840229228, 0.41393693543590254, -0.4510651916455653, -0.1542834170621025, 0.16765943310755008, 0.15409262548078886, 0.08475517633880601, 0.005195275648175227, -0.32856419020337274, 0.04937156856654904, -0.2272877407538173, -0.03958230159191795, -0.10665683350793978, -0.029649238605588598, 0.02915968122484933, -0.32344189117521205, -0.06043141927336664, 0.045323991638496125, 0.021897165806895776, -0.08392215294901194, -0.06747954590879966, -0.008736039663016485, 0.22230146612352764, 0.036694368838786066, -0.010286649850596971, 0.14053931480995258, -0.16265127874047774, -0.24275262465368938, 0.39399199812375596, -0.028154715829216803, -0.1750122101487426, 0.17717167369762912, -0.0708773566473334, -0.12480875859963488, 0.05970987797037001, 0.18892166052618264, 0.12803248265826422, -0.1347113667977535, 1.6523124064996606e-05, -0.08274712553979215, 0.18099373624859993, 0.02531351213567739, 0.007756754107461238, 0.11335174152286265, 0.17401665885059933, 0.17480845059297434, 0.08927195319504823, 0.03296965215091852, -0.218868249330026, -0.220875192060579, -0.13567129280284065, -0.13209922035488042, 0.027966984767096206, -0.0914223374605681, -0.09511742844729056, 0.313257270868068, 0.1883174417386836, 0.16126495856713718, 0.15806257143112007, 0.28091188988048604, 0.032847068613243935, 0.07362558377214283, 0.0846509231539097, 0.19834992743014354, 0.026234139502718946, 0.09209450038822846, -0.252055298262739, 0.12226227116624762, 0.03238861230616482] |
1,802.06037 | Policy Evaluation and Optimization with Continuous Treatments | We study the problem of policy evaluation and learning from batched
contextual bandit data when treatments are continuous, going beyond previous
work on discrete treatments. Previous work for discrete treatment/action spaces
focuses on inverse probability weighting (IPW) and doubly robust (DR) methods
that use a rejection sampling approach for evaluation and the equivalent
weighted classification problem for learning. In the continuous setting, this
reduction fails as we would almost surely reject all observations. To tackle
the case of continuous treatments, we extend the IPW and DR approaches to the
continuous setting using a kernel function that leverages treatment proximity
to attenuate discrete rejection. Our policy estimator is consistent and we
characterize the optimal bandwidth. The resulting continuous policy optimizer
(CPO) approach using our estimator achieves convergent regret and approaches
the best-in-class policy for learnable policy classes. We demonstrate that the
estimator performs well and, in particular, outperforms a discretization-based
benchmark. We further study the performance of our policy optimizer in a case
study on personalized dosing based on a dataset of Warfarin patients, their
covariates, and final therapeutic doses. Our learned policy outperforms
benchmarks and nears the oracle-best linear policy.
| stat.ML cs.LG | we study the problem of policy evaluation and learning from batched contextual bandit data when treatments are continuous going beyond previous work on discrete treatments previous work for discrete treatmentaction spaces focuses on inverse probability weighting ipw and doubly robust dr methods that use a rejection sampling approach for evaluation and the equivalent weighted classification problem for learning in the continuous setting this reduction fails as we would almost surely reject all observations to tackle the case of continuous treatments we extend the ipw and dr approaches to the continuous setting using a kernel function that leverages treatment proximity to attenuate discrete rejection our policy estimator is consistent and we characterize the optimal bandwidth the resulting continuous policy optimizer cpo approach using our estimator achieves convergent regret and approaches the bestinclass policy for learnable policy classes we demonstrate that the estimator performs well and in particular outperforms a discretizationbased benchmark we further study the performance of our policy optimizer in a case study on personalized dosing based on a dataset of warfarin patients their covariates and final therapeutic doses our learned policy outperforms benchmarks and nears the oraclebest linear policy | [['we', 'study', 'the', 'problem', 'of', 'policy', 'evaluation', 'and', 'learning', 'from', 'batched', 'contextual', 'bandit', 'data', 'when', 'treatments', 'are', 'continuous', 'going', 'beyond', 'previous', 'work', 'on', 'discrete', 'treatments', 'previous', 'work', 'for', 'discrete', 'treatmentaction', 'spaces', 'focuses', 'on', 'inverse', 'probability', 'weighting', 'ipw', 'and', 'doubly', 'robust', 'dr', 'methods', 'that', 'use', 'a', 'rejection', 'sampling', 'approach', 'for', 'evaluation', 'and', 'the', 'equivalent', 'weighted', 'classification', 'problem', 'for', 'learning', 'in', 'the', 'continuous', 'setting', 'this', 'reduction', 'fails', 'as', 'we', 'would', 'almost', 'surely', 'reject', 'all', 'observations', 'to', 'tackle', 'the', 'case', 'of', 'continuous', 'treatments', 'we', 'extend', 'the', 'ipw', 'and', 'dr', 'approaches', 'to', 'the', 'continuous', 'setting', 'using', 'a', 'kernel', 'function', 'that', 'leverages', 'treatment', 'proximity', 'to', 'attenuate', 'discrete', 'rejection', 'our', 'policy', 'estimator', 'is', 'consistent', 'and', 'we', 'characterize', 'the', 'optimal', 'bandwidth', 'the', 'resulting', 'continuous', 'policy', 'optimizer', 'cpo', 'approach', 'using', 'our', 'estimator', 'achieves', 'convergent', 'regret', 'and', 'approaches', 'the', 'bestinclass', 'policy', 'for', 'learnable', 'policy', 'classes', 'we', 'demonstrate', 'that', 'the', 'estimator', 'performs', 'well', 'and', 'in', 'particular', 'outperforms', 'a', 'discretizationbased', 'benchmark', 'we', 'further', 'study', 'the', 'performance', 'of', 'our', 'policy', 'optimizer', 'in', 'a', 'case', 'study', 'on', 'personalized', 'dosing', 'based', 'on', 'a', 'dataset', 'of', 'warfarin', 'patients', 'their', 'covariates', 'and', 'final', 'therapeutic', 'doses', 'our', 'learned', 'policy', 'outperforms', 'benchmarks', 'and', 'nears', 'the', 'oraclebest', 'linear', 'policy']] | [0.0016482725907909744, -0.03206910073578833, -0.08863490017284541, 0.10361221928070201, -0.10674782717808526, -0.17347597035311876, 0.14632056658376044, 0.4854427785315412, -0.2302919167906363, -0.24231742012612967, 0.1109649977761945, -0.28069706080838086, -0.17336526593351934, 0.22475869319045005, -0.1754773491349547, 0.11437072537398521, 0.10398106357427017, 0.004025239030833039, -0.07364902604356448, -0.2983741744104377, 0.2899345025355789, 0.06483954973295926, 0.33839993655404194, -0.020315540288178686, 0.13644996648926802, 0.05008640681130891, -0.0544053612615863, 0.024550288073480763, -0.11282741525664801, 0.10279917312250968, 0.30029742819247174, 0.21322120110841192, 0.39548042663273975, -0.3314899416675078, -0.19797898448032744, 0.11287464380779481, 0.09386325463345473, 0.07670572729028285, -0.016771781881230862, -0.29439196157259273, 0.06276776800625661, -0.17156624776667895, -0.0009644237691239315, -0.13259752007372222, -0.09189910975165982, -0.0057048440398153, -0.3965587391210918, 0.06846434287627802, 0.06775690797850133, 0.01569142101946822, -0.11315727554895777, -0.15412612779541535, 0.05836601014263888, 0.10329795230822167, 0.08340324961333882, 0.05042804875336786, 0.16815498784095287, -0.10533844460634158, -0.20011537822280476, 0.30291843098251425, -0.06810254242736846, -0.20361594622707033, 0.16283941279447817, -0.057910636071105824, -0.14128586965888004, 0.10232805003947083, 0.23759086238359042, 0.1759455831903479, -0.13136948085245442, 0.058378489467283176, -0.06631403006340793, 0.14090789565160136, 0.04373042612891406, -0.026755319760884456, 0.04451244821935456, 0.23427252920141364, 0.1460311346578392, 0.1292244100750008, -0.08229264802673456, -0.11572989084147303, -0.2588657959800293, -0.10373095874402156, -0.15784250866644026, -0.031073369324192444, -0.09698939016619833, -0.15875265505313477, 0.38087615638629513, 0.21973463192834777, 0.13296664879469083, 0.18740908278863222, 0.33762475220050586, 0.08314195262117094, 0.02084670012118295, 0.12371632930862302, 0.16362976092855108, 0.032211096726352986, 0.07047794489072329, -0.24166731714355225, 0.12197661382719586, 0.05047636714694585] |
1,802.06038 | Finding The Greedy, Prodigal, and Suicidal Contracts at Scale | Smart contracts---stateful executable objects hosted on blockchains like
Ethereum---carry billions of dollars worth of coins and cannot be updated once
deployed. We present a new systematic characterization of a class of trace
vulnerabilities, which result from analyzing multiple invocations of a contract
over its lifetime. We focus attention on three example properties of such trace
vulnerabilities: finding contracts that either lock funds indefinitely, leak
them carelessly to arbitrary users, or can be killed by anyone. We implemented
MAIAN, the first tool for precisely specifying and reasoning about trace
properties, which employs inter-procedural symbolic analysis and concrete
validator for exhibiting real exploits. Our analysis of nearly one million
contracts flags 34,200 (2,365 distinct) contracts vulnerable, in 10 seconds per
contract. On a subset of3,759 contracts which we sampled for concrete
validation and manual analysis, we reproduce real exploits at a true positive
rate of 89%, yielding exploits for3,686 contracts. Our tool finds exploits for
the infamous Parity bug that indirectly locked 200 million dollars worth in
Ether, which previous analyses failed to capture.
| cs.CR | smart contractsstateful executable objects hosted on blockchains like ethereumcarry billions of dollars worth of coins and cannot be updated once deployed we present a new systematic characterization of a class of trace vulnerabilities which result from analyzing multiple invocations of a contract over its lifetime we focus attention on three example properties of such trace vulnerabilities finding contracts that either lock funds indefinitely leak them carelessly to arbitrary users or can be killed by anyone we implemented maian the first tool for precisely specifying and reasoning about trace properties which employs interprocedural symbolic analysis and concrete validator for exhibiting real exploits our analysis of nearly one million contracts flags 34200 2365 distinct contracts vulnerable in 10 seconds per contract on a subset of3759 contracts which we sampled for concrete validation and manual analysis we reproduce real exploits at a true positive rate of 89 yielding exploits for3686 contracts our tool finds exploits for the infamous parity bug that indirectly locked 200 million dollars worth in ether which previous analyses failed to capture | [['smart', 'contractsstateful', 'executable', 'objects', 'hosted', 'on', 'blockchains', 'like', 'ethereumcarry', 'billions', 'of', 'dollars', 'worth', 'of', 'coins', 'and', 'can', 'not', 'be', 'updated', 'once', 'deployed', 'we', 'present', 'a', 'new', 'systematic', 'characterization', 'of', 'a', 'class', 'of', 'trace', 'vulnerabilities', 'which', 'result', 'from', 'analyzing', 'multiple', 'invocations', 'of', 'a', 'contract', 'over', 'its', 'lifetime', 'we', 'focus', 'attention', 'on', 'three', 'example', 'properties', 'of', 'such', 'trace', 'vulnerabilities', 'finding', 'contracts', 'that', 'either', 'lock', 'funds', 'indefinitely', 'leak', 'them', 'carelessly', 'to', 'arbitrary', 'users', 'or', 'can', 'be', 'killed', 'by', 'anyone', 'we', 'implemented', 'maian', 'the', 'first', 'tool', 'for', 'precisely', 'specifying', 'and', 'reasoning', 'about', 'trace', 'properties', 'which', 'employs', 'interprocedural', 'symbolic', 'analysis', 'and', 'concrete', 'validator', 'for', 'exhibiting', 'real', 'exploits', 'our', 'analysis', 'of', 'nearly', 'one', 'million', 'contracts', 'flags', '34200', '2365', 'distinct', 'contracts', 'vulnerable', 'in', '10', 'seconds', 'per', 'contract', 'on', 'a', 'subset', 'of3759', 'contracts', 'which', 'we', 'sampled', 'for', 'concrete', 'validation', 'and', 'manual', 'analysis', 'we', 'reproduce', 'real', 'exploits', 'at', 'a', 'true', 'positive', 'rate', 'of', '89', 'yielding', 'exploits', 'for3686', 'contracts', 'our', 'tool', 'finds', 'exploits', 'for', 'the', 'infamous', 'parity', 'bug', 'that', 'indirectly', 'locked', '200', 'million', 'dollars', 'worth', 'in', 'ether', 'which', 'previous', 'analyses', 'failed', 'to', 'capture']] | [-0.12799250251964894, 0.032350461467163645, -0.0734063956822397, 0.06551726515722757, -0.14073007192440376, -0.1990689680643915, 0.12431933042665798, 0.3656175496045522, -0.2594969239041299, -0.34530143070307945, 0.15595551083299392, -0.3243329122517548, -0.07299085571082946, 0.21863786746646016, -0.08444369533015582, 0.030237461478954102, 0.07445248960333313, 0.016412304968065665, -0.008796860218016029, -0.2944820428874991, 0.26569901781664146, 0.03561312567113625, 0.22054501239650934, 0.03457852747311869, 0.09352763636528465, 0.02814118555763703, -0.07758593002981144, -0.02331896465617472, -0.07067435136189319, 0.12471367401582563, 0.2814752616010562, 0.22747790432273002, 0.3305124005555136, -0.45174916501262946, -0.13283624702403712, 0.11712594606500944, 0.10857769935029353, 0.0717539535640198, -0.04004788732164523, -0.29085804463481296, 0.14445370375624897, -0.2399323180619025, -0.12779431124419965, -0.1184299307816779, 0.024064346917899337, -0.012176209691950973, -0.2329053590938583, -0.00042413422994003327, 0.0428984760053032, 0.0868895076531401, -0.006099890886170198, -0.07113339189819233, -0.03651041938493887, 0.16925151956624568, 0.03716502260294057, -0.04453180206195078, 0.1911290053021676, -0.027316541379787486, -0.1216663906272657, 0.3479159116566538, -0.04087983319970841, -0.10425773501942703, 0.16342773053427032, -0.044043541311503884, -0.16206130474906214, 0.12805451495673306, 0.19718875492292787, 0.1468008533245633, -0.1679918032005697, -0.0069318199439621165, -0.03669628504842163, 0.22605865708870176, 0.12251908417991893, 0.0028989877437470024, 0.25018314266588515, 0.15922896875958042, 0.04694402295939937, 0.11563848699463955, -0.021531112988592366, -0.12311505580399029, -0.2784140597597395, -0.16803629220948516, -0.12498062525591451, 0.06296707310270822, -0.06906233024664926, -0.14562054693247165, 0.398109733451208, 0.18619763007398674, 0.14453868289662156, 0.07324658093059402, 0.31727343419020226, -0.0021714406118666877, 0.1324640764509088, 0.1255938235982628, 0.13968129163819873, -0.018680049742231825, 0.1162533448645873, -0.11107092795748554, 0.149234262635251, 0.004611741846237711] |
1,802.06039 | Projected WIMP sensitivity of the LUX-ZEPLIN (LZ) dark matter experiment | LUX-ZEPLIN (LZ) is a next generation dark matter direct detection experiment
that will operate 4850 feet underground at the Sanford Underground Research
Facility (SURF) in Lead, South Dakota, USA. Using a two-phase xenon detector
with an active mass of 7~tonnes, LZ will search primarily for low-energy
interactions with Weakly Interacting Massive Particles (WIMPs), which are
hypothesized to make up the dark matter in our galactic halo. In this paper,
the projected WIMP sensitivity of LZ is presented based on the latest
background estimates and simulations of the detector. For a 1000~live day run
using a 5.6~tonne fiducial mass, LZ is projected to exclude at 90\% confidence
level spin-independent WIMP-nucleon cross sections above $1.4 \times
10^{-48}$~cm$^{2}$ for a 40~$\mathrm{GeV}/c^{2}$ mass WIMP. Additionally, a
$5\sigma$ discovery potential is projected reaching cross sections below the
exclusion limits of recent experiments. For spin-dependent
WIMP-neutron(-proton) scattering, a sensitivity of $2.3 \times
10^{-43}$~cm$^{2}$ ($7.1 \times 10^{-42}$~cm$^{2}$) for a
40~$\mathrm{GeV}/c^{2}$ mass WIMP is expected. With underground installation
well underway, LZ is on track for commissioning at SURF in 2020.
| astro-ph.IM astro-ph.CO hep-ex physics.ins-det | luxzeplin lz is a next generation dark matter direct detection experiment that will operate 4850 feet underground at the sanford underground research facility surf in lead south dakota usa using a twophase xenon detector with an active mass of 7tonnes lz will search primarily for lowenergy interactions with weakly interacting massive particles wimps which are hypothesized to make up the dark matter in our galactic halo in this paper the projected wimp sensitivity of lz is presented based on the latest background estimates and simulations of the detector for a 1000live day run using a 56tonne fiducial mass lz is projected to exclude at 90 confidence level spinindependent wimpnucleon cross sections above 14 times 1048cm2 for a 40mathrmgevc2 mass wimp additionally a 5sigma discovery potential is projected reaching cross sections below the exclusion limits of recent experiments for spindependent wimpneutronproton scattering a sensitivity of 23 times 1043cm2 71 times 1042cm2 for a 40mathrmgevc2 mass wimp is expected with underground installation well underway lz is on track for commissioning at surf in 2020 | [['luxzeplin', 'lz', 'is', 'a', 'next', 'generation', 'dark', 'matter', 'direct', 'detection', 'experiment', 'that', 'will', 'operate', '4850', 'feet', 'underground', 'at', 'the', 'sanford', 'underground', 'research', 'facility', 'surf', 'in', 'lead', 'south', 'dakota', 'usa', 'using', 'a', 'twophase', 'xenon', 'detector', 'with', 'an', 'active', 'mass', 'of', '7tonnes', 'lz', 'will', 'search', 'primarily', 'for', 'lowenergy', 'interactions', 'with', 'weakly', 'interacting', 'massive', 'particles', 'wimps', 'which', 'are', 'hypothesized', 'to', 'make', 'up', 'the', 'dark', 'matter', 'in', 'our', 'galactic', 'halo', 'in', 'this', 'paper', 'the', 'projected', 'wimp', 'sensitivity', 'of', 'lz', 'is', 'presented', 'based', 'on', 'the', 'latest', 'background', 'estimates', 'and', 'simulations', 'of', 'the', 'detector', 'for', 'a', '1000live', 'day', 'run', 'using', 'a', '56tonne', 'fiducial', 'mass', 'lz', 'is', 'projected', 'to', 'exclude', 'at', '90', 'confidence', 'level', 'spinindependent', 'wimpnucleon', 'cross', 'sections', 'above', '14', 'times', '1048cm2', 'for', 'a', '40mathrmgevc2', 'mass', 'wimp', 'additionally', 'a', '5sigma', 'discovery', 'potential', 'is', 'projected', 'reaching', 'cross', 'sections', 'below', 'the', 'exclusion', 'limits', 'of', 'recent', 'experiments', 'for', 'spindependent', 'wimpneutronproton', 'scattering', 'a', 'sensitivity', 'of', '23', 'times', '1043cm2', '71', 'times', '1042cm2', 'for', 'a', '40mathrmgevc2', 'mass', 'wimp', 'is', 'expected', 'with', 'underground', 'installation', 'well', 'underway', 'lz', 'is', 'on', 'track', 'for', 'commissioning', 'at', 'surf', 'in', '2020']] | [-0.060419894043539014, 0.2087475735462232, -0.05927196179518042, 0.09334356649250272, -0.03937027553107841, -0.09509694621686829, 0.038954056958322256, 0.31378484541476004, -0.10818910546617959, -0.38707098441392734, 0.06442628684025144, -0.3426516313117249, 0.023765325440562392, 0.23620730771774576, 0.06370110701565328, 0.031101357264649923, 0.08042813844527433, 0.03700557275692378, -0.10320580038356315, -0.27747457884709165, 0.1825076050319326, 0.18974839809687774, 0.23819042503993754, 0.10330259777674097, 0.14544009996229565, -0.011945784682953627, -0.055103169445611215, -0.11861490880202022, -0.12863375645501723, 0.017424595630813413, 0.3357226228837118, 0.11345181271628094, 0.1285811318170302, -0.3985748804557177, -0.09140731536346185, 0.1598905053352537, 0.1299342408810565, 0.030632427324358075, -0.10958139927117896, -0.4025845129865627, 0.01697035465800872, -0.21898916453277362, -0.12802713697610502, 0.0748978855639719, 0.009855236355329583, 0.0017082641141180613, -0.2435274440952308, 0.08169384782939601, -0.06648040542227611, -0.010460585041508718, -0.032241996833547504, -0.18497490828594, 0.05429635383760088, -0.05375121743489697, -0.009434740470459491, 0.06658926086612417, 0.29020066386441545, -0.18794387761086362, -0.07512451399387678, 0.3702332611350011, -0.11085867842350818, -0.06207952776101012, 0.22698569342214042, -0.17288774297004167, -0.14866415295818466, 0.19047861569275382, 0.2545732253408231, 0.060135508757484565, -0.2052644337213204, 0.09592556532870898, -0.018927828657320855, 0.1925558987719241, 0.09741166278725616, -0.04889212593727636, 0.33983952137841583, 0.3439388570427163, 0.18214294526646016, -0.045095607046997804, -0.26242819042289195, -0.044098613618021726, -0.36524172663471544, -0.12945768198832594, -0.07790608364700174, -0.0012554203258667348, 0.012495833612886326, -0.03080643066476482, 0.30979541961126533, 0.14081715935365544, 0.19100557511209573, 0.07754026343003258, 0.3103326173510654, 0.03162926227708513, 0.070048861422696, -0.009377642560384574, 0.37526160761702554, 0.10825765559141255, 0.1019164520784344, -0.15535773710559117, -0.014361673253988332, -0.009824661023777687] |
1,802.0604 | Fast dynamics in glass-forming salol investigated by dielectric
spectroscopy | We analyze dielectric-loss spectra of glass forming salol extending up to 400
GHz allowing for the detection of the high-frequency minimum, where the fast
critical dynamics predicted by the mode-coupling theory of the glass transition
should prevail. Indeed, we find such a minimum which, moreover, well fulfills
the critical scaling predicted by the theory. This includes the spectral shape
of the minimum, the critical temperature dependence of the minimum frequency
and amplitude, and the critical temperature dependence of the alpha-relaxation
rate at high temperatures. The minimum exponents a and b leading to a system
parameter lambda = 0.63 and the critical temperature Tc = 256 K are all in
reasonable agreement with previous investigations of salol using different
methods. Salol was one of the first materials where mode-coupling theory was
tested and initial dielectric measurements were taken as an argument against
the universal applicability of this theory.
| cond-mat.soft cond-mat.dis-nn | we analyze dielectricloss spectra of glass forming salol extending up to 400 ghz allowing for the detection of the highfrequency minimum where the fast critical dynamics predicted by the modecoupling theory of the glass transition should prevail indeed we find such a minimum which moreover well fulfills the critical scaling predicted by the theory this includes the spectral shape of the minimum the critical temperature dependence of the minimum frequency and amplitude and the critical temperature dependence of the alpharelaxation rate at high temperatures the minimum exponents a and b leading to a system parameter lambda 063 and the critical temperature tc 256 k are all in reasonable agreement with previous investigations of salol using different methods salol was one of the first materials where modecoupling theory was tested and initial dielectric measurements were taken as an argument against the universal applicability of this theory | [['we', 'analyze', 'dielectricloss', 'spectra', 'of', 'glass', 'forming', 'salol', 'extending', 'up', 'to', '400', 'ghz', 'allowing', 'for', 'the', 'detection', 'of', 'the', 'highfrequency', 'minimum', 'where', 'the', 'fast', 'critical', 'dynamics', 'predicted', 'by', 'the', 'modecoupling', 'theory', 'of', 'the', 'glass', 'transition', 'should', 'prevail', 'indeed', 'we', 'find', 'such', 'a', 'minimum', 'which', 'moreover', 'well', 'fulfills', 'the', 'critical', 'scaling', 'predicted', 'by', 'the', 'theory', 'this', 'includes', 'the', 'spectral', 'shape', 'of', 'the', 'minimum', 'the', 'critical', 'temperature', 'dependence', 'of', 'the', 'minimum', 'frequency', 'and', 'amplitude', 'and', 'the', 'critical', 'temperature', 'dependence', 'of', 'the', 'alpharelaxation', 'rate', 'at', 'high', 'temperatures', 'the', 'minimum', 'exponents', 'a', 'and', 'b', 'leading', 'to', 'a', 'system', 'parameter', 'lambda', '063', 'and', 'the', 'critical', 'temperature', 'tc', '256', 'k', 'are', 'all', 'in', 'reasonable', 'agreement', 'with', 'previous', 'investigations', 'of', 'salol', 'using', 'different', 'methods', 'salol', 'was', 'one', 'of', 'the', 'first', 'materials', 'where', 'modecoupling', 'theory', 'was', 'tested', 'and', 'initial', 'dielectric', 'measurements', 'were', 'taken', 'as', 'an', 'argument', 'against', 'the', 'universal', 'applicability', 'of', 'this', 'theory']] | [-0.11877310734578511, 0.18516384270262481, -0.09235893246821231, 0.01836760958960642, 0.0013732886808510455, -0.133783267633084, 0.0937745679629087, 0.3096184937708636, -0.20458645778126083, -0.30492477984969607, 0.09902264561565567, -0.30176301224855706, -0.10305870513224767, 0.17901196985298562, 0.03703223429086696, 0.10127424813981634, -0.05987380733454807, 0.05065531859185689, -0.10121642438753042, -0.1883211678877059, 0.260149481897113, 0.0899402441039759, 0.3122958125055043, 0.10652506962328011, 0.05623935928936893, -0.007752282633898883, 0.03427882534257757, 0.05214844498227143, -0.21411074506209438, 0.03068709993448869, 0.22366829734932658, 0.03788422125702103, 0.24042020031386832, -0.3628870062465366, -0.2346327690110128, 0.06161277631892719, 0.0960453755174563, 0.09345535137577422, 0.01743995507584057, -0.21488118075002502, 0.10238023194768983, -0.13500760679663573, -0.15069319187669963, -0.05056290547751511, 0.04073335220325842, 0.027875174024504505, -0.2636585694789473, 0.1240973645051579, 0.022698361537348118, 0.09537663768019734, -0.09413698347634636, -0.1367238668115331, -0.02383628640705461, 0.112039977443702, 0.027063457967920437, 0.06381904613873404, 0.16624813264287594, -0.1204193869610511, -0.062422489184731, 0.35719139239194597, -0.08412970588768884, -0.029762336137031928, 0.19745924898597877, -0.19308099164239442, -0.0756845927810193, 0.1677020476717088, 0.10149438485596976, 0.09442764002556538, -0.12111990977347079, 0.05455959346848734, 0.019411186408736587, 0.19850619850007611, 0.06343156889973518, 0.01178525654980452, 0.2036148398749194, 0.19050817240753937, 0.0021956077802719343, 0.14248277223668993, -0.11786001195367943, -0.0889288273732139, -0.2924259598892402, -0.10126063742791303, -0.17944016959599038, 0.026240392492683087, -0.16433973055518436, -0.1430907711942887, 0.3846229436264063, 0.17063660439129713, 0.2287676235573599, 0.06646482200934163, 0.24059857088124975, 0.144885716343803, 0.07476620784412565, 0.06497457762695073, 0.28072833653681706, 0.1576250549421982, 0.1188430384435277, -0.2578123907894931, 0.04141461583397662, 0.018431600196183555] |
1,802.06041 | Fluency Over Adequacy: A Pilot Study in Measuring User Trust in
Imperfect MT | Although measuring intrinsic quality has been a key factor in the advancement
of Machine Translation (MT), successfully deploying MT requires considering not
just intrinsic quality but also the user experience, including aspects such as
trust. This work introduces a method of studying how users modulate their trust
in an MT system after seeing errorful (disfluent or inadequate) output amidst
good (fluent and adequate) output. We conduct a survey to determine how users
respond to good translations compared to translations that are either adequate
but not fluent, or fluent but not adequate. In this pilot study, users
responded strongly to disfluent translations, but were, surprisingly, much less
concerned with adequacy.
| cs.CL | although measuring intrinsic quality has been a key factor in the advancement of machine translation mt successfully deploying mt requires considering not just intrinsic quality but also the user experience including aspects such as trust this work introduces a method of studying how users modulate their trust in an mt system after seeing errorful disfluent or inadequate output amidst good fluent and adequate output we conduct a survey to determine how users respond to good translations compared to translations that are either adequate but not fluent or fluent but not adequate in this pilot study users responded strongly to disfluent translations but were surprisingly much less concerned with adequacy | [['although', 'measuring', 'intrinsic', 'quality', 'has', 'been', 'a', 'key', 'factor', 'in', 'the', 'advancement', 'of', 'machine', 'translation', 'mt', 'successfully', 'deploying', 'mt', 'requires', 'considering', 'not', 'just', 'intrinsic', 'quality', 'but', 'also', 'the', 'user', 'experience', 'including', 'aspects', 'such', 'as', 'trust', 'this', 'work', 'introduces', 'a', 'method', 'of', 'studying', 'how', 'users', 'modulate', 'their', 'trust', 'in', 'an', 'mt', 'system', 'after', 'seeing', 'errorful', 'disfluent', 'or', 'inadequate', 'output', 'amidst', 'good', 'fluent', 'and', 'adequate', 'output', 'we', 'conduct', 'a', 'survey', 'to', 'determine', 'how', 'users', 'respond', 'to', 'good', 'translations', 'compared', 'to', 'translations', 'that', 'are', 'either', 'adequate', 'but', 'not', 'fluent', 'or', 'fluent', 'but', 'not', 'adequate', 'in', 'this', 'pilot', 'study', 'users', 'responded', 'strongly', 'to', 'disfluent', 'translations', 'but', 'were', 'surprisingly', 'much', 'less', 'concerned', 'with', 'adequacy']] | [-0.06959859504599437, 0.0734020673973697, -0.05219626491106002, 0.119573728997417, -0.16031244626947652, -0.2095378285587252, 0.10429175296432783, 0.46551575776294013, -0.218962156383275, -0.3504980942321436, 0.08727391578679225, -0.26189131281016587, -0.1299077163419956, 0.18582447670034577, -0.17625415504901348, 0.03655614359217269, 0.0744639804595472, 0.06093737213419768, -0.03567970612208211, -0.2756651593470145, 0.24106409244193636, 0.14043348240796652, 0.3448140949411231, 0.02052959566718298, 0.07266919744836393, -0.023031913429481264, -0.06931023497708907, 0.03151408948926864, -0.05458687263287693, 0.13296162450216084, 0.31596662914032275, 0.17650605146947237, 0.3314224788832052, -0.41751646488974586, -0.1759359374137543, 0.06523497356972266, 0.16939002240215925, 0.06812480862565756, -0.03726036602056751, -0.2744440182904217, 0.11413132028749962, -0.19126467063814123, -0.08589204225828435, -0.13182950092079204, -0.019437391297874328, 0.021923728163188723, -0.21876867550586254, 0.00756245074009253, 0.10534637400044877, 0.16938833849696078, -0.014540687064144098, -0.054590486180446346, 0.005535772235663695, 0.23479348890239668, 0.0898346596475795, 0.0746148485041911, 0.14555134955428053, -0.17631325966930975, -0.05354009946442653, 0.4259805245864614, -0.01615918885968695, -0.24338311601047205, 0.21735193084263912, -0.13059254237842338, -0.12302562495188735, 0.10782923585426271, 0.2046830282006935, 0.0404216486690827, -0.18729123736026687, -0.003413339818405666, -0.015206380634107322, 0.276565128872084, 0.09071970338417461, 0.025833520977366194, 0.20104858072291815, 0.1611621525230008, 0.013458580109421338, 0.09699258010695193, 0.03363434683638146, -0.05556326442850736, -0.19174368953262674, -0.10415868226995814, -0.12070357186771999, 0.04665361864045676, 0.020656313116267262, -0.14606402397469104, 0.3878745028627253, 0.21142095486224394, 0.14964769936654124, 0.0471885464998467, 0.3213586922491265, 0.053992785690744, 0.1178160172987242, 0.08491558443415458, 0.21399064946954496, -0.01035889745776968, 0.16000128378134185, -0.1563883493121313, 0.1628339766028607, -0.029725620679766217] |
1,802.06042 | SkyLiTE: End-to-End Design of Low-Altitude UAV Networks for Providing
LTE Connectivity | Un-manned aerial vehicle (UAVs) have the potential to change the landscape of
wide-area wireless connectivity by bringing them to areas where connectivity
was sparing or non-existent (e.g. rural areas) or has been compromised due to
disasters. While Google's Project Loon and Facebook's Project Aquila are
examples of high-altitude, long-endurance UAV-based connectivity efforts in
this direction, the telecom operators (e.g. AT&T and Verizon) have been
exploring low-altitude UAV-based LTE solutions for on-demand deployments.
Understandably, these projects are in their early stages and face formidable
challenges in their realization and deployment. The goal of this document is to
expose the reader to both the challenges as well as the potential offered by
these unconventional connectivity solutions. We aim to explore the end-to-end
design of such UAV-based connectivity networks particularly in the context of
low-altitude UAV networks providing LTE connectivity. Specifically, we aim to
highlight the challenges that span across multiple layers (access, core
network, and backhaul) in an inter-twined manner as well as the richness and
complexity of the design space itself. To help interested readers navigate this
complex design space towards a solution, we also articulate the overview of one
such end-to-end design, namely SkyLiTE-- a self-organizing network of
low-altitude UAVs that provide optimized LTE connectivity in a desired region.
| cs.NI eess.SP | unmanned aerial vehicle uavs have the potential to change the landscape of widearea wireless connectivity by bringing them to areas where connectivity was sparing or nonexistent eg rural areas or has been compromised due to disasters while googles project loon and facebooks project aquila are examples of highaltitude longendurance uavbased connectivity efforts in this direction the telecom operators eg att and verizon have been exploring lowaltitude uavbased lte solutions for ondemand deployments understandably these projects are in their early stages and face formidable challenges in their realization and deployment the goal of this document is to expose the reader to both the challenges as well as the potential offered by these unconventional connectivity solutions we aim to explore the endtoend design of such uavbased connectivity networks particularly in the context of lowaltitude uav networks providing lte connectivity specifically we aim to highlight the challenges that span across multiple layers access core network and backhaul in an intertwined manner as well as the richness and complexity of the design space itself to help interested readers navigate this complex design space towards a solution we also articulate the overview of one such endtoend design namely skylite a selforganizing network of lowaltitude uavs that provide optimized lte connectivity in a desired region | [['unmanned', 'aerial', 'vehicle', 'uavs', 'have', 'the', 'potential', 'to', 'change', 'the', 'landscape', 'of', 'widearea', 'wireless', 'connectivity', 'by', 'bringing', 'them', 'to', 'areas', 'where', 'connectivity', 'was', 'sparing', 'or', 'nonexistent', 'eg', 'rural', 'areas', 'or', 'has', 'been', 'compromised', 'due', 'to', 'disasters', 'while', 'googles', 'project', 'loon', 'and', 'facebooks', 'project', 'aquila', 'are', 'examples', 'of', 'highaltitude', 'longendurance', 'uavbased', 'connectivity', 'efforts', 'in', 'this', 'direction', 'the', 'telecom', 'operators', 'eg', 'att', 'and', 'verizon', 'have', 'been', 'exploring', 'lowaltitude', 'uavbased', 'lte', 'solutions', 'for', 'ondemand', 'deployments', 'understandably', 'these', 'projects', 'are', 'in', 'their', 'early', 'stages', 'and', 'face', 'formidable', 'challenges', 'in', 'their', 'realization', 'and', 'deployment', 'the', 'goal', 'of', 'this', 'document', 'is', 'to', 'expose', 'the', 'reader', 'to', 'both', 'the', 'challenges', 'as', 'well', 'as', 'the', 'potential', 'offered', 'by', 'these', 'unconventional', 'connectivity', 'solutions', 'we', 'aim', 'to', 'explore', 'the', 'endtoend', 'design', 'of', 'such', 'uavbased', 'connectivity', 'networks', 'particularly', 'in', 'the', 'context', 'of', 'lowaltitude', 'uav', 'networks', 'providing', 'lte', 'connectivity', 'specifically', 'we', 'aim', 'to', 'highlight', 'the', 'challenges', 'that', 'span', 'across', 'multiple', 'layers', 'access', 'core', 'network', 'and', 'backhaul', 'in', 'an', 'intertwined', 'manner', 'as', 'well', 'as', 'the', 'richness', 'and', 'complexity', 'of', 'the', 'design', 'space', 'itself', 'to', 'help', 'interested', 'readers', 'navigate', 'this', 'complex', 'design', 'space', 'towards', 'a', 'solution', 'we', 'also', 'articulate', 'the', 'overview', 'of', 'one', 'such', 'endtoend', 'design', 'namely', 'skylite', 'a', 'selforganizing', 'network', 'of', 'lowaltitude', 'uavs', 'that', 'provide', 'optimized', 'lte', 'connectivity', 'in', 'a', 'desired', 'region']] | [-0.19536263198202963, 0.014860837983187328, 0.022540067037730253, 0.04762719010649412, -0.10168311713394501, -0.15239916638543521, 0.06685613589790804, 0.4414045287892946, -0.2520034714439179, -0.33489618156539297, 0.1433794997684495, -0.26273242439789296, -0.21384171378805564, 0.13581735441996376, -0.13973097627156464, 0.0708809124387222, 0.05374700764139879, -0.009787885022199332, 0.02847730076659326, -0.21752800387149515, 0.2831190221533812, 0.10227039867890005, 0.32008015102191456, 0.06847035334964319, 0.03256442219367052, -0.051904840135816324, -0.02256715733366363, -0.019400732832773163, -0.09454087079176283, 0.16826009699505148, 0.39425500574774897, 0.21135310133810617, 0.329040546919608, -0.4923977122587848, -0.2643146393097286, 0.08961444685065517, 0.19449881963656188, 0.034087100603111375, -0.03913597449732637, -0.3441445583667498, 0.08928867067477114, -0.22500176459903495, -0.12789704302185695, -0.043144077711367926, -0.011229184057192823, 0.07441404153501334, -0.21355808067849827, -0.08175110777072016, -0.03805365826193135, 0.09099742693451314, -0.05308615440080051, -0.07422669398941968, 0.006156651402633746, 0.2452430654434686, 0.03016624194897657, 0.032654277669368716, 0.13748754528735413, -0.18814472542302593, -0.09934389444793693, 0.4035396350782762, 0.05019880095395052, -0.13377077209320173, 0.20320318904151524, -0.03042391033219264, -0.1428447233725484, 0.07157743844719043, 0.24006719291391013, 0.03671363074088343, -0.18906988301630884, 0.037757293011504905, 0.043689157635208614, 0.10462630536063637, 0.060301067219432264, 0.07514880700274235, 0.2296342888159804, 0.25666744862366647, 0.15158227740818617, 0.1001154785677429, -0.0910303606280155, -0.10995913888734665, -0.1778611433005652, -0.1364010343276127, -0.15867448091118153, 0.012315648651989267, -0.0555224818711845, -0.11542698461957981, 0.4036912931246882, 0.18565948672244525, 0.156309012645738, 0.058661880591987105, 0.3616951847430861, -0.016423594020646137, 0.09495901003382756, 0.10185763530559766, 0.18610370290653275, 0.020895801920859703, 0.22607637449841295, -0.1461652939002147, 0.09935136755998472, -0.010242260359589335] |
1,802.06043 | Flawed Waveform Design of Augusto Aubry, Antonio DeMaio et al | arXiv admin note: This submission has been withdrawn by arXiv administrators
due to unprofessional personal attack.
| eess.SP | arxiv admin note this submission has been withdrawn by arxiv administrators due to unprofessional personal attack | [['arxiv', 'admin', 'note', 'this', 'submission', 'has', 'been', 'withdrawn', 'by', 'arxiv', 'administrators', 'due', 'to', 'unprofessional', 'personal', 'attack']] | [-0.18881958723068237, -0.09087169839767739, -0.10902748702210374, -0.06318694927176693, -0.30885071493685246, -0.2679378360044211, 0.1001996278646402, 0.2734965219060541, -0.1912215146003291, -0.4405400771647692, 0.12891101004788652, -0.4107638068962842, -0.08693049343128223, -0.09463835181668401, -0.4832574939355254, 0.0828757006675005, 0.0752600064733997, -0.12059197574853897, 0.10932698051328771, -0.6130615088331979, 0.23109530052170157, 0.2604473823448643, 0.3250073729432188, 0.37868819828145206, -0.10534171911422163, 0.022042747295927256, -0.24977603601291776, -0.0992804910056293, -0.1990670114173554, 0.0030782215762883425, 0.3595654205419123, 0.15302768167748582, 0.48004337679594755, -0.3929970124736428, -0.027671177522279322, 0.07076897798106074, 0.16389936229097657, 0.27158178109675646, -0.04975128557998687, -0.5377058237791061, 0.173108623130247, -0.5254522853065282, -0.11537889126338996, 0.0023745447397232056, 0.23167689831461757, -0.13694591860985383, 0.043464910704642534, -0.0532806278206408, 0.1729386355727911, 0.2703830467071384, 0.13740311609581113, -0.11638634058181196, -0.0036981167504563928, 0.12839912087656558, 0.27514379494823515, 0.10815016989363357, 0.08884613250847906, 0.02075414617138449, -0.05117972753942013, 0.3422814588993788, 0.17872111056931317, -0.13766452032723464, 0.06501794140785933, 0.14388812470133416, -0.20040904125198722, 0.13430138939293101, 0.2180899189261254, 0.012647382071008906, -0.3855835476424545, 0.20377675857162103, -0.06096959131537005, 0.2526865811087191, 0.2970515309134498, -0.03013459713838529, 0.07987994514405727, 0.024333715729881078, -0.022010104308719747, 0.154146266868338, 0.1349969245493412, 0.06406924137263559, -0.09872016380541027, -0.13159109489060938, -0.29195452691055834, 0.19390464114258066, 0.3175135034834966, -0.05498737242305651, 0.29352364828810096, 0.2925070561468601, -0.0002459242823533714, -0.15005132067017257, 0.2845611192751676, -0.004416260409925599, 0.14364732336252928, 0.09023707301093964, 0.2140765693038702, -0.046805200618109666, 0.4233973122900352, 0.0196473125834018, 0.3027904892805964, 0.1644739143375773] |
1,802.06044 | No Giant Planet Pileup Near 1 AU | A pileup near 1~AU in the semimajor axis distribution of giant exoplanets has
been visually identified using log-spaced distribution plots. Here we propose
that looking for features in a log-spaced semimajor axis distribution of giant
planets is problematic. We use the Bayesian Blocks algorithm to analyze the
linear-spaced semimajor axis distribution, and find that the apparent pileup is
not significant.
| astro-ph.EP | a pileup near 1au in the semimajor axis distribution of giant exoplanets has been visually identified using logspaced distribution plots here we propose that looking for features in a logspaced semimajor axis distribution of giant planets is problematic we use the bayesian blocks algorithm to analyze the linearspaced semimajor axis distribution and find that the apparent pileup is not significant | [['a', 'pileup', 'near', '1au', 'in', 'the', 'semimajor', 'axis', 'distribution', 'of', 'giant', 'exoplanets', 'has', 'been', 'visually', 'identified', 'using', 'logspaced', 'distribution', 'plots', 'here', 'we', 'propose', 'that', 'looking', 'for', 'features', 'in', 'a', 'logspaced', 'semimajor', 'axis', 'distribution', 'of', 'giant', 'planets', 'is', 'problematic', 'we', 'use', 'the', 'bayesian', 'blocks', 'algorithm', 'to', 'analyze', 'the', 'linearspaced', 'semimajor', 'axis', 'distribution', 'and', 'find', 'that', 'the', 'apparent', 'pileup', 'is', 'not', 'significant']] | [-0.14574422163225836, 0.08327892484238088, -0.16467649958459502, 0.09417288550333577, -0.11657025922342377, -0.051755593233284054, 0.005432565380834927, 0.475285539308847, -0.16529972865483014, -0.32649605033003676, 0.06831845800171338, -0.26407000053105717, -0.10940002754204355, 0.12498490712842193, -0.08425904336085512, 0.05880489483696677, 0.14236166315563656, -0.08424188518675707, -0.05062428541418355, -0.18244124181821184, 0.2171420455610348, 0.051727166572996114, 0.12623226619720207, -0.03768956235025899, 0.049850768480702475, -0.01611876405649266, 0.03716677847176285, -0.0687307412025787, -0.18169645114404237, 0.017876911308553258, 0.1808712258760475, 0.15463877850906702, 0.23836549366745402, -0.31374187585187413, -0.10036033200409847, 0.10153654324269648, 0.26292755839935805, 0.06617006937326012, -0.0715037298751837, -0.23265486289510282, 0.09852157728904384, -0.20844205544661668, -0.25994820131967633, -0.01170130449710256, 0.12903600170324414, 0.0031558463144731722, -0.24211383453901794, 0.1274258428711002, 0.07586090275534366, 0.14549228244350623, -0.031159155966711066, -0.1907655889705076, -0.06799089949641188, 0.05959820402470433, 0.09302043727741151, -0.002729662954491579, 0.210353169006185, -0.03593636916603072, -0.06516407815329099, 0.36435554018717703, -0.048782427341408904, -0.11642106586940966, 0.14819516820864656, -0.24715432821441505, -0.11488117967432333, 0.17519038120063685, 0.23843519807935265, 0.11820818054474007, -0.19168660666604162, 0.01534509576632152, -0.005825528721088323, 0.17461732279911826, 0.09491389287414692, -0.022544807714994175, 0.4032415389951508, 0.118864390107219, 0.03586726140041473, 0.11777032117785538, -0.3144459051190544, -0.08489597674017235, -0.1770227752247099, -0.13751770171210548, -0.23798386218377499, -0.037448378023050205, -0.10738877392096753, -0.18577801401458555, 0.3561709334726556, 0.23200324017128324, 0.26383643101711396, 0.04995724865061752, 0.30346627577634183, 0.08347819271986767, 0.1243492022346137, 0.13675887314444882, 0.2937779411420984, 0.10658981550042912, 0.07010122524353407, -0.21026694188999423, 0.15111393315749147, -0.06204395813046623] |
1,802.06045 | The mechanisms of hot salt stress corrosion cracking in titanium alloy
Ti-6Al-2Sn-4Zr-6Mo | Hot salt stress corrosion cracking in Ti 6246 alloy has been investigated to
elucidate the chemical mechanisms that occur. Cracking was found to initiate
beneath salt particles in the presence of oxidation. The observed transgranular
fracture was suspected to be due to hydrogen charging; XRD and high-resolution
transmission electron microscopy detected the presence of hydrides that were
precipitated on cooling. SEM-EDS showed oxygen enrichment near salt particles,
alongside chlorine and sodium. Aluminium and zirconium were also involved in
the oxidation reactions. The role of intermediate corrosion products such as
Na2TiO3, Al2O3, ZrO2, TiCl2 and TiH are discussed.
| cond-mat.mtrl-sci | hot salt stress corrosion cracking in ti 6246 alloy has been investigated to elucidate the chemical mechanisms that occur cracking was found to initiate beneath salt particles in the presence of oxidation the observed transgranular fracture was suspected to be due to hydrogen charging xrd and highresolution transmission electron microscopy detected the presence of hydrides that were precipitated on cooling semeds showed oxygen enrichment near salt particles alongside chlorine and sodium aluminium and zirconium were also involved in the oxidation reactions the role of intermediate corrosion products such as na2tio3 al2o3 zro2 ticl2 and tih are discussed | [['hot', 'salt', 'stress', 'corrosion', 'cracking', 'in', 'ti', '6246', 'alloy', 'has', 'been', 'investigated', 'to', 'elucidate', 'the', 'chemical', 'mechanisms', 'that', 'occur', 'cracking', 'was', 'found', 'to', 'initiate', 'beneath', 'salt', 'particles', 'in', 'the', 'presence', 'of', 'oxidation', 'the', 'observed', 'transgranular', 'fracture', 'was', 'suspected', 'to', 'be', 'due', 'to', 'hydrogen', 'charging', 'xrd', 'and', 'highresolution', 'transmission', 'electron', 'microscopy', 'detected', 'the', 'presence', 'of', 'hydrides', 'that', 'were', 'precipitated', 'on', 'cooling', 'semeds', 'showed', 'oxygen', 'enrichment', 'near', 'salt', 'particles', 'alongside', 'chlorine', 'and', 'sodium', 'aluminium', 'and', 'zirconium', 'were', 'also', 'involved', 'in', 'the', 'oxidation', 'reactions', 'the', 'role', 'of', 'intermediate', 'corrosion', 'products', 'such', 'as', 'na2tio3', 'al2o3', 'zro2', 'ticl2', 'and', 'tih', 'are', 'discussed']] | [-0.032166026745665266, 0.217304116020851, -0.00370090020612437, 0.00025405899988130686, 0.05455219706005238, -0.15324391478157423, 0.07523715145888421, 0.4317554675359675, -0.21152424603760084, -0.33054316791884125, 0.04685199498124619, -0.35363060672906166, -0.10551849121544907, 0.09443570083958354, -0.05052904001972143, 0.004775490871868394, -0.009878031389312224, -0.11984416703753015, 0.0035111169538837163, -0.270007416578084, 0.21440792673247608, 0.15089918989093698, 0.29922892028426235, 0.1723893322731725, -0.02073935118622761, -0.08672391778809276, 0.028009398981552334, -0.001040422595403296, -0.16117036428399745, -0.002999231174707096, 0.28070089682698884, -0.07330636267718721, 0.14792121718934875, -0.5420197555002697, -0.3146326411218244, 0.001065434158551804, 0.10351643450260956, 0.08888502532685612, -0.17845625954586022, -0.2108651132847955, 0.05868200389073884, -0.09801664113245429, -0.12728134548152856, -0.026528911803789596, 0.01587489121308689, 0.05477606910132268, -0.22521093119668992, 0.09303976871052193, -0.0016233099505622336, 0.14503052020247312, -0.17770834626293086, -0.174327100478509, -0.16459677013707288, 0.05994225627286954, 0.0861552193503272, -0.06437930366658468, 0.34022952854370775, -0.02108943685294783, 0.008153992764493252, 0.3892775953529363, -0.02716010649430942, 0.01678855911372824, 0.23907284878015994, -0.14101994719462807, -0.10273233605449662, 0.2755856916142449, 0.08835156581939217, 0.08787707041731065, -0.2080356417263442, -0.01751742541463055, 0.045430658726972786, 0.17467731720782778, 0.24028902433990956, -0.018488671212021184, 0.18762625670654975, 0.22570487773640358, -0.0814201624350662, 0.14887870816845802, -0.17792191544418878, 0.01249721908243373, -0.11557794045260612, -0.2738942940560903, -0.09275533386971802, 0.05303366359402525, -0.020650813563484104, -0.2004174612452613, 0.24239879950108204, 0.05285436494592974, 0.07836882788390714, -0.16994855566287137, 0.1854557463988424, -0.01532926078652963, 0.07859782231327622, -0.03612245669826231, 0.28052817062137925, 0.21126218438602085, 0.1904184717494261, -0.3242880925139848, 0.27165016826697963, 0.02491930130363858] |
1,802.06046 | Anisotropies in the stochastic gravitational-wave background: Formalism
and the cosmic string case | We develop a powerful analytical formalism for calculating the energy density
of the stochastic gravitational wave background, including a full description
of its anisotropies. This is completely general, and can be applied to any
astrophysical or cosmological source. As an example, we apply these tools to
the case of a network of Nambu-Goto cosmic strings. We find that the angular
spectrum of the anisotropies is relatively insensitive to the choice of model
for the string network, but very sensitive to the value of the string tension
$G\mu$.
| astro-ph.CO gr-qc hep-th | we develop a powerful analytical formalism for calculating the energy density of the stochastic gravitational wave background including a full description of its anisotropies this is completely general and can be applied to any astrophysical or cosmological source as an example we apply these tools to the case of a network of nambugoto cosmic strings we find that the angular spectrum of the anisotropies is relatively insensitive to the choice of model for the string network but very sensitive to the value of the string tension gmu | [['we', 'develop', 'a', 'powerful', 'analytical', 'formalism', 'for', 'calculating', 'the', 'energy', 'density', 'of', 'the', 'stochastic', 'gravitational', 'wave', 'background', 'including', 'a', 'full', 'description', 'of', 'its', 'anisotropies', 'this', 'is', 'completely', 'general', 'and', 'can', 'be', 'applied', 'to', 'any', 'astrophysical', 'or', 'cosmological', 'source', 'as', 'an', 'example', 'we', 'apply', 'these', 'tools', 'to', 'the', 'case', 'of', 'a', 'network', 'of', 'nambugoto', 'cosmic', 'strings', 'we', 'find', 'that', 'the', 'angular', 'spectrum', 'of', 'the', 'anisotropies', 'is', 'relatively', 'insensitive', 'to', 'the', 'choice', 'of', 'model', 'for', 'the', 'string', 'network', 'but', 'very', 'sensitive', 'to', 'the', 'value', 'of', 'the', 'string', 'tension', 'gmu']] | [-0.12267611485413522, 0.1118574241437513, -0.10020263035428421, 0.16048713700294537, -0.09233444884162524, -0.08181531064683335, -0.0026375846455580203, 0.317591375232428, -0.2467918775536805, -0.2985061657636416, 0.07655637643845944, -0.2425467624682291, -0.09610703550332665, 0.21308386881953512, 0.014860076262433639, 0.023169030027929693, 0.02809978170513079, 0.0595893119194213, -0.05231656100140649, -0.20070798702714643, 0.34320249045588846, 0.16243607489841766, 0.262250012892095, 0.06395563715533621, 0.10410195004045107, -0.020726677123992437, -0.053942562225435316, 0.06729808295327613, -0.14941280941793697, 0.11824336668861837, 0.2288802594331832, 0.13771154334361868, 0.15447689348767543, -0.43131060243166724, -0.2519064448324257, 0.1221397989536582, 0.11869524944347501, 0.2252885926750371, -0.021297281656157355, -0.2403466450773051, 0.08265595396595268, -0.178057647655429, -0.1450758620443615, -0.08078291509889238, 0.017747478238467514, -0.00020946941777378664, -0.2659527669318192, 0.07399054421861281, 0.02313115847050801, -0.045836587008302926, -0.051645773590071366, -0.05817452867799064, 0.003571847370750774, 0.11879056151795747, 0.09068008222558332, 0.09912385958000675, 0.139446677035256, -0.15753920320903175, -0.058130352187837506, 0.4157803540021695, -0.10400781025788908, -0.2191935146291708, 0.15699244925388317, -0.11809627085538774, -0.16295639477969928, 0.103546518393546, 0.15284276959197274, 0.10671280377983362, -0.15811859145653487, 0.13406884532098004, 0.023473894223069034, 0.1781926186960699, 0.06069633483501344, 0.0208077204350821, 0.2780754789924142, 0.1393250852191671, 0.06333048457022884, 0.13430160920312306, -0.12160958022136113, -0.033092500572360455, -0.3403978523123881, -0.08562992817703695, -0.17280003407317074, 0.10360773680674784, -0.12653680485602997, -0.22794034143631486, 0.406503499581896, 0.1486143188272742, 0.16979709140763716, 0.07228538643397477, 0.2861122742894737, 0.10736867173135965, 0.017610390863284982, 0.06696360197517721, 0.24558744634148374, 0.14268716563063877, 0.0989883286321814, -0.21498338951349216, 0.00864096300076993, 0.03104682612211454] |
1,802.06047 | Weak solutions for multiquasilinear elliptic-parabolic systems.
Application to thermoelectrochemical problems | This paper investigates the existence of weak solutions of biquasilinear
boundary value problem for a coupled elliptic-parabolic system of divergence
form with discontinuous leading coefficients. The mathematical framework
addressed in the article considers the presence of an additional nonlinearity
in the model which reflects the radiative thermal boundary effects in some
applications of interest. The results are obtained via the Rothe-Galerkin
method. Only weak assumptions are made on the data and the boundary conditions
are allowed to be on a general form. The major contribution of the current
paper is the explicit expressions for the constants appeared in the
quantitative estimates that are derived. These detailed and explicit estimates
may be useful for the study on nonlinear problems that appear in the real world
applications. In particular, they clarify the smallness conditions. In
conclusion, we illustrate how the above results may be applied to the
thermoelectrochemical phenomena in an electrolysis cell. This problem has
several applications as for instance to optimize the cell design and operating
conditions.
| math.AP | this paper investigates the existence of weak solutions of biquasilinear boundary value problem for a coupled ellipticparabolic system of divergence form with discontinuous leading coefficients the mathematical framework addressed in the article considers the presence of an additional nonlinearity in the model which reflects the radiative thermal boundary effects in some applications of interest the results are obtained via the rothegalerkin method only weak assumptions are made on the data and the boundary conditions are allowed to be on a general form the major contribution of the current paper is the explicit expressions for the constants appeared in the quantitative estimates that are derived these detailed and explicit estimates may be useful for the study on nonlinear problems that appear in the real world applications in particular they clarify the smallness conditions in conclusion we illustrate how the above results may be applied to the thermoelectrochemical phenomena in an electrolysis cell this problem has several applications as for instance to optimize the cell design and operating conditions | [['this', 'paper', 'investigates', 'the', 'existence', 'of', 'weak', 'solutions', 'of', 'biquasilinear', 'boundary', 'value', 'problem', 'for', 'a', 'coupled', 'ellipticparabolic', 'system', 'of', 'divergence', 'form', 'with', 'discontinuous', 'leading', 'coefficients', 'the', 'mathematical', 'framework', 'addressed', 'in', 'the', 'article', 'considers', 'the', 'presence', 'of', 'an', 'additional', 'nonlinearity', 'in', 'the', 'model', 'which', 'reflects', 'the', 'radiative', 'thermal', 'boundary', 'effects', 'in', 'some', 'applications', 'of', 'interest', 'the', 'results', 'are', 'obtained', 'via', 'the', 'rothegalerkin', 'method', 'only', 'weak', 'assumptions', 'are', 'made', 'on', 'the', 'data', 'and', 'the', 'boundary', 'conditions', 'are', 'allowed', 'to', 'be', 'on', 'a', 'general', 'form', 'the', 'major', 'contribution', 'of', 'the', 'current', 'paper', 'is', 'the', 'explicit', 'expressions', 'for', 'the', 'constants', 'appeared', 'in', 'the', 'quantitative', 'estimates', 'that', 'are', 'derived', 'these', 'detailed', 'and', 'explicit', 'estimates', 'may', 'be', 'useful', 'for', 'the', 'study', 'on', 'nonlinear', 'problems', 'that', 'appear', 'in', 'the', 'real', 'world', 'applications', 'in', 'particular', 'they', 'clarify', 'the', 'smallness', 'conditions', 'in', 'conclusion', 'we', 'illustrate', 'how', 'the', 'above', 'results', 'may', 'be', 'applied', 'to', 'the', 'thermoelectrochemical', 'phenomena', 'in', 'an', 'electrolysis', 'cell', 'this', 'problem', 'has', 'several', 'applications', 'as', 'for', 'instance', 'to', 'optimize', 'the', 'cell', 'design', 'and', 'operating', 'conditions']] | [-0.12700469441471973, 0.05375600232414066, -0.04883588523541509, 0.059092595035397655, -0.07535871069611437, -0.09521839439743994, 0.009037461309273524, 0.3432867618550251, -0.2629776656110885, -0.274750202053749, 0.17248775750375922, -0.2414079020680042, -0.17449027930795238, 0.24396390748556657, -0.08811628844634425, 0.053175114981103236, 0.07370528025501522, 0.035590292557239216, -0.054958759838993454, -0.21665439530837963, 0.3462571336209161, 0.009281854494474828, 0.2800212908059177, 0.11935593108589784, 0.052717422652654576, -0.05037305012157914, -0.015537825494680963, 0.021784365529239905, -0.16667366268657355, 0.12751845542835527, 0.2425954840429945, 0.08259577264089318, 0.28130466372297125, -0.4678550288535473, -0.22279620795828722, 0.09573521073794038, 0.1079527309583926, 0.12035690096885579, -0.05456350544941748, -0.2502186241951521, 0.08643214834751789, -0.10016171756149383, -0.156424893736385, -0.0628718847846158, -0.03402969684088376, 0.018197423919024538, -0.31424319083808083, 0.06335501851394727, 0.06257144891814521, 0.03280893054495498, -0.11072476160508103, -0.10920125301842146, 0.03164472185904387, 0.14925173632857366, 0.07602049038453004, -0.035728609151059264, 0.08722681833981968, -0.15413875530598822, -0.07782583330933959, 0.38875302679200724, -0.0484845353071805, -0.24581459729659666, 0.1939612294919221, -0.11360435928899522, -0.14708472564873262, 0.10119948569520536, 0.19733011708296722, 0.11796403765393046, -0.19183391870692282, 0.09310439872596606, -0.03925048512344181, 0.11783072835532948, 0.05886125746722583, 0.024457164916916886, 0.1634264554056089, 0.13225792078500068, 0.06184159147428212, 0.14713215615909842, -0.03317981988770842, -0.10848006629101115, -0.35397967389534885, -0.14183989531508215, -0.1381786840104657, 0.01957944121279913, -0.07577446541188515, -0.15296049316686283, 0.3849777171527399, 0.1819989683132096, 0.18908316896881955, -0.0076653447943432935, 0.263179493693226, 0.16358509769829319, 0.031422953249137034, 0.022182937851317634, 0.25850588039345274, 0.1265671864867483, 0.13013767252290032, -0.21685892497984374, 0.09706429673164299, 0.05084970448075271] |
1,802.06048 | High-dimensional covariance matrix estimation using a low-rank and
diagonal decomposition | We study high-dimensional covariance/precision matrix estimation under the
assumption that the covariance/precision matrix can be decomposed into a
low-rank component L and a diagonal component D. The rank of L can either be
chosen to be small or controlled by a penalty function. Under moderate
conditions on the population covariance/precision matrix itself and on the
penalty function, we prove some consistency results for our estimators. A
blockwise coordinate descent algorithm, which iteratively updates L and D, is
then proposed to obtain the estimator in practice. Finally, various numerical
experiments are presented: using simulated data, we show that our estimator
performs quite well in terms of the Kullback-Leibler loss; using stock return
data, we show that our method can be applied to obtain enhanced solutions to
the Markowitz portfolio selection problem.
| stat.ME | we study highdimensional covarianceprecision matrix estimation under the assumption that the covarianceprecision matrix can be decomposed into a lowrank component l and a diagonal component d the rank of l can either be chosen to be small or controlled by a penalty function under moderate conditions on the population covarianceprecision matrix itself and on the penalty function we prove some consistency results for our estimators a blockwise coordinate descent algorithm which iteratively updates l and d is then proposed to obtain the estimator in practice finally various numerical experiments are presented using simulated data we show that our estimator performs quite well in terms of the kullbackleibler loss using stock return data we show that our method can be applied to obtain enhanced solutions to the markowitz portfolio selection problem | [['we', 'study', 'highdimensional', 'covarianceprecision', 'matrix', 'estimation', 'under', 'the', 'assumption', 'that', 'the', 'covarianceprecision', 'matrix', 'can', 'be', 'decomposed', 'into', 'a', 'lowrank', 'component', 'l', 'and', 'a', 'diagonal', 'component', 'd', 'the', 'rank', 'of', 'l', 'can', 'either', 'be', 'chosen', 'to', 'be', 'small', 'or', 'controlled', 'by', 'a', 'penalty', 'function', 'under', 'moderate', 'conditions', 'on', 'the', 'population', 'covarianceprecision', 'matrix', 'itself', 'and', 'on', 'the', 'penalty', 'function', 'we', 'prove', 'some', 'consistency', 'results', 'for', 'our', 'estimators', 'a', 'blockwise', 'coordinate', 'descent', 'algorithm', 'which', 'iteratively', 'updates', 'l', 'and', 'd', 'is', 'then', 'proposed', 'to', 'obtain', 'the', 'estimator', 'in', 'practice', 'finally', 'various', 'numerical', 'experiments', 'are', 'presented', 'using', 'simulated', 'data', 'we', 'show', 'that', 'our', 'estimator', 'performs', 'quite', 'well', 'in', 'terms', 'of', 'the', 'kullbackleibler', 'loss', 'using', 'stock', 'return', 'data', 'we', 'show', 'that', 'our', 'method', 'can', 'be', 'applied', 'to', 'obtain', 'enhanced', 'solutions', 'to', 'the', 'markowitz', 'portfolio', 'selection', 'problem']] | [-0.06578305281985264, 0.01693874549550506, -0.13774193382033936, 0.08916560247397194, -0.05590990423583067, -0.16476678881221093, 0.04893774914268691, 0.42038980074799975, -0.3148486945491571, -0.2661774587423469, 0.18075900426528488, -0.2320757155557378, -0.1782535364009583, 0.17245857446060445, -0.10627054012774562, 0.06727941651613667, 0.11229712701438424, 0.001179116921356091, -0.09286512337051905, -0.3129844744188281, 0.266366164228664, 0.04020851847644036, 0.2668935121753468, -4.368761930471429e-05, 0.11988411828732261, 0.020189617537499333, -0.01474471246250547, 0.04858163993519086, -0.08025527385219063, 0.09118735422469819, 0.2584320760260408, 0.17993631090503187, 0.3056006451209004, -0.3735343901870342, -0.16438892456667067, 0.1375411787034514, 0.13081447878637567, 0.07145833183133687, -0.013037576268498715, -0.279377666187401, 0.12196161213975687, -0.16589315836340224, -0.07668032527614671, -0.1407201664826761, -0.061629011602893184, 0.014519015217844683, -0.41558773706738766, 0.07284123750869184, 0.0336549475726385, 0.004242370102124719, -0.04001853620776763, -0.18998440608489686, 0.004946428278568559, 0.04813195069750341, 0.0989695592586381, 0.021269085908380267, 0.15077498284741664, -0.03590805666306271, -0.06823336739594546, 0.3198233498976781, -0.10803694750334566, -0.27774086033997053, 0.12301721174556475, -0.09755787387346992, -0.10479630590416492, 0.07300305966860973, 0.20058572164091926, 0.12114812999699587, -0.14160222528645625, 0.07745270697050728, -0.09112872573761986, 0.15336714496549506, 0.021108431789952403, -0.03403897346892896, 0.08751044924585866, 0.1237833843861993, 0.13212015989881296, 0.1523925323952706, -0.08862379700876773, -0.05276785967155145, -0.3009548902654877, -0.0920959090505046, -0.24770813745518144, 0.012421569604283342, -0.16727970661785757, -0.14232752049126876, 0.35981166491714806, 0.14178255723717695, 0.22716321235594267, 0.09836141963650544, 0.2844771652124249, 0.1446781127203184, 0.05435412485060694, 0.11985992283309595, 0.17698662943461946, 0.1152785553650644, 0.018203261562582784, -0.22559709940822079, 0.11199571583420039, 0.08742118480149656] |
1,802.06049 | Computational synthesis of large deformation compliant mechanisms
undergoing self and mutual contact | Topologies of large deformation Contact-aided Compliant Mechanisms (CCMs),
with self and mutual contact, exemplified via path generation applications, are
designed using the continuum synthesis approach. Design domains are
parameterized using honeycomb tessellation. Assignment of material to each
cell, and generation of rigid contact surfaces, are accomplished via suitably
sizing and positioning negative circular masks. To facilitate contact analysis,
boundary smoothing is implemented. Mean value coordinates are employed to
compute shape functions, as many regular hexagonal cells get degenerated into
irregular, concave polygons as a consequence of boundary smoothing. Both,
geometric and material nonlinearities are considered in the finite element
analysis. The augmented Lagrange multiplier method in association with an
active set strategy is employed to incorporate both self and mutual contact.
CCMs are evolved using the stochastic hill climber search. Synthesized
contact-aided compliant continua trace paths with single and importantly,
multiple kinks and experience multiple contact interactions pertaining to both
self and mutual contact modes.
| cs.CE | topologies of large deformation contactaided compliant mechanisms ccms with self and mutual contact exemplified via path generation applications are designed using the continuum synthesis approach design domains are parameterized using honeycomb tessellation assignment of material to each cell and generation of rigid contact surfaces are accomplished via suitably sizing and positioning negative circular masks to facilitate contact analysis boundary smoothing is implemented mean value coordinates are employed to compute shape functions as many regular hexagonal cells get degenerated into irregular concave polygons as a consequence of boundary smoothing both geometric and material nonlinearities are considered in the finite element analysis the augmented lagrange multiplier method in association with an active set strategy is employed to incorporate both self and mutual contact ccms are evolved using the stochastic hill climber search synthesized contactaided compliant continua trace paths with single and importantly multiple kinks and experience multiple contact interactions pertaining to both self and mutual contact modes | [['topologies', 'of', 'large', 'deformation', 'contactaided', 'compliant', 'mechanisms', 'ccms', 'with', 'self', 'and', 'mutual', 'contact', 'exemplified', 'via', 'path', 'generation', 'applications', 'are', 'designed', 'using', 'the', 'continuum', 'synthesis', 'approach', 'design', 'domains', 'are', 'parameterized', 'using', 'honeycomb', 'tessellation', 'assignment', 'of', 'material', 'to', 'each', 'cell', 'and', 'generation', 'of', 'rigid', 'contact', 'surfaces', 'are', 'accomplished', 'via', 'suitably', 'sizing', 'and', 'positioning', 'negative', 'circular', 'masks', 'to', 'facilitate', 'contact', 'analysis', 'boundary', 'smoothing', 'is', 'implemented', 'mean', 'value', 'coordinates', 'are', 'employed', 'to', 'compute', 'shape', 'functions', 'as', 'many', 'regular', 'hexagonal', 'cells', 'get', 'degenerated', 'into', 'irregular', 'concave', 'polygons', 'as', 'a', 'consequence', 'of', 'boundary', 'smoothing', 'both', 'geometric', 'and', 'material', 'nonlinearities', 'are', 'considered', 'in', 'the', 'finite', 'element', 'analysis', 'the', 'augmented', 'lagrange', 'multiplier', 'method', 'in', 'association', 'with', 'an', 'active', 'set', 'strategy', 'is', 'employed', 'to', 'incorporate', 'both', 'self', 'and', 'mutual', 'contact', 'ccms', 'are', 'evolved', 'using', 'the', 'stochastic', 'hill', 'climber', 'search', 'synthesized', 'contactaided', 'compliant', 'continua', 'trace', 'paths', 'with', 'single', 'and', 'importantly', 'multiple', 'kinks', 'and', 'experience', 'multiple', 'contact', 'interactions', 'pertaining', 'to', 'both', 'self', 'and', 'mutual', 'contact', 'modes']] | [-0.15117558969274883, 0.08773877231729021, -0.05533138524568189, 0.038415542905849795, -0.1113165327528071, -0.22142552303360594, 0.014225784016232337, 0.43788765178572747, -0.3040949269378137, -0.28425003194039866, 0.08571056686341763, -0.26717077232296427, -0.1731235860456382, 0.16604954318083343, -0.058802924250372715, 0.08548976297099745, 0.0717968967608026, -0.03774409623532143, -0.03193954294791535, -0.17871903462425595, 0.29878397675220775, 0.03364246005733167, 0.2760303948284878, 0.010114317771888549, 0.09730583091957434, 0.06280174782920268, -0.026614031210661897, 0.06654498253558432, -0.12049815220281392, 0.14877256248747148, 0.21447516829226046, 0.03222887288148124, 0.21334922491542754, -0.4515842854736313, -0.21945932791117698, 0.05891124057553468, 0.13061108260486845, 0.05360133090326863, -0.04408087078481913, -0.2630922658338902, 0.07275659853532429, -0.13884738797412044, -0.12550213444797742, -0.0809639700658379, -0.03304073573540776, 0.06804423806888442, -0.2712022596309262, 0.017575292848050594, 0.025375828324186226, 0.0685026601197258, -0.07780301343769797, -0.11441398325766768, -0.08446606933439692, 0.15315441266603527, -0.022642884406961397, -0.01924460261399227, 0.18625753890467628, -0.0609155805435993, -0.10684745835380689, 0.3699951983507602, -0.014130356583383775, -0.27382244990778065, 0.21651060041040182, -0.06423797436178692, -0.06263943517640713, 0.1687321463104097, 0.19133876433836355, 0.12305777899830812, -0.1910480822658076, 0.04597240624528739, 0.044058227178550534, 0.11661048682346459, 0.1169581153050756, -0.027363865785000305, 0.2210903566194071, 0.15675799367168258, 0.0818927006916173, 0.15603602275312428, -0.08722894884826195, -0.1521561640926877, -0.26390909779771804, -0.11605072224722995, -0.15300970556019175, -0.02676472651862329, -0.1028561897087662, -0.2187411195929012, 0.295855533944503, 0.04125198673216566, 0.1866516927197095, 0.042137057002213214, 0.2744196966155282, 0.06646798977472504, 0.1056492411396316, 0.02191819672382647, 0.1970368758509604, 0.12619637864972313, 0.06729442981943007, -0.1922474953871701, 0.03075497566211608, 0.1138967762641128] |
1,802.0605 | Near-infrared to visible upconversion imaging using a broadband pump
laser | We present an upconversion imaging experiment from the near-infrared to the
visible spectrum. Using a dedicated broadband pump laser to increase the number
of resolved elements converted in the image we obtain up to 56x64 spatial
elements with a 2.7 nm wide pump spectrum, more than 10 times the number of
elements accessible with a narrowband laser. Results in terms of field of view,
resolution and conversion efficiency are in good agreement with simulations.
The computed sensitivity of our experiment favorably compares with direct
InGaAs camera detection.
| physics.optics | we present an upconversion imaging experiment from the nearinfrared to the visible spectrum using a dedicated broadband pump laser to increase the number of resolved elements converted in the image we obtain up to 56x64 spatial elements with a 27 nm wide pump spectrum more than 10 times the number of elements accessible with a narrowband laser results in terms of field of view resolution and conversion efficiency are in good agreement with simulations the computed sensitivity of our experiment favorably compares with direct ingaas camera detection | [['we', 'present', 'an', 'upconversion', 'imaging', 'experiment', 'from', 'the', 'nearinfrared', 'to', 'the', 'visible', 'spectrum', 'using', 'a', 'dedicated', 'broadband', 'pump', 'laser', 'to', 'increase', 'the', 'number', 'of', 'resolved', 'elements', 'converted', 'in', 'the', 'image', 'we', 'obtain', 'up', 'to', '56x64', 'spatial', 'elements', 'with', 'a', '27', 'nm', 'wide', 'pump', 'spectrum', 'more', 'than', '10', 'times', 'the', 'number', 'of', 'elements', 'accessible', 'with', 'a', 'narrowband', 'laser', 'results', 'in', 'terms', 'of', 'field', 'of', 'view', 'resolution', 'and', 'conversion', 'efficiency', 'are', 'in', 'good', 'agreement', 'with', 'simulations', 'the', 'computed', 'sensitivity', 'of', 'our', 'experiment', 'favorably', 'compares', 'with', 'direct', 'ingaas', 'camera', 'detection']] | [-0.055672573395409125, 0.10014390490213436, -0.03938732261574546, -0.029205806629169127, 0.0056729631330601354, -0.10672921761545505, 0.013582211580712262, 0.4681681887528231, -0.19994582847128947, -0.4049501254515679, 0.05404072277231662, -0.30769727210146053, -0.030333147936522267, 0.2645607399625628, -0.04081688174263163, 0.03509852221184193, 0.10157210489215199, -0.05079014603519639, -0.0385980132945575, -0.1680258923578401, 0.20281693246215582, 0.11551914274216045, 0.2859004927517543, -0.006069648837627366, 0.1001724430960928, -0.013193108596254227, -0.0475284468252645, -0.02032291239430738, -0.12184304906377504, 0.13890296244062483, 0.271063870119559, 0.07414713398916213, 0.1850550002310165, -0.40658067630300687, -0.1940486264566696, 0.06048444356920934, 0.1387279753053431, 0.06454171354037731, -0.1013564850972914, -0.2765626412339855, 0.09130220903560173, -0.14558493653528912, -0.09395481463045229, -0.021627411008054435, -0.043022149062423076, 0.03647005438891261, -0.3013305481155078, 0.01690789562823294, -0.0847854588917175, 0.11738099208708073, -0.04497286734755996, -0.08200950588121317, 0.013017485310800027, 0.09051808871485856, -0.04026529136611972, 0.0529132955856513, 0.1460376396331243, -0.17466046194394313, -0.10679389958724726, 0.3704291716296507, -0.1580001400591776, -0.07323347925490072, 0.17995723921042153, -0.20510480925440788, -0.003094193179073722, 0.24044885893547258, 0.11615310968603766, 0.16310596134416153, -0.07522636148428848, 0.002984714926474966, -0.008454185401544322, 0.29337713865530785, 0.1216847745127716, 0.13359986874740232, 0.18838169306061817, 0.21989149024146934, 0.033937079972739134, 0.13966967154911525, -0.1914427002166333, -0.01670838152816476, -0.27500928485722737, -0.11917117887804675, -0.17993246815383954, 0.0666932555262086, -0.07604967883255381, -0.05577104434717533, 0.42463933444733537, 0.19902808062169094, 0.1728826356797241, 0.04552015375215993, 0.34675738561985103, 0.12245290141233221, 0.09217334288540621, -0.030037021421459177, 0.2787113032130481, 0.15603602501226327, 0.13714814086466334, -0.20283353530942613, -0.07167430105619133, -0.0455708546174127] |
1,802.06051 | Measurements of the NMR Knight shift tensor and nonlinear magnetization
in URu$_2$Si$_2$ | URu$_2$Si$_2$ exhibits an anomalous peak in the nonlinear magnetic
susceptibility at the hidden order transition. In order to investigate this
anomaly, we conducted direct magnetization measurements and investigated the
detailed angular dependence of the $^{29}$Si nuclear magnetic resonance Knight
shift tensor. We find that the nonlinear magnetization is smaller than
previously reported, and the analogous nonlinear Knight shift tensor is below
the detection limit. Our results suggest that the magnitude of the anomalous
peak is sample dependent.
| cond-mat.str-el | uru_2si_2 exhibits an anomalous peak in the nonlinear magnetic susceptibility at the hidden order transition in order to investigate this anomaly we conducted direct magnetization measurements and investigated the detailed angular dependence of the 29si nuclear magnetic resonance knight shift tensor we find that the nonlinear magnetization is smaller than previously reported and the analogous nonlinear knight shift tensor is below the detection limit our results suggest that the magnitude of the anomalous peak is sample dependent | [['uru_2si_2', 'exhibits', 'an', 'anomalous', 'peak', 'in', 'the', 'nonlinear', 'magnetic', 'susceptibility', 'at', 'the', 'hidden', 'order', 'transition', 'in', 'order', 'to', 'investigate', 'this', 'anomaly', 'we', 'conducted', 'direct', 'magnetization', 'measurements', 'and', 'investigated', 'the', 'detailed', 'angular', 'dependence', 'of', 'the', '29si', 'nuclear', 'magnetic', 'resonance', 'knight', 'shift', 'tensor', 'we', 'find', 'that', 'the', 'nonlinear', 'magnetization', 'is', 'smaller', 'than', 'previously', 'reported', 'and', 'the', 'analogous', 'nonlinear', 'knight', 'shift', 'tensor', 'is', 'below', 'the', 'detection', 'limit', 'our', 'results', 'suggest', 'that', 'the', 'magnitude', 'of', 'the', 'anomalous', 'peak', 'is', 'sample', 'dependent']] | [-0.1544042521325702, 0.19615580124630103, -0.01909657094140791, 0.04693563631735742, -0.1390272318325066, -0.051524717929204565, 0.04318007069047202, 0.3741032968384105, -0.22280231013579607, -0.3228319017095612, 0.0424390307282908, -0.35976685116720664, -0.1232921409408574, 0.1791485950907136, 0.09388766512758547, 0.018451517163594434, -0.05763042802837762, 0.10253244919049276, -0.1304733876574349, -0.1514631378125738, 0.2886550035811477, 0.04804974354126237, 0.3377383863190552, 0.09420543302503692, 0.07169418491108658, -0.01298401810156254, 0.02978569036954409, 0.02971502464845196, -0.1450387393133851, 0.013824417443292868, 0.2058534040660053, -0.08235259200506784, 0.1455399664965543, -0.3774266983680057, -0.180331804960446, 0.08024319607534676, 0.12485309159262227, 0.13743401883629622, -0.05310172735193333, -0.27852294712581416, 0.04158870056619287, -0.1009620629710617, -0.10782777471921419, -0.1267983304554379, 0.0008177741055751776, -0.05698636481417464, -0.2644829686924622, 0.1936133982516922, 0.10729256462209023, 0.12319949467654352, -0.1224456130914003, -0.16371863967188718, 0.004882433666400127, 0.02297213366300521, 0.07687719129086412, 0.06793317648086261, 0.1898741771092082, -0.09972514110230296, -0.1383534660562873, 0.2938095654131143, -0.12707318245624524, -0.027775688592779946, 0.09731237599081904, -0.29026414472125955, -0.11946096267647945, 0.17047798501738867, 0.13624236000967876, 0.12331012738021938, -0.12211685603508701, 0.018854781657203355, -0.024583019603455027, 0.20784249040600541, 0.012001857472970695, 0.037962350341213216, 0.15565136016963363, 0.18976759547730546, 0.05615908997254325, 0.17161633773682664, -0.16533034194454357, -0.051367781215722295, -0.25916857107893215, -0.10734486439591878, -0.19291238627069957, 0.058487524072845264, -0.08585404618960721, -0.11493058515373956, 0.39233147200535645, 0.17635219880416023, 0.20720134504205948, -0.03926233424768819, 0.2934445521141124, 0.20752411838258047, 0.11221783138908349, 0.05215086358563079, 0.3305073239199527, 0.21868815556071797, 0.17464774954677015, -0.3997604664136934, 0.10320842810362191, -0.03046792240015098] |
1,802.06052 | Online Continuous Submodular Maximization | In this paper, we consider an online optimization process, where the
objective functions are not convex (nor concave) but instead belong to a broad
class of continuous submodular functions. We first propose a variant of the
Frank-Wolfe algorithm that has access to the full gradient of the objective
functions. We show that it achieves a regret bound of $O(\sqrt{T})$ (where $T$
is the horizon of the online optimization problem) against a
$(1-1/e)$-approximation to the best feasible solution in hindsight. However, in
many scenarios, only an unbiased estimate of the gradients are available. For
such settings, we then propose an online stochastic gradient ascent algorithm
that also achieves a regret bound of $O(\sqrt{T})$ regret, albeit against a
weaker $1/2$-approximation to the best feasible solution in hindsight. We also
generalize our results to $\gamma$-weakly submodular functions and prove the
same sublinear regret bounds. Finally, we demonstrate the efficiency of our
algorithms on a few problem instances, including non-convex/non-concave
quadratic programs, multilinear extensions of submodular set functions, and
D-optimal design.
| stat.ML cs.AI cs.DS cs.LG | in this paper we consider an online optimization process where the objective functions are not convex nor concave but instead belong to a broad class of continuous submodular functions we first propose a variant of the frankwolfe algorithm that has access to the full gradient of the objective functions we show that it achieves a regret bound of osqrtt where t is the horizon of the online optimization problem against a 11eapproximation to the best feasible solution in hindsight however in many scenarios only an unbiased estimate of the gradients are available for such settings we then propose an online stochastic gradient ascent algorithm that also achieves a regret bound of osqrtt regret albeit against a weaker 12approximation to the best feasible solution in hindsight we also generalize our results to gammaweakly submodular functions and prove the same sublinear regret bounds finally we demonstrate the efficiency of our algorithms on a few problem instances including nonconvexnonconcave quadratic programs multilinear extensions of submodular set functions and doptimal design | [['in', 'this', 'paper', 'we', 'consider', 'an', 'online', 'optimization', 'process', 'where', 'the', 'objective', 'functions', 'are', 'not', 'convex', 'nor', 'concave', 'but', 'instead', 'belong', 'to', 'a', 'broad', 'class', 'of', 'continuous', 'submodular', 'functions', 'we', 'first', 'propose', 'a', 'variant', 'of', 'the', 'frankwolfe', 'algorithm', 'that', 'has', 'access', 'to', 'the', 'full', 'gradient', 'of', 'the', 'objective', 'functions', 'we', 'show', 'that', 'it', 'achieves', 'a', 'regret', 'bound', 'of', 'osqrtt', 'where', 't', 'is', 'the', 'horizon', 'of', 'the', 'online', 'optimization', 'problem', 'against', 'a', '11eapproximation', 'to', 'the', 'best', 'feasible', 'solution', 'in', 'hindsight', 'however', 'in', 'many', 'scenarios', 'only', 'an', 'unbiased', 'estimate', 'of', 'the', 'gradients', 'are', 'available', 'for', 'such', 'settings', 'we', 'then', 'propose', 'an', 'online', 'stochastic', 'gradient', 'ascent', 'algorithm', 'that', 'also', 'achieves', 'a', 'regret', 'bound', 'of', 'osqrtt', 'regret', 'albeit', 'against', 'a', 'weaker', '12approximation', 'to', 'the', 'best', 'feasible', 'solution', 'in', 'hindsight', 'we', 'also', 'generalize', 'our', 'results', 'to', 'gammaweakly', 'submodular', 'functions', 'and', 'prove', 'the', 'same', 'sublinear', 'regret', 'bounds', 'finally', 'we', 'demonstrate', 'the', 'efficiency', 'of', 'our', 'algorithms', 'on', 'a', 'few', 'problem', 'instances', 'including', 'nonconvexnonconcave', 'quadratic', 'programs', 'multilinear', 'extensions', 'of', 'submodular', 'set', 'functions', 'and', 'doptimal', 'design']] | [-0.10489379717742629, -0.03481429530577523, -0.08901873966396757, 0.1102233896783935, -0.1283157745997111, -0.15924654333767566, 0.10650869599529401, 0.44821134227694887, -0.29739503084935925, -0.27767033862006485, 0.11252149138035196, -0.25863594310640386, -0.19119855179486683, 0.19776457925186014, -0.1390925247038743, 0.11669737728538387, 0.03953015742484819, 0.029710746460566016, -0.07377408399303077, -0.34925576486469556, 0.2726470115340569, 0.03759607604817685, 0.23459155821297883, 0.04661842620522348, 0.1265576061665673, -0.004725023553791371, 0.06183287760976589, 0.04302266582169316, -0.13274529927589218, 0.10292318024051686, 0.2868083294706814, 0.24955755515927167, 0.39020677817364535, -0.3612172161426508, -0.1258549899384944, 0.17724725045828205, 0.1276486851047428, 0.08968200073436354, -0.07835258109226936, -0.2064338094695951, 0.060615948973590454, -0.14456442702335842, -0.029577065834944898, -0.08993764814892502, -0.04256532881902813, 0.030410273434509607, -0.39697552688250487, 0.028577579038259998, 0.07954396299848503, -0.020984119605837445, -0.0968886441791035, -0.16086161876040878, 0.08641264845871112, 0.02914372912862084, 0.055266026887781636, 0.07626758209345015, 0.10816474054573161, -0.11900771554757023, -0.2035998113806162, 0.3225841947690104, -0.08095788415203888, -0.2136707180010324, 0.1594914417022444, -0.08662343414105249, -0.15998120492493564, 0.11419578793910191, 0.25242203313744427, 0.2437434876422313, -0.162704441481919, 0.11118645258600626, -0.1314590473066677, 0.16338052954806975, 0.028387058474067035, 0.03901453600688414, 0.03780976713663249, 0.15348975030761777, 0.24390784079230138, 0.20995353962732197, 0.025815138812035773, -0.1304223456786889, -0.29975187777908463, -0.12277104616461491, -0.20749411198423443, -0.02525454095033858, -0.1257630359520783, -0.18300397906833413, 0.3683284729944937, 0.15232954656310155, 0.1879004993080867, 0.2269427164316629, 0.3146777542025754, 0.0986001854318822, 0.03801868400451812, 0.1924629631282931, 0.2338524674079522, 0.0275718873507823, 0.056893476376056, -0.193860934632407, 0.1286639849965771, 0.058443867093460125] |
1,802.06053 | Bayesian Models for Unit Discovery on a Very Low Resource Language | Developing speech technologies for low-resource languages has become a very
active research field over the last decade. Among others, Bayesian models have
shown some promising results on artificial examples but still lack of in situ
experiments. Our work applies state-of-the-art Bayesian models to unsupervised
Acoustic Unit Discovery (AUD) in a real low-resource language scenario. We also
show that Bayesian models can naturally integrate information from other
resourceful languages by means of informative prior leading to more consistent
discovered units. Finally, discovered acoustic units are used, either as the
1-best sequence or as a lattice, to perform word segmentation. Word
segmentation results show that this Bayesian approach clearly outperforms a
Segmental-DTW baseline on the same corpus.
| cs.CL | developing speech technologies for lowresource languages has become a very active research field over the last decade among others bayesian models have shown some promising results on artificial examples but still lack of in situ experiments our work applies stateoftheart bayesian models to unsupervised acoustic unit discovery aud in a real lowresource language scenario we also show that bayesian models can naturally integrate information from other resourceful languages by means of informative prior leading to more consistent discovered units finally discovered acoustic units are used either as the 1best sequence or as a lattice to perform word segmentation word segmentation results show that this bayesian approach clearly outperforms a segmentaldtw baseline on the same corpus | [['developing', 'speech', 'technologies', 'for', 'lowresource', 'languages', 'has', 'become', 'a', 'very', 'active', 'research', 'field', 'over', 'the', 'last', 'decade', 'among', 'others', 'bayesian', 'models', 'have', 'shown', 'some', 'promising', 'results', 'on', 'artificial', 'examples', 'but', 'still', 'lack', 'of', 'in', 'situ', 'experiments', 'our', 'work', 'applies', 'stateoftheart', 'bayesian', 'models', 'to', 'unsupervised', 'acoustic', 'unit', 'discovery', 'aud', 'in', 'a', 'real', 'lowresource', 'language', 'scenario', 'we', 'also', 'show', 'that', 'bayesian', 'models', 'can', 'naturally', 'integrate', 'information', 'from', 'other', 'resourceful', 'languages', 'by', 'means', 'of', 'informative', 'prior', 'leading', 'to', 'more', 'consistent', 'discovered', 'units', 'finally', 'discovered', 'acoustic', 'units', 'are', 'used', 'either', 'as', 'the', '1best', 'sequence', 'or', 'as', 'a', 'lattice', 'to', 'perform', 'word', 'segmentation', 'word', 'segmentation', 'results', 'show', 'that', 'this', 'bayesian', 'approach', 'clearly', 'outperforms', 'a', 'segmentaldtw', 'baseline', 'on', 'the', 'same', 'corpus']] | [-0.0335293833011651, 0.02977675239743436, -0.05181273780640607, 0.09749409200249877, -0.16487610517396478, -0.18468853945664146, 0.0497646422070255, 0.46482471933204417, -0.2703083538278741, -0.3112517794448139, 0.0813375215593464, -0.28599525957057875, -0.19450714542293562, 0.28505155026479706, -0.10998994323808961, 0.053305359709427874, 0.17746737746015323, 0.08042156338495643, -0.04385858049959337, -0.296483674870902, 0.24666373349783385, 0.04267021629289446, 0.35236113828100396, -0.0280473774356212, 0.086306748139721, -0.06371613441590677, -0.057515374487960354, -0.018825111263268218, -0.0588869319769417, 0.16033256255966416, 0.36917349859571624, 0.18920908343014226, 0.3249964284988349, -0.4008456632625638, -0.3081026801332962, 0.08455131856495873, 0.19900921410717592, 0.11707136388704703, -0.0783230950653792, -0.3302745326471172, 0.0668737880830457, -0.20885284635822468, 0.035865456858453784, -0.15170500757123687, -0.0011178078466879302, -0.03588458611333759, -0.25134160635041136, 0.07050333271316751, 0.09491074950334191, 0.0866443621027365, -0.0514249364710658, -0.15291295720778994, 0.0332236600462286, 0.11159869947005063, 0.06030890027473664, 0.07515580549309227, 0.11117363756669588, -0.1345045856065362, -0.2125432352543596, 0.3458800678664263, -0.08061955754875957, -0.19379114520147836, 0.25107019081744447, -0.045502863330113, -0.20573529409113944, 0.03718788010729967, 0.1921153963878424, 0.11313575841108615, -0.18322314162689604, 0.026837326831331377, -0.06940485888340495, 0.20923154104680738, 0.07512569983220219, -0.022013085990278215, 0.2404452518814268, 0.2629563176530626, -0.004492337377374305, 0.10155378857253756, -0.09940565998764023, -0.07579367271657184, -0.18189534010659708, -0.09200492543740231, -0.1588196074590087, -0.03794577350153735, -0.056512863713259434, -0.14955848253310633, 0.34797780313774157, 0.2379158966308623, 0.15342477747043104, 0.1049309823424106, 0.31859772266787395, -0.014729559365374019, 0.1581221828870312, 0.06788809820927941, 0.18786735268715124, 0.017692347116392563, 0.11338132903645665, -0.09066581820636138, 0.09632630494276159, -0.009789566286806866] |
1,802.06054 | Learning Patterns for Detection with Multiscale Scan Statistics | This paper addresses detecting anomalous patterns in images, time-series, and
tensor data when the location and scale of the pattern is unknown a priori. The
multiscale scan statistic convolves the proposed pattern with the image at
various scales and returns the maximum of the resulting tensor. Scale corrected
multiscale scan statistics apply different standardizations at each scale, and
the limiting distribution under the null hypothesis---that the data is only
noise---is known for smooth patterns. We consider the problem of simultaneously
learning and detecting the anomalous pattern from a dictionary of smooth
patterns and a database of many tensors. To this end, we show that the
multiscale scan statistic is a subexponential random variable, and prove a
chaining lemma for standardized suprema, which may be of independent interest.
Then by averaging the statistics over the database of tensors we can learn the
pattern and obtain Bernstein-type error bounds. We will also provide a
construction of an $\epsilon$-net of the location and scale parameters,
providing a computationally tractable approximation with similar error bounds.
| math.ST cs.IT math.IT stat.ME stat.TH | this paper addresses detecting anomalous patterns in images timeseries and tensor data when the location and scale of the pattern is unknown a priori the multiscale scan statistic convolves the proposed pattern with the image at various scales and returns the maximum of the resulting tensor scale corrected multiscale scan statistics apply different standardizations at each scale and the limiting distribution under the null hypothesisthat the data is only noiseis known for smooth patterns we consider the problem of simultaneously learning and detecting the anomalous pattern from a dictionary of smooth patterns and a database of many tensors to this end we show that the multiscale scan statistic is a subexponential random variable and prove a chaining lemma for standardized suprema which may be of independent interest then by averaging the statistics over the database of tensors we can learn the pattern and obtain bernsteintype error bounds we will also provide a construction of an epsilonnet of the location and scale parameters providing a computationally tractable approximation with similar error bounds | [['this', 'paper', 'addresses', 'detecting', 'anomalous', 'patterns', 'in', 'images', 'timeseries', 'and', 'tensor', 'data', 'when', 'the', 'location', 'and', 'scale', 'of', 'the', 'pattern', 'is', 'unknown', 'a', 'priori', 'the', 'multiscale', 'scan', 'statistic', 'convolves', 'the', 'proposed', 'pattern', 'with', 'the', 'image', 'at', 'various', 'scales', 'and', 'returns', 'the', 'maximum', 'of', 'the', 'resulting', 'tensor', 'scale', 'corrected', 'multiscale', 'scan', 'statistics', 'apply', 'different', 'standardizations', 'at', 'each', 'scale', 'and', 'the', 'limiting', 'distribution', 'under', 'the', 'null', 'hypothesisthat', 'the', 'data', 'is', 'only', 'noiseis', 'known', 'for', 'smooth', 'patterns', 'we', 'consider', 'the', 'problem', 'of', 'simultaneously', 'learning', 'and', 'detecting', 'the', 'anomalous', 'pattern', 'from', 'a', 'dictionary', 'of', 'smooth', 'patterns', 'and', 'a', 'database', 'of', 'many', 'tensors', 'to', 'this', 'end', 'we', 'show', 'that', 'the', 'multiscale', 'scan', 'statistic', 'is', 'a', 'subexponential', 'random', 'variable', 'and', 'prove', 'a', 'chaining', 'lemma', 'for', 'standardized', 'suprema', 'which', 'may', 'be', 'of', 'independent', 'interest', 'then', 'by', 'averaging', 'the', 'statistics', 'over', 'the', 'database', 'of', 'tensors', 'we', 'can', 'learn', 'the', 'pattern', 'and', 'obtain', 'bernsteintype', 'error', 'bounds', 'we', 'will', 'also', 'provide', 'a', 'construction', 'of', 'an', 'epsilonnet', 'of', 'the', 'location', 'and', 'scale', 'parameters', 'providing', 'a', 'computationally', 'tractable', 'approximation', 'with', 'similar', 'error', 'bounds']] | [-0.09465441144728924, 0.09064906289165853, -0.12915989834103075, 0.10765240094966858, -0.0789916085462798, -0.11804706859676277, 0.04084881408865947, 0.3375604822902995, -0.30930815693538855, -0.3058237664021469, 0.14583364992388798, -0.2459678304313189, -0.14155654581811497, 0.17080576095510933, -0.06725921309279169, 0.0867711872108938, 0.05295326679890208, 0.03742970812069389, -0.0865546152475016, -0.2224454909494585, 0.3105375004548799, 0.07356549429652445, 0.31949928978129344, 0.00612294259309933, 0.1251293456168188, 0.008512193449389409, -0.08310779813567505, 0.015807905789081228, -0.11064411093337934, 0.13868110150797291, 0.25463667074218393, 0.176190059855606, 0.26162371133344575, -0.3888756247744074, -0.187664234899635, 0.13498172123491875, 0.12993693111587645, 0.11307553266764016, -0.0294317748356501, -0.28336739310282555, 0.10867355909225915, -0.10213179288912215, -0.08814248792786042, -0.07826816610005849, 0.010529941364931052, 0.018121010065078734, -0.35128123630386066, 0.08545556656643064, 0.06349244614350884, 0.07440307857468724, -0.02591110611717929, -0.09498353795531918, 0.04583645664936151, 0.12845413220775834, 0.05702975343378699, 1.2394503745086053e-05, 0.11404735931633588, -0.13023335884106071, -0.09330927378785632, 0.3489336142042542, -0.06812253864755964, -0.20955777119790367, 0.12226803049390368, -0.13310486494070467, -0.14315102542476618, 0.1189283576574834, 0.20820248752613277, 0.13124308793476838, -0.16408223911395695, 0.06344332166036645, -0.07210181648021236, 0.17175451064591898, 0.08391050581395736, 0.006474093909320586, 0.1490207954090746, 0.15273943335530074, 0.10299258599680958, 0.15245103907620752, -0.17566359563840225, -0.03743299010264523, -0.30650511641493616, -0.10906071011131109, -0.2161758368013098, -0.0274128455120851, -0.17673083018598845, -0.18758755225991242, 0.4367658955099828, 0.17046005916062687, 0.2244236850474194, 0.12139394452233854, 0.2684090424589265, 0.093312637661909, 0.06660581297405502, 0.08665645847590092, 0.15708850049961579, 0.07878984687986838, 0.07019452449169288, -0.1538871194468811, 0.10266123386099935, 0.05915055376861025] |
1,802.06055 | Computationally Inferred Genealogical Networks Uncover Long-Term Trends
in Assortative Mating | Genealogical networks, also known as family trees or population pedigrees,
are commonly studied by genealogists wanting to know about their ancestry, but
they also provide a valuable resource for disciplines such as digital
demography, genetics, and computational social science. These networks are
typically constructed by hand through a very time-consuming process, which
requires comparing large numbers of historical records manually. We develop
computational methods for automatically inferring large-scale genealogical
networks. A comparison with human-constructed networks attests to the accuracy
of the proposed methods. To demonstrate the applicability of the inferred
large-scale genealogical networks, we present a longitudinal analysis on the
mating patterns observed in a network. This analysis shows a consistent
tendency of people choosing a spouse with a similar socioeconomic status, a
phenomenon known as assortative mating. Interestingly, we do not observe this
tendency to consistently decrease (nor increase) over our study period of 150
years.
| cs.SI physics.soc-ph q-bio.PE | genealogical networks also known as family trees or population pedigrees are commonly studied by genealogists wanting to know about their ancestry but they also provide a valuable resource for disciplines such as digital demography genetics and computational social science these networks are typically constructed by hand through a very timeconsuming process which requires comparing large numbers of historical records manually we develop computational methods for automatically inferring largescale genealogical networks a comparison with humanconstructed networks attests to the accuracy of the proposed methods to demonstrate the applicability of the inferred largescale genealogical networks we present a longitudinal analysis on the mating patterns observed in a network this analysis shows a consistent tendency of people choosing a spouse with a similar socioeconomic status a phenomenon known as assortative mating interestingly we do not observe this tendency to consistently decrease nor increase over our study period of 150 years | [['genealogical', 'networks', 'also', 'known', 'as', 'family', 'trees', 'or', 'population', 'pedigrees', 'are', 'commonly', 'studied', 'by', 'genealogists', 'wanting', 'to', 'know', 'about', 'their', 'ancestry', 'but', 'they', 'also', 'provide', 'a', 'valuable', 'resource', 'for', 'disciplines', 'such', 'as', 'digital', 'demography', 'genetics', 'and', 'computational', 'social', 'science', 'these', 'networks', 'are', 'typically', 'constructed', 'by', 'hand', 'through', 'a', 'very', 'timeconsuming', 'process', 'which', 'requires', 'comparing', 'large', 'numbers', 'of', 'historical', 'records', 'manually', 'we', 'develop', 'computational', 'methods', 'for', 'automatically', 'inferring', 'largescale', 'genealogical', 'networks', 'a', 'comparison', 'with', 'humanconstructed', 'networks', 'attests', 'to', 'the', 'accuracy', 'of', 'the', 'proposed', 'methods', 'to', 'demonstrate', 'the', 'applicability', 'of', 'the', 'inferred', 'largescale', 'genealogical', 'networks', 'we', 'present', 'a', 'longitudinal', 'analysis', 'on', 'the', 'mating', 'patterns', 'observed', 'in', 'a', 'network', 'this', 'analysis', 'shows', 'a', 'consistent', 'tendency', 'of', 'people', 'choosing', 'a', 'spouse', 'with', 'a', 'similar', 'socioeconomic', 'status', 'a', 'phenomenon', 'known', 'as', 'assortative', 'mating', 'interestingly', 'we', 'do', 'not', 'observe', 'this', 'tendency', 'to', 'consistently', 'decrease', 'nor', 'increase', 'over', 'our', 'study', 'period', 'of', '150', 'years']] | [-0.07018626711095288, 0.061074989281709575, -0.04864384948071858, 0.1559540349037901, -0.12892495162708506, -0.12861045923607092, 0.11142008434558504, 0.4055571485157699, -0.24730772139147333, -0.3547972003125573, 0.10907232865917636, -0.2625982233104679, -0.2307972786262351, 0.1827193770592726, -0.09475774420361506, -0.0067628953376249095, 0.1334669455034301, 0.03899779735146607, 0.0007143724886764301, -0.2577733751896718, 0.2690331907623945, 0.062298481846395685, 0.3193305306430039, 0.0010191468834519794, 0.08329500968740258, -0.021104105717537618, -0.08668415889415845, 0.06188776935307207, -0.10739142636047702, 0.13545407316558164, 0.32169369884371146, 0.20345720918593954, 0.3516397945668982, -0.4144215209358563, -0.2453525459014313, 0.13518989945960005, 0.20006645878630192, 0.1516086663309268, -0.03517229582840092, -0.2972869203834195, 0.05521673793435632, -0.18231996220587562, -0.09253866471189125, -0.0994467626474096, 0.015681737598130633, 0.046707167865101276, -0.222936403025452, 0.07793810718839554, 0.012742520128185414, 0.13720312276344798, 0.03410349458883427, -0.14251198019985467, -0.034658671712362504, 0.17087149270012822, 0.08970853404204954, -0.0021965495288397557, 0.13933006633226186, -0.1355991505942792, -0.15510949413355898, 0.3560248325871501, -0.018003227441150644, -0.14185051975541746, 0.23977647572500657, -0.11898996256457718, -0.19274471903679102, 0.08055760442878898, 0.19660040329701636, 0.1015897582871967, -0.18060118919366028, -0.031665818037366344, -0.047351508981816164, 0.17687574200083386, 0.04596818376122017, 0.010254974322304232, 0.19667490273044277, 0.21379862498645097, 0.030089928512022933, 0.08850318902771767, -0.05840207336387559, -0.1114927663831423, -0.15819112541893982, -0.0898826900544283, -0.167573197417867, 0.07153576776899209, -0.10213320676948195, -0.18301671476754017, 0.37011628906555116, 0.17211688714236864, 0.19887735888566058, 0.1333363309577554, 0.2633484141360522, 0.012488707372191528, 0.10641775336501282, 0.06482396191241194, 0.15166712225389298, 0.07741589836891077, 0.17282650392256957, -0.14677472470036376, 0.17620902305488054, -0.025341406914290703] |
1,802.06056 | X-ray Reverberation Mapping and Dramatic Variability of Seyfert 1 Galaxy
1H 1934-063 | A fraction of active galactic nuclei (AGN) exhibit dramatic variability,
which is observed on timescales down to minutes in the X-ray band. We introduce
the case study of 1H 1934-063 (z = 0.0102), a Narrow-line Seyfert 1 (NLS1)
among the brightest and most variable AGN ever observed with XMM-Newton. This
work includes spectral and temporal analyses of a concurrent XMM-Newton and
NuSTAR 2015 observation lasting 130 kiloseconds, during which the X-ray source
exhibited a steep (factor of 6) plummet and subsequent full recovery of flux
level, accompanied by deviation from a single log-normal flux distribution. We
rule out Compton-thin obscuration as the cause for this dramatic variability
observed even at NuSTAR energies. In order to constrain coronal geometry,
dynamics, and emission/absorption processes, we compare detailed spectral
fitting with Fourier-based timing analysis. Similar to other well-studied,
highly variable Seyfert 1s, this AGN is X-ray bright and displays strong
reflection features. We find a narrower broad iron line component compared to
most Seyfert 1s, and constrain black hole spin to be < 0.1, one of the lowest
yet discovered for such systems. Combined spectral and timing results are
consistent with a dramatic change in the continuum on timescales as short as a
few kiloseconds dictating the nature of this variability. We also discover a
Fe-K time lag, measuring a delay of 20 seconds between relativistically-blurred
reflection off the inner accretion flow and the hard X-ray continuum emission.
| astro-ph.HE | a fraction of active galactic nuclei agn exhibit dramatic variability which is observed on timescales down to minutes in the xray band we introduce the case study of 1h 1934063 z 00102 a narrowline seyfert 1 nls1 among the brightest and most variable agn ever observed with xmmnewton this work includes spectral and temporal analyses of a concurrent xmmnewton and nustar 2015 observation lasting 130 kiloseconds during which the xray source exhibited a steep factor of 6 plummet and subsequent full recovery of flux level accompanied by deviation from a single lognormal flux distribution we rule out comptonthin obscuration as the cause for this dramatic variability observed even at nustar energies in order to constrain coronal geometry dynamics and emissionabsorption processes we compare detailed spectral fitting with fourierbased timing analysis similar to other wellstudied highly variable seyfert 1s this agn is xray bright and displays strong reflection features we find a narrower broad iron line component compared to most seyfert 1s and constrain black hole spin to be 01 one of the lowest yet discovered for such systems combined spectral and timing results are consistent with a dramatic change in the continuum on timescales as short as a few kiloseconds dictating the nature of this variability we also discover a fek time lag measuring a delay of 20 seconds between relativisticallyblurred reflection off the inner accretion flow and the hard xray continuum emission | [['a', 'fraction', 'of', 'active', 'galactic', 'nuclei', 'agn', 'exhibit', 'dramatic', 'variability', 'which', 'is', 'observed', 'on', 'timescales', 'down', 'to', 'minutes', 'in', 'the', 'xray', 'band', 'we', 'introduce', 'the', 'case', 'study', 'of', '1h', '1934063', 'z', '00102', 'a', 'narrowline', 'seyfert', '1', 'nls1', 'among', 'the', 'brightest', 'and', 'most', 'variable', 'agn', 'ever', 'observed', 'with', 'xmmnewton', 'this', 'work', 'includes', 'spectral', 'and', 'temporal', 'analyses', 'of', 'a', 'concurrent', 'xmmnewton', 'and', 'nustar', '2015', 'observation', 'lasting', '130', 'kiloseconds', 'during', 'which', 'the', 'xray', 'source', 'exhibited', 'a', 'steep', 'factor', 'of', '6', 'plummet', 'and', 'subsequent', 'full', 'recovery', 'of', 'flux', 'level', 'accompanied', 'by', 'deviation', 'from', 'a', 'single', 'lognormal', 'flux', 'distribution', 'we', 'rule', 'out', 'comptonthin', 'obscuration', 'as', 'the', 'cause', 'for', 'this', 'dramatic', 'variability', 'observed', 'even', 'at', 'nustar', 'energies', 'in', 'order', 'to', 'constrain', 'coronal', 'geometry', 'dynamics', 'and', 'emissionabsorption', 'processes', 'we', 'compare', 'detailed', 'spectral', 'fitting', 'with', 'fourierbased', 'timing', 'analysis', 'similar', 'to', 'other', 'wellstudied', 'highly', 'variable', 'seyfert', '1s', 'this', 'agn', 'is', 'xray', 'bright', 'and', 'displays', 'strong', 'reflection', 'features', 'we', 'find', 'a', 'narrower', 'broad', 'iron', 'line', 'component', 'compared', 'to', 'most', 'seyfert', '1s', 'and', 'constrain', 'black', 'hole', 'spin', 'to', 'be', '01', 'one', 'of', 'the', 'lowest', 'yet', 'discovered', 'for', 'such', 'systems', 'combined', 'spectral', 'and', 'timing', 'results', 'are', 'consistent', 'with', 'a', 'dramatic', 'change', 'in', 'the', 'continuum', 'on', 'timescales', 'as', 'short', 'as', 'a', 'few', 'kiloseconds', 'dictating', 'the', 'nature', 'of', 'this', 'variability', 'we', 'also', 'discover', 'a', 'fek', 'time', 'lag', 'measuring', 'a', 'delay', 'of', '20', 'seconds', 'between', 'relativisticallyblurred', 'reflection', 'off', 'the', 'inner', 'accretion', 'flow', 'and', 'the', 'hard', 'xray', 'continuum', 'emission']] | [-0.04973398445671874, 0.0806814821683882, -0.043970339995776785, 0.14286839582953312, -0.09583963400981357, -0.14931814883763356, 0.08271921082030467, 0.4911132941648749, -0.17471346231117235, -0.3615821745599909, 0.07608732933044064, -0.31339168265975753, -0.011161787953259873, 0.1971584443376271, -0.017424768360797316, -0.021094362869666053, 0.013970202222418297, -0.10978762282094726, -0.06841387020339708, -0.1746183966069707, 0.24895433967096073, 0.0916143679461474, 0.16453201810885543, -0.008822818072954321, 0.06523844007912477, -0.025858428772811873, -0.0832287145854809, -0.01923059726410931, -0.07726688242235405, 0.045675780170532906, 0.25659947561557755, 0.07057409375606924, 0.2200676770439243, -0.34451137517843844, -0.24948676181896912, 0.06833481352479229, 0.16080199229803965, -0.0061667461047583295, -0.003412779851150217, -0.2385129975912699, 0.021169970640742043, -0.20598387431678492, -0.15956083370938673, 0.031633268933389976, 0.06828348207636736, 0.020710162889686058, -0.173725898435805, 0.15975229269691948, 0.048206051863260276, 0.0825190221326795, -0.13240857243112386, -0.03894061836462211, -0.021489927513577076, 0.04321658209865463, 0.09174352006611398, 0.03011205480677369, 0.1722996248527438, -0.0918613512345975, -0.10903084295017018, 0.36879373211333333, -0.02878498475785881, 0.08161944041333707, 0.20212328826089326, -0.23804632540750076, -0.2271838729362132, 0.2503060518547186, 0.14366128554219953, 0.11932754359641594, -0.09678116022882148, -0.03542415963627342, -0.03037390388510238, 0.34012766071627365, 0.03813363728314188, 0.09287049740970392, 0.26251524668548193, 0.14154462949553473, 0.005675585518976481, 0.1351628007805316, -0.2532084264515514, -0.011472126380701003, -0.25288762273226767, -0.038747997537249265, -0.10911220067545996, 0.15696038168419457, -0.11394903276275978, -0.13385943190700472, 0.40599856687035285, 0.05221486039829023, 0.251650056484605, 0.019957848948001025, 0.2826667793119198, 0.1278348470082635, 0.046239128690574255, 0.10275465601418922, 0.3141470753993229, 0.14088432968730621, 0.13206779505708255, -0.24063550973018022, 0.07118123273288927, -0.013657124580590633] |
1,802.06057 | Viewport Adaptation-Based Immersive Video Streaming: Perceptual Modeling
and Applications | Immersive video offers the freedom to navigate inside virtualized
environment. Instead of streaming the bulky immersive videos entirely, a
viewport (also referred to as field of view, FoV) adaptive streaming is
preferred. We often stream the high-quality content within current viewport,
while reducing the quality of representation elsewhere to save the network
bandwidth consumption. Consider that we could refine the quality when focusing
on a new FoV, in this paper, we model the perceptual impact of the quality
variations (through adapting the quantization stepsize and spatial resolution)
with respect to the refinement duration, and yield a product of two closed-form
exponential functions that well explain the joint quantization and resolution
induced quality impact. Analytical model is cross-validated using another set
of data, where both Pearson and Spearman's rank correlation coefficients are
close to 0.98. Our work is devised to optimize the adaptive FoV streaming of
the immersive video under limited network resource. Numerical results show that
our proposed model significantly improves the quality of experience of users,
with about 9.36\% BD-Rate (Bjontegaard Delta Rate) improvement on average as
compared to other representative methods, particularly under the limited
bandwidth.
| cs.MM | immersive video offers the freedom to navigate inside virtualized environment instead of streaming the bulky immersive videos entirely a viewport also referred to as field of view fov adaptive streaming is preferred we often stream the highquality content within current viewport while reducing the quality of representation elsewhere to save the network bandwidth consumption consider that we could refine the quality when focusing on a new fov in this paper we model the perceptual impact of the quality variations through adapting the quantization stepsize and spatial resolution with respect to the refinement duration and yield a product of two closedform exponential functions that well explain the joint quantization and resolution induced quality impact analytical model is crossvalidated using another set of data where both pearson and spearmans rank correlation coefficients are close to 098 our work is devised to optimize the adaptive fov streaming of the immersive video under limited network resource numerical results show that our proposed model significantly improves the quality of experience of users with about 936 bdrate bjontegaard delta rate improvement on average as compared to other representative methods particularly under the limited bandwidth | [['immersive', 'video', 'offers', 'the', 'freedom', 'to', 'navigate', 'inside', 'virtualized', 'environment', 'instead', 'of', 'streaming', 'the', 'bulky', 'immersive', 'videos', 'entirely', 'a', 'viewport', 'also', 'referred', 'to', 'as', 'field', 'of', 'view', 'fov', 'adaptive', 'streaming', 'is', 'preferred', 'we', 'often', 'stream', 'the', 'highquality', 'content', 'within', 'current', 'viewport', 'while', 'reducing', 'the', 'quality', 'of', 'representation', 'elsewhere', 'to', 'save', 'the', 'network', 'bandwidth', 'consumption', 'consider', 'that', 'we', 'could', 'refine', 'the', 'quality', 'when', 'focusing', 'on', 'a', 'new', 'fov', 'in', 'this', 'paper', 'we', 'model', 'the', 'perceptual', 'impact', 'of', 'the', 'quality', 'variations', 'through', 'adapting', 'the', 'quantization', 'stepsize', 'and', 'spatial', 'resolution', 'with', 'respect', 'to', 'the', 'refinement', 'duration', 'and', 'yield', 'a', 'product', 'of', 'two', 'closedform', 'exponential', 'functions', 'that', 'well', 'explain', 'the', 'joint', 'quantization', 'and', 'resolution', 'induced', 'quality', 'impact', 'analytical', 'model', 'is', 'crossvalidated', 'using', 'another', 'set', 'of', 'data', 'where', 'both', 'pearson', 'and', 'spearmans', 'rank', 'correlation', 'coefficients', 'are', 'close', 'to', '098', 'our', 'work', 'is', 'devised', 'to', 'optimize', 'the', 'adaptive', 'fov', 'streaming', 'of', 'the', 'immersive', 'video', 'under', 'limited', 'network', 'resource', 'numerical', 'results', 'show', 'that', 'our', 'proposed', 'model', 'significantly', 'improves', 'the', 'quality', 'of', 'experience', 'of', 'users', 'with', 'about', '936', 'bdrate', 'bjontegaard', 'delta', 'rate', 'improvement', 'on', 'average', 'as', 'compared', 'to', 'other', 'representative', 'methods', 'particularly', 'under', 'the', 'limited', 'bandwidth']] | [-0.10909189074424738, 0.027542208191903835, -0.059480989820020085, 0.01883033643673388, -0.11557906326205335, -0.13549161618973882, 0.08396869090965944, 0.4419347031470289, -0.2466500478667172, -0.3533104687601074, 0.06658437744686928, -0.24364678889642505, -0.131531250028109, 0.18659280789991153, -0.16900722534684615, 0.050508269648264374, 0.08666219418298174, 0.04209184981284932, -0.06890254294783633, -0.2885172947093267, 0.25440863368255806, 0.1518536852996418, 0.35984562682037685, 0.027131963321406216, 0.10477349975452643, 0.016068583984366235, -0.05879152867504779, 0.023028481503908727, -0.0819455302876584, 0.1348379473699964, 0.24837553268921048, 0.16852083617390537, 0.2977708782602281, -0.3939242750744928, -0.22583634400351799, 0.04694111870581852, 0.16904152862797367, 0.021862466467225696, -0.05100527494015262, -0.29535454070882844, 0.11553119504786928, -0.1963657630298705, -0.06769255029266691, -0.0709644669348145, -0.04336794952234443, 0.02713851589319809, -0.3121449977114677, 0.0471264380227991, -0.015212882115296462, 0.07367058675785992, -0.06920053351441408, -0.09689991679266693, 0.019421150215607596, 0.1529849565080255, 0.047091220530437274, 0.0691970943866726, 0.1419774432925577, -0.16576424590062927, -0.0657482833292131, 0.4031122073202449, -0.057390916704718166, -0.2285378605997648, 0.1763955838032027, -0.0968107405307897, -0.07999735625142003, 0.152551334646386, 0.21714395859196564, 0.08196238877097976, -0.11874580460908402, 0.01832231623120606, -0.008906616067344492, 0.2209344127098407, 0.08970524944498248, 0.09064404255297175, 0.13159491737587328, 0.2006193398246492, 0.06966943795142824, 0.1193585116319722, -0.10940812766504658, -0.0785354587951685, -0.21414762020688802, -0.1334375228575944, -0.17655581772516676, 0.006479531847797135, -0.1421556649875907, -0.12201760156966626, 0.39144272834341476, 0.20442493844784815, 0.18334990924468295, 0.10463368152093919, 0.3688044170849025, 0.05002338786176493, 0.06812573426756709, 0.07158526916499343, 0.17945119816023, 0.012075887430200284, 0.14336736822117338, -0.20021523483456138, 0.06705712851131942, 0.02145489034078577] |
1,802.06058 | Variance-based Gradient Compression for Efficient Distributed Deep
Learning | Due to the substantial computational cost, training state-of-the-art deep
neural networks for large-scale datasets often requires distributed training
using multiple computation workers. However, by nature, workers need to
frequently communicate gradients, causing severe bottlenecks, especially on
lower bandwidth connections. A few methods have been proposed to compress
gradient for efficient communication, but they either suffer a low compression
ratio or significantly harm the resulting model accuracy, particularly when
applied to convolutional neural networks. To address these issues, we propose a
method to reduce the communication overhead of distributed deep learning. Our
key observation is that gradient updates can be delayed until an unambiguous
(high amplitude, low variance) gradient has been calculated. We also present an
efficient algorithm to compute the variance with negligible additional cost. We
experimentally show that our method can achieve very high compression ratio
while maintaining the result model accuracy. We also analyze the efficiency
using computation and communication cost models and provide the evidence that
this method enables distributed deep learning for many scenarios with commodity
environments.
| cs.LG | due to the substantial computational cost training stateoftheart deep neural networks for largescale datasets often requires distributed training using multiple computation workers however by nature workers need to frequently communicate gradients causing severe bottlenecks especially on lower bandwidth connections a few methods have been proposed to compress gradient for efficient communication but they either suffer a low compression ratio or significantly harm the resulting model accuracy particularly when applied to convolutional neural networks to address these issues we propose a method to reduce the communication overhead of distributed deep learning our key observation is that gradient updates can be delayed until an unambiguous high amplitude low variance gradient has been calculated we also present an efficient algorithm to compute the variance with negligible additional cost we experimentally show that our method can achieve very high compression ratio while maintaining the result model accuracy we also analyze the efficiency using computation and communication cost models and provide the evidence that this method enables distributed deep learning for many scenarios with commodity environments | [['due', 'to', 'the', 'substantial', 'computational', 'cost', 'training', 'stateoftheart', 'deep', 'neural', 'networks', 'for', 'largescale', 'datasets', 'often', 'requires', 'distributed', 'training', 'using', 'multiple', 'computation', 'workers', 'however', 'by', 'nature', 'workers', 'need', 'to', 'frequently', 'communicate', 'gradients', 'causing', 'severe', 'bottlenecks', 'especially', 'on', 'lower', 'bandwidth', 'connections', 'a', 'few', 'methods', 'have', 'been', 'proposed', 'to', 'compress', 'gradient', 'for', 'efficient', 'communication', 'but', 'they', 'either', 'suffer', 'a', 'low', 'compression', 'ratio', 'or', 'significantly', 'harm', 'the', 'resulting', 'model', 'accuracy', 'particularly', 'when', 'applied', 'to', 'convolutional', 'neural', 'networks', 'to', 'address', 'these', 'issues', 'we', 'propose', 'a', 'method', 'to', 'reduce', 'the', 'communication', 'overhead', 'of', 'distributed', 'deep', 'learning', 'our', 'key', 'observation', 'is', 'that', 'gradient', 'updates', 'can', 'be', 'delayed', 'until', 'an', 'unambiguous', 'high', 'amplitude', 'low', 'variance', 'gradient', 'has', 'been', 'calculated', 'we', 'also', 'present', 'an', 'efficient', 'algorithm', 'to', 'compute', 'the', 'variance', 'with', 'negligible', 'additional', 'cost', 'we', 'experimentally', 'show', 'that', 'our', 'method', 'can', 'achieve', 'very', 'high', 'compression', 'ratio', 'while', 'maintaining', 'the', 'result', 'model', 'accuracy', 'we', 'also', 'analyze', 'the', 'efficiency', 'using', 'computation', 'and', 'communication', 'cost', 'models', 'and', 'provide', 'the', 'evidence', 'that', 'this', 'method', 'enables', 'distributed', 'deep', 'learning', 'for', 'many', 'scenarios', 'with', 'commodity', 'environments']] | [-0.1189833609428126, 0.028538583776653522, -0.04461172660976125, 0.0663808101423259, -0.09371588259461548, -0.21111271002912643, 0.094426996948753, 0.47386900321389847, -0.29655563550298675, -0.38661423523785077, 0.10392582579924349, -0.21532116982676033, -0.17439553914292122, 0.1905919888359086, -0.1535958534331954, 0.0933756319103403, 0.14768950713319126, -0.02029273630380603, -0.0545711071133118, -0.32509362410852, 0.20492590462165336, 0.12585674681682385, 0.3698376192335497, 0.04955956489197489, 0.11975801470880097, -0.07221073260236728, -0.012160737243105183, -0.0004014745844822181, -0.0188281917392684, 0.15813789161314307, 0.29911963756929155, 0.1716121222315988, 0.3632178519748979, -0.48619585389500125, -0.2691378294468492, 0.15276520540638233, 0.20023394581706574, 0.13795387405537585, -0.08049839194823187, -0.22884011241792543, 0.11304380424179093, -0.19766274245853444, -0.014395599517452513, -0.17505837266594826, -0.044537818889890675, -0.005621545009617286, -0.27751418269016065, 0.07697680198733167, 0.003787889477540875, 0.02743472569289873, 0.0053331051865995625, -0.12135595972486363, 0.054675430979862896, 0.1284822653197855, 0.03453513516769445, 0.05342973168933906, 0.13734041131510025, -0.17994784130115737, -0.11802824311317843, 0.33326472373058397, -0.04983034310317789, -0.1909342150078618, 0.2343929259791393, -0.0038919299323525694, -0.15960605934872266, 0.1574146060861255, 0.27901962098572947, 0.08269445012100259, -0.1422570689397691, 0.014375735308133523, 0.05299702034555158, 0.20161710622480783, 0.03762667840183304, 0.034992343781526845, 0.1266180728426018, 0.20221927242179277, 0.08429882906435864, 0.1222792246170636, -0.12388144780021183, -0.09689706092297334, -0.1669472091867349, -0.09515784829562225, -0.18489094956625493, -0.017228827847178742, -0.1195793386924214, -0.12171378978991021, 0.3105544457402712, 0.2361984270072014, 0.20169523253503163, 0.14590997864868036, 0.4136886207593812, 0.10276395234562544, 0.14083794298532762, 0.1723666067899539, 0.22758582463945476, 0.05118110399742268, 0.13892296862200296, -0.20303427474437097, 0.13187682463607767, -0.017730394022931393] |
1,802.06059 | Flexible Energy Management Protocol for Cooperative EV-to-EV Charging | In this paper, we investigate flexible power transfer among electric vehicles
(EVs) from a cooperative perspective in an EV system. First, the concept of
cooperative EV-to-EV (V2V) charging is introduced, which enables active
cooperation via charging/discharging operations between EVs as energy consumers
and EVs as energy providers. Then, based on the cooperative V2V charging
concept, a flexible energy management protocol with different V2V matching
algorithms is proposed, which can help the EVs achieve more flexible and
smarter charging/discharging behaviors. In the proposed energy management
protocol, we define the utilities of the EVs based on the cost and profit
through cooperative V2V charging and employ the bipartite graph to model the
charging/discharging cooperation between EVs as energy consumers and EVs as
energy providers. Based on the constructed bipartite graph, a max-weight V2V
matching algorithm is proposed in order to optimize the network social welfare.
Moreover, taking individual rationality into consideration, we further
introduce the stable matching concepts and propose two stable V2V matching
algorithms, which can yield the EV-consumer-optimal and EV-provider-optimal
stable V2V matchings, respectively. Simulation results verify the efficiency of
our proposed cooperative V2V charging based energy management protocol in
improving the EV utilities and the network social welfare as well as reducing
the energy consumption of the EVs.
| cs.SY | in this paper we investigate flexible power transfer among electric vehicles evs from a cooperative perspective in an ev system first the concept of cooperative evtoev v2v charging is introduced which enables active cooperation via chargingdischarging operations between evs as energy consumers and evs as energy providers then based on the cooperative v2v charging concept a flexible energy management protocol with different v2v matching algorithms is proposed which can help the evs achieve more flexible and smarter chargingdischarging behaviors in the proposed energy management protocol we define the utilities of the evs based on the cost and profit through cooperative v2v charging and employ the bipartite graph to model the chargingdischarging cooperation between evs as energy consumers and evs as energy providers based on the constructed bipartite graph a maxweight v2v matching algorithm is proposed in order to optimize the network social welfare moreover taking individual rationality into consideration we further introduce the stable matching concepts and propose two stable v2v matching algorithms which can yield the evconsumeroptimal and evprovideroptimal stable v2v matchings respectively simulation results verify the efficiency of our proposed cooperative v2v charging based energy management protocol in improving the ev utilities and the network social welfare as well as reducing the energy consumption of the evs | [['in', 'this', 'paper', 'we', 'investigate', 'flexible', 'power', 'transfer', 'among', 'electric', 'vehicles', 'evs', 'from', 'a', 'cooperative', 'perspective', 'in', 'an', 'ev', 'system', 'first', 'the', 'concept', 'of', 'cooperative', 'evtoev', 'v2v', 'charging', 'is', 'introduced', 'which', 'enables', 'active', 'cooperation', 'via', 'chargingdischarging', 'operations', 'between', 'evs', 'as', 'energy', 'consumers', 'and', 'evs', 'as', 'energy', 'providers', 'then', 'based', 'on', 'the', 'cooperative', 'v2v', 'charging', 'concept', 'a', 'flexible', 'energy', 'management', 'protocol', 'with', 'different', 'v2v', 'matching', 'algorithms', 'is', 'proposed', 'which', 'can', 'help', 'the', 'evs', 'achieve', 'more', 'flexible', 'and', 'smarter', 'chargingdischarging', 'behaviors', 'in', 'the', 'proposed', 'energy', 'management', 'protocol', 'we', 'define', 'the', 'utilities', 'of', 'the', 'evs', 'based', 'on', 'the', 'cost', 'and', 'profit', 'through', 'cooperative', 'v2v', 'charging', 'and', 'employ', 'the', 'bipartite', 'graph', 'to', 'model', 'the', 'chargingdischarging', 'cooperation', 'between', 'evs', 'as', 'energy', 'consumers', 'and', 'evs', 'as', 'energy', 'providers', 'based', 'on', 'the', 'constructed', 'bipartite', 'graph', 'a', 'maxweight', 'v2v', 'matching', 'algorithm', 'is', 'proposed', 'in', 'order', 'to', 'optimize', 'the', 'network', 'social', 'welfare', 'moreover', 'taking', 'individual', 'rationality', 'into', 'consideration', 'we', 'further', 'introduce', 'the', 'stable', 'matching', 'concepts', 'and', 'propose', 'two', 'stable', 'v2v', 'matching', 'algorithms', 'which', 'can', 'yield', 'the', 'evconsumeroptimal', 'and', 'evprovideroptimal', 'stable', 'v2v', 'matchings', 'respectively', 'simulation', 'results', 'verify', 'the', 'efficiency', 'of', 'our', 'proposed', 'cooperative', 'v2v', 'charging', 'based', 'energy', 'management', 'protocol', 'in', 'improving', 'the', 'ev', 'utilities', 'and', 'the', 'network', 'social', 'welfare', 'as', 'well', 'as', 'reducing', 'the', 'energy', 'consumption', 'of', 'the', 'evs']] | [-0.18967804170916652, 0.04834121583066078, -0.05656073817495003, 0.04857064477163502, -0.04652559521237334, -0.18768270471069998, 0.15151680372169385, 0.4203848979408735, -0.2647528344882851, -0.3640655962980886, 0.025828028095488266, -0.24043989082607917, -0.15403420255673164, 0.10214559042496263, -0.13599600571035905, 0.03233248980272815, 0.037834164364946084, 0.024714351418084528, 0.07778709592129267, -0.2222619823915364, 0.2670995455333574, 0.1288886818202954, 0.4189802968820322, 0.16175412941380468, 0.0735726765338874, 0.04919676659560934, 0.015815616748069677, 0.01561045102228058, -0.12545031970999773, 0.1782119168710072, 0.3563576684812608, 0.16973092778386928, 0.3367188947944387, -0.4723191365952269, -0.21195508086222034, 0.14581058472078473, 0.09321805657547655, -0.005603533641105174, -0.01627660518405039, -0.2893420770420756, 0.10330516342367543, -0.3156675047091959, -0.011577378742586714, -0.07438891084448805, -0.08383558595720317, 0.12215483238359967, -0.3448013004132556, -0.033553097975774875, -0.03154804699803314, -0.015250811144230363, -0.08103770669097606, -0.10276662001049472, -0.05359731873415989, 0.17490437035607084, 0.03723381434904086, -0.09517385798350465, 0.19137026038409655, -0.09313780950377831, -0.19558976361080463, 0.4075721454200814, 0.0497077795607942, -0.14748613625421253, 0.10349154722700528, 0.04652721539492384, -0.08589458208784316, 0.0987720754062836, 0.2610894388731714, 0.10375144095747794, -0.1896827056714632, -0.009989939103337023, -0.01738455371244006, 0.12631537828671302, 0.07721867777624176, 0.07492000909377504, 0.14314330560528193, 0.24668861057573152, 0.25503246802655816, 0.07824248065199993, -0.026478038901842915, -0.17873700821401498, -0.17007401580831885, -0.13280257697497466, -0.21365133259056623, 0.03138307204302762, -0.1152362527356266, -0.07765153592262526, 0.4139141254759963, 0.16244311996473415, 0.0686433401899141, 0.09888268518657198, 0.4169519945246719, 0.10760147400704456, 0.028726926618210465, 0.18784190431797823, 0.16393448289899717, 0.015539380114240735, 0.20907824733339755, -0.24974605567031088, 0.0814685254545376, 0.029198599375730144] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.