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.0446 | Parameterized Bilinear Matrix Inequality Techniques in ${\cal
H}_{\infty}$ Fuzzy PID Control Design | Proportional-integral-derivative (PID) structured controller is the most
popular class of industrial control but still could not be appropriately
exploited in fuzzy systems. To gain the practicability and tractability of
fuzzy systems, this paper develops a parameterized bilinear matrix inequality
characterization for the ${\cal H}_{\infty}$ fuzzy PID control design, which is
then relaxed into a bilinear matrix inequality optimization problem of
nonconvex optimization. Several computational procedures are then developed for
its solution. The merit of the developed algorithms is shown through the
benchmark examples.
| cs.SY | proportionalintegralderivative pid structured controller is the most popular class of industrial control but still could not be appropriately exploited in fuzzy systems to gain the practicability and tractability of fuzzy systems this paper develops a parameterized bilinear matrix inequality characterization for the cal h_infty fuzzy pid control design which is then relaxed into a bilinear matrix inequality optimization problem of nonconvex optimization several computational procedures are then developed for its solution the merit of the developed algorithms is shown through the benchmark examples | [['proportionalintegralderivative', 'pid', 'structured', 'controller', 'is', 'the', 'most', 'popular', 'class', 'of', 'industrial', 'control', 'but', 'still', 'could', 'not', 'be', 'appropriately', 'exploited', 'in', 'fuzzy', 'systems', 'to', 'gain', 'the', 'practicability', 'and', 'tractability', 'of', 'fuzzy', 'systems', 'this', 'paper', 'develops', 'a', 'parameterized', 'bilinear', 'matrix', 'inequality', 'characterization', 'for', 'the', 'cal', 'h_infty', 'fuzzy', 'pid', 'control', 'design', 'which', 'is', 'then', 'relaxed', 'into', 'a', 'bilinear', 'matrix', 'inequality', 'optimization', 'problem', 'of', 'nonconvex', 'optimization', 'several', 'computational', 'procedures', 'are', 'then', 'developed', 'for', 'its', 'solution', 'the', 'merit', 'of', 'the', 'developed', 'algorithms', 'is', 'shown', 'through', 'the', 'benchmark', 'examples']] | [-0.09228798751130206, -0.021404581683048284, -0.08652893285244613, 0.05903109193622438, -0.12312974982771528, -0.22686939727492542, 0.00036824453223765975, 0.3695102227200945, -0.34100487255575473, -0.2931230788130358, 0.19406612506500973, -0.22240062795175486, -0.19786124838185104, 0.21840174868702888, -0.14872347622975168, 0.19117753559524328, 0.019925231078965027, 0.00041726360613682185, -0.08471587268882487, -0.2773665270027536, 0.24898141620299183, -0.003694947371371539, 0.25172579774060794, 0.02854199832619493, 0.1376991310740361, -0.008404502089707607, 0.03590526423663888, 0.05924597451272589, -0.10049075994034667, 0.1707899377433056, 0.3420715211744768, 0.22531363885311118, 0.3716632118953549, -0.3776277215949383, -0.1615969221365739, 0.15040106284544322, 0.14946403612273307, -0.009236364548251661, -0.06329363371324108, -0.2697765004206785, 0.11627540774419005, -0.18870056867150656, -0.07129874605831342, -0.1306233964944595, -0.03277375707010099, -0.028167524161827134, -0.360355816501002, -0.015532535545707467, 0.07288604812045772, 0.011131334152207318, -0.07648284792905696, -0.1447642056035798, 0.052982333508959735, 0.02172239832243467, -0.01572967254337911, -0.018277672422399003, 0.16905462641426058, -0.0978232887377177, -0.159638145467244, 0.3381419729508729, 0.08226108729435377, -0.3015089836869254, 0.11770321576889739, -0.003996523422559342, -0.12870765142479396, 0.10913225588759026, 0.2134869603597256, 0.13386752274650407, -0.22304181257509684, 0.13556811000228894, -0.03721117528985782, 0.20152771155383573, 0.0032970469069094903, 0.0240627082558461, 0.09316881578583944, 0.22504035239276218, 0.17869371553905397, 0.1899858473909525, 0.030701669572616917, -0.16866103642204977, -0.24016896078464048, -0.124509079269616, -0.14190152119452426, -0.031655956516764686, -0.10777227794285163, -0.15771783212815546, 0.3984484637874257, 0.11197839719972696, 0.09514273864677153, 0.06851288556901132, 0.3434903572526682, 0.16388997605003147, 0.058674147391848896, 0.03619269235059619, 0.24533801644350436, 0.1607375147960048, 0.11174180397359901, -0.20433157369920826, 0.06607530148228608, 0.11177765774394734] |
1,802.04461 | Commutators of multi-parameter flag singular integrals and applications | We introduce the iterated commutator for the Riesz transforms in the
multi-parameter flag setting, and prove the upper bound of this commutator with
respect to the symbol $b$ in the flag BMO space. Our methods require the
techniques of semigroups, harmonic functions and multi-parameter flag
Littlewood-Paley analysis. We also introduce the big commutator in this
multi-parameter flag setting and prove the upper bound with symbol $b$ in the
flag little-bmo space by establishing the "exponential-logarithmic" bridge
between this flag little bmo space and the Muckenhoupt $A_p$ weights with flag
structure. As an application, we establish the div-curl lemmas with respect to
the appropriate Hardy spaces in the multi-parameter flag setting.
| math.CA | we introduce the iterated commutator for the riesz transforms in the multiparameter flag setting and prove the upper bound of this commutator with respect to the symbol b in the flag bmo space our methods require the techniques of semigroups harmonic functions and multiparameter flag littlewoodpaley analysis we also introduce the big commutator in this multiparameter flag setting and prove the upper bound with symbol b in the flag littlebmo space by establishing the exponentiallogarithmic bridge between this flag little bmo space and the muckenhoupt a_p weights with flag structure as an application we establish the divcurl lemmas with respect to the appropriate hardy spaces in the multiparameter flag setting | [['we', 'introduce', 'the', 'iterated', 'commutator', 'for', 'the', 'riesz', 'transforms', 'in', 'the', 'multiparameter', 'flag', 'setting', 'and', 'prove', 'the', 'upper', 'bound', 'of', 'this', 'commutator', 'with', 'respect', 'to', 'the', 'symbol', 'b', 'in', 'the', 'flag', 'bmo', 'space', 'our', 'methods', 'require', 'the', 'techniques', 'of', 'semigroups', 'harmonic', 'functions', 'and', 'multiparameter', 'flag', 'littlewoodpaley', 'analysis', 'we', 'also', 'introduce', 'the', 'big', 'commutator', 'in', 'this', 'multiparameter', 'flag', 'setting', 'and', 'prove', 'the', 'upper', 'bound', 'with', 'symbol', 'b', 'in', 'the', 'flag', 'littlebmo', 'space', 'by', 'establishing', 'the', 'exponentiallogarithmic', 'bridge', 'between', 'this', 'flag', 'little', 'bmo', 'space', 'and', 'the', 'muckenhoupt', 'a_p', 'weights', 'with', 'flag', 'structure', 'as', 'an', 'application', 'we', 'establish', 'the', 'divcurl', 'lemmas', 'with', 'respect', 'to', 'the', 'appropriate', 'hardy', 'spaces', 'in', 'the', 'multiparameter', 'flag', 'setting']] | [-0.11003910922103587, 0.04829106720951023, -0.036885945750144096, 0.10518222406544987, -0.12452959339348, -0.0848568586970107, 0.033034072624980856, 0.33971929668935885, -0.36999027277214813, -0.15221395153539477, 0.15932412129728585, -0.19609344202102325, -0.17346172860968823, 0.21533138005473063, -0.1944139871934275, 0.03366550786096022, 0.08215642341096467, 0.06442177080369871, -0.13976126721282617, -0.2962843451270868, 0.4480336918196547, -0.0299947204905639, 0.21175631927753533, 0.03207211187878333, 0.05178516882299787, 0.021321008464646175, -0.06156921723789168, -0.1282545456696417, -0.2684848283443156, 0.2246000070312838, 0.2588735903963583, 0.06552332274320988, 0.29847758542105485, -0.34087449049047375, -0.129298928860199, 0.22889735652219265, 0.13153038163660863, -0.022010613993288727, -0.009815390704524352, -0.3697647354608282, 0.02341540992567572, -0.12955809041105826, -0.1261622257735751, -0.09903950801273005, -0.0073167427203729065, 0.07016036110938689, -0.33506960678822145, 0.06640348102605834, 0.121505612174237, 0.08582026586993896, -0.11873332994195436, -0.14279852103476132, 0.028949548214793615, 0.06514087274944017, -0.014425154978306879, 0.06137917093866411, 0.06460916016404646, -0.02047355395502522, -0.15930488739384835, 0.3246506419323316, -0.09702563800191114, -0.3078973254769904, 0.026105420253829125, -0.2143862956511113, -0.15234181595914956, 0.019048915039577067, 0.09818764274337526, 0.12196013310907083, -0.010235040500405492, 0.19220887032901407, -0.0715791994381115, 0.027615549722088312, 0.11195209298556277, 0.0737477938960725, 0.00789866134857571, 0.07842012283759653, 0.17905867934961794, 0.1764260504155531, -0.029795865361539244, -0.0796793199185957, -0.3631986201903142, -0.2584607617965891, -0.1430947068275525, 0.10674808983618411, -0.1690717834777438, -0.20145344640205212, 0.32012236523741017, 0.05269296699707661, 0.16887946600850604, 0.14938915784923582, 0.20309660601677423, 0.07057423336397207, 0.08511099767115035, 0.043975153681608516, 0.16619214407540003, 0.26668263110759405, 0.0883431784785139, -0.12379381471845416, -0.003633665544655892, 0.22846506873504557] |
1,802.04462 | Robustness of the covariance matrix for galaxy clustering measurements | We present a study on the robustness of the covariance matrix estimation for
galaxy clustering measurements depending on the cosmological parameters and
galaxy bias. To this end, we have produced 9000 galaxy mock catalogues relying
on the effective Zel'dovich approximation implemented in the EZmocks computer
code, using different input cosmological models and bias parameters. The
reference catalogue has also been produced with this code making our study
insensitive to the approximation at least on a relative-qualitative level. Our
findings indicate that the covariance matrix is insensitive to the input power
spectrum (including $\sigma_8$), as long as the 2- and 3-point galaxy
clustering measurements agree with the given data. In fact, the covariance
matrix shows a bias at small scales ($r\lesssim40 h^{-1}$Mpc) when the chosen
galaxy bias parameters yield a 3-point statistics, which is not compatible with
the reference one within the error bars, even though the 2-point statistics
agree within 1%. Nevertheless, the error becomes negligible at large scales
making the covariance matrix still reliable for data analysis using only
measurements in that regime (e.g., measuring baryon acoustic oscillations).
High precision in cosmological parameter estimation is expected for
covariance matrices extracted from mock galaxy catalogues which take accurately
into account both the 2- and the 3- point statistics. This is independent of
whether this is achieved by using the right cosmology and galaxy bias (which
are not a priori known) or just any combination of both fitting the net
observed galaxy clustering.
| astro-ph.CO | we present a study on the robustness of the covariance matrix estimation for galaxy clustering measurements depending on the cosmological parameters and galaxy bias to this end we have produced 9000 galaxy mock catalogues relying on the effective zeldovich approximation implemented in the ezmocks computer code using different input cosmological models and bias parameters the reference catalogue has also been produced with this code making our study insensitive to the approximation at least on a relativequalitative level our findings indicate that the covariance matrix is insensitive to the input power spectrum including sigma_8 as long as the 2 and 3point galaxy clustering measurements agree with the given data in fact the covariance matrix shows a bias at small scales rlesssim40 h1mpc when the chosen galaxy bias parameters yield a 3point statistics which is not compatible with the reference one within the error bars even though the 2point statistics agree within 1 nevertheless the error becomes negligible at large scales making the covariance matrix still reliable for data analysis using only measurements in that regime eg measuring baryon acoustic oscillations high precision in cosmological parameter estimation is expected for covariance matrices extracted from mock galaxy catalogues which take accurately into account both the 2 and the 3 point statistics this is independent of whether this is achieved by using the right cosmology and galaxy bias which are not a priori known or just any combination of both fitting the net observed galaxy clustering | [['we', 'present', 'a', 'study', 'on', 'the', 'robustness', 'of', 'the', 'covariance', 'matrix', 'estimation', 'for', 'galaxy', 'clustering', 'measurements', 'depending', 'on', 'the', 'cosmological', 'parameters', 'and', 'galaxy', 'bias', 'to', 'this', 'end', 'we', 'have', 'produced', '9000', 'galaxy', 'mock', 'catalogues', 'relying', 'on', 'the', 'effective', 'zeldovich', 'approximation', 'implemented', 'in', 'the', 'ezmocks', 'computer', 'code', 'using', 'different', 'input', 'cosmological', 'models', 'and', 'bias', 'parameters', 'the', 'reference', 'catalogue', 'has', 'also', 'been', 'produced', 'with', 'this', 'code', 'making', 'our', 'study', 'insensitive', 'to', 'the', 'approximation', 'at', 'least', 'on', 'a', 'relativequalitative', 'level', 'our', 'findings', 'indicate', 'that', 'the', 'covariance', 'matrix', 'is', 'insensitive', 'to', 'the', 'input', 'power', 'spectrum', 'including', 'sigma_8', 'as', 'long', 'as', 'the', '2', 'and', '3point', 'galaxy', 'clustering', 'measurements', 'agree', 'with', 'the', 'given', 'data', 'in', 'fact', 'the', 'covariance', 'matrix', 'shows', 'a', 'bias', 'at', 'small', 'scales', 'rlesssim40', 'h1mpc', 'when', 'the', 'chosen', 'galaxy', 'bias', 'parameters', 'yield', 'a', '3point', 'statistics', 'which', 'is', 'not', 'compatible', 'with', 'the', 'reference', 'one', 'within', 'the', 'error', 'bars', 'even', 'though', 'the', '2point', 'statistics', 'agree', 'within', '1', 'nevertheless', 'the', 'error', 'becomes', 'negligible', 'at', 'large', 'scales', 'making', 'the', 'covariance', 'matrix', 'still', 'reliable', 'for', 'data', 'analysis', 'using', 'only', 'measurements', 'in', 'that', 'regime', 'eg', 'measuring', 'baryon', 'acoustic', 'oscillations', 'high', 'precision', 'in', 'cosmological', 'parameter', 'estimation', 'is', 'expected', 'for', 'covariance', 'matrices', 'extracted', 'from', 'mock', 'galaxy', 'catalogues', 'which', 'take', 'accurately', 'into', 'account', 'both', 'the', '2', 'and', 'the', '3', 'point', 'statistics', 'this', 'is', 'independent', 'of', 'whether', 'this', 'is', 'achieved', 'by', 'using', 'the', 'right', 'cosmology', 'and', 'galaxy', 'bias', 'which', 'are', 'not', 'a', 'priori', 'known', 'or', 'just', 'any', 'combination', 'of', 'both', 'fitting', 'the', 'net', 'observed', 'galaxy', 'clustering']] | [-0.052088168313557275, 0.059078002444986705, -0.09232025825570506, 0.11858362374801937, -0.08388059128808427, -0.11346432815060394, 0.0056448162204067705, 0.37361247002080894, -0.21287308084275808, -0.3491289610896556, 0.10385426488085396, -0.2859832850317997, -0.060580460661554626, 0.20589797218353584, 0.01028478226456869, 0.040162850945319, 0.0821598781502677, -0.005684877231436544, -0.09302744170259704, -0.27711560395809287, 0.31253551157136844, 0.13510384443936924, 0.2667174271413098, -0.038133453461828656, 0.1217844821892632, -0.0062906740342411034, -0.11168379017841616, 0.03325139840618633, -0.12735633071301072, 0.01563258209508341, 0.24183285235745208, 0.11296735654770038, 0.24771947675934022, -0.3543495691798347, -0.20144933888544503, 0.10236958290838001, 0.16823221547703238, 0.14480527470991109, -0.046813331567779747, -0.26682630238399907, 0.10273399555502327, -0.15139889782567403, -0.0794857588643403, -0.033429971563914265, -0.025952149605355128, 0.006330735210151992, -0.29461103924024057, 0.17461194288327503, -0.01695957426790335, 0.0567514126960609, -0.011417235154268882, -0.14357393132678573, -0.003978889873913766, 0.14476698149196807, 0.019417704041135422, 0.05535183670683608, 0.17020836164376008, -0.14151413742234642, -0.021890673130774037, 0.3925969637657621, -0.056078895634219486, -0.1655308983588755, 0.11279934899156688, -0.18278206363086547, -0.169872543153014, 0.05615735761567982, 0.16288137814482073, 0.030720853004175937, -0.13939915197955252, 0.07953713663291599, -0.0018343916123881002, 0.25013121943124456, 0.024760671697408896, -0.0011907699410745164, 0.21703868765758047, 0.11778182743865388, 0.04966069091594618, 0.04889908256583991, -0.1402039382758718, -0.005247865655463361, -0.30278462297029823, -0.02562480865077556, -0.2474621322666486, 0.047871908027506786, -0.17659504902927803, -0.17669627460881007, 0.4092231797810379, 0.17436550142025287, 0.24023330084459318, 0.11176286508654591, 0.33776937504240534, 0.08645532152149826, 0.10300620763745767, 0.07738360085107057, 0.26809143031670646, 0.14317323530198048, 0.02309239688660622, -0.19953703370323272, 0.08583997438611096, -0.019285502601960464] |
1,802.04463 | qKZ/tRS Duality via Quantum K-Theoretic Counts | We show that normalized quantum K-theoretic vertex functions for cotangent
bundles of partial flag varieties are the eigenfunctions of quantum
trigonometric Ruijsenaars-Schneider (tRS) Hamiltonians. Using recently observed
relations between quantum Knizhnik-Zamolodchikov (qKZ) equations and tRS
integrable system we derive a nontrivial identity for vertex functions with
relative insertions.
| math.AG hep-th math-ph math.MP math.QA math.RT | we show that normalized quantum ktheoretic vertex functions for cotangent bundles of partial flag varieties are the eigenfunctions of quantum trigonometric ruijsenaarsschneider trs hamiltonians using recently observed relations between quantum knizhnikzamolodchikov qkz equations and trs integrable system we derive a nontrivial identity for vertex functions with relative insertions | [['we', 'show', 'that', 'normalized', 'quantum', 'ktheoretic', 'vertex', 'functions', 'for', 'cotangent', 'bundles', 'of', 'partial', 'flag', 'varieties', 'are', 'the', 'eigenfunctions', 'of', 'quantum', 'trigonometric', 'ruijsenaarsschneider', 'trs', 'hamiltonians', 'using', 'recently', 'observed', 'relations', 'between', 'quantum', 'knizhnikzamolodchikov', 'qkz', 'equations', 'and', 'trs', 'integrable', 'system', 'we', 'derive', 'a', 'nontrivial', 'identity', 'for', 'vertex', 'functions', 'with', 'relative', 'insertions']] | [-0.24954335273165876, 0.06969039453906589, -0.04978236179643621, 0.11658449418609962, -0.12554480589460582, -0.2304457845457364, -0.030984828515405145, 0.30464748103016365, -0.32380446535050095, -0.17224634155475846, 0.029533405118854716, -0.32271535547139746, -0.24303139657422435, 0.17160330505672997, -0.08357484434964135, 0.14354274520883337, 0.08831171249039471, 0.023817706790093023, -0.21765205801057164, -0.28079018951393664, 0.43177065687874955, -0.12930366954484876, 0.1985000332351774, 0.04698370438806402, 0.1721377351010839, 0.03393726463643058, 0.05387586105401473, -0.07600302749779075, -0.15371201008459442, 0.09403215895872563, 0.29634921813946374, 0.03408068410741786, 0.10146072149897616, -0.4343392869147162, -0.06476029878831469, 0.12118044949602336, 0.1428659979622656, 0.08338199767361705, 0.024447372086190928, -0.33571761260585237, 0.039300169970374554, -0.1933644798506672, -0.2051216577917027, -0.12057869898853824, 0.0542003495223374, 0.06257215052998315, -0.21505119426971456, 0.06635468068998307, 0.042218157590620344, 0.13750753059381773, -0.06573583361265871, -0.13096508118663527, -0.11797179322456941, 0.05320423704688437, -0.10117258873166672, 0.002263782526521633, 0.04071904476343965, -0.08717361564049497, -0.23832945074536838, 0.33546921897990006, -0.04423149678526291, -0.3198537778031702, 0.0405310764326714, -0.16675098692455018, -0.19891466713549258, 0.09258932690136135, 0.0667682026590531, 0.14308149654728672, -0.10520803573308513, 0.1736207947433286, -0.09269543578072141, 0.027835375862196088, 0.06207206335966475, 0.0943656590898172, 0.16779976640827954, -0.047541428939439356, 0.05376387267218282, 0.1489514118875377, 0.04024287173524499, -0.18300432447964946, -0.36547422378013533, -0.20422036055242643, -0.12074087284660588, 0.16793976399155022, -0.10917896520095383, -0.19860738970358702, 0.39177315166064847, 0.008981535851489753, 0.15843115367655022, 0.16586830854551712, 0.1509200475217464, 0.24637895436778004, 0.11336865367290254, 0.04196453393281748, 0.12376676014779757, 0.27388300738918286, -0.006019191622423629, -0.25937130802776664, -0.0654890521351869, 0.3024082936462946] |
1,802.04464 | Semi-continuous convolutions on weakly periodic Lebesgue spaces | We deduce mixed quasi-norm estimates of Lebesgue types on semi-continuous
convolutions between sequences and functions which may be periodic or possess a
weaker form of periodicity in certain directions. In these directions, the
Lebesgue quasi-norms are applied on the period instead of the whole axes.
| math.FA | we deduce mixed quasinorm estimates of lebesgue types on semicontinuous convolutions between sequences and functions which may be periodic or possess a weaker form of periodicity in certain directions in these directions the lebesgue quasinorms are applied on the period instead of the whole axes | [['we', 'deduce', 'mixed', 'quasinorm', 'estimates', 'of', 'lebesgue', 'types', 'on', 'semicontinuous', 'convolutions', 'between', 'sequences', 'and', 'functions', 'which', 'may', 'be', 'periodic', 'or', 'possess', 'a', 'weaker', 'form', 'of', 'periodicity', 'in', 'certain', 'directions', 'in', 'these', 'directions', 'the', 'lebesgue', 'quasinorms', 'are', 'applied', 'on', 'the', 'period', 'instead', 'of', 'the', 'whole', 'axes']] | [-0.17394234399414724, 0.14496313873678446, -0.07498891345846156, 0.11039247653550571, -0.05112365364200539, -0.0879197816674908, 0.021430295007303358, 0.44348411733905474, -0.34687551769117514, -0.14813105737169582, 0.1666418934085717, -0.24082632627752093, -0.07551223021518025, 0.2371675883575032, -0.11342771510697074, 0.04282125936200221, 0.03348158326310416, 0.03695275210258034, -0.14315895547883378, -0.25817974456068543, 0.3470648898018731, -0.1129909100010991, 0.2528237658656306, -0.041125146806654, 0.02709984199868308, 0.015393866464081737, 0.0005212604035882072, -0.022149023465398286, -0.14749573905848795, 0.15559982400801448, 0.17848807267016834, 0.05394856486883429, 0.27722853422164917, -0.4222094901733928, -0.16517119302103916, 0.1801786892943912, 0.0884436171191434, -0.044725344073958694, 0.016513012806859073, -0.29895898898442586, 0.07222846860273016, -0.04129096493124962, -0.1634281541686505, -0.10491215149975486, 0.018994765345835024, 0.13431388477070463, -0.305556558445096, 0.12316141368614303, 0.09662005287698573, 0.09120135570151938, -0.1926698060395817, -0.1730594181455672, -0.024909249341322316, 0.10399387285837697, 0.09966132765014966, 0.04291012244712975, 0.057099272248645624, 0.0058332234414087405, -0.10336934141814709, 0.3225061503342456, -0.0503006489507647, -0.30152786730064285, 0.1964646825980809, -0.19541540493567786, -0.1586955055490964, 0.09828632763690419, 0.1825057533259193, 0.12690748576488758, -0.0780320489158233, 0.07159828767051092, -0.059963607581125365, 0.13103106522725688, 0.19025962262724835, 0.10960005283769635, 0.20100374604678817, 0.009299189804328813, 0.18849035676879186, 0.1284940805260299, -0.06164334337744448, -0.08134049950167536, -0.30591693392230407, -0.14496198271711666, -0.14653513692319392, 0.07819383933674544, -0.11756911963812955, -0.2422253742814064, 0.39024305591463215, 0.0651650936368646, 0.19401599230865638, 0.07075638593329737, 0.17429039344812433, 0.11864200855294864, 0.12944348332530353, 0.0052519410486436555, 0.1917352094884134, 0.14697193958175678, 0.05857008296168513, -0.09365160817073451, 0.09902616622340348, 0.14398950611551603] |
1,802.04465 | Strong Matter: Rethinking Philosophically | Normal condensed matter is merely of electromagnetic interaction. A novel
state of strong-interaction matter is revisited.
| astro-ph.HE nucl-th | normal condensed matter is merely of electromagnetic interaction a novel state of stronginteraction matter is revisited | [['normal', 'condensed', 'matter', 'is', 'merely', 'of', 'electromagnetic', 'interaction', 'a', 'novel', 'state', 'of', 'stronginteraction', 'matter', 'is', 'revisited']] | [-0.1885814857960213, 0.3158669248223305, -0.19483720132848248, 0.15746527824376244, -0.1743068905780092, -0.10523959083366208, -0.031027075368911028, 0.23668291792273521, -0.2222612799378112, -0.28625865653157234, -0.07833172986283898, -0.2843915584962815, -0.07381296216044575, 0.04050019558053464, 0.05943666963139549, 0.046282704221084714, -0.08286919794045389, 0.12609252193942666, -0.11812797142192721, -0.11256730882450938, 0.38202014146372676, -0.032022811588831246, 0.25770106379059143, 0.07762313156854361, 0.06090051028877497, -0.009601124562323093, -0.02760511467931792, -0.06404148903675377, -0.04969767265720293, 0.0527686522109434, 0.24193775383537286, 0.07494202214002144, 0.23329587746411562, -0.46827730420045555, -0.2743740782607347, 0.14745722385123372, 0.09442987304646522, 0.15615699207410216, -0.17274786089546978, -0.3929993752390146, -0.021330521150957793, -0.26170283621468116, -0.12046160938916728, -0.08940452139358968, 0.05224604345858097, -0.04367202508728951, -0.19955490168649703, 0.18976780341472477, -0.004299319625715725, -0.09003124968148768, -0.048872069630306214, -0.09555125329643488, 0.058503530686721206, -0.05696062257629819, 0.007988353812834248, 0.0978272941429168, 0.20454893567330146, -0.3389970778953284, 0.005310108535923064, 0.4787868510466069, -0.029040170862572268, -0.09208027995191514, 0.1800718237645924, -0.07028339029056951, -0.07981901988387108, 0.1911629932001233, 0.1350169733632356, 0.07348757865838706, -0.22979244258021936, 0.18177588284015656, -0.08222942391876131, 0.1863779635168612, -0.017323676496744156, 0.05430207645986229, 0.34748305520042777, 0.29917130153626204, -0.028626084385905415, 0.0838793013826944, -0.023685735650360584, -0.12865784321911633, -0.34628675039857626, -0.1861902957316488, -0.2933280743891373, 0.02737648892798461, 0.01596760033226019, -0.19283378875115886, 0.35406062158290297, 0.025596069870516658, 0.058949931524693966, -0.12402907339856029, 0.33575174142606556, 0.10987286653835326, -0.11088913719868287, -0.03141178417718038, 0.4013336778152734, 0.28614731039851904, 0.06530823931097984, -0.20401319541269913, 0.02203993359580636, 0.01521399524062872] |
1,802.04466 | Towards Generic Deobfuscation of Windows API Calls | A common way to get insight into a malicious program's functionality is to
look at which API functions it calls. To complicate the reverse engineering of
their programs, malware authors deploy API obfuscation techniques, hiding them
from analysts' eyes and anti-malware scanners. This problem can be partially
addressed by using dynamic analysis; that is, by executing a malware sample in
a controlled environment and logging the API calls. However, malware that is
aware of virtual machines and sandboxes might terminate without showing any
signs of malicious behavior. In this paper, we introduce a static analysis
technique allowing generic deobfuscation of Windows API calls. The technique
utilizes symbolic execution and hidden Markov models to predict API names from
the arguments passed to the API functions. Our best prediction model can
correctly identify API names with 87.60% accuracy.
| cs.CR stat.AP | a common way to get insight into a malicious programs functionality is to look at which api functions it calls to complicate the reverse engineering of their programs malware authors deploy api obfuscation techniques hiding them from analysts eyes and antimalware scanners this problem can be partially addressed by using dynamic analysis that is by executing a malware sample in a controlled environment and logging the api calls however malware that is aware of virtual machines and sandboxes might terminate without showing any signs of malicious behavior in this paper we introduce a static analysis technique allowing generic deobfuscation of windows api calls the technique utilizes symbolic execution and hidden markov models to predict api names from the arguments passed to the api functions our best prediction model can correctly identify api names with 8760 accuracy | [['a', 'common', 'way', 'to', 'get', 'insight', 'into', 'a', 'malicious', 'programs', 'functionality', 'is', 'to', 'look', 'at', 'which', 'api', 'functions', 'it', 'calls', 'to', 'complicate', 'the', 'reverse', 'engineering', 'of', 'their', 'programs', 'malware', 'authors', 'deploy', 'api', 'obfuscation', 'techniques', 'hiding', 'them', 'from', 'analysts', 'eyes', 'and', 'antimalware', 'scanners', 'this', 'problem', 'can', 'be', 'partially', 'addressed', 'by', 'using', 'dynamic', 'analysis', 'that', 'is', 'by', 'executing', 'a', 'malware', 'sample', 'in', 'a', 'controlled', 'environment', 'and', 'logging', 'the', 'api', 'calls', 'however', 'malware', 'that', 'is', 'aware', 'of', 'virtual', 'machines', 'and', 'sandboxes', 'might', 'terminate', 'without', 'showing', 'any', 'signs', 'of', 'malicious', 'behavior', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'static', 'analysis', 'technique', 'allowing', 'generic', 'deobfuscation', 'of', 'windows', 'api', 'calls', 'the', 'technique', 'utilizes', 'symbolic', 'execution', 'and', 'hidden', 'markov', 'models', 'to', 'predict', 'api', 'names', 'from', 'the', 'arguments', 'passed', 'to', 'the', 'api', 'functions', 'our', 'best', 'prediction', 'model', 'can', 'correctly', 'identify', 'api', 'names', 'with', '8760', 'accuracy']] | [-0.11177509552281764, 0.008351038154904488, -0.12611429924662743, 0.12120055697375426, -0.18155196550543662, -0.24202970612311253, 0.1575043585499602, 0.3854822479395403, -0.3028927225964489, -0.34853639765815053, 0.11187543475276066, -0.2851745787801014, -0.12945856655154514, 0.21048797772403943, -0.08277859972720897, 0.09057297259655402, 0.06915258527819619, -0.0049843263294961715, -0.026973474767335037, -0.2269691982065086, 0.27658431903562614, 0.024239769781491272, 0.25899327843691466, 0.05077047512556116, 0.02053243726560915, 0.03791357428999618, -0.055416161049571304, -0.046412013093423514, -0.014586487107724814, 0.10934804755487237, 0.36621072719305325, 0.2875486424572214, 0.3347901356173679, -0.4326750964199568, -0.1552661143174326, 0.051448192926882595, 0.15025908167094545, 0.13578569365889523, -0.019062864414795683, -0.3659491220558131, 0.15309172022949766, -0.21343891742742724, -0.09885459805286868, -0.1327826967600871, -0.0511101471622371, 0.0010577456620349376, -0.23372589626384002, -0.07368983612309589, 0.06588910319238764, 0.09212487584186925, 0.0006104673780673356, -0.03337684187227515, -0.0004884210328950926, 0.1798246535455325, 0.06855427700146619, 0.014368253418554862, 0.22953361486671148, -0.079311757163938, -0.17812914364729768, 0.3288124133315351, 0.006820490100869426, -0.1606921804568696, 0.21365359393120917, 0.013301410677808302, -0.16780197819073994, 0.10931791166723188, 0.2408341485041159, 0.10625442250252322, -0.2314040446964403, 0.05390337014881273, -0.005227798930610771, 0.24862647437775093, 0.07691695371435749, -0.044274486270215775, 0.20860441949356484, 0.15885834867820248, 0.00904522709272526, 0.1723316172922582, -0.0037617482505824967, -0.022835402063059587, -0.2104848812851641, -0.16832976570973793, -0.11618680592488359, -0.018579872040491965, -0.06077695045301139, -0.2018283329317691, 0.3896996747426413, 0.26072240654655077, 0.11993983666826454, 0.08859041632687742, 0.3968699077627173, 0.027306798718766206, 0.15567445247089146, 0.15086087352354768, 0.09323402126017889, -0.05782960094166575, 0.1792598774380706, -0.12230415329664808, 0.21274806977146202, 0.03783831057759623] |
1,802.04467 | An Optimized Architecture for Unpaired Image-to-Image Translation | Unpaired Image-to-Image translation aims to convert the image from one domain
(input domain A) to another domain (target domain B), without providing paired
examples for the training. The state-of-the-art, Cycle-GAN demonstrated the
power of Generative Adversarial Networks with Cycle-Consistency Loss. While its
results are promising, there is scope for optimization in the training process.
This paper introduces a new neural network architecture, which only learns the
translation from domain A to B and eliminates the need for reverse mapping (B
to A), by introducing a new Deviation-loss term. Furthermore, few other
improvements to the Cycle-GAN are found and utilized in this new architecture,
contributing to significantly lesser training duration.
| cs.CV | unpaired imagetoimage translation aims to convert the image from one domain input domain a to another domain target domain b without providing paired examples for the training the stateoftheart cyclegan demonstrated the power of generative adversarial networks with cycleconsistency loss while its results are promising there is scope for optimization in the training process this paper introduces a new neural network architecture which only learns the translation from domain a to b and eliminates the need for reverse mapping b to a by introducing a new deviationloss term furthermore few other improvements to the cyclegan are found and utilized in this new architecture contributing to significantly lesser training duration | [['unpaired', 'imagetoimage', 'translation', 'aims', 'to', 'convert', 'the', 'image', 'from', 'one', 'domain', 'input', 'domain', 'a', 'to', 'another', 'domain', 'target', 'domain', 'b', 'without', 'providing', 'paired', 'examples', 'for', 'the', 'training', 'the', 'stateoftheart', 'cyclegan', 'demonstrated', 'the', 'power', 'of', 'generative', 'adversarial', 'networks', 'with', 'cycleconsistency', 'loss', 'while', 'its', 'results', 'are', 'promising', 'there', 'is', 'scope', 'for', 'optimization', 'in', 'the', 'training', 'process', 'this', 'paper', 'introduces', 'a', 'new', 'neural', 'network', 'architecture', 'which', 'only', 'learns', 'the', 'translation', 'from', 'domain', 'a', 'to', 'b', 'and', 'eliminates', 'the', 'need', 'for', 'reverse', 'mapping', 'b', 'to', 'a', 'by', 'introducing', 'a', 'new', 'deviationloss', 'term', 'furthermore', 'few', 'other', 'improvements', 'to', 'the', 'cyclegan', 'are', 'found', 'and', 'utilized', 'in', 'this', 'new', 'architecture', 'contributing', 'to', 'significantly', 'lesser', 'training', 'duration']] | [-0.036917395956590084, 0.022863708182100068, -0.012494163704104722, 0.057043741464793934, -0.16111139568534713, -0.1967751021384848, 0.07491393502978436, 0.4367318919480399, -0.3275226792751777, -0.32610346376895905, 0.036044934822712094, -0.24436986702494323, -0.1532679783003577, 0.18042698941900637, -0.15463873048106003, 0.08646347039083829, 0.11321461432251251, 0.016137508000678348, -0.07662346794407952, -0.25584176610680986, 0.32299890472441567, 0.006809664372768667, 0.3301312215906499, 0.017053757798513054, 0.1267264474838696, -0.05814396560243848, -0.006536646767657388, -0.05453901641670166, -0.019297464034968504, 0.20758053567476087, 0.24977656035615062, 0.20040527124095847, 0.33749306320505973, -0.4126351646199409, -0.26164143630820846, 0.09456084503499032, 0.1379534768509782, 0.13654610002521184, -0.08247294034313031, -0.3330706249905267, 0.11593685824751716, -0.1699319677599878, 0.03887260444376066, -0.13078638846140908, -0.01678899132767347, -0.03438258639383734, -0.330475031984625, 0.007865978857605822, 0.13886246362839033, 0.02745144373599302, -0.035917280527495744, -0.11104829712012024, 0.012848055727469424, 0.15580540098232665, 0.037670043973776046, 0.1761820747310089, 0.08202206324009846, -0.18843667687313562, -0.11438836381960384, 0.354588489289637, -0.05067616261334883, -0.24062405088679278, 0.2014931406754638, -0.048344252678496694, -0.09963267184664598, 0.10890979985534041, 0.21517081561291385, 0.07922582390407722, -0.20124481745598907, 0.019111221475651727, 0.022441412939871144, 0.19282535780911092, 0.06024068273189995, -0.025715817779268103, 0.15460492451287186, 0.24409132219713042, 0.0656023106313552, 0.21752350302078952, -0.14215279693922234, -0.04589194283148067, -0.26830083247343145, -0.10681584527440093, -0.2011504667526525, -0.016492820585241402, -0.0391630366467763, -0.11465080931817216, 0.4387917885970738, 0.18229805481301067, 0.22390343759993644, 0.09539100367476715, 0.3307224317729749, 0.02148516672766871, 0.17448547297465633, 0.07933266901117922, 0.17256703073400315, 0.005910286080540606, 0.1636881147774316, -0.16539890021171974, 0.06710764458316758, 0.027945800770626025] |
1,802.04468 | On a Java library to perform S-expansions of Lie algebras | The S-expansion method is a generalization of the In\"{o}n\"{u}-Wigner (IW)
contraction that allows to study new non-trivial relations between different
Lie algebras. Basically, this method combines a Lie algebra $\mathcal{G}$ with
a finite abelian semigroup $S$ in such a way that a new S-expanded algebra
$\mathcal{G}_{S}$ can be defined. When the semigroup has a zero-element and/or
a specific decomposition, which is said to be resonant with the subspace
structure of the original algebra, then it is possible to extract smaller
algebras from $\mathcal{G}_{S}$ which have interesting properties. Here we give
a brief description of the S-expansion, its applications and the main
motivations that lead us to elaborate a Java library, which automatizes this
method and allows us to represent and to classify all possible S-expansions of
a given Lie algebra.
| math-ph hep-th math.MP | the sexpansion method is a generalization of the inonuwigner iw contraction that allows to study new nontrivial relations between different lie algebras basically this method combines a lie algebra mathcalg with a finite abelian semigroup s in such a way that a new sexpanded algebra mathcalg_s can be defined when the semigroup has a zeroelement andor a specific decomposition which is said to be resonant with the subspace structure of the original algebra then it is possible to extract smaller algebras from mathcalg_s which have interesting properties here we give a brief description of the sexpansion its applications and the main motivations that lead us to elaborate a java library which automatizes this method and allows us to represent and to classify all possible sexpansions of a given lie algebra | [['the', 'sexpansion', 'method', 'is', 'a', 'generalization', 'of', 'the', 'inonuwigner', 'iw', 'contraction', 'that', 'allows', 'to', 'study', 'new', 'nontrivial', 'relations', 'between', 'different', 'lie', 'algebras', 'basically', 'this', 'method', 'combines', 'a', 'lie', 'algebra', 'mathcalg', 'with', 'a', 'finite', 'abelian', 'semigroup', 's', 'in', 'such', 'a', 'way', 'that', 'a', 'new', 'sexpanded', 'algebra', 'mathcalg_s', 'can', 'be', 'defined', 'when', 'the', 'semigroup', 'has', 'a', 'zeroelement', 'andor', 'a', 'specific', 'decomposition', 'which', 'is', 'said', 'to', 'be', 'resonant', 'with', 'the', 'subspace', 'structure', 'of', 'the', 'original', 'algebra', 'then', 'it', 'is', 'possible', 'to', 'extract', 'smaller', 'algebras', 'from', 'mathcalg_s', 'which', 'have', 'interesting', 'properties', 'here', 'we', 'give', 'a', 'brief', 'description', 'of', 'the', 'sexpansion', 'its', 'applications', 'and', 'the', 'main', 'motivations', 'that', 'lead', 'us', 'to', 'elaborate', 'a', 'java', 'library', 'which', 'automatizes', 'this', 'method', 'and', 'allows', 'us', 'to', 'represent', 'and', 'to', 'classify', 'all', 'possible', 'sexpansions', 'of', 'a', 'given', 'lie', 'algebra']] | [-0.08764261020920598, 0.06141777589487342, -0.15343539984180377, 0.05500812205002428, -0.2076011994531235, -0.1572929537532708, 0.00798682171600656, 0.34321047455932086, -0.348118172876107, -0.23576034537444895, 0.11487215507256154, -0.20847256874616366, -0.16159818130629272, 0.20154275686677114, -0.09806805373026202, -0.04748483450698236, 0.05638527034853513, 0.09032298035812206, -0.11427334003025093, -0.19912658389478635, 0.3504613516350778, 0.023438674967306165, 0.23139387463541844, 0.028115367076288048, 0.12789593724748835, -0.01953718325194831, -0.022197835170663892, 0.016089142271532464, -0.13604577049661132, 0.14599004392512144, 0.2757808072671581, 0.134486161541337, 0.23985977348190948, -0.34779744295833204, -0.12551469708560034, 0.1401333060187216, 0.13900979852590423, 0.09634318530219249, -0.033271559725443905, -0.25920600230590657, 0.10926645949053077, -0.2423205589875579, -0.11378135141701652, -0.1139608524668102, 0.06771215403882357, -0.038023428548163235, -0.27376014503981705, -0.007311691293636194, 0.08511642867144054, 0.03450914696631326, -0.04166724266161999, -0.06445516403048085, -0.05028470059713492, 0.09539900074215928, -0.04606281873376037, 0.0640453421851047, 0.09880003568071585, -0.02535808489550478, -0.14674165196752606, 0.37644132632636823, 0.0015160026995895, -0.19723945634009746, 0.18157137537536283, -0.13840556388783556, -0.16918934121226462, 0.10053191934712231, 0.11247030595729414, 0.1188860792783089, -0.14576972266580784, 0.14517248984506856, -0.1005797007945008, 0.08010078312542576, 0.0397035192979484, 0.014632226902848253, 0.16029319308536988, 0.15301579918954164, 0.05176439282054512, 0.1543287066133836, 0.03099404344550119, -0.023548833292443304, -0.34522412290366794, -0.1812115985685243, -0.10396704887344431, 0.10214319564760305, -0.09416485880826188, -0.1902454387324934, 0.43275422032635946, 0.179108069366171, 0.1974810238927603, 0.043518304583043434, 0.22919997913906207, 0.11065532339092057, 0.1569141210177734, 0.059285602464268984, 0.12628800661231462, 0.21875210801999156, 0.008072090245640049, -0.16443946370049023, -0.019287365309607524, 0.14512817275065643] |
1,802.04469 | Polarization observables and T-noninvariance in the weak charged current
induced electron proton scattering | In this work, we have studied the total scattering cross section ($\sigma$),
differential scattering cross section ($d\sigma/dQ^2$) as well as the
longitudinal ($P_L(E_e,Q^2)$), perpendicular ($P_P(E_e,Q^2)$), and transverse
($P_T(E_e,Q^2)$) components of the polarization of the final hadron ($n$, $
\Lambda$ and $\Sigma^0$) produced in the electron proton scattering induced by
the weak charged current. We have not assumed T-invariance which allows the
transverse component of the hadron polarization perpendicular to the production
plane to be non-zero. The numerical results are presented for all the above
observables and their dependence on the axial vector form factor and the weak
electric form factor are discussed. The present study enables the determination
of the axial vector nucleon-hyperon transition form factors at high $ Q^2$ in
the strangeness sector which can provide test of the symmetries of the weak
hadronic currents like T-invariance and SU(3) symmetry while assuming the
hypothesis of conserved vector current and partial conservation of axial vector
current.
| hep-ph | in this work we have studied the total scattering cross section sigma differential scattering cross section dsigmadq2 as well as the longitudinal p_le_eq2 perpendicular p_pe_eq2 and transverse p_te_eq2 components of the polarization of the final hadron n lambda and sigma0 produced in the electron proton scattering induced by the weak charged current we have not assumed tinvariance which allows the transverse component of the hadron polarization perpendicular to the production plane to be nonzero the numerical results are presented for all the above observables and their dependence on the axial vector form factor and the weak electric form factor are discussed the present study enables the determination of the axial vector nucleonhyperon transition form factors at high q2 in the strangeness sector which can provide test of the symmetries of the weak hadronic currents like tinvariance and su3 symmetry while assuming the hypothesis of conserved vector current and partial conservation of axial vector current | [['in', 'this', 'work', 'we', 'have', 'studied', 'the', 'total', 'scattering', 'cross', 'section', 'sigma', 'differential', 'scattering', 'cross', 'section', 'dsigmadq2', 'as', 'well', 'as', 'the', 'longitudinal', 'p_le_eq2', 'perpendicular', 'p_pe_eq2', 'and', 'transverse', 'p_te_eq2', 'components', 'of', 'the', 'polarization', 'of', 'the', 'final', 'hadron', 'n', 'lambda', 'and', 'sigma0', 'produced', 'in', 'the', 'electron', 'proton', 'scattering', 'induced', 'by', 'the', 'weak', 'charged', 'current', 'we', 'have', 'not', 'assumed', 'tinvariance', 'which', 'allows', 'the', 'transverse', 'component', 'of', 'the', 'hadron', 'polarization', 'perpendicular', 'to', 'the', 'production', 'plane', 'to', 'be', 'nonzero', 'the', 'numerical', 'results', 'are', 'presented', 'for', 'all', 'the', 'above', 'observables', 'and', 'their', 'dependence', 'on', 'the', 'axial', 'vector', 'form', 'factor', 'and', 'the', 'weak', 'electric', 'form', 'factor', 'are', 'discussed', 'the', 'present', 'study', 'enables', 'the', 'determination', 'of', 'the', 'axial', 'vector', 'nucleonhyperon', 'transition', 'form', 'factors', 'at', 'high', 'q2', 'in', 'the', 'strangeness', 'sector', 'which', 'can', 'provide', 'test', 'of', 'the', 'symmetries', 'of', 'the', 'weak', 'hadronic', 'currents', 'like', 'tinvariance', 'and', 'su3', 'symmetry', 'while', 'assuming', 'the', 'hypothesis', 'of', 'conserved', 'vector', 'current', 'and', 'partial', 'conservation', 'of', 'axial', 'vector', 'current']] | [-0.14658300604190158, 0.21445857758929843, -0.015653836587135563, 0.06842208185174582, -0.053250152741046934, -0.06628642831767126, -0.02863863282929489, 0.3349670260059123, -0.22237690478649658, -0.25486507264909564, 0.010957458572283339, -0.2925756534898618, -0.009354289264930104, 0.11483980875634989, 0.13215992536198423, 0.08550587838935043, 0.007334799325365006, 0.056384964187865434, -0.05945444182609979, -0.18812972207905243, 0.35281515740696956, 0.02998057435211164, 0.30365258774146536, 0.15173448308290827, 0.09941142139993361, 0.07405022693649921, -0.048884418488877965, 0.008784606352769184, -0.11007728962156774, 0.07923110645759344, 0.19808782433276836, 0.04285919360834982, 0.08495468425484287, -0.40808030710068366, -0.11555129098736786, 0.09842288953757888, 0.13684119715737733, 0.11487002916393542, -0.01964176465704766, -0.2679442800951517, 0.09108203267740296, -0.1746912325689236, -0.1780661200998129, -0.10632898068573597, 0.020450709622032597, 0.02773851008479798, -0.2868005993085241, 0.12668927865324925, 0.050838809237978885, 0.04151597286309332, -0.06417925543474058, -0.20043098639129409, -0.08023332280341215, 0.04998079958118942, 0.14461251493197996, 0.08605957434771719, 0.17777139340783316, -0.18280049127107179, -0.11234015391041703, 0.3771607441001183, -0.08422607093408013, -0.2327868618404135, 0.09321597602761147, -0.22842946796314112, -0.10784665091481331, 0.14278100422639028, 0.21415754520513167, 0.07788191818777127, -0.15683122325861296, 0.10394018857712112, -0.03694782178889072, 0.11262179815074713, 0.07905022464291692, 0.02814148254970101, 0.20693351863729242, 0.11904458942767603, 0.004351325106021828, 0.06627330240802777, -0.12244155931298849, -0.0580054996473505, -0.3890431267055159, -0.1377561162966026, -0.07077478356073481, 0.08816213046583356, -0.05859035307993274, -0.12102521587909501, 0.36330425729574206, 0.07439077464744737, 0.24969438724959922, -0.022757679370497136, 0.3224937353338676, 0.15607864886910858, 0.0846026694149223, 0.052300673345140866, 0.31111760287613466, 0.23230310818889727, 0.13386646104785335, -0.2624295580783699, 0.051203206776709156, 0.018970064808065627] |
1,802.0447 | Spin Transport and Spin Pump in Graphene-like Materials: Effect of tilt
in Dirac cones | We study the spin transport phenomena in two-dimensional graphene-like
materials with arbitrary tilted Dirac cones. The tilt arises due to
next-nearest hopping when the bottom of the conduction band and top of the
valence band does not simultaneously coincide at Dirac point. We consider
normal-ferromagnetic-normal (N-F-N) junction of the materials and using the
generalized scattering approach calculate the spin current. Here, we show that
tilting the Dirac cones can strongly change the transport properties by
modifying the period of oscillation of the spin current. The spin conductance
can be effectively tuned by the tilt with taking advantage of the modified
interference condition. A pure spin current reversal also possible with a
smooth variation of the tilting. We further study the spin current by the
adiabatic precession of a doped ferromagnet on top of the material. It is shown
that the spin-mixing conductance and hence the spin current can become zero by
turning the tilt of the Dirac cone. Our findings provide an efficient way
towards high controllability of spin transport by tuning the tilt of the
ferromagnetic junction and can be very useful in the field of spintronics. The
model also presents a simplified way to measure the tilt of Dirac cone of those
materials.
| cond-mat.str-el cond-mat.mes-hall | we study the spin transport phenomena in twodimensional graphenelike materials with arbitrary tilted dirac cones the tilt arises due to nextnearest hopping when the bottom of the conduction band and top of the valence band does not simultaneously coincide at dirac point we consider normalferromagneticnormal nfn junction of the materials and using the generalized scattering approach calculate the spin current here we show that tilting the dirac cones can strongly change the transport properties by modifying the period of oscillation of the spin current the spin conductance can be effectively tuned by the tilt with taking advantage of the modified interference condition a pure spin current reversal also possible with a smooth variation of the tilting we further study the spin current by the adiabatic precession of a doped ferromagnet on top of the material it is shown that the spinmixing conductance and hence the spin current can become zero by turning the tilt of the dirac cone our findings provide an efficient way towards high controllability of spin transport by tuning the tilt of the ferromagnetic junction and can be very useful in the field of spintronics the model also presents a simplified way to measure the tilt of dirac cone of those materials | [['we', 'study', 'the', 'spin', 'transport', 'phenomena', 'in', 'twodimensional', 'graphenelike', 'materials', 'with', 'arbitrary', 'tilted', 'dirac', 'cones', 'the', 'tilt', 'arises', 'due', 'to', 'nextnearest', 'hopping', 'when', 'the', 'bottom', 'of', 'the', 'conduction', 'band', 'and', 'top', 'of', 'the', 'valence', 'band', 'does', 'not', 'simultaneously', 'coincide', 'at', 'dirac', 'point', 'we', 'consider', 'normalferromagneticnormal', 'nfn', 'junction', 'of', 'the', 'materials', 'and', 'using', 'the', 'generalized', 'scattering', 'approach', 'calculate', 'the', 'spin', 'current', 'here', 'we', 'show', 'that', 'tilting', 'the', 'dirac', 'cones', 'can', 'strongly', 'change', 'the', 'transport', 'properties', 'by', 'modifying', 'the', 'period', 'of', 'oscillation', 'of', 'the', 'spin', 'current', 'the', 'spin', 'conductance', 'can', 'be', 'effectively', 'tuned', 'by', 'the', 'tilt', 'with', 'taking', 'advantage', 'of', 'the', 'modified', 'interference', 'condition', 'a', 'pure', 'spin', 'current', 'reversal', 'also', 'possible', 'with', 'a', 'smooth', 'variation', 'of', 'the', 'tilting', 'we', 'further', 'study', 'the', 'spin', 'current', 'by', 'the', 'adiabatic', 'precession', 'of', 'a', 'doped', 'ferromagnet', 'on', 'top', 'of', 'the', 'material', 'it', 'is', 'shown', 'that', 'the', 'spinmixing', 'conductance', 'and', 'hence', 'the', 'spin', 'current', 'can', 'become', 'zero', 'by', 'turning', 'the', 'tilt', 'of', 'the', 'dirac', 'cone', 'our', 'findings', 'provide', 'an', 'efficient', 'way', 'towards', 'high', 'controllability', 'of', 'spin', 'transport', 'by', 'tuning', 'the', 'tilt', 'of', 'the', 'ferromagnetic', 'junction', 'and', 'can', 'be', 'very', 'useful', 'in', 'the', 'field', 'of', 'spintronics', 'the', 'model', 'also', 'presents', 'a', 'simplified', 'way', 'to', 'measure', 'the', 'tilt', 'of', 'dirac', 'cone', 'of', 'those', 'materials']] | [-0.19264043092489153, 0.20421065239458652, -0.043492739869099926, 0.008470943381033111, -0.07373457411985572, -0.14631749889472637, 0.05705967622513815, 0.37102808046449975, -0.32765884990008864, -0.283996937978195, 0.017481290852287557, -0.257776760350822, -0.14765465997341204, 0.17936352866974364, 0.01891331733349056, -0.005050750288022001, 0.011977443103564949, -0.04246582410329521, -0.12463561178372445, -0.187996811846203, 0.3224814469346822, 0.026354429426762027, 0.3007845470749932, 0.09570564564044882, 0.03101462410399463, 0.049442661846647175, 0.09676982478235803, 0.0486712330861426, -0.11686250511088363, 0.07913143932365063, 0.19069473117748956, -0.08959485238826856, 0.16319220986489844, -0.4430415055101238, -0.18290340731874472, 0.015151396375603792, 0.1319059077695739, 0.1497612637036094, -0.06494872951936885, -0.2830572188127695, 0.05337160074878938, -0.14732606321255245, -0.1668491877774458, -0.07448769303992754, -0.03976301345690267, -0.01743764255122032, -0.2242915747289705, 0.07343345139283551, 0.08076005768820235, 0.02275079200896094, -0.051884516160480856, -0.12483605730358693, -0.13928229286585275, 0.07577335559379696, 0.05391375347063309, 0.020773471545047557, 0.1519837486375941, -0.1335922356675061, -0.1509602605331144, 0.38118345032832246, -0.08551395903341472, -0.18690652368170005, 0.1326277315940299, -0.21204952481997813, -0.023275122373569303, 0.11603756825235195, 0.11026256828818742, 0.10654303041718355, -0.13054336360691218, 0.10384569113120073, -0.02700948036025937, 0.08486007658790275, 0.03030046486727348, 0.032004918476066936, 0.3188255278734354, 0.1801835301820552, 0.11343799176478259, 0.1219812078605883, -0.16279078499504887, -0.04816715208637505, -0.2528418978449048, -0.18707895028382177, -0.21503766644632488, 0.10010303894360266, -0.0747745696724983, -0.17797104436946784, 0.4840485818434234, 0.16848518338690444, 0.18201023452892537, -0.01334381359515757, 0.25905990535166207, 0.15816360393868442, 0.07887808845254944, 0.028276562824754454, 0.2822814203844201, 0.16912558075017864, 0.10964874954803325, -0.3187062120258172, 0.059577994793653485, -0.006140105007784214] |
1,802.04471 | Efficient conversion of anti-phase spin order of protons into 15N
magnetization using SLIC-SABRE | SABRE (Signal Amplification By Reversible Exchange) is a technique for
enhancement of NMR (Nuclear Magnetic Resonance) signals, which utilizes
parahydrogen (pH2, the H2 molecule in its nuclear spin state) as a source of
non-thermal spin order. In SABRE experiments, pH2 binds to an organometallic
complex with a to-be-polarized substrate; subsequently, spin order transfer
takes place and the substrate acquires non-thermal spin polarization resulting
in strong NMR signal enhancement. In this work we argue that the spin order of
H2 in SABRE experiments performed at high magnetic fields is not necessarily
the singlet order but rather anti-phase polarization, $S_{1z}S_{2z}$. Although
SABRE exploits pH2, i.e., the starting spin order of H2 is supposed to be the
singlet order, in solution S-T0 conversion becomes efficient once pH2 binds to
a complex. Such a variation of the spin order, which becomes $S_{1z}S_{2z}$,
has an important consequence: NMR methods used for transferring SABRE
polarization need to be modified. Here we demonstrate that methods proposed for
the initial singlet order may not work for the S_1z S_2z order; however, a
simple modification makes them efficient again. A theoretical treatment of the
problem under consideration is proposed; these considerations are supported by
high-field SABRE experiments. Hence, for efficient use of SABRE one should note
that polarization formation is a complex multi-stage process: careful
optimization of this process may not only deal with chemical aspects but also
with the spin dynamics, including the spin dynamics of H2.
| physics.chem-ph | sabre signal amplification by reversible exchange is a technique for enhancement of nmr nuclear magnetic resonance signals which utilizes parahydrogen ph2 the h2 molecule in its nuclear spin state as a source of nonthermal spin order in sabre experiments ph2 binds to an organometallic complex with a tobepolarized substrate subsequently spin order transfer takes place and the substrate acquires nonthermal spin polarization resulting in strong nmr signal enhancement in this work we argue that the spin order of h2 in sabre experiments performed at high magnetic fields is not necessarily the singlet order but rather antiphase polarization s_1zs_2z although sabre exploits ph2 ie the starting spin order of h2 is supposed to be the singlet order in solution st0 conversion becomes efficient once ph2 binds to a complex such a variation of the spin order which becomes s_1zs_2z has an important consequence nmr methods used for transferring sabre polarization need to be modified here we demonstrate that methods proposed for the initial singlet order may not work for the s_1z s_2z order however a simple modification makes them efficient again a theoretical treatment of the problem under consideration is proposed these considerations are supported by highfield sabre experiments hence for efficient use of sabre one should note that polarization formation is a complex multistage process careful optimization of this process may not only deal with chemical aspects but also with the spin dynamics including the spin dynamics of h2 | [['sabre', 'signal', 'amplification', 'by', 'reversible', 'exchange', 'is', 'a', 'technique', 'for', 'enhancement', 'of', 'nmr', 'nuclear', 'magnetic', 'resonance', 'signals', 'which', 'utilizes', 'parahydrogen', 'ph2', 'the', 'h2', 'molecule', 'in', 'its', 'nuclear', 'spin', 'state', 'as', 'a', 'source', 'of', 'nonthermal', 'spin', 'order', 'in', 'sabre', 'experiments', 'ph2', 'binds', 'to', 'an', 'organometallic', 'complex', 'with', 'a', 'tobepolarized', 'substrate', 'subsequently', 'spin', 'order', 'transfer', 'takes', 'place', 'and', 'the', 'substrate', 'acquires', 'nonthermal', 'spin', 'polarization', 'resulting', 'in', 'strong', 'nmr', 'signal', 'enhancement', 'in', 'this', 'work', 'we', 'argue', 'that', 'the', 'spin', 'order', 'of', 'h2', 'in', 'sabre', 'experiments', 'performed', 'at', 'high', 'magnetic', 'fields', 'is', 'not', 'necessarily', 'the', 'singlet', 'order', 'but', 'rather', 'antiphase', 'polarization', 's_1zs_2z', 'although', 'sabre', 'exploits', 'ph2', 'ie', 'the', 'starting', 'spin', 'order', 'of', 'h2', 'is', 'supposed', 'to', 'be', 'the', 'singlet', 'order', 'in', 'solution', 'st0', 'conversion', 'becomes', 'efficient', 'once', 'ph2', 'binds', 'to', 'a', 'complex', 'such', 'a', 'variation', 'of', 'the', 'spin', 'order', 'which', 'becomes', 's_1zs_2z', 'has', 'an', 'important', 'consequence', 'nmr', 'methods', 'used', 'for', 'transferring', 'sabre', 'polarization', 'need', 'to', 'be', 'modified', 'here', 'we', 'demonstrate', 'that', 'methods', 'proposed', 'for', 'the', 'initial', 'singlet', 'order', 'may', 'not', 'work', 'for', 'the', 's_1z', 's_2z', 'order', 'however', 'a', 'simple', 'modification', 'makes', 'them', 'efficient', 'again', 'a', 'theoretical', 'treatment', 'of', 'the', 'problem', 'under', 'consideration', 'is', 'proposed', 'these', 'considerations', 'are', 'supported', 'by', 'highfield', 'sabre', 'experiments', 'hence', 'for', 'efficient', 'use', 'of', 'sabre', 'one', 'should', 'note', 'that', 'polarization', 'formation', 'is', 'a', 'complex', 'multistage', 'process', 'careful', 'optimization', 'of', 'this', 'process', 'may', 'not', 'only', 'deal', 'with', 'chemical', 'aspects', 'but', 'also', 'with', 'the', 'spin', 'dynamics', 'including', 'the', 'spin', 'dynamics', 'of', 'h2']] | [-0.11126091825219377, 0.16763616817072527, -0.06080873907441115, 0.04297276395696457, -0.08563312429192839, -0.11982465937725757, 0.01693401531063778, 0.4014991940220155, -0.24186346659997193, -0.28437680987862207, 0.07817788208367192, -0.25830110665536543, -0.1135168995104446, 0.18275856831647708, 0.04784527697089381, 0.005300202982853388, 0.01925235378883495, 0.023140085616417356, -0.047682409903815934, -0.203444991082691, 0.2600953329790589, 0.07858265893557503, 0.2661521435563326, 0.09474791758136342, 0.09760077579057444, -0.002647607090046345, 0.04362035830607796, -0.03389237504018376, -0.08402870120960994, 0.09604659916436442, 0.27882682456698077, 0.05038487258509307, 0.20297597509698342, -0.4603355829801284, -0.21104477099720112, 0.09842414459138635, 0.125027645114904, 0.18224597114465846, -0.10041824065318274, -0.23856561726858935, 0.04243184683718166, -0.16226101183072048, -0.10929889789924531, -0.13168077335211495, -0.023807149852026192, -0.04663438720764766, -0.3127655967822401, 0.08966458104864075, 0.09623575116995074, 0.020889787768976667, -0.060123713014714454, -0.09601203068475223, -0.025568825334815654, 0.04947584529133056, 0.016823818527065392, 0.06861298934505242, 0.181266361527871, -0.09607328625861555, -0.12730432158115051, 0.37027920686079474, -0.07286588297377466, -0.154613213825742, 0.17742478561348882, -0.15217091857802945, -0.13762502824311476, 0.17585160035908348, 0.12628265422023044, 0.1272887925812738, -0.140524068740749, 0.04345274445481433, 0.030686851979333955, 0.2296778461935346, 0.027937072588691204, 0.030967673999099533, 0.2244687912585135, 0.20082291366011537, 0.0820060382464948, 0.1304014262682127, -0.12456982425264561, -0.11781848229909853, -0.2421181689860532, -0.17578704005772725, -0.17874633752882985, 0.0634403555207936, -0.012100868737973742, -0.11126536854653288, 0.3767497783617543, 0.12988623582473877, 0.1545341993154641, -0.0644577427765244, 0.31955476035092667, 0.09850631897402848, 0.07644342722877331, 0.005425753172534376, 0.23287296000082772, 0.15969396730287047, 0.11118466609307581, -0.2859313832970841, 0.1136892193383774, -0.017941451627540135] |
1,802.04472 | Community Detection through Likelihood Optimization: In Search of a
Sound Model | Community detection is one of the most important problems in network
analysis. Among many algorithms proposed for this task, methods based on
statistical inference are of particular interest: they are mathematically sound
and were shown to provide partitions of good quality. Statistical inference
methods are based on fitting some random graph model (a.k.a. null model) to the
observed network by maximizing the likelihood. The choice of this model is
extremely important and is the main focus of the current study. We provide an
extensive theoretical and empirical analysis to compare several models: the
widely used planted partition model, recently proposed degree-corrected
modification of this model, and a new null model having some desirable
statistical properties. We also develop and compare two likelihood optimization
algorithms suitable for the models under consideration. An extensive empirical
analysis on a variety of datasets shows, in particular, that the new model is
the best one for describing most of the considered real-world complex networks
according to the likelihood of observed graph structures.
| cs.SI math.ST stat.TH | community detection is one of the most important problems in network analysis among many algorithms proposed for this task methods based on statistical inference are of particular interest they are mathematically sound and were shown to provide partitions of good quality statistical inference methods are based on fitting some random graph model aka null model to the observed network by maximizing the likelihood the choice of this model is extremely important and is the main focus of the current study we provide an extensive theoretical and empirical analysis to compare several models the widely used planted partition model recently proposed degreecorrected modification of this model and a new null model having some desirable statistical properties we also develop and compare two likelihood optimization algorithms suitable for the models under consideration an extensive empirical analysis on a variety of datasets shows in particular that the new model is the best one for describing most of the considered realworld complex networks according to the likelihood of observed graph structures | [['community', 'detection', 'is', 'one', 'of', 'the', 'most', 'important', 'problems', 'in', 'network', 'analysis', 'among', 'many', 'algorithms', 'proposed', 'for', 'this', 'task', 'methods', 'based', 'on', 'statistical', 'inference', 'are', 'of', 'particular', 'interest', 'they', 'are', 'mathematically', 'sound', 'and', 'were', 'shown', 'to', 'provide', 'partitions', 'of', 'good', 'quality', 'statistical', 'inference', 'methods', 'are', 'based', 'on', 'fitting', 'some', 'random', 'graph', 'model', 'aka', 'null', 'model', 'to', 'the', 'observed', 'network', 'by', 'maximizing', 'the', 'likelihood', 'the', 'choice', 'of', 'this', 'model', 'is', 'extremely', 'important', 'and', 'is', 'the', 'main', 'focus', 'of', 'the', 'current', 'study', 'we', 'provide', 'an', 'extensive', 'theoretical', 'and', 'empirical', 'analysis', 'to', 'compare', 'several', 'models', 'the', 'widely', 'used', 'planted', 'partition', 'model', 'recently', 'proposed', 'degreecorrected', 'modification', 'of', 'this', 'model', 'and', 'a', 'new', 'null', 'model', 'having', 'some', 'desirable', 'statistical', 'properties', 'we', 'also', 'develop', 'and', 'compare', 'two', 'likelihood', 'optimization', 'algorithms', 'suitable', 'for', 'the', 'models', 'under', 'consideration', 'an', 'extensive', 'empirical', 'analysis', 'on', 'a', 'variety', 'of', 'datasets', 'shows', 'in', 'particular', 'that', 'the', 'new', 'model', 'is', 'the', 'best', 'one', 'for', 'describing', 'most', 'of', 'the', 'considered', 'realworld', 'complex', 'networks', 'according', 'to', 'the', 'likelihood', 'of', 'observed', 'graph', 'structures']] | [-0.05846819727372066, -0.04242829927978731, -0.09472883888102042, 0.1166195269084318, -0.08371819216969931, -0.15689810684988062, 0.014719136366007213, 0.41302843754386115, -0.21469841055811834, -0.33688393167727543, 0.11922866389194425, -0.25572776742412673, -0.2047416521124765, 0.21968508452807223, -0.057406671601765887, 0.13135249033419716, 0.09805250392033311, 0.0575825804583087, -0.026947860708488095, -0.2575217542607298, 0.29752903967443295, 0.08669338694600734, 0.3513883815375631, 0.014912496609153215, 0.07268402141011404, -0.008921452237482735, -0.05685158955591346, 0.0464509118673469, -0.12152932893121818, 0.177650031169408, 0.23139788074514578, 0.22048331954388203, 0.3003725415196069, -0.40137897231643965, -0.2525433747454764, 0.1438931615167147, 0.12020461248724672, 0.08798811645088453, -0.024980626949443745, -0.26120835745116017, 0.08534097664258973, -0.14049160786385753, -0.03168430499743648, -0.11885297655624276, -0.028181416354794615, 0.036085226900685954, -0.2759828874060583, 0.035251901762296506, 0.046750227703216546, 0.050064426344020495, -0.04203752527141687, -0.17160705504604354, 0.024164027553943996, 0.10975178561178957, 0.08602381407626218, -0.01400455316350221, 0.08826586341451921, -0.1296585788908498, -0.15065597892811378, 0.3919972568014246, -0.022837087417211004, -0.20398438101617652, 0.21843044544308038, -0.055340142630620634, -0.22208562220619646, 0.08047348012991562, 0.21112373174575275, 0.12336852630700715, -0.1924117373101815, 0.04682515432582722, -0.08141069918902992, 0.13856458302007285, -0.018858024485208496, -0.02839536721501667, 0.18703360383923048, 0.24767760662250443, 0.031156999362607535, 0.1540300850868002, -0.09111605201078256, -0.12095378195130807, -0.2620306515698126, -0.10795897281656187, -0.1918437188382478, -0.040185378622514624, -0.14244276773932874, -0.19622350962115256, 0.43380627292626633, 0.2351541760813969, 0.1971409875539851, 0.06857010678382601, 0.3068423598201689, 0.08576872480843595, 0.016127597206010078, 0.07134502764594669, 0.2200265583393309, 0.1319766120021761, 0.03738187418547933, -0.15206185940926348, 0.125600994266235, 0.028062097683638154] |
1,802.04473 | Information Scaling Law of Deep Neural Networks | With the rapid development of Deep Neural Networks (DNNs), various network
models that show strong computing power and impressive expressive power are
proposed. However, there is no comprehensive informational interpretation of
DNNs from the perspective of information theory. Due to the nonlinear function
and the uncertain number of layers and neural units used in the DNNs, the
network structure shows nonlinearity and complexity. With the typical DNNs
named Convolutional Arithmetic Circuits (ConvACs), the complex DNNs can be
converted into mathematical formula. Thus, we can use rigorous mathematical
theory especially the information theory to analyse the complicated DNNs. In
this paper, we propose a novel information scaling law scheme that can
interpret the network's inner organization by information theory. First, we
show the informational interpretation of the activation function. Secondly, we
prove that the information entropy increases when the information is
transmitted through the ConvACs. Finally, we propose the information scaling
law of ConvACs through making a reasonable assumption.
| cs.LG cs.IT math.IT | with the rapid development of deep neural networks dnns various network models that show strong computing power and impressive expressive power are proposed however there is no comprehensive informational interpretation of dnns from the perspective of information theory due to the nonlinear function and the uncertain number of layers and neural units used in the dnns the network structure shows nonlinearity and complexity with the typical dnns named convolutional arithmetic circuits convacs the complex dnns can be converted into mathematical formula thus we can use rigorous mathematical theory especially the information theory to analyse the complicated dnns in this paper we propose a novel information scaling law scheme that can interpret the networks inner organization by information theory first we show the informational interpretation of the activation function secondly we prove that the information entropy increases when the information is transmitted through the convacs finally we propose the information scaling law of convacs through making a reasonable assumption | [['with', 'the', 'rapid', 'development', 'of', 'deep', 'neural', 'networks', 'dnns', 'various', 'network', 'models', 'that', 'show', 'strong', 'computing', 'power', 'and', 'impressive', 'expressive', 'power', 'are', 'proposed', 'however', 'there', 'is', 'no', 'comprehensive', 'informational', 'interpretation', 'of', 'dnns', 'from', 'the', 'perspective', 'of', 'information', 'theory', 'due', 'to', 'the', 'nonlinear', 'function', 'and', 'the', 'uncertain', 'number', 'of', 'layers', 'and', 'neural', 'units', 'used', 'in', 'the', 'dnns', 'the', 'network', 'structure', 'shows', 'nonlinearity', 'and', 'complexity', 'with', 'the', 'typical', 'dnns', 'named', 'convolutional', 'arithmetic', 'circuits', 'convacs', 'the', 'complex', 'dnns', 'can', 'be', 'converted', 'into', 'mathematical', 'formula', 'thus', 'we', 'can', 'use', 'rigorous', 'mathematical', 'theory', 'especially', 'the', 'information', 'theory', 'to', 'analyse', 'the', 'complicated', 'dnns', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'information', 'scaling', 'law', 'scheme', 'that', 'can', 'interpret', 'the', 'networks', 'inner', 'organization', 'by', 'information', 'theory', 'first', 'we', 'show', 'the', 'informational', 'interpretation', 'of', 'the', 'activation', 'function', 'secondly', 'we', 'prove', 'that', 'the', 'information', 'entropy', 'increases', 'when', 'the', 'information', 'is', 'transmitted', 'through', 'the', 'convacs', 'finally', 'we', 'propose', 'the', 'information', 'scaling', 'law', 'of', 'convacs', 'through', 'making', 'a', 'reasonable', 'assumption']] | [-0.11109008972939764, 0.023243717539796156, -0.1024228060394054, 0.10768308567068881, -0.09994637063274137, -0.15667761608227332, 0.044446739133099634, 0.37864305770991347, -0.3244169275512141, -0.314562795082508, 0.07113474366679505, -0.2594689692347016, -0.2856620099525191, 0.1666192907812015, -0.10772978292359629, 0.10408337164929585, 0.061844150391348364, 0.040244375830044664, -0.06293284883457413, -0.2157462390045388, 0.30686156010797505, 0.07020250007143992, 0.34744484793347646, 0.06984566932188972, 0.11736228729633591, -0.029395717390683255, -0.03453782378825583, 0.008141667120854217, -0.09338190947003372, 0.20278599345319775, 0.2741509667546181, 0.20400768098615912, 0.3273103850307179, -0.5019635645837723, -0.2483207682682543, 0.11071475578141929, 0.14591192788756865, 0.1082835532813274, -0.008081323893068806, -0.26142973888406085, 0.09948084642521188, -0.1834050875637515, -0.038165833892579236, -0.14733787277076818, -0.014356455403156106, 0.0049715668907613034, -0.23716970833049367, 0.04203562876003311, 0.08862402544156471, 0.06414343642890218, -0.021786080574605002, -0.06476457614917308, -0.00845130682477869, 0.12067156534622088, 0.014232389774774732, 0.008072688922881373, 0.13481416684410336, -0.1877106985274726, -0.09518607043295721, 0.2996474523568832, -0.03966266213057126, -0.17474505837558757, 0.13134288630902155, -0.06319324873222769, -0.15570711750699992, 0.08201036359407479, 0.19922640505895206, 0.05510918209168992, -0.15663685047156486, 0.038741258395941856, -0.02970771808354066, 0.21480356893926575, 0.023012125631794333, 0.07783657697521598, 0.1847708670752524, 0.21323564797536693, 0.003442063055272344, 0.18164438325720192, -0.07364113825738808, -0.12065524311553498, -0.22963238519298124, -0.12616694992101646, -0.17947241283298906, 0.06384641418080259, -0.13975738514549263, -0.12486381888318854, 0.37406757030911175, 0.18083712331585208, 0.18563319051555724, 0.14783988051894534, 0.3531544426856916, 0.13777352557989145, 0.1171948507846675, 0.11400153822872694, 0.2122936259389301, 0.1259744739398667, 0.1411564744938212, -0.15519406729159713, 0.10743769166896804, 0.032397451984424945] |
1,802.04474 | Deep Neural Networks Learn Non-Smooth Functions Effectively | We theoretically discuss why deep neural networks (DNNs) performs better than
other models in some cases by investigating statistical properties of DNNs for
non-smooth functions. While DNNs have empirically shown higher performance than
other standard methods, understanding its mechanism is still a challenging
problem. From an aspect of the statistical theory, it is known many standard
methods attain the optimal rate of generalization errors for smooth functions
in large sample asymptotics, and thus it has not been straightforward to find
theoretical advantages of DNNs. This paper fills this gap by considering
learning of a certain class of non-smooth functions, which was not covered by
the previous theory. We derive the generalization error of estimators by DNNs
with a ReLU activation, and show that convergence rates of the generalization
by DNNs are almost optimal to estimate the non-smooth functions, while some of
the popular models do not attain the optimal rate. In addition, our theoretical
result provides guidelines for selecting an appropriate number of layers and
edges of DNNs. We provide numerical experiments to support the theoretical
results.
| stat.ML | we theoretically discuss why deep neural networks dnns performs better than other models in some cases by investigating statistical properties of dnns for nonsmooth functions while dnns have empirically shown higher performance than other standard methods understanding its mechanism is still a challenging problem from an aspect of the statistical theory it is known many standard methods attain the optimal rate of generalization errors for smooth functions in large sample asymptotics and thus it has not been straightforward to find theoretical advantages of dnns this paper fills this gap by considering learning of a certain class of nonsmooth functions which was not covered by the previous theory we derive the generalization error of estimators by dnns with a relu activation and show that convergence rates of the generalization by dnns are almost optimal to estimate the nonsmooth functions while some of the popular models do not attain the optimal rate in addition our theoretical result provides guidelines for selecting an appropriate number of layers and edges of dnns we provide numerical experiments to support the theoretical results | [['we', 'theoretically', 'discuss', 'why', 'deep', 'neural', 'networks', 'dnns', 'performs', 'better', 'than', 'other', 'models', 'in', 'some', 'cases', 'by', 'investigating', 'statistical', 'properties', 'of', 'dnns', 'for', 'nonsmooth', 'functions', 'while', 'dnns', 'have', 'empirically', 'shown', 'higher', 'performance', 'than', 'other', 'standard', 'methods', 'understanding', 'its', 'mechanism', 'is', 'still', 'a', 'challenging', 'problem', 'from', 'an', 'aspect', 'of', 'the', 'statistical', 'theory', 'it', 'is', 'known', 'many', 'standard', 'methods', 'attain', 'the', 'optimal', 'rate', 'of', 'generalization', 'errors', 'for', 'smooth', 'functions', 'in', 'large', 'sample', 'asymptotics', 'and', 'thus', 'it', 'has', 'not', 'been', 'straightforward', 'to', 'find', 'theoretical', 'advantages', 'of', 'dnns', 'this', 'paper', 'fills', 'this', 'gap', 'by', 'considering', 'learning', 'of', 'a', 'certain', 'class', 'of', 'nonsmooth', 'functions', 'which', 'was', 'not', 'covered', 'by', 'the', 'previous', 'theory', 'we', 'derive', 'the', 'generalization', 'error', 'of', 'estimators', 'by', 'dnns', 'with', 'a', 'relu', 'activation', 'and', 'show', 'that', 'convergence', 'rates', 'of', 'the', 'generalization', 'by', 'dnns', 'are', 'almost', 'optimal', 'to', 'estimate', 'the', 'nonsmooth', 'functions', 'while', 'some', 'of', 'the', 'popular', 'models', 'do', 'not', 'attain', 'the', 'optimal', 'rate', 'in', 'addition', 'our', 'theoretical', 'result', 'provides', 'guidelines', 'for', 'selecting', 'an', 'appropriate', 'number', 'of', 'layers', 'and', 'edges', 'of', 'dnns', 'we', 'provide', 'numerical', 'experiments', 'to', 'support', 'the', 'theoretical', 'results']] | [-0.05026339091828203, -0.009173491775514664, -0.060235260875295786, 0.12217389336276778, -0.06270891518495177, -0.16483215718677446, 0.06436166271375292, 0.4212898425652651, -0.2562387412753335, -0.3074547575292109, 0.09427898595212185, -0.24928012212191178, -0.22179316316690495, 0.2568971254641853, -0.1250377410633416, 0.1406509892190912, 0.09712061961049918, 0.0021693575905312357, -0.10499986391817089, -0.32021996258931645, 0.2867728343396579, 0.08856145779606833, 0.30514532702417235, 0.060744737338085296, 0.06081423387299739, -0.06860927970406447, 0.00017556242413271618, -0.003107029524307299, -0.11287591275437583, 0.15643120936208832, 0.2833920674953734, 0.15586382606182522, 0.3584788231189642, -0.4142240977444141, -0.2573839975902442, 0.1207323985622859, 0.1576215436939929, 0.09027469671386594, -0.03233991416518466, -0.233022564197338, 0.14167182444789483, -0.14305553356275005, -0.08612772624276704, -0.1533195650373391, -0.025386031388205155, 0.0460256292461023, -0.27285360373651324, 0.06873834668132503, 0.11420428588865378, 0.04331930939331427, -0.046868492281564256, -0.1755788297666037, 0.027926828781942612, 0.10528496404488881, 0.08318645665737784, 0.0374834541952248, 0.09658445812509221, -0.1862400295212865, -0.1253931771958573, 0.3098737859551263, -0.03660547568434507, -0.241500347126591, 0.19128413410004924, -0.08433279296314859, -0.126877735395216, 0.09758341232693549, 0.17682177477679348, 0.1440636114359407, -0.1567475371836227, 0.0561724011276554, -0.05334313508744041, 0.13134396748879062, 0.028680753740245254, 0.04731985889796147, 0.13884697273494623, 0.21411964262041164, 0.08203852695635241, 0.13772005016591904, -0.04321714726573982, -0.10634504184311014, -0.23935443410744606, -0.08536725754370797, -0.1802326340575592, 0.014746236321789286, -0.10815254505172879, -0.15524351506906373, 0.39257679177753335, 0.18165366824895227, 0.2164890904211055, 0.1560875655153219, 0.31362501205613386, 0.10776217813316817, 0.09693653403260445, 0.11180601318729884, 0.28517360276954334, 0.1035295138359175, 0.06968762592207324, -0.14584535324227824, 0.11998839355547423, 0.050523446286149784] |
1,802.04475 | Graph-Based Ascent Algorithms for Function Maximization | We study the problem of finding the maximum of a function defined on the
nodes of a connected graph. The goal is to identify a node where the function
obtains its maximum. We focus on local iterative algorithms, which traverse the
nodes of the graph along a path, and the next iterate is chosen from the
neighbors of the current iterate with probability distribution determined by
the function values at the current iterate and its neighbors. We study two
algorithms corresponding to a Metropolis-Hastings random walk with different
transition kernels: (i) The first algorithm is an exponentially weighted random
walk governed by a parameter $\gamma$. (ii) The second algorithm is defined
with respect to the graph Laplacian and a smoothness parameter $k$. We derive
convergence rates for the two algorithms in terms of total variation distance
and hitting times. We also provide simulations showing the relative convergence
rates of our algorithms in comparison to an unbiased random walk, as a function
of the smoothness of the graph function. Our algorithms may be categorized as a
new class of "descent-based" methods for function maximization on the nodes of
a graph.
| cs.SI cs.NA math.OC stat.ML | we study the problem of finding the maximum of a function defined on the nodes of a connected graph the goal is to identify a node where the function obtains its maximum we focus on local iterative algorithms which traverse the nodes of the graph along a path and the next iterate is chosen from the neighbors of the current iterate with probability distribution determined by the function values at the current iterate and its neighbors we study two algorithms corresponding to a metropolishastings random walk with different transition kernels i the first algorithm is an exponentially weighted random walk governed by a parameter gamma ii the second algorithm is defined with respect to the graph laplacian and a smoothness parameter k we derive convergence rates for the two algorithms in terms of total variation distance and hitting times we also provide simulations showing the relative convergence rates of our algorithms in comparison to an unbiased random walk as a function of the smoothness of the graph function our algorithms may be categorized as a new class of descentbased methods for function maximization on the nodes of a graph | [['we', 'study', 'the', 'problem', 'of', 'finding', 'the', 'maximum', 'of', 'a', 'function', 'defined', 'on', 'the', 'nodes', 'of', 'a', 'connected', 'graph', 'the', 'goal', 'is', 'to', 'identify', 'a', 'node', 'where', 'the', 'function', 'obtains', 'its', 'maximum', 'we', 'focus', 'on', 'local', 'iterative', 'algorithms', 'which', 'traverse', 'the', 'nodes', 'of', 'the', 'graph', 'along', 'a', 'path', 'and', 'the', 'next', 'iterate', 'is', 'chosen', 'from', 'the', 'neighbors', 'of', 'the', 'current', 'iterate', 'with', 'probability', 'distribution', 'determined', 'by', 'the', 'function', 'values', 'at', 'the', 'current', 'iterate', 'and', 'its', 'neighbors', 'we', 'study', 'two', 'algorithms', 'corresponding', 'to', 'a', 'metropolishastings', 'random', 'walk', 'with', 'different', 'transition', 'kernels', 'i', 'the', 'first', 'algorithm', 'is', 'an', 'exponentially', 'weighted', 'random', 'walk', 'governed', 'by', 'a', 'parameter', 'gamma', 'ii', 'the', 'second', 'algorithm', 'is', 'defined', 'with', 'respect', 'to', 'the', 'graph', 'laplacian', 'and', 'a', 'smoothness', 'parameter', 'k', 'we', 'derive', 'convergence', 'rates', 'for', 'the', 'two', 'algorithms', 'in', 'terms', 'of', 'total', 'variation', 'distance', 'and', 'hitting', 'times', 'we', 'also', 'provide', 'simulations', 'showing', 'the', 'relative', 'convergence', 'rates', 'of', 'our', 'algorithms', 'in', 'comparison', 'to', 'an', 'unbiased', 'random', 'walk', 'as', 'a', 'function', 'of', 'the', 'smoothness', 'of', 'the', 'graph', 'function', 'our', 'algorithms', 'may', 'be', 'categorized', 'as', 'a', 'new', 'class', 'of', 'descentbased', 'methods', 'for', 'function', 'maximization', 'on', 'the', 'nodes', 'of', 'a', 'graph']] | [-0.12494687582785018, 0.06010481047338717, -0.07542340474193374, 0.032455308069647464, -0.05848451298242681, -0.10721550613060278, 0.10529642059374109, 0.39813590983530045, -0.3037159109190008, -0.2759436209573381, 0.09713217146477844, -0.2842264100317917, -0.13904861651518674, 0.1436208367714826, -0.04467698427350827, 0.06413964972538423, 0.06809038524244906, 0.10619396703683022, -0.07802379615457049, -0.269344993385458, 0.30516384062529717, 0.03961941357652741, 0.22905088686408898, 0.012880958089476856, 0.13305592625623658, 0.00625880333753894, -0.03281577702404724, 0.04937606350218177, -0.17013995941092688, 0.10153952417045181, 0.1728457801558925, 0.16363565357421678, 0.3262959315623871, -0.3608499473187501, -0.15116573020165402, 0.17620231253439905, 0.13155545808544886, 0.06972644963885642, 0.014535333551638932, -0.2736161967281193, 0.11562334528628973, -0.11791167206194982, -0.08104370242704159, 0.008685960975184879, 0.002552952602623947, 0.10315213671998766, -0.3292751302203489, 0.014743315541492184, 0.03403442735044149, 0.005640085382515161, -0.012503202712636382, -0.12620626356965178, 0.008183558717882507, 0.11915778889131078, 0.03133081920228149, 0.09019384430918508, 0.12186417829432579, -0.12952383181385735, -0.16971467336314539, 0.34453675521675636, -0.06671344116330147, -0.20194991195507264, 0.13242907286252056, -0.10204983381160274, -0.1252190557914594, 0.10711751359135464, 0.1929932479997949, 0.17237802055570736, -0.1236643657043931, 0.07475638409913887, -0.02004142367729434, 0.09300858247039652, 0.009746971264205597, -0.0020739884514893803, 0.11771193660276594, 0.16612627288996779, 0.18775858985329116, 0.1649896176599666, -0.07605178403746948, -0.10342805370905254, -0.29770458845431524, -0.15663629573420004, -0.28024053832309115, 0.016459676429688458, -0.1985192158251444, -0.19768233877168132, 0.4708072502540533, 0.13016963627733902, 0.27337474435587567, 0.1332861433642123, 0.2813219618983567, 0.16534114401373598, 0.017730638434095357, 0.13228837830118007, 0.164648517730976, 0.14046309768128648, 0.03950945480120561, -0.19337576753894117, 0.1239259475041378, 0.12862695377595998] |
1,802.04476 | Vertex connectivity of Deza graphs with parameters of complements to
Seidel graphs | In this paper we find the vertex connectivity of Deza graphs with parameters
of the complements to Seidel graphs. In particular, we present an infinite
family of strictly Deza graphs whose vertex connectivity is equal to $k-1$,
where $k$ is the valency.
| math.CO | in this paper we find the vertex connectivity of deza graphs with parameters of the complements to seidel graphs in particular we present an infinite family of strictly deza graphs whose vertex connectivity is equal to k1 where k is the valency | [['in', 'this', 'paper', 'we', 'find', 'the', 'vertex', 'connectivity', 'of', 'deza', 'graphs', 'with', 'parameters', 'of', 'the', 'complements', 'to', 'seidel', 'graphs', 'in', 'particular', 'we', 'present', 'an', 'infinite', 'family', 'of', 'strictly', 'deza', 'graphs', 'whose', 'vertex', 'connectivity', 'is', 'equal', 'to', 'k1', 'where', 'k', 'is', 'the', 'valency']] | [-0.21772337986511134, 0.1479974447093333, 0.015751132830267862, -0.03224938396929896, -0.11223109774956745, -0.14359958115078153, 0.03194709566776596, 0.39846654431450934, -0.24563743732869625, -0.2896489990165546, 0.051475839905573854, -0.36511140866648584, -0.20255183082606112, 0.03804763018325459, -0.13561774799156756, -0.015146679134063777, 0.05844872489216782, 0.1685413901827165, 0.004167411177019987, -0.2879538889087382, 0.36289912810371744, -0.00302138150713983, 0.12515116515125901, 0.1315632916632153, 0.033474472329197896, 0.025939845690681113, 0.043038942939823584, 0.11126895111408971, -0.24119924496681916, 0.1451276442302125, 0.2856326869555882, 0.12713338370390592, 0.22037883608468942, -0.3516500507525745, -0.16029473083714643, 0.26545056761685937, 0.12003623942534129, 0.027105177885719707, 0.06705267390324957, -0.1730158126336478, 0.14427598911736692, -0.1166842804467749, -0.12006954254493826, 0.035234764063109957, 0.1151790904502074, 0.010766733570822648, -0.26985069767882425, -0.03756289042732013, 0.16776025907269546, 0.07874102531267065, 0.07973874313756824, -0.1774236204191333, -0.025836180729259337, 0.09155229900387071, -0.066865744922931, 0.041667040271152346, -0.023562639796485502, -0.09817568070277394, -0.1961890214699365, 0.3262790218258964, 0.01900979257853968, -0.1540502575226128, 0.10435417439744231, -0.1618437370107997, -0.22114157146729885, 0.10813339906079429, 0.1060002435087448, 0.1876621317739288, -0.13680939928495459, 0.17403213210803056, -0.11004609391758484, 0.09886090608224982, 0.09063311136283335, -0.007181145450366395, 0.030549008887083756, 0.12949279708499534, 0.20782415496761955, 0.24935895514984927, 0.03680254394809405, -0.000702586668055682, -0.2568922951773164, -0.07661900397700568, -0.23644610724988438, 0.08557164970607985, -0.18775655364152044, -0.23264304158233462, 0.4625886461387078, 0.11725621971501303, 0.19833955452555702, 0.159235511329912, 0.19106472913353217, 0.04000351010333924, 0.05113844037987292, 0.21349755519380173, 0.12327953219591152, 0.21714452973433904, -0.03499191006024679, -0.16835973822023897, 0.05427873168983275, 0.1660140239899712] |
1,802.04477 | A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex
Optimization | We analyze stochastic gradient algorithms for optimizing nonconvex, nonsmooth
finite-sum problems. In particular, the objective function is given by the
summation of a differentiable (possibly nonconvex) component, together with a
possibly non-differentiable but convex component. We propose a proximal
stochastic gradient algorithm based on variance reduction, called ProxSVRG+.
Our main contribution lies in the analysis of ProxSVRG+. It recovers several
existing convergence results and improves/generalizes them (in terms of the
number of stochastic gradient oracle calls and proximal oracle calls). In
particular, ProxSVRG+ generalizes the best results given by the SCSG algorithm,
recently proposed by [Lei et al., 2017] for the smooth nonconvex case.
ProxSVRG+ is also more straightforward than SCSG and yields simpler analysis.
Moreover, ProxSVRG+ outperforms the deterministic proximal gradient descent
(ProxGD) for a wide range of minibatch sizes, which partially solves an open
problem proposed in [Reddi et al., 2016b]. Also, ProxSVRG+ uses much less
proximal oracle calls than ProxSVRG [Reddi et al., 2016b]. Moreover, for
nonconvex functions satisfied Polyak-\L{}ojasiewicz condition, we prove that
ProxSVRG+ achieves a global linear convergence rate without restart unlike
ProxSVRG. Thus, it can \emph{automatically} switch to the faster linear
convergence in some regions as long as the objective function satisfies the PL
condition locally in these regions. ProxSVRG+ also improves ProxGD and
ProxSVRG/SAGA, and generalizes the results of SCSG in this case. Finally, we
conduct several experiments and the experimental results are consistent with
the theoretical results.
| math.OC cs.DS cs.LG stat.ML | we analyze stochastic gradient algorithms for optimizing nonconvex nonsmooth finitesum problems in particular the objective function is given by the summation of a differentiable possibly nonconvex component together with a possibly nondifferentiable but convex component we propose a proximal stochastic gradient algorithm based on variance reduction called proxsvrg our main contribution lies in the analysis of proxsvrg it recovers several existing convergence results and improvesgeneralizes them in terms of the number of stochastic gradient oracle calls and proximal oracle calls in particular proxsvrg generalizes the best results given by the scsg algorithm recently proposed by lei et al 2017 for the smooth nonconvex case proxsvrg is also more straightforward than scsg and yields simpler analysis moreover proxsvrg outperforms the deterministic proximal gradient descent proxgd for a wide range of minibatch sizes which partially solves an open problem proposed in reddi et al 2016b also proxsvrg uses much less proximal oracle calls than proxsvrg reddi et al 2016b moreover for nonconvex functions satisfied polyaklojasiewicz condition we prove that proxsvrg achieves a global linear convergence rate without restart unlike proxsvrg thus it can emphautomatically switch to the faster linear convergence in some regions as long as the objective function satisfies the pl condition locally in these regions proxsvrg also improves proxgd and proxsvrgsaga and generalizes the results of scsg in this case finally we conduct several experiments and the experimental results are consistent with the theoretical results | [['we', 'analyze', 'stochastic', 'gradient', 'algorithms', 'for', 'optimizing', 'nonconvex', 'nonsmooth', 'finitesum', 'problems', 'in', 'particular', 'the', 'objective', 'function', 'is', 'given', 'by', 'the', 'summation', 'of', 'a', 'differentiable', 'possibly', 'nonconvex', 'component', 'together', 'with', 'a', 'possibly', 'nondifferentiable', 'but', 'convex', 'component', 'we', 'propose', 'a', 'proximal', 'stochastic', 'gradient', 'algorithm', 'based', 'on', 'variance', 'reduction', 'called', 'proxsvrg', 'our', 'main', 'contribution', 'lies', 'in', 'the', 'analysis', 'of', 'proxsvrg', 'it', 'recovers', 'several', 'existing', 'convergence', 'results', 'and', 'improvesgeneralizes', 'them', 'in', 'terms', 'of', 'the', 'number', 'of', 'stochastic', 'gradient', 'oracle', 'calls', 'and', 'proximal', 'oracle', 'calls', 'in', 'particular', 'proxsvrg', 'generalizes', 'the', 'best', 'results', 'given', 'by', 'the', 'scsg', 'algorithm', 'recently', 'proposed', 'by', 'lei', 'et', 'al', '2017', 'for', 'the', 'smooth', 'nonconvex', 'case', 'proxsvrg', 'is', 'also', 'more', 'straightforward', 'than', 'scsg', 'and', 'yields', 'simpler', 'analysis', 'moreover', 'proxsvrg', 'outperforms', 'the', 'deterministic', 'proximal', 'gradient', 'descent', 'proxgd', 'for', 'a', 'wide', 'range', 'of', 'minibatch', 'sizes', 'which', 'partially', 'solves', 'an', 'open', 'problem', 'proposed', 'in', 'reddi', 'et', 'al', '2016b', 'also', 'proxsvrg', 'uses', 'much', 'less', 'proximal', 'oracle', 'calls', 'than', 'proxsvrg', 'reddi', 'et', 'al', '2016b', 'moreover', 'for', 'nonconvex', 'functions', 'satisfied', 'polyaklojasiewicz', 'condition', 'we', 'prove', 'that', 'proxsvrg', 'achieves', 'a', 'global', 'linear', 'convergence', 'rate', 'without', 'restart', 'unlike', 'proxsvrg', 'thus', 'it', 'can', 'emphautomatically', 'switch', 'to', 'the', 'faster', 'linear', 'convergence', 'in', 'some', 'regions', 'as', 'long', 'as', 'the', 'objective', 'function', 'satisfies', 'the', 'pl', 'condition', 'locally', 'in', 'these', 'regions', 'proxsvrg', 'also', 'improves', 'proxgd', 'and', 'proxsvrgsaga', 'and', 'generalizes', 'the', 'results', 'of', 'scsg', 'in', 'this', 'case', 'finally', 'we', 'conduct', 'several', 'experiments', 'and', 'the', 'experimental', 'results', 'are', 'consistent', 'with', 'the', 'theoretical', 'results']] | [-0.06614160545666338, -0.03390954984851819, -0.06628209305319772, 0.07889002201643408, -0.10497270704692473, -0.17047018826048335, 0.05087148965002321, 0.3961328254314139, -0.27307670597675376, -0.27569481485887715, 0.10035545581081154, -0.24281826318575717, -0.19877673840534915, 0.25694466568732066, -0.16970094603628083, 0.09134664092739316, 0.06522115673060003, -0.06148702461758385, -0.11342885738501893, -0.33363071590074866, 0.23158771437592804, 0.05375164065752988, 0.25036047362600977, 0.025490773839714088, 0.1183726296213496, 0.015301192015328485, 0.0008710236860560659, 0.04886291220647526, -0.0841538017516027, 0.10801610647467896, 0.245310246112311, 0.1884623490618137, 0.3677941325829243, -0.384772449699433, -0.18739284646808696, 0.11776531442554425, 0.14219931438729755, 0.07235856242224817, -0.07224967672936264, -0.23247335432451624, 0.09445972152702187, -0.10465402903905867, -0.05710492455856065, -0.10040702790669773, -0.03516615247455142, 0.07389162340727837, -0.3548912243593646, 0.11441052339518058, 0.12368553880723598, -0.00704523281778877, -0.06478473876663686, -0.18317663848106547, 0.0330460382959522, -0.014623497736275843, 0.05156766191509593, 0.11410742881859694, 0.11934294742734536, -0.05624598308527113, -0.1369253955680229, 0.286393661643176, -0.0783515402236093, -0.20684827113341864, 0.19143986757136072, -0.04410346317024011, -0.1765566602875681, 0.11593041833004226, 0.1634249763087491, 0.20555340893890547, -0.13877645940317407, 0.11052430615325094, -0.09094793985638282, 0.10752000357783602, 0.05858147654014275, -0.020883927425450605, 0.006214520723923393, 0.14621237811794424, 0.21154333497600064, 0.16701913154177853, -0.03528801879539337, -0.15307160182931948, -0.26552925916419, -0.11816879421391564, -0.17697245928701824, -0.0351841162201827, -0.1292506842546256, -0.13121779432277317, 0.3653727822613133, 0.14788284673072075, 0.21209860112032164, 0.16915047654790966, 0.3151964221149683, 0.11001208933277824, 0.03317774559454056, 0.17918539615955364, 0.22626377970104247, 0.1137998067541048, 0.10409857543089183, -0.21884166235002972, 0.11869498115923742, 0.13983024591984955] |
1,802.04478 | A self-consistent hydrostatic mass modelling of pressure supported dwarf
galaxy Leo T | Assuming a hydrostatic equilibrium in an HI cloud, the joint Poisson's
equation is set up and numerically solved to calculate the expected HI
distribution. Unlike previous studies, the cloud is considered to be
non-isothermal, and an {\it iterative} method is employed to iteratively
estimate the intrinsic velocity dispersion profile using the observed
second-moment of the HI data. We apply our {\it iterative} method to a recently
discovered dwarf galaxy Leo T and find that its observed HI distribution does
not comply with the expected one if one assumes no dark matter in it. To model
the mass distribution in Leo T, we solve the Poisson's equation using a large
number of trial dark matter halos and compare the model HI surface density
($\Sigma_{HI}$) profiles to the observed one to identify the best dark matter
halo parameters. For Leo T, we find a pseudo-isothermal halo with core density,
$\rho_0 \sim 0.67$ $\rm M_{\odot} \thinspace pc^{-3}$ and core radius, $r_s
\sim 37$ parsec explains the observation best. The resulting dark matter halo
mass within the central 300 pc, $M_{300}$, found to be $\sim 2.7 \times 10^6$
$\rm M_{\odot}$. We also find that a set of dark matter halos with similar
$M_{300} \sim 3.7 \times 10^6$ $\rm M_{\odot}$ but very different $\rho_0$ and
$r_s$ values, can produce equally good $\Sigma_{HI}$ profile within the
observational uncertainties. This, in turn, indicates a strong degeneracy
between the halo parameters and the best fit values are not unique.
Interestingly, it also implies that the mass of a dark matter halo, rather than
its structure primarily directs the expected HI distribution under hydrostatic
equilibrium.
| astro-ph.GA | assuming a hydrostatic equilibrium in an hi cloud the joint poissons equation is set up and numerically solved to calculate the expected hi distribution unlike previous studies the cloud is considered to be nonisothermal and an it iterative method is employed to iteratively estimate the intrinsic velocity dispersion profile using the observed secondmoment of the hi data we apply our it iterative method to a recently discovered dwarf galaxy leo t and find that its observed hi distribution does not comply with the expected one if one assumes no dark matter in it to model the mass distribution in leo t we solve the poissons equation using a large number of trial dark matter halos and compare the model hi surface density sigma_hi profiles to the observed one to identify the best dark matter halo parameters for leo t we find a pseudoisothermal halo with core density rho_0 sim 067 rm m_odot thinspace pc3 and core radius r_s sim 37 parsec explains the observation best the resulting dark matter halo mass within the central 300 pc m_300 found to be sim 27 times 106 rm m_odot we also find that a set of dark matter halos with similar m_300 sim 37 times 106 rm m_odot but very different rho_0 and r_s values can produce equally good sigma_hi profile within the observational uncertainties this in turn indicates a strong degeneracy between the halo parameters and the best fit values are not unique interestingly it also implies that the mass of a dark matter halo rather than its structure primarily directs the expected hi distribution under hydrostatic equilibrium | [['assuming', 'a', 'hydrostatic', 'equilibrium', 'in', 'an', 'hi', 'cloud', 'the', 'joint', 'poissons', 'equation', 'is', 'set', 'up', 'and', 'numerically', 'solved', 'to', 'calculate', 'the', 'expected', 'hi', 'distribution', 'unlike', 'previous', 'studies', 'the', 'cloud', 'is', 'considered', 'to', 'be', 'nonisothermal', 'and', 'an', 'it', 'iterative', 'method', 'is', 'employed', 'to', 'iteratively', 'estimate', 'the', 'intrinsic', 'velocity', 'dispersion', 'profile', 'using', 'the', 'observed', 'secondmoment', 'of', 'the', 'hi', 'data', 'we', 'apply', 'our', 'it', 'iterative', 'method', 'to', 'a', 'recently', 'discovered', 'dwarf', 'galaxy', 'leo', 't', 'and', 'find', 'that', 'its', 'observed', 'hi', 'distribution', 'does', 'not', 'comply', 'with', 'the', 'expected', 'one', 'if', 'one', 'assumes', 'no', 'dark', 'matter', 'in', 'it', 'to', 'model', 'the', 'mass', 'distribution', 'in', 'leo', 't', 'we', 'solve', 'the', 'poissons', 'equation', 'using', 'a', 'large', 'number', 'of', 'trial', 'dark', 'matter', 'halos', 'and', 'compare', 'the', 'model', 'hi', 'surface', 'density', 'sigma_hi', 'profiles', 'to', 'the', 'observed', 'one', 'to', 'identify', 'the', 'best', 'dark', 'matter', 'halo', 'parameters', 'for', 'leo', 't', 'we', 'find', 'a', 'pseudoisothermal', 'halo', 'with', 'core', 'density', 'rho_0', 'sim', '067', 'rm', 'm_odot', 'thinspace', 'pc3', 'and', 'core', 'radius', 'r_s', 'sim', '37', 'parsec', 'explains', 'the', 'observation', 'best', 'the', 'resulting', 'dark', 'matter', 'halo', 'mass', 'within', 'the', 'central', '300', 'pc', 'm_300', 'found', 'to', 'be', 'sim', '27', 'times', '106', 'rm', 'm_odot', 'we', 'also', 'find', 'that', 'a', 'set', 'of', 'dark', 'matter', 'halos', 'with', 'similar', 'm_300', 'sim', '37', 'times', '106', 'rm', 'm_odot', 'but', 'very', 'different', 'rho_0', 'and', 'r_s', 'values', 'can', 'produce', 'equally', 'good', 'sigma_hi', 'profile', 'within', 'the', 'observational', 'uncertainties', 'this', 'in', 'turn', 'indicates', 'a', 'strong', 'degeneracy', 'between', 'the', 'halo', 'parameters', 'and', 'the', 'best', 'fit', 'values', 'are', 'not', 'unique', 'interestingly', 'it', 'also', 'implies', 'that', 'the', 'mass', 'of', 'a', 'dark', 'matter', 'halo', 'rather', 'than', 'its', 'structure', 'primarily', 'directs', 'the', 'expected', 'hi', 'distribution', 'under', 'hydrostatic', 'equilibrium']] | [-0.08735128441436875, 0.08372205102746637, -0.11136435949124564, 0.1314168463581893, -0.08131097610322129, -0.07609346745661776, 0.0303263375787257, 0.3610520201238026, -0.1783116063124087, -0.4002275221151321, 0.007096750312265975, -0.2781186295625985, 0.004242682048072338, 0.1522983400938031, 0.02383296544614591, 0.0210240158123092, -0.0029979011409782936, -0.010847280887778345, -0.09315203496472056, -0.25241146320249547, 0.26041046793255745, 0.04852255858057283, 0.20170904704675086, -0.010157935686551272, 0.07884121201433507, -0.10762549708842446, -0.010434162053734736, -0.029822020115736956, -0.20966363970022994, -0.011526476586573665, 0.19612543419339604, 0.11173442114254852, 0.20411541305755482, -0.3575586701596254, -0.18668369775904076, 0.1227596242696789, 0.18669833742341208, 0.035926655433805924, -0.06177173970316194, -0.2725198430086213, 0.10692842330790608, -0.2423167272446383, -0.18708027951083236, 0.030636255195210304, 0.05427901810245182, 0.004618080482552094, -0.2611192703604632, 0.19933561556705595, -0.030663380847501576, -0.03043693277102552, -0.09109246537012321, -0.1647552657264978, -0.06305127931037512, -0.020900453299921202, 0.05143681422744254, 0.08872994456853353, 0.24783683824878103, -0.12830187851489572, 0.07268118354162775, 0.43618269697010265, -0.10777420149613881, -0.06948500949472777, 0.171213226398117, -0.18442521248839067, -0.1470057876514537, 0.1286344797791619, 0.10178745558653447, 0.06805061913599589, -0.14096260687342452, 0.05146175241504824, -0.08757978190337062, 0.2743126054809086, 0.0464252379505818, -0.02683653336676333, 0.30323728799637883, 0.10048505438743789, 0.09654778679762792, 0.002145434608087784, -0.18054199461033918, -0.04921274567092944, -0.2287226125205818, -0.09695513547276483, -0.158127338054793, 0.05077731233325181, -0.13433400051467184, -0.09781232487438317, 0.30355908723260955, 0.14278769905633412, 0.28060851419778693, 0.0849287919616992, 0.31068188395995394, 0.11427627860306311, 0.0861681156130455, 0.16267566770294162, 0.2681420995202616, 0.19475480533621617, 0.06115251609397338, -0.24290616243650534, 0.03773922276774183, -0.04191635497447446] |
1,802.04479 | Phased Microphone Array for Sound Source Localization with Deep Learning | To phased microphone array for sound source localization, algorithm with both
high computational efficiency and high precision is a persistent pursuit. In
this paper convolutional neural network (CNN) a kind of deep learning is
preliminarily applied as a new algorithm. At high frequency CNN can reconstruct
the sound localizations with excellent spatial resolution as good as DAMAS,
within a very short time as short as conventional beamforming. This exciting
result means that CNN perfectly finds source distribution directly from
cross-spectral matrix without given propagation function in advance, and thus
CNN deserves to be further explored as a new algorithm.
| eess.AS cs.SD | to phased microphone array for sound source localization algorithm with both high computational efficiency and high precision is a persistent pursuit in this paper convolutional neural network cnn a kind of deep learning is preliminarily applied as a new algorithm at high frequency cnn can reconstruct the sound localizations with excellent spatial resolution as good as damas within a very short time as short as conventional beamforming this exciting result means that cnn perfectly finds source distribution directly from crossspectral matrix without given propagation function in advance and thus cnn deserves to be further explored as a new algorithm | [['to', 'phased', 'microphone', 'array', 'for', 'sound', 'source', 'localization', 'algorithm', 'with', 'both', 'high', 'computational', 'efficiency', 'and', 'high', 'precision', 'is', 'a', 'persistent', 'pursuit', 'in', 'this', 'paper', 'convolutional', 'neural', 'network', 'cnn', 'a', 'kind', 'of', 'deep', 'learning', 'is', 'preliminarily', 'applied', 'as', 'a', 'new', 'algorithm', 'at', 'high', 'frequency', 'cnn', 'can', 'reconstruct', 'the', 'sound', 'localizations', 'with', 'excellent', 'spatial', 'resolution', 'as', 'good', 'as', 'damas', 'within', 'a', 'very', 'short', 'time', 'as', 'short', 'as', 'conventional', 'beamforming', 'this', 'exciting', 'result', 'means', 'that', 'cnn', 'perfectly', 'finds', 'source', 'distribution', 'directly', 'from', 'crossspectral', 'matrix', 'without', 'given', 'propagation', 'function', 'in', 'advance', 'and', 'thus', 'cnn', 'deserves', 'to', 'be', 'further', 'explored', 'as', 'a', 'new', 'algorithm']] | [-0.06114915271925815, 0.03863948505522326, -0.07970141675417321, 0.05244226576501711, -0.13083933175287463, -0.22642214313582187, 0.010340623982071952, 0.4848541543640272, -0.3071346017296868, -0.3358068912468775, 0.09470505974575351, -0.1913846596849687, -0.19246684814417603, 0.20006430991972335, -0.09634983208679566, 0.12007499509079457, 0.13183459144725343, 0.03176590734434248, -0.06212424660675378, -0.19384381009943105, 0.18907692002584087, 0.15801658753906564, 0.3268406982016232, 0.008238127899610183, 0.1596323056193539, -0.005084469827418827, 0.014247371730479326, 0.013083617582757289, 0.0019719656591387137, 0.1191417816485457, 0.3400891345380006, 0.1804486164397494, 0.28602867847663643, -0.4078560892793566, -0.2548682393948312, 0.057342367300838984, 0.2010711581731977, 0.1317937510520822, -0.049701372688316335, -0.30618728612634266, 0.1277824210772065, -0.18824088099563138, -0.07092090881655388, -0.08815802415277847, -0.027306283024525403, 0.02265544382812963, -0.2624483457060926, 0.05525068644989244, 0.014518685789421351, 0.048664808216871636, -0.021477973695392862, -0.09387288035147569, 0.08382026496051688, 0.12769376042044975, -0.015650956232966196, 0.14096844195849215, 0.05884309533531919, -0.1817673652461081, -0.0971863215384685, 0.3415863219709747, -0.12600363328149825, -0.2016164535713015, 0.17521086007808195, -0.07257042387870817, -0.11307167033711919, 0.15223409844600042, 0.22162016654255415, 0.07741361411377749, -0.1495437396894858, -0.027057573566156807, -0.03325176189154989, 0.19776863080327106, 0.09413614399928713, 0.06290572891576272, 0.22910014092169625, 0.28616770093959537, 0.07327302059892452, 0.1510771575155715, -0.16268676550438008, 0.02102502890994227, -0.2392591049781803, -0.09450168373778162, -0.2663829480533046, 0.009403720347568242, -0.10852641778653535, -0.13785286996786417, 0.4266347201809174, 0.17100677820336488, 0.2013121208815713, 0.13273290183508035, 0.36669381525405126, 0.05646775024848981, 0.08462423966689543, 0.06729462501037904, 0.1941465556508664, 0.09453500600089554, 0.15945378778563493, -0.1369832400867546, 0.057897113475271246, 0.04915152768124685] |
1,802.0448 | RoboChain: A Secure Data-Sharing Framework for Human-Robot Interaction | Robots have potential to revolutionize the way we interact with the world
around us. One of their largest potentials is in the domain of mobile health
where they can be used to facilitate clinical interventions. However, to
accomplish this, robots need to have access to our private data in order to
learn from these data and improve their interaction capabilities. Furthermore,
to enhance this learning process, the knowledge sharing among multiple robot
units is the natural step forward. However, to date, there is no
well-established framework which allows for such data sharing while preserving
the privacy of the users (e.g., the hospital patients). To this end, we
introduce RoboChain - the first learning framework for secure, decentralized
and computationally efficient data and model sharing among multiple robot units
installed at multiple sites (e.g., hospitals). RoboChain builds upon and
combines the latest advances in open data access and blockchain technologies,
as well as machine learning. We illustrate this framework using the example of
a clinical intervention conducted in a private network of hospitals.
Specifically, we lay down the system architecture that allows multiple robot
units, conducting the interventions at different hospitals, to perform
efficient learning without compromising the data privacy.
| cs.RO cs.HC | robots have potential to revolutionize the way we interact with the world around us one of their largest potentials is in the domain of mobile health where they can be used to facilitate clinical interventions however to accomplish this robots need to have access to our private data in order to learn from these data and improve their interaction capabilities furthermore to enhance this learning process the knowledge sharing among multiple robot units is the natural step forward however to date there is no wellestablished framework which allows for such data sharing while preserving the privacy of the users eg the hospital patients to this end we introduce robochain the first learning framework for secure decentralized and computationally efficient data and model sharing among multiple robot units installed at multiple sites eg hospitals robochain builds upon and combines the latest advances in open data access and blockchain technologies as well as machine learning we illustrate this framework using the example of a clinical intervention conducted in a private network of hospitals specifically we lay down the system architecture that allows multiple robot units conducting the interventions at different hospitals to perform efficient learning without compromising the data privacy | [['robots', 'have', 'potential', 'to', 'revolutionize', 'the', 'way', 'we', 'interact', 'with', 'the', 'world', 'around', 'us', 'one', 'of', 'their', 'largest', 'potentials', 'is', 'in', 'the', 'domain', 'of', 'mobile', 'health', 'where', 'they', 'can', 'be', 'used', 'to', 'facilitate', 'clinical', 'interventions', 'however', 'to', 'accomplish', 'this', 'robots', 'need', 'to', 'have', 'access', 'to', 'our', 'private', 'data', 'in', 'order', 'to', 'learn', 'from', 'these', 'data', 'and', 'improve', 'their', 'interaction', 'capabilities', 'furthermore', 'to', 'enhance', 'this', 'learning', 'process', 'the', 'knowledge', 'sharing', 'among', 'multiple', 'robot', 'units', 'is', 'the', 'natural', 'step', 'forward', 'however', 'to', 'date', 'there', 'is', 'no', 'wellestablished', 'framework', 'which', 'allows', 'for', 'such', 'data', 'sharing', 'while', 'preserving', 'the', 'privacy', 'of', 'the', 'users', 'eg', 'the', 'hospital', 'patients', 'to', 'this', 'end', 'we', 'introduce', 'robochain', 'the', 'first', 'learning', 'framework', 'for', 'secure', 'decentralized', 'and', 'computationally', 'efficient', 'data', 'and', 'model', 'sharing', 'among', 'multiple', 'robot', 'units', 'installed', 'at', 'multiple', 'sites', 'eg', 'hospitals', 'robochain', 'builds', 'upon', 'and', 'combines', 'the', 'latest', 'advances', 'in', 'open', 'data', 'access', 'and', 'blockchain', 'technologies', 'as', 'well', 'as', 'machine', 'learning', 'we', 'illustrate', 'this', 'framework', 'using', 'the', 'example', 'of', 'a', 'clinical', 'intervention', 'conducted', 'in', 'a', 'private', 'network', 'of', 'hospitals', 'specifically', 'we', 'lay', 'down', 'the', 'system', 'architecture', 'that', 'allows', 'multiple', 'robot', 'units', 'conducting', 'the', 'interventions', 'at', 'different', 'hospitals', 'to', 'perform', 'efficient', 'learning', 'without', 'compromising', 'the', 'data', 'privacy']] | [-0.08689833188201396, 0.008881727898759502, -0.05994635811360667, 0.03845723887894676, -0.15210373039423888, -0.19492445658531268, 0.11872897542566441, 0.42925033669168017, -0.2744758486491153, -0.3620780471484272, 0.09637805894349835, -0.29465532207363215, -0.12161619840688738, 0.18587340777431025, -0.12973373689022324, 0.09656105293306981, 0.08033843979961713, 0.06136226854453396, 0.032629903537168985, -0.277604582073281, 0.302963913601291, 0.05746779677800226, 0.3334113076918435, 0.04240960904934006, 0.09593669792794034, 0.035357241997523804, -0.02555505325245595, -0.06149085391281952, -0.0566436422916978, 0.19856079842243998, 0.38283898400490846, 0.2181560808688174, 0.37414983663783996, -0.4943763962234085, -0.18291828578411679, 0.10729037564751522, 0.1480805308785829, 0.10204861578187069, -0.033475444952087784, -0.31612863857180296, 0.07951623469006688, -0.19923420556778165, -0.0801269262767758, -0.12946970059954543, -0.06209744647268814, -0.01813687567690587, -0.3111332890890035, -0.01659949844090116, -0.01514076405829674, 0.10123167078162791, -0.048787227783076544, -0.05609402540127975, 0.020980074486163045, 0.2753730237255899, 0.036889524160312936, 0.03426454880284335, 0.17431211785403822, -0.12649529401274703, -0.16505363668678613, 0.3670908484598432, 0.04514756446884831, -0.16320516547302202, 0.22194849578984444, -0.06405881849267255, -0.16452281275640565, 0.05348270355928119, 0.2771924663558858, 0.06853982346008855, -0.22692109043804967, 0.025715137019038332, 0.022530586257985583, 0.14308635477684628, 0.03992871236179632, 0.009015995305273873, 0.17978424225145076, 0.22681241887336484, 0.07659798366378764, 0.09249473710209416, -0.07619704112377283, -0.10974551778499332, -0.19388783930168887, -0.1618088066972298, -0.16206645491361923, -0.025775704922496666, -0.0611913587837284, -0.09848708635036019, 0.3616972509724069, 0.2494561054330433, 0.1610925539078343, 0.06284424775144637, 0.3596790395071255, -0.010273338904323968, 0.16690681635981844, 0.11454812421971856, 0.16986681945736007, -0.008833229539402741, 0.19831605336738142, -0.17089589982773462, 0.10262834145069806, -0.07945823354043105] |
1,802.04481 | Solved and unsolved problems about abelian squares | We present and discuss a number of known results and open problems abelian
squares in words on small alphabets.
| math.CO | we present and discuss a number of known results and open problems abelian squares in words on small alphabets | [['we', 'present', 'and', 'discuss', 'a', 'number', 'of', 'known', 'results', 'and', 'open', 'problems', 'abelian', 'squares', 'in', 'words', 'on', 'small', 'alphabets']] | [-0.1736423557526187, 0.15420834531419372, 0.04597550071775913, 0.15308565803264318, -0.07619557294406389, -0.12130372223787401, 0.11088032972704816, 0.37731348429071276, -0.27011955607878535, -0.29881010829520066, 0.1989000900587263, -0.27120651260606554, -0.13276279541222671, 0.2752949210208547, -0.17501457903142037, 0.0576313988942849, 0.09260479527476587, 0.09720260983234957, -0.03440916375257075, -0.3747539406544284, 0.35409669911390856, -0.11863758010593684, 0.15389298240801222, 0.07399570265490758, 0.1273410465372236, 0.019081099571562128, -0.09419943902053331, 0.057313657782383655, -0.14135355909207933, 0.11250730760787662, 0.32840855674524055, 0.12845014866539523, 0.25623145856355367, -0.3817114563364732, -0.16942115510372738, 0.08338975730523664, 0.13008877097040808, 0.1373005113319347, -0.09795275980631184, -0.23772002638954864, 0.08395764413044642, -0.13445426783475437, -0.108955401339029, -0.0707297203572173, 0.0442320687059117, 0.04466832389957026, -0.20679373415432087, -0.002819535861674108, 0.0656917872593591, 0.0724543216883352, -0.05744593311101198, -0.2494594286146917, 0.16768738235297956, 0.057346043176949024, 0.059125837428789386, -0.011581816710531712, 0.0026686986859299636, -0.12793236608175854, -0.20912182929092332, 0.37243659970791715, -0.041520125526738796, -0.24134390771781145, 0.21238129684015325, -0.11836453968364942, -0.17343018351024703, 0.03679492907892717, 0.23410649553529525, 0.12237867614940594, -0.017256175314909535, 0.1388814730453305, -0.20390047368250394, 0.22510281569741078, 0.10667892736627867, 0.049973275512456894, 0.12454847770890123, 0.1667980383223805, 0.03150642817643912, 0.24259240294218457, -0.045102058064290566, -0.028144797163182182, -0.29557960911800985, -0.09943683661128346, -0.1251482045964191, 0.014285994203467118, -0.06915043132520575, -0.23088872334674784, 0.3730158311756034, 0.15689127122689234, 0.17331829392596296, 0.1487126085220983, 0.24636206187699972, -0.01300665064665832, 0.036512012544431184, 0.12996920546222673, 0.06412883289158344, 0.1691398539237286, -0.04359981027970973, -0.17398638650774956, -0.019118550012966518, 0.13628860842436552] |
1,802.04482 | A toy model of shtukas | Motivated by the question of constructing certain rational functions (modular
units) on the moduli stack of Drinfeld shtukas, we introduce the notion of toy
shtukas. We prove basic properties of the moduli scheme of toy shtukas.
Analogously to horospherical divisors on the moduli stack of Drinfeld shtukas,
there are toy horospherical divisors on the moduli scheme of toy shtukas. We
describe the space of principal toy horospherical divisors. There is a
canonical morphism from the moduli stack of Drinfeld shtukas to the moduli
scheme of toy shtukas. Our main result is a description of the space of
principal horospherical divisors obtained from the pullback.
| math.AG math.NT math.RT | motivated by the question of constructing certain rational functions modular units on the moduli stack of drinfeld shtukas we introduce the notion of toy shtukas we prove basic properties of the moduli scheme of toy shtukas analogously to horospherical divisors on the moduli stack of drinfeld shtukas there are toy horospherical divisors on the moduli scheme of toy shtukas we describe the space of principal toy horospherical divisors there is a canonical morphism from the moduli stack of drinfeld shtukas to the moduli scheme of toy shtukas our main result is a description of the space of principal horospherical divisors obtained from the pullback | [['motivated', 'by', 'the', 'question', 'of', 'constructing', 'certain', 'rational', 'functions', 'modular', 'units', 'on', 'the', 'moduli', 'stack', 'of', 'drinfeld', 'shtukas', 'we', 'introduce', 'the', 'notion', 'of', 'toy', 'shtukas', 'we', 'prove', 'basic', 'properties', 'of', 'the', 'moduli', 'scheme', 'of', 'toy', 'shtukas', 'analogously', 'to', 'horospherical', 'divisors', 'on', 'the', 'moduli', 'stack', 'of', 'drinfeld', 'shtukas', 'there', 'are', 'toy', 'horospherical', 'divisors', 'on', 'the', 'moduli', 'scheme', 'of', 'toy', 'shtukas', 'we', 'describe', 'the', 'space', 'of', 'principal', 'toy', 'horospherical', 'divisors', 'there', 'is', 'a', 'canonical', 'morphism', 'from', 'the', 'moduli', 'stack', 'of', 'drinfeld', 'shtukas', 'to', 'the', 'moduli', 'scheme', 'of', 'toy', 'shtukas', 'our', 'main', 'result', 'is', 'a', 'description', 'of', 'the', 'space', 'of', 'principal', 'horospherical', 'divisors', 'obtained', 'from', 'the', 'pullback']] | [-0.2387298159301281, 0.012649001074560847, -0.14608363882423595, 0.1093823617489901, -0.10508236777968705, -0.11935475542962265, -0.014436352183111012, 0.2869902544368345, -0.375933451009377, -0.17170451106861806, 0.059720383263013974, -0.19035151091296798, -0.2077073493363479, 0.24883826291905, -0.24820821947203234, -0.02731623909382436, -0.013012039215447238, 0.003062069613056687, -0.07594082661223812, -0.3881854711239262, 0.5401940655966218, -0.023795300857343066, 0.27837553007814747, 0.013704107796701673, 0.1499307716775757, 0.035354489066566415, -0.004435042801420563, -0.09475020150924908, -0.15650125307281718, 0.18836254790613355, 0.31308771347483766, 0.046627794725981615, 0.13884590775705874, -0.4272157304490415, -0.10791457484727009, 0.2146579212634466, 0.07696017429966909, 0.027277162628496835, 0.04664737257385591, -0.23682602582714304, 0.06834978170795344, -0.18449109893005627, -0.22977500512094523, -0.14758439345930058, 0.02929283526743977, 0.0348913417233584, -0.13196631049280627, -0.08048768255573052, 0.0219952500013348, 0.18959617952350527, -0.09279979503928469, -0.07628665385373797, -0.13354459026595578, -0.022492455452895507, 0.04623903824428383, 0.01724794450162265, 0.15137425772039792, -0.10529851456298135, -0.09112710447516292, 0.37044455588329583, -0.06839600596756029, -0.1842504502632297, 0.05953491061854248, -0.06826904672197998, -0.14039030196055627, 0.05297448366540126, 0.04716081636098142, 0.21927533535591254, 0.04946277510876266, 0.22024381114169955, -0.20043357403707118, 0.039363886997587264, 0.07927202401333489, -0.0515530213373355, 0.14159292475177118, 0.18807267325554186, -0.012095876279860161, 0.1629566336856582, 0.0034884343510314534, -0.08286134056442489, -0.45442340494348454, -0.19528212911413553, -0.061515705093580224, 0.19617822870182303, -0.18574519094545394, -0.2019302687034584, 0.42763995681585026, 0.05638238527955344, 0.2485038932556143, 0.16624355895552212, 0.23150542522601497, -0.029139295940135177, 0.04765025662401548, -0.025290603400208056, 0.1343822421398587, 0.25241375836552693, -0.11291172265415438, -0.11371642711590259, -0.09930093126156582, 0.32733598992658347] |
1,802.04483 | Some Information Inequalities for Statistical Inference | In this paper, we first describe the generalized notion of Cramer-Rao lower
bound obtained by Naudts (2004) using two families of probability density
functions, the original model and an escort model. We reinterpret the results
in Naudts (2004) from a statistical point of view and obtain some interesting
examples in which this bound is attained. Further we obtain information
inequalities which generalize the classical Bhattacharyya bounds in both
regular and non-regular cases.
| math.ST stat.TH | in this paper we first describe the generalized notion of cramerrao lower bound obtained by naudts 2004 using two families of probability density functions the original model and an escort model we reinterpret the results in naudts 2004 from a statistical point of view and obtain some interesting examples in which this bound is attained further we obtain information inequalities which generalize the classical bhattacharyya bounds in both regular and nonregular cases | [['in', 'this', 'paper', 'we', 'first', 'describe', 'the', 'generalized', 'notion', 'of', 'cramerrao', 'lower', 'bound', 'obtained', 'by', 'naudts', '2004', 'using', 'two', 'families', 'of', 'probability', 'density', 'functions', 'the', 'original', 'model', 'and', 'an', 'escort', 'model', 'we', 'reinterpret', 'the', 'results', 'in', 'naudts', '2004', 'from', 'a', 'statistical', 'point', 'of', 'view', 'and', 'obtain', 'some', 'interesting', 'examples', 'in', 'which', 'this', 'bound', 'is', 'attained', 'further', 'we', 'obtain', 'information', 'inequalities', 'which', 'generalize', 'the', 'classical', 'bhattacharyya', 'bounds', 'in', 'both', 'regular', 'and', 'nonregular', 'cases']] | [-0.05022151631096171, 0.04706365620485384, -0.12752246676892456, 0.1319535715916168, -0.013812393389849199, -0.14575326033324623, 0.09720631378554066, 0.2656861371878121, -0.2526163648128406, -0.32736573739546454, 0.09872239002369396, -0.2516024859958432, -0.22866445471946564, 0.2184329801174398, -0.14286867011752394, 0.05410477575949497, 0.03854591222221239, 0.06065397250414309, -0.11739923736442709, -0.2711990223680105, 0.30456103609564406, 0.04039544513054554, 0.27057982372611555, 0.04743690181122576, 0.057336868013307035, 0.0103154311202363, -0.034119899953818984, 0.0014995299394639813, -0.2672152070574359, 0.17205436263854304, 0.21831915385620151, 0.16491060240271813, 0.23003636858710605, -0.36129543502789196, -0.17853209822593877, 0.1335908303477077, 0.09411309648486268, 0.11269859851583736, -0.019997276158796415, -0.31880923483469004, 0.027410764454139605, -0.19549601922820634, -0.1322001039322155, -0.08338181289016372, -0.030050977307837456, 0.037499834899790585, -0.27324326132010257, 0.09315185825754371, 0.13894858451870581, 0.02509296367417038, -0.06442123635982473, -0.1553487746536525, 0.040368664392089054, 0.060417091499807105, 0.00430387060623616, -0.005771911025577638, 0.026121552975382656, -0.09098351215167592, -0.1624224354196081, 0.26251427551162326, -0.054737782374205485, -0.22359337763757342, 0.14240910793079012, -0.14027733972115028, -0.1814598500301751, 0.037625718305611774, 0.17530725320441182, 0.1375788726986179, -0.16628005982945776, 0.12365447151387343, -0.12125387665097757, 0.08341623454867254, 0.11877950726840128, 0.046854676911607385, 0.10569480140434785, 0.06415630887608535, 0.07564417279758749, 0.22211558501456036, -0.07211431551776412, -0.13420734629552397, -0.31479082600627506, -0.14974683865471483, -0.20047424475908177, 0.013218355293954827, -0.12247490252229909, -0.12123089004146298, 0.36044225328239715, 0.1571864693113538, 0.20700292921133545, 0.12272508542325038, 0.2518349708342511, 0.13561520235250807, -0.05271059777603821, 0.1274782729807258, 0.2395365994844825, 0.1556379447024988, 0.03463551292790928, -0.08846014453835475, 0.02849344682939166, 0.1278422421859836] |
1,802.04484 | Required sensitivity to search the neutrinoless double beta decay in
$^{124}Sn$ | \textbf{T}he \textbf{IN}dia's \textbf{TIN} (TIN.TIN) detector is under
development in the search for neutrinoless double-$\beta$ decay
(0$\nu\beta\beta$) using 90\% enriched $^{124}$Sn isotope as the target mass.
This detector will be housed in the upcoming underground facility of the
\textbf{I}ndia based \textbf{N}eutrino \textbf{O}bservatory. We present the
most important experimental parameters that would be used in the study of
required sensitivity for the TIN.TIN experiment to probe the neutrino mass
hierarchy. The sensitivity of the TIN.TIN detector in the presence of sole two
neutrino double-$\beta$ decay (2$\nu\beta\beta$) decay background is studied at
various energy resolutions. The most optimistic and pessimistic scenario to
probe the neutrino mass hierarchy at 3$\sigma$ sensitivity level and 90\% C.L.
is also discussed.
| hep-ph physics.ins-det | textbfthe textbfindias textbftin tintin detector is under development in the search for neutrinoless doublebeta decay 0nubetabeta using 90 enriched 124sn isotope as the target mass this detector will be housed in the upcoming underground facility of the textbfindia based textbfneutrino textbfobservatory we present the most important experimental parameters that would be used in the study of required sensitivity for the tintin experiment to probe the neutrino mass hierarchy the sensitivity of the tintin detector in the presence of sole two neutrino doublebeta decay 2nubetabeta decay background is studied at various energy resolutions the most optimistic and pessimistic scenario to probe the neutrino mass hierarchy at 3sigma sensitivity level and 90 cl is also discussed | [['textbfthe', 'textbfindias', 'textbftin', 'tintin', 'detector', 'is', 'under', 'development', 'in', 'the', 'search', 'for', 'neutrinoless', 'doublebeta', 'decay', '0nubetabeta', 'using', '90', 'enriched', '124sn', 'isotope', 'as', 'the', 'target', 'mass', 'this', 'detector', 'will', 'be', 'housed', 'in', 'the', 'upcoming', 'underground', 'facility', 'of', 'the', 'textbfindia', 'based', 'textbfneutrino', 'textbfobservatory', 'we', 'present', 'the', 'most', 'important', 'experimental', 'parameters', 'that', 'would', 'be', 'used', 'in', 'the', 'study', 'of', 'required', 'sensitivity', 'for', 'the', 'tintin', 'experiment', 'to', 'probe', 'the', 'neutrino', 'mass', 'hierarchy', 'the', 'sensitivity', 'of', 'the', 'tintin', 'detector', 'in', 'the', 'presence', 'of', 'sole', 'two', 'neutrino', 'doublebeta', 'decay', '2nubetabeta', 'decay', 'background', 'is', 'studied', 'at', 'various', 'energy', 'resolutions', 'the', 'most', 'optimistic', 'and', 'pessimistic', 'scenario', 'to', 'probe', 'the', 'neutrino', 'mass', 'hierarchy', 'at', '3sigma', 'sensitivity', 'level', 'and', '90', 'cl', 'is', 'also', 'discussed']] | [-0.029368752028382974, 0.23251088301078715, -0.002001044438690494, 0.17591500963477436, -0.0060015947583618515, -0.12541434056031595, 0.0322855403796351, 0.29935651421205167, -0.1449187269472782, -0.3284413764155, 0.09235871930226444, -0.30001608156727266, 0.005520837680530658, 0.21475622884570322, 0.07434754544621282, 0.08153083587887455, 0.0948591056245661, 0.045990171904756835, -0.08594738545404627, -0.21668017507154802, 0.22523628851962746, 0.24417280061426785, 0.26429842808924686, 0.09738291726274621, 0.05862265474316792, -0.06385662010817472, -0.040966220499110334, -0.12565690789952738, -0.1291521687230545, 0.03143989104657955, 0.3027973313615102, 0.1800128253937246, 0.12168647328374582, -0.39381919550034433, -0.0703790688592462, 0.17908868869689695, 0.13104820929877803, 0.018733425629795145, -0.12233926180681777, -0.3499893713058955, 0.0858969397313141, -0.20468461836491703, -0.13104268272808933, 0.013030316520465213, -0.062195315229740644, -0.04950812481100235, -0.28165253262044093, 0.03832494848116233, -0.08326169014523882, -0.03075104047450314, -0.03397898702805332, -0.23049759990407512, 0.07132612948344354, 0.04133208290836133, 0.07470951637962338, 0.0015093255310144207, 0.19931740460942987, -0.12438856480309927, -0.057956473329403534, 0.36439721163259736, -0.10039575684414066, -0.11636696350034498, 0.12534884295272514, -0.2172564388260271, -0.17011712084165476, 0.1661273897625506, 0.16297813610882933, 0.06207906168996604, -0.22912721280350323, 0.09518051363950715, -0.0033114784303198168, 0.22278451135194083, 0.0947518247530001, 0.06870551214664491, 0.2663969182229917, 0.35396619575149424, 0.10259515740011536, -0.004240817200272865, -0.23888240405999192, 0.01036725123199301, -0.36157746988117967, -0.14216792180177268, -0.05482587564326481, 0.0599861419802412, -0.013246855984491065, -0.05961341261351054, 0.40833189939106, 0.1597519313250113, 0.11656987417591821, -0.02136093081795363, 0.27449689305669395, 0.05422715895164143, 0.06242410231668955, -0.06886497688043965, 0.38080805203014423, 0.1319670717684774, 0.08286453679485947, -0.27951113366598795, 0.07878110122223374, 0.03168845331774802] |
1,802.04485 | Loop-gap Microwave Resonator for Hybrid Quantum Systems | We designed a loop-gap microwave resonator for applications of spin-based
hybrid quantum systems, and tested it with impurity spins in diamond. Strong
coupling with ensembles of nitrogen-vacancy (NV) centers and substitutional
nitrogen (P1) centers was observed. These results show that loop-gap resonators
are viable in the prospect of spin-based hybrid quantum systems, especially for
an ensemble quantum memory or a quantum transducer.
| quant-ph cond-mat.mes-hall | we designed a loopgap microwave resonator for applications of spinbased hybrid quantum systems and tested it with impurity spins in diamond strong coupling with ensembles of nitrogenvacancy nv centers and substitutional nitrogen p1 centers was observed these results show that loopgap resonators are viable in the prospect of spinbased hybrid quantum systems especially for an ensemble quantum memory or a quantum transducer | [['we', 'designed', 'a', 'loopgap', 'microwave', 'resonator', 'for', 'applications', 'of', 'spinbased', 'hybrid', 'quantum', 'systems', 'and', 'tested', 'it', 'with', 'impurity', 'spins', 'in', 'diamond', 'strong', 'coupling', 'with', 'ensembles', 'of', 'nitrogenvacancy', 'nv', 'centers', 'and', 'substitutional', 'nitrogen', 'p1', 'centers', 'was', 'observed', 'these', 'results', 'show', 'that', 'loopgap', 'resonators', 'are', 'viable', 'in', 'the', 'prospect', 'of', 'spinbased', 'hybrid', 'quantum', 'systems', 'especially', 'for', 'an', 'ensemble', 'quantum', 'memory', 'or', 'a', 'quantum', 'transducer']] | [-0.14625874828291877, 0.2100071472572557, 0.07387658385860343, -0.01083780232077134, 0.0811700287327591, -0.270694249835346, 0.02230220532885963, 0.496059792416711, -0.19082867390205782, -0.27019681425524816, 0.014634757396584798, -0.35036782052127585, -0.08933391622192557, 0.25555431901011616, 0.011195463156552924, 0.14322908128040931, 0.08186806503292773, -0.014274415950621329, -0.0020368448120632, -0.21561373341377946, 0.21591333078287145, 0.03822073135374775, 0.3791580667809373, 0.03502120121171878, 0.10782224428839982, 0.014182855645495077, 0.18632211476083724, 0.009896391369928155, -0.05416690889098625, 0.17457772330254234, 0.322028907076005, 0.0029705053856295925, 0.2318030726915646, -0.48011604456170914, -0.2290308682413231, 0.07582223184046245, 0.12867720376309608, 0.2533732740088336, -0.1821935762756414, -0.30913422296514675, 0.0835511612916185, -0.16077511987438606, -0.10501402280069963, -0.1000155502359473, -0.017860626223527135, -0.002010955467760082, -0.22372566205599614, 0.016595250521335873, 0.06603044396146171, 0.05354580841958523, -0.024054392661538818, -0.07377536996688333, 0.06791241048654963, 0.04412465244005885, -0.19167683162395993, -0.004495485062380472, 0.27045867451646877, -0.08143276902621673, -0.248467723455941, 0.3626465887852734, -0.04113800620900527, -0.08199608915545527, 0.1806578277460029, -0.10008593591591043, -0.10852558390357561, -0.023547604409677368, 0.12444543109966381, 0.12255691133454562, -0.17809149466695323, 0.10272875805047431, 0.07917498017477262, 0.2294027989189471, 0.04670151041430091, 0.17892437679843315, 0.30956457549285504, 0.18430146965528688, 0.07453397056181735, 0.17083807441691357, -0.10155184224488274, -0.10957858741711525, -0.1822466068702089, -0.2189718457990356, -0.232394281534418, 0.11716346014967008, -0.11468197605075059, -0.16455623593121285, 0.3051440981141622, 0.13030603054850812, 0.11584173574022227, -0.10555028341214863, 0.2537307974191443, 0.06950578814552676, 0.13558419072820294, 0.009480842689592992, 0.24445213263313617, 0.2432926129249315, 0.060350088132244926, -0.3518295624563771, -0.08699772718001998, -0.0617820585311781] |
1,802.04486 | Integrated Massive Vertex Operator in Pure Spinor Formalism | We construct the integrated vertex operator for the first massive states of
open superstrings with $(mass)^2=1/\alpha'$ in the pure spinor formalism of the
superstring theory. This vertex operator is expressed in terms of the ten
dimensional $\mathcal{N}=1$ superfields describing the massive supermultiplet
which appear in the unintegrated vertex operator of the same states.
| hep-th | we construct the integrated vertex operator for the first massive states of open superstrings with mass21alpha in the pure spinor formalism of the superstring theory this vertex operator is expressed in terms of the ten dimensional mathcaln1 superfields describing the massive supermultiplet which appear in the unintegrated vertex operator of the same states | [['we', 'construct', 'the', 'integrated', 'vertex', 'operator', 'for', 'the', 'first', 'massive', 'states', 'of', 'open', 'superstrings', 'with', 'mass21alpha', 'in', 'the', 'pure', 'spinor', 'formalism', 'of', 'the', 'superstring', 'theory', 'this', 'vertex', 'operator', 'is', 'expressed', 'in', 'terms', 'of', 'the', 'ten', 'dimensional', 'mathcaln1', 'superfields', 'describing', 'the', 'massive', 'supermultiplet', 'which', 'appear', 'in', 'the', 'unintegrated', 'vertex', 'operator', 'of', 'the', 'same', 'states']] | [-0.1279482138611806, 0.18959637217295283, -0.010298875196335407, 0.10439678779445015, -0.031142394022586253, -0.10538748565774697, -0.0672205437552363, 0.2754572950876676, -0.1498801759802378, -0.2106553025257129, 0.025642682630300093, -0.308008879602242, -0.1457764318642708, 0.005593546236363741, 0.0025069136530734026, 0.01979707462641482, 0.0548365502170502, 0.12608200550759927, -0.09858625722475924, -0.29715762371555543, 0.42643786048910653, -0.05814749937361249, 0.23299344021898621, 0.0485684381658827, 0.15399580027979726, 0.034575768549425095, -0.027006121567235544, -0.061507450470414296, -0.041556205797510654, 0.1584373130709327, 0.29527780485267824, 0.14144765254325017, 0.10969749952738102, -0.5032581091285325, -0.1572530945368971, 0.07120477401902182, 0.21152044309733006, 0.11924453144848275, 0.04821099269275482, -0.27508116090813506, 0.012144429250978507, -0.2250082167223669, -0.24387625321889153, -0.0022523678529138965, 0.018735799472779036, -0.15666063502430916, -0.24215770337300804, 0.08862433172404192, -0.02120922230040798, -0.014965980280696666, -0.06547642948750693, -0.14644744952854055, -0.12304053837075256, 0.052682792664899565, -0.008221116566206686, 0.10100805803085677, 0.0944760292231177, -0.22843488346734375, -0.19767861732711586, 0.3268325671983453, -0.07288871879259554, -0.2439361468423158, 0.08937424147286667, -0.17000636574812233, -0.18986304808193102, 0.018897357643044625, 0.11015717867905131, 0.18538328718680602, -0.23315301945862862, 0.24618677750158197, -0.03146322173639559, 0.036112468053873345, 0.09460550743656662, 0.1320380566176027, 0.1874565442916579, 0.11908654363539356, 0.041985545987979725, 0.15956513844251347, 0.03980853760507531, -0.130844555544452, -0.4385143836530355, -0.15882011408904453, -0.10749287938681217, 0.1058666619221465, -0.14391659565556508, -0.2214257114638503, 0.48771964532967943, 0.09031606482928439, 0.1529297781570886, 0.021599607633946177, 0.1829124900440757, 0.24418222181534824, 0.15436381606671673, 0.08510718104214622, 0.19056526265250376, 0.2076597954862966, 0.07425848905964252, -0.25585759672013897, -0.15967169325337566, 0.20546872561009458] |
1,802.04487 | Effect of phonon coupling on cooperative two-photon emission from
two-quantum dots | We predict dominating cooperative two-photon emission from two quantum dots
coupled with a single mode photonic crystal cavity. The cooperative two photon
emission occurs when excitons in two off-resonantly coupled quantum dots decay
simultaneously. The interaction with common cavity field leads to cavity
induced two-photon emission which is strongly inhibited by electron phonon
coupling. The interaction with common phonon bath produces phonon induced
two-photon emission which increases on increasing temperature. For identical
quantum dots cavity induced two-photon emission is negligible but phonon
induced two-photon emission could be large.
| quant-ph | we predict dominating cooperative twophoton emission from two quantum dots coupled with a single mode photonic crystal cavity the cooperative two photon emission occurs when excitons in two offresonantly coupled quantum dots decay simultaneously the interaction with common cavity field leads to cavity induced twophoton emission which is strongly inhibited by electron phonon coupling the interaction with common phonon bath produces phonon induced twophoton emission which increases on increasing temperature for identical quantum dots cavity induced twophoton emission is negligible but phonon induced twophoton emission could be large | [['we', 'predict', 'dominating', 'cooperative', 'twophoton', 'emission', 'from', 'two', 'quantum', 'dots', 'coupled', 'with', 'a', 'single', 'mode', 'photonic', 'crystal', 'cavity', 'the', 'cooperative', 'two', 'photon', 'emission', 'occurs', 'when', 'excitons', 'in', 'two', 'offresonantly', 'coupled', 'quantum', 'dots', 'decay', 'simultaneously', 'the', 'interaction', 'with', 'common', 'cavity', 'field', 'leads', 'to', 'cavity', 'induced', 'twophoton', 'emission', 'which', 'is', 'strongly', 'inhibited', 'by', 'electron', 'phonon', 'coupling', 'the', 'interaction', 'with', 'common', 'phonon', 'bath', 'produces', 'phonon', 'induced', 'twophoton', 'emission', 'which', 'increases', 'on', 'increasing', 'temperature', 'for', 'identical', 'quantum', 'dots', 'cavity', 'induced', 'twophoton', 'emission', 'is', 'negligible', 'but', 'phonon', 'induced', 'twophoton', 'emission', 'could', 'be', 'large']] | [-0.15061332378801043, 0.3749535024187274, 0.037569871680303055, -0.03384311108013869, -0.02710673324128782, -0.31024329378587107, 0.008621703202317638, 0.4964436682322147, -0.26498932615769183, -0.20798426576551388, -0.14124591058961497, -0.36734447022899985, -0.03360581172587858, 0.16956478152000767, 0.10340516566595231, -0.007262784289196134, 0.06687022514498411, -0.06415463258533484, 0.1060446425055323, -0.0808304719605737, 0.3037156786833128, 0.027439027084090576, 0.3260564009277997, 0.13222896375439383, 0.055773232100446796, 0.01126981988570399, 0.10726779314096678, -0.06781216837804425, -0.10177880323978818, 0.057736951265145435, 0.26359850530306256, -0.07083638303976675, 0.22923185117542744, -0.4434621229513802, -0.18090506029759787, 0.08187117503786628, 0.22695485299283807, 0.19711832630723206, -0.07328227773409295, -0.3026873939353126, -0.10252163645980711, -0.13402567666277967, -0.0557153047835031, 0.024174380116164684, -0.07103360132499471, -0.06634764559566975, -0.3018605436240746, 0.09988868666220117, 0.0177043110888917, 0.0153997994387861, 0.045793834653026846, 0.03702523665296295, -0.046822327210313895, -0.013224397580581188, -0.02568128395994956, 0.0281262124190107, 0.2974292717355473, -0.07012412284066985, -0.17319543763931672, 0.3711103443056345, -0.15291108397915112, -0.025851403701711784, 0.15902658688454804, -0.19508772547123954, -0.007207858854103092, 0.28712893274231727, 0.0833637029328119, 0.06446532515639608, -0.11948021484981423, 0.019321934211554682, 0.05896222626324743, 0.25084309702188795, 0.12569069796749813, 0.2252147800252053, 0.22778146876159802, 0.11429347917278805, -0.03808233418120918, 0.2048175896753409, -0.1180189490577587, -0.140674214259806, -0.21133162489753554, -0.09281787464384582, -0.23890419761664816, 0.15166288483041254, -0.087643543866844, -0.15699391133702276, 0.3715901956470175, 0.0398477687637999, 0.09338754030283201, -0.09760953252870505, 0.3193379552315243, 0.2263054045827382, 0.10643100748050281, -0.0033194635402237923, 0.3593064265389165, 0.23846152178488078, -0.03947201999306509, -0.43867581272074446, -0.023913867168382487, -0.09236017521999945] |
1,802.04488 | A polymer model for the quantitative reconstruction of 3d chromosome
architecture from Hi-C and GAM data | It is widely believed that the folding of the chromosome in the nucleus has a
major effect on genetic expression. For example co-regulated genes in several
species have been shown to colocalize in space despite being far away on the
DNA sequence. In this manuscript, we present a new method to model the
three-dimensional structure of the chromosome in live cells, based on DNA-DNA
interactions measured in high-throughput chromosome conformation capture
experiments (Hi-C) and genome architecture mapping experiments (GAM). Our
approach incorporates a polymer model, and directly uses the contact
probabilities measured in Hi-C and GAM experiments rather than estimates of
average distances between genomic loci. Specifically, we model the chromosome
as a Gaussian polymer with harmonic interactions and extract the coupling
coefficients best reproducing the experimental contact probabilities. In
contrast to existing methods, we give an exact expression of the contact
probabilities at thermodynamic equilibrium. The Gaussian effective model (GEM)
reconstructed with our method reproduces experimental contacts with high
accuracy. We also show how Brownian Dynamics simulations of our reconstructed
GEM can be used to study chromatin organization, and possibly give some clue
about its dynamics.
| q-bio.QM cond-mat.soft | it is widely believed that the folding of the chromosome in the nucleus has a major effect on genetic expression for example coregulated genes in several species have been shown to colocalize in space despite being far away on the dna sequence in this manuscript we present a new method to model the threedimensional structure of the chromosome in live cells based on dnadna interactions measured in highthroughput chromosome conformation capture experiments hic and genome architecture mapping experiments gam our approach incorporates a polymer model and directly uses the contact probabilities measured in hic and gam experiments rather than estimates of average distances between genomic loci specifically we model the chromosome as a gaussian polymer with harmonic interactions and extract the coupling coefficients best reproducing the experimental contact probabilities in contrast to existing methods we give an exact expression of the contact probabilities at thermodynamic equilibrium the gaussian effective model gem reconstructed with our method reproduces experimental contacts with high accuracy we also show how brownian dynamics simulations of our reconstructed gem can be used to study chromatin organization and possibly give some clue about its dynamics | [['it', 'is', 'widely', 'believed', 'that', 'the', 'folding', 'of', 'the', 'chromosome', 'in', 'the', 'nucleus', 'has', 'a', 'major', 'effect', 'on', 'genetic', 'expression', 'for', 'example', 'coregulated', 'genes', 'in', 'several', 'species', 'have', 'been', 'shown', 'to', 'colocalize', 'in', 'space', 'despite', 'being', 'far', 'away', 'on', 'the', 'dna', 'sequence', 'in', 'this', 'manuscript', 'we', 'present', 'a', 'new', 'method', 'to', 'model', 'the', 'threedimensional', 'structure', 'of', 'the', 'chromosome', 'in', 'live', 'cells', 'based', 'on', 'dnadna', 'interactions', 'measured', 'in', 'highthroughput', 'chromosome', 'conformation', 'capture', 'experiments', 'hic', 'and', 'genome', 'architecture', 'mapping', 'experiments', 'gam', 'our', 'approach', 'incorporates', 'a', 'polymer', 'model', 'and', 'directly', 'uses', 'the', 'contact', 'probabilities', 'measured', 'in', 'hic', 'and', 'gam', 'experiments', 'rather', 'than', 'estimates', 'of', 'average', 'distances', 'between', 'genomic', 'loci', 'specifically', 'we', 'model', 'the', 'chromosome', 'as', 'a', 'gaussian', 'polymer', 'with', 'harmonic', 'interactions', 'and', 'extract', 'the', 'coupling', 'coefficients', 'best', 'reproducing', 'the', 'experimental', 'contact', 'probabilities', 'in', 'contrast', 'to', 'existing', 'methods', 'we', 'give', 'an', 'exact', 'expression', 'of', 'the', 'contact', 'probabilities', 'at', 'thermodynamic', 'equilibrium', 'the', 'gaussian', 'effective', 'model', 'gem', 'reconstructed', 'with', 'our', 'method', 'reproduces', 'experimental', 'contacts', 'with', 'high', 'accuracy', 'we', 'also', 'show', 'how', 'brownian', 'dynamics', 'simulations', 'of', 'our', 'reconstructed', 'gem', 'can', 'be', 'used', 'to', 'study', 'chromatin', 'organization', 'and', 'possibly', 'give', 'some', 'clue', 'about', 'its', 'dynamics']] | [-0.06396545777981354, 0.07952634444316155, -0.09257924930070512, 0.09368524825658629, -0.007220107439487057, -0.15436556876293397, 0.03722274805391755, 0.42076153410748046, -0.24316456593214508, -0.2750288018817331, 0.0007598719280711151, -0.27588200851537803, -0.21651847241944408, 0.18413790433423563, -0.034259835163499903, 0.03279941075109195, 0.12445599007554711, 0.05226723024282943, 0.004558735406325064, -0.2019118159588546, 0.2327137463066209, 0.10727062729376563, 0.27314413842909474, 0.047275931157962664, 0.13009425208600048, -0.033929459673457125, -0.01465968833520341, 0.0016930805253709124, -0.18081548318590124, 0.15448742889659728, 0.25255812233423486, 0.10610823952443499, 0.22890146522792704, -0.44211738384303884, -0.23173623767626636, 0.08142482632781095, 0.16822012870965955, 0.1496100514370171, -0.04011185315778768, -0.2816611780743936, 0.051233165065713106, -0.13623426643880035, -0.08140894639639452, -0.08967397049477792, -0.0002818054863236805, 0.04435920553035377, -0.24528314172630172, 0.10279902837887894, 0.003696892310910046, 0.08479899514645817, -0.07119648763287394, -0.13333526531976453, -0.012130339867759117, 0.16793103789584463, 0.06502309700668377, 0.0653914312749882, 0.1981395150945375, -0.08749047961001369, -0.1207563562907296, 0.33247156945719597, -0.0594048563601545, -0.2320339160281567, 0.21975033983643003, -0.1742842357311856, -0.156497651930241, 0.14583988839830148, 0.15576224841854788, 0.08401725182426785, -0.19932082176418917, 0.043872748947027515, -0.014653888569626818, 0.18767204005980895, 0.06581408207125483, -0.019897426685248625, 0.17236956886518845, 0.2251900583542983, -0.0071277279533784495, 0.11255330927383633, -0.14185788392657064, -0.1474150268131877, -0.22763898564915966, -0.14188320039961996, -0.15649673029690742, 0.01239539819513074, -0.08570798590770277, -0.17089487616266752, 0.37082551822893045, 0.13549544853513143, 0.2322890170392914, 0.05670148253199311, 0.26808756417071916, 0.007006385232904617, 0.10078453376919111, -0.00907382501269327, 0.18724059850244565, 0.10974500257581632, 0.05213294968875573, -0.23461323000620155, 0.14147773413062295, 0.06400389690948202] |
1,802.04489 | Unbalanced urn model with random addition | In this paper, we consider a multi-drawing urn model with random addition. At
each discrete time step, we draw a sample of m balls. According to the
composition of the drawn colors, we return the balls together with a random
number of balls depending on two discrete random variables X and Y with finite
means and variances. Via the stochastic approximation algorithm, we give limit
theorems describing the asymptotic behavior of white balls.
| math.PR | in this paper we consider a multidrawing urn model with random addition at each discrete time step we draw a sample of m balls according to the composition of the drawn colors we return the balls together with a random number of balls depending on two discrete random variables x and y with finite means and variances via the stochastic approximation algorithm we give limit theorems describing the asymptotic behavior of white balls | [['in', 'this', 'paper', 'we', 'consider', 'a', 'multidrawing', 'urn', 'model', 'with', 'random', 'addition', 'at', 'each', 'discrete', 'time', 'step', 'we', 'draw', 'a', 'sample', 'of', 'm', 'balls', 'according', 'to', 'the', 'composition', 'of', 'the', 'drawn', 'colors', 'we', 'return', 'the', 'balls', 'together', 'with', 'a', 'random', 'number', 'of', 'balls', 'depending', 'on', 'two', 'discrete', 'random', 'variables', 'x', 'and', 'y', 'with', 'finite', 'means', 'and', 'variances', 'via', 'the', 'stochastic', 'approximation', 'algorithm', 'we', 'give', 'limit', 'theorems', 'describing', 'the', 'asymptotic', 'behavior', 'of', 'white', 'balls']] | [-0.07500834579251306, 0.16029391794775924, -0.14141547693482912, 0.014962441848991957, -0.0360233471987562, -0.12367702052385236, 0.15953926795272208, 0.38383988516094786, -0.22165617392036235, -0.25913694511271185, 0.0898384029327038, -0.30957349651079213, -0.07926673966317645, 0.08880940844149639, -0.13361186034227204, 0.04366303978410239, 0.03452459231872732, 0.05491027397591905, -0.04423497699382198, -0.3348062037289815, 0.31662415048210985, -0.05071857775975433, 0.20737949947619605, -0.08282521317919923, 0.16133264514630558, 0.06754708706608249, -0.0785757598803482, 0.050909092930245, -0.19612698304829085, 0.08472026361980373, 0.1881390459279323, 0.05189819828633012, 0.3074147175583575, -0.3985783061809545, -0.17217437631269503, 0.211872614803724, 0.1105142205128181, 0.04055207908903766, -0.041397381772791654, -0.23223090046667494, 0.09524469706553242, -0.08655204380758935, -0.1512988828536537, 0.00867203613355135, 0.015411186492150996, 0.1352230920294662, -0.3172015072907218, 0.007796754297386441, 0.1318211245104774, 0.017311024865597976, -0.020336532848887146, -0.15681317964723954, 0.022641984086173277, 0.1297638033154524, 0.06751904290932645, 0.011240205261856318, 0.09789675075767769, -0.0032331480405345145, -0.09205579881220022, 0.3562532637030624, -0.0911303384281281, -0.234524732593046, 0.14329232254789936, -0.17442270416844016, -0.15026049675523406, 0.07233724952998778, 0.20863940861696997, 0.12758818943984807, -0.13077856494217283, 0.12089902335719671, -0.06545547975434197, 0.10813986262979193, 0.08557848825067696, 0.05128725747474366, 0.17689768378881532, 0.1570000482412676, 0.07397387016357647, 0.18985368063699248, -0.07877971737697306, -0.13403164150400293, -0.34627472082825583, -0.12140576432769497, -0.22445200036357468, 0.0979447980514831, -0.22587292311194082, -0.21624393803843608, 0.344565264078685, 0.10790853625318657, 0.28448629068831605, 0.1465482743870881, 0.2260229690776517, 0.12173356937192795, -0.07844082356637551, 0.0913081532344222, 0.06768362923240703, 0.18453296962090665, 0.0717830149224028, -0.14034053901883048, 0.03725320803156743, 0.1571040047177424] |
1,802.0449 | Experimental Implementation of a Large Scale Multipost Re-Entrant Array | We demonstrate possibilities of a large scale multi-post re-entrant cavity
with two case studies implemented with the same physical structure. The first
demonstration implements two discrete Fabry-P{\'e}rot cavities crossing at the
centre. The configuration allows the control not only of the resonance
frequencies, but also a whole band gap and transmission band of frequencies
between the directly excited diagonal and a higher frequency band. The second
experiment demonstrates appearance of discrete Whispering Gallery Modes on a
circle of re-entrant post. With the introduction of an artificial "scatterer",
we demonstrate control over the doublet mode splitting.
| physics.ins-det | we demonstrate possibilities of a large scale multipost reentrant cavity with two case studies implemented with the same physical structure the first demonstration implements two discrete fabryperot cavities crossing at the centre the configuration allows the control not only of the resonance frequencies but also a whole band gap and transmission band of frequencies between the directly excited diagonal and a higher frequency band the second experiment demonstrates appearance of discrete whispering gallery modes on a circle of reentrant post with the introduction of an artificial scatterer we demonstrate control over the doublet mode splitting | [['we', 'demonstrate', 'possibilities', 'of', 'a', 'large', 'scale', 'multipost', 'reentrant', 'cavity', 'with', 'two', 'case', 'studies', 'implemented', 'with', 'the', 'same', 'physical', 'structure', 'the', 'first', 'demonstration', 'implements', 'two', 'discrete', 'fabryperot', 'cavities', 'crossing', 'at', 'the', 'centre', 'the', 'configuration', 'allows', 'the', 'control', 'not', 'only', 'of', 'the', 'resonance', 'frequencies', 'but', 'also', 'a', 'whole', 'band', 'gap', 'and', 'transmission', 'band', 'of', 'frequencies', 'between', 'the', 'directly', 'excited', 'diagonal', 'and', 'a', 'higher', 'frequency', 'band', 'the', 'second', 'experiment', 'demonstrates', 'appearance', 'of', 'discrete', 'whispering', 'gallery', 'modes', 'on', 'a', 'circle', 'of', 'reentrant', 'post', 'with', 'the', 'introduction', 'of', 'an', 'artificial', 'scatterer', 'we', 'demonstrate', 'control', 'over', 'the', 'doublet', 'mode', 'splitting']] | [-0.18636293490417302, 0.12173048164465734, -0.04833819565802562, -0.03235383725872165, -0.09755459079813016, -0.16477702647496603, 0.07303591728774145, 0.4073989595139497, -0.2384594768922972, -0.30597356441185664, 0.05850144522509685, -0.22425124048466769, -0.13463566099342547, 0.18345057867271336, 0.024867960090111746, 0.022884560768541538, 0.047914644316034885, 0.008339788039263926, -0.03838390167465581, -0.12032179985881636, 0.3016770057968403, 0.026927413614956958, 0.3375096117391398, 0.04133009262824137, 0.09948763802255454, -0.0061716469396886076, 0.06216631450592295, -0.05971774278992885, -0.08781124312969807, 0.08400415458569402, 0.2274511865585258, -0.001960244114161469, 0.294504282371092, -0.39901695492628375, -0.1634937354804654, 0.03901525277056192, 0.15503854646445497, 0.14896463902765197, -0.03521234278052457, -0.3038828806044828, -0.002500804641136998, -0.13130122650610773, -0.1547609988011812, -0.0037136170032777286, -0.05464671652175878, -0.041087337056983655, -0.2418068415417924, 0.026256003081002028, 0.03803334915765414, 0.09508744642922753, -0.07294051420207037, -0.08181945340413796, -0.03727273332739347, 0.09290005618118141, -0.016925118937108078, -0.05629273881939681, 0.13787282971959364, -0.06968205333074654, -0.1431301216741926, 0.3796418648409216, -0.09687534714803885, -0.12168103627076274, 0.19447379485753022, -0.2207622068296922, -0.04420746930286681, 0.15920961785718407, 0.13256708311015053, 0.07295504054544788, -0.05493924987784244, 0.04706263550875806, -0.012032432756141612, 0.24335813889966199, 0.11732148971212537, 0.06062420988945585, 0.2453261375672331, 0.18073884256943865, 0.05044989193740644, 0.17029903268343524, -0.14215909154767073, -0.053354904584978755, -0.30935468189418314, -0.12933870795133867, -0.20650293467364175, -0.023584684609331337, -0.051239405140758636, -0.17175257456194806, 0.4756793357039753, 0.06348447081583895, 0.20418397319552145, -0.007990619197095695, 0.29689933277274433, 0.11995973794868117, 0.11292351030095137, 0.02872007933053139, 0.28700274593735997, 0.1114824996280827, 0.09375342501106819, -0.3027661015307163, -0.08007895982039995, -0.015524615822850089] |
1,802.04491 | Slice as an Evolutionary Service: Genetic Optimization for Inter-Slice
Resource Management in 5G Networks | In the context of Fifth Generation (5G) mobile networks, the concept of
"Slice as a Service" (SlaaS) promotes mobile network operators to flexibly
share infrastructures with mobile service providers and stakeholders. However,
it also challenges with an emerging demand for efficient online algorithms to
optimize the request-and-decision-based inter-slice resource management
strategy. Based on genetic algorithms, this paper presents a novel online
optimizer that efficiently approaches towards the ideal slicing strategy with
maximized long-term network utility. The proposed method encodes slicing
strategies into binary sequences to cope with the request-and-decision
mechanism. It requires no a priori knowledge about the traffic/utility models,
and therefore supports heterogeneous slices, while providing solid
effectiveness, good robustness against non-stationary service scenarios, and
high scalability.
| cs.NE | in the context of fifth generation 5g mobile networks the concept of slice as a service slaas promotes mobile network operators to flexibly share infrastructures with mobile service providers and stakeholders however it also challenges with an emerging demand for efficient online algorithms to optimize the requestanddecisionbased interslice resource management strategy based on genetic algorithms this paper presents a novel online optimizer that efficiently approaches towards the ideal slicing strategy with maximized longterm network utility the proposed method encodes slicing strategies into binary sequences to cope with the requestanddecision mechanism it requires no a priori knowledge about the trafficutility models and therefore supports heterogeneous slices while providing solid effectiveness good robustness against nonstationary service scenarios and high scalability | [['in', 'the', 'context', 'of', 'fifth', 'generation', '5g', 'mobile', 'networks', 'the', 'concept', 'of', 'slice', 'as', 'a', 'service', 'slaas', 'promotes', 'mobile', 'network', 'operators', 'to', 'flexibly', 'share', 'infrastructures', 'with', 'mobile', 'service', 'providers', 'and', 'stakeholders', 'however', 'it', 'also', 'challenges', 'with', 'an', 'emerging', 'demand', 'for', 'efficient', 'online', 'algorithms', 'to', 'optimize', 'the', 'requestanddecisionbased', 'interslice', 'resource', 'management', 'strategy', 'based', 'on', 'genetic', 'algorithms', 'this', 'paper', 'presents', 'a', 'novel', 'online', 'optimizer', 'that', 'efficiently', 'approaches', 'towards', 'the', 'ideal', 'slicing', 'strategy', 'with', 'maximized', 'longterm', 'network', 'utility', 'the', 'proposed', 'method', 'encodes', 'slicing', 'strategies', 'into', 'binary', 'sequences', 'to', 'cope', 'with', 'the', 'requestanddecision', 'mechanism', 'it', 'requires', 'no', 'a', 'priori', 'knowledge', 'about', 'the', 'trafficutility', 'models', 'and', 'therefore', 'supports', 'heterogeneous', 'slices', 'while', 'providing', 'solid', 'effectiveness', 'good', 'robustness', 'against', 'nonstationary', 'service', 'scenarios', 'and', 'high', 'scalability']] | [-0.15738947624994212, -0.030701380266819206, -0.026687833353909746, 0.04783930926350877, -0.11582622713237804, -0.22629611109170997, 0.10420811655338887, 0.43755122752892867, -0.2710557408843255, -0.32279402457112283, 0.087594913715995, -0.21691231298047983, -0.18131078931241573, 0.1607470455887858, -0.15254758039368185, 0.09355737619396103, 0.09384362066696651, -0.021322653195902444, -0.001369502389264342, -0.27909103315732064, 0.30239726107142734, 0.11454780653257969, 0.4299243641363686, 0.0602913987250966, 0.09771135582572274, 0.006823571108837138, -0.05141608173991635, -0.03781772212313259, -0.05277726808063769, 0.20467351526920602, 0.3373445546628334, 0.2695052951876597, 0.38068260437106355, -0.457466631768304, -0.21131136078844992, 0.0935137797220561, 0.1567108777245474, 0.048069030767421056, -0.05987637280588643, -0.30067574731666563, 0.1299752851211866, -0.23884623353124448, -0.11661367419813025, -0.11378870802429064, -0.03443700069839364, 0.030368500824694996, -0.33650065049234973, -0.04489998814160731, -0.016489743536926414, 0.008143465439053742, -0.07961695835304756, -0.05920953154277971, -0.0006456658195116018, 0.17161722804762816, 0.05000558806779353, 0.01719349516931464, 0.14461056212435083, -0.14332202085694135, -0.20292486863112763, 0.3905414771942193, 0.015997111468510537, -0.2055502287775948, 0.17814967555214503, 0.026774427244897214, -0.16687635780034357, 0.09853135912041915, 0.24311017852864766, 0.06993808333860024, -0.2021882211250302, 0.013540405431341608, 0.03415335516298288, 0.179909317317141, 0.022729858051446315, 0.0858330839331948, 0.22062874990597106, 0.2814989091252516, 0.1836545394994972, 0.12283844954187148, -0.0188377166938919, -0.13985616396785827, -0.15976574988382167, -0.1393286883300007, -0.1752481129951775, -0.037179427441993824, -0.12672438676504258, -0.1537253240188747, 0.3827574247363628, 0.1857041457908947, 0.10146537332452442, 0.11325272955122943, 0.4208378434311925, 0.0064191745212219915, 0.10964691975223423, 0.16084117649466192, 0.09801972524279304, -0.037315271813177356, 0.2595300842464591, -0.1746695021968008, 0.14084170990942144, 0.022947798654633134] |
1,802.04492 | Information scrambling in chaotic systems with dissipation | Chaotic dynamics in closed local quantum systems scrambles quantum
information, which is manifested quantitatively in the decay of the
out-of-time-ordered correlators (OTOC) of local operators. How is information
scrambling affected when the system is coupled to the environment and suffers
from dissipation? In this paper, we address this question by defining a
dissipative version of OTOC and numerically study its behavior in a
prototypical chaotic quantum chain in the presence of dissipation. We find that
dissipation leads to not only the overall decay of the scrambled information
due to leaking, but also structural changes so that the `information light
cone' can only reach a finite distance even when the effect of overall decay is
removed. Based on this observation we conjecture a modified version of the
Lieb-Robinson bound in dissipative systems.
| quant-ph cond-mat.stat-mech cond-mat.str-el hep-th | chaotic dynamics in closed local quantum systems scrambles quantum information which is manifested quantitatively in the decay of the outoftimeordered correlators otoc of local operators how is information scrambling affected when the system is coupled to the environment and suffers from dissipation in this paper we address this question by defining a dissipative version of otoc and numerically study its behavior in a prototypical chaotic quantum chain in the presence of dissipation we find that dissipation leads to not only the overall decay of the scrambled information due to leaking but also structural changes so that the information light cone can only reach a finite distance even when the effect of overall decay is removed based on this observation we conjecture a modified version of the liebrobinson bound in dissipative systems | [['chaotic', 'dynamics', 'in', 'closed', 'local', 'quantum', 'systems', 'scrambles', 'quantum', 'information', 'which', 'is', 'manifested', 'quantitatively', 'in', 'the', 'decay', 'of', 'the', 'outoftimeordered', 'correlators', 'otoc', 'of', 'local', 'operators', 'how', 'is', 'information', 'scrambling', 'affected', 'when', 'the', 'system', 'is', 'coupled', 'to', 'the', 'environment', 'and', 'suffers', 'from', 'dissipation', 'in', 'this', 'paper', 'we', 'address', 'this', 'question', 'by', 'defining', 'a', 'dissipative', 'version', 'of', 'otoc', 'and', 'numerically', 'study', 'its', 'behavior', 'in', 'a', 'prototypical', 'chaotic', 'quantum', 'chain', 'in', 'the', 'presence', 'of', 'dissipation', 'we', 'find', 'that', 'dissipation', 'leads', 'to', 'not', 'only', 'the', 'overall', 'decay', 'of', 'the', 'scrambled', 'information', 'due', 'to', 'leaking', 'but', 'also', 'structural', 'changes', 'so', 'that', 'the', 'information', 'light', 'cone', 'can', 'only', 'reach', 'a', 'finite', 'distance', 'even', 'when', 'the', 'effect', 'of', 'overall', 'decay', 'is', 'removed', 'based', 'on', 'this', 'observation', 'we', 'conjecture', 'a', 'modified', 'version', 'of', 'the', 'liebrobinson', 'bound', 'in', 'dissipative', 'systems']] | [-0.16697113960448168, 0.16660978931592393, -0.13375909776490835, 0.09485765946460248, -0.01611582400767801, -0.15532486323793313, 0.028560200295560348, 0.2814881330736351, -0.3253196110195331, -0.23622284714445357, 0.10106820669309556, -0.2851489433816115, -0.18028152419453244, 0.18634744358199243, -0.06255885890421976, 0.04192157280195917, 0.06395043934098239, 0.0595901085948927, -0.07357881630003055, -0.2500353621866355, 0.31741687229511023, 0.0578035302557947, 0.2549470924782986, 0.0991544717609996, 0.05178063182792989, 0.0037013043788126634, 0.007997840849099724, 0.03317595012343794, -0.12298836659709834, 0.08389378798987142, 0.16842221949277944, 0.0881798476334448, 0.2579317155884195, -0.41807204763625416, -0.20105083449743688, 0.12169131233164941, 0.19635402266192073, 0.1614551988407216, -0.02800567841374152, -0.3048070920986756, 0.05069936939181035, -0.1475484885474425, -0.13665161573662216, -0.06179136098966799, 0.016326792097387424, -0.033466757335593456, -0.2320679798011334, 0.13849426501493667, 0.10836468729410918, 0.040593006011838, -0.003205987958074014, 0.046899135883023094, -0.014444315080879299, 0.11551317443070536, 0.021146702496619284, 0.006971438367360534, 0.1717402845983685, -0.1459835933660022, -0.09635690311041042, 0.3490783959584495, -0.09859840118838119, -0.2064689567987096, 0.15872801360780842, -0.17532643658719524, -0.11518254073848593, 0.10592795361743401, 0.1619082425600131, 0.0901004648838505, -0.1699956456558754, 0.09476785206694498, -0.018884479004235667, 0.19626251178729626, 0.023715003301169126, 0.1407686257166148, 0.20095091612782073, 0.1369235311876556, 0.05133736983496155, 0.18403701094256444, -0.05222167192517517, -0.17004012214801922, -0.28399292966137635, -0.14215807541085138, -0.21440731973977376, 0.10479391376385269, -0.03712093867410422, -0.16139664596216824, 0.39653942709120404, 0.18428785843443898, 0.17493353120783586, 0.0311188378188233, 0.30139458939283803, 0.14864276299134913, 0.0574494666519454, 0.10723106463560621, 0.25817104898933463, 0.1313044400867928, 0.10097180252525075, -0.2992758203834608, 0.08614682252358873, 0.05915019253467899] |
1,802.04493 | Ratios of vector and pseudoscalar $B$ meson decay constants in the
light-cone quark model | We study the decay constants of pseudoscalar and vector $B$ meson in the
framework of light-cone quark model (LCQM). We apply the variational method to
the relativistic Hamiltonian with the Gaussian-type trial wave function to
obtain the values of $\beta$ (scale parameter). Then with the help of known
values of constituent quark masses, we obtain the numerical results for the
decay constants $f_P$ and $f_V$, respectively. We compare our numerical results
with the existing experimental data.
| hep-ph | we study the decay constants of pseudoscalar and vector b meson in the framework of lightcone quark model lcqm we apply the variational method to the relativistic hamiltonian with the gaussiantype trial wave function to obtain the values of beta scale parameter then with the help of known values of constituent quark masses we obtain the numerical results for the decay constants f_p and f_v respectively we compare our numerical results with the existing experimental data | [['we', 'study', 'the', 'decay', 'constants', 'of', 'pseudoscalar', 'and', 'vector', 'b', 'meson', 'in', 'the', 'framework', 'of', 'lightcone', 'quark', 'model', 'lcqm', 'we', 'apply', 'the', 'variational', 'method', 'to', 'the', 'relativistic', 'hamiltonian', 'with', 'the', 'gaussiantype', 'trial', 'wave', 'function', 'to', 'obtain', 'the', 'values', 'of', 'beta', 'scale', 'parameter', 'then', 'with', 'the', 'help', 'of', 'known', 'values', 'of', 'constituent', 'quark', 'masses', 'we', 'obtain', 'the', 'numerical', 'results', 'for', 'the', 'decay', 'constants', 'f_p', 'and', 'f_v', 'respectively', 'we', 'compare', 'our', 'numerical', 'results', 'with', 'the', 'existing', 'experimental', 'data']] | [-0.0638261407179137, 0.17454945659885804, -0.07135071150958538, 0.07436294181893269, -0.06853851810097694, -0.07404483676267166, 0.0966541168342034, 0.3593651506304741, -0.21204385434587797, -0.2459904283968111, 0.0036834342017148932, -0.2753045245880882, -0.07145074137796958, 0.18451076339619854, 0.09603114504367113, 0.1496334636618849, 0.07973731232651819, 0.06802453000098467, -0.12289464287770291, -0.22248523412893215, 0.34818531839797895, -0.013405723522106807, 0.19577410077055296, 0.09747166126966476, 0.029154867214771608, -0.0008624018604556719, -0.032834508971621594, -0.06835455479721228, -0.2131674274802208, 0.10920732260992129, 0.15091327666460225, 0.10901760541523496, 0.18036787359664838, -0.37292149184271695, -0.1458699752856046, 0.07723420919384807, 0.1134404848019282, 0.12250332659731308, -0.02629537728925546, -0.3119283824414015, 0.10261771840353807, -0.18166428115218877, -0.18451087519526482, -0.15720669886718194, -0.021283502137909333, 0.042596632425362865, -0.3914821621403098, 0.11789226047073802, -0.06616267738242944, -0.01589087681223949, -0.12470830487708251, -0.234919279490908, 0.016662600650452077, 0.07998810364554326, 0.16085242720786483, 0.09609276537783444, 0.0942174926151832, -0.12968822493528326, -0.1180213441948096, 0.3960015240311623, -0.11963476954959333, -0.247448191344738, 0.10780689218391974, -0.1739242189625899, -0.10313546538352966, 0.07096094309041898, 0.20304040901362896, 0.1137646738315622, -0.11074734892075261, 0.09928045463282614, -0.06534364212595392, 0.15721660609046617, 0.024508695639669894, 0.031083554849028586, 0.11076371642450492, 0.13426075862099726, -0.04859001005689303, 0.0978077400289476, -0.1048013296040396, -0.11360424446562926, -0.37659798602263134, -0.12563431777060033, -0.13050010097523532, 0.029794606281405626, -0.14525578522395033, -0.12859108133862415, 0.4271596140662829, 0.15058138741180302, 0.23688349490364394, 0.11036462121953566, 0.27509295612573625, 0.13734028794647504, 0.05874901955714449, 0.0733364811912179, 0.28213554033388694, 0.19171052027804156, 0.07392862958300005, -0.27138750614908835, -0.05183411763980985, 0.10449243610103925] |
1,802.04494 | Multiple-Modes Scanning Probe Microscopy Characterization of Copper
doped Zinc Oxide (ZnO:Cu) Thin Films | This paper presents multiple-modes Scanning Probe Microscopy (SPM) studies on
characterize resistance switching (RS), polarization rotation (PO) and surface
potential changes in copper doped ZnO (ZnO:Cu) thin films. The bipolar RS
behavior is confirmed by conductive Atomic Force Microscopy (c-AFM). The PO
with almost 180{\deg} phase angle is confirmed by using the vertical and
lateral Piezoresponse Force Microscopy (PFM). In addition, it elucidates that
obvious polarization rotation behavior can be observed in the sample with
increasing Cu concentration. Furthermore, correlation of the RS behavior with
PO behavior has been studied by performing various mode SPM measurements on the
same location. The electric field resulted from the opposite polarization
orientation are corresponded to the different resistance states. It is found
that the region with the polarization in downward direction has low resistance
state (LRS), whereas the region with upward polarization has high resistance
state (HRS). In addition, the Piezoresponse Force Spectroscopy (PFS) and
Switching Spectroscopy PFM (SS-PFM) measurements further confirm that the
existence of the built-in field due to the uncomplemented polarization may
affect the depletion region and hence contribute to the RS behavior. In
addition, Kelvin Probe Force Microscopy (KPFM) results show that, when
ZnO-based thin films is subjected to negative and then followed by positive
sample bias, injection charge limit current is dominated.
| cond-mat.mtrl-sci | this paper presents multiplemodes scanning probe microscopy spm studies on characterize resistance switching rs polarization rotation po and surface potential changes in copper doped zno znocu thin films the bipolar rs behavior is confirmed by conductive atomic force microscopy cafm the po with almost 180deg phase angle is confirmed by using the vertical and lateral piezoresponse force microscopy pfm in addition it elucidates that obvious polarization rotation behavior can be observed in the sample with increasing cu concentration furthermore correlation of the rs behavior with po behavior has been studied by performing various mode spm measurements on the same location the electric field resulted from the opposite polarization orientation are corresponded to the different resistance states it is found that the region with the polarization in downward direction has low resistance state lrs whereas the region with upward polarization has high resistance state hrs in addition the piezoresponse force spectroscopy pfs and switching spectroscopy pfm sspfm measurements further confirm that the existence of the builtin field due to the uncomplemented polarization may affect the depletion region and hence contribute to the rs behavior in addition kelvin probe force microscopy kpfm results show that when znobased thin films is subjected to negative and then followed by positive sample bias injection charge limit current is dominated | [['this', 'paper', 'presents', 'multiplemodes', 'scanning', 'probe', 'microscopy', 'spm', 'studies', 'on', 'characterize', 'resistance', 'switching', 'rs', 'polarization', 'rotation', 'po', 'and', 'surface', 'potential', 'changes', 'in', 'copper', 'doped', 'zno', 'znocu', 'thin', 'films', 'the', 'bipolar', 'rs', 'behavior', 'is', 'confirmed', 'by', 'conductive', 'atomic', 'force', 'microscopy', 'cafm', 'the', 'po', 'with', 'almost', '180deg', 'phase', 'angle', 'is', 'confirmed', 'by', 'using', 'the', 'vertical', 'and', 'lateral', 'piezoresponse', 'force', 'microscopy', 'pfm', 'in', 'addition', 'it', 'elucidates', 'that', 'obvious', 'polarization', 'rotation', 'behavior', 'can', 'be', 'observed', 'in', 'the', 'sample', 'with', 'increasing', 'cu', 'concentration', 'furthermore', 'correlation', 'of', 'the', 'rs', 'behavior', 'with', 'po', 'behavior', 'has', 'been', 'studied', 'by', 'performing', 'various', 'mode', 'spm', 'measurements', 'on', 'the', 'same', 'location', 'the', 'electric', 'field', 'resulted', 'from', 'the', 'opposite', 'polarization', 'orientation', 'are', 'corresponded', 'to', 'the', 'different', 'resistance', 'states', 'it', 'is', 'found', 'that', 'the', 'region', 'with', 'the', 'polarization', 'in', 'downward', 'direction', 'has', 'low', 'resistance', 'state', 'lrs', 'whereas', 'the', 'region', 'with', 'upward', 'polarization', 'has', 'high', 'resistance', 'state', 'hrs', 'in', 'addition', 'the', 'piezoresponse', 'force', 'spectroscopy', 'pfs', 'and', 'switching', 'spectroscopy', 'pfm', 'sspfm', 'measurements', 'further', 'confirm', 'that', 'the', 'existence', 'of', 'the', 'builtin', 'field', 'due', 'to', 'the', 'uncomplemented', 'polarization', 'may', 'affect', 'the', 'depletion', 'region', 'and', 'hence', 'contribute', 'to', 'the', 'rs', 'behavior', 'in', 'addition', 'kelvin', 'probe', 'force', 'microscopy', 'kpfm', 'results', 'show', 'that', 'when', 'znobased', 'thin', 'films', 'is', 'subjected', 'to', 'negative', 'and', 'then', 'followed', 'by', 'positive', 'sample', 'bias', 'injection', 'charge', 'limit', 'current', 'is', 'dominated']] | [-0.15088431494957613, 0.16264304875050772, -0.07409227249855307, -0.02770495297116153, -0.038955768405245575, -0.16871513815010797, 0.05364061234695968, 0.4372822454400326, -0.2702805774593551, -0.30242056905471243, 0.039133833348532446, -0.3099637076328618, -0.1230274568106367, 0.18835650562164438, -0.005835753665912345, 0.008083654668164644, -0.039486978082817065, -0.0666386283575579, -0.0233308864460095, -0.16122300384627403, 0.24626328826526278, 0.06956048548099161, 0.3754038616092307, 0.06572403582556287, 0.056666872584361566, 0.012368986602793907, 0.04172986145284324, 0.10439974893903263, -0.12608840103078625, 0.01619506062683021, 0.20578009824425927, -0.0696718123044049, 0.17237192249590172, -0.4667748765023988, -0.2080691914979211, 0.009480707555082343, 0.13760717697288544, 0.10985070496727603, -0.10168655971371232, -0.24625220974719267, 0.07220611193254503, -0.06275092088836005, -0.14827517713332644, -0.0734286084552536, 0.018165849365661263, 0.011809238865578048, -0.23797702320748634, 0.11636673882734817, 0.018412303058168208, 0.13755034022645352, -0.11510338507671382, -0.09658507557209808, -0.07838246511883526, 0.07694672048481306, 0.09666609304887133, 0.11119307234430764, 0.21862298909338637, -0.09317414521265932, -0.10048877423221438, 0.27194975011767775, -0.06918234227196764, -0.09794029590789613, 0.16327846857845923, -0.24674414726796215, -0.012060693804034744, 0.1723920225041171, 0.0869838874721506, 0.11154111675008642, -0.15187588338162192, 0.0509680423609849, 0.03157628711068154, 0.21742817453882643, 0.15142486641235964, 0.03137425118248403, 0.22039835081553796, 0.1649479191223413, 0.042853947339181575, 0.1388072124425488, -0.21666306852113823, -0.008129239021669286, -0.19343257450568052, -0.1600892233045798, -0.14473381873584754, 0.06569863199759188, -0.046822368079551036, -0.13457146419885574, 0.3542036562939415, 0.10720290600468663, 0.155829451627321, -0.06873952813048632, 0.33296197936367333, 0.08490363326680107, 0.09627043165729988, -0.0164174599323789, 0.32551252633713607, 0.17624047664737444, 0.17096615399732998, -0.31746226500505537, 0.16525718680158819, -0.0468143955088426] |
1,802.04495 | The cosmic aberration drift: proposal for a real-time detection of our
acceleration through space | Our proper acceleration with respect to the Cosmic Microwave Background
results in a real-time change of the angular position of distant extragalactic
sources. The cosmological component of this aberration drift signal, the
non-inertial motion generated by the large-scale distribution of matter, can in
principle be detected by future high-precision astrometric experiments. It will
provide interesting consistency tests of the standard model of cosmology, set
independent constraints on the amplitude of the Hubble constant and the linear
growth rate of cosmic structures, and be instrumental in searching for evidence
of new physics beyond the standard model. We present the formalism of this
novel cosmological test, discuss the physics to which it is sensitive and show
simulated forecasts of the accuracy with which it can be implemented.
| astro-ph.CO | our proper acceleration with respect to the cosmic microwave background results in a realtime change of the angular position of distant extragalactic sources the cosmological component of this aberration drift signal the noninertial motion generated by the largescale distribution of matter can in principle be detected by future highprecision astrometric experiments it will provide interesting consistency tests of the standard model of cosmology set independent constraints on the amplitude of the hubble constant and the linear growth rate of cosmic structures and be instrumental in searching for evidence of new physics beyond the standard model we present the formalism of this novel cosmological test discuss the physics to which it is sensitive and show simulated forecasts of the accuracy with which it can be implemented | [['our', 'proper', 'acceleration', 'with', 'respect', 'to', 'the', 'cosmic', 'microwave', 'background', 'results', 'in', 'a', 'realtime', 'change', 'of', 'the', 'angular', 'position', 'of', 'distant', 'extragalactic', 'sources', 'the', 'cosmological', 'component', 'of', 'this', 'aberration', 'drift', 'signal', 'the', 'noninertial', 'motion', 'generated', 'by', 'the', 'largescale', 'distribution', 'of', 'matter', 'can', 'in', 'principle', 'be', 'detected', 'by', 'future', 'highprecision', 'astrometric', 'experiments', 'it', 'will', 'provide', 'interesting', 'consistency', 'tests', 'of', 'the', 'standard', 'model', 'of', 'cosmology', 'set', 'independent', 'constraints', 'on', 'the', 'amplitude', 'of', 'the', 'hubble', 'constant', 'and', 'the', 'linear', 'growth', 'rate', 'of', 'cosmic', 'structures', 'and', 'be', 'instrumental', 'in', 'searching', 'for', 'evidence', 'of', 'new', 'physics', 'beyond', 'the', 'standard', 'model', 'we', 'present', 'the', 'formalism', 'of', 'this', 'novel', 'cosmological', 'test', 'discuss', 'the', 'physics', 'to', 'which', 'it', 'is', 'sensitive', 'and', 'show', 'simulated', 'forecasts', 'of', 'the', 'accuracy', 'with', 'which', 'it', 'can', 'be', 'implemented']] | [-0.09424424169957638, 0.11537078830786049, -0.09834755384922028, 0.07266362101119012, -0.09782164082676172, -0.08045991499349475, -0.005296774245798588, 0.33349101528152825, -0.27615177987143397, -0.35059364922577513, 0.09466315942909569, -0.24092703552683814, -0.06415196351706981, 0.2508694371692836, -0.0046695792078971865, 0.05254888232797384, 0.08177806029096246, 0.011522704659262672, -0.02812136372481473, -0.2617651685979217, 0.2606226563937962, 0.16795173782855272, 0.2549905966036022, -0.006442298948764801, 0.1221570269651711, -0.0316363462395966, -0.11957947868853808, 0.050072486445307735, -0.12876739648892543, 0.0958737961538136, 0.19057948654517531, 0.18742989830154694, 0.20922552701458336, -0.3864393969327211, -0.25275346475094557, 0.11096790513396262, 0.09707395666092634, 0.130859061839059, -0.07428980441112071, -0.33318981029093264, 0.03461061340337619, -0.14095318761467934, -0.15069320071861148, -0.05873907445929945, -0.01994199112057686, 0.03269648832315579, -0.24777857688441873, 0.13096434970758855, 0.01844763633236289, 0.013958886161446572, -0.05374668798595667, -0.0625658137947321, 0.03431013051606715, 0.09255928913876414, 0.05484879843099043, 0.061091543172369714, 0.14627451939880848, -0.12558551840111612, -0.12144347408041357, 0.4281374113559723, -0.12184901184262707, -0.1671681899484247, 0.1427626096047461, -0.2008652400150895, -0.15253899383731187, 0.080482326624915, 0.20050816247612238, 0.07188841000944377, -0.18090260610729456, 0.09460029976302758, 0.014252614706754685, 0.16681381850503385, 0.04463593726791441, 0.04635007910057903, 0.3052209027484059, 0.16341368075460194, 0.05598160817287862, 0.08154485874902458, -0.15568651268444955, -0.030582944028079508, -0.36422353895008563, -0.12938379234055172, -0.15097399063780903, 0.034164755307137966, -0.1466811645735288, -0.14735591550497337, 0.38594474509358406, 0.20905034487694502, 0.14992098113149405, 0.0174979215990752, 0.3347928391993046, 0.07133952130761463, 0.051240328648127616, 0.029392883175984024, 0.33528365226089957, 0.09239554246142506, 0.0769287761002779, -0.2379025012999773, 0.05244879188761115, -0.021055714704096316] |
1,802.04496 | Effect of support on the vanadyl oxygen abstraction in supported vanadia | Supported vanadia catalysts are modeled within the cluster DFT approach to
get an insight into the mechanism in which the support affects the activity of
vanadia in the oxidation processes. The energy of the V=O group dissociation
chosen as a descriptor of the oxidation activity is estimated using two aligned
divanadate V2O3(OH)4 particles at various distances. Separation between
particles allows to imitate (i) the various supporting materials (e.g. TiO2,
SiO2, etc.), and (ii) the coverage of vanadia on a particular support. A
substantial compensation of the energy loss upon the vanadyl oxygen abstraction
via bonding to the vanadyl oxygen of neighboring vanadate particle has been
predicted. On account of such compensation the overall energy of the V=O
dissociation reaches its minimal value of 36 kcal/mol (dropping from maximum of
142 kcal/mol) at small separation of 3 {\AA} between dimers when the nearest
vanadyl oxygen occupies a bridge V-O-V position. For dimers separated by about
4 {\AA}, the dissociation energy achieves its maximal value for isolated dimers
of about 143 kcal/mol. Thus, these findings allows one to conclude that the
oxygen mobility is a result of a compensation effect in a chain-like bonding
between neighboring vanadyl groups on the surface of support.
| cond-mat.mtrl-sci | supported vanadia catalysts are modeled within the cluster dft approach to get an insight into the mechanism in which the support affects the activity of vanadia in the oxidation processes the energy of the vo group dissociation chosen as a descriptor of the oxidation activity is estimated using two aligned divanadate v2o3oh4 particles at various distances separation between particles allows to imitate i the various supporting materials eg tio2 sio2 etc and ii the coverage of vanadia on a particular support a substantial compensation of the energy loss upon the vanadyl oxygen abstraction via bonding to the vanadyl oxygen of neighboring vanadate particle has been predicted on account of such compensation the overall energy of the vo dissociation reaches its minimal value of 36 kcalmol dropping from maximum of 142 kcalmol at small separation of 3 aa between dimers when the nearest vanadyl oxygen occupies a bridge vov position for dimers separated by about 4 aa the dissociation energy achieves its maximal value for isolated dimers of about 143 kcalmol thus these findings allows one to conclude that the oxygen mobility is a result of a compensation effect in a chainlike bonding between neighboring vanadyl groups on the surface of support | [['supported', 'vanadia', 'catalysts', 'are', 'modeled', 'within', 'the', 'cluster', 'dft', 'approach', 'to', 'get', 'an', 'insight', 'into', 'the', 'mechanism', 'in', 'which', 'the', 'support', 'affects', 'the', 'activity', 'of', 'vanadia', 'in', 'the', 'oxidation', 'processes', 'the', 'energy', 'of', 'the', 'vo', 'group', 'dissociation', 'chosen', 'as', 'a', 'descriptor', 'of', 'the', 'oxidation', 'activity', 'is', 'estimated', 'using', 'two', 'aligned', 'divanadate', 'v2o3oh4', 'particles', 'at', 'various', 'distances', 'separation', 'between', 'particles', 'allows', 'to', 'imitate', 'i', 'the', 'various', 'supporting', 'materials', 'eg', 'tio2', 'sio2', 'etc', 'and', 'ii', 'the', 'coverage', 'of', 'vanadia', 'on', 'a', 'particular', 'support', 'a', 'substantial', 'compensation', 'of', 'the', 'energy', 'loss', 'upon', 'the', 'vanadyl', 'oxygen', 'abstraction', 'via', 'bonding', 'to', 'the', 'vanadyl', 'oxygen', 'of', 'neighboring', 'vanadate', 'particle', 'has', 'been', 'predicted', 'on', 'account', 'of', 'such', 'compensation', 'the', 'overall', 'energy', 'of', 'the', 'vo', 'dissociation', 'reaches', 'its', 'minimal', 'value', 'of', '36', 'kcalmol', 'dropping', 'from', 'maximum', 'of', '142', 'kcalmol', 'at', 'small', 'separation', 'of', '3', 'aa', 'between', 'dimers', 'when', 'the', 'nearest', 'vanadyl', 'oxygen', 'occupies', 'a', 'bridge', 'vov', 'position', 'for', 'dimers', 'separated', 'by', 'about', '4', 'aa', 'the', 'dissociation', 'energy', 'achieves', 'its', 'maximal', 'value', 'for', 'isolated', 'dimers', 'of', 'about', '143', 'kcalmol', 'thus', 'these', 'findings', 'allows', 'one', 'to', 'conclude', 'that', 'the', 'oxygen', 'mobility', 'is', 'a', 'result', 'of', 'a', 'compensation', 'effect', 'in', 'a', 'chainlike', 'bonding', 'between', 'neighboring', 'vanadyl', 'groups', 'on', 'the', 'surface', 'of', 'support']] | [-0.09625788958715134, 0.12850329835014945, -0.027535301230698077, 0.033526996250063106, 0.040607155544037495, -0.1288565444600904, 0.13428534219397148, 0.41394158796964203, -0.2430121087651681, -0.34520393013766965, -0.001276595114926859, -0.3240705500639116, -0.05794253719306022, 0.10854210545035108, 0.005792225810497925, -0.05437652699195373, 0.03349297099405123, 0.01892407779024923, -0.05613965223468466, -0.1999387967788694, 0.24360635828626945, 0.09772937576843416, 0.2780803620420986, 0.14535086917873452, 0.05504488749850785, 0.013333863534276659, 0.037963300917634564, -0.023555147108252173, -0.12679085560072356, 0.16222490707967602, 0.21638538859826723, 0.022701636600266, 0.2665133138815229, -0.42047740307744197, -0.19175458930423436, 0.013081727453493444, 0.12047060498060722, 0.10368420076193803, -0.05173403633016644, -0.2483366459991839, 0.07219508119002359, -0.13106372296206428, -0.11901257060299716, 0.011453005330211216, 0.019834451486421493, 0.03780685106658578, -0.24910943030412472, 0.08204865546887694, 0.04647982431208275, 0.1063905976836724, -0.13436499091471316, -0.16242538248633395, -0.15291809510959115, 0.12853361644923111, 0.004346021479136081, 0.030961821120742465, 0.20752801462404205, -0.0774905381223477, -0.0708766989924725, 0.4130421647399514, -0.04274012376062909, -0.1114737743900237, 0.22258361390365952, -0.10606819659386102, -0.07893200936825506, 0.21301707808611606, 0.12465943246155546, 0.0765477944067188, -0.13146113207595642, 0.034071752057122956, 0.016571745116160667, 0.19657406370487795, 0.10174462509378979, 0.029898245114571037, 0.2097304470055554, 0.20349742034356574, 0.06839106198231779, 0.1015351794510331, -0.13610259185301785, -0.09867498222340704, -0.22550818405521275, -0.20556262791877492, -0.17235024743736838, 0.02768661168605164, -0.11561240974090345, -0.138684122899229, 0.3520139386858698, 0.08377239591764969, 0.2045295238494873, -0.015835907164582018, 0.21975196436183275, 0.04111191440296439, 0.09429738984850408, 0.011244967760022111, 0.242418762579579, 0.13389366216625287, 0.06333312469718266, -0.24800971962029497, 0.12598914325929916, 0.02779406146146357] |
1,802.04497 | A Dimension-Independent discriminant between distributions | Henze-Penrose divergence is a non-parametric divergence measure that can be
used to estimate a bound on the Bayes error in a binary classification problem.
In this paper, we show that a cross-match statistic based on optimal weighted
matching can be used to directly estimate Henze-Penrose divergence. Unlike an
earlier approach based on the Friedman-Rafsky minimal spanning tree statistic,
the proposed method is dimension-independent. The new approach is evaluated
using simulation and applied to real datasets to obtain Bayes error estimates.
| cs.IT math.IT math.ST stat.TH | henzepenrose divergence is a nonparametric divergence measure that can be used to estimate a bound on the bayes error in a binary classification problem in this paper we show that a crossmatch statistic based on optimal weighted matching can be used to directly estimate henzepenrose divergence unlike an earlier approach based on the friedmanrafsky minimal spanning tree statistic the proposed method is dimensionindependent the new approach is evaluated using simulation and applied to real datasets to obtain bayes error estimates | [['henzepenrose', 'divergence', 'is', 'a', 'nonparametric', 'divergence', 'measure', 'that', 'can', 'be', 'used', 'to', 'estimate', 'a', 'bound', 'on', 'the', 'bayes', 'error', 'in', 'a', 'binary', 'classification', 'problem', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'crossmatch', 'statistic', 'based', 'on', 'optimal', 'weighted', 'matching', 'can', 'be', 'used', 'to', 'directly', 'estimate', 'henzepenrose', 'divergence', 'unlike', 'an', 'earlier', 'approach', 'based', 'on', 'the', 'friedmanrafsky', 'minimal', 'spanning', 'tree', 'statistic', 'the', 'proposed', 'method', 'is', 'dimensionindependent', 'the', 'new', 'approach', 'is', 'evaluated', 'using', 'simulation', 'and', 'applied', 'to', 'real', 'datasets', 'to', 'obtain', 'bayes', 'error', 'estimates']] | [-0.019506332220043988, -0.03263886493932659, -0.1735366189852357, 0.16327317853283602, -0.11339083515922539, -0.11277773156471085, 0.0936635547914193, 0.38464141565491444, -0.23159572698641567, -0.3165080005652271, 0.13203392222349067, -0.2567260544747114, -0.17541710496443558, 0.2572989233885892, -0.1468648021807894, 0.11492358311079443, 0.10097837113426067, 0.07241925925482065, -0.07942435382283293, -0.29905860954895613, 0.29491263422823977, 0.06523297108360566, 0.3569836748763919, -0.0023323552828514948, 0.12860544428694992, -0.006744186487048864, -0.029609862770303152, 0.037614207837032156, -0.15446793521787186, 0.18325672420760383, 0.211590683562099, 0.18434758934308776, 0.2863152070960496, -0.28587995944544675, -0.19481416355120018, 0.14901009558234363, 0.15546634515048935, 0.09769639532478322, -0.0050098544554202816, -0.25694115032238185, 0.11337206060252356, -0.16232344959280454, -0.026051606734108647, -0.10967340919014532, -0.08320285452064127, -0.007625306521367748, -0.38761610628571364, 0.11322458783979528, -0.00033373404730809855, 0.04031303772935644, -0.04106764337047934, -0.14306624733144419, 0.06972540984861553, 0.09206473026424647, 0.015476767884683796, 0.11347790156141854, 0.10134160674060695, -0.029943874518539814, -0.166720695226104, 0.2942983119515702, -0.13322970483568497, -0.2696640964539256, 0.12708362306584603, -0.05681825630599633, -0.13104362510493955, 0.08959214315982536, 0.24792684079147875, 0.15169234623899683, -0.20833005891181527, 0.012815690406569047, -0.0625364113948308, 0.174786664894782, 0.04926510368240997, -0.08322626597364433, 0.09707284608157352, 0.16477787268813698, 0.11836424948414788, 0.16996235085243824, -0.1518479218822904, -0.0396129886736162, -0.2707277885172516, -0.12939428173485795, -0.2788658525561914, -0.010438655538018793, -0.12024827140248817, -0.21394112238485832, 0.32828900539316236, 0.21946137038758023, 0.1736458985164063, 0.13036093361442908, 0.2889167424174957, 0.13564444970106707, 0.059723848757857925, 0.11714533930062317, 0.22057236402179115, 0.11618273532949389, -0.03299085049075075, -0.18205457404837944, 0.09237416803662199, 0.14253260174882598] |
1,802.04498 | Hardness Results and Approximation Algorithms for the Minimum Dominating
Tree Problem | Given an undirected graph $G = (V, E)$ and a weight function $w:E \to
\mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a
minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V
\setminus U$ is adjacent to at least one vertex in $U$. The special case when
the weight function is uniform is known as the \textsc{Minimum Connected
Dominating Set} problem.
Given an undirected graph $G = (V, E)$ with some subsets of vertices called
groups, and a weight function $w:E \to \mathbb{R}$, the \textsc{Group Steiner
Tree} problem is to find a minimum weight sub-tree of $G$ which contains at
least one vertex from each group.
In this paper we show that the two problems are equivalents from
approximability perspective. This improves upon both the best known
approximation algorithm and the best inapproximability result for the
\textsc{Minimum Dominating Tree} problem. We also consider two extrema variants
of the \textsc{Minimum Dominating Tree} problem, namely, the \textsc{Minimum
Dominating Star} and the \textsc{Minimum Dominating Path} problems which ask to
find a minimum dominating star and path respectively.
| cs.CC | given an undirected graph g v e and a weight function we to mathbbr the textscminimum dominating tree problem asks to find a minimum weight subtree of g t u f such that every v in v setminus u is adjacent to at least one vertex in u the special case when the weight function is uniform is known as the textscminimum connected dominating set problem given an undirected graph g v e with some subsets of vertices called groups and a weight function we to mathbbr the textscgroup steiner tree problem is to find a minimum weight subtree of g which contains at least one vertex from each group in this paper we show that the two problems are equivalents from approximability perspective this improves upon both the best known approximation algorithm and the best inapproximability result for the textscminimum dominating tree problem we also consider two extrema variants of the textscminimum dominating tree problem namely the textscminimum dominating star and the textscminimum dominating path problems which ask to find a minimum dominating star and path respectively | [['given', 'an', 'undirected', 'graph', 'g', 'v', 'e', 'and', 'a', 'weight', 'function', 'we', 'to', 'mathbbr', 'the', 'textscminimum', 'dominating', 'tree', 'problem', 'asks', 'to', 'find', 'a', 'minimum', 'weight', 'subtree', 'of', 'g', 't', 'u', 'f', 'such', 'that', 'every', 'v', 'in', 'v', 'setminus', 'u', 'is', 'adjacent', 'to', 'at', 'least', 'one', 'vertex', 'in', 'u', 'the', 'special', 'case', 'when', 'the', 'weight', 'function', 'is', 'uniform', 'is', 'known', 'as', 'the', 'textscminimum', 'connected', 'dominating', 'set', 'problem', 'given', 'an', 'undirected', 'graph', 'g', 'v', 'e', 'with', 'some', 'subsets', 'of', 'vertices', 'called', 'groups', 'and', 'a', 'weight', 'function', 'we', 'to', 'mathbbr', 'the', 'textscgroup', 'steiner', 'tree', 'problem', 'is', 'to', 'find', 'a', 'minimum', 'weight', 'subtree', 'of', 'g', 'which', 'contains', 'at', 'least', 'one', 'vertex', 'from', 'each', 'group', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'two', 'problems', 'are', 'equivalents', 'from', 'approximability', 'perspective', 'this', 'improves', 'upon', 'both', 'the', 'best', 'known', 'approximation', 'algorithm', 'and', 'the', 'best', 'inapproximability', 'result', 'for', 'the', 'textscminimum', 'dominating', 'tree', 'problem', 'we', 'also', 'consider', 'two', 'extrema', 'variants', 'of', 'the', 'textscminimum', 'dominating', 'tree', 'problem', 'namely', 'the', 'textscminimum', 'dominating', 'star', 'and', 'the', 'textscminimum', 'dominating', 'path', 'problems', 'which', 'ask', 'to', 'find', 'a', 'minimum', 'dominating', 'star', 'and', 'path', 'respectively']] | [-0.1728741156481901, 0.09140616741362238, -0.0003706241436934067, 0.04364249573910009, -0.14807503236889166, -0.1429854208356201, 0.1076526379766532, 0.38251115570218425, -0.3728300877925703, -0.2898349056065104, 0.034491675273820466, -0.35509502100705637, -0.14699072223472393, 0.08818341166012536, -0.07027700887782509, 0.004192145677457042, 0.13543978961721315, 0.13357146383962978, 0.017135304438297527, -0.27459059245548983, 0.32067952027786417, -0.056804461304708724, 0.14743771266171152, 0.08328945148673098, 0.11645846497951506, 0.05264115921553161, 0.019702448598424887, 0.06179544506436688, -0.20658339580725207, 0.0397755065742133, 0.27416356456187146, 0.18236364411074393, 0.3125800824497884, -0.3343320304367068, -0.16020208755034512, 0.2552249253830099, 0.08377444120334451, -0.01564967916031384, 0.05616663784804191, -0.133884558515981, 0.12855349127650473, -0.0963500185401342, -0.070316552965886, 0.10448741686325204, 0.1479488571495407, -0.015608378493958443, -0.3186114678464535, -0.009166830670684419, 0.08235187519612686, -0.051053702889147116, -0.001122851774496379, -0.24041979110899703, -0.06316236938918167, 0.058799751750936755, -0.06669662470368952, 0.19306548728836478, 0.009393688817153353, -0.12935722863816623, -0.1622934791832994, 0.39404103711068544, -0.07383306072709167, -0.12744201106245573, 0.12027046720018494, -0.10329970801617466, -0.16243609848384888, 0.085245716604562, 0.11138621312802878, 0.17967428073634284, -0.1378661352227012, 0.15881066878640623, -0.12323059798527436, 0.06678427676380859, 0.11253142379234823, -0.008966036214582664, 0.10588389773575897, 0.1496402861374183, 0.2463942718886807, 0.18088573576240552, -0.008345689890264286, 0.04298825293653092, -0.30515638985118626, -0.04033735859218333, -0.20391945450929766, 0.051142781446714185, -0.14731078595671168, -0.22856520673412684, 0.41208417461080066, 0.08149480296162057, 0.2287069184963439, 0.10830943666708966, 0.20192060333355671, 0.1382275122221287, 0.024387325239131005, 0.22553556113067152, 0.0782143559215109, 0.16184570948530178, -0.08829083315249385, -0.22343915758002023, 0.04363074902682512, 0.17235588839824842] |
1,802.04499 | A Novel Scheme to Improve Lossless Image Coders by Explicit Description
of Generative Model Classes | In this study, we propose a novel scheme for systematic improvement of
lossless image compression coders from the point of view of the universal codes
in information theory. In the proposed scheme, we describe a generative model
class of images as a stochastic model. Using the Bayes codes, we are able to
construct a lossless image compression coder which is optimal under the Bayes
criterion for a model class described appropriately. Since the compression
coder is optimal for the assumed model class, we are able to focus on the
expansion of the model class. To validate the efficiency of the proposed
scheme, we construct a lossless image compression coder which achieves
approximately 19.7% reduction of average coding rates of previous coders.
| cs.IT math.IT | in this study we propose a novel scheme for systematic improvement of lossless image compression coders from the point of view of the universal codes in information theory in the proposed scheme we describe a generative model class of images as a stochastic model using the bayes codes we are able to construct a lossless image compression coder which is optimal under the bayes criterion for a model class described appropriately since the compression coder is optimal for the assumed model class we are able to focus on the expansion of the model class to validate the efficiency of the proposed scheme we construct a lossless image compression coder which achieves approximately 197 reduction of average coding rates of previous coders | [['in', 'this', 'study', 'we', 'propose', 'a', 'novel', 'scheme', 'for', 'systematic', 'improvement', 'of', 'lossless', 'image', 'compression', 'coders', 'from', 'the', 'point', 'of', 'view', 'of', 'the', 'universal', 'codes', 'in', 'information', 'theory', 'in', 'the', 'proposed', 'scheme', 'we', 'describe', 'a', 'generative', 'model', 'class', 'of', 'images', 'as', 'a', 'stochastic', 'model', 'using', 'the', 'bayes', 'codes', 'we', 'are', 'able', 'to', 'construct', 'a', 'lossless', 'image', 'compression', 'coder', 'which', 'is', 'optimal', 'under', 'the', 'bayes', 'criterion', 'for', 'a', 'model', 'class', 'described', 'appropriately', 'since', 'the', 'compression', 'coder', 'is', 'optimal', 'for', 'the', 'assumed', 'model', 'class', 'we', 'are', 'able', 'to', 'focus', 'on', 'the', 'expansion', 'of', 'the', 'model', 'class', 'to', 'validate', 'the', 'efficiency', 'of', 'the', 'proposed', 'scheme', 'we', 'construct', 'a', 'lossless', 'image', 'compression', 'coder', 'which', 'achieves', 'approximately', '197', 'reduction', 'of', 'average', 'coding', 'rates', 'of', 'previous', 'coders']] | [-0.097964183152711, -0.028577945749313872, -0.10169179231882834, 0.058808601843308626, -0.017464081048657577, -0.17231365588054923, 0.08117037852514104, 0.42243462451541225, -0.29464318963491226, -0.2687306487932801, 0.09667991795711804, -0.21664490071625625, -0.17794441369416053, 0.20883372909204712, -0.13415631686899165, 0.12172876396947656, 0.043370440307896864, 0.052483796834760954, -0.08765011550935585, -0.282897870387297, 0.27942358405706436, 0.12362102859399536, 0.4027706894192321, -0.039999613363761455, 0.157669568080241, -0.028466012744494708, -0.04643417546171541, -0.018439980239168673, -0.12269939545711334, 0.17439157649112697, 0.26591469289557934, 0.1773842420190388, 0.2561979804010985, -0.3290059178728949, -0.2611427842369996, 0.0610501527909405, 0.09690862660048999, 0.16879833532951402, -0.06441337401182044, -0.2212894686847956, 0.1510049949952378, -0.20814854928777238, -0.014428710584213172, -0.07402462272881723, -0.0678805831140523, -0.004719767244224829, -0.35916357961567963, 0.06571904575636933, 0.09544445055513835, 0.010211376788879721, -0.08311854719284399, -0.07816589396631668, 0.09016075201548082, 0.08952366569933813, -0.016935825976158284, 0.05841742834934487, 0.1018277842990192, -0.12917129483655065, -0.12302063465549433, 0.3870871508386263, -0.07808823005896647, -0.22373334597026515, 0.11554872670233989, -0.033219275765182556, -0.10455286524774245, 0.1471839922303257, 0.24546233466864864, 0.10739404810900408, -0.15430412641863536, 0.03446695833542232, -0.07723415872343808, 0.19206833573224694, 0.06199400205057391, 0.02581513999414838, 0.11881390596501344, 0.2007660300370829, 0.024626770487809476, 0.23658009536164112, -0.142307635056132, -0.10174629418564236, -0.2999370650288241, -0.12021601436398, -0.17339977602597542, -0.010081426338639017, -0.12497017363640518, -0.1800428144325895, 0.3825326294588968, 0.2178077338617449, 0.18415090964063435, 0.12244970373970972, 0.30631886037020395, 0.07567019255597082, 0.06389445949284252, 0.12344182590561464, 0.19482288130151093, 0.09875321737683017, 0.03793487034031875, -0.1646845986092971, 0.03957581915700239, 0.1456090067705709] |
1,802.045 | Attacking Strategies and Temporal Analysis Involving Facebook Discussion
Groups | Online social network (OSN) discussion groups are exerting significant
effects on political dialogue. In the absence of access control mechanisms, any
user can contribute to any OSN thread. Individuals can exploit this
characteristic to execute targeted attacks, which increases the potential for
subsequent malicious behaviors such as phishing and malware distribution. These
kinds of actions will also disrupt bridges among the media, politicians, and
their constituencies.
For the concern of Security Management, blending malicious cyberattacks with
online social interactions has introduced a brand new challenge. In this paper
we describe our proposal for a novel approach to studying and understanding the
strategies that attackers use to spread malicious URLs across Facebook
discussion groups. We define and analyze problems tied to predicting the
potential for attacks focused on threads created by news media organizations.
We use a mix of macro static features and the micro dynamic evolution of posts
and threads to identify likely targets with greater than 90% accuracy. One of
our secondary goals is to make such predictions within a short (10 minute) time
frame. It is our hope that the data and analyses presented in this paper will
support a better understanding of attacker strategies and footprints, thereby
developing new system management methodologies in handing cyber attacks on
social networks.
| cs.SI | online social network osn discussion groups are exerting significant effects on political dialogue in the absence of access control mechanisms any user can contribute to any osn thread individuals can exploit this characteristic to execute targeted attacks which increases the potential for subsequent malicious behaviors such as phishing and malware distribution these kinds of actions will also disrupt bridges among the media politicians and their constituencies for the concern of security management blending malicious cyberattacks with online social interactions has introduced a brand new challenge in this paper we describe our proposal for a novel approach to studying and understanding the strategies that attackers use to spread malicious urls across facebook discussion groups we define and analyze problems tied to predicting the potential for attacks focused on threads created by news media organizations we use a mix of macro static features and the micro dynamic evolution of posts and threads to identify likely targets with greater than 90 accuracy one of our secondary goals is to make such predictions within a short 10 minute time frame it is our hope that the data and analyses presented in this paper will support a better understanding of attacker strategies and footprints thereby developing new system management methodologies in handing cyber attacks on social networks | [['online', 'social', 'network', 'osn', 'discussion', 'groups', 'are', 'exerting', 'significant', 'effects', 'on', 'political', 'dialogue', 'in', 'the', 'absence', 'of', 'access', 'control', 'mechanisms', 'any', 'user', 'can', 'contribute', 'to', 'any', 'osn', 'thread', 'individuals', 'can', 'exploit', 'this', 'characteristic', 'to', 'execute', 'targeted', 'attacks', 'which', 'increases', 'the', 'potential', 'for', 'subsequent', 'malicious', 'behaviors', 'such', 'as', 'phishing', 'and', 'malware', 'distribution', 'these', 'kinds', 'of', 'actions', 'will', 'also', 'disrupt', 'bridges', 'among', 'the', 'media', 'politicians', 'and', 'their', 'constituencies', 'for', 'the', 'concern', 'of', 'security', 'management', 'blending', 'malicious', 'cyberattacks', 'with', 'online', 'social', 'interactions', 'has', 'introduced', 'a', 'brand', 'new', 'challenge', 'in', 'this', 'paper', 'we', 'describe', 'our', 'proposal', 'for', 'a', 'novel', 'approach', 'to', 'studying', 'and', 'understanding', 'the', 'strategies', 'that', 'attackers', 'use', 'to', 'spread', 'malicious', 'urls', 'across', 'facebook', 'discussion', 'groups', 'we', 'define', 'and', 'analyze', 'problems', 'tied', 'to', 'predicting', 'the', 'potential', 'for', 'attacks', 'focused', 'on', 'threads', 'created', 'by', 'news', 'media', 'organizations', 'we', 'use', 'a', 'mix', 'of', 'macro', 'static', 'features', 'and', 'the', 'micro', 'dynamic', 'evolution', 'of', 'posts', 'and', 'threads', 'to', 'identify', 'likely', 'targets', 'with', 'greater', 'than', '90', 'accuracy', 'one', 'of', 'our', 'secondary', 'goals', 'is', 'to', 'make', 'such', 'predictions', 'within', 'a', 'short', '10', 'minute', 'time', 'frame', 'it', 'is', 'our', 'hope', 'that', 'the', 'data', 'and', 'analyses', 'presented', 'in', 'this', 'paper', 'will', 'support', 'a', 'better', 'understanding', 'of', 'attacker', 'strategies', 'and', 'footprints', 'thereby', 'developing', 'new', 'system', 'management', 'methodologies', 'in', 'handing', 'cyber', 'attacks', 'on', 'social', 'networks']] | [-0.15032809951237208, 0.059449769250108454, -0.05935806867596254, 0.10807556823227678, -0.1569764048601325, -0.19204782958379682, 0.12493343151257953, 0.39143335252763034, -0.2370020777942148, -0.3382569165496191, 0.07498505002080973, -0.3437877104437541, -0.18346268016178346, 0.1638209595985245, -0.11023888733558673, 0.0004821391644413179, 0.05183871620705896, 0.012357321093111509, 0.039567677288773064, -0.3065313997168867, 0.3260753628323382, 0.07132060310302549, 0.3171868964212613, 0.09728665162264458, 0.03823985479484347, 0.019510541223356104, -0.1013039656132811, -0.012693185438863266, -0.0849681890447858, 0.12961980812954452, 0.36013470990100066, 0.209423853297507, 0.3895489261727253, -0.44569934651756415, -0.2176597022543714, 0.0840542858888237, 0.14508715475347103, 0.1076394787496439, -0.03467574573993982, -0.36043009325809217, 0.12372546464387099, -0.23856099531766167, -0.1127142064506188, -0.10500309389427234, 0.008366952234009316, 0.042243680812941234, -0.1995051881234724, -0.030402208475383958, 0.02983330661993263, 0.0942290451483063, -0.01847937969679786, -0.05189323571251424, 0.01861325852278585, 0.22974872102473318, 0.0893854865686801, -0.03987449797678669, 0.22064501270739678, -0.1499718464471681, -0.17877174881814084, 0.38132855475370614, -0.000980987154589285, -0.14291352399499682, 0.19848885795294816, -0.024090603738583904, -0.15256753453904134, 0.07294640038491947, 0.31105399976335113, 0.08019983081832388, -0.17311487753888183, -0.06993090463494707, 0.00967711241221723, 0.20493413815011252, 0.0641223646520268, 0.02438376061310816, 0.2083390848140039, 0.21127888659028476, 0.0915347077040318, 0.09096340398207518, -0.03274216163956809, -0.08921180902497035, -0.1992313151911147, -0.1327072312739098, -0.09176105282484677, 0.03673619942581457, -0.07929962961813698, -0.13071313889956382, 0.406702050469148, 0.2153964549465597, 0.11161782671609577, 0.04465974785153038, 0.3262280026057577, -0.05640462502059614, 0.10151772445862901, 0.11944419724805246, 0.15581760489829938, -0.026510078555526527, 0.18763876389020193, -0.1469457206680914, 0.16329599048213084, -0.04311285171227284] |
1,802.04501 | Phishing Techniques in Mobile Devices | The rapid evolution in mobile devices and communication technology has
increased the number of mobile device users dramatically. The mobile device has
replaced many other devices and is used to perform many tasks ranging from
establishing a phone call to performing critical and sensitive tasks like money
payments. Since the mobile device is accompanying a person most of his time, it
is highly probably that it includes personal and sensitive data for that
person. The increased use of mobile devices in daily life made mobile systems
an excellent target for attacks. One of the most important attacks is phishing
attack in which an attacker tries to get the credential of the victim and
impersonate him. In this paper, analysis of different types of phishing attacks
on mobile devices is provided. Mitigation techniques - anti-phishing techniques
- are also analyzed. Assessment of each technique and a summary of its
advantages and disadvantages is provided. At the end, important steps to guard
against phishing attacks are provided. The aim of the work is to put phishing
attacks on mobile systems in light, and to make people aware of these attacks
and how to avoid them
| cs.CR | the rapid evolution in mobile devices and communication technology has increased the number of mobile device users dramatically the mobile device has replaced many other devices and is used to perform many tasks ranging from establishing a phone call to performing critical and sensitive tasks like money payments since the mobile device is accompanying a person most of his time it is highly probably that it includes personal and sensitive data for that person the increased use of mobile devices in daily life made mobile systems an excellent target for attacks one of the most important attacks is phishing attack in which an attacker tries to get the credential of the victim and impersonate him in this paper analysis of different types of phishing attacks on mobile devices is provided mitigation techniques antiphishing techniques are also analyzed assessment of each technique and a summary of its advantages and disadvantages is provided at the end important steps to guard against phishing attacks are provided the aim of the work is to put phishing attacks on mobile systems in light and to make people aware of these attacks and how to avoid them | [['the', 'rapid', 'evolution', 'in', 'mobile', 'devices', 'and', 'communication', 'technology', 'has', 'increased', 'the', 'number', 'of', 'mobile', 'device', 'users', 'dramatically', 'the', 'mobile', 'device', 'has', 'replaced', 'many', 'other', 'devices', 'and', 'is', 'used', 'to', 'perform', 'many', 'tasks', 'ranging', 'from', 'establishing', 'a', 'phone', 'call', 'to', 'performing', 'critical', 'and', 'sensitive', 'tasks', 'like', 'money', 'payments', 'since', 'the', 'mobile', 'device', 'is', 'accompanying', 'a', 'person', 'most', 'of', 'his', 'time', 'it', 'is', 'highly', 'probably', 'that', 'it', 'includes', 'personal', 'and', 'sensitive', 'data', 'for', 'that', 'person', 'the', 'increased', 'use', 'of', 'mobile', 'devices', 'in', 'daily', 'life', 'made', 'mobile', 'systems', 'an', 'excellent', 'target', 'for', 'attacks', 'one', 'of', 'the', 'most', 'important', 'attacks', 'is', 'phishing', 'attack', 'in', 'which', 'an', 'attacker', 'tries', 'to', 'get', 'the', 'credential', 'of', 'the', 'victim', 'and', 'impersonate', 'him', 'in', 'this', 'paper', 'analysis', 'of', 'different', 'types', 'of', 'phishing', 'attacks', 'on', 'mobile', 'devices', 'is', 'provided', 'mitigation', 'techniques', 'antiphishing', 'techniques', 'are', 'also', 'analyzed', 'assessment', 'of', 'each', 'technique', 'and', 'a', 'summary', 'of', 'its', 'advantages', 'and', 'disadvantages', 'is', 'provided', 'at', 'the', 'end', 'important', 'steps', 'to', 'guard', 'against', 'phishing', 'attacks', 'are', 'provided', 'the', 'aim', 'of', 'the', 'work', 'is', 'to', 'put', 'phishing', 'attacks', 'on', 'mobile', 'systems', 'in', 'light', 'and', 'to', 'make', 'people', 'aware', 'of', 'these', 'attacks', 'and', 'how', 'to', 'avoid', 'them']] | [-0.16842405783519618, 0.016207606575716318, -0.06865991931164842, 0.06002530222453899, -0.1123767918638924, -0.2885334962705901, 0.10421800418544795, 0.37279736081684367, -0.21656514250634346, -0.3266559380121256, 0.13750956829147248, -0.3644026525907404, -0.16876057571431632, 0.24265085216806664, -0.17944262978128347, 0.05738772678217017, 0.043807153068287835, 0.06163303268444359, 0.0545891768125944, -0.31670981338881543, 0.29170631721167195, 0.06847820128679899, 0.32820004180527207, 0.09209740774599952, 0.03823490387513863, 0.016880635350103933, -0.058755920697686245, -0.04845744586203501, -0.03852204079119579, 0.11837468637855655, 0.34333334295615475, 0.20183787424682947, 0.36508508512252913, -0.4776859562648997, -0.1726902343274255, 0.06595544804726283, 0.14702549822267671, 0.09911205533938239, -0.061735406216887355, -0.34987446640408476, 0.14504536243852872, -0.2500479167756376, -0.10853143296471471, -0.05605876624476925, 0.05280449415961797, 0.023527439660514602, -0.20778298410903956, -0.08566027764655791, -0.013656571999933396, 0.0776332368591498, 0.008168885557783076, -0.05698714317773415, 0.018523146625101097, 0.23500823034266136, 0.1102701114665556, -0.041099533064446914, 0.22845598051070934, -0.14634876672534458, -0.1375359057092854, 0.37962857648731496, 0.05189754778802083, -0.12080923530531569, 0.20287723019621604, -0.004383951777845855, -0.12560220021225454, 0.08453870553971897, 0.22265409606177342, 0.10159820964540409, -0.1741392688755024, -0.021837767728309376, 0.04673427178314765, 0.18139245036589616, 0.04432947783004395, 0.05723086726261761, 0.18409864926291386, 0.208181124129357, 0.11644205584188348, 0.08292564469376208, -0.09033930169175262, -0.057085825052326886, -0.180606901021528, -0.16826579764428065, -0.19937284864456006, 0.02404775701680206, -0.02452313183392069, -0.12316203131023502, 0.3874716878897896, 0.2538392038684319, 0.11314140897029669, -0.014246380743473105, 0.4064156306585716, 0.01571139794437907, 0.11517728968274765, 0.08350961311374114, 0.17491232559294562, 0.00411840158158728, 0.20863566433533012, -0.135396568564191, 0.15996586330264262, -0.027248660841205825] |
1,802.04502 | Legendre Decomposition for Tensors | We present a novel nonnegative tensor decomposition method, called Legendre
decomposition, which factorizes an input tensor into a multiplicative
combination of parameters. Thanks to the well-developed theory of information
geometry, the reconstructed tensor is unique and always minimizes the KL
divergence from an input tensor. We empirically show that Legendre
decomposition can more accurately reconstruct tensors than other nonnegative
tensor decomposition methods.
| stat.ML cs.LG | we present a novel nonnegative tensor decomposition method called legendre decomposition which factorizes an input tensor into a multiplicative combination of parameters thanks to the welldeveloped theory of information geometry the reconstructed tensor is unique and always minimizes the kl divergence from an input tensor we empirically show that legendre decomposition can more accurately reconstruct tensors than other nonnegative tensor decomposition methods | [['we', 'present', 'a', 'novel', 'nonnegative', 'tensor', 'decomposition', 'method', 'called', 'legendre', 'decomposition', 'which', 'factorizes', 'an', 'input', 'tensor', 'into', 'a', 'multiplicative', 'combination', 'of', 'parameters', 'thanks', 'to', 'the', 'welldeveloped', 'theory', 'of', 'information', 'geometry', 'the', 'reconstructed', 'tensor', 'is', 'unique', 'and', 'always', 'minimizes', 'the', 'kl', 'divergence', 'from', 'an', 'input', 'tensor', 'we', 'empirically', 'show', 'that', 'legendre', 'decomposition', 'can', 'more', 'accurately', 'reconstruct', 'tensors', 'than', 'other', 'nonnegative', 'tensor', 'decomposition', 'methods']] | [-0.071660782412378, 0.0693988525914216, -0.19062888405976758, 0.0424707832749963, -0.16775739820854318, -0.12254876266008304, -0.12301329918198227, 0.3421302961425916, -0.40925055153427586, -0.17691572947848228, 0.06734345736068433, -0.26038742498044043, -0.2603204146388077, 0.06319498240707382, -0.03671935295325614, 0.024799952794226907, 0.09839753701441711, 0.06412983514488704, -0.1589746796338248, -0.16019840421335352, 0.32359530499595546, 0.01493723489975016, 0.3243819887509509, 0.008401168536605132, 0.2019276912173917, -0.00044628545912283083, -0.09698723342209574, 0.06224836137205843, -0.10059806206247172, 0.16216627352931087, 0.23891707959269443, 0.24983446975989687, 0.23427701260774367, -0.4041122004930531, -0.15940675133418652, 0.13737055237194704, 0.1239582369885137, 0.06398800514721041, 0.040502852088754863, -0.22393968574432355, 0.15200446594145992, -0.17461167269897077, -0.040508716231993126, -0.2485865134325239, -0.0341094603101092, -0.11151017807424068, -0.3375504358311094, 0.07447439874897921, 0.04663592009174247, -0.01600647645611917, -0.11061439836668151, -0.23778987557236705, 0.002358841101428674, 0.054575669308823925, -0.0004422414124072079, 0.045925091875101166, 0.10912834564524312, -0.11142048389921265, -0.0786523531574095, 0.32045357199686186, -0.13061168143312604, -0.29880625934850785, 0.07127363737972994, -0.06549995382046027, -0.12567401529409952, 0.13406873294227425, 0.16706961949145602, 0.16152526785229002, -0.13664680252212189, 0.07359810413758931, -0.032354624055686496, 0.17553237113620965, 0.08184451452125946, -0.006034105077325817, 0.1212480450649896, 0.03389361272415807, 0.10938524991093625, 0.2138980268209707, -0.04182924010280159, -0.06505154043195709, -0.292429979349817, -0.16947477689433482, -0.29198709014622914, 0.08195169740206291, -0.1945854589385788, -0.2214856778211411, 0.42704905809894683, 0.05581189694273616, 0.18434370096656494, 0.07450010581129801, 0.3851979553939835, 0.12626910329826416, 0.09382471542865518, 0.09342918020012157, 0.1856138235438735, 0.24571785984951403, 0.020081762196270808, -0.17371780265708484, 0.02316727409619958, 0.1476605099272884] |
1,802.04503 | Certain character sums and hypergeometric series | We prove two transformations for the $p$-adic hypergeometric series which can
be described as $p$-adic analogues of a Kummer's linear transformation and a
transformation of Clausen. We first evaluate two character sums, and then
relate them to the $p$-adic hypergeometric series to deduce the
transformations. We also find another transformation for the $p$-adic
hypergeometric series from which many special values of the $p$-adic
hypergeometric series as well as finite field hypergeometric functions are
obtained.
| math.NT | we prove two transformations for the padic hypergeometric series which can be described as padic analogues of a kummers linear transformation and a transformation of clausen we first evaluate two character sums and then relate them to the padic hypergeometric series to deduce the transformations we also find another transformation for the padic hypergeometric series from which many special values of the padic hypergeometric series as well as finite field hypergeometric functions are obtained | [['we', 'prove', 'two', 'transformations', 'for', 'the', 'padic', 'hypergeometric', 'series', 'which', 'can', 'be', 'described', 'as', 'padic', 'analogues', 'of', 'a', 'kummers', 'linear', 'transformation', 'and', 'a', 'transformation', 'of', 'clausen', 'we', 'first', 'evaluate', 'two', 'character', 'sums', 'and', 'then', 'relate', 'them', 'to', 'the', 'padic', 'hypergeometric', 'series', 'to', 'deduce', 'the', 'transformations', 'we', 'also', 'find', 'another', 'transformation', 'for', 'the', 'padic', 'hypergeometric', 'series', 'from', 'which', 'many', 'special', 'values', 'of', 'the', 'padic', 'hypergeometric', 'series', 'as', 'well', 'as', 'finite', 'field', 'hypergeometric', 'functions', 'are', 'obtained']] | [-0.15024205960956327, 0.022885329178156884, -0.1958507307981317, 0.1208867955185171, -0.13843939614457054, -0.10212661820539348, -0.005750184601827248, 0.2929116470638562, -0.3891516214085592, -0.21530150658627217, 0.08007942163385451, -0.24213423680929416, -0.20199256959195072, 0.31354603648336754, -0.0437502031264877, 0.08516222532902297, -0.06071531305693694, 0.0854285768157727, -0.17901020041490728, -0.36071175507999753, 0.3399684585731577, -0.10059189931111964, 0.19095941465599714, -0.032449823829370575, 0.10772032456195636, 0.038288523499677714, -0.051291923542079086, -0.14036249869654105, -0.08321161256045909, 0.06540976517607232, 0.35292004264035337, 0.055175385120123425, 0.2565181116271462, -0.38653293418119083, -0.13859904250381766, 0.12367438491610055, 0.17146815537676416, 0.006969842351847203, 0.016045848997482855, -0.2714075879948969, -0.01627454374337921, -0.21119658170721015, -0.1467819915631333, -0.19569828572078934, 0.005183641422804244, 0.1656137089924635, -0.29666891296368997, 0.04065920858069935, 0.01505882158479024, 0.15286782663315535, -0.08542721101233887, -0.16581418687427366, 0.04226058414772253, 0.08087126180730961, 0.10137724624695005, 0.017179137095808983, 0.07515953074687638, -0.07203102007583398, -0.09613289898638991, 0.3624568317161017, -0.09240774621689893, -0.22318917930730292, 0.09239758226416402, -0.179908649794556, -0.2723165843604334, 0.03906274627975968, 0.10323745540871813, 0.13607377657113043, -0.09509222685183222, 0.05506840551980359, -0.10983932849548354, 0.064751011420142, 0.23023836707973197, -0.04136780497769045, 0.16652734031447688, -0.07590919964619584, -0.06890150037597285, 0.22861779681123742, 0.053533699026416255, -0.09965350403374917, -0.39277993258390875, -0.250912437718865, -0.15719055147928884, 0.08672476427730273, -0.12517942490671272, -0.22584964494799842, 0.4318054754387688, 0.050375070051617316, 0.1761592468435599, 0.19382490969351115, 0.15805230813251958, 0.24452290108358185, 0.04893615889690212, -0.04845630395150668, 0.051909375186959233, 0.22090762336360845, -0.005306743903437982, -0.10879324996101393, -0.0686319494947187, 0.2270971006411757] |
1,802.04504 | Flipped-Adversarial AutoEncoders | We propose a flipped-Adversarial AutoEncoder (FAAE) that simultaneously
trains a generative model G that maps an arbitrary latent code distribution to
a data distribution and an encoder E that embodies an "inverse mapping" that
encodes a data sample into a latent code vector. Unlike previous hybrid
approaches that leverage adversarial training criterion in constructing
autoencoders, FAAE minimizes re-encoding errors in the latent space and
exploits adversarial criterion in the data space. Experimental evaluations
demonstrate that the proposed framework produces sharper reconstructed images
while at the same time enabling inference that captures rich semantic
representation of data.
| cs.LG | we propose a flippedadversarial autoencoder faae that simultaneously trains a generative model g that maps an arbitrary latent code distribution to a data distribution and an encoder e that embodies an inverse mapping that encodes a data sample into a latent code vector unlike previous hybrid approaches that leverage adversarial training criterion in constructing autoencoders faae minimizes reencoding errors in the latent space and exploits adversarial criterion in the data space experimental evaluations demonstrate that the proposed framework produces sharper reconstructed images while at the same time enabling inference that captures rich semantic representation of data | [['we', 'propose', 'a', 'flippedadversarial', 'autoencoder', 'faae', 'that', 'simultaneously', 'trains', 'a', 'generative', 'model', 'g', 'that', 'maps', 'an', 'arbitrary', 'latent', 'code', 'distribution', 'to', 'a', 'data', 'distribution', 'and', 'an', 'encoder', 'e', 'that', 'embodies', 'an', 'inverse', 'mapping', 'that', 'encodes', 'a', 'data', 'sample', 'into', 'a', 'latent', 'code', 'vector', 'unlike', 'previous', 'hybrid', 'approaches', 'that', 'leverage', 'adversarial', 'training', 'criterion', 'in', 'constructing', 'autoencoders', 'faae', 'minimizes', 'reencoding', 'errors', 'in', 'the', 'latent', 'space', 'and', 'exploits', 'adversarial', 'criterion', 'in', 'the', 'data', 'space', 'experimental', 'evaluations', 'demonstrate', 'that', 'the', 'proposed', 'framework', 'produces', 'sharper', 'reconstructed', 'images', 'while', 'at', 'the', 'same', 'time', 'enabling', 'inference', 'that', 'captures', 'rich', 'semantic', 'representation', 'of', 'data']] | [-0.06521222537623779, 0.02022259490065632, -0.12322163222838313, 0.13145753957978348, -0.1292281385551217, -0.1793284426363165, 0.04394337055723994, 0.44342219658316145, -0.28595190228874323, -0.31255549082272155, -0.012392634289309142, -0.27462885582879665, -0.1890366408643463, 0.14655729205728138, -0.12456415037834837, 0.0751207988829382, 0.1449057942776445, 0.024089049933458208, -0.09666079233941291, -0.22026242435063606, 0.32475542281445674, 0.07579410140232373, 0.3881236994138328, -0.0853200782971677, 0.21751241497579657, 0.009643378692568951, -0.03448164603743021, -0.04379297799686776, -0.06495704953532143, 0.16380012531073823, 0.3014779540119312, 0.2733599356205393, 0.32818185494992363, -0.40340991900012996, -0.29855796793896344, 0.0917182294201226, 0.11852522367631556, 0.11104162096206138, -0.03545387139323578, -0.33000094174177097, 0.07029466214089064, -0.1368864042013483, 0.06047073041679718, -0.16695219193214691, -0.03977814371201901, -0.06916008837663778, -0.37129106598916234, 0.015988317333282, 0.13786399194730387, 0.014478501092682602, -0.09948873685632822, -0.08172794228159291, -0.05653438404683144, 0.11842940119846214, -0.006032903119170618, 0.1200725545966497, 0.07534866883689838, -0.14347817902002605, -0.12756186453325133, 0.2962164717315826, -0.09905080576377209, -0.21389821376050672, 0.09794141979066916, -0.03709581410211901, -0.1530813775976659, 0.14662800749052837, 0.2494483955444828, 0.08384138124404095, -0.17084606680818784, 0.05245475339708269, -0.10617447104674303, 0.19966179300700465, -0.010651632822969909, -0.00850040358941882, 0.11951606626552279, 0.18566717308325073, 0.051492837067413075, 0.1837211844776707, -0.17020128624293432, -0.05998376947176713, -0.2878007606192622, -0.10734728679201135, -0.25083088470242354, -0.06648038685201638, -0.15396299384382894, -0.16020067173346716, 0.39586480826600107, 0.2278521439881735, 0.2820112998597324, 0.13990048854611814, 0.3441020456212823, 0.016941555958461536, 0.11766989262253848, 0.15782787969526185, 0.0709747231254975, 0.05110795660725524, 0.05020298078025301, -0.150956211541529, 0.12113072552407782, 0.041526566201981197] |
1,802.04505 | Optimal and Robust Power Allocation for Visible Light Positioning
Systems under Illumination Constraints | The problem of optimal power allocation among light emitting diode (LED)
transmitters in a visible light positioning (VLP) system is considered for the
purpose of improving localization performance of visible light communication
(VLC) receivers. Specifically, the aim is to minimize the Cram\'{e}r-Rao lower
bound (CRLB) on the localization error of a VLC receiver by optimizing LED
transmission powers in the presence of practical constraints such as individual
and total power limitations and illuminance constraints. The formulated
optimization problem is shown to be convex and thus can efficiently be solved
via standard tools. We also investigate the case of imperfect knowledge of
localization parameters and develop robust power allocation algorithms by
taking into account both overall system uncertainty and individual parameter
uncertainties related to the location and orientation of the VLC receiver. In
addition, we address the total power minimization problem under predefined
accuracy requirements to obtain the most energy-efficient power allocation
vector for a given CRLB level. Numerical results illustrate the improvements in
localization performance achieved by employing the proposed optimal and robust
power allocation strategies over the conventional uniform and non-robust
approaches.
| cs.IT math.IT | the problem of optimal power allocation among light emitting diode led transmitters in a visible light positioning vlp system is considered for the purpose of improving localization performance of visible light communication vlc receivers specifically the aim is to minimize the cramerrao lower bound crlb on the localization error of a vlc receiver by optimizing led transmission powers in the presence of practical constraints such as individual and total power limitations and illuminance constraints the formulated optimization problem is shown to be convex and thus can efficiently be solved via standard tools we also investigate the case of imperfect knowledge of localization parameters and develop robust power allocation algorithms by taking into account both overall system uncertainty and individual parameter uncertainties related to the location and orientation of the vlc receiver in addition we address the total power minimization problem under predefined accuracy requirements to obtain the most energyefficient power allocation vector for a given crlb level numerical results illustrate the improvements in localization performance achieved by employing the proposed optimal and robust power allocation strategies over the conventional uniform and nonrobust approaches | [['the', 'problem', 'of', 'optimal', 'power', 'allocation', 'among', 'light', 'emitting', 'diode', 'led', 'transmitters', 'in', 'a', 'visible', 'light', 'positioning', 'vlp', 'system', 'is', 'considered', 'for', 'the', 'purpose', 'of', 'improving', 'localization', 'performance', 'of', 'visible', 'light', 'communication', 'vlc', 'receivers', 'specifically', 'the', 'aim', 'is', 'to', 'minimize', 'the', 'cramerrao', 'lower', 'bound', 'crlb', 'on', 'the', 'localization', 'error', 'of', 'a', 'vlc', 'receiver', 'by', 'optimizing', 'led', 'transmission', 'powers', 'in', 'the', 'presence', 'of', 'practical', 'constraints', 'such', 'as', 'individual', 'and', 'total', 'power', 'limitations', 'and', 'illuminance', 'constraints', 'the', 'formulated', 'optimization', 'problem', 'is', 'shown', 'to', 'be', 'convex', 'and', 'thus', 'can', 'efficiently', 'be', 'solved', 'via', 'standard', 'tools', 'we', 'also', 'investigate', 'the', 'case', 'of', 'imperfect', 'knowledge', 'of', 'localization', 'parameters', 'and', 'develop', 'robust', 'power', 'allocation', 'algorithms', 'by', 'taking', 'into', 'account', 'both', 'overall', 'system', 'uncertainty', 'and', 'individual', 'parameter', 'uncertainties', 'related', 'to', 'the', 'location', 'and', 'orientation', 'of', 'the', 'vlc', 'receiver', 'in', 'addition', 'we', 'address', 'the', 'total', 'power', 'minimization', 'problem', 'under', 'predefined', 'accuracy', 'requirements', 'to', 'obtain', 'the', 'most', 'energyefficient', 'power', 'allocation', 'vector', 'for', 'a', 'given', 'crlb', 'level', 'numerical', 'results', 'illustrate', 'the', 'improvements', 'in', 'localization', 'performance', 'achieved', 'by', 'employing', 'the', 'proposed', 'optimal', 'and', 'robust', 'power', 'allocation', 'strategies', 'over', 'the', 'conventional', 'uniform', 'and', 'nonrobust', 'approaches']] | [-0.15645046053578965, 0.001972547994387117, -0.03033784662037477, 0.047561257298338565, -0.0739292657979932, -0.21679507203583345, 0.1056827011179749, 0.39215124798480605, -0.26963695388890374, -0.33179160319090584, 0.11792712811065095, -0.22455781230402733, -0.12953872878748232, 0.21239639503392774, -0.15545471756378076, 0.1359071145120428, 0.04880003100057524, 0.025300564778754947, -0.03448566699736431, -0.27117914876447674, 0.2414970682015327, 0.12500365863203025, 0.37831733675541285, 0.06473189373367054, 0.09044546645918423, 0.03962157492346481, -0.016015659638583823, 0.004143120372372735, -0.09652530069938794, 0.15170990165814127, 0.302216294638894, 0.17503175535366508, 0.2864132613335517, -0.405420524729772, -0.25004370075324805, 0.10863212901651045, 0.14909105496023034, 0.0298538813367486, -0.028988140569669016, -0.2722096624237083, 0.09773965433362078, -0.16679160731406933, -0.06281678657597084, -0.0031507528778878064, -0.07602467645936814, 0.04804850119049025, -0.32431549877640814, 0.018560411264614808, 0.0057917272142780935, 0.018298734976945678, -0.09050885598554373, -0.14553188333985054, 0.053964526748763085, 0.16094450760999177, 0.03362657850267253, -0.04092237565210318, 0.12534150414873688, -0.12905714059085713, -0.1221049115057943, 0.3917687769185324, -0.028067521303077863, -0.23348293682468718, 0.0788839870883003, -0.0574558078593834, -0.08093413793675276, 0.1549211624148429, 0.24176419047954303, 0.08251479508538472, -0.16712044931558862, 0.05977719032098768, 0.032112827972391914, 0.19527056525700567, 0.06855079415826829, 0.1330599640470629, 0.16864408917669105, 0.18518600532978446, 0.15766900575775755, 0.15201062383257422, -0.12356258797092882, -0.0921838516356739, -0.2052833971725217, -0.0906060832578694, -0.18901664785572578, -0.0019137116932803817, -0.0994088202352315, -0.03859239602967196, 0.39984268923811717, 0.16165290612859723, 0.12176743766313286, 0.1031129159175796, 0.43508007404867743, 0.15873397443420637, 0.0090807119201197, 0.11038444158646578, 0.26114616332743623, 0.0943885421713743, 0.06865080214382907, -0.2709330061890816, 0.0610116953852054, -0.002213190095957185] |
1,802.04506 | Numerical Convergence of Discrete Exterior Calculus on Arbitrary Surface
Meshes | Discrete exterior calculus (DEC) is a structure-preserving numerical
framework for partial differential equations solution, particularly suitable
for simplicial meshes. A longstanding and widespread assumption has been that
DEC requires special (Delaunay) triangulations, which complicated the mesh
generation process especially on curved surfaces. This paper presents numerical
evidences demonstrating that this restriction is unnecessary. Convergence
experiments are carried out for various physical problems using both Delaunay
and non-Delaunay triangulations. Signed diagonal definition for the key DEC
operator (Hodge star) is adopted. The errors converge as expected for all
considered meshes and experiments. This relieves the DEC paradigm from
unnecessary triangulation limitation.
| math.NA | discrete exterior calculus dec is a structurepreserving numerical framework for partial differential equations solution particularly suitable for simplicial meshes a longstanding and widespread assumption has been that dec requires special delaunay triangulations which complicated the mesh generation process especially on curved surfaces this paper presents numerical evidences demonstrating that this restriction is unnecessary convergence experiments are carried out for various physical problems using both delaunay and nondelaunay triangulations signed diagonal definition for the key dec operator hodge star is adopted the errors converge as expected for all considered meshes and experiments this relieves the dec paradigm from unnecessary triangulation limitation | [['discrete', 'exterior', 'calculus', 'dec', 'is', 'a', 'structurepreserving', 'numerical', 'framework', 'for', 'partial', 'differential', 'equations', 'solution', 'particularly', 'suitable', 'for', 'simplicial', 'meshes', 'a', 'longstanding', 'and', 'widespread', 'assumption', 'has', 'been', 'that', 'dec', 'requires', 'special', 'delaunay', 'triangulations', 'which', 'complicated', 'the', 'mesh', 'generation', 'process', 'especially', 'on', 'curved', 'surfaces', 'this', 'paper', 'presents', 'numerical', 'evidences', 'demonstrating', 'that', 'this', 'restriction', 'is', 'unnecessary', 'convergence', 'experiments', 'are', 'carried', 'out', 'for', 'various', 'physical', 'problems', 'using', 'both', 'delaunay', 'and', 'nondelaunay', 'triangulations', 'signed', 'diagonal', 'definition', 'for', 'the', 'key', 'dec', 'operator', 'hodge', 'star', 'is', 'adopted', 'the', 'errors', 'converge', 'as', 'expected', 'for', 'all', 'considered', 'meshes', 'and', 'experiments', 'this', 'relieves', 'the', 'dec', 'paradigm', 'from', 'unnecessary', 'triangulation', 'limitation']] | [-0.13114296680083498, -0.00113886799197644, -0.09088937183842064, 0.08016190042088056, -0.1609774980484508, -0.13896536083659158, 0.0009590244351420551, 0.34651622401550414, -0.29566904267296196, -0.28235559597611426, 0.15761460672598332, -0.22364015433238818, -0.18429532035952434, 0.15966921764425934, -0.16202406651340426, 0.12443846537033096, 0.15412944225594402, -0.06888884109444916, -0.08055419037584216, -0.22955776493065058, 0.3222006040159613, 0.07660246740095317, 0.2601076189149171, 0.07160971042700112, 0.15863410518621093, -0.041651228361479296, -0.09335558026563376, 0.013512068316340447, -0.1390226622771297, 0.08138495437218808, 0.25489847236080093, 0.09508948014350609, 0.2562977545522153, -0.46728248545899986, -0.20663720164448024, 0.1022139676194638, 0.15706435970263555, 0.049698143088025976, -0.09855319955968297, -0.2732943863049149, 0.10954723770264536, -0.08619173720944673, -0.12349494663096267, -0.09418411693070083, 0.03279187542852014, -0.020713848965242504, -0.274197354465723, 0.049684023847803474, 0.0850795102212578, 0.10623214782448485, -0.009402617043815554, -0.14977558875456454, -0.025605814767768607, 0.08373680694960058, -0.00831786838854896, 0.05190493131289259, 0.04837177658599103, -0.03545942802214995, -0.11989095766097307, 0.44115094117820264, 0.06641211643116549, -0.3086157511023339, 0.12070436875568703, -0.09446308138780296, -0.18627424823120237, 0.15557026713737288, 0.10086094032041729, 0.2032845822389936, -0.12589086464606225, 0.1434716726728948, -0.05295237047714181, 0.11438165621832014, 0.14458021660335363, -0.040761125951539724, 0.16111963154748082, 0.15912838596850634, 0.13643673927523195, 0.08934983362443745, -0.09698017966351472, -0.20853086005430668, -0.338589190132916, -0.13567739903228357, -0.1368190387042705, 0.026300083880778403, -0.17576280664055957, -0.18172768210992218, 0.28245742511004207, 0.12701386418193578, 0.08531437717028893, 0.08479271273245104, 0.2960941715911031, 0.06590392199228517, 0.05732584011740983, 0.08051753201056272, 0.17434451058506967, 0.17409361242083832, 0.1312108274172351, -0.1401355604827404, 0.05687421121168881, 0.15161119292490186] |
1,802.04507 | Minimal asymptotic translation lengths of Torelli groups and pure braid
groups on the curve graph | In this paper, we show that the minimal asymptotic translation length of the
Torelli group $\mathcal{I}_g$ of the surface $S_g$ of genus $g$ on the curve
graph asymptotically behaves like $1/g$, contrary to the mapping class group
$Mod(S_g)$, which behaves like $1/g^2$. We also show that the minimal
asymptotic translation length of the pure braid group $PB_n$ on the curve graph
asymptotically behaves like $1/n$, contrary to the braid group $B_n$, which
behaves like $1/n^2$.
| math.GT math.DS | in this paper we show that the minimal asymptotic translation length of the torelli group mathcali_g of the surface s_g of genus g on the curve graph asymptotically behaves like 1g contrary to the mapping class group mods_g which behaves like 1g2 we also show that the minimal asymptotic translation length of the pure braid group pb_n on the curve graph asymptotically behaves like 1n contrary to the braid group b_n which behaves like 1n2 | [['in', 'this', 'paper', 'we', 'show', 'that', 'the', 'minimal', 'asymptotic', 'translation', 'length', 'of', 'the', 'torelli', 'group', 'mathcali_g', 'of', 'the', 'surface', 's_g', 'of', 'genus', 'g', 'on', 'the', 'curve', 'graph', 'asymptotically', 'behaves', 'like', '1g', 'contrary', 'to', 'the', 'mapping', 'class', 'group', 'mods_g', 'which', 'behaves', 'like', '1g2', 'we', 'also', 'show', 'that', 'the', 'minimal', 'asymptotic', 'translation', 'length', 'of', 'the', 'pure', 'braid', 'group', 'pb_n', 'on', 'the', 'curve', 'graph', 'asymptotically', 'behaves', 'like', '1n', 'contrary', 'to', 'the', 'braid', 'group', 'b_n', 'which', 'behaves', 'like', '1n2']] | [-0.18477813743054866, 0.17097207653025787, -0.14881553197900454, 0.08397232612439742, -0.10844304967671632, -0.17043667477866015, 0.010774185634218156, 0.3322262749200066, -0.3043913051237663, -0.21168114736676216, 0.06311769969916592, -0.34418055310845375, -0.19164795897901057, 0.1848293670763572, -0.1304515345642964, -0.025898628930250803, 0.010592419492701689, 0.19323900178074838, -0.10866398621350527, -0.2393039176776074, 0.31706068709492685, -0.030956848847369354, 0.31880142147342366, -0.062037915935118995, 0.0530751014004151, 0.026376099927971762, 0.04882455019901196, -0.004916454893536866, -0.18194708437445417, 0.04070730791737636, 0.20584582164883614, 0.012675504200160503, 0.11526465038458507, -0.36225605229536695, -0.16053219644973676, 0.20257078965504965, 0.16738839452465376, 0.007978195305913687, 0.015507650906220078, -0.18850605552395186, 0.10837861347943545, -0.1700543136894703, -0.18722801157583793, 0.0003827667484680812, 0.04668148912489414, -0.030458761577804885, -0.1682039012014866, 0.0077547443623188885, 0.13541002944111824, 0.07046748752395313, 0.05546386485298475, -0.12194891013205052, -0.055506071199973424, 0.11750925149768592, 0.08259819782339037, 0.10404546088849505, 0.14115582548081876, -0.12313008986103038, -0.04475972228993972, 0.41112069884936014, -0.18218719284981488, -0.17264788068830966, 0.11235542707843706, -0.1882809081673622, -0.1925982093811035, 0.04455743745900691, 0.08532333113020286, 0.13874739926308394, 0.0327497444053491, 0.19227536264806985, -0.13593892176946004, 0.15663689869145553, 0.08802736374239127, -0.0016427538668115935, 0.05326300429180265, 0.11628658173295359, 0.11261450214932363, 0.15282037149493893, -0.023445050710191328, -0.022809081189334394, -0.3518928592155377, -0.22154442463691035, -0.14517135777510703, 0.14638265083233515, -0.1634166972587506, -0.2462167405212919, 0.38171666134148835, 0.08315122991800308, 0.122718203018109, 0.19452318400455018, 0.16761535490552584, 0.03616538744419813, 0.07762765172248086, 0.15729429612557094, 0.08342529255896806, 0.10587090141139925, -0.08699978836501639, -0.2784993274137378, -0.005770144710938136, 0.19868413670609394] |
1,802.04508 | Seafloor geodetic constraints on interplate coupling of the Nankai
Trough megathrust zone | Interplate megathrust earthquakes have inflicted catastrophic damage on human
society. An extremely hazardous megathrust earthquake is predicted to occur
along the Nankai Trough off southwestern Japan, an economically active and
densely populated area with historical records of megathrust earthquakes.
Megathrust earthquakes are the result of a plate subduction mechanism and occur
at interplate slip-deficit (or coupling) regions. Many past studies have
attempted to capture slip-deficit rate (SDR) distributions for assessing future
earthquake disasters. However, they could not capture a total view of the
megathrust earthquake source region because they had no seafloor geodetic data.
The Hydrographic and Oceanographic Department of the Japan Coast Guard (JHOD)
has been developing a highly precise and sustainable seafloor geodetic
observation network deployed in this subduction zone to broadly obtain direct
information related to offshore SDR. Here, we present seafloor geodetic
observation data and an offshore interplate SDR distribution model. Our data
suggests that most offshore regions in this subduction zone have positive SDRs.
Specifically, our observations indicate previously unknown high-SDR regions
that are important for tsunami disaster mitigation and low-SDR regions that are
consistent with distributions of shallow slow earthquakes and subducting
seamounts. This is the first direct evidence suggesting that coupling
conditions are related to these seismological and geological phenomena. These
observations provide new fundamental information for inferring megathrust
earthquake scenarios and interpreting research on the Nankai Trough subduction
zone.
| physics.geo-ph | interplate megathrust earthquakes have inflicted catastrophic damage on human society an extremely hazardous megathrust earthquake is predicted to occur along the nankai trough off southwestern japan an economically active and densely populated area with historical records of megathrust earthquakes megathrust earthquakes are the result of a plate subduction mechanism and occur at interplate slipdeficit or coupling regions many past studies have attempted to capture slipdeficit rate sdr distributions for assessing future earthquake disasters however they could not capture a total view of the megathrust earthquake source region because they had no seafloor geodetic data the hydrographic and oceanographic department of the japan coast guard jhod has been developing a highly precise and sustainable seafloor geodetic observation network deployed in this subduction zone to broadly obtain direct information related to offshore sdr here we present seafloor geodetic observation data and an offshore interplate sdr distribution model our data suggests that most offshore regions in this subduction zone have positive sdrs specifically our observations indicate previously unknown highsdr regions that are important for tsunami disaster mitigation and lowsdr regions that are consistent with distributions of shallow slow earthquakes and subducting seamounts this is the first direct evidence suggesting that coupling conditions are related to these seismological and geological phenomena these observations provide new fundamental information for inferring megathrust earthquake scenarios and interpreting research on the nankai trough subduction zone | [['interplate', 'megathrust', 'earthquakes', 'have', 'inflicted', 'catastrophic', 'damage', 'on', 'human', 'society', 'an', 'extremely', 'hazardous', 'megathrust', 'earthquake', 'is', 'predicted', 'to', 'occur', 'along', 'the', 'nankai', 'trough', 'off', 'southwestern', 'japan', 'an', 'economically', 'active', 'and', 'densely', 'populated', 'area', 'with', 'historical', 'records', 'of', 'megathrust', 'earthquakes', 'megathrust', 'earthquakes', 'are', 'the', 'result', 'of', 'a', 'plate', 'subduction', 'mechanism', 'and', 'occur', 'at', 'interplate', 'slipdeficit', 'or', 'coupling', 'regions', 'many', 'past', 'studies', 'have', 'attempted', 'to', 'capture', 'slipdeficit', 'rate', 'sdr', 'distributions', 'for', 'assessing', 'future', 'earthquake', 'disasters', 'however', 'they', 'could', 'not', 'capture', 'a', 'total', 'view', 'of', 'the', 'megathrust', 'earthquake', 'source', 'region', 'because', 'they', 'had', 'no', 'seafloor', 'geodetic', 'data', 'the', 'hydrographic', 'and', 'oceanographic', 'department', 'of', 'the', 'japan', 'coast', 'guard', 'jhod', 'has', 'been', 'developing', 'a', 'highly', 'precise', 'and', 'sustainable', 'seafloor', 'geodetic', 'observation', 'network', 'deployed', 'in', 'this', 'subduction', 'zone', 'to', 'broadly', 'obtain', 'direct', 'information', 'related', 'to', 'offshore', 'sdr', 'here', 'we', 'present', 'seafloor', 'geodetic', 'observation', 'data', 'and', 'an', 'offshore', 'interplate', 'sdr', 'distribution', 'model', 'our', 'data', 'suggests', 'that', 'most', 'offshore', 'regions', 'in', 'this', 'subduction', 'zone', 'have', 'positive', 'sdrs', 'specifically', 'our', 'observations', 'indicate', 'previously', 'unknown', 'highsdr', 'regions', 'that', 'are', 'important', 'for', 'tsunami', 'disaster', 'mitigation', 'and', 'lowsdr', 'regions', 'that', 'are', 'consistent', 'with', 'distributions', 'of', 'shallow', 'slow', 'earthquakes', 'and', 'subducting', 'seamounts', 'this', 'is', 'the', 'first', 'direct', 'evidence', 'suggesting', 'that', 'coupling', 'conditions', 'are', 'related', 'to', 'these', 'seismological', 'and', 'geological', 'phenomena', 'these', 'observations', 'provide', 'new', 'fundamental', 'information', 'for', 'inferring', 'megathrust', 'earthquake', 'scenarios', 'and', 'interpreting', 'research', 'on', 'the', 'nankai', 'trough', 'subduction', 'zone']] | [-0.11451660848446021, 0.12212626203098935, -0.06520762225261119, 0.1274212882595929, -0.09215956632937072, -0.0688892476812713, 0.05247210901666736, 0.35462339900906, -0.18797140173262145, -0.31514236911482335, 0.1931689748618482, -0.29877411577496593, -0.16386839217633825, 0.2395088621878752, -0.11754835960763398, 0.018572799282910186, 0.09342345485739764, -0.0406722132235342, 0.05100980263816538, -0.17572304246761747, 0.20180891941478518, 0.12368086678169803, 0.3208788101586652, 0.07106056530449995, 0.0502803662736011, -0.07445813555110296, -0.0546456022499913, -0.0368256079337488, -0.1249936932252248, 0.08664572327208128, 0.35794501880495133, 0.16615538164969046, 0.27249618655974595, -0.49822119015745175, -0.28076133108381773, 0.09572667938159837, 0.09090284607689238, 0.04646696447504356, -0.015690566272879382, -0.34026984156981716, 0.019743918582145966, -0.18347718511661726, -0.12961968842433444, 0.0009815781530018103, 0.09453424242245059, -0.004429903785841396, -0.22744838429543263, 0.08438099469100357, 0.027338380968552168, 0.1607566551265583, -0.08075040018099583, -0.09709343487898317, -0.05112617867640578, 0.16245101797036254, 0.11391795200519095, -0.0026071176567110674, 0.19259396503464535, -0.06695143779954658, -0.06052384038963587, 0.3561258833703682, 0.03270045432527613, -0.062172444266524185, 0.21178026143245493, -0.17117202945887974, -0.12406888109846757, 0.13551714061654058, 0.2379498401444987, 0.02949130232129836, -0.18191575978111424, -0.047478673475261406, -0.03396564682869755, 0.08060001899231209, 0.13393972326534678, -0.047626578976501334, 0.27307165757546464, 0.2070566594191907, 0.097813169259106, 0.036983940347911144, -0.21725053947874054, -0.07401771958057697, -0.2390048802151804, -0.07922514373798985, -0.12343022112979035, -0.010471642940719738, -0.07176296693836265, -0.15923314958777093, 0.3425237644564917, 0.1695998262137815, 0.13449329745268862, 0.00761416652008082, 0.24987983225941726, 0.017984140490506232, 0.09684109737110488, 0.11626335837545371, 0.2792573973591275, 0.031301234430544986, 0.14707276909886038, -0.14684163452003876, 0.17139011938799156, -0.03781850506157543] |
1,802.04509 | Analytic understanding and control of dynamical friction | Recent model simulations discovered unexpected non-monotonic features in the
wear-free dry phononic friction as a function of the sliding speed. Here we
demonstrate that a rather straight- forward application of linear-response
theory, appropriate in a regime of weak slider-substrate in- teraction,
predicts frictional one-phonon singularities which imply a non-trivial
dependence of the dynamical friction force on the slider speed and/or coupling
to the substrate. The explicit formula which we derive reproduces very
accurately the classical atomistic simulations when available. By modifying the
slider-substrate interaction the analytical understanding obtained provides a
practical means to tailor and control the speed dependence of friction with
substantial freedom.
| cond-mat.mes-hall | recent model simulations discovered unexpected nonmonotonic features in the wearfree dry phononic friction as a function of the sliding speed here we demonstrate that a rather straight forward application of linearresponse theory appropriate in a regime of weak slidersubstrate in teraction predicts frictional onephonon singularities which imply a nontrivial dependence of the dynamical friction force on the slider speed andor coupling to the substrate the explicit formula which we derive reproduces very accurately the classical atomistic simulations when available by modifying the slidersubstrate interaction the analytical understanding obtained provides a practical means to tailor and control the speed dependence of friction with substantial freedom | [['recent', 'model', 'simulations', 'discovered', 'unexpected', 'nonmonotonic', 'features', 'in', 'the', 'wearfree', 'dry', 'phononic', 'friction', 'as', 'a', 'function', 'of', 'the', 'sliding', 'speed', 'here', 'we', 'demonstrate', 'that', 'a', 'rather', 'straight', 'forward', 'application', 'of', 'linearresponse', 'theory', 'appropriate', 'in', 'a', 'regime', 'of', 'weak', 'slidersubstrate', 'in', 'teraction', 'predicts', 'frictional', 'onephonon', 'singularities', 'which', 'imply', 'a', 'nontrivial', 'dependence', 'of', 'the', 'dynamical', 'friction', 'force', 'on', 'the', 'slider', 'speed', 'andor', 'coupling', 'to', 'the', 'substrate', 'the', 'explicit', 'formula', 'which', 'we', 'derive', 'reproduces', 'very', 'accurately', 'the', 'classical', 'atomistic', 'simulations', 'when', 'available', 'by', 'modifying', 'the', 'slidersubstrate', 'interaction', 'the', 'analytical', 'understanding', 'obtained', 'provides', 'a', 'practical', 'means', 'to', 'tailor', 'and', 'control', 'the', 'speed', 'dependence', 'of', 'friction', 'with', 'substantial', 'freedom']] | [-0.1760982672349907, 0.1204198985880476, -0.15580600580580314, 0.053384247986437046, -0.1003270876566762, -0.16823713386598613, 0.07248361581977167, 0.3289924916965001, -0.26940087337290997, -0.3004395001775865, 0.016377513764823957, -0.22941630204587957, -0.19326261548524343, 0.2083424277675962, 0.011060411101478396, 0.0662134021172499, 0.039865823516857274, -0.02394312264022499, -0.06115597668691602, -0.1476386258066677, 0.229114036848859, 0.07790346199520004, 0.2786385339901792, 0.12162436961051691, 0.14000292963266953, 0.04581771378215511, 0.01666267564547366, 0.04815299119981169, -0.19467330313304912, 0.06325843195189061, 0.1926287657279494, -0.05191038001794368, 0.2511493314003337, -0.4799484653597318, -0.2563338369872529, -0.006962084082561066, 0.1344205007246397, 0.16127195385131007, -0.07737411407966312, -0.24178560777088104, -0.0011877337271727405, -0.16409146446210232, -0.18580259242800326, -0.09680129143689732, 0.04056360953243323, 0.04559790801021804, -0.2434099054741628, 0.12729396024556125, 0.04957656989419987, 0.063999805617535, -0.065974141995522, -0.044853224789778004, -0.036454711819194185, 0.0870991790482381, 0.05337976003676038, 0.015121962427550439, 0.1997953013887683, -0.163699429369197, -0.05565795593542382, 0.3710044427024363, -0.08462685156609068, -0.1786755606514013, 0.21513089701280141, -0.14278135702321396, -0.06179454618639955, 0.13947443211975608, 0.14767857597580233, 0.07171962456212569, -0.13330771893817248, 0.06277011020179132, -0.007534622146919804, 0.15335810383854126, 0.07065729506187213, 0.0020665994537903847, 0.19155576616950623, 0.17851966954722495, -0.012445709405882844, 0.15115688724027385, -0.061518691245068625, -0.12952583415198674, -0.29634474245469694, -0.11757208218400195, -0.17213981980186643, 0.05591992040625909, -0.15342702552802223, -0.17173243015868933, 0.3558765643466156, 0.1735021388254273, 0.19382172039465853, 0.0775778346685964, 0.3145298551659561, 0.12868420926071883, 0.06349991259020436, 0.035085226888361486, 0.30857303271124376, 0.14111293835149516, 0.0775404746318688, -0.29142496341984103, 0.1012985095860961, 0.04796677187211739] |
1,802.0451 | Geometric Aspects and Testing of the Galactic Center Distance
Determination from Spiral Arm Segments | We consider the problem of determining the geometric parameters of a Galactic
spiral arm from its segment by including the distance to the spiral pole, i.e.,
the distance to the Galactic center ($R_0$). The question about the number of
points belonging to one turn of a logarithmic spiral and defining this spiral
as a geometric figure has been investigated numerically and analytically by
assuming the direction to the spiral pole (to the Galactic center) to be known.
Based on the results obtained, in an effort to test the new approach, we have
constructed a simplified method of solving the problem that consists in finding
the median of the values for each parameter from all possible triplets of
objects in the spiral arm segment satisfying the condition for the angular
distance between objects. Applying the method to the data on the spatial
distribution of masers in the Perseus and Scutum arms (the catalogue by Reid et
al. (2014)) has led to an estimate of $R_0 = 8.8 \pm 0.5$ kpc. The parameters
of five spiral arm segments have been determined from masers of the same
catalogue. We have confirmed the difference between the spiral arms in pitch
angle. The pitch angles of the arms revealed by masers are shown to generally
correlate with $R_0$ in the sense that an increase in $R_0$ leads to a growth
in the absolute values of the pitch angles.
| astro-ph.GA | we consider the problem of determining the geometric parameters of a galactic spiral arm from its segment by including the distance to the spiral pole ie the distance to the galactic center r_0 the question about the number of points belonging to one turn of a logarithmic spiral and defining this spiral as a geometric figure has been investigated numerically and analytically by assuming the direction to the spiral pole to the galactic center to be known based on the results obtained in an effort to test the new approach we have constructed a simplified method of solving the problem that consists in finding the median of the values for each parameter from all possible triplets of objects in the spiral arm segment satisfying the condition for the angular distance between objects applying the method to the data on the spatial distribution of masers in the perseus and scutum arms the catalogue by reid et al 2014 has led to an estimate of r_0 88 pm 05 kpc the parameters of five spiral arm segments have been determined from masers of the same catalogue we have confirmed the difference between the spiral arms in pitch angle the pitch angles of the arms revealed by masers are shown to generally correlate with r_0 in the sense that an increase in r_0 leads to a growth in the absolute values of the pitch angles | [['we', 'consider', 'the', 'problem', 'of', 'determining', 'the', 'geometric', 'parameters', 'of', 'a', 'galactic', 'spiral', 'arm', 'from', 'its', 'segment', 'by', 'including', 'the', 'distance', 'to', 'the', 'spiral', 'pole', 'ie', 'the', 'distance', 'to', 'the', 'galactic', 'center', 'r_0', 'the', 'question', 'about', 'the', 'number', 'of', 'points', 'belonging', 'to', 'one', 'turn', 'of', 'a', 'logarithmic', 'spiral', 'and', 'defining', 'this', 'spiral', 'as', 'a', 'geometric', 'figure', 'has', 'been', 'investigated', 'numerically', 'and', 'analytically', 'by', 'assuming', 'the', 'direction', 'to', 'the', 'spiral', 'pole', 'to', 'the', 'galactic', 'center', 'to', 'be', 'known', 'based', 'on', 'the', 'results', 'obtained', 'in', 'an', 'effort', 'to', 'test', 'the', 'new', 'approach', 'we', 'have', 'constructed', 'a', 'simplified', 'method', 'of', 'solving', 'the', 'problem', 'that', 'consists', 'in', 'finding', 'the', 'median', 'of', 'the', 'values', 'for', 'each', 'parameter', 'from', 'all', 'possible', 'triplets', 'of', 'objects', 'in', 'the', 'spiral', 'arm', 'segment', 'satisfying', 'the', 'condition', 'for', 'the', 'angular', 'distance', 'between', 'objects', 'applying', 'the', 'method', 'to', 'the', 'data', 'on', 'the', 'spatial', 'distribution', 'of', 'masers', 'in', 'the', 'perseus', 'and', 'scutum', 'arms', 'the', 'catalogue', 'by', 'reid', 'et', 'al', '2014', 'has', 'led', 'to', 'an', 'estimate', 'of', 'r_0', '88', 'pm', '05', 'kpc', 'the', 'parameters', 'of', 'five', 'spiral', 'arm', 'segments', 'have', 'been', 'determined', 'from', 'masers', 'of', 'the', 'same', 'catalogue', 'we', 'have', 'confirmed', 'the', 'difference', 'between', 'the', 'spiral', 'arms', 'in', 'pitch', 'angle', 'the', 'pitch', 'angles', 'of', 'the', 'arms', 'revealed', 'by', 'masers', 'are', 'shown', 'to', 'generally', 'correlate', 'with', 'r_0', 'in', 'the', 'sense', 'that', 'an', 'increase', 'in', 'r_0', 'leads', 'to', 'a', 'growth', 'in', 'the', 'absolute', 'values', 'of', 'the', 'pitch', 'angles']] | [-0.11392905926361985, 0.023886540515941933, -0.07323275931211638, 0.017204379836992554, -0.08445657446281984, -0.041327494369209586, 0.038399744125885704, 0.37870569699162876, -0.24477715091378396, -0.34711080604505823, 0.04975122245478219, -0.2638133291425063, -0.07974468576566292, 0.20126068079844117, -0.031050101347600816, 0.02267838414803103, -0.015443624831638364, 0.008037875015047732, -0.068319124424808, -0.23050289758850404, 0.30182026792518346, 0.05742889754112874, 0.2076831336970168, -0.054151655292210714, 0.13487934047764705, -0.05534803546997237, -0.03621056064931226, 0.01432920242900607, -0.18943769910107094, 0.08791653405581921, 0.204958993660543, 0.09533041170426917, 0.24319247312337994, -0.35810499273015767, -0.15444289822661286, 0.07640948258932471, 0.1630960574899479, 0.09180691056073932, -0.0025417895521968603, -0.320004401280914, 0.10230049037812117, -0.11563143523248355, -0.22345813132164166, 0.0755668242345564, 0.08799643273734295, 0.04712396236021144, -0.24195646900474896, 0.09432318260299107, 0.005780674091636621, 0.07655413069055769, -0.05689287824799098, -0.1323165282635179, -0.030389798046410853, 0.14188193772108584, 0.06525440954463443, 0.11709238094446281, 0.13588290452226548, -0.14057854441464238, -0.09548066006692384, 0.3763852976724216, -0.015859409140579497, -0.14690948488702094, 0.1495391628514285, -0.18177354343813554, -0.10489074395094387, 0.1265457645364724, 0.15602218589127256, 0.10264017076355983, -0.12293101366256075, 0.026470010593615808, -0.09345259371510675, 0.1758826025641234, 0.11309307704655581, 0.0049521877663210034, 0.24038012857460578, 0.08791120212268212, 0.10182622601258054, 0.12885555781169136, -0.2074754109359266, -0.10797904795896918, -0.26104223357457346, -0.09178459289451611, -0.14558866690766017, -0.021500456839366335, -0.11220452970613631, -0.10502404646367408, 0.39250697802294626, 0.11697396087452192, 0.2753840827820662, 0.023137381695740825, 0.25639090988110624, 0.055251591112805885, 0.12919623645399858, 0.10452663665637374, 0.3229833045163481, 0.13702749228406022, 0.02981527841144145, -0.2400995618977347, 0.10307734852640665, 0.039066347110904114] |
1,802.04511 | Equations defining probability tree models | Coloured probability tree models are statistical models coding conditional
independence between events depicted in a tree graph. They are more general
than the very important class of context-specific Bayesian networks. In this
paper, we study the algebraic properties of their ideal of model invariants.
The generators of this ideal can be easily read from the tree graph and have a
straightforward interpretation in terms of the underlying model: they are
differences of odds ratios coming from conditional probabilities. One of the
key findings in this analysis is that the tree is a convenient tool for
understanding the exact algebraic way in which the sum-to-1 conditions on the
parameter space translate into the sum-to-one conditions on the joint
probabilities of the statistical model. This enables us to identify necessary
and sufficient graphical conditions for a staged tree model to be a toric
variety intersected with a probability simplex.
| math.ST math.AC math.PR stat.TH | coloured probability tree models are statistical models coding conditional independence between events depicted in a tree graph they are more general than the very important class of contextspecific bayesian networks in this paper we study the algebraic properties of their ideal of model invariants the generators of this ideal can be easily read from the tree graph and have a straightforward interpretation in terms of the underlying model they are differences of odds ratios coming from conditional probabilities one of the key findings in this analysis is that the tree is a convenient tool for understanding the exact algebraic way in which the sumto1 conditions on the parameter space translate into the sumtoone conditions on the joint probabilities of the statistical model this enables us to identify necessary and sufficient graphical conditions for a staged tree model to be a toric variety intersected with a probability simplex | [['coloured', 'probability', 'tree', 'models', 'are', 'statistical', 'models', 'coding', 'conditional', 'independence', 'between', 'events', 'depicted', 'in', 'a', 'tree', 'graph', 'they', 'are', 'more', 'general', 'than', 'the', 'very', 'important', 'class', 'of', 'contextspecific', 'bayesian', 'networks', 'in', 'this', 'paper', 'we', 'study', 'the', 'algebraic', 'properties', 'of', 'their', 'ideal', 'of', 'model', 'invariants', 'the', 'generators', 'of', 'this', 'ideal', 'can', 'be', 'easily', 'read', 'from', 'the', 'tree', 'graph', 'and', 'have', 'a', 'straightforward', 'interpretation', 'in', 'terms', 'of', 'the', 'underlying', 'model', 'they', 'are', 'differences', 'of', 'odds', 'ratios', 'coming', 'from', 'conditional', 'probabilities', 'one', 'of', 'the', 'key', 'findings', 'in', 'this', 'analysis', 'is', 'that', 'the', 'tree', 'is', 'a', 'convenient', 'tool', 'for', 'understanding', 'the', 'exact', 'algebraic', 'way', 'in', 'which', 'the', 'sumto1', 'conditions', 'on', 'the', 'parameter', 'space', 'translate', 'into', 'the', 'sumtoone', 'conditions', 'on', 'the', 'joint', 'probabilities', 'of', 'the', 'statistical', 'model', 'this', 'enables', 'us', 'to', 'identify', 'necessary', 'and', 'sufficient', 'graphical', 'conditions', 'for', 'a', 'staged', 'tree', 'model', 'to', 'be', 'a', 'toric', 'variety', 'intersected', 'with', 'a', 'probability', 'simplex']] | [-0.08426029308083506, 0.07925768314592846, -0.12974691600219845, 0.15003108102923948, -0.08973101818174992, -0.13863959110482302, 0.07701297350505316, 0.36481575498178803, -0.2796842260541369, -0.2934039150530549, 0.09642622500661224, -0.21444906698450547, -0.15390539753620755, 0.16829771677682764, -0.09569530854996754, 0.05490198617239725, 0.09353491300972153, 0.06498531706962887, -0.05124952926377013, -0.21808146776141893, 0.3285955512969538, 0.07181204953677442, 0.27932523002159104, 0.00107705205908581, 0.0904632420845215, -0.0021760816309499007, -0.05108082156519929, 0.03993862239011621, -0.14271589799024434, 0.14645488298663947, 0.2718236960671712, 0.196263148557803, 0.22045098780973316, -0.4227997665484882, -0.18805790885211263, 0.17233869787433173, 0.10130786201406321, 0.11609302004336775, 0.03036351678747451, -0.2605290036801606, 0.09931880650301911, -0.16269439861436744, -0.0896434479469612, -0.06227756849783536, -0.02138195930316738, -0.0007298919479904875, -0.29899131782888755, 0.016938678499260177, 0.08313250360525634, 0.05066680860361212, 0.006713381016384555, -0.1173157235328427, -0.03185465663977682, 0.12423720869095359, -0.009559279973523002, 0.014549374575599109, 0.08099908722972829, -0.14311673273954362, -0.12920336467405297, 0.36962278074368016, -0.015628300150015154, -0.25223271480493553, 0.19851234550619729, -0.11910810988166765, -0.20487443076076675, 0.11153807366356151, 0.1889445105382586, 0.10100003467770675, -0.18101403358941004, 0.08982372780135922, -0.07199285625901124, 0.10498104138580495, 0.02605263460810258, 0.031192146926202927, 0.23380303259760346, 0.16549320995156996, 0.03771699769007782, 0.14745254488183465, -0.03299934557664578, -0.10397320368314443, -0.31234408518273943, -0.16807519405588273, -0.13657519352392689, 0.024472619033512683, -0.16322934919986587, -0.18221302455520794, 0.41827271661517046, 0.18000996796962843, 0.21013679058125165, 0.10519162300824227, 0.27182331909616925, 0.10488874976936256, 0.030372076940544154, 0.03788725942156392, 0.14034252942297354, 0.15580394818791993, 0.018271657644630703, -0.11841036310604429, 0.15590651399513375, 0.08362459660864958] |
1,802.04512 | The principle of pointfree continuity | In the setting of constructive pointfree topology, we introduce a notion of
continuous operation between pointfree topologies and the corresponding
principle of pointfree continuity. An operation between points of pointfree
topologies is continuous if it is induced by a relation between the bases of
the topologies; this gives a rigorous condition for Brouwer's continuity
principle to hold. The principle of pointfree continuity for pointfree
topologies $\mathcal{S}$ and $\mathcal{T}$ says that any relation which induces
a continuous operation between points is a morphism from $\mathcal{S}$ to
$\mathcal{T}$. The principle holds under the assumption of bi-spatiality of
$\mathcal{S}$. When $\mathcal{S}$ is the formal Baire space or the formal unit
interval and $\mathcal{T}$ is the formal topology of natural numbers, the
principle is equivalent to spatiality of the formal Baire space and formal unit
interval, respectively. Some of the well-known connections between spatiality,
bar induction, and compactness of the unit interval are recast in terms of our
principle of continuity.
We adopt the Minimalist Foundation as our constructive foundation, and
positive topology as the notion of pointfree topology. This allows us to
distinguish ideal objects from constructive ones, and in particular, to
interpret choice sequences as points of the formal Baire space.
| cs.LO math.LO | in the setting of constructive pointfree topology we introduce a notion of continuous operation between pointfree topologies and the corresponding principle of pointfree continuity an operation between points of pointfree topologies is continuous if it is induced by a relation between the bases of the topologies this gives a rigorous condition for brouwers continuity principle to hold the principle of pointfree continuity for pointfree topologies mathcals and mathcalt says that any relation which induces a continuous operation between points is a morphism from mathcals to mathcalt the principle holds under the assumption of bispatiality of mathcals when mathcals is the formal baire space or the formal unit interval and mathcalt is the formal topology of natural numbers the principle is equivalent to spatiality of the formal baire space and formal unit interval respectively some of the wellknown connections between spatiality bar induction and compactness of the unit interval are recast in terms of our principle of continuity we adopt the minimalist foundation as our constructive foundation and positive topology as the notion of pointfree topology this allows us to distinguish ideal objects from constructive ones and in particular to interpret choice sequences as points of the formal baire space | [['in', 'the', 'setting', 'of', 'constructive', 'pointfree', 'topology', 'we', 'introduce', 'a', 'notion', 'of', 'continuous', 'operation', 'between', 'pointfree', 'topologies', 'and', 'the', 'corresponding', 'principle', 'of', 'pointfree', 'continuity', 'an', 'operation', 'between', 'points', 'of', 'pointfree', 'topologies', 'is', 'continuous', 'if', 'it', 'is', 'induced', 'by', 'a', 'relation', 'between', 'the', 'bases', 'of', 'the', 'topologies', 'this', 'gives', 'a', 'rigorous', 'condition', 'for', 'brouwers', 'continuity', 'principle', 'to', 'hold', 'the', 'principle', 'of', 'pointfree', 'continuity', 'for', 'pointfree', 'topologies', 'mathcals', 'and', 'mathcalt', 'says', 'that', 'any', 'relation', 'which', 'induces', 'a', 'continuous', 'operation', 'between', 'points', 'is', 'a', 'morphism', 'from', 'mathcals', 'to', 'mathcalt', 'the', 'principle', 'holds', 'under', 'the', 'assumption', 'of', 'bispatiality', 'of', 'mathcals', 'when', 'mathcals', 'is', 'the', 'formal', 'baire', 'space', 'or', 'the', 'formal', 'unit', 'interval', 'and', 'mathcalt', 'is', 'the', 'formal', 'topology', 'of', 'natural', 'numbers', 'the', 'principle', 'is', 'equivalent', 'to', 'spatiality', 'of', 'the', 'formal', 'baire', 'space', 'and', 'formal', 'unit', 'interval', 'respectively', 'some', 'of', 'the', 'wellknown', 'connections', 'between', 'spatiality', 'bar', 'induction', 'and', 'compactness', 'of', 'the', 'unit', 'interval', 'are', 'recast', 'in', 'terms', 'of', 'our', 'principle', 'of', 'continuity', 'we', 'adopt', 'the', 'minimalist', 'foundation', 'as', 'our', 'constructive', 'foundation', 'and', 'positive', 'topology', 'as', 'the', 'notion', 'of', 'pointfree', 'topology', 'this', 'allows', 'us', 'to', 'distinguish', 'ideal', 'objects', 'from', 'constructive', 'ones', 'and', 'in', 'particular', 'to', 'interpret', 'choice', 'sequences', 'as', 'points', 'of', 'the', 'formal', 'baire', 'space']] | [-0.17915815979505728, 0.06124630123101977, -0.14358414254489948, 0.10720111514592186, -0.12606090759491603, -0.08577473040180977, 0.11490606474501994, 0.3287624589222215, -0.36992232728222707, -0.20995845906013114, 0.05087371869071509, -0.21472885670509917, -0.12985220824890403, 0.17131916576681303, -0.1398464411713484, 0.007464520386867037, 0.03377897915138741, 0.06377463767568421, -0.10856837934856726, -0.1699912225194934, 0.40025422392845755, -0.02634257388964408, 0.29857333344548487, 0.04705192523650829, 0.16291951082853806, 0.027661134865172583, -0.007302207625329946, 0.04341274663065725, -0.1459303247518417, 0.1512903439841172, 0.26365147513158693, 0.16924767960286277, 0.2782539488192685, -0.387560271930815, -0.13743095789951357, 0.15619432396841038, 0.017119189232794776, -0.008567123007701917, 0.04493563857073296, -0.3057802150853806, 0.12517840540121225, -0.1264883953915683, -0.1082722186778244, -0.07657315384013334, 0.076573818289402, 0.0036144575793202027, -0.28136396505681777, -0.0015231136989902066, 0.1958512214924952, 0.10990758269385557, -0.05563307983707872, -0.0037256826533738413, -0.07533038526919265, 0.13300919627627908, 0.005231569171442199, 0.06879550110809787, 0.07419980037369474, -0.034801460675556554, -0.14674829179421067, 0.3943723640545751, -0.03205526136732049, -0.23737255299482682, 0.18200670995877707, -0.13373616353063045, -0.14143436404669452, 0.05871157935876964, 0.05274022025328995, 0.11052980179183486, -0.10317415249161481, 0.19861055933429408, -0.08261793765511054, 0.11715136894899199, 0.10978669493289833, 0.08402832501539678, 0.15871980968781046, 0.14820825112830716, 0.1520805694303955, 0.14526838811015655, 0.023926386125197614, -0.1151589917094268, -0.41964726730642576, -0.1886497898911587, -0.14860681543183146, 0.09607035574865425, -0.11044856149186157, -0.19819532693634187, 0.3332396175646496, 0.0972633824749577, 0.17103959335428146, 0.1356597361066661, 0.22898668002318404, 0.08692184810449059, 0.03690057852237269, 0.020744971204266854, 0.16324057445065895, 0.18785990307206343, 0.05002683152990284, -0.09982219162265385, 0.06053280199153556, 0.1852673689630165] |
1,802.04513 | Authentication of Satellite Navigation Signals by Wiretap Coding and
Artificial Noise | In order to combat the spoofing of global navigation satellite system (GNSS)
signals we propose a novel approach for satellite signal authentication based
on information-theoretic security. In particular we superimpose to the
navigation signal an authentication signal containing a secret message
corrupted by artificial noise (AN), still transmitted by the satellite. We
impose the following properties: a) the authentication signal is synchronous
with the navigation signal, b) the authentication signal is orthogonal to the
navigation signal and c) the secret message is undecodable by the attacker due
to the presence of the AN. The legitimate receiver synchronizes with the
navigation signal and stores the samples of the authentication signal with the
same synchronization. After the transmission of the authentication signal,
through a separate public asynchronous authenticated channel (e.g., a secure
Internet connection) additional information is made public allowing the
receiver to a) decode the secret message, thus overcoming the effects of AN,
and b) verify the secret message. We assess the performance of the proposed
scheme by the analysis of both the secrecy capacity of the authentication
message and the attack success probability, under various attack scenarios. A
comparison with existing approaches shows the effectiveness of the proposed
scheme.
| eess.SP | in order to combat the spoofing of global navigation satellite system gnss signals we propose a novel approach for satellite signal authentication based on informationtheoretic security in particular we superimpose to the navigation signal an authentication signal containing a secret message corrupted by artificial noise an still transmitted by the satellite we impose the following properties a the authentication signal is synchronous with the navigation signal b the authentication signal is orthogonal to the navigation signal and c the secret message is undecodable by the attacker due to the presence of the an the legitimate receiver synchronizes with the navigation signal and stores the samples of the authentication signal with the same synchronization after the transmission of the authentication signal through a separate public asynchronous authenticated channel eg a secure internet connection additional information is made public allowing the receiver to a decode the secret message thus overcoming the effects of an and b verify the secret message we assess the performance of the proposed scheme by the analysis of both the secrecy capacity of the authentication message and the attack success probability under various attack scenarios a comparison with existing approaches shows the effectiveness of the proposed scheme | [['in', 'order', 'to', 'combat', 'the', 'spoofing', 'of', 'global', 'navigation', 'satellite', 'system', 'gnss', 'signals', 'we', 'propose', 'a', 'novel', 'approach', 'for', 'satellite', 'signal', 'authentication', 'based', 'on', 'informationtheoretic', 'security', 'in', 'particular', 'we', 'superimpose', 'to', 'the', 'navigation', 'signal', 'an', 'authentication', 'signal', 'containing', 'a', 'secret', 'message', 'corrupted', 'by', 'artificial', 'noise', 'an', 'still', 'transmitted', 'by', 'the', 'satellite', 'we', 'impose', 'the', 'following', 'properties', 'a', 'the', 'authentication', 'signal', 'is', 'synchronous', 'with', 'the', 'navigation', 'signal', 'b', 'the', 'authentication', 'signal', 'is', 'orthogonal', 'to', 'the', 'navigation', 'signal', 'and', 'c', 'the', 'secret', 'message', 'is', 'undecodable', 'by', 'the', 'attacker', 'due', 'to', 'the', 'presence', 'of', 'the', 'an', 'the', 'legitimate', 'receiver', 'synchronizes', 'with', 'the', 'navigation', 'signal', 'and', 'stores', 'the', 'samples', 'of', 'the', 'authentication', 'signal', 'with', 'the', 'same', 'synchronization', 'after', 'the', 'transmission', 'of', 'the', 'authentication', 'signal', 'through', 'a', 'separate', 'public', 'asynchronous', 'authenticated', 'channel', 'eg', 'a', 'secure', 'internet', 'connection', 'additional', 'information', 'is', 'made', 'public', 'allowing', 'the', 'receiver', 'to', 'a', 'decode', 'the', 'secret', 'message', 'thus', 'overcoming', 'the', 'effects', 'of', 'an', 'and', 'b', 'verify', 'the', 'secret', 'message', 'we', 'assess', 'the', 'performance', 'of', 'the', 'proposed', 'scheme', 'by', 'the', 'analysis', 'of', 'both', 'the', 'secrecy', 'capacity', 'of', 'the', 'authentication', 'message', 'and', 'the', 'attack', 'success', 'probability', 'under', 'various', 'attack', 'scenarios', 'a', 'comparison', 'with', 'existing', 'approaches', 'shows', 'the', 'effectiveness', 'of', 'the', 'proposed', 'scheme']] | [-0.2619756353040687, -0.042027464452507726, -0.07650268571498343, 0.014628990614466895, -0.057848259438572434, -0.27063719603007264, 0.11585643906804799, 0.3378027029279055, -0.29690377080267427, -0.28688601632555477, 0.14391970749229493, -0.2906306061630297, -0.1321309975764686, 0.14594348536914853, -0.15627899466345857, 0.10903108817045436, -0.006116386598230086, 0.09065154405202566, -0.01624022642235187, -0.2834381754345477, 0.2754816417582333, 0.109175474006645, 0.3374127644358786, 0.00454387318130084, 0.115786493715896, 0.0681139650090828, -0.05310376193915315, -0.13644388578644004, -0.06062290875471639, 0.07530823248736043, 0.31630219482920235, 0.24312716599958337, 0.2634812298870523, -0.39564389991103627, -0.19952843080961494, 0.09631963559153556, 0.12257502064827037, 0.1420990276841842, -0.1234651902244271, -0.401356182004692, 0.10517847058280945, -0.22221690963605664, 2.5084436250229675e-05, 0.013798180807645272, -0.0723392938268418, 0.028794372512199306, -0.32062273039870587, -0.013389140057949011, 0.03954329672551742, 0.07571663053422893, 0.004864807534643045, 0.019557426920551055, 0.008983246969750546, 0.21269274508166644, 0.05588585226749531, 0.008498926708742863, 0.15203401110149128, -0.10626900692428039, -0.1408009545259046, 0.3716287974308179, -0.034242998018997224, -0.19236304342154076, 0.13968398349948763, -0.032365726962017664, -0.09211998519421828, 0.16262127870971319, 0.21851113346297144, 0.015133986664663136, -0.18906754639818135, -0.00465554242713772, -0.03264787200734847, 0.2593406830488638, 0.05020389482002668, 0.10222076020683303, 0.16401167386423118, 0.1443149827507729, 0.10022673841490588, 0.11919019541190466, -0.17772277469442208, -0.07406296118602364, -0.21319274013512768, -0.1530417414262157, -0.21960145931554526, -0.027521426313806024, -0.103507152325509, -0.04939990091335141, 0.3931867996163621, 0.23661654330837079, 0.14709877393754067, 0.05806354480569787, 0.4932540472916732, 0.032984214126969676, 0.05723705104284101, 0.1274600396264401, 0.22228912666270678, 0.08465834316618816, 0.10795374296963064, -0.19826043186111922, 0.17990300268866122, 0.0024852748593371925] |
1,802.04514 | Distribution of metastable states of Ising spin glasses | Local minima also known as inherent structures are expected to play an
essential role for the behavior of spin glasses. Here, we propose techniques to
efficiently sample these configurations in Monte Carlo simulations. For the
Sherrington-Kirkpatrick and the three-dimensional Edwards-Anderson model their
spectra are determined and compared to analytical results.
| cond-mat.dis-nn | local minima also known as inherent structures are expected to play an essential role for the behavior of spin glasses here we propose techniques to efficiently sample these configurations in monte carlo simulations for the sherringtonkirkpatrick and the threedimensional edwardsanderson model their spectra are determined and compared to analytical results | [['local', 'minima', 'also', 'known', 'as', 'inherent', 'structures', 'are', 'expected', 'to', 'play', 'an', 'essential', 'role', 'for', 'the', 'behavior', 'of', 'spin', 'glasses', 'here', 'we', 'propose', 'techniques', 'to', 'efficiently', 'sample', 'these', 'configurations', 'in', 'monte', 'carlo', 'simulations', 'for', 'the', 'sherringtonkirkpatrick', 'and', 'the', 'threedimensional', 'edwardsanderson', 'model', 'their', 'spectra', 'are', 'determined', 'and', 'compared', 'to', 'analytical', 'results']] | [-0.05484919540584087, 0.12434434707538458, -0.08587278907652944, 0.1663632774911821, 0.0026104123704135417, -0.0739847900532186, -0.015413296204060315, 0.44962551664561035, -0.2476611268147826, -0.3723031685873866, 0.08902177832322195, -0.29974505538120866, -0.18261305559426547, 0.19212909385096283, 0.056655410202220084, 0.09747235141694546, 0.021499774008989333, -0.05758260908536613, -0.10206033829599619, -0.21462068226188422, 0.24478238938376307, 0.13902596227824687, 0.28391643325798216, -0.009643124407157302, 0.04264907818287611, 0.034152111699804664, 0.027282274253666403, 0.029467303082346918, -0.22565056443214415, 0.08387436266988516, 0.25643376890569924, 0.011798274181783199, 0.169175473600626, -0.48090816620664556, -0.21549784476170317, 0.13444431623676792, 0.19893227182328702, 0.1565385825186968, -0.0642774659814313, -0.23231877449899913, 0.1003617692552507, -0.1446027313452214, -0.1670928831771016, -0.18999359324574472, -0.045984867098741236, 0.05003608348313719, -0.265809191018343, 0.09687672858533915, 0.0539537051320076, 0.073250434063375, -0.08747087963856756, -0.1632214896939695, -0.03743020709604025, 0.1532858657115139, 0.023719598609022795, -0.01781569553539157, 0.1096656207088381, -0.13142254965379835, -0.20186953626573087, 0.3595398059301078, 0.007047472270205617, -0.18701938148296904, 0.2284555947314948, -0.0990049985353835, -0.11821023480966687, 0.10884427884593606, 0.17448763264343142, 0.14478109531104566, -0.13891060810536146, 0.03836876112734899, 0.008751154094934464, 0.11132407465018332, -0.0897493452951312, 0.04387445698492229, 0.21137182783335448, 0.1594013093598187, -0.003351016491651535, 0.17201490905601532, -0.13625143209472299, -0.20321667861193418, -0.22073428109288215, -0.12471952591091394, -0.22473638642579316, 0.022708612792775966, -0.09674302812607494, -0.16028675988316535, 0.3661456436663866, 0.22389405399560927, 0.1630837220349349, 0.06318454695865512, 0.24367685317993165, 0.0722954131825827, 0.02759052542503923, 0.0506141949351877, 0.22571211156668142, 0.14656285773962735, 0.08104102191515267, -0.25506602132460104, 0.06512071981327608, 0.051493266187608244] |
1,802.04515 | Excitation of coherent optical phonons in iron garnet by femtosecond
laser pulses | We employed femtosecond pump probe technique to investigate the dynamics of
coherent optical phonons in iron garnet. A phenomenological symmetry-based
consideration reveals that oscillations of the terahertz T2g mode are excited.
Selective excitation by a linearly polarized pump and detection by a circularly
polarized probe confirm that impulsive stimulated Raman scattering (ISRS) is
the driving force for the coherent phonons. Experimental results obtained from
ISRS measurements reveal excellent agreement with spontaneous Raman
spectroscopy data, analyzed by considering the symmetry of the phonon modes and
corresponding excitation and detection selection rules.
| cond-mat.mtrl-sci | we employed femtosecond pump probe technique to investigate the dynamics of coherent optical phonons in iron garnet a phenomenological symmetrybased consideration reveals that oscillations of the terahertz t2g mode are excited selective excitation by a linearly polarized pump and detection by a circularly polarized probe confirm that impulsive stimulated raman scattering isrs is the driving force for the coherent phonons experimental results obtained from isrs measurements reveal excellent agreement with spontaneous raman spectroscopy data analyzed by considering the symmetry of the phonon modes and corresponding excitation and detection selection rules | [['we', 'employed', 'femtosecond', 'pump', 'probe', 'technique', 'to', 'investigate', 'the', 'dynamics', 'of', 'coherent', 'optical', 'phonons', 'in', 'iron', 'garnet', 'a', 'phenomenological', 'symmetrybased', 'consideration', 'reveals', 'that', 'oscillations', 'of', 'the', 'terahertz', 't2g', 'mode', 'are', 'excited', 'selective', 'excitation', 'by', 'a', 'linearly', 'polarized', 'pump', 'and', 'detection', 'by', 'a', 'circularly', 'polarized', 'probe', 'confirm', 'that', 'impulsive', 'stimulated', 'raman', 'scattering', 'isrs', 'is', 'the', 'driving', 'force', 'for', 'the', 'coherent', 'phonons', 'experimental', 'results', 'obtained', 'from', 'isrs', 'measurements', 'reveal', 'excellent', 'agreement', 'with', 'spontaneous', 'raman', 'spectroscopy', 'data', 'analyzed', 'by', 'considering', 'the', 'symmetry', 'of', 'the', 'phonon', 'modes', 'and', 'corresponding', 'excitation', 'and', 'detection', 'selection', 'rules']] | [-0.14069928088639344, 0.2523659800166368, -0.08007504455745221, 0.02774964590272349, -0.04275472142681894, -0.16769172861240805, 0.10930810929793451, 0.4884208112127251, -0.25189484091889525, -0.2169064956665453, -0.02064519721057473, -0.3278062427697781, -0.07762780210210217, 0.24777428625772396, 0.12469375840284758, 0.031044094419727723, 0.028313710499787703, -0.12243000863947802, 0.0617256705597457, -0.07095891306226905, 0.2516008858775927, 0.06964403029220799, 0.41508966490315896, 0.04357953783021205, 0.07553294372822468, 0.06997424300966991, -0.0398137821815908, -0.09354404039784438, -0.11492244753850779, 0.07337962871210443, 0.2933917794738793, -0.06997645452308159, 0.17247473212579886, -0.4490538072461883, -0.27349281676320564, -0.027773094622211322, 0.1495185520040751, 0.21420936013261477, -0.08925948375836015, -0.33034283067617154, -0.050601803335464664, -0.0823787933684394, -0.1228822169928915, -0.130400371670516, -0.029255682338650026, 0.017534107983940176, -0.28776225809835726, 0.06091818595305085, 0.013918483050333129, 0.09663010745619734, -0.1289107693462736, -0.018142548162076208, -0.10088336940130425, -0.024414553151776392, 0.05951965237295048, -0.0015468856733706262, 0.1901678169107375, -0.08844895881807638, -0.15466054282668565, 0.3671377061969704, -0.14714134444948285, -0.022973254995627537, 0.1357821013364527, -0.17136014885812376, -0.019736643712450232, 0.25491814071105584, 0.10353785717032021, 0.14618319421489206, -0.11045245719659659, -0.029712557165961093, -0.020901166890851326, 0.2331857845911549, 0.1329913416929129, 0.14011308806940279, 0.20625276782860358, 0.1750355258739243, -0.05113040850394302, 0.15074755389295105, -0.14104913572470348, 0.022567684757005838, -0.24151709740981459, -0.02799961773885621, -0.17642989928103311, 0.07130718567512101, 0.0006224686336483703, -0.051750026795909634, 0.4211871425310771, 0.09394517974902152, 0.12382307701983437, -0.08069463516068127, 0.346926432599624, 0.16210882954894462, 0.03071107197449439, -0.05171873378567397, 0.3741503810717, 0.23697512002222032, 0.06611488508060574, -0.40950435210898933, -0.025454379147332576, -0.051252642072116335] |
1,802.04516 | Arbitrary high order accurate space-time discontinuous Galerkin finite
element schemes on staggered unstructured meshes for linear elasticity | In this paper we propose a new high order accurate space-time DG finite
element scheme for the solution of the linear elastic wave equations in first
order velocity-stress formulation in two and three-space dimensions on
staggered unstructured triangular and tetrahedral meshes. The method reaches
arbitrary high order of accuracy in both space and time via the use of
space-time basis and test functions. Within the staggered mesh formulation, we
define the discrete velocity field in the control volumes of a primary mesh,
while the discrete stress tensor is defined on a face-based staggered dual
mesh. The space-time DG formulation leads to an implicit scheme that requires
the solution of a linear system for the unknown degrees of freedom at the new
time level. The number of unknowns is reduced at the aid of the Schur
complement, so that in the end only a linear system for the degrees of freedom
of the velocity field needs to be solved. Thanks to the use of a spatially
staggered mesh, the stencil of the final velocity system involves only the
element and its direct neighbors. The resulting linear system can be
efficiently solved via matrix-free iterative methods. The chosen discretization
and the linear nature of the governing PDE system lead to an unconditionally
stable scheme, which allows large time steps even for low quality meshes that
contain sliver elements. The fully discrete staggered space-time DG method is
proven to be energy stable for any order of accuracy, for any mesh and for any
time step size. For the particular case of Crank-Nicolson time discretization
and homogeneous material, the final velocity system can be proven to be
symmetric and positive definite and in this case the scheme is also exactly
energy preserving. The new scheme is applied to several test problems in two
and three space dimensions, providing also a comparison with high order
explicit ADER-DG schemes
| math.NA | in this paper we propose a new high order accurate spacetime dg finite element scheme for the solution of the linear elastic wave equations in first order velocitystress formulation in two and threespace dimensions on staggered unstructured triangular and tetrahedral meshes the method reaches arbitrary high order of accuracy in both space and time via the use of spacetime basis and test functions within the staggered mesh formulation we define the discrete velocity field in the control volumes of a primary mesh while the discrete stress tensor is defined on a facebased staggered dual mesh the spacetime dg formulation leads to an implicit scheme that requires the solution of a linear system for the unknown degrees of freedom at the new time level the number of unknowns is reduced at the aid of the schur complement so that in the end only a linear system for the degrees of freedom of the velocity field needs to be solved thanks to the use of a spatially staggered mesh the stencil of the final velocity system involves only the element and its direct neighbors the resulting linear system can be efficiently solved via matrixfree iterative methods the chosen discretization and the linear nature of the governing pde system lead to an unconditionally stable scheme which allows large time steps even for low quality meshes that contain sliver elements the fully discrete staggered spacetime dg method is proven to be energy stable for any order of accuracy for any mesh and for any time step size for the particular case of cranknicolson time discretization and homogeneous material the final velocity system can be proven to be symmetric and positive definite and in this case the scheme is also exactly energy preserving the new scheme is applied to several test problems in two and three space dimensions providing also a comparison with high order explicit aderdg schemes | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'high', 'order', 'accurate', 'spacetime', 'dg', 'finite', 'element', 'scheme', 'for', 'the', 'solution', 'of', 'the', 'linear', 'elastic', 'wave', 'equations', 'in', 'first', 'order', 'velocitystress', 'formulation', 'in', 'two', 'and', 'threespace', 'dimensions', 'on', 'staggered', 'unstructured', 'triangular', 'and', 'tetrahedral', 'meshes', 'the', 'method', 'reaches', 'arbitrary', 'high', 'order', 'of', 'accuracy', 'in', 'both', 'space', 'and', 'time', 'via', 'the', 'use', 'of', 'spacetime', 'basis', 'and', 'test', 'functions', 'within', 'the', 'staggered', 'mesh', 'formulation', 'we', 'define', 'the', 'discrete', 'velocity', 'field', 'in', 'the', 'control', 'volumes', 'of', 'a', 'primary', 'mesh', 'while', 'the', 'discrete', 'stress', 'tensor', 'is', 'defined', 'on', 'a', 'facebased', 'staggered', 'dual', 'mesh', 'the', 'spacetime', 'dg', 'formulation', 'leads', 'to', 'an', 'implicit', 'scheme', 'that', 'requires', 'the', 'solution', 'of', 'a', 'linear', 'system', 'for', 'the', 'unknown', 'degrees', 'of', 'freedom', 'at', 'the', 'new', 'time', 'level', 'the', 'number', 'of', 'unknowns', 'is', 'reduced', 'at', 'the', 'aid', 'of', 'the', 'schur', 'complement', 'so', 'that', 'in', 'the', 'end', 'only', 'a', 'linear', 'system', 'for', 'the', 'degrees', 'of', 'freedom', 'of', 'the', 'velocity', 'field', 'needs', 'to', 'be', 'solved', 'thanks', 'to', 'the', 'use', 'of', 'a', 'spatially', 'staggered', 'mesh', 'the', 'stencil', 'of', 'the', 'final', 'velocity', 'system', 'involves', 'only', 'the', 'element', 'and', 'its', 'direct', 'neighbors', 'the', 'resulting', 'linear', 'system', 'can', 'be', 'efficiently', 'solved', 'via', 'matrixfree', 'iterative', 'methods', 'the', 'chosen', 'discretization', 'and', 'the', 'linear', 'nature', 'of', 'the', 'governing', 'pde', 'system', 'lead', 'to', 'an', 'unconditionally', 'stable', 'scheme', 'which', 'allows', 'large', 'time', 'steps', 'even', 'for', 'low', 'quality', 'meshes', 'that', 'contain', 'sliver', 'elements', 'the', 'fully', 'discrete', 'staggered', 'spacetime', 'dg', 'method', 'is', 'proven', 'to', 'be', 'energy', 'stable', 'for', 'any', 'order', 'of', 'accuracy', 'for', 'any', 'mesh', 'and', 'for', 'any', 'time', 'step', 'size', 'for', 'the', 'particular', 'case', 'of', 'cranknicolson', 'time', 'discretization', 'and', 'homogeneous', 'material', 'the', 'final', 'velocity', 'system', 'can', 'be', 'proven', 'to', 'be', 'symmetric', 'and', 'positive', 'definite', 'and', 'in', 'this', 'case', 'the', 'scheme', 'is', 'also', 'exactly', 'energy', 'preserving', 'the', 'new', 'scheme', 'is', 'applied', 'to', 'several', 'test', 'problems', 'in', 'two', 'and', 'three', 'space', 'dimensions', 'providing', 'also', 'a', 'comparison', 'with', 'high', 'order', 'explicit', 'aderdg', 'schemes']] | [-0.13906425644105044, 0.08095632858967525, -0.08257187546614689, -0.0011009738275471826, -0.06384948067316494, -0.1276846123270143, 0.012131894043774698, 0.3658973066546856, -0.29348446199218164, -0.28672605471167795, 0.127008595366995, -0.19634230937679506, -0.08190953805514525, 0.14878717788789694, -0.03970387860010869, 0.08040662174252199, 0.06503711800617627, 0.022383865088033982, -0.0982569755507282, -0.273547332202004, 0.3243551011927747, 0.03804889500599366, 0.2636587204472623, 0.02429879429235388, 0.17579701751025734, -0.03027879492920517, -0.025022338058192508, 0.06161500521345635, -0.063476222888216, 0.10740954038752511, 0.23292619274994628, 0.03379983970257171, 0.26141956278953116, -0.4284490815604838, -0.19981252246673187, 0.07153520017070844, 0.15113375737955168, 0.14197730387638385, -0.02352770941239743, -0.24150391422009793, 0.11299358768137202, -0.16256700355720263, -0.170553066369039, -0.10621984795735667, -0.02440097922468171, 0.009009504547757737, -0.32354554015333753, 0.06620441268930158, 0.03411012512450211, 0.04308023244870035, -0.04869738927117724, -0.09338750436339682, -0.024694274270389314, 0.11580432257124076, -0.009790258350433966, 0.040961092534440066, 0.021414630915434024, -0.08663860827345199, -0.08369013426093438, 0.4298486799305192, -0.04964432516098082, -0.3034004284211765, 0.17138529596359323, -0.10949255183068352, -0.0808238771561081, 0.1631483337081323, 0.21347161644278242, 0.18265340443902883, -0.09834879144323996, 0.11473338009397939, -0.0019327249223520361, 0.20202182499005997, 0.05211250950841192, 0.014014578537462047, 0.12726792126980285, 0.1496715852306388, 0.14377673585176134, 0.08948111455529012, -0.07047185473205052, -0.11335774350200241, -0.3188657820754396, -0.20783811091469004, -0.19095129714445613, -0.02190016500322489, -0.1683995844503867, -0.17317462110290893, 0.3955065802584982, 0.12850089370534895, 0.12571039796786787, 0.043312216744781994, 0.30755628338128255, 0.15197847290529895, 0.0504936637392583, 0.08983159097976769, 0.18139477366932666, 0.13419378953970992, 0.11012869146235954, -0.24312245804026497, 0.020665917931624447, 0.16595007954299235] |
1,802.04517 | The spectral localizer for even index pairings | Even index pairings are integer-valued homotopy invariants combining an even
Fredholm module with a $K_0$-class specified by a projection. Numerous
classical examples are known from differential and non-commutative geometry and
physics. Here it is shown how to construct a finite dimensional selfadjoint and
invertible matrix, called the spectral localizer, such that half its signature
is equal to the even index pairing. This makes the invariant numerically
accessible. The index-theoretic proof heavily uses fuzzy spheres.
| math-ph math.FA math.KT math.MP | even index pairings are integervalued homotopy invariants combining an even fredholm module with a k_0class specified by a projection numerous classical examples are known from differential and noncommutative geometry and physics here it is shown how to construct a finite dimensional selfadjoint and invertible matrix called the spectral localizer such that half its signature is equal to the even index pairing this makes the invariant numerically accessible the indextheoretic proof heavily uses fuzzy spheres | [['even', 'index', 'pairings', 'are', 'integervalued', 'homotopy', 'invariants', 'combining', 'an', 'even', 'fredholm', 'module', 'with', 'a', 'k_0class', 'specified', 'by', 'a', 'projection', 'numerous', 'classical', 'examples', 'are', 'known', 'from', 'differential', 'and', 'noncommutative', 'geometry', 'and', 'physics', 'here', 'it', 'is', 'shown', 'how', 'to', 'construct', 'a', 'finite', 'dimensional', 'selfadjoint', 'and', 'invertible', 'matrix', 'called', 'the', 'spectral', 'localizer', 'such', 'that', 'half', 'its', 'signature', 'is', 'equal', 'to', 'the', 'even', 'index', 'pairing', 'this', 'makes', 'the', 'invariant', 'numerically', 'accessible', 'the', 'indextheoretic', 'proof', 'heavily', 'uses', 'fuzzy', 'spheres']] | [-0.12437988137920715, 0.13946836745870658, -0.1013440524253088, 0.15156954312476809, -0.11790395009557943, -0.21512604567750887, -0.04504326652936839, 0.3546746757787627, -0.3180389904505196, -0.22746220412286552, 0.1476416543796281, -0.2719845153592728, -0.20419777237583656, 0.16950985658410433, -0.1159469733593633, 0.041943773752349, 0.0036788376180354404, 0.08560075179824757, -0.10685650935094501, -0.2350951095451475, 0.38624574756249785, 0.012994147594892294, 0.21048051340261048, 0.02509279561707297, 0.11492069699877017, 0.024979034325460326, -0.06872533341221562, 0.015974086290854658, -0.11370237414686582, 0.12420302066587012, 0.30839305486832114, 0.04761752248993395, 0.17620479119186466, -0.32552372490534104, -0.14212120274031484, 0.1418506052184573, 0.12149823221025637, 0.040434369439812934, -0.03733673526880306, -0.26723926209819476, 0.10749489892072775, -0.21126698260824825, -0.13005524312422886, -0.12703262018732023, 0.039845398131669874, -0.03505587063704592, -0.24994312910161712, -0.026379611034802086, 0.09492397168651223, 0.08163572497967933, -0.009607751789263676, -0.08214699841935087, -0.04036670901837784, 0.04686392319539713, -0.02697035433674181, -0.013024911334788477, 0.10673128125710866, -0.04359416491668624, -0.12095577575618753, 0.3405824909789009, -0.01655220626727552, -0.2620114973727362, 0.1803799375791002, -0.09657685668207705, -0.08713044002778023, 0.14064692564912745, 0.011788229873353566, 0.16089445586014237, -0.06966420737837718, 0.17916376627997394, -0.08732852812327847, 0.1998462927452213, 0.057770434615982545, 0.018160478222951595, 0.1571408334263676, 0.07347012891408962, 0.0949103203853844, 0.12878634741630507, -0.016125466929421434, -0.11135520523955189, -0.30480083633163896, -0.16657820563587183, -0.20153894301227018, 0.1072794186404428, -0.0843015784278553, -0.2150488112611866, 0.3984143714344985, 0.08661108855252482, 0.1844430192549889, 0.07660885382368154, 0.279601760988904, 0.14841605549225131, 0.06278970184723369, 0.05810250684845488, 0.16919513474646453, 0.21488855169091775, 0.044493178881050366, -0.1138283669967456, 0.005998173980294047, 0.19526090525795478] |
1,802.04518 | Spectral flow argument localizing an odd index pairing | An odd Fredholm module for a given invertible operator on a Hilbert space is
specified by an unbounded so-called Dirac operator with compact resolvent and
bounded commutator with the given invertible. Associated to this is an index
pairing in terms of a Fredholm operator with Noether index. Here it is shown by
a spectral flow argument how this index can be calculated as the signature of a
finite dimensional matrix called the spectral localizer.
| math-ph math.FA math.KT math.MP | an odd fredholm module for a given invertible operator on a hilbert space is specified by an unbounded socalled dirac operator with compact resolvent and bounded commutator with the given invertible associated to this is an index pairing in terms of a fredholm operator with noether index here it is shown by a spectral flow argument how this index can be calculated as the signature of a finite dimensional matrix called the spectral localizer | [['an', 'odd', 'fredholm', 'module', 'for', 'a', 'given', 'invertible', 'operator', 'on', 'a', 'hilbert', 'space', 'is', 'specified', 'by', 'an', 'unbounded', 'socalled', 'dirac', 'operator', 'with', 'compact', 'resolvent', 'and', 'bounded', 'commutator', 'with', 'the', 'given', 'invertible', 'associated', 'to', 'this', 'is', 'an', 'index', 'pairing', 'in', 'terms', 'of', 'a', 'fredholm', 'operator', 'with', 'noether', 'index', 'here', 'it', 'is', 'shown', 'by', 'a', 'spectral', 'flow', 'argument', 'how', 'this', 'index', 'can', 'be', 'calculated', 'as', 'the', 'signature', 'of', 'a', 'finite', 'dimensional', 'matrix', 'called', 'the', 'spectral', 'localizer']] | [-0.11955910717055353, 0.16484306429137596, -0.0804834318397617, 0.08098469320464426, -0.1101156850722996, -0.14888005345631894, -0.055836315896060015, 0.360944322536926, -0.3182062436197255, -0.16707892295577237, 0.12488932097550935, -0.26195769249839157, -0.17672916778640166, 0.15381532313453183, -0.1314201601466315, 0.04473100750505723, 0.038071968768899504, 0.13329724189699502, -0.12562482814128334, -0.1641705528316969, 0.4460978832196545, 0.04483535108030648, 0.1784926029488545, 0.0746393505093717, 0.12309438151282233, 0.0021740311404337756, -0.01887203915346716, -0.005780541810373826, -0.06689845957894372, 0.14456702579077133, 0.2865969632135553, 0.04938479804282857, 0.24427462444716208, -0.32841238736904954, -0.18669212437108965, 0.1729824142027143, 0.16163671155132958, -0.05453420453075621, -0.047419279972657664, -0.30458056780736187, 0.12909089840596188, -0.2299843871009511, -0.16764988602969694, -0.06994319160003215, 0.05579996484054907, -0.04976842736800176, -0.31966544249774637, 0.011256119160837418, 0.09644617762013867, 0.07165423312501328, -0.07813167419108386, -0.04036492310036477, -0.06261792082364696, 0.0379117912285634, -0.02960632587594257, 0.01518682632957132, 0.043372595298884285, -0.035544996459459466, -0.10830386390758527, 0.32992704846657106, -0.09905363307444605, -0.3003112062358776, 0.049741511497445205, -0.10696960769190982, -0.06246181153314742, 0.0901442738249898, 0.03824103785351523, 0.15358121902052616, -0.09042893968069472, 0.18624634121944247, -0.10413391729565086, 0.17411173280718661, 0.04714479276004273, 0.020084098915921878, 0.11543332208954804, 0.07770021067227463, 0.15364230346135996, 0.1295458843626359, 0.012869371833575487, -0.010563262231723481, -0.3708863593637943, -0.19925501178698363, -0.26428029575460665, 0.1159935438804127, -0.15271107025575867, -0.2527908519979384, 0.440756232647628, 0.043268511668823006, 0.21846271006742846, 0.056669206950008065, 0.22871326609841874, 0.28511027353217927, 0.07341998336031227, 0.08090174188160941, 0.11379464083930126, 0.20606754330691654, 0.07832454402326934, -0.19295365873069778, -0.01581846414184248, 0.24343712576975687] |
1,802.04519 | The Chow ring of the stack of hyperelliptic curves of odd genus | We find a new presentation of the stack of hyperelliptic curves of odd genus
as a quotient stack and we use it to compute its integral Chow ring by means of
equivariant intersection theory.
| math.AG | we find a new presentation of the stack of hyperelliptic curves of odd genus as a quotient stack and we use it to compute its integral chow ring by means of equivariant intersection theory | [['we', 'find', 'a', 'new', 'presentation', 'of', 'the', 'stack', 'of', 'hyperelliptic', 'curves', 'of', 'odd', 'genus', 'as', 'a', 'quotient', 'stack', 'and', 'we', 'use', 'it', 'to', 'compute', 'its', 'integral', 'chow', 'ring', 'by', 'means', 'of', 'equivariant', 'intersection', 'theory']] | [-0.23990328687753337, -0.030762289897264802, -0.18166434422464056, 0.09531363902394385, -0.11304264255415868, -0.1327583242673427, 0.02580171002773568, 0.32958995928878293, -0.3694877853507505, -0.24147249780157032, 0.08793641224174815, -0.2249932959675789, -0.18495774630676298, 0.24295250074390104, -0.17517232215579817, -0.031071132324594894, 0.003394438440034933, 0.06049164491431678, -0.11646712820648271, -0.35016505810113707, 0.4276984349468394, -0.03747041129014071, 0.1905223585131085, 0.025094345800907296, 0.12118985723046695, 0.0725960842169383, -0.028327235363095123, -0.013007067801321255, -0.167927425039713, 0.18483040665331132, 0.32606035817469303, 0.04661777634721469, 0.0984835325165049, -0.41803537320126505, -0.11504469414734665, 0.1714033704278443, 0.13188276319381068, 0.008974035434863147, 0.02402109734933166, -0.15564760965678623, 0.10329035895547885, -0.2560548460220589, -0.24656889224698877, -0.12506850072018363, 0.09481489110518904, 0.04566704873543452, -0.11210744504762046, -0.1150637095218853, 0.011639116222367567, 0.22213594440151663, -0.01859559036914588, -0.05987860248698031, -0.1137611804091755, 0.050251494517878574, 0.000851072754491778, 0.05486606479184154, 0.10426087992484956, -0.1398334944730296, -0.09098027705434053, 0.3429316978162045, -0.13048844398273265, -0.1209948270526879, 0.0358633665532312, -0.10197759626488037, -0.11130355791572262, 0.15957739795832074, 0.0719860397717532, 0.2294921454261331, 0.05784284307018799, 0.17822991990696585, -0.12158110625494052, 0.07142854766810641, 0.0943352255203268, -0.04960239158176324, 0.1684994515415062, 0.09685808469486587, 0.036518144271480306, 0.1996494049569318, -0.04585644460338004, 0.0045288645607583665, -0.37647237957400437, -0.2813795249470893, -0.09916933664285085, 0.20972872198121073, -0.09612731164045674, -0.2022403621060007, 0.4437085926423178, 0.054839974159703535, 0.15894056256750927, 0.14694537392214818, 0.2852086249519797, 0.06910787971676602, 0.060540426207487195, 0.05368550971102463, 0.08463704372372698, 0.21919511357897564, -0.07821109940243118, -0.14212256935699022, -0.07366631673101116, 0.27371844782165305] |
1,802.0452 | Learning Robust and Adaptive Real-World Continuous Control Using
Simulation and Transfer Learning | We use model-free reinforcement learning, extensive simulation, and transfer
learning to develop a continuous control algorithm that has good zero-shot
performance in a real physical environment. We train a simulated agent to act
optimally across a set of similar environments, each with dynamics drawn from a
prior distribution. We propose that the agent is able to adjust its actions
almost immediately, based on small set of observations. This robust and
adaptive behavior is enabled by using a policy gradient algorithm with an Long
Short Term Memory (LSTM) function approximation. Finally, we train an agent to
navigate a two-dimensional environment with uncertain dynamics and noisy
observations. We demonstrate that this agent has good zero-shot performance in
a real physical environment. Our preliminary results indicate that the agent is
able to infer the environmental dynamics after only a few timesteps, and adjust
its actions accordingly.
| cs.AI | we use modelfree reinforcement learning extensive simulation and transfer learning to develop a continuous control algorithm that has good zeroshot performance in a real physical environment we train a simulated agent to act optimally across a set of similar environments each with dynamics drawn from a prior distribution we propose that the agent is able to adjust its actions almost immediately based on small set of observations this robust and adaptive behavior is enabled by using a policy gradient algorithm with an long short term memory lstm function approximation finally we train an agent to navigate a twodimensional environment with uncertain dynamics and noisy observations we demonstrate that this agent has good zeroshot performance in a real physical environment our preliminary results indicate that the agent is able to infer the environmental dynamics after only a few timesteps and adjust its actions accordingly | [['we', 'use', 'modelfree', 'reinforcement', 'learning', 'extensive', 'simulation', 'and', 'transfer', 'learning', 'to', 'develop', 'a', 'continuous', 'control', 'algorithm', 'that', 'has', 'good', 'zeroshot', 'performance', 'in', 'a', 'real', 'physical', 'environment', 'we', 'train', 'a', 'simulated', 'agent', 'to', 'act', 'optimally', 'across', 'a', 'set', 'of', 'similar', 'environments', 'each', 'with', 'dynamics', 'drawn', 'from', 'a', 'prior', 'distribution', 'we', 'propose', 'that', 'the', 'agent', 'is', 'able', 'to', 'adjust', 'its', 'actions', 'almost', 'immediately', 'based', 'on', 'small', 'set', 'of', 'observations', 'this', 'robust', 'and', 'adaptive', 'behavior', 'is', 'enabled', 'by', 'using', 'a', 'policy', 'gradient', 'algorithm', 'with', 'an', 'long', 'short', 'term', 'memory', 'lstm', 'function', 'approximation', 'finally', 'we', 'train', 'an', 'agent', 'to', 'navigate', 'a', 'twodimensional', 'environment', 'with', 'uncertain', 'dynamics', 'and', 'noisy', 'observations', 'we', 'demonstrate', 'that', 'this', 'agent', 'has', 'good', 'zeroshot', 'performance', 'in', 'a', 'real', 'physical', 'environment', 'our', 'preliminary', 'results', 'indicate', 'that', 'the', 'agent', 'is', 'able', 'to', 'infer', 'the', 'environmental', 'dynamics', 'after', 'only', 'a', 'few', 'timesteps', 'and', 'adjust', 'its', 'actions', 'accordingly']] | [-0.05476216170318112, 0.039138434290555406, -0.13569639572528536, 0.03855813017368994, -0.1397515902673448, -0.17954787708675632, 0.09315690313876196, 0.5238729394659712, -0.28047337871487743, -0.31211065599968385, 0.0826930429255655, -0.2290320249919135, -0.20534033616158096, 0.15674586425424664, -0.1259342560404586, 0.05611173458107571, 0.11796421291782046, 0.05465592112525698, -0.01355923087030024, -0.29004889480457025, 0.25849374519153073, 0.07079369850925632, 0.26746177293972434, -0.0341187208708558, 0.20802399431114327, -0.002891438682661294, 0.02409374405193579, 0.0012478865683078766, -0.0680503387737228, 0.10283163027720643, 0.27312811282202865, 0.16582723946304068, 0.3743191437496172, -0.42673236682320703, -0.2297930364803105, 0.09236967804926363, 0.09670609123581513, 0.10442789293291581, -0.07539398896986606, -0.3244145314072396, 0.06823350482626811, -0.20669405547237688, -0.059590752926896084, -0.1295354821087493, -0.003967000412030375, 0.019513767679918793, -0.33143048046459606, -0.02962329044210212, 0.011368705350514893, 0.02770721950483593, -0.09695982250020273, -0.04388429096027219, 0.0487144938165361, 0.20958530446319104, 0.01223320699414121, 0.06790906090250277, 0.19503244094776928, -0.11705591714895376, -0.12623938947095426, 0.33996599370783026, -0.08734992290952835, -0.21390564881681978, 0.24731135517651853, -0.07188559579825797, -0.11911827082895524, 0.09826021117542486, 0.2396379289562469, 0.1285658860579133, -0.16749667901858376, 0.013716241678587728, -0.06589805947655773, 0.21784047993434058, -0.04292572300776944, -0.034963270571160984, 0.16557515426571448, 0.2505112251566423, 0.08164111109307179, 0.14079484817493784, -0.05885987494049685, -0.13080022839659994, -0.23289264923521688, -0.09181146605031473, -0.1989532960155471, 0.04663478116784896, -0.10314913092700478, -0.12812034311294035, 0.3811593039573489, 0.26667745423770245, 0.24151511603015494, 0.12572868076341154, 0.3555390845749762, 0.04408410131231999, 0.054378142456647814, 0.12252014055620175, 0.17247088048997875, 0.021803068488810237, 0.11865953857834627, -0.22754131005327966, 0.12515495733970164, -0.007529023077364985] |
1,802.04521 | An adaptive Euler-Maruyama scheme for stochastic differential equations
with discontinuous drift and its convergence analysis | We study the strong approximation of stochastic differential equations with
discontinuous drift coefficients and (possibly) degenerate diffusion
coefficients. To account for the discontinuity of the drift coefficient we
construct an adaptive step sizing strategy for the explicit Euler-Maruyama
scheme. As a result, we obtain a numerical method which has -- up to
logarithmic terms -- strong convergence order $1/2$ with respect to the average
computational cost. We support our theoretical findings with several numerical
examples.
| math.NA math.PR | we study the strong approximation of stochastic differential equations with discontinuous drift coefficients and possibly degenerate diffusion coefficients to account for the discontinuity of the drift coefficient we construct an adaptive step sizing strategy for the explicit eulermaruyama scheme as a result we obtain a numerical method which has up to logarithmic terms strong convergence order 12 with respect to the average computational cost we support our theoretical findings with several numerical examples | [['we', 'study', 'the', 'strong', 'approximation', 'of', 'stochastic', 'differential', 'equations', 'with', 'discontinuous', 'drift', 'coefficients', 'and', 'possibly', 'degenerate', 'diffusion', 'coefficients', 'to', 'account', 'for', 'the', 'discontinuity', 'of', 'the', 'drift', 'coefficient', 'we', 'construct', 'an', 'adaptive', 'step', 'sizing', 'strategy', 'for', 'the', 'explicit', 'eulermaruyama', 'scheme', 'as', 'a', 'result', 'we', 'obtain', 'a', 'numerical', 'method', 'which', 'has', 'up', 'to', 'logarithmic', 'terms', 'strong', 'convergence', 'order', '12', 'with', 'respect', 'to', 'the', 'average', 'computational', 'cost', 'we', 'support', 'our', 'theoretical', 'findings', 'with', 'several', 'numerical', 'examples']] | [-0.1121075751502322, -0.009129385570541012, -0.0721688562595885, 0.018512724984870995, -0.09329686691499736, -0.13420373100583274, 0.04748998335060306, 0.3844730661646144, -0.29320936812062376, -0.2696180412241207, 0.11661555550431144, -0.2718668396661237, -0.15380887071959265, 0.19890495902565244, -0.04555903995179967, 0.12021388386516538, 0.048919033871529856, -0.029046598171228417, -0.09494511407165317, -0.2827999162334592, 0.2736037341600335, 0.07287377019553151, 0.2192272125705056, 0.054216514552037604, 0.1825835716859629, -0.07826044768962549, -0.06066898231024612, 0.042061633902461565, -0.19313230374445245, 0.12081382934909875, 0.2250706829666479, -0.024839404447335903, 0.34933928885076143, -0.39891766874145157, -0.1957201885620821, 0.06457462518042183, 0.10892923862620717, 0.15044499702643194, -0.09386365717174867, -0.2359959751444116, 0.09471924314658119, -0.19244546191894438, -0.19900199235098004, -0.15046477004286055, -0.030889069935791706, 0.08074260540450094, -0.38483226988209435, 0.10641295978263633, 0.07471789732218197, 0.029845848003376838, -0.07064782264833785, -0.11206041374052428, 0.04974588681305822, 0.09211190898379643, 0.07601334947824784, -0.002267067929831882, 0.051414563094125426, -0.07339434676535733, -0.13720048693557307, 0.3311527185779932, -0.1453202289787491, -0.2752786101135489, 0.18424523158687844, -0.13115856933011993, -0.1072230528249112, 0.19729157521912496, 0.22644761524941415, 0.13085917536845457, -0.10685033306530485, 0.05554659979031995, -0.008818304210850229, 0.1378102233148601, 0.04198061257651816, -0.0015927160681824977, 0.033781143543246676, 0.13460200741147138, 0.14236669801175594, 0.1094329191486619, -0.06647542261276139, -0.16065313704694584, -0.3656422820911832, -0.1795237396065503, -0.10557041183267146, 0.027729879771295474, -0.16974533404752273, -0.17826099318535105, 0.3445105470243219, 0.14596226909644391, 0.17978948062566452, 0.12081885271488804, 0.2971021355231841, 0.2439920945054762, 0.00024198003317395302, 0.0673434443991912, 0.17472162838923197, 0.15861765318231225, 0.09979507375559578, -0.2754357185929197, 0.085445528798928, 0.1386211791828479] |
1,802.04522 | Computing controlled invariant sets for hybrid systems with applications
to model-predictive control | In this paper, we develop a method for computing controlled invariant sets
using Semidefinite Programming. We apply our method to the controller design
problem for switching affine systems with polytopic safe sets. The task is
reduced to a semidefinite programming problem by enforcing an invariance
relation in the dual space of the geometric problem. The paper ends with an
application to safety critical model predictive control.
| math.OC | in this paper we develop a method for computing controlled invariant sets using semidefinite programming we apply our method to the controller design problem for switching affine systems with polytopic safe sets the task is reduced to a semidefinite programming problem by enforcing an invariance relation in the dual space of the geometric problem the paper ends with an application to safety critical model predictive control | [['in', 'this', 'paper', 'we', 'develop', 'a', 'method', 'for', 'computing', 'controlled', 'invariant', 'sets', 'using', 'semidefinite', 'programming', 'we', 'apply', 'our', 'method', 'to', 'the', 'controller', 'design', 'problem', 'for', 'switching', 'affine', 'systems', 'with', 'polytopic', 'safe', 'sets', 'the', 'task', 'is', 'reduced', 'to', 'a', 'semidefinite', 'programming', 'problem', 'by', 'enforcing', 'an', 'invariance', 'relation', 'in', 'the', 'dual', 'space', 'of', 'the', 'geometric', 'problem', 'the', 'paper', 'ends', 'with', 'an', 'application', 'to', 'safety', 'critical', 'model', 'predictive', 'control']] | [-0.1212453670573957, -0.006026978840412939, -0.08883029738949104, 0.03664539031910174, -0.10480013320391829, -0.16733213261503613, 0.059540491247775426, 0.3484218257168929, -0.37644432631857466, -0.30136629145338456, 0.15892956992650975, -0.2119610315880202, -0.2048767136028883, 0.19984863658619084, -0.17159109744666654, 0.16512018704617565, 0.026829475335861473, -0.028778843250069203, -0.12009338125812286, -0.2367279457887917, 0.34707527711394837, 0.006498295856131749, 0.27375063566124125, 0.03735226247579593, 0.16657245492873093, 0.038411697344572254, 0.06850210193431738, 0.06342417843574588, -0.11526354780124332, 0.197069791986988, 0.32059773112379125, 0.21157337821116953, 0.31920226223089476, -0.3939063549323967, -0.12431900812820955, 0.12192980681037156, 0.1089819188116852, 0.1021875521365666, -0.04694267547209606, -0.26927917456310807, 0.12218526260447547, -0.15785966802275542, -0.1096633636378542, -0.09485377076745147, -0.02824256301039096, -0.10336781724948775, -0.3220185040933729, -0.032485435349923195, 0.03325080446136946, 0.08876071991681149, -0.10344056699029876, -0.04026709224633647, 0.05620418521787294, 0.08759239052111904, 0.00013523453768963614, 0.06106047810647975, 0.13036214774756721, -0.04621196580189986, -0.20093598927963863, 0.3632755753668872, -0.005151358785841501, -0.3037419551701257, 0.14429906615281873, -0.020665044564697328, -0.17555608922107654, 0.06230167681210195, 0.24749499837388145, 0.15998481157602687, -0.17639197360470213, 0.12046131406995383, -0.04411109337921847, 0.1462685930768423, 0.003652002122676508, -0.03295024995212302, 0.17332385483578863, 0.24528951694568, 0.1988462385382842, 0.20805110256752055, 0.031232660156533573, -0.09476068690348642, -0.30178495694064733, -0.11928057876613105, -0.16222997274334458, -0.03679431786506691, -0.09445582334460183, -0.1683538212426797, 0.3750885115922288, 0.17221111879034928, 0.12138766604899005, 0.18662360021985616, 0.3475600852433479, 0.18309121365327333, 0.03708251087333669, 0.10477491880848186, 0.15203298537314616, 0.11724813085289276, 0.09896343748903635, -0.28098473122879636, 0.04668201858206003, 0.11724966784205401] |
1,802.04523 | Phase Mixing of Large Amplitude Relativistic Electron Plasma Oscillation
With Inhomogeneous Ion Background | Phase mixing of relativistic large amplitude nonlinear plasma wave in
presence of a time independent space periodic ion density profile has been
investigated. Inhomogeneous ion along with the relativistic variation of
electron mass make the characteristic frequency of the wave to acquire a space
dependency and thereby it breaks at arbitrarily small amplitude due to phase
mixing. An approximate space time dependent solution is obtained in the weakly
relativistic limit by Bogoliuboff and Kryloff method of averaging. We find that
the change in the ion density perturbation and also the relativistic electron
mass variation have significant effect in modifying the time at which phase
mixing occurs.
| physics.plasm-ph | phase mixing of relativistic large amplitude nonlinear plasma wave in presence of a time independent space periodic ion density profile has been investigated inhomogeneous ion along with the relativistic variation of electron mass make the characteristic frequency of the wave to acquire a space dependency and thereby it breaks at arbitrarily small amplitude due to phase mixing an approximate space time dependent solution is obtained in the weakly relativistic limit by bogoliuboff and kryloff method of averaging we find that the change in the ion density perturbation and also the relativistic electron mass variation have significant effect in modifying the time at which phase mixing occurs | [['phase', 'mixing', 'of', 'relativistic', 'large', 'amplitude', 'nonlinear', 'plasma', 'wave', 'in', 'presence', 'of', 'a', 'time', 'independent', 'space', 'periodic', 'ion', 'density', 'profile', 'has', 'been', 'investigated', 'inhomogeneous', 'ion', 'along', 'with', 'the', 'relativistic', 'variation', 'of', 'electron', 'mass', 'make', 'the', 'characteristic', 'frequency', 'of', 'the', 'wave', 'to', 'acquire', 'a', 'space', 'dependency', 'and', 'thereby', 'it', 'breaks', 'at', 'arbitrarily', 'small', 'amplitude', 'due', 'to', 'phase', 'mixing', 'an', 'approximate', 'space', 'time', 'dependent', 'solution', 'is', 'obtained', 'in', 'the', 'weakly', 'relativistic', 'limit', 'by', 'bogoliuboff', 'and', 'kryloff', 'method', 'of', 'averaging', 'we', 'find', 'that', 'the', 'change', 'in', 'the', 'ion', 'density', 'perturbation', 'and', 'also', 'the', 'relativistic', 'electron', 'mass', 'variation', 'have', 'significant', 'effect', 'in', 'modifying', 'the', 'time', 'at', 'which', 'phase', 'mixing', 'occurs']] | [-0.14670027092394705, 0.25941691430895075, -0.08150290537518091, 0.0642663994076429, -0.02028332421412835, -0.09288642651294, 0.01728851823001885, 0.36591321353514034, -0.25815115367563873, -0.3124621398926068, 0.06426842221005175, -0.22555734613874498, -0.0418849997759725, 0.1410455575499397, 0.052187192647229846, 0.05591978180634145, 0.03031124356829633, 0.012674260589007575, -0.12460803433630364, -0.14053568407409608, 0.32916033576027703, 0.09760213256455384, 0.26944037105959767, 0.055619679404816665, 0.12201218425672358, 0.026077580033765677, -0.023589577946740273, 0.042277120818583244, -0.08985344008530004, 0.006816528468894271, 0.1805823969636829, 0.0017490893217724918, 0.24929880248740888, -0.43257207865826786, -0.26992573554161936, 0.06286398326315415, 0.1515229246041809, 0.16173030957557225, -0.08115819038469524, -0.24999384295481902, -0.017306421238642473, -0.15832794803337982, -0.2017207080587888, -0.04719267706744946, 0.08306041068415372, 0.01981868833088531, -0.2953519960596728, 0.1449433547562736, 0.015612163321258357, -0.0013122161438402075, -0.04389160974488522, -0.0421537431762912, -0.04521572181525139, 0.05253516611264786, 0.10387415634781624, 0.07915687195670146, 0.13477268146100238, -0.07702432065875306, -0.004291573288635566, 0.3770658911134188, -0.14454890870883202, -0.17177033204083833, 0.13578643672092136, -0.22582088476673773, -0.10354020021623, 0.24835780061459026, 0.1977190037186329, 0.08290286041581287, -0.09543848455807445, 0.09533739126065764, -0.01082417538334714, 0.179103357904296, 0.12745665652283394, 0.06994463592015493, 0.20701801574502426, 0.1505362443981889, 0.06298000242811842, 0.0693423970664858, -0.14134739980979177, -0.08537463324878794, -0.2635402612817975, -0.102162035029883, -0.1800874198267523, -0.0005159325835568149, -0.09532276042605539, -0.17632667139584485, 0.40930570530830523, 0.12894329773888996, 0.17434124396487066, -0.013890303294129599, 0.2803366722924133, 0.1913680429570377, 0.03350031931992047, 0.08384351859925888, 0.2760127607504658, 0.16127960013042097, 0.13663737762432832, -0.31469975760466273, 0.06695805444794062, 0.04144234453381684] |
1,802.04524 | On a generalized theorem of de Bruijn and Erd\"os in d-dimensional Fuzzy
Linear Spaces | In this study we follow a new framework for the theory that offers us, other
than traditional, a new angle to observe and investigate some relations between
finite sets, F-lattice L and their elements. The theory is based on the Fuzzy
Linear Spaces (FLS) S=(N,D). In this case, to operate on these spaces the
necessary preliminaries, concepts and operations in lattices relative to FLS
are introduced. Some definitions, such that k-fuzzy point, k-fuzzy line are
given. Then we correspond these definitions to the definitions in usually
linear spaces. We investigate some combinatorics properties of FLS. In some
examples in the case where ILI=3*. We see some differences. In general, taking
an ordered lattice Ln={0,a1,a2,...,an,1} we observe how some combinatorics
formulas and properties are changed. In FLS the dimension concept is a set. We
produce some general formulas by using some trivial examples. Furthermore, we
generalize de Bruijn-Erd\"os Theorem in [2].
| math.GM | in this study we follow a new framework for the theory that offers us other than traditional a new angle to observe and investigate some relations between finite sets flattice l and their elements the theory is based on the fuzzy linear spaces fls snd in this case to operate on these spaces the necessary preliminaries concepts and operations in lattices relative to fls are introduced some definitions such that kfuzzy point kfuzzy line are given then we correspond these definitions to the definitions in usually linear spaces we investigate some combinatorics properties of fls in some examples in the case where ili3 we see some differences in general taking an ordered lattice ln0a1a2an1 we observe how some combinatorics formulas and properties are changed in fls the dimension concept is a set we produce some general formulas by using some trivial examples furthermore we generalize de bruijnerdos theorem in 2 | [['in', 'this', 'study', 'we', 'follow', 'a', 'new', 'framework', 'for', 'the', 'theory', 'that', 'offers', 'us', 'other', 'than', 'traditional', 'a', 'new', 'angle', 'to', 'observe', 'and', 'investigate', 'some', 'relations', 'between', 'finite', 'sets', 'flattice', 'l', 'and', 'their', 'elements', 'the', 'theory', 'is', 'based', 'on', 'the', 'fuzzy', 'linear', 'spaces', 'fls', 'snd', 'in', 'this', 'case', 'to', 'operate', 'on', 'these', 'spaces', 'the', 'necessary', 'preliminaries', 'concepts', 'and', 'operations', 'in', 'lattices', 'relative', 'to', 'fls', 'are', 'introduced', 'some', 'definitions', 'such', 'that', 'kfuzzy', 'point', 'kfuzzy', 'line', 'are', 'given', 'then', 'we', 'correspond', 'these', 'definitions', 'to', 'the', 'definitions', 'in', 'usually', 'linear', 'spaces', 'we', 'investigate', 'some', 'combinatorics', 'properties', 'of', 'fls', 'in', 'some', 'examples', 'in', 'the', 'case', 'where', 'ili3', 'we', 'see', 'some', 'differences', 'in', 'general', 'taking', 'an', 'ordered', 'lattice', 'ln0a1a2an1', 'we', 'observe', 'how', 'some', 'combinatorics', 'formulas', 'and', 'properties', 'are', 'changed', 'in', 'fls', 'the', 'dimension', 'concept', 'is', 'a', 'set', 'we', 'produce', 'some', 'general', 'formulas', 'by', 'using', 'some', 'trivial', 'examples', 'furthermore', 'we', 'generalize', 'de', 'bruijnerdos', 'theorem', 'in', '2']] | [-0.09392403852998292, 0.10665950956461355, -0.08522234989126047, 0.12783513038278851, -0.09536123215954445, -0.09449439184191598, 0.04403124736264756, 0.40623353934553386, -0.2872500712409207, -0.24791711370766878, 0.11130479217605818, -0.29490765452716655, -0.1883856204070457, 0.22170446437388047, -0.11801573098537493, -0.0061386120409947145, -0.017337039222283773, 0.029025020020414297, -0.1443411888720544, -0.2791715342207008, 0.3574832181369707, -0.038002411493623295, 0.23194218503489886, 0.025759364629789474, 0.059558841545766295, 0.0075076135245792895, -0.06795178024634106, 0.06393389801226862, -0.21591916170550512, 0.14283882960125371, 0.26859885310652115, 0.13222457725101802, 0.24593175600652825, -0.41039454403703346, -0.14805309930401664, 0.11495863035168141, 0.06994812824916452, 0.09566166376605732, -0.014581907416170794, -0.24140988887058035, 0.1100076924122819, -0.15241596182052378, -0.12184498714576539, -0.12473755713938162, 0.008416140911309686, 0.0512937971004859, -0.20451859222750549, -0.024787964337594705, 0.10175748176304408, 0.1035247423290594, -0.06084576409233555, -0.11513949224999659, 0.039137963752568485, 0.10136340291491289, -0.007499730035866776, -0.030382634185203542, 0.057724186149106856, -0.08115926966524033, -0.1525750896121592, 0.354368632375454, -0.009515407640819457, -0.2490262416038305, 0.207613162599083, -0.14969122277298458, -0.2066304627997316, 0.04009493978132736, 0.14268652520984512, 0.11355166780851679, -0.09941981750068395, 0.11961722755740868, -0.08478771807141092, 0.11403661165230952, 0.10585506266455026, 0.08728611330606988, 0.1407991591135314, 0.09796066437321652, 0.052765894613837926, 0.15507818078375038, -0.023345929257928916, -0.12277939822245708, -0.3306666055362519, -0.14873309850641717, -0.10638268046999631, 0.020709636241631354, -0.07656979956624277, -0.1496226077401781, 0.3565015121720323, 0.16662053409198377, 0.21428672947652944, 0.059761676943720615, 0.22092872912427794, 0.09416586570116797, 0.02579759168980822, 0.0644712735578252, 0.19910952749451596, 0.14938824101548948, 0.07133602728263462, -0.11356197418772603, -0.019565435336928252, 0.11542217517016481] |
1,802.04525 | Excitation of plasma wakefields by proton beam | A stationary wave solution is obtained for the proton driven plasma wake
field accelerator (PDPWFA). The wake field excitation by trains of equidistant
proton microbunches produced due to self modulational instability has been
discussed. Also, considering the necessity of the external magnetic field to
control focusing of the beam, studies on the effect of magnetic field on the
wake field structures have been done.
| physics.plasm-ph | a stationary wave solution is obtained for the proton driven plasma wake field accelerator pdpwfa the wake field excitation by trains of equidistant proton microbunches produced due to self modulational instability has been discussed also considering the necessity of the external magnetic field to control focusing of the beam studies on the effect of magnetic field on the wake field structures have been done | [['a', 'stationary', 'wave', 'solution', 'is', 'obtained', 'for', 'the', 'proton', 'driven', 'plasma', 'wake', 'field', 'accelerator', 'pdpwfa', 'the', 'wake', 'field', 'excitation', 'by', 'trains', 'of', 'equidistant', 'proton', 'microbunches', 'produced', 'due', 'to', 'self', 'modulational', 'instability', 'has', 'been', 'discussed', 'also', 'considering', 'the', 'necessity', 'of', 'the', 'external', 'magnetic', 'field', 'to', 'control', 'focusing', 'of', 'the', 'beam', 'studies', 'on', 'the', 'effect', 'of', 'magnetic', 'field', 'on', 'the', 'wake', 'field', 'structures', 'have', 'been', 'done']] | [-0.19597717082231408, 0.22500445038848926, -0.07588207560576617, 0.06757813150114897, -0.07017561051225851, -0.053593651352760695, -0.07118441265017267, 0.3969536132755734, -0.21366246644821432, -0.26121283266397693, 0.05744056150849376, -0.20685082147016176, -0.032240018071163265, 0.2377634741188515, 0.06386536652118796, 0.07884156402377855, 0.017116395937692788, 0.030449195129294244, 0.05338592781493115, -0.15568552407923908, 0.3652067114599049, 0.14096248105523132, 0.34439822522893787, 0.06275422284231773, 0.1083764150176966, -0.00381172350090411, 0.02517372844482048, 0.04257150260465486, -0.08379395505009656, 0.03383750861717595, 0.13233652746393568, 0.04770520707548019, 0.2885926258232858, -0.5327858165911739, -0.2872041542201288, 0.02552814165218955, 0.18715434787528856, 0.13274852818595098, -0.13653107840819137, -0.29761573510421885, 0.025440599931965745, -0.14317325688898563, -0.1967504816942863, -0.025951006327800098, 0.028892688602874323, 0.11513915986177467, -0.2901470170814603, 0.007548299628690565, 0.041589471346159125, 0.11730187537059897, -0.10564420080655032, -0.06894270864330114, -0.023049001685447164, 0.0358781612419065, 0.16738427928205402, 0.14747378910847364, 0.20469188756708587, -0.16228795611107397, -0.0947157169307863, 0.32849973463822923, -0.030732919595071247, -0.14258654128819231, 0.11472296330427366, -0.20842059576765648, 0.0009357698006732832, 0.21967292365632832, 0.18050323608553126, 0.05111037650781255, -0.1129732732439325, 0.07941708817250198, 0.0012869531039743582, 0.12642771156785626, 0.17134387915333113, -0.0337289548996422, 0.24390137071410814, 0.2098957429093028, -0.002714069201684897, 0.15253845613361114, -0.12806061439452662, -0.07030231102059285, -0.23556056544776, -0.024632662859937503, -0.1403187629101532, 0.013216858551170425, 0.04121750947235832, -0.16868685705528136, 0.4622836178833885, 0.126818515848191, 0.08840246304928784, -0.13043843687231105, 0.32192387786649523, 0.1670353383062378, 0.06737489683095306, 0.0496557854478144, 0.3361846141901518, 0.22291056720155572, 0.17024523960722107, -0.28585655328684617, -0.006648072071136936, 0.044377477702847314] |
1,802.04526 | Homotopy type of the neighborhood complexes of graphs of maximal degree
at most $3$ and $4$-regular circulant graphs | To estimate the lower bound for the chromatic number of a graph $G$, Lov\'asz
associated a simplicial complex $\mathcal{N}(G)$ called the neighborhood
complex and relates the topological connectivity of $\mathcal{N}(G)$ to the
chromatic number of $G$. More generally he proved that the chromatic number of
$G$ is bounded below by the topological connectivity of $\mathcal{N}(G)$ plus
$3$.
In this article, we consider the graphs of maximal degree at most $3$ and
$4$-regular circulant graphs. We show that each connected component of the
neighborhood complexes of these graphs is homotopy equivalent either to a
point, to a wedge sum of circles, to a wedge sum of $2$-spheres $S^2$, to
$S^3$, to a garland of $2$-spheres $S^2$ or to a connected sum of tori.
| math.CO | to estimate the lower bound for the chromatic number of a graph g lovasz associated a simplicial complex mathcalng called the neighborhood complex and relates the topological connectivity of mathcalng to the chromatic number of g more generally he proved that the chromatic number of g is bounded below by the topological connectivity of mathcalng plus 3 in this article we consider the graphs of maximal degree at most 3 and 4regular circulant graphs we show that each connected component of the neighborhood complexes of these graphs is homotopy equivalent either to a point to a wedge sum of circles to a wedge sum of 2spheres s2 to s3 to a garland of 2spheres s2 or to a connected sum of tori | [['to', 'estimate', 'the', 'lower', 'bound', 'for', 'the', 'chromatic', 'number', 'of', 'a', 'graph', 'g', 'lovasz', 'associated', 'a', 'simplicial', 'complex', 'mathcalng', 'called', 'the', 'neighborhood', 'complex', 'and', 'relates', 'the', 'topological', 'connectivity', 'of', 'mathcalng', 'to', 'the', 'chromatic', 'number', 'of', 'g', 'more', 'generally', 'he', 'proved', 'that', 'the', 'chromatic', 'number', 'of', 'g', 'is', 'bounded', 'below', 'by', 'the', 'topological', 'connectivity', 'of', 'mathcalng', 'plus', '3', 'in', 'this', 'article', 'we', 'consider', 'the', 'graphs', 'of', 'maximal', 'degree', 'at', 'most', '3', 'and', '4regular', 'circulant', 'graphs', 'we', 'show', 'that', 'each', 'connected', 'component', 'of', 'the', 'neighborhood', 'complexes', 'of', 'these', 'graphs', 'is', 'homotopy', 'equivalent', 'either', 'to', 'a', 'point', 'to', 'a', 'wedge', 'sum', 'of', 'circles', 'to', 'a', 'wedge', 'sum', 'of', '2spheres', 's2', 'to', 's3', 'to', 'a', 'garland', 'of', '2spheres', 's2', 'or', 'to', 'a', 'connected', 'sum', 'of', 'tori']] | [-0.23562203060175277, 0.09681664119268478, -0.02498234071593243, 0.05267160621444985, -0.10792104942632504, -0.10890541361171568, 0.041448023460316855, 0.3414222425857528, -0.2719082262063567, -0.30141834536429923, 0.09646475108886199, -0.30214427710800873, -0.1664847804421414, 0.11825189817902922, -0.13331711504486252, -0.0271250593474089, 0.036728060273758946, 0.12590659975425386, -0.0030821185887287385, -0.25428274786791605, 0.34937195051232445, -0.06072599836243469, 0.1354113520617412, 0.10762595992581156, 0.07566611594320122, -0.0014277080276248152, 0.012218731424969728, 0.11091196348844859, -0.1744226716258649, 0.16639796716206876, 0.22953653098923749, 0.11997859127395863, 0.20272267279291495, -0.3715422438900368, -0.17278004907544886, 0.23335761337953267, 0.12469661647270693, -0.03415989414712445, 0.06645432827728476, -0.23586409597382804, 0.13919935102734837, -0.12647218325046047, -0.13742357075832723, 0.01448389074906371, 0.09241404395825306, 0.014618799143821979, -0.2356305463376959, -0.01958151607484114, 0.09117927354928411, 0.04652291562858603, 0.0662368801613262, -0.1137502803581721, -0.10026230851997484, 0.08864299746298948, -0.042280437712000345, 0.08450720487849513, 0.05658834903562045, -0.13592656301601683, -0.13484942597016447, 0.36284294041240067, -0.03666545869782567, -0.17159947209426615, 0.1291632693886879, -0.1697394115980104, -0.18000851463160064, 0.1824495376538119, 0.10905181287528305, 0.16874738133008607, -0.04457135997201148, 0.10490847797968929, -0.1088359937774109, 0.12202757453573601, 0.1261935341248258, 0.005271467101592265, 0.14621014610986363, 0.09318416751348643, 0.21027019162677596, 0.18686920283820296, -0.025017654624878292, -0.005779912397570786, -0.2931059291433604, -0.15307667290221244, -0.24641179442253025, 0.11832242191876055, -0.16249809288548603, -0.23041131976823948, 0.4193710556223256, 0.031106455068363518, 0.19799985602730885, 0.1254877846747194, 0.24595830057457577, 0.040668601597674554, 0.049467487150009294, 0.11633767418135874, 0.12417647515644976, 0.2697443014304688, -0.06454942234578069, -0.1242608742532702, -0.030186407071477198, 0.18488571437142054] |
1,802.04527 | Extending the DEVS Formalism with Initialization Information | DEVS is a popular formalism to model system behaviour using a discrete-event
abstraction. The main advantages of DEVS are its rigourous and precise
specification, as well as its support for modular, hierarchical construction of
models. DEVS frequently serves as a simulation "assembly language" to which
models in other formalisms are translated, either giving meaning to new
(domain-specific) languages, or reproducing semantics of existing languages.
Despite this rigourous definition of its syntax and semantics, initialization
of DEVS models is left unspecified in both the Classic and Parallel DEVS
formalism definition. In this paper, we extend the DEVS formalism by including
an initial total state. Extensions to syntax as well as denotational (closure
under coupling) and operational semantics (abstract simulator) are presented.
The extension is applicable to both main variants of the DEVS formalism. Our
extension is such that it adds to, but does not alter the original
specification. All changes are illustrated by means of a traffic light example.
| cs.SE | devs is a popular formalism to model system behaviour using a discreteevent abstraction the main advantages of devs are its rigourous and precise specification as well as its support for modular hierarchical construction of models devs frequently serves as a simulation assembly language to which models in other formalisms are translated either giving meaning to new domainspecific languages or reproducing semantics of existing languages despite this rigourous definition of its syntax and semantics initialization of devs models is left unspecified in both the classic and parallel devs formalism definition in this paper we extend the devs formalism by including an initial total state extensions to syntax as well as denotational closure under coupling and operational semantics abstract simulator are presented the extension is applicable to both main variants of the devs formalism our extension is such that it adds to but does not alter the original specification all changes are illustrated by means of a traffic light example | [['devs', 'is', 'a', 'popular', 'formalism', 'to', 'model', 'system', 'behaviour', 'using', 'a', 'discreteevent', 'abstraction', 'the', 'main', 'advantages', 'of', 'devs', 'are', 'its', 'rigourous', 'and', 'precise', 'specification', 'as', 'well', 'as', 'its', 'support', 'for', 'modular', 'hierarchical', 'construction', 'of', 'models', 'devs', 'frequently', 'serves', 'as', 'a', 'simulation', 'assembly', 'language', 'to', 'which', 'models', 'in', 'other', 'formalisms', 'are', 'translated', 'either', 'giving', 'meaning', 'to', 'new', 'domainspecific', 'languages', 'or', 'reproducing', 'semantics', 'of', 'existing', 'languages', 'despite', 'this', 'rigourous', 'definition', 'of', 'its', 'syntax', 'and', 'semantics', 'initialization', 'of', 'devs', 'models', 'is', 'left', 'unspecified', 'in', 'both', 'the', 'classic', 'and', 'parallel', 'devs', 'formalism', 'definition', 'in', 'this', 'paper', 'we', 'extend', 'the', 'devs', 'formalism', 'by', 'including', 'an', 'initial', 'total', 'state', 'extensions', 'to', 'syntax', 'as', 'well', 'as', 'denotational', 'closure', 'under', 'coupling', 'and', 'operational', 'semantics', 'abstract', 'simulator', 'are', 'presented', 'the', 'extension', 'is', 'applicable', 'to', 'both', 'main', 'variants', 'of', 'the', 'devs', 'formalism', 'our', 'extension', 'is', 'such', 'that', 'it', 'adds', 'to', 'but', 'does', 'not', 'alter', 'the', 'original', 'specification', 'all', 'changes', 'are', 'illustrated', 'by', 'means', 'of', 'a', 'traffic', 'light', 'example']] | [-0.07351188448974656, 0.021868434879885355, -0.10397699633259562, 0.12546883243625348, -0.14877854862627632, -0.14820987991163437, 0.00914694146839666, 0.3720734169635969, -0.2736504209799621, -0.3161951188776123, 0.08209486677432197, -0.21724800523252616, -0.14034812709558284, 0.1895979805643187, -0.1362459671954754, 0.07088140099894409, 0.05221901605748631, 0.029057567542760714, -0.06293813082760884, -0.1906055343474403, 0.28496752839382217, 0.04910823894381712, 0.23948003023220343, 0.02476292142248123, 0.08386706484811782, 0.0288270239621, -0.02437946180624392, 0.0027919606831738183, -0.062372835510923555, 0.12043540989888922, 0.30288350073429754, 0.24543885980980307, 0.2534510377747349, -0.40370856658142956, -0.1981832785618453, 0.019752474217321958, 0.10892626046662844, 0.10622073322736446, 0.024330379728734777, -0.3053278535297966, 0.06227873941246845, -0.25926149308002155, -0.09955883681585517, -0.14463390947151575, 0.008644197170793585, 0.014183160064954169, -0.22058129117491102, -0.02452815072080474, 0.15029631449275097, 0.08404340643488767, -0.05316089892824758, -0.10906405493107188, -0.03859729664783359, 0.08949133646939704, 0.017493761745075213, 0.016084611508700573, 0.14313589508370408, -0.06560639040898296, -0.1587829071707151, 0.4110172239627359, -0.052875802676853594, -0.2216643342995851, 0.24096746184815995, -0.008492615963980744, -0.16229717560477933, 0.02811501455740838, 0.10562512171351575, 0.08396153528938848, -0.1776590717814957, 0.14122898408205872, -0.014589480103783404, 0.17177248417836014, 0.04726339389475746, 0.03531485910621719, 0.18171120346877487, 0.2513209998477221, -0.0014639151978153217, 0.1498159913503111, 0.050793765880509364, -0.17300391239644605, -0.34749919836279713, -0.16010983670460094, -0.09752098752754516, -0.041836427161348486, -0.03865381799486489, -0.2105767733912585, 0.4085809005117869, 0.22661794607727964, 0.13639386443869222, 0.14701994859298126, 0.37602383758919905, 0.09139532336517225, 0.07728359199098099, 0.05053496596114592, 0.10949912894873798, 0.13032999052371405, 0.11544250927959816, -0.14396822278216906, 0.12193978786368301, 0.07151045571700257] |
1,802.04528 | Deceiving End-to-End Deep Learning Malware Detectors using Adversarial
Examples | In recent years, deep learning has shown performance breakthroughs in many
applications, such as image detection, image segmentation, pose estimation, and
speech recognition. However, this comes with a major concern: deep networks
have been found to be vulnerable to adversarial examples. Adversarial examples
are slightly modified inputs that are intentionally designed to cause a
misclassification by the model. In the domains of images and speech, the
modifications are so small that they are not seen or heard by humans, but
nevertheless greatly affect the classification of the model.
Deep learning models have been successfully applied to malware detection. In
this domain, generating adversarial examples is not straightforward, as small
modifications to the bytes of the file could lead to significant changes in its
functionality and validity. We introduce a novel loss function for generating
adversarial examples specifically tailored for discrete input sets, such as
executable bytes. We modify malicious binaries so that they would be detected
as benign, while preserving their original functionality, by injecting a small
sequence of bytes (payload) in the binary file. We applied this approach to an
end-to-end convolutional deep learning malware detection model and show a high
rate of detection evasion. Moreover, we show that our generated payload is
robust enough to be transferable within different locations of the same file
and across different files, and that its entropy is low and similar to that of
benign data sections.
| cs.LG cs.CR | in recent years deep learning has shown performance breakthroughs in many applications such as image detection image segmentation pose estimation and speech recognition however this comes with a major concern deep networks have been found to be vulnerable to adversarial examples adversarial examples are slightly modified inputs that are intentionally designed to cause a misclassification by the model in the domains of images and speech the modifications are so small that they are not seen or heard by humans but nevertheless greatly affect the classification of the model deep learning models have been successfully applied to malware detection in this domain generating adversarial examples is not straightforward as small modifications to the bytes of the file could lead to significant changes in its functionality and validity we introduce a novel loss function for generating adversarial examples specifically tailored for discrete input sets such as executable bytes we modify malicious binaries so that they would be detected as benign while preserving their original functionality by injecting a small sequence of bytes payload in the binary file we applied this approach to an endtoend convolutional deep learning malware detection model and show a high rate of detection evasion moreover we show that our generated payload is robust enough to be transferable within different locations of the same file and across different files and that its entropy is low and similar to that of benign data sections | [['in', 'recent', 'years', 'deep', 'learning', 'has', 'shown', 'performance', 'breakthroughs', 'in', 'many', 'applications', 'such', 'as', 'image', 'detection', 'image', 'segmentation', 'pose', 'estimation', 'and', 'speech', 'recognition', 'however', 'this', 'comes', 'with', 'a', 'major', 'concern', 'deep', 'networks', 'have', 'been', 'found', 'to', 'be', 'vulnerable', 'to', 'adversarial', 'examples', 'adversarial', 'examples', 'are', 'slightly', 'modified', 'inputs', 'that', 'are', 'intentionally', 'designed', 'to', 'cause', 'a', 'misclassification', 'by', 'the', 'model', 'in', 'the', 'domains', 'of', 'images', 'and', 'speech', 'the', 'modifications', 'are', 'so', 'small', 'that', 'they', 'are', 'not', 'seen', 'or', 'heard', 'by', 'humans', 'but', 'nevertheless', 'greatly', 'affect', 'the', 'classification', 'of', 'the', 'model', 'deep', 'learning', 'models', 'have', 'been', 'successfully', 'applied', 'to', 'malware', 'detection', 'in', 'this', 'domain', 'generating', 'adversarial', 'examples', 'is', 'not', 'straightforward', 'as', 'small', 'modifications', 'to', 'the', 'bytes', 'of', 'the', 'file', 'could', 'lead', 'to', 'significant', 'changes', 'in', 'its', 'functionality', 'and', 'validity', 'we', 'introduce', 'a', 'novel', 'loss', 'function', 'for', 'generating', 'adversarial', 'examples', 'specifically', 'tailored', 'for', 'discrete', 'input', 'sets', 'such', 'as', 'executable', 'bytes', 'we', 'modify', 'malicious', 'binaries', 'so', 'that', 'they', 'would', 'be', 'detected', 'as', 'benign', 'while', 'preserving', 'their', 'original', 'functionality', 'by', 'injecting', 'a', 'small', 'sequence', 'of', 'bytes', 'payload', 'in', 'the', 'binary', 'file', 'we', 'applied', 'this', 'approach', 'to', 'an', 'endtoend', 'convolutional', 'deep', 'learning', 'malware', 'detection', 'model', 'and', 'show', 'a', 'high', 'rate', 'of', 'detection', 'evasion', 'moreover', 'we', 'show', 'that', 'our', 'generated', 'payload', 'is', 'robust', 'enough', 'to', 'be', 'transferable', 'within', 'different', 'locations', 'of', 'the', 'same', 'file', 'and', 'across', 'different', 'files', 'and', 'that', 'its', 'entropy', 'is', 'low', 'and', 'similar', 'to', 'that', 'of', 'benign', 'data', 'sections']] | [-0.06585339452916135, 0.04997685980682339, -0.051957764758322485, 0.09273975252514131, -0.08746230280779016, -0.2075135653030573, 0.018881568063670397, 0.4324407983535471, -0.27698473311347777, -0.3571386586274737, 0.10320268682518607, -0.2889943044457553, -0.19203398327848628, 0.20409370709855396, -0.19447456682837194, 0.09938546646442105, 0.11151817294671479, 0.04701942390101588, -0.03743854025248229, -0.31603727396677095, 0.27358028792794076, 0.045216802085260265, 0.29684486999920207, 0.043449339216065586, 0.09251529572812171, -0.046487208416995905, 0.0002402558636206847, -0.010289144938071378, -0.027145103275769442, 0.10545352010758972, 0.34985428698964205, 0.21867335070935515, 0.29636392071166545, -0.43286081713138735, -0.2529482138900357, 0.11742429868875343, 0.15318076805715075, 0.15794907631869945, -0.09445881868242963, -0.34266325102175754, 0.16593459965516894, -0.2237092918317375, -0.004797837419363742, -0.13885225413982064, -2.056957793652884e-05, 0.02061624147826766, -0.22982080546048525, -0.003738498772916376, 0.10994642559410586, 0.04073969503410925, -0.032314266647813186, -0.07305896551344289, -0.013599336468694238, 0.17440835216667694, 0.07134868226670282, 0.0444703962172294, 0.16288432703476846, -0.17993343396721265, -0.10065537901808165, 0.3603791558645411, -0.04833087375244269, -0.20025871705232012, 0.21202823482095623, -0.022712906112130254, -0.14715556111027542, 0.12826125749733108, 0.25683542298606765, 0.11965378561319831, -0.15979599471514425, -0.001132733219041505, -0.006008367304905103, 0.20002884867513537, 0.08998972529039966, 0.01268176264806181, 0.19381282461680766, 0.18259287317174996, 0.013254873256565223, 0.15729171935813183, -0.13542016896142617, -0.03925493995173492, -0.2098675407976724, -0.0882709596831447, -0.1895638185684593, 0.002881492562835805, -0.055035368936958734, -0.15543703053832655, 0.39184397406494004, 0.20811043415441471, 0.21311226289950183, 0.07666679523956393, 0.3517256072985056, 0.04020636765491297, 0.18411120701094683, 0.076085889331885, 0.21868474938673899, -0.00870850928223286, 0.08960659634501028, -0.12361834999213679, 0.1394946666013521, -0.03250163735754183] |
1,802.04529 | Tracing crystal-field splittings in the rare earth-based intermetallic
CeIrIn$_5$ | Crystal electric field states in rare earth intermetallics show an intricate
entanglement with the many-body physics that occurs in these systems and that
is known to lead to a plethora of electronic phases. Here, we attempt to trace
different contributions to the crystal electric field (CEF) splittings in
CeIrIn$_5$, a heavy-fermion compound and member of the Ce$M$In$_5$ ($M$= Co,
Rh, Ir) family. To this end, we utilize high-resolution resonant angle-resolved
photoemission spectroscopy (ARPES) and present a spectroscopic study of the
electronic structure of this unconventional superconductor over a wide
temperature range. As a result, we show how ARPES can be used in combination
with thermodynamic measurements or neutron scattering to disentangle different
contributions to the CEF splitting in rare earth intermetallics. We also find
that the hybridization is stronger in CeIrIn$_5$ than CeCoIn$_5$ and the
effects of the hybridization on the Fermi volume increase is much smaller than
predicted. By providing the first experimental evidence for $4f_{7/2}^{1}$
splittings which, in CeIrIn$_5$, split the octet into four doublets, we clearly
demonstrate the many-body origin of the so-called $4f_{7/2}^{1}$ state.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.supr-con | crystal electric field states in rare earth intermetallics show an intricate entanglement with the manybody physics that occurs in these systems and that is known to lead to a plethora of electronic phases here we attempt to trace different contributions to the crystal electric field cef splittings in ceirin_5 a heavyfermion compound and member of the cemin_5 m co rh ir family to this end we utilize highresolution resonant angleresolved photoemission spectroscopy arpes and present a spectroscopic study of the electronic structure of this unconventional superconductor over a wide temperature range as a result we show how arpes can be used in combination with thermodynamic measurements or neutron scattering to disentangle different contributions to the cef splitting in rare earth intermetallics we also find that the hybridization is stronger in ceirin_5 than cecoin_5 and the effects of the hybridization on the fermi volume increase is much smaller than predicted by providing the first experimental evidence for 4f_721 splittings which in ceirin_5 split the octet into four doublets we clearly demonstrate the manybody origin of the socalled 4f_721 state | [['crystal', 'electric', 'field', 'states', 'in', 'rare', 'earth', 'intermetallics', 'show', 'an', 'intricate', 'entanglement', 'with', 'the', 'manybody', 'physics', 'that', 'occurs', 'in', 'these', 'systems', 'and', 'that', 'is', 'known', 'to', 'lead', 'to', 'a', 'plethora', 'of', 'electronic', 'phases', 'here', 'we', 'attempt', 'to', 'trace', 'different', 'contributions', 'to', 'the', 'crystal', 'electric', 'field', 'cef', 'splittings', 'in', 'ceirin_5', 'a', 'heavyfermion', 'compound', 'and', 'member', 'of', 'the', 'cemin_5', 'm', 'co', 'rh', 'ir', 'family', 'to', 'this', 'end', 'we', 'utilize', 'highresolution', 'resonant', 'angleresolved', 'photoemission', 'spectroscopy', 'arpes', 'and', 'present', 'a', 'spectroscopic', 'study', 'of', 'the', 'electronic', 'structure', 'of', 'this', 'unconventional', 'superconductor', 'over', 'a', 'wide', 'temperature', 'range', 'as', 'a', 'result', 'we', 'show', 'how', 'arpes', 'can', 'be', 'used', 'in', 'combination', 'with', 'thermodynamic', 'measurements', 'or', 'neutron', 'scattering', 'to', 'disentangle', 'different', 'contributions', 'to', 'the', 'cef', 'splitting', 'in', 'rare', 'earth', 'intermetallics', 'we', 'also', 'find', 'that', 'the', 'hybridization', 'is', 'stronger', 'in', 'ceirin_5', 'than', 'cecoin_5', 'and', 'the', 'effects', 'of', 'the', 'hybridization', 'on', 'the', 'fermi', 'volume', 'increase', 'is', 'much', 'smaller', 'than', 'predicted', 'by', 'providing', 'the', 'first', 'experimental', 'evidence', 'for', '4f_721', 'splittings', 'which', 'in', 'ceirin_5', 'split', 'the', 'octet', 'into', 'four', 'doublets', 'we', 'clearly', 'demonstrate', 'the', 'manybody', 'origin', 'of', 'the', 'socalled', '4f_721', 'state']] | [-0.13575788800616548, 0.21447012591943349, -0.07921751693885942, 0.09289350077332612, -0.0728361588130197, -0.10109473985556344, 0.10202313342729626, 0.37282896480015054, -0.24858934279340741, -0.32266559009440243, -0.0407876918146609, -0.3520453667548612, -0.1146544208035762, 0.16527526325609704, 0.05587371620772914, -0.011154732635160062, 0.0008343110728839582, -0.03999313392771662, -0.12727988773787563, -0.20057387404482474, 0.32380773656768724, 0.022389956424541942, 0.2801301971961617, 0.09569135784774764, 0.004699442980133675, -0.02194127786788158, 0.1126345379796641, 0.016558199089062822, -0.1339191850863079, 0.07859039071527976, 0.29343089415554213, -0.022149432775966652, 0.1831411655523425, -0.4061752552674575, -0.20455857435048197, 0.028282109124781775, 0.1373704071474177, 0.1429565283119287, -0.0906767313281307, -0.27988692777845164, 0.050373629325556314, -0.15582707450217145, -0.10442698058217172, -0.144716760943993, -0.04415648512738037, -0.05604445507659958, -0.2294059089660798, 0.07015951647570712, -0.0005849655598550188, 0.1074483942370121, -0.10568567862818865, -0.15758327512197534, -0.04760095725280487, 0.0341758303997763, 0.07230218401078177, 0.034356292761169076, 0.09829783273479817, -0.07860229356711815, -0.10990352694220333, 0.384821410554485, -0.09076378916589337, -0.05428481825352223, 0.18687297707682857, -0.231275060186404, -0.1504153917273718, 0.13709147880912165, 0.11202134877980412, 0.11597036922500013, -0.12369161860558299, 0.05673397530865094, -0.03860605195619759, 0.1968312905486197, 0.01959059159509541, 0.10825440571484664, 0.23695713933028112, 0.16641181961379267, 0.01962438728448681, 0.12382554493226715, -0.14417342582865703, -0.04145971467898397, -0.21566945637989027, -0.1844935252712193, -0.19472043884293685, 0.0854516050206836, -0.01098977505667294, -0.17315012773840202, 0.41092522673054854, 0.15565292030739578, 0.2032936480124838, -0.09096698481549868, 0.2477579834601122, 0.06822257524287455, 0.0939535486554219, 0.0029413401101588865, 0.2647246528027939, 0.15033185143362393, 0.08784685521955411, -0.32388946828458837, 0.057133680045477704, 0.0013444184786005114] |
1,802.0453 | Flexible scheme to truncate the hierarchy of pure states | The hierarchy of pure states (HOPS) is a wavefunction-based method which can
be used for numerically modeling open quantum systems. Formally, HOPS recovers
the exact system dynamics for an infinite depth of the hierarchy. However,
truncation of the hierarchy is required to numerically implement HOPS. We want
to choose a 'good' truncation method, where by 'good' we mean that it is
numerically feasible to check convergence of the results. For the truncation
approximation used in previous applications of HOPS, convergence checks are
numerically challenging. In this work we demonstrate the application of the
'$n$-particle approximation' ($n$PA) to HOPS. We also introduce a new
approximation, which we call the '$n$-mode approximation' ($n$MA). We then
explore the convergence of these truncation approximations with respect to the
number of equations required in the hierarchy. We show that truncation
approximations can be used in combination to achieve convergence in two
exemplary problems: absorption and energy transfer of molecular aggregates.
| physics.chem-ph quant-ph | the hierarchy of pure states hops is a wavefunctionbased method which can be used for numerically modeling open quantum systems formally hops recovers the exact system dynamics for an infinite depth of the hierarchy however truncation of the hierarchy is required to numerically implement hops we want to choose a good truncation method where by good we mean that it is numerically feasible to check convergence of the results for the truncation approximation used in previous applications of hops convergence checks are numerically challenging in this work we demonstrate the application of the nparticle approximation npa to hops we also introduce a new approximation which we call the nmode approximation nma we then explore the convergence of these truncation approximations with respect to the number of equations required in the hierarchy we show that truncation approximations can be used in combination to achieve convergence in two exemplary problems absorption and energy transfer of molecular aggregates | [['the', 'hierarchy', 'of', 'pure', 'states', 'hops', 'is', 'a', 'wavefunctionbased', 'method', 'which', 'can', 'be', 'used', 'for', 'numerically', 'modeling', 'open', 'quantum', 'systems', 'formally', 'hops', 'recovers', 'the', 'exact', 'system', 'dynamics', 'for', 'an', 'infinite', 'depth', 'of', 'the', 'hierarchy', 'however', 'truncation', 'of', 'the', 'hierarchy', 'is', 'required', 'to', 'numerically', 'implement', 'hops', 'we', 'want', 'to', 'choose', 'a', 'good', 'truncation', 'method', 'where', 'by', 'good', 'we', 'mean', 'that', 'it', 'is', 'numerically', 'feasible', 'to', 'check', 'convergence', 'of', 'the', 'results', 'for', 'the', 'truncation', 'approximation', 'used', 'in', 'previous', 'applications', 'of', 'hops', 'convergence', 'checks', 'are', 'numerically', 'challenging', 'in', 'this', 'work', 'we', 'demonstrate', 'the', 'application', 'of', 'the', 'nparticle', 'approximation', 'npa', 'to', 'hops', 'we', 'also', 'introduce', 'a', 'new', 'approximation', 'which', 'we', 'call', 'the', 'nmode', 'approximation', 'nma', 'we', 'then', 'explore', 'the', 'convergence', 'of', 'these', 'truncation', 'approximations', 'with', 'respect', 'to', 'the', 'number', 'of', 'equations', 'required', 'in', 'the', 'hierarchy', 'we', 'show', 'that', 'truncation', 'approximations', 'can', 'be', 'used', 'in', 'combination', 'to', 'achieve', 'convergence', 'in', 'two', 'exemplary', 'problems', 'absorption', 'and', 'energy', 'transfer', 'of', 'molecular', 'aggregates']] | [-0.10447710221821081, 0.04109140269903301, -0.09487746486500387, 0.10988217863975273, -0.005998181296332229, -0.11430736182618045, 0.08067894711820109, 0.389830336287137, -0.286667178027452, -0.29078572758270665, 0.0978705262412287, -0.23612671881433456, -0.14936305328362412, 0.1324877643176625, -0.023227979471125912, 0.09814460130648747, 0.08378743501680512, -0.009171363006856652, -0.0851659070790535, -0.2795417901293765, 0.26951412900140687, 0.044923908124497584, 0.23529673305850837, 0.04176194062381382, 0.09067729641758507, -0.04531170675275667, 0.027857260281340248, 0.020905838747538867, -0.1537923121619256, 0.12015563363862795, 0.25211001492796403, 0.12264140320401037, 0.27120631665532147, -0.4229872771448666, -0.17358788994080837, 0.07173064517593311, 0.21437624343520692, 0.16053798626807908, -0.008105549234296044, -0.2279526559876338, 0.10084926248077423, -0.19434551012612158, -0.16139286701086789, -0.15280373089706464, -0.019516079121216712, 0.05417665387954443, -0.3174094951260955, 0.0647256643224072, 0.012283556595925362, -0.017543890165735876, -0.04656244668989412, -0.07153053942451915, 0.03791713914383323, 0.11904199008619593, 0.005339177589743368, 0.0023363595407816674, 0.060174182240640924, -0.1149632481122089, -0.09773961505552213, 0.37110140413166054, -0.07664093487865982, -0.26901240730357745, 0.21502400919975292, -0.09113916458511319, -0.13667992858456507, 0.12418289473580738, 0.16204881437964017, 0.15757513658637406, -0.1253419890459026, 0.08335885002330366, -0.05866863681904731, 0.1723712448864394, 0.06598586951412501, 0.01572962399166558, 0.10203016742072518, 0.17095249209913516, 0.0936437078901837, 0.16771311084589652, -0.0855840619593378, -0.1606031436833643, -0.3012643853187441, -0.13906470905734045, -0.1953193384838561, 0.037975253734076696, -0.07445182520586381, -0.14585191363528852, 0.37869037317652854, 0.22239580225019204, 0.1506186894291351, 0.08377602258396726, 0.30580238455365744, 0.17696910015036982, 0.02965645391133524, 0.09284980881718859, 0.22544539199481087, 0.13260854422265003, 0.022482761620513856, -0.2445910319257828, 0.03686392713308094, 0.09365212581807657] |
1,802.04531 | The algebra of balanced dessins | This paper gives a key definition, for a new approach to dessins and
algebraic numbers. The distant goal is to construct from each dessin $D$ an
algebraic number $\eta_D$, in a systematic and useful way. The algebra of
balanced dessins is generated by formal sums $\psi_D$ of dessins, intended to
be intermediate between $D$ and $\eta_D$.
| math.CO math.NT | this paper gives a key definition for a new approach to dessins and algebraic numbers the distant goal is to construct from each dessin d an algebraic number eta_d in a systematic and useful way the algebra of balanced dessins is generated by formal sums psi_d of dessins intended to be intermediate between d and eta_d | [['this', 'paper', 'gives', 'a', 'key', 'definition', 'for', 'a', 'new', 'approach', 'to', 'dessins', 'and', 'algebraic', 'numbers', 'the', 'distant', 'goal', 'is', 'to', 'construct', 'from', 'each', 'dessin', 'd', 'an', 'algebraic', 'number', 'eta_d', 'in', 'a', 'systematic', 'and', 'useful', 'way', 'the', 'algebra', 'of', 'balanced', 'dessins', 'is', 'generated', 'by', 'formal', 'sums', 'psi_d', 'of', 'dessins', 'intended', 'to', 'be', 'intermediate', 'between', 'd', 'and', 'eta_d']] | [-0.16577122565026262, 0.07523657339360008, -0.1600450001590486, 0.08215725821251649, -0.14187102408946625, -0.15704588383336418, 0.06149037351341186, 0.29292671355818, -0.33056024328938555, -0.304990403420691, 0.013311876954893316, -0.2601537659897336, -0.16581590787973255, 0.22271076917448746, -0.15453257664505923, -0.019856376706489494, 0.005936047835608146, 0.054115841714000065, -0.03583542073153824, -0.2556704860679539, 0.3451550328837974, 0.018363091562475477, 0.2122434096943055, 0.01517522571209286, 0.06925212996013995, 0.02872756281535008, -0.05504804255074954, -0.007760386115738324, -0.1211329793191648, 0.200882965098052, 0.34569495217874646, 0.1065437825330134, 0.22613405995070934, -0.356329550234867, -0.06040589617831366, 0.1493654077307188, 0.15660343057866807, 0.0969518939631858, 0.01481839660222509, -0.24553773026647313, 0.10647960211749055, -0.19161959967043782, -0.1327158275941786, -0.09323243736954671, 0.07908735954801419, 0.0008345426259828466, -0.25068743515294045, -0.0397108958152655, 0.05059302954863857, 0.1375783664573516, 0.043153670084263594, -0.10451935513161256, -0.02411363437048359, 0.11330123207049578, -0.0107961368298025, 0.10439367690456233, 0.033449014307864545, -0.07982239270911252, -0.10842042080392796, 0.38758583519873874, 0.00644290939869409, -0.1969450887824808, 0.12762964874439472, -0.08144322775271055, -0.17813609160449623, 0.10774113139736333, 0.12841094242009735, 0.15560399794152804, -0.10093341975672436, 0.08836459396427797, -0.08826969993034643, 0.10071270381948645, 0.05892569335576679, 0.020570681081153452, 0.21762196699689543, 0.09936338280593711, 0.06025833678099194, 0.18282167638244573, 0.042502797682703077, -0.0037992749296660933, -0.33954472886398435, -0.16438678763474204, -0.14252209173615224, 0.12729613423081382, -0.10911989067270562, -0.1644559166327651, 0.41011081719105796, 0.09687810504276838, 0.19817721787174897, 0.08272060993061002, 0.2543519098710801, 0.030178983296666826, 0.03977213454033647, 0.03585301359583225, 0.0832219038025609, 0.2455618741930396, -0.01934798204872225, -0.1183674104187438, 0.027792842642936324, 0.16904487888677977] |
1,802.04532 | Blue mussel shell shape plasticity and natural environments: a
quantitative approach | Shape variability represents an important direct response of organisms to
selective environments. Here, we use a combination of geometric morphometrics
and generalised additive mixed models (GAMMs) to identify spatial patterns of
natural shell shape variation in the North Atlantic and Arctic blue mussels,
Mytilus edulis and M. trossulus, with environmental gradients of temperature,
salinity and food availability across 3980 km of coastlines. New statistical
methods and multiple study systems at various geographical scales allowed the
uncoupling of the developmental and genetic contributions to shell shape and
made it possible to identify general relationships between blue mussel shape
variation and environment that are independent of age and species influences.
We find salinity had the strongest effect on the latitudinal patterns of
Mytilus shape, producing shells that were more elongated, narrower and with
more parallel dorsoventral margins at lower salinities. Temperature and food
supply, however, were the main drivers of mussel shape heterogeneity. Our
findings revealed similar shell shape responses in Mytilus to less favourable
environmental conditions across the different geographical scales analysed. Our
results show how shell shape plasticity represents a powerful indicator to
understand the alterations of blue mussel communities in rapidly changing
environments.
| q-bio.QM | shape variability represents an important direct response of organisms to selective environments here we use a combination of geometric morphometrics and generalised additive mixed models gamms to identify spatial patterns of natural shell shape variation in the north atlantic and arctic blue mussels mytilus edulis and m trossulus with environmental gradients of temperature salinity and food availability across 3980 km of coastlines new statistical methods and multiple study systems at various geographical scales allowed the uncoupling of the developmental and genetic contributions to shell shape and made it possible to identify general relationships between blue mussel shape variation and environment that are independent of age and species influences we find salinity had the strongest effect on the latitudinal patterns of mytilus shape producing shells that were more elongated narrower and with more parallel dorsoventral margins at lower salinities temperature and food supply however were the main drivers of mussel shape heterogeneity our findings revealed similar shell shape responses in mytilus to less favourable environmental conditions across the different geographical scales analysed our results show how shell shape plasticity represents a powerful indicator to understand the alterations of blue mussel communities in rapidly changing environments | [['shape', 'variability', 'represents', 'an', 'important', 'direct', 'response', 'of', 'organisms', 'to', 'selective', 'environments', 'here', 'we', 'use', 'a', 'combination', 'of', 'geometric', 'morphometrics', 'and', 'generalised', 'additive', 'mixed', 'models', 'gamms', 'to', 'identify', 'spatial', 'patterns', 'of', 'natural', 'shell', 'shape', 'variation', 'in', 'the', 'north', 'atlantic', 'and', 'arctic', 'blue', 'mussels', 'mytilus', 'edulis', 'and', 'm', 'trossulus', 'with', 'environmental', 'gradients', 'of', 'temperature', 'salinity', 'and', 'food', 'availability', 'across', '3980', 'km', 'of', 'coastlines', 'new', 'statistical', 'methods', 'and', 'multiple', 'study', 'systems', 'at', 'various', 'geographical', 'scales', 'allowed', 'the', 'uncoupling', 'of', 'the', 'developmental', 'and', 'genetic', 'contributions', 'to', 'shell', 'shape', 'and', 'made', 'it', 'possible', 'to', 'identify', 'general', 'relationships', 'between', 'blue', 'mussel', 'shape', 'variation', 'and', 'environment', 'that', 'are', 'independent', 'of', 'age', 'and', 'species', 'influences', 'we', 'find', 'salinity', 'had', 'the', 'strongest', 'effect', 'on', 'the', 'latitudinal', 'patterns', 'of', 'mytilus', 'shape', 'producing', 'shells', 'that', 'were', 'more', 'elongated', 'narrower', 'and', 'with', 'more', 'parallel', 'dorsoventral', 'margins', 'at', 'lower', 'salinities', 'temperature', 'and', 'food', 'supply', 'however', 'were', 'the', 'main', 'drivers', 'of', 'mussel', 'shape', 'heterogeneity', 'our', 'findings', 'revealed', 'similar', 'shell', 'shape', 'responses', 'in', 'mytilus', 'to', 'less', 'favourable', 'environmental', 'conditions', 'across', 'the', 'different', 'geographical', 'scales', 'analysed', 'our', 'results', 'show', 'how', 'shell', 'shape', 'plasticity', 'represents', 'a', 'powerful', 'indicator', 'to', 'understand', 'the', 'alterations', 'of', 'blue', 'mussel', 'communities', 'in', 'rapidly', 'changing', 'environments']] | [-0.0671905825156453, 0.13270726149072062, -0.0756007016580938, 0.10118777263690018, -0.07084485047757433, -0.1043679710929831, 0.0203388909817736, 0.4299153079944687, -0.224632419833981, -0.32090614871194323, 0.057604300124218466, -0.2395264326155649, -0.16706514644672987, 0.15726883949620235, -0.10629315244593691, -0.043611593571928245, 0.016233544491793612, -0.05609178297713862, -0.003771102374089023, -0.1860643563251653, 0.25624445866470086, 0.07699006372445065, 0.2980135403298459, 0.03829010794182921, 0.07667002396493995, -0.06143977003258899, -0.07554004555133803, 0.016568591967804136, -0.12376638525142998, 0.10740587433529873, 0.2379272299909512, 0.1315060338047873, 0.25545782894089125, -0.44084137574880544, -0.22451414575636233, 0.07851661783474174, 0.12982308533925738, 0.047972916101872765, -0.006424576678033435, -0.2593633759190169, 0.017014396540975016, -0.12917586584235277, -0.15887920741459904, -0.018569819035655168, 0.07764186358339892, 0.04942389230281259, -0.2172567231406897, 0.11836705288555416, 0.010819698773189376, 0.13150230223805176, -0.08934338652128306, -0.16735113854821618, -0.09377506834335253, 0.17662847571321064, 0.0642937519708214, -0.022028663839874646, 0.2178561196522546, -0.1176091076762758, -0.016897256360654696, 0.3311600521239428, -0.036504667725201716, -0.125744316204562, 0.2502591161586952, -0.1603199082639049, -0.14745424617530653, 0.12792881865083322, 0.19199461667886525, 0.06058989008879555, -0.14010414258948495, -0.03288102771096424, 0.014662096291355828, 0.20358335899389374, 0.12445262523483813, 0.010281507021426634, 0.23046022442946393, 0.16661828972032497, 0.07151370818866658, 0.13539783745989628, -0.15448857485702736, -0.11370124164854123, -0.17939833539129124, -0.07038562371361749, -0.0694180278848239, -0.020040901847077543, -0.15143547348406375, -0.18895754609932552, 0.383416086425667, 0.12092349202272004, 0.18235089458673565, 0.02097329466182671, 0.2498099300672585, -0.013440468977084818, 0.0994913282278211, 0.04717238096476875, 0.16412281993429123, 0.11708891789013896, 0.13432743891089227, -0.2579419343814331, 0.15969889831048836, -0.05220389633784505] |
1,802.04533 | Weak Lensing Analysis of SPT selected Galaxy Clusters using Dark Energy
Survey Science Verification Data | We present weak lensing (WL) mass constraints for a sample of massive galaxy
clusters detected by the South Pole Telescope (SPT) via the Sunyaev-Zeldovich
effect (SZE). We use $griz$ imaging data obtained from the Science Verification
(SV) phase of the Dark Energy Survey (DES) to fit the WL shear signal of 33
clusters in the redshift range $0.25 \le z \le 0.8$ with NFW profiles and to
constrain a four-parameter SPT mass-observable relation. To account for biases
in WL masses, we introduce a WL mass to true mass scaling relation described by
a mean bias and an intrinsic, log-normal scatter. We allow for correlated
scatter within the WL and SZE mass-observable relations and use simulations to
constrain priors on nuisance parameters related to bias and scatter from WL. We
constrain the normalization of the $\zeta-M_{500}$ relation,
$A_\mathrm{SZ}=12.0_{-6.7}^{+2.6}$ when using a prior on the mass slope
$B_\mathrm{SZ}$ from the latest SPT cluster cosmology analysis. Without this
prior, we recover $A_\mathrm{SZ}=10.8_{-5.2}^{+2.3}$ and
$B_\mathrm{SZ}=1.30_{-0.44}^{+0.22}$. Results in both cases imply lower cluster
masses than measured in previous work with and without WL, although the
uncertainties are large. The WL derived value of $B_\mathrm{SZ}$ is $\approx
20\%$ lower than the value preferred by the most recent SPT cluster cosmology
analysis. The method demonstrated in this work is designed to constrain cluster
masses and cosmological parameters simultaneously and will form the basis for
subsequent studies that employ the full SPT cluster sample together with the
DES data.
| astro-ph.CO | we present weak lensing wl mass constraints for a sample of massive galaxy clusters detected by the south pole telescope spt via the sunyaevzeldovich effect sze we use griz imaging data obtained from the science verification sv phase of the dark energy survey des to fit the wl shear signal of 33 clusters in the redshift range 025 le z le 08 with nfw profiles and to constrain a fourparameter spt massobservable relation to account for biases in wl masses we introduce a wl mass to true mass scaling relation described by a mean bias and an intrinsic lognormal scatter we allow for correlated scatter within the wl and sze massobservable relations and use simulations to constrain priors on nuisance parameters related to bias and scatter from wl we constrain the normalization of the zetam_500 relation a_mathrmsz120_6726 when using a prior on the mass slope b_mathrmsz from the latest spt cluster cosmology analysis without this prior we recover a_mathrmsz108_5223 and b_mathrmsz130_044022 results in both cases imply lower cluster masses than measured in previous work with and without wl although the uncertainties are large the wl derived value of b_mathrmsz is approx 20 lower than the value preferred by the most recent spt cluster cosmology analysis the method demonstrated in this work is designed to constrain cluster masses and cosmological parameters simultaneously and will form the basis for subsequent studies that employ the full spt cluster sample together with the des data | [['we', 'present', 'weak', 'lensing', 'wl', 'mass', 'constraints', 'for', 'a', 'sample', 'of', 'massive', 'galaxy', 'clusters', 'detected', 'by', 'the', 'south', 'pole', 'telescope', 'spt', 'via', 'the', 'sunyaevzeldovich', 'effect', 'sze', 'we', 'use', 'griz', 'imaging', 'data', 'obtained', 'from', 'the', 'science', 'verification', 'sv', 'phase', 'of', 'the', 'dark', 'energy', 'survey', 'des', 'to', 'fit', 'the', 'wl', 'shear', 'signal', 'of', '33', 'clusters', 'in', 'the', 'redshift', 'range', '025', 'le', 'z', 'le', '08', 'with', 'nfw', 'profiles', 'and', 'to', 'constrain', 'a', 'fourparameter', 'spt', 'massobservable', 'relation', 'to', 'account', 'for', 'biases', 'in', 'wl', 'masses', 'we', 'introduce', 'a', 'wl', 'mass', 'to', 'true', 'mass', 'scaling', 'relation', 'described', 'by', 'a', 'mean', 'bias', 'and', 'an', 'intrinsic', 'lognormal', 'scatter', 'we', 'allow', 'for', 'correlated', 'scatter', 'within', 'the', 'wl', 'and', 'sze', 'massobservable', 'relations', 'and', 'use', 'simulations', 'to', 'constrain', 'priors', 'on', 'nuisance', 'parameters', 'related', 'to', 'bias', 'and', 'scatter', 'from', 'wl', 'we', 'constrain', 'the', 'normalization', 'of', 'the', 'zetam_500', 'relation', 'a_mathrmsz120_6726', 'when', 'using', 'a', 'prior', 'on', 'the', 'mass', 'slope', 'b_mathrmsz', 'from', 'the', 'latest', 'spt', 'cluster', 'cosmology', 'analysis', 'without', 'this', 'prior', 'we', 'recover', 'a_mathrmsz108_5223', 'and', 'b_mathrmsz130_044022', 'results', 'in', 'both', 'cases', 'imply', 'lower', 'cluster', 'masses', 'than', 'measured', 'in', 'previous', 'work', 'with', 'and', 'without', 'wl', 'although', 'the', 'uncertainties', 'are', 'large', 'the', 'wl', 'derived', 'value', 'of', 'b_mathrmsz', 'is', 'approx', '20', 'lower', 'than', 'the', 'value', 'preferred', 'by', 'the', 'most', 'recent', 'spt', 'cluster', 'cosmology', 'analysis', 'the', 'method', 'demonstrated', 'in', 'this', 'work', 'is', 'designed', 'to', 'constrain', 'cluster', 'masses', 'and', 'cosmological', 'parameters', 'simultaneously', 'and', 'will', 'form', 'the', 'basis', 'for', 'subsequent', 'studies', 'that', 'employ', 'the', 'full', 'spt', 'cluster', 'sample', 'together', 'with', 'the', 'des', 'data']] | [-0.03808597227895355, 0.08128450254351148, -0.09768965582343492, 0.13987639467132854, -0.10278621527782462, -0.0801300498577667, 0.059390515978745326, 0.3546922812277966, -0.1969125953032338, -0.4096183294113329, 0.07228321902245838, -0.28457904941144774, -0.050074625118298736, 0.21873987827925606, 0.004178469480718783, 0.032162035720799356, 0.05944374947897852, -0.0902158420116819, -0.110023568315429, -0.27700201244331263, 0.3122907996831581, 0.11596918210307969, 0.2581390040867189, -0.05452374813216243, 0.061870662235045566, -0.0047218417223701455, -0.13390202909866547, 0.042721700180435564, -0.23507649829884264, 0.029660488790436153, 0.18265801878556848, 0.09949198741901745, 0.17471402960116084, -0.29259238587066955, -0.19594380777041884, 0.11404555859291886, 0.1733203696909341, 0.08526968608729224, -0.036101652721458294, -0.3114404704005636, 0.07739996458651459, -0.17117413272288567, -0.1194632378555438, 0.02015504028965184, -0.03492865448500565, -0.002773656965570247, -0.2648931506188943, 0.23289159046822883, -0.038106340534509495, 0.02927492944563323, -0.07824856544785361, -0.16418491444411748, -0.03955933873175069, 0.10018907030759518, -0.006862968055808798, 0.06255313145947901, 0.14662062992500338, -0.1405504780643164, -0.019194555605087985, 0.3674144373295155, -0.07584539545028708, -0.06932404034553057, 0.14512801152416208, -0.18849029082686025, -0.2147414357832415, 0.04936037060081404, 0.16702897236385245, -0.01641864079704627, -0.19097178461794256, 0.09199878098223324, 0.025008797439984343, 0.2642040143106529, 0.02784175045857642, 0.010048228305172512, 0.29627599973786384, 0.07640770452364566, 0.0697920708513343, 0.06801806901076293, -0.20992130507378184, 0.008569222333979734, -0.23465810216012153, -0.067142656883423, -0.16409967155691157, 0.03717921055318352, -0.14477982067823797, -0.13243768896233846, 0.30530762558584995, 0.18803389961930347, 0.22601276909229048, 0.14991586482092897, 0.3019022291763983, 0.07564265849316452, 0.12026748016595523, 0.029200733665059854, 0.3067578580309736, 0.1835503387869276, 0.06921339542753598, -0.21518320157192647, -0.007944601971874053, 0.004105173023956322] |
1,802.04534 | Pressure-Induced Topological Phase Transitions in CdGeSb$_2$ and
CdSnSb$_2$ | Topological quantum phase transitions (TQPTs) in a material induced by
external perturbations are often characterized by band touching points in the
Brillouin zone. The low-energy excitations near the degenerate band touching
points host different types of fermions while preserving the topological
protection of surface states. An interplay of different tunable topological
phases offers an insight into the evolution of the topological character. In
this paper, we study the occurrence of TQPTs as a function of hydrostatic
pressure in CdGeSb$_2$ and CdSnSb$_2$ chalcopyrites, using the first-principles
calculations. At ambient pressure, both materials are topological insulators
having a finite band gap with inverted order of Sb-$s$ and Sb-$p_x$,$p_y$
orbitals of valence bands at the $\Gamma$ point. On the application of
hydrostatic pressure the band gap reduces, and at the critical point of the
phase transition, these materials turn into Dirac semimetals. On further
increasing the pressure beyond the critical point, the band inversion is
reverted making them trivial insulators. The pressure-induced change in band
topology from non-trivial to trivial phase is also captured by L\"{u}ttinger
model Hamiltonian calculations. Our model demonstrates the critical role played
by a pressure-induced anisotropy in frontier bands in driving the phase
transitions. These theoretical findings of peculiar coexistence of multiple
topological phases in the same material provide a realistic and promising
platform for the experimental realization of the TQPT.
| cond-mat.mtrl-sci | topological quantum phase transitions tqpts in a material induced by external perturbations are often characterized by band touching points in the brillouin zone the lowenergy excitations near the degenerate band touching points host different types of fermions while preserving the topological protection of surface states an interplay of different tunable topological phases offers an insight into the evolution of the topological character in this paper we study the occurrence of tqpts as a function of hydrostatic pressure in cdgesb_2 and cdsnsb_2 chalcopyrites using the firstprinciples calculations at ambient pressure both materials are topological insulators having a finite band gap with inverted order of sbs and sbp_xp_y orbitals of valence bands at the gamma point on the application of hydrostatic pressure the band gap reduces and at the critical point of the phase transition these materials turn into dirac semimetals on further increasing the pressure beyond the critical point the band inversion is reverted making them trivial insulators the pressureinduced change in band topology from nontrivial to trivial phase is also captured by luttinger model hamiltonian calculations our model demonstrates the critical role played by a pressureinduced anisotropy in frontier bands in driving the phase transitions these theoretical findings of peculiar coexistence of multiple topological phases in the same material provide a realistic and promising platform for the experimental realization of the tqpt | [['topological', 'quantum', 'phase', 'transitions', 'tqpts', 'in', 'a', 'material', 'induced', 'by', 'external', 'perturbations', 'are', 'often', 'characterized', 'by', 'band', 'touching', 'points', 'in', 'the', 'brillouin', 'zone', 'the', 'lowenergy', 'excitations', 'near', 'the', 'degenerate', 'band', 'touching', 'points', 'host', 'different', 'types', 'of', 'fermions', 'while', 'preserving', 'the', 'topological', 'protection', 'of', 'surface', 'states', 'an', 'interplay', 'of', 'different', 'tunable', 'topological', 'phases', 'offers', 'an', 'insight', 'into', 'the', 'evolution', 'of', 'the', 'topological', 'character', 'in', 'this', 'paper', 'we', 'study', 'the', 'occurrence', 'of', 'tqpts', 'as', 'a', 'function', 'of', 'hydrostatic', 'pressure', 'in', 'cdgesb_2', 'and', 'cdsnsb_2', 'chalcopyrites', 'using', 'the', 'firstprinciples', 'calculations', 'at', 'ambient', 'pressure', 'both', 'materials', 'are', 'topological', 'insulators', 'having', 'a', 'finite', 'band', 'gap', 'with', 'inverted', 'order', 'of', 'sbs', 'and', 'sbp_xp_y', 'orbitals', 'of', 'valence', 'bands', 'at', 'the', 'gamma', 'point', 'on', 'the', 'application', 'of', 'hydrostatic', 'pressure', 'the', 'band', 'gap', 'reduces', 'and', 'at', 'the', 'critical', 'point', 'of', 'the', 'phase', 'transition', 'these', 'materials', 'turn', 'into', 'dirac', 'semimetals', 'on', 'further', 'increasing', 'the', 'pressure', 'beyond', 'the', 'critical', 'point', 'the', 'band', 'inversion', 'is', 'reverted', 'making', 'them', 'trivial', 'insulators', 'the', 'pressureinduced', 'change', 'in', 'band', 'topology', 'from', 'nontrivial', 'to', 'trivial', 'phase', 'is', 'also', 'captured', 'by', 'luttinger', 'model', 'hamiltonian', 'calculations', 'our', 'model', 'demonstrates', 'the', 'critical', 'role', 'played', 'by', 'a', 'pressureinduced', 'anisotropy', 'in', 'frontier', 'bands', 'in', 'driving', 'the', 'phase', 'transitions', 'these', 'theoretical', 'findings', 'of', 'peculiar', 'coexistence', 'of', 'multiple', 'topological', 'phases', 'in', 'the', 'same', 'material', 'provide', 'a', 'realistic', 'and', 'promising', 'platform', 'for', 'the', 'experimental', 'realization', 'of', 'the', 'tqpt']] | [-0.20902503781726575, 0.2045688219454839, -0.06759180338759843, 0.011783079326325033, -0.03274732338239069, -0.1277552708689991, 0.17268136980014184, 0.35782601985417, -0.2838178363088603, -0.29365966742067307, 0.018475282488637456, -0.33269924465162876, -0.16728729398955153, 0.1406721623293358, 0.04239115397101396, 0.038084207254687336, -0.03660556109043765, -0.0698663952990837, -0.15025383555096442, -0.15966011014167372, 0.3649441168152357, 0.013491550644914956, 0.3142795477776903, 0.08676012794244779, -0.023125283103266128, -0.02329366683075417, 0.0978194966202083, 0.006148476445979384, -0.14562545288311632, 0.03857861874177499, 0.27364670305498756, -0.10807402058479006, 0.20028425653605428, -0.43258969742617653, -0.2465690562850264, 0.012396174977367667, 0.09940586000527829, 0.10117727857812406, -0.08714503657017499, -0.33385278463159523, 0.055579468249619755, -0.128532966547837, -0.13823593536723558, -0.09602839400732388, -0.027874065935186463, -0.06299166748466047, -0.17421734075967785, 0.05254820825680389, 0.05106941735601588, 0.11770432681044868, -0.129663470918823, -0.10136557178418726, -0.1365697991802489, 0.11376019045880668, 0.043102561192269136, 0.02261008270038079, 0.12176891526241349, -0.13694170577404807, -0.10806260431891299, 0.44081176829324464, -0.012866892392075191, -0.0697655456574404, 0.19501782504025184, -0.15011552520339233, -0.09723658430215702, 0.2008396201952016, 0.11879133694346986, 0.041569863263194416, -0.06311123957644858, 0.10589324458306613, 0.024909738496293583, 0.12325335519383535, 0.0045318797137163, 0.07025340493645128, 0.31117055812833583, 0.17253865056924234, 0.07522427473540448, 0.14197726277677028, -0.10562285968619739, -0.0782969924918967, -0.2802071269565968, -0.1924062701054853, -0.24108259536359952, 0.010007189252928376, -0.08510905254385583, -0.2028891361099519, 0.4772963009532286, 0.1192862683573321, 0.16828999769465666, -0.0722932638844994, 0.22546002532028037, 0.13399651792691383, 0.04047577819185221, 0.04386973418943907, 0.2677634911990159, 0.11480653529973982, 0.07197685159432392, -0.2465020059150767, 0.02525471892477902, 0.04397497074380857] |
1,802.04535 | Modulational instability of nonlinear polarization mode coupling in
microresonators | We investigate frequency comb generation in the presence of polarization
effects induced by nonlinear mode coupling in microresonator devices. A set of
coupled temporal Lugiato-Lefever equations are derived to model the propagation
dynamics, and an in-depth study is made of the modulational instability of
their multistable homogeneous steady-state solutions. It is shown that new
kinds of instabilities can occur for co-propagating fields that interact
through nonlinear cross-phase modulation. These instabilities display
properties that differ from their scalar counterpart, and are shown to result
in the generation of new types of incoherently coupled frequency comb states.
| physics.optics | we investigate frequency comb generation in the presence of polarization effects induced by nonlinear mode coupling in microresonator devices a set of coupled temporal lugiatolefever equations are derived to model the propagation dynamics and an indepth study is made of the modulational instability of their multistable homogeneous steadystate solutions it is shown that new kinds of instabilities can occur for copropagating fields that interact through nonlinear crossphase modulation these instabilities display properties that differ from their scalar counterpart and are shown to result in the generation of new types of incoherently coupled frequency comb states | [['we', 'investigate', 'frequency', 'comb', 'generation', 'in', 'the', 'presence', 'of', 'polarization', 'effects', 'induced', 'by', 'nonlinear', 'mode', 'coupling', 'in', 'microresonator', 'devices', 'a', 'set', 'of', 'coupled', 'temporal', 'lugiatolefever', 'equations', 'are', 'derived', 'to', 'model', 'the', 'propagation', 'dynamics', 'and', 'an', 'indepth', 'study', 'is', 'made', 'of', 'the', 'modulational', 'instability', 'of', 'their', 'multistable', 'homogeneous', 'steadystate', 'solutions', 'it', 'is', 'shown', 'that', 'new', 'kinds', 'of', 'instabilities', 'can', 'occur', 'for', 'copropagating', 'fields', 'that', 'interact', 'through', 'nonlinear', 'crossphase', 'modulation', 'these', 'instabilities', 'display', 'properties', 'that', 'differ', 'from', 'their', 'scalar', 'counterpart', 'and', 'are', 'shown', 'to', 'result', 'in', 'the', 'generation', 'of', 'new', 'types', 'of', 'incoherently', 'coupled', 'frequency', 'comb', 'states']] | [-0.22979446766947054, 0.19672847331982524, -0.040201799194083405, 0.009653044215060379, -0.08897462297034892, -0.12480547662922427, -0.035885521318567426, 0.4062577041748323, -0.29881289619033374, -0.22907896448711032, 0.0629594064035796, -0.26807954269951506, -0.17697185883788685, 0.22483304772084872, 0.03582902561833371, 0.037570203688779946, 0.039328706809809724, -0.0460794718298865, 0.056898624212235994, -0.14638184005100477, 0.3164687566802298, 0.010298889806788218, 0.3416410699094597, -0.029498348635082182, 0.0835812485188638, -0.06209477338645803, -0.008186071515573483, -0.022772961894148274, -0.12044291261845501, 0.06363896097877603, 0.20538869150178998, 0.03196701970147459, 0.2484226444834157, -0.46233807190468434, -0.2702183307197533, 0.06609780446773297, 0.16321863679607448, 0.1542481403405729, -0.06210894910128493, -0.3032420099075688, 0.04140617782740216, -0.14315941745513364, -0.16744188540109653, -0.09913084918731137, -0.00570775807197941, 0.09786881532176937, -0.28653563560280754, 0.0958093468173358, 0.08929781200682843, 0.03219243892909665, -0.0644633883287162, 0.0015560810062053957, -0.08492245780255057, 0.055776305545709635, 0.01740148691092863, -0.07010431732051074, 0.09753602021006182, -0.15597261849937863, -0.1597351757919808, 0.3524033413219609, -0.12439173740383826, -0.18939564802781925, 0.20954096987353343, -0.13521195349718543, -0.023286140455227148, 0.15027090798769344, 0.22653901415239824, 0.11135658045348368, -0.12693448323315304, 0.011244669878904365, 0.03969184858234305, 0.1929256378280881, 0.15605891426584045, 0.14882790599704573, 0.23939178033094657, 0.16530888135986108, 0.009797783039118114, 0.16402891440513104, -0.031507066284355366, -0.10846830049137536, -0.2621257606746727, -0.067100137937814, -0.11887479474075678, 0.04355179420917442, -0.04337105568663805, -0.168738345210563, 0.45222753621637823, 0.16175687319452042, 0.08831543793999835, -0.053877509885320536, 0.24597874899443828, 0.18837802403156131, 0.05789352983334347, 0.02328741709750734, 0.34767572019053133, 0.1912072093789711, 0.09600194475466484, -0.2925601715491594, -0.030921357776969673, 0.02620632049480551] |
1,802.04536 | Helicity-protected domain-wall magnetoresistance in ferromagnetic Weyl
semimetal | The magnetotransport properties of disordered ferromagnetic Weyl semimetals
are investigated numerically. We found an extraordinarily stable and huge
magnetoresistance effect in domain walls of Weyl semimetals. This effect
originates from the helicity mismatch of Weyl fermions and is a specific
property of Weyl semimetals. Although conventional magnetoresistance effects
are strongly suppressed in domain walls where local magnetization varies
gradually, the helicity-protected magnetoresistance in Weyl semimetals
maintains almost $100\%$ of the magnetoresistance ratio for any kind of thick
domain walls, even in the presence of disorder. The contribution of surface
Fermi arcs to the magnetoresistance is also discussed.
| cond-mat.mes-hall cond-mat.dis-nn | the magnetotransport properties of disordered ferromagnetic weyl semimetals are investigated numerically we found an extraordinarily stable and huge magnetoresistance effect in domain walls of weyl semimetals this effect originates from the helicity mismatch of weyl fermions and is a specific property of weyl semimetals although conventional magnetoresistance effects are strongly suppressed in domain walls where local magnetization varies gradually the helicityprotected magnetoresistance in weyl semimetals maintains almost 100 of the magnetoresistance ratio for any kind of thick domain walls even in the presence of disorder the contribution of surface fermi arcs to the magnetoresistance is also discussed | [['the', 'magnetotransport', 'properties', 'of', 'disordered', 'ferromagnetic', 'weyl', 'semimetals', 'are', 'investigated', 'numerically', 'we', 'found', 'an', 'extraordinarily', 'stable', 'and', 'huge', 'magnetoresistance', 'effect', 'in', 'domain', 'walls', 'of', 'weyl', 'semimetals', 'this', 'effect', 'originates', 'from', 'the', 'helicity', 'mismatch', 'of', 'weyl', 'fermions', 'and', 'is', 'a', 'specific', 'property', 'of', 'weyl', 'semimetals', 'although', 'conventional', 'magnetoresistance', 'effects', 'are', 'strongly', 'suppressed', 'in', 'domain', 'walls', 'where', 'local', 'magnetization', 'varies', 'gradually', 'the', 'helicityprotected', 'magnetoresistance', 'in', 'weyl', 'semimetals', 'maintains', 'almost', '100', 'of', 'the', 'magnetoresistance', 'ratio', 'for', 'any', 'kind', 'of', 'thick', 'domain', 'walls', 'even', 'in', 'the', 'presence', 'of', 'disorder', 'the', 'contribution', 'of', 'surface', 'fermi', 'arcs', 'to', 'the', 'magnetoresistance', 'is', 'also', 'discussed']] | [-0.2953465553582646, 0.24327316310412547, 0.003984254716973131, 0.002078081884974381, -0.15498512299982772, -0.16662296917153677, 0.06327475124271587, 0.3614788996055722, -0.2830198096538273, -0.23983510457522547, -0.0324842691043159, -0.3455077417796322, -0.16948609966978742, 0.1723134574785945, 0.022037709956445422, -0.02098519601471101, -0.06241184266643055, -0.055463739670813084, -0.1269983480378869, -0.26888643573359633, 0.3480066746706143, -0.020051726865252324, 0.37681441520301934, 0.10945229310406528, 0.015004991107465079, -0.06108684365851028, 0.12644878083180325, 0.11579309431059907, -0.08762359825777821, -0.03421984060939091, 0.22145999558658028, -0.22824224688035125, 0.15297748796486607, -0.4212941582033333, -0.19025463473129398, 0.0222401732802003, 0.1871325367828831, 0.12603553525210978, -0.11288263628011919, -0.3267294837375327, 0.09727684503862595, -0.10449944213663305, -0.13863357014148883, -0.06248642677868096, -0.008510366247113174, -0.09703462603890027, -0.18551020799592757, 0.1669461572767735, 0.07236275868975402, 0.13103467904147692, -0.0975380802701693, -0.11468871457570155, -0.10269886072880278, 0.030341997865131514, 0.1267430099687772, -0.01344787818864764, 0.141070873973149, -0.14380672605329892, -0.14422202042624122, 0.3759414807815726, -0.040778535204784326, -0.1294865681193187, 0.1505850545169475, -0.24619009843445383, -0.0362231735343812, 0.17015151683881413, 0.13516034685017075, 0.11343893566906142, -0.11305305543646682, 0.14860324439481096, -0.020619059534510598, 0.06953830029427384, 0.036216653670029096, 0.08208148331808236, 0.30597474457075197, 0.1657277210688335, 0.050913477187956836, 0.15262813562973557, -0.16532388420697922, 0.021076135851520423, -0.2584955894271843, -0.19433373868620643, -0.30753697441226296, 0.0680072931718314, -0.0688667181090447, -0.28838220503045403, 0.4198593067206578, 0.13790503961854483, 0.19212470351582547, -0.06999724214256275, 0.20693054860263752, 0.07487630537495231, 0.11735651771111104, 0.07832648301458296, 0.2686473416664133, 0.1800312909472268, 0.1857507176367411, -0.2971591953222135, 0.07663700556683277, -0.006445457841133854] |
1,802.04537 | Tighter Variational Bounds are Not Necessarily Better | We provide theoretical and empirical evidence that using tighter evidence
lower bounds (ELBOs) can be detrimental to the process of learning an inference
network by reducing the signal-to-noise ratio of the gradient estimator. Our
results call into question common implicit assumptions that tighter ELBOs are
better variational objectives for simultaneous model learning and inference
amortization schemes. Based on our insights, we introduce three new algorithms:
the partially importance weighted auto-encoder (PIWAE), the multiply importance
weighted auto-encoder (MIWAE), and the combination importance weighted
auto-encoder (CIWAE), each of which includes the standard importance weighted
auto-encoder (IWAE) as a special case. We show that each can deliver
improvements over IWAE, even when performance is measured by the IWAE target
itself. Furthermore, our results suggest that PIWAE may be able to deliver
simultaneous improvements in the training of both the inference and generative
networks.
| stat.ML cs.LG | we provide theoretical and empirical evidence that using tighter evidence lower bounds elbos can be detrimental to the process of learning an inference network by reducing the signaltonoise ratio of the gradient estimator our results call into question common implicit assumptions that tighter elbos are better variational objectives for simultaneous model learning and inference amortization schemes based on our insights we introduce three new algorithms the partially importance weighted autoencoder piwae the multiply importance weighted autoencoder miwae and the combination importance weighted autoencoder ciwae each of which includes the standard importance weighted autoencoder iwae as a special case we show that each can deliver improvements over iwae even when performance is measured by the iwae target itself furthermore our results suggest that piwae may be able to deliver simultaneous improvements in the training of both the inference and generative networks | [['we', 'provide', 'theoretical', 'and', 'empirical', 'evidence', 'that', 'using', 'tighter', 'evidence', 'lower', 'bounds', 'elbos', 'can', 'be', 'detrimental', 'to', 'the', 'process', 'of', 'learning', 'an', 'inference', 'network', 'by', 'reducing', 'the', 'signaltonoise', 'ratio', 'of', 'the', 'gradient', 'estimator', 'our', 'results', 'call', 'into', 'question', 'common', 'implicit', 'assumptions', 'that', 'tighter', 'elbos', 'are', 'better', 'variational', 'objectives', 'for', 'simultaneous', 'model', 'learning', 'and', 'inference', 'amortization', 'schemes', 'based', 'on', 'our', 'insights', 'we', 'introduce', 'three', 'new', 'algorithms', 'the', 'partially', 'importance', 'weighted', 'autoencoder', 'piwae', 'the', 'multiply', 'importance', 'weighted', 'autoencoder', 'miwae', 'and', 'the', 'combination', 'importance', 'weighted', 'autoencoder', 'ciwae', 'each', 'of', 'which', 'includes', 'the', 'standard', 'importance', 'weighted', 'autoencoder', 'iwae', 'as', 'a', 'special', 'case', 'we', 'show', 'that', 'each', 'can', 'deliver', 'improvements', 'over', 'iwae', 'even', 'when', 'performance', 'is', 'measured', 'by', 'the', 'iwae', 'target', 'itself', 'furthermore', 'our', 'results', 'suggest', 'that', 'piwae', 'may', 'be', 'able', 'to', 'deliver', 'simultaneous', 'improvements', 'in', 'the', 'training', 'of', 'both', 'the', 'inference', 'and', 'generative', 'networks']] | [-0.016055400579609663, 0.008286058475705967, -0.08394777856986313, 0.12811013859633183, -0.11358844669987722, -0.1556072466123356, 0.0741736522245714, 0.44078927440568805, -0.2627679426907836, -0.3129568342667292, 0.07923606193456662, -0.23147288625135415, -0.20101978889707586, 0.22579737951266854, -0.11316731256802622, 0.04444509290453211, 0.15827667158052516, -0.0005159529132737696, -0.09355059980503831, -0.325096266801291, 0.2873980141285917, 0.08982650109101087, 0.33939498498597565, 0.04789737661314361, 0.10593232400167514, 0.00685877091360881, -0.007616263067842845, 0.021875785758739393, -0.106900529077607, 0.19218373629230293, 0.25672155874267716, 0.22365392275113502, 0.3462628512026961, -0.4106596749248531, -0.24704255828435315, 0.11982590487391195, 0.14987540793920154, 0.07012210505661856, -0.02615938629349009, -0.3012804600447827, 0.07662402898859, -0.15577591767342872, 0.011428992625202654, -0.1520960462615168, -0.10496309104115319, 0.03838024019890273, -0.3349757559172919, 0.05692062982673045, 0.11798967039580663, -0.001948469044531093, -0.06125449014978264, -0.17659007160075227, 0.008343861350166501, 0.1188310064293653, 0.01838103344091317, 0.0386814241646789, 0.06926052618826575, -0.1040740876684568, -0.143844273615875, 0.3062515059513423, -0.10550501035964664, -0.21418931570780628, 0.1309568413947572, -0.0398109733736526, -0.16542238369070486, 0.10116733015799101, 0.21895729047794113, 0.09781229163533733, -0.14466992492313746, -0.008498177204541314, -0.05767513233791653, 0.15458046466879108, -0.0004911549450993977, 0.029237255443791476, 0.1326672815844444, 0.20789398016452598, 0.10295913868364603, 0.14982218447103685, -0.13809181786628494, -0.08899714751169086, -0.2571598282768665, -0.11624312866479158, -0.16914796536730137, -0.01787521193824325, -0.16828841619666063, -0.10822982255366001, 0.34578103581374947, 0.2066460699604838, 0.2170084270902033, 0.13701713209893035, 0.3396465643993853, 0.09631376408608905, 0.06424816200674019, 0.09720082822433837, 0.23006957664106534, 0.0981355684583404, 0.04152786322511554, -0.160910658800276, 0.13299351682636532, 0.04067786441266756] |
1,802.04538 | Automated Early Leaderboard Generation From Comparative Tables | A leaderboard is a tabular presentation of performance scores of the best
competing techniques that address a specific scientific problem. Manually
maintained leaderboards take time to emerge, which induces a latency in
performance discovery and meaningful comparison. This can delay dissemination
of best practices to non-experts and practitioners. Regarding papers as proxies
for techniques, we present a new system to automatically discover and maintain
leaderboards in the form of partial orders between papers, based on performance
reported therein. In principle, a leaderboard depends on the task, data set,
other experimental settings, and the choice of performance metrics. Often there
are also tradeoffs between different metrics. Thus, leaderboard discovery is
not just a matter of accurately extracting performance numbers and comparing
them. In fact, the levels of noise and uncertainty around performance
comparisons are so large that reliable traditional extraction is infeasible. We
mitigate these challenges by using relatively cleaner, structured parts of the
papers, e.g., performance tables. We propose a novel performance improvement
graph with papers as nodes, where edges encode noisy performance comparison
information extracted from tables. Every individual performance edge is
extracted from a table with citations to other papers. These extractions
resemble (noisy) outcomes of 'matches' in an incomplete tournament. We propose
several approaches to rank papers from these noisy 'match' outcomes. We show
that our ranking scheme can reproduce various manually curated leaderboards
very well. Using widely-used lists of state-of-the-art papers in 27 areas of
Computer Science, we demonstrate that our system produces very reliable
rankings.
| cs.DL cs.IR | a leaderboard is a tabular presentation of performance scores of the best competing techniques that address a specific scientific problem manually maintained leaderboards take time to emerge which induces a latency in performance discovery and meaningful comparison this can delay dissemination of best practices to nonexperts and practitioners regarding papers as proxies for techniques we present a new system to automatically discover and maintain leaderboards in the form of partial orders between papers based on performance reported therein in principle a leaderboard depends on the task data set other experimental settings and the choice of performance metrics often there are also tradeoffs between different metrics thus leaderboard discovery is not just a matter of accurately extracting performance numbers and comparing them in fact the levels of noise and uncertainty around performance comparisons are so large that reliable traditional extraction is infeasible we mitigate these challenges by using relatively cleaner structured parts of the papers eg performance tables we propose a novel performance improvement graph with papers as nodes where edges encode noisy performance comparison information extracted from tables every individual performance edge is extracted from a table with citations to other papers these extractions resemble noisy outcomes of matches in an incomplete tournament we propose several approaches to rank papers from these noisy match outcomes we show that our ranking scheme can reproduce various manually curated leaderboards very well using widelyused lists of stateoftheart papers in 27 areas of computer science we demonstrate that our system produces very reliable rankings | [['a', 'leaderboard', 'is', 'a', 'tabular', 'presentation', 'of', 'performance', 'scores', 'of', 'the', 'best', 'competing', 'techniques', 'that', 'address', 'a', 'specific', 'scientific', 'problem', 'manually', 'maintained', 'leaderboards', 'take', 'time', 'to', 'emerge', 'which', 'induces', 'a', 'latency', 'in', 'performance', 'discovery', 'and', 'meaningful', 'comparison', 'this', 'can', 'delay', 'dissemination', 'of', 'best', 'practices', 'to', 'nonexperts', 'and', 'practitioners', 'regarding', 'papers', 'as', 'proxies', 'for', 'techniques', 'we', 'present', 'a', 'new', 'system', 'to', 'automatically', 'discover', 'and', 'maintain', 'leaderboards', 'in', 'the', 'form', 'of', 'partial', 'orders', 'between', 'papers', 'based', 'on', 'performance', 'reported', 'therein', 'in', 'principle', 'a', 'leaderboard', 'depends', 'on', 'the', 'task', 'data', 'set', 'other', 'experimental', 'settings', 'and', 'the', 'choice', 'of', 'performance', 'metrics', 'often', 'there', 'are', 'also', 'tradeoffs', 'between', 'different', 'metrics', 'thus', 'leaderboard', 'discovery', 'is', 'not', 'just', 'a', 'matter', 'of', 'accurately', 'extracting', 'performance', 'numbers', 'and', 'comparing', 'them', 'in', 'fact', 'the', 'levels', 'of', 'noise', 'and', 'uncertainty', 'around', 'performance', 'comparisons', 'are', 'so', 'large', 'that', 'reliable', 'traditional', 'extraction', 'is', 'infeasible', 'we', 'mitigate', 'these', 'challenges', 'by', 'using', 'relatively', 'cleaner', 'structured', 'parts', 'of', 'the', 'papers', 'eg', 'performance', 'tables', 'we', 'propose', 'a', 'novel', 'performance', 'improvement', 'graph', 'with', 'papers', 'as', 'nodes', 'where', 'edges', 'encode', 'noisy', 'performance', 'comparison', 'information', 'extracted', 'from', 'tables', 'every', 'individual', 'performance', 'edge', 'is', 'extracted', 'from', 'a', 'table', 'with', 'citations', 'to', 'other', 'papers', 'these', 'extractions', 'resemble', 'noisy', 'outcomes', 'of', 'matches', 'in', 'an', 'incomplete', 'tournament', 'we', 'propose', 'several', 'approaches', 'to', 'rank', 'papers', 'from', 'these', 'noisy', 'match', 'outcomes', 'we', 'show', 'that', 'our', 'ranking', 'scheme', 'can', 'reproduce', 'various', 'manually', 'curated', 'leaderboards', 'very', 'well', 'using', 'widelyused', 'lists', 'of', 'stateoftheart', 'papers', 'in', '27', 'areas', 'of', 'computer', 'science', 'we', 'demonstrate', 'that', 'our', 'system', 'produces', 'very', 'reliable', 'rankings']] | [-0.08305381950060838, -0.0006548340455046855, -0.04947579341381788, 0.0773892020857893, -0.1289918373413384, -0.1476192445810884, 0.11328368946351111, 0.4171276035606861, -0.2199530819505453, -0.38974213364720345, 0.08132630983646959, -0.323273928145878, -0.15798549052505403, 0.2303651667111553, -0.14136880504060537, 0.055703327553346754, 0.16339728292962535, 0.0393639254164882, -0.07059614127501845, -0.33079457860125694, 0.29655974423605946, 0.06900334624573588, 0.3228648942830041, 0.031869226322509346, 0.054190730961505326, -0.05586847988842055, -0.09288469784753398, 0.0402738642510958, -0.09709422129055019, 0.14613901258958503, 0.3423376368936151, 0.20664330401271583, 0.3102996787242591, -0.38084450300910977, -0.16856343238055707, 0.06431260684132575, 0.10866045711137122, 0.10909977366356179, -0.027307298657484352, -0.3067724931836128, 0.07688998403446749, -0.18408815083745866, 0.0005078273210674524, -0.13957876938953995, -0.002295409308979288, 0.03648525353893638, -0.2620564171280712, 0.058906716960831544, 0.010940485504223035, 0.08306861075013876, -0.0016877000662498176, -0.166611057877657, 0.0407934166318737, 0.2038031830501277, 0.04209633880760521, 0.020983370072674007, 0.1301792675720062, -0.14156210471643135, -0.18560166336130351, 0.38235436733067035, -0.03788281314773485, -0.17593285721936264, 0.20432689653895794, -0.044543024616315964, -0.14968120250757783, 0.09287888217327418, 0.19432436732947828, 0.085625661388156, -0.16627213082648815, -0.015301574808079749, -0.04278745318087749, 0.21604147754982114, 0.09848823268571869, 0.031811585880815986, 0.1783380165155977, 0.19405597312748432, 0.021505020557902755, 0.10817750047706068, -0.04190855646133423, -0.06689117492549121, -0.23757926845364272, -0.102987738404423, -0.17341660944186152, -0.006110864045971539, -0.07631550047057681, -0.1574905919805169, 0.3983513153256354, 0.21865849994966993, 0.1956465289290063, 0.05030815355712548, 0.33731451699044557, 0.013103182173857931, 0.05597169372998178, 0.10005489608389326, 0.18571274365019053, 0.014890860841609538, 0.1088183375261724, -0.11967922423779964, 0.12440357897244393, 0.020136222257744522] |
1,802.04539 | A Lagrangian Inertial Centroidal Voronoi Particle method for dynamic
load balancing in particle-based simulations | In this paper we develop a Lagrangian Inertial Centroidal Voronoi Particle
(LICVP) method to extend the original CVP method \cite{fu2017physics} to
dynamic load balancing in particle-based simulations. Two new concepts are
proposed to address the additional problems encountered in repartitioning the
system. First, a background velocity is introduced to transport Voronoi
particle according to the local fluid field, which facilitates data reuse and
lower data redistribution cost during rebalancing. Second, in order to handle
problems with skew-aligned computational load and large void space, we develop
an inertial-based partitioning strategy, where the inertial matrix is utilized
to characterize the load distribution, and to confine the motion of Voronoi
particles dynamically adapting to the physical simulation. Intensive numerical
tests in fluid dynamics simulations reveal that the underlying LICVP method
improves the incremental property remarkably without sacrifices on other
objectives, i.e. the inter-processor communication is optimized simultaneously,
and the repartitioning procedure is highly efficient.
| physics.comp-ph | in this paper we develop a lagrangian inertial centroidal voronoi particle licvp method to extend the original cvp method citefu2017physics to dynamic load balancing in particlebased simulations two new concepts are proposed to address the additional problems encountered in repartitioning the system first a background velocity is introduced to transport voronoi particle according to the local fluid field which facilitates data reuse and lower data redistribution cost during rebalancing second in order to handle problems with skewaligned computational load and large void space we develop an inertialbased partitioning strategy where the inertial matrix is utilized to characterize the load distribution and to confine the motion of voronoi particles dynamically adapting to the physical simulation intensive numerical tests in fluid dynamics simulations reveal that the underlying licvp method improves the incremental property remarkably without sacrifices on other objectives ie the interprocessor communication is optimized simultaneously and the repartitioning procedure is highly efficient | [['in', 'this', 'paper', 'we', 'develop', 'a', 'lagrangian', 'inertial', 'centroidal', 'voronoi', 'particle', 'licvp', 'method', 'to', 'extend', 'the', 'original', 'cvp', 'method', 'citefu2017physics', 'to', 'dynamic', 'load', 'balancing', 'in', 'particlebased', 'simulations', 'two', 'new', 'concepts', 'are', 'proposed', 'to', 'address', 'the', 'additional', 'problems', 'encountered', 'in', 'repartitioning', 'the', 'system', 'first', 'a', 'background', 'velocity', 'is', 'introduced', 'to', 'transport', 'voronoi', 'particle', 'according', 'to', 'the', 'local', 'fluid', 'field', 'which', 'facilitates', 'data', 'reuse', 'and', 'lower', 'data', 'redistribution', 'cost', 'during', 'rebalancing', 'second', 'in', 'order', 'to', 'handle', 'problems', 'with', 'skewaligned', 'computational', 'load', 'and', 'large', 'void', 'space', 'we', 'develop', 'an', 'inertialbased', 'partitioning', 'strategy', 'where', 'the', 'inertial', 'matrix', 'is', 'utilized', 'to', 'characterize', 'the', 'load', 'distribution', 'and', 'to', 'confine', 'the', 'motion', 'of', 'voronoi', 'particles', 'dynamically', 'adapting', 'to', 'the', 'physical', 'simulation', 'intensive', 'numerical', 'tests', 'in', 'fluid', 'dynamics', 'simulations', 'reveal', 'that', 'the', 'underlying', 'licvp', 'method', 'improves', 'the', 'incremental', 'property', 'remarkably', 'without', 'sacrifices', 'on', 'other', 'objectives', 'ie', 'the', 'interprocessor', 'communication', 'is', 'optimized', 'simultaneously', 'and', 'the', 'repartitioning', 'procedure', 'is', 'highly', 'efficient']] | [-0.1122350006041174, 0.09277935631877701, -0.10182613143570671, 0.043148330928358646, -0.1057006342140134, -0.1376476791833027, 0.05640960221897912, 0.3690219074931173, -0.3047709476937648, -0.3533288572414392, 0.05469961511842324, -0.20333223485825014, -0.137757074157549, 0.13683150677789688, -0.12430574369163816, 0.09759173969909245, 0.06702673567306934, -0.02806799517759141, -0.012501808637705612, -0.2438936396463846, 0.25204766732498013, 0.12022653545195959, 0.32564025514182593, 0.011527807667192554, 0.12107533826112594, 0.011995166047558594, -0.0635847765302957, 0.052511368023829934, -0.1297594443944914, 0.1197126424684487, 0.23312848851046697, 0.1346914726341156, 0.30161351597785546, -0.45377387184583184, -0.2214770178123675, 0.09503386510127433, 0.14322558388456094, 0.10432381678268085, -0.04556446806543513, -0.22312086157906216, 0.08633096712692102, -0.1390075244636712, -0.10938184043126446, -0.11347594177888921, -0.041794110522732186, 0.03996088872917098, -0.3023892926926516, 0.06025832369891914, 0.015656298378064315, 0.014602910562538776, -0.06350527223370665, -0.07181309267710641, 0.022499257495918242, 0.11305131959779581, 0.018216885746691096, 0.014523510566554635, 0.1769713478093194, -0.08722050393279009, -0.1093013385955409, 0.43550215346016447, 0.009204378824753901, -0.26390939528204904, 0.19873896446459147, -0.07620108988592211, -0.11704559646211057, 0.16159776129227663, 0.23094693675231773, 0.09526762064684144, -0.17515069308380285, 0.04548314904800432, 0.011872977879988093, 0.1461302410608449, 0.033588555536936134, -0.03124040421496421, 0.11132045191250184, 0.19299528026457585, 0.12722031783857415, 0.15891722710858586, -0.09321059205499636, -0.15880647944729953, -0.23915965460259847, -0.14811336832456798, -0.2149973874975021, -0.07211773987815139, -0.11373951327535609, -0.15262490410522436, 0.3608767606641109, 0.20271414812008032, 0.15013498025407798, 0.0675211475492292, 0.3660922287504005, 0.06015609421127406, 0.05545798608151005, 0.12687978264242158, 0.18964339624361776, 0.08852363287211479, 0.15414656697119883, -0.2734917513537141, 0.02765179835881588, 0.11100790780797905] |
1,802.0454 | Photon correlations in both time and frequency | While quantum mechanics precludes the perfect knowledge of so-called
"conjugate" variables, such as time and frequency, we discuss the importance of
compromising to retain a fair knowledge of their combined values. In the case
of light, we show how time and frequency photon correlations allow us to
identify a new type of photon emission, which can be used to design a new type
of quantum source where we can choose the distribution in time and energy of
the emitted photons.
| quant-ph cond-mat.quant-gas physics.pop-ph | while quantum mechanics precludes the perfect knowledge of socalled conjugate variables such as time and frequency we discuss the importance of compromising to retain a fair knowledge of their combined values in the case of light we show how time and frequency photon correlations allow us to identify a new type of photon emission which can be used to design a new type of quantum source where we can choose the distribution in time and energy of the emitted photons | [['while', 'quantum', 'mechanics', 'precludes', 'the', 'perfect', 'knowledge', 'of', 'socalled', 'conjugate', 'variables', 'such', 'as', 'time', 'and', 'frequency', 'we', 'discuss', 'the', 'importance', 'of', 'compromising', 'to', 'retain', 'a', 'fair', 'knowledge', 'of', 'their', 'combined', 'values', 'in', 'the', 'case', 'of', 'light', 'we', 'show', 'how', 'time', 'and', 'frequency', 'photon', 'correlations', 'allow', 'us', 'to', 'identify', 'a', 'new', 'type', 'of', 'photon', 'emission', 'which', 'can', 'be', 'used', 'to', 'design', 'a', 'new', 'type', 'of', 'quantum', 'source', 'where', 'we', 'can', 'choose', 'the', 'distribution', 'in', 'time', 'and', 'energy', 'of', 'the', 'emitted', 'photons']] | [-0.08870911521953531, 0.13642973512178286, -0.11160740935592912, 0.058316522799941595, -0.11211200461839325, -0.11736942169372924, 0.10561473790439777, 0.3770337468245998, -0.27276333353947846, -0.32369715087115764, 0.04838080273766536, -0.2404030102188699, -0.04228705865389202, 0.2007220250554383, -0.05206506702234037, 0.047290120988509446, 0.02582478312542662, 0.04627712212095503, -0.045334635471226646, -0.16979089616797866, 0.3116003522183746, 0.06720283450267743, 0.2635733932489529, 0.06368646094342693, 0.11450789850205183, 0.037272792778094296, -0.037058787670684976, -0.016039434494450687, -0.08159455904969945, 0.09360802770243026, 0.26077129852492364, 0.1507597125135362, 0.2548921701032668, -0.4402912141755223, -0.20322991028951948, 0.16717483746469952, 0.13532875667442568, 0.11860769253253238, -0.03574133500223979, -0.24301115821290295, 0.030103349167620762, -0.156961650820449, -0.16459465376101434, -0.07390978471376002, -0.04438902500551194, 0.04654625403272803, -0.2678168318350799, 0.07292575945612043, 0.05579162962822011, -0.025539289216976614, -0.011224000639049336, -0.051738794858101754, 0.0035167077381629496, 0.16693268304807135, 0.015691678295843302, -0.02248719150084071, 0.10488211370684439, -0.12861966283526272, -0.14526625197613613, 0.4049723544390872, -0.06873740392620675, -0.1813960564089939, 0.1647103720868472, -0.1502365519059822, -0.10662233522161842, 0.09841064414940774, 0.20719961016129673, 0.1238772050011903, -0.1198023670091061, 0.02567674127421924, 0.03748606744920835, 0.2287565028294921, 0.06942483903549146, 0.14688292942009867, 0.2150012577068992, 0.10584124779561535, 0.016038275085156782, 0.15582932153338333, -0.1354151661740616, -0.10524939307651948, -0.31403562950436026, -0.2145170574542135, -0.19636501341592522, 0.08472849261015654, -0.07878766424782953, -0.12005559375393204, 0.4465535647235811, 0.1842950193095021, 0.18692590564023703, 0.02645856634626398, 0.26115962871117515, 0.12313961054751417, 0.05399412096303422, 0.0601729411398992, 0.2581975552602671, 0.10534722210431938, 0.0850624661456095, -0.221106806746684, 0.050029684317996724, -0.028324812720529734] |
1,802.04541 | Dynamic Greedy Algorithms for the Edwards-Anderson Model | To provide a novel tool for the investigation of the energy landscape of the
Edwards-Anderson spin-glass model we introduce an algorithm that allows an
efficient execution of a greedy optimization based on data from a previously
performed optimization for a similar configuration. As an application we show
how the technique can be used to perform higher-order greedy optimizations and
simulated annealing searches with improved performance.
| cond-mat.dis-nn | to provide a novel tool for the investigation of the energy landscape of the edwardsanderson spinglass model we introduce an algorithm that allows an efficient execution of a greedy optimization based on data from a previously performed optimization for a similar configuration as an application we show how the technique can be used to perform higherorder greedy optimizations and simulated annealing searches with improved performance | [['to', 'provide', 'a', 'novel', 'tool', 'for', 'the', 'investigation', 'of', 'the', 'energy', 'landscape', 'of', 'the', 'edwardsanderson', 'spinglass', 'model', 'we', 'introduce', 'an', 'algorithm', 'that', 'allows', 'an', 'efficient', 'execution', 'of', 'a', 'greedy', 'optimization', 'based', 'on', 'data', 'from', 'a', 'previously', 'performed', 'optimization', 'for', 'a', 'similar', 'configuration', 'as', 'an', 'application', 'we', 'show', 'how', 'the', 'technique', 'can', 'be', 'used', 'to', 'perform', 'higherorder', 'greedy', 'optimizations', 'and', 'simulated', 'annealing', 'searches', 'with', 'improved', 'performance']] | [-0.0576306067693692, 0.004320289086004217, -0.1876811266733477, 0.1010266677977947, -0.09241151520265983, -0.1333894232717844, 0.07136601124030466, 0.4355471463730702, -0.23642620565369726, -0.37058206335283245, 0.0919277481878033, -0.18495459743941095, -0.1856125427266726, 0.24097950898039228, -0.01287489915983035, 0.10657482567028358, 0.08947947876384625, -0.012948416011819902, -0.08470266309136955, -0.24715820290685558, 0.22391595580758383, 0.131932674950132, 0.2896218178077386, 0.02318247199918215, 0.07742905199993402, 0.05074085255440038, 0.057720358684085885, 0.04952102532753577, -0.15890087901240735, 0.12649867112676685, 0.23099408307327673, 0.20597802808938118, 0.2795650863303588, -0.43426012461288616, -0.1815587544383911, 0.10848089550406886, 0.16554737718632587, 0.1311555782153916, -0.09732000106551612, -0.26118456813005303, 0.07249657818331168, -0.1720117369523415, -0.07085664393022083, -0.18739280118965185, -0.0972875856436216, 0.0022634003741236835, -0.340884220528488, -0.002608589262056809, 0.030596578284166752, 0.04794076757075695, -0.05100727717553337, -0.12415092147600193, 0.042685463895591406, 0.09095491677379379, -0.019023800327872428, 0.05423172811189523, 0.1347880650454989, -0.06177008726562445, -0.25430955081604995, 0.3755832743472778, -0.07398318241421993, -0.19558980109599922, 0.1815515254660008, 0.03411491695218361, -0.1736237606105323, 0.1383832098199771, 0.2359087684406684, 0.16661108558854232, -0.16671951986276187, 0.057111607963899864, 0.0013976854773668143, 0.20788719860407023, -0.04065331700616158, -0.026238615646098667, 0.13229319556401326, 0.279059008623545, 0.13767805982094544, 0.2471607938247661, -0.10451783409986931, -0.07686699648889211, -0.2294530631114657, -0.16321902935608076, -0.18910670435915772, 0.0012368327508179042, -0.10730272923358895, -0.17734598099934654, 0.4055113539672815, 0.22436292064734376, 0.20385438856812052, 0.06826283739736447, 0.3263233927006905, 0.08150606421717944, 0.046606914802955896, 0.08826722478350768, 0.17525332875263233, 0.037085266497272715, 0.11008700290694833, -0.23080625033650834, 0.03587892405294742, 0.049316323774222] |
1,802.04542 | Decoding quantum criticalities from fermionic/parafermionic topological
states | Under an appropriate symmetric bulk bipartition in a one-dimensional symmetry
protected topological phase with the Affleck-Kennedy-Lieb-Tasaki matrix product
state wave function for the odd integer spin chains, a bulk critical
entanglement spectrum can be obtained, describing the excitation spectrum of
the critical point separating the topological phase from the trivial phase with
the same symmetry. Such a critical point is beyond the standard
Landau-Ginzburg-Wilson paradigm for symmetry breaking phase transitions.
Recently, the framework of matrix product states for topological phases with
Majorana fermions/parafermions has been established. Here we first generalize
these fixed-point matrix product states with the zero correlation length to the
more generic ground-state wave functions with a finite correlation length for
the general one-dimensional interacting Majorana fermion/parafermion systems.
Then we employ the previous method to decode quantum criticality from the
interacting Majorana fermion/parafermion matrix product states. The obtained
quantum critical spectra are described by the conformal field theories with
central charge $c\leq 1$, characterizing the quantum critical theories
separating the fermionic/parafermionic topological phases from the trivial
phases with the same symmetry.
| cond-mat.str-el cond-mat.stat-mech quant-ph | under an appropriate symmetric bulk bipartition in a onedimensional symmetry protected topological phase with the affleckkennedyliebtasaki matrix product state wave function for the odd integer spin chains a bulk critical entanglement spectrum can be obtained describing the excitation spectrum of the critical point separating the topological phase from the trivial phase with the same symmetry such a critical point is beyond the standard landauginzburgwilson paradigm for symmetry breaking phase transitions recently the framework of matrix product states for topological phases with majorana fermionsparafermions has been established here we first generalize these fixedpoint matrix product states with the zero correlation length to the more generic groundstate wave functions with a finite correlation length for the general onedimensional interacting majorana fermionparafermion systems then we employ the previous method to decode quantum criticality from the interacting majorana fermionparafermion matrix product states the obtained quantum critical spectra are described by the conformal field theories with central charge cleq 1 characterizing the quantum critical theories separating the fermionicparafermionic topological phases from the trivial phases with the same symmetry | [['under', 'an', 'appropriate', 'symmetric', 'bulk', 'bipartition', 'in', 'a', 'onedimensional', 'symmetry', 'protected', 'topological', 'phase', 'with', 'the', 'affleckkennedyliebtasaki', 'matrix', 'product', 'state', 'wave', 'function', 'for', 'the', 'odd', 'integer', 'spin', 'chains', 'a', 'bulk', 'critical', 'entanglement', 'spectrum', 'can', 'be', 'obtained', 'describing', 'the', 'excitation', 'spectrum', 'of', 'the', 'critical', 'point', 'separating', 'the', 'topological', 'phase', 'from', 'the', 'trivial', 'phase', 'with', 'the', 'same', 'symmetry', 'such', 'a', 'critical', 'point', 'is', 'beyond', 'the', 'standard', 'landauginzburgwilson', 'paradigm', 'for', 'symmetry', 'breaking', 'phase', 'transitions', 'recently', 'the', 'framework', 'of', 'matrix', 'product', 'states', 'for', 'topological', 'phases', 'with', 'majorana', 'fermionsparafermions', 'has', 'been', 'established', 'here', 'we', 'first', 'generalize', 'these', 'fixedpoint', 'matrix', 'product', 'states', 'with', 'the', 'zero', 'correlation', 'length', 'to', 'the', 'more', 'generic', 'groundstate', 'wave', 'functions', 'with', 'a', 'finite', 'correlation', 'length', 'for', 'the', 'general', 'onedimensional', 'interacting', 'majorana', 'fermionparafermion', 'systems', 'then', 'we', 'employ', 'the', 'previous', 'method', 'to', 'decode', 'quantum', 'criticality', 'from', 'the', 'interacting', 'majorana', 'fermionparafermion', 'matrix', 'product', 'states', 'the', 'obtained', 'quantum', 'critical', 'spectra', 'are', 'described', 'by', 'the', 'conformal', 'field', 'theories', 'with', 'central', 'charge', 'cleq', '1', 'characterizing', 'the', 'quantum', 'critical', 'theories', 'separating', 'the', 'fermionicparafermionic', 'topological', 'phases', 'from', 'the', 'trivial', 'phases', 'with', 'the', 'same', 'symmetry']] | [-0.1952530160269386, 0.2685821745111559, -0.0788267604158034, 0.03945349598063718, -0.004607464787522717, -0.20743754357871044, 0.0367447855681203, 0.29363029142125296, -0.2638025520942532, -0.21054739399796582, 0.06811569384974289, -0.313004365334144, -0.1438655633473846, 0.09247308147839717, 0.07158849077828272, 0.12801148279255928, -0.05100425185646708, 0.05849350989484862, -0.18720098438303498, -0.17047580428553757, 0.3735017132829632, -0.029221015155023327, 0.3185976808697823, 0.03190783112545459, 0.010419976555869072, 0.02852765611268183, 0.10324764065720009, -0.0204516823359451, -0.13888139847236183, 0.03259721398388019, 0.25761621629477605, 0.015061462495046167, 0.11869478488206477, -0.43333200805065547, -0.24113630054838206, 0.11393727561921851, 0.13609444612042, 0.14356382594295067, -0.05528898301340444, -0.36471617109136734, 0.06335970777301835, -0.1915642086901432, -0.16215759074624034, -0.07236492002834759, -0.007248296622137302, -0.07678174247934907, -0.2253585013632591, 0.07804723015363664, 0.022128126761716233, 0.0708619585515967, -0.030540956884137625, -0.1018076106036611, -0.06860626442633437, 0.1320163931190615, 0.010307395407453334, 0.03099295769999983, 0.09601830726092649, -0.12366272866885734, -0.15279781155924715, 0.3533741945318861, -0.03912828511492344, -0.1689575875960511, 0.1750753677791789, -0.13711854032288684, -0.14094249139327733, 0.13262836003301323, 0.06072776945385002, 0.08598249383200478, -0.06355529266944122, 0.12465412364229897, -0.028167770244008943, 0.15531222543268625, -0.010460363403403547, 0.07121414881779609, 0.2745239672653333, 0.10226149131824984, 0.09100542789512485, 0.1779948079437789, -0.03260576858918166, -0.15726322873313664, -0.3139054406084363, -0.18828393667715893, -0.265529226941558, 0.07200656683627135, -0.10764009245676842, -0.19147994230947726, 0.47031742270440746, 0.09566924759190593, 0.16330005042806003, 0.03214219972055912, 0.2270982545447817, 0.18134904518921877, 0.06591451855806205, 0.05724756471081168, 0.21461264854820566, 0.17963177939331346, 0.04505618540335932, -0.23682761434934063, -0.017607157418956243, 0.1380126035314869] |
1,802.04543 | Artin Billiard Exponential Decay of Correlation Functions | The hyperbolic Anosov C-systems have exponential instability of their
trajectories and as such represent the most natural chaotic dynamical systems.
Of special interest are C-systems which are defined on compact surfaces of the
Lobachevsky plane of constant negative curvature. An example of such system has
been introduced in a brilliant article published in 1924 by the mathematician
Emil Artin. The dynamical system is defined on the fundamental region of the
Lobachevsky plane which is obtained by the identification of points congruent
with respect to the modular group, a discrete subgroup of the Lobachevsky plane
isometries. The fundamental region in this case is a hyperbolic triangle. The
geodesic trajectories of the non-Euclidean billiard are bounded to propagate on
the fundamental hyperbolic triangle. In this article we shall expose his
results, will calculate the correlation functions/observables which are defined
on the phase space of the Artin billiard and demonstrate the exponential decay
of the correlation functions with time. We use Artin symbolic dynamics, the
differential geometry and group theoretical methods of Gelfand and Fomin.
| nlin.CD hep-th math-ph math.MP | the hyperbolic anosov csystems have exponential instability of their trajectories and as such represent the most natural chaotic dynamical systems of special interest are csystems which are defined on compact surfaces of the lobachevsky plane of constant negative curvature an example of such system has been introduced in a brilliant article published in 1924 by the mathematician emil artin the dynamical system is defined on the fundamental region of the lobachevsky plane which is obtained by the identification of points congruent with respect to the modular group a discrete subgroup of the lobachevsky plane isometries the fundamental region in this case is a hyperbolic triangle the geodesic trajectories of the noneuclidean billiard are bounded to propagate on the fundamental hyperbolic triangle in this article we shall expose his results will calculate the correlation functionsobservables which are defined on the phase space of the artin billiard and demonstrate the exponential decay of the correlation functions with time we use artin symbolic dynamics the differential geometry and group theoretical methods of gelfand and fomin | [['the', 'hyperbolic', 'anosov', 'csystems', 'have', 'exponential', 'instability', 'of', 'their', 'trajectories', 'and', 'as', 'such', 'represent', 'the', 'most', 'natural', 'chaotic', 'dynamical', 'systems', 'of', 'special', 'interest', 'are', 'csystems', 'which', 'are', 'defined', 'on', 'compact', 'surfaces', 'of', 'the', 'lobachevsky', 'plane', 'of', 'constant', 'negative', 'curvature', 'an', 'example', 'of', 'such', 'system', 'has', 'been', 'introduced', 'in', 'a', 'brilliant', 'article', 'published', 'in', '1924', 'by', 'the', 'mathematician', 'emil', 'artin', 'the', 'dynamical', 'system', 'is', 'defined', 'on', 'the', 'fundamental', 'region', 'of', 'the', 'lobachevsky', 'plane', 'which', 'is', 'obtained', 'by', 'the', 'identification', 'of', 'points', 'congruent', 'with', 'respect', 'to', 'the', 'modular', 'group', 'a', 'discrete', 'subgroup', 'of', 'the', 'lobachevsky', 'plane', 'isometries', 'the', 'fundamental', 'region', 'in', 'this', 'case', 'is', 'a', 'hyperbolic', 'triangle', 'the', 'geodesic', 'trajectories', 'of', 'the', 'noneuclidean', 'billiard', 'are', 'bounded', 'to', 'propagate', 'on', 'the', 'fundamental', 'hyperbolic', 'triangle', 'in', 'this', 'article', 'we', 'shall', 'expose', 'his', 'results', 'will', 'calculate', 'the', 'correlation', 'functionsobservables', 'which', 'are', 'defined', 'on', 'the', 'phase', 'space', 'of', 'the', 'artin', 'billiard', 'and', 'demonstrate', 'the', 'exponential', 'decay', 'of', 'the', 'correlation', 'functions', 'with', 'time', 'we', 'use', 'artin', 'symbolic', 'dynamics', 'the', 'differential', 'geometry', 'and', 'group', 'theoretical', 'methods', 'of', 'gelfand', 'and', 'fomin']] | [-0.17591277070136535, 0.101910195610985, -0.1121012882863264, 0.07633717939099678, -0.09917488470891414, -0.08250193152854447, -0.02813907205099948, 0.3282074721105266, -0.3068444420895349, -0.23363153240949797, 0.11940317606275673, -0.3008286897324527, -0.16761614410043285, 0.2237819789674634, -0.13022677752098114, 0.08242265232879538, 0.01344625434800111, 0.07936133709545547, -0.06429677604485237, -0.25052665401936364, 0.3934415179190406, -0.0021311702419137745, 0.22207889709708808, 0.026900350105300633, 0.09617606905555864, 0.006939825659062256, -0.04941190501173947, 8.011484577876042e-05, -0.16338915331646586, 0.12850020958753358, 0.22637105385816456, 0.059822658249803366, 0.20959017443339945, -0.38212397878673693, -0.19187258165983254, 0.12434509393829875, 0.14959066318979825, 0.02640531457789046, -0.0550679831005829, -0.3330144871595419, 0.023014424322445316, -0.11557386467255086, -0.17578282163135314, -0.02240056299185108, 0.05937549476212228, 0.042931311709359724, -0.14846375683861734, 0.03389678621523039, 0.11103377354362631, 0.11234501498201263, -0.03402441606124351, -0.07036546393765997, -0.041057325408069625, 0.13150803054334345, 0.027955660750348752, 0.06197905077528187, 0.09618328315919342, -0.03872569137639557, -0.11735978717874866, 0.4207704654725933, -0.027337539876397286, -0.2481835648439258, 0.14248944519697662, -0.1986544304772427, -0.12643989572936004, 0.11513306269468468, 0.17905246021977642, 0.1285830611112522, -0.0743362776695462, 0.1790897655913508, -0.11235549920156859, 0.0857795277836444, 0.11505821650597262, -0.020142423552706054, 0.1545377946377062, 0.1118375147197243, 0.06423695753219576, 0.13539461239121245, -0.012841663108893522, -0.12193450812054307, -0.3266793530303658, -0.19508805484320338, -0.14435708848963769, 0.06912434004296206, -0.08224849369647853, -0.21326035062907733, 0.3968067352594644, 0.033706736857104194, 0.15453062033585724, 0.059448775477919796, 0.22559052121237314, 0.09369478139744483, 0.035383200556126954, 0.05843134365091849, 0.22365402293048406, 0.16261242706143456, 0.03180687251495339, -0.17109609160937195, 0.004385572602177224, 0.15215139629682511] |
1,802.04544 | On the Relative Succinctness of Sentential Decision Diagrams | Sentential decision diagrams (SDDs) introduced by Darwiche in 2011 are a
promising representation type used in knowledge compilation. The relative
succinctness of representation types is an important subject in this area. The
aim of the paper is to identify which kind of Boolean functions can be
represented by SDDs of small size with respect to the number of variables the
functions are defined on. For this reason the sets of Boolean functions
representable by different representation types in polynomial size are
investigated and SDDs are compared with representation types from the classical
knowledge compilation map of Darwiche and Marquis. Ordered binary decision
diagrams (OBDDs) which are a popular data structure for Boolean functions are
one of these representation types. SDDs are more general than OBDDs by
definition but only recently, a Boolean function was presented with polynomial
SDD size but exponential OBDD size. This result is strengthened in several
ways. The main result is a quasipolynomial simulation of SDDs by equivalent
unambiguous nondeterministic OBDDs, a nondeterministic variant where there
exists exactly one accepting computation for each satisfying input. As a side
effect an open problem about the relative succinctness between SDDs and free
binary decision diagrams (FBDDs) which are more general than OBDDs is answered.
| cs.CC cs.AI | sentential decision diagrams sdds introduced by darwiche in 2011 are a promising representation type used in knowledge compilation the relative succinctness of representation types is an important subject in this area the aim of the paper is to identify which kind of boolean functions can be represented by sdds of small size with respect to the number of variables the functions are defined on for this reason the sets of boolean functions representable by different representation types in polynomial size are investigated and sdds are compared with representation types from the classical knowledge compilation map of darwiche and marquis ordered binary decision diagrams obdds which are a popular data structure for boolean functions are one of these representation types sdds are more general than obdds by definition but only recently a boolean function was presented with polynomial sdd size but exponential obdd size this result is strengthened in several ways the main result is a quasipolynomial simulation of sdds by equivalent unambiguous nondeterministic obdds a nondeterministic variant where there exists exactly one accepting computation for each satisfying input as a side effect an open problem about the relative succinctness between sdds and free binary decision diagrams fbdds which are more general than obdds is answered | [['sentential', 'decision', 'diagrams', 'sdds', 'introduced', 'by', 'darwiche', 'in', '2011', 'are', 'a', 'promising', 'representation', 'type', 'used', 'in', 'knowledge', 'compilation', 'the', 'relative', 'succinctness', 'of', 'representation', 'types', 'is', 'an', 'important', 'subject', 'in', 'this', 'area', 'the', 'aim', 'of', 'the', 'paper', 'is', 'to', 'identify', 'which', 'kind', 'of', 'boolean', 'functions', 'can', 'be', 'represented', 'by', 'sdds', 'of', 'small', 'size', 'with', 'respect', 'to', 'the', 'number', 'of', 'variables', 'the', 'functions', 'are', 'defined', 'on', 'for', 'this', 'reason', 'the', 'sets', 'of', 'boolean', 'functions', 'representable', 'by', 'different', 'representation', 'types', 'in', 'polynomial', 'size', 'are', 'investigated', 'and', 'sdds', 'are', 'compared', 'with', 'representation', 'types', 'from', 'the', 'classical', 'knowledge', 'compilation', 'map', 'of', 'darwiche', 'and', 'marquis', 'ordered', 'binary', 'decision', 'diagrams', 'obdds', 'which', 'are', 'a', 'popular', 'data', 'structure', 'for', 'boolean', 'functions', 'are', 'one', 'of', 'these', 'representation', 'types', 'sdds', 'are', 'more', 'general', 'than', 'obdds', 'by', 'definition', 'but', 'only', 'recently', 'a', 'boolean', 'function', 'was', 'presented', 'with', 'polynomial', 'sdd', 'size', 'but', 'exponential', 'obdd', 'size', 'this', 'result', 'is', 'strengthened', 'in', 'several', 'ways', 'the', 'main', 'result', 'is', 'a', 'quasipolynomial', 'simulation', 'of', 'sdds', 'by', 'equivalent', 'unambiguous', 'nondeterministic', 'obdds', 'a', 'nondeterministic', 'variant', 'where', 'there', 'exists', 'exactly', 'one', 'accepting', 'computation', 'for', 'each', 'satisfying', 'input', 'as', 'a', 'side', 'effect', 'an', 'open', 'problem', 'about', 'the', 'relative', 'succinctness', 'between', 'sdds', 'and', 'free', 'binary', 'decision', 'diagrams', 'fbdds', 'which', 'are', 'more', 'general', 'than', 'obdds', 'is', 'answered']] | [-0.0654311947149747, 0.13049274471988787, -0.03457124803851291, 0.11489140823591364, -0.10177311306001573, -0.14194703647730553, 0.05811822102802647, 0.38411590596888123, -0.30485709186007337, -0.3075323704576188, 0.09691608893889479, -0.23965858751112915, -0.1338311258067445, 0.22865895696393237, -0.08520906501685314, 0.058395786733343835, 0.05181295212085654, 0.05534578232412658, -0.06793880232541663, -0.28771322078026107, 0.33669380567877033, -0.009528520310343038, 0.21067526700293146, -0.03669118912572541, 0.06074576745229977, 0.036488812030633776, -0.07592354899544905, 0.06387309719376812, -0.09984871107607898, 0.122083731925274, 0.30602908619656793, 0.1992138543143505, 0.25585514987682606, -0.38139058682249816, -0.1328992415230903, 0.13124713320512232, 0.11829592134553667, 0.08273173599083704, 0.007091321797172607, -0.26743531035963536, 0.08298089217860252, -0.16952632990234145, -0.07104548154762241, -0.04541294631979814, 0.08829416640375445, 0.039096895684828846, -0.24286241376369327, -0.014894115475074547, 0.1103835052746013, 0.05713764856017206, -0.023509876921818388, -0.16717837520239012, 0.02164580097603725, 0.0951665490206967, -0.059968347094453325, 0.06836429535661165, 0.05583553075699545, -0.11038000552869606, -0.17760507136174455, 0.33215296686422535, 0.022055650208707582, -0.24493885108428756, 0.1906068686077871, -0.08594507834669657, -0.151861011473144, 0.14007164238790254, 0.11846734735058484, 0.1203834854145875, -0.15764153445304213, 0.09811918303603306, -0.08278871043244514, 0.208527207698832, 0.1254603616211836, 0.05741829564397382, 0.15660623730750892, 0.17165970280312184, 0.05251632835545645, 0.21017001963095602, 0.03586417070203801, -0.11533040427489252, -0.2730541164873213, -0.12740562991927684, -0.1320081477655416, 0.009134244754138153, -0.10713189823259088, -0.2115920050478563, 0.353186523396431, 0.0951744685082969, 0.15366960226106685, 0.11706772125610036, 0.28465856812814844, 0.15095569519496455, 0.08923149302874396, 0.0685282593429381, 0.12565366982187076, 0.1331112583304142, 0.03674987875061428, -0.12708054289744214, 0.18504764651766092, 0.12386614907896373] |
1,802.04545 | Twins Percolation for Qubit Losses in Topological Color Codes | We establish and explore a new connection between quantum information theory
and classical statistical mechanics by studying the problem of qubit losses in
2D topological color codes. We introduce a protocol to cope with qubit losses,
which is based on the identification and removal of a twin qubit from the code,
and which guarantees the recovery of a valid three-colorable and trivalent
reconstructed color code lattice. Moreover, we show that determining the
corresponding qubit loss error threshold is equivalent to a new generalized
classical percolation process. We numerically compute the associated qubit loss
thresholds for two families of 2D color code and find that these are close to
satisfying the fundamental limit $p_\text{fund} = 0.461 \pm 0.005$ close to the
50% as imposed by the no-cloning theorem. Our findings reveal a new connection
between topological color codes and percolation theory, show high robustness of
color codes against qubit loss, and are relevant for implementations of quantum
error correction in various physical platforms.
| quant-ph cond-mat.stat-mech | we establish and explore a new connection between quantum information theory and classical statistical mechanics by studying the problem of qubit losses in 2d topological color codes we introduce a protocol to cope with qubit losses which is based on the identification and removal of a twin qubit from the code and which guarantees the recovery of a valid threecolorable and trivalent reconstructed color code lattice moreover we show that determining the corresponding qubit loss error threshold is equivalent to a new generalized classical percolation process we numerically compute the associated qubit loss thresholds for two families of 2d color code and find that these are close to satisfying the fundamental limit p_textfund 0461 pm 0005 close to the 50 as imposed by the nocloning theorem our findings reveal a new connection between topological color codes and percolation theory show high robustness of color codes against qubit loss and are relevant for implementations of quantum error correction in various physical platforms | [['we', 'establish', 'and', 'explore', 'a', 'new', 'connection', 'between', 'quantum', 'information', 'theory', 'and', 'classical', 'statistical', 'mechanics', 'by', 'studying', 'the', 'problem', 'of', 'qubit', 'losses', 'in', '2d', 'topological', 'color', 'codes', 'we', 'introduce', 'a', 'protocol', 'to', 'cope', 'with', 'qubit', 'losses', 'which', 'is', 'based', 'on', 'the', 'identification', 'and', 'removal', 'of', 'a', 'twin', 'qubit', 'from', 'the', 'code', 'and', 'which', 'guarantees', 'the', 'recovery', 'of', 'a', 'valid', 'threecolorable', 'and', 'trivalent', 'reconstructed', 'color', 'code', 'lattice', 'moreover', 'we', 'show', 'that', 'determining', 'the', 'corresponding', 'qubit', 'loss', 'error', 'threshold', 'is', 'equivalent', 'to', 'a', 'new', 'generalized', 'classical', 'percolation', 'process', 'we', 'numerically', 'compute', 'the', 'associated', 'qubit', 'loss', 'thresholds', 'for', 'two', 'families', 'of', '2d', 'color', 'code', 'and', 'find', 'that', 'these', 'are', 'close', 'to', 'satisfying', 'the', 'fundamental', 'limit', 'p_textfund', '0461', 'pm', '0005', 'close', 'to', 'the', '50', 'as', 'imposed', 'by', 'the', 'nocloning', 'theorem', 'our', 'findings', 'reveal', 'a', 'new', 'connection', 'between', 'topological', 'color', 'codes', 'and', 'percolation', 'theory', 'show', 'high', 'robustness', 'of', 'color', 'codes', 'against', 'qubit', 'loss', 'and', 'are', 'relevant', 'for', 'implementations', 'of', 'quantum', 'error', 'correction', 'in', 'various', 'physical', 'platforms']] | [-0.10409202069957864, 0.12153279188794887, -0.0548901023085481, 0.10764069408044936, 0.02210845520907322, -0.22977786244672238, 0.08536554141257122, 0.38912766449059705, -0.26521112081014886, -0.30910999110296555, 0.07149060969914561, -0.2645112063337422, -0.14155802809056364, 0.1980589147094848, -0.113274211055195, 0.12163556428075586, 0.0798379046816235, 0.020359673043830122, -0.12423676814673082, -0.23616785659401132, 0.3227343297264767, 0.03274735478968389, 0.31212352375564334, 0.0716797692302919, 0.09620287773564001, 0.01519813590665471, -0.003032978096941732, -0.013057791097851107, -0.16038910875511692, 0.12795497018348942, 0.20862555985907152, 0.11480781227736822, 0.20876105308954446, -0.37766838947065035, -0.2176293221700632, 0.06395318742501754, 0.08141783096112967, 0.17364863435439062, -0.06010510062626065, -0.26999286432170644, 0.12974230207666848, -0.16637048246514685, -0.07139902368170332, -0.06303353333822305, -0.012945867153821783, -0.013154018526448746, -0.2684125073309753, 0.06014675658735089, 0.07684115773585257, 0.05767730566081386, -0.01636704535416837, -0.07178009903269275, -0.0034259883035267207, 0.13648576070788848, -0.04108719293151853, 0.03938096939914116, 0.09749398739575027, -0.12819475766693084, -0.1777922428460534, 0.36217996920898277, -0.018809321275311843, -0.18207063042095997, 0.1688540278767007, -0.07879589102670269, -0.10053366097861773, 0.06935724508860763, 0.17159199201554623, 0.07370712731982458, -0.12724180594848106, 0.036123095190082236, 0.003138283528270399, 0.17736143263279455, 0.057330673250059284, 0.12646341734527722, 0.1921472277070554, 0.10613435533471734, 0.0689319091316008, 0.19083974850159022, -0.09896969972595678, -0.12682446837425232, -0.3219246399946183, -0.15297976671571625, -0.18953384266896817, 0.06779654673227466, -0.11555680298647673, -0.17527341518445677, 0.37758609162549833, 0.1722671782514432, 0.17740875496836556, 0.05725568376698256, 0.2649056942864034, 0.09174203639557152, 0.05920632285470108, 0.10156686283771019, 0.22518399013821386, 0.20168154698404125, -0.007394687673838446, -0.2467428998649706, 0.025038655950913334, 0.07975989066901962] |
1,802.04546 | Robust Deformation Estimation in Wood-Composite Materials using
Variational Optical Flow | Wood-composite materials are widely used today as they homogenize humidity
related directional deformations. Quantification of these deformations as
coefficients is important for construction and engineering and topic of current
research but still a manual process.
This work introduces a novel computer vision approach that automatically
extracts these properties directly from scans of the wooden specimens, taken at
different humidity levels during the long lasting humidity conditioning
process. These scans are used to compute a humidity dependent deformation field
for each pixel, from which the desired coefficients can easily be calculated.
The overall method includes automated registration of the wooden blocks,
numerical optimization to compute a variational optical flow field which is
further used to calculate dense strain fields and finally the engineering
coefficients and their variance throughout the wooden blocks. The methods
regularization is fully parameterizable which allows to model and suppress
artifacts due to surface appearance changes of the specimens from mold, cracks,
etc. that typically arise in the conditioning process.
| cs.CV | woodcomposite materials are widely used today as they homogenize humidity related directional deformations quantification of these deformations as coefficients is important for construction and engineering and topic of current research but still a manual process this work introduces a novel computer vision approach that automatically extracts these properties directly from scans of the wooden specimens taken at different humidity levels during the long lasting humidity conditioning process these scans are used to compute a humidity dependent deformation field for each pixel from which the desired coefficients can easily be calculated the overall method includes automated registration of the wooden blocks numerical optimization to compute a variational optical flow field which is further used to calculate dense strain fields and finally the engineering coefficients and their variance throughout the wooden blocks the methods regularization is fully parameterizable which allows to model and suppress artifacts due to surface appearance changes of the specimens from mold cracks etc that typically arise in the conditioning process | [['woodcomposite', 'materials', 'are', 'widely', 'used', 'today', 'as', 'they', 'homogenize', 'humidity', 'related', 'directional', 'deformations', 'quantification', 'of', 'these', 'deformations', 'as', 'coefficients', 'is', 'important', 'for', 'construction', 'and', 'engineering', 'and', 'topic', 'of', 'current', 'research', 'but', 'still', 'a', 'manual', 'process', 'this', 'work', 'introduces', 'a', 'novel', 'computer', 'vision', 'approach', 'that', 'automatically', 'extracts', 'these', 'properties', 'directly', 'from', 'scans', 'of', 'the', 'wooden', 'specimens', 'taken', 'at', 'different', 'humidity', 'levels', 'during', 'the', 'long', 'lasting', 'humidity', 'conditioning', 'process', 'these', 'scans', 'are', 'used', 'to', 'compute', 'a', 'humidity', 'dependent', 'deformation', 'field', 'for', 'each', 'pixel', 'from', 'which', 'the', 'desired', 'coefficients', 'can', 'easily', 'be', 'calculated', 'the', 'overall', 'method', 'includes', 'automated', 'registration', 'of', 'the', 'wooden', 'blocks', 'numerical', 'optimization', 'to', 'compute', 'a', 'variational', 'optical', 'flow', 'field', 'which', 'is', 'further', 'used', 'to', 'calculate', 'dense', 'strain', 'fields', 'and', 'finally', 'the', 'engineering', 'coefficients', 'and', 'their', 'variance', 'throughout', 'the', 'wooden', 'blocks', 'the', 'methods', 'regularization', 'is', 'fully', 'parameterizable', 'which', 'allows', 'to', 'model', 'and', 'suppress', 'artifacts', 'due', 'to', 'surface', 'appearance', 'changes', 'of', 'the', 'specimens', 'from', 'mold', 'cracks', 'etc', 'that', 'typically', 'arise', 'in', 'the', 'conditioning', 'process']] | [-0.03668798063592465, 0.13234276225015243, -0.07972453536250661, 0.02569738251242021, -0.08027435820665418, -0.13284117142490534, -0.010208350759554908, 0.41828287973629763, -0.3332296347575297, -0.31410600946093936, 0.1533794295417307, -0.23453645123125802, -0.16619684885404945, 0.20743497375323675, -0.110578983242664, 0.08410790978543321, 0.06142492725959291, -0.029871475298582396, -0.059424809558369124, -0.21991895461998742, 0.229820554942957, 0.06399922093422794, 0.34647563180845714, 0.040471466609583416, 0.12161952217531778, -0.0003624920815884523, -0.056248041428047124, 0.018589975500352077, -0.10400191425558784, 0.14068657759240263, 0.3127190267684528, 0.0808036147801369, 0.2551412388555104, -0.46636733979634615, -0.2410884151647015, 0.05870445735133629, 0.11436103494340404, 0.11877160729415229, -0.004295640749428768, -0.2501175924614997, 0.06711275467753225, -0.12146230893764899, -0.08253014338150713, -0.1106322294705611, -0.016637477153183325, 0.010791175665409066, -0.2683707903665693, 0.06117674957900106, 0.01944335749422009, 0.07829590267733155, -0.06514613609074077, -0.11310648972093365, -0.03679686166875365, 0.18385625573602557, 0.0792202988239251, 0.026643036422175095, 0.256498565599438, -0.135988693651078, -0.0561527286147155, 0.3727480341848102, -0.01199418709718952, -0.18520133216396806, 0.19547850714984888, -0.06018497343666805, -0.1171918750439788, 0.1684682715585837, 0.21983233528205928, 0.10973153986840839, -0.1795310411046936, 0.012687090854811256, 0.05343206350327186, 0.1616127855919579, 0.09899476848496414, -0.037163392189450514, 0.21687501467625547, 0.14104449341756217, 0.024667653350610726, 0.13539187635240138, -0.10973547131216489, -0.03436204040660205, -0.28215860867271236, -0.147284486318211, -0.15747236052921376, -0.007603361634306193, -0.06488203556847727, -0.21986298628226617, 0.40399734769594964, 0.20926688436233665, 0.1814379795101581, -0.007831931273996692, 0.31166910192703606, 0.05800961790554318, 0.14418686713925014, 0.010068909921654448, 0.1881040990734415, 0.09438078960126138, 0.1279673245417313, -0.17628743894606458, 0.11404129020256563, 0.056876092692200814] |
1,802.04547 | Ions at hydrophobic interfaces | We argue that the kosmotropes remain strongly hydrated in the vicinity of a
hydrophobic surface, while the chaotropes lose their hydration shell and can
become adsorbed to the interface. The mechanism of adsorption is still a
subject of debate. We argue that there are two driving forces for anionic
adsorption: the hydrophobic cavitational energy and the interfacial
electrostatic surface potential of water. While the cavitational contribution
to ionic adsorption is now well accepted, the role of the electrostatic surface
potential is much less clear. The difficulty is that even the sign of this
potential is a subject of debate, with the ab initio and the classical force
field simulations predicting electrostatic surface potentials of opposite sign.
In this paper, we will argue that the strong anionic adsorption found in the
polarizable force field simulations is the result of the artificial
electrostatic surface potential present in the classical water models. We will
show that if the adsorption of anions were as large as predicted by the
polarizable force field simulations, the excess surface tension of the NaI
solution would be strongly negative, contrary to the experimental measurements.
While the large polarizability of heavy halides is a fundamental property and
must be included in realistic modeling of the electrolyte solutions, we argue
that the point charge water models, studied so far, are incompatible with the
polarizable ionic force fields when the translational symmetry is broken. The
goal for the future should be the development of water models with very low
electrostatic surface potential. We believe that such water models will be
compatible with the polarizable force fields, which can then be used to study
the interaction of ions with hydrophobic surfaces and proteins.
| cond-mat.soft | we argue that the kosmotropes remain strongly hydrated in the vicinity of a hydrophobic surface while the chaotropes lose their hydration shell and can become adsorbed to the interface the mechanism of adsorption is still a subject of debate we argue that there are two driving forces for anionic adsorption the hydrophobic cavitational energy and the interfacial electrostatic surface potential of water while the cavitational contribution to ionic adsorption is now well accepted the role of the electrostatic surface potential is much less clear the difficulty is that even the sign of this potential is a subject of debate with the ab initio and the classical force field simulations predicting electrostatic surface potentials of opposite sign in this paper we will argue that the strong anionic adsorption found in the polarizable force field simulations is the result of the artificial electrostatic surface potential present in the classical water models we will show that if the adsorption of anions were as large as predicted by the polarizable force field simulations the excess surface tension of the nai solution would be strongly negative contrary to the experimental measurements while the large polarizability of heavy halides is a fundamental property and must be included in realistic modeling of the electrolyte solutions we argue that the point charge water models studied so far are incompatible with the polarizable ionic force fields when the translational symmetry is broken the goal for the future should be the development of water models with very low electrostatic surface potential we believe that such water models will be compatible with the polarizable force fields which can then be used to study the interaction of ions with hydrophobic surfaces and proteins | [['we', 'argue', 'that', 'the', 'kosmotropes', 'remain', 'strongly', 'hydrated', 'in', 'the', 'vicinity', 'of', 'a', 'hydrophobic', 'surface', 'while', 'the', 'chaotropes', 'lose', 'their', 'hydration', 'shell', 'and', 'can', 'become', 'adsorbed', 'to', 'the', 'interface', 'the', 'mechanism', 'of', 'adsorption', 'is', 'still', 'a', 'subject', 'of', 'debate', 'we', 'argue', 'that', 'there', 'are', 'two', 'driving', 'forces', 'for', 'anionic', 'adsorption', 'the', 'hydrophobic', 'cavitational', 'energy', 'and', 'the', 'interfacial', 'electrostatic', 'surface', 'potential', 'of', 'water', 'while', 'the', 'cavitational', 'contribution', 'to', 'ionic', 'adsorption', 'is', 'now', 'well', 'accepted', 'the', 'role', 'of', 'the', 'electrostatic', 'surface', 'potential', 'is', 'much', 'less', 'clear', 'the', 'difficulty', 'is', 'that', 'even', 'the', 'sign', 'of', 'this', 'potential', 'is', 'a', 'subject', 'of', 'debate', 'with', 'the', 'ab', 'initio', 'and', 'the', 'classical', 'force', 'field', 'simulations', 'predicting', 'electrostatic', 'surface', 'potentials', 'of', 'opposite', 'sign', 'in', 'this', 'paper', 'we', 'will', 'argue', 'that', 'the', 'strong', 'anionic', 'adsorption', 'found', 'in', 'the', 'polarizable', 'force', 'field', 'simulations', 'is', 'the', 'result', 'of', 'the', 'artificial', 'electrostatic', 'surface', 'potential', 'present', 'in', 'the', 'classical', 'water', 'models', 'we', 'will', 'show', 'that', 'if', 'the', 'adsorption', 'of', 'anions', 'were', 'as', 'large', 'as', 'predicted', 'by', 'the', 'polarizable', 'force', 'field', 'simulations', 'the', 'excess', 'surface', 'tension', 'of', 'the', 'nai', 'solution', 'would', 'be', 'strongly', 'negative', 'contrary', 'to', 'the', 'experimental', 'measurements', 'while', 'the', 'large', 'polarizability', 'of', 'heavy', 'halides', 'is', 'a', 'fundamental', 'property', 'and', 'must', 'be', 'included', 'in', 'realistic', 'modeling', 'of', 'the', 'electrolyte', 'solutions', 'we', 'argue', 'that', 'the', 'point', 'charge', 'water', 'models', 'studied', 'so', 'far', 'are', 'incompatible', 'with', 'the', 'polarizable', 'ionic', 'force', 'fields', 'when', 'the', 'translational', 'symmetry', 'is', 'broken', 'the', 'goal', 'for', 'the', 'future', 'should', 'be', 'the', 'development', 'of', 'water', 'models', 'with', 'very', 'low', 'electrostatic', 'surface', 'potential', 'we', 'believe', 'that', 'such', 'water', 'models', 'will', 'be', 'compatible', 'with', 'the', 'polarizable', 'force', 'fields', 'which', 'can', 'then', 'be', 'used', 'to', 'study', 'the', 'interaction', 'of', 'ions', 'with', 'hydrophobic', 'surfaces', 'and', 'proteins']] | [-0.12625664202696693, 0.179850653178596, -0.07226518006481257, 0.061287678490262676, -0.020805393114492404, -0.1462443420850408, 0.004250724732752315, 0.3933829957065189, -0.26210055741100524, -0.29436354478487353, 0.017440154877704932, -0.29950194436669564, -0.16139979041548694, 0.13135601284723447, 0.003138863496602543, 0.002357491046711001, 0.04635994014660678, 0.0005856980419447345, -0.01092465612770302, -0.19538272722744413, 0.2789936746056709, 0.08385957635298211, 0.24712471359185742, 0.19100619749229494, 0.025840010101352836, -0.05104922117435083, 0.053673886442824024, 0.06984747568475863, -0.12867733945378573, 0.12997210251211647, 0.22713001889155177, -0.02422656885792224, 0.24277197838824335, -0.5130164238547499, -0.24622801951663467, 0.08413271466019734, 0.09984613691104449, 0.16967727948776296, -0.11136488002260954, -0.23055621790015354, 0.03718225006911216, -0.1245280017235106, -0.1537628462037412, -0.0423059491991436, 0.03778918001652231, 0.07887619007070044, -0.21215600200918733, 0.09431062222501817, 0.04664552487694996, 0.06294110193047472, -0.1407584416092537, -0.14313365510868503, -0.08195088536972614, 0.09537057167573793, 0.11575003472944607, 0.06098885616094815, 0.2434393673067859, -0.15885880620195447, -0.01764031381831975, 0.44301026974100366, -0.07827474872037554, -0.19891228908622857, 0.2462070576594575, -0.15784704552188944, -0.07719877795282898, 0.17110167761203102, 0.09634454222896727, 0.10163964861319617, -0.1593954514532778, 0.07594162807747719, -0.025043537923698997, 0.19155893620242545, 0.0639368339047824, -0.03208638269848133, 0.27947027168126515, 0.17436575127171358, 0.04776804717124096, 0.10957099045301356, -0.11167095237207936, -0.080471246547523, -0.2506023842848063, -0.20469270602405223, -0.1809164009491561, 0.02406232382628172, -0.027896347943091294, -0.1884558700353882, 0.3208216894800315, 0.13722074582069566, 0.10197121108211177, -0.009596247748825632, 0.2559764700767327, 0.06570124455104251, 0.0807697356429859, 0.012099351052955915, 0.31521210774836067, 0.1039387477110357, 0.06723360556902157, -0.2562946627937978, 0.09842526053969738, 0.013220036984838573] |
1,802.04548 | Bond graph modelling of the cardiac action potential: Implications for
drift and non-unique steady states | Mathematical models of cardiac action potentials have become increasingly
important in the study of heart disease and pharmacology, but concerns linger
over their robustness during long periods of simulation, in particular due to
issues such as model drift and non-unique steady states. Previous studies have
linked these to violation of conservation laws, but only explored those issues
with respect to charge conservation in specific models. Here, we propose a
general and systematic method of identifying conservation laws hidden in models
of cardiac electrophysiology by using bond graphs, and develop a bond graph
model of the cardiac action potential to study long-term behaviour. Bond graphs
provide an explicit energy-based framework for modelling physical systems,
which makes them well-suited for examining conservation within
electrophysiological models. We find that the charge conservation laws derived
in previous studies are examples of the more general concept of a "conserved
moiety". Conserved moieties explain model drift and non-unique steady states,
generalising the results from previous studies. The bond graph approach
provides a rigorous method to check for drift and non-unique steady states in a
wide range of cardiac action potential models, and can be extended to examine
behaviours of other excitable systems.
| q-bio.SC | mathematical models of cardiac action potentials have become increasingly important in the study of heart disease and pharmacology but concerns linger over their robustness during long periods of simulation in particular due to issues such as model drift and nonunique steady states previous studies have linked these to violation of conservation laws but only explored those issues with respect to charge conservation in specific models here we propose a general and systematic method of identifying conservation laws hidden in models of cardiac electrophysiology by using bond graphs and develop a bond graph model of the cardiac action potential to study longterm behaviour bond graphs provide an explicit energybased framework for modelling physical systems which makes them wellsuited for examining conservation within electrophysiological models we find that the charge conservation laws derived in previous studies are examples of the more general concept of a conserved moiety conserved moieties explain model drift and nonunique steady states generalising the results from previous studies the bond graph approach provides a rigorous method to check for drift and nonunique steady states in a wide range of cardiac action potential models and can be extended to examine behaviours of other excitable systems | [['mathematical', 'models', 'of', 'cardiac', 'action', 'potentials', 'have', 'become', 'increasingly', 'important', 'in', 'the', 'study', 'of', 'heart', 'disease', 'and', 'pharmacology', 'but', 'concerns', 'linger', 'over', 'their', 'robustness', 'during', 'long', 'periods', 'of', 'simulation', 'in', 'particular', 'due', 'to', 'issues', 'such', 'as', 'model', 'drift', 'and', 'nonunique', 'steady', 'states', 'previous', 'studies', 'have', 'linked', 'these', 'to', 'violation', 'of', 'conservation', 'laws', 'but', 'only', 'explored', 'those', 'issues', 'with', 'respect', 'to', 'charge', 'conservation', 'in', 'specific', 'models', 'here', 'we', 'propose', 'a', 'general', 'and', 'systematic', 'method', 'of', 'identifying', 'conservation', 'laws', 'hidden', 'in', 'models', 'of', 'cardiac', 'electrophysiology', 'by', 'using', 'bond', 'graphs', 'and', 'develop', 'a', 'bond', 'graph', 'model', 'of', 'the', 'cardiac', 'action', 'potential', 'to', 'study', 'longterm', 'behaviour', 'bond', 'graphs', 'provide', 'an', 'explicit', 'energybased', 'framework', 'for', 'modelling', 'physical', 'systems', 'which', 'makes', 'them', 'wellsuited', 'for', 'examining', 'conservation', 'within', 'electrophysiological', 'models', 'we', 'find', 'that', 'the', 'charge', 'conservation', 'laws', 'derived', 'in', 'previous', 'studies', 'are', 'examples', 'of', 'the', 'more', 'general', 'concept', 'of', 'a', 'conserved', 'moiety', 'conserved', 'moieties', 'explain', 'model', 'drift', 'and', 'nonunique', 'steady', 'states', 'generalising', 'the', 'results', 'from', 'previous', 'studies', 'the', 'bond', 'graph', 'approach', 'provides', 'a', 'rigorous', 'method', 'to', 'check', 'for', 'drift', 'and', 'nonunique', 'steady', 'states', 'in', 'a', 'wide', 'range', 'of', 'cardiac', 'action', 'potential', 'models', 'and', 'can', 'be', 'extended', 'to', 'examine', 'behaviours', 'of', 'other', 'excitable', 'systems']] | [-0.11073500533737908, 0.09288017089279399, -0.05953661075375062, 0.084289818847723, -0.046638537055755755, -0.18246144204809123, 0.025859255065704335, 0.34951114864088595, -0.24464253047291112, -0.29366675199262504, 0.09408894195862837, -0.25631543167712934, -0.18206740122309847, 0.16987276571085297, -0.07893023116879963, 0.09139560456435215, 0.07490334935053918, -0.008145295583485026, -0.024967054368414898, -0.1583233747624778, 0.2858435764073689, 0.03610693125353594, 0.29621228789055376, 0.06559934639324415, 0.10050322840730327, -0.043308843059075654, -0.05394137714459675, 0.024573593079682668, -0.13576806385958198, 0.12186189973281401, 0.2523689067534271, 0.10876931818629786, 0.26597061606684735, -0.48040541352666155, -0.30869122238696683, 0.1129571825446447, 0.13507478283801383, 0.16411568934266568, -0.02003809837875377, -0.2703264649857634, 0.059048141595166255, -0.21003939281217754, -0.16503161381293394, -0.14044054111107063, 0.07359845690638284, 0.04750008420895177, -0.23365527182836465, 0.1416381820590872, 0.05103257881258899, 0.10348094189397003, -0.11372562109882355, -0.09290430989717513, -0.04813909883211766, 0.1484501947130894, 0.09683056650219998, -0.019432339844013546, 0.12733930982031613, -0.1506728536915034, -0.16359133316484298, 0.38002726375315415, 0.0038723125685557573, -0.23200033283768678, 0.22149697360606407, -0.11086789414771281, -0.1767768572388711, 0.092416443284696, 0.17501056443885615, 0.11948085707760528, -0.19749896595615665, 0.030095989184218876, -0.0035121600614024364, 0.118175956855376, 0.011857783929112234, 0.016301377498834604, 0.2014360628518447, 0.16804834894660137, 0.04143816178750095, 0.11081738218906269, -0.024097435599640227, -0.15348820447475098, -0.2749064974201729, -0.11463460317107241, -0.11220280348313783, 0.04039610688318023, -0.06596932041748933, -0.17026937103115156, 0.42189641762524843, 0.1767118804368971, 0.14321969834997375, 0.05671921460022104, 0.22716298747726962, 0.09083118002976966, 0.06933535454790013, 0.022224497995624433, 0.20006812605127805, 0.15998051138859057, 0.10504301613118329, -0.21673145654673062, 0.09626356516228228, 0.05106342665623037] |
1,802.04549 | The Profiles of Fe K{\alpha} Line From the Inhomogeneous Accretion Flow | The clumpy disc, or inhomogeneous accretion flow, has been proposed to
explain the properties of accreting black hole systems. However, the
observational evidences remain to be explored. In this work, we calculate the
profiles of Fe K{\alpha} lines emitted from the inhomogeneous accretion flow
through the ray-tracing technique, in order to find possible observable signals
of the clumps. Compared with the skewed doublepeaked profile of the continuous
standard accretion disc, the lines show a multi-peak structure when the
emissivity index is not very steep. The peaks and wings are affected by the
position and size of the cold clumps. When the clump is small and is located in
the innermost region, due to the significant gravitational redshift, the blue
wing can overlap with the red wing of the outer cold disc/clump, forming a fake
peak or greatly enhancing the red peak. Given high enough resolution, it is
easier to constrain the clumps around the supermassive black holes than the
clumps in stellar mass black holes due to the thermal Doppler effect.
| astro-ph.HE | the clumpy disc or inhomogeneous accretion flow has been proposed to explain the properties of accreting black hole systems however the observational evidences remain to be explored in this work we calculate the profiles of fe kalpha lines emitted from the inhomogeneous accretion flow through the raytracing technique in order to find possible observable signals of the clumps compared with the skewed doublepeaked profile of the continuous standard accretion disc the lines show a multipeak structure when the emissivity index is not very steep the peaks and wings are affected by the position and size of the cold clumps when the clump is small and is located in the innermost region due to the significant gravitational redshift the blue wing can overlap with the red wing of the outer cold discclump forming a fake peak or greatly enhancing the red peak given high enough resolution it is easier to constrain the clumps around the supermassive black holes than the clumps in stellar mass black holes due to the thermal doppler effect | [['the', 'clumpy', 'disc', 'or', 'inhomogeneous', 'accretion', 'flow', 'has', 'been', 'proposed', 'to', 'explain', 'the', 'properties', 'of', 'accreting', 'black', 'hole', 'systems', 'however', 'the', 'observational', 'evidences', 'remain', 'to', 'be', 'explored', 'in', 'this', 'work', 'we', 'calculate', 'the', 'profiles', 'of', 'fe', 'kalpha', 'lines', 'emitted', 'from', 'the', 'inhomogeneous', 'accretion', 'flow', 'through', 'the', 'raytracing', 'technique', 'in', 'order', 'to', 'find', 'possible', 'observable', 'signals', 'of', 'the', 'clumps', 'compared', 'with', 'the', 'skewed', 'doublepeaked', 'profile', 'of', 'the', 'continuous', 'standard', 'accretion', 'disc', 'the', 'lines', 'show', 'a', 'multipeak', 'structure', 'when', 'the', 'emissivity', 'index', 'is', 'not', 'very', 'steep', 'the', 'peaks', 'and', 'wings', 'are', 'affected', 'by', 'the', 'position', 'and', 'size', 'of', 'the', 'cold', 'clumps', 'when', 'the', 'clump', 'is', 'small', 'and', 'is', 'located', 'in', 'the', 'innermost', 'region', 'due', 'to', 'the', 'significant', 'gravitational', 'redshift', 'the', 'blue', 'wing', 'can', 'overlap', 'with', 'the', 'red', 'wing', 'of', 'the', 'outer', 'cold', 'discclump', 'forming', 'a', 'fake', 'peak', 'or', 'greatly', 'enhancing', 'the', 'red', 'peak', 'given', 'high', 'enough', 'resolution', 'it', 'is', 'easier', 'to', 'constrain', 'the', 'clumps', 'around', 'the', 'supermassive', 'black', 'holes', 'than', 'the', 'clumps', 'in', 'stellar', 'mass', 'black', 'holes', 'due', 'to', 'the', 'thermal', 'doppler', 'effect']] | [-0.06761117096825996, 0.11229221694760354, -0.044695639054236166, 0.10556202528241557, -0.10655541954671635, -0.08030091817216838, -0.005538137010572587, 0.4234572537818595, -0.17984437814037152, -0.31624380724285456, 0.06791022085749052, -0.29841999990646456, -0.024217832771896878, 0.1676472840967643, -0.045078435043208576, -0.014076127347481602, 0.027321666290449416, -0.07304005189798772, -0.03684352049492779, -0.19621177989140373, 0.33694262276609044, 0.10494845057289828, 0.18331696203505785, 0.017856956297969993, 0.022383601330768537, -0.13271246351411237, -0.04988932834445115, 0.018307270728709066, -0.13174261717837962, 0.042144158639369864, 0.20958805428817867, 0.0950569151503527, 0.21906434995094862, -0.3819922496235984, -0.23480599262470872, 0.0923643838011605, 0.21938493647201754, 0.08827613629126811, -0.07413422830183716, -0.2815801966675174, 0.07618924470477983, -0.1841853000319508, -0.19581068275660715, 0.07675060695037246, 0.055265108386383335, 0.017151323428569253, -0.2050871720719014, 0.1373482344151639, 0.05973679878036765, -0.010510911600773826, -0.07374398037791252, -0.03176282357205363, -0.12101955121136544, 0.051017472437267904, 0.09344383376951823, 0.024439871176967727, 0.25253711806555446, -0.14647517092936838, 0.0018600028501275707, 0.4225170469897635, -0.07820592819112147, -0.04027879061177373, 0.19062816300155486, -0.2655724436619922, -0.09626094790942528, 0.22571057228042798, 0.1505142331150744, 0.13995600768693667, -0.05989466182021287, -0.000579546088941724, -0.009423337242675616, 0.23275671878226978, 0.09439958182492239, 0.042136584422277176, 0.3961709328324479, 0.07464835856192033, 0.02725824572638992, 0.15387854475445825, -0.2157244634047589, -0.060369762788211705, -0.18978652133270824, -0.08012470631065834, -0.13588219456347253, 0.04716066526778056, -0.14558879765382324, -0.16422917845056337, 0.33986717775902325, 0.09196624692036387, 0.26361068716710984, 0.0005718569079523578, 0.3479980537800122, 0.1373466968734968, 0.1090680286014343, 0.1498685705858995, 0.3293309331214165, 0.17744359313647318, 0.14268452674013507, -0.2845518195248373, 0.08509516894872136, -0.014223216863020378] |
1,802.0455 | Theoretical uncertainties on the radius of low- and very-low mass stars | We performed an analysis of the main theoretical uncertainties that affect
the radius of low- and very-low mass-stars predicted by current stellar models.
We focused on stars in the mass range 0.1-1Msun, on both the zero-age
main-sequence (ZAMS) and on 1, 2 and 5 Gyr isochrones. First, we quantified the
impact on the radius of the uncertainty of several quantities, namely the
equation of state, radiative opacity, atmospheric models, convection efficiency
and initial chemical composition. Then, we computed the cumulative radius error
stripe obtained by adding the radius variation due to all the analysed
quantities. As a general trend, the radius uncertainty increases with the
stellar mass. For ZAMS structures the cumulative error stripe of very-low mass
stars is about $\pm 2$ and $\pm 3$ percent, while at larger masses it increases
up to $\pm 4$ and $\pm 5$ percent. The radius uncertainty gets larger and age
dependent if isochrones are considered, reaching for $M\sim 1$Msun about
$+12(-15)$ percent at an age of 5 Gyr. We also investigated the radius
uncertainty at a fixed luminosity. In this case, the cumulative error stripe is
the same for both ZAMS and isochrone models and it ranges from about $\pm 4$
percent to $+7$ and $+9$($-5$) percent. We also showed that the sole
uncertainty on the chemical composition plays an important role in determining
the radius error stripe, producing a radius variation that ranges between about
$\pm 1$ and $\pm 2$ percent on ZAMS models with fixed mass and about $\pm 3$
and $\pm 5$ percent at a fixed luminosity.
| astro-ph.SR | we performed an analysis of the main theoretical uncertainties that affect the radius of low and verylow massstars predicted by current stellar models we focused on stars in the mass range 011msun on both the zeroage mainsequence zams and on 1 2 and 5 gyr isochrones first we quantified the impact on the radius of the uncertainty of several quantities namely the equation of state radiative opacity atmospheric models convection efficiency and initial chemical composition then we computed the cumulative radius error stripe obtained by adding the radius variation due to all the analysed quantities as a general trend the radius uncertainty increases with the stellar mass for zams structures the cumulative error stripe of verylow mass stars is about pm 2 and pm 3 percent while at larger masses it increases up to pm 4 and pm 5 percent the radius uncertainty gets larger and age dependent if isochrones are considered reaching for msim 1msun about 1215 percent at an age of 5 gyr we also investigated the radius uncertainty at a fixed luminosity in this case the cumulative error stripe is the same for both zams and isochrone models and it ranges from about pm 4 percent to 7 and 95 percent we also showed that the sole uncertainty on the chemical composition plays an important role in determining the radius error stripe producing a radius variation that ranges between about pm 1 and pm 2 percent on zams models with fixed mass and about pm 3 and pm 5 percent at a fixed luminosity | [['we', 'performed', 'an', 'analysis', 'of', 'the', 'main', 'theoretical', 'uncertainties', 'that', 'affect', 'the', 'radius', 'of', 'low', 'and', 'verylow', 'massstars', 'predicted', 'by', 'current', 'stellar', 'models', 'we', 'focused', 'on', 'stars', 'in', 'the', 'mass', 'range', '011msun', 'on', 'both', 'the', 'zeroage', 'mainsequence', 'zams', 'and', 'on', '1', '2', 'and', '5', 'gyr', 'isochrones', 'first', 'we', 'quantified', 'the', 'impact', 'on', 'the', 'radius', 'of', 'the', 'uncertainty', 'of', 'several', 'quantities', 'namely', 'the', 'equation', 'of', 'state', 'radiative', 'opacity', 'atmospheric', 'models', 'convection', 'efficiency', 'and', 'initial', 'chemical', 'composition', 'then', 'we', 'computed', 'the', 'cumulative', 'radius', 'error', 'stripe', 'obtained', 'by', 'adding', 'the', 'radius', 'variation', 'due', 'to', 'all', 'the', 'analysed', 'quantities', 'as', 'a', 'general', 'trend', 'the', 'radius', 'uncertainty', 'increases', 'with', 'the', 'stellar', 'mass', 'for', 'zams', 'structures', 'the', 'cumulative', 'error', 'stripe', 'of', 'verylow', 'mass', 'stars', 'is', 'about', 'pm', '2', 'and', 'pm', '3', 'percent', 'while', 'at', 'larger', 'masses', 'it', 'increases', 'up', 'to', 'pm', '4', 'and', 'pm', '5', 'percent', 'the', 'radius', 'uncertainty', 'gets', 'larger', 'and', 'age', 'dependent', 'if', 'isochrones', 'are', 'considered', 'reaching', 'for', 'msim', '1msun', 'about', '1215', 'percent', 'at', 'an', 'age', 'of', '5', 'gyr', 'we', 'also', 'investigated', 'the', 'radius', 'uncertainty', 'at', 'a', 'fixed', 'luminosity', 'in', 'this', 'case', 'the', 'cumulative', 'error', 'stripe', 'is', 'the', 'same', 'for', 'both', 'zams', 'and', 'isochrone', 'models', 'and', 'it', 'ranges', 'from', 'about', 'pm', '4', 'percent', 'to', '7', 'and', '95', 'percent', 'we', 'also', 'showed', 'that', 'the', 'sole', 'uncertainty', 'on', 'the', 'chemical', 'composition', 'plays', 'an', 'important', 'role', 'in', 'determining', 'the', 'radius', 'error', 'stripe', 'producing', 'a', 'radius', 'variation', 'that', 'ranges', 'between', 'about', 'pm', '1', 'and', 'pm', '2', 'percent', 'on', 'zams', 'models', 'with', 'fixed', 'mass', 'and', 'about', 'pm', '3', 'and', 'pm', '5', 'percent', 'at', 'a', 'fixed', 'luminosity']] | [-0.054455310975511866, 0.15337492516053175, -0.009717391966385585, 0.10886073668953031, 0.00859237214477331, -0.04792492182414029, 0.10567168646912072, 0.38808961685235593, -0.16995154925640307, -0.44462966984320507, 0.099667400131276, -0.31464658219221175, 0.04008905073700875, 0.20525177263052147, -0.0662201765340333, 0.002248780120748515, 0.06201112250962658, 0.014512631921645473, -0.12840774901549096, -0.24640575175210103, 0.2784164773482902, 0.05777554110459545, 0.15650064513069012, 0.044707639159534275, 0.07711797823841848, -0.06267109815688694, -0.02080256234050966, -0.05466753120406293, -0.24267786966916974, 0.03956829943493301, 0.14602650265630526, 0.10759027164210291, 0.242076534931274, -0.28864669935668213, -0.16820576999190393, 0.058927953414911145, 0.17480467324711235, 0.031738573640548426, -0.012465664542590578, -0.2168468921710098, 0.12342061786659864, -0.20282077951420682, -0.1537479397749492, 0.0893186886703559, 0.10813938200875532, -0.023279909731354565, -0.24402895922608236, 0.1983058657093138, 0.02481709372562667, 0.12634552780392708, -0.109033323321423, -0.2595959544432916, -0.10230088924222133, 0.11622844194495759, 0.03790985823006315, 0.10076078165906902, 0.16763459788087537, -0.09902451547574909, -0.0035498334044663637, 0.37454430196507305, -0.08711108927268024, -0.07583537255231218, 0.11249115928304473, -0.18519689266880354, -0.09946110660653086, 0.1240089795698284, 0.17838939600898063, 0.10010468812440249, -0.12057354929400425, -0.015311494559236784, 0.05796775397817221, 0.3085119524518685, 0.08516253231677647, -0.011459640996740655, 0.28502396594769525, 0.17455339765943148, 0.04492139819205976, -0.0011319531858259555, -0.1842646443120697, -0.07723685552493907, -0.2845340013613596, -0.05938717897652703, -0.09150601761351687, 0.07743396208502863, -0.19905757293140505, -0.07279818676635806, 0.33449978171756456, 0.15068076315755938, 0.2194967808987142, 0.08828309329555314, 0.26752816341707814, 0.12112049716784432, 0.08592862631559518, 0.12355130637685457, 0.286281708430718, 0.2083570293552589, 0.06371273055088286, -0.23405361561396834, 0.06318859870856007, -0.017249785601070114] |
1,802.04551 | Analysis of Minimax Error Rate for Crowdsourcing and Its Application to
Worker Clustering Model | While crowdsourcing has become an important means to label data, there is
great interest in estimating the ground truth from unreliable labels produced
by crowdworkers. The Dawid and Skene (DS) model is one of the most well-known
models in the study of crowdsourcing. Despite its practical popularity,
theoretical error analysis for the DS model has been conducted only under
restrictive assumptions on class priors, confusion matrices, or the number of
labels each worker provides. In this paper, we derive a minimax error rate
under more practical setting for a broader class of crowdsourcing models
including the DS model as a special case. We further propose the worker
clustering model, which is more practical than the DS model under real
crowdsourcing settings. The wide applicability of our theoretical analysis
allows us to immediately investigate the behavior of this proposed model, which
can not be analyzed by existing studies. Experimental results showed that there
is a strong similarity between the lower bound of the minimax error rate
derived by our theoretical analysis and the empirical error of the estimated
value.
| stat.ML cs.HC cs.LG | while crowdsourcing has become an important means to label data there is great interest in estimating the ground truth from unreliable labels produced by crowdworkers the dawid and skene ds model is one of the most wellknown models in the study of crowdsourcing despite its practical popularity theoretical error analysis for the ds model has been conducted only under restrictive assumptions on class priors confusion matrices or the number of labels each worker provides in this paper we derive a minimax error rate under more practical setting for a broader class of crowdsourcing models including the ds model as a special case we further propose the worker clustering model which is more practical than the ds model under real crowdsourcing settings the wide applicability of our theoretical analysis allows us to immediately investigate the behavior of this proposed model which can not be analyzed by existing studies experimental results showed that there is a strong similarity between the lower bound of the minimax error rate derived by our theoretical analysis and the empirical error of the estimated value | [['while', 'crowdsourcing', 'has', 'become', 'an', 'important', 'means', 'to', 'label', 'data', 'there', 'is', 'great', 'interest', 'in', 'estimating', 'the', 'ground', 'truth', 'from', 'unreliable', 'labels', 'produced', 'by', 'crowdworkers', 'the', 'dawid', 'and', 'skene', 'ds', 'model', 'is', 'one', 'of', 'the', 'most', 'wellknown', 'models', 'in', 'the', 'study', 'of', 'crowdsourcing', 'despite', 'its', 'practical', 'popularity', 'theoretical', 'error', 'analysis', 'for', 'the', 'ds', 'model', 'has', 'been', 'conducted', 'only', 'under', 'restrictive', 'assumptions', 'on', 'class', 'priors', 'confusion', 'matrices', 'or', 'the', 'number', 'of', 'labels', 'each', 'worker', 'provides', 'in', 'this', 'paper', 'we', 'derive', 'a', 'minimax', 'error', 'rate', 'under', 'more', 'practical', 'setting', 'for', 'a', 'broader', 'class', 'of', 'crowdsourcing', 'models', 'including', 'the', 'ds', 'model', 'as', 'a', 'special', 'case', 'we', 'further', 'propose', 'the', 'worker', 'clustering', 'model', 'which', 'is', 'more', 'practical', 'than', 'the', 'ds', 'model', 'under', 'real', 'crowdsourcing', 'settings', 'the', 'wide', 'applicability', 'of', 'our', 'theoretical', 'analysis', 'allows', 'us', 'to', 'immediately', 'investigate', 'the', 'behavior', 'of', 'this', 'proposed', 'model', 'which', 'can', 'not', 'be', 'analyzed', 'by', 'existing', 'studies', 'experimental', 'results', 'showed', 'that', 'there', 'is', 'a', 'strong', 'similarity', 'between', 'the', 'lower', 'bound', 'of', 'the', 'minimax', 'error', 'rate', 'derived', 'by', 'our', 'theoretical', 'analysis', 'and', 'the', 'empirical', 'error', 'of', 'the', 'estimated', 'value']] | [-0.05900092535535151, -0.0029993368661144926, -0.06575781360708094, 0.08281501162446658, -0.0813487233839971, -0.16631816251182488, 0.10921245808203003, 0.3786832405610031, -0.21914290293221875, -0.3098028331405249, 0.11711338262356231, -0.25803742865684215, -0.14486439502667217, 0.21784221618750205, -0.11595377439549298, 0.08934563762028283, 0.09746008794466976, 0.06930411705391461, -0.05185913881862515, -0.270125532082643, 0.2927452483897233, 0.07468841141717655, 0.3417313713384164, 0.03728329255592256, 0.05941852453436828, -0.01190481459449851, -0.025527759617341033, 0.013132972443957678, -0.13664622755684097, 0.15633168988180965, 0.26491039990777904, 0.19683085382115514, 0.37337551904277183, -0.352804483390633, -0.24280878651384893, 0.1400837020273582, 0.11854261611104326, 0.10667000952427892, -0.06975765723432284, -0.32897533151828634, 0.11824337044322675, -0.1762412081033075, -0.033449309315595234, -0.0880588388274518, 0.006377450399770496, -0.030604472975416654, -0.31772550769160723, 0.08525551416194381, 0.056360938057520564, 0.05944478778649917, -0.05342213349813187, -0.15267264999428323, 0.02651114426056195, 0.13215588412399332, 0.12172794126607268, 0.0013363389775753439, 0.08732916907606166, -0.1434824723237602, -0.11034521847581386, 0.37665746455195914, -0.021113451412408692, -0.20919050659272778, 0.1809567608700521, -0.09090094442290955, -0.13699790161479725, 0.08864228920082384, 0.18853291070214315, 0.11375918513781318, -0.16114728023975647, 0.07581715591270162, -0.09945134972379113, 0.17168438326818555, 0.0035746008539677, 0.01042166631178292, 0.14404282116022463, 0.2106291545251531, 0.04597492586674817, 0.1346320529831992, -0.07486419365453545, -0.11446033846429979, -0.26833071036648865, -0.10319018157675151, -0.18470394526859432, 0.024974459690107895, -0.13142598121020854, -0.1290522595284457, 0.3804529557982983, 0.21848030612552852, 0.18252276570871054, 0.08657534227031545, 0.29595639607398194, 0.10052583684550934, 0.04474344767834154, 0.07007858233481876, 0.23548957550626123, 0.08353680938487516, 0.05975347750930095, -0.1571523363033592, 0.13391470767589014, 0.01573650338530038] |
1,802.04552 | Discovery of X-ray pulsations in the Be/X-ray binary IGR J06074+2205 | IGR J06074+2205 is a poorly studied X-ray source with a Be star companion. It
has been proposed to belong to the group of Be/X-ray binaries. In Be/X-ray
binaries, accretion onto the neutron star occurs via the transfer of material
from the Be star's circumstellar disk. Thus, in the absence of the disk, no
X-ray should be detected. The main goal of this work is to study the quiescent
X-ray emission of IGR J06074+2205 during a disk-loss episode. We show that at
the time of the XMM-Newton observation the decretion disk around the Be star
had vanished. Still, accretion appears as the source of energy that powers the
high-energy radiation in IGR J06074+2205. We report the discovery of X-ray
pulsations with a pulse period of 373.2 s and a pulse fraction of ~50%. The
$0.4-12$ keV spectrum is well described by an absorbed power law and blackbody
components with the best fitting parameters: $N_{\rm H}=(6.2\pm0.5) \times
10^{21}$ cm$^{-2}$, $kT_{\rm bb}=1.16\pm0.03$ keV, and $\Gamma=1.5\pm0.1$ The
absorbed X-ray luminosity is $L_{\rm X}=1.4 \times 10^{34}$ erg s$^{-1}$
assuming a distance of 4.5 kpc. The detection of X-ray pulsations confirms the
nature of IGR J06074+2205 as a Be/X-ray binary. We discuss various scenarios to
explain the quiescent X-ray emission of this pulsar. We rule out cooling of the
neutron star surface and magnetospheric emission and conclude that accretion is
the most likely scenario. The origin of the accreted material remains an open
question.
| astro-ph.HE | igr j060742205 is a poorly studied xray source with a be star companion it has been proposed to belong to the group of bexray binaries in bexray binaries accretion onto the neutron star occurs via the transfer of material from the be stars circumstellar disk thus in the absence of the disk no xray should be detected the main goal of this work is to study the quiescent xray emission of igr j060742205 during a diskloss episode we show that at the time of the xmmnewton observation the decretion disk around the be star had vanished still accretion appears as the source of energy that powers the highenergy radiation in igr j060742205 we report the discovery of xray pulsations with a pulse period of 3732 s and a pulse fraction of 50 the 0412 kev spectrum is well described by an absorbed power law and blackbody components with the best fitting parameters n_rm h62pm05 times 1021 cm2 kt_rm bb116pm003 kev and gamma15pm01 the absorbed xray luminosity is l_rm x14 times 1034 erg s1 assuming a distance of 45 kpc the detection of xray pulsations confirms the nature of igr j060742205 as a bexray binary we discuss various scenarios to explain the quiescent xray emission of this pulsar we rule out cooling of the neutron star surface and magnetospheric emission and conclude that accretion is the most likely scenario the origin of the accreted material remains an open question | [['igr', 'j060742205', 'is', 'a', 'poorly', 'studied', 'xray', 'source', 'with', 'a', 'be', 'star', 'companion', 'it', 'has', 'been', 'proposed', 'to', 'belong', 'to', 'the', 'group', 'of', 'bexray', 'binaries', 'in', 'bexray', 'binaries', 'accretion', 'onto', 'the', 'neutron', 'star', 'occurs', 'via', 'the', 'transfer', 'of', 'material', 'from', 'the', 'be', 'stars', 'circumstellar', 'disk', 'thus', 'in', 'the', 'absence', 'of', 'the', 'disk', 'no', 'xray', 'should', 'be', 'detected', 'the', 'main', 'goal', 'of', 'this', 'work', 'is', 'to', 'study', 'the', 'quiescent', 'xray', 'emission', 'of', 'igr', 'j060742205', 'during', 'a', 'diskloss', 'episode', 'we', 'show', 'that', 'at', 'the', 'time', 'of', 'the', 'xmmnewton', 'observation', 'the', 'decretion', 'disk', 'around', 'the', 'be', 'star', 'had', 'vanished', 'still', 'accretion', 'appears', 'as', 'the', 'source', 'of', 'energy', 'that', 'powers', 'the', 'highenergy', 'radiation', 'in', 'igr', 'j060742205', 'we', 'report', 'the', 'discovery', 'of', 'xray', 'pulsations', 'with', 'a', 'pulse', 'period', 'of', '3732', 's', 'and', 'a', 'pulse', 'fraction', 'of', '50', 'the', '0412', 'kev', 'spectrum', 'is', 'well', 'described', 'by', 'an', 'absorbed', 'power', 'law', 'and', 'blackbody', 'components', 'with', 'the', 'best', 'fitting', 'parameters', 'n_rm', 'h62pm05', 'times', '1021', 'cm2', 'kt_rm', 'bb116pm003', 'kev', 'and', 'gamma15pm01', 'the', 'absorbed', 'xray', 'luminosity', 'is', 'l_rm', 'x14', 'times', '1034', 'erg', 's1', 'assuming', 'a', 'distance', 'of', '45', 'kpc', 'the', 'detection', 'of', 'xray', 'pulsations', 'confirms', 'the', 'nature', 'of', 'igr', 'j060742205', 'as', 'a', 'bexray', 'binary', 'we', 'discuss', 'various', 'scenarios', 'to', 'explain', 'the', 'quiescent', 'xray', 'emission', 'of', 'this', 'pulsar', 'we', 'rule', 'out', 'cooling', 'of', 'the', 'neutron', 'star', 'surface', 'and', 'magnetospheric', 'emission', 'and', 'conclude', 'that', 'accretion', 'is', 'the', 'most', 'likely', 'scenario', 'the', 'origin', 'of', 'the', 'accreted', 'material', 'remains', 'an', 'open', 'question']] | [-0.09308408157672142, 0.13925420889111792, -0.053904478561109165, 0.10165765922858336, -0.12642596440205886, -0.0700331976614261, 0.07611470206244948, 0.44695141668483424, -0.17583352847218658, -0.3339687508232132, 0.10597452847137168, -0.3398841101848101, 0.010052308971821751, 0.23774840141788461, -0.05242416083956609, -0.029517390019292322, 0.06670058230058062, -0.06582149001469939, -0.039928778721211484, -0.235964378574301, 0.25327320177809537, 0.09776902141133444, 0.08745279529056005, 0.010529201049077857, 0.07119692485707577, -0.07325732332150664, -0.006230810292034166, -0.12716189455520763, -0.09908206644215069, 0.00992258045299762, 0.2614453002538676, 0.12126166593531235, 0.17532787551601764, -0.3405433766575842, -0.25126054974136947, 0.041089595669216994, 0.1656073012215369, -0.08083950436540156, -0.024371305246769486, -0.2164977482115838, 0.05741789035375186, -0.2834522286819718, -0.18439443932062757, 0.09933364994706768, 0.08411554211866543, 0.009180041577401191, -0.1728049031710612, 0.13500056246369518, 0.07167707561203499, 0.016456832162947934, -0.20153907391986142, -0.015377088133125794, -0.015350270802015238, 0.0007335460353083109, 0.10818330564210392, 0.11805781862666519, 0.18339729185771725, -0.120347015243903, -0.07123718966326233, 0.3804452457972862, -0.04500967063521367, 0.07417589567038091, 0.18028714033263404, -0.22592080968867811, -0.20027024325486992, 0.21270489733458334, 0.08815696782356552, 0.15326948447494348, -0.16066108639611834, -0.0068247484239285445, -0.038274200280424796, 0.2989460036149568, 0.0472884553218812, 0.05076234954806013, 0.3868398015495278, 0.13668523192712478, -0.028266753612942803, 0.17068856108989647, -0.26588302885098264, 0.023583663586535103, -0.2153038459804005, -0.07074048355458576, -0.16177347176328558, 0.173367449118408, -0.08969237382068797, -0.11741967917152164, 0.35877647906813626, 0.06607142829859845, 0.20560763048531702, -0.027966321200180336, 0.2971732458739258, 0.1641862061451281, 0.035041241037028305, 0.17717841258192588, 0.3383211331849702, 0.18602115270689673, 0.09505440613360827, -0.28575921068647514, 0.1060847128389699, -0.010686752398882077] |
1,802.04553 | High-order above-threshold photoemission from nanotips controlled with
two-color laser fields | We investigate the process of phase-controlled high-order above-threshold
photoemission from sharp metallic nanotips under bichromatic laser fields.
Experimental photoelectron spectra resulting from two-color excitation with a
moderately intense near-infrared fundamental field (1560 nm) and its weak
second harmonic show a strong sensitivity on the relative phase and clear
indications for a plateau-like structure that is attributed to elastic
backscattering. To explore the relevant control mechanisms, characteristic
features, and particular signatures from near-field inhomogeneity, we performed
systematic quantum simulations employing a one-dimensional nanotip model.
Besides rich phase-dependent structures in the simulated above-threshold
ionization (ATI) photoelectron spectra we find ponderomotive shifts as well as
substantial modifications of the rescattering cutoff as function of the decay
length of the near-field. To explore the quantum or classical nature of the
observed features and to discriminate the two-color effects stemming from
electron propagation and from the ionization rate we compare the quantum
results to classical trajectory simulations. We show that signatures from
direct electrons as well as the modulations in the plateau region mainly stem
from control of the ionization probability, while the modulation in the cutoff
region can only be explained by the impact of the two-color field on the
electron trajectory. Despite the complexity of the phase-dependent features
that render two-color strong-field photoemission from nanotips intriguing for
sub-cycle strong-field control, our findings support that the recollision
features in the cutoff region provide a robust and reliable method to calibrate
the relative two-color phase.
| physics.atom-ph | we investigate the process of phasecontrolled highorder abovethreshold photoemission from sharp metallic nanotips under bichromatic laser fields experimental photoelectron spectra resulting from twocolor excitation with a moderately intense nearinfrared fundamental field 1560 nm and its weak second harmonic show a strong sensitivity on the relative phase and clear indications for a plateaulike structure that is attributed to elastic backscattering to explore the relevant control mechanisms characteristic features and particular signatures from nearfield inhomogeneity we performed systematic quantum simulations employing a onedimensional nanotip model besides rich phasedependent structures in the simulated abovethreshold ionization ati photoelectron spectra we find ponderomotive shifts as well as substantial modifications of the rescattering cutoff as function of the decay length of the nearfield to explore the quantum or classical nature of the observed features and to discriminate the twocolor effects stemming from electron propagation and from the ionization rate we compare the quantum results to classical trajectory simulations we show that signatures from direct electrons as well as the modulations in the plateau region mainly stem from control of the ionization probability while the modulation in the cutoff region can only be explained by the impact of the twocolor field on the electron trajectory despite the complexity of the phasedependent features that render twocolor strongfield photoemission from nanotips intriguing for subcycle strongfield control our findings support that the recollision features in the cutoff region provide a robust and reliable method to calibrate the relative twocolor phase | [['we', 'investigate', 'the', 'process', 'of', 'phasecontrolled', 'highorder', 'abovethreshold', 'photoemission', 'from', 'sharp', 'metallic', 'nanotips', 'under', 'bichromatic', 'laser', 'fields', 'experimental', 'photoelectron', 'spectra', 'resulting', 'from', 'twocolor', 'excitation', 'with', 'a', 'moderately', 'intense', 'nearinfrared', 'fundamental', 'field', '1560', 'nm', 'and', 'its', 'weak', 'second', 'harmonic', 'show', 'a', 'strong', 'sensitivity', 'on', 'the', 'relative', 'phase', 'and', 'clear', 'indications', 'for', 'a', 'plateaulike', 'structure', 'that', 'is', 'attributed', 'to', 'elastic', 'backscattering', 'to', 'explore', 'the', 'relevant', 'control', 'mechanisms', 'characteristic', 'features', 'and', 'particular', 'signatures', 'from', 'nearfield', 'inhomogeneity', 'we', 'performed', 'systematic', 'quantum', 'simulations', 'employing', 'a', 'onedimensional', 'nanotip', 'model', 'besides', 'rich', 'phasedependent', 'structures', 'in', 'the', 'simulated', 'abovethreshold', 'ionization', 'ati', 'photoelectron', 'spectra', 'we', 'find', 'ponderomotive', 'shifts', 'as', 'well', 'as', 'substantial', 'modifications', 'of', 'the', 'rescattering', 'cutoff', 'as', 'function', 'of', 'the', 'decay', 'length', 'of', 'the', 'nearfield', 'to', 'explore', 'the', 'quantum', 'or', 'classical', 'nature', 'of', 'the', 'observed', 'features', 'and', 'to', 'discriminate', 'the', 'twocolor', 'effects', 'stemming', 'from', 'electron', 'propagation', 'and', 'from', 'the', 'ionization', 'rate', 'we', 'compare', 'the', 'quantum', 'results', 'to', 'classical', 'trajectory', 'simulations', 'we', 'show', 'that', 'signatures', 'from', 'direct', 'electrons', 'as', 'well', 'as', 'the', 'modulations', 'in', 'the', 'plateau', 'region', 'mainly', 'stem', 'from', 'control', 'of', 'the', 'ionization', 'probability', 'while', 'the', 'modulation', 'in', 'the', 'cutoff', 'region', 'can', 'only', 'be', 'explained', 'by', 'the', 'impact', 'of', 'the', 'twocolor', 'field', 'on', 'the', 'electron', 'trajectory', 'despite', 'the', 'complexity', 'of', 'the', 'phasedependent', 'features', 'that', 'render', 'twocolor', 'strongfield', 'photoemission', 'from', 'nanotips', 'intriguing', 'for', 'subcycle', 'strongfield', 'control', 'our', 'findings', 'support', 'that', 'the', 'recollision', 'features', 'in', 'the', 'cutoff', 'region', 'provide', 'a', 'robust', 'and', 'reliable', 'method', 'to', 'calibrate', 'the', 'relative', 'twocolor', 'phase']] | [-0.07202618343192929, 0.15665577299077996, -0.10735063685569912, 0.0901852781746508, -0.006113398561137728, -0.10772602054445694, 0.0682062615591955, 0.4323441076364058, -0.2843160610654498, -0.28579713227809406, -0.01942665335567047, -0.2870035113048895, -0.12837047060117282, 0.2282590707395381, 4.308732713980135e-05, 0.03940507420790406, 0.03433696937960728, -0.061102336624632395, -0.029360053333221003, -0.10134662385971752, 0.2999390762929882, 0.0902833678376434, 0.2787938810972264, 0.09484283938436419, 0.07155172685452271, 0.01163246416739033, 0.0007074513239786028, -0.02520307539962232, -0.13171732969118846, 0.04863541123680382, 0.21170193873113022, 0.012069972119449327, 0.21057647519919556, -0.4289658016525209, -0.267426892692068, 0.02651554688879211, 0.14625748996477342, 0.1507336119558507, -0.10758157885769228, -0.29599080635913805, 4.403651194782772e-05, -0.11155560552336587, -0.13110272931517103, -0.07966768529343729, -0.039306644308574806, 0.06627208447510687, -0.2715719780178915, 0.07080328571998204, 0.008615354295094827, 0.06408235378524599, -0.05412528186619359, -0.04192025221321576, -0.03577766432232844, 0.07351326964950809, 0.01616403881525912, 0.03791370818556364, 0.16952626459727374, -0.1498051041373401, -0.14384605857776478, 0.37967021324050926, -0.11923258605335528, -0.04338396187328423, 0.18740246010711417, -0.2254370921430867, -0.04833076426148182, 0.21158901410526595, 0.1322077740255433, 0.13582765264048552, -0.08018413535828586, 0.037852638521872, 0.01551927569914066, 0.2132608686407669, 0.09986377938378913, 0.1189169534452958, 0.22289701974562678, 0.12059084389184135, -0.005562504174304195, 0.14075037779160388, -0.1824265817180276, -0.08867443448204236, -0.29029245490091854, -0.08120337372311041, -0.14834874581817228, 0.04924083048875521, -0.050742543916567226, -0.15588296826851245, 0.423880474314016, 0.15762939404473097, 0.18962549107818633, -0.05223731706015921, 0.34931013513123615, 0.1324051461551183, 0.02848518688024342, -0.009068000365126257, 0.3044247152671839, 0.16689132127745931, 0.08594713355220544, -0.32493509317682767, 0.0421573447616538, -0.007732722694830348] |
1,802.04554 | Tunable Electronic Structure and Topological Properties of $LnPn$
($Ln$=Ce, Pr, Gd, Sm, Yb; $Pn$=Sb, Bi) | We have performed systematic first principles study of the electronic
structure and band topology properties of $LnPn$ compounds ($Ln$=Ce, Pr, Gd,
Sm, Yb; $Pn$=Sb, Bi). Assuming the $f$-electrons are well localized in these
materials, both hybrid functional and modified Becke-Johnson calculations yield
electronic structure in good agreement with experimental observations, while
generalized gradient approximation calculations severely overestimate the band
inversions. From Ce to Yb, a systematic reduction of band inversion with
respect to the increasing $Ln$ atomic number is observed, and $\mathcal{Z}_2$
for Ce$Pn$ and Yb$Pn$ are [1;000] and [0;000], respectively. In both hybrid
functional and modified Becke-Johns calculations, a topologically nontrivial to
trivial transition is expected around SmSb for the antimonides and around DyBi
for the bismuthides. Such variation is related with lanthanide contraction, but
is different from simple pressure effect.
| cond-mat.str-el cond-mat.mtrl-sci | we have performed systematic first principles study of the electronic structure and band topology properties of lnpn compounds lnce pr gd sm yb pnsb bi assuming the felectrons are well localized in these materials both hybrid functional and modified beckejohnson calculations yield electronic structure in good agreement with experimental observations while generalized gradient approximation calculations severely overestimate the band inversions from ce to yb a systematic reduction of band inversion with respect to the increasing ln atomic number is observed and mathcalz_2 for cepn and ybpn are 1000 and 0000 respectively in both hybrid functional and modified beckejohns calculations a topologically nontrivial to trivial transition is expected around smsb for the antimonides and around dybi for the bismuthides such variation is related with lanthanide contraction but is different from simple pressure effect | [['we', 'have', 'performed', 'systematic', 'first', 'principles', 'study', 'of', 'the', 'electronic', 'structure', 'and', 'band', 'topology', 'properties', 'of', 'lnpn', 'compounds', 'lnce', 'pr', 'gd', 'sm', 'yb', 'pnsb', 'bi', 'assuming', 'the', 'felectrons', 'are', 'well', 'localized', 'in', 'these', 'materials', 'both', 'hybrid', 'functional', 'and', 'modified', 'beckejohnson', 'calculations', 'yield', 'electronic', 'structure', 'in', 'good', 'agreement', 'with', 'experimental', 'observations', 'while', 'generalized', 'gradient', 'approximation', 'calculations', 'severely', 'overestimate', 'the', 'band', 'inversions', 'from', 'ce', 'to', 'yb', 'a', 'systematic', 'reduction', 'of', 'band', 'inversion', 'with', 'respect', 'to', 'the', 'increasing', 'ln', 'atomic', 'number', 'is', 'observed', 'and', 'mathcalz_2', 'for', 'cepn', 'and', 'ybpn', 'are', '1000', 'and', '0000', 'respectively', 'in', 'both', 'hybrid', 'functional', 'and', 'modified', 'beckejohns', 'calculations', 'a', 'topologically', 'nontrivial', 'to', 'trivial', 'transition', 'is', 'expected', 'around', 'smsb', 'for', 'the', 'antimonides', 'and', 'around', 'dybi', 'for', 'the', 'bismuthides', 'such', 'variation', 'is', 'related', 'with', 'lanthanide', 'contraction', 'but', 'is', 'different', 'from', 'simple', 'pressure', 'effect']] | [-0.09747477802785955, 0.14731199088536442, -0.01533836787266116, 0.06445028036391558, -0.03922475826355719, -0.12576734551018284, 0.10829942568858725, 0.3962076008470068, -0.27542804908608237, -0.32330137731426684, 0.015299177267626229, -0.37134573897797496, -0.13586673445458855, 0.14343764107381443, 0.019872960375411617, 0.032951769067890824, 0.004836775868522724, -0.0293576653122962, -0.17059605074445566, -0.14645032118630386, 0.24734745045275158, 0.09460235318270392, 0.2783061101161424, 0.03528343137323616, -0.01983926688966852, -0.025773216872626254, 0.06128579860125037, 0.06260239441067941, -0.13321243000832655, 0.10360091870215031, 0.24009847552365354, -0.029112182728450505, 0.1901192060078404, -0.44999166325696055, -0.1930634993965918, 0.0015541475224909523, 0.06674763597097368, 0.11534630799395663, -0.08566627478144402, -0.231655573194486, 0.12590158197488036, -0.16047967017643275, -0.09207223186780128, -0.14679271524261323, -0.041469940006913196, 0.014225203111568736, -0.2680148081318851, 0.10780567221809179, -0.003260318219902054, 0.11627153939251354, -0.11021024381343816, -0.18770613449235116, -0.09982807938602843, 0.02768211559047021, 0.05229347868401918, 0.04848500765905145, 0.10915519283228223, -0.04634234059842363, -0.05343000396274992, 0.42925145307315454, -0.09026625195720923, -0.09485143778710475, 0.17273138029380672, -0.15940329181631246, -0.153017327648887, 0.15324605129764327, 0.0949872690853813, 0.08604281016385122, -0.08921034793949671, 0.12431462957465556, 0.029798841264451884, 0.18052341279784037, 0.023291309963115642, 0.07987856312279144, 0.17783982016901004, 0.12988089518565235, 0.019472022154068035, 0.06175636533167093, -0.10378102489912341, -0.10102896103560324, -0.22329048753055114, -0.17045562902104952, -0.17164013887410082, 0.02229069987116682, -0.09219735207736976, -0.19342753255829936, 0.3813964457761857, 0.0767950263745602, 0.16012775802406512, -0.026088239724612643, 0.20625712192005238, 0.11377621779683977, 0.06628156048358388, 0.04526108699370055, 0.2631890265596843, 0.16911670673007687, 0.04448655206942931, -0.26434622831725246, 0.05933690892397276, 0.014141088167596008] |
1,802.04555 | Scalable Lattice Influence Maximization | Influence maximization is the task of finding k seed nodes in a social
network such that the expected number of activated nodes in the network (under
certain influence propagation model), referred to as the influence spread, is
maximized. Lattice influence maximization (LIM) generalizes influence
maximization such that, instead of selecting k seed nodes, one selects a vector
x = (x_1, ..., x_d) from a discrete space X called a lattice, where x_j
corresponds to the j-th marketing strategy and x represents a marketing
strategy mix. Each strategy mix x has probability h_u(x) to activate a node u
as a seed.LIM is the task of finding a strategy mix under the constraint
x_1+...+x_d <= k such that its influence spread is maximized. We adapt the
reverse influence sampling (RIS) approach and design scalable algorithms for
LIM. We first design the IMM-PRR algorithm based on partial reverse-reachable
sets as a general solution for LIM, and improve IMM-PRR for a large family of
models where each strategy independently activates seed nodes. We then propose
an alternative algorithm IMM-VSN based on virtual strategy nodes, for the
family of models with independent strategy activations. We prove that both
IMM-PRR and IMM-VSN guarantees 1-e-\epsilon approximation for small \epsilon>
0. Empirically, through extensive tests we demonstrate that IMM-VSN runs faster
than IMM-PRR and much faster than other baseline algorithms while providing the
same level of influence spread. We conclude that IMM-VSN is the best one for
models with independent strategy activations, while IMM-PRR works for general
modes without this assumption. Finally, we extend LIM to the partitioned budget
case where strategies are partitioned into groups, each of which has a separate
budget, and show that a minor variation of our algorithms would achieve 1/2
-\epsilon approximation ratio with the same time complexity.
| cs.SI cs.DS | influence maximization is the task of finding k seed nodes in a social network such that the expected number of activated nodes in the network under certain influence propagation model referred to as the influence spread is maximized lattice influence maximization lim generalizes influence maximization such that instead of selecting k seed nodes one selects a vector x x_1 x_d from a discrete space x called a lattice where x_j corresponds to the jth marketing strategy and x represents a marketing strategy mix each strategy mix x has probability h_ux to activate a node u as a seedlim is the task of finding a strategy mix under the constraint x_1x_d k such that its influence spread is maximized we adapt the reverse influence sampling ris approach and design scalable algorithms for lim we first design the immprr algorithm based on partial reversereachable sets as a general solution for lim and improve immprr for a large family of models where each strategy independently activates seed nodes we then propose an alternative algorithm immvsn based on virtual strategy nodes for the family of models with independent strategy activations we prove that both immprr and immvsn guarantees 1eepsilon approximation for small epsilon 0 empirically through extensive tests we demonstrate that immvsn runs faster than immprr and much faster than other baseline algorithms while providing the same level of influence spread we conclude that immvsn is the best one for models with independent strategy activations while immprr works for general modes without this assumption finally we extend lim to the partitioned budget case where strategies are partitioned into groups each of which has a separate budget and show that a minor variation of our algorithms would achieve 12 epsilon approximation ratio with the same time complexity | [['influence', 'maximization', 'is', 'the', 'task', 'of', 'finding', 'k', 'seed', 'nodes', 'in', 'a', 'social', 'network', 'such', 'that', 'the', 'expected', 'number', 'of', 'activated', 'nodes', 'in', 'the', 'network', 'under', 'certain', 'influence', 'propagation', 'model', 'referred', 'to', 'as', 'the', 'influence', 'spread', 'is', 'maximized', 'lattice', 'influence', 'maximization', 'lim', 'generalizes', 'influence', 'maximization', 'such', 'that', 'instead', 'of', 'selecting', 'k', 'seed', 'nodes', 'one', 'selects', 'a', 'vector', 'x', 'x_1', 'x_d', 'from', 'a', 'discrete', 'space', 'x', 'called', 'a', 'lattice', 'where', 'x_j', 'corresponds', 'to', 'the', 'jth', 'marketing', 'strategy', 'and', 'x', 'represents', 'a', 'marketing', 'strategy', 'mix', 'each', 'strategy', 'mix', 'x', 'has', 'probability', 'h_ux', 'to', 'activate', 'a', 'node', 'u', 'as', 'a', 'seedlim', 'is', 'the', 'task', 'of', 'finding', 'a', 'strategy', 'mix', 'under', 'the', 'constraint', 'x_1x_d', 'k', 'such', 'that', 'its', 'influence', 'spread', 'is', 'maximized', 'we', 'adapt', 'the', 'reverse', 'influence', 'sampling', 'ris', 'approach', 'and', 'design', 'scalable', 'algorithms', 'for', 'lim', 'we', 'first', 'design', 'the', 'immprr', 'algorithm', 'based', 'on', 'partial', 'reversereachable', 'sets', 'as', 'a', 'general', 'solution', 'for', 'lim', 'and', 'improve', 'immprr', 'for', 'a', 'large', 'family', 'of', 'models', 'where', 'each', 'strategy', 'independently', 'activates', 'seed', 'nodes', 'we', 'then', 'propose', 'an', 'alternative', 'algorithm', 'immvsn', 'based', 'on', 'virtual', 'strategy', 'nodes', 'for', 'the', 'family', 'of', 'models', 'with', 'independent', 'strategy', 'activations', 'we', 'prove', 'that', 'both', 'immprr', 'and', 'immvsn', 'guarantees', '1eepsilon', 'approximation', 'for', 'small', 'epsilon', '0', 'empirically', 'through', 'extensive', 'tests', 'we', 'demonstrate', 'that', 'immvsn', 'runs', 'faster', 'than', 'immprr', 'and', 'much', 'faster', 'than', 'other', 'baseline', 'algorithms', 'while', 'providing', 'the', 'same', 'level', 'of', 'influence', 'spread', 'we', 'conclude', 'that', 'immvsn', 'is', 'the', 'best', 'one', 'for', 'models', 'with', 'independent', 'strategy', 'activations', 'while', 'immprr', 'works', 'for', 'general', 'modes', 'without', 'this', 'assumption', 'finally', 'we', 'extend', 'lim', 'to', 'the', 'partitioned', 'budget', 'case', 'where', 'strategies', 'are', 'partitioned', 'into', 'groups', 'each', 'of', 'which', 'has', 'a', 'separate', 'budget', 'and', 'show', 'that', 'a', 'minor', 'variation', 'of', 'our', 'algorithms', 'would', 'achieve', '12', 'epsilon', 'approximation', 'ratio', 'with', 'the', 'same', 'time', 'complexity']] | [-0.13678885687780679, 0.07368294367447671, -0.060931178829777714, 0.03234914581011014, -0.08307541775997329, -0.19745746107488407, 0.13370108004549847, 0.39894678656359855, -0.2758015933491702, -0.2742966136920901, 0.059217625708282186, -0.2687345024804137, -0.15462246090500006, 0.1460070643005216, -0.036193010904004466, 0.014301176095312094, 0.054089294258298865, 0.06685064460600446, -0.019410894254373975, -0.293423868463597, 0.26827842701328386, 0.051612800686494494, 0.2935739039809195, -0.007727464866038141, 0.1289405162787793, 0.023854510211724158, -0.001192742636407948, 0.022037629759044688, -0.11875044450068271, 0.07052630523081134, 0.2324760187559943, 0.18836063753436263, 0.35894485138305127, -0.379839781188377, -0.20271925633583077, 0.1499804706477067, 0.1478781781592777, 0.06191111027599863, -0.009985994049718533, -0.21663633842507835, 0.13111637071883597, -0.144062019464041, -0.056217069333180734, -0.038533692825005544, 0.015134796696782731, 0.026799131339096872, -0.3639153406462249, 0.011274505250323499, 0.04875565535249108, -0.007287851869931064, -0.033076916839427935, -0.18174758604260413, -0.014971062156716588, 0.11709949988662346, 0.03257134127403226, 0.07118001985123984, 0.14050459009869135, -0.09075971427824747, -0.12631514601596344, 0.36645130626172484, -0.06273429891931225, -0.2111371991524286, 0.11969677302148515, -0.0548188337691855, -0.16112519074859788, 0.11623953899471766, 0.20221615001353013, 0.1626945362123419, -0.09431557883879099, 0.06232637486168657, -0.06803372755298669, 0.16001052469430832, 0.053490329119715206, 0.025455473558445522, 0.11702048066708623, 0.19118375997429643, 0.15220970441796736, 0.13040065338893933, -0.05968417206361799, -0.079029329523934, -0.2524163264420309, -0.12244039930316224, -0.19106461142816591, 0.048336119964641475, -0.13179860705816732, -0.1287365681201761, 0.3593491834465891, 0.15622432077396983, 0.2091033904705274, 0.10126025525564618, 0.2793849676214374, 0.07050225366983293, 0.03230359800849561, 0.12864050648805997, 0.16235434087428383, 0.04475767697065837, 0.03934914054680184, -0.1795840729648331, 0.12519358703383215, 0.06193263692923122] |
1,802.04556 | Hybrid mean field and real space model for vacancy diffusion-mediated
annealing of radiation defects | In a fusion or advanced fission reactor, high energy neutrons induce the
formation of extended defect clusters in structural component materials,
degrading their properties over time. Such damage can be partially recovered
via a thermal annealing treatment. Therefore, for the design and operation of
fusion and advanced fission nuclear energy systems it is critical to estimate
and predict the annealing timescales for arbitrary configurations of defect
clusters. In our earlier paper [I. Rovelli, S. L. Dudarev, and A. P. Sutton, J.
Mech. Phys. Solids 103, 121 (2017)] we extended the Green function formulation
by Gu, Xiang et al. [Y. Gu, Y. Xiang, S. S. Quek, and D. J. Srolovitz, J. Mech.
Phys. Solids 83, 319 (2015)] for the climb of curved dislocations, to include
the evaporation and growth of cavities and vacancy clusters, and take into
account the effect of free surfaces. In this work, we further develop this
model to include the effect of radiation defects that are below the
experimental detection limit, via a mean field approach coupled with an
explicit treatment of the evolution of discrete defect clusters distributed in
real space. We show that randomly distributed small defects screen diffusive
interactions between larger discrete clusters. The evolution of the coupled
system is modelled self-consistently. We also simulate the evolution of defects
in an infinite laterally extended thin film, using the Ewald summation of
screened Yukawa-type diffusive propagators.
| cond-mat.mtrl-sci | in a fusion or advanced fission reactor high energy neutrons induce the formation of extended defect clusters in structural component materials degrading their properties over time such damage can be partially recovered via a thermal annealing treatment therefore for the design and operation of fusion and advanced fission nuclear energy systems it is critical to estimate and predict the annealing timescales for arbitrary configurations of defect clusters in our earlier paper i rovelli s l dudarev and a p sutton j mech phys solids 103 121 2017 we extended the green function formulation by gu xiang et al y gu y xiang s s quek and d j srolovitz j mech phys solids 83 319 2015 for the climb of curved dislocations to include the evaporation and growth of cavities and vacancy clusters and take into account the effect of free surfaces in this work we further develop this model to include the effect of radiation defects that are below the experimental detection limit via a mean field approach coupled with an explicit treatment of the evolution of discrete defect clusters distributed in real space we show that randomly distributed small defects screen diffusive interactions between larger discrete clusters the evolution of the coupled system is modelled selfconsistently we also simulate the evolution of defects in an infinite laterally extended thin film using the ewald summation of screened yukawatype diffusive propagators | [['in', 'a', 'fusion', 'or', 'advanced', 'fission', 'reactor', 'high', 'energy', 'neutrons', 'induce', 'the', 'formation', 'of', 'extended', 'defect', 'clusters', 'in', 'structural', 'component', 'materials', 'degrading', 'their', 'properties', 'over', 'time', 'such', 'damage', 'can', 'be', 'partially', 'recovered', 'via', 'a', 'thermal', 'annealing', 'treatment', 'therefore', 'for', 'the', 'design', 'and', 'operation', 'of', 'fusion', 'and', 'advanced', 'fission', 'nuclear', 'energy', 'systems', 'it', 'is', 'critical', 'to', 'estimate', 'and', 'predict', 'the', 'annealing', 'timescales', 'for', 'arbitrary', 'configurations', 'of', 'defect', 'clusters', 'in', 'our', 'earlier', 'paper', 'i', 'rovelli', 's', 'l', 'dudarev', 'and', 'a', 'p', 'sutton', 'j', 'mech', 'phys', 'solids', '103', '121', '2017', 'we', 'extended', 'the', 'green', 'function', 'formulation', 'by', 'gu', 'xiang', 'et', 'al', 'y', 'gu', 'y', 'xiang', 's', 's', 'quek', 'and', 'd', 'j', 'srolovitz', 'j', 'mech', 'phys', 'solids', '83', '319', '2015', 'for', 'the', 'climb', 'of', 'curved', 'dislocations', 'to', 'include', 'the', 'evaporation', 'and', 'growth', 'of', 'cavities', 'and', 'vacancy', 'clusters', 'and', 'take', 'into', 'account', 'the', 'effect', 'of', 'free', 'surfaces', 'in', 'this', 'work', 'we', 'further', 'develop', 'this', 'model', 'to', 'include', 'the', 'effect', 'of', 'radiation', 'defects', 'that', 'are', 'below', 'the', 'experimental', 'detection', 'limit', 'via', 'a', 'mean', 'field', 'approach', 'coupled', 'with', 'an', 'explicit', 'treatment', 'of', 'the', 'evolution', 'of', 'discrete', 'defect', 'clusters', 'distributed', 'in', 'real', 'space', 'we', 'show', 'that', 'randomly', 'distributed', 'small', 'defects', 'screen', 'diffusive', 'interactions', 'between', 'larger', 'discrete', 'clusters', 'the', 'evolution', 'of', 'the', 'coupled', 'system', 'is', 'modelled', 'selfconsistently', 'we', 'also', 'simulate', 'the', 'evolution', 'of', 'defects', 'in', 'an', 'infinite', 'laterally', 'extended', 'thin', 'film', 'using', 'the', 'ewald', 'summation', 'of', 'screened', 'yukawatype', 'diffusive', 'propagators']] | [-0.08597315642410856, 0.17051554424075507, -0.07629356086238802, 0.013403847402067888, -0.011183184863623689, -0.10951274478187163, 0.06184526366485985, 0.37249399584170695, -0.23903541284074126, -0.3300103714471078, 0.010954703521922949, -0.270680572585358, -0.10541869418949845, 0.12590015134488217, -0.032670049470636925, 0.0015102582268841694, 0.026469871034159473, -0.06182411928117896, -0.028876882401834194, -0.2680913978031624, 0.24094726622059712, 0.08070360362966823, 0.2528986706092837, 0.046826944018105505, 0.051167123072286415, 0.06258069659203389, -0.02316438048218148, 0.021313038578929928, -0.17118557024341977, 0.07380849196654213, 0.21967656168424965, 0.0054762603759994375, 0.22219465907842836, -0.45801736173432384, -0.26382811326153677, 0.07221902585271828, 0.113806280428993, 0.10712908831473007, -0.0343383859042405, -0.2810452458072911, 0.06256347267047029, -0.20383969115362943, -0.1211658160124595, -0.027631184805119245, 0.10002184766824684, 0.03321145253440798, -0.27976155516476037, 0.13542299056637586, 0.07530815884871245, 0.040218063871163806, -0.10662541574014253, -0.10697326191553944, -0.057750768632742394, 0.04763464828679469, -0.03453046722151747, 0.052241879178358146, 0.18463932208230785, -0.06883957725541111, -0.1046306264807323, 0.35415275590167494, -0.03996764934160175, -0.1354937788932339, 0.1963759285319707, -0.10711313195765558, -0.1100342201657201, 0.1686586232533221, 0.15821560261783338, 0.1490121599895167, -0.15994807671379754, 0.12002573423945394, 0.021334995941479543, 0.12752615165204348, 0.08968889860542524, -0.025477307542276225, 0.19336546363161974, 0.1504328736239889, 0.0007071899783209359, 0.11498974823840208, -0.10461968701667756, -0.07494119241560009, -0.28719844447710274, -0.183758418180412, -0.16322411326773203, 0.07390399851417322, -0.05174096120601079, -0.16571645569383053, 0.32520840791454375, 0.12024968036393259, 0.17356982796244616, -0.021636689984006807, 0.19040811003396174, 0.07910917377816268, 0.03269680811341427, 0.09740106035097963, 0.20612701239766912, 0.17950787381350733, 0.08874248316274852, -0.2629562663904947, -0.008113637495083375, 0.05604616604978219] |
1,802.04557 | Automatic localization and decoding of honeybee markers using deep
convolutional neural networks | The honeybee is a fascinating model animal to investigate how collective
behavior emerges from (inter-)actions of thousands of individuals. Bees may
acquire unique memories throughout their lives. These experiences affect social
interactions even over large time frames. Tracking and identifying all bees in
the colony over their lifetimes therefore may likely shed light on the
interplay of individual differences and colony behavior. This paper proposes a
software pipeline based on two deep convolutional neural networks for the
localization and decoding of custom binary markers that honeybees carry from
their first to the last day in their life. We show that this approach
outperforms similar systems proposed in recent literature. By opening this
software for the public, we hope that the resulting datasets will help
advancing the understanding of honeybee collective intelligence.
| cs.CV | the honeybee is a fascinating model animal to investigate how collective behavior emerges from interactions of thousands of individuals bees may acquire unique memories throughout their lives these experiences affect social interactions even over large time frames tracking and identifying all bees in the colony over their lifetimes therefore may likely shed light on the interplay of individual differences and colony behavior this paper proposes a software pipeline based on two deep convolutional neural networks for the localization and decoding of custom binary markers that honeybees carry from their first to the last day in their life we show that this approach outperforms similar systems proposed in recent literature by opening this software for the public we hope that the resulting datasets will help advancing the understanding of honeybee collective intelligence | [['the', 'honeybee', 'is', 'a', 'fascinating', 'model', 'animal', 'to', 'investigate', 'how', 'collective', 'behavior', 'emerges', 'from', 'interactions', 'of', 'thousands', 'of', 'individuals', 'bees', 'may', 'acquire', 'unique', 'memories', 'throughout', 'their', 'lives', 'these', 'experiences', 'affect', 'social', 'interactions', 'even', 'over', 'large', 'time', 'frames', 'tracking', 'and', 'identifying', 'all', 'bees', 'in', 'the', 'colony', 'over', 'their', 'lifetimes', 'therefore', 'may', 'likely', 'shed', 'light', 'on', 'the', 'interplay', 'of', 'individual', 'differences', 'and', 'colony', 'behavior', 'this', 'paper', 'proposes', 'a', 'software', 'pipeline', 'based', 'on', 'two', 'deep', 'convolutional', 'neural', 'networks', 'for', 'the', 'localization', 'and', 'decoding', 'of', 'custom', 'binary', 'markers', 'that', 'honeybees', 'carry', 'from', 'their', 'first', 'to', 'the', 'last', 'day', 'in', 'their', 'life', 'we', 'show', 'that', 'this', 'approach', 'outperforms', 'similar', 'systems', 'proposed', 'in', 'recent', 'literature', 'by', 'opening', 'this', 'software', 'for', 'the', 'public', 'we', 'hope', 'that', 'the', 'resulting', 'datasets', 'will', 'help', 'advancing', 'the', 'understanding', 'of', 'honeybee', 'collective', 'intelligence']] | [-0.12593713054746275, 0.12483965199376734, -0.11608851491740216, 0.04986317380231926, -0.09530350794119917, -0.1445033312099808, 0.053320527266007174, 0.41056887199746744, -0.2747292218980124, -0.321261560274217, 0.06005953577967389, -0.28896766851606376, -0.2688096079385292, 0.1975552628424644, -0.10922175902475155, -0.014874534098474125, 0.12752195855048093, 0.024343157108901566, 0.002480493019555361, -0.2822441316088875, 0.2684924142072617, 0.06157318754490458, 0.3050233768441409, 0.028573701332344582, 0.08339153698339831, -0.0015777942603667273, -0.059095378905598725, -0.03924373990877439, -0.07546530044649839, 0.16455290083353982, 0.28246381784476454, 0.1991804177154794, 0.35104989203560444, -0.47281504701112065, -0.21534281104931052, 0.11239572606611116, 0.21827062681487952, 0.12865842678435307, -0.050312371769891555, -0.32365657267327785, 0.05506122908963758, -0.16693002132446513, -0.09284329979204153, -0.09203741460228125, 0.01313920799315772, 0.05726307437520559, -0.1618881003810306, 0.02393259716625432, 0.02541875473102768, 0.09755578617216977, -0.07764653883561606, -0.10404727901936374, 0.006356463771142805, 0.22634114787508627, 0.06975086727304, -0.011644898675638074, 0.1661911164206019, -0.1703271670853506, -0.15723954411161323, 0.3608595278089198, -0.004081330944620471, -0.11051195832538127, 0.23592813222541098, -0.08432830800124594, -0.13815778032485537, 0.10896441941540547, 0.29478317139428534, 0.10386693824566047, -0.17975248481708628, -0.02798465802645282, -0.01466916992776949, 0.16593441756740782, 0.02609191712646084, 0.034795917744769624, 0.25891549836218586, 0.24764859831166802, -0.0034335492470280358, 0.06782177191952826, -0.08669859267245153, -0.14122758939407254, -0.16952707858414937, -0.13071618372759292, -0.12941762340790058, 0.028103658865483206, -0.07041332688689576, -0.13613097473467126, 0.43344011604217175, 0.23800145984335824, 0.14885236763658413, 0.08978527642160881, 0.2638325756540138, -0.04673873596710956, 0.11616773079398252, 0.053474000555583996, 0.24123328949061743, -0.022162273222267742, 0.1593632272938764, -0.2493934659251787, 0.1327958385653808, 0.004835862364221848] |
1,802.04558 | Core rotation braking on the red giant branch for various mass ranges | Asteroseismology allows us to probe stellar interiors. Mixed modes can be
used to probe the physical conditions in red giant cores. However, we still
need to identify the physical mechanisms that transport angular momentum inside
red giants, leading to the slow-down observed for the red giant core rotation.
Thus large-scale measurements of the red giant core rotation are of prime
importance to obtain tighter constraints on the efficiency of the internal
angular momentum transport, and to study how this efficiency changes with
stellar parameters. This work aims at identifying the components of the
rotational multiplets for dipole mixed modes in a large number of red giant
oscillation spectra observed by Kepler. Such identification provides us with a
direct measurement of the red giant mean core rotation. We compute stretched
spectra that mimic the regular pattern of pure dipole gravity modes. Mixed
modes with same azimuthal order are expected to be almost equally spaced in
stretched period. The departure from this regular pattern allows us to
disentangle the various rotational components and therefore to determine the
mean core rotation rates of red giants. We obtained mean core rotation
measurements for 875 red giant branch stars. This large sample includes stars
with a mass as large as 2.5 $M_{\odot}$, allowing us to test the dependence of
the core slow-down rate on the stellar mass. This work on a large sample allows
us to refine previous measurements of the evolution of the mean core rotation
on the red giant branch. Rather than a slight slow down, our results suggest
rotation to be constant along the red giant branch, with values independent on
the mass.
| astro-ph.SR | asteroseismology allows us to probe stellar interiors mixed modes can be used to probe the physical conditions in red giant cores however we still need to identify the physical mechanisms that transport angular momentum inside red giants leading to the slowdown observed for the red giant core rotation thus largescale measurements of the red giant core rotation are of prime importance to obtain tighter constraints on the efficiency of the internal angular momentum transport and to study how this efficiency changes with stellar parameters this work aims at identifying the components of the rotational multiplets for dipole mixed modes in a large number of red giant oscillation spectra observed by kepler such identification provides us with a direct measurement of the red giant mean core rotation we compute stretched spectra that mimic the regular pattern of pure dipole gravity modes mixed modes with same azimuthal order are expected to be almost equally spaced in stretched period the departure from this regular pattern allows us to disentangle the various rotational components and therefore to determine the mean core rotation rates of red giants we obtained mean core rotation measurements for 875 red giant branch stars this large sample includes stars with a mass as large as 25 m_odot allowing us to test the dependence of the core slowdown rate on the stellar mass this work on a large sample allows us to refine previous measurements of the evolution of the mean core rotation on the red giant branch rather than a slight slow down our results suggest rotation to be constant along the red giant branch with values independent on the mass | [['asteroseismology', 'allows', 'us', 'to', 'probe', 'stellar', 'interiors', 'mixed', 'modes', 'can', 'be', 'used', 'to', 'probe', 'the', 'physical', 'conditions', 'in', 'red', 'giant', 'cores', 'however', 'we', 'still', 'need', 'to', 'identify', 'the', 'physical', 'mechanisms', 'that', 'transport', 'angular', 'momentum', 'inside', 'red', 'giants', 'leading', 'to', 'the', 'slowdown', 'observed', 'for', 'the', 'red', 'giant', 'core', 'rotation', 'thus', 'largescale', 'measurements', 'of', 'the', 'red', 'giant', 'core', 'rotation', 'are', 'of', 'prime', 'importance', 'to', 'obtain', 'tighter', 'constraints', 'on', 'the', 'efficiency', 'of', 'the', 'internal', 'angular', 'momentum', 'transport', 'and', 'to', 'study', 'how', 'this', 'efficiency', 'changes', 'with', 'stellar', 'parameters', 'this', 'work', 'aims', 'at', 'identifying', 'the', 'components', 'of', 'the', 'rotational', 'multiplets', 'for', 'dipole', 'mixed', 'modes', 'in', 'a', 'large', 'number', 'of', 'red', 'giant', 'oscillation', 'spectra', 'observed', 'by', 'kepler', 'such', 'identification', 'provides', 'us', 'with', 'a', 'direct', 'measurement', 'of', 'the', 'red', 'giant', 'mean', 'core', 'rotation', 'we', 'compute', 'stretched', 'spectra', 'that', 'mimic', 'the', 'regular', 'pattern', 'of', 'pure', 'dipole', 'gravity', 'modes', 'mixed', 'modes', 'with', 'same', 'azimuthal', 'order', 'are', 'expected', 'to', 'be', 'almost', 'equally', 'spaced', 'in', 'stretched', 'period', 'the', 'departure', 'from', 'this', 'regular', 'pattern', 'allows', 'us', 'to', 'disentangle', 'the', 'various', 'rotational', 'components', 'and', 'therefore', 'to', 'determine', 'the', 'mean', 'core', 'rotation', 'rates', 'of', 'red', 'giants', 'we', 'obtained', 'mean', 'core', 'rotation', 'measurements', 'for', '875', 'red', 'giant', 'branch', 'stars', 'this', 'large', 'sample', 'includes', 'stars', 'with', 'a', 'mass', 'as', 'large', 'as', '25', 'm_odot', 'allowing', 'us', 'to', 'test', 'the', 'dependence', 'of', 'the', 'core', 'slowdown', 'rate', 'on', 'the', 'stellar', 'mass', 'this', 'work', 'on', 'a', 'large', 'sample', 'allows', 'us', 'to', 'refine', 'previous', 'measurements', 'of', 'the', 'evolution', 'of', 'the', 'mean', 'core', 'rotation', 'on', 'the', 'red', 'giant', 'branch', 'rather', 'than', 'a', 'slight', 'slow', 'down', 'our', 'results', 'suggest', 'rotation', 'to', 'be', 'constant', 'along', 'the', 'red', 'giant', 'branch', 'with', 'values', 'independent', 'on', 'the', 'mass']] | [-0.0903634332692615, 0.1717646918259561, -0.10526219235966841, 0.05082720683542221, -0.14437720014858044, -0.03788024886610928, 0.07529518974178584, 0.3494421625612957, -0.18507067004680064, -0.3719078092887393, 0.051805960150638326, -0.24584306798856215, -0.03899736759962507, 0.1892451519607068, -0.06375169997340639, -0.01509262200712778, 0.09371679984342403, -0.013558214721080892, -0.03722410556788099, -0.1963650518822109, 0.27891433027287693, 0.04279246070934288, 0.23436894114180795, -0.04170152033091526, 0.024681330112073695, -0.0821303479658372, -0.04000662564013473, -0.035747361242276274, -0.17627493690595597, 0.06684030345093903, 0.1810172306600532, 0.10238680178472988, 0.2050853932135118, -0.39604696028450687, -0.14943400478571295, 0.09127671555512863, 0.20029791708214284, 0.10644982167952642, -0.030481818912643597, -0.21665063622490094, 0.06446112789848572, -0.13065824044500632, -0.236165501487895, -0.041772114507754324, 0.04936940187581461, 0.01494082522783016, -0.25744335949283464, 0.1085312447306181, 0.05273397200538114, 0.0766399319891945, -0.0629727205498285, -0.14471515656167097, -0.0931806192261672, 0.14612086157476, 0.06453293460555293, 0.018139802961613695, 0.14380695495747606, -0.08380500250839631, -0.021047011748079995, 0.3632614146127637, -0.12755222684074222, -0.07903444642936501, 0.21878981189346938, -0.2196921537066655, -0.13056320277458516, 0.13221627080081053, 0.20971555164516853, 0.1372090146936583, -0.133595008610978, -0.04013993121327908, 0.020581886539153233, 0.17980235473105058, 0.09077625907442062, 0.06276612473493683, 0.32493842699705894, 0.14269796666788878, 0.04722631481304083, 0.10228523537920396, -0.21712884465593335, -0.08679085704360529, -0.22316158112873946, -0.09315865982634898, -0.13585989516678634, 0.059860904440730535, -0.13050669821162236, -0.1575410825709857, 0.38176236441895894, 0.08624901766356122, 0.2432288736366148, 0.04227384102678552, 0.3299695669056511, 0.09740755990546238, 0.16636689570097715, 0.08011705484378712, 0.3075542069844407, 0.23553700615287623, 0.07707842910658856, -0.32505381006036105, 0.03853780690862409, -0.026702121341114732] |
1,802.04559 | Sentence Boundary Detection for French with Subword-Level Information
Vectors and Convolutional Neural Networks | In this work we tackle the problem of sentence boundary detection applied to
French as a binary classification task ("sentence boundary" or "not sentence
boundary"). We combine convolutional neural networks with subword-level
information vectors, which are word embedding representations learned from
Wikipedia that take advantage of the words morphology; so each word is
represented as a bag of their character n-grams.
We decide to use a big written dataset (French Gigaword) instead of standard
size transcriptions to train and evaluate the proposed architectures with the
intention of using the trained models in posterior real life ASR
transcriptions.
Three different architectures are tested showing similar results; general
accuracy for all models overpasses 0.96. All three models have good F1 scores
reaching values over 0.97 regarding the "not sentence boundary" class. However,
the "sentence boundary" class reflects lower scores decreasing the F1 metric to
0.778 for one of the models.
Using subword-level information vectors seem to be very effective leading to
conclude that the morphology of words encoded in the embeddings representations
behave like pixels in an image making feasible the use of convolutional neural
network architectures.
| cs.CL | in this work we tackle the problem of sentence boundary detection applied to french as a binary classification task sentence boundary or not sentence boundary we combine convolutional neural networks with subwordlevel information vectors which are word embedding representations learned from wikipedia that take advantage of the words morphology so each word is represented as a bag of their character ngrams we decide to use a big written dataset french gigaword instead of standard size transcriptions to train and evaluate the proposed architectures with the intention of using the trained models in posterior real life asr transcriptions three different architectures are tested showing similar results general accuracy for all models overpasses 096 all three models have good f1 scores reaching values over 097 regarding the not sentence boundary class however the sentence boundary class reflects lower scores decreasing the f1 metric to 0778 for one of the models using subwordlevel information vectors seem to be very effective leading to conclude that the morphology of words encoded in the embeddings representations behave like pixels in an image making feasible the use of convolutional neural network architectures | [['in', 'this', 'work', 'we', 'tackle', 'the', 'problem', 'of', 'sentence', 'boundary', 'detection', 'applied', 'to', 'french', 'as', 'a', 'binary', 'classification', 'task', 'sentence', 'boundary', 'or', 'not', 'sentence', 'boundary', 'we', 'combine', 'convolutional', 'neural', 'networks', 'with', 'subwordlevel', 'information', 'vectors', 'which', 'are', 'word', 'embedding', 'representations', 'learned', 'from', 'wikipedia', 'that', 'take', 'advantage', 'of', 'the', 'words', 'morphology', 'so', 'each', 'word', 'is', 'represented', 'as', 'a', 'bag', 'of', 'their', 'character', 'ngrams', 'we', 'decide', 'to', 'use', 'a', 'big', 'written', 'dataset', 'french', 'gigaword', 'instead', 'of', 'standard', 'size', 'transcriptions', 'to', 'train', 'and', 'evaluate', 'the', 'proposed', 'architectures', 'with', 'the', 'intention', 'of', 'using', 'the', 'trained', 'models', 'in', 'posterior', 'real', 'life', 'asr', 'transcriptions', 'three', 'different', 'architectures', 'are', 'tested', 'showing', 'similar', 'results', 'general', 'accuracy', 'for', 'all', 'models', 'overpasses', '096', 'all', 'three', 'models', 'have', 'good', 'f1', 'scores', 'reaching', 'values', 'over', '097', 'regarding', 'the', 'not', 'sentence', 'boundary', 'class', 'however', 'the', 'sentence', 'boundary', 'class', 'reflects', 'lower', 'scores', 'decreasing', 'the', 'f1', 'metric', 'to', '0778', 'for', 'one', 'of', 'the', 'models', 'using', 'subwordlevel', 'information', 'vectors', 'seem', 'to', 'be', 'very', 'effective', 'leading', 'to', 'conclude', 'that', 'the', 'morphology', 'of', 'words', 'encoded', 'in', 'the', 'embeddings', 'representations', 'behave', 'like', 'pixels', 'in', 'an', 'image', 'making', 'feasible', 'the', 'use', 'of', 'convolutional', 'neural', 'network', 'architectures']] | [-0.03695617726314939, 0.02954133484218383, -0.03920364528516861, 0.11145217507272154, -0.14900987411572322, -0.1838835409496332, 0.02168059605299621, 0.45785956879624645, -0.27313571073165216, -0.2955852520677286, 0.04571636249688832, -0.30963551877695766, -0.13299136995967176, 0.17421720804634025, -0.11999931848431761, 0.060513895437376244, 0.16214040926078688, 0.12764180988966914, -0.08927438955728871, -0.3333912080178994, 0.3173107776023145, 0.0069072886596660355, 0.34669493851126043, -0.022753734818684895, 0.13313002576044686, -0.09124124885064383, -0.014012837460314904, -0.035531392706734305, -0.0464888508825695, 0.17023722735120336, 0.3405460437921008, 0.1951656413390427, 0.28692283881198916, -0.3811025157772206, -0.20830330782242723, 0.09169397551717387, 0.12660636753174226, 0.09077530517054068, 0.05302492629837345, -0.3511742977217796, 0.09704775083306673, -0.1888124644215143, 0.058611985059404695, -0.10317204575230543, -0.013796085476044667, -0.02611232938156841, -0.24413594363030752, 0.026230462775660074, 0.106330061150161, 0.07222086657090364, -0.10129943065914779, -0.1515335036863296, -0.006352619514674754, 0.1952679149189813, 0.02934072966989432, 0.10961425871638632, 0.10299081672234713, -0.20171592124022789, -0.14070440470366866, 0.37270559198348907, -0.09540063682125528, -0.26128978175992096, 0.17052705915065836, -0.05552669908045917, -0.15228733266074512, 0.050927969244484964, 0.20560772862612597, 0.07769765507624912, -0.14096569669105716, -0.007852795109391917, -0.05430335628774923, 0.23064768717221512, 0.13375098546841055, -0.019884422213480985, 0.22043257409870323, 0.22242095615412738, -0.06306351408161022, 0.13917454308515564, -0.09948604375602224, -0.036948352806093925, -0.2061200884944835, -0.10184073808187669, -0.18614474306562664, -0.019566563704220982, -0.13045186436903425, -0.19434784052868348, 0.4085193503950093, 0.22124798153904643, 0.23188882155117352, 0.1544754675696478, 0.2583212360336974, 0.010342541637805265, 0.13592598619996696, 0.10209608976320188, 0.1423544245293817, 0.015030016594037816, 0.08631458393411358, -0.1023841153465312, 0.10512487626181462, 0.09289977705559214] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.