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,801.10269 | The Impact of Class Rebalancing Techniques on the Performance and
Interpretation of Defect Prediction Models | Defect prediction models that are trained on class imbalanced datasets (i.e.,
the proportion of defective and clean modules is not equally represented) are
highly susceptible to produce inaccurate prediction models. Prior research
compares the impact of class rebalancing techniques on the performance of
defect prediction models. Prior research efforts arrive at contradictory
conclusions due to the use of different choice of datasets, classification
techniques, and performance measures. Such contradictory conclusions make it
hard to derive practical guidelines for whether class rebalancing techniques
should be applied in the context of defect prediction models. In this paper, we
investigate the impact of 4 popularly-used class rebalancing techniques on 10
commonly-used performance measures and the interpretation of defect prediction
models. We also construct statistical models to better understand in which
experimental design settings that class rebalancing techniques are beneficial
for defect prediction models. Through a case study of 101 datasets that span
across proprietary and open-source systems, we recommend that class rebalancing
techniques are necessary when quality assurance teams wish to increase the
completeness of identifying software defects (i.e., Recall). However, class
rebalancing techniques should be avoided when interpreting defect prediction
models. We also find that class rebalancing techniques do not impact the AUC
measure. Hence, AUC should be used as a standard measure when comparing defect
prediction models.
| cs.SE | defect prediction models that are trained on class imbalanced datasets ie the proportion of defective and clean modules is not equally represented are highly susceptible to produce inaccurate prediction models prior research compares the impact of class rebalancing techniques on the performance of defect prediction models prior research efforts arrive at contradictory conclusions due to the use of different choice of datasets classification techniques and performance measures such contradictory conclusions make it hard to derive practical guidelines for whether class rebalancing techniques should be applied in the context of defect prediction models in this paper we investigate the impact of 4 popularlyused class rebalancing techniques on 10 commonlyused performance measures and the interpretation of defect prediction models we also construct statistical models to better understand in which experimental design settings that class rebalancing techniques are beneficial for defect prediction models through a case study of 101 datasets that span across proprietary and opensource systems we recommend that class rebalancing techniques are necessary when quality assurance teams wish to increase the completeness of identifying software defects ie recall however class rebalancing techniques should be avoided when interpreting defect prediction models we also find that class rebalancing techniques do not impact the auc measure hence auc should be used as a standard measure when comparing defect prediction models | [['defect', 'prediction', 'models', 'that', 'are', 'trained', 'on', 'class', 'imbalanced', 'datasets', 'ie', 'the', 'proportion', 'of', 'defective', 'and', 'clean', 'modules', 'is', 'not', 'equally', 'represented', 'are', 'highly', 'susceptible', 'to', 'produce', 'inaccurate', 'prediction', 'models', 'prior', 'research', 'compares', 'the', 'impact', 'of', 'class', 'rebalancing', 'techniques', 'on', 'the', 'performance', 'of', 'defect', 'prediction', 'models', 'prior', 'research', 'efforts', 'arrive', 'at', 'contradictory', 'conclusions', 'due', 'to', 'the', 'use', 'of', 'different', 'choice', 'of', 'datasets', 'classification', 'techniques', 'and', 'performance', 'measures', 'such', 'contradictory', 'conclusions', 'make', 'it', 'hard', 'to', 'derive', 'practical', 'guidelines', 'for', 'whether', 'class', 'rebalancing', 'techniques', 'should', 'be', 'applied', 'in', 'the', 'context', 'of', 'defect', 'prediction', 'models', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'impact', 'of', '4', 'popularlyused', 'class', 'rebalancing', 'techniques', 'on', '10', 'commonlyused', 'performance', 'measures', 'and', 'the', 'interpretation', 'of', 'defect', 'prediction', 'models', 'we', 'also', 'construct', 'statistical', 'models', 'to', 'better', 'understand', 'in', 'which', 'experimental', 'design', 'settings', 'that', 'class', 'rebalancing', 'techniques', 'are', 'beneficial', 'for', 'defect', 'prediction', 'models', 'through', 'a', 'case', 'study', 'of', '101', 'datasets', 'that', 'span', 'across', 'proprietary', 'and', 'opensource', 'systems', 'we', 'recommend', 'that', 'class', 'rebalancing', 'techniques', 'are', 'necessary', 'when', 'quality', 'assurance', 'teams', 'wish', 'to', 'increase', 'the', 'completeness', 'of', 'identifying', 'software', 'defects', 'ie', 'recall', 'however', 'class', 'rebalancing', 'techniques', 'should', 'be', 'avoided', 'when', 'interpreting', 'defect', 'prediction', 'models', 'we', 'also', 'find', 'that', 'class', 'rebalancing', 'techniques', 'do', 'not', 'impact', 'the', 'auc', 'measure', 'hence', 'auc', 'should', 'be', 'used', 'as', 'a', 'standard', 'measure', 'when', 'comparing', 'defect', 'prediction', 'models']] | [-0.031351961044264354, 0.02458725608885288, -0.04739510216641911, 0.12770524606715108, -0.07678447558252184, -0.2111857654537659, 0.07449124042908553, 0.45540195881973866, -0.2283678185400488, -0.3440279411541861, 0.1273803147167877, -0.26630354989306504, -0.1525364657363118, 0.22732037533085447, -0.14829453760541456, 0.06261402573382352, 0.15113043466481876, 0.007698116349706123, -0.08083462800808944, -0.315296348381441, 0.29372573232841354, 0.07323503711715687, 0.3920248179366206, 0.05909956762090672, 0.0022623125593676124, -0.03703204572720583, -0.04298157511552428, 0.05363336551154769, -0.12422378418542754, 0.14837468178661237, 0.32975036162961896, 0.1702585624639205, 0.30608855773543203, -0.36834857636023055, -0.2324777762037377, 0.13763402930872384, 0.10404093017758326, 0.10128829036426439, 0.01038575039331823, -0.24713317959699346, 0.09156976911715817, -0.18098092382817074, -0.07969468095052858, -0.1358017942370024, -0.01784000123396169, 0.004032295778783601, -0.2741475111718268, 0.041867355379373444, 0.025126294609765672, 0.061745481697712525, -0.08780797778867012, -0.1395940163584296, 0.0034672423049287742, 0.1547525032064715, 0.0753803022005487, 0.0016586817156653418, 0.1713994433886783, -0.15624821251366547, -0.18600614039758004, 0.3888424980259219, -0.04670927189886137, -0.23828124710667314, 0.22366595317631266, -0.05229489504208052, -0.1906638525859561, 0.08283123549853647, 0.24170208993519463, 0.10495886877233293, -0.15634035290547832, 0.005061435277118932, 0.012587421501412727, 0.17211785475766764, 0.02801489898566763, 0.004608480448206497, 0.2196106863874119, 0.188268787860004, 0.028400362652271638, 0.08523481725877541, -0.06942118869303877, -0.061067449905757985, -0.22702114648337282, -0.10913515881483637, -0.11691578946964339, 0.03253394700383746, -0.06926208713259764, -0.17943007455120774, 0.36132327360534217, 0.25794136280323876, 0.13931872359108785, 0.0811309284697081, 0.26705332520028013, 0.04657145617259017, 0.06502760082678219, 0.05330470540604099, 0.197593750442963, 0.012499259156987158, 0.047103535896708626, -0.15651949428476739, 0.1416958010127378, 0.013534666771112487] |
1,801.1027 | The Impact of Automated Parameter Optimization on Defect Prediction
Models | Defect prediction models---classifiers that identify defect-prone software
modules---have configurable parameters that control their characteristics
(e.g., the number of trees in a random forest). Recent studies show that these
classifiers underperform when default settings are used. In this paper, we
study the impact of automated parameter optimization on defect prediction
models. Through a case study of 18 datasets, we find that automated parameter
optimization: (1) improves AUC performance by up to 40 percentage points; (2)
yields classifiers that are at least as stable as those trained using default
settings; (3) substantially shifts the importance ranking of variables, with as
few as 28% of the top-ranked variables in optimized classifiers also being
top-ranked in non-optimized classifiers; (4) yields optimized settings for 17
of the 20 most sensitive parameters that transfer among datasets without a
statistically significant drop in performance; and (5) adds less than 30
minutes of additional computation to 12 of the 26 studied classification
techniques. While widely-used classification techniques like random forest and
support vector machines are not optimization-sensitive, traditionally
overlooked techniques like C5.0 and neural networks can actually outperform
widely-used techniques after optimization is applied. This highlights the
importance of exploring the parameter space when using parameter-sensitive
classification techniques.
| cs.SE | defect prediction modelsclassifiers that identify defectprone software moduleshave configurable parameters that control their characteristics eg the number of trees in a random forest recent studies show that these classifiers underperform when default settings are used in this paper we study the impact of automated parameter optimization on defect prediction models through a case study of 18 datasets we find that automated parameter optimization 1 improves auc performance by up to 40 percentage points 2 yields classifiers that are at least as stable as those trained using default settings 3 substantially shifts the importance ranking of variables with as few as 28 of the topranked variables in optimized classifiers also being topranked in nonoptimized classifiers 4 yields optimized settings for 17 of the 20 most sensitive parameters that transfer among datasets without a statistically significant drop in performance and 5 adds less than 30 minutes of additional computation to 12 of the 26 studied classification techniques while widelyused classification techniques like random forest and support vector machines are not optimizationsensitive traditionally overlooked techniques like c50 and neural networks can actually outperform widelyused techniques after optimization is applied this highlights the importance of exploring the parameter space when using parametersensitive classification techniques | [['defect', 'prediction', 'modelsclassifiers', 'that', 'identify', 'defectprone', 'software', 'moduleshave', 'configurable', 'parameters', 'that', 'control', 'their', 'characteristics', 'eg', 'the', 'number', 'of', 'trees', 'in', 'a', 'random', 'forest', 'recent', 'studies', 'show', 'that', 'these', 'classifiers', 'underperform', 'when', 'default', 'settings', 'are', 'used', 'in', 'this', 'paper', 'we', 'study', 'the', 'impact', 'of', 'automated', 'parameter', 'optimization', 'on', 'defect', 'prediction', 'models', 'through', 'a', 'case', 'study', 'of', '18', 'datasets', 'we', 'find', 'that', 'automated', 'parameter', 'optimization', '1', 'improves', 'auc', 'performance', 'by', 'up', 'to', '40', 'percentage', 'points', '2', 'yields', 'classifiers', 'that', 'are', 'at', 'least', 'as', 'stable', 'as', 'those', 'trained', 'using', 'default', 'settings', '3', 'substantially', 'shifts', 'the', 'importance', 'ranking', 'of', 'variables', 'with', 'as', 'few', 'as', '28', 'of', 'the', 'topranked', 'variables', 'in', 'optimized', 'classifiers', 'also', 'being', 'topranked', 'in', 'nonoptimized', 'classifiers', '4', 'yields', 'optimized', 'settings', 'for', '17', 'of', 'the', '20', 'most', 'sensitive', 'parameters', 'that', 'transfer', 'among', 'datasets', 'without', 'a', 'statistically', 'significant', 'drop', 'in', 'performance', 'and', '5', 'adds', 'less', 'than', '30', 'minutes', 'of', 'additional', 'computation', 'to', '12', 'of', 'the', '26', 'studied', 'classification', 'techniques', 'while', 'widelyused', 'classification', 'techniques', 'like', 'random', 'forest', 'and', 'support', 'vector', 'machines', 'are', 'not', 'optimizationsensitive', 'traditionally', 'overlooked', 'techniques', 'like', 'c50', 'and', 'neural', 'networks', 'can', 'actually', 'outperform', 'widelyused', 'techniques', 'after', 'optimization', 'is', 'applied', 'this', 'highlights', 'the', 'importance', 'of', 'exploring', 'the', 'parameter', 'space', 'when', 'using', 'parametersensitive', 'classification', 'techniques']] | [-0.05439647705634574, 0.055604781213259034, -0.02242564450406356, 0.08075742567901212, -0.043632592172669196, -0.1912731023175585, 0.09208466752543383, 0.4259630768999533, -0.20926200001687284, -0.37847358054542907, 0.12233703580110565, -0.29007261215950253, -0.1537543819805957, 0.2595995525890952, -0.08131130115613035, 0.077019174226919, 0.1282191422270365, 0.03643098180324104, -0.08215058588796309, -0.3381682097507631, 0.28072682357048095, 0.0576370939030903, 0.3217541494207022, -0.02292225283906242, 0.061745212003294685, 0.020206746501082243, -0.05735754582890295, 0.05401824142646191, -0.06362553881970294, 0.11949163212719832, 0.30656865642248043, 0.17275486879410024, 0.3342053708029429, -0.33249579457008294, -0.2181459008314207, 0.11531897932574682, 0.14927463900428772, 0.06799083354491102, 0.008779644740977074, -0.23035046681501728, 0.1065083419015338, -0.17239834675518087, -0.03933456632796779, -0.12234881354098771, -0.002583479603603577, 0.02979138244131372, -0.2632619315849352, 0.05515378558884734, 0.04936541810981589, 0.10429759822114545, -0.03371429226484131, -0.199664400058425, -0.009092858344845965, 0.11834709510250906, 0.035378361550433945, 0.05187006160465594, 0.1854588193677101, -0.15917628028738515, -0.19082588905782963, 0.3536943422847895, -0.0720343607124609, -0.18980157859670707, 0.2055213533975373, -0.036878008214605566, -0.1772622312827512, 0.13411536553241124, 0.2196657880679775, 0.09434343807796385, -0.14229545206482153, -0.00200681835483892, 0.006299401607440056, 0.19741809279196967, 0.07611765360062574, -0.011013120356096228, 0.12206580303077524, 0.214115656761046, 0.03976691586348384, 0.11358281024371222, -0.12375631360549877, -0.059654976912599224, -0.19980425924254194, -0.0741995504033766, -0.12986819074266984, -0.008169050654558923, -0.1449733163667565, -0.13671685726769495, 0.3791027768600146, 0.21724966923153113, 0.20043658925608027, 0.07332885142434672, 0.2992026578838261, 0.034025226451981305, 0.11458903272295853, 0.10028847068581295, 0.24069875379052807, 0.053887726385666405, 0.08394963226782225, -0.11578691050086436, 0.10245358482828165, 0.0034904273186673216] |
1,801.10271 | The Impact of Correlated Metrics on Defect Models | Defect models are analytical models that are used to build empirical theories
that are related to software quality. Prior studies often derive knowledge from
such models using interpretation techniques, such as ANOVA Type-I. Recent work
raises concerns that prior studies rarely remove correlated metrics when
constructing such models. Such correlated metrics may impact the interpretation
of models. Yet, the impact of correlated metrics in such models has not been
investigated. In this paper, we set out to investigate the impact of correlated
metrics, and the benefits and costs of removing correlated metrics on defect
models. Through a case study of 15 publicly-available defect datasets, we find
that (1) correlated metrics impact the ranking of the highest ranked metric for
all of the 9 studied model interpretation techniques. On the other hand,
removing correlated metrics (2) improves the consistency of the highest ranked
metric regardless of how a model is specified for all of the studied
interpretation techniques (except for ANOVA Type-I); and (3) negligibly impacts
the performance and stability of defect models. Thus, researchers must (1)
mitigate (e.g., remove) correlated metrics prior to constructing a defect
model; and (2) avoid using ANOVA Type-I even if all correlated metrics are
removed.
| cs.SE | defect models are analytical models that are used to build empirical theories that are related to software quality prior studies often derive knowledge from such models using interpretation techniques such as anova typei recent work raises concerns that prior studies rarely remove correlated metrics when constructing such models such correlated metrics may impact the interpretation of models yet the impact of correlated metrics in such models has not been investigated in this paper we set out to investigate the impact of correlated metrics and the benefits and costs of removing correlated metrics on defect models through a case study of 15 publiclyavailable defect datasets we find that 1 correlated metrics impact the ranking of the highest ranked metric for all of the 9 studied model interpretation techniques on the other hand removing correlated metrics 2 improves the consistency of the highest ranked metric regardless of how a model is specified for all of the studied interpretation techniques except for anova typei and 3 negligibly impacts the performance and stability of defect models thus researchers must 1 mitigate eg remove correlated metrics prior to constructing a defect model and 2 avoid using anova typei even if all correlated metrics are removed | [['defect', 'models', 'are', 'analytical', 'models', 'that', 'are', 'used', 'to', 'build', 'empirical', 'theories', 'that', 'are', 'related', 'to', 'software', 'quality', 'prior', 'studies', 'often', 'derive', 'knowledge', 'from', 'such', 'models', 'using', 'interpretation', 'techniques', 'such', 'as', 'anova', 'typei', 'recent', 'work', 'raises', 'concerns', 'that', 'prior', 'studies', 'rarely', 'remove', 'correlated', 'metrics', 'when', 'constructing', 'such', 'models', 'such', 'correlated', 'metrics', 'may', 'impact', 'the', 'interpretation', 'of', 'models', 'yet', 'the', 'impact', 'of', 'correlated', 'metrics', 'in', 'such', 'models', 'has', 'not', 'been', 'investigated', 'in', 'this', 'paper', 'we', 'set', 'out', 'to', 'investigate', 'the', 'impact', 'of', 'correlated', 'metrics', 'and', 'the', 'benefits', 'and', 'costs', 'of', 'removing', 'correlated', 'metrics', 'on', 'defect', 'models', 'through', 'a', 'case', 'study', 'of', '15', 'publiclyavailable', 'defect', 'datasets', 'we', 'find', 'that', '1', 'correlated', 'metrics', 'impact', 'the', 'ranking', 'of', 'the', 'highest', 'ranked', 'metric', 'for', 'all', 'of', 'the', '9', 'studied', 'model', 'interpretation', 'techniques', 'on', 'the', 'other', 'hand', 'removing', 'correlated', 'metrics', '2', 'improves', 'the', 'consistency', 'of', 'the', 'highest', 'ranked', 'metric', 'regardless', 'of', 'how', 'a', 'model', 'is', 'specified', 'for', 'all', 'of', 'the', 'studied', 'interpretation', 'techniques', 'except', 'for', 'anova', 'typei', 'and', '3', 'negligibly', 'impacts', 'the', 'performance', 'and', 'stability', 'of', 'defect', 'models', 'thus', 'researchers', 'must', '1', 'mitigate', 'eg', 'remove', 'correlated', 'metrics', 'prior', 'to', 'constructing', 'a', 'defect', 'model', 'and', '2', 'avoid', 'using', 'anova', 'typei', 'even', 'if', 'all', 'correlated', 'metrics', 'are', 'removed']] | [-0.07813660448417067, 0.05380558177130297, -0.032110066104214637, 0.12831682058284058, -0.0423219353868626, -0.18517591038020328, 0.06544061404827517, 0.41567191081587224, -0.21273484175209886, -0.32649216111749413, 0.12232457740348764, -0.3337489234865643, -0.1788237011345336, 0.1901925746363122, -0.07966057270066812, 0.05643151311669499, 0.06774090406601317, 0.01740889148786664, -0.11165116090211086, -0.29405756791122256, 0.35765409221407024, 0.09835631754423957, 0.3254424824938178, 0.05754844238599617, 0.04763923077262007, -0.04269034110591747, -0.12590028410661033, 0.059511713559913915, -0.11907933219932602, 0.11483478129841387, 0.23421549382110243, 0.16799772385857067, 0.27505045681493356, -0.38042471612803636, -0.2910429158655461, 0.1317438015382504, 0.11807142645258864, 0.06881460451120802, -0.01581573476898484, -0.24586585726006888, 0.10526926954480587, -0.17522983130416833, -0.09375225720694289, -0.08909383286256344, -0.025763844018802048, 0.012979278509737924, -0.23489639315987007, 0.06506315528531559, 0.04894527165452019, 0.05438623453257605, -0.08903715090476907, -0.1444165329588577, -0.031558797057950866, 0.15245359172069584, 0.07697158601076808, -0.004136280588572845, 0.11898921419400722, -0.14644857783074258, -0.17451294125407002, 0.37677060743793844, -0.053692216991912574, -0.23886804872658104, 0.2009096735843923, -0.078361458289437, -0.18279782948782666, 0.06054740085266531, 0.19895103567512706, 0.09705147201893852, -0.15286532292528135, 0.04629265880823368, 0.02106678962474689, 0.16732135331607423, 0.06433329825289548, 0.03730214672163129, 0.18731963419471867, 0.14482089768629522, 0.0015040082088671625, 0.09041339814226376, -0.06151956366607919, -0.07185392264393159, -0.25235637634992597, -0.10585113004082813, -0.1418541682412615, 0.013142167094702017, -0.09446872720458487, -0.1989594014803879, 0.3954629200324416, 0.19176746063225436, 0.16682488691090838, 0.02162862792611122, 0.2640045881085098, 0.052248378436852365, 0.062438706223802, 0.0521573890466243, 0.23147432448982727, 0.053999313702806834, 0.004939803171437234, -0.1323554390616482, 0.1290740975533845, -0.002479792423546314] |
1,801.10272 | A new route to negative refractive index from topological metals | We theoretically discuss the possibility of realizing the negative refractive
index in Weyl/Dirac semimetals. We consider the Maxwell equations with the
plasma gap and the chiral magnetic effect. We study the dispersion relations of
electromagnetic waves, and show that the refractive index becomes negative at
frequencies (just) below the plasma frequency. We find that axial anomaly, or
more specifically, negative magnetoresistance (electric current parallel to
magnetic fields) opens a new route to realize the negative refractive index.
Reflection and transmission coefficients are computed in a slab of Weyl/Dirac
semimetals.
| cond-mat.mes-hall hep-th physics.optics | we theoretically discuss the possibility of realizing the negative refractive index in weyldirac semimetals we consider the maxwell equations with the plasma gap and the chiral magnetic effect we study the dispersion relations of electromagnetic waves and show that the refractive index becomes negative at frequencies just below the plasma frequency we find that axial anomaly or more specifically negative magnetoresistance electric current parallel to magnetic fields opens a new route to realize the negative refractive index reflection and transmission coefficients are computed in a slab of weyldirac semimetals | [['we', 'theoretically', 'discuss', 'the', 'possibility', 'of', 'realizing', 'the', 'negative', 'refractive', 'index', 'in', 'weyldirac', 'semimetals', 'we', 'consider', 'the', 'maxwell', 'equations', 'with', 'the', 'plasma', 'gap', 'and', 'the', 'chiral', 'magnetic', 'effect', 'we', 'study', 'the', 'dispersion', 'relations', 'of', 'electromagnetic', 'waves', 'and', 'show', 'that', 'the', 'refractive', 'index', 'becomes', 'negative', 'at', 'frequencies', 'just', 'below', 'the', 'plasma', 'frequency', 'we', 'find', 'that', 'axial', 'anomaly', 'or', 'more', 'specifically', 'negative', 'magnetoresistance', 'electric', 'current', 'parallel', 'to', 'magnetic', 'fields', 'opens', 'a', 'new', 'route', 'to', 'realize', 'the', 'negative', 'refractive', 'index', 'reflection', 'and', 'transmission', 'coefficients', 'are', 'computed', 'in', 'a', 'slab', 'of', 'weyldirac', 'semimetals']] | [-0.23686633177305666, 0.24983126333302536, -0.007145682354379194, 0.01895505962160866, -0.15266053878775473, -0.16715695339600356, 0.026592719666869116, 0.435771410468589, -0.23098334291259223, -0.3084793442211459, -0.012637623844751984, -0.2903911471680811, -0.19879749366422342, 0.17858007925646274, 0.03694215052750673, 0.02570166066288948, -0.09916372824292839, -0.0037125341301218846, -0.06659576916292811, -0.11410068298606307, 0.34336561964971296, 0.033678600569831185, 0.3147114583217863, 0.1043810073254902, 0.04566893677928307, -0.013578771414716593, 0.021136725410358624, 0.06654680963982357, -0.11399502037769953, 0.06863079831171572, 0.19688839526072646, -0.08926859513458828, 0.19140251752596055, -0.4118842444267501, -0.2535858622364951, 0.03723767696450768, 0.10178216691377437, 0.13275149507510864, -0.12688793937673692, -0.24648563649630947, 0.05960370376549159, -0.13169346573982346, -0.1989378168592962, -0.05672157380018342, -0.0014196896684889712, -0.07730212570377364, -0.2696849977168558, 0.1130908289924264, -0.008808344732080534, 0.05232110053426429, -0.10589623245740247, -0.10519971874322784, -0.02603843111775062, 0.031013336631710107, 0.08316284690308647, -0.07130077720640667, 0.12195558266013107, -0.15232373065357044, -0.13051178533547256, 0.3864268095054653, -0.10306598536428711, -0.14006247142267025, 0.09374200563427856, -0.22078266551226294, -0.026638770742823233, 0.12837896617443373, 0.19812543451618614, 0.0893342209289248, -0.04158021935936733, 0.06444364356915623, -0.021310715580338174, 0.1414802440381975, 0.14883466794291575, 0.013642004759082298, 0.2899494519446757, 0.07961461183960351, 0.05251808113449912, 0.14527024868274044, -0.0949960681596729, 0.058131711683079096, -0.26160594309272056, -0.20845307560449236, -0.16000494201866428, 0.04290976841002703, -0.10375575695168542, -0.23551116196250313, 0.42263658570774487, 0.17711962512537335, 0.14051594150388677, -0.009336211326207672, 0.29274787883577724, 0.19214367204126012, 0.06287528803111629, 0.0951920666135429, 0.3004308386046565, 0.2032954470474231, 0.1939118727832363, -0.2655326101845235, -0.038812492288690936, 0.02045632204501314] |
1,801.10273 | Kernel Distillation for Fast Gaussian Processes Prediction | Gaussian processes (GPs) are flexible models that can capture complex
structure in large-scale dataset due to their non-parametric nature. However,
the usage of GPs in real-world application is limited due to their high
computational cost at inference time. In this paper, we introduce a new
framework, \textit{kernel distillation}, to approximate a fully trained teacher
GP model with kernel matrix of size $n\times n$ for $n$ training points. We
combine inducing points method with sparse low-rank approximation in the
distillation procedure. The distilled student GP model only costs $O(m^2)$
storage for $m$ inducing points where $m \ll n$ and improves the inference time
complexity. We demonstrate empirically that kernel distillation provides better
trade-off between the prediction time and the test performance compared to the
alternatives.
| stat.ML cs.LG | gaussian processes gps are flexible models that can capture complex structure in largescale dataset due to their nonparametric nature however the usage of gps in realworld application is limited due to their high computational cost at inference time in this paper we introduce a new framework textitkernel distillation to approximate a fully trained teacher gp model with kernel matrix of size ntimes n for n training points we combine inducing points method with sparse lowrank approximation in the distillation procedure the distilled student gp model only costs om2 storage for m inducing points where m ll n and improves the inference time complexity we demonstrate empirically that kernel distillation provides better tradeoff between the prediction time and the test performance compared to the alternatives | [['gaussian', 'processes', 'gps', 'are', 'flexible', 'models', 'that', 'can', 'capture', 'complex', 'structure', 'in', 'largescale', 'dataset', 'due', 'to', 'their', 'nonparametric', 'nature', 'however', 'the', 'usage', 'of', 'gps', 'in', 'realworld', 'application', 'is', 'limited', 'due', 'to', 'their', 'high', 'computational', 'cost', 'at', 'inference', 'time', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'framework', 'textitkernel', 'distillation', 'to', 'approximate', 'a', 'fully', 'trained', 'teacher', 'gp', 'model', 'with', 'kernel', 'matrix', 'of', 'size', 'ntimes', 'n', 'for', 'n', 'training', 'points', 'we', 'combine', 'inducing', 'points', 'method', 'with', 'sparse', 'lowrank', 'approximation', 'in', 'the', 'distillation', 'procedure', 'the', 'distilled', 'student', 'gp', 'model', 'only', 'costs', 'om2', 'storage', 'for', 'm', 'inducing', 'points', 'where', 'm', 'll', 'n', 'and', 'improves', 'the', 'inference', 'time', 'complexity', 'we', 'demonstrate', 'empirically', 'that', 'kernel', 'distillation', 'provides', 'better', 'tradeoff', 'between', 'the', 'prediction', 'time', 'and', 'the', 'test', 'performance', 'compared', 'to', 'the', 'alternatives']] | [-0.058441933691198746, 0.031093305711278586, -0.05113573620906024, 0.07239487685444879, -0.0730868687633637, -0.20865836803710497, 0.11148612853991459, 0.4298202628648378, -0.2894170533002513, -0.34775774108957713, 0.052146291322400416, -0.2393466594105594, -0.15920694529010757, 0.1432002001362512, -0.1060572100719967, 0.1144682555951602, 0.10146265702200978, -0.010740237537680603, -0.08913444201471435, -0.309427106438765, 0.2548893683379879, 0.09162968116986557, 0.313292115411865, -0.019858453708617548, 0.1257408561442441, -0.03756475010678566, -0.01648012323804745, -0.046397272107471535, -0.031354304229508426, 0.14521989029854898, 0.3182291760751128, 0.19187810257592094, 0.3337885204388389, -0.43649942190121344, -0.20707633565899317, 0.16084681923417904, 0.1202073230576603, 0.08096679698532008, 0.002931323489249964, -0.2765726945949794, 0.07095040645208059, -0.1706133273892044, -0.05293294405981111, -0.16712028096710158, -0.023403839908570537, -0.035174270612906997, -0.33297044984150176, 0.05984802714859446, 0.07252533542280032, 0.027517951767497915, 0.0006932962413241224, -0.13510653506055836, 0.05756966209765978, 0.1066377696437322, 0.0006010488226510039, 0.011392824764446757, 0.1032658382848935, -0.1347963703035309, -0.11247301815698545, 0.3362393213087708, -0.05966512934206342, -0.22994105034030793, 0.18808067760740718, -0.0942575729081059, -0.12800219524424614, 0.11923535173471139, 0.27142973794986125, 0.09355579399905069, -0.11045233950887738, 0.13151023971443102, -0.02122576721769765, 0.18902637337039158, 0.036367800128381186, 0.003227769033756198, 0.07239083434375594, 0.2515012485967056, 0.06286453229291894, 0.12141418946164895, -0.11909887258993174, -0.11095587398129993, -0.2437469894293605, -0.13275022703275932, -0.2489799995096476, 0.01864398096317077, -0.1693523173838971, -0.13969029127847313, 0.360018988317863, 0.19905700745454769, 0.2278832303614704, 0.15965787455348707, 0.33397373968235605, 0.051756552908933016, 0.04873740421683808, 0.16210836514724586, 0.12031153347948945, 0.06431160515128839, 0.06729628981790994, -0.19626431755448986, 0.12379237384406652, 0.036417416100034385] |
1,801.10274 | Two-dimensional vortex quantum droplets | It was recently found that the Lee-Huang-Yang (LHY) correction to the
mean-field Hamiltonian suppresses the collapse and creates stable localized
modes (two-component "quantum droplets", QDs) in two and three dimensions. We
construct two-dimensional\ self-trapped modes in the form of QDs with vorticity
$S$ embedded into each component. The QDs feature a flat-top shape, which
expands with the increase of $S$ and norm $N$. An essential finding, produced
by a systematic numerical analysis and analytical estimates, is that the
vortical QDs are \emph{stable} (which is a critical issue for vortex solitons
in nonlinear models) up to $S=5$, for $N$ exceeding a certain threshold value.
In the condensate of $^{39}$K atoms, in which QDs with $S=0$ and a quasi-2D
shape were created recently, the vortical droplets may have radial size
$\lesssim 30$ $\mathrm{\mu}$m, with the number of atoms in the range of
$10^{4}-10^{5}$. It is worthy to note that \textit{hidden-vorticity} states in
QDs with topological charges $% S_{+}=-S_{-}=1$ in its components, which are
prone to strong instability in other settings, have their stability region too,
although it may be located beyond applicability limits of the underlying model.
Dynamics of elliptically deformed QDs, which form rotating elongated patterns
or ones with strong oscillations of the eccentricity, as well as collisions of
QDs, are also addressed.
| cond-mat.quant-gas nlin.PS physics.flu-dyn quant-ph | it was recently found that the leehuangyang lhy correction to the meanfield hamiltonian suppresses the collapse and creates stable localized modes twocomponent quantum droplets qds in two and three dimensions we construct twodimensional selftrapped modes in the form of qds with vorticity s embedded into each component the qds feature a flattop shape which expands with the increase of s and norm n an essential finding produced by a systematic numerical analysis and analytical estimates is that the vortical qds are emphstable which is a critical issue for vortex solitons in nonlinear models up to s5 for n exceeding a certain threshold value in the condensate of 39k atoms in which qds with s0 and a quasi2d shape were created recently the vortical droplets may have radial size lesssim 30 mathrmmum with the number of atoms in the range of 104105 it is worthy to note that textithiddenvorticity states in qds with topological charges s_s_1 in its components which are prone to strong instability in other settings have their stability region too although it may be located beyond applicability limits of the underlying model dynamics of elliptically deformed qds which form rotating elongated patterns or ones with strong oscillations of the eccentricity as well as collisions of qds are also addressed | [['it', 'was', 'recently', 'found', 'that', 'the', 'leehuangyang', 'lhy', 'correction', 'to', 'the', 'meanfield', 'hamiltonian', 'suppresses', 'the', 'collapse', 'and', 'creates', 'stable', 'localized', 'modes', 'twocomponent', 'quantum', 'droplets', 'qds', 'in', 'two', 'and', 'three', 'dimensions', 'we', 'construct', 'twodimensional', 'selftrapped', 'modes', 'in', 'the', 'form', 'of', 'qds', 'with', 'vorticity', 's', 'embedded', 'into', 'each', 'component', 'the', 'qds', 'feature', 'a', 'flattop', 'shape', 'which', 'expands', 'with', 'the', 'increase', 'of', 's', 'and', 'norm', 'n', 'an', 'essential', 'finding', 'produced', 'by', 'a', 'systematic', 'numerical', 'analysis', 'and', 'analytical', 'estimates', 'is', 'that', 'the', 'vortical', 'qds', 'are', 'emphstable', 'which', 'is', 'a', 'critical', 'issue', 'for', 'vortex', 'solitons', 'in', 'nonlinear', 'models', 'up', 'to', 's5', 'for', 'n', 'exceeding', 'a', 'certain', 'threshold', 'value', 'in', 'the', 'condensate', 'of', '39k', 'atoms', 'in', 'which', 'qds', 'with', 's0', 'and', 'a', 'quasi2d', 'shape', 'were', 'created', 'recently', 'the', 'vortical', 'droplets', 'may', 'have', 'radial', 'size', 'lesssim', '30', 'mathrmmum', 'with', 'the', 'number', 'of', 'atoms', 'in', 'the', 'range', 'of', '104105', 'it', 'is', 'worthy', 'to', 'note', 'that', 'textithiddenvorticity', 'states', 'in', 'qds', 'with', 'topological', 'charges', 's_s_1', 'in', 'its', 'components', 'which', 'are', 'prone', 'to', 'strong', 'instability', 'in', 'other', 'settings', 'have', 'their', 'stability', 'region', 'too', 'although', 'it', 'may', 'be', 'located', 'beyond', 'applicability', 'limits', 'of', 'the', 'underlying', 'model', 'dynamics', 'of', 'elliptically', 'deformed', 'qds', 'which', 'form', 'rotating', 'elongated', 'patterns', 'or', 'ones', 'with', 'strong', 'oscillations', 'of', 'the', 'eccentricity', 'as', 'well', 'as', 'collisions', 'of', 'qds', 'are', 'also', 'addressed']] | [-0.1405665946179671, 0.20119571463606248, -0.059736990678579766, 0.04259612187175035, 0.015677018956677835, -0.16726048695342394, -0.011636886617578744, 0.36281247736003835, -0.2061451879512679, -0.2914933721884711, 0.0488748960503328, -0.30604790537907745, -0.08554146480167275, 0.16915885394363347, 0.007635394965591462, 0.038755190912712116, 0.03534469998616538, -0.018298375337834707, -0.034336522467764155, -0.211904227780401, 0.2977590379761933, 0.031105601521204427, 0.2650208307049153, 0.060044975942401796, 0.02277495759276397, -0.07173148088344333, 0.08905881759599207, 0.024214016890786054, -0.13328236164238988, 0.09415905138142919, 0.22812047217155232, -0.005192686275592403, 0.24043421901909537, -0.4412596237413478, -0.20251256532791076, 0.09275956315536533, 0.22938037580592138, 0.14981743564069466, -0.05845841693215108, -0.2916774381293011, 0.08489076044348082, -0.14818773011044203, -0.1621028024337865, -0.05984363828799086, 0.07319537375532269, 0.0392987850082049, -0.25721763418686605, 0.09764544088401805, 0.0872121211049441, 0.025157929669940873, -0.04798992981401196, -0.08302239264900747, -0.06580188829099769, 0.04946517131099718, 0.04908279504690489, 0.0342310007158043, 0.1649771511162582, -0.13343590044842044, -0.0694294276409983, 0.3758355204849259, -0.04195199900253288, -0.16971842543128432, 0.15526370074640086, -0.16154332133845548, -0.07374122448858213, 0.17717811895944358, 0.1539533094430017, 0.11131869013193976, -0.07694393519449168, 0.05655488420281176, -0.024119958027519962, 0.18490309923838236, 0.09481538096264575, 0.08143625796313562, 0.2445308392272558, 0.1507784992948834, 0.033921256336921314, 0.13793038255975104, -0.10585415446503117, -0.1258177358576912, -0.2574775431747437, -0.11384834062628911, -0.16345033266594963, 0.04071177206610432, -0.07052107583072748, -0.18293815997315563, 0.3746980631871051, 0.08977920743503104, 0.20917051593685615, -0.02566240838412463, 0.24130918545443475, 0.10036496520510309, 0.09713295287269938, 0.07137482390075066, 0.2886000651126487, 0.15705515143826926, 0.06752448095037696, -0.22092129214127598, 0.0021120016953270686, 0.0193413157822591] |
1,801.10275 | The Detection of Hot Cores and Complex Organic Molecules in the Large
Magellanic Cloud | We report the first extragalactic detection of the complex organic molecules
(COMs) dimethyl ether (CH$_3$OCH$_3$) and methyl formate (CH$_3$OCHO) with the
Atacama Large Millimeter/submillimeter Array (ALMA). These COMs together with
their parent species methanol (CH$_3$OH), were detected toward two 1.3 mm
continuum sources in the N 113 star-forming region in the low-metallicity Large
Magellanic Cloud (LMC). Rotational temperatures ($T_{\rm rot}\sim130$ K) and
total column densities ($N_{\rm rot}\sim10^{16}$ cm$^{-2}$) have been
calculated for each source based on multiple transitions of CH$_3$OH. We
present the ALMA molecular emission maps for COMs and measured abundances for
all detected species. The physical and chemical properties of two sources with
COMs detection, and the association with H$_2$O and OH maser emission indicate
that they are hot cores. The fractional abundances of COMs scaled by a factor
of 2.5 to account for the lower metallicity in the LMC are comparable to those
found at the lower end of the range in Galactic hot cores. Our results have
important implications for studies of organic chemistry at higher redshift.
| astro-ph.GA | we report the first extragalactic detection of the complex organic molecules coms dimethyl ether ch_3och_3 and methyl formate ch_3ocho with the atacama large millimetersubmillimeter array alma these coms together with their parent species methanol ch_3oh were detected toward two 13 mm continuum sources in the n 113 starforming region in the lowmetallicity large magellanic cloud lmc rotational temperatures t_rm rotsim130 k and total column densities n_rm rotsim1016 cm2 have been calculated for each source based on multiple transitions of ch_3oh we present the alma molecular emission maps for coms and measured abundances for all detected species the physical and chemical properties of two sources with coms detection and the association with h_2o and oh maser emission indicate that they are hot cores the fractional abundances of coms scaled by a factor of 25 to account for the lower metallicity in the lmc are comparable to those found at the lower end of the range in galactic hot cores our results have important implications for studies of organic chemistry at higher redshift | [['we', 'report', 'the', 'first', 'extragalactic', 'detection', 'of', 'the', 'complex', 'organic', 'molecules', 'coms', 'dimethyl', 'ether', 'ch_3och_3', 'and', 'methyl', 'formate', 'ch_3ocho', 'with', 'the', 'atacama', 'large', 'millimetersubmillimeter', 'array', 'alma', 'these', 'coms', 'together', 'with', 'their', 'parent', 'species', 'methanol', 'ch_3oh', 'were', 'detected', 'toward', 'two', '13', 'mm', 'continuum', 'sources', 'in', 'the', 'n', '113', 'starforming', 'region', 'in', 'the', 'lowmetallicity', 'large', 'magellanic', 'cloud', 'lmc', 'rotational', 'temperatures', 't_rm', 'rotsim130', 'k', 'and', 'total', 'column', 'densities', 'n_rm', 'rotsim1016', 'cm2', 'have', 'been', 'calculated', 'for', 'each', 'source', 'based', 'on', 'multiple', 'transitions', 'of', 'ch_3oh', 'we', 'present', 'the', 'alma', 'molecular', 'emission', 'maps', 'for', 'coms', 'and', 'measured', 'abundances', 'for', 'all', 'detected', 'species', 'the', 'physical', 'and', 'chemical', 'properties', 'of', 'two', 'sources', 'with', 'coms', 'detection', 'and', 'the', 'association', 'with', 'h_2o', 'and', 'oh', 'maser', 'emission', 'indicate', 'that', 'they', 'are', 'hot', 'cores', 'the', 'fractional', 'abundances', 'of', 'coms', 'scaled', 'by', 'a', 'factor', 'of', '25', 'to', 'account', 'for', 'the', 'lower', 'metallicity', 'in', 'the', 'lmc', 'are', 'comparable', 'to', 'those', 'found', 'at', 'the', 'lower', 'end', 'of', 'the', 'range', 'in', 'galactic', 'hot', 'cores', 'our', 'results', 'have', 'important', 'implications', 'for', 'studies', 'of', 'organic', 'chemistry', 'at', 'higher', 'redshift']] | [-0.0606260418577792, 0.13728154472422582, 0.04518760542644287, 0.008685822631700858, 0.021072004963065216, -0.06191098310890988, 0.051946191278357916, 0.47254872377190366, -0.10636553013994848, -0.34520709548784784, 0.02602496394645092, -0.2856512120236042, 0.020117865878118743, 0.1263111059460238, 0.05430085857425673, -0.033344872061648136, 0.028720892438135998, -0.17251849582745313, 0.015365512954906737, -0.20044924391877214, 0.2266344045228242, 0.09888034613152756, 0.1391451844074846, 0.06253060669302059, 0.042081697325955125, -0.28048594668920884, -0.06508364958121006, -0.08057076665820807, -0.1461054948532693, 0.09879486528142581, 0.3544445054456812, 0.06866703501395528, 0.15175034164743134, -0.40614678731640064, -0.2655844049274745, 0.06793778264873038, 0.14908615715068782, 0.049515964510194826, -0.040732721684462, -0.3180807557993034, 0.01901797439418072, -0.15121220352993342, -0.17527654889651392, 0.07863003028330762, 0.07718461050415004, 0.08440559519421773, -0.1735216819444608, 0.12347042911063284, -0.08379532660071093, 0.13456606286021291, -0.14340203492378695, -0.28376907823309744, -0.0965263286933369, 0.07485449208861449, -0.052467505984868, 0.037957717865683444, 0.25509101907259746, -0.10809685605076644, -0.0448050618270886, 0.4286142527291099, -0.15460316622533324, 0.009214674836278138, 0.27818711156152276, -0.231789580226694, -0.36098996973899605, 0.24765109010977593, 0.10980535777748601, 0.16289939888967916, -0.1357514302979207, -0.04771016687967611, -0.03983329433242421, 0.22025220071174997, 0.09892555872066575, 0.09605721595763235, 0.31204538115371877, 0.06989429807414428, 0.02861447070901607, 0.13144869935773204, -0.28890389743393297, -0.0901122593607467, -0.174454263283681, -0.1961446573803499, -0.12010677031051235, 0.07064605980957224, -0.13708965719719526, -0.06436736905635969, 0.25123197886233145, 0.08344480205263899, 0.1998090776917938, 0.03959446612431409, 0.2983198601672613, 0.030999669442146178, 0.1088377749485366, 0.09993381463211669, 0.25716917783286447, 0.1758038836776571, 0.09632340460167041, -0.25391862990566083, 0.14660612967956435, -0.014007524834510445] |
1,801.10276 | Sums with the Mobius function twisted by characters with powerful moduli | In their recent work, the authors (2016) have combined classical ideas of A.
G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short
character sums for certain nonprincipal characters with powerful moduli. In the
present paper, these results are used to bound sums of the Mobius function
twisted by characters of the same type, complementing and improving some
earlier work of B. Green (2012). To achieve this, we obtain a series of results
about the size and zero-free region of $L$-functions with the same class of
moduli.
| math.NT | in their recent work the authors 2016 have combined classical ideas of a g postnikov 1956 and n m korobov 1974 to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli in the present paper these results are used to bound sums of the mobius function twisted by characters of the same type complementing and improving some earlier work of b green 2012 to achieve this we obtain a series of results about the size and zerofree region of lfunctions with the same class of moduli | [['in', 'their', 'recent', 'work', 'the', 'authors', '2016', 'have', 'combined', 'classical', 'ideas', 'of', 'a', 'g', 'postnikov', '1956', 'and', 'n', 'm', 'korobov', '1974', 'to', 'derive', 'improved', 'bounds', 'on', 'short', 'character', 'sums', 'for', 'certain', 'nonprincipal', 'characters', 'with', 'powerful', 'moduli', 'in', 'the', 'present', 'paper', 'these', 'results', 'are', 'used', 'to', 'bound', 'sums', 'of', 'the', 'mobius', 'function', 'twisted', 'by', 'characters', 'of', 'the', 'same', 'type', 'complementing', 'and', 'improving', 'some', 'earlier', 'work', 'of', 'b', 'green', '2012', 'to', 'achieve', 'this', 'we', 'obtain', 'a', 'series', 'of', 'results', 'about', 'the', 'size', 'and', 'zerofree', 'region', 'of', 'lfunctions', 'with', 'the', 'same', 'class', 'of', 'moduli']] | [-0.13747729217776886, 0.06315182005202367, -0.1066801110077854, 0.03628006923283645, -0.10795096510376495, -0.0662607727674665, 0.07856179255823308, 0.3034906375610812, -0.2401039732881095, -0.3248933820606588, 0.10252214348644714, -0.22482938769754474, -0.14433093790916707, 0.23193351135353793, -0.11471427628382846, 0.06583235342219308, 0.05244940175459935, 0.01856050636250894, -0.08334739033931068, -0.37653967568261937, 0.3193137934201162, 0.029600620709850894, 0.22811018582433462, 0.05150481621519877, 0.00859683314031297, 0.027780118546765913, -0.07380165485409344, -0.05781533667346933, -0.19127025975523373, 0.21332763666849952, 0.25327993933479864, 0.056577204465661404, 0.22991926839657045, -0.394318243867339, -0.16681614898626212, 0.11535158144453397, 0.10622651297292048, 0.03414183092216582, 0.02643208304333122, -0.29379843886951906, 0.10433920338790822, -0.1555220476801988, -0.14941775385843037, -0.044587408079878314, 0.07548350526613522, 0.07338656498385328, -0.256292936995953, 0.03973988210782409, 0.12072463747584722, 0.09502978881841505, -0.0541214314059119, -0.22727820320709885, 0.048250058568645636, 0.1307933321683207, 0.06501194744647204, 0.05918318495809377, 0.02567677699914714, -0.100709856679704, -0.1257569699159281, 0.29143788608220905, -0.0973074753374721, -0.13802426386174266, 0.1646428994506925, -0.16510985554758828, -0.1794718753822803, 0.09404196729371836, 0.150497502800855, 0.18092052645055107, -0.05713083921512077, 0.13432185552760978, -0.13162805030511304, 0.06625247210427955, 0.142437008583079, 0.028270686884502787, 0.12232045205258815, 0.058696777040425405, 0.00608514860057487, 0.1719339036812576, -0.016752307730532445, -0.029775756482894603, -0.3084308744745923, -0.18203251078983276, -0.16610920672038837, 0.0954805603148518, -0.06046575944884143, -0.14738159765781078, 0.3904090504069905, 0.10040188409006837, 0.2381319300281805, 0.1438059683090874, 0.16755694261199416, 0.09486025046802811, 0.039757463352493735, 0.0713682673247224, 0.16549935774106256, 0.19531299754629258, 0.0630614366433532, -0.1315560081748517, -0.007527692564558442, 0.18926293910532208] |
1,801.10277 | Cataloging the Visible Universe through Bayesian Inference at Petascale | Astronomical catalogs derived from wide-field imaging surveys are an
important tool for understanding the Universe. We construct an astronomical
catalog from 55 TB of imaging data using Celeste, a Bayesian variational
inference code written entirely in the high-productivity programming language
Julia. Using over 1.3 million threads on 650,000 Intel Xeon Phi cores of the
Cori Phase II supercomputer, Celeste achieves a peak rate of 1.54 DP PFLOP/s.
Celeste is able to jointly optimize parameters for 188M stars and galaxies,
loading and processing 178 TB across 8192 nodes in 14.6 minutes. To achieve
this, Celeste exploits parallelism at multiple levels (cluster, node, and
thread) and accelerates I/O through Cori's Burst Buffer. Julia's native
performance enables Celeste to employ high-level constructs without resorting
to hand-written or generated low-level code (C/C++/Fortran), and yet achieve
petascale performance.
| cs.DC astro-ph.IM | astronomical catalogs derived from widefield imaging surveys are an important tool for understanding the universe we construct an astronomical catalog from 55 tb of imaging data using celeste a bayesian variational inference code written entirely in the highproductivity programming language julia using over 13 million threads on 650000 intel xeon phi cores of the cori phase ii supercomputer celeste achieves a peak rate of 154 dp pflops celeste is able to jointly optimize parameters for 188m stars and galaxies loading and processing 178 tb across 8192 nodes in 146 minutes to achieve this celeste exploits parallelism at multiple levels cluster node and thread and accelerates io through coris burst buffer julias native performance enables celeste to employ highlevel constructs without resorting to handwritten or generated lowlevel code ccfortran and yet achieve petascale performance | [['astronomical', 'catalogs', 'derived', 'from', 'widefield', 'imaging', 'surveys', 'are', 'an', 'important', 'tool', 'for', 'understanding', 'the', 'universe', 'we', 'construct', 'an', 'astronomical', 'catalog', 'from', '55', 'tb', 'of', 'imaging', 'data', 'using', 'celeste', 'a', 'bayesian', 'variational', 'inference', 'code', 'written', 'entirely', 'in', 'the', 'highproductivity', 'programming', 'language', 'julia', 'using', 'over', '13', 'million', 'threads', 'on', '650000', 'intel', 'xeon', 'phi', 'cores', 'of', 'the', 'cori', 'phase', 'ii', 'supercomputer', 'celeste', 'achieves', 'a', 'peak', 'rate', 'of', '154', 'dp', 'pflops', 'celeste', 'is', 'able', 'to', 'jointly', 'optimize', 'parameters', 'for', '188m', 'stars', 'and', 'galaxies', 'loading', 'and', 'processing', '178', 'tb', 'across', '8192', 'nodes', 'in', '146', 'minutes', 'to', 'achieve', 'this', 'celeste', 'exploits', 'parallelism', 'at', 'multiple', 'levels', 'cluster', 'node', 'and', 'thread', 'and', 'accelerates', 'io', 'through', 'coris', 'burst', 'buffer', 'julias', 'native', 'performance', 'enables', 'celeste', 'to', 'employ', 'highlevel', 'constructs', 'without', 'resorting', 'to', 'handwritten', 'or', 'generated', 'lowlevel', 'code', 'ccfortran', 'and', 'yet', 'achieve', 'petascale', 'performance']] | [-0.09612591156757344, 0.0012973856253332622, -0.03660939410257772, 0.03381259178308764, -0.11963919094472214, -0.16281699335010621, 0.10070675778743021, 0.4182158715966094, -0.24457130988505277, -0.4181106103129173, 0.0684055972485341, -0.2865061209153185, -0.03795883625582259, 0.2376740570189005, -0.03878299327823156, 0.04645031405157829, 0.14763922020277534, -0.037780250602167186, -0.03367360252247171, -0.27860171990717925, 0.17483125301433428, 0.14156626524645408, 0.27844334731788467, -0.04549276748785877, 0.12729946858176733, -0.046894439437447956, -0.05179020678708934, -0.11901015485814623, -0.07831815317386889, 0.08140511835306768, 0.30455761066929415, 0.24541223933920264, 0.2622926364482189, -0.4107512320029258, -0.09811268687578814, 0.005351627828510663, 0.15526770535529455, 0.03532069252416463, -0.010016544859763946, -0.28501434342665527, 0.12158774265322748, -0.1856949221812018, -0.02130068889783539, -0.07296168656383449, -0.014040212957401767, 0.008729082302062395, -0.2480280524793344, 0.03898119137938781, -0.020748190197894593, 0.16326240309379028, -0.05609486087488423, -0.13643433898331897, -0.005070655916831705, 0.09098768211680798, -0.10450579888962266, 0.1269976301154278, 0.18084381929179297, -0.07813308524316219, -0.12794886379794196, 0.39215427969106054, -0.06870503818886425, -0.06373876669508127, 0.19770638573601956, -0.032975296882685017, -0.17574741189076587, 0.12125759418406844, 0.23485115009452437, 0.06330909129482772, -0.20188456612376085, 0.06107638998602282, 0.06665605667423997, 0.27072896103317784, 0.12074710865583242, -0.014072985453211227, 0.20391327300898104, 0.178924914719608, -0.00749028506040047, 0.1520761882269556, -0.212789835104406, -0.08379805525444903, -0.1718089570549498, -0.14248752911070375, -0.1375569701868692, 0.008967212202269157, -0.11284591310481161, -0.12808059603206898, 0.35960728765415556, 0.16436397776946085, 0.09975537516528613, 0.11038234288504753, 0.3118517369259405, -0.0373012549652654, 0.18337172101329985, 0.20892416635343364, 0.1493150899462217, 0.044218935587848646, 0.16689373985179948, -0.17345912160195467, 0.009888258751993643, -0.005386197723569135] |
1,801.10278 | Ultra-High Resolution Neutron Spectroscopy of Low-Energy Spin Dynamics
in UGe$_2$ | Studying the prototypical ferromagnetic superconductor UGe$_2$ we demonstrate
the potential of the Modulated IntEnsity by Zero Effort (MIEZE) technique---a
novel neutron spectroscopy method with ultra-high energy resolution of at least
1~$\mu$eV---for the study of quantum matter. We reveal purely longitudinal spin
fluctuations in UGe$_2$ with a dual nature arising from $5f$ electrons that are
hybridized with the conduction electrons. Local spin fluctuations are perfectly
described by the Ising universality class in three dimensions, whereas
itinerant spin fluctuations occur over length scales comparable to the
superconducting coherence length, showing that MIEZE is able to
spectroscopically disentangle the complex low-energy behavior characteristic of
quantum materials.
| cond-mat.str-el | studying the prototypical ferromagnetic superconductor uge_2 we demonstrate the potential of the modulated intensity by zero effort mieze techniquea novel neutron spectroscopy method with ultrahigh energy resolution of at least 1muevfor the study of quantum matter we reveal purely longitudinal spin fluctuations in uge_2 with a dual nature arising from 5f electrons that are hybridized with the conduction electrons local spin fluctuations are perfectly described by the ising universality class in three dimensions whereas itinerant spin fluctuations occur over length scales comparable to the superconducting coherence length showing that mieze is able to spectroscopically disentangle the complex lowenergy behavior characteristic of quantum materials | [['studying', 'the', 'prototypical', 'ferromagnetic', 'superconductor', 'uge_2', 'we', 'demonstrate', 'the', 'potential', 'of', 'the', 'modulated', 'intensity', 'by', 'zero', 'effort', 'mieze', 'techniquea', 'novel', 'neutron', 'spectroscopy', 'method', 'with', 'ultrahigh', 'energy', 'resolution', 'of', 'at', 'least', '1muevfor', 'the', 'study', 'of', 'quantum', 'matter', 'we', 'reveal', 'purely', 'longitudinal', 'spin', 'fluctuations', 'in', 'uge_2', 'with', 'a', 'dual', 'nature', 'arising', 'from', '5f', 'electrons', 'that', 'are', 'hybridized', 'with', 'the', 'conduction', 'electrons', 'local', 'spin', 'fluctuations', 'are', 'perfectly', 'described', 'by', 'the', 'ising', 'universality', 'class', 'in', 'three', 'dimensions', 'whereas', 'itinerant', 'spin', 'fluctuations', 'occur', 'over', 'length', 'scales', 'comparable', 'to', 'the', 'superconducting', 'coherence', 'length', 'showing', 'that', 'mieze', 'is', 'able', 'to', 'spectroscopically', 'disentangle', 'the', 'complex', 'lowenergy', 'behavior', 'characteristic', 'of', 'quantum', 'materials']] | [-0.15598356058028076, 0.27590032364472306, -0.04017353781826315, 0.08924249473654915, -0.034994426759716014, -0.1769338952801605, -0.010769098005856913, 0.354505333311782, -0.2705379835339171, -0.27813132107718896, -0.04976346989226813, -0.34825903800602004, -0.09229494756350459, 0.1781866101843148, 0.08455596613872907, -0.004096273046982761, -0.038224294990310353, -0.04721603021809444, -0.11035757868361687, -0.19638975149752183, 0.29566137690908545, 0.03342643311007483, 0.32161226319056924, 0.05856992188831883, 0.05584227294190833, 0.022974268729236014, 0.09173829667039658, 0.033603350604229636, -0.1226971179363894, 0.046718573552731534, 0.2817105645184765, -0.10556174421885817, 0.17689351748452795, -0.433314157834295, -0.252821650171634, 0.04587942684567211, 0.13932755741286137, 0.12296534736818256, -0.02892794802388416, -0.2870166553829861, 0.05817974465760854, -0.12513132534441676, -0.17079604752730615, -0.10312193861268092, -0.05858866283946698, 0.0032999881746081433, -0.2010074143394791, 0.12968049663819814, 0.057369214450331905, 0.093273216738633, -0.07504880754738161, -0.10615430450491091, -0.024875735988526947, 0.0366016544014363, 0.06998758803301555, 0.0413106635355824, 0.13891881709863055, -0.11973810318101308, -0.15875447798741632, 0.3122044980968579, -0.06721234839815314, -0.09106904709720892, 0.19278722488330585, -0.23292663081152604, -0.07372068186373551, 0.20064988102542586, 0.1032501192357723, 0.07976358211460975, -0.1260031625388725, 0.07342349472555094, 0.008373140283666624, 0.20541437999299256, 0.0004373725554398676, 0.13662063027040497, 0.2869307580542299, 0.20484205236252728, 0.007777574444466298, 0.1516467701450064, -0.15703060469673116, -0.09061385997303642, -0.23585499729500106, -0.13846934181038695, -0.2662953913470011, 0.11388277793810288, -0.05437823295556378, -0.1595834781436508, 0.4322248587666061, 0.16767006789400107, 0.15452569085957096, -0.04044662523867175, 0.2378076539365667, 0.083372405794735, 0.04849915034460402, 0.05606033065181115, 0.23122891878690754, 0.19715464046446257, 0.0926298029146775, -0.36094708929050456, 0.02757247059264838, 0.03037592336664548] |
1,801.10279 | Chain length effects of $p$-oligophenyls with comparison of benzene by
Raman scattering | Raman scattering measurements are performed on benzene and a number of
$p$-oligophenyls including biphenyl, $p$-terphenyl, $p$-quaterphenyl,
$p$-quinquephenyl, and $p$-sexiphenyl at ambient conditions. The vibrational
modes of the intra- and intermolecular terms in these materials are analyzed
and compared. Chain length effects on the vibrational properties are examined
for the C-H in-plane bending mode and the inter-ring C-C stretching mode at
around 1200 cm$^{-1}$ and 1280 cm$^{-1}$, respectively, and the C-C stretching
modes at around 1600 cm$^{-1}$. The complex and fluctuating properties of these
modes result in an imprecise estimation of the chain length of these molecules.
Meanwhile, the obtained ratio of the intensities of the 1200 cm$^{-1}$ mode and
1280 cm$^{-1}$ mode is sensitive to the applied lasers. A librational motion
mode with the lowest energy is found to have a monotonous change with the
increase in the chain length. This mode is simply relevant to the $c$ axis of
the unit cell. Such an obvious trend makes it a better indicator for
determining the chain length effects on the physical and chemical properties in
these molecules.
| cond-mat.mtrl-sci cond-mat.supr-con | raman scattering measurements are performed on benzene and a number of poligophenyls including biphenyl pterphenyl pquaterphenyl pquinquephenyl and psexiphenyl at ambient conditions the vibrational modes of the intra and intermolecular terms in these materials are analyzed and compared chain length effects on the vibrational properties are examined for the ch inplane bending mode and the interring cc stretching mode at around 1200 cm1 and 1280 cm1 respectively and the cc stretching modes at around 1600 cm1 the complex and fluctuating properties of these modes result in an imprecise estimation of the chain length of these molecules meanwhile the obtained ratio of the intensities of the 1200 cm1 mode and 1280 cm1 mode is sensitive to the applied lasers a librational motion mode with the lowest energy is found to have a monotonous change with the increase in the chain length this mode is simply relevant to the c axis of the unit cell such an obvious trend makes it a better indicator for determining the chain length effects on the physical and chemical properties in these molecules | [['raman', 'scattering', 'measurements', 'are', 'performed', 'on', 'benzene', 'and', 'a', 'number', 'of', 'poligophenyls', 'including', 'biphenyl', 'pterphenyl', 'pquaterphenyl', 'pquinquephenyl', 'and', 'psexiphenyl', 'at', 'ambient', 'conditions', 'the', 'vibrational', 'modes', 'of', 'the', 'intra', 'and', 'intermolecular', 'terms', 'in', 'these', 'materials', 'are', 'analyzed', 'and', 'compared', 'chain', 'length', 'effects', 'on', 'the', 'vibrational', 'properties', 'are', 'examined', 'for', 'the', 'ch', 'inplane', 'bending', 'mode', 'and', 'the', 'interring', 'cc', 'stretching', 'mode', 'at', 'around', '1200', 'cm1', 'and', '1280', 'cm1', 'respectively', 'and', 'the', 'cc', 'stretching', 'modes', 'at', 'around', '1600', 'cm1', 'the', 'complex', 'and', 'fluctuating', 'properties', 'of', 'these', 'modes', 'result', 'in', 'an', 'imprecise', 'estimation', 'of', 'the', 'chain', 'length', 'of', 'these', 'molecules', 'meanwhile', 'the', 'obtained', 'ratio', 'of', 'the', 'intensities', 'of', 'the', '1200', 'cm1', 'mode', 'and', '1280', 'cm1', 'mode', 'is', 'sensitive', 'to', 'the', 'applied', 'lasers', 'a', 'librational', 'motion', 'mode', 'with', 'the', 'lowest', 'energy', 'is', 'found', 'to', 'have', 'a', 'monotonous', 'change', 'with', 'the', 'increase', 'in', 'the', 'chain', 'length', 'this', 'mode', 'is', 'simply', 'relevant', 'to', 'the', 'c', 'axis', 'of', 'the', 'unit', 'cell', 'such', 'an', 'obvious', 'trend', 'makes', 'it', 'a', 'better', 'indicator', 'for', 'determining', 'the', 'chain', 'length', 'effects', 'on', 'the', 'physical', 'and', 'chemical', 'properties', 'in', 'these', 'molecules']] | [-0.15408932989280272, 0.18249965477352298, -0.011464106399299843, -0.013797361717027213, 0.0013380837507013764, -0.11655419408875917, 0.055069882371130266, 0.41851152762770655, -0.26853862454183397, -0.25523306659821954, 0.06866879841312766, -0.3094299927353859, -0.04445654291659593, 0.17987866046173231, 0.05864283928647637, 0.008997831087825554, 0.036785498984702694, 0.02686173659882375, 0.007127633400793586, -0.127356992448414, 0.21210357255036277, 0.10717993782833218, 0.32961260076612237, 0.0876567617082037, 0.06092382977583578, -0.019928277218714357, 0.02842138377417411, -0.03982386366597244, -0.1742198605143598, 0.083840981689947, 0.2429574419770922, -0.03355534464386957, 0.2144567171856761, -0.39755339389400823, -0.17165991794251437, 0.028785730650914568, 0.14761391306828175, 0.10476560665028437, 0.06251620247128553, -0.23532328535403524, 0.07358210608363151, -0.0779135189444891, -0.1191042018468891, -0.02872198204376868, 0.05564461968040892, 0.017411981201730667, -0.2440422042884997, 0.11320731056588036, -0.006805188222123044, 0.14148641931824385, -0.09265681418723294, -0.16202722190480148, -0.07943652441592089, 0.08061006541363895, 0.06871395460063857, 0.0240025831146964, 0.2037875476186829, -0.06096769043510514, -0.04938842973738376, 0.40777443023930704, -0.07858913189864584, -0.13860429478144007, 0.22698785174238895, -0.12417748075244682, -0.07589585314105664, 0.2113067447926317, 0.09829690667185267, 0.09487179156392812, -0.09464723116053002, -0.00981511191930622, 0.04927001526845353, 0.2096998829288142, 0.12358122431007879, 0.11507551062453006, 0.19681640105055911, 0.12368419444121953, 0.0017175125556864908, 0.133944762508784, -0.1573841937092532, -0.04259676024849926, -0.22568005917327744, -0.15090747120923229, -0.13621662014064245, -0.002047589463847024, -0.10002490189375489, -0.14570171529161077, 0.4162884748035244, 0.05648216044199736, 0.19017189497527268, -0.005737067780324391, 0.24635174698063306, 0.10302742500589894, 0.10679081540754332, 0.03420183722728065, 0.2834331032580563, 0.1768961886822113, 0.08322846067071493, -0.3073923697681831, 0.02129349936381914, -0.022959092502881372] |
1,801.1028 | Dugundji systems and a retract characterization of effective
zero-dimensionality | In this paper (as in [Ken15]), we consider an effective version of the
characterization of separable metric spaces as zero-dimensional iff every
nonempty closed subset is a retract of the space (actually, it is a relative
result for closed zero-dimensional subspaces of a fixed space that we have
proved). This uses (in the converse direction) local compactness & bilocated
sets as in [Ken15], but in the forward direction the newer version has a
simpler proof and no compactness assumption. Furthermore, the proof of the
forward implication relates to so-called Dugundji systems: we elaborate both a
general construction of such systems for a proper nonempty closed subspace
(using a computable form of countable paracompactness), and modifications -- to
make the sets pairwise disjoint if the subspace is zero-dimensional, or to
avoid the restriction to proper subspaces. In a different direction, a second
theorem applies in $p$-adic analysis the ideas of the first theorem to compute
a more general form of retraction, given a Dugundji system (possibly without
disjointness).
Finally, we complement the effective retract characterization of
zero-dimensional subspaces mentioned above by improving to equivalence the
implications (or Weihrauch reductions in some cases), for closed
at-most-zero-dimensional subsets with some negative information, among separate
conditions of computability of operations $N,M,B,S$ introduced in [Ken15,\S 4]
and corresponding to vanishing large inductive dimension, vanishing small
inductive dimension, existence of a countable basis of relatively clopen sets,
and the reduction principle for sequences of open sets. Thus, similarly to the
robust notion of effective zero-dimensionality of computable metric spaces in
[Ken15], there is a robust notion of `uniform effective zero-dimensionality'
for a represented pointclass consisting of at-most-zero-dimensional closed
subsets.
| cs.LO math.LO | in this paper as in ken15 we consider an effective version of the characterization of separable metric spaces as zerodimensional iff every nonempty closed subset is a retract of the space actually it is a relative result for closed zerodimensional subspaces of a fixed space that we have proved this uses in the converse direction local compactness bilocated sets as in ken15 but in the forward direction the newer version has a simpler proof and no compactness assumption furthermore the proof of the forward implication relates to socalled dugundji systems we elaborate both a general construction of such systems for a proper nonempty closed subspace using a computable form of countable paracompactness and modifications to make the sets pairwise disjoint if the subspace is zerodimensional or to avoid the restriction to proper subspaces in a different direction a second theorem applies in padic analysis the ideas of the first theorem to compute a more general form of retraction given a dugundji system possibly without disjointness finally we complement the effective retract characterization of zerodimensional subspaces mentioned above by improving to equivalence the implications or weihrauch reductions in some cases for closed atmostzerodimensional subsets with some negative information among separate conditions of computability of operations nmbs introduced in ken15s 4 and corresponding to vanishing large inductive dimension vanishing small inductive dimension existence of a countable basis of relatively clopen sets and the reduction principle for sequences of open sets thus similarly to the robust notion of effective zerodimensionality of computable metric spaces in ken15 there is a robust notion of uniform effective zerodimensionality for a represented pointclass consisting of atmostzerodimensional closed subsets | [['in', 'this', 'paper', 'as', 'in', 'ken15', 'we', 'consider', 'an', 'effective', 'version', 'of', 'the', 'characterization', 'of', 'separable', 'metric', 'spaces', 'as', 'zerodimensional', 'iff', 'every', 'nonempty', 'closed', 'subset', 'is', 'a', 'retract', 'of', 'the', 'space', 'actually', 'it', 'is', 'a', 'relative', 'result', 'for', 'closed', 'zerodimensional', 'subspaces', 'of', 'a', 'fixed', 'space', 'that', 'we', 'have', 'proved', 'this', 'uses', 'in', 'the', 'converse', 'direction', 'local', 'compactness', 'bilocated', 'sets', 'as', 'in', 'ken15', 'but', 'in', 'the', 'forward', 'direction', 'the', 'newer', 'version', 'has', 'a', 'simpler', 'proof', 'and', 'no', 'compactness', 'assumption', 'furthermore', 'the', 'proof', 'of', 'the', 'forward', 'implication', 'relates', 'to', 'socalled', 'dugundji', 'systems', 'we', 'elaborate', 'both', 'a', 'general', 'construction', 'of', 'such', 'systems', 'for', 'a', 'proper', 'nonempty', 'closed', 'subspace', 'using', 'a', 'computable', 'form', 'of', 'countable', 'paracompactness', 'and', 'modifications', 'to', 'make', 'the', 'sets', 'pairwise', 'disjoint', 'if', 'the', 'subspace', 'is', 'zerodimensional', 'or', 'to', 'avoid', 'the', 'restriction', 'to', 'proper', 'subspaces', 'in', 'a', 'different', 'direction', 'a', 'second', 'theorem', 'applies', 'in', 'padic', 'analysis', 'the', 'ideas', 'of', 'the', 'first', 'theorem', 'to', 'compute', 'a', 'more', 'general', 'form', 'of', 'retraction', 'given', 'a', 'dugundji', 'system', 'possibly', 'without', 'disjointness', 'finally', 'we', 'complement', 'the', 'effective', 'retract', 'characterization', 'of', 'zerodimensional', 'subspaces', 'mentioned', 'above', 'by', 'improving', 'to', 'equivalence', 'the', 'implications', 'or', 'weihrauch', 'reductions', 'in', 'some', 'cases', 'for', 'closed', 'atmostzerodimensional', 'subsets', 'with', 'some', 'negative', 'information', 'among', 'separate', 'conditions', 'of', 'computability', 'of', 'operations', 'nmbs', 'introduced', 'in', 'ken15s', '4', 'and', 'corresponding', 'to', 'vanishing', 'large', 'inductive', 'dimension', 'vanishing', 'small', 'inductive', 'dimension', 'existence', 'of', 'a', 'countable', 'basis', 'of', 'relatively', 'clopen', 'sets', 'and', 'the', 'reduction', 'principle', 'for', 'sequences', 'of', 'open', 'sets', 'thus', 'similarly', 'to', 'the', 'robust', 'notion', 'of', 'effective', 'zerodimensionality', 'of', 'computable', 'metric', 'spaces', 'in', 'ken15', 'there', 'is', 'a', 'robust', 'notion', 'of', 'uniform', 'effective', 'zerodimensionality', 'for', 'a', 'represented', 'pointclass', 'consisting', 'of', 'atmostzerodimensional', 'closed', 'subsets']] | [-0.1595791769724109, 0.09846404094728842, -0.0804143398197905, 0.11352511610720684, -0.08633500877907326, -0.11594062227204666, 0.07824875825836432, 0.317702055469239, -0.291061327334019, -0.18453901191416444, 0.1077371059091978, -0.23128813240077165, -0.09508131812797503, 0.21438204517809514, -0.14277647872462396, 0.007030581532234556, 0.05804170822822367, 0.058270847532995856, -0.0968096495670535, -0.2542360486525498, 0.38619343636292364, -0.044062898322514324, 0.24902392085249211, 0.0560433852402598, 0.1329110158443423, 0.039550515296363206, -0.020858731258604744, 0.08117920520379222, -0.13596936265573586, 0.14942650921406897, 0.2761253628326922, 0.16220971898521097, 0.3038882533775482, -0.36209898085666087, -0.16379542790311005, 0.18528812098724956, 0.11104861742377364, 0.05313548218103105, -0.010367332273417969, -0.2664991585400011, 0.11765305038045809, -0.13599861291592963, -0.16783184500076295, -0.09712619857935842, 0.08069671940124744, -0.01349214922587914, -0.26024788397814286, -0.01729715229596329, 0.16392501115320754, 0.09985574760189984, -0.08146112998999823, -0.06278214061655425, -0.014445481207989129, 0.07121617131001466, -0.012177303521492787, 0.07548064183599006, 0.06841892317048194, -0.03898689715010341, -0.11202082493820328, 0.3517497063576059, -0.07502189843042506, -0.26536504992751286, 0.1802108187053164, -0.11876619967558091, -0.1756317509767296, 0.1026473534123428, 0.11096352409555713, 0.12188574404556876, -0.10983089153211885, 0.16639284701574913, -0.10875307861366745, 0.1061606445530262, 0.11315084146554, 0.0872130410149275, 0.12538450206403207, 0.13096992027935353, 0.15435528882198413, 0.16975618617204524, 0.024683259220005534, -0.051185897005153365, -0.34526815042178727, -0.16725660872496123, -0.1486644285429297, 0.08608964507944171, -0.1102372287211884, -0.22442039722499998, 0.34096035781431566, 0.0773625968665945, 0.17975140951594779, 0.09730855501056318, 0.2697268245534183, 0.05578328900288595, 0.03579813271999875, 0.08650976573677353, 0.1595990970045806, 0.1793095385071504, -0.021905490096958444, -0.11312464726245125, 0.0335651998101186, 0.1742494362563397] |
1,801.10281 | Learning Video-Story Composition via Recurrent Neural Network | In this paper, we propose a learning-based method to compose a video-story
from a group of video clips that describe an activity or experience. We learn
the coherence between video clips from real videos via the Recurrent Neural
Network (RNN) that jointly incorporates the spatial-temporal semantics and
motion dynamics to generate smooth and relevant compositions. We further
rearrange the results generated by the RNN to make the overall video-story
compatible with the storyline structure via a submodular ranking optimization
process. Experimental results on the video-story dataset show that the proposed
algorithm outperforms the state-of-the-art approach.
| cs.CV | in this paper we propose a learningbased method to compose a videostory from a group of video clips that describe an activity or experience we learn the coherence between video clips from real videos via the recurrent neural network rnn that jointly incorporates the spatialtemporal semantics and motion dynamics to generate smooth and relevant compositions we further rearrange the results generated by the rnn to make the overall videostory compatible with the storyline structure via a submodular ranking optimization process experimental results on the videostory dataset show that the proposed algorithm outperforms the stateoftheart approach | [['in', 'this', 'paper', 'we', 'propose', 'a', 'learningbased', 'method', 'to', 'compose', 'a', 'videostory', 'from', 'a', 'group', 'of', 'video', 'clips', 'that', 'describe', 'an', 'activity', 'or', 'experience', 'we', 'learn', 'the', 'coherence', 'between', 'video', 'clips', 'from', 'real', 'videos', 'via', 'the', 'recurrent', 'neural', 'network', 'rnn', 'that', 'jointly', 'incorporates', 'the', 'spatialtemporal', 'semantics', 'and', 'motion', 'dynamics', 'to', 'generate', 'smooth', 'and', 'relevant', 'compositions', 'we', 'further', 'rearrange', 'the', 'results', 'generated', 'by', 'the', 'rnn', 'to', 'make', 'the', 'overall', 'videostory', 'compatible', 'with', 'the', 'storyline', 'structure', 'via', 'a', 'submodular', 'ranking', 'optimization', 'process', 'experimental', 'results', 'on', 'the', 'videostory', 'dataset', 'show', 'that', 'the', 'proposed', 'algorithm', 'outperforms', 'the', 'stateoftheart', 'approach']] | [-0.04913342589708535, 0.013167688803361288, -0.11041625136215436, 0.047464570699134796, -0.11314240905799364, -0.13020253549942648, 0.02169961838272253, 0.5143811757627287, -0.30951731264787286, -0.29349529537813446, -0.0010280755311740857, -0.27883795217463847, -0.260814985752988, 0.16387965219634537, -0.12989663234666773, 0.020457414851376886, 0.1674925137507288, 0.07320337884226127, -0.05261290413817685, -0.2775085724081452, 0.3016131839151249, 0.0101927229013343, 0.3204947565829283, -0.010556082491223749, 0.18347566050330275, -0.012097760250693873, -0.038669969576508985, -0.007267851697428054, -0.06074724076185559, 0.20372792029949396, 0.2940188599652366, 0.2244076410749633, 0.28130382995709385, -0.4261382918608816, -0.21916578111581897, 0.0467000488289877, 0.09579156541118497, 0.0822333804184669, -0.05073650539239966, -0.37871838579640577, 0.12209701427307568, -0.18736253713355644, 0.06204336383379996, -0.15789811943510645, -0.041358994222001025, -0.0010303967932582293, -0.325797505192091, 0.023582531684568447, 0.0778145506781967, 0.011068059018764056, -0.0896323870426338, -0.0414843943999394, 0.0028695785293453616, 0.16458136606226234, 0.04710649469542611, 0.08603926849012312, 0.13809256194355457, -0.15332781581244873, -0.17514825759357527, 0.3623558899877887, -0.11240715949036377, -0.19896749142361314, 0.16885947652259156, -0.005985140805377772, -0.13085467591881753, 0.1402143291540836, 0.25478114567108845, 0.13515250347799768, -0.16859717760296342, -0.03416959553785426, -0.09986281008092, 0.2129443857426706, 0.02778107584883018, -0.024766433165457687, 0.17848198555262856, 0.27104968781533995, 0.014343021604183473, 0.15607974910618444, -0.10016056130836276, -0.08663777420787434, -0.2087658311142341, -0.09269398925335784, -0.16660204980473378, -0.04162140492300846, -0.09524460770159127, -0.11666200996428655, 0.4654603047688541, 0.28736170537181593, 0.22942683988888013, 0.1704047351977543, 0.3453550068269435, -0.023452752519791065, 0.10601795637293866, 0.09403409269932461, 0.09828516254201532, -0.01746330584497436, 0.14513270279980803, -0.20700726283371057, 0.0663817238503773, 0.1003454920835793] |
1,801.10282 | Stochastic Optimization and Control Framework for 5G Network Slicing
with Effective Isolation | Network slicing is an emerging technique for providing resources to diverse
wireless services with heterogeneous quality-of-service needs. However, beyond
satisfying end-to-end requirements of network users, network slicing needs to
also provide isolation between slices so as to prevent one slice's faults and
congestion from affecting other slices. In this paper, the problem of network
slicing is studied in the context of a wireless system having a time-varying
number of users that require two types of slices: reliable low latency (RLL)
and self-managed (capacity limited) slices. To address this problem, a novel
control framework for stochastic optimization is proposed based on the Lyapunov
drift-plus-penalty method. This new framework enables the system to minimize
power, maintain slice isolation, and provide reliable and low latency
end-to-end communication for RLL slices. Simulation results show that the
proposed approach can maintain the system's reliability while providing
effective slice isolation in the event of sudden changes in the network
environment.
| cs.IT cs.NI math.IT | network slicing is an emerging technique for providing resources to diverse wireless services with heterogeneous qualityofservice needs however beyond satisfying endtoend requirements of network users network slicing needs to also provide isolation between slices so as to prevent one slices faults and congestion from affecting other slices in this paper the problem of network slicing is studied in the context of a wireless system having a timevarying number of users that require two types of slices reliable low latency rll and selfmanaged capacity limited slices to address this problem a novel control framework for stochastic optimization is proposed based on the lyapunov driftpluspenalty method this new framework enables the system to minimize power maintain slice isolation and provide reliable and low latency endtoend communication for rll slices simulation results show that the proposed approach can maintain the systems reliability while providing effective slice isolation in the event of sudden changes in the network environment | [['network', 'slicing', 'is', 'an', 'emerging', 'technique', 'for', 'providing', 'resources', 'to', 'diverse', 'wireless', 'services', 'with', 'heterogeneous', 'qualityofservice', 'needs', 'however', 'beyond', 'satisfying', 'endtoend', 'requirements', 'of', 'network', 'users', 'network', 'slicing', 'needs', 'to', 'also', 'provide', 'isolation', 'between', 'slices', 'so', 'as', 'to', 'prevent', 'one', 'slices', 'faults', 'and', 'congestion', 'from', 'affecting', 'other', 'slices', 'in', 'this', 'paper', 'the', 'problem', 'of', 'network', 'slicing', 'is', 'studied', 'in', 'the', 'context', 'of', 'a', 'wireless', 'system', 'having', 'a', 'timevarying', 'number', 'of', 'users', 'that', 'require', 'two', 'types', 'of', 'slices', 'reliable', 'low', 'latency', 'rll', 'and', 'selfmanaged', 'capacity', 'limited', 'slices', 'to', 'address', 'this', 'problem', 'a', 'novel', 'control', 'framework', 'for', 'stochastic', 'optimization', 'is', 'proposed', 'based', 'on', 'the', 'lyapunov', 'driftpluspenalty', 'method', 'this', 'new', 'framework', 'enables', 'the', 'system', 'to', 'minimize', 'power', 'maintain', 'slice', 'isolation', 'and', 'provide', 'reliable', 'and', 'low', 'latency', 'endtoend', 'communication', 'for', 'rll', 'slices', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'approach', 'can', 'maintain', 'the', 'systems', 'reliability', 'while', 'providing', 'effective', 'slice', 'isolation', 'in', 'the', 'event', 'of', 'sudden', 'changes', 'in', 'the', 'network', 'environment']] | [-0.20490118821889355, -0.02404931350828484, -0.0252232711532383, 0.04012765718681448, -0.0783993526718688, -0.200518937675621, 0.0820797133530103, 0.38402387850567116, -0.2644503315330132, -0.3429764077285087, 0.10944357117057427, -0.2032109238963284, -0.15341086137900733, 0.1619856659951922, -0.15902165945183921, 0.11571215600222833, 0.0663974279834127, 0.007101710877069817, -0.03665284286918385, -0.25157026842526803, 0.30019029165624167, 0.09624007821397541, 0.3750765535242662, 0.07992404914013558, 0.10978604893671809, 0.02280562453564595, -0.019517006792503035, 0.012309633843243944, -0.07117231851248992, 0.1428188938151326, 0.30047471700357153, 0.2249692208496491, 0.3262217431268715, -0.4692847535570527, -0.26952866989780555, 0.08080824619074436, 0.18597074771619723, 0.06278005123570071, -0.009313339824854796, -0.25614580048502167, 0.15568085708851961, -0.22476055900650946, -0.05836569426532883, -0.07119878414449851, -0.04246679182442558, 0.01670133282752502, -0.30086726919663226, 0.03374662205566314, -0.02743042923370981, 0.03262051647867669, -0.05695129397276837, -0.0006409461939610638, 0.01051942247582914, 0.2174223387982793, 0.0037277036164312734, 0.02138637047406141, 0.14676526466130532, -0.10443647383174, -0.1138225644479155, 0.3734908248781674, 0.033144574839162166, -0.2347138398624586, 0.17683634352446956, -0.03744760531532977, -0.15245824729926982, 0.12200769560650451, 0.24702542266081232, 0.06650207760477704, -0.19447764801466233, 0.021382014919147985, 0.04394283538756819, 0.16035535624371722, 0.05839383299764875, 0.09702875492368619, 0.17122101579496468, 0.24265565500026207, 0.16715540205636484, 0.14302327576911306, -0.056966429183187034, -0.07708991844170764, -0.23936365959355488, -0.14080717999113168, -0.16011078096623835, -0.004161774162686877, -0.10508534621542574, -0.1401902840521138, 0.40002382930682656, 0.15650773419720398, 0.1591769801346924, 0.1713503963365401, 0.40210350170465453, 0.05594644312786132, 0.11141116119159217, 0.12904685442698757, 0.16690883290191943, 0.0355118480359821, 0.2012288477196201, -0.16924302417077366, 0.08952912314063204, 0.015249361831380369] |
1,801.10283 | Giant photocurrent in asymmetric Weyl semimetals from the helical
magnetic effect | We propose a new type of photoresponse induced in asymmetric Weyl semimetals
in an external magnetic field. In usual symmetric Weyl semimetals in a magnetic
field, the particles and holes produced by an incident light in different Weyl
cones have opposite helicities and hence move in opposite directions, canceling
each others's contributions to the photocurrent. However this cancelation does
not occur if the Weyl semimetal possesses both a broken particle-hole symmetry
and a broken spatial inversion symmetry. We call the resulting generation of
photocurrent the helical magnetic effect because it is induced by the helicity
imbalance in a magnetic field. We find that due to the large density of states
in a magnetic field, the helical magnetic effect induces a remarkable large
photocurrent for incident THz frequency light. This suggests a potential
application of asymmetric Weyl semimetals for creating THz photosensors.
| cond-mat.mes-hall | we propose a new type of photoresponse induced in asymmetric weyl semimetals in an external magnetic field in usual symmetric weyl semimetals in a magnetic field the particles and holes produced by an incident light in different weyl cones have opposite helicities and hence move in opposite directions canceling each otherss contributions to the photocurrent however this cancelation does not occur if the weyl semimetal possesses both a broken particlehole symmetry and a broken spatial inversion symmetry we call the resulting generation of photocurrent the helical magnetic effect because it is induced by the helicity imbalance in a magnetic field we find that due to the large density of states in a magnetic field the helical magnetic effect induces a remarkable large photocurrent for incident thz frequency light this suggests a potential application of asymmetric weyl semimetals for creating thz photosensors | [['we', 'propose', 'a', 'new', 'type', 'of', 'photoresponse', 'induced', 'in', 'asymmetric', 'weyl', 'semimetals', 'in', 'an', 'external', 'magnetic', 'field', 'in', 'usual', 'symmetric', 'weyl', 'semimetals', 'in', 'a', 'magnetic', 'field', 'the', 'particles', 'and', 'holes', 'produced', 'by', 'an', 'incident', 'light', 'in', 'different', 'weyl', 'cones', 'have', 'opposite', 'helicities', 'and', 'hence', 'move', 'in', 'opposite', 'directions', 'canceling', 'each', 'otherss', 'contributions', 'to', 'the', 'photocurrent', 'however', 'this', 'cancelation', 'does', 'not', 'occur', 'if', 'the', 'weyl', 'semimetal', 'possesses', 'both', 'a', 'broken', 'particlehole', 'symmetry', 'and', 'a', 'broken', 'spatial', 'inversion', 'symmetry', 'we', 'call', 'the', 'resulting', 'generation', 'of', 'photocurrent', 'the', 'helical', 'magnetic', 'effect', 'because', 'it', 'is', 'induced', 'by', 'the', 'helicity', 'imbalance', 'in', 'a', 'magnetic', 'field', 'we', 'find', 'that', 'due', 'to', 'the', 'large', 'density', 'of', 'states', 'in', 'a', 'magnetic', 'field', 'the', 'helical', 'magnetic', 'effect', 'induces', 'a', 'remarkable', 'large', 'photocurrent', 'for', 'incident', 'thz', 'frequency', 'light', 'this', 'suggests', 'a', 'potential', 'application', 'of', 'asymmetric', 'weyl', 'semimetals', 'for', 'creating', 'thz', 'photosensors']] | [-0.2709482126836, 0.27906669787085514, -0.03516738103436572, 0.02782717898537937, -0.12084072536256696, -0.15778185178725315, 0.021678312182692543, 0.40943589487246107, -0.26102528485602566, -0.27805587514968855, -0.06526027146527277, -0.24716419520388758, -0.16235167264738784, 0.13204743092480514, -0.0003418399885829006, -0.060971848436747675, -0.06191392159089446, -0.025552046388786817, -0.09017922659986652, -0.1572961920240362, 0.30150630821008234, -0.005322594621351787, 0.3655331697780639, 0.08070789067008133, 0.06715232558947588, 0.003844355675391853, 0.0724899896104554, 0.05867434519875262, -0.030280393417186652, 0.020111196145132584, 0.18883137490733393, -0.10521640815256562, 0.19690644804920468, -0.45736982983403973, -0.18643295291944273, 0.07458645868713834, 0.14800641438092238, 0.15139907535132288, -0.1820749621306147, -0.3026427455911679, 0.054604325243937116, -0.13390105636790395, -0.157965476697843, -0.037732960190624, 0.002982861186111612, -0.045925873109704946, -0.2710931839654222, 0.066578992965099, 0.07040267082671302, 0.09762674974252669, -0.070156360670392, -0.05094140096833663, -0.1085554730862246, 0.03773250575177371, 0.13205736543417776, 0.0361029580601358, 0.1268544324919016, -0.17821954896207898, -0.1628638028300234, 0.3780009570731116, -0.05747211450112185, -0.148398965078273, 0.09725333756235029, -0.2039470564673788, -0.07704200094033564, 0.2023030117952398, 0.15172761981791286, 0.11131955918078477, -0.08514345383654083, 0.09798000790054046, -0.03950019967492803, 0.07667623174825816, 0.07083189938483493, 0.07472831174132548, 0.3394257843244954, 0.07814946754868808, 0.10060865292491923, 0.13941712406064782, -0.16470201233667986, 0.01649967365831669, -0.3005073067333017, -0.185800097343911, -0.22600892275430462, 0.0830146390754505, -0.03523832181745092, -0.21739973650047822, 0.48800026754116904, 0.15921777221207906, 0.16230366749722244, -0.09179870051864003, 0.2793186133807727, 0.13494212083252413, 0.14119467415481007, 0.07701855537015945, 0.2920263579647456, 0.17798281202059504, 0.14868525003881328, -0.27857898965012284, -0.01314700933372868, 0.009274384763557464] |
1,801.10284 | Chemical abundances of primary stars in the Sirius-like binary systems | Study of primary stars lying in Sirius-like systems with various masses of WD
companions and orbital separations is one of the key aspects to understand the
origin and nature of Barium (Ba) stars. In this paper, based on high resolution
and high S/N spectra, we present systematic analysis of photospheric abundances
for 18 FGK primary stars of Sirius-like systems including six giants and 12
dwarfs. Atmospheric parameters, stellar masses, and abundances of 24 elements
(C, Na, Mg, Al, Si, S, K, Ca, Sc, Ti, V, Cr, Mn, Fe, Co, Ni, Cu, Sr, Y, Zr, Ba,
La, Ce and Nd) are determined homogeneously. The abundance patterns in these
sample stars show that most of the elements in our sample follow the behavior
of field stars with similar metallicity. As expected, s-process elements in
four known Ba giants show overabundance. A weak correlation was found between
anomalies of s-process elemental abundance and orbital separation, suggesting
the orbital separation of the binaries could not be the main constraint to
differentiate strong Ba stars from mild Ba stars. Our study shows that the
large mass (>0.51 M ) of a WD companion in a binary system is not a sufficient
condition to form a Ba star, even if the separation between the two components
is small. Although not sufficient it seems to be a necessary condition since Ba
stars with lower mass WDs in the observed sample were not found. Our results
support that [s/Fe] and [hs/ls] ratios of Ba stars are anti-correlated with the
metallicity. However, the different levels of s-process overabundance among Ba
stars may not to be dominated mainly by the metallicity.
| astro-ph.GA astro-ph.SR | study of primary stars lying in siriuslike systems with various masses of wd companions and orbital separations is one of the key aspects to understand the origin and nature of barium ba stars in this paper based on high resolution and high sn spectra we present systematic analysis of photospheric abundances for 18 fgk primary stars of siriuslike systems including six giants and 12 dwarfs atmospheric parameters stellar masses and abundances of 24 elements c na mg al si s k ca sc ti v cr mn fe co ni cu sr y zr ba la ce and nd are determined homogeneously the abundance patterns in these sample stars show that most of the elements in our sample follow the behavior of field stars with similar metallicity as expected sprocess elements in four known ba giants show overabundance a weak correlation was found between anomalies of sprocess elemental abundance and orbital separation suggesting the orbital separation of the binaries could not be the main constraint to differentiate strong ba stars from mild ba stars our study shows that the large mass 051 m of a wd companion in a binary system is not a sufficient condition to form a ba star even if the separation between the two components is small although not sufficient it seems to be a necessary condition since ba stars with lower mass wds in the observed sample were not found our results support that sfe and hsls ratios of ba stars are anticorrelated with the metallicity however the different levels of sprocess overabundance among ba stars may not to be dominated mainly by the metallicity | [['study', 'of', 'primary', 'stars', 'lying', 'in', 'siriuslike', 'systems', 'with', 'various', 'masses', 'of', 'wd', 'companions', 'and', 'orbital', 'separations', 'is', 'one', 'of', 'the', 'key', 'aspects', 'to', 'understand', 'the', 'origin', 'and', 'nature', 'of', 'barium', 'ba', 'stars', 'in', 'this', 'paper', 'based', 'on', 'high', 'resolution', 'and', 'high', 'sn', 'spectra', 'we', 'present', 'systematic', 'analysis', 'of', 'photospheric', 'abundances', 'for', '18', 'fgk', 'primary', 'stars', 'of', 'siriuslike', 'systems', 'including', 'six', 'giants', 'and', '12', 'dwarfs', 'atmospheric', 'parameters', 'stellar', 'masses', 'and', 'abundances', 'of', '24', 'elements', 'c', 'na', 'mg', 'al', 'si', 's', 'k', 'ca', 'sc', 'ti', 'v', 'cr', 'mn', 'fe', 'co', 'ni', 'cu', 'sr', 'y', 'zr', 'ba', 'la', 'ce', 'and', 'nd', 'are', 'determined', 'homogeneously', 'the', 'abundance', 'patterns', 'in', 'these', 'sample', 'stars', 'show', 'that', 'most', 'of', 'the', 'elements', 'in', 'our', 'sample', 'follow', 'the', 'behavior', 'of', 'field', 'stars', 'with', 'similar', 'metallicity', 'as', 'expected', 'sprocess', 'elements', 'in', 'four', 'known', 'ba', 'giants', 'show', 'overabundance', 'a', 'weak', 'correlation', 'was', 'found', 'between', 'anomalies', 'of', 'sprocess', 'elemental', 'abundance', 'and', 'orbital', 'separation', 'suggesting', 'the', 'orbital', 'separation', 'of', 'the', 'binaries', 'could', 'not', 'be', 'the', 'main', 'constraint', 'to', 'differentiate', 'strong', 'ba', 'stars', 'from', 'mild', 'ba', 'stars', 'our', 'study', 'shows', 'that', 'the', 'large', 'mass', '051', 'm', 'of', 'a', 'wd', 'companion', 'in', 'a', 'binary', 'system', 'is', 'not', 'a', 'sufficient', 'condition', 'to', 'form', 'a', 'ba', 'star', 'even', 'if', 'the', 'separation', 'between', 'the', 'two', 'components', 'is', 'small', 'although', 'not', 'sufficient', 'it', 'seems', 'to', 'be', 'a', 'necessary', 'condition', 'since', 'ba', 'stars', 'with', 'lower', 'mass', 'wds', 'in', 'the', 'observed', 'sample', 'were', 'not', 'found', 'our', 'results', 'support', 'that', 'sfe', 'and', 'hsls', 'ratios', 'of', 'ba', 'stars', 'are', 'anticorrelated', 'with', 'the', 'metallicity', 'however', 'the', 'different', 'levels', 'of', 'sprocess', 'overabundance', 'among', 'ba', 'stars', 'may', 'not', 'to', 'be', 'dominated', 'mainly', 'by', 'the', 'metallicity']] | [-0.08192424157944818, 0.16614874025065177, 0.012724873130382211, 0.09384234957828153, -0.029527306319559337, -0.10997177840348471, 0.10068726813834575, 0.3967584852612129, -0.1563240049876859, -0.36919693997888653, -0.04721019296967252, -0.3241483383639543, -0.021029309498974018, 0.1366591941608392, -0.08143318883397754, -0.0741823562080282, 0.11581689254078945, -0.032636515607333015, -0.10562003177452695, -0.3126176441584162, 0.324254241399467, 0.02528356795187897, 0.1552139708944769, -0.05236901639296708, -0.054923762005529606, -0.15339827804429526, -0.0010792827889047286, 0.010608813991011292, -0.11020458044990342, 0.03644915425813654, 0.2542016077036452, 0.15766825377466848, 0.14956302328759596, -0.3084225780740477, -0.17627925228788863, 0.038092408214126613, 0.19803214492146962, 0.03431335728037758, -0.11819522522122565, -0.21068054051267812, 0.14368961648325676, -0.1288626822817605, -0.14322985451780604, 0.02694892875884694, 0.07047256064402906, 0.07299878603338988, -0.28677649356239404, 0.05479212791779665, 0.12305362385835636, 0.16476162028999103, -0.11490439078684345, -0.2282852867419866, -0.12202582363582527, 0.043571332936968514, 0.027704102321338183, 0.007497732845755915, 0.09194234925736156, -0.013471450975716667, 0.03019271722360928, 0.4332996619451377, -0.12929396260857445, -0.0084316670449442, 0.23556259693319184, -0.21923209496221885, -0.18627023004788767, 0.11886759353025506, 0.1177257668606385, 0.17226076709511862, -0.20637665598963698, 0.03474123302191772, 0.03214065764375307, 0.24228203852350513, 0.058491811941699036, 0.07299683263214926, 0.29661444445416607, 0.11551241590382738, 0.02668515696959393, -0.04023649605655077, -0.2182778740060274, -0.020400296331219443, -0.17356405289222795, -0.18156362277697083, -0.10024804649270933, 0.06720003083815014, -0.14323569196578184, -0.15306921453318661, 0.27883957368601975, 0.09313200126117509, 0.24451330703579718, -0.04601162727620384, 0.24481699441180185, 0.06971873439270658, 0.0843226963822316, 0.08952760975635438, 0.30069968972907024, 0.2670068554390498, 0.12334555621189927, -0.29367823092853307, 0.13958794676043368, 0.026294803081287278] |
1,801.10285 | Optimal Configurations in Coverage Control with Polynomial Costs | We revisit the static coverage control problem for placement of vehicles with
simple motion on the real line, under the assumption that the cost is a
polynomial function of the locations of the vehicles. The main contribution of
this paper is to demonstrate the use of tools from numerical algebraic
geometry, in particular, a numerical polynomial homotopy continuation method
that guarantees to find all solutions of polynomial equations, in order to
characterize the \emph{global minima} for the coverage control problem. The
results are then compared against a classic distributed approach involving the
use of Lloyd descent, which is known to converge only to a local minimum under
certain technical conditions.
| cs.SY math.AG math.OC | we revisit the static coverage control problem for placement of vehicles with simple motion on the real line under the assumption that the cost is a polynomial function of the locations of the vehicles the main contribution of this paper is to demonstrate the use of tools from numerical algebraic geometry in particular a numerical polynomial homotopy continuation method that guarantees to find all solutions of polynomial equations in order to characterize the emphglobal minima for the coverage control problem the results are then compared against a classic distributed approach involving the use of lloyd descent which is known to converge only to a local minimum under certain technical conditions | [['we', 'revisit', 'the', 'static', 'coverage', 'control', 'problem', 'for', 'placement', 'of', 'vehicles', 'with', 'simple', 'motion', 'on', 'the', 'real', 'line', 'under', 'the', 'assumption', 'that', 'the', 'cost', 'is', 'a', 'polynomial', 'function', 'of', 'the', 'locations', 'of', 'the', 'vehicles', 'the', 'main', 'contribution', 'of', 'this', 'paper', 'is', 'to', 'demonstrate', 'the', 'use', 'of', 'tools', 'from', 'numerical', 'algebraic', 'geometry', 'in', 'particular', 'a', 'numerical', 'polynomial', 'homotopy', 'continuation', 'method', 'that', 'guarantees', 'to', 'find', 'all', 'solutions', 'of', 'polynomial', 'equations', 'in', 'order', 'to', 'characterize', 'the', 'emphglobal', 'minima', 'for', 'the', 'coverage', 'control', 'problem', 'the', 'results', 'are', 'then', 'compared', 'against', 'a', 'classic', 'distributed', 'approach', 'involving', 'the', 'use', 'of', 'lloyd', 'descent', 'which', 'is', 'known', 'to', 'converge', 'only', 'to', 'a', 'local', 'minimum', 'under', 'certain', 'technical', 'conditions']] | [-0.13708762435919858, -0.019834761713123455, -0.08654106137427417, 0.04106032316445966, -0.07578404485036365, -0.10446098441766068, 0.05418988254704428, 0.336060657968152, -0.3010434241711416, -0.2826751548246565, 0.13149890638041226, -0.2404317906888371, -0.17341278058963575, 0.20182863348586993, -0.12450292695483023, 0.07883445272984152, 0.058726017854430455, 0.04590399548919363, -0.07124517784779362, -0.27821641252799467, 0.31353221085472877, 0.009721647575497627, 0.27651656566082566, 0.04352707287444818, 0.10039852858436378, -0.004883134149184281, -0.0018536114895885642, 0.038038703342053025, -0.13048335897209737, 0.11992652926975014, 0.24185621856119144, 0.1422800107816742, 0.2947422963270748, -0.4213609807023948, -0.1660030170428482, 0.13545509318672969, 0.12669995537197049, 0.10415874755920165, -0.03642297129951079, -0.24508713316172362, 0.15408913497389717, -0.12470579561354085, -0.1542614465748722, -0.06561780719467523, -0.01898278008553792, 0.08869116037914698, -0.3120795452459292, 0.003775519450110468, 0.025945177496495574, 0.050778924948959185, -0.09643411380238831, -0.06336816003524952, 0.03353944243863225, 0.11390197631606663, 0.06642594158818776, 0.007095490650019862, 0.10080387274819341, -0.11597068508324976, -0.12069895231503655, 0.3960658085109158, -0.022944754333531655, -0.2488423582653261, 0.1754004452038895, -0.08924392620313236, -0.1367988066070459, 0.1356001195053316, 0.16168648051521317, 0.17406762227924033, -0.14940054885281082, 0.10494074205317619, -0.06468505652314475, 0.12886606739325956, 0.06372915975834158, -0.01427056157368828, 0.1045834448019212, 0.12696290772027252, 0.20066281407224862, 0.15108997344081712, -0.05405516742347655, -0.1484030260323462, -0.3253249582495879, -0.11944113711149178, -0.17999408953420987, 0.029823909300929784, -0.09232594195584004, -0.18498967188325796, 0.40849254056811335, 0.17454815823584796, 0.16609045325947755, 0.1500604901050048, 0.3386943989327516, 0.12958848655848257, 0.01017585493708876, 0.08971418502571231, 0.21724865649064834, 0.11830059095412832, 0.09258071102455935, -0.23239186297128486, 0.07407662312669511, 0.10367855834351344] |
1,801.10286 | Unconventional superconductivity and Surface pairing symmetry in
Half-Heusler Compounds | Signatures of nodal line/point superconductivity have been observed in
half-Heusler compounds, such as LnPtBi (Ln = Y, Lu). Topologically non-trivial
band structures, as well as topological surface states, has also been confirmed
by angular-resolved photoemission spectroscopy in these compounds. In this
work, we present a systematical classification of possible gap functions of
bulk states and surface states in half-Heusler compounds and the corresponding
topological properties based on the representations of crystalline symmetry
group. Different from all the previous studies based on four band Luttinger
model, our study starts with the six-band Kane model, which involves both four
p-orbital type of {\Gamma}8 bands and two s-orbital type of {\Gamma}6 bands.
Although the {\Gamma}6 bands are away from the Fermi energy, our results reveal
the importance of topological surface states, which originate from the band
inversion between {\Gamma}6 and {\Gamma}8 bands, in determining surface
properties of these compounds in the superconducting regime by combining
topological bulk state picture and non-trivial surface state picture.
| cond-mat.supr-con cond-mat.mes-hall | signatures of nodal linepoint superconductivity have been observed in halfheusler compounds such as lnptbi ln y lu topologically nontrivial band structures as well as topological surface states has also been confirmed by angularresolved photoemission spectroscopy in these compounds in this work we present a systematical classification of possible gap functions of bulk states and surface states in halfheusler compounds and the corresponding topological properties based on the representations of crystalline symmetry group different from all the previous studies based on four band luttinger model our study starts with the sixband kane model which involves both four porbital type of gamma8 bands and two sorbital type of gamma6 bands although the gamma6 bands are away from the fermi energy our results reveal the importance of topological surface states which originate from the band inversion between gamma6 and gamma8 bands in determining surface properties of these compounds in the superconducting regime by combining topological bulk state picture and nontrivial surface state picture | [['signatures', 'of', 'nodal', 'linepoint', 'superconductivity', 'have', 'been', 'observed', 'in', 'halfheusler', 'compounds', 'such', 'as', 'lnptbi', 'ln', 'y', 'lu', 'topologically', 'nontrivial', 'band', 'structures', 'as', 'well', 'as', 'topological', 'surface', 'states', 'has', 'also', 'been', 'confirmed', 'by', 'angularresolved', 'photoemission', 'spectroscopy', 'in', 'these', 'compounds', 'in', 'this', 'work', 'we', 'present', 'a', 'systematical', 'classification', 'of', 'possible', 'gap', 'functions', 'of', 'bulk', 'states', 'and', 'surface', 'states', 'in', 'halfheusler', 'compounds', 'and', 'the', 'corresponding', 'topological', 'properties', 'based', 'on', 'the', 'representations', 'of', 'crystalline', 'symmetry', 'group', 'different', 'from', 'all', 'the', 'previous', 'studies', 'based', 'on', 'four', 'band', 'luttinger', 'model', 'our', 'study', 'starts', 'with', 'the', 'sixband', 'kane', 'model', 'which', 'involves', 'both', 'four', 'porbital', 'type', 'of', 'gamma8', 'bands', 'and', 'two', 'sorbital', 'type', 'of', 'gamma6', 'bands', 'although', 'the', 'gamma6', 'bands', 'are', 'away', 'from', 'the', 'fermi', 'energy', 'our', 'results', 'reveal', 'the', 'importance', 'of', 'topological', 'surface', 'states', 'which', 'originate', 'from', 'the', 'band', 'inversion', 'between', 'gamma6', 'and', 'gamma8', 'bands', 'in', 'determining', 'surface', 'properties', 'of', 'these', 'compounds', 'in', 'the', 'superconducting', 'regime', 'by', 'combining', 'topological', 'bulk', 'state', 'picture', 'and', 'nontrivial', 'surface', 'state', 'picture']] | [-0.14291579512064345, 0.16234768258582336, -0.06541486936621368, 0.0234858394767798, -0.01875506791402586, -0.13996916279138533, 0.12998917559016263, 0.37361226528082625, -0.24205074400815646, -0.29677626440825405, 0.01817822548619006, -0.3539609595783986, -0.1691052733483957, 0.17229551861819345, 0.038303523007198234, 0.033399273683608045, -0.018034428528903846, -0.08761346970131853, -0.14660632545455882, -0.18336102647676852, 0.3533295330242254, -0.0306768451933749, 0.3235577550382004, 0.07039298978197621, -0.028811524881166405, -0.028203980922990014, 0.07639200141711626, 0.0066786247509298844, -0.14720561505528168, 0.0775756339993677, 0.2809140265540918, -0.0813712073257193, 0.13664837783871916, -0.4260831876192242, -0.26458057477721014, -0.017557079897960647, 0.09887038283923175, 0.10078053386969259, -0.05207985363667831, -0.32232206923654305, 0.057647697534412144, -0.14221526422334135, -0.09378985826624557, -0.11141206796746701, -0.011584207174018956, -0.04331465091236168, -0.12954193432233296, 0.09757651918753255, 0.036214607906867965, 0.10665979485784191, -0.1431477596401237, -0.18717804895713924, -0.16075094853440533, 0.06281488842214458, 0.07398009250027826, 0.01340518834622344, 0.05909547786359326, -0.10557748637947953, -0.14457268426776865, 0.3693455896311207, -0.05326512012979947, -0.06603817863506264, 0.21793823461339343, -0.16304356176406146, -0.13707448364584707, 0.15558678688830696, 0.0862057103367988, 0.10034705489815679, -0.09323698533116839, 0.13130969982266832, -0.05599047967698425, 0.14418439852888695, 0.00260443220322486, 0.14318089707667242, 0.2541510390583426, 0.15051414100889815, 0.01787741574953543, 0.0954532227551681, -0.13678611612922395, -0.005106381912264623, -0.24003958434186642, -0.1994392878143117, -0.2516933430502831, 0.02929575232119532, 0.003959174582359992, -0.18612578574088728, 0.4709935537655838, 0.05732906700286548, 0.19916803114610956, -0.0638400869225734, 0.16473997400971713, 0.07146778625246952, 0.06067888068064349, 0.05869760935311206, 0.2463153678632807, 0.14273710638226475, 0.023908089060569182, -0.24312706232230993, 0.040635376528371125, 0.06591381292673759] |
1,801.10287 | An Incremental Off-policy Search in a Model-free Markov Decision Process
Using a Single Sample Path | In this paper, we consider a modified version of the control problem in a
model free Markov decision process (MDP) setting with large state and action
spaces. The control problem most commonly addressed in the contemporary
literature is to find an optimal policy which maximizes the value function,
i.e., the long run discounted reward of the MDP. The current settings also
assume access to a generative model of the MDP with the hidden premise that
observations of the system behaviour in the form of sample trajectories can be
obtained with ease from the model. In this paper, we consider a modified
version, where the cost function is the expectation of a non-convex function of
the value function without access to the generative model. Rather, we assume
that a sample trajectory generated using a priori chosen behaviour policy is
made available. In this restricted setting, we solve the modified control
problem in its true sense, i.e., to find the best possible policy given this
limited information. We propose a stochastic approximation algorithm based on
the well-known cross entropy method which is data (sample trajectory)
efficient, stable, robust as well as computationally and storage efficient. We
provide a proof of convergence of our algorithm to a policy which is globally
optimal relative to the behaviour policy. We also present experimental results
to corroborate our claims and we demonstrate the superiority of the solution
produced by our algorithm compared to the state-of-the-art algorithms under
appropriately chosen behaviour policy.
| cs.AI | in this paper we consider a modified version of the control problem in a model free markov decision process mdp setting with large state and action spaces the control problem most commonly addressed in the contemporary literature is to find an optimal policy which maximizes the value function ie the long run discounted reward of the mdp the current settings also assume access to a generative model of the mdp with the hidden premise that observations of the system behaviour in the form of sample trajectories can be obtained with ease from the model in this paper we consider a modified version where the cost function is the expectation of a nonconvex function of the value function without access to the generative model rather we assume that a sample trajectory generated using a priori chosen behaviour policy is made available in this restricted setting we solve the modified control problem in its true sense ie to find the best possible policy given this limited information we propose a stochastic approximation algorithm based on the wellknown cross entropy method which is data sample trajectory efficient stable robust as well as computationally and storage efficient we provide a proof of convergence of our algorithm to a policy which is globally optimal relative to the behaviour policy we also present experimental results to corroborate our claims and we demonstrate the superiority of the solution produced by our algorithm compared to the stateoftheart algorithms under appropriately chosen behaviour policy | [['in', 'this', 'paper', 'we', 'consider', 'a', 'modified', 'version', 'of', 'the', 'control', 'problem', 'in', 'a', 'model', 'free', 'markov', 'decision', 'process', 'mdp', 'setting', 'with', 'large', 'state', 'and', 'action', 'spaces', 'the', 'control', 'problem', 'most', 'commonly', 'addressed', 'in', 'the', 'contemporary', 'literature', 'is', 'to', 'find', 'an', 'optimal', 'policy', 'which', 'maximizes', 'the', 'value', 'function', 'ie', 'the', 'long', 'run', 'discounted', 'reward', 'of', 'the', 'mdp', 'the', 'current', 'settings', 'also', 'assume', 'access', 'to', 'a', 'generative', 'model', 'of', 'the', 'mdp', 'with', 'the', 'hidden', 'premise', 'that', 'observations', 'of', 'the', 'system', 'behaviour', 'in', 'the', 'form', 'of', 'sample', 'trajectories', 'can', 'be', 'obtained', 'with', 'ease', 'from', 'the', 'model', 'in', 'this', 'paper', 'we', 'consider', 'a', 'modified', 'version', 'where', 'the', 'cost', 'function', 'is', 'the', 'expectation', 'of', 'a', 'nonconvex', 'function', 'of', 'the', 'value', 'function', 'without', 'access', 'to', 'the', 'generative', 'model', 'rather', 'we', 'assume', 'that', 'a', 'sample', 'trajectory', 'generated', 'using', 'a', 'priori', 'chosen', 'behaviour', 'policy', 'is', 'made', 'available', 'in', 'this', 'restricted', 'setting', 'we', 'solve', 'the', 'modified', 'control', 'problem', 'in', 'its', 'true', 'sense', 'ie', 'to', 'find', 'the', 'best', 'possible', 'policy', 'given', 'this', 'limited', 'information', 'we', 'propose', 'a', 'stochastic', 'approximation', 'algorithm', 'based', 'on', 'the', 'wellknown', 'cross', 'entropy', 'method', 'which', 'is', 'data', 'sample', 'trajectory', 'efficient', 'stable', 'robust', 'as', 'well', 'as', 'computationally', 'and', 'storage', 'efficient', 'we', 'provide', 'a', 'proof', 'of', 'convergence', 'of', 'our', 'algorithm', 'to', 'a', 'policy', 'which', 'is', 'globally', 'optimal', 'relative', 'to', 'the', 'behaviour', 'policy', 'we', 'also', 'present', 'experimental', 'results', 'to', 'corroborate', 'our', 'claims', 'and', 'we', 'demonstrate', 'the', 'superiority', 'of', 'the', 'solution', 'produced', 'by', 'our', 'algorithm', 'compared', 'to', 'the', 'stateoftheart', 'algorithms', 'under', 'appropriately', 'chosen', 'behaviour', 'policy']] | [-0.06910355791962725, 0.00958329401963761, -0.10568633235192725, 0.07656627417502988, -0.09763750250508287, -0.12932425753726642, 0.10373041838863674, 0.41495124471887035, -0.3086203844143952, -0.3009123730340174, 0.12170746111149462, -0.228272891966436, -0.157311382498212, 0.17528468809869824, -0.11097357724983321, 0.10646497933597932, 0.08679675947095515, 0.0561915266366761, -0.02862331672162958, -0.25987568936044614, 0.2993579478967669, 0.0765187157774154, 0.310068243845575, -0.009372400786319025, 0.14385023962620797, 0.018871023477416256, 0.020446198378518528, 0.027795652239298335, -0.12439939399583655, 0.113288865301625, 0.2545994316541343, 0.17821555543424827, 0.3364191916866266, -0.38241570065779806, -0.18282399645493347, 0.1330894051965478, 0.10933233985275848, 0.11464047281651245, -0.04067361376352836, -0.26610952635884894, 0.08761980024603556, -0.17678479943139364, -0.09895180116920752, -0.054001963280179366, -0.05904054355484491, 0.0008775557752470581, -0.35309188060690555, 0.028780554080315466, 0.028507764036773124, -0.006131594335394246, -0.0954947600459528, -0.09773605957494251, 0.032749910536697326, 0.09952473458929026, 0.07270346890971045, 0.049069863534294905, 0.12322852249656405, -0.12383822977770956, -0.14932318077641255, 0.35655550639316136, -0.08275086507011128, -0.2342943821206917, 0.13128000018376934, -0.0874860552063554, -0.12285798064537574, 0.10882163007686636, 0.20463613248691534, 0.1802528404583204, -0.16930906335462112, 0.0741521409268453, -0.0776172647613804, 0.17274627374599175, -0.022946984232973536, 0.013730814842013071, 0.11423381682300028, 0.20471620025227263, 0.11783487476142389, 0.18354943660420497, -0.03316584268907959, -0.15826092890881915, -0.2924975612956308, -0.12056294262067092, -0.1984020356164903, 0.02165115133393556, -0.08315682780283874, -0.16500844752454027, 0.35771685762577976, 0.21754401716574723, 0.2064224384306949, 0.1346567045873487, 0.3183066640201272, 0.14221860698604843, 0.027566485031156288, 0.1353734219503798, 0.21563833871077062, 0.03884508026839823, 0.10319144217563526, -0.21605617941585276, 0.1388736115160341, 0.052442906793130906] |
1,801.10288 | Visually Explainable Recommendation | Images account for a significant part of user decisions in many application
scenarios, such as product images in e-commerce, or user image posts in social
networks. It is intuitive that user preferences on the visual patterns of image
(e.g., hue, texture, color, etc) can be highly personalized, and this provides
us with highly discriminative features to make personalized recommendations.
Previous work that takes advantage of images for recommendation usually
transforms the images into latent representation vectors, which are adopted by
a recommendation component to assist personalized user/item profiling and
recommendation. However, such vectors are hardly useful in terms of providing
visual explanations to users about why a particular item is recommended, and
thus weakens the explainability of recommendation systems.
As a step towards explainable recommendation models, we propose visually
explainable recommendation based on attentive neural networks to model the user
attention on images, under the supervision of both implicit feedback and
textual reviews. By this, we can not only provide recommendation results to the
users, but also tell the users why an item is recommended by providing
intuitive visual highlights in a personalized manner. Experimental results show
that our models are not only able to improve the recommendation performance,
but also can provide persuasive visual explanations for the users to take the
recommendations.
| cs.IR cs.MM | images account for a significant part of user decisions in many application scenarios such as product images in ecommerce or user image posts in social networks it is intuitive that user preferences on the visual patterns of image eg hue texture color etc can be highly personalized and this provides us with highly discriminative features to make personalized recommendations previous work that takes advantage of images for recommendation usually transforms the images into latent representation vectors which are adopted by a recommendation component to assist personalized useritem profiling and recommendation however such vectors are hardly useful in terms of providing visual explanations to users about why a particular item is recommended and thus weakens the explainability of recommendation systems as a step towards explainable recommendation models we propose visually explainable recommendation based on attentive neural networks to model the user attention on images under the supervision of both implicit feedback and textual reviews by this we can not only provide recommendation results to the users but also tell the users why an item is recommended by providing intuitive visual highlights in a personalized manner experimental results show that our models are not only able to improve the recommendation performance but also can provide persuasive visual explanations for the users to take the recommendations | [['images', 'account', 'for', 'a', 'significant', 'part', 'of', 'user', 'decisions', 'in', 'many', 'application', 'scenarios', 'such', 'as', 'product', 'images', 'in', 'ecommerce', 'or', 'user', 'image', 'posts', 'in', 'social', 'networks', 'it', 'is', 'intuitive', 'that', 'user', 'preferences', 'on', 'the', 'visual', 'patterns', 'of', 'image', 'eg', 'hue', 'texture', 'color', 'etc', 'can', 'be', 'highly', 'personalized', 'and', 'this', 'provides', 'us', 'with', 'highly', 'discriminative', 'features', 'to', 'make', 'personalized', 'recommendations', 'previous', 'work', 'that', 'takes', 'advantage', 'of', 'images', 'for', 'recommendation', 'usually', 'transforms', 'the', 'images', 'into', 'latent', 'representation', 'vectors', 'which', 'are', 'adopted', 'by', 'a', 'recommendation', 'component', 'to', 'assist', 'personalized', 'useritem', 'profiling', 'and', 'recommendation', 'however', 'such', 'vectors', 'are', 'hardly', 'useful', 'in', 'terms', 'of', 'providing', 'visual', 'explanations', 'to', 'users', 'about', 'why', 'a', 'particular', 'item', 'is', 'recommended', 'and', 'thus', 'weakens', 'the', 'explainability', 'of', 'recommendation', 'systems', 'as', 'a', 'step', 'towards', 'explainable', 'recommendation', 'models', 'we', 'propose', 'visually', 'explainable', 'recommendation', 'based', 'on', 'attentive', 'neural', 'networks', 'to', 'model', 'the', 'user', 'attention', 'on', 'images', 'under', 'the', 'supervision', 'of', 'both', 'implicit', 'feedback', 'and', 'textual', 'reviews', 'by', 'this', 'we', 'can', 'not', 'only', 'provide', 'recommendation', 'results', 'to', 'the', 'users', 'but', 'also', 'tell', 'the', 'users', 'why', 'an', 'item', 'is', 'recommended', 'by', 'providing', 'intuitive', 'visual', 'highlights', 'in', 'a', 'personalized', 'manner', 'experimental', 'results', 'show', 'that', 'our', 'models', 'are', 'not', 'only', 'able', 'to', 'improve', 'the', 'recommendation', 'performance', 'but', 'also', 'can', 'provide', 'persuasive', 'visual', 'explanations', 'for', 'the', 'users', 'to', 'take', 'the', 'recommendations']] | [-0.03446075393153713, -0.012819654727395637, -0.06711082707898158, 0.10440599931318732, -0.2340562553647818, -0.21465882119676755, 0.07822004840228304, 0.5043959265111337, -0.22301308991509913, -0.3144344925932901, 0.03303852276030098, -0.33846361109956297, -0.21762968026136567, 0.15789006032626812, -0.15900449934407493, -0.0007279717271596613, 0.09814541771496371, 0.10217494190426789, -0.02895567584957735, -0.33308165765502995, 0.3092441713839699, 0.07227317170576661, 0.3192143942964014, 0.07707398317775038, 0.07227255753350789, 0.004804964707464749, -0.08438932471605293, -0.017830050965233272, -0.04156496877966644, 0.17406319854934066, 0.4122439594298862, 0.25028895440472054, 0.33018748192859926, -0.40624030874036426, -0.23977421967426377, 0.03577863886961145, 0.18131338209786918, 0.08220493886127911, -0.09413798908105103, -0.36809428485696305, 0.08885458374544629, -0.20184651646706245, 0.05110398919798189, -0.16593005544229458, -0.000295258224165688, -0.014857862800185308, -0.3302107155650959, -0.005471243269734976, 0.10051579946327403, 0.06402085803256768, -0.05619509041499556, -0.10929188873081035, 0.023604117422430237, 0.2276327628904665, 0.07681296618071608, 0.002344576680175785, 0.15280491883534186, -0.22448761197148073, -0.13676860599621185, 0.44241551819646585, 0.003170917986809088, -0.22533743149486693, 0.1779323566580375, -0.03365081421672388, -0.12931048842294562, 0.0838455058406916, 0.23945325643082144, 0.061192575285753385, -0.18797482108968383, -0.06891815505261607, -0.07648371640557834, 0.21149181993678212, 0.013943481415361517, 0.010142534343796857, 0.23948391155720178, 0.19959036307518715, 0.04317630221274738, 0.07082772559290665, -0.01915433236721361, -0.030862421775264052, -0.15607264642210178, -0.13744422446219295, -0.15005538524718773, -0.004044794510178784, -0.13962713327283965, -0.13323823447850808, 0.4224289611043155, 0.2776007054618477, 0.2133028499733989, 0.05463398683831498, 0.35438474281275634, 0.04316786292010149, 0.10658159653083399, 0.03928111704118865, 0.13147977332446828, -0.05719825759761805, 0.18950320842584045, -0.1042838083889484, 0.18484845519078974, 0.037617169519527836] |
1,801.10289 | Topological Flat Band and Parity-Time Symmetry in a Honeycomb Lattice of
Coupled Resonant Optical Waveguides | Two-dimensional (2D) coupled resonant optical waveguide (CROW), exhibiting
topological edge states, provides an efficient platform for designing
integrated topological photonic devices. In this paper, we propose an
experimentally feasible design of 2D honeycomb CROW photonic structure. The
characteristic optical system possesses two-fold and three-fold Dirac points at
different positions in the Brillouin zone. The effective gauge fields
implemented by the intrinsic pseudo-spin-orbit interaction open up
topologically nontrivial bandgaps through the Dirac points. Spatial lattice
geometries allow destructive wave interference, leading to a dispersionless,
nearly-flat energy band in the vicinity of the three-fold Dirac point in the
telecommunication frequency regime. This nontrivial nearly-flat band yields
topologically protected edge states. The pertinent physical effects brought
about due to non-Hermitian gain/loss medium into the honeycomb CROW device are
discussed. The generalized gain-loss lattice with parity-time symmetry
decouples the gain and the loss at opposite zigzag edges, leading to purely
gain or loss edge channels. Meanwhile, the gain and loss effects on the
armchair boundary cancel each other, giving rise to dissipationless edge states
in non-Hermitian optical systems. These characteristics underpin the
fundamental importance as well as the potential applications in various optical
devices such as polarizers, optical couplers, beam splitters and slow light
delay lines.
| physics.optics | twodimensional 2d coupled resonant optical waveguide crow exhibiting topological edge states provides an efficient platform for designing integrated topological photonic devices in this paper we propose an experimentally feasible design of 2d honeycomb crow photonic structure the characteristic optical system possesses twofold and threefold dirac points at different positions in the brillouin zone the effective gauge fields implemented by the intrinsic pseudospinorbit interaction open up topologically nontrivial bandgaps through the dirac points spatial lattice geometries allow destructive wave interference leading to a dispersionless nearlyflat energy band in the vicinity of the threefold dirac point in the telecommunication frequency regime this nontrivial nearlyflat band yields topologically protected edge states the pertinent physical effects brought about due to nonhermitian gainloss medium into the honeycomb crow device are discussed the generalized gainloss lattice with paritytime symmetry decouples the gain and the loss at opposite zigzag edges leading to purely gain or loss edge channels meanwhile the gain and loss effects on the armchair boundary cancel each other giving rise to dissipationless edge states in nonhermitian optical systems these characteristics underpin the fundamental importance as well as the potential applications in various optical devices such as polarizers optical couplers beam splitters and slow light delay lines | [['twodimensional', '2d', 'coupled', 'resonant', 'optical', 'waveguide', 'crow', 'exhibiting', 'topological', 'edge', 'states', 'provides', 'an', 'efficient', 'platform', 'for', 'designing', 'integrated', 'topological', 'photonic', 'devices', 'in', 'this', 'paper', 'we', 'propose', 'an', 'experimentally', 'feasible', 'design', 'of', '2d', 'honeycomb', 'crow', 'photonic', 'structure', 'the', 'characteristic', 'optical', 'system', 'possesses', 'twofold', 'and', 'threefold', 'dirac', 'points', 'at', 'different', 'positions', 'in', 'the', 'brillouin', 'zone', 'the', 'effective', 'gauge', 'fields', 'implemented', 'by', 'the', 'intrinsic', 'pseudospinorbit', 'interaction', 'open', 'up', 'topologically', 'nontrivial', 'bandgaps', 'through', 'the', 'dirac', 'points', 'spatial', 'lattice', 'geometries', 'allow', 'destructive', 'wave', 'interference', 'leading', 'to', 'a', 'dispersionless', 'nearlyflat', 'energy', 'band', 'in', 'the', 'vicinity', 'of', 'the', 'threefold', 'dirac', 'point', 'in', 'the', 'telecommunication', 'frequency', 'regime', 'this', 'nontrivial', 'nearlyflat', 'band', 'yields', 'topologically', 'protected', 'edge', 'states', 'the', 'pertinent', 'physical', 'effects', 'brought', 'about', 'due', 'to', 'nonhermitian', 'gainloss', 'medium', 'into', 'the', 'honeycomb', 'crow', 'device', 'are', 'discussed', 'the', 'generalized', 'gainloss', 'lattice', 'with', 'paritytime', 'symmetry', 'decouples', 'the', 'gain', 'and', 'the', 'loss', 'at', 'opposite', 'zigzag', 'edges', 'leading', 'to', 'purely', 'gain', 'or', 'loss', 'edge', 'channels', 'meanwhile', 'the', 'gain', 'and', 'loss', 'effects', 'on', 'the', 'armchair', 'boundary', 'cancel', 'each', 'other', 'giving', 'rise', 'to', 'dissipationless', 'edge', 'states', 'in', 'nonhermitian', 'optical', 'systems', 'these', 'characteristics', 'underpin', 'the', 'fundamental', 'importance', 'as', 'well', 'as', 'the', 'potential', 'applications', 'in', 'various', 'optical', 'devices', 'such', 'as', 'polarizers', 'optical', 'couplers', 'beam', 'splitters', 'and', 'slow', 'light', 'delay', 'lines']] | [-0.25257258215172235, 0.16362158949144004, -0.015041563934231601, -0.008579333740434065, -0.08545430759538546, -0.2365987584626505, 0.06635562237179239, 0.465508949318163, -0.2746785688306214, -0.2464937317683039, 0.012939591554343922, -0.3054673220261489, -0.19366247131429282, 0.14154432691739743, 0.019880804364652473, 0.1105234627073082, 0.008336190297959907, -0.09351662226427014, -0.06061389001785422, -0.15505664737198943, 0.29862094227464336, 0.009575301060328573, 0.3656147714695054, 0.09218253272050751, 0.03140486892437249, 0.03936164849898824, 0.08959181296712912, -0.05810435822736103, -0.09353110364622132, 0.08022254873049851, 0.25809494120392734, -0.1237781731472904, 0.18220569760225122, -0.47811587977379855, -0.22352683419675226, 0.02497386418186165, 0.1739501564297825, 0.15198864056878622, -0.06939128081897494, -0.3150396628932345, 0.009124087497112479, -0.12442823042741534, -0.19116424008587832, -0.04672455320153201, -0.02190157106505836, -0.06135651783782546, -0.186499536943698, 0.0191045831190134, 0.022063457753997998, 0.04890786081156002, -0.021716384136026938, -0.09471433954186609, -0.1320152084434193, 0.06622884789882873, -0.048873443157057106, -0.03125538194314623, 0.12025717040350993, -0.12010238266845077, -0.17838912387839564, 0.43948598519845933, -0.014919861950588847, -0.14960555106027992, 0.16059475630696973, -0.10562051671020005, 0.003980774374789383, 0.18712706116977895, 0.1955754205856546, 0.005641625574006155, -0.09810725811812428, 0.05952870768683935, 0.009962170666713604, 0.12111578032441811, 0.10790599675245104, 0.2051588814730968, 0.28826563140045447, 0.1521642294315861, 0.10868684511624811, 0.15594533682826187, -0.072975614269513, -0.0712070701710677, -0.26690439967493906, -0.13688545596456192, -0.2072529660902069, 0.05339783320275751, -0.09670991237744421, -0.1910082877885624, 0.47541239839231614, 0.11843458854473464, 0.16006375175075477, -0.07176488919510958, 0.2799199095346255, 0.15713103769155737, 0.09252667454264984, 0.05557170007962821, 0.28626870521169046, 0.14717166100070803, 0.11589875143242649, -0.2689026036590227, -0.07837680271725253, 0.003241565933746129] |
1,801.1029 | From Sticky-Hard-Sphere to Lennard-Jones-Type Clusters | A relation $\mathcal{M}_{\mathrm{SHS}\to\mathrm{LJ}}$ between the set of
non-isomorphic sticky hard sphere clusters $\mathcal{M}_\mathrm{SHS}$ and the
sets of local energy minima $\mathcal{M}_{LJ}$ of the $(m,n)$-Lennard-Jones
potential $V^\mathrm{LJ}_{mn}(r) = \frac{\varepsilon}{n-m} [ m r^{-n} - n
r^{-m} ]$ is established. The number of nonisomorphic stable clusters depends
strongly and nontrivially on both $m$ and $n$, and increases exponentially with
increasing cluster size $N$ for $N \gtrsim 10$. While the map from
$\mathcal{M}_\mathrm{SHS}\to \mathcal{M}_{\mathrm{SHS}\to\mathrm{LJ}}$ is
non-injective and non-surjective, the number of Lennard-Jones structures
missing from the map is relatively small for cluster sizes up to $N=13$, and
most of the missing structures correspond to energetically unfavourable minima
even for fairly low $(m,n)$. Furthermore, even the softest Lennard-Jones
potential predicts that the coordination of 13 spheres around a central sphere
is problematic (the Gregory-Newton problem). A more realistic extended
Lennard-Jones potential chosen from coupled-cluster calculations for a rare gas
dimer leads to a substantial increase in the number of nonisomorphic clusters,
even though the potential curve is very similar to a (6,12)-Lennard-Jones
potential.
| physics.atm-clus | a relation mathcalm_mathrmshstomathrmlj between the set of nonisomorphic sticky hard sphere clusters mathcalm_mathrmshs and the sets of local energy minima mathcalm_lj of the mnlennardjones potential vmathrmlj_mnr fracvarepsilonnm m rn n rm is established the number of nonisomorphic stable clusters depends strongly and nontrivially on both m and n and increases exponentially with increasing cluster size n for n gtrsim 10 while the map from mathcalm_mathrmshsto mathcalm_mathrmshstomathrmlj is noninjective and nonsurjective the number of lennardjones structures missing from the map is relatively small for cluster sizes up to n13 and most of the missing structures correspond to energetically unfavourable minima even for fairly low mn furthermore even the softest lennardjones potential predicts that the coordination of 13 spheres around a central sphere is problematic the gregorynewton problem a more realistic extended lennardjones potential chosen from coupledcluster calculations for a rare gas dimer leads to a substantial increase in the number of nonisomorphic clusters even though the potential curve is very similar to a 612lennardjones potential | [['a', 'relation', 'mathcalm_mathrmshstomathrmlj', 'between', 'the', 'set', 'of', 'nonisomorphic', 'sticky', 'hard', 'sphere', 'clusters', 'mathcalm_mathrmshs', 'and', 'the', 'sets', 'of', 'local', 'energy', 'minima', 'mathcalm_lj', 'of', 'the', 'mnlennardjones', 'potential', 'vmathrmlj_mnr', 'fracvarepsilonnm', 'm', 'rn', 'n', 'rm', 'is', 'established', 'the', 'number', 'of', 'nonisomorphic', 'stable', 'clusters', 'depends', 'strongly', 'and', 'nontrivially', 'on', 'both', 'm', 'and', 'n', 'and', 'increases', 'exponentially', 'with', 'increasing', 'cluster', 'size', 'n', 'for', 'n', 'gtrsim', '10', 'while', 'the', 'map', 'from', 'mathcalm_mathrmshsto', 'mathcalm_mathrmshstomathrmlj', 'is', 'noninjective', 'and', 'nonsurjective', 'the', 'number', 'of', 'lennardjones', 'structures', 'missing', 'from', 'the', 'map', 'is', 'relatively', 'small', 'for', 'cluster', 'sizes', 'up', 'to', 'n13', 'and', 'most', 'of', 'the', 'missing', 'structures', 'correspond', 'to', 'energetically', 'unfavourable', 'minima', 'even', 'for', 'fairly', 'low', 'mn', 'furthermore', 'even', 'the', 'softest', 'lennardjones', 'potential', 'predicts', 'that', 'the', 'coordination', 'of', '13', 'spheres', 'around', 'a', 'central', 'sphere', 'is', 'problematic', 'the', 'gregorynewton', 'problem', 'a', 'more', 'realistic', 'extended', 'lennardjones', 'potential', 'chosen', 'from', 'coupledcluster', 'calculations', 'for', 'a', 'rare', 'gas', 'dimer', 'leads', 'to', 'a', 'substantial', 'increase', 'in', 'the', 'number', 'of', 'nonisomorphic', 'clusters', 'even', 'though', 'the', 'potential', 'curve', 'is', 'very', 'similar', 'to', 'a', '612lennardjones', 'potential']] | [-0.15183301473359367, 0.14881051226909603, -0.031398003779712226, 0.09077105147598852, 0.007626098451474982, -0.1677217400061988, 0.07614403466258439, 0.34515312667335235, -0.23554993959579376, -0.3479276713915169, 0.037559591506367486, -0.324655995133423, -0.08658841595414185, 0.1752757511957879, 0.002351369708776474, 0.005142423574392113, 0.07663789690141716, 0.0592531299879474, -0.05444959128771218, -0.27977432367061417, 0.2799090924507548, 0.04080359113192366, 0.1944280917786302, 0.03529583425411294, 0.04989649190176879, 0.0017061656896745967, 0.04670190217814619, 0.05708921460374709, -0.10065916210676791, 0.11588532958187223, 0.21308572242457058, 0.041876827530382625, 0.24018772111064005, -0.3843237659022693, -0.1515881033861191, 0.17904373792811268, 0.16162347072104533, 0.07761428110872305, -0.04200882042444597, -0.19617945738286982, 0.12227273872047062, -0.15512357375193989, -0.16137322894027156, -0.043281379915894036, 0.10645664423824318, 0.05034171907313829, -0.25256674922401867, 0.10293108045814499, 0.03076971584626834, 0.03242743912771637, -0.08786419289517067, -0.14190081908337532, -0.059997758384223186, 0.08919577231750854, 0.011663335337934474, 0.06965219303064289, 0.14234982835910012, -0.1370176036000973, -0.005200859471674889, 0.41651277233876527, -0.01801296821570084, -0.14861639805528665, 0.2671891166167634, -0.15982014562994723, -0.12890326825154555, 0.20862657377015678, 0.12128026621836809, 0.11334468184579764, -0.07269145275875476, 0.12836783711381647, -0.04503430918970656, 0.21466251787984925, 0.10052277585791965, -0.02029403131004543, 0.207583063873913, 0.13251745064232137, 0.12500874968245626, 0.14748689645240384, -0.10499503945541237, -0.0938774092828915, -0.26918764822785896, -0.10594465820223935, -0.21214914268348367, 0.04707092838662286, -0.16305389922927133, -0.1861859745676479, 0.2984515636378238, 0.04457542517432763, 0.2548938638680885, 0.07298813953304724, 0.19544042788986718, 0.023476597047204364, 0.07941944756274742, 0.07212323718854496, 0.182409404885144, 0.15766528245181807, 0.01771357236580262, -0.2077944474016887, -0.006674476196208308, 0.02090939756092285] |
1,801.10291 | A Cross Entropy based Optimization Algorithm with Global Convergence
Guarantees | The cross entropy (CE) method is a model based search method to solve
optimization problems where the objective function has minimal structure. The
Monte-Carlo version of the CE method employs the naive sample averaging
technique which is inefficient, both computationally and space wise. We provide
a novel stochastic approximation version of the CE method, where the sample
averaging is replaced with incremental geometric averaging. This approach can
save considerable computational and storage costs. Our algorithm is incremental
in nature and possesses additional attractive features such as accuracy,
stability, robustness and convergence to the global optimum for a particular
class of objective functions. We evaluate the algorithm on a variety of global
optimization benchmark problems and the results obtained corroborate our
theoretical findings.
| cs.AI math.OC | the cross entropy ce method is a model based search method to solve optimization problems where the objective function has minimal structure the montecarlo version of the ce method employs the naive sample averaging technique which is inefficient both computationally and space wise we provide a novel stochastic approximation version of the ce method where the sample averaging is replaced with incremental geometric averaging this approach can save considerable computational and storage costs our algorithm is incremental in nature and possesses additional attractive features such as accuracy stability robustness and convergence to the global optimum for a particular class of objective functions we evaluate the algorithm on a variety of global optimization benchmark problems and the results obtained corroborate our theoretical findings | [['the', 'cross', 'entropy', 'ce', 'method', 'is', 'a', 'model', 'based', 'search', 'method', 'to', 'solve', 'optimization', 'problems', 'where', 'the', 'objective', 'function', 'has', 'minimal', 'structure', 'the', 'montecarlo', 'version', 'of', 'the', 'ce', 'method', 'employs', 'the', 'naive', 'sample', 'averaging', 'technique', 'which', 'is', 'inefficient', 'both', 'computationally', 'and', 'space', 'wise', 'we', 'provide', 'a', 'novel', 'stochastic', 'approximation', 'version', 'of', 'the', 'ce', 'method', 'where', 'the', 'sample', 'averaging', 'is', 'replaced', 'with', 'incremental', 'geometric', 'averaging', 'this', 'approach', 'can', 'save', 'considerable', 'computational', 'and', 'storage', 'costs', 'our', 'algorithm', 'is', 'incremental', 'in', 'nature', 'and', 'possesses', 'additional', 'attractive', 'features', 'such', 'as', 'accuracy', 'stability', 'robustness', 'and', 'convergence', 'to', 'the', 'global', 'optimum', 'for', 'a', 'particular', 'class', 'of', 'objective', 'functions', 'we', 'evaluate', 'the', 'algorithm', 'on', 'a', 'variety', 'of', 'global', 'optimization', 'benchmark', 'problems', 'and', 'the', 'results', 'obtained', 'corroborate', 'our', 'theoretical', 'findings']] | [-0.06738050679722038, -0.04361141204727111, -0.13733302532565458, 0.08302258368348703, -0.07641836143572067, -0.12932844885212721, 0.09081226593402565, 0.38493904639722504, -0.291305099743739, -0.3324762170859536, 0.11119461740599945, -0.24907578314944614, -0.1792445596933487, 0.18762021943293206, -0.07265349787843155, 0.10442475210417246, 0.10332965512653111, -0.014327468366512922, -0.09687389337198167, -0.2922775324750844, 0.2489293350792322, 0.09021807924203086, 0.3111776133548835, 0.02711306121791942, 0.12456799722391135, 0.021193774390324462, -0.008732772529598509, 0.050091057862908975, -0.0969696146203205, 0.154008730681094, 0.2195097401616026, 0.1846012769450174, 0.3431987672849543, -0.3592685014461539, -0.2000067486021225, 0.118628428132487, 0.12852509501156376, 0.10777394853238413, -0.06864114221067122, -0.23451686903193106, 0.11551676445533751, -0.15081060317451836, -0.075951868836142, -0.1602456883878493, -0.08258302870099662, 0.019738751673998432, -0.3524571858278712, 0.06835502713582799, 0.047056406869965255, 0.028378371859244148, -0.09447927914223954, -0.1301271486168605, 0.01636860791410579, 0.0372256652841375, 0.029643999612088637, 0.05182464087962127, 0.11718320641590313, -0.06311001168266006, -0.1411369485994343, 0.36505489007638553, -0.05660564546114536, -0.21722606096424346, 0.1808326199257624, -0.01668309545541396, -0.1387532782859215, 0.1529274088613017, 0.21236608563693332, 0.1826693269989041, -0.1253353490682174, 0.10814029179450475, -0.028446422985251078, 0.16122136743678178, -0.026235457234939592, 0.0219140061116243, 0.10055400880500216, 0.23713097103192, 0.1255237594033118, 0.15896061193541486, -0.09213454421651626, -0.14611661839527917, -0.27361865272959235, -0.14108060026917316, -0.21034641210829502, -0.03039634793416643, -0.13600149451786953, -0.16678796259716885, 0.3810652857884902, 0.18898596024125447, 0.17373203063721493, 0.07814456589546696, 0.35836005786464353, 0.114157882210852, 0.03467119195676012, 0.09084334124459839, 0.19896619162449736, 0.08949726349941348, 0.08703365220047045, -0.2438239326555526, 0.08718497484357508, 0.12987128952823457] |
1,801.10292 | On the Optimal Recovery Threshold of Coded Matrix Multiplication | We provide novel coded computation strategies for distributed matrix-matrix
products that outperform the recent "Polynomial code" constructions in recovery
threshold, i.e., the required number of successful workers. When $m$-th
fraction of each matrix can be stored in each worker node, Polynomial codes
require $m^2$ successful workers, while our MatDot codes only require $2m-1$
successful workers, albeit at a higher communication cost from each worker to
the fusion node. We also provide a systematic construction of MatDot codes.
Further, we propose "PolyDot" coding that interpolates between Polynomial codes
and MatDot codes to trade off communication cost and recovery threshold.
Finally, we demonstrate a coding technique for multiplying $n$ matrices ($n
\geq 3$) by applying MatDot and PolyDot coding ideas.
| cs.IT cs.DC math.IT | we provide novel coded computation strategies for distributed matrixmatrix products that outperform the recent polynomial code constructions in recovery threshold ie the required number of successful workers when mth fraction of each matrix can be stored in each worker node polynomial codes require m2 successful workers while our matdot codes only require 2m1 successful workers albeit at a higher communication cost from each worker to the fusion node we also provide a systematic construction of matdot codes further we propose polydot coding that interpolates between polynomial codes and matdot codes to trade off communication cost and recovery threshold finally we demonstrate a coding technique for multiplying n matrices n geq 3 by applying matdot and polydot coding ideas | [['we', 'provide', 'novel', 'coded', 'computation', 'strategies', 'for', 'distributed', 'matrixmatrix', 'products', 'that', 'outperform', 'the', 'recent', 'polynomial', 'code', 'constructions', 'in', 'recovery', 'threshold', 'ie', 'the', 'required', 'number', 'of', 'successful', 'workers', 'when', 'mth', 'fraction', 'of', 'each', 'matrix', 'can', 'be', 'stored', 'in', 'each', 'worker', 'node', 'polynomial', 'codes', 'require', 'm2', 'successful', 'workers', 'while', 'our', 'matdot', 'codes', 'only', 'require', '2m1', 'successful', 'workers', 'albeit', 'at', 'a', 'higher', 'communication', 'cost', 'from', 'each', 'worker', 'to', 'the', 'fusion', 'node', 'we', 'also', 'provide', 'a', 'systematic', 'construction', 'of', 'matdot', 'codes', 'further', 'we', 'propose', 'polydot', 'coding', 'that', 'interpolates', 'between', 'polynomial', 'codes', 'and', 'matdot', 'codes', 'to', 'trade', 'off', 'communication', 'cost', 'and', 'recovery', 'threshold', 'finally', 'we', 'demonstrate', 'a', 'coding', 'technique', 'for', 'multiplying', 'n', 'matrices', 'n', 'geq', '3', 'by', 'applying', 'matdot', 'and', 'polydot', 'coding', 'ideas']] | [-0.17880033280154498, 0.08532012915660242, -0.031709993350448024, 0.020169426590718072, -0.025391294339928646, -0.319307037777717, 0.13917841665358444, 0.3863091896577128, -0.29974434418796464, -0.3060016916053177, 0.10336529157738651, -0.2483084153841603, -0.16945431811397832, 0.15989919240458, -0.13804589849088847, 0.08062798216746285, 0.08772845736479964, 0.0465533197882529, -0.09265364047866476, -0.38754943434293543, 0.2473295120038654, 0.14101327917988188, 0.2714360092068091, -0.0017537537175391254, 0.10063581090372313, 0.028866486487396318, -0.053662947736327245, -0.06820271643488829, -0.11121699180725485, 0.11436437729822375, 0.34231246880994276, 0.22813624830852294, 0.2701953420503836, -0.4407215550527953, -0.1620654372218896, 0.13458784167446067, 0.18153644560290308, 0.13468813127637358, -0.0635522735136529, -0.1626663706425963, 0.13679379072233006, -0.2329982373991917, 0.013741800726134458, -0.0694228651359324, -0.02110948371058651, 0.013150292897801686, -0.3556188180689411, -0.015565101464493762, -0.006659214312596054, 0.04866617467206229, 0.025086530118955876, -0.1696498642157731, 0.07048071583066585, 0.14852535921667806, -0.042099768625058494, 0.03289597713918393, 0.1054521977965688, -0.08270165749679015, -0.15714256536087085, 0.3167357403817105, 0.01708929505799335, -0.20212400637984532, 0.09189230397118833, -0.06756203075276752, -0.1756302014852328, 0.1500754404796994, 0.21392815562511056, 0.08285237546480292, -0.06446821227178463, 0.06337414914591576, -0.03506502379855976, 0.20515036521929092, 0.1203564156954787, 0.06475096040180531, 0.10490549818596578, 0.10209902457527592, 0.1071134175731929, 0.1344434153429104, -0.011806304341760176, -0.05961442019405036, -0.2582684441244808, -0.11979335746632544, -0.2043949614262915, 0.023062192134414638, -0.19013859967840133, -0.08394367687388099, 0.35847846486059753, 0.12209603963178936, 0.13979640332098794, 0.1778233902015049, 0.32178649353666294, 0.024502605785904772, 0.1047138217756332, 0.22793490837874084, 0.09636378570275124, 0.10068559840698887, 0.043445104870599986, -0.1581091050777167, 0.09002130775579958, 0.09861512006067767] |
1,801.10293 | Paraphrase-Supervised Models of Compositionality | Compositional vector space models of meaning promise new solutions to
stubborn language understanding problems. This paper makes two contributions
toward this end: (i) it uses automatically-extracted paraphrase examples as a
source of supervision for training compositional models, replacing previous
work which relied on manual annotations used for the same purpose, and (ii)
develops a context-aware model for scoring phrasal compositionality.
Experimental results indicate that these multiple sources of information can be
used to learn partial semantic supervision that matches previous techniques in
intrinsic evaluation tasks. Our approaches are also evaluated for their impact
on a machine translation system where we show improvements in translation
quality, demonstrating that compositionality in interpretation correlates with
compositionality in translation.
| cs.CL | compositional vector space models of meaning promise new solutions to stubborn language understanding problems this paper makes two contributions toward this end i it uses automaticallyextracted paraphrase examples as a source of supervision for training compositional models replacing previous work which relied on manual annotations used for the same purpose and ii develops a contextaware model for scoring phrasal compositionality experimental results indicate that these multiple sources of information can be used to learn partial semantic supervision that matches previous techniques in intrinsic evaluation tasks our approaches are also evaluated for their impact on a machine translation system where we show improvements in translation quality demonstrating that compositionality in interpretation correlates with compositionality in translation | [['compositional', 'vector', 'space', 'models', 'of', 'meaning', 'promise', 'new', 'solutions', 'to', 'stubborn', 'language', 'understanding', 'problems', 'this', 'paper', 'makes', 'two', 'contributions', 'toward', 'this', 'end', 'i', 'it', 'uses', 'automaticallyextracted', 'paraphrase', 'examples', 'as', 'a', 'source', 'of', 'supervision', 'for', 'training', 'compositional', 'models', 'replacing', 'previous', 'work', 'which', 'relied', 'on', 'manual', 'annotations', 'used', 'for', 'the', 'same', 'purpose', 'and', 'ii', 'develops', 'a', 'contextaware', 'model', 'for', 'scoring', 'phrasal', 'compositionality', 'experimental', 'results', 'indicate', 'that', 'these', 'multiple', 'sources', 'of', 'information', 'can', 'be', 'used', 'to', 'learn', 'partial', 'semantic', 'supervision', 'that', 'matches', 'previous', 'techniques', 'in', 'intrinsic', 'evaluation', 'tasks', 'our', 'approaches', 'are', 'also', 'evaluated', 'for', 'their', 'impact', 'on', 'a', 'machine', 'translation', 'system', 'where', 'we', 'show', 'improvements', 'in', 'translation', 'quality', 'demonstrating', 'that', 'compositionality', 'in', 'interpretation', 'correlates', 'with', 'compositionality', 'in', 'translation']] | [-0.0401298732071629, -0.015152862348148357, -0.0488015235968582, 0.1003709697994687, -0.1680189097745587, -0.1543790077952587, 0.06022199632944134, 0.4535894123432429, -0.2588427920339872, -0.33349833972752096, 0.027394338377305996, -0.2749967191327849, -0.16969644613564014, 0.21901194884684747, -0.15446221654343864, 0.11086123546018549, 0.14539268479642012, 0.03476328816791267, -0.08189075039902136, -0.2612771829671186, 0.33103030264863503, 0.0044948024432296335, 0.34190772714589357, 0.050225173022962456, 0.10910071408700035, -0.049965974318025554, -0.06262755655562101, -0.01335662438296308, -0.03916427753150777, 0.20090910757527403, 0.318688248319402, 0.23032634401612956, 0.3247548691644941, -0.3905733502429465, -0.23097897763566477, 0.030746859706857282, 0.15077955542618166, 0.11805459115472015, -0.03737720021289652, -0.32824198602010374, 0.0838570991951122, -0.17274540031895688, 0.011754828505218029, -0.1625997756972261, -0.006817360671804003, -0.015804040049324217, -0.2805511356483254, 0.011822662897073948, 0.1757239448149567, 0.11070980959490913, -0.10374514061917106, -0.11905716658752087, 0.020222499996990613, 0.1549681410152951, 0.05415608425138761, 0.06803013786734284, 0.10959133567369503, -0.1834887876013375, -0.19933478373062352, 0.3702626445128218, -0.08029123836642374, -0.25350638421292865, 0.23346571238387537, -0.026585647335488592, -0.23662171882131824, 0.04066558667235886, 0.19468225424947297, 0.08039907193970462, -0.16156582573185796, 0.024250974286975258, -0.026225433911642303, 0.23128046303096672, 0.06555742245248479, 0.025844701667032812, 0.1931149052698975, 0.2242647301243699, -0.013687743424721385, 0.1210087080941657, -0.044346750669343314, -0.06901775024345387, -0.2600736631207047, -0.15923400074243546, -0.1422961466257339, -0.03179904415535376, -0.0447502610183817, -0.13462997410236352, 0.36365446456019646, 0.2833129726552769, 0.19233540729012177, 0.13861046335153768, 0.3233795737280794, 0.0055545598938529705, 0.10820530989693235, 0.05477388479706386, 0.17943858269946245, -0.017366877086865514, 0.14879904507618882, -0.14851298523540407, 0.13570860835885548, 0.07315392466261983] |
1,801.10294 | Protecting Privacy in VANETs Using Mix Zones With Virtual Pseudonym
Change | Vehicular ad hoc networks VANETs use pseudonyms to communicate among them and
with road side units, these pseudonyms are used to authenticate these vehicles
and to hide real identities behind these pseudonyms, to better enhance privacy,
these pseudonyms are changed frequently so that it will not be that easy to
link these pseudonyms together and hence reveal real identities. However,
changing pseudonyms will not be that useful if previous and current pseudonyms
are easily linked together. Therefore different techniques have been proposed
to hide the pseudonym changes and make it difficult to link pseudonyms
together. Most of these techniques do not fully quarantine privacy when
changing a pseudonym under some situations such as low traffic. In this paper,
we provide a technique for changing pseudonyms that has the same privacy level
under all traffic conditions. The technique relies on fixed mix zones that are
planted and distributed over the roads. By this technique, a vehicle guarantees
a high level of security when changing its pseudonym at that mix zone which
will make it very difficult for an adversary to link particular pseudonyms
together and hence reveal real identity. Performance analysis showed that our
model works efficiently with very few computational costs
| cs.NI cs.CR | vehicular ad hoc networks vanets use pseudonyms to communicate among them and with road side units these pseudonyms are used to authenticate these vehicles and to hide real identities behind these pseudonyms to better enhance privacy these pseudonyms are changed frequently so that it will not be that easy to link these pseudonyms together and hence reveal real identities however changing pseudonyms will not be that useful if previous and current pseudonyms are easily linked together therefore different techniques have been proposed to hide the pseudonym changes and make it difficult to link pseudonyms together most of these techniques do not fully quarantine privacy when changing a pseudonym under some situations such as low traffic in this paper we provide a technique for changing pseudonyms that has the same privacy level under all traffic conditions the technique relies on fixed mix zones that are planted and distributed over the roads by this technique a vehicle guarantees a high level of security when changing its pseudonym at that mix zone which will make it very difficult for an adversary to link particular pseudonyms together and hence reveal real identity performance analysis showed that our model works efficiently with very few computational costs | [['vehicular', 'ad', 'hoc', 'networks', 'vanets', 'use', 'pseudonyms', 'to', 'communicate', 'among', 'them', 'and', 'with', 'road', 'side', 'units', 'these', 'pseudonyms', 'are', 'used', 'to', 'authenticate', 'these', 'vehicles', 'and', 'to', 'hide', 'real', 'identities', 'behind', 'these', 'pseudonyms', 'to', 'better', 'enhance', 'privacy', 'these', 'pseudonyms', 'are', 'changed', 'frequently', 'so', 'that', 'it', 'will', 'not', 'be', 'that', 'easy', 'to', 'link', 'these', 'pseudonyms', 'together', 'and', 'hence', 'reveal', 'real', 'identities', 'however', 'changing', 'pseudonyms', 'will', 'not', 'be', 'that', 'useful', 'if', 'previous', 'and', 'current', 'pseudonyms', 'are', 'easily', 'linked', 'together', 'therefore', 'different', 'techniques', 'have', 'been', 'proposed', 'to', 'hide', 'the', 'pseudonym', 'changes', 'and', 'make', 'it', 'difficult', 'to', 'link', 'pseudonyms', 'together', 'most', 'of', 'these', 'techniques', 'do', 'not', 'fully', 'quarantine', 'privacy', 'when', 'changing', 'a', 'pseudonym', 'under', 'some', 'situations', 'such', 'as', 'low', 'traffic', 'in', 'this', 'paper', 'we', 'provide', 'a', 'technique', 'for', 'changing', 'pseudonyms', 'that', 'has', 'the', 'same', 'privacy', 'level', 'under', 'all', 'traffic', 'conditions', 'the', 'technique', 'relies', 'on', 'fixed', 'mix', 'zones', 'that', 'are', 'planted', 'and', 'distributed', 'over', 'the', 'roads', 'by', 'this', 'technique', 'a', 'vehicle', 'guarantees', 'a', 'high', 'level', 'of', 'security', 'when', 'changing', 'its', 'pseudonym', 'at', 'that', 'mix', 'zone', 'which', 'will', 'make', 'it', 'very', 'difficult', 'for', 'an', 'adversary', 'to', 'link', 'particular', 'pseudonyms', 'together', 'and', 'hence', 'reveal', 'real', 'identity', 'performance', 'analysis', 'showed', 'that', 'our', 'model', 'works', 'efficiently', 'with', 'very', 'few', 'computational', 'costs']] | [-0.1396658463468451, 0.04872409810275315, -0.07852544247019869, 0.08007712027322111, -0.17292273920654916, -0.27865340625311236, 0.12345066505996279, 0.439523272818668, -0.2896185653517023, -0.34393930273936757, 0.15176022314844162, -0.2624051786115884, -0.17048796422522403, 0.19101979096584595, -0.16537032759892037, 0.04707774767606978, 0.07371690680750122, 0.02316568663186829, 0.035903590574654386, -0.310080108641915, 0.29962190673211636, 0.05230704983418335, 0.3104300078210787, 0.09668271694348578, 0.032251393908996194, -0.037439420249368714, -0.045883638807456585, 0.0015131271309891151, -0.02605929212720424, 0.13034865511231622, 0.32095804089559843, 0.18167245673798765, 0.25730883129941884, -0.49288547001964417, -0.19496032110744374, 0.10318996981875184, 0.15802206887645803, 0.07119481457774968, -0.025370545918701113, -0.3186208008515153, 0.19453405751499223, -0.19841987466490574, -0.08992689145979152, -0.1228265991267651, -0.035104045516403566, 0.046993829461685684, -0.24645115358787426, -0.05393347975830386, -0.014154386162509984, 0.027300938069635065, 0.029649361665128958, -0.047496846853871254, -0.02914675336391364, 0.22750667888185808, 0.08732540910977833, -0.009611726893443355, 0.16059065853657933, -0.11531099841804869, -0.10769373519503656, 0.363219313388366, 0.025520355197420314, -0.21473488722237485, 0.23780659271001037, -0.05649753583743427, -0.18511554948807188, 0.10673237760175965, 0.1769807719213156, 0.04811541373327152, -0.1923641002540354, -0.015653711565989138, -0.03749897717660414, 0.16925931695515095, 0.08541449041694255, 0.05059330130172013, 0.1759339528264297, 0.07039346965840688, 0.13777544802119632, 0.026941420560220804, -0.030026641468296235, -0.07554056966417835, -0.2115325746033804, -0.1373343740101088, -0.1474002431064557, 0.015296295664805469, -0.05116789747877753, -0.10876996984325386, 0.33562972142467673, 0.24693107426129468, 0.1925964263822091, 0.0538901229642693, 0.369221041470173, 0.048905790709908956, 0.13674499298821188, 0.1283138367365953, 0.19262239480387092, 0.03313002421807924, 0.17435361369830366, -0.12411870558245747, 0.18643406084715505, -0.02446919829417854] |
1,801.10295 | A Delay-Tolerant Payment Scheme Based on the Ethereum Blockchain | Banking as an essential service can be hard to access in remote, rural
regions where the network connectivity is intermittent. Although micro-banking
has been made possible by SMS or USSD messages in some places, their security
flaws and session-based nature prevent them from a wider adoption. Global level
cryptocurrencies enable low-cost, secure and pervasive money transferring among
distributed peers, but are still limited in their ability to reach more people
in remote communities.
We proposed to take advantage of the delay-tolerant nature of blockchains to
deliver banking services to remote communities that only connect to the broader
Internet intermittently. Using a base station that offers connectivity within
the local area, regular transaction processing is solely handled by blockchain
miners. The bank only joins to process currency exchange requests, reward
miners and track user balances when the connection is available. By
distributing the verification and storage tasks among peers, our system design
saves on the overall deployment and operational costs without sacrificing the
reliability and trustwor- thiness. Through theoretical and empirical analysis,
we provided insights to system design, tested its robustness against network
disturbances, and demonstrated the feasibility of implementation on
off-the-shelf computers and mobile devices.
| cs.CY cs.CR | banking as an essential service can be hard to access in remote rural regions where the network connectivity is intermittent although microbanking has been made possible by sms or ussd messages in some places their security flaws and sessionbased nature prevent them from a wider adoption global level cryptocurrencies enable lowcost secure and pervasive money transferring among distributed peers but are still limited in their ability to reach more people in remote communities we proposed to take advantage of the delaytolerant nature of blockchains to deliver banking services to remote communities that only connect to the broader internet intermittently using a base station that offers connectivity within the local area regular transaction processing is solely handled by blockchain miners the bank only joins to process currency exchange requests reward miners and track user balances when the connection is available by distributing the verification and storage tasks among peers our system design saves on the overall deployment and operational costs without sacrificing the reliability and trustwor thiness through theoretical and empirical analysis we provided insights to system design tested its robustness against network disturbances and demonstrated the feasibility of implementation on offtheshelf computers and mobile devices | [['banking', 'as', 'an', 'essential', 'service', 'can', 'be', 'hard', 'to', 'access', 'in', 'remote', 'rural', 'regions', 'where', 'the', 'network', 'connectivity', 'is', 'intermittent', 'although', 'microbanking', 'has', 'been', 'made', 'possible', 'by', 'sms', 'or', 'ussd', 'messages', 'in', 'some', 'places', 'their', 'security', 'flaws', 'and', 'sessionbased', 'nature', 'prevent', 'them', 'from', 'a', 'wider', 'adoption', 'global', 'level', 'cryptocurrencies', 'enable', 'lowcost', 'secure', 'and', 'pervasive', 'money', 'transferring', 'among', 'distributed', 'peers', 'but', 'are', 'still', 'limited', 'in', 'their', 'ability', 'to', 'reach', 'more', 'people', 'in', 'remote', 'communities', 'we', 'proposed', 'to', 'take', 'advantage', 'of', 'the', 'delaytolerant', 'nature', 'of', 'blockchains', 'to', 'deliver', 'banking', 'services', 'to', 'remote', 'communities', 'that', 'only', 'connect', 'to', 'the', 'broader', 'internet', 'intermittently', 'using', 'a', 'base', 'station', 'that', 'offers', 'connectivity', 'within', 'the', 'local', 'area', 'regular', 'transaction', 'processing', 'is', 'solely', 'handled', 'by', 'blockchain', 'miners', 'the', 'bank', 'only', 'joins', 'to', 'process', 'currency', 'exchange', 'requests', 'reward', 'miners', 'and', 'track', 'user', 'balances', 'when', 'the', 'connection', 'is', 'available', 'by', 'distributing', 'the', 'verification', 'and', 'storage', 'tasks', 'among', 'peers', 'our', 'system', 'design', 'saves', 'on', 'the', 'overall', 'deployment', 'and', 'operational', 'costs', 'without', 'sacrificing', 'the', 'reliability', 'and', 'trustwor', 'thiness', 'through', 'theoretical', 'and', 'empirical', 'analysis', 'we', 'provided', 'insights', 'to', 'system', 'design', 'tested', 'its', 'robustness', 'against', 'network', 'disturbances', 'and', 'demonstrated', 'the', 'feasibility', 'of', 'implementation', 'on', 'offtheshelf', 'computers', 'and', 'mobile', 'devices']] | [-0.1966335668822224, -0.0051127994518833115, -0.031407653183447126, 0.0472380845324632, -0.14516198926444376, -0.2327352687660105, 0.1800611039613866, 0.4141017336261834, -0.2808590608658708, -0.3354641410192421, 0.14664062564943903, -0.2916942351724445, -0.10952190654864291, 0.18677227494809093, -0.15771976547774064, 0.05393333188885901, 0.07239311981424494, 0.012749803971733255, 0.050084288621806486, -0.31699177532466566, 0.23883270761376021, 0.10740567382951681, 0.35918063137568146, 0.07151411468143629, 0.04610620046044207, 0.008739096564191993, -0.046387612905002235, -0.03776373890964851, -0.007746022930676581, 0.17091056724909098, 0.36090525117195676, 0.22646919754821399, 0.37097370018938763, -0.5095644474056359, -0.18909394695650278, 0.09195885603274682, 0.141210052384678, 0.02747157868485488, -0.036228868765747345, -0.35635738721341675, 0.11908839401759753, -0.2802580375826542, -0.07177707457575759, -0.10556501397346171, 0.009265901579360688, 0.034019524187668765, -0.24479312506743284, -0.037513863826804446, -0.04120575796803021, 0.05462421136249968, -0.007404205562572448, -0.036530005208006935, -0.04475248948895221, 0.24192578650609325, 0.04529665504854675, -0.06065354811887656, 0.21399400016556236, -0.12828254887190554, -0.12600356828011766, 0.37133148724593573, 0.06301806884676374, -0.1245919444942018, 0.20586878885953877, -0.024190168722327897, -0.12399168260376023, 0.09307704056998355, 0.23349024518545355, 0.0015454629206961674, -0.21603925316876438, 0.023307722524791002, 0.025261490235192925, 0.20262628426185336, 0.0527441124864537, 0.0817835385404059, 0.2102114794707579, 0.21174967555446228, 0.1286158461418705, 0.10474220093483524, -0.018912921607688177, -0.16063875092665242, -0.16389328121946373, -0.12566801706689815, -0.20810479556907613, 0.010633988130998587, -0.0903834868617891, -0.0942243271007834, 0.35750928477515803, 0.20969520155974317, 0.10129532070083212, 0.06463543943699976, 0.40566846156305103, -0.018160801571038068, 0.13528735372871745, 0.16764791269606244, 0.18136856900067896, -0.006111430564373537, 0.2209005596247838, -0.13949804749773786, 0.1804498487410589, -0.03785545593103228] |
1,801.10296 | Reinforced Self-Attention Network: a Hybrid of Hard and Soft Attention
for Sequence Modeling | Many natural language processing tasks solely rely on sparse dependencies
between a few tokens in a sentence. Soft attention mechanisms show promising
performance in modeling local/global dependencies by soft probabilities between
every two tokens, but they are not effective and efficient when applied to long
sentences. By contrast, hard attention mechanisms directly select a subset of
tokens but are difficult and inefficient to train due to their combinatorial
nature. In this paper, we integrate both soft and hard attention into one
context fusion model, "reinforced self-attention (ReSA)", for the mutual
benefit of each other. In ReSA, a hard attention trims a sequence for a soft
self-attention to process, while the soft attention feeds reward signals back
to facilitate the training of the hard one. For this purpose, we develop a
novel hard attention called "reinforced sequence sampling (RSS)", selecting
tokens in parallel and trained via policy gradient. Using two RSS modules, ReSA
efficiently extracts the sparse dependencies between each pair of selected
tokens. We finally propose an RNN/CNN-free sentence-encoding model, "reinforced
self-attention network (ReSAN)", solely based on ReSA. It achieves
state-of-the-art performance on both Stanford Natural Language Inference (SNLI)
and Sentences Involving Compositional Knowledge (SICK) datasets.
| cs.CL | many natural language processing tasks solely rely on sparse dependencies between a few tokens in a sentence soft attention mechanisms show promising performance in modeling localglobal dependencies by soft probabilities between every two tokens but they are not effective and efficient when applied to long sentences by contrast hard attention mechanisms directly select a subset of tokens but are difficult and inefficient to train due to their combinatorial nature in this paper we integrate both soft and hard attention into one context fusion model reinforced selfattention resa for the mutual benefit of each other in resa a hard attention trims a sequence for a soft selfattention to process while the soft attention feeds reward signals back to facilitate the training of the hard one for this purpose we develop a novel hard attention called reinforced sequence sampling rss selecting tokens in parallel and trained via policy gradient using two rss modules resa efficiently extracts the sparse dependencies between each pair of selected tokens we finally propose an rnncnnfree sentenceencoding model reinforced selfattention network resan solely based on resa it achieves stateoftheart performance on both stanford natural language inference snli and sentences involving compositional knowledge sick datasets | [['many', 'natural', 'language', 'processing', 'tasks', 'solely', 'rely', 'on', 'sparse', 'dependencies', 'between', 'a', 'few', 'tokens', 'in', 'a', 'sentence', 'soft', 'attention', 'mechanisms', 'show', 'promising', 'performance', 'in', 'modeling', 'localglobal', 'dependencies', 'by', 'soft', 'probabilities', 'between', 'every', 'two', 'tokens', 'but', 'they', 'are', 'not', 'effective', 'and', 'efficient', 'when', 'applied', 'to', 'long', 'sentences', 'by', 'contrast', 'hard', 'attention', 'mechanisms', 'directly', 'select', 'a', 'subset', 'of', 'tokens', 'but', 'are', 'difficult', 'and', 'inefficient', 'to', 'train', 'due', 'to', 'their', 'combinatorial', 'nature', 'in', 'this', 'paper', 'we', 'integrate', 'both', 'soft', 'and', 'hard', 'attention', 'into', 'one', 'context', 'fusion', 'model', 'reinforced', 'selfattention', 'resa', 'for', 'the', 'mutual', 'benefit', 'of', 'each', 'other', 'in', 'resa', 'a', 'hard', 'attention', 'trims', 'a', 'sequence', 'for', 'a', 'soft', 'selfattention', 'to', 'process', 'while', 'the', 'soft', 'attention', 'feeds', 'reward', 'signals', 'back', 'to', 'facilitate', 'the', 'training', 'of', 'the', 'hard', 'one', 'for', 'this', 'purpose', 'we', 'develop', 'a', 'novel', 'hard', 'attention', 'called', 'reinforced', 'sequence', 'sampling', 'rss', 'selecting', 'tokens', 'in', 'parallel', 'and', 'trained', 'via', 'policy', 'gradient', 'using', 'two', 'rss', 'modules', 'resa', 'efficiently', 'extracts', 'the', 'sparse', 'dependencies', 'between', 'each', 'pair', 'of', 'selected', 'tokens', 'we', 'finally', 'propose', 'an', 'rnncnnfree', 'sentenceencoding', 'model', 'reinforced', 'selfattention', 'network', 'resan', 'solely', 'based', 'on', 'resa', 'it', 'achieves', 'stateoftheart', 'performance', 'on', 'both', 'stanford', 'natural', 'language', 'inference', 'snli', 'and', 'sentences', 'involving', 'compositional', 'knowledge', 'sick', 'datasets']] | [-0.05589035897606926, 0.0589125248605473, -0.04390160515712401, 0.12814347620832517, -0.20956141052686023, -0.21170360743567423, 0.08394413647666746, 0.49742832247974333, -0.3231555858204506, -0.29840545192572104, 0.04134228345445962, -0.2655892284519817, -0.15261552356586783, 0.1558704830732523, -0.11923338502487071, 0.045432626659809086, 0.10371331621403086, 0.07036761639246084, 0.010889680369088928, -0.25701016296882223, 0.2667152563376429, 0.027344355921347423, 0.34244542728498045, -0.005545650147976949, 0.15799830335950882, 0.05517303574225414, -0.043817458373071994, -0.04652122042643521, -0.01166689882328561, 0.17698630367492124, 0.3075037153195302, 0.14769002242186635, 0.35913391260564637, -0.4391016664825675, -0.18363627799085736, 0.09210237752665411, 0.10110571550639808, 0.07423195488741634, -0.04435677303555757, -0.2749409885625787, 0.09992719716728501, -0.19512173827118287, 0.11484308072039377, -0.10165945169775142, -0.002112192322605664, 0.0052948708363362235, -0.28019282055572253, -0.013927076421300016, 0.12497375827023433, 0.008878969203335108, -0.0022047437708248795, -0.0966256601200679, 0.0023431715353862525, 0.1537224999264413, 0.055349094344791475, 0.029712670534901973, 0.13654179070066882, -0.16335318637195706, -0.15896094883984127, 0.36073660338297486, -0.032970526033938026, -0.21903287899229176, 0.21830693686251365, 0.008891949520269936, -0.1967685666300126, 0.1254775980967529, 0.2294260603483747, 0.12641350320569172, -0.19822265367065953, -0.006458989790095899, -0.01856416175814019, 0.21622455101364205, 0.08972875214153037, 0.005608426462186827, 0.23424580070062914, 0.2302031443231096, -0.02354026305010379, 0.1917245186191441, -0.07960711102860682, -0.08017483378308057, -0.19335656161942116, -0.05064244214661381, -0.1858031383077086, -0.04546648522917861, -0.0808935736916742, -0.14569429793279887, 0.35794271862484783, 0.21166085928064032, 0.25324308348714, 0.11174779173140366, 0.3387279195576599, 0.003637442293279257, 0.10680784982840348, 0.0922731725719863, 0.1648630681927748, 0.04780166368624292, 0.13064326891902422, -0.13344144245091172, 0.11132778180523094, 0.08222357907390088] |
1,801.10297 | Spectral dynamics of topological shift-current in ferroelectric
semiconductor SbSI | Photoexcitation in solids brings about transitions of electrons/holes between
different electronic bands. If the solid lacks an inversion symmetry, these
electronic transitions support spontaneous photocurrent due to the topological
character of the constituting electronic bands; the Berry connection. This
photocurrent, termed shift current, is expected to emerge on the time-scale of
primary photoexcitation process. We observed ultrafast time evolution of the
shift current in a prototypical ferroelectric semiconductor by detecting
emitted terahertz electromagnetic waves. By sweeping the excitation photon
energy across the band gap, ultrafast electron dynamics as a source of
terahertz emission abruptly changes its nature, reflecting a contribution of
Berry connection upon interband optical transition. The shift excitation
carries a net charge flow, and is followed by a swing-over of the electron
cloud on the sub-picosecond time-scale of electron-phonon interaction.
Understanding these substantive characters of the shift current will pave the
way for its application to ultrafast sensors and solar cells.
| cond-mat.mtrl-sci | photoexcitation in solids brings about transitions of electronsholes between different electronic bands if the solid lacks an inversion symmetry these electronic transitions support spontaneous photocurrent due to the topological character of the constituting electronic bands the berry connection this photocurrent termed shift current is expected to emerge on the timescale of primary photoexcitation process we observed ultrafast time evolution of the shift current in a prototypical ferroelectric semiconductor by detecting emitted terahertz electromagnetic waves by sweeping the excitation photon energy across the band gap ultrafast electron dynamics as a source of terahertz emission abruptly changes its nature reflecting a contribution of berry connection upon interband optical transition the shift excitation carries a net charge flow and is followed by a swingover of the electron cloud on the subpicosecond timescale of electronphonon interaction understanding these substantive characters of the shift current will pave the way for its application to ultrafast sensors and solar cells | [['photoexcitation', 'in', 'solids', 'brings', 'about', 'transitions', 'of', 'electronsholes', 'between', 'different', 'electronic', 'bands', 'if', 'the', 'solid', 'lacks', 'an', 'inversion', 'symmetry', 'these', 'electronic', 'transitions', 'support', 'spontaneous', 'photocurrent', 'due', 'to', 'the', 'topological', 'character', 'of', 'the', 'constituting', 'electronic', 'bands', 'the', 'berry', 'connection', 'this', 'photocurrent', 'termed', 'shift', 'current', 'is', 'expected', 'to', 'emerge', 'on', 'the', 'timescale', 'of', 'primary', 'photoexcitation', 'process', 'we', 'observed', 'ultrafast', 'time', 'evolution', 'of', 'the', 'shift', 'current', 'in', 'a', 'prototypical', 'ferroelectric', 'semiconductor', 'by', 'detecting', 'emitted', 'terahertz', 'electromagnetic', 'waves', 'by', 'sweeping', 'the', 'excitation', 'photon', 'energy', 'across', 'the', 'band', 'gap', 'ultrafast', 'electron', 'dynamics', 'as', 'a', 'source', 'of', 'terahertz', 'emission', 'abruptly', 'changes', 'its', 'nature', 'reflecting', 'a', 'contribution', 'of', 'berry', 'connection', 'upon', 'interband', 'optical', 'transition', 'the', 'shift', 'excitation', 'carries', 'a', 'net', 'charge', 'flow', 'and', 'is', 'followed', 'by', 'a', 'swingover', 'of', 'the', 'electron', 'cloud', 'on', 'the', 'subpicosecond', 'timescale', 'of', 'electronphonon', 'interaction', 'understanding', 'these', 'substantive', 'characters', 'of', 'the', 'shift', 'current', 'will', 'pave', 'the', 'way', 'for', 'its', 'application', 'to', 'ultrafast', 'sensors', 'and', 'solar', 'cells']] | [-0.20056841150538898, 0.23295185619568465, -0.0524007872200424, 0.026098699751101823, -0.06764742202664677, -0.08310650047956426, 0.12190349283168632, 0.4384336877050565, -0.3084903944308232, -0.2818306006834303, -0.005397263949577648, -0.2960144110042357, -0.12906248390821642, 0.17198378288211594, 0.0350218364772828, -0.017171098853731036, -0.02585446347075049, -0.09965460718989275, -0.07133416988347706, -0.07300097275047417, 0.27532275877954243, 0.05507780889092828, 0.31617772589302867, 0.11711298113100622, 0.0568391839195484, -0.005195155367561567, 0.04906816201554121, -0.10277707343553438, -0.08177406423247273, 0.09991947008189814, 0.2636060389559134, -0.04238152798222329, 0.21772430761790784, -0.4802520233451536, -0.2443361614438656, 0.008579272695657747, 0.1162081324705229, 0.12820778877204775, -0.0927482212075694, -0.300072882165152, -0.030773169832843308, -0.13056794635179503, -0.09694968491461814, -0.04580137489430949, 0.04997694994457752, 0.007072011404058063, -0.1837403262064694, 0.08170909210610644, 0.053871014382916894, 0.06151247847332055, -0.10872705628035444, -0.0386638054930556, -0.08686659932994333, 0.08895107567016232, 0.060119057992300155, 0.05535685775899574, 0.23948306960167093, -0.11909878311531716, -0.1433379775553476, 0.3906357085920478, -0.0581842200940867, -0.032664851507625395, 0.13449907479930276, -0.20067986907547733, -0.02300378668740833, 0.24941449505154437, 0.10688002028588303, 0.08121174735960697, -0.10403061882703026, 0.02729399008967448, 0.054504648577054275, 0.18301771016252277, 0.05942673132736481, 0.15464717964335395, 0.3024679328036176, 0.20088437635077802, 0.051648590627959685, 0.1173051361876883, -0.14450636569419753, -0.05173327216088135, -0.2396889809139171, -0.15165185294493935, -0.2322836929938364, 0.1397620919696668, -0.019758142654322193, -0.1633181227432368, 0.5062498614547382, 0.13598861979124577, 0.14283508743239126, -0.0684243718357098, 0.2843589807851363, 0.16442516523200443, 0.05576928456254169, 0.002863187032696595, 0.276334682854787, 0.16782266306261973, 0.15409739126488076, -0.33145071630133316, 0.06488989048184042, -0.014446566252062391] |
1,801.10298 | $(\mathfrak{g},K)$-module of $\mathrm{O}(p,q)$ associated with the
finite-dimensional representation of $\mathfrak{sl}_2$ | The main aim of this paper is to construct irreducible
$(\mathfrak{g},K)$-modules of $\mathrm{O}(p,q)$ corresponding to the
finite-dimensional representation of $\mathfrak{sl}_2$ of dimension $m+1$ under
the Howe duality, to find the $K$-type formula, the Gelfand-Kirillov dimension
and the Bernstein degree of them, where $m$ is a non-negative integer. The
$K$-type formula for $m=0$ shows that it is nothing but the
$(\mathfrak{g},K)$-module of the minimal representation of $\mathrm{O}(p,q)$.
One finds that the Gelfand-Kirillov dimension is equal to $p+q-3$ not only for
$m=0$ but for any $m$ satisfying $m+3 \leq (p+q)/2$ when $p, q \geq 2$ and
$p+q$ is even, and that the Bernstein degree for $m$ is equal to $(m+1)$ times
that for $m=0$.
| math.RT | the main aim of this paper is to construct irreducible mathfrakgkmodules of mathrmopq corresponding to the finitedimensional representation of mathfraksl_2 of dimension m1 under the howe duality to find the ktype formula the gelfandkirillov dimension and the bernstein degree of them where m is a nonnegative integer the ktype formula for m0 shows that it is nothing but the mathfrakgkmodule of the minimal representation of mathrmopq one finds that the gelfandkirillov dimension is equal to pq3 not only for m0 but for any m satisfying m3 leq pq2 when p q geq 2 and pq is even and that the bernstein degree for m is equal to m1 times that for m0 | [['the', 'main', 'aim', 'of', 'this', 'paper', 'is', 'to', 'construct', 'irreducible', 'mathfrakgkmodules', 'of', 'mathrmopq', 'corresponding', 'to', 'the', 'finitedimensional', 'representation', 'of', 'mathfraksl_2', 'of', 'dimension', 'm1', 'under', 'the', 'howe', 'duality', 'to', 'find', 'the', 'ktype', 'formula', 'the', 'gelfandkirillov', 'dimension', 'and', 'the', 'bernstein', 'degree', 'of', 'them', 'where', 'm', 'is', 'a', 'nonnegative', 'integer', 'the', 'ktype', 'formula', 'for', 'm0', 'shows', 'that', 'it', 'is', 'nothing', 'but', 'the', 'mathfrakgkmodule', 'of', 'the', 'minimal', 'representation', 'of', 'mathrmopq', 'one', 'finds', 'that', 'the', 'gelfandkirillov', 'dimension', 'is', 'equal', 'to', 'pq3', 'not', 'only', 'for', 'm0', 'but', 'for', 'any', 'm', 'satisfying', 'm3', 'leq', 'pq2', 'when', 'p', 'q', 'geq', '2', 'and', 'pq', 'is', 'even', 'and', 'that', 'the', 'bernstein', 'degree', 'for', 'm', 'is', 'equal', 'to', 'm1', 'times', 'that', 'for', 'm0']] | [-0.16702908323038304, 0.13518645462525974, -0.05322507895263178, 0.04920577514297163, -0.07620255865497581, -0.22518772028602793, -0.017378402656634404, 0.28795707370902945, -0.21604131077349717, -0.22768254289985634, 0.08618193271935784, -0.2463704166938052, -0.12685855303217458, 0.18209616946530463, -0.0739615207172132, -0.050178013808493106, 0.005465352458746305, 0.17608076910255477, -0.06480660179970853, -0.29822885177730185, 0.3440820619996105, -0.05286150465820226, 0.17040082520439423, -0.0057241531098303055, 0.11406628925968627, 0.022545602272397706, 0.04526490531861782, -0.08223701045998107, -0.17203384062538266, 0.12288876891294162, 0.2747190744017384, 0.11578411517049451, 0.20404829848225095, -0.2808684874159683, -0.10759706403561202, 0.21994968833002662, 0.15917984198625032, 0.018724220580354865, 0.037269308319082484, -0.16383168613538146, 0.21831966751986848, -0.14821830938022426, -0.19666589132975787, -0.037944766834178675, 0.18798619735337393, -0.06822906906433802, -0.3557802206030049, 0.055502742434327956, 0.17334546702581324, 0.06368245650082827, -0.05728197930355756, -0.19908005158816064, -0.06325010408597466, 0.08683309425110305, 0.015091200273933023, 0.08006558048821587, 0.0020836404998720226, -0.09924929484051452, -0.07580359652638435, 0.3443077867476469, -0.024622180045948232, -0.2039033335833145, 0.15368440301348787, -0.2227723832308714, -0.1283888923519823, 0.12197489638180871, 0.049946009123232216, 0.1410187438970232, -0.03954699228740667, 0.18408950599353244, -0.08417917517778863, 0.14205693276016973, 0.1269383774488233, -0.017327023337462118, 0.09499223635897838, 0.04870399484518982, 0.11167723701510113, 0.10547470921717052, -0.03797734889901351, 0.021484403962468996, -0.33234512888260986, -0.21228017323301174, -0.23293151288193517, 0.15080973610968482, -0.12710835546814842, -0.099888279219158, 0.33391062006038347, 0.06888460693880916, 0.17077763525802375, 0.13285356148013047, 0.24843206442892551, 0.13387703866880787, 0.06229762001229184, 0.1067901590722613, 0.1301734395217084, 0.20422964293642767, -0.013540152422917475, -0.1856444199760777, -0.030760594915981137, 0.1678900113869791] |
1,801.10299 | Underwater Quantum Key Distribution in Outdoor Conditions with Twisted
Photons | Quantum communication has been successfully implemented in optical fibres and
through free-space [1-3]. Fibre systems, though capable of fast key rates and
low quantum bit error rates (QBERs), are impractical in communicating with
destinations without an established fibre link [4]. Free-space quantum channels
can overcome such limitations and reach long distances with the advent of
satellite-to-ground links [5-8]. Shorter line-of-sight free-space links have
also been realized for intra-city conditions [2, 9]. However, turbulence,
resulting from local fluctuations in refractive index, becomes a major
challenge by adding errors and losses [10]. Recently, an interest in
investigating the possibility of underwater quantum channels has arisen, which
could provide global secure communication channels among submersibles and boats
[11-13]. Here, we investigate the effect of turbulence on an underwater quantum
channel using twisted photons in outdoor conditions. We study the effect of
turbulence on transmitted QBERs, and compare different QKD protocols in an
underwater quantum channel showing the feasibility of high-dimensional encoding
schemes. Our work may open the way for secure high-dimensional quantum
communication between submersibles, and provides important input for potential
submersibles-to-satellite quantum communication.
| quant-ph physics.optics | quantum communication has been successfully implemented in optical fibres and through freespace 13 fibre systems though capable of fast key rates and low quantum bit error rates qbers are impractical in communicating with destinations without an established fibre link 4 freespace quantum channels can overcome such limitations and reach long distances with the advent of satellitetoground links 58 shorter lineofsight freespace links have also been realized for intracity conditions 2 9 however turbulence resulting from local fluctuations in refractive index becomes a major challenge by adding errors and losses 10 recently an interest in investigating the possibility of underwater quantum channels has arisen which could provide global secure communication channels among submersibles and boats 1113 here we investigate the effect of turbulence on an underwater quantum channel using twisted photons in outdoor conditions we study the effect of turbulence on transmitted qbers and compare different qkd protocols in an underwater quantum channel showing the feasibility of highdimensional encoding schemes our work may open the way for secure highdimensional quantum communication between submersibles and provides important input for potential submersiblestosatellite quantum communication | [['quantum', 'communication', 'has', 'been', 'successfully', 'implemented', 'in', 'optical', 'fibres', 'and', 'through', 'freespace', '13', 'fibre', 'systems', 'though', 'capable', 'of', 'fast', 'key', 'rates', 'and', 'low', 'quantum', 'bit', 'error', 'rates', 'qbers', 'are', 'impractical', 'in', 'communicating', 'with', 'destinations', 'without', 'an', 'established', 'fibre', 'link', '4', 'freespace', 'quantum', 'channels', 'can', 'overcome', 'such', 'limitations', 'and', 'reach', 'long', 'distances', 'with', 'the', 'advent', 'of', 'satellitetoground', 'links', '58', 'shorter', 'lineofsight', 'freespace', 'links', 'have', 'also', 'been', 'realized', 'for', 'intracity', 'conditions', '2', '9', 'however', 'turbulence', 'resulting', 'from', 'local', 'fluctuations', 'in', 'refractive', 'index', 'becomes', 'a', 'major', 'challenge', 'by', 'adding', 'errors', 'and', 'losses', '10', 'recently', 'an', 'interest', 'in', 'investigating', 'the', 'possibility', 'of', 'underwater', 'quantum', 'channels', 'has', 'arisen', 'which', 'could', 'provide', 'global', 'secure', 'communication', 'channels', 'among', 'submersibles', 'and', 'boats', '1113', 'here', 'we', 'investigate', 'the', 'effect', 'of', 'turbulence', 'on', 'an', 'underwater', 'quantum', 'channel', 'using', 'twisted', 'photons', 'in', 'outdoor', 'conditions', 'we', 'study', 'the', 'effect', 'of', 'turbulence', 'on', 'transmitted', 'qbers', 'and', 'compare', 'different', 'qkd', 'protocols', 'in', 'an', 'underwater', 'quantum', 'channel', 'showing', 'the', 'feasibility', 'of', 'highdimensional', 'encoding', 'schemes', 'our', 'work', 'may', 'open', 'the', 'way', 'for', 'secure', 'highdimensional', 'quantum', 'communication', 'between', 'submersibles', 'and', 'provides', 'important', 'input', 'for', 'potential', 'submersiblestosatellite', 'quantum', 'communication']] | [-0.22341579190727448, 0.1556668823687595, -0.025679994238477746, 0.0366486543684863, 0.010224908868928722, -0.21966377639714, 0.047205979967217766, 0.415431510971001, -0.25794451269111857, -0.29959458501726977, 0.10132067643100752, -0.20944458636549418, -0.1358125272515659, 0.2725544317450186, -0.11305354082998767, 0.1439044898313083, 0.0631162482987451, -0.028922698257610024, -0.0004995555587157377, -0.24017897590319887, 0.27501006780605597, 0.07301303587220818, 0.3287728422947929, 0.07032666987901537, 0.10230312274057377, 0.022636634061568198, -0.05488862924858551, -0.07203568067935327, -0.11191465577183898, 0.08016542465363242, 0.2814460821904954, 0.08798734207632376, 0.2655745032609681, -0.46421987702023615, -0.2864389069891127, 0.10184213492935629, 0.18272617744187708, 0.13961395481274347, -0.06231291559158584, -0.3132196368435084, 0.07512513136888822, -0.19687684159725904, -0.08258067499950864, -0.003611459827123817, 0.0061634747446200734, -0.012194954461857593, -0.23046301734853494, 0.034014401165212586, -0.02235787835108179, 0.11869353992508704, 0.025694997936390403, -0.05270227337821146, 0.04936815768328569, 0.19486546695357962, -0.04858258822566589, -0.015268320760564105, 0.11371395062901121, -0.1646482389710655, -0.16279209740302955, 0.37826246501919764, -0.024944378878337396, -0.15942368936970872, 0.19701740231294332, -0.04997374200565594, -0.06982019687008657, 0.1333604670329846, 0.21277518477814084, 0.014610664586777265, -0.14905246776225192, 0.036931836339769354, 0.021050767992685935, 0.16927424294833524, 0.09127898380066153, 0.16508012132070374, 0.18879071462198338, 0.15049818567663503, 0.0734919826300642, 0.11648325669563511, -0.15310972396662365, -0.13085986843876793, -0.22492601425816003, -0.17828688525144806, -0.189246863205237, 0.0770945894333084, -0.07490140658594326, -0.04680579201072413, 0.3115500202768723, 0.15640235634120392, 0.12394126620813367, 0.02460086106236375, 0.36847199803529557, 0.047684728712748654, 0.0760561521422184, 0.11801825253439419, 0.27695657795143386, 0.17252273482056021, 0.09779847176023497, -0.16296990715080723, 0.06696922491955978, -0.04014178949900055] |
1,801.103 | Netizen-Style Commenting on Fashion Photos: Dataset and Diversity
Measures | Recently, deep neural network models have achieved promising results in image
captioning task. Yet, "vanilla" sentences, only describing shallow appearances
(e.g., types, colors), generated by current works are not satisfied netizen
style resulting in lacking engagements, contexts, and user intentions. To
tackle this problem, we propose Netizen Style Commenting (NSC), to
automatically generate characteristic comments to a user-contributed fashion
photo. We are devoted to modulating the comments in a vivid "netizen" style
which reflects the culture in a designated social community and hopes to
facilitate more engagement with users. In this work, we design a novel
framework that consists of three major components: (1) We construct a
large-scale clothing dataset named NetiLook, which contains 300K posts (photos)
with 5M comments to discover netizen-style comments. (2) We propose three
unique measures to estimate the diversity of comments. (3) We bring diversity
by marrying topic models with neural networks to make up the insufficiency of
conventional image captioning works. Experimenting over Flickr30k and our
NetiLook datasets, we demonstrate our proposed approaches benefit fashion photo
commenting and improve image captioning tasks both in accuracy and diversity.
| cs.CV | recently deep neural network models have achieved promising results in image captioning task yet vanilla sentences only describing shallow appearances eg types colors generated by current works are not satisfied netizen style resulting in lacking engagements contexts and user intentions to tackle this problem we propose netizen style commenting nsc to automatically generate characteristic comments to a usercontributed fashion photo we are devoted to modulating the comments in a vivid netizen style which reflects the culture in a designated social community and hopes to facilitate more engagement with users in this work we design a novel framework that consists of three major components 1 we construct a largescale clothing dataset named netilook which contains 300k posts photos with 5m comments to discover netizenstyle comments 2 we propose three unique measures to estimate the diversity of comments 3 we bring diversity by marrying topic models with neural networks to make up the insufficiency of conventional image captioning works experimenting over flickr30k and our netilook datasets we demonstrate our proposed approaches benefit fashion photo commenting and improve image captioning tasks both in accuracy and diversity | [['recently', 'deep', 'neural', 'network', 'models', 'have', 'achieved', 'promising', 'results', 'in', 'image', 'captioning', 'task', 'yet', 'vanilla', 'sentences', 'only', 'describing', 'shallow', 'appearances', 'eg', 'types', 'colors', 'generated', 'by', 'current', 'works', 'are', 'not', 'satisfied', 'netizen', 'style', 'resulting', 'in', 'lacking', 'engagements', 'contexts', 'and', 'user', 'intentions', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'netizen', 'style', 'commenting', 'nsc', 'to', 'automatically', 'generate', 'characteristic', 'comments', 'to', 'a', 'usercontributed', 'fashion', 'photo', 'we', 'are', 'devoted', 'to', 'modulating', 'the', 'comments', 'in', 'a', 'vivid', 'netizen', 'style', 'which', 'reflects', 'the', 'culture', 'in', 'a', 'designated', 'social', 'community', 'and', 'hopes', 'to', 'facilitate', 'more', 'engagement', 'with', 'users', 'in', 'this', 'work', 'we', 'design', 'a', 'novel', 'framework', 'that', 'consists', 'of', 'three', 'major', 'components', '1', 'we', 'construct', 'a', 'largescale', 'clothing', 'dataset', 'named', 'netilook', 'which', 'contains', '300k', 'posts', 'photos', 'with', '5m', 'comments', 'to', 'discover', 'netizenstyle', 'comments', '2', 'we', 'propose', 'three', 'unique', 'measures', 'to', 'estimate', 'the', 'diversity', 'of', 'comments', '3', 'we', 'bring', 'diversity', 'by', 'marrying', 'topic', 'models', 'with', 'neural', 'networks', 'to', 'make', 'up', 'the', 'insufficiency', 'of', 'conventional', 'image', 'captioning', 'works', 'experimenting', 'over', 'flickr30k', 'and', 'our', 'netilook', 'datasets', 'we', 'demonstrate', 'our', 'proposed', 'approaches', 'benefit', 'fashion', 'photo', 'commenting', 'and', 'improve', 'image', 'captioning', 'tasks', 'both', 'in', 'accuracy', 'and', 'diversity']] | [-0.05774478445204699, -0.014973141755197301, -0.03230179103815721, 0.07401110645926869, -0.18003475670961455, -0.19752111290322824, 0.041845813046933876, 0.4805982471236752, -0.219406129205082, -0.3645510526167022, 0.03391492843931903, -0.3243435560166189, -0.20431875333662092, 0.15829136151199538, -0.18659029087672632, 0.009777221062944996, 0.11654960605212383, 0.022391559633090058, -0.050900925560078275, -0.33793243108278453, 0.31315377272015515, 0.02618365447770985, 0.3375454742875364, 0.06523601596418302, 0.12377694232337591, -0.05361968049417353, -0.09025390716140262, -0.025982858032188638, -0.08668985219252742, 0.19052366775447607, 0.34756332542605783, 0.22759496815528513, 0.34700422807751846, -0.40391995986509655, -0.21195207349697334, 0.039633943205181925, 0.12107052679275512, 0.10890737344945794, -0.081985948872898, -0.3733970854431391, 0.112969837945679, -0.20113161235996005, 0.01517323795835384, -0.1415279397352909, 0.005006895214319229, -0.023115821123550026, -0.22543568552031906, 0.009411134012043475, 0.08738772535515535, 0.0822541906412678, -0.019780104937187085, -0.11913819550536572, 0.057000132572526736, 0.19375300877856919, 0.07197150460625482, 0.04352631057328027, 0.14016508673602301, -0.21602133221668837, -0.16775114895750043, 0.37008939757943154, -0.06500779173867259, -0.17614560272130703, 0.18711453776599632, -0.023142501572147013, -0.15118099754779704, 0.059243136062286796, 0.22257030371563613, 0.1023244403496695, -0.1871091714956694, -0.05369751537639079, -0.07326531660639578, 0.21064301876402977, 0.0883770329450878, 0.006097000327685641, 0.22728346477573116, 0.2546787861825174, -0.03523321674345223, 0.12588178657849008, -0.04614281872442613, -0.04555514649093513, -0.14506854889396992, -0.09435831362627344, -0.1151835305072988, -0.0022392255861228075, -0.03775536326858047, -0.10743038443146766, 0.43319773505855763, 0.2633473381594134, 0.19733358052326366, 0.09056630689592567, 0.3045806102972064, -0.02422186651124826, 0.11713581021564702, 0.08816293152534248, 0.12163921608524915, -0.03706142648588866, 0.19209212649600685, -0.0998704601396134, 0.05635237362779056, 0.04645976104721841] |
1,801.10301 | Molecular Gas Toward the Gemini OB1 Molecular Cloud Complex II: CO
Outflow Candidates with Possible WISE Associations | We present a large scale survey of CO outflows in the Gem OB1 molecular cloud
complex and its surroundings using the Purple Mountain Observatory Delingha
13.7 m telescope. A total of 198 outflow candidates were identified over a
large area ($\sim$ 58.5 square degrees), of which 193 are newly detected.
Approximately 68% (134/198) are associated with the Gem OB1 molecular cloud
complex, including clouds GGMC 1, GGMC 2, BFS 52, GGMC 3 and GGMC 4. Other
regions studied are: Local Arm (Local Lynds, West Front), Swallow, Horn, and
Remote cloud. Outflow candidates in GGMC 1, BFS 52, and Swallow are mainly
located at ring-like or filamentary structures. To avoid excessive uncertainty
in distant regions ($\gtrsim$ 3.8 kpc), we only estimated the physical
parameters for clouds in the Gem OB1 molecular cloud complex and in the Local
arm. In those clouds, the total kinetic energy and the energy injection rate of
the identified outflow candidates are $\lesssim$ 1% and $\lesssim$ 3% of the
turbulent energy and the turbulent dissipation rate of each cloud, indicating
that the identified outflow candidates cannot provide enough energy to balance
turbulence of their host cloud at the scale of the entire cloud (several pc to
dozens of pc). The gravitational binding energy of each cloud is $\gtrsim$ 135
times the total kinetic energy of the identified outflow candidates within the
corresponding cloud, indicating that the identified outflow candidates cannot
cause major disruptions to the integrity of their host cloud at the scale of
the entire cloud.
| astro-ph.GA | we present a large scale survey of co outflows in the gem ob1 molecular cloud complex and its surroundings using the purple mountain observatory delingha 137 m telescope a total of 198 outflow candidates were identified over a large area sim 585 square degrees of which 193 are newly detected approximately 68 134198 are associated with the gem ob1 molecular cloud complex including clouds ggmc 1 ggmc 2 bfs 52 ggmc 3 and ggmc 4 other regions studied are local arm local lynds west front swallow horn and remote cloud outflow candidates in ggmc 1 bfs 52 and swallow are mainly located at ringlike or filamentary structures to avoid excessive uncertainty in distant regions gtrsim 38 kpc we only estimated the physical parameters for clouds in the gem ob1 molecular cloud complex and in the local arm in those clouds the total kinetic energy and the energy injection rate of the identified outflow candidates are lesssim 1 and lesssim 3 of the turbulent energy and the turbulent dissipation rate of each cloud indicating that the identified outflow candidates cannot provide enough energy to balance turbulence of their host cloud at the scale of the entire cloud several pc to dozens of pc the gravitational binding energy of each cloud is gtrsim 135 times the total kinetic energy of the identified outflow candidates within the corresponding cloud indicating that the identified outflow candidates cannot cause major disruptions to the integrity of their host cloud at the scale of the entire cloud | [['we', 'present', 'a', 'large', 'scale', 'survey', 'of', 'co', 'outflows', 'in', 'the', 'gem', 'ob1', 'molecular', 'cloud', 'complex', 'and', 'its', 'surroundings', 'using', 'the', 'purple', 'mountain', 'observatory', 'delingha', '137', 'm', 'telescope', 'a', 'total', 'of', '198', 'outflow', 'candidates', 'were', 'identified', 'over', 'a', 'large', 'area', 'sim', '585', 'square', 'degrees', 'of', 'which', '193', 'are', 'newly', 'detected', 'approximately', '68', '134198', 'are', 'associated', 'with', 'the', 'gem', 'ob1', 'molecular', 'cloud', 'complex', 'including', 'clouds', 'ggmc', '1', 'ggmc', '2', 'bfs', '52', 'ggmc', '3', 'and', 'ggmc', '4', 'other', 'regions', 'studied', 'are', 'local', 'arm', 'local', 'lynds', 'west', 'front', 'swallow', 'horn', 'and', 'remote', 'cloud', 'outflow', 'candidates', 'in', 'ggmc', '1', 'bfs', '52', 'and', 'swallow', 'are', 'mainly', 'located', 'at', 'ringlike', 'or', 'filamentary', 'structures', 'to', 'avoid', 'excessive', 'uncertainty', 'in', 'distant', 'regions', 'gtrsim', '38', 'kpc', 'we', 'only', 'estimated', 'the', 'physical', 'parameters', 'for', 'clouds', 'in', 'the', 'gem', 'ob1', 'molecular', 'cloud', 'complex', 'and', 'in', 'the', 'local', 'arm', 'in', 'those', 'clouds', 'the', 'total', 'kinetic', 'energy', 'and', 'the', 'energy', 'injection', 'rate', 'of', 'the', 'identified', 'outflow', 'candidates', 'are', 'lesssim', '1', 'and', 'lesssim', '3', 'of', 'the', 'turbulent', 'energy', 'and', 'the', 'turbulent', 'dissipation', 'rate', 'of', 'each', 'cloud', 'indicating', 'that', 'the', 'identified', 'outflow', 'candidates', 'can', 'not', 'provide', 'enough', 'energy', 'to', 'balance', 'turbulence', 'of', 'their', 'host', 'cloud', 'at', 'the', 'scale', 'of', 'the', 'entire', 'cloud', 'several', 'pc', 'to', 'dozens', 'of', 'pc', 'the', 'gravitational', 'binding', 'energy', 'of', 'each', 'cloud', 'is', 'gtrsim', '135', 'times', 'the', 'total', 'kinetic', 'energy', 'of', 'the', 'identified', 'outflow', 'candidates', 'within', 'the', 'corresponding', 'cloud', 'indicating', 'that', 'the', 'identified', 'outflow', 'candidates', 'can', 'not', 'cause', 'major', 'disruptions', 'to', 'the', 'integrity', 'of', 'their', 'host', 'cloud', 'at', 'the', 'scale', 'of', 'the', 'entire', 'cloud']] | [-0.17228923160425086, 0.09263662220789602, 0.01726106255949731, 0.06072692958446984, -0.03207658253706606, -0.06789415105861941, 0.07138891637314156, 0.3709965138116377, -0.22676329596517272, -0.40098630679670194, 0.07752150044019568, -0.27749787982779583, 0.015252160619428582, 0.15149081595041658, 0.041255515090104534, -0.015442406340544872, 0.019131922628034828, -0.05190180746021688, 0.00673851353186832, -0.19653653503586704, 0.25900537240264687, 0.10992572071268204, 0.15043371702512853, 0.03303147995180313, 0.10550272586269385, -0.161813369627478, -0.03931309286953948, -0.06005569309760553, -0.13121136183883164, 0.0889533274163273, 0.1991555507320807, 0.10202857678889694, 0.24845722953295446, -0.37918278949142276, -0.1789123852035973, 0.04892000128362936, 0.19975242017586511, -0.029997637616451904, -0.003175910950946321, -0.28958391281358703, 0.13388635560803383, -0.21084649048270696, -0.19036760515128948, 0.08817891393875354, 0.0898604549289462, 0.08913611295629308, -0.19198556397846747, 0.13631002297533343, -0.06338890435812304, 0.09556739947821692, -0.10031349353809503, -0.15546857885482065, -0.08426968720361248, 0.06250117305180139, -0.030482459506316787, 0.11956916083266357, 0.2771677583877175, -0.16426761113329832, -0.013977031368183426, 0.41226618967772244, -0.002400677173446671, -0.02714690802325736, 0.2542287705918826, -0.19610575748332942, -0.1722784381215108, 0.21660430566639644, 0.1468044912036271, 0.10581570586738774, -0.15399997455969572, 0.0006951464440272861, -0.03589427697312725, 0.18952499427164782, 0.07734208318694269, 0.06136079872420347, 0.29185810261053513, 0.08689759135899316, 0.04621182684415573, 0.10221704042936858, -0.3060395322720134, -0.12825220245756655, -0.24253845953431716, -0.14024725612401368, -0.13593484702414207, 0.05470104553967258, -0.12981840146963383, -0.061775473195065066, 0.29758213504785264, 0.08756748795930475, 0.21526613260760338, -0.017538849400278493, 0.27250908305163524, 0.03132428404405728, 0.1587582694503861, 0.1925132475233084, 0.26328991808227276, 0.10051988480952141, 0.12510389572452843, -0.18889688598678495, 0.03917070419019259, -0.031156688474074185] |
1,801.10302 | Endoscopic character identities for metaplectic groups | In this paper, we prove the conjectural endoscopic character identities for
tempered representations of metaplectic group $Mp_{2n}$ based on the formalism
of endoscopy theory by J. Adams, D. Renard and W.W. Li.
| math.RT | in this paper we prove the conjectural endoscopic character identities for tempered representations of metaplectic group mp_2n based on the formalism of endoscopy theory by j adams d renard and ww li | [['in', 'this', 'paper', 'we', 'prove', 'the', 'conjectural', 'endoscopic', 'character', 'identities', 'for', 'tempered', 'representations', 'of', 'metaplectic', 'group', 'mp_2n', 'based', 'on', 'the', 'formalism', 'of', 'endoscopy', 'theory', 'by', 'j', 'adams', 'd', 'renard', 'and', 'ww', 'li']] | [-0.12631566826894414, 0.07005169327021576, -0.1899325005360879, 0.03642219054381712, -0.09948198351776227, -0.11232347978511825, 0.018310122133698314, 0.27816747003817, -0.287434579920955, -0.1975664331985172, 0.007485083708161255, -0.16188139526639134, -0.25114729738561437, 0.1991819168906659, -0.1967223118408583, 0.024166026269085705, 0.0865440884954296, 0.033327682118397206, -0.0844453325989889, -0.30219119787216187, 0.38023977832926903, -0.05793859748700925, 0.22345581673744164, 0.06208842317573726, 0.05030377566436073, 0.13138266518944874, -0.1108602617168799, -0.22388124850112945, -0.1533523533726111, 0.2405867810593918, 0.31164329091552645, -0.012959457242686767, 0.1932687157750479, -0.37049271794967353, -0.10538755802554078, 0.10353985580150038, 0.11610631144139916, -0.009944743680534884, -0.010718641362473136, -0.36599539523012936, 0.14267311837465968, -0.24872053088620305, -0.1026324982085498, -0.1382708844030276, 0.11049278477730695, -0.035260010219644755, -0.26650994626106694, 0.10563728818669915, 0.12062082428019494, 0.16681320217321627, -0.10981070649359026, -0.13639706117101014, -0.00341189734172076, 0.05388292593124788, 0.006870431730931159, 0.03405886466498487, 0.07794462954916526, -0.16096299530909164, -0.1407001617772039, 0.32463205861859024, -0.042437269003130496, -0.16416855924762785, 0.09392901350656757, -0.11836368149670307, -0.23331586446147412, 0.04405236477032304, 0.0280918154749088, 0.19865603468497284, -0.039554440721985884, 0.23233737237569585, -0.13490529046976008, 0.03119249919473077, 0.1401370435487479, -0.02132630394771695, 0.05095434151007794, 0.001930523692863062, -0.030169611534802243, 0.059204215081990696, -0.04351446270447923, 0.018367442244198173, -0.32764046313241124, -0.29551790545440326, -0.1477066795268911, 0.10825049981940538, -0.005531845199129748, -0.09835308816036559, 0.41197815007762983, 0.10620091689634137, 0.16646395040879725, 0.15399629106832435, 0.18327652939478867, 0.0843259572648094, 0.01732341421302408, 0.03328088411944918, 0.0836673597805202, 0.29517952848254936, 0.013287013760418631, -0.15058497252175584, -0.08515883376821876, 0.32418135562329553] |
1,801.10303 | Water's interfacial hydrogen bonding structure reveals the effective
strength of surface-water interactions | The interactions of a hydrophilic surface with water can significantly
influence the characteristics of the liquid water interface. In this
manuscript, we explore this influence by studying the molecular structure of
liquid water at a disordered surface with tunable surface-water interactions.
We combine all-atom molecular dynamics simulations with a mean field model of
interfacial hydrogen bonding to analyze the effect of surface-water
interactions on the structural and energetic properties of the liquid water
interface. We find that the molecular structure of water at a weakly
interacting (i.e., hydrophobic) surface is resistant to change unless the
strength of surface-water interactions are above a certain threshold. We find
that below this threshold water's interfacial structure is homogeneous and
insensitive to the details of the disordered surface, however, above this
threshold water's interfacial structure is heterogeneous. Despite this
heterogeneity, we demonstrate that the equilibrium distribution of molecular
orientations can be used to quantify the energetic component of the
surface-water interactions that contribute specifically to modifying the
interfacial hydrogen bonding network. We identify this specific energetic
component as a new measure of hydrophilicity, which we refer to as the
intrinsic hydropathy.
| cond-mat.soft | the interactions of a hydrophilic surface with water can significantly influence the characteristics of the liquid water interface in this manuscript we explore this influence by studying the molecular structure of liquid water at a disordered surface with tunable surfacewater interactions we combine allatom molecular dynamics simulations with a mean field model of interfacial hydrogen bonding to analyze the effect of surfacewater interactions on the structural and energetic properties of the liquid water interface we find that the molecular structure of water at a weakly interacting ie hydrophobic surface is resistant to change unless the strength of surfacewater interactions are above a certain threshold we find that below this threshold waters interfacial structure is homogeneous and insensitive to the details of the disordered surface however above this threshold waters interfacial structure is heterogeneous despite this heterogeneity we demonstrate that the equilibrium distribution of molecular orientations can be used to quantify the energetic component of the surfacewater interactions that contribute specifically to modifying the interfacial hydrogen bonding network we identify this specific energetic component as a new measure of hydrophilicity which we refer to as the intrinsic hydropathy | [['the', 'interactions', 'of', 'a', 'hydrophilic', 'surface', 'with', 'water', 'can', 'significantly', 'influence', 'the', 'characteristics', 'of', 'the', 'liquid', 'water', 'interface', 'in', 'this', 'manuscript', 'we', 'explore', 'this', 'influence', 'by', 'studying', 'the', 'molecular', 'structure', 'of', 'liquid', 'water', 'at', 'a', 'disordered', 'surface', 'with', 'tunable', 'surfacewater', 'interactions', 'we', 'combine', 'allatom', 'molecular', 'dynamics', 'simulations', 'with', 'a', 'mean', 'field', 'model', 'of', 'interfacial', 'hydrogen', 'bonding', 'to', 'analyze', 'the', 'effect', 'of', 'surfacewater', 'interactions', 'on', 'the', 'structural', 'and', 'energetic', 'properties', 'of', 'the', 'liquid', 'water', 'interface', 'we', 'find', 'that', 'the', 'molecular', 'structure', 'of', 'water', 'at', 'a', 'weakly', 'interacting', 'ie', 'hydrophobic', 'surface', 'is', 'resistant', 'to', 'change', 'unless', 'the', 'strength', 'of', 'surfacewater', 'interactions', 'are', 'above', 'a', 'certain', 'threshold', 'we', 'find', 'that', 'below', 'this', 'threshold', 'waters', 'interfacial', 'structure', 'is', 'homogeneous', 'and', 'insensitive', 'to', 'the', 'details', 'of', 'the', 'disordered', 'surface', 'however', 'above', 'this', 'threshold', 'waters', 'interfacial', 'structure', 'is', 'heterogeneous', 'despite', 'this', 'heterogeneity', 'we', 'demonstrate', 'that', 'the', 'equilibrium', 'distribution', 'of', 'molecular', 'orientations', 'can', 'be', 'used', 'to', 'quantify', 'the', 'energetic', 'component', 'of', 'the', 'surfacewater', 'interactions', 'that', 'contribute', 'specifically', 'to', 'modifying', 'the', 'interfacial', 'hydrogen', 'bonding', 'network', 'we', 'identify', 'this', 'specific', 'energetic', 'component', 'as', 'a', 'new', 'measure', 'of', 'hydrophilicity', 'which', 'we', 'refer', 'to', 'as', 'the', 'intrinsic', 'hydropathy']] | [-0.14436031344849715, 0.19145842462548995, -0.07824877868462503, 0.06456304008930543, -0.01799232124246378, -0.10117668667552933, 0.05640768053204339, 0.3751016673656868, -0.30965866623595756, -0.3065263322469863, 0.0076726873443875325, -0.2707224036728774, -0.19087183285619128, 0.07292760342215113, 0.044854984469935896, -0.03378420199123137, 0.016241284079829797, -0.052139473937073334, -0.046669477581938, -0.16631842652624623, 0.3132831951239729, 0.08644632897265056, 0.26826535816737673, 0.16999921896856, 0.07332056792662106, -0.030607786948448994, 0.06389477382847332, 0.040739878299297455, -0.18513580831094587, 0.13109002105473355, 0.21486043820984382, -0.02859207645387334, 0.21804553115078035, -0.4757788440879972, -0.2529149419344205, 0.055689555854925056, 0.09994131159585189, 0.153090801022145, -0.030829052805631637, -0.2400778264272958, 0.054853275213465294, -0.13683104989452557, -0.15793281789361077, -0.032499514993300095, -0.010316528600919493, 0.09327225362441317, -0.18820098973188132, 0.10299588375062467, 0.03657575686248069, 0.07396207824050584, -0.0736924700226067, -0.10383244861106583, -0.09725945505169145, 0.11747913151533707, 0.01538694471576535, 0.011108377868718005, 0.27320781659414584, -0.17004951195950735, 0.005857945647075732, 0.40257248322275235, -0.08755761046301234, -0.17359435335698134, 0.26800850207075716, -0.13443881192837248, -0.11538614980368452, 0.20090207380098216, 0.177441643550992, 0.06258086430875057, -0.1594350367079783, 0.011251265720344761, -0.031263449174516345, 0.21722065271650326, 0.05282112567082924, 0.0021107353445610657, 0.22629923161547533, 0.22333026647488063, 0.06547446486186535, 0.17491606931652834, -0.13384104711265069, -0.08086797099480814, -0.20912527930932145, -0.19125612968308753, -0.15187532516983263, 0.034369476823096365, -0.04984649186091682, -0.19908519441860772, 0.37961489907939006, 0.14565599818701824, 0.14495164211490813, -0.0005532975618622918, 0.2324298017597284, 0.028537731120900755, 0.04516424000684052, 0.028865444120318495, 0.27205939234961524, 0.12436388924414103, 0.05695892956212442, -0.2835537825292723, 0.15359855441745113, -0.007085540508701999] |
1,801.10304 | Action Recognition with Spatio-Temporal Visual Attention on Skeleton
Image Sequences | Action recognition with 3D skeleton sequences is becoming popular due to its
speed and robustness. The recently proposed Convolutional Neural Networks (CNN)
based methods have shown good performance in learning spatio-temporal
representations for skeleton sequences. Despite the good recognition accuracy
achieved by previous CNN based methods, there exist two problems that
potentially limit the performance. First, previous skeleton representations are
generated by chaining joints with a fixed order. The corresponding semantic
meaning is unclear and the structural information among the joints is lost.
Second, previous models do not have an ability to focus on informative joints.
The attention mechanism is important for skeleton based action recognition
because there exist spatio-temporal key stages while the joint predictions can
be inaccurate. To solve these two problems, we propose a novel CNN based method
for skeleton based action recognition. We first redesign the skeleton
representations with a depth-first tree traversal order, which enhances the
semantic meaning of skeleton images and better preserves the associated
structural information. We then propose the idea of a two-branch attention
architecture that focuses on spatio-temporal key stages and filters out
unreliable joint predictions. A base attention model with the simplest
structure is first introduced. By improving the structures in both branches, we
further propose a Global Long-sequence Attention Network (GLAN). Furthermore,
in order to adjust the kernel's spatio-temporal aspect ratios and better
capture long term dependencies, we propose a Sub-Sequence Attention Network
(SSAN) that takes sub-image sequences as inputs. Our experiment results on NTU
RGB+D and SBU Kinetic Interaction outperforms the state-of-the-art. The model
is further validated on noisy estimated poses from UCF101 and Kinetics.
| cs.CV | action recognition with 3d skeleton sequences is becoming popular due to its speed and robustness the recently proposed convolutional neural networks cnn based methods have shown good performance in learning spatiotemporal representations for skeleton sequences despite the good recognition accuracy achieved by previous cnn based methods there exist two problems that potentially limit the performance first previous skeleton representations are generated by chaining joints with a fixed order the corresponding semantic meaning is unclear and the structural information among the joints is lost second previous models do not have an ability to focus on informative joints the attention mechanism is important for skeleton based action recognition because there exist spatiotemporal key stages while the joint predictions can be inaccurate to solve these two problems we propose a novel cnn based method for skeleton based action recognition we first redesign the skeleton representations with a depthfirst tree traversal order which enhances the semantic meaning of skeleton images and better preserves the associated structural information we then propose the idea of a twobranch attention architecture that focuses on spatiotemporal key stages and filters out unreliable joint predictions a base attention model with the simplest structure is first introduced by improving the structures in both branches we further propose a global longsequence attention network glan furthermore in order to adjust the kernels spatiotemporal aspect ratios and better capture long term dependencies we propose a subsequence attention network ssan that takes subimage sequences as inputs our experiment results on ntu rgbd and sbu kinetic interaction outperforms the stateoftheart the model is further validated on noisy estimated poses from ucf101 and kinetics | [['action', 'recognition', 'with', '3d', 'skeleton', 'sequences', 'is', 'becoming', 'popular', 'due', 'to', 'its', 'speed', 'and', 'robustness', 'the', 'recently', 'proposed', 'convolutional', 'neural', 'networks', 'cnn', 'based', 'methods', 'have', 'shown', 'good', 'performance', 'in', 'learning', 'spatiotemporal', 'representations', 'for', 'skeleton', 'sequences', 'despite', 'the', 'good', 'recognition', 'accuracy', 'achieved', 'by', 'previous', 'cnn', 'based', 'methods', 'there', 'exist', 'two', 'problems', 'that', 'potentially', 'limit', 'the', 'performance', 'first', 'previous', 'skeleton', 'representations', 'are', 'generated', 'by', 'chaining', 'joints', 'with', 'a', 'fixed', 'order', 'the', 'corresponding', 'semantic', 'meaning', 'is', 'unclear', 'and', 'the', 'structural', 'information', 'among', 'the', 'joints', 'is', 'lost', 'second', 'previous', 'models', 'do', 'not', 'have', 'an', 'ability', 'to', 'focus', 'on', 'informative', 'joints', 'the', 'attention', 'mechanism', 'is', 'important', 'for', 'skeleton', 'based', 'action', 'recognition', 'because', 'there', 'exist', 'spatiotemporal', 'key', 'stages', 'while', 'the', 'joint', 'predictions', 'can', 'be', 'inaccurate', 'to', 'solve', 'these', 'two', 'problems', 'we', 'propose', 'a', 'novel', 'cnn', 'based', 'method', 'for', 'skeleton', 'based', 'action', 'recognition', 'we', 'first', 'redesign', 'the', 'skeleton', 'representations', 'with', 'a', 'depthfirst', 'tree', 'traversal', 'order', 'which', 'enhances', 'the', 'semantic', 'meaning', 'of', 'skeleton', 'images', 'and', 'better', 'preserves', 'the', 'associated', 'structural', 'information', 'we', 'then', 'propose', 'the', 'idea', 'of', 'a', 'twobranch', 'attention', 'architecture', 'that', 'focuses', 'on', 'spatiotemporal', 'key', 'stages', 'and', 'filters', 'out', 'unreliable', 'joint', 'predictions', 'a', 'base', 'attention', 'model', 'with', 'the', 'simplest', 'structure', 'is', 'first', 'introduced', 'by', 'improving', 'the', 'structures', 'in', 'both', 'branches', 'we', 'further', 'propose', 'a', 'global', 'longsequence', 'attention', 'network', 'glan', 'furthermore', 'in', 'order', 'to', 'adjust', 'the', 'kernels', 'spatiotemporal', 'aspect', 'ratios', 'and', 'better', 'capture', 'long', 'term', 'dependencies', 'we', 'propose', 'a', 'subsequence', 'attention', 'network', 'ssan', 'that', 'takes', 'subimage', 'sequences', 'as', 'inputs', 'our', 'experiment', 'results', 'on', 'ntu', 'rgbd', 'and', 'sbu', 'kinetic', 'interaction', 'outperforms', 'the', 'stateoftheart', 'the', 'model', 'is', 'further', 'validated', 'on', 'noisy', 'estimated', 'poses', 'from', 'ucf101', 'and', 'kinetics']] | [-0.06823549131601767, 0.008233012291164028, -0.06574392856242467, 0.05370226973988765, -0.12652479834011474, -0.15221839844580795, -0.009409770222246703, 0.46815445590199845, -0.2584361680289448, -0.28362055876933673, 0.06272255096304104, -0.259338657623933, -0.24898809112015774, 0.1506486068974482, -0.142203484637183, 0.10909795132796386, 0.15949984904816092, 0.08393134505868974, -0.05089114473164293, -0.2552697131962332, 0.3063649661401569, 0.050555483679724574, 0.3738983266652433, 0.019583665578851873, 0.16876452880078982, -0.026087195351437636, -0.046145768999739434, -0.015309830815319649, -0.07195073448931935, 0.19162854203023016, 0.251436020072092, 0.15563216971085322, 0.29773285384748527, -0.44844595217287087, -0.24591885404449634, 0.07283189929633711, 0.14184242347470322, 0.10304080890041818, -0.020450456651760207, -0.33131491471519414, 0.10700529090315809, -0.14331842165186323, 0.031730113400430346, -0.14347911201184615, 0.007874671019222164, -0.015467596304061413, -0.28725113995151885, 0.024105442696247446, 0.10205015317059764, 0.05434027379096457, -0.038218358147511906, -0.1137021691732419, -0.00819868428229573, 0.2001478154684953, 0.04125921068198019, 0.0627059391973131, 0.11598136072809045, -0.1839103197192096, -0.1436790494075412, 0.381173888517713, -0.05194225566546348, -0.22639935842986839, 0.21173305812849183, -0.03377511578957748, -0.16768683692101727, 0.12959992907108794, 0.1958503665276415, 0.1194045573885722, -0.14580793510333134, 0.021572638252991688, -0.03199562861074369, 0.2077883668459959, 0.06104814670944699, 0.0047854410191631004, 0.2018052939957036, 0.2747407468762531, 0.0174837936920636, 0.1200977838567324, -0.12393091205431671, -0.08804350608702269, -0.18541420948564669, -0.06412430794774661, -0.1659957129644075, -0.06468221061958034, -0.11305605753102899, -0.12754160006718876, 0.41427028397182847, 0.2394964264010813, 0.24983565700346266, 0.11466494505866924, 0.34449112102403445, 0.03675899266928547, 0.11092089953242314, 0.0899541910268564, 0.1725083413819613, 0.04648909577306106, 0.09922632578121865, -0.1711269062746424, 0.12667119093098198, 0.156602647400701] |
1,801.10305 | A gap theorem for positive Einstein metrics on the four-sphere | We show that there exists a universal positive constant $\varepsilon_0 > 0$
with the following property: Let $g$ be a positive Einstein metric on $S^4$. If
the Yamabe constant of the conformal class $[g]$ satisfies
$$ Y(S^4, [g]) >\frac{1}{\sqrt{3}} Y(S^4, [g_{\mathbb S}]) - \varepsilon_0 $$
where $g_{\mathbb S}$ denotes the standard round metric on $S^4$, then, up to
rescaling, $g$ is isometric to $g_{\mathbb S}$.
This is an extension of Gursky's gap theorem for positive Einstein metrics on
the four-sphere.
| math.DG | we show that there exists a universal positive constant varepsilon_0 0 with the following property let g be a positive einstein metric on s4 if the yamabe constant of the conformal class g satisfies ys4 g frac1sqrt3 ys4 g_mathbb s varepsilon_0 where g_mathbb s denotes the standard round metric on s4 then up to rescaling g is isometric to g_mathbb s this is an extension of gurskys gap theorem for positive einstein metrics on the foursphere | [['we', 'show', 'that', 'there', 'exists', 'a', 'universal', 'positive', 'constant', 'varepsilon_0', '0', 'with', 'the', 'following', 'property', 'let', 'g', 'be', 'a', 'positive', 'einstein', 'metric', 'on', 's4', 'if', 'the', 'yamabe', 'constant', 'of', 'the', 'conformal', 'class', 'g', 'satisfies', 'ys4', 'g', 'frac1sqrt3', 'ys4', 'g_mathbb', 's', 'varepsilon_0', 'where', 'g_mathbb', 's', 'denotes', 'the', 'standard', 'round', 'metric', 'on', 's4', 'then', 'up', 'to', 'rescaling', 'g', 'is', 'isometric', 'to', 'g_mathbb', 's', 'this', 'is', 'an', 'extension', 'of', 'gurskys', 'gap', 'theorem', 'for', 'positive', 'einstein', 'metrics', 'on', 'the', 'foursphere']] | [-0.23150083810091018, 0.11937312137665382, -0.0396526276320219, -0.0032028287447368104, -0.1268865868076682, -0.23536136886725822, -0.00557282934586207, 0.3298306720300267, -0.24449054221312205, -0.1928696272149682, 0.06357179773040116, -0.3527907123665015, -0.09058013199207683, 0.13391408985480666, -0.09738808445322017, -0.04611494461074472, 0.008717647343873978, 0.17835353939483564, -0.10703474059390525, -0.23934547026331227, 0.36949011812607446, -0.08945105555156867, 0.1791439803317189, 0.09324478930483261, 0.15166693380102514, -0.039320940791318815, 0.06046187294647098, 0.052867609672248364, -0.25762077425655056, 0.025941936261951924, 0.20123007227977116, 0.12750914996489882, 0.2574260727564494, -0.2748962243273854, -0.15094745664546888, 0.23930958669632674, 0.04810884196932117, -0.09112283736467361, 0.02003494398513188, -0.287496019291381, 0.17539418349663416, -0.09029279998193185, -0.12596140259566407, -0.010889779962599277, 0.18354810846348604, -0.10783528376370669, -0.26189818132047854, 0.008246827783683935, 0.11834058736761412, 0.00038765752067168553, -0.030504832870016495, -0.10860631447285414, -0.054295541644096376, 0.020229473486542703, 0.03981543159112334, 0.2044807854682828, 0.06771563875799377, 0.008184403728228063, -0.06755023572749148, 0.37683556949098906, -0.20790784064137066, -0.23732416780044635, 0.003103727400302887, -0.14547834885617097, -0.145681469142437, 0.05832099867363771, 0.06754493673642477, 0.19374413701395193, 0.0033429016917943953, 0.3038507034505407, -0.12398232782880465, 0.15377816038827102, 0.12251147917161385, -0.05560635156308611, 0.1136235671925048, 0.050954676351199546, 0.17117336376414946, 0.0641637144346411, 0.05912346721161157, 0.07685357363894582, -0.42750348084916673, -0.18864007347573836, -0.1807458699742953, 0.26210698316494624, -0.17710248526806632, -0.17768713184942803, 0.3071859410405159, -0.013528076516813599, 0.164516645334661, 0.1457700885583957, 0.13959091518539934, 0.05372676701595386, 0.05452947278196613, 0.14181828419367473, 0.1380330934623877, 0.19327775659660498, -0.041751957667681076, -0.20557708411167067, -0.07151077702641487, 0.21081721919278304] |
1,801.10306 | Positiveness of the permanent of 4-dimensional polystochastic matrices
of order 4 | A nonnegative multidimensional matrix is called polystochastic if the sum of
its entries over each line is equal to $1$. In this paper we overview known
results on positiveness of the permanent of polystochastic matrices and prove
that the permanent of every $4$-dimensional polystochastic matrix of order $4$
is greater than zero.
| math.CO | a nonnegative multidimensional matrix is called polystochastic if the sum of its entries over each line is equal to 1 in this paper we overview known results on positiveness of the permanent of polystochastic matrices and prove that the permanent of every 4dimensional polystochastic matrix of order 4 is greater than zero | [['a', 'nonnegative', 'multidimensional', 'matrix', 'is', 'called', 'polystochastic', 'if', 'the', 'sum', 'of', 'its', 'entries', 'over', 'each', 'line', 'is', 'equal', 'to', '1', 'in', 'this', 'paper', 'we', 'overview', 'known', 'results', 'on', 'positiveness', 'of', 'the', 'permanent', 'of', 'polystochastic', 'matrices', 'and', 'prove', 'that', 'the', 'permanent', 'of', 'every', '4dimensional', 'polystochastic', 'matrix', 'of', 'order', '4', 'is', 'greater', 'than', 'zero']] | [-0.14821812136170381, 0.12324824845955636, 0.008258283809902003, 0.005330273832301968, -0.04001067139996359, -0.12471842312683853, -0.02331698077614419, 0.3225164729385422, -0.22115992455599973, -0.18815227545117244, 0.17687210150269003, -0.3123832122924236, -0.20264901998094642, 0.11841212772280695, -0.07382394541771366, -0.008918721194137245, 0.03980354287733252, 0.14475832612683567, -0.14768965584852806, -0.2887687823520257, 0.33407200779765844, -0.01359376279064096, 0.19648015463518767, 0.08762513273037396, 0.15078787510999694, 0.02858819234937143, -0.02918233176191839, 0.008249164379846591, -0.09800500061450854, 0.1336753759219741, 0.1798009850944464, 0.172622601085235, 0.25741764874412465, -0.36177043103368933, -0.0837963862487903, 0.23658579960689308, 0.12666117052475995, 0.026620147552771065, 0.038030865049222484, -0.18954392557498068, 0.2113223136134016, -0.1834272407890799, -0.1553113663998934, -0.016022474012480907, 0.07974050947142622, 0.0065386855455402, -0.3049740036054013, 0.018275152462033126, 0.10143922529040048, 0.05044872770444132, -0.03726065052950826, -0.22303648398687634, 0.04436423466540873, 0.07228955860213879, 0.04114287172426255, 0.03319212291927005, 0.0609307935396478, -0.052226494026119605, -0.10634826527586064, 0.37814997358677477, -0.06584096894193163, -0.21345561599502197, 0.08350090474749987, -0.1818906328542373, -0.0861607209707682, 0.16095656249672174, 0.1316719706206081, 0.12051149303666674, -0.07682780128044005, 0.10536843398921729, -0.12463319727864403, 0.17445725775682008, 0.06041126886311059, -0.0173518582372568, 0.145013961654443, 0.0856616401579231, 0.16222883264820737, 0.12761415822807556, -0.013626041172896154, -0.055750259368393854, -0.32407951856461853, -0.20580942302834815, -0.2793762815328172, 0.13255959650716528, -0.12834730390610416, -0.18109044085185116, 0.4138004445972351, 0.10419307869429198, 0.17972614584813038, 0.09730100798277327, 0.2830673082767484, 0.11267475880539188, 0.05589686526666181, 0.07622968347277492, 0.13045231910655275, 0.20020188473594877, 0.04877742630420611, -0.12348582856177998, 0.07704346647817427, 0.10545109980739653] |
1,801.10307 | Non-Orthogonal Multi-Slater Determinant Expansions in Auxiliary Field
Quantum Monte Carlo | The Auxiliary-Field Quantum Monte Carlo (AFQMC) algorithm is a powerful
quantum many-body method that can be used successfully as an alternative to
standard quantum chemistry approaches to compute the ground state of many body
systems, such as molecules and solids, with high accuracy. In this article we
use AFQMC with trial wave-functions built from non-orthogonal multi Slater
determinant expansions to study the energetics of molecular systems, including
the 55 molecules of the G1 test set and the isomerization path of the
$[Cu_{2}O_{2}]^{2+}$ molecule. The main goal of this study is to show the
ability of non-orthogonal multi Slater determinant expansions to produce
high-quality, compact trial wave-functions for quantum Monte Carlo methods. We
obtain systematically improvable results as the number of determinants is
increased, with high accuracy typically obtained with tens of determinants.
Great reduction in the average error and traditional statistical indicators are
observed in the total and absorption energies of the molecules in the G1 test
set with as few as 10-20 determinants. In the case of the relative energies
along the isomerization path of the $[Cu_{2}O_{2}]^{2+}$, our results compare
favorably with other advanced quantum many-body methods, including DMRG and
complete-renormalized CCSD(T). Discrepancies in previous studies for this
molecular problem are identified and attributed to the differences in the
number of electrons and active spaces considered in such calculations.
| physics.chem-ph | the auxiliaryfield quantum monte carlo afqmc algorithm is a powerful quantum manybody method that can be used successfully as an alternative to standard quantum chemistry approaches to compute the ground state of many body systems such as molecules and solids with high accuracy in this article we use afqmc with trial wavefunctions built from nonorthogonal multi slater determinant expansions to study the energetics of molecular systems including the 55 molecules of the g1 test set and the isomerization path of the cu_2o_22 molecule the main goal of this study is to show the ability of nonorthogonal multi slater determinant expansions to produce highquality compact trial wavefunctions for quantum monte carlo methods we obtain systematically improvable results as the number of determinants is increased with high accuracy typically obtained with tens of determinants great reduction in the average error and traditional statistical indicators are observed in the total and absorption energies of the molecules in the g1 test set with as few as 1020 determinants in the case of the relative energies along the isomerization path of the cu_2o_22 our results compare favorably with other advanced quantum manybody methods including dmrg and completerenormalized ccsdt discrepancies in previous studies for this molecular problem are identified and attributed to the differences in the number of electrons and active spaces considered in such calculations | [['the', 'auxiliaryfield', 'quantum', 'monte', 'carlo', 'afqmc', 'algorithm', 'is', 'a', 'powerful', 'quantum', 'manybody', 'method', 'that', 'can', 'be', 'used', 'successfully', 'as', 'an', 'alternative', 'to', 'standard', 'quantum', 'chemistry', 'approaches', 'to', 'compute', 'the', 'ground', 'state', 'of', 'many', 'body', 'systems', 'such', 'as', 'molecules', 'and', 'solids', 'with', 'high', 'accuracy', 'in', 'this', 'article', 'we', 'use', 'afqmc', 'with', 'trial', 'wavefunctions', 'built', 'from', 'nonorthogonal', 'multi', 'slater', 'determinant', 'expansions', 'to', 'study', 'the', 'energetics', 'of', 'molecular', 'systems', 'including', 'the', '55', 'molecules', 'of', 'the', 'g1', 'test', 'set', 'and', 'the', 'isomerization', 'path', 'of', 'the', 'cu_2o_22', 'molecule', 'the', 'main', 'goal', 'of', 'this', 'study', 'is', 'to', 'show', 'the', 'ability', 'of', 'nonorthogonal', 'multi', 'slater', 'determinant', 'expansions', 'to', 'produce', 'highquality', 'compact', 'trial', 'wavefunctions', 'for', 'quantum', 'monte', 'carlo', 'methods', 'we', 'obtain', 'systematically', 'improvable', 'results', 'as', 'the', 'number', 'of', 'determinants', 'is', 'increased', 'with', 'high', 'accuracy', 'typically', 'obtained', 'with', 'tens', 'of', 'determinants', 'great', 'reduction', 'in', 'the', 'average', 'error', 'and', 'traditional', 'statistical', 'indicators', 'are', 'observed', 'in', 'the', 'total', 'and', 'absorption', 'energies', 'of', 'the', 'molecules', 'in', 'the', 'g1', 'test', 'set', 'with', 'as', 'few', 'as', '1020', 'determinants', 'in', 'the', 'case', 'of', 'the', 'relative', 'energies', 'along', 'the', 'isomerization', 'path', 'of', 'the', 'cu_2o_22', 'our', 'results', 'compare', 'favorably', 'with', 'other', 'advanced', 'quantum', 'manybody', 'methods', 'including', 'dmrg', 'and', 'completerenormalized', 'ccsdt', 'discrepancies', 'in', 'previous', 'studies', 'for', 'this', 'molecular', 'problem', 'are', 'identified', 'and', 'attributed', 'to', 'the', 'differences', 'in', 'the', 'number', 'of', 'electrons', 'and', 'active', 'spaces', 'considered', 'in', 'such', 'calculations']] | [-0.07291456566885386, 0.08792045562200888, -0.04239389108234515, 0.09469346377996464, 0.04357500639680314, -0.09144641058179273, 0.04938209045637977, 0.3833338128377313, -0.21926851524252733, -0.34411037648649523, 0.04385908046358831, -0.2960049345766164, -0.12057376557697444, 0.2077397906428299, 0.007427758490454116, 0.10931645099447879, 0.10871689342872397, 0.0027939790421799165, -0.11961767851740768, -0.23150843797043205, 0.2564246275825809, 0.08212682574543013, 0.2432997223227944, 0.05508054293092493, 0.057265479850676336, -0.006586962634672041, 0.015972518098442794, -0.02101526266925003, -0.11014769712243613, 0.17078636590440302, 0.29750975356628634, 0.08661871886765372, 0.26871383718834746, -0.4360305192799533, -0.20736257713203016, 0.06780690832284691, 0.14124025661789613, 0.15944086369041982, -0.014254011348733513, -0.2766406878299552, 0.04623258890069545, -0.20740785414393412, -0.15043114385988615, -0.11987814374404139, -0.038444967106937275, 0.06790777336015072, -0.22937527975943534, 0.08377668096951835, -0.05996713656107507, 0.06331924232199111, -0.0320777164046019, -0.17723427834542102, 0.016537262806158564, 0.11709530337939048, 0.031472960138293704, 0.06821226731546598, 0.1358596664070913, -0.1051835665345345, -0.17434401351099485, 0.41409654632108667, -0.048700881873142636, -0.19136453728238334, 0.2320191951842817, -0.1321825633829111, -0.15718575655674077, 0.16248455161832648, 0.1328418305926195, 0.1455517787599009, -0.12352068438811321, 0.04906264359591801, 0.012623663101830098, 0.13606214180554702, 0.013761463473002389, 0.05991704287283871, 0.14179533930288332, 0.1275467696348758, 0.0021711872807134063, 0.13324581846976483, -0.11307534464469103, -0.14944085779947497, -0.23217359050836192, -0.19380110130989797, -0.23988645392699703, 0.05463051991154478, -0.07019984919837512, -0.18778736427741033, 0.36966811575539854, 0.16031536997665893, 0.14806745450127207, 0.033412001670878294, 0.27327655927707617, 0.09812974004666576, 0.058315920360709574, 0.03057247776693354, 0.20947032017191047, 0.14997940937261264, 0.024793022010288282, -0.2571398980541316, 0.029539426589877977, 0.06697514856693475] |
1,801.10308 | Nested LSTMs | We propose Nested LSTMs (NLSTM), a novel RNN architecture with multiple
levels of memory. Nested LSTMs add depth to LSTMs via nesting as opposed to
stacking. The value of a memory cell in an NLSTM is computed by an LSTM cell,
which has its own inner memory cell. Specifically, instead of computing the
value of the (outer) memory cell as $c^{outer}_t = f_t \odot c_{t-1} + i_t
\odot g_t$, NLSTM memory cells use the concatenation $(f_t \odot c_{t-1}, i_t
\odot g_t)$ as input to an inner LSTM (or NLSTM) memory cell, and set
$c^{outer}_t$ = $h^{inner}_t$. Nested LSTMs outperform both stacked and
single-layer LSTMs with similar numbers of parameters in our experiments on
various character-level language modeling tasks, and the inner memories of an
LSTM learn longer term dependencies compared with the higher-level units of a
stacked LSTM.
| cs.CL cs.LG | we propose nested lstms nlstm a novel rnn architecture with multiple levels of memory nested lstms add depth to lstms via nesting as opposed to stacking the value of a memory cell in an nlstm is computed by an lstm cell which has its own inner memory cell specifically instead of computing the value of the outer memory cell as couter_t f_t odot c_t1 i_t odot g_t nlstm memory cells use the concatenation f_t odot c_t1 i_t odot g_t as input to an inner lstm or nlstm memory cell and set couter_t hinner_t nested lstms outperform both stacked and singlelayer lstms with similar numbers of parameters in our experiments on various characterlevel language modeling tasks and the inner memories of an lstm learn longer term dependencies compared with the higherlevel units of a stacked lstm | [['we', 'propose', 'nested', 'lstms', 'nlstm', 'a', 'novel', 'rnn', 'architecture', 'with', 'multiple', 'levels', 'of', 'memory', 'nested', 'lstms', 'add', 'depth', 'to', 'lstms', 'via', 'nesting', 'as', 'opposed', 'to', 'stacking', 'the', 'value', 'of', 'a', 'memory', 'cell', 'in', 'an', 'nlstm', 'is', 'computed', 'by', 'an', 'lstm', 'cell', 'which', 'has', 'its', 'own', 'inner', 'memory', 'cell', 'specifically', 'instead', 'of', 'computing', 'the', 'value', 'of', 'the', 'outer', 'memory', 'cell', 'as', 'couter_t', 'f_t', 'odot', 'c_t1', 'i_t', 'odot', 'g_t', 'nlstm', 'memory', 'cells', 'use', 'the', 'concatenation', 'f_t', 'odot', 'c_t1', 'i_t', 'odot', 'g_t', 'as', 'input', 'to', 'an', 'inner', 'lstm', 'or', 'nlstm', 'memory', 'cell', 'and', 'set', 'couter_t', 'hinner_t', 'nested', 'lstms', 'outperform', 'both', 'stacked', 'and', 'singlelayer', 'lstms', 'with', 'similar', 'numbers', 'of', 'parameters', 'in', 'our', 'experiments', 'on', 'various', 'characterlevel', 'language', 'modeling', 'tasks', 'and', 'the', 'inner', 'memories', 'of', 'an', 'lstm', 'learn', 'longer', 'term', 'dependencies', 'compared', 'with', 'the', 'higherlevel', 'units', 'of', 'a', 'stacked', 'lstm']] | [-0.12037788335036373, 0.09638721960866613, 0.026253979540232456, 0.058600416446676136, -0.08235691565399368, -0.18668538053999795, 0.08117381168465893, 0.48655625573133654, -0.339534865395928, -0.2647122967367371, 0.04296327253740111, -0.24839253004668563, -0.13837981407590577, 0.1410389655555429, -0.10131618133604978, 0.039876887320353875, 0.10403113078086101, 0.08442920313752962, -0.06559354184675172, -0.25778649341681914, 0.20648402482920297, 0.0709388839560702, 0.2555198998871316, -0.10520089608546572, 0.15858783058568157, -0.07485771938721, 0.03906637343320516, -0.0890308237973262, -0.06166046184918025, 0.1246012989361065, 0.22066614184189925, 0.08756406257761586, 0.2963839407276475, -0.5187854648737068, -0.2117829566017132, 0.027015173707199705, 0.1426212521583886, -0.015877200383163818, 0.06116568336570212, -0.23862804539473445, 0.1111263262608907, -0.2535199033533872, 0.07118949033037732, -0.11997538842401947, 0.007345511479246797, 0.023214630563884522, -0.3030317126355261, 0.041380926372243484, 0.14712082422126763, 0.016723146725615316, -0.03960025509657113, -0.16176704064745343, -0.055200024903928294, 0.15883958037540485, -0.012377916613001038, 0.09380148230543868, 0.14979369055733763, -0.11156845060715127, -0.15335905670706945, 0.28364938929338346, -0.10339581435740304, -0.23212805558278254, 0.12468369425782426, -0.023090043764871854, -0.10607217676994024, 0.02314834599735949, 0.16914353919723493, 0.06584918973826323, -0.14554004125635733, 0.04339242332913052, -0.06905317861078815, 0.22849930307270508, 0.1332810191194188, 0.0833273960937125, 0.20608723254267577, 0.30568269526614156, -0.01599583689433833, 0.13376092749901794, -0.15333271881558397, -0.06890911755159101, -0.17962923862267582, -0.108865787550299, -0.15384211169960813, 0.049256390634444404, -0.17058401675438456, -0.20631456393609618, 0.3702366091240423, 0.12466378551625619, 0.25324618803323107, 0.206325711760931, 0.3348066164321746, 0.038969284457187205, 0.26799310653851455, 0.115012425096762, 0.04648720198593131, 0.110013344529293, 0.10476301536166857, -0.21154286400115146, 0.07924914404495874, 0.07261240131673262] |
1,801.10309 | Demonstration of the Relationship between Sensitivity and
Identifiability for Inverse Uncertainty Quantification | Inverse Uncertainty Quantification (UQ), or Bayesian calibration, is the
process to quantify the uncertainties of random input parameters based on
experimental data. The introduction of model discrepancy term is significant
because "over-fitting" can theoretically be avoided. But it also poses
challenges in the practical applications. One of the mostly concerned and
unresolved problem is the "lack of identifiability" issue. With the presence of
model discrepancy, inverse UQ becomes "non-identifiable" in the sense that it
is difficult to precisely distinguish between the parameter uncertainties and
model discrepancy when estimating the calibration parameters. Previous research
to alleviate the non-identifiability issue focused on using informative priors
for the calibration parameters and the model discrepancy, which is usually not
a viable solution because one rarely has such accurate and informative prior
knowledge. In this work, we show that identifiability is largely related to the
sensitivity of the calibration parameters with regards to the chosen responses.
We adopted an improved modular Bayesian approach for inverse UQ that does not
require priors for the model discrepancy term. The relationship between
sensitivity and identifiability was demonstrated with a practical example in
nuclear engineering. It was shown that, in order for a certain calibration
parameter to be statistically identifiable, it should be significant to at
least one of the responses whose data are used for inverse UQ. Good
identifiability cannot be achieved for a certain calibration parameter if it is
not significant to any of the responses. It is also demonstrated that "fake
identifiability" is possible if model responses are not appropriately chosen,
or inaccurate but informative priors are specified.
| stat.AP | inverse uncertainty quantification uq or bayesian calibration is the process to quantify the uncertainties of random input parameters based on experimental data the introduction of model discrepancy term is significant because overfitting can theoretically be avoided but it also poses challenges in the practical applications one of the mostly concerned and unresolved problem is the lack of identifiability issue with the presence of model discrepancy inverse uq becomes nonidentifiable in the sense that it is difficult to precisely distinguish between the parameter uncertainties and model discrepancy when estimating the calibration parameters previous research to alleviate the nonidentifiability issue focused on using informative priors for the calibration parameters and the model discrepancy which is usually not a viable solution because one rarely has such accurate and informative prior knowledge in this work we show that identifiability is largely related to the sensitivity of the calibration parameters with regards to the chosen responses we adopted an improved modular bayesian approach for inverse uq that does not require priors for the model discrepancy term the relationship between sensitivity and identifiability was demonstrated with a practical example in nuclear engineering it was shown that in order for a certain calibration parameter to be statistically identifiable it should be significant to at least one of the responses whose data are used for inverse uq good identifiability cannot be achieved for a certain calibration parameter if it is not significant to any of the responses it is also demonstrated that fake identifiability is possible if model responses are not appropriately chosen or inaccurate but informative priors are specified | [['inverse', 'uncertainty', 'quantification', 'uq', 'or', 'bayesian', 'calibration', 'is', 'the', 'process', 'to', 'quantify', 'the', 'uncertainties', 'of', 'random', 'input', 'parameters', 'based', 'on', 'experimental', 'data', 'the', 'introduction', 'of', 'model', 'discrepancy', 'term', 'is', 'significant', 'because', 'overfitting', 'can', 'theoretically', 'be', 'avoided', 'but', 'it', 'also', 'poses', 'challenges', 'in', 'the', 'practical', 'applications', 'one', 'of', 'the', 'mostly', 'concerned', 'and', 'unresolved', 'problem', 'is', 'the', 'lack', 'of', 'identifiability', 'issue', 'with', 'the', 'presence', 'of', 'model', 'discrepancy', 'inverse', 'uq', 'becomes', 'nonidentifiable', 'in', 'the', 'sense', 'that', 'it', 'is', 'difficult', 'to', 'precisely', 'distinguish', 'between', 'the', 'parameter', 'uncertainties', 'and', 'model', 'discrepancy', 'when', 'estimating', 'the', 'calibration', 'parameters', 'previous', 'research', 'to', 'alleviate', 'the', 'nonidentifiability', 'issue', 'focused', 'on', 'using', 'informative', 'priors', 'for', 'the', 'calibration', 'parameters', 'and', 'the', 'model', 'discrepancy', 'which', 'is', 'usually', 'not', 'a', 'viable', 'solution', 'because', 'one', 'rarely', 'has', 'such', 'accurate', 'and', 'informative', 'prior', 'knowledge', 'in', 'this', 'work', 'we', 'show', 'that', 'identifiability', 'is', 'largely', 'related', 'to', 'the', 'sensitivity', 'of', 'the', 'calibration', 'parameters', 'with', 'regards', 'to', 'the', 'chosen', 'responses', 'we', 'adopted', 'an', 'improved', 'modular', 'bayesian', 'approach', 'for', 'inverse', 'uq', 'that', 'does', 'not', 'require', 'priors', 'for', 'the', 'model', 'discrepancy', 'term', 'the', 'relationship', 'between', 'sensitivity', 'and', 'identifiability', 'was', 'demonstrated', 'with', 'a', 'practical', 'example', 'in', 'nuclear', 'engineering', 'it', 'was', 'shown', 'that', 'in', 'order', 'for', 'a', 'certain', 'calibration', 'parameter', 'to', 'be', 'statistically', 'identifiable', 'it', 'should', 'be', 'significant', 'to', 'at', 'least', 'one', 'of', 'the', 'responses', 'whose', 'data', 'are', 'used', 'for', 'inverse', 'uq', 'good', 'identifiability', 'can', 'not', 'be', 'achieved', 'for', 'a', 'certain', 'calibration', 'parameter', 'if', 'it', 'is', 'not', 'significant', 'to', 'any', 'of', 'the', 'responses', 'it', 'is', 'also', 'demonstrated', 'that', 'fake', 'identifiability', 'is', 'possible', 'if', 'model', 'responses', 'are', 'not', 'appropriately', 'chosen', 'or', 'inaccurate', 'but', 'informative', 'priors', 'are', 'specified']] | [-0.0317248636046637, 0.07133338282186008, -0.054868634441378794, 0.13251649962229034, -0.14597661214253863, -0.16281972402536768, 0.03241899612088805, 0.41874885182303623, -0.297442059586809, -0.3547562910562572, 0.14930803690259717, -0.2519116568000201, -0.13318323260244025, 0.18480271019728522, -0.12114592358831161, 0.10190384707744711, 0.09704257153504008, 0.017276889003614963, -0.05164673602223545, -0.23718483824399741, 0.2973028449093774, 0.08604109099758045, 0.28350192683787856, 0.047734179271972904, 0.10578922100786559, -0.03613427627173044, -0.03226811383911072, 0.023853902766983886, -0.10455546967803962, 0.10352651061474243, 0.30278605582394386, 0.14784555303591512, 0.2997343812895648, -0.3486658754809884, -0.2538238503817936, 0.18021451415734882, 0.1326777555151159, 0.09557340762838226, -0.010382701413521805, -0.23765265755355358, 0.05993797188667233, -0.14031911387990012, -0.08146768225734954, -0.09838341690861964, 0.017913395710671923, -0.04254383981199546, -0.33387121314735296, 0.1048865950409192, 0.06282602529463752, 0.039349566599772005, -0.024525535200521555, -0.13189067078679942, 0.03166959969638475, 0.11837102079858292, 0.08995639231530046, 0.03296898535502359, 0.08141714574223802, -0.13459557592036633, -0.04406016127307308, 0.38467751944812983, 0.0032747475259508867, -0.2878725417312447, 0.14724397365474798, -0.09673963722900378, -0.15391315751843607, 0.10475332493815896, 0.1381678225219377, 0.07004514261026701, -0.19125856901812252, 0.061773797740386056, 6.814970291386085e-05, 0.2284529231995089, 0.007666278611018744, -0.026550060093841966, 0.16974457027656187, 0.18730850303244598, 0.06713431180337932, 0.062468190093174183, -0.08837559502642645, -0.06667988588382798, -0.29697428759853195, -0.0796481968782211, -0.18284598140297423, 0.009498447472215878, -0.07366988263791206, -0.16701693513495725, 0.35839651926144417, 0.24239121294251073, 0.19788956543706895, 0.004526211666350497, 0.310742958254064, 0.1234337315228927, 0.07300541751301837, 0.018133022278873073, 0.2900883967141858, 0.09515698282349104, 0.006867633679237203, -0.18772524513282987, 0.17906770305955932, -0.02625789094942944] |
1,801.1031 | Ten Years of PAMELA in Space | The PAMELA cosmic ray detector was launched on June 15th 2006 on board the
Russian Resurs-DK1 satellite, and during ten years of nearly continuous
data-taking it has observed new interesting features in cosmic rays (CRs). In a
decade of operation it has provided plenty of scientific data, covering
different issues related to cosmic ray physics. Its discoveries might change
our basic vision of the mechanisms of production, acceleration and propagation
of cosmic rays in the Galaxy. The antimatter measurements, focus of the
experiment, have set strong constraints to the nature of Dark Matter. Search
for signatures of more exotic processes (such as the ones involving Strange
Quark Matter) was also pursued. Furthermore, the long-term operation of the
instrument had allowed a constant monitoring of the solar activity during its
maximum and a detailed and prolonged study of the solar modulation, improving
the comprehension of the heliosphere mechanisms. PAMELA had also measured the
radiation environment around the Earth, and it detected for the first time the
presence of an antiproton radiation belt surrounding our planet. The operation
of Resurs-DK1 was terminated in 2016. In this article we will review the main
features of the PAMELA instrument and its constructing phases. Main part of the
article will be dedicated to the summary of the most relevant PAMELA results
over a decade of observation
| astro-ph.HE | the pamela cosmic ray detector was launched on june 15th 2006 on board the russian resursdk1 satellite and during ten years of nearly continuous datataking it has observed new interesting features in cosmic rays crs in a decade of operation it has provided plenty of scientific data covering different issues related to cosmic ray physics its discoveries might change our basic vision of the mechanisms of production acceleration and propagation of cosmic rays in the galaxy the antimatter measurements focus of the experiment have set strong constraints to the nature of dark matter search for signatures of more exotic processes such as the ones involving strange quark matter was also pursued furthermore the longterm operation of the instrument had allowed a constant monitoring of the solar activity during its maximum and a detailed and prolonged study of the solar modulation improving the comprehension of the heliosphere mechanisms pamela had also measured the radiation environment around the earth and it detected for the first time the presence of an antiproton radiation belt surrounding our planet the operation of resursdk1 was terminated in 2016 in this article we will review the main features of the pamela instrument and its constructing phases main part of the article will be dedicated to the summary of the most relevant pamela results over a decade of observation | [['the', 'pamela', 'cosmic', 'ray', 'detector', 'was', 'launched', 'on', 'june', '15th', '2006', 'on', 'board', 'the', 'russian', 'resursdk1', 'satellite', 'and', 'during', 'ten', 'years', 'of', 'nearly', 'continuous', 'datataking', 'it', 'has', 'observed', 'new', 'interesting', 'features', 'in', 'cosmic', 'rays', 'crs', 'in', 'a', 'decade', 'of', 'operation', 'it', 'has', 'provided', 'plenty', 'of', 'scientific', 'data', 'covering', 'different', 'issues', 'related', 'to', 'cosmic', 'ray', 'physics', 'its', 'discoveries', 'might', 'change', 'our', 'basic', 'vision', 'of', 'the', 'mechanisms', 'of', 'production', 'acceleration', 'and', 'propagation', 'of', 'cosmic', 'rays', 'in', 'the', 'galaxy', 'the', 'antimatter', 'measurements', 'focus', 'of', 'the', 'experiment', 'have', 'set', 'strong', 'constraints', 'to', 'the', 'nature', 'of', 'dark', 'matter', 'search', 'for', 'signatures', 'of', 'more', 'exotic', 'processes', 'such', 'as', 'the', 'ones', 'involving', 'strange', 'quark', 'matter', 'was', 'also', 'pursued', 'furthermore', 'the', 'longterm', 'operation', 'of', 'the', 'instrument', 'had', 'allowed', 'a', 'constant', 'monitoring', 'of', 'the', 'solar', 'activity', 'during', 'its', 'maximum', 'and', 'a', 'detailed', 'and', 'prolonged', 'study', 'of', 'the', 'solar', 'modulation', 'improving', 'the', 'comprehension', 'of', 'the', 'heliosphere', 'mechanisms', 'pamela', 'had', 'also', 'measured', 'the', 'radiation', 'environment', 'around', 'the', 'earth', 'and', 'it', 'detected', 'for', 'the', 'first', 'time', 'the', 'presence', 'of', 'an', 'antiproton', 'radiation', 'belt', 'surrounding', 'our', 'planet', 'the', 'operation', 'of', 'resursdk1', 'was', 'terminated', 'in', '2016', 'in', 'this', 'article', 'we', 'will', 'review', 'the', 'main', 'features', 'of', 'the', 'pamela', 'instrument', 'and', 'its', 'constructing', 'phases', 'main', 'part', 'of', 'the', 'article', 'will', 'be', 'dedicated', 'to', 'the', 'summary', 'of', 'the', 'most', 'relevant', 'pamela', 'results', 'over', 'a', 'decade', 'of', 'observation']] | [-0.11610108710208074, 0.17233092195047034, -0.0974186219936616, 0.08404630135083192, -0.1023462561372145, -0.0312036421145755, 0.007186668082161457, 0.32805425224075624, -0.22635467844694954, -0.39139731334969063, 0.07841004789922791, -0.3161155842518544, -0.06752093210479253, 0.25806223980374465, -0.04517702478915453, 0.029107152372419547, 0.10206005006251073, -0.007078361233940761, -0.02903612401353288, -0.30914028482279865, 0.2431174071133769, 0.21922008672252938, 0.21044066513896967, 0.06029817009896748, 0.09244427478996556, -0.04115980383160427, -0.11998038892228603, -0.07277592002704941, -0.12076016067531449, 0.09148172918513282, 0.2309405568582048, 0.17591843962389134, 0.20829525626921916, -0.4403235657536741, -0.23717575928520798, 0.11961353755275807, 0.08984652711305034, -0.01159330968530659, -0.08473560159291905, -0.3090199683603253, 0.028760105065950847, -0.19258351966620704, -0.11520605663162113, 0.027464400900515194, 0.04481304738021612, 0.0015966118475616113, -0.15604006437262377, 0.0024451979799975736, 0.042429947979090846, 0.06675245591446681, -0.11310774893278669, -0.09192867859211915, 0.0047469461026993405, 0.1139674394734402, 0.10804614327912224, 0.03889343234693539, 0.16046396776300548, -0.1278039290710896, -0.12843527453551196, 0.39990436609379304, -0.05961606668506441, 0.0008173471556900583, 0.201200320044052, -0.21869532935624486, -0.18948807817677296, 0.1456707682738679, 0.18920193227404114, 0.06443397514416722, -0.1753325362550727, 0.08558391377791273, -0.025001406501051527, 0.13419580608458845, 0.07499343463603188, 0.0200500157125093, 0.2841139379951985, 0.21300244616814445, 0.0635973362018232, 0.06395919467754477, -0.167188794688191, -0.03273441559873201, -0.2991883319926899, -0.1550875516174829, -0.1420164970866493, 0.03389336377260069, -0.014756883180208243, -0.09027354312771974, 0.446044392180018, 0.11766454564961626, 0.17108065726412502, -0.07857104212496581, 0.3090590566999334, 0.023718708841200198, 0.041372359206697726, 0.04835079341486299, 0.3430416744636431, 0.10908775582837285, 0.20068656447463631, -0.19711796645648205, 0.08706287376801758, 0.0039022617775323165] |
1,801.10311 | Could scientists use Altmetric.com scores to predict longer term
citation counts? | Altmetrics from Altmetric.com are widely used by publishers and researchers
to give earlier evidence of attention than citation counts. This article
assesses whether Altmetric.com scores are reliable early indicators of likely
future impact and whether they may also reflect non-scholarly impacts. A
preliminary factor analysis suggests that the main altmetric indicator of
scholarly impact is Mendeley reader counts, with weaker news, informational and
social network discussion/promotion dimensions in some fields. Based on a
regression analysis of Altmetric.com data from November 2015 and Scopus
citation counts from October 2017 for articles in 30 narrow fields, only
Mendeley reader counts are consistent predictors of future citation impact.
Most other Altmetric.com scores can help predict future impact in some fields.
Overall, the results confirm that early Altmetric.com scores can predict later
citation counts, although less well than journal impact factors, and the
optimal strategy is to consider both Altmetric.com scores and journal impact
factors. Altmetric.com scores can also reflect dimensions of non-scholarly
impact in some fields.
| cs.DL | altmetrics from altmetriccom are widely used by publishers and researchers to give earlier evidence of attention than citation counts this article assesses whether altmetriccom scores are reliable early indicators of likely future impact and whether they may also reflect nonscholarly impacts a preliminary factor analysis suggests that the main altmetric indicator of scholarly impact is mendeley reader counts with weaker news informational and social network discussionpromotion dimensions in some fields based on a regression analysis of altmetriccom data from november 2015 and scopus citation counts from october 2017 for articles in 30 narrow fields only mendeley reader counts are consistent predictors of future citation impact most other altmetriccom scores can help predict future impact in some fields overall the results confirm that early altmetriccom scores can predict later citation counts although less well than journal impact factors and the optimal strategy is to consider both altmetriccom scores and journal impact factors altmetriccom scores can also reflect dimensions of nonscholarly impact in some fields | [['altmetrics', 'from', 'altmetriccom', 'are', 'widely', 'used', 'by', 'publishers', 'and', 'researchers', 'to', 'give', 'earlier', 'evidence', 'of', 'attention', 'than', 'citation', 'counts', 'this', 'article', 'assesses', 'whether', 'altmetriccom', 'scores', 'are', 'reliable', 'early', 'indicators', 'of', 'likely', 'future', 'impact', 'and', 'whether', 'they', 'may', 'also', 'reflect', 'nonscholarly', 'impacts', 'a', 'preliminary', 'factor', 'analysis', 'suggests', 'that', 'the', 'main', 'altmetric', 'indicator', 'of', 'scholarly', 'impact', 'is', 'mendeley', 'reader', 'counts', 'with', 'weaker', 'news', 'informational', 'and', 'social', 'network', 'discussionpromotion', 'dimensions', 'in', 'some', 'fields', 'based', 'on', 'a', 'regression', 'analysis', 'of', 'altmetriccom', 'data', 'from', 'november', '2015', 'and', 'scopus', 'citation', 'counts', 'from', 'october', '2017', 'for', 'articles', 'in', '30', 'narrow', 'fields', 'only', 'mendeley', 'reader', 'counts', 'are', 'consistent', 'predictors', 'of', 'future', 'citation', 'impact', 'most', 'other', 'altmetriccom', 'scores', 'can', 'help', 'predict', 'future', 'impact', 'in', 'some', 'fields', 'overall', 'the', 'results', 'confirm', 'that', 'early', 'altmetriccom', 'scores', 'can', 'predict', 'later', 'citation', 'counts', 'although', 'less', 'well', 'than', 'journal', 'impact', 'factors', 'and', 'the', 'optimal', 'strategy', 'is', 'to', 'consider', 'both', 'altmetriccom', 'scores', 'and', 'journal', 'impact', 'factors', 'altmetriccom', 'scores', 'can', 'also', 'reflect', 'dimensions', 'of', 'nonscholarly', 'impact', 'in', 'some', 'fields']] | [-0.022209668460709507, 0.04760946990281809, -0.07901416064851219, 0.17161715393667692, -0.1680217470493517, -0.11552385368850082, 0.09257217015838251, 0.42616729526780545, -0.12461898777182796, -0.38493358848791104, 0.057244694625842384, -0.378829466633033, -0.19230847011349397, 0.20947041093895677, -0.12412718317937106, -0.02490743795133312, 0.10189951640495565, 0.0523916243633721, 0.034071642153867286, -0.3906500439756201, 0.28156697973026895, 0.15350632362533362, 0.36761810327880085, 0.09906388000235893, -0.06883821483279462, -0.07794765316939448, -0.23249378192122094, 0.04117718317356776, -0.12161739297725944, 0.12487302938243375, 0.3456162648915779, 0.2205995177238947, 0.35783541271230207, -0.36789024238241835, -0.17153739471395965, 0.07356959981439104, 0.09628892414912116, 0.050823736484744586, 0.015732084644696442, -0.3244886832602788, 0.038192367738884056, -0.2096342406439362, -0.01436291329737287, -0.029106838992447592, 0.06929817645577714, 0.08587993784603895, -0.21703809090540743, 0.13035910042053728, -0.04601479961929726, 0.16631837622844614, -0.011048920977918897, -0.2200641625575372, -0.024060853813716677, 0.19544120238861068, 0.12157546090093092, 0.037176070825080385, 0.18900870101642794, -0.1675481725327586, -0.18974475425493437, 0.37596898116753436, -0.03761194676426385, -0.1206473344063852, 0.1259341288910946, -0.14588951157347765, -0.17949368443296407, 0.060923901162459514, 0.2852279556915164, -0.019528140558395534, -0.13925038590678013, -0.054112498045287796, 0.005276896548457444, 0.23389482412312645, 0.1202996499807341, 0.0008693379975738935, 0.2165395930001978, 0.0920257412319188, -0.030516566170263104, 0.05001181992884085, -0.0499370130841271, -0.025504922971595078, -0.2225367857674428, -0.11785309379629325, -0.11639339156099596, 0.05512718662066618, -0.12107470084101805, -0.13013024692772887, 0.4280889163259417, 0.198895512441959, 0.11542901492284727, -0.004273267474491149, 0.22692089257761835, 0.013391802215483039, 0.037428661765989094, 0.12265466324752197, 0.21826686692347722, 0.03140457041445188, 0.1772681519651087, -0.03598181456181919, 0.165674116135051, -0.003249422094086185] |
1,801.10312 | A Deep Ranking Model for Spatio-Temporal Highlight Detection from a 360
Video | We address the problem of highlight detection from a 360 degree video by
summarizing it both spatially and temporally. Given a long 360 degree video, we
spatially select pleasantly-looking normal field-of-view (NFOV) segments from
unlimited field of views (FOV) of the 360 degree video, and temporally
summarize it into a concise and informative highlight as a selected subset of
subshots. We propose a novel deep ranking model named as Composition View Score
(CVS) model, which produces a spherical score map of composition per video
segment, and determines which view is suitable for highlight via a sliding
window kernel at inference. To evaluate the proposed framework, we perform
experiments on the Pano2Vid benchmark dataset and our newly collected 360
degree video highlight dataset from YouTube and Vimeo. Through evaluation using
both quantitative summarization metrics and user studies via Amazon Mechanical
Turk, we demonstrate that our approach outperforms several state-of-the-art
highlight detection methods. We also show that our model is 16 times faster at
inference than AutoCam, which is one of the first summarization algorithms of
360 degree videos
| cs.CV | we address the problem of highlight detection from a 360 degree video by summarizing it both spatially and temporally given a long 360 degree video we spatially select pleasantlylooking normal fieldofview nfov segments from unlimited field of views fov of the 360 degree video and temporally summarize it into a concise and informative highlight as a selected subset of subshots we propose a novel deep ranking model named as composition view score cvs model which produces a spherical score map of composition per video segment and determines which view is suitable for highlight via a sliding window kernel at inference to evaluate the proposed framework we perform experiments on the pano2vid benchmark dataset and our newly collected 360 degree video highlight dataset from youtube and vimeo through evaluation using both quantitative summarization metrics and user studies via amazon mechanical turk we demonstrate that our approach outperforms several stateoftheart highlight detection methods we also show that our model is 16 times faster at inference than autocam which is one of the first summarization algorithms of 360 degree videos | [['we', 'address', 'the', 'problem', 'of', 'highlight', 'detection', 'from', 'a', '360', 'degree', 'video', 'by', 'summarizing', 'it', 'both', 'spatially', 'and', 'temporally', 'given', 'a', 'long', '360', 'degree', 'video', 'we', 'spatially', 'select', 'pleasantlylooking', 'normal', 'fieldofview', 'nfov', 'segments', 'from', 'unlimited', 'field', 'of', 'views', 'fov', 'of', 'the', '360', 'degree', 'video', 'and', 'temporally', 'summarize', 'it', 'into', 'a', 'concise', 'and', 'informative', 'highlight', 'as', 'a', 'selected', 'subset', 'of', 'subshots', 'we', 'propose', 'a', 'novel', 'deep', 'ranking', 'model', 'named', 'as', 'composition', 'view', 'score', 'cvs', 'model', 'which', 'produces', 'a', 'spherical', 'score', 'map', 'of', 'composition', 'per', 'video', 'segment', 'and', 'determines', 'which', 'view', 'is', 'suitable', 'for', 'highlight', 'via', 'a', 'sliding', 'window', 'kernel', 'at', 'inference', 'to', 'evaluate', 'the', 'proposed', 'framework', 'we', 'perform', 'experiments', 'on', 'the', 'pano2vid', 'benchmark', 'dataset', 'and', 'our', 'newly', 'collected', '360', 'degree', 'video', 'highlight', 'dataset', 'from', 'youtube', 'and', 'vimeo', 'through', 'evaluation', 'using', 'both', 'quantitative', 'summarization', 'metrics', 'and', 'user', 'studies', 'via', 'amazon', 'mechanical', 'turk', 'we', 'demonstrate', 'that', 'our', 'approach', 'outperforms', 'several', 'stateoftheart', 'highlight', 'detection', 'methods', 'we', 'also', 'show', 'that', 'our', 'model', 'is', '16', 'times', 'faster', 'at', 'inference', 'than', 'autocam', 'which', 'is', 'one', 'of', 'the', 'first', 'summarization', 'algorithms', 'of', '360', 'degree', 'videos']] | [-0.06739856057075402, 0.00472314793660189, -0.07281932106839535, 0.010173022259550635, -0.09317064984828573, -0.1471808356502813, 0.06593623855653939, 0.4618107915686613, -0.23787916085513477, -0.3575215987988155, 0.05777240058259023, -0.3147071852052415, -0.16675223935056815, 0.20207641778688412, -0.09188913828885151, 0.0038259016688574443, 0.14156422368250787, 0.05914603555389807, -0.02926257012718865, -0.2799490732808904, 0.2535366200278407, 0.031593458875001736, 0.3343341981367716, 0.040875399365838595, 0.17815317447159693, -0.0030874008582693273, -0.08604877206711205, 0.011192598110276529, -0.10198023700757569, 0.13212950345041463, 0.2539725071983412, 0.24733921894750727, 0.32801479787766846, -0.33635791690639133, -0.20509915422140199, 0.025396808383509942, 0.1278039634578983, 0.06250726330604679, -0.046884098987820005, -0.3689386031473987, 0.11884644216148775, -0.15954779354110957, -0.0012996571921658788, -0.1324413631439463, -0.00828268568875501, 0.0023090332000389358, -0.28323151712009514, 0.05544340237098699, 0.005919922293700934, 0.1061918568911179, -0.06567553993557919, -0.09484447293586774, 0.035788073053647, 0.14488785033675164, 0.025441239729513076, 0.0925485266217782, 0.13992071885728696, -0.1750970317602051, -0.14126424038973215, 0.3934063504196026, -0.06954825936033805, -0.14891291023179126, 0.16855299382322383, -0.0313027845854363, -0.11379900752217509, 0.12645398522198031, 0.23506447518593632, 0.17685048641777196, -0.17061009809946304, -0.04354113849132608, -0.09580519089253027, 0.2272692691569153, 0.06682588517089078, 0.004760968703191214, 0.22509109305445402, 0.24621637915433067, 0.015764859719307755, 0.159393194784405, -0.17882828851923643, -0.061806730312210595, -0.23958738670063956, -0.11023101614343679, -0.17229623828924642, -0.013137534160209312, -0.13843076308305832, -0.11067652933045545, 0.4468785701742904, 0.2446522910110864, 0.20463266883003103, 0.10886127227290258, 0.3176323804972609, -0.03150951575199459, 0.06416301981186155, 0.08093633378369057, 0.12587687432030428, -0.015085570713960227, 0.1180662300823976, -0.13668805915222038, 0.014576987958703698, 0.043456208517785526] |
1,801.10313 | From Spinning Primaries to Permutation Orbifolds | We carry out a systematic study of primary operators in the conformal field
theory of a free Weyl fermion. Using SO(4,2) characters we develop counting
formulas for primaries constructed using a fixed number of fermion fields. By
specializing to particular classes of primaries, we derive very explicit
formulas for the generating functions for the number of primaries in these
classes. We present a duality map between primary operators in the fermion
field theory and polynomial functions. This allows us to construct the
primaries that were counted. Next we show that these classes of primary fields
correspond to polynomial functions on certain permutation orbifolds. These
orbifolds have palindromic Hilbert series.
| hep-th | we carry out a systematic study of primary operators in the conformal field theory of a free weyl fermion using so42 characters we develop counting formulas for primaries constructed using a fixed number of fermion fields by specializing to particular classes of primaries we derive very explicit formulas for the generating functions for the number of primaries in these classes we present a duality map between primary operators in the fermion field theory and polynomial functions this allows us to construct the primaries that were counted next we show that these classes of primary fields correspond to polynomial functions on certain permutation orbifolds these orbifolds have palindromic hilbert series | [['we', 'carry', 'out', 'a', 'systematic', 'study', 'of', 'primary', 'operators', 'in', 'the', 'conformal', 'field', 'theory', 'of', 'a', 'free', 'weyl', 'fermion', 'using', 'so42', 'characters', 'we', 'develop', 'counting', 'formulas', 'for', 'primaries', 'constructed', 'using', 'a', 'fixed', 'number', 'of', 'fermion', 'fields', 'by', 'specializing', 'to', 'particular', 'classes', 'of', 'primaries', 'we', 'derive', 'very', 'explicit', 'formulas', 'for', 'the', 'generating', 'functions', 'for', 'the', 'number', 'of', 'primaries', 'in', 'these', 'classes', 'we', 'present', 'a', 'duality', 'map', 'between', 'primary', 'operators', 'in', 'the', 'fermion', 'field', 'theory', 'and', 'polynomial', 'functions', 'this', 'allows', 'us', 'to', 'construct', 'the', 'primaries', 'that', 'were', 'counted', 'next', 'we', 'show', 'that', 'these', 'classes', 'of', 'primary', 'fields', 'correspond', 'to', 'polynomial', 'functions', 'on', 'certain', 'permutation', 'orbifolds', 'these', 'orbifolds', 'have', 'palindromic', 'hilbert', 'series']] | [-0.15650101634032956, 0.16065823865470738, -0.08416858458583919, 0.11791911184971451, -0.06637348090042147, -0.09353104092761738, 0.017673550408606957, 0.34921076083812147, -0.21567013999660833, -0.28662040135011485, 0.046657999032262476, -0.2615949866008665, -0.15812483192378773, 0.19112170014504787, -0.056787349265271694, 0.042374613549594486, 0.012909841535766737, 0.057322877194356484, -0.16338622820811396, -0.2716585164633366, 0.41479474438542346, -0.03308744918674641, 0.21796153917259306, 0.0014659475637685269, 0.07940993722476954, 0.04694208298134831, -0.06088253675848929, -0.030276046894969197, -0.14264980008584818, 0.139352791135225, 0.27861303912578234, 0.08579175525831931, 0.1678153327879829, -0.42930576150570443, -0.15102929393803582, 0.18687184504446908, 0.1422194583125737, 0.08698130903953533, -0.058559869649956735, -0.21511979601046907, 0.10188170387879561, -0.1892202261006545, -0.1612036712382228, -0.1342794317752123, -0.008597764487745702, 0.040915664881382374, -0.2575809767751724, -0.00030797337600534113, 0.0034145962451200148, 0.11758587151176271, -0.05733091085177308, -0.12684177720509127, 0.007841929964242725, 0.1479296812087024, 0.07073279624001695, -0.0015018759829359591, 0.061920419382358635, -0.1352563033183746, -0.1317152469803434, 0.32456730771809816, -0.04732166017019062, -0.24428122589757684, 0.13792359578816238, -0.17776115774817833, -0.20971025964416085, 0.09734693562629027, 0.1470198386664921, 0.18647954874424214, -0.13215421123959875, 0.13206390474673035, -0.11181680706047684, 0.07650195145039657, 0.12550604705690244, 0.013182068542671312, 0.23186656889087015, 0.005876121959230358, 0.04695556637480718, 0.18919576166641958, -0.019501143735363533, -0.059477391575864694, -0.36352940477909296, -0.1706083369774556, -0.12678606423694605, 0.08498284674822054, -0.08855394370105746, -0.18842344934445457, 0.4473092630163792, 0.12733835514798791, 0.16019824004535554, 0.13139410912477917, 0.1471417805056062, 0.1521844799809773, 0.14060558326576555, 0.033303343033025026, 0.1407594989404219, 0.1995192179200026, -0.00014200896011887614, -0.16934425836704553, -0.11530645944417343, 0.20447026973231397] |
1,801.10314 | Complex Sequential Question Answering: Towards Learning to Converse Over
Linked Question Answer Pairs with a Knowledge Graph | While conversing with chatbots, humans typically tend to ask many questions,
a significant portion of which can be answered by referring to large-scale
knowledge graphs (KG). While Question Answering (QA) and dialog systems have
been studied independently, there is a need to study them closely to evaluate
such real-world scenarios faced by bots involving both these tasks. Towards
this end, we introduce the task of Complex Sequential QA which combines the two
tasks of (i) answering factual questions through complex inferencing over a
realistic-sized KG of millions of entities, and (ii) learning to converse
through a series of coherently linked QA pairs. Through a labor intensive
semi-automatic process, involving in-house and crowdsourced workers, we created
a dataset containing around 200K dialogs with a total of 1.6M turns. Further,
unlike existing large scale QA datasets which contain simple questions that can
be answered from a single tuple, the questions in our dialogs require a larger
subgraph of the KG. Specifically, our dataset has questions which require
logical, quantitative, and comparative reasoning as well as their combinations.
This calls for models which can: (i) parse complex natural language questions,
(ii) use conversation context to resolve coreferences and ellipsis in
utterances, (iii) ask for clarifications for ambiguous queries, and finally
(iv) retrieve relevant subgraphs of the KG to answer such questions. However,
our experiments with a combination of state of the art dialog and QA models
show that they clearly do not achieve the above objectives and are inadequate
for dealing with such complex real world settings. We believe that this new
dataset coupled with the limitations of existing models as reported in this
paper should encourage further research in Complex Sequential QA.
| cs.CL | while conversing with chatbots humans typically tend to ask many questions a significant portion of which can be answered by referring to largescale knowledge graphs kg while question answering qa and dialog systems have been studied independently there is a need to study them closely to evaluate such realworld scenarios faced by bots involving both these tasks towards this end we introduce the task of complex sequential qa which combines the two tasks of i answering factual questions through complex inferencing over a realisticsized kg of millions of entities and ii learning to converse through a series of coherently linked qa pairs through a labor intensive semiautomatic process involving inhouse and crowdsourced workers we created a dataset containing around 200k dialogs with a total of 16m turns further unlike existing large scale qa datasets which contain simple questions that can be answered from a single tuple the questions in our dialogs require a larger subgraph of the kg specifically our dataset has questions which require logical quantitative and comparative reasoning as well as their combinations this calls for models which can i parse complex natural language questions ii use conversation context to resolve coreferences and ellipsis in utterances iii ask for clarifications for ambiguous queries and finally iv retrieve relevant subgraphs of the kg to answer such questions however our experiments with a combination of state of the art dialog and qa models show that they clearly do not achieve the above objectives and are inadequate for dealing with such complex real world settings we believe that this new dataset coupled with the limitations of existing models as reported in this paper should encourage further research in complex sequential qa | [['while', 'conversing', 'with', 'chatbots', 'humans', 'typically', 'tend', 'to', 'ask', 'many', 'questions', 'a', 'significant', 'portion', 'of', 'which', 'can', 'be', 'answered', 'by', 'referring', 'to', 'largescale', 'knowledge', 'graphs', 'kg', 'while', 'question', 'answering', 'qa', 'and', 'dialog', 'systems', 'have', 'been', 'studied', 'independently', 'there', 'is', 'a', 'need', 'to', 'study', 'them', 'closely', 'to', 'evaluate', 'such', 'realworld', 'scenarios', 'faced', 'by', 'bots', 'involving', 'both', 'these', 'tasks', 'towards', 'this', 'end', 'we', 'introduce', 'the', 'task', 'of', 'complex', 'sequential', 'qa', 'which', 'combines', 'the', 'two', 'tasks', 'of', 'i', 'answering', 'factual', 'questions', 'through', 'complex', 'inferencing', 'over', 'a', 'realisticsized', 'kg', 'of', 'millions', 'of', 'entities', 'and', 'ii', 'learning', 'to', 'converse', 'through', 'a', 'series', 'of', 'coherently', 'linked', 'qa', 'pairs', 'through', 'a', 'labor', 'intensive', 'semiautomatic', 'process', 'involving', 'inhouse', 'and', 'crowdsourced', 'workers', 'we', 'created', 'a', 'dataset', 'containing', 'around', '200k', 'dialogs', 'with', 'a', 'total', 'of', '16m', 'turns', 'further', 'unlike', 'existing', 'large', 'scale', 'qa', 'datasets', 'which', 'contain', 'simple', 'questions', 'that', 'can', 'be', 'answered', 'from', 'a', 'single', 'tuple', 'the', 'questions', 'in', 'our', 'dialogs', 'require', 'a', 'larger', 'subgraph', 'of', 'the', 'kg', 'specifically', 'our', 'dataset', 'has', 'questions', 'which', 'require', 'logical', 'quantitative', 'and', 'comparative', 'reasoning', 'as', 'well', 'as', 'their', 'combinations', 'this', 'calls', 'for', 'models', 'which', 'can', 'i', 'parse', 'complex', 'natural', 'language', 'questions', 'ii', 'use', 'conversation', 'context', 'to', 'resolve', 'coreferences', 'and', 'ellipsis', 'in', 'utterances', 'iii', 'ask', 'for', 'clarifications', 'for', 'ambiguous', 'queries', 'and', 'finally', 'iv', 'retrieve', 'relevant', 'subgraphs', 'of', 'the', 'kg', 'to', 'answer', 'such', 'questions', 'however', 'our', 'experiments', 'with', 'a', 'combination', 'of', 'state', 'of', 'the', 'art', 'dialog', 'and', 'qa', 'models', 'show', 'that', 'they', 'clearly', 'do', 'not', 'achieve', 'the', 'above', 'objectives', 'and', 'are', 'inadequate', 'for', 'dealing', 'with', 'such', 'complex', 'real', 'world', 'settings', 'we', 'believe', 'that', 'this', 'new', 'dataset', 'coupled', 'with', 'the', 'limitations', 'of', 'existing', 'models', 'as', 'reported', 'in', 'this', 'paper', 'should', 'encourage', 'further', 'research', 'in', 'complex', 'sequential', 'qa']] | [-0.05105439138548848, 0.06146720288338007, -0.002979884877432986, 0.0869693008896255, -0.13903293878787995, -0.1819691893885777, 0.0642985927976302, 0.39655781101901083, -0.26633868010831063, -0.39971332836763135, 0.08170481480608162, -0.30603924567008756, -0.12813767998678877, 0.22249134054083178, -0.11009317862063393, 0.03361002546069877, 0.14049112709674644, 0.0636283337945185, -0.012101586836173997, -0.3251295603836687, 0.3397700682482017, 0.011323698858697233, 0.2384146747079545, 0.06808631459716707, 0.09222118067513553, -0.04223013817266162, -0.054213331308398796, 0.018818933609873058, -0.07983539189400679, 0.15749840610743768, 0.36838226649736366, 0.24251314579658875, 0.34920327753227737, -0.41316267856579675, -0.19654721105720716, 0.08941206879597823, 0.16262013832103028, 0.07389089682759992, -0.02217619585904426, -0.32911037558556666, 0.09703237507658612, -0.14429264888583151, 0.011205280281969213, -0.13543588894951555, 0.022674164271614117, -0.011161889305887079, -0.2610703168432727, 0.01524982337723486, 0.10100139439663118, 0.09851774057772543, -0.013554702763628614, -0.08491890528530348, 0.068999374705267, 0.17556671863172335, 0.04156770885001281, 0.04065177874311173, 0.1322043729064587, -0.17071328915582334, -0.20338455542431413, 0.39815038639519895, -0.018948419369865275, -0.17964947070161413, 0.23133681241472784, -0.06161687640040847, -0.16680659635458142, 0.062148887023379625, 0.18995778720085843, 0.1293250248584497, -0.14869608417086835, 0.02461724311911634, -0.08814823744968245, 0.2188315721719326, 0.0625553109741304, -0.02975337608638386, 0.23764059209331337, 0.19099844328427154, -0.005372650199777646, 0.09527395955436598, 0.004030409282430421, -0.07777292969902712, -0.20053163934748486, -0.14953693610981905, -0.11472582111933402, 0.056617748055526, -0.030982598896454355, -0.15398431707373156, 0.3755527265436415, 0.23366152941505008, 0.20710394796083814, 0.04698522676106742, 0.27585719012588794, 0.0018791322613001934, 0.10441033224425544, 0.07014086168970347, 0.11672257709516479, -0.008577760069497994, 0.1401871178228508, -0.14319875512571473, 0.06988501478585281, -0.026988727045058374] |
1,801.10315 | Cluster nonequilibrium relaxation in Ising models observed with the
Binder ratio | The Binder ratios exhibit discrepancy from the Gaussian behavior of the
magnetic cumulants, and their size independence at the critical point has been
widely utilized in numerical studies of critical phenomena. In the present
article we reformulate the nonequilibrium relaxation (NER) analysis in cluster
algorithms using the $(2,1)$-Binder ratio, and apply this scheme to the two-
and three-dimensional Ising models. Although the stretched-exponential
relaxation behavior at the critical point is not explicitly observed in this
quantity, we find that there exists a logarithmic finite-size scaling formula
which can be related with a similar formula recently derived in cluster NER of
the correlation length, and that the formula enables precise evaluation of the
critical point and the stretched-exponential relaxation exponent $\sigma$.
Physical background of this novel behavior is explained by the simulation-time
dependence of the distribution function of magnetization in two dimensions and
temperature dependence of $\sigma$ obtained from magnetization in three
dimensions.
| cond-mat.stat-mech | the binder ratios exhibit discrepancy from the gaussian behavior of the magnetic cumulants and their size independence at the critical point has been widely utilized in numerical studies of critical phenomena in the present article we reformulate the nonequilibrium relaxation ner analysis in cluster algorithms using the 21binder ratio and apply this scheme to the two and threedimensional ising models although the stretchedexponential relaxation behavior at the critical point is not explicitly observed in this quantity we find that there exists a logarithmic finitesize scaling formula which can be related with a similar formula recently derived in cluster ner of the correlation length and that the formula enables precise evaluation of the critical point and the stretchedexponential relaxation exponent sigma physical background of this novel behavior is explained by the simulationtime dependence of the distribution function of magnetization in two dimensions and temperature dependence of sigma obtained from magnetization in three dimensions | [['the', 'binder', 'ratios', 'exhibit', 'discrepancy', 'from', 'the', 'gaussian', 'behavior', 'of', 'the', 'magnetic', 'cumulants', 'and', 'their', 'size', 'independence', 'at', 'the', 'critical', 'point', 'has', 'been', 'widely', 'utilized', 'in', 'numerical', 'studies', 'of', 'critical', 'phenomena', 'in', 'the', 'present', 'article', 'we', 'reformulate', 'the', 'nonequilibrium', 'relaxation', 'ner', 'analysis', 'in', 'cluster', 'algorithms', 'using', 'the', '21binder', 'ratio', 'and', 'apply', 'this', 'scheme', 'to', 'the', 'two', 'and', 'threedimensional', 'ising', 'models', 'although', 'the', 'stretchedexponential', 'relaxation', 'behavior', 'at', 'the', 'critical', 'point', 'is', 'not', 'explicitly', 'observed', 'in', 'this', 'quantity', 'we', 'find', 'that', 'there', 'exists', 'a', 'logarithmic', 'finitesize', 'scaling', 'formula', 'which', 'can', 'be', 'related', 'with', 'a', 'similar', 'formula', 'recently', 'derived', 'in', 'cluster', 'ner', 'of', 'the', 'correlation', 'length', 'and', 'that', 'the', 'formula', 'enables', 'precise', 'evaluation', 'of', 'the', 'critical', 'point', 'and', 'the', 'stretchedexponential', 'relaxation', 'exponent', 'sigma', 'physical', 'background', 'of', 'this', 'novel', 'behavior', 'is', 'explained', 'by', 'the', 'simulationtime', 'dependence', 'of', 'the', 'distribution', 'function', 'of', 'magnetization', 'in', 'two', 'dimensions', 'and', 'temperature', 'dependence', 'of', 'sigma', 'obtained', 'from', 'magnetization', 'in', 'three', 'dimensions']] | [-0.11590347619727254, 0.11936352757426599, -0.14219782937473308, 0.07806769287446513, -0.0010854874756963302, -0.12015029968693852, 0.050392324047279544, 0.33146983379498124, -0.2376987616935124, -0.2873127400036901, 0.04311144469383483, -0.28587835157290103, -0.17771662027575075, 0.19391861341272792, 0.030842088672022025, 0.0967760926267753, -0.04514889677520841, 0.03641611276815335, -0.10408908715782066, -0.20470971836087604, 0.3140710595607137, 0.019861478323194508, 0.3355446001328528, 0.08982920949657758, 0.0668601539110144, -0.007608550820344438, 0.019010212983315188, 0.06639882950733106, -0.18920385540821977, 0.05390343187454467, 0.22578788367112188, 0.061082387074517706, 0.19916577603047092, -0.35878930444518725, -0.2030124136681358, 0.09561374117620289, 0.17242722793947907, 0.08893039780901744, -0.011019480843096972, -0.20342732836958022, 0.06952643690941235, -0.13913082474997887, -0.15626691084510336, -0.07286839273292571, 0.03960389875496427, 0.028170250795471172, -0.25694339628952245, 0.16724095904423544, 0.08566374017701794, 0.10800318580741684, -0.04348466399125755, -0.1292196187687417, 0.030261412126322586, 0.13146180101980764, 0.0914707779387633, 0.04922485788973669, 0.13571588394852976, -0.11859150942259779, -0.12673816012839476, 0.33439789767066636, -0.06290490388249358, -0.17239507167910537, 0.16961170033086093, -0.1955943898949772, -0.15997029124138257, 0.121461513057972, 0.14182997868706781, 0.09459598630045851, -0.17712537933451433, 0.08424458584981039, -0.02544167060715457, 0.17069590029442527, 0.037475765893856684, 0.009319353029131889, 0.19711301042387883, 0.16428185658684621, 0.0016687804802010457, 0.18633068203693257, -0.10890650407721598, -0.1311654718965292, -0.2859210303798318, -0.12736695847221804, -0.2119526719356266, 0.06839554336164534, -0.14153772131792114, -0.1599719873815775, 0.36516691218370395, 0.17189686665156234, 0.22712932631994287, 0.057442945902391025, 0.24033334010203058, 0.18634751151626308, 0.07519392589572817, 0.06955703426773349, 0.21926835330358396, 0.11731651632192855, 0.12837375724998612, -0.2797858695173636, 0.0943801553733647, 0.07615602274114887] |
1,801.10316 | Collapse of critical nematic fluctuations in FeSe under pressure | We report the evolution of the electronic nematic susceptibility in FeSe via
Raman scattering as a function of hydrostatic pressure up to 5.8 GPa where the
superconducting transition temperature $T_{c}$ reaches its maximum. The
critical nematic fluctuations observed at low pressure vanish above 1.6 GPa,
indicating they play a marginal role in the four-fold enhancement of $T_{c}$ at
higher pressures. The collapse of nematic fluctuations appears to be linked to
a suppression of low energy electronic excitations which manifests itself by
optical phonon anomalies at around 2 GPa, in agreement with lattice dynamical
and electronic structure calculations using local density approximation
combined with dynamical mean field theory. Our results reveal two different
regimes of nematicity in the phase diagram of FeSe under pressure: a d-wave
Pomeranchuk instability of the Fermi surface at low pressure and a magnetic
driven orthorhombic distortion at higher pressure.
| cond-mat.supr-con cond-mat.str-el | we report the evolution of the electronic nematic susceptibility in fese via raman scattering as a function of hydrostatic pressure up to 58 gpa where the superconducting transition temperature t_c reaches its maximum the critical nematic fluctuations observed at low pressure vanish above 16 gpa indicating they play a marginal role in the fourfold enhancement of t_c at higher pressures the collapse of nematic fluctuations appears to be linked to a suppression of low energy electronic excitations which manifests itself by optical phonon anomalies at around 2 gpa in agreement with lattice dynamical and electronic structure calculations using local density approximation combined with dynamical mean field theory our results reveal two different regimes of nematicity in the phase diagram of fese under pressure a dwave pomeranchuk instability of the fermi surface at low pressure and a magnetic driven orthorhombic distortion at higher pressure | [['we', 'report', 'the', 'evolution', 'of', 'the', 'electronic', 'nematic', 'susceptibility', 'in', 'fese', 'via', 'raman', 'scattering', 'as', 'a', 'function', 'of', 'hydrostatic', 'pressure', 'up', 'to', '58', 'gpa', 'where', 'the', 'superconducting', 'transition', 'temperature', 't_c', 'reaches', 'its', 'maximum', 'the', 'critical', 'nematic', 'fluctuations', 'observed', 'at', 'low', 'pressure', 'vanish', 'above', '16', 'gpa', 'indicating', 'they', 'play', 'a', 'marginal', 'role', 'in', 'the', 'fourfold', 'enhancement', 'of', 't_c', 'at', 'higher', 'pressures', 'the', 'collapse', 'of', 'nematic', 'fluctuations', 'appears', 'to', 'be', 'linked', 'to', 'a', 'suppression', 'of', 'low', 'energy', 'electronic', 'excitations', 'which', 'manifests', 'itself', 'by', 'optical', 'phonon', 'anomalies', 'at', 'around', '2', 'gpa', 'in', 'agreement', 'with', 'lattice', 'dynamical', 'and', 'electronic', 'structure', 'calculations', 'using', 'local', 'density', 'approximation', 'combined', 'with', 'dynamical', 'mean', 'field', 'theory', 'our', 'results', 'reveal', 'two', 'different', 'regimes', 'of', 'nematicity', 'in', 'the', 'phase', 'diagram', 'of', 'fese', 'under', 'pressure', 'a', 'dwave', 'pomeranchuk', 'instability', 'of', 'the', 'fermi', 'surface', 'at', 'low', 'pressure', 'and', 'a', 'magnetic', 'driven', 'orthorhombic', 'distortion', 'at', 'higher', 'pressure']] | [-0.20332955119323792, 0.26224098298894044, -0.0959966471581557, -0.008285661814962287, -0.002541156799916725, -0.0939481779070037, 0.1495575470861269, 0.3446231274702749, -0.27417870146593637, -0.29419753838564966, -0.0004400210601596774, -0.3354687340609677, -0.10607270515764823, 0.10213060480855092, 0.09784328658459382, 0.02530046683285138, -0.10174601600616129, 0.0077385275634461554, -0.18364835875776395, -0.2211253979380004, 0.30082806032085857, 0.07597441170315773, 0.34557994600496145, 0.11055556071598174, 0.03785735315649764, -0.0569667418347346, 0.16303841798025723, 0.03980017623089097, -0.1852310391051786, -0.04417139525245224, 0.2967961643158191, -0.13730406755226554, 0.21432628090675737, -0.41108057361708344, -0.24610639238482587, -0.00809752332352727, 0.09591545823430708, 0.12347182118532515, -0.04273637907963793, -0.22393668032091738, 0.0552897377434623, -0.12730120948574447, -0.16890316746047848, -0.13018172264916877, -0.06665426716973706, -0.040211024681119235, -0.21721090398398327, 0.22476426712921135, 0.017461511174174535, 0.178608035695952, -0.15841157663812197, -0.13648808867364495, -0.10353539455063328, -0.013460744878967534, 0.06201042435815805, 0.14733877113753266, 0.22457207991477832, -0.1430775841431028, -0.05270606389438564, 0.39338305646592714, -0.06055772304372094, 0.026223162135395866, 0.14352938775754684, -0.2320828584179126, -0.10786319849687023, 0.2810706554820852, 0.11848811468742854, -0.0019858161922075325, -0.06050674015553538, 0.009709067950212442, 0.062378471805974584, 0.20357254409179143, 0.08723463235549968, 0.04946319938923673, 0.26510187037862265, 0.19141862417776398, 0.023634829818941914, 0.13373936689377378, -0.12233784052680109, -0.04880700488835313, -0.25543910769055356, -0.12102805667758718, -0.1601036700413569, 0.04393800879015353, -0.11889450297177236, -0.18536079054945834, 0.32759309011036075, 0.1272114294945829, 0.1915944551046078, -0.07809508016245062, 0.20758578040591485, 0.13121562003698592, 0.06625626279184452, 0.10404841401907322, 0.2866398149928716, 0.20763109677464708, 0.14239282880655743, -0.3466746100986546, 0.0579149578274651, -0.0009854925662878301] |
1,801.10317 | Highly efficient visible colloidal lead-halide perovskite nanocrystal
light-emitting diodes | Lead-halide perovskites have been attracting attention for potential use in
solid-state lighting. Following the footsteps of solar cells, the field of
perovskite light-emitting diodes (PeLEDs) has been growing rapidly. Their
application prospects in lighting, however, remain still uncertain due to a
variety of shortcomings in device performance including their limited levels of
luminous efficiency achievable thus far. Here we show high-efficiency PeLEDs
based on colloidal perovskite nanocrystals (PeNCs) synthesized at room
temperature possessing dominant first-order excitonic radiation (enabling a
photoluminescence quantum yield of 71% in solid film), unlike in the case of
bulk perovskites with slow electron-hole bimolecular radiative recombination (a
second-order process). In these PeLEDs, by reaching charge balance in the
recombination zone, we find that the Auger nonradiative recombination, with its
significant role in emission quenching, is effectively suppressed in low
driving current density range. In consequence, these devices reach a record
high maximum external quantum efficiency of 12.9% reported to date and an
unprecedentedly high power efficiency of 30.3 lm W-1 at luminance levels above
1000 cd m-2 as required for various applications. These findings suggest that,
with feasible levels of device performance, the PeNCs hold great promise for
their use in LED lighting and displays.
| physics.app-ph | leadhalide perovskites have been attracting attention for potential use in solidstate lighting following the footsteps of solar cells the field of perovskite lightemitting diodes peleds has been growing rapidly their application prospects in lighting however remain still uncertain due to a variety of shortcomings in device performance including their limited levels of luminous efficiency achievable thus far here we show highefficiency peleds based on colloidal perovskite nanocrystals pencs synthesized at room temperature possessing dominant firstorder excitonic radiation enabling a photoluminescence quantum yield of 71 in solid film unlike in the case of bulk perovskites with slow electronhole bimolecular radiative recombination a secondorder process in these peleds by reaching charge balance in the recombination zone we find that the auger nonradiative recombination with its significant role in emission quenching is effectively suppressed in low driving current density range in consequence these devices reach a record high maximum external quantum efficiency of 129 reported to date and an unprecedentedly high power efficiency of 303 lm w1 at luminance levels above 1000 cd m2 as required for various applications these findings suggest that with feasible levels of device performance the pencs hold great promise for their use in led lighting and displays | [['leadhalide', 'perovskites', 'have', 'been', 'attracting', 'attention', 'for', 'potential', 'use', 'in', 'solidstate', 'lighting', 'following', 'the', 'footsteps', 'of', 'solar', 'cells', 'the', 'field', 'of', 'perovskite', 'lightemitting', 'diodes', 'peleds', 'has', 'been', 'growing', 'rapidly', 'their', 'application', 'prospects', 'in', 'lighting', 'however', 'remain', 'still', 'uncertain', 'due', 'to', 'a', 'variety', 'of', 'shortcomings', 'in', 'device', 'performance', 'including', 'their', 'limited', 'levels', 'of', 'luminous', 'efficiency', 'achievable', 'thus', 'far', 'here', 'we', 'show', 'highefficiency', 'peleds', 'based', 'on', 'colloidal', 'perovskite', 'nanocrystals', 'pencs', 'synthesized', 'at', 'room', 'temperature', 'possessing', 'dominant', 'firstorder', 'excitonic', 'radiation', 'enabling', 'a', 'photoluminescence', 'quantum', 'yield', 'of', '71', 'in', 'solid', 'film', 'unlike', 'in', 'the', 'case', 'of', 'bulk', 'perovskites', 'with', 'slow', 'electronhole', 'bimolecular', 'radiative', 'recombination', 'a', 'secondorder', 'process', 'in', 'these', 'peleds', 'by', 'reaching', 'charge', 'balance', 'in', 'the', 'recombination', 'zone', 'we', 'find', 'that', 'the', 'auger', 'nonradiative', 'recombination', 'with', 'its', 'significant', 'role', 'in', 'emission', 'quenching', 'is', 'effectively', 'suppressed', 'in', 'low', 'driving', 'current', 'density', 'range', 'in', 'consequence', 'these', 'devices', 'reach', 'a', 'record', 'high', 'maximum', 'external', 'quantum', 'efficiency', 'of', '129', 'reported', 'to', 'date', 'and', 'an', 'unprecedentedly', 'high', 'power', 'efficiency', 'of', '303', 'lm', 'w1', 'at', 'luminance', 'levels', 'above', '1000', 'cd', 'm2', 'as', 'required', 'for', 'various', 'applications', 'these', 'findings', 'suggest', 'that', 'with', 'feasible', 'levels', 'of', 'device', 'performance', 'the', 'pencs', 'hold', 'great', 'promise', 'for', 'their', 'use', 'in', 'led', 'lighting', 'and', 'displays']] | [-0.07456201256541205, 0.15806394136875104, 0.025087858030518165, -0.0011755283168045927, -0.00798496918937163, -0.15449571800725487, 0.09580708042361542, 0.4559309988028221, -0.20058456406961692, -0.3452034442434986, 0.033157319950322776, -0.2752172806238765, -0.09878394316272045, 0.24983955427295063, -0.08281316256226244, 0.06430515818218677, 0.01908891513496921, -0.07148067659561329, -0.03358412987840962, -0.20182392499965102, 0.20494484071392888, 0.08655963157927665, 0.3358890759571914, 0.11573156706875351, 0.08688593495088785, -0.08026004850457844, 0.06332909590021003, -0.03250206280074219, -0.1045675702210011, 0.08072535462499014, 0.2868168196607816, 0.03220445532109446, 0.2663443827703784, -0.45561190245455596, -0.25457654125884477, 0.04530904616458521, 0.16570031048013795, 0.08929562766866068, -0.17327748178350763, -0.2048916311598936, 0.07993025267124412, -0.17601468598678102, -0.09256667700626588, -0.05844301810525925, 0.03641249089582166, 0.031604777893635354, -0.2083867563136858, 0.07223763828269834, 0.03224584792071698, 0.07916100219962882, -0.07734408749735484, -0.1480022806078574, -0.036744193746566504, 0.09152640829921752, 0.0070767866465000695, 0.008599937674802193, 0.20217672479693508, -0.16518409910545623, -0.11004648819272667, 0.3804305288255177, -0.044887393513259474, -0.06591518779715456, 0.20539002048075058, -0.19204000084126738, -0.11546554939385839, 0.22646322392806562, 0.1398358756358981, 0.1167797801737215, -0.12857330935123154, 0.0760363515108637, 0.0877281421290824, 0.14787173742868082, 0.08780983991201183, 0.15625189424629518, 0.26654594323626213, 0.21482736561305557, 0.024667945103648916, 0.0978074294496044, -0.12920325513820397, -0.06702012092000356, -0.169012212357602, -0.16201345238723522, -0.1602713323285718, 0.10814793197911464, -0.07533762279793332, -0.15866603186415498, 0.36980822955395287, 0.1801826322597787, 0.14639421866209185, -0.02524929452536221, 0.2660237297446462, 0.10111462023064285, 0.08860038171125208, 0.008704466814988383, 0.3023615574835313, 0.12663792628501802, 0.15742893043555659, -0.25735359686913756, 0.0809174907738863, -0.06750170213730561] |
1,801.10318 | Probability of detection of an extraneous mobile object by autonomous
unmanned underwater vehicles as a solution of the Buffon problem | Underwater robotics addresses the problem of object detection apparatus.
Offers a probabilistic formulation of the problem, which uses the reduction of
the detection task to a classical task of Buffon. This formulation arises
naturally in the formulation of the problem in the coordinate system associated
with the apparatus. It is shown that the problem allows analysis in the
presence of an asymptotic parameter, determined by the ratio of the local scan
size of the apparatus to the global size of the problem under consideration.
| cs.RO physics.data-an | underwater robotics addresses the problem of object detection apparatus offers a probabilistic formulation of the problem which uses the reduction of the detection task to a classical task of buffon this formulation arises naturally in the formulation of the problem in the coordinate system associated with the apparatus it is shown that the problem allows analysis in the presence of an asymptotic parameter determined by the ratio of the local scan size of the apparatus to the global size of the problem under consideration | [['underwater', 'robotics', 'addresses', 'the', 'problem', 'of', 'object', 'detection', 'apparatus', 'offers', 'a', 'probabilistic', 'formulation', 'of', 'the', 'problem', 'which', 'uses', 'the', 'reduction', 'of', 'the', 'detection', 'task', 'to', 'a', 'classical', 'task', 'of', 'buffon', 'this', 'formulation', 'arises', 'naturally', 'in', 'the', 'formulation', 'of', 'the', 'problem', 'in', 'the', 'coordinate', 'system', 'associated', 'with', 'the', 'apparatus', 'it', 'is', 'shown', 'that', 'the', 'problem', 'allows', 'analysis', 'in', 'the', 'presence', 'of', 'an', 'asymptotic', 'parameter', 'determined', 'by', 'the', 'ratio', 'of', 'the', 'local', 'scan', 'size', 'of', 'the', 'apparatus', 'to', 'the', 'global', 'size', 'of', 'the', 'problem', 'under', 'consideration']] | [-0.1370785530820112, 0.027402440303766134, -0.09917969172376961, -0.014895382247188883, -0.051800386337119905, -0.0896424647376296, 0.01747010806797161, 0.2759447829892105, -0.3092379037601252, -0.35724237048998475, 0.09429676458516735, -0.20072258313701327, -0.14607910594038134, 0.18452468811578693, -0.1203889520727985, 0.0905143051142139, 0.09161327331925609, 0.06895588113582649, -0.06394013057607004, -0.1873769221128896, 0.2962321390431108, 0.07522361433976107, 0.31368666439361514, 0.04508027528797919, 0.1759225122763642, 0.06533943493905965, -0.040464066135297926, 0.026000539306551218, -0.07230275360511552, 0.1429694877269434, 0.24889005182887472, 0.19108949282894, 0.3000581887595001, -0.3771036244884488, -0.19918745257780843, 0.12442088587253931, 0.10054972887571369, 0.10395993075438864, 0.012212012545205653, -0.2933605103753507, 0.06500525312453863, -0.1331664981940516, -0.15149338867160536, 0.023033342728879126, -0.0073270658474592935, -0.07638339504289131, -0.27113122274611323, 0.06320862805226907, 0.09488680128318568, 0.02470961307075673, -0.11379072487623143, -0.04241326027632957, 0.06889833046478175, 0.111022867107143, 0.07766448509868323, 0.011385716165282897, 0.13114590161768275, -0.17302968695349547, -0.09187792426729131, 0.43343448266386986, -0.017210257087191122, -0.2438412757040905, 0.158098798145407, -0.0670236850855872, -0.1302312910667665, 0.132900571156781, 0.16087995833229451, 0.1536597969187867, -0.15284406911814585, 0.11881961936264165, -0.08020705631047133, 0.16045453598988907, 0.01956350058095441, -0.005688605602786299, 0.15706258126357125, 0.22821107547774555, 0.131270512206746, 0.20858419681566634, -0.11846914326555893, -0.10301736221715276, -0.2937796364671418, -0.1374241500715947, -0.1726007848808963, -0.010281777118853782, -0.07915390496851787, -0.1562548672812963, 0.3892376968371017, 0.1716166406203272, 0.1864553675709647, 0.021964033285344374, 0.32782305865770295, 0.11951757565007678, 0.057487433842782466, -0.001242534530493209, 0.23258176701866823, 0.11203371728853588, 0.1189856901210511, -0.30606840860786005, 0.08632354867932875, 0.10375714839790903] |
1,801.10319 | SESR: Single Image Super Resolution with Recursive Squeeze and
Excitation Networks | Single image super resolution is a very important computer vision task, with
a wide range of applications. In recent years, the depth of the
super-resolution model has been constantly increasing, but with a small
increase in performance, it has brought a huge amount of computation and memory
consumption. In this work, in order to make the super resolution models more
effective, we proposed a novel single image super resolution method via
recursive squeeze and excitation networks (SESR). By introducing the squeeze
and excitation module, our SESR can model the interdependencies and
relationships between channels and that makes our model more efficiency. In
addition, the recursive structure and progressive reconstruction method in our
model minimized the layers and parameters and enabled SESR to simultaneously
train multi-scale super resolution in a single model. After evaluating on four
benchmark test sets, our model is proved to be above the state-of-the-art
methods in terms of speed and accuracy.
| cs.CV | single image super resolution is a very important computer vision task with a wide range of applications in recent years the depth of the superresolution model has been constantly increasing but with a small increase in performance it has brought a huge amount of computation and memory consumption in this work in order to make the super resolution models more effective we proposed a novel single image super resolution method via recursive squeeze and excitation networks sesr by introducing the squeeze and excitation module our sesr can model the interdependencies and relationships between channels and that makes our model more efficiency in addition the recursive structure and progressive reconstruction method in our model minimized the layers and parameters and enabled sesr to simultaneously train multiscale super resolution in a single model after evaluating on four benchmark test sets our model is proved to be above the stateoftheart methods in terms of speed and accuracy | [['single', 'image', 'super', 'resolution', 'is', 'a', 'very', 'important', 'computer', 'vision', 'task', 'with', 'a', 'wide', 'range', 'of', 'applications', 'in', 'recent', 'years', 'the', 'depth', 'of', 'the', 'superresolution', 'model', 'has', 'been', 'constantly', 'increasing', 'but', 'with', 'a', 'small', 'increase', 'in', 'performance', 'it', 'has', 'brought', 'a', 'huge', 'amount', 'of', 'computation', 'and', 'memory', 'consumption', 'in', 'this', 'work', 'in', 'order', 'to', 'make', 'the', 'super', 'resolution', 'models', 'more', 'effective', 'we', 'proposed', 'a', 'novel', 'single', 'image', 'super', 'resolution', 'method', 'via', 'recursive', 'squeeze', 'and', 'excitation', 'networks', 'sesr', 'by', 'introducing', 'the', 'squeeze', 'and', 'excitation', 'module', 'our', 'sesr', 'can', 'model', 'the', 'interdependencies', 'and', 'relationships', 'between', 'channels', 'and', 'that', 'makes', 'our', 'model', 'more', 'efficiency', 'in', 'addition', 'the', 'recursive', 'structure', 'and', 'progressive', 'reconstruction', 'method', 'in', 'our', 'model', 'minimized', 'the', 'layers', 'and', 'parameters', 'and', 'enabled', 'sesr', 'to', 'simultaneously', 'train', 'multiscale', 'super', 'resolution', 'in', 'a', 'single', 'model', 'after', 'evaluating', 'on', 'four', 'benchmark', 'test', 'sets', 'our', 'model', 'is', 'proved', 'to', 'be', 'above', 'the', 'stateoftheart', 'methods', 'in', 'terms', 'of', 'speed', 'and', 'accuracy']] | [-0.049481041998566164, 0.04397697165584216, -0.05712214542201126, 0.01403738036162111, -0.03358923187539852, -0.14032903620247522, 0.031214239601916695, 0.42851290635026795, -0.28332786455254566, -0.37705653065561573, 0.08521809833813701, -0.24487912819974803, -0.1703415767519505, 0.205795249109483, -0.09713997012408686, 0.08945653334187416, 0.1284039769376108, 0.0245780417326741, -0.07049923811210682, -0.26583621474194596, 0.24951890783305825, 0.11482968840856927, 0.3336938654205629, 0.05392001410825299, 0.13629329044299274, -0.01244239662562243, -0.020648899928110278, 0.017253067184167057, -0.04292189676713164, 0.1712994439491107, 0.23928286720705752, 0.13890597386007475, 0.2847368778107543, -0.4258492936005259, -0.2712575060061433, 0.06047083756148622, 0.14585793717588938, 0.09951924581032295, -0.04949731625221192, -0.2544604598774345, 0.09106731777345496, -0.20155220766636459, -0.048706982018692155, -0.12270588882330974, 0.025357419694471476, -0.026908032898488757, -0.2744954842223647, 0.044935651195149376, 0.03487569652195391, 0.043102692248747236, -0.028564973915745685, -0.07444237982975198, 0.01010074994720325, 0.12758792926218698, -0.00107687900021261, 0.05512683896889136, 0.07807932598455869, -0.21323646001015825, -0.10661168050099551, 0.34198858665133064, -0.06719743296301428, -0.2000655263840741, 0.2264721483088933, -0.09919544607824222, -0.11296112182423133, 0.13229610796340488, 0.1920347815960065, 0.13236445215433934, -0.13131995509452696, 0.04709128550119251, -0.008302424223972605, 0.20726114018312233, 0.08107783339990231, 0.011293208476022951, 0.18766480174018432, 0.27907416306726346, 0.033459297682207026, 0.14176175326665308, -0.1419389655635172, -0.07748237393748064, -0.204799809995827, -0.12766452876445777, -0.14867822674115178, -0.025486429094929586, -0.09152328963578579, -0.09133820337932799, 0.413701972318662, 0.1996107825120403, 0.21791865625237297, 0.05258552037034329, 0.33833231721012913, 0.0894212850880531, 0.13785763471931606, 0.04659480901318602, 0.19848518023968903, 0.1030466339033847, 0.1269885657064907, -0.1841116332526125, 0.02949328287640683, 0.04134281627930604] |
1,801.1032 | Birational maps conjugate to the rank 2 cluster mutations of affine
types and their geometry | Mutations of the cluster variables generating the cluster algebra of type
$A^{(2)}_2$ reduce to a two-dimensional discrete integrable system given by a
quartic birational map. The invariant curve of the map is a singular quartic
curve, and its resolution of the singularity induces a discrete integrable
system on a conic governed by a cubic birational map conjugate to the cluster
mutations of type $A^{(2)}_2$. Moreover, it is shown that the conic is also the
invariant curve of the quadratic birational map arising from the cluster
mutations of type $A^{(1)}_1$ and the two birational maps on the conic are
commutative. Finally, the commutative birational maps are reduced as singular
limits of additions of points on an elliptic curve arising as the spectral
curve of the discrete Toda lattice of type $A^{(1)}_1$.
| nlin.SI math.AG | mutations of the cluster variables generating the cluster algebra of type a2_2 reduce to a twodimensional discrete integrable system given by a quartic birational map the invariant curve of the map is a singular quartic curve and its resolution of the singularity induces a discrete integrable system on a conic governed by a cubic birational map conjugate to the cluster mutations of type a2_2 moreover it is shown that the conic is also the invariant curve of the quadratic birational map arising from the cluster mutations of type a1_1 and the two birational maps on the conic are commutative finally the commutative birational maps are reduced as singular limits of additions of points on an elliptic curve arising as the spectral curve of the discrete toda lattice of type a1_1 | [['mutations', 'of', 'the', 'cluster', 'variables', 'generating', 'the', 'cluster', 'algebra', 'of', 'type', 'a2_2', 'reduce', 'to', 'a', 'twodimensional', 'discrete', 'integrable', 'system', 'given', 'by', 'a', 'quartic', 'birational', 'map', 'the', 'invariant', 'curve', 'of', 'the', 'map', 'is', 'a', 'singular', 'quartic', 'curve', 'and', 'its', 'resolution', 'of', 'the', 'singularity', 'induces', 'a', 'discrete', 'integrable', 'system', 'on', 'a', 'conic', 'governed', 'by', 'a', 'cubic', 'birational', 'map', 'conjugate', 'to', 'the', 'cluster', 'mutations', 'of', 'type', 'a2_2', 'moreover', 'it', 'is', 'shown', 'that', 'the', 'conic', 'is', 'also', 'the', 'invariant', 'curve', 'of', 'the', 'quadratic', 'birational', 'map', 'arising', 'from', 'the', 'cluster', 'mutations', 'of', 'type', 'a1_1', 'and', 'the', 'two', 'birational', 'maps', 'on', 'the', 'conic', 'are', 'commutative', 'finally', 'the', 'commutative', 'birational', 'maps', 'are', 'reduced', 'as', 'singular', 'limits', 'of', 'additions', 'of', 'points', 'on', 'an', 'elliptic', 'curve', 'arising', 'as', 'the', 'spectral', 'curve', 'of', 'the', 'discrete', 'toda', 'lattice', 'of', 'type', 'a1_1']] | [-0.1706449802311209, 0.015169766220340254, -0.10555605588910671, 0.07889367145969747, -0.10274844914674759, -0.19703770433552564, 0.001971713052346156, 0.2890782210116203, -0.3993793242969192, -0.1376411007430691, 0.13082120458667096, -0.2809305788949132, -0.18609192290773185, 0.2300388117105915, -0.14992448141117795, 0.030076264487489915, 0.054287605438954556, 0.05603816731689641, -0.152501806561262, -0.3412815931844167, 0.44328962214147816, -0.03020814133163255, 0.18154576757672028, -0.024413087974803953, 0.20037751630521738, 0.019192200709277622, -0.01172001720764316, -0.021061861651161543, -0.1294323781311015, 0.11137028661055061, 0.2474913492082403, 0.057508676488382315, 0.11761507264824243, -0.3231935484907948, -0.1485245969468871, 0.19834416822100487, 0.12178200896686087, 0.058858862748512854, -0.0023198097756204124, -0.2563567315443204, 0.06805089571459505, -0.10645539339166135, -0.19973377197121198, -0.02398562747806024, 0.02452446435434887, 0.08026220079224844, -0.20073141553797402, 0.03739265031337989, 0.1113054418613991, 0.17179554368440922, -0.04099420617209174, -0.056148839788511394, -0.15404743993511566, 0.03317724732108987, -0.015556940388006087, 0.09852537531047487, 0.13718864983664109, -0.09634128556085321, -0.0897697381531963, 0.400255750080284, -0.04044727221928322, -0.20945996197943503, 0.11812183684311234, -0.10794777180999518, -0.14507688647494293, 0.1973879596218467, 0.12424876181981885, 0.08959024006930681, -0.1008428801710789, 0.22114929987314658, -0.06375829710696752, 0.11333840982272075, 0.07017940844480808, -0.07067318724539991, 0.1896454401099338, 0.05347804825108212, 0.1009777219643673, 0.149506535839576, -0.0686141477118676, -0.1144930080922607, -0.35139378690375733, -0.14665340833509197, -0.11851529199630022, 0.1412673829597994, -0.16835013222500073, -0.20335607676332493, 0.4400944027190025, -0.018503569095628336, 0.20373255133342286, 0.08037936921016528, 0.1612937137699471, 0.13778548064247634, 0.07078884227846105, -0.04483838539857131, 0.1352326945759929, 0.19983242453219227, 0.004545343656522724, -0.23872923789581713, -0.06025910220968609, 0.19538211793853685] |
1,801.10321 | Constraint Estimation and Derivative-Free Recovery for Robot Learning
from Demonstrations | Learning from human demonstrations can facilitate automation but is risky
because the execution of the learned policy might lead to collisions and other
failures. Adding explicit constraints to avoid unsafe states is generally not
possible when the state representations are complex. Furthermore, enforcing
these constraints during execution of the learned policy can be challenging in
environments where dynamics are difficult to model such as push mechanics in
grasping. In this paper, we propose Derivative-Free Recovery (DFR), a two-phase
method for generating robust policies from demonstrations in robotic
manipulation tasks where the system comes to rest at each time step. In the
first phase, we use support estimation of supervisor demonstrations and treat
the support as implicit constraints on states. We also propose a time-varying
modification for sequential tasks. In the second phase, we use this support
estimate to derive a switching policy that employs the learned policy in the
interior of the support and switches to a recovery policy to steer the robot
away from the boundary of the support if it drifts too close. We present
additional conditions, which linearly bound the difference in state at each
time step by the magnitude of control, allowing us to prove that the robot will
not violate the constraints using the recovery policy. A simulated pushing task
in MuJoCo suggests that DFR can reduce collisions by 83\%. On a physical line
tracking task using a da Vinci Surgical Robot and a moving Stewart platform,
DFR reduced collisions by 84\%.
| cs.RO | learning from human demonstrations can facilitate automation but is risky because the execution of the learned policy might lead to collisions and other failures adding explicit constraints to avoid unsafe states is generally not possible when the state representations are complex furthermore enforcing these constraints during execution of the learned policy can be challenging in environments where dynamics are difficult to model such as push mechanics in grasping in this paper we propose derivativefree recovery dfr a twophase method for generating robust policies from demonstrations in robotic manipulation tasks where the system comes to rest at each time step in the first phase we use support estimation of supervisor demonstrations and treat the support as implicit constraints on states we also propose a timevarying modification for sequential tasks in the second phase we use this support estimate to derive a switching policy that employs the learned policy in the interior of the support and switches to a recovery policy to steer the robot away from the boundary of the support if it drifts too close we present additional conditions which linearly bound the difference in state at each time step by the magnitude of control allowing us to prove that the robot will not violate the constraints using the recovery policy a simulated pushing task in mujoco suggests that dfr can reduce collisions by 83 on a physical line tracking task using a da vinci surgical robot and a moving stewart platform dfr reduced collisions by 84 | [['learning', 'from', 'human', 'demonstrations', 'can', 'facilitate', 'automation', 'but', 'is', 'risky', 'because', 'the', 'execution', 'of', 'the', 'learned', 'policy', 'might', 'lead', 'to', 'collisions', 'and', 'other', 'failures', 'adding', 'explicit', 'constraints', 'to', 'avoid', 'unsafe', 'states', 'is', 'generally', 'not', 'possible', 'when', 'the', 'state', 'representations', 'are', 'complex', 'furthermore', 'enforcing', 'these', 'constraints', 'during', 'execution', 'of', 'the', 'learned', 'policy', 'can', 'be', 'challenging', 'in', 'environments', 'where', 'dynamics', 'are', 'difficult', 'to', 'model', 'such', 'as', 'push', 'mechanics', 'in', 'grasping', 'in', 'this', 'paper', 'we', 'propose', 'derivativefree', 'recovery', 'dfr', 'a', 'twophase', 'method', 'for', 'generating', 'robust', 'policies', 'from', 'demonstrations', 'in', 'robotic', 'manipulation', 'tasks', 'where', 'the', 'system', 'comes', 'to', 'rest', 'at', 'each', 'time', 'step', 'in', 'the', 'first', 'phase', 'we', 'use', 'support', 'estimation', 'of', 'supervisor', 'demonstrations', 'and', 'treat', 'the', 'support', 'as', 'implicit', 'constraints', 'on', 'states', 'we', 'also', 'propose', 'a', 'timevarying', 'modification', 'for', 'sequential', 'tasks', 'in', 'the', 'second', 'phase', 'we', 'use', 'this', 'support', 'estimate', 'to', 'derive', 'a', 'switching', 'policy', 'that', 'employs', 'the', 'learned', 'policy', 'in', 'the', 'interior', 'of', 'the', 'support', 'and', 'switches', 'to', 'a', 'recovery', 'policy', 'to', 'steer', 'the', 'robot', 'away', 'from', 'the', 'boundary', 'of', 'the', 'support', 'if', 'it', 'drifts', 'too', 'close', 'we', 'present', 'additional', 'conditions', 'which', 'linearly', 'bound', 'the', 'difference', 'in', 'state', 'at', 'each', 'time', 'step', 'by', 'the', 'magnitude', 'of', 'control', 'allowing', 'us', 'to', 'prove', 'that', 'the', 'robot', 'will', 'not', 'violate', 'the', 'constraints', 'using', 'the', 'recovery', 'policy', 'a', 'simulated', 'pushing', 'task', 'in', 'mujoco', 'suggests', 'that', 'dfr', 'can', 'reduce', 'collisions', 'by', '83', 'on', 'a', 'physical', 'line', 'tracking', 'task', 'using', 'a', 'da', 'vinci', 'surgical', 'robot', 'and', 'a', 'moving', 'stewart', 'platform', 'dfr', 'reduced', 'collisions', 'by', '84']] | [-0.08739350952664277, 0.08932322772645848, -0.11218780291602318, 0.024360893107102318, -0.1315225141268103, -0.17139565854178748, 0.09125088600652492, 0.4120496097190479, -0.2648878882739029, -0.32865440838136956, 0.12768194818471443, -0.20487322330263705, -0.13848392499411885, 0.17523022238843836, -0.14554180133793698, 0.07707110273289808, 0.09638046189390409, 0.03722940219343764, -0.04774977059385396, -0.22719732372595472, 0.2790977813148879, 0.040090347983335196, 0.2673373872881778, 0.022498335150119505, 0.1246646602604131, 0.015751790137714536, 0.01702583709407432, -0.018595330307339338, -0.06294264641600668, 0.09612737783843082, 0.3196937826095405, 0.17515354605508507, 0.32179716099638056, -0.4554655728899395, -0.17857718957740784, 0.09583821666506138, 0.12314219563456652, 0.12660986275519603, -0.026086569043547517, -0.3320333131698341, 0.07386599110462043, -0.17507041892723033, -0.0843383962795636, -0.10535062245481651, -0.017972756393992827, -0.019966059764055348, -0.3228074393766793, 0.011415982557538904, 0.04304982835581519, 0.028962592386946023, -0.08397175564038518, -0.04941544990358791, -0.010863271796169053, 0.15787504789259696, 0.027145301178003463, 0.04998635347020107, 0.1883311269178926, -0.147876574747879, -0.16163777750973338, 0.3828367318388693, -0.006400253160890599, -0.20924126851911606, 0.21393441709749653, -0.0761230885803413, -0.147291715202197, 0.11934414188479364, 0.2389642286141731, 0.11394880127858348, -0.1555746482520365, 0.015606854284400881, -0.0014277169549732135, 0.16215238490694311, 0.05104325201337863, -0.017318864143736328, 0.1583548523749598, 0.19023418536142028, 0.12489973622853094, 0.14523791126046245, -0.06443881234512307, -0.11157213466577534, -0.2976049855059231, -0.13251676858871278, -0.1648079801062386, -0.006410341734242878, -0.059554769559753945, -0.07850492613566007, 0.3485265520800976, 0.22487281333242246, 0.20554030795773937, 0.08852120509478621, 0.3404371379931205, 0.0889478872537615, 0.06701358682419425, 0.12842522955476965, 0.22676640100822396, 0.008054969664040937, 0.14554514696723536, -0.2266433107088601, 0.13338692644931496, 0.031758300011773946] |
1,801.10322 | Kinetic Energy Matrix Elements for a two-electron Atom with Extended
Hylleraas-CI Wave Function | Some typical kinetic energy integrals which arise in the application of
extended Hylleraas-configuration interaction (E-Hy-CI) function in the
framework of Rayleigh-Ritz method of variation, have been evaluated
analytically for two-electron atomic systems. Closed-form expressions for the
corresponding integrals which occur in the application of Hylleraas-CI
functions, have also been derived as special cases.
| physics.atom-ph | some typical kinetic energy integrals which arise in the application of extended hylleraasconfiguration interaction ehyci function in the framework of rayleighritz method of variation have been evaluated analytically for twoelectron atomic systems closedform expressions for the corresponding integrals which occur in the application of hylleraasci functions have also been derived as special cases | [['some', 'typical', 'kinetic', 'energy', 'integrals', 'which', 'arise', 'in', 'the', 'application', 'of', 'extended', 'hylleraasconfiguration', 'interaction', 'ehyci', 'function', 'in', 'the', 'framework', 'of', 'rayleighritz', 'method', 'of', 'variation', 'have', 'been', 'evaluated', 'analytically', 'for', 'twoelectron', 'atomic', 'systems', 'closedform', 'expressions', 'for', 'the', 'corresponding', 'integrals', 'which', 'occur', 'in', 'the', 'application', 'of', 'hylleraasci', 'functions', 'have', 'also', 'been', 'derived', 'as', 'special', 'cases']] | [-0.10034781151483127, 0.022130234338178793, -0.06243153890667885, 0.1404848753237257, 0.012741154032375883, -0.10261053805622984, -0.00653881336763209, 0.3665514908292714, -0.21154237707492476, -0.2927263229537536, 0.09362543347136427, -0.20833281622332173, -0.1965976722684561, 0.25462841008808096, 0.05382676375116788, 0.09687553713207736, 0.04653931066266024, 0.03918413903710304, -0.11346739320559245, -0.21778070855447473, 0.29666643497059303, -0.0061512639946943405, 0.23974740377389916, 0.09855534499693736, 0.10513587526100523, 0.014711714500342222, 0.02042819959038467, 0.0046633749394708966, -0.1321245218974118, 0.10140987989657066, 0.26851543669209943, 0.07374329910631858, 0.24390476948453807, -0.43859414398378016, -0.2464564550741046, 0.07759782018176481, 0.1972887229137853, 0.1054563963301845, -0.03423903941852497, -0.2581026049184741, -0.002665443820696251, -0.2803896773679584, -0.15159790566665868, -0.11712530505953028, 0.051495691113100914, 0.13209675395331694, -0.2654896146234344, 0.11264004714401238, -0.014713572995627628, 0.05766025209324617, -0.1176294428205081, -0.17651169465891287, 0.009236666510867722, 0.12703419235699318, 0.06720574842285143, -0.020929453972106177, 0.08798368266034945, -0.10026824344680005, -0.10468822743232344, 0.3641159792850707, -0.044045262499803714, -0.26979126563916606, 0.12368962955295894, -0.10659848069589511, -0.1680710010467937, 0.1774539815230003, 0.17716062649646225, 0.1781806578430548, -0.20307802136841357, 0.1550647459522474, -0.021436914911164957, 0.01660986863734091, 0.12255205949951037, 0.08941016285954152, 0.11511857546500716, 0.06437657313311801, 0.012762827431216981, 0.18284551193024598, -0.0745081358826628, -0.18346420273769135, -0.30806005914129464, -0.15336397061736196, -0.19020757557568596, -0.003925932196936771, -0.05997771293144016, -0.17955964443949507, 0.37983269830617833, 0.1201832665532243, 0.13693839929742263, -0.0009763847452168371, 0.25227194353390264, 0.27796657406953257, 0.10380008960069687, -0.004310740372531262, 0.2497983537734185, 0.1409534203737755, 0.06522742607722096, -0.202761778927536, 0.04274726487403991, 0.10424160520893101] |
1,801.10323 | Privacy-Preserving Secret Shared Computations using MapReduce | Data outsourcing allows data owners to keep their data at \emph{untrusted}
clouds that do not ensure the privacy of data and/or computations. One useful
framework for fault-tolerant data processing in a distributed fashion is
MapReduce, which was developed for \emph{trusted} private clouds. This paper
presents algorithms for data outsourcing based on Shamir's secret-sharing
scheme and for executing privacy-preserving SQL queries such as count,
selection including range selection, projection, and join while using MapReduce
as an underlying programming model. Our proposed algorithms prevent an
adversary from knowing the database or the query while also preventing
output-size and access-pattern attacks. Interestingly, our algorithms do not
involve the database owner, which only creates and distributes secret-shares
once, in answering any query, and hence, the database owner also cannot learn
the query. Logically and experimentally, we evaluate the efficiency of the
algorithms on the following parameters: (\textit{i}) the number of
communication rounds (between a user and a server), (\textit{ii}) the total
amount of bit flow (between a user and a server), and (\textit{iii}) the
computational load at the user and the server.\B
| cs.DB cs.CR cs.DC cs.IT math.IT | data outsourcing allows data owners to keep their data at emphuntrusted clouds that do not ensure the privacy of data andor computations one useful framework for faulttolerant data processing in a distributed fashion is mapreduce which was developed for emphtrusted private clouds this paper presents algorithms for data outsourcing based on shamirs secretsharing scheme and for executing privacypreserving sql queries such as count selection including range selection projection and join while using mapreduce as an underlying programming model our proposed algorithms prevent an adversary from knowing the database or the query while also preventing outputsize and accesspattern attacks interestingly our algorithms do not involve the database owner which only creates and distributes secretshares once in answering any query and hence the database owner also cannot learn the query logically and experimentally we evaluate the efficiency of the algorithms on the following parameters textiti the number of communication rounds between a user and a server textitii the total amount of bit flow between a user and a server and textitiii the computational load at the user and the serverb | [['data', 'outsourcing', 'allows', 'data', 'owners', 'to', 'keep', 'their', 'data', 'at', 'emphuntrusted', 'clouds', 'that', 'do', 'not', 'ensure', 'the', 'privacy', 'of', 'data', 'andor', 'computations', 'one', 'useful', 'framework', 'for', 'faulttolerant', 'data', 'processing', 'in', 'a', 'distributed', 'fashion', 'is', 'mapreduce', 'which', 'was', 'developed', 'for', 'emphtrusted', 'private', 'clouds', 'this', 'paper', 'presents', 'algorithms', 'for', 'data', 'outsourcing', 'based', 'on', 'shamirs', 'secretsharing', 'scheme', 'and', 'for', 'executing', 'privacypreserving', 'sql', 'queries', 'such', 'as', 'count', 'selection', 'including', 'range', 'selection', 'projection', 'and', 'join', 'while', 'using', 'mapreduce', 'as', 'an', 'underlying', 'programming', 'model', 'our', 'proposed', 'algorithms', 'prevent', 'an', 'adversary', 'from', 'knowing', 'the', 'database', 'or', 'the', 'query', 'while', 'also', 'preventing', 'outputsize', 'and', 'accesspattern', 'attacks', 'interestingly', 'our', 'algorithms', 'do', 'not', 'involve', 'the', 'database', 'owner', 'which', 'only', 'creates', 'and', 'distributes', 'secretshares', 'once', 'in', 'answering', 'any', 'query', 'and', 'hence', 'the', 'database', 'owner', 'also', 'can', 'not', 'learn', 'the', 'query', 'logically', 'and', 'experimentally', 'we', 'evaluate', 'the', 'efficiency', 'of', 'the', 'algorithms', 'on', 'the', 'following', 'parameters', 'textiti', 'the', 'number', 'of', 'communication', 'rounds', 'between', 'a', 'user', 'and', 'a', 'server', 'textitii', 'the', 'total', 'amount', 'of', 'bit', 'flow', 'between', 'a', 'user', 'and', 'a', 'server', 'and', 'textitiii', 'the', 'computational', 'load', 'at', 'the', 'user', 'and', 'the', 'serverb']] | [-0.12885436161288194, -0.033607300063428866, -0.06581622347368726, 0.04551537044346333, -0.12188919580674597, -0.2220813061429986, 0.17986318346711674, 0.3706407715034272, -0.2978405527344772, -0.38124847935778755, 0.10792632155785603, -0.29036209093282067, -0.05719178185532136, 0.20236697878289436, -0.13623090056436402, 0.09204614960987653, 0.06368048034142702, 0.05465133066422173, 0.005831411088417684, -0.32123866935194073, 0.29041885117268457, 0.06750207762466744, 0.30419051391205615, 0.05215823762384909, 0.06262539205008319, 0.038609805633979186, -0.04038649612239429, -0.03273195093364588, -0.06521505594673467, 0.11970533367645528, 0.32261431416895775, 0.27582305860040446, 0.30859211806607034, -0.4499067390922989, -0.12440748165228536, 0.09885636013732957, 0.1588087329694203, 0.10378437118471733, -0.06968895493740482, -0.28637824266084605, 0.10785260038716453, -0.18272586212410324, 0.02271858179675681, -0.11077004194791829, -0.004038856657488005, 0.0012460305189181651, -0.315525984665645, -0.02522282387562362, 0.02659502994102825, 0.05071181010188801, -0.014650245141404282, -0.03348138815856406, -0.004225237884425691, 0.1889997371272849, 0.0034458714543559054, 0.01923740293298449, 0.18490302027070096, -0.11850020353511874, -0.16336351708209673, 0.4006278672814369, 0.03187799207866192, -0.1643832207224997, 0.13890954319254628, -0.02042779119020062, -0.17243003948325558, 0.09505618216735975, 0.21600331358611582, 0.07755431886496289, -0.17472158994126533, 0.06388063583589558, -0.03585468237687434, 0.2356560109904967, 0.06732174445575635, 0.04811455658503941, 0.15470792308183653, 0.15743681581424815, 0.10211611421512706, 0.10246804009324738, -0.06838643414434045, -0.10105854028037616, -0.23417113649991475, -0.16284003574268094, -0.21140629312821796, -0.04788277009477107, -0.11581286934254292, -0.14569898127420206, 0.3452599867054752, 0.2009491736255586, 0.18768498612833875, 0.10887029859769558, 0.4114916172730071, 0.01853305633845074, 0.1224545286981655, 0.22748330640207443, 0.10657565089740924, -0.027617214220975128, 0.1757628996118105, -0.18207719295285643, 0.17131244698007192, -0.015918695793620177] |
1,801.10324 | From BoW to CNN: Two Decades of Texture Representation for Texture
Classification | Texture is a fundamental characteristic of many types of images, and texture
representation is one of the essential and challenging problems in computer
vision and pattern recognition which has attracted extensive research
attention. Since 2000, texture representations based on Bag of Words (BoW) and
on Convolutional Neural Networks (CNNs) have been extensively studied with
impressive performance. Given this period of remarkable evolution, this paper
aims to present a comprehensive survey of advances in texture representation
over the last two decades. More than 200 major publications are cited in this
survey covering different aspects of the research, which includes (i) problem
description; (ii) recent advances in the broad categories of BoW-based,
CNN-based and attribute-based methods; and (iii) evaluation issues,
specifically benchmark datasets and state of the art results. In retrospect of
what has been achieved so far, the survey discusses open challenges and
directions for future research.
| cs.CV cs.LG | texture is a fundamental characteristic of many types of images and texture representation is one of the essential and challenging problems in computer vision and pattern recognition which has attracted extensive research attention since 2000 texture representations based on bag of words bow and on convolutional neural networks cnns have been extensively studied with impressive performance given this period of remarkable evolution this paper aims to present a comprehensive survey of advances in texture representation over the last two decades more than 200 major publications are cited in this survey covering different aspects of the research which includes i problem description ii recent advances in the broad categories of bowbased cnnbased and attributebased methods and iii evaluation issues specifically benchmark datasets and state of the art results in retrospect of what has been achieved so far the survey discusses open challenges and directions for future research | [['texture', 'is', 'a', 'fundamental', 'characteristic', 'of', 'many', 'types', 'of', 'images', 'and', 'texture', 'representation', 'is', 'one', 'of', 'the', 'essential', 'and', 'challenging', 'problems', 'in', 'computer', 'vision', 'and', 'pattern', 'recognition', 'which', 'has', 'attracted', 'extensive', 'research', 'attention', 'since', '2000', 'texture', 'representations', 'based', 'on', 'bag', 'of', 'words', 'bow', 'and', 'on', 'convolutional', 'neural', 'networks', 'cnns', 'have', 'been', 'extensively', 'studied', 'with', 'impressive', 'performance', 'given', 'this', 'period', 'of', 'remarkable', 'evolution', 'this', 'paper', 'aims', 'to', 'present', 'a', 'comprehensive', 'survey', 'of', 'advances', 'in', 'texture', 'representation', 'over', 'the', 'last', 'two', 'decades', 'more', 'than', '200', 'major', 'publications', 'are', 'cited', 'in', 'this', 'survey', 'covering', 'different', 'aspects', 'of', 'the', 'research', 'which', 'includes', 'i', 'problem', 'description', 'ii', 'recent', 'advances', 'in', 'the', 'broad', 'categories', 'of', 'bowbased', 'cnnbased', 'and', 'attributebased', 'methods', 'and', 'iii', 'evaluation', 'issues', 'specifically', 'benchmark', 'datasets', 'and', 'state', 'of', 'the', 'art', 'results', 'in', 'retrospect', 'of', 'what', 'has', 'been', 'achieved', 'so', 'far', 'the', 'survey', 'discusses', 'open', 'challenges', 'and', 'directions', 'for', 'future', 'research']] | [-0.06010647483843009, -0.003493465092479672, -0.04646685692858053, 0.015409603002895792, -0.11631144012311755, -0.1260729998458585, -0.045815777480889316, 0.4376886622750596, -0.22606329921288543, -0.34821850264266335, 0.12878495349456262, -0.2863935115683365, -0.1892337850964794, 0.220419681006293, -0.12530662434507314, 0.10103581569553034, 0.14974901919278685, 0.03184454204683664, -0.10018481676345564, -0.3278908467379539, 0.3042577750572603, 0.02718368970329733, 0.3790228571806562, 0.07585725718822126, 0.09997432501922833, -0.054464500888620745, -0.10289068945004981, -0.012323134227923742, -0.1142363149115787, 0.20795191033051208, 0.3318466503708942, 0.20183174262997017, 0.3322697667507072, -0.40312146954238415, -0.25827170338414684, 0.06784121620098818, 0.18248334030416627, 0.09789955934873633, -0.07206441566066207, -0.322057110646561, 0.08201295603186287, -0.1766664709015558, -0.009929130475789513, -0.06679635681530895, 0.10753461838881677, -0.02045857464282276, -0.16374439230724558, 0.017601610757793262, 0.08041555438452234, 0.16361342392198436, -0.036797170237835804, -0.19428311244342222, 0.09311891779182352, 0.1705633775260912, 0.08017574659826184, 0.0698529102357921, 0.07458260752203275, -0.248814806235278, -0.1568992598092324, 0.38495227820814065, -0.01648098196543686, -0.11418145700447159, 0.2215379825601839, -0.07754019690336252, -0.20000845440727186, 0.09202567462678617, 0.2098346419874834, 0.11929327833038844, -0.15709342202809576, 0.07016696167706307, -0.0814940351865267, 0.12867230658693724, 0.06520677333353214, 0.025331342037869235, 0.24828649208440814, 0.27278865770475097, -0.0008557506662327796, 0.11651107472047044, -0.1168963939799889, -0.10737232257586533, -0.16878529197906386, -0.09050310796688069, -0.13260356023308043, -0.018702619300823505, 0.013272084022253395, -0.12919485503935244, 0.4955818834268067, 0.20807059979933787, 0.1715414273538244, -0.029462563545341054, 0.31995957211450965, -0.007587537214108934, 0.11706736901655797, 0.04188357032707905, 0.20601576395023435, 0.07997259043144343, 0.15981744056526087, -0.09838463457888119, 0.06650829450657897, 0.03401789789296183] |
1,801.10325 | Meromorphic function fields closed by partial derivatives | We characterize meromorphic function fields closed by partial derivatives in
n variables.
| math.CV | we characterize meromorphic function fields closed by partial derivatives in n variables | [['we', 'characterize', 'meromorphic', 'function', 'fields', 'closed', 'by', 'partial', 'derivatives', 'in', 'n', 'variables']] | [-0.30274788569658995, 0.08977169985882938, 0.013886125292629004, 0.12730646195511022, -0.13703757524490356, -0.045135426335036755, 0.04715651615212361, 0.34477417543530464, -0.31372140627354383, -0.17058859082559744, 0.0335626789892558, -0.25034351476157707, -0.21051047259243205, 0.10267349891364574, -0.052163235241702445, 0.08436075799788038, -0.10387828146728377, 0.07563002966344357, -0.10971186639896284, -0.35014578234404325, 0.4134465806807081, -0.232836391000698, 0.08044297279169162, -0.028866329540808994, 0.18798433112291, 0.06935016228817403, -0.05451841993878285, -0.035270512104034424, -0.1918553956784308, -0.020573611681660015, 0.3534409422427416, 0.1267320243641734, 0.28277006947125, -0.5010621572534243, -0.19022892772530517, 0.1324103573958079, 0.12406440374131004, -0.12708892983694872, 0.0703297092889746, -0.23929630809774002, 0.006179658075173696, -0.05225466378033161, -0.28261405994029093, -0.1632855147278557, 0.13132400768032917, 0.13979896499464908, -0.36332576783994835, 0.05534389801323414, -0.01568418973086712, 0.12945513825009888, -0.07601233540723722, -0.160382317379117, -0.06782697366240124, 0.027759256307035685, 0.036323152327289186, 0.10307476793726285, 0.05972275281480203, -0.11013096149933214, -0.08390287682414055, 0.12521341939767203, -0.21091476113845906, -0.39010562177281827, 0.012422413177167376, -0.3130636709198977, -0.16080348705872893, 0.16814799358447394, 0.18814714322797954, 0.27570723618070286, -0.2092057957003514, 0.2761507385099928, -0.041718596359714866, 0.12136401996637385, 0.183576591933767, 0.02988872646043698, 0.11804616109778483, -0.08151499864955743, 0.06764114772280057, 0.21047016912295172, 0.13818943174555898, -0.08505056627715628, -0.37654008134268224, -0.24104145293434462, -0.09273006518681844, 0.10137381769406299, -0.1392808213834845, -0.18484083221604428, 0.4148758612573147, 0.017744941016038258, 0.17308622940133014, 0.08918889650764565, 0.20734007051214576, 0.22986583722134432, 0.06923686775068442, 0.05750000321616729, 0.034568681847304106, 0.284452416584827, -0.03516355521666507, -0.09702798755218585, 0.03710629946241776, 0.1597524005919695] |
1,801.10326 | Incidence structures near configurations of type $(n_3)$ | An $(n_3)$ configuration is an incidence structure equivalent to a linear
hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We
investigate a variant in which one constraint, say 3-regularity, is present,
and we allow exactly one line to have size four, exactly one line to have size
two, and all other lines to have size three. In particular, we study planar
(Euclidean or projective) representations, settling the existence question and
adapting Steinitz' theorem for this setting.
| math.CO | an n_3 configuration is an incidence structure equivalent to a linear hypergraph on n vertices which is both 3regular and 3uniform we investigate a variant in which one constraint say 3regularity is present and we allow exactly one line to have size four exactly one line to have size two and all other lines to have size three in particular we study planar euclidean or projective representations settling the existence question and adapting steinitz theorem for this setting | [['an', 'n_3', 'configuration', 'is', 'an', 'incidence', 'structure', 'equivalent', 'to', 'a', 'linear', 'hypergraph', 'on', 'n', 'vertices', 'which', 'is', 'both', '3regular', 'and', '3uniform', 'we', 'investigate', 'a', 'variant', 'in', 'which', 'one', 'constraint', 'say', '3regularity', 'is', 'present', 'and', 'we', 'allow', 'exactly', 'one', 'line', 'to', 'have', 'size', 'four', 'exactly', 'one', 'line', 'to', 'have', 'size', 'two', 'and', 'all', 'other', 'lines', 'to', 'have', 'size', 'three', 'in', 'particular', 'we', 'study', 'planar', 'euclidean', 'or', 'projective', 'representations', 'settling', 'the', 'existence', 'question', 'and', 'adapting', 'steinitz', 'theorem', 'for', 'this', 'setting']] | [-0.12515470166630172, 0.0970786011860216, -0.023346692015259685, 0.04007291600604046, -0.09111635509709065, -0.20355485946956006, -0.01626346344974908, 0.41222265781229966, -0.2470213931065972, -0.2920975650962315, 0.11602748938618446, -0.30101862853368766, -0.09792113264829114, 0.12270072918663455, -0.05354964861331822, 0.006434594774271011, 0.03383917310396088, 0.05251437916976775, 0.0038814624747285594, -0.3092652242192273, 0.35603222814872376, -0.06157857333854228, 0.21959256359025256, 0.06644561102420285, 0.05587474038437396, 0.03709334889184925, 0.04312798201239535, 0.08818464707462238, -0.15914982152110957, 0.09503524886540972, 0.23503348555464249, 0.15771363795335805, 0.23636412547973842, -0.39904319623170736, -0.15718832967935928, 0.2087380426222241, 0.12810432871005364, 0.11617114464752376, 0.00989163894200238, -0.17424353647239313, 0.10634424170938792, -0.08896111774367171, -0.1436276048567001, 0.004354412014317977, 0.05996743309033382, -0.04087188277792718, -0.24251489204357607, -0.06867695810853855, 0.12043552037763905, 0.049754985160641856, 0.018125010466856228, -0.11407320315090867, 3.089090543133872e-05, 0.10254430384133253, -0.034784318452894494, 0.02735683474653437, 0.043335254779599555, -0.07197493466838904, -0.15699566450792474, 0.3611132445225081, -0.04035068587883823, -0.2315089767859257, 0.18086213654802216, -0.14318774538356568, -0.19800914102838701, 0.1022250334121432, 0.1626245817048596, 0.1693076513127073, -0.09712515388049983, 0.1199615655509247, -0.16798088207308734, 0.16606895223278068, 0.14866404745776157, 0.016482300744936257, 0.1445186451658026, 0.10574128697384391, 0.1336648981782378, 0.16900161580430562, -0.05141944720941995, -0.05777707500020405, -0.24605269633935062, -0.15831229042914974, -0.13796815849000033, 0.09117437970473782, -0.10816804654578763, -0.18841177585546848, 0.38753008431234914, 0.11839128790616796, 0.25330207629927565, 0.07906127538737635, 0.24260671415015475, 0.09580814828733344, 0.02931173795882564, 0.11903233145319785, 0.1752878918566487, 0.16101879280592715, -0.03450670697448122, -0.15690698004751044, 0.011063220027785797, 0.15853241741560498] |
1,801.10327 | Merger Rate Distribution of Primordial-Black-Hole Binaries | Up to now several gravitational-wave events from the coalescences of black
hole binaries have been reported by LIGO/VIRGO, and imply that black holes
should have an extended mass function. We work out the merger rate distribution
of primordial-black-hole binaries with a general mass function by taking into
account the torques by all primordial black holes and linear density
perturbations. In the future, many more coalescences of black hole binaries are
expected to be detected, and the one-dimensional and two-dimensional merger
rate distributions will be crucial for reconstructing the mass function of
primordial black holes.
| astro-ph.CO gr-qc hep-ph hep-th | up to now several gravitationalwave events from the coalescences of black hole binaries have been reported by ligovirgo and imply that black holes should have an extended mass function we work out the merger rate distribution of primordialblackhole binaries with a general mass function by taking into account the torques by all primordial black holes and linear density perturbations in the future many more coalescences of black hole binaries are expected to be detected and the onedimensional and twodimensional merger rate distributions will be crucial for reconstructing the mass function of primordial black holes | [['up', 'to', 'now', 'several', 'gravitationalwave', 'events', 'from', 'the', 'coalescences', 'of', 'black', 'hole', 'binaries', 'have', 'been', 'reported', 'by', 'ligovirgo', 'and', 'imply', 'that', 'black', 'holes', 'should', 'have', 'an', 'extended', 'mass', 'function', 'we', 'work', 'out', 'the', 'merger', 'rate', 'distribution', 'of', 'primordialblackhole', 'binaries', 'with', 'a', 'general', 'mass', 'function', 'by', 'taking', 'into', 'account', 'the', 'torques', 'by', 'all', 'primordial', 'black', 'holes', 'and', 'linear', 'density', 'perturbations', 'in', 'the', 'future', 'many', 'more', 'coalescences', 'of', 'black', 'hole', 'binaries', 'are', 'expected', 'to', 'be', 'detected', 'and', 'the', 'onedimensional', 'and', 'twodimensional', 'merger', 'rate', 'distributions', 'will', 'be', 'crucial', 'for', 'reconstructing', 'the', 'mass', 'function', 'of', 'primordial', 'black', 'holes']] | [-0.126539415984054, 0.13914677009668067, -0.03793952216504402, 0.17648639515923556, -0.06116889543851377, -0.05369206547476752, -0.006311382913100783, 0.3186909140398105, -0.11729690434551367, -0.3351699523677829, 0.08931653054245818, -0.3561061353933427, -0.08070571348071098, 0.28217101645886256, 0.015882729412487116, 0.09385389679421981, 0.07522592881834635, -0.04627462645732267, -0.10923695561516109, -0.2884387803834773, 0.38993226144943505, 0.1508675585450825, 0.10069466491420102, -0.06327133933182365, 0.047069762182492085, -0.008353854860028914, -0.007170521308698, 0.008771628707206698, -0.1558433258230829, 0.0013904586254108336, 0.25296718617247155, 0.20000460620478838, 0.21659953521204092, -0.4198878390654441, -0.28136219454789035, 0.08736213940566265, 0.17433322153444733, 0.16088806414195606, -0.15624185428552215, -0.2946568506679708, 0.120785196153422, -0.3358728277386837, -0.0978861706862126, -0.004964939438767971, 0.09745005165196714, 0.043938236501348274, -0.20672188761896926, 0.13684837334859434, 0.08597322517345028, -0.1759394670045504, -0.12505548413322176, -0.06587876734869574, -0.0959830099055844, 0.10009805736462435, 0.1298850546641055, 0.06796325687118755, 0.20563230380886585, -0.07740484142515769, -0.12995837749012054, 0.32751275262525004, -0.05381944760560028, -0.1344765679690466, 0.14888918791617198, -0.3160115564091792, -0.1490589294016802, 0.14262591330935398, 0.24284172090150977, 0.20168821044486537, -0.22003656161087815, 0.03650046530259793, 0.07688496220150902, 0.20203621002754085, 0.12618200324215395, 0.07575486885616556, 0.5322230254770607, 0.11878462944940854, 0.0088812285710016, 0.10627289352968576, -0.13285654577957365, -0.010805137485506074, -0.18347933505892114, -0.09901032963221873, -0.17581311962942803, 0.14331297803750281, -0.1588687953352678, -0.13543579941715606, 0.29972289374438665, 0.08420221076186707, 0.2223222009006447, 0.028724356597009046, 0.2367745050071017, 0.1403676299878987, 0.07241518977749091, 0.09952882385402116, 0.3759503704896297, 0.14836210965289062, 0.05591185251000508, -0.17273063579904696, 0.03174161837406216, 0.02107810318189603] |
1,801.10328 | Dual Frobenius manifolds of minimal gravity on disk | Liouville field theory approach to 2-dimensional gravity possesses the
duality ($b \leftrightarrow b^{-1}$). The matrix counterpart of minimal gravity
$\mathcal{M}(q,p)$ ($q<p$ co-prime) is effectively described on $A_{q-1}$
Frobenius manifold, which may exhibit a similar duality $p\leftrightarrow q$,
and allow a description on $A_{p-1}$ Frobenius manifold. We have positive
results from the bulk one-point and the bulk-boundary two-point correlations on
disk that the dual description of the Frobenius manifold works for the unitary
series $\mathcal{M}(q, q+1)$. However, for the Lee-Yang series $\mathcal{M}(2,
2q+1)$ on disk the duality is checked only partially. The main difficulty lies
in the absence of a canonical description of trace in the continuum limit.
| hep-th | liouville field theory approach to 2dimensional gravity possesses the duality b leftrightarrow b1 the matrix counterpart of minimal gravity mathcalmqp qp coprime is effectively described on a_q1 frobenius manifold which may exhibit a similar duality pleftrightarrow q and allow a description on a_p1 frobenius manifold we have positive results from the bulk onepoint and the bulkboundary twopoint correlations on disk that the dual description of the frobenius manifold works for the unitary series mathcalmq q1 however for the leeyang series mathcalm2 2q1 on disk the duality is checked only partially the main difficulty lies in the absence of a canonical description of trace in the continuum limit | [['liouville', 'field', 'theory', 'approach', 'to', '2dimensional', 'gravity', 'possesses', 'the', 'duality', 'b', 'leftrightarrow', 'b1', 'the', 'matrix', 'counterpart', 'of', 'minimal', 'gravity', 'mathcalmqp', 'qp', 'coprime', 'is', 'effectively', 'described', 'on', 'a_q1', 'frobenius', 'manifold', 'which', 'may', 'exhibit', 'a', 'similar', 'duality', 'pleftrightarrow', 'q', 'and', 'allow', 'a', 'description', 'on', 'a_p1', 'frobenius', 'manifold', 'we', 'have', 'positive', 'results', 'from', 'the', 'bulk', 'onepoint', 'and', 'the', 'bulkboundary', 'twopoint', 'correlations', 'on', 'disk', 'that', 'the', 'dual', 'description', 'of', 'the', 'frobenius', 'manifold', 'works', 'for', 'the', 'unitary', 'series', 'mathcalmq', 'q1', 'however', 'for', 'the', 'leeyang', 'series', 'mathcalm2', '2q1', 'on', 'disk', 'the', 'duality', 'is', 'checked', 'only', 'partially', 'the', 'main', 'difficulty', 'lies', 'in', 'the', 'absence', 'of', 'a', 'canonical', 'description', 'of', 'trace', 'in', 'the', 'continuum', 'limit']] | [-0.1629649231786884, 0.04349248499742576, -0.11101718124756146, 0.11881596272855642, -0.06540769584521297, -0.1542411288867394, -0.018072918448818937, 0.298307304762836, -0.24451977318330181, -0.20184400333535105, 0.05486543904102984, -0.25422728829795405, -0.1474200872992653, 0.14330001093801997, -0.08180202341061972, 0.013003281342043054, 0.01760581074548619, 0.07730411467408495, -0.14120605983327897, -0.2093830723492872, 0.3638617887427764, -0.0015354549778359278, 0.24759487733244895, 0.043172409345528906, 0.0871232216556867, 0.025214930843295794, 0.012243889232299158, -0.0038727822935297374, -0.13620957868164016, 0.08372711249228035, 0.23242626567149446, 0.06888691306646381, 0.16272085945875872, -0.3996458357732211, -0.1843943979835049, 0.11369382671213575, 0.13281932462206378, 0.047972168280033485, 0.0031882609905941146, -0.2555882915266834, 0.0962566498998231, -0.13296351682039953, -0.15162541030773094, -0.09048035439946467, 0.02324839179027116, -0.06524437158257657, -0.25546074121569595, 0.07590612367771211, 0.11764602672219986, 0.08418422856373668, -0.04957547329055766, -0.10150183190458588, -0.028130051333989416, 0.07434562053974896, 0.027335771324024313, 0.09012871106554354, 0.10318396470199029, -0.1194410961520459, -0.08500505603317704, 0.33661431031900324, -0.08668960976591777, -0.198915233800099, 0.18632947321249438, -0.21671243384480476, -0.15634640817574802, 0.11767193654640799, 0.05481242870557166, 0.1329454777318807, -0.05442605804474581, 0.2321083479062682, -0.12305632637192805, 0.09665631141868375, 0.07654857864337308, 0.016369065203304802, 0.22632131827773438, 0.046933463867753746, 0.04314958921278871, 0.12126070081611119, -0.0372310947360737, -0.12238774836684267, -0.3658641114476181, -0.16926480497710317, -0.21425648390182428, 0.14524570802847545, -0.1329160257550289, -0.15903345581055398, 0.3593731526994989, 0.05002091146140759, 0.18263081206629675, 0.09606648219771506, 0.22313957907414686, 0.11040625032037496, 0.06885005956282839, 0.05184939425616037, 0.18509982186147855, 0.2364981456848216, 0.01579062757747514, -0.2585574458331047, -0.04820655998330386, 0.1970472699297326] |
1,801.10329 | Effective Hamiltonian approach to optical activity in Weyl spin-orbit
system | Chirality or handedness in condensed matter induces anomalous optical
responses such as natural optical activity, rotation of the plane of light
polarization, as a result of breaking of spatial-inversion symmetry. In this
study, optical properties of a Weyl spin-orbit system with quadratic
dispersion, a typical chiral system invariant under time-reversal, are
investigated theoretically by deriving an effective Hamiltonian based on an
imaginary-time path-integral formalism. We show that the effective Hamiltonian
can be indeed written in terms of an optical chirality order parameter
suggested by Lipkin. The natural optical activity is discussed based on the
Hamiltonian.
| cond-mat.mes-hall | chirality or handedness in condensed matter induces anomalous optical responses such as natural optical activity rotation of the plane of light polarization as a result of breaking of spatialinversion symmetry in this study optical properties of a weyl spinorbit system with quadratic dispersion a typical chiral system invariant under timereversal are investigated theoretically by deriving an effective hamiltonian based on an imaginarytime pathintegral formalism we show that the effective hamiltonian can be indeed written in terms of an optical chirality order parameter suggested by lipkin the natural optical activity is discussed based on the hamiltonian | [['chirality', 'or', 'handedness', 'in', 'condensed', 'matter', 'induces', 'anomalous', 'optical', 'responses', 'such', 'as', 'natural', 'optical', 'activity', 'rotation', 'of', 'the', 'plane', 'of', 'light', 'polarization', 'as', 'a', 'result', 'of', 'breaking', 'of', 'spatialinversion', 'symmetry', 'in', 'this', 'study', 'optical', 'properties', 'of', 'a', 'weyl', 'spinorbit', 'system', 'with', 'quadratic', 'dispersion', 'a', 'typical', 'chiral', 'system', 'invariant', 'under', 'timereversal', 'are', 'investigated', 'theoretically', 'by', 'deriving', 'an', 'effective', 'hamiltonian', 'based', 'on', 'an', 'imaginarytime', 'pathintegral', 'formalism', 'we', 'show', 'that', 'the', 'effective', 'hamiltonian', 'can', 'be', 'indeed', 'written', 'in', 'terms', 'of', 'an', 'optical', 'chirality', 'order', 'parameter', 'suggested', 'by', 'lipkin', 'the', 'natural', 'optical', 'activity', 'is', 'discussed', 'based', 'on', 'the', 'hamiltonian']] | [-0.21696762168583902, 0.19802987812696587, -0.08402980258933415, 0.02691045523081955, -0.08433860121049772, -0.10141366995184829, -0.01049005358332866, 0.4015161270765882, -0.2489873619848176, -0.29335182285622546, 0.02652783627793389, -0.21884854223187034, -0.2195883669473819, 0.16758601244686072, 1.9859015255382187e-05, 0.06037164948586571, -0.05039670155138561, 0.025690162804369865, -0.09867369234316835, -0.17189037932181045, 0.28193089683589184, 0.0033139928538156184, 0.2896872238354071, 0.04495425163216791, 0.10438130273434677, 0.06117786105820223, 0.05000443874711269, 0.004870935490256862, -0.07954753118997598, 0.0739667276704782, 0.17755487468583803, -0.01787928605060044, 0.1462321330352049, -0.4329630320989772, -0.22559708799970776, 0.05527573311456332, 0.15224741880144727, 0.15131899875245597, -0.0858426510478909, -0.3266106997861674, -0.011616316333560176, -0.1652761942657985, -0.19472825932561566, -0.12533260026064358, 0.037910870384228856, -0.03512476277537644, -0.2250551858720811, 0.08136419726621458, 0.06248451353687989, 0.1513259090189087, -0.05921284130921489, -0.06098258109322112, -0.0947398753738717, 0.03084927952456239, 0.04914979609954906, 0.03372219905600344, 0.13440705491842603, -0.12533475071878025, -0.13863046588866335, 0.4628914022524106, -0.10394171391932391, -0.1846864181031522, 0.12315091629463591, -0.0926240104863322, -0.10720438546452084, 0.09333613714399307, 0.15445892214775087, 0.10806611285201813, -0.18342838578024193, 0.09316623639315366, -0.07084297766222765, 0.14748514708205077, 0.013638659375474642, 0.11014835043369155, 0.2626846946775913, 0.13540666218552935, 0.04386117553436442, 0.13431489357210108, -0.04685022239818385, -0.08507860507325907, -0.2781898718817454, -0.12913539412061495, -0.23319981815906143, 0.08306115146995963, -0.05727612676319519, -0.1375739016325066, 0.4312370727721013, 0.12302778438713989, 0.17900818350577824, -0.028413384437168898, 0.2793588125833163, 0.19011066085168798, 0.08226537309390934, 0.0006534259141373791, 0.29837173308785025, 0.1553977573878671, 0.04612988163962176, -0.33687223784723563, 0.0002669469502411391, 0.08885020045808663] |
1,801.1033 | On correctors for linear elliptic homogenization in the presence of
local defects: the case of advection-diffusion | We follow-up on our works devoted to homogenization theory for linear
second-order elliptic equations with coefficients that are perturbations of
periodic coefficients. We have first considered equations in divergence form in
[6, 7, 8]. We have next shown, in our recent work [9], using a slightly
different strategy of proof than in our earlier works, that we may also address
the equation --aij$\partial$iju = f. The present work is devoted to
advection-diffusion equations: --aij$\partial$iju + bj$\partial$ju = f. We
prove, under suitable assumptions on the coefficients aij, bj, 1 $\le$ i, j
$\le$ d (typically that they are the sum of a periodic function and some
perturbation in L p , for suitable p < +$\infty$), that the equation admits a
(unique) invariant measure and that this measure may be used to transform the
problem into a problem in divergence form, amenable to the techniques we have
previously developed for the latter case.
| math.AP | we followup on our works devoted to homogenization theory for linear secondorder elliptic equations with coefficients that are perturbations of periodic coefficients we have first considered equations in divergence form in 6 7 8 we have next shown in our recent work 9 using a slightly different strategy of proof than in our earlier works that we may also address the equation aijpartialiju f the present work is devoted to advectiondiffusion equations aijpartialiju bjpartialju f we prove under suitable assumptions on the coefficients aij bj 1 le i j le d typically that they are the sum of a periodic function and some perturbation in l p for suitable p infty that the equation admits a unique invariant measure and that this measure may be used to transform the problem into a problem in divergence form amenable to the techniques we have previously developed for the latter case | [['we', 'followup', 'on', 'our', 'works', 'devoted', 'to', 'homogenization', 'theory', 'for', 'linear', 'secondorder', 'elliptic', 'equations', 'with', 'coefficients', 'that', 'are', 'perturbations', 'of', 'periodic', 'coefficients', 'we', 'have', 'first', 'considered', 'equations', 'in', 'divergence', 'form', 'in', '6', '7', '8', 'we', 'have', 'next', 'shown', 'in', 'our', 'recent', 'work', '9', 'using', 'a', 'slightly', 'different', 'strategy', 'of', 'proof', 'than', 'in', 'our', 'earlier', 'works', 'that', 'we', 'may', 'also', 'address', 'the', 'equation', 'aijpartialiju', 'f', 'the', 'present', 'work', 'is', 'devoted', 'to', 'advectiondiffusion', 'equations', 'aijpartialiju', 'bjpartialju', 'f', 'we', 'prove', 'under', 'suitable', 'assumptions', 'on', 'the', 'coefficients', 'aij', 'bj', '1', 'le', 'i', 'j', 'le', 'd', 'typically', 'that', 'they', 'are', 'the', 'sum', 'of', 'a', 'periodic', 'function', 'and', 'some', 'perturbation', 'in', 'l', 'p', 'for', 'suitable', 'p', 'infty', 'that', 'the', 'equation', 'admits', 'a', 'unique', 'invariant', 'measure', 'and', 'that', 'this', 'measure', 'may', 'be', 'used', 'to', 'transform', 'the', 'problem', 'into', 'a', 'problem', 'in', 'divergence', 'form', 'amenable', 'to', 'the', 'techniques', 'we', 'have', 'previously', 'developed', 'for', 'the', 'latter', 'case']] | [-0.12676336679870553, 0.06750550870561883, -0.11798516723333674, 0.042245276107573185, -0.07486103242579974, -0.13878988907957562, -0.010030479236113122, 0.3440901123646165, -0.2567756917188261, -0.2430929350128182, 0.10215569152077027, -0.29372325779705427, -0.16661726307047872, 0.19516255633214957, -0.06005847115753865, 0.10192964251983125, 0.040721039800923696, 0.026861496725860908, -0.07012644357469287, -0.28518155645452387, 0.32576561654239994, -0.024564665279724972, 0.20400065294768643, 0.021473289990817834, 0.07156287011893174, -0.002117451994686204, -0.043525566875959945, 0.008469603797357504, -0.22526350389295108, 0.09055939080276, 0.24803490228157057, 0.07419147355272909, 0.2952972286868663, -0.401125418598808, -0.19819241419250816, 0.11625155111534052, 0.1492065525658074, 0.06877862656374975, -0.029413623979226464, -0.22091904188962463, 0.13782324383453448, -0.1354104192376289, -0.15330573078828982, -0.07643933949313367, 0.07331097351551867, 0.022009927494337365, -0.30702088988341747, 0.08065737275304558, 0.115422629027431, 0.04737410288886959, -0.08380261261085821, -0.15656891892835192, 0.0449978497915198, 0.04398136017970791, 0.0374803648735745, 0.05145807377043731, 0.027877376950187546, -0.06073281786176471, -0.058000991770326076, 0.3451599233916828, -0.1236783819718383, -0.27163464102742013, 0.16554279809146105, -0.1429024248535992, -0.20180045876518957, 0.11134956667491165, 0.1586957181468099, 0.19012583268895036, -0.13685925066040283, 0.13753871601882714, -0.07183315507991582, 0.142067211106749, 0.09346436807366253, -0.02396370521841609, 0.07369453363242515, 0.0763152922815675, 0.08764043697203529, 0.09929310706314207, -0.01921945943047299, -0.04619251338283525, -0.3171252751735603, -0.1308811164103119, -0.1530400779491075, 0.1021347088980026, -0.03516049001054667, -0.10562995046461919, 0.34346518204008947, 0.15223815592582382, 0.17409801917137946, 0.05815162585706127, 0.2166262932666609, 0.1678636036963728, 0.03845250792588546, 0.07492412167734333, 0.2164341294379718, 0.141008849680221, 0.10564468301148439, -0.15752216969018004, 0.011144528999373468, 0.10880058384215345] |
1,801.10331 | Disks and outflows in the S255IR area of high mass star formation from
ALMA observations | We describe the general structure of the well known S255IR high mass star
forming region, as revealed by our recent ALMA observations. The data indicate
a physical relation of the major clumps SMA1 and SMA2. The driving source of
the extended high velocity well collimated bipolar outflow is not the most
pronounced disk-like SMA1 clump harboring a 20 M$_\odot$ young star (S255
NIRS3), as it was assumed earlier. Apparently it is the less evolved SMA2
clump, which drives the outflow and contains a compact rotating structure
(probably a disk). At the same time the SMA1 clump drives another outflow, with
a larger opening angle. The molecular line data do not show an outflow from the
SMA3 clump (NIRS1), which was suggested by IR studies of this region.
| astro-ph.GA | we describe the general structure of the well known s255ir high mass star forming region as revealed by our recent alma observations the data indicate a physical relation of the major clumps sma1 and sma2 the driving source of the extended high velocity well collimated bipolar outflow is not the most pronounced disklike sma1 clump harboring a 20 m_odot young star s255 nirs3 as it was assumed earlier apparently it is the less evolved sma2 clump which drives the outflow and contains a compact rotating structure probably a disk at the same time the sma1 clump drives another outflow with a larger opening angle the molecular line data do not show an outflow from the sma3 clump nirs1 which was suggested by ir studies of this region | [['we', 'describe', 'the', 'general', 'structure', 'of', 'the', 'well', 'known', 's255ir', 'high', 'mass', 'star', 'forming', 'region', 'as', 'revealed', 'by', 'our', 'recent', 'alma', 'observations', 'the', 'data', 'indicate', 'a', 'physical', 'relation', 'of', 'the', 'major', 'clumps', 'sma1', 'and', 'sma2', 'the', 'driving', 'source', 'of', 'the', 'extended', 'high', 'velocity', 'well', 'collimated', 'bipolar', 'outflow', 'is', 'not', 'the', 'most', 'pronounced', 'disklike', 'sma1', 'clump', 'harboring', 'a', '20', 'm_odot', 'young', 'star', 's255', 'nirs3', 'as', 'it', 'was', 'assumed', 'earlier', 'apparently', 'it', 'is', 'the', 'less', 'evolved', 'sma2', 'clump', 'which', 'drives', 'the', 'outflow', 'and', 'contains', 'a', 'compact', 'rotating', 'structure', 'probably', 'a', 'disk', 'at', 'the', 'same', 'time', 'the', 'sma1', 'clump', 'drives', 'another', 'outflow', 'with', 'a', 'larger', 'opening', 'angle', 'the', 'molecular', 'line', 'data', 'do', 'not', 'show', 'an', 'outflow', 'from', 'the', 'sma3', 'clump', 'nirs1', 'which', 'was', 'suggested', 'by', 'ir', 'studies', 'of', 'this', 'region']] | [-0.11215771093875879, 0.10550266420637305, -0.05011809174533165, 0.08059514154003755, -0.12433098926253262, -0.06962631176048446, -0.004369793001503226, 0.4323654498254496, -0.16061179879553883, -0.3114137075072716, 0.07782722861202995, -0.22690838307792704, -0.032729578241410234, 0.14621633488503802, -0.019897349493389595, -0.0679930332809731, 0.06668555826347854, -0.07821148836667398, -0.012111345623871164, -0.15460087918622847, 0.3204003917201171, 0.07904578795719389, 0.14199759791945182, 0.01402699715265679, 0.09198191154254823, -0.20424325627806997, -0.04121282820715495, -0.0428863449007391, -0.13990352332355485, 0.03578606479623843, 0.19046059669002832, 0.12506660567559597, 0.2275520671964697, -0.33102894656448845, -0.24703599523849015, -0.01743906932824757, 0.24233624379756669, 0.03064833075687703, -0.06534126342000765, -0.2860069587930209, 0.04447861848073819, -0.19952982420375245, -0.23895556875874127, 0.12267176408712412, 0.06070928386087337, 0.014005111016717458, -0.20567639033949475, 0.1439102484682013, 0.04277106617126496, 0.081228488997098, -0.07847974434613235, -0.11238862243610331, -0.1176867849869831, 0.04433985239741141, 0.017373982539755247, 0.19705531436539742, 0.24381435378861155, -0.13024539495832177, -0.008777677245061136, 0.4017673623544859, -0.03528484369310299, -0.005888990501666235, 0.26411381057862726, -0.24886756244906416, -0.21187715506225469, 0.2226320595558112, 0.056679115286983904, 0.1512847283526161, -0.11774999453845093, -0.07852884128759985, -0.09075250664341544, 0.2237387333390495, 0.05423200071146268, 0.022081198272875524, 0.3576629162130375, 0.11265742402553322, 0.028559564459433275, 0.15901702307238583, -0.2331818541704071, -0.10254520701525348, -0.20265421635722594, -0.10074209904442319, -0.13309014140672626, 0.0898277023218162, -0.1337768179288278, -0.10146992823796436, 0.2714548827525938, 0.03305429497378923, 0.23468769536841483, -0.030578467159694624, 0.30584285884637324, 0.05727428807747654, 0.19341705596104028, 0.2093726531417656, 0.2881771601692197, 0.17887330905068666, 0.13785385300907943, -0.23459670258434637, 0.10474313395042416, -0.02704687353171822] |
1,801.10332 | How to manipulate magnetic states of antiferromagnets | Antiferromagnetic materials, which have drawn considerable attention
recently, have fascinating features: they are robust against perturbation,
produce no stray fields, and exhibit ultrafast dynamics. Discerning how to
efficiently manipulate the magnetic state of an antiferromagnet is key to the
development of antiferromagnetic spintronics. In this review, we introduce four
main methods (magnetic, strain, electrical, and optical) to mediate the
magnetic states and elaborate on intrinsic origins of different
antiferromagnetic materials. Magnetic control includes a strong magnetic field,
exchange bias, and field cooling, which are traditional and basic. Strain
control involves the magnetic anisotropy effect or metamagnetic transition.
Electrical control can be divided into two parts, electric field and electric
current, both of which are convenient for practical applications. Optical
control includes thermal and electronic excitation, an inertia-driven
mechanism, and terahertz laser control, with the potential for ultrafast
antiferromagnetic manipulation. This review sheds light on effective usage of
antiferromagnets and provides a new perspective on antiferromagnetic
spintronics.
| cond-mat.mtrl-sci | antiferromagnetic materials which have drawn considerable attention recently have fascinating features they are robust against perturbation produce no stray fields and exhibit ultrafast dynamics discerning how to efficiently manipulate the magnetic state of an antiferromagnet is key to the development of antiferromagnetic spintronics in this review we introduce four main methods magnetic strain electrical and optical to mediate the magnetic states and elaborate on intrinsic origins of different antiferromagnetic materials magnetic control includes a strong magnetic field exchange bias and field cooling which are traditional and basic strain control involves the magnetic anisotropy effect or metamagnetic transition electrical control can be divided into two parts electric field and electric current both of which are convenient for practical applications optical control includes thermal and electronic excitation an inertiadriven mechanism and terahertz laser control with the potential for ultrafast antiferromagnetic manipulation this review sheds light on effective usage of antiferromagnets and provides a new perspective on antiferromagnetic spintronics | [['antiferromagnetic', 'materials', 'which', 'have', 'drawn', 'considerable', 'attention', 'recently', 'have', 'fascinating', 'features', 'they', 'are', 'robust', 'against', 'perturbation', 'produce', 'no', 'stray', 'fields', 'and', 'exhibit', 'ultrafast', 'dynamics', 'discerning', 'how', 'to', 'efficiently', 'manipulate', 'the', 'magnetic', 'state', 'of', 'an', 'antiferromagnet', 'is', 'key', 'to', 'the', 'development', 'of', 'antiferromagnetic', 'spintronics', 'in', 'this', 'review', 'we', 'introduce', 'four', 'main', 'methods', 'magnetic', 'strain', 'electrical', 'and', 'optical', 'to', 'mediate', 'the', 'magnetic', 'states', 'and', 'elaborate', 'on', 'intrinsic', 'origins', 'of', 'different', 'antiferromagnetic', 'materials', 'magnetic', 'control', 'includes', 'a', 'strong', 'magnetic', 'field', 'exchange', 'bias', 'and', 'field', 'cooling', 'which', 'are', 'traditional', 'and', 'basic', 'strain', 'control', 'involves', 'the', 'magnetic', 'anisotropy', 'effect', 'or', 'metamagnetic', 'transition', 'electrical', 'control', 'can', 'be', 'divided', 'into', 'two', 'parts', 'electric', 'field', 'and', 'electric', 'current', 'both', 'of', 'which', 'are', 'convenient', 'for', 'practical', 'applications', 'optical', 'control', 'includes', 'thermal', 'and', 'electronic', 'excitation', 'an', 'inertiadriven', 'mechanism', 'and', 'terahertz', 'laser', 'control', 'with', 'the', 'potential', 'for', 'ultrafast', 'antiferromagnetic', 'manipulation', 'this', 'review', 'sheds', 'light', 'on', 'effective', 'usage', 'of', 'antiferromagnets', 'and', 'provides', 'a', 'new', 'perspective', 'on', 'antiferromagnetic', 'spintronics']] | [-0.18815534156956112, 0.21285861625074176, -0.028662210000523675, 0.03271523543009654, -0.13786639412865043, -0.1710192712250715, 0.01835779728403745, 0.45306854493892157, -0.27628687128591806, -0.319715573058392, 0.04141150295916491, -0.2683072039612736, -0.14183278323467582, 0.2508756107970093, 0.03551842721226888, -0.013555957216363495, -0.07056179396264876, -0.051368738866399206, -0.028024627772631507, -0.18761849912922257, 0.24865533950595328, -0.02168663132686514, 0.3503669477008188, 0.09316301567611308, 0.08236436118097164, 0.03264647514338438, 0.08630024571623206, 0.0005117240570819912, -0.10662828825969392, 0.11663665277517747, 0.24794337768943456, -0.04212667318120694, 0.25850350596607685, -0.4942853603249368, -0.24165415701169807, 0.03191968529538896, 0.11919237002402018, 0.18661913731809293, -0.1393354921206199, -0.285792919425055, 0.024628536918988593, -0.11081994204029727, -0.07634592699282504, -0.21679502195463732, -0.010642385213545005, 0.028545971935949266, -0.25979674052900803, 0.04029450687271609, 0.05865908713148644, 0.14334271342541355, -0.10855588684222685, -0.12062558619520412, -0.029566085401874703, 0.10427897643351641, 0.06044448543047437, 0.09523523330557136, 0.21868550090883404, -0.14218517368396696, -0.1666410030104602, 0.34791579655108923, 0.00648398320369709, -0.07113374460888548, 0.1551821083890107, -0.1267189869432537, -0.07403245474322317, 0.14329836730552742, 0.19132673729640934, 0.06568392243039292, -0.159738339409859, 0.05567016286248616, 0.07907949107436416, 0.14980932844665426, -0.019554889483748783, 0.1392293432884169, 0.3113851845801736, 0.19513974051761368, 0.04599614857803457, 0.16821457546440144, -0.09829395257372361, -0.08067892559577161, -0.19446689314328325, -0.15274771317565003, -0.17848927760496736, 0.09150957100045605, -0.0640106116956397, -0.20154970405826297, 0.4423386745650369, 0.2489971815256211, 0.09013187108659902, -0.1215519058459904, 0.3204363457506331, 0.07469445891164912, 0.060137026177611776, 0.01882996962656482, 0.2864872693734912, 0.21000072239593676, 0.1618647428963763, -0.26084980685398196, 0.06182526260948716, -0.028503498701283183] |
1,801.10333 | Root Cause Analysis and Correction of Single Metal Contact Open-Induced
Scan Chain Failure in 90nm node VLSI | In this paper, the localization of open metal contact for 90nm node SOC is
reported based on Electron Beam Absorbed Current (EBAC) technique and scan
diagnosis for the first time. According to the detected excess carbon, silicon
and oxygen signals obtained from X-ray energy dispersive spectroscopy (EDX),
the failure was deemed to be caused by the incomplete removal of silicate
photoresist polymer formed during the O2 plasma dry clean before copper
plating. Based on this, we proposed to replace the dry clean with diluted HF
clean prior to the copper plating, which can significantly remove the silicate
polymers and increase the yield.
| physics.app-ph | in this paper the localization of open metal contact for 90nm node soc is reported based on electron beam absorbed current ebac technique and scan diagnosis for the first time according to the detected excess carbon silicon and oxygen signals obtained from xray energy dispersive spectroscopy edx the failure was deemed to be caused by the incomplete removal of silicate photoresist polymer formed during the o2 plasma dry clean before copper plating based on this we proposed to replace the dry clean with diluted hf clean prior to the copper plating which can significantly remove the silicate polymers and increase the yield | [['in', 'this', 'paper', 'the', 'localization', 'of', 'open', 'metal', 'contact', 'for', '90nm', 'node', 'soc', 'is', 'reported', 'based', 'on', 'electron', 'beam', 'absorbed', 'current', 'ebac', 'technique', 'and', 'scan', 'diagnosis', 'for', 'the', 'first', 'time', 'according', 'to', 'the', 'detected', 'excess', 'carbon', 'silicon', 'and', 'oxygen', 'signals', 'obtained', 'from', 'xray', 'energy', 'dispersive', 'spectroscopy', 'edx', 'the', 'failure', 'was', 'deemed', 'to', 'be', 'caused', 'by', 'the', 'incomplete', 'removal', 'of', 'silicate', 'photoresist', 'polymer', 'formed', 'during', 'the', 'o2', 'plasma', 'dry', 'clean', 'before', 'copper', 'plating', 'based', 'on', 'this', 'we', 'proposed', 'to', 'replace', 'the', 'dry', 'clean', 'with', 'diluted', 'hf', 'clean', 'prior', 'to', 'the', 'copper', 'plating', 'which', 'can', 'significantly', 'remove', 'the', 'silicate', 'polymers', 'and', 'increase', 'the', 'yield']] | [-0.0005195903085062609, 0.13277771025348237, -0.033805926252777375, -0.022928062482855702, 0.010657253949081196, -0.1879006514608787, 0.10083560008834135, 0.4235794327641819, -0.2305851163132591, -0.2972257260744478, 0.06692198981581182, -0.33365162922179, -0.04392984487554606, 0.15857779581611062, -0.046598206617750736, 0.04654653416033469, 0.05278636997236925, -0.09888104172240869, -0.04438467775745427, -0.24143585799994946, 0.2219372133669608, 0.15482935660482183, 0.30579328186371746, 0.08843475976484079, 0.035915873605785346, 0.03451220225771049, -0.01525564769062661, -0.02305748592441566, -0.11193931937105292, 0.08210203036045034, 0.2589998246871355, -0.02500593055304432, 0.16274210615323254, -0.5123169914746255, -0.24847495518898702, 0.05128685549339827, 0.09702494075777483, 0.10061851640884746, -0.09545307326491229, -0.27279205691964165, 0.06845626544992567, -0.14644036127199297, -0.09836714236777933, 0.02991765261828607, -0.03457973809803233, 0.0033165899415810904, -0.24050986733031915, 0.08788814684193508, 0.04811760197923172, 0.0434387240504079, -0.09124833990148652, -0.13104849316490194, -0.08832069096502428, 0.03597975090401722, 0.015539632776898205, 0.043575924611193875, 0.28653452995543677, -0.031056952290693482, -0.012848126400700387, 0.347164963719015, -0.06394632801860936, -0.06125593596302411, 0.2218125503825243, -0.1282075261697173, -0.10462503508189876, 0.2477632248135028, 0.11926094218905942, 0.08949154947756552, -0.20619663583598666, -0.03879118773243938, 0.022819592548972544, 0.20322323422856153, 0.14688377076869502, -0.0065940969861021225, 0.22626351215420107, 0.2400893306224972, -0.02468125450004842, 0.1507195796002634, -0.18952660229257948, 0.05789626055561444, -0.16582240081362554, -0.1817455812193015, -0.20855557647825895, 0.05349610313800547, -0.024899131748123395, -0.19413427498155073, 0.35273959307347, 0.12316949894268285, 0.14675497284213848, -0.07174956181209863, 0.2953909679850125, 0.06143539996050736, 0.10346800147318373, -0.004983448688233015, 0.27948643444288596, 0.10793549061853293, 0.14021844214157148, -0.2422366389096258, 0.1458829512691819, 0.030688333763357473] |
1,801.10334 | Quantitative recurrence properties and homogeneous self-similar sets | Let $K$ be a homogeneous self-similar set satisfying the strong separation
condition. This paper is concerned with the quantitative recurrence properties
of the natural map $T: K\rightarrow K$ induced by the shift. Let $\mu$ be the
natural self-similar measure supported on $K$. For a positive function
$\varphi$ defined on $\mathbb{N}$, we show that the $\mu$-measure of the
following set \begin{equation*}
R(\varphi):=\{x\in K: |T^n x-x|<\varphi(n) \; \text{for infinitely many} \;
n\in\mathbb{N}\} \end{equation*} is null or full according to convergence or
divergence of a certain series. Moreover, a similar dichotomy law holds for the
general Hausdorff measure, which completes the metric theory of this set.
| math.DS math.NT | let k be a homogeneous selfsimilar set satisfying the strong separation condition this paper is concerned with the quantitative recurrence properties of the natural map t krightarrow k induced by the shift let mu be the natural selfsimilar measure supported on k for a positive function varphi defined on mathbbn we show that the mumeasure of the following set beginequation rvarphixin k tn xxvarphin textfor infinitely many ninmathbbn endequation is null or full according to convergence or divergence of a certain series moreover a similar dichotomy law holds for the general hausdorff measure which completes the metric theory of this set | [['let', 'k', 'be', 'a', 'homogeneous', 'selfsimilar', 'set', 'satisfying', 'the', 'strong', 'separation', 'condition', 'this', 'paper', 'is', 'concerned', 'with', 'the', 'quantitative', 'recurrence', 'properties', 'of', 'the', 'natural', 'map', 't', 'krightarrow', 'k', 'induced', 'by', 'the', 'shift', 'let', 'mu', 'be', 'the', 'natural', 'selfsimilar', 'measure', 'supported', 'on', 'k', 'for', 'a', 'positive', 'function', 'varphi', 'defined', 'on', 'mathbbn', 'we', 'show', 'that', 'the', 'mumeasure', 'of', 'the', 'following', 'set', 'beginequation', 'rvarphixin', 'k', 'tn', 'xxvarphin', 'textfor', 'infinitely', 'many', 'ninmathbbn', 'endequation', 'is', 'null', 'or', 'full', 'according', 'to', 'convergence', 'or', 'divergence', 'of', 'a', 'certain', 'series', 'moreover', 'a', 'similar', 'dichotomy', 'law', 'holds', 'for', 'the', 'general', 'hausdorff', 'measure', 'which', 'completes', 'the', 'metric', 'theory', 'of', 'this', 'set']] | [-0.20814331789792637, 0.11744213334491684, -0.07655691842764917, 0.05015966124042417, -0.061554774914802324, -0.14966903819768418, 0.039763920587685075, 0.2989159724816228, -0.3182811319376483, -0.1727706275767449, 0.04537444332181805, -0.33396457062300405, -0.08344757588429734, 0.18432953712445768, -0.05231557453446316, 0.05943345470410405, 0.009028753726696126, 0.13587647621435198, -0.04957082084699938, -0.21272916094084846, 0.36332963509108834, -0.06419552825015, 0.23103082302318076, 0.036455867729723604, 0.10886230488599401, -0.03209433020233656, 0.03097366816787557, 0.05836010131344959, -0.2507333859941373, 0.05524010057243603, 0.21058163623504264, 0.1396101617320168, 0.29047161468652766, -0.30329612262471756, -0.19379934533075852, 0.23147425192850407, 0.12015604077440903, -0.09161124347045904, 0.006523818302090571, -0.2982810780199038, 0.18988838385451923, -0.06165943736083467, -0.16048166843018297, -0.06965022583520322, 0.10705602833192156, 0.03656497312653245, -0.36528371393943976, 0.0660161544484171, 0.1758313682823997, 0.11583150417139434, -0.04820410127403459, -0.11144105662389499, -0.0014870892939712814, 0.09173009359169601, 0.01585194169816495, 0.13959805310746146, 0.03860798710251622, -0.012132366042057372, -0.047799328483189595, 0.37003563785680915, -0.12393097667437461, -0.20819990952132325, 0.1329430172201058, -0.23323249017744505, -0.1537526897766223, 0.10031702663899973, 0.1000581746615206, 0.1654864045844391, -0.11151890498068598, 0.2097329144375493, -0.12667140100301819, 0.12707913750688535, 0.13614643079162847, -0.008831827579250776, 0.14441566548964027, 0.0833590506397263, 0.14405763678833597, 0.1370041443886367, 0.05650809815510957, 0.003014461866420026, -0.36912665918770465, -0.15613604707624576, -0.17161594063626848, 0.19231470350430094, -0.11209874483991904, -0.18947126785989363, 0.3048184563010705, 0.06253685662111343, 0.23459339944053104, 0.14989910404682347, 0.1904159968794145, 0.16022287209143726, -0.02979042461715789, 0.049630377846158515, 0.043208979131334056, 0.16128130926458975, 0.03886906654018946, -0.20149624492088802, 0.052386978551783044, 0.11346786787187813] |
1,801.10335 | On correctors for linear elliptic homogenization in the presence of
local defects | We consider the corrector equation associated, in homogenization theory , to
a linear second-order elliptic equation in divergence form
--$\partial$i(aij$\partial$ju) = f , when the diffusion coefficient is a
locally perturbed periodic coefficient. The question under study is the
existence (and uniqueness) of the corrector, strictly sublinear at infinity,
with gradient in L r if the local perturbation is itself L r , r < +$\infty$.
The present work follows up on our works [7, 8, 9], providing an alternative,
more general and versatile approach , based on an a priori estimate, for this
well-posedness result. Equations in non-divergence form such as
--aij$\partial$iju = f are also considered, along with various extensions. The
case of general advection-diffusion equations --aij$\partial$iju +
bj$\partial$ju = f is postponed until our future work [10]. An appendix
contains a corrigendum to our earlier publication [9].
| math.AP | we consider the corrector equation associated in homogenization theory to a linear secondorder elliptic equation in divergence form partialiaijpartialju f when the diffusion coefficient is a locally perturbed periodic coefficient the question under study is the existence and uniqueness of the corrector strictly sublinear at infinity with gradient in l r if the local perturbation is itself l r r infty the present work follows up on our works 7 8 9 providing an alternative more general and versatile approach based on an a priori estimate for this wellposedness result equations in nondivergence form such as aijpartialiju f are also considered along with various extensions the case of general advectiondiffusion equations aijpartialiju bjpartialju f is postponed until our future work 10 an appendix contains a corrigendum to our earlier publication 9 | [['we', 'consider', 'the', 'corrector', 'equation', 'associated', 'in', 'homogenization', 'theory', 'to', 'a', 'linear', 'secondorder', 'elliptic', 'equation', 'in', 'divergence', 'form', 'partialiaijpartialju', 'f', 'when', 'the', 'diffusion', 'coefficient', 'is', 'a', 'locally', 'perturbed', 'periodic', 'coefficient', 'the', 'question', 'under', 'study', 'is', 'the', 'existence', 'and', 'uniqueness', 'of', 'the', 'corrector', 'strictly', 'sublinear', 'at', 'infinity', 'with', 'gradient', 'in', 'l', 'r', 'if', 'the', 'local', 'perturbation', 'is', 'itself', 'l', 'r', 'r', 'infty', 'the', 'present', 'work', 'follows', 'up', 'on', 'our', 'works', '7', '8', '9', 'providing', 'an', 'alternative', 'more', 'general', 'and', 'versatile', 'approach', 'based', 'on', 'an', 'a', 'priori', 'estimate', 'for', 'this', 'wellposedness', 'result', 'equations', 'in', 'nondivergence', 'form', 'such', 'as', 'aijpartialiju', 'f', 'are', 'also', 'considered', 'along', 'with', 'various', 'extensions', 'the', 'case', 'of', 'general', 'advectiondiffusion', 'equations', 'aijpartialiju', 'bjpartialju', 'f', 'is', 'postponed', 'until', 'our', 'future', 'work', '10', 'an', 'appendix', 'contains', 'a', 'corrigendum', 'to', 'our', 'earlier', 'publication', '9']] | [-0.13285693650715083, 0.054759757316110894, -0.07250533396984603, 0.020736354772297506, -0.0986942389777811, -0.1522246532777483, -0.04617879879498465, 0.2922441884586515, -0.2837101153581757, -0.24241853374338082, 0.12107714448961639, -0.31752425279692104, -0.13300772101028152, 0.17896312685293514, -0.059324084907452494, 0.05356325411288313, 0.02585585567334941, 0.056462419385364816, -0.05567306725402153, -0.28884821830411234, 0.3044527754703782, 0.018265153817442613, 0.199640510271686, 0.03230709316199483, 0.058958002882774974, 0.01034120854726711, -0.04181025130674243, -0.0045916159427905265, -0.2047519324085217, 0.08625614838024905, 0.2454061154673208, 0.029685899425774466, 0.32837949831818425, -0.38447267421369635, -0.19618175402572452, 0.06394809494228211, 0.1328720011867496, 0.08141098988726157, -0.05245191860791068, -0.22990865463051627, 0.09534842785503787, -0.12518915447384812, -0.21631486530148591, -0.035276804846718676, 0.06898598805116851, 0.023112820668954603, -0.31966872460952445, 0.11008465397437897, 0.14322722049848746, 0.09132176943036706, -0.08810818213572394, -0.10517782009163396, 0.018412386432701593, 0.018942183381092714, 0.029201296406307135, 0.09700963821879394, 0.058207313198047554, -0.05922921191040939, -0.03380948964094873, 0.33178148213629577, -0.15038539811088017, -0.2593864998906533, 0.1445118506247712, -0.12534724374106804, -0.13434629855034946, 0.09816315634060623, 0.14205773983352868, 0.17988132442484878, -0.16430899809358746, 0.16636708410467607, -0.07459834550485708, 0.14539454831893361, 0.09144984090758503, -0.04732224668553027, 0.06787394756241882, 0.12085881578562738, 0.15425446733124842, 0.11175290555621013, -0.0019554131228455103, -0.05983117244805592, -0.3928227957641316, -0.13616149222601004, -0.1389180930031738, 0.14012950846506644, -0.09568810235016777, -0.15987599170189207, 0.3284927029704112, 0.12245958745154704, 0.17628606052729914, 0.0814220688356332, 0.23972116937037818, 0.1660842120217867, -0.006023749594857317, 0.11329569348834398, 0.19368065369690862, 0.1693963376469477, 0.14070343237023714, -0.16383358528440486, 0.02846243401787193, 0.1271640702526179] |
1,801.10336 | Nonautonomous gradient-like ODEs on the circle: classification,
structural stability and autonomization | We study a class of scalar differential equations on the circle $S^1$. This
class is characterized mainly by the property that any solution of such an
equation possesses exponential dichotomy both on the semi-axes $\R_+$ and
$\R_+$. Also we impose some other assumptions on the structure of the foliation
into integral curves for such the equation. Differential equations of this
class are called gradient-like ones. As a result, we describe the global
behavior of the foliation, introduce a complete invariant of uniform
equivalency, give standard models for the equations of the distinguished class.
The case of almost periodic gradient-like equations is also studied, their
classification is presented.
| math.DS | we study a class of scalar differential equations on the circle s1 this class is characterized mainly by the property that any solution of such an equation possesses exponential dichotomy both on the semiaxes r_ and r_ also we impose some other assumptions on the structure of the foliation into integral curves for such the equation differential equations of this class are called gradientlike ones as a result we describe the global behavior of the foliation introduce a complete invariant of uniform equivalency give standard models for the equations of the distinguished class the case of almost periodic gradientlike equations is also studied their classification is presented | [['we', 'study', 'a', 'class', 'of', 'scalar', 'differential', 'equations', 'on', 'the', 'circle', 's1', 'this', 'class', 'is', 'characterized', 'mainly', 'by', 'the', 'property', 'that', 'any', 'solution', 'of', 'such', 'an', 'equation', 'possesses', 'exponential', 'dichotomy', 'both', 'on', 'the', 'semiaxes', 'r_', 'and', 'r_', 'also', 'we', 'impose', 'some', 'other', 'assumptions', 'on', 'the', 'structure', 'of', 'the', 'foliation', 'into', 'integral', 'curves', 'for', 'such', 'the', 'equation', 'differential', 'equations', 'of', 'this', 'class', 'are', 'called', 'gradientlike', 'ones', 'as', 'a', 'result', 'we', 'describe', 'the', 'global', 'behavior', 'of', 'the', 'foliation', 'introduce', 'a', 'complete', 'invariant', 'of', 'uniform', 'equivalency', 'give', 'standard', 'models', 'for', 'the', 'equations', 'of', 'the', 'distinguished', 'class', 'the', 'case', 'of', 'almost', 'periodic', 'gradientlike', 'equations', 'is', 'also', 'studied', 'their', 'classification', 'is', 'presented']] | [-0.20189745751183444, 0.052984054240743005, -0.09950390798431412, 0.0754808136882156, -0.0976444208280784, -0.11394204525277019, -0.05764939995900353, 0.3141045903734793, -0.2879025152510154, -0.22502302839942973, 0.1394648780898304, -0.27586260972387877, -0.14931854267091116, 0.2053523038592294, -0.07370917688376297, 0.04050955690756858, 0.0501813349818863, 0.08512107332924677, -0.1122323656519962, -0.2187341190831057, 0.4045699747087799, -0.06424259516262562, 0.21678869315710303, -1.0623996990306355e-05, 0.15694360153436243, -0.019400020417208983, -0.02027856038065157, 0.032568554071901, -0.2034531974076064, 0.08731332842573941, 0.16863681168979383, 0.10058665796069899, 0.22022344034696084, -0.3639379807782716, -0.21301885061270653, 0.1312669852409059, 0.09425288414425939, 0.05371825397667414, -0.05745862779385959, -0.28582402930386086, 0.0950684293791234, -0.12643591434668713, -0.20366506249574232, -0.06892092740946562, 0.02909605196355102, 0.044137878025768795, -0.23207207599265292, 0.06310612071581864, 0.17873205419925747, 0.058767881509891456, -0.11373988932398992, -0.06640426185695786, -0.04101948965793458, 0.045947062112739155, 0.05646535178219952, -0.003057126449769206, 0.07467154309884688, -0.10503460430305138, -0.07013128359506134, 0.3728868351013304, -0.11146019358257546, -0.293347038084937, 0.14706394008021348, -0.12320708473448024, -0.1704258242595906, 0.10927005620481813, 0.1715065423033644, 0.19116563296432945, -0.16898605717094745, 0.15601661605444936, -0.10307208225392153, 0.10067636794715284, 0.04476391191803197, 0.019369123490509864, 0.12453885864744955, 0.12082480352424155, 0.12065989857487311, 0.12583029336485332, -0.0193467915572757, -0.12126220701366802, -0.36002668081217004, -0.16541878047407926, -0.1008637829696777, 0.1147088882748351, -0.09233020587210113, -0.22536047414776425, 0.4155145284728469, 0.062193084878098465, 0.19714015015514097, 0.09098357347353736, 0.2126695828851765, 0.18463208017953472, 0.029558236303817584, 0.06803386133928754, 0.20621086853674928, 0.16000152322481098, 0.06920733997842, -0.19342232192213707, 0.04657327517362259, 0.14212015007457166] |
1,801.10337 | Proposal for detecting nodal-line semimetal surface-states with resonant
spin-flipped reflection | Topological nodal-line semimetals are predicted to exhibit unique
drumhead-like surface states (DSS). Yet, a direct detection of such states
remains a challenge. Here, we propose spin-resolved transport in a junction
between a normal metal and a spin-orbit coupled nodal-line semimetal as the
mechanism for their detection. Specifically, we find that in such a device, the
DSS induce resonant spin-flipped reflection. This effect can be probed by both
vertical spin transport and lateral charge transport between anti-parallel
magnetic terminals. In the tunneling limit of the junction, both spin and
charge conductances exhibit a resonant peak around zero energy, providing a
unique evidence of the DSS. This signature is robust to both dispersive DSS and
interface disorder. Based on numerical calculations, we show that the scheme
can be implemented in the topological semimetal HgCr$_2$Se$_4$.
| cond-mat.mes-hall cond-mat.str-el | topological nodalline semimetals are predicted to exhibit unique drumheadlike surface states dss yet a direct detection of such states remains a challenge here we propose spinresolved transport in a junction between a normal metal and a spinorbit coupled nodalline semimetal as the mechanism for their detection specifically we find that in such a device the dss induce resonant spinflipped reflection this effect can be probed by both vertical spin transport and lateral charge transport between antiparallel magnetic terminals in the tunneling limit of the junction both spin and charge conductances exhibit a resonant peak around zero energy providing a unique evidence of the dss this signature is robust to both dispersive dss and interface disorder based on numerical calculations we show that the scheme can be implemented in the topological semimetal hgcr_2se_4 | [['topological', 'nodalline', 'semimetals', 'are', 'predicted', 'to', 'exhibit', 'unique', 'drumheadlike', 'surface', 'states', 'dss', 'yet', 'a', 'direct', 'detection', 'of', 'such', 'states', 'remains', 'a', 'challenge', 'here', 'we', 'propose', 'spinresolved', 'transport', 'in', 'a', 'junction', 'between', 'a', 'normal', 'metal', 'and', 'a', 'spinorbit', 'coupled', 'nodalline', 'semimetal', 'as', 'the', 'mechanism', 'for', 'their', 'detection', 'specifically', 'we', 'find', 'that', 'in', 'such', 'a', 'device', 'the', 'dss', 'induce', 'resonant', 'spinflipped', 'reflection', 'this', 'effect', 'can', 'be', 'probed', 'by', 'both', 'vertical', 'spin', 'transport', 'and', 'lateral', 'charge', 'transport', 'between', 'antiparallel', 'magnetic', 'terminals', 'in', 'the', 'tunneling', 'limit', 'of', 'the', 'junction', 'both', 'spin', 'and', 'charge', 'conductances', 'exhibit', 'a', 'resonant', 'peak', 'around', 'zero', 'energy', 'providing', 'a', 'unique', 'evidence', 'of', 'the', 'dss', 'this', 'signature', 'is', 'robust', 'to', 'both', 'dispersive', 'dss', 'and', 'interface', 'disorder', 'based', 'on', 'numerical', 'calculations', 'we', 'show', 'that', 'the', 'scheme', 'can', 'be', 'implemented', 'in', 'the', 'topological', 'semimetal', 'hgcr_2se_4']] | [-0.25995120968824875, 0.1681382327519576, -0.05900249678895555, 0.030959409022188716, -0.06190519321314765, -0.2052439861846241, 0.09954221192906103, 0.40336697069561167, -0.2686861789587772, -0.2854546944215668, 0.000985110502259693, -0.30127269800075074, -0.17184756931524273, 0.18511110024039887, 0.045864726289768114, 0.030005698321584725, -0.011534024178135123, -0.0611184082826543, -0.08424886668768578, -0.12469138411776812, 0.29348814861573785, -0.0239552152642952, 0.34181990779964533, 0.12877631694022001, 0.04541591919295377, -0.01383381062822247, 0.09300988200685066, 0.05893868252381005, -0.12712616605252455, 0.020615414953543663, 0.2639660620109432, -0.10606730432482436, 0.1604559048992638, -0.47154769552589365, -0.20510098686050202, 0.0361285212160455, 0.15610665493163237, 0.17512302202257243, -0.12959664548962432, -0.31350356640265975, 0.07793868454455426, -0.17398281734098087, -0.09903329342011023, -0.09894475118595768, -0.02126760067855657, -0.02359346599868414, -0.24326977478058048, 0.09191829586316916, 0.03663823371894206, 0.0518760332201275, -0.06977434350957276, -0.026212371800228895, -0.13752702483907342, 0.06983970807314935, -0.0033735056693496353, -0.004276215423350081, 0.1320997063803864, -0.12412963383901639, -0.15648571648158727, 0.35414464866467327, -0.08609954763034527, -0.15993629199114034, 0.18582657973853534, -0.15452935664815773, -0.05568089969385641, 0.14323361685753547, 0.1372799895647349, 0.0952457716886067, -0.128036451850538, 0.04789570294440526, -0.04607762324546153, 0.11283749841492284, 0.016862364055475955, 0.11666368140669708, 0.32713726339650084, 0.19628096891172003, 0.07119719662781183, 0.10290667589464592, -0.16977077855721512, 0.004182198257749957, -0.23601408453065564, -0.21021529186912108, -0.23577406618631247, 0.07813031170823678, -0.008502227862967024, -0.20709732787288498, 0.42022536485376005, 0.14359759539189382, 0.17369091260479763, -0.05327459133343038, 0.27711919723008055, 0.159374617688379, 0.062327991947037815, 0.07350596327645083, 0.25524874203520914, 0.14110191115072335, 0.08732557639296194, -0.29774084442760795, 0.06621538418006491, -0.020352747023218508] |
1,801.10338 | Laser acceleration of highly energetic carbon ions using a double-layer
target composed of slightly underdense plasma and ultrathin foil | We report the experimental generation of highly energetic carbon ions up to
48 MeV per nucleon by shooting double-layer targets composed of well-controlled
slightly underdense plasma (SUP) and ultrathin foils with ultra-intense
femtosecond laser pulses. Particle-in-cell simulations reveal that carbon ions
residing in the ultrathin foils undergo radiation pressure acceleration and
long-time sheath field acceleration in sequence due to the existence of the SUP
in front of the foils. Such an acceleration scheme is especially suited for
heavy ion acceleration with femtosecond laser pulses. The breakthrough of heavy
ion energy up to multi-tens of MeV/u at high-repetition-rate would be able to
trigger significant advances in nuclear physics, high energy density physics,
and medical physics.
| physics.plasm-ph | we report the experimental generation of highly energetic carbon ions up to 48 mev per nucleon by shooting doublelayer targets composed of wellcontrolled slightly underdense plasma sup and ultrathin foils with ultraintense femtosecond laser pulses particleincell simulations reveal that carbon ions residing in the ultrathin foils undergo radiation pressure acceleration and longtime sheath field acceleration in sequence due to the existence of the sup in front of the foils such an acceleration scheme is especially suited for heavy ion acceleration with femtosecond laser pulses the breakthrough of heavy ion energy up to multitens of mevu at highrepetitionrate would be able to trigger significant advances in nuclear physics high energy density physics and medical physics | [['we', 'report', 'the', 'experimental', 'generation', 'of', 'highly', 'energetic', 'carbon', 'ions', 'up', 'to', '48', 'mev', 'per', 'nucleon', 'by', 'shooting', 'doublelayer', 'targets', 'composed', 'of', 'wellcontrolled', 'slightly', 'underdense', 'plasma', 'sup', 'and', 'ultrathin', 'foils', 'with', 'ultraintense', 'femtosecond', 'laser', 'pulses', 'particleincell', 'simulations', 'reveal', 'that', 'carbon', 'ions', 'residing', 'in', 'the', 'ultrathin', 'foils', 'undergo', 'radiation', 'pressure', 'acceleration', 'and', 'longtime', 'sheath', 'field', 'acceleration', 'in', 'sequence', 'due', 'to', 'the', 'existence', 'of', 'the', 'sup', 'in', 'front', 'of', 'the', 'foils', 'such', 'an', 'acceleration', 'scheme', 'is', 'especially', 'suited', 'for', 'heavy', 'ion', 'acceleration', 'with', 'femtosecond', 'laser', 'pulses', 'the', 'breakthrough', 'of', 'heavy', 'ion', 'energy', 'up', 'to', 'multitens', 'of', 'mevu', 'at', 'highrepetitionrate', 'would', 'be', 'able', 'to', 'trigger', 'significant', 'advances', 'in', 'nuclear', 'physics', 'high', 'energy', 'density', 'physics', 'and', 'medical', 'physics']] | [-0.05350610196994272, 0.2894981804323657, -0.020492396276213427, 0.020059976738102867, 0.05232476668748634, -0.15256559992192592, -0.020973217515975435, 0.4776647226571773, -0.2277241196664693, -0.3629262703924184, -0.055078767128783256, -0.3055620464801261, 0.08200280041541014, 0.23751848660805056, 0.030074167102410468, 0.05404328098376405, 0.09620750308411806, -0.10388738314406865, -0.013466819912706197, -0.1605480180661667, 0.20621620004160116, 0.20560144856407314, 0.28557326380921677, 0.11816290144981668, 0.1164725340956377, -0.05982203031189542, 0.0782173711279061, -0.11063325443033097, -0.10207186594461987, 0.0891943953960178, 0.2566985729916961, -0.023305910460205866, 0.27842925549938086, -0.5468085460793392, -0.23159589065420152, -0.0018824328940394706, 0.1501639804440196, 0.08618468795367311, -0.2139943554601838, -0.23584641517857008, 0.03524203467351772, -0.1721584295814824, -0.1777720515684748, -0.03194563248631569, 0.0022738329552122252, 0.15966009418686142, -0.2844917567073887, 0.030462045813869455, 0.0015177037319646473, 0.01943830965680227, -0.06048845402500798, -0.06677469888504232, 0.01729642594876015, -0.03414705505211368, 0.06675066659433058, 0.11236860119300869, 0.2634037958321046, -0.13748684339225292, -0.06278138265706006, 0.39929512481048574, -0.04821093910501495, -0.03188063388492549, 0.19837636798949895, -0.23390926625909267, -0.06132540009932312, 0.2439397888637222, 0.18191928416490555, 0.14036651064056607, -0.12714293154484008, 0.011428681126511367, 0.06073579188349731, 0.207341583840566, 0.1933335279716195, 0.05365175647512738, 0.23287338614556527, 0.2551154684423741, 0.00012785670207401292, 0.0738179928664864, -0.15750953685533486, 0.007064187128624294, -0.2681085393656935, -0.1383418293785205, -0.1293384938014556, 0.0685116425403847, -0.03196731694127676, -0.1335071474231318, 0.3732920002957651, 0.14241588394882868, 0.05724025014952748, -0.1492382678557682, 0.28224913273995694, 0.05128142666236489, 0.012070106927602164, 0.06547675702506595, 0.2821385154615989, 0.17398864540798936, 0.17058808063939873, -0.2553502304636074, 0.009373090275258353, 0.02408953724157032] |
1,801.10339 | A Continuous - Time Quantum Walk for Attributed Graphs Matching | Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now
.In specific, Quantum network routing, Quantum Walk Search Algorithm, Element
distinctness associated to the eigenvalues of Graphs and the use of these
relation /connection in the study of Quantum walks is furthermore described.
Different Researchers had contribution and put their benchmark idea Pertaining
with this research concept. I furthermore try to investigate recent Application
of Quantum walks, In specific the problem pertained with Graph matching i.e
Matching nodes(vertices) of the Graphs. In this research paper,I consider how
Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems.
The matching problem is abstracted using weighted(attributed) Graphs that
connects vertices's of one Graph to other and Try to compute the distance b/n
those Graphs Node's Beside that finding the matched nodes and the Cost related
to Matching. eventually measuring the distance between two Graphs which might
have different size then by using k-nearest neighbor (k-NN) method try to
classifying those graph based on closest training examples in the feature
space.
| cs.DS | diverse facets of the theory of quantum walks on graph are reviewed till now in specific quantum network routing quantum walk search algorithm element distinctness associated to the eigenvalues of graphs and the use of these relation connection in the study of quantum walks is furthermore described different researchers had contribution and put their benchmark idea pertaining with this research concept i furthermore try to investigate recent application of quantum walks in specific the problem pertained with graph matching ie matching nodesvertices of the graphs in this research paperi consider how continuoustime quantum walk ctqw can be directed to graphmatching problems the matching problem is abstracted using weightedattributed graphs that connects verticess of one graph to other and try to compute the distance bn those graphs nodes beside that finding the matched nodes and the cost related to matching eventually measuring the distance between two graphs which might have different size then by using knearest neighbor knn method try to classifying those graph based on closest training examples in the feature space | [['diverse', 'facets', 'of', 'the', 'theory', 'of', 'quantum', 'walks', 'on', 'graph', 'are', 'reviewed', 'till', 'now', 'in', 'specific', 'quantum', 'network', 'routing', 'quantum', 'walk', 'search', 'algorithm', 'element', 'distinctness', 'associated', 'to', 'the', 'eigenvalues', 'of', 'graphs', 'and', 'the', 'use', 'of', 'these', 'relation', 'connection', 'in', 'the', 'study', 'of', 'quantum', 'walks', 'is', 'furthermore', 'described', 'different', 'researchers', 'had', 'contribution', 'and', 'put', 'their', 'benchmark', 'idea', 'pertaining', 'with', 'this', 'research', 'concept', 'i', 'furthermore', 'try', 'to', 'investigate', 'recent', 'application', 'of', 'quantum', 'walks', 'in', 'specific', 'the', 'problem', 'pertained', 'with', 'graph', 'matching', 'ie', 'matching', 'nodesvertices', 'of', 'the', 'graphs', 'in', 'this', 'research', 'paperi', 'consider', 'how', 'continuoustime', 'quantum', 'walk', 'ctqw', 'can', 'be', 'directed', 'to', 'graphmatching', 'problems', 'the', 'matching', 'problem', 'is', 'abstracted', 'using', 'weightedattributed', 'graphs', 'that', 'connects', 'verticess', 'of', 'one', 'graph', 'to', 'other', 'and', 'try', 'to', 'compute', 'the', 'distance', 'bn', 'those', 'graphs', 'nodes', 'beside', 'that', 'finding', 'the', 'matched', 'nodes', 'and', 'the', 'cost', 'related', 'to', 'matching', 'eventually', 'measuring', 'the', 'distance', 'between', 'two', 'graphs', 'which', 'might', 'have', 'different', 'size', 'then', 'by', 'using', 'knearest', 'neighbor', 'knn', 'method', 'try', 'to', 'classifying', 'those', 'graph', 'based', 'on', 'closest', 'training', 'examples', 'in', 'the', 'feature', 'space']] | [-0.085503597063122, 0.09438665589208112, -0.06731899122789721, 0.06387808463700553, -0.12177608552224496, -0.17865887840983788, 0.07681899743414868, 0.4330899266745238, -0.3043582897962016, -0.3219648326144499, 0.08906727126895395, -0.3223376500201138, -0.17866476757917554, 0.13782538191333193, -0.08255293691147338, 0.0798299646415912, 0.07927423124680953, 0.08991265385959517, -0.014972729968961656, -0.2762216810582151, 0.3218217851861161, 0.03042165503207156, 0.26426906604182854, 0.047031621610307515, 0.04755920757923056, 0.006764617400682148, -0.056174274469273824, 0.047482453159789335, -0.14277320466567556, 0.1465556959306602, 0.27718675152727346, 0.15951186660129357, 0.2597831473740585, -0.41651600969626623, -0.17601102721904788, 0.16237391027457573, 0.12847370315233575, 0.10737698977635078, 0.0004099957415532759, -0.2997666581821464, 0.08924610079745487, -0.11442653431611903, -0.04990786522325567, -0.014390891548657022, 0.026293131925494356, 0.014424296938266386, -0.17766206844107194, -0.024198553431779145, 0.03318893883979934, 0.015535808150546953, 0.04932658270768383, -0.10788809628883267, 0.03790366770151783, 0.1707337127341067, -0.027982453800573508, 0.034707393209956694, 0.098156154569348, -0.10521068632986177, -0.2509510871488601, 0.3902967916582437, 0.017186021380236043, -0.1685403411190183, 0.17031153353883008, -0.07546411214998978, -0.1830639633048764, 0.03431239483111045, 0.21009995281415553, 0.11464820410508443, -0.15830849928726606, 0.08022629794059492, -0.042865394784466306, 0.07676606737625073, 0.07984187202665079, 0.01861061681719387, 0.1609503757468808, 0.15042982748983538, 0.11119375412544126, 0.17714156017001884, -0.026964560729410388, -0.1608034109532395, -0.2299131913453012, -0.11957625156706747, -0.2618133110651637, 0.02605074809398502, -0.17047380665830775, -0.19777367710108484, 0.41795740674030696, 0.200739437248729, 0.2095865509034518, 0.08522188418120255, 0.2395040810765589, 0.07384667411371244, 0.039439631304155814, 0.12229095444302349, 0.17055809747612596, 0.1510039971141583, 0.05571666525776142, -0.17662500152501331, 0.0639664918944404, 0.12969879211844218] |
1,801.1034 | Cyber-Physical Microservices: An IoT-based Framework for Manufacturing
Systems | Recent advances in ICT enable the evolution of the manufacturing industry to
meet the new requirements of the society. Cyber-physical systems,
Internet-of-Things (IoT), and Cloud computing, play a key role in the fourth
industrial revolution known as Industry 4.0. The microservice architecture has
evolved as an alternative to SOA and promises to address many of the challenges
in software development. In this paper, we adopt the concept of microservice
and describe a framework for manufacturing systems that has the cyber-physical
microservice as the key construct. The manufacturing plant processes are
defined as compositions of primitive cyber-physical microservices adopting
either the orchestration or the choreography pattern. IoT technologies are used
for system integration and model-driven engineering is utilized to
semi-automate the development process for the industrial engineer, who is not
familiar with microservices and IoT. Two case studies demonstrate the
feasibility of the proposed approach.
| cs.SE | recent advances in ict enable the evolution of the manufacturing industry to meet the new requirements of the society cyberphysical systems internetofthings iot and cloud computing play a key role in the fourth industrial revolution known as industry 40 the microservice architecture has evolved as an alternative to soa and promises to address many of the challenges in software development in this paper we adopt the concept of microservice and describe a framework for manufacturing systems that has the cyberphysical microservice as the key construct the manufacturing plant processes are defined as compositions of primitive cyberphysical microservices adopting either the orchestration or the choreography pattern iot technologies are used for system integration and modeldriven engineering is utilized to semiautomate the development process for the industrial engineer who is not familiar with microservices and iot two case studies demonstrate the feasibility of the proposed approach | [['recent', 'advances', 'in', 'ict', 'enable', 'the', 'evolution', 'of', 'the', 'manufacturing', 'industry', 'to', 'meet', 'the', 'new', 'requirements', 'of', 'the', 'society', 'cyberphysical', 'systems', 'internetofthings', 'iot', 'and', 'cloud', 'computing', 'play', 'a', 'key', 'role', 'in', 'the', 'fourth', 'industrial', 'revolution', 'known', 'as', 'industry', '40', 'the', 'microservice', 'architecture', 'has', 'evolved', 'as', 'an', 'alternative', 'to', 'soa', 'and', 'promises', 'to', 'address', 'many', 'of', 'the', 'challenges', 'in', 'software', 'development', 'in', 'this', 'paper', 'we', 'adopt', 'the', 'concept', 'of', 'microservice', 'and', 'describe', 'a', 'framework', 'for', 'manufacturing', 'systems', 'that', 'has', 'the', 'cyberphysical', 'microservice', 'as', 'the', 'key', 'construct', 'the', 'manufacturing', 'plant', 'processes', 'are', 'defined', 'as', 'compositions', 'of', 'primitive', 'cyberphysical', 'microservices', 'adopting', 'either', 'the', 'orchestration', 'or', 'the', 'choreography', 'pattern', 'iot', 'technologies', 'are', 'used', 'for', 'system', 'integration', 'and', 'modeldriven', 'engineering', 'is', 'utilized', 'to', 'semiautomate', 'the', 'development', 'process', 'for', 'the', 'industrial', 'engineer', 'who', 'is', 'not', 'familiar', 'with', 'microservices', 'and', 'iot', 'two', 'case', 'studies', 'demonstrate', 'the', 'feasibility', 'of', 'the', 'proposed', 'approach']] | [-0.1572526543782765, 0.03152201770080865, -0.018706254501820594, -0.01791080220364923, -0.07331389666069299, -0.13490072244975534, -0.03115328725268935, 0.33196273916918373, -0.2679130188448148, -0.33665795118496233, 0.14372581059999195, -0.24447207730069445, -0.20728428531987853, 0.2240089276052054, -0.15486459437266198, 0.12349713247062431, 0.01500813995112872, -0.061152537914393984, 0.02757929902711314, -0.23730300610703933, 0.30752515766491545, 0.020224727457389235, 0.37678453050062266, 0.07086471844943137, 0.04552985676046875, -0.03218717402746228, -0.01577342134421795, -0.10095651224643613, -0.06564534792035677, 0.21128183117252775, 0.3722619040765696, 0.2485784901590604, 0.37570801712071344, -0.4654174923586349, -0.19942208545722273, 0.062049942350616526, 0.17816022889261754, 0.005448233729111962, -0.07749871212248156, -0.26803058709063204, 0.08491403211761887, -0.3024098732437576, -0.1851189012458134, -0.06805058070151265, 0.01962766171264876, 0.03704122270897238, -0.21297342411465556, -0.09097186624421738, 0.040827458346029744, 0.07511595857795328, -0.025793575351902593, -0.09964904371412962, -0.00425810189335607, 0.20040040975598256, 0.0070253114744345015, 0.0023584641037612325, 0.2163297047405245, -0.1478917153548941, -0.17373610749685517, 0.432304131358655, 0.031233960902884265, -0.13478839677150567, 0.1910218142357836, -0.005132696251772965, -0.2000788621759663, 0.011978303528546045, 0.2489092752188703, 0.029847272109085072, -0.24046433627760658, 0.078658311533622, 0.09636084410077375, 0.13185222470201552, 0.015152369572509391, 0.04061583556055363, 0.23989241104896386, 0.2934545252291072, 0.0889568632438669, 0.1080721787891687, 0.0022803698246005094, -0.16061128132989527, -0.19526532021700405, -0.23065385386709952, -0.1281128765436329, 0.001837655756692887, -0.025773034380411747, -0.17767605503710607, 0.3458729868774147, 0.21039562896799502, 0.06170283481737392, -0.009667300889203843, 0.37685379306074335, 0.05262881912252245, 0.14326956936889068, 0.05478512895448754, 0.1887487084184411, 0.04760689603022507, 0.26193665964415735, -0.1357535484777246, 0.12895200472444734, -0.02760440880309842] |
1,801.10341 | An Infinitesimal Probabilistic Model for Principal Component Analysis of
Manifold Valued Data | We provide a probabilistic and infinitesimal view of how the principal
component analysis procedure (PCA) can be generalized to analysis of nonlinear
manifold valued data. Starting with the probabilistic PCA interpretation of the
Euclidean PCA procedure, we show how PCA can be generalized to manifolds in an
intrinsic way that does not resort to linearization of the data space. The
underlying probability model is constructed by mapping a Euclidean stochastic
process to the manifold using stochastic development of Euclidean
semimartingales. The construction uses a connection and bundles of covariant
tensors to allow global transport of principal eigenvectors, and the model is
thereby an example of how principal fiber bundles can be used to handle the
lack of global coordinate system and orientations that characterizes manifold
valued statistics. We show how curvature implies non-integrability of the
equivalent of Euclidean principal subspaces, and how the stochastic flows
provide an alternative to explicit construction of such subspaces. We describe
estimation procedures for inference of parameters and prediction of principal
components, and we give examples of properties of the model on embedded
surfaces.
| math.ST cs.CV stat.TH | we provide a probabilistic and infinitesimal view of how the principal component analysis procedure pca can be generalized to analysis of nonlinear manifold valued data starting with the probabilistic pca interpretation of the euclidean pca procedure we show how pca can be generalized to manifolds in an intrinsic way that does not resort to linearization of the data space the underlying probability model is constructed by mapping a euclidean stochastic process to the manifold using stochastic development of euclidean semimartingales the construction uses a connection and bundles of covariant tensors to allow global transport of principal eigenvectors and the model is thereby an example of how principal fiber bundles can be used to handle the lack of global coordinate system and orientations that characterizes manifold valued statistics we show how curvature implies nonintegrability of the equivalent of euclidean principal subspaces and how the stochastic flows provide an alternative to explicit construction of such subspaces we describe estimation procedures for inference of parameters and prediction of principal components and we give examples of properties of the model on embedded surfaces | [['we', 'provide', 'a', 'probabilistic', 'and', 'infinitesimal', 'view', 'of', 'how', 'the', 'principal', 'component', 'analysis', 'procedure', 'pca', 'can', 'be', 'generalized', 'to', 'analysis', 'of', 'nonlinear', 'manifold', 'valued', 'data', 'starting', 'with', 'the', 'probabilistic', 'pca', 'interpretation', 'of', 'the', 'euclidean', 'pca', 'procedure', 'we', 'show', 'how', 'pca', 'can', 'be', 'generalized', 'to', 'manifolds', 'in', 'an', 'intrinsic', 'way', 'that', 'does', 'not', 'resort', 'to', 'linearization', 'of', 'the', 'data', 'space', 'the', 'underlying', 'probability', 'model', 'is', 'constructed', 'by', 'mapping', 'a', 'euclidean', 'stochastic', 'process', 'to', 'the', 'manifold', 'using', 'stochastic', 'development', 'of', 'euclidean', 'semimartingales', 'the', 'construction', 'uses', 'a', 'connection', 'and', 'bundles', 'of', 'covariant', 'tensors', 'to', 'allow', 'global', 'transport', 'of', 'principal', 'eigenvectors', 'and', 'the', 'model', 'is', 'thereby', 'an', 'example', 'of', 'how', 'principal', 'fiber', 'bundles', 'can', 'be', 'used', 'to', 'handle', 'the', 'lack', 'of', 'global', 'coordinate', 'system', 'and', 'orientations', 'that', 'characterizes', 'manifold', 'valued', 'statistics', 'we', 'show', 'how', 'curvature', 'implies', 'nonintegrability', 'of', 'the', 'equivalent', 'of', 'euclidean', 'principal', 'subspaces', 'and', 'how', 'the', 'stochastic', 'flows', 'provide', 'an', 'alternative', 'to', 'explicit', 'construction', 'of', 'such', 'subspaces', 'we', 'describe', 'estimation', 'procedures', 'for', 'inference', 'of', 'parameters', 'and', 'prediction', 'of', 'principal', 'components', 'and', 'we', 'give', 'examples', 'of', 'properties', 'of', 'the', 'model', 'on', 'embedded', 'surfaces']] | [-0.11599912847959379, 0.021085077132128944, -0.14021640641006053, 0.08324824486488312, -0.12113463127330029, -0.12464551068582265, -0.019375912985613558, 0.3808591905252894, -0.3114582582652652, -0.2302980827942865, 0.14313921138225383, -0.22611083861898276, -0.21960968907152476, 0.1739892725502375, -0.11251409029765003, 0.04933439454261484, 0.06132859627939969, 0.034357846787722274, -0.09825749118817585, -0.2134646275158784, 0.3737182088531866, 0.06401104248628312, 0.2770337131675645, -0.017361900636499655, 0.15238327361960693, 0.052400830307163755, -0.053581629976026675, 0.028121031441448736, -0.09701403221104088, 0.18822835511189764, 0.26979875994206265, 0.18730884616252805, 0.2247526064611368, -0.4350678559247009, -0.2029188517139647, 0.16789477136943426, 0.14366329992765575, 0.07437840970909462, 0.05178224730341794, -0.2714618324047194, 0.05377925264612673, -0.10819417350098241, -0.1639863208128795, -0.18678148385324625, -0.030918534964780902, -0.0027525225477345165, -0.25274991451934314, 0.0484606274897909, 0.12465216257926805, 0.06132438224636268, -0.08829229125133897, -0.06911240595811718, -0.04073420653962556, 0.10534035031782599, 0.05064249989123333, 0.0008588301683854125, 0.1413559975940214, -0.02917525076890083, -0.15323780599478165, 0.35184145181871657, -0.08094009145698901, -0.2912390541972062, 0.14240792566421312, -0.0700055002703139, -0.1470753434504377, 0.11613053308055846, 0.19861944212172408, 0.1090776979461164, -0.13260627603782704, 0.10366160399963371, -0.04797586718282803, 0.1347961370708348, -0.023815956602767942, -0.013692888638148392, 0.1505666575758775, 0.13542625059337257, 0.10941202363987712, 0.12295918366234417, -0.0838640177792833, -0.09604024470851408, -0.343151246951945, -0.1836386116344466, -0.16324468617920643, 0.0906600485564445, -0.16136027298103198, -0.19716116230591466, 0.40413385114825057, 0.1382953271285407, 0.22979894169351325, 0.07677166280987043, 0.27012040972314233, 0.09759829227953067, 0.027615462846055046, 0.06325873858477483, 0.19216918387494503, 0.21143312186299298, 0.022309007445043317, -0.15737363401645607, 0.014982351310051687, 0.12146457979668909] |
1,801.10342 | ConvCSNet: A Convolutional Compressive Sensing Framework Based on Deep
Learning | Compressive sensing (CS), aiming to reconstruct an image/signal from a small
set of random measurements has attracted considerable attentions in recent
years. Due to the high dimensionality of images, previous CS methods mainly
work on image blocks to avoid the huge requirements of memory and computation,
i.e., image blocks are measured with Gaussian random matrices, and the whole
images are recovered from the reconstructed image blocks. Though efficient,
such methods suffer from serious blocking artifacts. In this paper, we propose
a convolutional CS framework that senses the whole image using a set of
convolutional filters. Instead of reconstructing individual blocks, the whole
image is reconstructed from the linear convolutional measurements.
Specifically, the convolutional CS is implemented based on a convolutional
neural network (CNN), which performs both the convolutional CS and nonlinear
reconstruction. Through end-to-end training, the sensing filters and the
reconstruction network can be jointly optimized. To facilitate the design of
the CS reconstruction network, a novel two-branch CNN inspired from a
sparsity-based CS reconstruction model is developed. Experimental results show
that the proposed method substantially outperforms previous state-of-the-art CS
methods in term of both PSNR and visual quality.
| cs.CV | compressive sensing cs aiming to reconstruct an imagesignal from a small set of random measurements has attracted considerable attentions in recent years due to the high dimensionality of images previous cs methods mainly work on image blocks to avoid the huge requirements of memory and computation ie image blocks are measured with gaussian random matrices and the whole images are recovered from the reconstructed image blocks though efficient such methods suffer from serious blocking artifacts in this paper we propose a convolutional cs framework that senses the whole image using a set of convolutional filters instead of reconstructing individual blocks the whole image is reconstructed from the linear convolutional measurements specifically the convolutional cs is implemented based on a convolutional neural network cnn which performs both the convolutional cs and nonlinear reconstruction through endtoend training the sensing filters and the reconstruction network can be jointly optimized to facilitate the design of the cs reconstruction network a novel twobranch cnn inspired from a sparsitybased cs reconstruction model is developed experimental results show that the proposed method substantially outperforms previous stateoftheart cs methods in term of both psnr and visual quality | [['compressive', 'sensing', 'cs', 'aiming', 'to', 'reconstruct', 'an', 'imagesignal', 'from', 'a', 'small', 'set', 'of', 'random', 'measurements', 'has', 'attracted', 'considerable', 'attentions', 'in', 'recent', 'years', 'due', 'to', 'the', 'high', 'dimensionality', 'of', 'images', 'previous', 'cs', 'methods', 'mainly', 'work', 'on', 'image', 'blocks', 'to', 'avoid', 'the', 'huge', 'requirements', 'of', 'memory', 'and', 'computation', 'ie', 'image', 'blocks', 'are', 'measured', 'with', 'gaussian', 'random', 'matrices', 'and', 'the', 'whole', 'images', 'are', 'recovered', 'from', 'the', 'reconstructed', 'image', 'blocks', 'though', 'efficient', 'such', 'methods', 'suffer', 'from', 'serious', 'blocking', 'artifacts', 'in', 'this', 'paper', 'we', 'propose', 'a', 'convolutional', 'cs', 'framework', 'that', 'senses', 'the', 'whole', 'image', 'using', 'a', 'set', 'of', 'convolutional', 'filters', 'instead', 'of', 'reconstructing', 'individual', 'blocks', 'the', 'whole', 'image', 'is', 'reconstructed', 'from', 'the', 'linear', 'convolutional', 'measurements', 'specifically', 'the', 'convolutional', 'cs', 'is', 'implemented', 'based', 'on', 'a', 'convolutional', 'neural', 'network', 'cnn', 'which', 'performs', 'both', 'the', 'convolutional', 'cs', 'and', 'nonlinear', 'reconstruction', 'through', 'endtoend', 'training', 'the', 'sensing', 'filters', 'and', 'the', 'reconstruction', 'network', 'can', 'be', 'jointly', 'optimized', 'to', 'facilitate', 'the', 'design', 'of', 'the', 'cs', 'reconstruction', 'network', 'a', 'novel', 'twobranch', 'cnn', 'inspired', 'from', 'a', 'sparsitybased', 'cs', 'reconstruction', 'model', 'is', 'developed', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'method', 'substantially', 'outperforms', 'previous', 'stateoftheart', 'cs', 'methods', 'in', 'term', 'of', 'both', 'psnr', 'and', 'visual', 'quality']] | [-0.03625597709927846, -0.008294597450965922, -0.03727037017726433, -0.033525288536178845, -0.04730788930738099, -0.19334170360256125, -0.006277192082187092, 0.442341820233398, -0.30389047843507594, -0.3049753402438626, 0.10962953550861804, -0.24918214974077368, -0.23379236645011045, 0.12739253306155285, -0.16702843240567572, 0.14248840885345268, 0.14330769991305062, 0.02398800436978933, -0.1446616155381509, -0.2569052568222914, 0.24025032002597102, 0.08486794344292431, 0.3923567158401643, -0.0381014079949449, 0.12989527888586203, -0.023213484878257588, -0.08739690330044599, 0.007540648623872253, -0.022816292640137754, 0.1958673538781195, 0.30453163141350226, 0.21400589763370542, 0.27851939921528496, -0.47253873970891747, -0.29123879973308514, 0.06473442783490532, 0.16051528376783367, 0.1469064604844553, -0.07634026984309669, -0.3548426466782099, 0.11180888055133875, -0.13461883464414212, 0.08487059110184274, -0.10027053784000042, -0.07022735054565288, -0.046265012101718676, -0.31771721840200445, 0.05016659782514488, 0.044409488694293904, 0.02815470114232056, -0.053937064541045514, -0.15286209889091354, 0.03150772636381493, 0.139786445474124, -0.0172102695457864, 0.09489590053017886, 0.15501766768407332, -0.18264180489707363, -0.09321212355187902, 0.34529297546084436, -0.0751044887984073, -0.1882501484385184, 0.18092040499923603, -0.03675020446202585, -0.13632709529157236, 0.16947755834491796, 0.24363658181514847, 0.10679363560365149, -0.15733331285673316, 0.04794053238214156, -0.04369927840011697, 0.1870323448237426, 0.0639674586438569, 0.045670663171679414, 0.1570525190093254, 0.21838787490706496, 0.010587498502529881, 0.1434188353651691, -0.2121008253488788, -0.026716325623931846, -0.15950206088680755, -0.08302484272373101, -0.2502368948811655, -0.04404964870108025, -0.09446636330613203, -0.14009427719764292, 0.43397778688644173, 0.21250612388744397, 0.24821461062316622, 0.0846126303427838, 0.4054043560027682, 0.03263076474393038, 0.17996725914063594, 0.054818138482650276, 0.20249746126866847, 0.10053822885774982, 0.12435978826778453, -0.14782648950090838, 0.036420441972382527, 0.07837597036330157] |
1,801.10343 | Josephson effect in junctions of conventional and topological
superconductors | We present a theoretical analysis of the equilibrium Josephson current-phase
relation in hybrid devices made of conventional s-wave spin-singlet
superconductors (S) and topological superconductor (TS) wires featuring
Majorana end states. Using Green's function techniques, the topological
superconductor is alternatively described by the low-energy continuum limit of
a Kitaev chain or by a more microscopic spinful nanowire model. We show that
for the simplest S-TS tunnel junction, only the s-wave pairing correlations in
a spinful TS nanowire model can generate a Josephson effect. The critical
current is much smaller in the topological regime and exhibits a kink-like
dependence on the Zeeman field along the wire. When a correlated quantum dot
(QD) in the magnetic regime is present in the junction region, however, the
Josephson current becomes finite also in the deep topological phase as shown
for the cotunneling regime and by a mean-field analysis. Remarkably, we find
that the S-QD-TS setup can support $\varphi_0$-junction behavior, where a
finite supercurrent flows at vanishing phase difference. Finally, we also
address a multi-terminal S-TS-S geometry, where the TS wire acts as tunable
parity switch on the Andreev bound states in a superconducting atomic contact.
| cond-mat.mes-hall | we present a theoretical analysis of the equilibrium josephson currentphase relation in hybrid devices made of conventional swave spinsinglet superconductors s and topological superconductor ts wires featuring majorana end states using greens function techniques the topological superconductor is alternatively described by the lowenergy continuum limit of a kitaev chain or by a more microscopic spinful nanowire model we show that for the simplest sts tunnel junction only the swave pairing correlations in a spinful ts nanowire model can generate a josephson effect the critical current is much smaller in the topological regime and exhibits a kinklike dependence on the zeeman field along the wire when a correlated quantum dot qd in the magnetic regime is present in the junction region however the josephson current becomes finite also in the deep topological phase as shown for the cotunneling regime and by a meanfield analysis remarkably we find that the sqdts setup can support varphi_0junction behavior where a finite supercurrent flows at vanishing phase difference finally we also address a multiterminal stss geometry where the ts wire acts as tunable parity switch on the andreev bound states in a superconducting atomic contact | [['we', 'present', 'a', 'theoretical', 'analysis', 'of', 'the', 'equilibrium', 'josephson', 'currentphase', 'relation', 'in', 'hybrid', 'devices', 'made', 'of', 'conventional', 'swave', 'spinsinglet', 'superconductors', 's', 'and', 'topological', 'superconductor', 'ts', 'wires', 'featuring', 'majorana', 'end', 'states', 'using', 'greens', 'function', 'techniques', 'the', 'topological', 'superconductor', 'is', 'alternatively', 'described', 'by', 'the', 'lowenergy', 'continuum', 'limit', 'of', 'a', 'kitaev', 'chain', 'or', 'by', 'a', 'more', 'microscopic', 'spinful', 'nanowire', 'model', 'we', 'show', 'that', 'for', 'the', 'simplest', 'sts', 'tunnel', 'junction', 'only', 'the', 'swave', 'pairing', 'correlations', 'in', 'a', 'spinful', 'ts', 'nanowire', 'model', 'can', 'generate', 'a', 'josephson', 'effect', 'the', 'critical', 'current', 'is', 'much', 'smaller', 'in', 'the', 'topological', 'regime', 'and', 'exhibits', 'a', 'kinklike', 'dependence', 'on', 'the', 'zeeman', 'field', 'along', 'the', 'wire', 'when', 'a', 'correlated', 'quantum', 'dot', 'qd', 'in', 'the', 'magnetic', 'regime', 'is', 'present', 'in', 'the', 'junction', 'region', 'however', 'the', 'josephson', 'current', 'becomes', 'finite', 'also', 'in', 'the', 'deep', 'topological', 'phase', 'as', 'shown', 'for', 'the', 'cotunneling', 'regime', 'and', 'by', 'a', 'meanfield', 'analysis', 'remarkably', 'we', 'find', 'that', 'the', 'sqdts', 'setup', 'can', 'support', 'varphi_0junction', 'behavior', 'where', 'a', 'finite', 'supercurrent', 'flows', 'at', 'vanishing', 'phase', 'difference', 'finally', 'we', 'also', 'address', 'a', 'multiterminal', 'stss', 'geometry', 'where', 'the', 'ts', 'wire', 'acts', 'as', 'tunable', 'parity', 'switch', 'on', 'the', 'andreev', 'bound', 'states', 'in', 'a', 'superconducting', 'atomic', 'contact']] | [-0.26919365090456, 0.209204940610718, -0.06974435207266459, 0.0817386336199922, -0.04053140727054111, -0.2566148344077485, 0.11539309527035113, 0.3420211135375279, -0.2138409956294314, -0.2414465297269758, -0.042340409465838794, -0.3089989080911788, -0.12077458705149453, 0.18991520752386243, 0.05321058891599668, 0.03782786383594155, -0.021693672285114648, -0.01148877988160445, -0.11102595085662509, -0.16011128443657918, 0.3326464874716722, -0.0442055512440487, 0.3799399583792639, 0.09572303580353037, 0.015325510211624009, -0.02163269166051159, 0.16953412220670433, 0.04697960422734025, -0.14296732713117588, -0.00226439405097158, 0.26802149262875513, -0.13925974716976897, 0.14825464470716065, -0.4873850788359368, -0.2309484634210883, 0.023985579814983622, 0.19639127824711736, 0.1652665401922253, -0.015520509816327369, -0.3236911603392511, 0.04412481248891227, -0.19994729950225779, -0.07859851654904473, -0.04230423004331964, -0.009180763271167904, -0.03304082112572841, -0.22627605624477226, 0.049636696991030245, 0.05978690917115836, 0.06118498053204603, 0.023547992350705454, -0.05653794602892564, -0.03435621763180409, 0.0051157624498022, -0.021249096381118295, 0.03777691985914119, 0.15086783247272406, -0.16060426458562405, -0.1243867786236541, 0.2806240421637927, -0.10355248003668353, -0.13556905160596466, 0.1315990270733853, -0.12619938849928547, -0.050290830497427906, 0.08212059364708328, 0.07201497451397319, 0.0727458159154695, -0.13686593002727485, 0.11987585637620041, -0.048520384750590125, 0.16626609129604525, 0.016132904326286977, 0.08021515065547886, 0.274184224107081, 0.23582875642743178, 0.0967836735385751, 0.19211023940924044, -0.14976039845015973, -0.0955329150572498, -0.3016221762669307, -0.16643507209148814, -0.22782726022143843, 0.06621332929060651, -0.022272016148211646, -0.21882848233700897, 0.4095192771631653, 0.13787373801661157, 0.18881388882756547, -0.023128119374935825, 0.28019568768561515, 0.1638631630416654, 0.04443820594519219, 0.03213042370906031, 0.21771933533412666, 0.18285704236083403, 0.09794209519969102, -0.3298019332442896, 0.04366923372197167, 0.02834892793184038] |
1,801.10344 | Enhanced axion-photon coupling in GUT with hidden photon | We show that the axion coupling to photons can be enhanced in simple models
with a single Peccei-Quinn field, if the gauge coupling unification is realized
by a large kinetic mixing $\chi = {\cal O}(0.1)$ between hypercharge and
unbroken hidden U(1)$_H$. The key observation is that the U(1)$_H$ gauge
coupling should be rather strong to induce such large kinetic mixing, leading
to enhanced contributions of hidden matter fields to the electromagnetic
anomaly. We find that the axion-photon coupling is enhanced by about a factor
of 10-100 with respect to the GUT-axion models with $E/N = 8/3$.
| hep-ph astro-ph.CO hep-ex | we show that the axion coupling to photons can be enhanced in simple models with a single pecceiquinn field if the gauge coupling unification is realized by a large kinetic mixing chi cal o01 between hypercharge and unbroken hidden u1_h the key observation is that the u1_h gauge coupling should be rather strong to induce such large kinetic mixing leading to enhanced contributions of hidden matter fields to the electromagnetic anomaly we find that the axionphoton coupling is enhanced by about a factor of 10100 with respect to the gutaxion models with en 83 | [['we', 'show', 'that', 'the', 'axion', 'coupling', 'to', 'photons', 'can', 'be', 'enhanced', 'in', 'simple', 'models', 'with', 'a', 'single', 'pecceiquinn', 'field', 'if', 'the', 'gauge', 'coupling', 'unification', 'is', 'realized', 'by', 'a', 'large', 'kinetic', 'mixing', 'chi', 'cal', 'o01', 'between', 'hypercharge', 'and', 'unbroken', 'hidden', 'u1_h', 'the', 'key', 'observation', 'is', 'that', 'the', 'u1_h', 'gauge', 'coupling', 'should', 'be', 'rather', 'strong', 'to', 'induce', 'such', 'large', 'kinetic', 'mixing', 'leading', 'to', 'enhanced', 'contributions', 'of', 'hidden', 'matter', 'fields', 'to', 'the', 'electromagnetic', 'anomaly', 'we', 'find', 'that', 'the', 'axionphoton', 'coupling', 'is', 'enhanced', 'by', 'about', 'a', 'factor', 'of', '10100', 'with', 'respect', 'to', 'the', 'gutaxion', 'models', 'with', 'en', '83']] | [-0.19161369297553293, 0.3137376472373964, -0.017374549521088238, 0.09688245332724746, -0.1316463962017048, -0.15658382451041572, 0.01640846547470378, 0.34978320353454156, -0.2586375666602004, -0.3752494640028735, 0.027262376474907563, -0.2213462416923815, -0.07846759283734907, 0.08607737563790814, 0.03703644328440229, -0.06354893831115577, -0.033474170597850954, 0.026432402492050203, -0.042581976824490136, -0.18663683091290295, 0.27314970775611286, 0.056863284952092356, 0.23271705917212912, 0.08696551136271928, 0.11377533573797473, -0.0770281527481813, 0.05510774399504386, -0.03340099649804254, -0.05210825278020341, 0.08706449631160947, 0.16048381262640682, 0.009613180529296158, 0.15624977839529836, -0.3845511836009801, -0.20033714614848616, 0.15811843050753957, 0.13997528066117598, 0.105334168855196, -0.057015179756588194, -0.31592735885492257, 0.0908883961959071, -0.1940770014840108, -0.0718115452747111, -0.09610617664512447, -0.05363239182074184, -0.09168250044627536, -0.38834820189062624, 0.07805978593426527, -0.019277571483955827, -0.005748769258379295, 0.03320611765988732, -0.05449633160856382, -0.07921147234337304, 0.016933941287339053, 0.18746504115731885, 0.08317573295946243, 0.16195944056756073, -0.23847134857969257, -0.10499027649801905, 0.4054308754281812, -0.1964570916137628, -0.17481099176771378, 0.1664289284562592, -0.13401582646834595, -0.16358275020555144, 0.15972030603437012, 0.1404116473070556, 0.06072399905014042, -0.10575386925890881, 0.15556536406536475, -0.036593913991925534, 0.2143620135643149, 0.009411157844888588, 0.04934260841479064, 0.26419809214290113, 0.14973215083841995, 0.03869681365747926, 0.06358643600426775, -0.033822015638873784, -0.08771833140022492, -0.3764984922108265, -0.12347736143098983, -0.1136508450532953, 0.12368815524678212, -0.13085544043344505, -0.08626123911310588, 0.3517776164576732, 0.18053326937520214, 0.2231599876597043, -0.004598741184279162, 0.22419529446270517, 0.1469564555157777, 0.16719197542331513, 0.03200323509693306, 0.35336465122158167, 0.1801226829974762, 0.025094784035157133, -0.2684269366956126, -0.04314489478010043, 0.034019806983089575] |
1,801.10345 | Band tail interface states and quantum capacitance in a monolayer
molybdenum disulfide field-effect-transistor | Although MoS2 field-effect transistors (FETs) with high-k dielectrics are
promising for electron device applications, the underlying physical origin of
interface degradation remains largely unexplored. Here, we present a systematic
analysis of the energy distribution of the interface state density (Dit) and
the quantum capacitance (CQ) in a dual-gate monolayer exfoliated MoS2 FET. The
CQ analysis enabled us to construct a Dit extraction method as a function of
EF. A band tail distribution of Dit with the lowest value of 8*1011 cm-2eV-1
suggests that Dit is not directly related to the sharp peak energy distribution
of the S vacancy. Therefore, the Mo-S bond bending related to the strain at the
interface or the surface roughness of the SiO2/Si substrate might be the
origin. It is also shown that ultra-thin 2D materials are more sensitive to
interface disorder due to the reduced density of states. Since all the
constituents for the measured capacitance are well understood, I-V
characteristics can be reproduced by utilizing the drift current model. As a
result, one of the physical origins of the metal/insulator transition is
suggested to be the external outcome of interface traps and quantum
capacitance.
| cond-mat.mtrl-sci | although mos2 fieldeffect transistors fets with highk dielectrics are promising for electron device applications the underlying physical origin of interface degradation remains largely unexplored here we present a systematic analysis of the energy distribution of the interface state density dit and the quantum capacitance cq in a dualgate monolayer exfoliated mos2 fet the cq analysis enabled us to construct a dit extraction method as a function of ef a band tail distribution of dit with the lowest value of 81011 cm2ev1 suggests that dit is not directly related to the sharp peak energy distribution of the s vacancy therefore the mos bond bending related to the strain at the interface or the surface roughness of the sio2si substrate might be the origin it is also shown that ultrathin 2d materials are more sensitive to interface disorder due to the reduced density of states since all the constituents for the measured capacitance are well understood iv characteristics can be reproduced by utilizing the drift current model as a result one of the physical origins of the metalinsulator transition is suggested to be the external outcome of interface traps and quantum capacitance | [['although', 'mos2', 'fieldeffect', 'transistors', 'fets', 'with', 'highk', 'dielectrics', 'are', 'promising', 'for', 'electron', 'device', 'applications', 'the', 'underlying', 'physical', 'origin', 'of', 'interface', 'degradation', 'remains', 'largely', 'unexplored', 'here', 'we', 'present', 'a', 'systematic', 'analysis', 'of', 'the', 'energy', 'distribution', 'of', 'the', 'interface', 'state', 'density', 'dit', 'and', 'the', 'quantum', 'capacitance', 'cq', 'in', 'a', 'dualgate', 'monolayer', 'exfoliated', 'mos2', 'fet', 'the', 'cq', 'analysis', 'enabled', 'us', 'to', 'construct', 'a', 'dit', 'extraction', 'method', 'as', 'a', 'function', 'of', 'ef', 'a', 'band', 'tail', 'distribution', 'of', 'dit', 'with', 'the', 'lowest', 'value', 'of', '81011', 'cm2ev1', 'suggests', 'that', 'dit', 'is', 'not', 'directly', 'related', 'to', 'the', 'sharp', 'peak', 'energy', 'distribution', 'of', 'the', 's', 'vacancy', 'therefore', 'the', 'mos', 'bond', 'bending', 'related', 'to', 'the', 'strain', 'at', 'the', 'interface', 'or', 'the', 'surface', 'roughness', 'of', 'the', 'sio2si', 'substrate', 'might', 'be', 'the', 'origin', 'it', 'is', 'also', 'shown', 'that', 'ultrathin', '2d', 'materials', 'are', 'more', 'sensitive', 'to', 'interface', 'disorder', 'due', 'to', 'the', 'reduced', 'density', 'of', 'states', 'since', 'all', 'the', 'constituents', 'for', 'the', 'measured', 'capacitance', 'are', 'well', 'understood', 'iv', 'characteristics', 'can', 'be', 'reproduced', 'by', 'utilizing', 'the', 'drift', 'current', 'model', 'as', 'a', 'result', 'one', 'of', 'the', 'physical', 'origins', 'of', 'the', 'metalinsulator', 'transition', 'is', 'suggested', 'to', 'be', 'the', 'external', 'outcome', 'of', 'interface', 'traps', 'and', 'quantum', 'capacitance']] | [-0.12433746175473913, 0.11486080588687439, -0.08153239085012057, 0.01960126265537915, -0.024880732758902013, -0.20014580053356576, 0.07546658677227319, 0.39677876129033085, -0.27979241648411496, -0.2985288752143846, 0.02135472149189383, -0.2750401592793617, -0.1485440986208677, 0.19944245737891872, -0.02092930692139062, 0.060255250918302444, -0.014267377258758953, -0.07350394333851465, -0.038689415503114936, -0.16442681081900176, 0.2671861769448832, 0.09031164275725036, 0.3328712609611412, 0.14371177457902146, 0.035070653353381824, -0.03005091881409208, 0.10580104506733094, 0.025533239691557876, -0.14396611482508423, 0.10699581484492383, 0.24936878033220133, -0.06159674613043032, 0.2193115190924839, -0.43724396964535117, -0.22974182226004058, -0.024798949119050374, 0.1073060882490802, 0.1370140568754497, -0.06825083931525637, -0.2593800942908893, 0.09403938245513734, -0.13334928360579418, -0.1209988979612814, -0.019702237200962893, 0.015107624894107117, 0.001690029267573412, -0.21282817617534322, 0.09454225884744913, 0.019881933780778398, 0.01631690350242276, -0.09123173444234628, -0.14421721791977496, -0.0923377296403874, 0.09714262088032519, 0.01648921666708973, 0.0476534611123188, 0.2580138561018604, -0.1329122062892024, -0.08401829736713479, 0.3566072803149198, -0.04435092506514109, -0.14039829416953503, 0.1731578155539613, -0.18475315272263151, -0.028491748677705354, 0.1588319155209242, 0.10517828844666005, 0.08744032964348158, -0.1598284929752984, 0.07914427868842935, 0.037677731207680906, 0.1906729585050229, 0.06166778189536343, 0.09400602235914544, 0.24073107797216545, 0.19669413917383397, 0.03815840186004433, 0.11595240022561097, -0.12268198887133931, -0.003711380610648701, -0.25280668266969636, -0.22667275448181132, -0.24804474921721192, 0.09885247544383326, -0.05585789071142728, -0.22908026077880578, 0.41706458032081656, 0.14400932324450819, 0.17226903740455338, -0.03911292454366513, 0.2627957445455398, 0.1441598157584172, 0.09633625525005281, 0.0066380385653749905, 0.24213336260142201, 0.16262076477559798, 0.10429508175621642, -0.2422649041338368, 0.14563025627285242, -0.029832039786344196] |
1,801.10346 | The k-PDTM : a coreset for robust geometric inference | Analyzing the sub-level sets of the distance to a compact sub-manifold of R d
is a common method in TDA to understand its topology. The distance to measure
(DTM) was introduced by Chazal, Cohen-Steiner and M{\'e}rigot in [7] to face
the non-robustness of the distance to a compact set to noise and outliers. This
function makes possible the inference of the topology of a compact subset of R
d from a noisy cloud of n points lying nearby in the Wasserstein sense. In
practice, these sub-level sets may be computed using approximations of the DTM
such as the q-witnessed distance [10] or other power distance [6]. These
approaches lead eventually to compute the homology of unions of n growing
balls, that might become intractable whenever n is large. To simultaneously
face the two problems of large number of points and noise, we introduce the
k-power distance to measure (k-PDTM). This new approximation of the distance to
measure may be thought of as a k-coreset based approximation of the DTM. Its
sublevel sets consist in union of k-balls, k << n, and this distance is also
proved robust to noise. We assess the quality of this approximation for k
possibly dramatically smaller than n, for instance k = n 1 3 is proved to be
optimal for 2-dimensional shapes. We also provide an algorithm to compute this
k-PDTM.
| math.ST cs.CG stat.TH | analyzing the sublevel sets of the distance to a compact submanifold of r d is a common method in tda to understand its topology the distance to measure dtm was introduced by chazal cohensteiner and merigot in 7 to face the nonrobustness of the distance to a compact set to noise and outliers this function makes possible the inference of the topology of a compact subset of r d from a noisy cloud of n points lying nearby in the wasserstein sense in practice these sublevel sets may be computed using approximations of the dtm such as the qwitnessed distance 10 or other power distance 6 these approaches lead eventually to compute the homology of unions of n growing balls that might become intractable whenever n is large to simultaneously face the two problems of large number of points and noise we introduce the kpower distance to measure kpdtm this new approximation of the distance to measure may be thought of as a kcoreset based approximation of the dtm its sublevel sets consist in union of kballs k n and this distance is also proved robust to noise we assess the quality of this approximation for k possibly dramatically smaller than n for instance k n 1 3 is proved to be optimal for 2dimensional shapes we also provide an algorithm to compute this kpdtm | [['analyzing', 'the', 'sublevel', 'sets', 'of', 'the', 'distance', 'to', 'a', 'compact', 'submanifold', 'of', 'r', 'd', 'is', 'a', 'common', 'method', 'in', 'tda', 'to', 'understand', 'its', 'topology', 'the', 'distance', 'to', 'measure', 'dtm', 'was', 'introduced', 'by', 'chazal', 'cohensteiner', 'and', 'merigot', 'in', '7', 'to', 'face', 'the', 'nonrobustness', 'of', 'the', 'distance', 'to', 'a', 'compact', 'set', 'to', 'noise', 'and', 'outliers', 'this', 'function', 'makes', 'possible', 'the', 'inference', 'of', 'the', 'topology', 'of', 'a', 'compact', 'subset', 'of', 'r', 'd', 'from', 'a', 'noisy', 'cloud', 'of', 'n', 'points', 'lying', 'nearby', 'in', 'the', 'wasserstein', 'sense', 'in', 'practice', 'these', 'sublevel', 'sets', 'may', 'be', 'computed', 'using', 'approximations', 'of', 'the', 'dtm', 'such', 'as', 'the', 'qwitnessed', 'distance', '10', 'or', 'other', 'power', 'distance', '6', 'these', 'approaches', 'lead', 'eventually', 'to', 'compute', 'the', 'homology', 'of', 'unions', 'of', 'n', 'growing', 'balls', 'that', 'might', 'become', 'intractable', 'whenever', 'n', 'is', 'large', 'to', 'simultaneously', 'face', 'the', 'two', 'problems', 'of', 'large', 'number', 'of', 'points', 'and', 'noise', 'we', 'introduce', 'the', 'kpower', 'distance', 'to', 'measure', 'kpdtm', 'this', 'new', 'approximation', 'of', 'the', 'distance', 'to', 'measure', 'may', 'be', 'thought', 'of', 'as', 'a', 'kcoreset', 'based', 'approximation', 'of', 'the', 'dtm', 'its', 'sublevel', 'sets', 'consist', 'in', 'union', 'of', 'kballs', 'k', 'n', 'and', 'this', 'distance', 'is', 'also', 'proved', 'robust', 'to', 'noise', 'we', 'assess', 'the', 'quality', 'of', 'this', 'approximation', 'for', 'k', 'possibly', 'dramatically', 'smaller', 'than', 'n', 'for', 'instance', 'k', 'n', '1', '3', 'is', 'proved', 'to', 'be', 'optimal', 'for', '2dimensional', 'shapes', 'we', 'also', 'provide', 'an', 'algorithm', 'to', 'compute', 'this', 'kpdtm']] | [-0.14478045819560065, 0.06438002854602845, -0.08063175403936343, 0.0891943451329346, -0.0360752308296717, -0.11271220575171438, 0.07026700523512608, 0.3444657848437518, -0.3207680709025061, -0.29786910171969794, 0.08933731167608956, -0.27269797790954314, -0.10642726858971979, 0.18201260942045006, -0.10293084512099582, 0.04112030073989775, 0.03612823694552803, 0.0600129349507783, -0.050478802895734344, -0.2776531275478192, 0.32721784112129004, 0.025235647009685634, 0.20848552061414177, 0.022662006731314414, 0.06298398888796906, -0.042926917695017025, -0.023786509811708875, 0.06667344225147231, -0.12178907028140781, 0.1660499720733655, 0.2705595675210299, 0.16834946873555467, 0.2838347258638929, -0.36296978547576475, -0.15349042866132964, 0.1545035668439761, 0.12803229637105357, 0.0579028598995964, 0.0473693991032302, -0.263314581588334, 0.14984217886389656, -0.1094338522513598, -0.15501175705999645, -0.06348706184124404, 0.10130651691843841, 0.016968718873844907, -0.28713108659510245, 0.014758853327260691, 0.05381938718174669, 0.03657539222939787, -0.009574970635267991, -0.14108291554307056, 0.014136640818535605, 0.11987274199491367, 0.006288109378973869, 0.10445249944036318, 0.07619103033688258, -0.06147659899645739, -0.08313834339814176, 0.3595635934171944, -0.04725950531250088, -0.2038993518175134, 0.20666225055888804, -0.1482914605283771, -0.10091333462835543, 0.13231770075561308, 0.19373660861429842, 0.13346347569022327, -0.12336137804880061, 0.10501070442418992, -0.02023997443982146, 0.1426683496990749, 0.08929424632171339, 0.03925197605488145, 0.13598565444911154, 0.14150455044003718, 0.13178001331080766, 0.14105888982210837, -0.1258453045442531, -0.03443764027350963, -0.2607471116437492, -0.149795939123512, -0.23089941822585058, 0.08238483685894277, -0.12442299352551345, -0.2130834006670656, 0.3238095099402761, 0.12428352953548628, 0.2636347019875592, 0.07716588529874571, 0.28510360381756483, 0.07479690365785659, 0.0543242371191313, 0.10526193021002903, 0.17712182029446757, 0.12111965035569897, 0.0037142455546100707, -0.16761532517425207, 0.046719340887979015, 0.08550505750092932] |
1,801.10347 | Star Mean Curvature Flow on 3 manifolds and its B\"acklund
Transformations | The Hodge star mean curvature flow on a 3-dimensional Riemannian or
pseudo-Riemannian manifold is a natural nonlinear dispersive curve flow in
geometric analysis. A curve flow is integrable if the local differential
invariants of a solution to the curve flow evolve according to a soliton
equation. In this paper, we show that this flow on $\mathbb{S}^3$ and
$\mathbb{H}^3$ are integrable, and describe algebraically explicit solutions to
such curve flows. The Cauchy problem of the curve flows on $\mathbb{S}^3$ and
$\mathbb{H}^3$ and its B\"acklund transformations follow from this
construction.
| math.DG math.AP nlin.SI | the hodge star mean curvature flow on a 3dimensional riemannian or pseudoriemannian manifold is a natural nonlinear dispersive curve flow in geometric analysis a curve flow is integrable if the local differential invariants of a solution to the curve flow evolve according to a soliton equation in this paper we show that this flow on mathbbs3 and mathbbh3 are integrable and describe algebraically explicit solutions to such curve flows the cauchy problem of the curve flows on mathbbs3 and mathbbh3 and its backlund transformations follow from this construction | [['the', 'hodge', 'star', 'mean', 'curvature', 'flow', 'on', 'a', '3dimensional', 'riemannian', 'or', 'pseudoriemannian', 'manifold', 'is', 'a', 'natural', 'nonlinear', 'dispersive', 'curve', 'flow', 'in', 'geometric', 'analysis', 'a', 'curve', 'flow', 'is', 'integrable', 'if', 'the', 'local', 'differential', 'invariants', 'of', 'a', 'solution', 'to', 'the', 'curve', 'flow', 'evolve', 'according', 'to', 'a', 'soliton', 'equation', 'in', 'this', 'paper', 'we', 'show', 'that', 'this', 'flow', 'on', 'mathbbs3', 'and', 'mathbbh3', 'are', 'integrable', 'and', 'describe', 'algebraically', 'explicit', 'solutions', 'to', 'such', 'curve', 'flows', 'the', 'cauchy', 'problem', 'of', 'the', 'curve', 'flows', 'on', 'mathbbs3', 'and', 'mathbbh3', 'and', 'its', 'backlund', 'transformations', 'follow', 'from', 'this', 'construction']] | [-0.21412324326493862, 0.03328058404043655, -0.18141845394645564, 0.07989560183142946, -0.16148441174829548, -0.14553678200834178, -0.0874671069045276, 0.35934482104229654, -0.3351072870745239, -0.17872105874002128, 0.16075740359056825, -0.31315847811162134, -0.1992486004045614, 0.20361181174203838, -0.15419840772996063, 0.0731133125631128, 0.08916464692447335, 0.0697143668605184, -0.10562297400478697, -0.2469251635960642, 0.40737429642203177, -0.09553770126182247, 0.24323565838064745, 0.03215523364170539, 0.17419652414338832, -0.04405850496418266, 0.01195268117589876, 0.008512092703230419, -0.23391648806376575, 0.09429731092346959, 0.22861355626479385, 0.05500989124200053, 0.10630135003223339, -0.3869582260112194, -0.26473433222451026, 0.142782039929774, 0.14898643899306824, 0.0592937383599664, -0.019185117611248807, -0.26210432331374084, 0.052750235894398596, -0.06670058044520291, -0.1889723927227103, -0.06067806031999432, 0.03944846651178192, 0.027033310870385983, -0.16010980150366033, 0.08570821325040677, 0.11546566119332882, 0.11018350414550779, -0.11022276638356164, 0.037254153507423, -0.08784961367068304, 0.03346315666302954, 0.051206020384349606, 0.08500782709928568, 0.0981136081285182, -0.09292191137369214, -0.027013365962457927, 0.4118204179262234, -0.11519259313883429, -0.2945905796236316, 0.08568504220933061, -0.11034610020843419, -0.09208923201500015, 0.15377531054069882, 0.2174215019542978, 0.17899034462805669, -0.10329524953637949, 0.10444258061100052, -0.08318472693314437, 0.09493547195399349, 0.06971561832787385, -0.11030379044082524, 0.19086967436173422, 0.08849951161325655, 0.14627681171987206, 0.11279432714747434, 0.00036240847178057515, -0.14231729865158824, -0.35922664624046197, -0.2236700512138751, -0.09392111279356125, 0.19280177984910551, -0.15114527090852128, -0.18498715564650905, 0.4280897421254353, -0.029035797279158778, 0.19373360487688016, 0.09905921493455852, 0.25416671233886684, 0.10285489336291159, -0.003386786445678974, 0.16176516691815446, 0.178990091125756, 0.1954152935835406, 0.11101063387997617, -0.22674098618021657, -0.08243817431767556, 0.18447269349020312] |
1,801.10348 | Numerical analytic continuation of Euclidean data | In this work we present a direct comparison of three different numerical
analytic continuation methods: the Maximum Entropy Method, the Backus-Gilbert
method and the Schlessinger point or Resonances Via Pad\'{e} method. First, we
perform a benchmark test based on a model spectral function and study the
regime of applicability of these methods depending on the number of input
points and their statistical error. We then apply these methods to more
realistic examples, namely to numerical data on Euclidean propagators obtained
from a Functional Renormalization Group calculation, to data from a lattice
Quantum Chromodynamics simulation and to data obtained from a tight-binding
model for graphene in order to extract the electrical conductivity.
| hep-ph hep-lat hep-th | in this work we present a direct comparison of three different numerical analytic continuation methods the maximum entropy method the backusgilbert method and the schlessinger point or resonances via pade method first we perform a benchmark test based on a model spectral function and study the regime of applicability of these methods depending on the number of input points and their statistical error we then apply these methods to more realistic examples namely to numerical data on euclidean propagators obtained from a functional renormalization group calculation to data from a lattice quantum chromodynamics simulation and to data obtained from a tightbinding model for graphene in order to extract the electrical conductivity | [['in', 'this', 'work', 'we', 'present', 'a', 'direct', 'comparison', 'of', 'three', 'different', 'numerical', 'analytic', 'continuation', 'methods', 'the', 'maximum', 'entropy', 'method', 'the', 'backusgilbert', 'method', 'and', 'the', 'schlessinger', 'point', 'or', 'resonances', 'via', 'pade', 'method', 'first', 'we', 'perform', 'a', 'benchmark', 'test', 'based', 'on', 'a', 'model', 'spectral', 'function', 'and', 'study', 'the', 'regime', 'of', 'applicability', 'of', 'these', 'methods', 'depending', 'on', 'the', 'number', 'of', 'input', 'points', 'and', 'their', 'statistical', 'error', 'we', 'then', 'apply', 'these', 'methods', 'to', 'more', 'realistic', 'examples', 'namely', 'to', 'numerical', 'data', 'on', 'euclidean', 'propagators', 'obtained', 'from', 'a', 'functional', 'renormalization', 'group', 'calculation', 'to', 'data', 'from', 'a', 'lattice', 'quantum', 'chromodynamics', 'simulation', 'and', 'to', 'data', 'obtained', 'from', 'a', 'tightbinding', 'model', 'for', 'graphene', 'in', 'order', 'to', 'extract', 'the', 'electrical', 'conductivity']] | [-0.053523205425212717, -0.015597536866259467, -0.14519540524856933, 0.06171565178072768, -0.05289609523842464, -0.10856053734047187, 0.1280181129119015, 0.37937810072289396, -0.2293729441416626, -0.2908700201786249, 0.09311411577813865, -0.30761724323671946, -0.1630379830986295, 0.2490587815336111, 0.016150006613283006, 0.13297233986458531, 0.09005975938897144, 0.0054840880890821555, -0.12458864370830827, -0.21577921660768018, 0.3258918828272202, 0.016663881374296505, 0.28060652700731076, 0.054719548265508434, 0.06126579466414311, -0.005022287013760122, -0.041067551127173474, 0.0268687916718222, -0.17827522432691678, 0.145677372590882, 0.21172116126294607, 0.06386556746626927, 0.2454165132372296, -0.42383801186172004, -0.22056360791126886, 0.05366368720156921, 0.11542302182443473, 0.1571782527508231, -0.04378304949939054, -0.27984591894825034, 0.08579593908717134, -0.1693174821567965, -0.07813396724360483, -0.15079395787639394, -0.06550696918841552, -0.002277697203680873, -0.30127053304264945, 0.08169961502819599, -0.03588477478505255, 0.08335842750966549, -0.05342320138001227, -0.1341414093249687, 0.004885117288443957, 0.10485356436782256, 0.0475041662261041, 0.012655411182004993, 0.1093892247902716, -0.09160101184462038, -0.13611937773640495, 0.38519571213102016, -0.06412805028381413, -0.21838336237412584, 0.19410993500511992, -0.1284268623603894, -0.12258565106202622, 0.09415183198084501, 0.20886789512535273, 0.15938723955811043, -0.1471029064819418, 0.0644697691502704, -0.019654827905600674, 0.15116341803186187, 0.010904804895724263, -0.025808808804900798, 0.12461482452203494, 0.1646672041272862, 0.003049347423822493, 0.13212520064500807, -0.09695289221063659, -0.09613390433023104, -0.31860947290116604, -0.11632614568513525, -0.24408535108070922, 0.03597779984812479, -0.11957003096320985, -0.18203805831705663, 0.4363712055088432, 0.22399447711083936, 0.1939786812710064, 0.06815225894453826, 0.33705023911085213, 0.10512931418378611, 0.028572070804583998, 0.03739136574907346, 0.19026496833576276, 0.1341666225784433, 0.06341144567573662, -0.22613054280890874, -0.06189529618525223, 0.12850831230674442] |
1,801.10349 | QRMW: Quantum representation of multi wavelength images | In this study, we propose quantum representation of multi wavelength images
(QRMW) which gives preparation and retrieving procedures of quantum images.
Proposed QRMW model represents multi-channel and 2^n x 2^m images. Also, we
present image comparison and some image operations based on QRMW model.
Comparing our model with the models in literature, QRMW model has less time
complexity. Also QRMW model uses fewer qubits than existing models in the
literature.
| quant-ph cs.IT math.IT | in this study we propose quantum representation of multi wavelength images qrmw which gives preparation and retrieving procedures of quantum images proposed qrmw model represents multichannel and 2n x 2m images also we present image comparison and some image operations based on qrmw model comparing our model with the models in literature qrmw model has less time complexity also qrmw model uses fewer qubits than existing models in the literature | [['in', 'this', 'study', 'we', 'propose', 'quantum', 'representation', 'of', 'multi', 'wavelength', 'images', 'qrmw', 'which', 'gives', 'preparation', 'and', 'retrieving', 'procedures', 'of', 'quantum', 'images', 'proposed', 'qrmw', 'model', 'represents', 'multichannel', 'and', '2n', 'x', '2m', 'images', 'also', 'we', 'present', 'image', 'comparison', 'and', 'some', 'image', 'operations', 'based', 'on', 'qrmw', 'model', 'comparing', 'our', 'model', 'with', 'the', 'models', 'in', 'literature', 'qrmw', 'model', 'has', 'less', 'time', 'complexity', 'also', 'qrmw', 'model', 'uses', 'fewer', 'qubits', 'than', 'existing', 'models', 'in', 'the', 'literature']] | [-0.06259459053232734, 0.008335263015968458, -0.0756784205657563, 0.04290299127377303, -0.014057610077517373, -0.2300236351788044, 0.021156433766840826, 0.4317846313118935, -0.1637333805406732, -0.3561997335404158, 0.07390304468738447, -0.28120524772842015, -0.1519601598115904, 0.21003521788266621, -0.10511716092005371, 0.07566801913614785, 0.09281058872916868, 0.014889299656663623, -0.0790812371830855, -0.2812907331490091, 0.25141281804868154, 0.051521169231273235, 0.30216792168627893, -0.07810160809063486, 0.10037224473032569, 0.026520815961495307, -0.05941733642082129, -0.059725325355040174, -0.1036456168363137, 0.13891153392781105, 0.22985863204448834, 0.17529773022314268, 0.21423996149429253, -0.43970185153718505, -0.24344624719815328, 0.09741091074288956, 0.1282587773299643, 0.1422577724043679, -0.02912483270712463, -0.29481338775783245, 0.04038002214323829, -0.1389600556875978, 0.014533674677035638, -0.07999887467761124, -0.007050887430419347, -0.0781683971340369, -0.24022982384943004, 0.06586795631862645, 0.03309948134369084, 0.07334774221692766, -0.07187784993355828, -0.13849447844550014, 0.05041476346086711, 0.09643920483067632, -0.04808230057658095, 0.055502707376477445, 0.0594388390957777, -0.14028034567101194, -0.16084442592359016, 0.3659323245819126, -0.030419184265234173, -0.1960365748440381, 0.18619630071001925, -0.09333378623372741, -0.1253249231459839, 0.08321320635399648, 0.1460766540840268, 0.14020450535629478, -0.1296732726373843, 0.0878381286623023, -0.0945662738289684, 0.2519402423075267, 0.02140279458835721, 0.06728461074775884, 0.09600449515772717, 0.22876955659261772, -0.021107454983783618, 0.19022330943761126, -0.1587045965283843, -0.09341810998905982, -0.26046245023608205, -0.12950703342046058, -0.16346155562704162, -0.005166134078587805, -0.10290235723306458, -0.13333684579203173, 0.415602729256664, 0.2616264258394949, 0.1925825190597347, 0.08396243544993923, 0.363974215356367, 0.049916788824235225, 0.09133373803592154, 0.036480128113180396, 0.12745082608099828, 0.07180820305033454, 0.08821438735550535, -0.13155561116124903, 0.04133592135871628, 0.09902570871636271] |
1,801.1035 | Tribaryon configurations and the inevitable three nucleon repulsions at
short distance | We decompose the tribaryon configuration in terms of SU(3) flavor and spin
state and analyse their color-spin-flavor wave function following Pauli
principle. By comparing the color-color and color-spin interactions of compact
tribaryon configuration against the lowest three nucleon threshold within a
constituent quark model, we show that the three nucleon forces have to be
repulsive at short distance for all possible quantum numbers and all values of
the SU(3) symmetry breaking parameter. Our work identifies the origin of the
repulsive nuclear three body forces including the hyperons at short distance
that are called for from phenomenological considerations starting from nuclear
matter to the maximum mass of a neutron star.
| hep-ph nucl-th | we decompose the tribaryon configuration in terms of su3 flavor and spin state and analyse their colorspinflavor wave function following pauli principle by comparing the colorcolor and colorspin interactions of compact tribaryon configuration against the lowest three nucleon threshold within a constituent quark model we show that the three nucleon forces have to be repulsive at short distance for all possible quantum numbers and all values of the su3 symmetry breaking parameter our work identifies the origin of the repulsive nuclear three body forces including the hyperons at short distance that are called for from phenomenological considerations starting from nuclear matter to the maximum mass of a neutron star | [['we', 'decompose', 'the', 'tribaryon', 'configuration', 'in', 'terms', 'of', 'su3', 'flavor', 'and', 'spin', 'state', 'and', 'analyse', 'their', 'colorspinflavor', 'wave', 'function', 'following', 'pauli', 'principle', 'by', 'comparing', 'the', 'colorcolor', 'and', 'colorspin', 'interactions', 'of', 'compact', 'tribaryon', 'configuration', 'against', 'the', 'lowest', 'three', 'nucleon', 'threshold', 'within', 'a', 'constituent', 'quark', 'model', 'we', 'show', 'that', 'the', 'three', 'nucleon', 'forces', 'have', 'to', 'be', 'repulsive', 'at', 'short', 'distance', 'for', 'all', 'possible', 'quantum', 'numbers', 'and', 'all', 'values', 'of', 'the', 'su3', 'symmetry', 'breaking', 'parameter', 'our', 'work', 'identifies', 'the', 'origin', 'of', 'the', 'repulsive', 'nuclear', 'three', 'body', 'forces', 'including', 'the', 'hyperons', 'at', 'short', 'distance', 'that', 'are', 'called', 'for', 'from', 'phenomenological', 'considerations', 'starting', 'from', 'nuclear', 'matter', 'to', 'the', 'maximum', 'mass', 'of', 'a', 'neutron', 'star']] | [-0.110236753606134, 0.23481661823785138, -0.08664747986660115, 0.11425982113427448, -0.05433402188053286, -0.07497859917822536, 0.060794514836743474, 0.3527959496886642, -0.19157871366392268, -0.27096799777441277, 0.00436732049113036, -0.2956691382418352, -0.04047501913306338, 0.11910231093901934, 0.08807362827118831, 0.0182884750593749, 0.017094823389521077, 0.05301740761691084, -0.0974398515574177, -0.18311000576984413, 0.3843587073583708, -0.03166213556283361, 0.195967913092183, 0.11092648545228359, 0.08480561133991513, 0.03717297828256118, 0.02175259338778064, -0.019303780760512583, -0.11133521884591945, 0.04520888767136192, 0.19650557269590166, 0.0680047869950992, 0.15378450447072586, -0.40996173993442897, -0.1876370234445117, 0.10101697807355474, 0.09090147247749243, 0.1505071443885013, -0.021983134264937015, -0.2958906954930474, 0.07052761576724825, -0.2510150517854426, -0.1690474737013035, -0.0842900604389056, 0.04191491965428685, 0.03970223535887069, -0.23451805551087967, 0.09854622450398488, 0.025474236922390345, 0.014774784713086707, -0.09855665179202333, -0.19992702447429853, -0.04423589781961507, 0.09522355409097616, 0.07598205160724723, 0.07883915641017396, 0.14958305945469033, -0.17202843337630233, -0.10764177712284166, 0.42171536368766316, -0.0027516082670815565, -0.15890642302164687, 0.15510661427052347, -0.14487938891182206, -0.14184351396074313, 0.09885784175626382, 0.1590673932956566, 0.07736009136661542, -0.18304187190908663, 0.05335266970063525, -0.01759738284494637, 0.15583967186803757, 0.08380578690115793, 0.06358353911033461, 0.2576500782182578, 0.15734150772483121, 0.013103250036861195, 0.09026669474055611, -0.1257569000569371, -0.1396681897744269, -0.3420205413907145, -0.06269065317421875, -0.18937993888027482, 0.03596473367670788, -0.1156945085509775, -0.07978657803808649, 0.40633911898152697, 0.09617680409078107, 0.18892682936146027, 0.03286206818841122, 0.2552633778994075, 0.047460003586753306, 0.07562206361951583, 0.04744846317313473, 0.3079635918450852, 0.1801232626722022, 0.016293621225351537, -0.30274187247010154, -0.014061132286399327, 0.09093182897022753] |
1,801.10351 | Fast and Accurate Reconstruction of Compressed Color Light Field | Light field photography has been studied thoroughly in recent years. One of
its drawbacks is the need for multi-lens in the imaging. To compensate that,
compressed light field photography has been proposed to tackle the trade-offs
between the spatial and angular resolutions. It obtains by only one lens, a
compressed version of the regular multi-lens system. The acquisition system
consists of a dedicated hardware followed by a decompression algorithm, which
usually suffers from high computational time. In this work, we propose a
computationally efficient neural network that recovers a high-quality color
light field from a single coded image. Unlike previous works, we compress the
color channels as well, removing the need for a CFA in the imaging system. Our
approach outperforms existing solutions in terms of recovery quality and
computational complexity. We propose also a neural network for depth map
extraction based on the decompressed light field, which is trained in an
unsupervised manner without the ground truth depth map.
| cs.CV | light field photography has been studied thoroughly in recent years one of its drawbacks is the need for multilens in the imaging to compensate that compressed light field photography has been proposed to tackle the tradeoffs between the spatial and angular resolutions it obtains by only one lens a compressed version of the regular multilens system the acquisition system consists of a dedicated hardware followed by a decompression algorithm which usually suffers from high computational time in this work we propose a computationally efficient neural network that recovers a highquality color light field from a single coded image unlike previous works we compress the color channels as well removing the need for a cfa in the imaging system our approach outperforms existing solutions in terms of recovery quality and computational complexity we propose also a neural network for depth map extraction based on the decompressed light field which is trained in an unsupervised manner without the ground truth depth map | [['light', 'field', 'photography', 'has', 'been', 'studied', 'thoroughly', 'in', 'recent', 'years', 'one', 'of', 'its', 'drawbacks', 'is', 'the', 'need', 'for', 'multilens', 'in', 'the', 'imaging', 'to', 'compensate', 'that', 'compressed', 'light', 'field', 'photography', 'has', 'been', 'proposed', 'to', 'tackle', 'the', 'tradeoffs', 'between', 'the', 'spatial', 'and', 'angular', 'resolutions', 'it', 'obtains', 'by', 'only', 'one', 'lens', 'a', 'compressed', 'version', 'of', 'the', 'regular', 'multilens', 'system', 'the', 'acquisition', 'system', 'consists', 'of', 'a', 'dedicated', 'hardware', 'followed', 'by', 'a', 'decompression', 'algorithm', 'which', 'usually', 'suffers', 'from', 'high', 'computational', 'time', 'in', 'this', 'work', 'we', 'propose', 'a', 'computationally', 'efficient', 'neural', 'network', 'that', 'recovers', 'a', 'highquality', 'color', 'light', 'field', 'from', 'a', 'single', 'coded', 'image', 'unlike', 'previous', 'works', 'we', 'compress', 'the', 'color', 'channels', 'as', 'well', 'removing', 'the', 'need', 'for', 'a', 'cfa', 'in', 'the', 'imaging', 'system', 'our', 'approach', 'outperforms', 'existing', 'solutions', 'in', 'terms', 'of', 'recovery', 'quality', 'and', 'computational', 'complexity', 'we', 'propose', 'also', 'a', 'neural', 'network', 'for', 'depth', 'map', 'extraction', 'based', 'on', 'the', 'decompressed', 'light', 'field', 'which', 'is', 'trained', 'in', 'an', 'unsupervised', 'manner', 'without', 'the', 'ground', 'truth', 'depth', 'map']] | [-0.08138267964241094, 0.021651859975190747, -0.09205532668565866, 0.014104822045919719, -0.08147544668172486, -0.16195803937443998, 0.020909191464306788, 0.43722178221214564, -0.2778778223640984, -0.3195962910656817, 0.11821785496285883, -0.24137259596027433, -0.1600278368394356, 0.19238462129142136, -0.1518153939396143, 0.09210393915564055, 0.10088775563272065, 0.030398555801366457, -0.08491826420940925, -0.2573360852744372, 0.2673784222221002, 0.0503659379464807, 0.3353099927029689, -0.010828151972964406, 0.1600331101246411, 0.029113752201374153, -0.029515386902676254, 0.020024284573446495, -0.0410018079249312, 0.14431551600282547, 0.2475592022179626, 0.18884282049475587, 0.276891109967255, -0.42908167546847836, -0.2777829606318846, 0.08602809929579962, 0.16867366215738003, 0.14992311477399198, -0.09589976867209771, -0.26885704138258004, 0.07574569685384631, -0.1375750070787035, -0.02863633707165718, -0.07919059379855753, -0.013237063970882446, -0.025373378748190588, -0.25586219729157167, 0.03469717647949437, 0.03315493363843416, 0.06583896463853307, -0.037101628940581576, -0.09042352528413175, 0.04475846808927599, 0.11907329717942047, 0.009177857439499348, 0.11705880614317721, 0.0887305324577028, -0.188557707205473, -0.10047105972189456, 0.36373884150525554, -0.057855775849020574, -0.18380990585428664, 0.1740596501273103, -0.05199781752307899, -0.11471509460243397, 0.17533054387313313, 0.1725135894113919, 0.10811403712723404, -0.16053955675743053, 0.0828198719471402, -0.039581992669263856, 0.22299725899647455, 0.08150822107563727, 0.03908269050916715, 0.16525532102059515, 0.24526538135833106, 0.04161195412016241, 0.17242634981521404, -0.17331295279291226, -0.036729598470265044, -0.19259508375544102, -0.12660324010212207, -0.2227177948676399, -0.016960195334104356, -0.057449270281176724, -0.11603252482454991, 0.42129460797295903, 0.1979601689556148, 0.18720643032575027, 0.05384775265265489, 0.4312957202317193, 0.05228417159232777, 0.1290942192543298, 0.07468301718981821, 0.22661043718107976, 0.060225218095865785, 0.17143416254839394, -0.16949809259240284, 0.04607081947397092, 0.0598131951293908] |
1,801.10352 | Entanglement entropy: holography and renormalization group | Entanglement entropy plays a variety of roles in quantum field theory,
including the connections between quantum states and gravitation through the
holographic principle. This article provides a review of entanglement entropy
from a mixed viewpoint of field theory and holography. A set of basic methods
for the computation is developed and illustrated with simple examples such as
free theories and conformal field theories. The structures of the ultraviolet
divergences and the universal parts are determined and compared with the
holographic descriptions of entanglement entropy. The utility of quantum
inequalities of entanglement are discussed and shown to derive the C-theorem
that constrains renormalization group flows of quantum field theories in
diverse dimensions.
| hep-th | entanglement entropy plays a variety of roles in quantum field theory including the connections between quantum states and gravitation through the holographic principle this article provides a review of entanglement entropy from a mixed viewpoint of field theory and holography a set of basic methods for the computation is developed and illustrated with simple examples such as free theories and conformal field theories the structures of the ultraviolet divergences and the universal parts are determined and compared with the holographic descriptions of entanglement entropy the utility of quantum inequalities of entanglement are discussed and shown to derive the ctheorem that constrains renormalization group flows of quantum field theories in diverse dimensions | [['entanglement', 'entropy', 'plays', 'a', 'variety', 'of', 'roles', 'in', 'quantum', 'field', 'theory', 'including', 'the', 'connections', 'between', 'quantum', 'states', 'and', 'gravitation', 'through', 'the', 'holographic', 'principle', 'this', 'article', 'provides', 'a', 'review', 'of', 'entanglement', 'entropy', 'from', 'a', 'mixed', 'viewpoint', 'of', 'field', 'theory', 'and', 'holography', 'a', 'set', 'of', 'basic', 'methods', 'for', 'the', 'computation', 'is', 'developed', 'and', 'illustrated', 'with', 'simple', 'examples', 'such', 'as', 'free', 'theories', 'and', 'conformal', 'field', 'theories', 'the', 'structures', 'of', 'the', 'ultraviolet', 'divergences', 'and', 'the', 'universal', 'parts', 'are', 'determined', 'and', 'compared', 'with', 'the', 'holographic', 'descriptions', 'of', 'entanglement', 'entropy', 'the', 'utility', 'of', 'quantum', 'inequalities', 'of', 'entanglement', 'are', 'discussed', 'and', 'shown', 'to', 'derive', 'the', 'ctheorem', 'that', 'constrains', 'renormalization', 'group', 'flows', 'of', 'quantum', 'field', 'theories', 'in', 'diverse', 'dimensions']] | [-0.1267597739708501, 0.17127554665680403, -0.12915174687608472, 0.07494281836458154, -0.016036617555991152, -0.16746581894941293, -0.013270931513476613, 0.27740291214069807, -0.22443764535752167, -0.2601946445836409, 0.061575439349572, -0.28408852859760997, -0.18747359175268594, 0.2065426824081622, -0.058473673120281566, 0.08865299997096127, -0.022797719843954116, 0.07149155419907188, -0.09637896944810678, -0.22930960590544217, 0.37113216633463764, 0.02972610118727594, 0.3249556906479369, 0.1106529887093767, 0.12077647122881703, 0.012132338579609856, -0.03878191237228813, 0.1001085309009697, -0.16780030910747162, 0.18741008003534926, 0.26861016624313483, 0.1468724544295886, 0.21999534565183493, -0.4263661442878279, -0.2861862740319994, 0.034173622005828866, 0.07831959670560586, 0.14470952261854927, -0.06218468866663406, -0.27658645958883, -0.0008002444671735436, -0.18505064824277218, -0.12376638877715261, -0.12592574900335018, -0.002961986467477169, -0.06625864653101375, -0.22112013501123534, 0.09278538556290195, -0.00473106744581716, 0.11463003090964546, -0.012326590471422753, -0.006619944597955223, -0.008526589324999903, 0.12166586839635898, 0.08007909163941739, 0.011848847411136638, 0.14901243175405102, -0.1996578038858904, -0.19072030608852705, 0.37853817609851964, -0.028390645158586202, -0.1704325733900643, 0.20582684883344415, -0.08830646404090363, -0.12060620569045076, 0.02213659689988236, 0.09262335945449367, 0.14493140940730637, -0.11572278738189656, 0.16469806164706563, -0.012161066554285385, 0.11060234346439608, 0.03796290562630774, 0.14542644719282785, 0.23742489073727582, 0.04833223677643046, 0.018099441478314163, 0.18334938284546673, -0.011499021772865776, -0.19834529023684627, -0.413462975607799, -0.2288116234614774, -0.18765475787222385, 0.06580587111304405, -0.13627207863497492, -0.15621855161609002, 0.39609339871015903, 0.11228596731778633, 0.13813071514412695, 0.05370025327513078, 0.22149483500434472, 0.11632430188261866, 0.06484797944289607, 0.060995192212463765, 0.23613686935539852, 0.24401439817387377, 0.0660300779057801, -0.24050105457101856, -0.057445734290422885, 0.14637398877315358] |
1,801.10353 | Uniqueness of axisymmetric viscous flows originating from positive
linear combinations of circular vortex filaments | Following the recent papers [9] and [10] by T. Gallay and V. \u{S}ver\'ak, in
the line of work initiated by H. Feng and V. \u{S}ver\'ak in their paper [3],
we prove the uniqueness of a solution of the axisymmetric Navier-Stokes
equations without swirl when the initial data is a positive linear combination
of Dirac masses.
| math.AP | following the recent papers 9 and 10 by t gallay and v usverak in the line of work initiated by h feng and v usverak in their paper 3 we prove the uniqueness of a solution of the axisymmetric navierstokes equations without swirl when the initial data is a positive linear combination of dirac masses | [['following', 'the', 'recent', 'papers', '9', 'and', '10', 'by', 't', 'gallay', 'and', 'v', 'usverak', 'in', 'the', 'line', 'of', 'work', 'initiated', 'by', 'h', 'feng', 'and', 'v', 'usverak', 'in', 'their', 'paper', '3', 'we', 'prove', 'the', 'uniqueness', 'of', 'a', 'solution', 'of', 'the', 'axisymmetric', 'navierstokes', 'equations', 'without', 'swirl', 'when', 'the', 'initial', 'data', 'is', 'a', 'positive', 'linear', 'combination', 'of', 'dirac', 'masses']] | [-0.148407481696499, 0.09954735477539627, -0.007667814042757858, -0.02732395970643583, -0.03960489828816869, -0.12256839385425503, 0.04450447218788957, 0.27736731909892776, -0.22167450200596994, -0.31660647619176996, 0.12014193247411062, -0.30159464859488333, -0.07854847900823436, 0.12995362850752742, -0.04030672498047352, 0.09453040183606473, 0.07577661253003912, -0.01330870461057533, -0.06808460374278101, -0.2712625053838234, 0.3857972691343589, -0.0288411802358248, 0.17514519781212914, 0.030852339339352594, 0.08507809628182175, -0.011959292824295434, -0.08933532462370666, 0.04710562881082296, -0.17470942308956927, 0.06855618427084251, 0.174035946381363, 0.09621748689308085, 0.3033124872229316, -0.3839872110635042, -0.17963569882241162, 0.07121185792440718, 0.11043004752560096, 0.0800347756171091, -0.05590215630575337, -0.28830731370570983, 0.12651028030297973, -0.1340026158839464, -0.19067041506482796, 0.01873526925390417, 0.1231229021129283, 0.05794495940208435, -0.26997348300435325, 0.10685412749563429, 0.15858243392272428, 0.09443442415954037, -0.10387819299305028, -0.1155917758545415, -0.08843156424435702, 0.019641034887701442, 0.05319340690462427, 0.08255461037624627, 0.023681310581212693, -0.12233640180731362, -0.10328657894649289, 0.3417204817926342, -0.13545456326312638, -0.161066657575694, 0.14773511034859851, -0.15576534603553063, -0.08125557314858518, 0.11385687554932454, 0.1304381595797498, 0.15256835381415756, -0.13159052187455184, 0.18449472426966002, -0.0928504080934958, 0.09696285170079633, 0.12589320015500893, -0.10871649470010941, 0.1115915143777701, 0.08524647766131568, 0.07668150241740725, 0.057284199056977576, -0.06998074474659834, 0.016229691919447346, -0.3078390279276805, -0.17379114815372634, -0.15576303863728588, 0.13726270840587942, -0.05752135553233199, -0.07853105769238689, 0.38906597124243325, 0.09567718974060634, 0.21504156802865593, 0.04578102637421001, 0.21938638680360534, 0.090390195236118, -0.04005625001300359, 0.12452820426869121, 0.21726825696162202, 0.1850656415632164, 0.1948577423325994, -0.20893936909904534, -0.01600409083026038, 0.12174676602536982] |
1,801.10354 | The kinetic Fokker-Planck equation with weak confinement force | We consider the kinetic Fokker-Planck equation with weak confinement force.
We proved some (polynomial and sub-exponential) rate of convergence to the
equilibrium (depending on the space to which the initial datum belongs). Our
results generalized the result in [4, 5, 21, 11, 10, 9, 1, 14] to weak
confinement case.
| math.AP | we consider the kinetic fokkerplanck equation with weak confinement force we proved some polynomial and subexponential rate of convergence to the equilibrium depending on the space to which the initial datum belongs our results generalized the result in 4 5 21 11 10 9 1 14 to weak confinement case | [['we', 'consider', 'the', 'kinetic', 'fokkerplanck', 'equation', 'with', 'weak', 'confinement', 'force', 'we', 'proved', 'some', 'polynomial', 'and', 'subexponential', 'rate', 'of', 'convergence', 'to', 'the', 'equilibrium', 'depending', 'on', 'the', 'space', 'to', 'which', 'the', 'initial', 'datum', 'belongs', 'our', 'results', 'generalized', 'the', 'result', 'in', '4', '5', '21', '11', '10', '9', '1', '14', 'to', 'weak', 'confinement', 'case']] | [-0.12382039095275105, 0.10697511085309089, -0.046083235526457426, 0.08322631929069757, -0.031452192291617394, -0.14519371647387744, 0.003963260576128959, 0.29551856610924004, -0.2847165149636567, -0.3153505096118897, 0.12066251339158043, -0.2359779016673565, -0.06415326768532395, 0.15310295023489742, -0.001159441601485014, 0.059266710691154, 0.03559487240388989, 0.048074955344200136, -0.0825402057915926, -0.3300456197233871, 0.3292965498007834, -0.02602023319574073, 0.24288756880676374, 0.08883635749909445, 0.09647433442994952, -0.039350037382682786, 0.010783659275621176, -0.029549523061723447, -0.22518757363781333, 0.03327783524990082, 0.11656470309942961, 0.045083474810235204, 0.29300047785043715, -0.3557981329225004, -0.15480286695063114, 0.1284634053148329, 0.11618704661726952, 0.11704354207031428, -0.025476162296254188, -0.2524504398414865, 0.11995597009081393, -0.1504110654629767, -0.22425620712339878, 0.009796982910484076, 0.05801512446254492, 0.07655885204672813, -0.32364591289311645, 0.12776152739301325, 0.1068234593886882, 0.038203041665256024, -0.136385715296492, -0.12602627617307008, 0.005094860871322453, 0.03148371742106974, 0.025947225138079375, 0.1012309719901532, 0.11345504387281835, -0.08821283474564552, -0.06778835020959377, 0.3647670127265155, -0.13215654209256172, -0.2323257240280509, 0.23797735415399074, -0.24094864165759644, -0.15916384279727935, 0.1593030333193019, 0.1044099241681397, 0.09280169498175382, -0.10421716945245862, 0.09394167079473846, -0.020836549028754234, 0.1625663753040135, 0.11343371553346515, -0.027139325421303512, 0.025375749096274377, 0.10505443128757179, 0.10236894673667848, 0.11761401824187487, -0.08631214999128133, -0.11174224824644625, -0.33106388233602047, -0.10495960402302444, -0.14909767968580126, 0.15390881653875113, -0.166371378255717, -0.09928365599364042, 0.3380139686819166, 0.1319269122183323, 0.17124656518921255, 0.09156242672586813, 0.1595718789147213, 0.1406098608043976, -0.03414167733091745, 0.09712211634963751, 0.26872578322247137, 0.1731788712181151, 0.1618956910353154, -0.20194269618019461, -0.05900016811676324, 0.1142856658808887] |
1,801.10355 | A CNN-based Spatial Feature Fusion Algorithm for Hyperspectral Imagery
Classification | The shortage of training samples remains one of the main obstacles in
applying the artificial neural networks (ANN) to the hyperspectral images
classification. To fuse the spatial and spectral information, pixel patches are
often utilized to train a model, which may further aggregate this problem. In
the existing works, an ANN model supervised by center-loss (ANNC) was
introduced. Training merely with spectral information, the ANNC yields
discriminative spectral features suitable for the subsequent classification
tasks. In this paper, a CNN-based spatial feature fusion (CSFF) algorithm is
proposed, which allows a smart fusion of the spatial information to the
spectral features extracted by ANNC. As a critical part of CSFF, a CNN-based
discriminant model is introduced to estimate whether two paring pixels belong
to the same class. At the testing stage, by applying the discriminant model to
the pixel-pairs generated by the test pixel and its neighbors, the local
structure is estimated and represented as a customized convolutional kernel.
The spectral-spatial feature is obtained by a convolutional operation between
the estimated kernel and the corresponding spectral features within a
neighborhood. At last, the label of the test pixel is predicted by classifying
the resulting spectral-spatial feature. Without increasing the number of
training samples or involving pixel patches at the training stage, the CSFF
framework achieves the state-of-the-art by declining $20\%-50\%$ classification
failures in experiments on three well-known hyperspectral images.
| cs.CV | the shortage of training samples remains one of the main obstacles in applying the artificial neural networks ann to the hyperspectral images classification to fuse the spatial and spectral information pixel patches are often utilized to train a model which may further aggregate this problem in the existing works an ann model supervised by centerloss annc was introduced training merely with spectral information the annc yields discriminative spectral features suitable for the subsequent classification tasks in this paper a cnnbased spatial feature fusion csff algorithm is proposed which allows a smart fusion of the spatial information to the spectral features extracted by annc as a critical part of csff a cnnbased discriminant model is introduced to estimate whether two paring pixels belong to the same class at the testing stage by applying the discriminant model to the pixelpairs generated by the test pixel and its neighbors the local structure is estimated and represented as a customized convolutional kernel the spectralspatial feature is obtained by a convolutional operation between the estimated kernel and the corresponding spectral features within a neighborhood at last the label of the test pixel is predicted by classifying the resulting spectralspatial feature without increasing the number of training samples or involving pixel patches at the training stage the csff framework achieves the stateoftheart by declining 2050 classification failures in experiments on three wellknown hyperspectral images | [['the', 'shortage', 'of', 'training', 'samples', 'remains', 'one', 'of', 'the', 'main', 'obstacles', 'in', 'applying', 'the', 'artificial', 'neural', 'networks', 'ann', 'to', 'the', 'hyperspectral', 'images', 'classification', 'to', 'fuse', 'the', 'spatial', 'and', 'spectral', 'information', 'pixel', 'patches', 'are', 'often', 'utilized', 'to', 'train', 'a', 'model', 'which', 'may', 'further', 'aggregate', 'this', 'problem', 'in', 'the', 'existing', 'works', 'an', 'ann', 'model', 'supervised', 'by', 'centerloss', 'annc', 'was', 'introduced', 'training', 'merely', 'with', 'spectral', 'information', 'the', 'annc', 'yields', 'discriminative', 'spectral', 'features', 'suitable', 'for', 'the', 'subsequent', 'classification', 'tasks', 'in', 'this', 'paper', 'a', 'cnnbased', 'spatial', 'feature', 'fusion', 'csff', 'algorithm', 'is', 'proposed', 'which', 'allows', 'a', 'smart', 'fusion', 'of', 'the', 'spatial', 'information', 'to', 'the', 'spectral', 'features', 'extracted', 'by', 'annc', 'as', 'a', 'critical', 'part', 'of', 'csff', 'a', 'cnnbased', 'discriminant', 'model', 'is', 'introduced', 'to', 'estimate', 'whether', 'two', 'paring', 'pixels', 'belong', 'to', 'the', 'same', 'class', 'at', 'the', 'testing', 'stage', 'by', 'applying', 'the', 'discriminant', 'model', 'to', 'the', 'pixelpairs', 'generated', 'by', 'the', 'test', 'pixel', 'and', 'its', 'neighbors', 'the', 'local', 'structure', 'is', 'estimated', 'and', 'represented', 'as', 'a', 'customized', 'convolutional', 'kernel', 'the', 'spectralspatial', 'feature', 'is', 'obtained', 'by', 'a', 'convolutional', 'operation', 'between', 'the', 'estimated', 'kernel', 'and', 'the', 'corresponding', 'spectral', 'features', 'within', 'a', 'neighborhood', 'at', 'last', 'the', 'label', 'of', 'the', 'test', 'pixel', 'is', 'predicted', 'by', 'classifying', 'the', 'resulting', 'spectralspatial', 'feature', 'without', 'increasing', 'the', 'number', 'of', 'training', 'samples', 'or', 'involving', 'pixel', 'patches', 'at', 'the', 'training', 'stage', 'the', 'csff', 'framework', 'achieves', 'the', 'stateoftheart', 'by', 'declining', '2050', 'classification', 'failures', 'in', 'experiments', 'on', 'three', 'wellknown', 'hyperspectral', 'images']] | [-0.00461040767923459, 0.009753050323870895, -0.06262908044551392, 0.052795904506702566, -0.058401594343347955, -0.16505541308552224, 0.013838726768076452, 0.40750121887344704, -0.2868640916545636, -0.3331755514223689, 0.0882357579153196, -0.27848368347113783, -0.13529402529022377, 0.12370145472438297, -0.11711799865485524, 0.08824979039774467, 0.10691048568361892, 0.06796747956021104, -0.07364080721543086, -0.29333765567610026, 0.32208922072993673, 0.08487077548778492, 0.34100942949628443, -0.02778495656763228, 0.1346261217743076, -0.02510527939436776, -0.07562558444328112, -0.012604046048415182, -0.0183660617763737, 0.1811520784544198, 0.2983450963310238, 0.14815234165047336, 0.31378513309369027, -0.36290473545761365, -0.25866644161926433, 0.10572878327024936, 0.13165319610007964, 0.06857212335674867, -0.0006288627829130706, -0.3340029994322531, 0.1258674183776973, -0.11593541051714426, -0.01869417142444414, -0.07692248281580807, -0.019594648663318753, -0.026996357748398262, -0.3237877389762769, 0.04969097270972334, 0.0998955805192545, 0.058005552862531846, -0.05784419537351912, -0.09628256519783013, -0.03321163264614225, 0.1352626187592926, -0.0035606936327041644, 0.05625783583196704, 0.12971557181872492, -0.19237448211833505, -0.09998407340773373, 0.3206661151458336, -0.043155606000568815, -0.16897552152704118, 0.1805144130722084, -0.03357912917581255, -0.0991955502350213, 0.13103085400153414, 0.18678733164512046, 0.09695193790047701, -0.16701005046092082, 0.013759857627760982, -0.01882739322861673, 0.18195985942930643, 0.06388941484058391, -0.031829628049791586, 0.18163223977667378, 0.2420774053903791, 0.014479247580150522, 0.15842961002165962, -0.2235277548537433, -0.02211853052464734, -0.23269384031937884, -0.08918944734923409, -0.2504984429270952, -0.0384145229611859, -0.12277564644350968, -0.1332827436980334, 0.46729586471646894, 0.1749695616962792, 0.2712037474425938, 0.06575006040624977, 0.325723896037985, 0.05510179498294714, 0.1550990674352125, 0.0718227765807239, 0.19008203547250116, 0.06695749324414697, 0.12015396142321787, -0.15320438381688323, 0.0685965991785041, 0.12124376445266921] |
1,801.10356 | Landau-Ginzburg theory of cortex dynamics: Scale-free avalanches emerge
at the edge of synchronization | Understanding the origin, nature, and functional significance of complex
patterns of neural activity, as recorded by diverse electrophysiological and
neuroimaging techniques, is a central challenge in neuroscience. Such patterns
include collective oscillations emerging out of neural synchronization as well
as highly heterogeneous outbursts of activity interspersed by periods of
quiescence, called "neuronal avalanches." Much debate has been generated about
the possible scale invariance or criticality of such avalanches and its
relevance for brain function. Aimed at shedding light onto this, here we
analyze the large-scale collective properties of the cortex by using a
mesoscopic approach following the principle of parsimony of Landau-Ginzburg.
Our model is similar to that of Wilson-Cowan for neural dynamics but crucially,
includes stochasticity and space; synaptic plasticity and inhibition are
considered as possible regulatory mechanisms. Detailed analyses uncover a phase
diagram including down-state, synchronous, asynchronous, and up-state phases
and reveal that empirical findings for neuronal avalanches are consistently
reproduced by tuning our model to the edge of synchronization. This reveals
that the putative criticality of cortical dynamics does not correspond to a
quiescent-to-active phase transition as usually assumed in theoretical
approaches but to a synchronization phase transition, at which incipient
oscillations and scale-free avalanches coexist. Furthermore, our model also
accounts for up and down states as they occur (e.g., during deep sleep). This
approach constitutes a framework to rationalize the possible collective phases
and phase transitions of cortical networks in simple terms, thus helping to
shed light on basic aspects of brain functioning from a very broad perspective.
| q-bio.NC cond-mat.stat-mech nlin.AO physics.comp-ph | understanding the origin nature and functional significance of complex patterns of neural activity as recorded by diverse electrophysiological and neuroimaging techniques is a central challenge in neuroscience such patterns include collective oscillations emerging out of neural synchronization as well as highly heterogeneous outbursts of activity interspersed by periods of quiescence called neuronal avalanches much debate has been generated about the possible scale invariance or criticality of such avalanches and its relevance for brain function aimed at shedding light onto this here we analyze the largescale collective properties of the cortex by using a mesoscopic approach following the principle of parsimony of landauginzburg our model is similar to that of wilsoncowan for neural dynamics but crucially includes stochasticity and space synaptic plasticity and inhibition are considered as possible regulatory mechanisms detailed analyses uncover a phase diagram including downstate synchronous asynchronous and upstate phases and reveal that empirical findings for neuronal avalanches are consistently reproduced by tuning our model to the edge of synchronization this reveals that the putative criticality of cortical dynamics does not correspond to a quiescenttoactive phase transition as usually assumed in theoretical approaches but to a synchronization phase transition at which incipient oscillations and scalefree avalanches coexist furthermore our model also accounts for up and down states as they occur eg during deep sleep this approach constitutes a framework to rationalize the possible collective phases and phase transitions of cortical networks in simple terms thus helping to shed light on basic aspects of brain functioning from a very broad perspective | [['understanding', 'the', 'origin', 'nature', 'and', 'functional', 'significance', 'of', 'complex', 'patterns', 'of', 'neural', 'activity', 'as', 'recorded', 'by', 'diverse', 'electrophysiological', 'and', 'neuroimaging', 'techniques', 'is', 'a', 'central', 'challenge', 'in', 'neuroscience', 'such', 'patterns', 'include', 'collective', 'oscillations', 'emerging', 'out', 'of', 'neural', 'synchronization', 'as', 'well', 'as', 'highly', 'heterogeneous', 'outbursts', 'of', 'activity', 'interspersed', 'by', 'periods', 'of', 'quiescence', 'called', 'neuronal', 'avalanches', 'much', 'debate', 'has', 'been', 'generated', 'about', 'the', 'possible', 'scale', 'invariance', 'or', 'criticality', 'of', 'such', 'avalanches', 'and', 'its', 'relevance', 'for', 'brain', 'function', 'aimed', 'at', 'shedding', 'light', 'onto', 'this', 'here', 'we', 'analyze', 'the', 'largescale', 'collective', 'properties', 'of', 'the', 'cortex', 'by', 'using', 'a', 'mesoscopic', 'approach', 'following', 'the', 'principle', 'of', 'parsimony', 'of', 'landauginzburg', 'our', 'model', 'is', 'similar', 'to', 'that', 'of', 'wilsoncowan', 'for', 'neural', 'dynamics', 'but', 'crucially', 'includes', 'stochasticity', 'and', 'space', 'synaptic', 'plasticity', 'and', 'inhibition', 'are', 'considered', 'as', 'possible', 'regulatory', 'mechanisms', 'detailed', 'analyses', 'uncover', 'a', 'phase', 'diagram', 'including', 'downstate', 'synchronous', 'asynchronous', 'and', 'upstate', 'phases', 'and', 'reveal', 'that', 'empirical', 'findings', 'for', 'neuronal', 'avalanches', 'are', 'consistently', 'reproduced', 'by', 'tuning', 'our', 'model', 'to', 'the', 'edge', 'of', 'synchronization', 'this', 'reveals', 'that', 'the', 'putative', 'criticality', 'of', 'cortical', 'dynamics', 'does', 'not', 'correspond', 'to', 'a', 'quiescenttoactive', 'phase', 'transition', 'as', 'usually', 'assumed', 'in', 'theoretical', 'approaches', 'but', 'to', 'a', 'synchronization', 'phase', 'transition', 'at', 'which', 'incipient', 'oscillations', 'and', 'scalefree', 'avalanches', 'coexist', 'furthermore', 'our', 'model', 'also', 'accounts', 'for', 'up', 'and', 'down', 'states', 'as', 'they', 'occur', 'eg', 'during', 'deep', 'sleep', 'this', 'approach', 'constitutes', 'a', 'framework', 'to', 'rationalize', 'the', 'possible', 'collective', 'phases', 'and', 'phase', 'transitions', 'of', 'cortical', 'networks', 'in', 'simple', 'terms', 'thus', 'helping', 'to', 'shed', 'light', 'on', 'basic', 'aspects', 'of', 'brain', 'functioning', 'from', 'a', 'very', 'broad', 'perspective']] | [-0.10999878192129713, 0.1712983166378171, -0.08217135905830496, 0.0944395000933217, -0.06481303599098301, -0.15328328187360493, 0.09347809129768617, 0.3691871708341272, -0.2496348895659917, -0.2981849660924879, 0.08329819642095247, -0.23888489676498711, -0.2971900525992833, 0.16360996612702985, -0.04397172368894589, 0.03934488404517896, 0.023598279753030395, 0.007324897641611536, 0.006787984441904104, -0.15582811874234054, 0.26102118357739235, 0.053978183889180895, 0.3222061980311875, 0.022876990441023464, 0.08139404810097323, -0.06480365707613828, -0.002711976459904398, 0.002410806919215247, -0.08288222697902313, 0.08486229981703451, 0.2925650952056604, 0.1253374980109927, 0.26831397548546765, -0.5039424467008995, -0.3007961492779773, 0.0908293125026085, 0.16720228412357602, 0.10024252994325906, -0.012339912056193563, -0.2936842438304819, 0.062280483492795025, -0.13026777110399163, -0.10603736451337016, -0.12631858923438802, 0.034378905653444876, 0.039845013325467304, -0.2227296291506404, 0.12241318560685555, 0.0896572331653863, 0.11491398647405117, -0.05614371019056493, -0.04384652654599234, -0.03209854787155746, 0.16070885987986014, 0.0560304522748109, 0.03169271013190798, 0.17610674624866152, -0.16249148250766937, -0.15755013877200524, 0.35317452553936457, 0.01920061309992085, -0.09697656390082089, 0.23173495145967177, -0.11878517959194433, -0.15946993548011623, 0.11310180171905272, 0.1890528296675892, 0.03524478054306204, -0.1507899566136495, -0.02275688987997656, 0.022813319396900844, 0.18802363576599393, 0.017346563443249786, 0.049530941818141376, 0.25204679618092124, 0.2693350183661563, -0.017671566535101598, 0.11772249313772667, -0.08771227791916623, -0.1562199196832004, -0.26743343771326855, -0.05268544226278921, -0.1505524810500832, 0.04504678667253902, -0.07747106650508996, -0.1643378979612486, 0.4645189960285213, 0.14329629430984966, 0.22802969850001326, 0.04785651152244728, 0.22688274376560003, 0.03828708181226903, 0.08360321537206271, 0.03799067615871748, 0.22253923973369685, 0.12788581049694384, 0.13343985202763395, -0.23777124822564258, 0.13916083406862695, 0.007638675588964817] |
1,801.10357 | Slepton pair production at the LHC in NLO+NLL with resummation-improved
parton densities | Novel PDFs taking into account resummation-improved matrix elements, albeit
only in the fit of a reduced data set, allow for consistent NLO+NLL
calculations of slepton pair production at the LHC. We apply a factorisation
method to this process that minimises the effect of the data set reduction,
avoids the problem of outlier replicas in the NNPDF method for PDF
uncertainties and preserves the reduction of the scale uncertainty. For Run II
of the LHC, left-handed selectron/smuon, right-handed and maximally mixed stau
production, we confirm that the consistent use of threshold-improved PDFs
partially compensates the resummation contributions in the matrix elements.
Together with the reduction of the scale uncertainty at NLO+NLL, the described
method further increases the reliability of slepton pair production cross
sections at the LHC.
| hep-ph | novel pdfs taking into account resummationimproved matrix elements albeit only in the fit of a reduced data set allow for consistent nlonll calculations of slepton pair production at the lhc we apply a factorisation method to this process that minimises the effect of the data set reduction avoids the problem of outlier replicas in the nnpdf method for pdf uncertainties and preserves the reduction of the scale uncertainty for run ii of the lhc lefthanded selectronsmuon righthanded and maximally mixed stau production we confirm that the consistent use of thresholdimproved pdfs partially compensates the resummation contributions in the matrix elements together with the reduction of the scale uncertainty at nlonll the described method further increases the reliability of slepton pair production cross sections at the lhc | [['novel', 'pdfs', 'taking', 'into', 'account', 'resummationimproved', 'matrix', 'elements', 'albeit', 'only', 'in', 'the', 'fit', 'of', 'a', 'reduced', 'data', 'set', 'allow', 'for', 'consistent', 'nlonll', 'calculations', 'of', 'slepton', 'pair', 'production', 'at', 'the', 'lhc', 'we', 'apply', 'a', 'factorisation', 'method', 'to', 'this', 'process', 'that', 'minimises', 'the', 'effect', 'of', 'the', 'data', 'set', 'reduction', 'avoids', 'the', 'problem', 'of', 'outlier', 'replicas', 'in', 'the', 'nnpdf', 'method', 'for', 'pdf', 'uncertainties', 'and', 'preserves', 'the', 'reduction', 'of', 'the', 'scale', 'uncertainty', 'for', 'run', 'ii', 'of', 'the', 'lhc', 'lefthanded', 'selectronsmuon', 'righthanded', 'and', 'maximally', 'mixed', 'stau', 'production', 'we', 'confirm', 'that', 'the', 'consistent', 'use', 'of', 'thresholdimproved', 'pdfs', 'partially', 'compensates', 'the', 'resummation', 'contributions', 'in', 'the', 'matrix', 'elements', 'together', 'with', 'the', 'reduction', 'of', 'the', 'scale', 'uncertainty', 'at', 'nlonll', 'the', 'described', 'method', 'further', 'increases', 'the', 'reliability', 'of', 'slepton', 'pair', 'production', 'cross', 'sections', 'at', 'the', 'lhc']] | [-0.05261175869224918, 0.1462964236677166, -0.08466173943856524, 0.1338798592273417, -0.011751860842138293, -0.08349703239380485, 0.0618257143346238, 0.31903499078064684, -0.246179633818212, -0.2666402497912742, 0.03147531170786048, -0.3387586346472658, 0.026675602875738627, 0.1407472269724138, 0.011321406358749501, 0.1036694524865154, 0.1542471768426901, -0.05940628607040419, -0.08853267081495789, -0.24705845868540188, 0.32281886268451454, 0.052726203065720345, 0.2625283285798061, 0.11079342027623502, 0.1124828142365293, 0.0628710817859789, -0.10852370896452432, -0.036134929383277066, -0.05676059476859842, 0.11504545438358382, 0.22584752804444483, 0.12499636147792141, 0.15582037674233554, -0.3711186611936206, -0.10259807557015428, 0.10679863336115396, 0.1373408387400328, 0.10681832105749184, -0.02598648710871145, -0.254542971266404, 0.10671174478170181, -0.25939230410943903, -0.12575569141670942, -0.058519688253346386, -0.03882827365490061, -0.08576630168254414, -0.3595463154571397, 0.10241251689426246, -0.03987512250416099, -0.008725881347922878, 0.007974800962348661, -0.18967489494631687, -0.07169102096841448, 0.04033371178610694, 0.08935636160724302, -0.002645989299737035, 0.14950842361357655, -0.1516291308346101, -0.1320653437444615, 0.36959955911521636, -0.06842812597437481, -0.17118664113952528, 0.08819573582519614, -0.1578881862048533, -0.18011035805402714, 0.17673515396503112, 0.22719626068802817, 0.05393805700776515, -0.1579938343881319, 0.12854709535647074, 0.01714049360995728, 0.18428273659591224, 0.04350737067649052, 0.020089554585634717, 0.14859045765525292, 0.21859305191578138, 0.05782803650649767, 0.05620489029180525, -0.10454146106845684, -0.07852168937605465, -0.42901646260112997, -0.11001681303074178, -0.10090564551674538, -0.024836443676908928, -0.10928731876964097, -0.11361711203593701, 0.37181895180413177, 0.16683214934291465, 0.2704850736975906, 0.08419424150830195, 0.31460263892002993, 0.12814634041662054, 0.1089292514537062, 0.03019570100254246, 0.25039317204047823, 0.1237244472306754, 0.07266930461743853, -0.26474928163686795, 0.08593081655941667, 0.06392101364003287] |
1,801.10358 | Wave front sets with respect to Banach spaces of ultradistributions.
Characterisation via the short-time Fourier transform | We define ultradistributional wave front sets with respect to
translation-modulation invariant Banach spaces of ultradistributions having
solid Fourier image. The main result is their characterisation by the
short-time Fourier transform.
| math.AP | we define ultradistributional wave front sets with respect to translationmodulation invariant banach spaces of ultradistributions having solid fourier image the main result is their characterisation by the shorttime fourier transform | [['we', 'define', 'ultradistributional', 'wave', 'front', 'sets', 'with', 'respect', 'to', 'translationmodulation', 'invariant', 'banach', 'spaces', 'of', 'ultradistributions', 'having', 'solid', 'fourier', 'image', 'the', 'main', 'result', 'is', 'their', 'characterisation', 'by', 'the', 'shorttime', 'fourier', 'transform']] | [-0.11070485017262399, 0.1138905171925823, -0.1789499683926503, 0.10932818943013747, -0.10332499574869872, -0.014488191219667594, -0.07026748545467854, 0.43155560195446013, -0.3429289867170155, -0.13055046335211956, 0.14334346364873152, -0.2631683211152752, -0.1252711300427715, 0.20633375141769647, -0.15276183277989427, 0.15749788749963045, 0.03750508090791603, 0.002306760164598624, -0.1472181818758448, -0.1939514666950951, 0.43184769091506797, -0.06456836399932703, 0.23476416567961375, -0.09218741146226724, 0.08855890836566686, 0.059230578659723206, -0.13000598328653723, -0.1244657024120291, -0.20093219429254533, 0.13488364874695738, 0.24538217037916182, 0.099081306407849, 0.2351142624237885, -0.3601212282354633, -0.12683042446151377, 0.1411685942672193, 0.09092405929404776, -0.07808127912382284, -0.009225286108752092, -0.3866191222021977, 0.04552416565517584, -0.05551971768339475, -0.16113341745610038, -0.17638554427151878, 0.031261550200482206, 0.08724971121797959, -0.23521923931936423, 0.05407569259405136, 0.13326300444702308, 0.0439810309248666, -0.14596795570105314, -0.05026546404697001, -0.019713688641786575, 0.04425070717309912, 0.011146150180138648, 0.1564850066167613, 0.11405798552247386, 0.0008566297590732574, -0.07464659375449022, 0.35195036015162867, -0.06984887815391023, -0.25197618938982486, 0.2068004533648491, -0.26554591616926093, -0.09098132833993683, 0.1779861433431506, 0.11859572617880379, 0.07908058551450571, -0.0917548921580116, 0.15662514132757982, -0.09298108213843079, 0.11317013471076885, 0.19093313375487925, 0.13294620650509995, 0.08454529866576195, 0.11275371202888589, 0.1272358958881038, 0.2001825870325168, -0.03673191045721372, -0.004552266752580181, -0.31163875857988993, -0.20499353183743854, -0.2122330226159344, 0.033444120084459426, -0.11653339254359404, -0.24963909263412157, 0.3817105365296205, 0.033057741230974595, 0.10551438829861581, 0.13312930157408118, 0.24127263975484917, 0.14142374629154802, 0.002672907205608984, -0.012253637130682667, 0.09775215205736458, 0.25003740241906297, 0.09460399883488814, -0.13158322108599046, -0.03544326193320255, 0.2520268265157938] |
1,801.10359 | Multi-factor approximation of rough volatility models | Rough volatility models are very appealing because of their remarkable fit of
both historical and implied volatilities. However, due to the non-Markovian and
non-semimartingale nature of the volatility process, there is no simple way to
simulate efficiently such models, which makes risk management of derivatives an
intricate task. In this paper, we design tractable multi-factor stochastic
volatility models approximating rough volatility models and enjoying a
Markovian structure. Furthermore, we apply our procedure to the specific case
of the rough Heston model. This in turn enables us to derive a numerical method
for solving fractional Riccati equations appearing in the characteristic
function of the log-price in this setting.
| math.PR q-fin.CP q-fin.PR | rough volatility models are very appealing because of their remarkable fit of both historical and implied volatilities however due to the nonmarkovian and nonsemimartingale nature of the volatility process there is no simple way to simulate efficiently such models which makes risk management of derivatives an intricate task in this paper we design tractable multifactor stochastic volatility models approximating rough volatility models and enjoying a markovian structure furthermore we apply our procedure to the specific case of the rough heston model this in turn enables us to derive a numerical method for solving fractional riccati equations appearing in the characteristic function of the logprice in this setting | [['rough', 'volatility', 'models', 'are', 'very', 'appealing', 'because', 'of', 'their', 'remarkable', 'fit', 'of', 'both', 'historical', 'and', 'implied', 'volatilities', 'however', 'due', 'to', 'the', 'nonmarkovian', 'and', 'nonsemimartingale', 'nature', 'of', 'the', 'volatility', 'process', 'there', 'is', 'no', 'simple', 'way', 'to', 'simulate', 'efficiently', 'such', 'models', 'which', 'makes', 'risk', 'management', 'of', 'derivatives', 'an', 'intricate', 'task', 'in', 'this', 'paper', 'we', 'design', 'tractable', 'multifactor', 'stochastic', 'volatility', 'models', 'approximating', 'rough', 'volatility', 'models', 'and', 'enjoying', 'a', 'markovian', 'structure', 'furthermore', 'we', 'apply', 'our', 'procedure', 'to', 'the', 'specific', 'case', 'of', 'the', 'rough', 'heston', 'model', 'this', 'in', 'turn', 'enables', 'us', 'to', 'derive', 'a', 'numerical', 'method', 'for', 'solving', 'fractional', 'riccati', 'equations', 'appearing', 'in', 'the', 'characteristic', 'function', 'of', 'the', 'logprice', 'in', 'this', 'setting']] | [-0.0545485728620508, -0.0030914558842723805, -0.10342370008475313, 0.15909697683852084, -0.1439588052333794, -0.15803740212746034, 0.056745146515465854, 0.41158884524359046, -0.32188008283264935, -0.2771725303354177, 0.11607429802974809, -0.23466346067567923, -0.20555580449160013, 0.22497257081983246, -0.1499410843820459, 0.0614784777025196, 0.023721441317558566, -0.051752873483140054, -0.04371300497349073, -0.2560482328587917, 0.27789627410314766, 0.051375669470735796, 0.2511480642726349, 0.0014570569467217288, 0.16438830420200792, -0.03568946379106318, -0.06596663308321177, -0.02691324627479521, -0.13183441225474127, 0.17430158211005348, 0.27721802388042077, 0.05639186454501664, 0.30355575045670824, -0.4437756368664102, -0.21079618888515456, 0.14481819004568958, 0.08683793694210656, 0.10294532979877719, 0.01964673720230566, -0.2543335010876409, -0.029409147128810948, -0.19247645083988937, -0.14170115821011295, -0.13593907975461159, 0.017187539455437353, 0.004892924916930497, -0.30151550464656324, 0.13276882125848086, 0.08448614799809233, -0.00169961952504258, -0.03212386444341565, -0.0732980224164638, 0.0008408678173322544, 0.06772773414327998, 0.09714110366859752, -0.06154498807154596, 0.06480510135520702, -0.15213618055856395, -0.11316506880570516, 0.35873238029498083, -0.07836609632299046, -0.23682314891011289, 0.18383535394601733, -0.12751930391973007, -0.13605998477802794, 0.1099374252893727, 0.21498904528779578, 0.1044932327746788, -0.243338790091699, 0.11181643797861517, -0.029457751087078425, 0.1285704010140116, 0.01464768817918114, -0.03598020805990341, 0.13245875026299575, 0.20963703733912417, 0.08392423167215468, 0.1322691360331863, -0.04150893194949098, -0.21167171773474627, -0.2908244739660871, -0.12775407972632447, -0.1058681331026568, 0.05343012105473361, -0.15658080322783827, -0.22750468128230247, 0.39141931223778803, 0.23467900467153627, 0.16532891955679266, 0.11415589079543705, 0.2574387532832954, 0.20498538459542373, -0.02157957261541388, 0.08164657310693672, 0.12303188691464052, 0.11717080499184813, 0.13249313413104583, -0.1823278099807658, 0.19468816640899977, 0.023808518067768243] |
1,801.1036 | Rotational broadening and conservation of angular momentum in
post-extreme horizontal branch stars | We show that the recent realization that isolated post-extreme horizontal
branch (post-EHB) stars are generally characterized by rotational broadening
with values of $V_{\rm rot} \sin i$ between 25 and 30 km~s$^{-1}$ can be
explained as a natural consequence of the conservation of angular momentum from
the previous He-core burning phase on the EHB. The progenitors of these evolved
objects, the EHB stars, are known to be slow rotators with an average value of
$V_{\rm rot} \sin i$ of $\sim$7.7 km~s$^{-1}$. This implies significant spin-up
between the EHB and post-EHB phases. Using representative evolutionary models
of hot subdwarf stars, we demonstrate that angular momentum conservation in
uniformly rotating strutures (rigid-body rotation) boosts that value of the
projected equatorial rotation speed by a factor $\sim$3.6 by the time the model
has reached the region of the surface gravity-effective temperature plane where
the newly-studied post-EHB objects are found. This is exactly what is needed to
account for their observed atmospheric broadening. We note that the decrease of
the moment of inertia causing the spin-up is mostly due to the redistribution
of matter that produces more centrally-condensed structures in the post-EHB
phase of evolution, not to the decrease of the radius per se.
| astro-ph.SR | we show that the recent realization that isolated postextreme horizontal branch postehb stars are generally characterized by rotational broadening with values of v_rm rot sin i between 25 and 30 kms1 can be explained as a natural consequence of the conservation of angular momentum from the previous hecore burning phase on the ehb the progenitors of these evolved objects the ehb stars are known to be slow rotators with an average value of v_rm rot sin i of sim77 kms1 this implies significant spinup between the ehb and postehb phases using representative evolutionary models of hot subdwarf stars we demonstrate that angular momentum conservation in uniformly rotating strutures rigidbody rotation boosts that value of the projected equatorial rotation speed by a factor sim36 by the time the model has reached the region of the surface gravityeffective temperature plane where the newlystudied postehb objects are found this is exactly what is needed to account for their observed atmospheric broadening we note that the decrease of the moment of inertia causing the spinup is mostly due to the redistribution of matter that produces more centrallycondensed structures in the postehb phase of evolution not to the decrease of the radius per se | [['we', 'show', 'that', 'the', 'recent', 'realization', 'that', 'isolated', 'postextreme', 'horizontal', 'branch', 'postehb', 'stars', 'are', 'generally', 'characterized', 'by', 'rotational', 'broadening', 'with', 'values', 'of', 'v_rm', 'rot', 'sin', 'i', 'between', '25', 'and', '30', 'kms1', 'can', 'be', 'explained', 'as', 'a', 'natural', 'consequence', 'of', 'the', 'conservation', 'of', 'angular', 'momentum', 'from', 'the', 'previous', 'hecore', 'burning', 'phase', 'on', 'the', 'ehb', 'the', 'progenitors', 'of', 'these', 'evolved', 'objects', 'the', 'ehb', 'stars', 'are', 'known', 'to', 'be', 'slow', 'rotators', 'with', 'an', 'average', 'value', 'of', 'v_rm', 'rot', 'sin', 'i', 'of', 'sim77', 'kms1', 'this', 'implies', 'significant', 'spinup', 'between', 'the', 'ehb', 'and', 'postehb', 'phases', 'using', 'representative', 'evolutionary', 'models', 'of', 'hot', 'subdwarf', 'stars', 'we', 'demonstrate', 'that', 'angular', 'momentum', 'conservation', 'in', 'uniformly', 'rotating', 'strutures', 'rigidbody', 'rotation', 'boosts', 'that', 'value', 'of', 'the', 'projected', 'equatorial', 'rotation', 'speed', 'by', 'a', 'factor', 'sim36', 'by', 'the', 'time', 'the', 'model', 'has', 'reached', 'the', 'region', 'of', 'the', 'surface', 'gravityeffective', 'temperature', 'plane', 'where', 'the', 'newlystudied', 'postehb', 'objects', 'are', 'found', 'this', 'is', 'exactly', 'what', 'is', 'needed', 'to', 'account', 'for', 'their', 'observed', 'atmospheric', 'broadening', 'we', 'note', 'that', 'the', 'decrease', 'of', 'the', 'moment', 'of', 'inertia', 'causing', 'the', 'spinup', 'is', 'mostly', 'due', 'to', 'the', 'redistribution', 'of', 'matter', 'that', 'produces', 'more', 'centrallycondensed', 'structures', 'in', 'the', 'postehb', 'phase', 'of', 'evolution', 'not', 'to', 'the', 'decrease', 'of', 'the', 'radius', 'per', 'se']] | [-0.1224794108117693, 0.2189090496805355, -0.05995729293945074, 0.035520658303855215, -0.07341229618284661, -0.055885967501553196, 0.0614235666583468, 0.37831778995388626, -0.2117947205929062, -0.34662835423986676, 0.03965889665355184, -0.2541411628195902, -0.04155030299681334, 0.18102863590513374, -0.08496392503210311, -0.047576967710483586, 0.0900302476413567, -0.004260635393082487, -0.08852748704446974, -0.21084310213811885, 0.28932552162215724, 0.016433381247429216, 0.19226981592554676, -0.020878368551481744, 0.07408352457081938, -0.11569624407007834, 0.002334664910746624, -0.0015447510368361765, -0.13632599765808162, 0.03487763982456254, 0.18137015525349406, 0.10887660032223757, 0.19821761177415598, -0.3492370556460275, -0.186237682393581, 0.0825687406390991, 0.19453869543599003, 0.07263742909975807, -0.05572433661580696, -0.2210620542066362, 0.06853485834958241, -0.1902835549126208, -0.17652011627321873, 0.00965766268497219, 0.11421531902350561, 0.04933772522157857, -0.21468260758841523, 0.1664422564511425, 0.10202294191801731, 0.08586604252804489, -0.09035518538083273, -0.1556052575838201, -0.1389351101017234, 0.0645367502679155, 0.07816325301097762, 0.07585529919965572, 0.12216090803790115, -0.10357594142824754, -0.016524425264072547, 0.4164084996267849, -0.08616348542748209, -0.09239397029753546, 0.1711572547780578, -0.2030742657650767, -0.09563879309013029, 0.1475583838241897, 0.1361208772536234, 0.1422048371180664, -0.11733015436068539, -0.02007446679041949, -0.006083418669212344, 0.17491042141669563, 0.0723267971862901, 0.01878637968258438, 0.3012759564491939, 0.12412694481418858, 0.03161007780771779, 0.04065451583568463, -0.20481651589839853, -0.10041618856069233, -0.2426144509363625, -0.12180628343924824, -0.11986376338445924, 0.06576758609469611, -0.10878609991213663, -0.12489486977039856, 0.34196029408663814, 0.1055004565723535, 0.24270503842081798, 0.01739196734365114, 0.2788575211425825, 0.14357801786640526, 0.10259508453333294, 0.14762812625018082, 0.3119733678176999, 0.20073720544685933, 0.10231926168638225, -0.2846003743660712, 0.08087786738713253, 0.009261298799359868] |
1,801.10361 | Weil-Petersson Teichm\"{u}ller space II: smoothness of flow curves of
$H^{\frac 32}$-vector fields | Given a continuous vector field $\lambda(t, \cdot)$ of Sobolev class
$H^{\frac 32}$ on the unit circle $S^1$, the flow maps $\eta=g(t, \cdot)$ of
the differential equation $$ \cases \frac{d\eta}{dt}=\lambda(t, \eta)\\
\eta(0,\zeta)=\zeta \endcases $$ are known to be quasisymmetric homeomorphisms.
Very recently, Gay-Balmaz-Ratiu [GR] conjectured that the flow curve $g(t,
\cdot)$ is in the Weil-Petersson class WP$(S^1)$ and is continuously
differentiable with respect to the Hilbert manifold structure of WP$(S^1)$
introduced by Takhtajan-Teo [TT]. The first assertion had already been
demonstrated in our previous paper [Sh2]. In this sequel to [Sh2], we will
continue to deal with the Weil-Petersson class WP$(S^1)$ and completely solve
this conjecture in the affirmative.
| math.CV | given a continuous vector field lambdat cdot of sobolev class hfrac 32 on the unit circle s1 the flow maps etagt cdot of the differential equation cases fracdetadtlambdat eta eta0zetazeta endcases are known to be quasisymmetric homeomorphisms very recently gaybalmazratiu gr conjectured that the flow curve gt cdot is in the weilpetersson class wps1 and is continuously differentiable with respect to the hilbert manifold structure of wps1 introduced by takhtajanteo tt the first assertion had already been demonstrated in our previous paper sh2 in this sequel to sh2 we will continue to deal with the weilpetersson class wps1 and completely solve this conjecture in the affirmative | [['given', 'a', 'continuous', 'vector', 'field', 'lambdat', 'cdot', 'of', 'sobolev', 'class', 'hfrac', '32', 'on', 'the', 'unit', 'circle', 's1', 'the', 'flow', 'maps', 'etagt', 'cdot', 'of', 'the', 'differential', 'equation', 'cases', 'fracdetadtlambdat', 'eta', 'eta0zetazeta', 'endcases', 'are', 'known', 'to', 'be', 'quasisymmetric', 'homeomorphisms', 'very', 'recently', 'gaybalmazratiu', 'gr', 'conjectured', 'that', 'the', 'flow', 'curve', 'gt', 'cdot', 'is', 'in', 'the', 'weilpetersson', 'class', 'wps1', 'and', 'is', 'continuously', 'differentiable', 'with', 'respect', 'to', 'the', 'hilbert', 'manifold', 'structure', 'of', 'wps1', 'introduced', 'by', 'takhtajanteo', 'tt', 'the', 'first', 'assertion', 'had', 'already', 'been', 'demonstrated', 'in', 'our', 'previous', 'paper', 'sh2', 'in', 'this', 'sequel', 'to', 'sh2', 'we', 'will', 'continue', 'to', 'deal', 'with', 'the', 'weilpetersson', 'class', 'wps1', 'and', 'completely', 'solve', 'this', 'conjecture', 'in', 'the', 'affirmative']] | [-0.14677069288696729, 0.06576916419298333, -0.05169107289254373, 0.03203568892443881, -0.10047371283757921, -0.13610773904742124, -0.06395216232654181, 0.36768278055915643, -0.29589941760287714, -0.218055487508251, 0.0970631449542684, -0.28705892404975075, -0.1356615450452356, 0.1825579659848967, -0.14294929307995036, 0.09110153002627924, 0.006072554819505005, 0.06031542546663653, -0.08600986535277437, -0.3141814340533707, 0.35022063723162694, -0.0011638411247701036, 0.19137011382582725, 0.04251623423039621, 0.09100382030923285, -0.07853396283006113, 0.012847395869446736, -0.009264943108759967, -0.2184902099124527, 0.08307211086446163, 0.25577028198898133, 0.0717416147814291, 0.24765634961088426, -0.34634281340621265, -0.1871092867622079, 0.15512610219679224, 0.13001839459106765, -0.021852463746315564, 0.013008784953568714, -0.3155888969183662, 0.08557579239519934, -0.1251566673825294, -0.16449179073485234, -0.061550665774620046, 0.09289718541092988, -0.015294345029556723, -0.23767833568112395, 0.033834213454860686, 0.10005311901662864, 0.02675197846324676, -0.08185664188189834, -0.09884834685819406, -0.021400402936920086, 0.03302746553284427, 0.057917982243987566, 0.23085914046832307, 0.03761366493178203, -0.05133040733270201, -0.0454251365827433, 0.33998210727255423, -0.0961451535016143, -0.22239431920552663, 0.0836946047641629, -0.22014208420581532, -0.19989959238663169, 0.11914202520925113, 0.1274115877253387, 0.17179156725714897, -0.10599387862648833, 0.20319344749669635, -0.11153294293520351, 0.12387736957958516, 0.09576099143619192, -0.05169923482325805, 0.08199429515447906, 0.08397269211070356, 0.10335257667112256, 0.13483852883869343, -0.018352161967378183, -0.06531842444639872, -0.2938846370807904, -0.18830706191011795, -0.13808024020902082, 0.14455128448339655, -0.045566974887704274, -0.12622628334236866, 0.343269778032075, 0.060033206042705796, 0.20389127311315022, 0.12148778068184779, 0.1735141391742646, 0.09199144399619899, 0.0476177601382255, 0.11362711216012637, 0.19868434583722597, 0.18525544398089908, 0.12295725344059368, -0.14494788265723152, -0.006826104536908222, 0.16152508007978802] |
1,801.10362 | Measurement of $\Gamma_{ee}\times\mathcal{B}_{\mu\mu}$ for $\psi(2S)$
meson | The product of the electronic width of the $\psi(2S)$ meson and the branching
fraction of its decay to the muon pair was measured in the $e^{+}e^{-} \to
\psi(2S) \to \mu^{+}\mu^{-}$ process using nine data sets corresponding to an
integrated luminosity of about 6.5 pb$^{-1}$ collected with the KEDR detector
at the VEPP-4M electron-positron collider: \[
\Gamma_{ee}\times\mathcal{B}_{\mu\mu} = 19.3 \pm 0.3 \pm 0.5 ~\text{eV}. \]
Adding the previous KEDR results on hadronic and leptonic channels, the values
of the $\psi(2S)$ electronic width were obtained under two assumptions: either
with the assumption of lepton universality \[ \Gamma_{ee} = 2.279 \pm 0.015 \pm
0.042 ~\text{keV} \] or without it, summing up hadronic and three independent
leptonic channels: \[ \Gamma_{ee} = 2.282 \pm 0.015 \pm 0.042 ~\text{keV}. \]
| hep-ex | the product of the electronic width of the psi2s meson and the branching fraction of its decay to the muon pair was measured in the ee to psi2s to mumu process using nine data sets corresponding to an integrated luminosity of about 65 pb1 collected with the kedr detector at the vepp4m electronpositron collider gamma_eetimesmathcalb_mumu 193 pm 03 pm 05 textev adding the previous kedr results on hadronic and leptonic channels the values of the psi2s electronic width were obtained under two assumptions either with the assumption of lepton universality gamma_ee 2279 pm 0015 pm 0042 textkev or without it summing up hadronic and three independent leptonic channels gamma_ee 2282 pm 0015 pm 0042 textkev | [['the', 'product', 'of', 'the', 'electronic', 'width', 'of', 'the', 'psi2s', 'meson', 'and', 'the', 'branching', 'fraction', 'of', 'its', 'decay', 'to', 'the', 'muon', 'pair', 'was', 'measured', 'in', 'the', 'ee', 'to', 'psi2s', 'to', 'mumu', 'process', 'using', 'nine', 'data', 'sets', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', 'about', '65', 'pb1', 'collected', 'with', 'the', 'kedr', 'detector', 'at', 'the', 'vepp4m', 'electronpositron', 'collider', 'gamma_eetimesmathcalb_mumu', '193', 'pm', '03', 'pm', '05', 'textev', 'adding', 'the', 'previous', 'kedr', 'results', 'on', 'hadronic', 'and', 'leptonic', 'channels', 'the', 'values', 'of', 'the', 'psi2s', 'electronic', 'width', 'were', 'obtained', 'under', 'two', 'assumptions', 'either', 'with', 'the', 'assumption', 'of', 'lepton', 'universality', 'gamma_ee', '2279', 'pm', '0015', 'pm', '0042', 'textkev', 'or', 'without', 'it', 'summing', 'up', 'hadronic', 'and', 'three', 'independent', 'leptonic', 'channels', 'gamma_ee', '2282', 'pm', '0015', 'pm', '0042', 'textkev']] | [-0.059777475001490596, 0.21206859252101581, -0.04527757648407204, 0.054893447836356676, 0.020133612981768686, -0.11291755029621224, 0.07314525713547737, 0.33547245302613365, -0.1576760801437654, -0.34307423941055804, 0.00545569937860005, -0.4535906210688776, 0.1910184348847619, 0.1600352264368874, 0.0954228764677649, 0.13350677715980533, 0.10225224757174912, -0.041880007048970776, -0.09070075613756974, -0.1924708825393106, 0.16050699671011484, 0.04133101630335053, 0.21251515926703354, 0.08702817501800478, 0.04879061570962924, 0.005472583169313638, -0.041754038176772985, -0.13198595587164164, -0.20071146786294616, 0.015029402115798899, 0.18915903861348501, 0.07209506277815722, 0.10128513310235321, -0.26106702109896823, 0.032725573754297535, 0.1602142595383747, 0.1296255481347703, -0.060808053017561245, 0.06568675386012744, -0.40432383736039984, 0.18649719805832496, -0.21287546519868142, -0.05873608200304341, 0.08541377128118224, 0.03338489563024619, -0.1340063041272132, -0.3423885080898017, 0.15803786512594997, -0.10072868684992979, 0.08215663104987982, -0.04817079438668627, -0.3214881313482724, -0.06223584988089115, -0.051453528625547494, 0.08287567011332915, 0.16069977158545762, 0.1900061075003785, -0.044456943816489035, -0.16546082200703063, 0.3586911730010781, -0.06620093149933637, -0.0988086052810806, 0.08698842453917391, -0.22434692253080898, -0.09702861879078116, 0.25377198585652205, 0.20000768349742876, -0.01275643972391998, -0.22291768606948226, 0.05498580808451056, -0.0015333992094128278, 0.2277767082815173, 0.1063260679917508, 0.09215506491365663, 0.16191160467273571, 0.1498651157241527, -0.05193845869711878, 0.024911368144226766, -0.18836990413623617, 0.017993403655852665, -0.3716677137764922, -0.07128967156862481, -0.04000412297778224, 0.1804137899695585, -0.10749982583314577, -0.03285529122589842, 0.34035399465478566, 0.03506628847415477, 0.3072448634346457, 0.01723718075408486, 0.27468243128571074, 0.08321397742072709, 0.01792653776289642, 0.09592958657199153, 0.32065385887235925, 0.24355323099849843, 0.14731051062393052, -0.2657206060095249, 0.050313218317010945, -0.028921154380792326] |
1,801.10363 | Detection of bosonic mode as a signature of magnetic excitation in one
unit cell FeSe on SrTiO3 | We report an in situ scanning tunneling spectroscopy study of one-unit-cell
(1-UC) FeSe film on SrTiO3(001) (STO) substrate. In quasiparticle density of
states, bosonic excitation mode characterized by the "dip-hump" structure is
detected outside the larger superconducting gap with energy comparable with
phonon and spin resonance modes in heavily electron-doped iron selenides.
Statistically, the excitation mode, which is intimately correlated with
superconductivity, shows an anticorrelation with pairing strength and yields an
energy scale upper-bounded by twice the superconducting gap coinciding with the
characteristics of magnetic resonance in cuprates and iron-based
superconductors. The local response of tunneling spectra to magnetically
different Se defects all exhibits the induced in-gap quasiparticle bound
states, indicating an unconventional sign-reversing pairing. These results
support the magnetic nature of the excitation mode and possibly reveal a
signature of electron-magnetic-excitation coupling in high-temperature
superconductivity of 1-UC FeSe/STO.
| cond-mat.supr-con | we report an in situ scanning tunneling spectroscopy study of oneunitcell 1uc fese film on srtio3001 sto substrate in quasiparticle density of states bosonic excitation mode characterized by the diphump structure is detected outside the larger superconducting gap with energy comparable with phonon and spin resonance modes in heavily electrondoped iron selenides statistically the excitation mode which is intimately correlated with superconductivity shows an anticorrelation with pairing strength and yields an energy scale upperbounded by twice the superconducting gap coinciding with the characteristics of magnetic resonance in cuprates and ironbased superconductors the local response of tunneling spectra to magnetically different se defects all exhibits the induced ingap quasiparticle bound states indicating an unconventional signreversing pairing these results support the magnetic nature of the excitation mode and possibly reveal a signature of electronmagneticexcitation coupling in hightemperature superconductivity of 1uc fesesto | [['we', 'report', 'an', 'in', 'situ', 'scanning', 'tunneling', 'spectroscopy', 'study', 'of', 'oneunitcell', '1uc', 'fese', 'film', 'on', 'srtio3001', 'sto', 'substrate', 'in', 'quasiparticle', 'density', 'of', 'states', 'bosonic', 'excitation', 'mode', 'characterized', 'by', 'the', 'diphump', 'structure', 'is', 'detected', 'outside', 'the', 'larger', 'superconducting', 'gap', 'with', 'energy', 'comparable', 'with', 'phonon', 'and', 'spin', 'resonance', 'modes', 'in', 'heavily', 'electrondoped', 'iron', 'selenides', 'statistically', 'the', 'excitation', 'mode', 'which', 'is', 'intimately', 'correlated', 'with', 'superconductivity', 'shows', 'an', 'anticorrelation', 'with', 'pairing', 'strength', 'and', 'yields', 'an', 'energy', 'scale', 'upperbounded', 'by', 'twice', 'the', 'superconducting', 'gap', 'coinciding', 'with', 'the', 'characteristics', 'of', 'magnetic', 'resonance', 'in', 'cuprates', 'and', 'ironbased', 'superconductors', 'the', 'local', 'response', 'of', 'tunneling', 'spectra', 'to', 'magnetically', 'different', 'se', 'defects', 'all', 'exhibits', 'the', 'induced', 'ingap', 'quasiparticle', 'bound', 'states', 'indicating', 'an', 'unconventional', 'signreversing', 'pairing', 'these', 'results', 'support', 'the', 'magnetic', 'nature', 'of', 'the', 'excitation', 'mode', 'and', 'possibly', 'reveal', 'a', 'signature', 'of', 'electronmagneticexcitation', 'coupling', 'in', 'hightemperature', 'superconductivity', 'of', '1uc', 'fesesto']] | [-0.2246779198690817, 0.2625016027886886, -0.0320248943163028, 0.036492748811935496, -0.03030414087360428, -0.1663535422311448, 0.11565634436513958, 0.379209964144705, -0.21815753909860455, -0.2875254365237619, -0.08962474665283968, -0.36855391272600146, -0.08096025187684142, 0.1649787848059466, 0.0712624069613715, -0.012539339142149665, -0.06637884235259253, -0.05264390517275888, -0.10145960808934076, -0.17942250223316386, 0.35059726292240445, 0.053277586384311966, 0.40194362304780795, 0.11647402046525014, -0.04600099991670425, -0.005779117557550848, 0.16329471309048435, -0.030676197857879426, -0.1616363358969439, 0.03546366384978392, 0.3162660196447151, -0.14697397345393573, 0.16088451083160707, -0.4421231078888303, -0.21202778537163808, -0.042046478126144066, 0.17425312486264613, 0.10845038727637839, -0.07633487710077991, -0.290618569360695, 0.011353503531384944, -0.11905085304212096, -0.1249928889910866, -0.08555760793598788, -0.07059688401489478, -0.05490372279166258, -0.21133839945094593, 0.14829886944262663, 0.051050134212372526, 0.1383381658638625, -0.14769686046697578, -0.11221812131976627, -0.10770896405818453, -0.07004431864260223, 0.06633410043930095, 0.06350263740118268, 0.16915880258033134, -0.09742571418620713, -0.12753509565685078, 0.26099251158049575, -0.056582828585490366, 0.005356490799306851, 0.16420329681705628, -0.19223851656905658, -0.03617147072741384, 0.21018543858351052, 0.014034563009087266, 0.0743473587638658, -0.10765898296064562, 0.06257467204367445, -0.011228150331273513, 0.2483247244917025, 0.0406808853706183, 0.18655224284832028, 0.25740890702286706, 0.21987424059931282, 0.03815414249708039, 0.11263101886910643, -0.15936514709914185, 0.007699895471307463, -0.18453822967231923, -0.1622807607312005, -0.23830679553477396, 0.04098982145280942, -0.017849540772790468, -0.23705425424892726, 0.4033380437210418, 0.07652056692977963, 0.22027390943570196, -0.13108309346548133, 0.18790244759208913, 0.1273397343651648, 0.09576716103280584, 0.05399026574847032, 0.2738764457627321, 0.20465735635598717, 0.07528450323498227, -0.38865472975801135, 0.09515417280688754, -0.036643964101803365] |
1,801.10364 | Security of NEQR Quantum Image by Using Quantum Fourier Transform with
Blind Trent | In this study, the security of Novel Enhanced Quantum Representation (NEQR)
of quantum images are suggested by using the Quantum Fourier Transform (QFT)
with blind trent. In the protocol, QFT and keys are used to share signature
with recipients. So all members know only their signature information which are
encrypted output of the QFT. This improves the security of the protocol. In
addition, the security of the protocol is provided by using reorder QFT output
qubits with permutation of the blind trent. The security analysis expresses
security of the transfer of the image with effective secret key usage.
| quant-ph cs.IT math.IT | in this study the security of novel enhanced quantum representation neqr of quantum images are suggested by using the quantum fourier transform qft with blind trent in the protocol qft and keys are used to share signature with recipients so all members know only their signature information which are encrypted output of the qft this improves the security of the protocol in addition the security of the protocol is provided by using reorder qft output qubits with permutation of the blind trent the security analysis expresses security of the transfer of the image with effective secret key usage | [['in', 'this', 'study', 'the', 'security', 'of', 'novel', 'enhanced', 'quantum', 'representation', 'neqr', 'of', 'quantum', 'images', 'are', 'suggested', 'by', 'using', 'the', 'quantum', 'fourier', 'transform', 'qft', 'with', 'blind', 'trent', 'in', 'the', 'protocol', 'qft', 'and', 'keys', 'are', 'used', 'to', 'share', 'signature', 'with', 'recipients', 'so', 'all', 'members', 'know', 'only', 'their', 'signature', 'information', 'which', 'are', 'encrypted', 'output', 'of', 'the', 'qft', 'this', 'improves', 'the', 'security', 'of', 'the', 'protocol', 'in', 'addition', 'the', 'security', 'of', 'the', 'protocol', 'is', 'provided', 'by', 'using', 'reorder', 'qft', 'output', 'qubits', 'with', 'permutation', 'of', 'the', 'blind', 'trent', 'the', 'security', 'analysis', 'expresses', 'security', 'of', 'the', 'transfer', 'of', 'the', 'image', 'with', 'effective', 'secret', 'key', 'usage']] | [-0.13933419034464703, 0.04133316156055246, -0.12148428187534517, 0.04893327519958079, -0.022891255014823104, -0.2452942159606562, 0.06352123426397008, 0.3281573592780196, -0.27489648787874954, -0.30777647454595686, 0.08629727676838675, -0.25683687250985177, -0.125366238706118, 0.18419595599193506, -0.14122037843287905, 0.13536315068260443, 0.0137716650259586, 0.06528998438116847, -0.04875042997015526, -0.31767712605698983, 0.33693168375032895, 0.04748611756700224, 0.335792050715916, 0.008483736642769404, 0.03651294995061293, 0.06450263463906297, -0.07566895817729588, -0.10863095451602522, -0.05095205906474469, 0.15713858291654068, 0.2902841373318236, 0.21862204179015696, 0.27122421092733895, -0.3947259095516436, -0.16356799253547677, 0.052769162791914175, 0.14419486347528898, 0.1207321150149979, -0.05994870696140795, -0.35751480797343715, 0.10031673017109992, -0.18136540568452708, -0.024085457522270023, -0.07485794358677705, -0.07780145289618712, -0.0012784952853749298, -0.21324985603592833, 0.023471814303181363, 0.024431033905747593, 0.09168315528207743, 0.044795880106049686, -0.024131649515914674, 0.01615050313424091, 0.21523964255620553, -0.005308279275837146, 0.022187118154798388, 0.15204828454428637, -0.13675545925768662, -0.16644336467570797, 0.36261110927681534, -0.0017767380994307448, -0.17959222353386636, 0.10058857369170125, -0.08261981148424806, -0.11978396899256931, 0.084817764225739, 0.10592490547973359, 0.058503819487000605, -0.130138744039423, 0.07826127804642334, -0.05383311007742067, 0.2229696212737935, 0.06603847203149023, 0.17393455511833333, 0.15787390007504395, 0.08823599868895943, 0.020237261735910207, 0.15372746086641387, -0.07812134873499732, -0.12248506114998718, -0.3053022216131188, -0.22668996244212802, -0.239162615829442, 0.037211729708954464, -0.06572036113936278, -0.1261403867927361, 0.3983142312273991, 0.1981750813856892, 0.11865933050819653, 0.011764481261001937, 0.37779488878286616, 0.0711683183338265, 0.1254052379505937, 0.12978969372295757, 0.19366610580485086, 0.11786751059948333, 0.11847682931099315, -0.17436548098636678, 0.1094078639574463, 0.07284435866476625] |
1,801.10365 | Synchronized Detection and Recovery of Steganographic Messages with
Adversarial Learning | In this work, we mainly study the mechanism of learning the steganographic
algorithm as well as combining the learning process with adversarial learning
to learn a good steganographic algorithm. To handle the problem of embedding
secret messages into the specific medium, we design a novel adversarial modules
to learn the steganographic algorithm, and simultaneously train three modules
called generator, discriminator and steganalyzer. Different from existing
methods, the three modules are formalized as a game to communicate with each
other. In the game, the generator and discriminator attempt to communicate with
each other using secret messages hidden in an image. While the steganalyzer
attempts to analyze whether there is a transmission of confidential
information. We show that through unsupervised adversarial training, the
adversarial model can produce robust steganographic solutions, which act like
an encryption. Furthermore, we propose to utilize supervised adversarial
training method to train a robust steganalyzer, which is utilized to
discriminate whether an image contains secret information. Numerous experiments
are conducted on publicly available dataset to demonstrate the effectiveness of
the proposed method.
| cs.CV cs.CR | in this work we mainly study the mechanism of learning the steganographic algorithm as well as combining the learning process with adversarial learning to learn a good steganographic algorithm to handle the problem of embedding secret messages into the specific medium we design a novel adversarial modules to learn the steganographic algorithm and simultaneously train three modules called generator discriminator and steganalyzer different from existing methods the three modules are formalized as a game to communicate with each other in the game the generator and discriminator attempt to communicate with each other using secret messages hidden in an image while the steganalyzer attempts to analyze whether there is a transmission of confidential information we show that through unsupervised adversarial training the adversarial model can produce robust steganographic solutions which act like an encryption furthermore we propose to utilize supervised adversarial training method to train a robust steganalyzer which is utilized to discriminate whether an image contains secret information numerous experiments are conducted on publicly available dataset to demonstrate the effectiveness of the proposed method | [['in', 'this', 'work', 'we', 'mainly', 'study', 'the', 'mechanism', 'of', 'learning', 'the', 'steganographic', 'algorithm', 'as', 'well', 'as', 'combining', 'the', 'learning', 'process', 'with', 'adversarial', 'learning', 'to', 'learn', 'a', 'good', 'steganographic', 'algorithm', 'to', 'handle', 'the', 'problem', 'of', 'embedding', 'secret', 'messages', 'into', 'the', 'specific', 'medium', 'we', 'design', 'a', 'novel', 'adversarial', 'modules', 'to', 'learn', 'the', 'steganographic', 'algorithm', 'and', 'simultaneously', 'train', 'three', 'modules', 'called', 'generator', 'discriminator', 'and', 'steganalyzer', 'different', 'from', 'existing', 'methods', 'the', 'three', 'modules', 'are', 'formalized', 'as', 'a', 'game', 'to', 'communicate', 'with', 'each', 'other', 'in', 'the', 'game', 'the', 'generator', 'and', 'discriminator', 'attempt', 'to', 'communicate', 'with', 'each', 'other', 'using', 'secret', 'messages', 'hidden', 'in', 'an', 'image', 'while', 'the', 'steganalyzer', 'attempts', 'to', 'analyze', 'whether', 'there', 'is', 'a', 'transmission', 'of', 'confidential', 'information', 'we', 'show', 'that', 'through', 'unsupervised', 'adversarial', 'training', 'the', 'adversarial', 'model', 'can', 'produce', 'robust', 'steganographic', 'solutions', 'which', 'act', 'like', 'an', 'encryption', 'furthermore', 'we', 'propose', 'to', 'utilize', 'supervised', 'adversarial', 'training', 'method', 'to', 'train', 'a', 'robust', 'steganalyzer', 'which', 'is', 'utilized', 'to', 'discriminate', 'whether', 'an', 'image', 'contains', 'secret', 'information', 'numerous', 'experiments', 'are', 'conducted', 'on', 'publicly', 'available', 'dataset', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.05001106881804165, -0.031851488721624535, -0.09305994246080089, 0.09046558203447175, -0.148407356701149, -0.29584730674255766, 0.03823981475052905, 0.4620805364102125, -0.3299111313074185, -0.3275147586868241, 0.06413345571390577, -0.2947395659190999, -0.1802365190386986, 0.14510091086822807, -0.17758854234526897, 0.08539628385212915, 0.07000968905818787, 0.09001049763742491, -0.001051068077152916, -0.33167201839655036, 0.3348597101492529, 0.02980439434090265, 0.32923329880610963, -0.012381707912246728, 0.16107659264007348, -0.0300551327494048, -0.029873576759221566, -0.06943645608750568, -0.062662573979745, 0.13852743768660436, 0.36663311945097843, 0.24329192623035747, 0.33315844662573146, -0.40441895235629605, -0.20464475129613247, 0.11851379242404525, 0.14353779436827735, 0.15590938866598766, -0.09679643307804484, -0.3481319871806036, 0.12772981974499664, -0.2055331688674017, 0.06025016911584755, -0.1259303222699412, -0.11237472873555775, -0.012556462164970928, -0.3422204864521821, -0.06572758233115805, 0.04071572610383168, 0.02090779818519522, -0.013937388937492138, -0.034520627247656685, 0.016502716207887506, 0.1876136875020918, 0.03076797092367558, 0.06030230499314273, 0.11934570238347454, -0.14046022985127204, -0.1835462551125079, 0.3173704144689415, -0.05990538268414294, -0.20314846306653886, 0.17204899815896033, 0.028263484697853183, -0.11345152141280129, 0.09577352385004533, 0.2573643117880813, 0.12610097005347795, -0.18386122456419912, -0.04212476256478781, -0.05203249108517307, 0.20715760234502498, 0.031677171740488244, 0.030009567915463966, 0.12629047038211572, 0.220958078076699, 0.03650839096898663, 0.18510621236891475, -0.11484662989748577, -0.06299982115562106, -0.2230676082444602, -0.1171676479842, -0.21662331134851637, -0.03283824251520437, -0.06544119662087713, -0.12484223564404957, 0.41521183794214467, 0.27543233103132553, 0.22041810663074426, 0.07755056711585508, 0.41096387304708193, -0.044494450849015266, 0.11963740599892991, 0.14730104507514458, 0.17837710236466822, 0.04353057112994379, 0.09079139236087815, -0.14394967286478214, 0.10400701038159388, 0.04409949311280045] |
1,801.10366 | Analysis of scalar and fermion quantum field theory on anti-de Sitter
space-time | We study vacuum and thermal expectation values of quantum scalar and Dirac
fermion fields on anti-de Sitter space-time. Anti-de Sitter space-time is
maximally symmetric and this enables expressions for the scalar and fermion
vacuum Feynman Green's functions to be derived in closed form. We employ
Hadamard renormalization to find the vacuum expectation values. The thermal
Feynman Green's functions are constructed from the vacuum Feynman Green's
functions using the imaginary time periodicity/anti-periodicity property for
scalars/fermions. Focussing on massless fields with either conformal or minimal
coupling to the space-time curvature (these two cases being the same for
fermions) we compute the differences between the thermal and vacuum expectation
values. We compare the resulting energy densities, pressures and pressure
deviators with the corresponding classical quantities calculated using
relativistic kinetic theory.
| hep-th | we study vacuum and thermal expectation values of quantum scalar and dirac fermion fields on antide sitter spacetime antide sitter spacetime is maximally symmetric and this enables expressions for the scalar and fermion vacuum feynman greens functions to be derived in closed form we employ hadamard renormalization to find the vacuum expectation values the thermal feynman greens functions are constructed from the vacuum feynman greens functions using the imaginary time periodicityantiperiodicity property for scalarsfermions focussing on massless fields with either conformal or minimal coupling to the spacetime curvature these two cases being the same for fermions we compute the differences between the thermal and vacuum expectation values we compare the resulting energy densities pressures and pressure deviators with the corresponding classical quantities calculated using relativistic kinetic theory | [['we', 'study', 'vacuum', 'and', 'thermal', 'expectation', 'values', 'of', 'quantum', 'scalar', 'and', 'dirac', 'fermion', 'fields', 'on', 'antide', 'sitter', 'spacetime', 'antide', 'sitter', 'spacetime', 'is', 'maximally', 'symmetric', 'and', 'this', 'enables', 'expressions', 'for', 'the', 'scalar', 'and', 'fermion', 'vacuum', 'feynman', 'greens', 'functions', 'to', 'be', 'derived', 'in', 'closed', 'form', 'we', 'employ', 'hadamard', 'renormalization', 'to', 'find', 'the', 'vacuum', 'expectation', 'values', 'the', 'thermal', 'feynman', 'greens', 'functions', 'are', 'constructed', 'from', 'the', 'vacuum', 'feynman', 'greens', 'functions', 'using', 'the', 'imaginary', 'time', 'periodicityantiperiodicity', 'property', 'for', 'scalarsfermions', 'focussing', 'on', 'massless', 'fields', 'with', 'either', 'conformal', 'or', 'minimal', 'coupling', 'to', 'the', 'spacetime', 'curvature', 'these', 'two', 'cases', 'being', 'the', 'same', 'for', 'fermions', 'we', 'compute', 'the', 'differences', 'between', 'the', 'thermal', 'and', 'vacuum', 'expectation', 'values', 'we', 'compare', 'the', 'resulting', 'energy', 'densities', 'pressures', 'and', 'pressure', 'deviators', 'with', 'the', 'corresponding', 'classical', 'quantities', 'calculated', 'using', 'relativistic', 'kinetic', 'theory']] | [-0.13397213903069496, 0.25135505658667534, -0.09940954729914665, 0.1202384000569582, -0.07883956453204155, -0.09286580468714237, -0.026682989723049104, 0.35871842182055114, -0.13686083707865326, -0.23645487590134143, 0.027102135185152292, -0.2751245447844267, -0.0940021055303514, 0.14109414543025195, 0.054741410866379736, 0.07593854294472839, -0.02167385275475681, 0.04314091305434704, -0.16046524189412595, -0.21193392134457828, 0.3916154792550951, 0.006822722512297332, 0.2826626994982362, 0.04772517039254308, 0.12192708486970515, 0.019430101903155444, 0.018537871293257922, 0.016280261880820036, -0.16049365228787066, 0.051278247840702534, 0.19698254234343768, 0.0227966204918921, 0.15863594546169044, -0.4302189297527075, -0.19014529497921467, 0.12674036433175206, 0.08411124126240611, 0.14337226547673346, -0.025843977585434913, -0.30285000286996366, 0.027171569809317588, -0.1262943101124838, -0.17989768608659507, -0.12304657528549433, -0.05484981888160109, -0.11691103058122099, -0.27304539374262093, 0.12537187129817903, -0.10826625600270927, -0.0024791127163916824, -0.10394336714595556, -0.1506496910005808, -0.06756225143373012, 0.07806415802799166, 0.10439164910279214, 0.0042099385713227095, 0.16045470591261982, -0.16023444139026105, -0.11954815776925534, 0.35070977537333964, -0.11534743959456682, -0.26731562804430725, 0.11959172364324332, -0.19485696589946747, -0.04227159528620541, 0.09599194536916912, 0.09133906898275018, 0.16932535088807343, -0.17282890927791594, 0.22720280110184105, 0.013553547194227576, 0.06703806783258914, 0.15700307516381146, 0.06683616557717323, 0.23438721378147603, -0.04902547869551927, -0.025399287399835886, 0.1716175542017445, 0.010423061449080706, -0.19076949513144792, -0.396600172765553, -0.19176213110983373, -0.17768022774159908, 0.12597723142430187, -0.18159183977101928, -0.26611430530250074, 0.3771727115418762, 0.1296582138062222, 0.1194532966837287, 0.08949579368531704, 0.2665363174416125, 0.18986610712110996, 0.0646872901879251, 0.12816373269632458, 0.26484942573308945, 0.17641325964778662, 0.1076497808797285, -0.26095403705211356, -0.11437215502932668, 0.15546496083959938] |
1,801.10367 | On a new type of divergence for spiky Wilson loops and related
entanglement entropies | We study the divergences of Wilson loops for a contour with a cusp of zero
opening angle, combined with a nonzero discontinuity of its curvature. The
analysis is performed in lowest order, both for weak and strong coupling. Such
a spike contributes a leading divergent term proportional to the inverse of the
square root of the cutoff times the jump of the curvature. As nextleading term
appears a logarithmic one in the supersymmetric case, but it is absent in QCD.
The strong coupling result, obtained from minimal surfaces in AdS via
holography, can be used also for applications to entanglement entropy in
(2+1)-dimensional CFT's.
| hep-th hep-ph | we study the divergences of wilson loops for a contour with a cusp of zero opening angle combined with a nonzero discontinuity of its curvature the analysis is performed in lowest order both for weak and strong coupling such a spike contributes a leading divergent term proportional to the inverse of the square root of the cutoff times the jump of the curvature as nextleading term appears a logarithmic one in the supersymmetric case but it is absent in qcd the strong coupling result obtained from minimal surfaces in ads via holography can be used also for applications to entanglement entropy in 21dimensional cfts | [['we', 'study', 'the', 'divergences', 'of', 'wilson', 'loops', 'for', 'a', 'contour', 'with', 'a', 'cusp', 'of', 'zero', 'opening', 'angle', 'combined', 'with', 'a', 'nonzero', 'discontinuity', 'of', 'its', 'curvature', 'the', 'analysis', 'is', 'performed', 'in', 'lowest', 'order', 'both', 'for', 'weak', 'and', 'strong', 'coupling', 'such', 'a', 'spike', 'contributes', 'a', 'leading', 'divergent', 'term', 'proportional', 'to', 'the', 'inverse', 'of', 'the', 'square', 'root', 'of', 'the', 'cutoff', 'times', 'the', 'jump', 'of', 'the', 'curvature', 'as', 'nextleading', 'term', 'appears', 'a', 'logarithmic', 'one', 'in', 'the', 'supersymmetric', 'case', 'but', 'it', 'is', 'absent', 'in', 'qcd', 'the', 'strong', 'coupling', 'result', 'obtained', 'from', 'minimal', 'surfaces', 'in', 'ads', 'via', 'holography', 'can', 'be', 'used', 'also', 'for', 'applications', 'to', 'entanglement', 'entropy', 'in', '21dimensional', 'cfts']] | [-0.1684687049598254, 0.14725104795518115, -0.08112588485416311, 0.11207649322414699, -0.05348056533302252, -0.14659522452767795, 0.011661061570731154, 0.3058433418493503, -0.2256832611747086, -0.21362446026446727, 0.11818893519431675, -0.33270716867767847, -0.13660483262859857, 0.15556001818577686, -0.007115766732917668, 0.06348899053801478, -0.007108591380529106, 0.08818647127526884, -0.10161605170175719, -0.18995283877638242, 0.31778007082847093, 0.05132098098021323, 0.23862937498667564, 0.14365688323428352, 0.1021257058656864, -0.014187908820951214, -0.0028118190989166927, 0.04734384514785443, -0.11986774983681524, 0.09304656047159089, 0.20174662152735087, -0.020804804194575317, 0.21081069452114976, -0.3800163154060451, -0.21103464842039663, 0.0969367387632911, 0.13750240460593396, 0.10566845435487966, -0.009837705657656234, -0.21808444060130008, 0.03506915868582347, -0.16298351581253184, -0.18442205619066954, -0.055447788671349724, -0.009407310307813952, -0.07606398117450926, -0.2810119272281344, 0.13690869066200462, 0.031192417059523556, 0.04253760966149947, -0.0013725007380484245, -0.06413493897595729, -0.039979078171129986, 0.11871677932616037, 0.15077468003773203, 0.09016029064122659, 0.08213083124204647, -0.19453668648538253, -0.10860774352197321, 0.3590529744173042, -0.15452667041524995, -0.197195643744915, 0.143510604214568, -0.17484903344526315, -0.09036045523736483, 0.15163703783449678, 0.13381460586634392, 0.1442432642008778, -0.10549213627998072, 0.14332360586167153, 0.019075582444202155, 0.14674640018851137, 0.10054131944735463, 0.02173548964604449, 0.2152437046259785, 0.08329780991278732, 0.07416153332227483, 0.20378778757451352, -0.08052584586682944, -0.11831276642176537, -0.40742539956520957, -0.16405500384728208, -0.18046177768309674, 0.07114781413446718, -0.1542132377820123, -0.20987641207802182, 0.38044557395523254, 0.0947191757732071, 0.21981911447381627, 0.06134964577638759, 0.23253001775950766, 0.16681048816714722, 0.15582324187450397, 0.04661934743993557, 0.26548805921069846, 0.14115257678517643, 0.10082978435093537, -0.27142852997684924, -0.019698920180627074, 0.11565377434285787] |
1,801.10368 | Generalized characters for glider representations of groups | Glider representations can be defined for a finite algebra filtration FKG
determined by a chain of subgroups 1 < G_1 < ... < G_d = G. In this paper we
develop the generalized character theory for such glider representations. We
give the generalization of Artin's theorem and define a generalized inproduct.
For finite abelian groups G with chain 1 < G, we explicitly calculate the
generalized character ring and compute its semisimple quotient. The papers ends
with a discussion of the quaternion group as a first non-abelian example.
| math.GR | glider representations can be defined for a finite algebra filtration fkg determined by a chain of subgroups 1 g_1 g_d g in this paper we develop the generalized character theory for such glider representations we give the generalization of artins theorem and define a generalized inproduct for finite abelian groups g with chain 1 g we explicitly calculate the generalized character ring and compute its semisimple quotient the papers ends with a discussion of the quaternion group as a first nonabelian example | [['glider', 'representations', 'can', 'be', 'defined', 'for', 'a', 'finite', 'algebra', 'filtration', 'fkg', 'determined', 'by', 'a', 'chain', 'of', 'subgroups', '1', 'g_1', 'g_d', 'g', 'in', 'this', 'paper', 'we', 'develop', 'the', 'generalized', 'character', 'theory', 'for', 'such', 'glider', 'representations', 'we', 'give', 'the', 'generalization', 'of', 'artins', 'theorem', 'and', 'define', 'a', 'generalized', 'inproduct', 'for', 'finite', 'abelian', 'groups', 'g', 'with', 'chain', '1', 'g', 'we', 'explicitly', 'calculate', 'the', 'generalized', 'character', 'ring', 'and', 'compute', 'its', 'semisimple', 'quotient', 'the', 'papers', 'ends', 'with', 'a', 'discussion', 'of', 'the', 'quaternion', 'group', 'as', 'a', 'first', 'nonabelian', 'example']] | [-0.17633880485700051, 0.1425423455528087, -0.12798352019838344, 0.07736744635514226, -0.13929607989381493, -0.13557423788042347, -0.010152684001505007, 0.3402184653843259, -0.34074004160033333, -0.2085660539659453, 0.10402006694880303, -0.20393812135551814, -0.14434664865472802, 0.1616462948674589, -0.09802678609726789, -0.0997172834956731, 0.05085336573904863, 0.15706819185504206, -0.09089647835683952, -0.24992090978740175, 0.34718606819364206, -0.05137847236179413, 0.2386173226174979, 0.036545046122261775, 0.13073322199354018, 0.0519438128484367, -0.026973595779481125, -0.018098172450001226, -0.18472933467983463, 0.11599022937495905, 0.31800481035477585, 0.02365554467326513, 0.21952647134017797, -0.3614175299435486, -0.14935248650403488, 0.21376651436802616, 0.13133300359671315, 0.014550954252941372, -0.027524642646312714, -0.29563273884999897, 0.15108890773406553, -0.31408928360008165, -0.17817405541714879, -0.08938320476078877, 0.07376171495581482, 0.0014053447470988756, -0.22305308398503212, 0.008824123633036644, 0.09429640752941738, 0.1458129196862164, -0.020012401666687687, -0.09593489251019043, -0.013924043059326064, 0.10554349391985639, -0.049340004469325516, 0.006727885707844923, 0.07926705485945683, -0.067295422507335, -0.15616310421840207, 0.41369576407251535, -0.10848501025710577, -0.228962610229594, 0.07607723920847531, -0.12034768120954847, -0.18589194513351462, 0.03893005022388182, 0.09243264088384164, 0.15717680614303658, -0.020273442334139052, 0.17613901801976478, -0.13542808816526775, 0.022336691304650387, 0.06269902693406668, -0.05421280989676346, 0.12297072083355835, 0.09538263801404816, 0.033470836497144774, 0.18417572535798643, 0.06280139977411356, 0.040971077564689845, -0.3841632985866364, -0.1999346658323006, -0.14887099305489732, 0.13135955522388773, -0.09937496016191515, -0.18740636741822977, 0.45063238041360437, 0.054094551880665184, 0.12079380803316096, 0.13830021504933634, 0.17880940172148663, 0.10543418132533308, 0.05418326982791409, 0.0631769415979952, 0.021470569539815187, 0.2748848295074968, -0.11048366055812364, -0.14968786092135872, -0.08645601333176464, 0.2394149163507937] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.