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,803.08667
|
On efficient global optimization via universal Kriging surrogate models
|
In this paper, we investigate the capability of the universal Kriging (UK)
model for single-objective global optimization applied within an efficient
global optimization (EGO) framework. We implemented this combined UK-EGO
framework and studied four variants of the UK methods, that is, a UK with a
first-order polynomial, a UK with a second-order polynomial, a blind Kriging
(BK) implementation from the ooDACE toolbox, and a polynomial-chaos Kriging
(PCK) implementation. The UK-EGO framework with automatic trend function
selection derived from the BK and PCK models works by building a UK surrogate
model and then performing optimizations via expected improvement criteria on
the Kriging model with the lowest leave-one-out cross-validation error. Next,
we studied and compared the UK-EGO variants and standard EGO using five
synthetic test functions and one aerodynamic problem. Our results show that the
proper choice for the trend function through automatic feature selection can
improve the optimization performance of UK-EGO relative to EGO. From our
results, we found that PCK-EGO was the best variant, as it had more robust
performance as compared to the rest of the UK-EGO schemes; however, total-order
expansion should be used to generate the candidate trend function set for
high-dimensional problems. Note that, for some test functions, the UK with
predetermined polynomial trend functions performed better than that of BK and
PCK, indicating that the use of automatic trend function selection does not
always lead to the best quality solutions. We also found that although some
variants of UK are not as globally accurate as the ordinary Kriging (OK), they
can still identify better-optimized solutions due to the addition of the trend
function, which helps the optimizer locate the global optimum.
|
stat.ML
|
in this paper we investigate the capability of the universal kriging uk model for singleobjective global optimization applied within an efficient global optimization ego framework we implemented this combined ukego framework and studied four variants of the uk methods that is a uk with a firstorder polynomial a uk with a secondorder polynomial a blind kriging bk implementation from the oodace toolbox and a polynomialchaos kriging pck implementation the ukego framework with automatic trend function selection derived from the bk and pck models works by building a uk surrogate model and then performing optimizations via expected improvement criteria on the kriging model with the lowest leaveoneout crossvalidation error next we studied and compared the ukego variants and standard ego using five synthetic test functions and one aerodynamic problem our results show that the proper choice for the trend function through automatic feature selection can improve the optimization performance of ukego relative to ego from our results we found that pckego was the best variant as it had more robust performance as compared to the rest of the ukego schemes however totalorder expansion should be used to generate the candidate trend function set for highdimensional problems note that for some test functions the uk with predetermined polynomial trend functions performed better than that of bk and pck indicating that the use of automatic trend function selection does not always lead to the best quality solutions we also found that although some variants of uk are not as globally accurate as the ordinary kriging ok they can still identify betteroptimized solutions due to the addition of the trend function which helps the optimizer locate the global optimum
|
[['in', 'this', 'paper', 'we', 'investigate', 'the', 'capability', 'of', 'the', 'universal', 'kriging', 'uk', 'model', 'for', 'singleobjective', 'global', 'optimization', 'applied', 'within', 'an', 'efficient', 'global', 'optimization', 'ego', 'framework', 'we', 'implemented', 'this', 'combined', 'ukego', 'framework', 'and', 'studied', 'four', 'variants', 'of', 'the', 'uk', 'methods', 'that', 'is', 'a', 'uk', 'with', 'a', 'firstorder', 'polynomial', 'a', 'uk', 'with', 'a', 'secondorder', 'polynomial', 'a', 'blind', 'kriging', 'bk', 'implementation', 'from', 'the', 'oodace', 'toolbox', 'and', 'a', 'polynomialchaos', 'kriging', 'pck', 'implementation', 'the', 'ukego', 'framework', 'with', 'automatic', 'trend', 'function', 'selection', 'derived', 'from', 'the', 'bk', 'and', 'pck', 'models', 'works', 'by', 'building', 'a', 'uk', 'surrogate', 'model', 'and', 'then', 'performing', 'optimizations', 'via', 'expected', 'improvement', 'criteria', 'on', 'the', 'kriging', 'model', 'with', 'the', 'lowest', 'leaveoneout', 'crossvalidation', 'error', 'next', 'we', 'studied', 'and', 'compared', 'the', 'ukego', 'variants', 'and', 'standard', 'ego', 'using', 'five', 'synthetic', 'test', 'functions', 'and', 'one', 'aerodynamic', 'problem', 'our', 'results', 'show', 'that', 'the', 'proper', 'choice', 'for', 'the', 'trend', 'function', 'through', 'automatic', 'feature', 'selection', 'can', 'improve', 'the', 'optimization', 'performance', 'of', 'ukego', 'relative', 'to', 'ego', 'from', 'our', 'results', 'we', 'found', 'that', 'pckego', 'was', 'the', 'best', 'variant', 'as', 'it', 'had', 'more', 'robust', 'performance', 'as', 'compared', 'to', 'the', 'rest', 'of', 'the', 'ukego', 'schemes', 'however', 'totalorder', 'expansion', 'should', 'be', 'used', 'to', 'generate', 'the', 'candidate', 'trend', 'function', 'set', 'for', 'highdimensional', 'problems', 'note', 'that', 'for', 'some', 'test', 'functions', 'the', 'uk', 'with', 'predetermined', 'polynomial', 'trend', 'functions', 'performed', 'better', 'than', 'that', 'of', 'bk', 'and', 'pck', 'indicating', 'that', 'the', 'use', 'of', 'automatic', 'trend', 'function', 'selection', 'does', 'not', 'always', 'lead', 'to', 'the', 'best', 'quality', 'solutions', 'we', 'also', 'found', 'that', 'although', 'some', 'variants', 'of', 'uk', 'are', 'not', 'as', 'globally', 'accurate', 'as', 'the', 'ordinary', 'kriging', 'ok', 'they', 'can', 'still', 'identify', 'betteroptimized', 'solutions', 'due', 'to', 'the', 'addition', 'of', 'the', 'trend', 'function', 'which', 'helps', 'the', 'optimizer', 'locate', 'the', 'global', 'optimum']]
|
[-0.01298167381213971, -0.037018114189233724, -0.10555435504551249, 0.10436070573772217, -0.07030341914095452, -0.1351062082135672, 0.06828467981121761, 0.3944242294633768, -0.24093623799563993, -0.31111752950479843, 0.1340956547245129, -0.24136703423949515, -0.17823456005129715, 0.21644575501331625, -0.05440019801812336, 0.10944643995219436, 0.057503349097906116, -0.005111404316589181, -0.08450104288528743, -0.3000309924815001, 0.2528568799822244, 0.07086938620365407, 0.31297925241442737, -0.009170663204914857, 0.08951608243233411, -0.013010208805115735, -0.04611223044794919, 0.029006790036397445, -0.09535222961721453, 0.11417898514915457, 0.25837483371469044, 0.18073771583651815, 0.3185745479532163, -0.36859347874030635, -0.1751022267634757, 0.13335630202810264, 0.14578506355156703, 0.0731977232593555, -0.03295119577956281, -0.23884116809100353, 0.08800348004702534, -0.1781970449138864, -0.09817301301539934, -0.11129511815579127, -0.02996992395599665, 0.035327931832327984, -0.3209266335775601, 0.03968877376242355, 0.017364433800894637, 0.05110876338308973, -0.06014610591904704, -0.16606356267648925, -0.0077289461722679954, 0.10791192742105835, 0.042608641615099654, 0.09733851346946785, 0.11695609525287681, -0.1220867220315364, -0.13601246472049464, 0.3798897259480344, -0.1006428431988564, -0.21279920717852527, 0.180771540051388, -0.0831348261679093, -0.1462066811887458, 0.0848813223570063, 0.16536638188876926, 0.11639438059552129, -0.15685087499102213, 0.036434498333760515, -0.046193108874814745, 0.2000267438743456, 0.03449966890369697, -0.023351651449718708, 0.1202173964631644, 0.16480811433505776, 0.08141383456368673, 0.128996205644603, -0.07524549439390503, -0.09890637151223378, -0.26744665108566135, -0.11355256242199666, -0.13160767402187182, -0.05211406848120599, -0.0992472902970471, -0.1449501538787525, 0.4055300773812176, 0.16899688845514096, 0.15600296655649187, 0.10977015607411254, 0.31505311148522963, 0.10404572064600193, 0.10577746034833477, 0.10069723094631385, 0.2208647285564459, 0.055008425220943354, 0.09659076959059687, -0.20744771016950675, 0.09517257508041674, 0.06339567355301258]
|
1,803.08668
|
Proceedings Third Workshop on Models for Formal Analysis of Real Systems
and Sixth International Workshop on Verification and Program Transformation
|
This volume contains the joint proceedings of MARS 2018, the third workshop
on Models for Formal Analysis of Real Systems, and VPT 2018, the sixth
international workshop on Verification and Program Transformation, held
together on April 20, 2018 in Thessaloniki, Greece, as part of ETAPS 2018, the
European Joint Conferences on Theory and Practice of Software.
MARS emphasises modelling over verification. It aims at discussing the
lessons learned from making formal methods for the verification and analysis of
realistic systems. Examples are:
(1) Which formalism is chosen, and why?
(2) Which abstractions have to be made and why?
(3) How are important characteristics of the system modelled?
(4) Were there any complications while modelling the system?
(5) Which measures were taken to guarantee the accuracy of the model?
We invited papers that present full models of real systems, which may lay the
basis for future comparison and analysis. An aim of the workshop is to present
different modelling approaches and discuss pros and cons for each of them.
Alternative formal descriptions of the systems presented at this workshop are
encouraged, which should foster the development of improved specification
formalisms.
VPT aims to provide a forum where people from the areas of program
transformation and program verification can fruitfully exchange ideas and gain
a deeper understanding of the interactions between those two fields. These
interactions have been beneficial in both directions. On the one hand, methods
and tools developed in the field of program transformation, such as partial
deduction, partial evaluation, fold/unfold transformations, and
supercompilation, are applied with success to verification, in particular to
the verification of infinite state and parameterized systems. On the other
hand, methods developed in program verification, such as model checking,
abstract interpretation, SAT and SMT solving, and automated theorem proving,
are used to enhance program transformation techniques, thereby making these
techniques more powerful and useful in practice.
|
cs.LO cs.FL cs.PL
|
this volume contains the joint proceedings of mars 2018 the third workshop on models for formal analysis of real systems and vpt 2018 the sixth international workshop on verification and program transformation held together on april 20 2018 in thessaloniki greece as part of etaps 2018 the european joint conferences on theory and practice of software mars emphasises modelling over verification it aims at discussing the lessons learned from making formal methods for the verification and analysis of realistic systems examples are 1 which formalism is chosen and why 2 which abstractions have to be made and why 3 how are important characteristics of the system modelled 4 were there any complications while modelling the system 5 which measures were taken to guarantee the accuracy of the model we invited papers that present full models of real systems which may lay the basis for future comparison and analysis an aim of the workshop is to present different modelling approaches and discuss pros and cons for each of them alternative formal descriptions of the systems presented at this workshop are encouraged which should foster the development of improved specification formalisms vpt aims to provide a forum where people from the areas of program transformation and program verification can fruitfully exchange ideas and gain a deeper understanding of the interactions between those two fields these interactions have been beneficial in both directions on the one hand methods and tools developed in the field of program transformation such as partial deduction partial evaluation foldunfold transformations and supercompilation are applied with success to verification in particular to the verification of infinite state and parameterized systems on the other hand methods developed in program verification such as model checking abstract interpretation sat and smt solving and automated theorem proving are used to enhance program transformation techniques thereby making these techniques more powerful and useful in practice
|
[['this', 'volume', 'contains', 'the', 'joint', 'proceedings', 'of', 'mars', '2018', 'the', 'third', 'workshop', 'on', 'models', 'for', 'formal', 'analysis', 'of', 'real', 'systems', 'and', 'vpt', '2018', 'the', 'sixth', 'international', 'workshop', 'on', 'verification', 'and', 'program', 'transformation', 'held', 'together', 'on', 'april', '20', '2018', 'in', 'thessaloniki', 'greece', 'as', 'part', 'of', 'etaps', '2018', 'the', 'european', 'joint', 'conferences', 'on', 'theory', 'and', 'practice', 'of', 'software', 'mars', 'emphasises', 'modelling', 'over', 'verification', 'it', 'aims', 'at', 'discussing', 'the', 'lessons', 'learned', 'from', 'making', 'formal', 'methods', 'for', 'the', 'verification', 'and', 'analysis', 'of', 'realistic', 'systems', 'examples', 'are', '1', 'which', 'formalism', 'is', 'chosen', 'and', 'why', '2', 'which', 'abstractions', 'have', 'to', 'be', 'made', 'and', 'why', '3', 'how', 'are', 'important', 'characteristics', 'of', 'the', 'system', 'modelled', '4', 'were', 'there', 'any', 'complications', 'while', 'modelling', 'the', 'system', '5', 'which', 'measures', 'were', 'taken', 'to', 'guarantee', 'the', 'accuracy', 'of', 'the', 'model', 'we', 'invited', 'papers', 'that', 'present', 'full', 'models', 'of', 'real', 'systems', 'which', 'may', 'lay', 'the', 'basis', 'for', 'future', 'comparison', 'and', 'analysis', 'an', 'aim', 'of', 'the', 'workshop', 'is', 'to', 'present', 'different', 'modelling', 'approaches', 'and', 'discuss', 'pros', 'and', 'cons', 'for', 'each', 'of', 'them', 'alternative', 'formal', 'descriptions', 'of', 'the', 'systems', 'presented', 'at', 'this', 'workshop', 'are', 'encouraged', 'which', 'should', 'foster', 'the', 'development', 'of', 'improved', 'specification', 'formalisms', 'vpt', 'aims', 'to', 'provide', 'a', 'forum', 'where', 'people', 'from', 'the', 'areas', 'of', 'program', 'transformation', 'and', 'program', 'verification', 'can', 'fruitfully', 'exchange', 'ideas', 'and', 'gain', 'a', 'deeper', 'understanding', 'of', 'the', 'interactions', 'between', 'those', 'two', 'fields', 'these', 'interactions', 'have', 'been', 'beneficial', 'in', 'both', 'directions', 'on', 'the', 'one', 'hand', 'methods', 'and', 'tools', 'developed', 'in', 'the', 'field', 'of', 'program', 'transformation', 'such', 'as', 'partial', 'deduction', 'partial', 'evaluation', 'foldunfold', 'transformations', 'and', 'supercompilation', 'are', 'applied', 'with', 'success', 'to', 'verification', 'in', 'particular', 'to', 'the', 'verification', 'of', 'infinite', 'state', 'and', 'parameterized', 'systems', 'on', 'the', 'other', 'hand', 'methods', 'developed', 'in', 'program', 'verification', 'such', 'as', 'model', 'checking', 'abstract', 'interpretation', 'sat', 'and', 'smt', 'solving', 'and', 'automated', 'theorem', 'proving', 'are', 'used', 'to', 'enhance', 'program', 'transformation', 'techniques', 'thereby', 'making', 'these', 'techniques', 'more', 'powerful', 'and', 'useful', 'in', 'practice']]
|
[-0.06862787529189811, 0.016186060652915776, -0.11775705776397451, 0.07115823638676351, -0.0998921984180784, -0.14475244566366988, 0.027341418179860816, 0.3405547088874546, -0.22129764607763128, -0.3793075758966818, 0.17846269206850643, -0.28108508833699003, -0.14599115687865655, 0.2194514250213586, -0.059681020418056244, 0.0741414233377365, 0.08581709272866032, -0.011807157451319104, -0.06186544759291856, -0.29140519828556577, 0.2807208218774983, 0.07379457116474389, 0.2830536809665304, 0.05931671294443597, 0.07915919911194222, 0.04358847978037492, -0.10282472573771738, 0.00013998624403778332, -0.08863803924069687, 0.15832905165650477, 0.3495043564921777, 0.21457788191168267, 0.29424735892809617, -0.44341559608098585, -0.1577547757446143, 0.0252286254647682, 0.07987553024158432, 0.08166782977396377, -0.0012890607101481162, -0.3160621840566684, 0.030940553276175245, -0.19084165162343975, -0.09114667924474386, -0.10444676043455252, 0.029723044015074872, 0.019806759210918817, -0.2022866473632035, -0.029599358578157535, 0.09640362310478572, 0.1397141030064254, -0.04062911858437793, -0.1508204152746204, -0.004478696567886823, 0.16776279200382577, 0.041951509726748853, 0.03496319320093289, 0.09655332322969098, -0.10100743421673448, -0.15637956386906696, 0.397624180098199, -0.011089600729711139, -0.12303788843040633, 0.24619926982319695, -0.07457576290303032, -0.21768453242137453, 0.060695841653913354, 0.22974174170248762, 0.08320171951534903, -0.16451993081089816, 0.0708058467312638, 0.039242140041406706, 0.1965224728125995, 0.04134320685568107, -0.03560748459865606, 0.2394596044561104, 0.17132943706554016, -0.0030303050039958966, 0.081639752158419, 0.001886664324427335, -0.09754135784875734, -0.30752700292640084, -0.14611530061084316, -0.09084291719478536, -0.04685545809322914, -0.005541328766143288, -0.1004701170806812, 0.3618703357414178, 0.20012551623245348, 0.0996960995245689, 0.022273887693357933, 0.29290181781701335, 0.09363296376788312, 0.05336489597293533, 0.04325389358517489, 0.21400594836927447, 0.09692872890609637, 0.13727773033165586, -0.14560962257041354, 0.06283564583122898, 0.08326972785354907]
|
1,803.08669
|
Pyramid Stereo Matching Network
|
Recent work has shown that depth estimation from a stereo pair of images can
be formulated as a supervised learning task to be resolved with convolutional
neural networks (CNNs). However, current architectures rely on patch-based
Siamese networks, lacking the means to exploit context information for finding
correspondence in illposed regions. To tackle this problem, we propose PSMNet,
a pyramid stereo matching network consisting of two main modules: spatial
pyramid pooling and 3D CNN. The spatial pyramid pooling module takes advantage
of the capacity of global context information by aggregating context in
different scales and locations to form a cost volume. The 3D CNN learns to
regularize cost volume using stacked multiple hourglass networks in conjunction
with intermediate supervision. The proposed approach was evaluated on several
benchmark datasets. Our method ranked first in the KITTI 2012 and 2015
leaderboards before March 18, 2018. The codes of PSMNet are available at:
https://github.com/JiaRenChang/PSMNet.
|
cs.CV
|
recent work has shown that depth estimation from a stereo pair of images can be formulated as a supervised learning task to be resolved with convolutional neural networks cnns however current architectures rely on patchbased siamese networks lacking the means to exploit context information for finding correspondence in illposed regions to tackle this problem we propose psmnet a pyramid stereo matching network consisting of two main modules spatial pyramid pooling and 3d cnn the spatial pyramid pooling module takes advantage of the capacity of global context information by aggregating context in different scales and locations to form a cost volume the 3d cnn learns to regularize cost volume using stacked multiple hourglass networks in conjunction with intermediate supervision the proposed approach was evaluated on several benchmark datasets our method ranked first in the kitti 2012 and 2015 leaderboards before march 18 2018 the codes of psmnet are available at httpsgithubcomjiarenchangpsmnet
|
[['recent', 'work', 'has', 'shown', 'that', 'depth', 'estimation', 'from', 'a', 'stereo', 'pair', 'of', 'images', 'can', 'be', 'formulated', 'as', 'a', 'supervised', 'learning', 'task', 'to', 'be', 'resolved', 'with', 'convolutional', 'neural', 'networks', 'cnns', 'however', 'current', 'architectures', 'rely', 'on', 'patchbased', 'siamese', 'networks', 'lacking', 'the', 'means', 'to', 'exploit', 'context', 'information', 'for', 'finding', 'correspondence', 'in', 'illposed', 'regions', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'psmnet', 'a', 'pyramid', 'stereo', 'matching', 'network', 'consisting', 'of', 'two', 'main', 'modules', 'spatial', 'pyramid', 'pooling', 'and', '3d', 'cnn', 'the', 'spatial', 'pyramid', 'pooling', 'module', 'takes', 'advantage', 'of', 'the', 'capacity', 'of', 'global', 'context', 'information', 'by', 'aggregating', 'context', 'in', 'different', 'scales', 'and', 'locations', 'to', 'form', 'a', 'cost', 'volume', 'the', '3d', 'cnn', 'learns', 'to', 'regularize', 'cost', 'volume', 'using', 'stacked', 'multiple', 'hourglass', 'networks', 'in', 'conjunction', 'with', 'intermediate', 'supervision', 'the', 'proposed', 'approach', 'was', 'evaluated', 'on', 'several', 'benchmark', 'datasets', 'our', 'method', 'ranked', 'first', 'in', 'the', 'kitti', '2012', 'and', '2015', 'leaderboards', 'before', 'march', '18', '2018', 'the', 'codes', 'of', 'psmnet', 'are', 'available', 'at', 'httpsgithubcomjiarenchangpsmnet']]
|
[-0.04482917817563712, -0.046139027650917874, -0.03996709996175502, 0.05577350957287463, -0.08365189302934423, -0.1818120595127927, -0.03272352102814483, 0.47445526597451193, -0.28309505905157756, -0.3536704931357483, 0.08433325790489714, -0.25605365173371675, -0.20873077745473353, 0.12795272483023162, -0.16204028970999074, 0.10997195753227716, 0.1687799507362426, 0.010907997884059033, -0.07870151803281941, -0.31001149433455905, 0.32188038123283713, 0.06854813540240332, 0.37549765794506285, 0.0023504957496537035, 0.16972962091122532, -0.032122986357925196, -0.056497442019710534, 0.010935854425710835, -0.03234027439696108, 0.19790108509117826, 0.30348855461196683, 0.15586141433303885, 0.318253691004095, -0.459032808911993, -0.24694324242185522, 0.06509773068915621, 0.1461584922971622, 0.0875112127543777, 0.0030883770383780406, -0.35713650368559524, 0.061417288099396596, -0.16224560967082677, 0.06671134858601252, -0.09899220893438272, -0.04288712795427842, -0.059206431735541395, -0.3132885009886659, 0.05631532124718841, 0.021806990403086455, 0.05749754352672469, -0.0510090955067426, -0.09812028855275438, -0.015130688342880332, 0.185415595437267, -0.04407460402244334, 0.08209674893862562, 0.10327242206873968, -0.18639523994500692, -0.1493266763634422, 0.30636100706701375, -0.0324552010611764, -0.17127212872538639, 0.17364849847088865, -0.037303015732263425, -0.16874467229255202, 0.09996162736344905, 0.24794753794843444, 0.10369052453486084, -0.16931283678289274, 0.012052811791908096, -0.09109457160922743, 0.18385164507785115, 0.11916238230139929, -0.002436840479091114, 0.20275192834645966, 0.2986371449898092, 0.031495962960354125, 0.14066378154307224, -0.22477038798665272, -0.057713430514242374, -0.18302530661220567, -0.07719269832659538, -0.23697609876339532, -0.07400692167032992, -0.0878663181386085, -0.10802036498536255, 0.4062794577567933, 0.21857607404885143, 0.2479744364030748, 0.11971598709014808, 0.3479093935619406, 0.0013560042146365254, 0.17431629149458644, 0.11325474080849807, 0.19684619032366035, 0.024636686952201788, 0.1681300287933222, -0.11022361966093913, 0.0340769600137422, 0.16066660347305947]
|
1,803.0867
|
Object Detection for Comics using Manga109 Annotations
|
With the growth of digitized comics, image understanding techniques are
becoming important. In this paper, we focus on object detection, which is a
fundamental task of image understanding. Although convolutional neural networks
(CNN)-based methods archived good performance in object detection for
naturalistic images, there are two problems in applying these methods to the
comic object detection task. First, there is no large-scale annotated comics
dataset. The CNN-based methods require large-scale annotations for training.
Secondly, the objects in comics are highly overlapped compared to naturalistic
images. This overlap causes the assignment problem in the existing CNN-based
methods. To solve these problems, we proposed a new annotation dataset and a
new CNN model. We annotated an existing image dataset of comics and created the
largest annotation dataset, named Manga109-annotations. For the assignment
problem, we proposed a new CNN-based detector, SSD300-fork. We compared
SSD300-fork with other detection methods using Manga109-annotations and
confirmed that our model outperformed them based on the mAP score.
|
cs.CV cs.MM
|
with the growth of digitized comics image understanding techniques are becoming important in this paper we focus on object detection which is a fundamental task of image understanding although convolutional neural networks cnnbased methods archived good performance in object detection for naturalistic images there are two problems in applying these methods to the comic object detection task first there is no largescale annotated comics dataset the cnnbased methods require largescale annotations for training secondly the objects in comics are highly overlapped compared to naturalistic images this overlap causes the assignment problem in the existing cnnbased methods to solve these problems we proposed a new annotation dataset and a new cnn model we annotated an existing image dataset of comics and created the largest annotation dataset named manga109annotations for the assignment problem we proposed a new cnnbased detector ssd300fork we compared ssd300fork with other detection methods using manga109annotations and confirmed that our model outperformed them based on the map score
|
[['with', 'the', 'growth', 'of', 'digitized', 'comics', 'image', 'understanding', 'techniques', 'are', 'becoming', 'important', 'in', 'this', 'paper', 'we', 'focus', 'on', 'object', 'detection', 'which', 'is', 'a', 'fundamental', 'task', 'of', 'image', 'understanding', 'although', 'convolutional', 'neural', 'networks', 'cnnbased', 'methods', 'archived', 'good', 'performance', 'in', 'object', 'detection', 'for', 'naturalistic', 'images', 'there', 'are', 'two', 'problems', 'in', 'applying', 'these', 'methods', 'to', 'the', 'comic', 'object', 'detection', 'task', 'first', 'there', 'is', 'no', 'largescale', 'annotated', 'comics', 'dataset', 'the', 'cnnbased', 'methods', 'require', 'largescale', 'annotations', 'for', 'training', 'secondly', 'the', 'objects', 'in', 'comics', 'are', 'highly', 'overlapped', 'compared', 'to', 'naturalistic', 'images', 'this', 'overlap', 'causes', 'the', 'assignment', 'problem', 'in', 'the', 'existing', 'cnnbased', 'methods', 'to', 'solve', 'these', 'problems', 'we', 'proposed', 'a', 'new', 'annotation', 'dataset', 'and', 'a', 'new', 'cnn', 'model', 'we', 'annotated', 'an', 'existing', 'image', 'dataset', 'of', 'comics', 'and', 'created', 'the', 'largest', 'annotation', 'dataset', 'named', 'manga109annotations', 'for', 'the', 'assignment', 'problem', 'we', 'proposed', 'a', 'new', 'cnnbased', 'detector', 'ssd300fork', 'we', 'compared', 'ssd300fork', 'with', 'other', 'detection', 'methods', 'using', 'manga109annotations', 'and', 'confirmed', 'that', 'our', 'model', 'outperformed', 'them', 'based', 'on', 'the', 'map', 'score']]
|
[-0.0413095400503446, -0.08166575533583866, -0.0397282765937909, 0.0710543138583401, -0.12213094375667072, -0.17084413275362983, -0.015842352440250257, 0.48744934739304646, -0.19568835807243182, -0.37077644659026016, 0.08992960407744131, -0.3222894092803941, -0.1594349259044975, 0.23661553021069737, -0.17867203112391214, 0.10811603740730788, 0.21818381196128264, 0.04664016367807504, -0.04579280409811726, -0.28882575147454775, 0.30524767155068055, 0.02853512612712239, 0.3536108772841192, 0.004245735704523301, 0.13634359947135372, -0.08250281707714162, -0.09968987883579346, 0.00497983185153815, -0.04532504942321647, 0.20553746165617579, 0.3418984448402039, 0.22146214061987496, 0.3034382253795141, -0.40119606008933434, -0.19212604044606127, 0.09535880648801404, 0.14774159403638012, 0.12418824264464239, -0.08357270410990403, -0.4071239454491484, 0.09434014886407362, -0.1358179978725891, 0.07901205469764049, -0.09759155451770751, -0.01744723296423833, -0.07873851801982269, -0.25874852309183727, 0.05809694868362238, 0.045435597543274205, 0.10482250758627008, -0.09239839103914076, -0.11464041177664072, 0.06742439086909496, 0.17734804375908308, 0.022446719576574622, 0.07335467868514599, 0.11807960534107781, -0.2535414816961894, -0.1599225101271464, 0.3665890934126031, -0.037039661233223255, -0.20663554241219836, 0.21987779605082206, -0.0019609942761880735, -0.20270601168214794, 0.13015286066238918, 0.2186282968328845, 0.1719609449587522, -0.16382066641723916, -0.042729645442863506, -0.07757603183028199, 0.21846716968763258, 0.0460466212412763, -0.04109705850076411, 0.178505969776081, 0.3100394506322881, 0.0033522936785894057, 0.1381925488089872, -0.1940834689207775, 0.006364540004682157, -0.179430813095983, -0.08159685397009936, -0.19023769481648362, -0.06382945055712856, -0.05191170752861522, -0.16123859140901797, 0.3992713571015385, 0.2980650801662236, 0.16531783090603927, 0.0697280541175015, 0.379381664818333, -0.018695104818400598, 0.15163266087258837, 0.08346121109225937, 0.19294150177644745, -0.033340067227160736, 0.13032940427712617, -0.13435919291354836, 0.05139398888774937, 0.08911280528371854]
|
1,803.08671
|
Nonparametric inference on L\'evy measures of compound Poisson-driven
Ornstein-Uhlenbeck processes under macroscopic discrete observations
|
This study examines a nonparametric inference on a stationary L\'evy-driven
Ornstein-Uhlenbeck (OU) process $X = (X_{t})_{t \geq 0}$ with a compound
Poisson subordinator. We propose a new spectral estimator for the L\'evy
measure of the L\'evy-driven OU process $X$ under macroscopic observations. We
also derive, for the estimator, multivariate central limit theorems over a
finite number of design points, and high-dimensional central limit theorems in
the case wherein the number of design points increases with an increase in the
sample size. Built on these asymptotic results, we develop methods to construct
confidence bands for the L\'evy measure and propose a practical method for
bandwidth selection.
|
stat.ME
|
this study examines a nonparametric inference on a stationary levydriven ornsteinuhlenbeck ou process x x_t_t geq 0 with a compound poisson subordinator we propose a new spectral estimator for the levy measure of the levydriven ou process x under macroscopic observations we also derive for the estimator multivariate central limit theorems over a finite number of design points and highdimensional central limit theorems in the case wherein the number of design points increases with an increase in the sample size built on these asymptotic results we develop methods to construct confidence bands for the levy measure and propose a practical method for bandwidth selection
|
[['this', 'study', 'examines', 'a', 'nonparametric', 'inference', 'on', 'a', 'stationary', 'levydriven', 'ornsteinuhlenbeck', 'ou', 'process', 'x', 'x_t_t', 'geq', '0', 'with', 'a', 'compound', 'poisson', 'subordinator', 'we', 'propose', 'a', 'new', 'spectral', 'estimator', 'for', 'the', 'levy', 'measure', 'of', 'the', 'levydriven', 'ou', 'process', 'x', 'under', 'macroscopic', 'observations', 'we', 'also', 'derive', 'for', 'the', 'estimator', 'multivariate', 'central', 'limit', 'theorems', 'over', 'a', 'finite', 'number', 'of', 'design', 'points', 'and', 'highdimensional', 'central', 'limit', 'theorems', 'in', 'the', 'case', 'wherein', 'the', 'number', 'of', 'design', 'points', 'increases', 'with', 'an', 'increase', 'in', 'the', 'sample', 'size', 'built', 'on', 'these', 'asymptotic', 'results', 'we', 'develop', 'methods', 'to', 'construct', 'confidence', 'bands', 'for', 'the', 'levy', 'measure', 'and', 'propose', 'a', 'practical', 'method', 'for', 'bandwidth', 'selection']]
|
[-0.07516449708670664, 0.054345032296623685, -0.10548122360174042, 0.06063181765466652, -0.018999486785525314, -0.15712249192158476, 0.12538265374202567, 0.3799543078415669, -0.2551039557415956, -0.19945567077509344, 0.11832020217955758, -0.2521448716154107, -0.11195422069599423, 0.1867313600221398, -0.1414983720258953, 0.07278957955825788, 0.015111196293638876, -0.007462131880367031, -0.023826354201166675, -0.2145743568745764, 0.2968269102700735, 0.03921934899587471, 0.2945847556312891, -0.0787622414181197, 0.168171970068495, 0.05890254419780551, -0.05917021722528331, -0.06659948106747694, -0.220037147277393, 0.10031562315550847, 0.2839147173262273, 0.0783269551063243, 0.35508477746938855, -0.31217523890763216, -0.19419507884707016, 0.17182762256393638, 0.13019187906936097, 0.03657015667032773, -0.016120829475067485, -0.2910611697992023, 0.07907406387564081, -0.15295825454058315, -0.18278454501146021, -0.07844711044610729, 0.023451896948524967, 0.053030201249594726, -0.36318657568727547, 0.08449682075941102, 0.11676086863287939, 0.04836789918436597, -0.027395866453074492, -0.1512536842805835, 0.03329905334304875, 0.017184142399436005, 0.037749207201928724, -0.05254386612796225, 0.13402311111209342, -0.045894204708299816, -0.14527627336792648, 0.2555154611517747, -0.10194912788798459, -0.24564989695612055, 0.14216948234332868, -0.18865841701447678, -0.20808891396070697, 0.1246527341248181, 0.2378681139447368, 0.13421003981672514, -0.16415265623072628, 0.1297992239202498, -0.02650372971458217, 0.11502214936682811, 0.05513640706731866, 0.00848469774847707, 0.15209194889757782, 0.22459202700366193, 0.14215101937476832, 0.16737240202368972, -0.16750389791111678, -0.08918008674831632, -0.33940131826182973, -0.17906665514545658, -0.19138936447696045, 0.10802085475118545, -0.20030452469514926, -0.2324885220016138, 0.3141095812360828, 0.16697864425637257, 0.198258166868562, 0.15705936746850896, 0.20092367040566528, 0.18483755056065723, -0.09151303366748974, 0.09247917878495243, 0.07505319632876378, 0.16625521032703824, 0.09133169512027123, -0.13330650771072564, 0.0735813618879407, 0.06505038120443575]
|
1,803.08672
|
On a generalization of Solomon-Terao formula for subspace arrangements
|
We investigate in this paper a generalization of Solomon-Terao formula for
central equidimensional subspace arrangements. We introduce generalized
Solomon-Terao functions based on the Hilbert-Poincar\'e series of the modules
of multi-logarithmic forms and logarithmic multi-residues. We show that as in
the case of hyperplane arrangements, these Solomon-Terao functions are
polynomial. We then prove that if the Solomon-Terao polynomial of the modules
of multi-residues satisfies a certain property, then this polynomial is related
to the characteristic polynomial of the subspace arrangement. In particular, we
prove that this generalized Solomon-Terao formula holds for any line
arrangement of any codimension.
|
math.AG math.CO
|
we investigate in this paper a generalization of solomonterao formula for central equidimensional subspace arrangements we introduce generalized solomonterao functions based on the hilbertpoincare series of the modules of multilogarithmic forms and logarithmic multiresidues we show that as in the case of hyperplane arrangements these solomonterao functions are polynomial we then prove that if the solomonterao polynomial of the modules of multiresidues satisfies a certain property then this polynomial is related to the characteristic polynomial of the subspace arrangement in particular we prove that this generalized solomonterao formula holds for any line arrangement of any codimension
|
[['we', 'investigate', 'in', 'this', 'paper', 'a', 'generalization', 'of', 'solomonterao', 'formula', 'for', 'central', 'equidimensional', 'subspace', 'arrangements', 'we', 'introduce', 'generalized', 'solomonterao', 'functions', 'based', 'on', 'the', 'hilbertpoincare', 'series', 'of', 'the', 'modules', 'of', 'multilogarithmic', 'forms', 'and', 'logarithmic', 'multiresidues', 'we', 'show', 'that', 'as', 'in', 'the', 'case', 'of', 'hyperplane', 'arrangements', 'these', 'solomonterao', 'functions', 'are', 'polynomial', 'we', 'then', 'prove', 'that', 'if', 'the', 'solomonterao', 'polynomial', 'of', 'the', 'modules', 'of', 'multiresidues', 'satisfies', 'a', 'certain', 'property', 'then', 'this', 'polynomial', 'is', 'related', 'to', 'the', 'characteristic', 'polynomial', 'of', 'the', 'subspace', 'arrangement', 'in', 'particular', 'we', 'prove', 'that', 'this', 'generalized', 'solomonterao', 'formula', 'holds', 'for', 'any', 'line', 'arrangement', 'of', 'any', 'codimension']]
|
[-0.1943221610369316, 0.01472626615820142, -0.07737142322973038, 0.05110659750547105, -0.04672062311631938, -0.13050387362212254, -0.0483342985071431, 0.3277176459741895, -0.34657671372406185, -0.11640244331404877, 0.07443790630289489, -0.2034373093241205, -0.21831027028383687, 0.2050482842993612, -0.10405660011262323, -0.0037999922254433236, 0.03506279875000473, 0.06945189860683361, -0.1001018171494555, -0.2997182228161061, 0.42303964898261864, -0.03632892530731624, 0.21617033674071232, 0.09498661277272429, 0.15138290629935605, 0.05922436586115509, 0.025782831546772893, 0.010002637148621337, -0.18300407039221986, 0.1554532416660853, 0.2845230507470357, 0.14216964449345446, 0.21619542324333452, -0.363567682778618, -0.08624171689734794, 0.2480874155589845, 0.15930293343747812, 0.04190042256232118, 0.015247139428538503, -0.18247674360706392, 0.15005264578697583, -0.1681655054950776, -0.20213369195941291, -0.06296028468447427, 0.02585994012770243, 0.08199030785666157, -0.26842228093300946, 0.022937801307610545, 0.14476076997622536, 0.11606107603756755, -0.07108173147328974, -0.08938263795668415, 0.018621637917628203, 0.009184592083329335, -0.06611307691249142, 0.006282120642329876, 0.06323705094109755, -0.08569787338152916, -0.124795138376309, 0.3385139462770894, -0.03694705085945316, -0.26216806632389006, 0.10761087079299614, -0.19894545729281768, -0.21594011552345668, 0.057773593560947724, 0.10314898767198126, 0.145550556864085, -0.04405171570639747, 0.1630572420805644, -0.18674943704778948, 0.08742487147295226, 0.13749617620002633, 0.010646591103674533, 0.07668649804933618, 0.025790766965656076, 0.09920463971987677, 0.2230976187468817, -0.017072731713900186, -0.01171427726027711, -0.36394094791224535, -0.2608972121864402, -0.170408826971349, 0.07994530283031054, -0.12828647807070107, -0.19078733420853192, 0.41164296069958556, 0.08199301200996463, 0.2111881271509143, 0.14027456860640086, 0.20922140358015895, 0.11992537977130269, 0.05621188061195426, 0.053364273475987524, 0.11449677063016377, 0.15023379606039575, -0.01635017487751611, -0.13070155171953957, 0.054633735407454274, 0.2250377236875162]
|
1,803.08673
|
Revisiting Single Image Depth Estimation: Toward Higher Resolution Maps
with Accurate Object Boundaries
|
This paper considers the problem of single image depth estimation. The
employment of convolutional neural networks (CNNs) has recently brought about
significant advancements in the research of this problem. However, most
existing methods suffer from loss of spatial resolution in the estimated depth
maps; a typical symptom is distorted and blurry reconstruction of object
boundaries. In this paper, toward more accurate estimation with a focus on
depth maps with higher spatial resolution, we propose two improvements to
existing approaches. One is about the strategy of fusing features extracted at
different scales, for which we propose an improved network architecture
consisting of four modules: an encoder, decoder, multi-scale feature fusion
module, and refinement module. The other is about loss functions for measuring
inference errors used in training. We show that three loss terms, which measure
errors in depth, gradients and surface normals, respectively, contribute to
improvement of accuracy in an complementary fashion. Experimental results show
that these two improvements enable to attain higher accuracy than the current
state-of-the-arts, which is given by finer resolution reconstruction, for
example, with small objects and object boundaries.
|
cs.CV
|
this paper considers the problem of single image depth estimation the employment of convolutional neural networks cnns has recently brought about significant advancements in the research of this problem however most existing methods suffer from loss of spatial resolution in the estimated depth maps a typical symptom is distorted and blurry reconstruction of object boundaries in this paper toward more accurate estimation with a focus on depth maps with higher spatial resolution we propose two improvements to existing approaches one is about the strategy of fusing features extracted at different scales for which we propose an improved network architecture consisting of four modules an encoder decoder multiscale feature fusion module and refinement module the other is about loss functions for measuring inference errors used in training we show that three loss terms which measure errors in depth gradients and surface normals respectively contribute to improvement of accuracy in an complementary fashion experimental results show that these two improvements enable to attain higher accuracy than the current stateofthearts which is given by finer resolution reconstruction for example with small objects and object boundaries
|
[['this', 'paper', 'considers', 'the', 'problem', 'of', 'single', 'image', 'depth', 'estimation', 'the', 'employment', 'of', 'convolutional', 'neural', 'networks', 'cnns', 'has', 'recently', 'brought', 'about', 'significant', 'advancements', 'in', 'the', 'research', 'of', 'this', 'problem', 'however', 'most', 'existing', 'methods', 'suffer', 'from', 'loss', 'of', 'spatial', 'resolution', 'in', 'the', 'estimated', 'depth', 'maps', 'a', 'typical', 'symptom', 'is', 'distorted', 'and', 'blurry', 'reconstruction', 'of', 'object', 'boundaries', 'in', 'this', 'paper', 'toward', 'more', 'accurate', 'estimation', 'with', 'a', 'focus', 'on', 'depth', 'maps', 'with', 'higher', 'spatial', 'resolution', 'we', 'propose', 'two', 'improvements', 'to', 'existing', 'approaches', 'one', 'is', 'about', 'the', 'strategy', 'of', 'fusing', 'features', 'extracted', 'at', 'different', 'scales', 'for', 'which', 'we', 'propose', 'an', 'improved', 'network', 'architecture', 'consisting', 'of', 'four', 'modules', 'an', 'encoder', 'decoder', 'multiscale', 'feature', 'fusion', 'module', 'and', 'refinement', 'module', 'the', 'other', 'is', 'about', 'loss', 'functions', 'for', 'measuring', 'inference', 'errors', 'used', 'in', 'training', 'we', 'show', 'that', 'three', 'loss', 'terms', 'which', 'measure', 'errors', 'in', 'depth', 'gradients', 'and', 'surface', 'normals', 'respectively', 'contribute', 'to', 'improvement', 'of', 'accuracy', 'in', 'an', 'complementary', 'fashion', 'experimental', 'results', 'show', 'that', 'these', 'two', 'improvements', 'enable', 'to', 'attain', 'higher', 'accuracy', 'than', 'the', 'current', 'stateofthearts', 'which', 'is', 'given', 'by', 'finer', 'resolution', 'reconstruction', 'for', 'example', 'with', 'small', 'objects', 'and', 'object', 'boundaries']]
|
[-0.051694592071446374, -0.006698682949418371, -0.04983765173161014, 0.03493908434085405, -0.04266944314240591, -0.15095098837851906, -0.021867430721573367, 0.4669143609615595, -0.2826769977768341, -0.3367560070089914, 0.0940741481563936, -0.2656404764985072, -0.1533521854595005, 0.19315592270692464, -0.16325787098689393, 0.07846804886511373, 0.15316849108273675, 0.022514762802069987, -0.13374094769184652, -0.2841127884169979, 0.31892752489791465, 0.0825624537454652, 0.334465734954862, 0.03467409826999346, 0.15929609674264442, -0.027478328337355588, -0.05560165339349104, 0.012443739393147753, -0.0772746589018325, 0.23648047982587142, 0.265795179775783, 0.14740061896576823, 0.27659596107224677, -0.4104952017602685, -0.27063947814711176, 0.061057469390516914, 0.1586013259685977, 0.11169266287598166, -0.022850282930089085, -0.2887181737306681, 0.1080278535002515, -0.16008217616907353, -0.005658256770162792, -0.07115168940879732, -0.021720514072432785, -0.04471404124678184, -0.2800088769367354, 0.08001971047289752, 0.06883947450954181, 0.10408631199714984, -0.05497038602997845, -0.15385919848231824, 0.03280175407928834, 0.17898307575915867, -0.00694369784988729, 0.08246129990688392, 0.11520086752332664, -0.21070632352723975, -0.13268897698291546, 0.32365187637221354, -0.05411090309980164, -0.23428573546378495, 0.19442030159592794, -0.10527970688161696, -0.13665465691004072, 0.15016527167920554, 0.2015277454495215, 0.10129363264806651, -0.12134223810530134, -0.0288508249456984, 0.004240651026490953, 0.19415007487075675, 0.09082193522596384, 0.05495522573979183, 0.18700412749875706, 0.25398223877853743, 0.1018146149133547, 0.13372583984644254, -0.18622520834509448, -0.022781756251108842, -0.22133069415320897, -0.10431413129821182, -0.14494893880008342, -0.046866338407098834, -0.10788838562886947, -0.1334633359706009, 0.39523485545990067, 0.24349014637582414, 0.24620616580564325, 0.09147259612966861, 0.3575377747861689, 0.06221835681999737, 0.1165965435774434, 0.06619288882235536, 0.1927731721047926, 0.040812471289197905, 0.08870946477003559, -0.14080016165178597, 0.06508084660738829, 0.06688813386730603]
|
1,803.08674
|
On Fuchsian loci of PSL(n,R)-Hitchin components of a pair of pants
|
In this paper, we study Fuchsian loci of ${\rm PSL}_n(\mathbb{R})$-Hitchin
components. In particular, using the Bonahon-Dreyer parametrization of ${\rm
PSL}_n(\mathbb{R})$-Hitchin components, we give an explicit parametrization of
Fuchsian loci of a pair of pants.
|
math.GT
|
in this paper we study fuchsian loci of rm psl_nmathbbrhitchin components in particular using the bonahondreyer parametrization of rm psl_nmathbbrhitchin components we give an explicit parametrization of fuchsian loci of a pair of pants
|
[['in', 'this', 'paper', 'we', 'study', 'fuchsian', 'loci', 'of', 'rm', 'psl_nmathbbrhitchin', 'components', 'in', 'particular', 'using', 'the', 'bonahondreyer', 'parametrization', 'of', 'rm', 'psl_nmathbbrhitchin', 'components', 'we', 'give', 'an', 'explicit', 'parametrization', 'of', 'fuchsian', 'loci', 'of', 'a', 'pair', 'of', 'pants']]
|
[-0.24380299737094902, 0.016589574854606326, -0.13600189427961595, 0.015456547476787819, -0.06084210327389883, -0.04448283625242766, -0.03235770584069542, 0.33017847407609224, -0.25099978712387383, -0.17934246209915727, -0.0010112370437127538, -0.25298070297867525, -0.17444007098674774, 0.21478315850254148, -0.1138858460180927, -0.052792916481848806, 0.05447714510228252, 0.05988711502868682, -0.11833927285624668, -0.2340769631555304, 0.4667008665855974, -0.08271242619957775, 0.15747327043209225, 0.04086420749081299, 0.15989278457709588, 0.01118124158529099, -0.057457167043480695, -0.10181536711752415, -0.25726583354116883, 0.19633943308144808, 0.3331845963766682, 0.09858061867998913, 0.09926257409097161, -0.38482208945788443, -0.0835460431262618, 0.23592338105663657, 0.19023175376059953, 0.07429378275264753, -0.03586792630267155, -0.21232706459704787, 0.05884126902674325, -0.17475645837839693, -0.2089959280565381, -0.03901199379470199, 0.04292375815566629, 0.03548139105987502, -0.18794800154864788, 0.05193924831110053, 0.09493268496589735, 0.15621224054484628, 0.0040772356442175806, -0.11889883084222674, -0.03308385529089719, 0.05635466369858477, 0.03853593685198575, 0.011206843068066519, 0.04969004288432188, -0.11439482721470995, -0.07305310619994998, 0.337998753413558, -0.1055862135544885, -0.24895659333560616, 0.11337434925371781, -0.0982760468032211, -0.250696899718605, 0.1080345795780886, 0.2281293214764446, 0.1763764990027994, -0.12109904733370058, 0.1301077321113553, -0.10860495455563068, 0.11746083345497027, 0.11830166555591859, -0.05831983411917463, 0.11369541180795295, 0.11874636197899235, 0.02339893574708185, 0.138473644896294, -0.08317616151180118, 0.027394249569624662, -0.4284241287969053, -0.2473082437645644, -0.04826672459603287, 0.07175027139601298, -0.10291343968128785, -0.17712715023662895, 0.4156306206714362, -0.007069361716276035, 0.25639339588815346, 0.07808832736918703, 0.22472546208882704, 0.07538187497993931, 0.00890671880915761, 0.015318602207116783, 0.11842025941587053, 0.1889307654928416, -0.15141476539429277, -0.20828489435371011, -0.03762421595456544, 0.18722696515033022]
|
1,803.08675
|
On the hydrostatic stratification of the solar tachocline
|
We present an attempt to reconcile the solar tachocline glitch, a thin layer
immediately beneath the convection zone in which the seismically inferred sound
speed in the Sun exceeds corresponding values in standard solar models, with a
degree of partial material mixing which we presume to have resulted from a
combination of convective overshoot, wave transport and tachocline circulation.
We first summarize the effects of either modifying in the models the opacity in
the radiative interior or of incorporating either slow or fast tachocline
circulation. Neither alone is successful. We then consider, without physical
justification, incomplete material redistribution immediately beneath the
convection zone which is slow enough not to disturb radiative equilibrium. It
is modelled simply as a diffusion process. We find that, in combination with an
appropriate opacity modification, it is possible to find a density-dependent
diffusion coefficient that removes the glitch almost entirely, with a radiative
envelope that is consistent with seismology.
|
astro-ph.SR
|
we present an attempt to reconcile the solar tachocline glitch a thin layer immediately beneath the convection zone in which the seismically inferred sound speed in the sun exceeds corresponding values in standard solar models with a degree of partial material mixing which we presume to have resulted from a combination of convective overshoot wave transport and tachocline circulation we first summarize the effects of either modifying in the models the opacity in the radiative interior or of incorporating either slow or fast tachocline circulation neither alone is successful we then consider without physical justification incomplete material redistribution immediately beneath the convection zone which is slow enough not to disturb radiative equilibrium it is modelled simply as a diffusion process we find that in combination with an appropriate opacity modification it is possible to find a densitydependent diffusion coefficient that removes the glitch almost entirely with a radiative envelope that is consistent with seismology
|
[['we', 'present', 'an', 'attempt', 'to', 'reconcile', 'the', 'solar', 'tachocline', 'glitch', 'a', 'thin', 'layer', 'immediately', 'beneath', 'the', 'convection', 'zone', 'in', 'which', 'the', 'seismically', 'inferred', 'sound', 'speed', 'in', 'the', 'sun', 'exceeds', 'corresponding', 'values', 'in', 'standard', 'solar', 'models', 'with', 'a', 'degree', 'of', 'partial', 'material', 'mixing', 'which', 'we', 'presume', 'to', 'have', 'resulted', 'from', 'a', 'combination', 'of', 'convective', 'overshoot', 'wave', 'transport', 'and', 'tachocline', 'circulation', 'we', 'first', 'summarize', 'the', 'effects', 'of', 'either', 'modifying', 'in', 'the', 'models', 'the', 'opacity', 'in', 'the', 'radiative', 'interior', 'or', 'of', 'incorporating', 'either', 'slow', 'or', 'fast', 'tachocline', 'circulation', 'neither', 'alone', 'is', 'successful', 'we', 'then', 'consider', 'without', 'physical', 'justification', 'incomplete', 'material', 'redistribution', 'immediately', 'beneath', 'the', 'convection', 'zone', 'which', 'is', 'slow', 'enough', 'not', 'to', 'disturb', 'radiative', 'equilibrium', 'it', 'is', 'modelled', 'simply', 'as', 'a', 'diffusion', 'process', 'we', 'find', 'that', 'in', 'combination', 'with', 'an', 'appropriate', 'opacity', 'modification', 'it', 'is', 'possible', 'to', 'find', 'a', 'densitydependent', 'diffusion', 'coefficient', 'that', 'removes', 'the', 'glitch', 'almost', 'entirely', 'with', 'a', 'radiative', 'envelope', 'that', 'is', 'consistent', 'with', 'seismology']]
|
[-0.08936852856022125, 0.18792399482868835, -0.03759172502513929, 0.07058946934025048, -0.13485262940589388, -0.07856822740468015, 0.07171096850954625, 0.3541619298229744, -0.29672846361365796, -0.30319772423063585, 0.1242004719958943, -0.21923613994587937, -0.11306125280377757, 0.16198501906617752, -0.06847932542577483, 0.00023823899041948985, 0.07793367825533179, -0.013023987406405148, -0.02898620508872759, -0.12425735816903799, 0.2953736308558433, 0.07528886469322946, 0.18669963459327044, 0.03139942020703978, 0.06203285271797765, -0.11470427700354681, -0.009368949678239667, -0.009908838152232301, -0.1313837326166062, 0.03316137982326765, 0.1868778419817058, 0.07489227527728329, 0.2055100660238947, -0.5232964255393471, -0.3229847181431175, 0.04036679504487993, 0.1493591199169395, 0.1354147883036851, -0.03338545525761007, -0.1723382111953257, 0.03720016605916203, -0.17564480778031344, -0.14239682612922527, -0.0017307221937876243, 0.02252647335120997, -0.048260120384685405, -0.3061522725813073, 0.10695577037895655, 0.10297173479656604, 0.07825298806162576, -0.08284324987915453, -0.09005512560826617, -0.09164234702233467, 0.09300127875380364, 0.08136438961838548, 0.025144645986570555, 0.1639595472846519, -0.1418997103154853, -0.0016813851022101068, 0.3861416048920629, -0.14002177976192787, -0.15617573973359902, 0.18312949910397072, -0.1985994439342289, -0.052390335121663745, 0.18180824179722407, 0.1466371641772521, 0.1022358503035427, -0.1412553921517275, -7.778927782102935e-05, -0.047156019650256814, 0.17938201752938815, 0.06284063802306335, -0.05831098733106991, 0.2644182411869141, 0.1888407712330582, 0.05054027658385261, 0.061679403826763686, -0.15322823731482707, -0.09997699048722393, -0.3053578700652564, -0.1234382414561394, -0.12119624149749757, 0.06776196837216214, -0.05481482108848172, -0.21263245645496245, 0.33119541000009384, 0.18689663751752345, 0.19367753114406164, 0.005079669390303119, 0.3125686341981319, 0.14210968249244615, 0.10179525454431869, 0.16046423913741653, 0.3262348101404798, 0.16365357520143417, 0.13619440207841832, -0.2504637737791719, 0.1553578466576125, 0.05135181040031376]
|
1,803.08676
|
Regge Trajectories of Radial Meson Excitations: Exploring the
Dyson-Schwinger-- Bethe-Salpeter Approach
|
The combined Dyson-Schwinger and Bethe-Salpeter equations in rainbow-ladder
approximation are used to search for Regge trajectories of mesons in the
pseudo-scalar and vector channels. We focus on the often employed
Alkofer-Watson-Weigel kernel which is known to deliver good results for the
ground state meson spectra; it provides linear Regge trajectories in the $J^P=
0^-$ channel.
|
hep-ph nucl-th
|
the combined dysonschwinger and bethesalpeter equations in rainbowladder approximation are used to search for regge trajectories of mesons in the pseudoscalar and vector channels we focus on the often employed alkoferwatsonweigel kernel which is known to deliver good results for the ground state meson spectra it provides linear regge trajectories in the jp 0 channel
|
[['the', 'combined', 'dysonschwinger', 'and', 'bethesalpeter', 'equations', 'in', 'rainbowladder', 'approximation', 'are', 'used', 'to', 'search', 'for', 'regge', 'trajectories', 'of', 'mesons', 'in', 'the', 'pseudoscalar', 'and', 'vector', 'channels', 'we', 'focus', 'on', 'the', 'often', 'employed', 'alkoferwatsonweigel', 'kernel', 'which', 'is', 'known', 'to', 'deliver', 'good', 'results', 'for', 'the', 'ground', 'state', 'meson', 'spectra', 'it', 'provides', 'linear', 'regge', 'trajectories', 'in', 'the', 'jp', '0', 'channel']]
|
[-0.09835960705661112, 0.13126240995781566, -0.16160311405029562, 0.17537853886864874, -0.11951979588182574, -0.15839278801447815, 0.07483860536012799, 0.3585775568391438, -0.19952819015209874, -0.1904092248511949, -0.030662177775175898, -0.3251501339039317, -0.04943079730771758, 0.10757753780301384, 0.04398766900326505, 0.20366137335076928, 0.10776765109686595, 0.08038969487555463, -0.016578573625776225, -0.21961767730061654, 0.33286389894783497, -0.0297842414152843, 0.2159102089289162, 0.05316094568654619, 0.06915387859636987, 0.09010652843345371, 0.01567286070160292, -0.09563734710078549, -0.11355484244241207, 0.07681666116264683, 0.29406707423428696, 0.10028289370583715, 0.1551002559631511, -0.396437373391732, -0.17637611720797228, 0.04207763703824538, 0.21097679086960852, 0.13564938716202354, 0.02360142766351432, -0.33941249889149155, 0.11503618550314396, -0.1303247876499814, -0.1559866603584615, -0.18534585781809357, -0.03352194602808191, -0.03757924289891013, -0.3127247583534982, 0.06125624368346676, -0.06778371740667219, -0.024261964916217106, -0.11493390414829331, -0.2759085854739641, 0.015061527818303418, 0.08811831346678513, 0.0594940114878463, 0.11553576937876642, 0.06067774157876287, -0.19518272378654392, -0.13596621968059075, 0.3981061477765993, -0.1163857610275348, -0.27875138147458156, 0.14891068127407278, -0.1336497697910225, -0.07396018704727154, 0.1338676853036439, 0.21204468660936174, 0.12027854924262674, -0.1806900579723771, 0.12476111163549056, -0.029557971870181738, 0.13267348472166945, 0.05311617052561983, 0.08794585814596051, 0.11200330527154384, 0.13870446176992524, -0.02132236990318806, 0.05239830589077125, -0.03925281723840507, -0.20776565238419506, -0.32663665984377815, -0.09523945277625764, -0.12536626319504446, 2.0705663633567315e-05, -0.033990718441027974, -0.11881609354168177, 0.3599582505886684, 0.07383370548659177, 0.2025420257166304, 0.04529038099442712, 0.310824368218029, 0.1278303379572376, 0.04136988751728226, 0.1292009996746115, 0.28908770803914025, 0.22823230579874856, 0.16366453093683553, -0.29102979149427954, -0.043608042799557246, 0.09048773143095551]
|
1,803.08677
|
An astrophysical interpretation of the remarkable g-mode frequency
groups of the rapidly rotating $\gamma$ Dor star, KIC 5608334
|
The Fourier spectrum of the $\gamma$-Dor variable KIC 5608334 shows
remarkable frequency groups at $\sim$3, $\sim$6, $\sim$9, and 11--12\,d$^{-1}$.
We explain the four frequency groups as prograde sectoral g modes in a rapidly
rotating star. Frequencies of intermediate-to-high radial order prograde
sectoral g modes in a rapidly rotating star are proportional to $|m|$ (i.e.,
$\nu \propto |m|$) in the co-rotating frame as well as in the inertial frame.
This property is consistent with the frequency groups of KIC 5608334 as well as
the period vs. period-spacing relation present within each frequency group, if
we assume a rotation frequency of $2.2$\,d$^{-1}$, and that each frequency
group consists of prograde sectoral g modes of $|m| = 1, 2, 3,$ and 4,
respectively. In addition, these modes naturally satisfy near-resonance
conditions $\nu_i\approx\nu_j+\nu_k$ with $m_i=m_j+m_k$. We even find exact
resonance frequency conditions (within the precise measurement uncertainties)
in many cases, which correspond to combination frequencies.
|
astro-ph.SR
|
the fourier spectrum of the gammador variable kic 5608334 shows remarkable frequency groups at sim3 sim6 sim9 and 1112d1 we explain the four frequency groups as prograde sectoral g modes in a rapidly rotating star frequencies of intermediatetohigh radial order prograde sectoral g modes in a rapidly rotating star are proportional to m ie nu propto m in the corotating frame as well as in the inertial frame this property is consistent with the frequency groups of kic 5608334 as well as the period vs periodspacing relation present within each frequency group if we assume a rotation frequency of 22d1 and that each frequency group consists of prograde sectoral g modes of m 1 2 3 and 4 respectively in addition these modes naturally satisfy nearresonance conditions nu_iapproxnu_jnu_k with m_im_jm_k we even find exact resonance frequency conditions within the precise measurement uncertainties in many cases which correspond to combination frequencies
|
[['the', 'fourier', 'spectrum', 'of', 'the', 'gammador', 'variable', 'kic', '5608334', 'shows', 'remarkable', 'frequency', 'groups', 'at', 'sim3', 'sim6', 'sim9', 'and', '1112d1', 'we', 'explain', 'the', 'four', 'frequency', 'groups', 'as', 'prograde', 'sectoral', 'g', 'modes', 'in', 'a', 'rapidly', 'rotating', 'star', 'frequencies', 'of', 'intermediatetohigh', 'radial', 'order', 'prograde', 'sectoral', 'g', 'modes', 'in', 'a', 'rapidly', 'rotating', 'star', 'are', 'proportional', 'to', 'm', 'ie', 'nu', 'propto', 'm', 'in', 'the', 'corotating', 'frame', 'as', 'well', 'as', 'in', 'the', 'inertial', 'frame', 'this', 'property', 'is', 'consistent', 'with', 'the', 'frequency', 'groups', 'of', 'kic', '5608334', 'as', 'well', 'as', 'the', 'period', 'vs', 'periodspacing', 'relation', 'present', 'within', 'each', 'frequency', 'group', 'if', 'we', 'assume', 'a', 'rotation', 'frequency', 'of', '22d1', 'and', 'that', 'each', 'frequency', 'group', 'consists', 'of', 'prograde', 'sectoral', 'g', 'modes', 'of', 'm', '1', '2', '3', 'and', '4', 'respectively', 'in', 'addition', 'these', 'modes', 'naturally', 'satisfy', 'nearresonance', 'conditions', 'nu_iapproxnu_jnu_k', 'with', 'm_im_jm_k', 'we', 'even', 'find', 'exact', 'resonance', 'frequency', 'conditions', 'within', 'the', 'precise', 'measurement', 'uncertainties', 'in', 'many', 'cases', 'which', 'correspond', 'to', 'combination', 'frequencies']]
|
[-0.19241064462915128, 0.195208512487468, -0.04464570997395264, 0.03599826223377524, -0.08625420092059106, -0.10677630004376687, 0.0367525240518795, 0.39133980081031294, -0.191688285774455, -0.2967320659294211, 0.07476397946252135, -0.24739308513957878, -0.07500539531867052, 0.20502853381431438, -0.06817406165686532, -0.024605759554382028, 0.04803704487737911, 0.09813639985333229, -0.030880896239702044, -0.1146041527852127, 0.2567135617088783, 0.005974324763720405, 0.21171397050955043, -0.11974968098360916, 0.0487124985331822, -0.045532995369285345, -0.008979773403603005, -0.03335025175706662, -0.1421462491751299, -0.02679975077445651, 0.27344645101653314, 0.048532890599092535, 0.24701935426685317, -0.33199304623111825, -0.14613521933106, 0.07359370810525684, 0.17547409365371128, 0.01511229063336063, 0.01115254800574019, -0.21235928039933588, 0.07188307412354084, -0.1985956805019543, -0.15669138292814122, 0.004756061901370513, 0.12839935491311139, 0.037052250325936696, -0.2741108137600381, 0.15959045813129893, 0.07733992810425316, 0.10420071322085528, -0.10396396561429419, -0.12568981860411063, -0.06883394612994945, 0.10394640661583378, 0.07875261945039805, 0.06001880493914259, 0.11343236704003708, -0.030561321143638985, -0.04699618240641751, 0.4107703450874522, -0.14671490822902655, -0.14571898497063024, 0.19604610465788122, -0.27433330503388725, -0.12798798455824625, 0.09042032169627733, 0.13784494316365956, 0.10321264701799072, -0.06454893958931468, 0.015049533506229134, -0.008152504686009268, 0.20403955400246998, 0.1651411035290823, 0.07151791262721385, 0.2724242144424854, 0.11763707005964785, 0.06354867692892278, 0.0755580239832915, -0.1250208904179905, 0.030898618615023663, -0.27295143012085865, -0.07133080005276435, -0.10420631946482022, 0.010353689798121823, -0.10627381604391647, -0.1038267943670909, 0.41607113413769625, 0.05478156343873205, 0.21647860880555778, 0.06976174846500287, 0.269016195348753, 0.10875471396419895, 0.10138349700367864, 0.14266903193282157, 0.2629262453844321, 0.18649720114511278, 0.04146339226160841, -0.2609637898264517, -0.06360879716752418, 0.0011747075244784356]
|
1,803.08678
|
Neutron-induced reactions in nuclear astrophysics
|
The quest for the origin of the chemical elements, which we find in our body,
in our planet (Earth), in our star (Sun), or in our galaxy (Milky Way) could
only be resolved with a thorough understanding of the nuclear physics
properties of stable and unstable atomic nuclei. While the elements until iron
are either created during the big bang or during fusion reactions in stars,
most of the elements heavier than iron are produced via neutron-induced
reactions. Therefore, neutron capture cross sections of stable and unstable
isotopes are important. So far, time-of-flight or activation methods have been
applied very successfully, but these methods reach their limits once the
isotopes with half-lives shorter than a few months are of interest. A
combination of a radioactive beam facility, an ion storage ring and a high flux
reactor or a spallation source would allow a direct measurement of
neutron-induced reactions over a wide energy range of isotopes with half-lives
down to minutes. The idea is to measure neutron-induced reactions on
radioactive ions in inverse kinematics. This means, the radioactive ions will
pass through a neutron target. In order to efficiently use the rare nuclides as
well as to enhance the luminosity, the exotic nuclides can be stored in an ion
storage ring. The neutron target can be the core of a research reactor, where
one of the central fuel elements is replaced by the evacuated beam pipe of the
storage ring. Alternatively, a large moderator surrounding a spallation source
can be intersected by the beam pipe of an ion storage ring. Using particle
detectors and Schottky spectroscopy, most of the important neutron-induced
reactions, such as (n,$\gamma$), (n,p), (n,$\alpha$), (n,2n), or (n,f), could
be investigated.
|
nucl-ex
|
the quest for the origin of the chemical elements which we find in our body in our planet earth in our star sun or in our galaxy milky way could only be resolved with a thorough understanding of the nuclear physics properties of stable and unstable atomic nuclei while the elements until iron are either created during the big bang or during fusion reactions in stars most of the elements heavier than iron are produced via neutroninduced reactions therefore neutron capture cross sections of stable and unstable isotopes are important so far timeofflight or activation methods have been applied very successfully but these methods reach their limits once the isotopes with halflives shorter than a few months are of interest a combination of a radioactive beam facility an ion storage ring and a high flux reactor or a spallation source would allow a direct measurement of neutroninduced reactions over a wide energy range of isotopes with halflives down to minutes the idea is to measure neutroninduced reactions on radioactive ions in inverse kinematics this means the radioactive ions will pass through a neutron target in order to efficiently use the rare nuclides as well as to enhance the luminosity the exotic nuclides can be stored in an ion storage ring the neutron target can be the core of a research reactor where one of the central fuel elements is replaced by the evacuated beam pipe of the storage ring alternatively a large moderator surrounding a spallation source can be intersected by the beam pipe of an ion storage ring using particle detectors and schottky spectroscopy most of the important neutroninduced reactions such as ngamma np nalpha n2n or nf could be investigated
|
[['the', 'quest', 'for', 'the', 'origin', 'of', 'the', 'chemical', 'elements', 'which', 'we', 'find', 'in', 'our', 'body', 'in', 'our', 'planet', 'earth', 'in', 'our', 'star', 'sun', 'or', 'in', 'our', 'galaxy', 'milky', 'way', 'could', 'only', 'be', 'resolved', 'with', 'a', 'thorough', 'understanding', 'of', 'the', 'nuclear', 'physics', 'properties', 'of', 'stable', 'and', 'unstable', 'atomic', 'nuclei', 'while', 'the', 'elements', 'until', 'iron', 'are', 'either', 'created', 'during', 'the', 'big', 'bang', 'or', 'during', 'fusion', 'reactions', 'in', 'stars', 'most', 'of', 'the', 'elements', 'heavier', 'than', 'iron', 'are', 'produced', 'via', 'neutroninduced', 'reactions', 'therefore', 'neutron', 'capture', 'cross', 'sections', 'of', 'stable', 'and', 'unstable', 'isotopes', 'are', 'important', 'so', 'far', 'timeofflight', 'or', 'activation', 'methods', 'have', 'been', 'applied', 'very', 'successfully', 'but', 'these', 'methods', 'reach', 'their', 'limits', 'once', 'the', 'isotopes', 'with', 'halflives', 'shorter', 'than', 'a', 'few', 'months', 'are', 'of', 'interest', 'a', 'combination', 'of', 'a', 'radioactive', 'beam', 'facility', 'an', 'ion', 'storage', 'ring', 'and', 'a', 'high', 'flux', 'reactor', 'or', 'a', 'spallation', 'source', 'would', 'allow', 'a', 'direct', 'measurement', 'of', 'neutroninduced', 'reactions', 'over', 'a', 'wide', 'energy', 'range', 'of', 'isotopes', 'with', 'halflives', 'down', 'to', 'minutes', 'the', 'idea', 'is', 'to', 'measure', 'neutroninduced', 'reactions', 'on', 'radioactive', 'ions', 'in', 'inverse', 'kinematics', 'this', 'means', 'the', 'radioactive', 'ions', 'will', 'pass', 'through', 'a', 'neutron', 'target', 'in', 'order', 'to', 'efficiently', 'use', 'the', 'rare', 'nuclides', 'as', 'well', 'as', 'to', 'enhance', 'the', 'luminosity', 'the', 'exotic', 'nuclides', 'can', 'be', 'stored', 'in', 'an', 'ion', 'storage', 'ring', 'the', 'neutron', 'target', 'can', 'be', 'the', 'core', 'of', 'a', 'research', 'reactor', 'where', 'one', 'of', 'the', 'central', 'fuel', 'elements', 'is', 'replaced', 'by', 'the', 'evacuated', 'beam', 'pipe', 'of', 'the', 'storage', 'ring', 'alternatively', 'a', 'large', 'moderator', 'surrounding', 'a', 'spallation', 'source', 'can', 'be', 'intersected', 'by', 'the', 'beam', 'pipe', 'of', 'an', 'ion', 'storage', 'ring', 'using', 'particle', 'detectors', 'and', 'schottky', 'spectroscopy', 'most', 'of', 'the', 'important', 'neutroninduced', 'reactions', 'such', 'as', 'ngamma', 'np', 'nalpha', 'n2n', 'or', 'nf', 'could', 'be', 'investigated']]
|
[-0.011711717551761532, 0.21362960254351387, -0.056109125859523934, 0.0798234369540554, -0.004126508546834613, -0.12305979906739865, 0.04570132435930246, 0.37619458101293507, -0.2587569065512561, -0.28793680451972187, 0.04836352107508095, -0.32924515949000754, 0.06560694129150096, 0.22008073797176184, 0.0068647833986881564, 0.04991818628363073, 0.09681541234145853, 0.057866999900120425, -0.061229168414716206, -0.18919703711265143, 0.26662049573476276, 0.16352710580776927, 0.19652189921376342, 0.0718426453395489, 0.03469447918725035, -0.07077810266579448, -0.003245773877129487, -0.05334973856740704, -0.07250811940501609, 0.09957681653826293, 0.3195803041327563, 0.12629446192522342, 0.1754223678627626, -0.48984039634307647, -0.22771295240472553, 0.13051244494231115, 0.17778992606739757, 0.10149889714984514, -0.13961885611139443, -0.2538281252074339, 0.08376387901316389, -0.23408323834346384, -0.14763551529212887, -0.022046899616203094, 0.05018469802903157, 0.09347068600613354, -0.26141708023542315, -0.013602312421013356, 0.006348083837491176, 0.07190230074635845, -0.06556868080152133, -0.15788234532513518, 0.007310078435590663, 0.06084828832721774, 0.045277989979714474, 0.0038949954641342216, 0.26047112326573657, -0.09007295154492083, -0.04130548640510979, 0.41710759111488543, -0.009545690809473139, -0.07913393923246585, 0.1495792914870532, -0.18139715370860823, -0.10998906062483285, 0.20311914836981249, 0.1601872090724997, 0.17791894572400588, -0.17967344733476903, 0.02574423320033317, 0.0007899115753776215, 0.19724856595819557, 0.12495217040917632, 0.023618647209932144, 0.260513499801886, 0.2319101019372754, 0.03313208221753478, 0.05862976862496411, -0.17873406195779076, -0.040181895072740365, -0.2723479280429925, -0.1619092266874946, -0.10034229716530453, 0.09072437413005449, -0.018990745776723442, -0.10577598524951551, 0.3361572266146805, 0.027351714835786228, 0.1876832030776307, -0.11323377573970005, 0.2963761979089026, 0.03600504954059853, 0.12136261492962652, 0.031100725391813626, 0.28302892376107314, 0.15208963137153034, 0.0989920814684262, -0.23300879677024453, 0.13428869790683257, 0.01531128833526151]
|
1,803.08679
|
Learning Spatial-Temporal Regularized Correlation Filters for Visual
Tracking
|
Discriminative Correlation Filters (DCF) are efficient in visual tracking but
suffer from unwanted boundary effects. Spatially Regularized DCF (SRDCF) has
been suggested to resolve this issue by enforcing spatial penalty on DCF
coefficients, which, inevitably, improves the tracking performance at the price
of increasing complexity. To tackle online updating, SRDCF formulates its model
on multiple training images, further adding difficulties in improving
efficiency. In this work, by introducing temporal regularization to SRDCF with
single sample, we present our spatial-temporal regularized correlation filters
(STRCF). Motivated by online Passive-Agressive (PA) algorithm, we introduce the
temporal regularization to SRDCF with single sample, thus resulting in our
spatial-temporal regularized correlation filters (STRCF). The STRCF formulation
can not only serve as a reasonable approximation to SRDCF with multiple
training samples, but also provide a more robust appearance model than SRDCF in
the case of large appearance variations. Besides, it can be efficiently solved
via the alternating direction method of multipliers (ADMM). By incorporating
both temporal and spatial regularization, our STRCF can handle boundary effects
without much loss in efficiency and achieve superior performance over SRDCF in
terms of accuracy and speed. Experiments are conducted on three benchmark
datasets: OTB-2015, Temple-Color, and VOT-2016. Compared with SRDCF, STRCF with
hand-crafted features provides a 5 times speedup and achieves a gain of 5.4%
and 3.6% AUC score on OTB-2015 and Temple-Color, respectively. Moreover, STRCF
combined with CNN features also performs favorably against state-of-the-art
CNN-based trackers and achieves an AUC score of 68.3% on OTB-2015.
|
cs.CV
|
discriminative correlation filters dcf are efficient in visual tracking but suffer from unwanted boundary effects spatially regularized dcf srdcf has been suggested to resolve this issue by enforcing spatial penalty on dcf coefficients which inevitably improves the tracking performance at the price of increasing complexity to tackle online updating srdcf formulates its model on multiple training images further adding difficulties in improving efficiency in this work by introducing temporal regularization to srdcf with single sample we present our spatialtemporal regularized correlation filters strcf motivated by online passiveagressive pa algorithm we introduce the temporal regularization to srdcf with single sample thus resulting in our spatialtemporal regularized correlation filters strcf the strcf formulation can not only serve as a reasonable approximation to srdcf with multiple training samples but also provide a more robust appearance model than srdcf in the case of large appearance variations besides it can be efficiently solved via the alternating direction method of multipliers admm by incorporating both temporal and spatial regularization our strcf can handle boundary effects without much loss in efficiency and achieve superior performance over srdcf in terms of accuracy and speed experiments are conducted on three benchmark datasets otb2015 templecolor and vot2016 compared with srdcf strcf with handcrafted features provides a 5 times speedup and achieves a gain of 54 and 36 auc score on otb2015 and templecolor respectively moreover strcf combined with cnn features also performs favorably against stateoftheart cnnbased trackers and achieves an auc score of 683 on otb2015
|
[['discriminative', 'correlation', 'filters', 'dcf', 'are', 'efficient', 'in', 'visual', 'tracking', 'but', 'suffer', 'from', 'unwanted', 'boundary', 'effects', 'spatially', 'regularized', 'dcf', 'srdcf', 'has', 'been', 'suggested', 'to', 'resolve', 'this', 'issue', 'by', 'enforcing', 'spatial', 'penalty', 'on', 'dcf', 'coefficients', 'which', 'inevitably', 'improves', 'the', 'tracking', 'performance', 'at', 'the', 'price', 'of', 'increasing', 'complexity', 'to', 'tackle', 'online', 'updating', 'srdcf', 'formulates', 'its', 'model', 'on', 'multiple', 'training', 'images', 'further', 'adding', 'difficulties', 'in', 'improving', 'efficiency', 'in', 'this', 'work', 'by', 'introducing', 'temporal', 'regularization', 'to', 'srdcf', 'with', 'single', 'sample', 'we', 'present', 'our', 'spatialtemporal', 'regularized', 'correlation', 'filters', 'strcf', 'motivated', 'by', 'online', 'passiveagressive', 'pa', 'algorithm', 'we', 'introduce', 'the', 'temporal', 'regularization', 'to', 'srdcf', 'with', 'single', 'sample', 'thus', 'resulting', 'in', 'our', 'spatialtemporal', 'regularized', 'correlation', 'filters', 'strcf', 'the', 'strcf', 'formulation', 'can', 'not', 'only', 'serve', 'as', 'a', 'reasonable', 'approximation', 'to', 'srdcf', 'with', 'multiple', 'training', 'samples', 'but', 'also', 'provide', 'a', 'more', 'robust', 'appearance', 'model', 'than', 'srdcf', 'in', 'the', 'case', 'of', 'large', 'appearance', 'variations', 'besides', 'it', 'can', 'be', 'efficiently', 'solved', 'via', 'the', 'alternating', 'direction', 'method', 'of', 'multipliers', 'admm', 'by', 'incorporating', 'both', 'temporal', 'and', 'spatial', 'regularization', 'our', 'strcf', 'can', 'handle', 'boundary', 'effects', 'without', 'much', 'loss', 'in', 'efficiency', 'and', 'achieve', 'superior', 'performance', 'over', 'srdcf', 'in', 'terms', 'of', 'accuracy', 'and', 'speed', 'experiments', 'are', 'conducted', 'on', 'three', 'benchmark', 'datasets', 'otb2015', 'templecolor', 'and', 'vot2016', 'compared', 'with', 'srdcf', 'strcf', 'with', 'handcrafted', 'features', 'provides', 'a', '5', 'times', 'speedup', 'and', 'achieves', 'a', 'gain', 'of', '54', 'and', '36', 'auc', 'score', 'on', 'otb2015', 'and', 'templecolor', 'respectively', 'moreover', 'strcf', 'combined', 'with', 'cnn', 'features', 'also', 'performs', 'favorably', 'against', 'stateoftheart', 'cnnbased', 'trackers', 'and', 'achieves', 'an', 'auc', 'score', 'of', '683', 'on', 'otb2015']]
|
[-0.037353071362749506, -0.03871489860330072, -0.08345679227356358, 0.04902932149053989, -0.08610966882801481, -0.2113582752359917, 0.015295415526560071, 0.4901053373492798, -0.21881130388462727, -0.3703256084671605, 0.08315981173251129, -0.2871214970033996, -0.13741906675206003, 0.17388722047979507, -0.15180534855367578, 0.09944041773738643, 0.12046874287177105, -0.0178391558715684, -0.12505384281714807, -0.3131052762859178, 0.21916272699053646, 0.10060671724436082, 0.3311854440880445, 0.04112138090636201, 0.159644809106783, 0.0038132525210705947, -0.05455960262072634, 0.0513410482137483, -0.0020179317807968783, 0.1389848904660428, 0.24325319785168584, 0.12918998630140072, 0.3341620098343309, -0.3639393595975648, -0.252909340603011, 0.0558444477693767, 0.1608542275634043, 0.03007301357200569, -0.013536453974844261, -0.33046138797012364, 0.08645847699015724, -0.14870613010467162, 0.01684058907213716, -0.1509442686483416, -0.0917923534616866, -0.008243034206026671, -0.34896522209010256, 0.13730257834350615, 0.029922130266774673, 0.07142729104249453, -0.04336214231051581, -0.16217048036276685, 0.029435891685627248, 0.08151642622198073, 0.05466732188384524, 0.0638646821415394, 0.09542179827492836, -0.15163393403992664, -0.1452607539266215, 0.3191581436717997, -0.10454466747653395, -0.2544503316245213, 0.19385215867006658, -0.033594634515062276, -0.07178992993882573, 0.1487074353218991, 0.2144479455160243, 0.12796007108741572, -0.14753343440896394, -0.007707305694455091, -0.022936325495568465, 0.22735090683575493, 0.09815098173555215, 0.05480413886959598, 0.11015099151706209, 0.2330395248595017, 0.061002165561884036, 0.15359427233865694, -0.17216438838584844, -0.07932880385113614, -0.18961203438419924, -0.05826792251128627, -0.15326851806698405, -0.06304617935205971, -0.16679872987478286, -0.10830985381058893, 0.40805926177346585, 0.2267674372274885, 0.2063611697253524, 0.1341590387903496, 0.3454903299179004, 0.0505589090641683, 0.1297185033027615, 0.1092521621009373, 0.21483826301231676, -0.005826047366979171, 0.09552329708346907, -0.2422844451780868, 0.07735867974305602, 0.0773872352110184]
|
1,803.0868
|
Improving DNN Robustness to Adversarial Attacks using Jacobian
Regularization
|
Deep neural networks have lately shown tremendous performance in various
applications including vision and speech processing tasks. However, alongside
their ability to perform these tasks with such high accuracy, it has been shown
that they are highly susceptible to adversarial attacks: a small change in the
input would cause the network to err with high confidence. This phenomenon
exposes an inherent fault in these networks and their ability to generalize
well. For this reason, providing robustness to adversarial attacks is an
important challenge in networks training, which has led to extensive research.
In this work, we suggest a theoretically inspired novel approach to improve the
networks' robustness. Our method applies regularization using the Frobenius
norm of the Jacobian of the network, which is applied as post-processing, after
regular training has finished. We demonstrate empirically that it leads to
enhanced robustness results with a minimal change in the original network's
accuracy.
|
cs.LG cs.CR cs.CV stat.ML
|
deep neural networks have lately shown tremendous performance in various applications including vision and speech processing tasks however alongside their ability to perform these tasks with such high accuracy it has been shown that they are highly susceptible to adversarial attacks a small change in the input would cause the network to err with high confidence this phenomenon exposes an inherent fault in these networks and their ability to generalize well for this reason providing robustness to adversarial attacks is an important challenge in networks training which has led to extensive research in this work we suggest a theoretically inspired novel approach to improve the networks robustness our method applies regularization using the frobenius norm of the jacobian of the network which is applied as postprocessing after regular training has finished we demonstrate empirically that it leads to enhanced robustness results with a minimal change in the original networks accuracy
|
[['deep', 'neural', 'networks', 'have', 'lately', 'shown', 'tremendous', 'performance', 'in', 'various', 'applications', 'including', 'vision', 'and', 'speech', 'processing', 'tasks', 'however', 'alongside', 'their', 'ability', 'to', 'perform', 'these', 'tasks', 'with', 'such', 'high', 'accuracy', 'it', 'has', 'been', 'shown', 'that', 'they', 'are', 'highly', 'susceptible', 'to', 'adversarial', 'attacks', 'a', 'small', 'change', 'in', 'the', 'input', 'would', 'cause', 'the', 'network', 'to', 'err', 'with', 'high', 'confidence', 'this', 'phenomenon', 'exposes', 'an', 'inherent', 'fault', 'in', 'these', 'networks', 'and', 'their', 'ability', 'to', 'generalize', 'well', 'for', 'this', 'reason', 'providing', 'robustness', 'to', 'adversarial', 'attacks', 'is', 'an', 'important', 'challenge', 'in', 'networks', 'training', 'which', 'has', 'led', 'to', 'extensive', 'research', 'in', 'this', 'work', 'we', 'suggest', 'a', 'theoretically', 'inspired', 'novel', 'approach', 'to', 'improve', 'the', 'networks', 'robustness', 'our', 'method', 'applies', 'regularization', 'using', 'the', 'frobenius', 'norm', 'of', 'the', 'jacobian', 'of', 'the', 'network', 'which', 'is', 'applied', 'as', 'postprocessing', 'after', 'regular', 'training', 'has', 'finished', 'we', 'demonstrate', 'empirically', 'that', 'it', 'leads', 'to', 'enhanced', 'robustness', 'results', 'with', 'a', 'minimal', 'change', 'in', 'the', 'original', 'networks', 'accuracy']]
|
[-0.0643092751984174, -0.01499194225432196, -0.05916569546350123, 0.06223450733271117, -0.08809399735182524, -0.1664812770873929, 0.011577811893851807, 0.4439644737634808, -0.2604680663129936, -0.34835130358619304, 0.08261967125193527, -0.2374031272934129, -0.26669046059250834, 0.20276890853109458, -0.20922170359951756, 0.15643544076010585, 0.11409577610194295, 0.04965525491861626, -0.04941359588643536, -0.3325359632144682, 0.27123694034448514, 0.10409660741143549, 0.3680001022790869, 0.09444047839536021, 0.09850198257093629, -0.07534865021084745, 0.007910012096787492, -0.0033235768616820373, -0.02687686245316096, 0.1469991062573778, 0.3163515734936421, 0.17692111634804555, 0.3702331050982078, -0.437625480654339, -0.2749595083296299, 0.1419275352389862, 0.15536008157146475, 0.148183428941605, -0.0516545792731146, -0.32531844679499045, 0.14408583630768892, -0.2006033163735022, -0.04362183906758825, -0.18256640839080016, -0.0019721576447288194, -0.00875408945372328, -0.24770480491919444, 0.013707721545360983, 0.09291631070043271, 0.051799519546329977, 0.003607496061983208, -0.08253666364587843, 0.005600386804435403, 0.16301521813496947, 0.07388835132742921, 0.055914632224206194, 0.12404583495343104, -0.1551552830527847, -0.1426823155504341, 0.35218783852333824, -0.028797773422362904, -0.20100558601969776, 0.23300277006812395, -0.02203588362162312, -0.1695694603367398, 0.1168453658410969, 0.2358576423302293, 0.0830117541893075, -0.1259725860871064, 0.02167931436483438, 0.026176812982497116, 0.14134083000089354, 0.03925192043437467, 0.02882209001729886, 0.16098973699690153, 0.2567377710478225, 0.04611508899834007, 0.1685454688826576, -0.104882527962327, -0.06315258618754645, -0.16727511112888654, -0.08149420268367975, -0.19248629873308043, 0.02077609994991993, -0.06225746624462772, -0.1419824921786009, 0.39927583878239, 0.2625451479588325, 0.22686002308502792, 0.0750844726835688, 0.3393662008518974, 0.043323670737445356, 0.14458176037723508, 0.07788506117183715, 0.26255596363606554, 0.07889387182430559, 0.13508870080889512, -0.17413042269569512, 0.12834305299445986, -0.015775013365782797]
|
1,803.08681
|
Pattern Evolution Characterizes the Mechanism and Efficiency of CVD
Graphene Growth
|
Growing large-area single-crystal monolayers is the holy grail of graphene
synthesis. In this work, the efficiency of graphene growth and the quality of
their continuous films are explored through the time evolution of individual
domains and their surface coverage on the substrate. Our phase-field modeling
results and experimental characterization clearly demonstrate the critical
roles of the deposition flux, edge-reaction kinetics and the surface diffusion
of active carbon sources in modulating the pattern evolution and rate of
growth. The contrast in edge-kinetics-limited and surface-diffusion-limited
regimes is remarkable, which can be characterized by the evolution of domain
patterns and considered as an indicator of the growth regime. Common features
exist in these two regimes, showing that the growth rate scales with time as t2
in the early stage of growth and is regime-independent, which is explained by
the coarsen profiles of carbon concentration for both the compact and dendritic
domains. The rate decays rapidly in the final stage of growth due to the
competition between neighboring domains on the limited carbon sources diffusing
on the substrate, which is highly regime-sensitive and extremely low in the
surface-diffusion-limited regime with narrow gaps between the domains to be
filled. Based on these findings, synthesis strategies to improve the growth
efficiency and film quality are discussed.
|
cond-mat.mtrl-sci
|
growing largearea singlecrystal monolayers is the holy grail of graphene synthesis in this work the efficiency of graphene growth and the quality of their continuous films are explored through the time evolution of individual domains and their surface coverage on the substrate our phasefield modeling results and experimental characterization clearly demonstrate the critical roles of the deposition flux edgereaction kinetics and the surface diffusion of active carbon sources in modulating the pattern evolution and rate of growth the contrast in edgekineticslimited and surfacediffusionlimited regimes is remarkable which can be characterized by the evolution of domain patterns and considered as an indicator of the growth regime common features exist in these two regimes showing that the growth rate scales with time as t2 in the early stage of growth and is regimeindependent which is explained by the coarsen profiles of carbon concentration for both the compact and dendritic domains the rate decays rapidly in the final stage of growth due to the competition between neighboring domains on the limited carbon sources diffusing on the substrate which is highly regimesensitive and extremely low in the surfacediffusionlimited regime with narrow gaps between the domains to be filled based on these findings synthesis strategies to improve the growth efficiency and film quality are discussed
|
[['growing', 'largearea', 'singlecrystal', 'monolayers', 'is', 'the', 'holy', 'grail', 'of', 'graphene', 'synthesis', 'in', 'this', 'work', 'the', 'efficiency', 'of', 'graphene', 'growth', 'and', 'the', 'quality', 'of', 'their', 'continuous', 'films', 'are', 'explored', 'through', 'the', 'time', 'evolution', 'of', 'individual', 'domains', 'and', 'their', 'surface', 'coverage', 'on', 'the', 'substrate', 'our', 'phasefield', 'modeling', 'results', 'and', 'experimental', 'characterization', 'clearly', 'demonstrate', 'the', 'critical', 'roles', 'of', 'the', 'deposition', 'flux', 'edgereaction', 'kinetics', 'and', 'the', 'surface', 'diffusion', 'of', 'active', 'carbon', 'sources', 'in', 'modulating', 'the', 'pattern', 'evolution', 'and', 'rate', 'of', 'growth', 'the', 'contrast', 'in', 'edgekineticslimited', 'and', 'surfacediffusionlimited', 'regimes', 'is', 'remarkable', 'which', 'can', 'be', 'characterized', 'by', 'the', 'evolution', 'of', 'domain', 'patterns', 'and', 'considered', 'as', 'an', 'indicator', 'of', 'the', 'growth', 'regime', 'common', 'features', 'exist', 'in', 'these', 'two', 'regimes', 'showing', 'that', 'the', 'growth', 'rate', 'scales', 'with', 'time', 'as', 't2', 'in', 'the', 'early', 'stage', 'of', 'growth', 'and', 'is', 'regimeindependent', 'which', 'is', 'explained', 'by', 'the', 'coarsen', 'profiles', 'of', 'carbon', 'concentration', 'for', 'both', 'the', 'compact', 'and', 'dendritic', 'domains', 'the', 'rate', 'decays', 'rapidly', 'in', 'the', 'final', 'stage', 'of', 'growth', 'due', 'to', 'the', 'competition', 'between', 'neighboring', 'domains', 'on', 'the', 'limited', 'carbon', 'sources', 'diffusing', 'on', 'the', 'substrate', 'which', 'is', 'highly', 'regimesensitive', 'and', 'extremely', 'low', 'in', 'the', 'surfacediffusionlimited', 'regime', 'with', 'narrow', 'gaps', 'between', 'the', 'domains', 'to', 'be', 'filled', 'based', 'on', 'these', 'findings', 'synthesis', 'strategies', 'to', 'improve', 'the', 'growth', 'efficiency', 'and', 'film', 'quality', 'are', 'discussed']]
|
[-0.08896829844489534, 0.1484745103911087, -0.04108554812367348, -0.015169472966626213, 0.005474637992401589, -0.07252804039493568, 0.0555812283116621, 0.3970354328320907, -0.2813365839937629, -0.31004219950523737, 0.12951619984803484, -0.2723631079116946, -0.12661182021667414, 0.21796690496871723, -0.013783618543004873, 0.02210835650946726, 0.01344045908099004, -0.07389356136121147, -0.006880666233151786, -0.24744228096724505, 0.30418968622318204, 0.07413231602678184, 0.37268591791564853, 0.08342072739512385, 0.04209893504066356, -0.057689281598226554, 0.007717585880491955, 0.006866962701429193, -0.1576875338261886, 0.11953112281466305, 0.22394549685950374, 0.05437782127181908, 0.2385957237999594, -0.46730088427041966, -0.247170411337934, 0.02752287387870727, 0.15997954933246708, 0.08855884603975687, -0.10817216997840624, -0.23405302446518167, 0.0661274742257471, -0.09530604289908547, -0.08596113970156248, -0.012224255933188925, 0.03259038344920412, 0.07635969500965896, -0.23031757112282017, 0.10324976344889043, 0.06283482122029561, 0.035636664023531564, -0.10331611844879922, -0.08261632484694321, -0.08451985638798672, 0.15670585777044443, 0.06486857277181401, 0.00343315810074701, 0.17152240951591188, -0.16185116566695049, -0.08749892678814848, 0.3503271577532823, -0.07208707285862342, -0.14374275166340464, 0.2541549941079746, -0.19846598054487807, -0.06375024651688542, 0.14676972109294845, 0.1783615934235094, 0.1377329332457271, -0.12469060829950168, 0.04097191435122274, 0.06355018690958911, 0.19070636787264625, 0.08431564792579807, 0.045884698356602194, 0.22694036589396716, 0.2642963988222547, 0.026743992546792415, 0.12444236322292401, -0.09100341358149022, -0.07813138594421759, -0.22797212046890647, -0.16837332402264663, -0.17397899230869085, 0.012050489858523304, -0.09903305091396689, -0.1735892805974764, 0.40167386175644604, 0.07174846759709694, 0.2063220646985642, 0.006305291364768374, 0.23562053227842802, 0.08864263526001927, 0.06398908939673657, 0.004499866767539917, 0.2521062181102952, 0.1072029061227416, 0.12182555432367485, -0.256701557945823, 0.14016093813823352, -0.012368434486572868]
|
1,803.08682
|
A comprehensive understanding of planet formation is required for
assessing planetary habitability and for the search for life
|
Dozens of habitable zone, approximately earth-sized exoplanets are known
today. An emerging frontier of exoplanet studies is identifying which of these
habitable zone, small planets are actually habitable (have all necessary
conditions for life) and, of those, which are earth-like. Many parameters and
processes influence habitability, ranging from the orbit through detailed
composition including volatiles and organics, to the presence of geological
activity and plate tectonics. While some properties will soon be directly
observable, others cannot be probed by remote sensing for the foreseeable
future. Thus, statistical understanding of planetary systems' formation and
evolution is a key supplement to the direct measurements of planet properties.
Probabilistically assessing parameters we cannot directly measure is essential
to reliably assess habitability, to prioritizing habitable-zone planets for
follow-up, and for interpreting possible biosignatures.
|
astro-ph.EP
|
dozens of habitable zone approximately earthsized exoplanets are known today an emerging frontier of exoplanet studies is identifying which of these habitable zone small planets are actually habitable have all necessary conditions for life and of those which are earthlike many parameters and processes influence habitability ranging from the orbit through detailed composition including volatiles and organics to the presence of geological activity and plate tectonics while some properties will soon be directly observable others cannot be probed by remote sensing for the foreseeable future thus statistical understanding of planetary systems formation and evolution is a key supplement to the direct measurements of planet properties probabilistically assessing parameters we cannot directly measure is essential to reliably assess habitability to prioritizing habitablezone planets for followup and for interpreting possible biosignatures
|
[['dozens', 'of', 'habitable', 'zone', 'approximately', 'earthsized', 'exoplanets', 'are', 'known', 'today', 'an', 'emerging', 'frontier', 'of', 'exoplanet', 'studies', 'is', 'identifying', 'which', 'of', 'these', 'habitable', 'zone', 'small', 'planets', 'are', 'actually', 'habitable', 'have', 'all', 'necessary', 'conditions', 'for', 'life', 'and', 'of', 'those', 'which', 'are', 'earthlike', 'many', 'parameters', 'and', 'processes', 'influence', 'habitability', 'ranging', 'from', 'the', 'orbit', 'through', 'detailed', 'composition', 'including', 'volatiles', 'and', 'organics', 'to', 'the', 'presence', 'of', 'geological', 'activity', 'and', 'plate', 'tectonics', 'while', 'some', 'properties', 'will', 'soon', 'be', 'directly', 'observable', 'others', 'can', 'not', 'be', 'probed', 'by', 'remote', 'sensing', 'for', 'the', 'foreseeable', 'future', 'thus', 'statistical', 'understanding', 'of', 'planetary', 'systems', 'formation', 'and', 'evolution', 'is', 'a', 'key', 'supplement', 'to', 'the', 'direct', 'measurements', 'of', 'planet', 'properties', 'probabilistically', 'assessing', 'parameters', 'we', 'can', 'not', 'directly', 'measure', 'is', 'essential', 'to', 'reliably', 'assess', 'habitability', 'to', 'prioritizing', 'habitablezone', 'planets', 'for', 'followup', 'and', 'for', 'interpreting', 'possible', 'biosignatures']]
|
[-0.106656180227705, 0.18300740373641242, -0.030897430297101045, 0.08713936896280222, -0.1646530772612665, -0.06329394895796671, 0.08780136032524084, 0.3397568322554629, -0.23927361678815526, -0.36716690002976143, 0.18401015681776267, -0.2639550537631655, -0.13535483966391348, 0.26195076979583004, -0.07687016800472526, 0.09675625748292521, 0.14943326889530165, -0.05032896819232984, 0.01273311150592631, -0.2712173595862776, 0.2577838736500961, 0.1204573942902889, 0.06227471888196861, 0.043784792165321704, -0.03577986223807999, -0.0648944199561561, -0.040521712895511215, -0.07074348278030868, -0.17941498031234546, 0.07726598780634208, 0.3558182065652413, 0.1992583044267878, 0.25392588218034223, -0.4312368248703086, -0.30490659750048926, 0.11488284773810034, 0.14524432914224916, 0.02186525145808647, -0.029096812062242728, -0.2935019700880383, 0.09982318117750723, -0.14719239428802927, -0.17788582553425875, -0.07144443417334119, 0.07363146448593216, 0.0056311224124266385, -0.25861682008795495, 0.02553131014023346, 0.023284095401683722, 0.1450909412153179, -0.16064922462523212, -0.14482761751462703, -0.06490714204735798, 0.20520712654568427, -0.008487811136123447, -0.04979342942389141, 0.2572308010634973, -0.09839113657220573, -0.030154214512542573, 0.44823418116865266, -0.06212436278770102, -0.08424813502098484, 0.30291114033747263, -0.23278010380720962, -0.11179223910102067, 0.10316110668945631, 0.17571599413249783, 0.1462467385221358, -0.2312657804093288, -0.025834223968225694, 0.01741662857883418, 0.11871016535460095, 0.06401173850407696, 0.09079153431252442, 0.4525006784069288, 0.18911526393756725, 0.11117484384413652, -0.0015315938197104759, -0.15062270410899214, -0.04588273782434141, -0.18960949768337157, -0.21383206729016457, -0.14795397790166628, -0.004014014383513153, -0.0349946147282359, -0.12285230866853745, 0.35553141595539817, 0.20980702863138823, 0.1015509738602839, -0.031932607066074654, 0.29881770384697004, 0.03362009286585456, 0.09579985583190387, 0.033905164539486964, 0.32882393329366083, 0.09919891257162512, 0.02766460831675195, -0.20432407173456069, 0.20593488630163306, -0.04188864233455699]
|
1,803.08683
|
The Redshift-Dependence of Radial Acceleration: Modified Gravity versus
Particle Dark Matter
|
Modified Newtonian Dynamics has one free parameter and requires an
interpolation function to recover the normal Newtonian limit. We here show that
this interpolation function is unnecessary in a recently proposed covariant
completion of Erik Verlinde's emergent gravity, and that Verlinde's approach
moreover fixes the function's one free parameter. The so-derived correlation
between the observed acceleration (inferred from rotation curves) and the
gravitational acceleration due to merely the baryonic matter fits well with
data. We then argue that the redshift-dependence of galactic rotation curves
could offer a way to tell apart different versions of modified gravity from
particle dark matter.
|
gr-qc astro-ph.GA
|
modified newtonian dynamics has one free parameter and requires an interpolation function to recover the normal newtonian limit we here show that this interpolation function is unnecessary in a recently proposed covariant completion of erik verlindes emergent gravity and that verlindes approach moreover fixes the functions one free parameter the soderived correlation between the observed acceleration inferred from rotation curves and the gravitational acceleration due to merely the baryonic matter fits well with data we then argue that the redshiftdependence of galactic rotation curves could offer a way to tell apart different versions of modified gravity from particle dark matter
|
[['modified', 'newtonian', 'dynamics', 'has', 'one', 'free', 'parameter', 'and', 'requires', 'an', 'interpolation', 'function', 'to', 'recover', 'the', 'normal', 'newtonian', 'limit', 'we', 'here', 'show', 'that', 'this', 'interpolation', 'function', 'is', 'unnecessary', 'in', 'a', 'recently', 'proposed', 'covariant', 'completion', 'of', 'erik', 'verlindes', 'emergent', 'gravity', 'and', 'that', 'verlindes', 'approach', 'moreover', 'fixes', 'the', 'functions', 'one', 'free', 'parameter', 'the', 'soderived', 'correlation', 'between', 'the', 'observed', 'acceleration', 'inferred', 'from', 'rotation', 'curves', 'and', 'the', 'gravitational', 'acceleration', 'due', 'to', 'merely', 'the', 'baryonic', 'matter', 'fits', 'well', 'with', 'data', 'we', 'then', 'argue', 'that', 'the', 'redshiftdependence', 'of', 'galactic', 'rotation', 'curves', 'could', 'offer', 'a', 'way', 'to', 'tell', 'apart', 'different', 'versions', 'of', 'modified', 'gravity', 'from', 'particle', 'dark', 'matter']]
|
[-0.07508092258591205, 0.12086202340797172, -0.2128551999479532, 0.1469428455689922, -0.14188159816898405, -0.14178744823671877, -0.002662462145090103, 0.29039962435141203, -0.28202863528393207, -0.3373843373823911, -0.0030566486960742624, -0.25711755389813334, -0.14482973149046302, 0.18475872584269382, -0.08326615752652287, 0.024093816042877733, -0.017326459317700937, 0.007644006714690477, -0.10775780590483919, -0.2249166565388441, 0.32502783588599415, 0.06948075829073787, 0.21619439902715384, 0.004572966657578945, 0.12503310444240923, -0.010385120338760316, -0.04479686360340565, 0.01231100756675005, -0.18043250193695712, 0.05112059932667762, 0.15036129190586509, 0.1436286373157054, 0.19679887226084247, -0.4110592973791063, -0.2665946664614603, 0.1273804140430002, 0.13579998946457636, 0.11416928325779736, -0.08002495685126633, -0.2522125544399023, 0.0024969793343916536, -0.18894065381260589, -0.15930308957584202, -0.07542338384781033, 0.030429202099330723, -0.01354306795168668, -0.22036773966159673, 0.11468689248547889, 0.006456190820317715, -0.019435687677032548, -0.08076036519370973, -0.06222003747243434, -0.008583152031060309, 0.04453901318833232, 0.12735084466869012, 0.0856346263969317, 0.16836247009778163, -0.12351815338712185, -0.07267566923226695, 0.4342675247695297, -0.1127970450144494, -0.18612175389775076, 0.1816199554875493, -0.17168774869292974, -0.1268661762587726, 0.06628325756639242, 0.08053973306901753, 0.06698771248891716, -0.12980756116099657, 0.12400221676391084, -0.022368710958398878, 0.16546376353129744, 0.08540961777791381, -0.014796246546320618, 0.27096238570287823, 0.06674375446513295, 0.03835996056906879, 0.07150048449868336, -0.09577384653035552, -0.10291842142120004, -0.3350753947114572, -0.1357513308012858, -0.17103178532328456, 0.04442707661306486, -0.13337988608007437, -0.1333947796560824, 0.34114050935721024, 0.1505510030221194, 0.17350199891342527, 0.07010464017977938, 0.3190143382549286, 0.10189875341136939, 0.07418822402134538, 0.08609850344713778, 0.3241176138818264, 0.11988321054261178, 0.06380672678700648, -0.24585192074533552, -0.006139234793372452, 0.07626822699792683]
|
1,803.08684
|
Atmospheric mass loss of extrasolar planets orbiting magnetically active
host stars
|
Magnetic stellar activity of exoplanet hosts can lead to the production of
large amounts of high-energy emission, which irradiates extrasolar planets,
located in the immediate vicinity of such stars. This radiation is absorbed in
the planets' upper atmospheres, which consequently heat up and evaporate,
possibly leading to an irradiation-induced mass-loss. We present a study of the
high-energy emission in the four magnetically active planet-bearing host stars
Kepler-63, Kepler-210, WASP-19, and HAT-P-11, based on new XMM-Newton
observations. We find that the X-ray luminosities of these stars are rather
high with orders of magnitude above the level of the active Sun. The total XUV
irradiation of these planets is expected to be stronger than that of well
studied hot Jupiters. Using the estimated XUV luminosities as the energy input
to the planetary atmospheres, we obtain upper limits for the total mass loss in
these hot Jupiters.
|
astro-ph.SR astro-ph.EP
|
magnetic stellar activity of exoplanet hosts can lead to the production of large amounts of highenergy emission which irradiates extrasolar planets located in the immediate vicinity of such stars this radiation is absorbed in the planets upper atmospheres which consequently heat up and evaporate possibly leading to an irradiationinduced massloss we present a study of the highenergy emission in the four magnetically active planetbearing host stars kepler63 kepler210 wasp19 and hatp11 based on new xmmnewton observations we find that the xray luminosities of these stars are rather high with orders of magnitude above the level of the active sun the total xuv irradiation of these planets is expected to be stronger than that of well studied hot jupiters using the estimated xuv luminosities as the energy input to the planetary atmospheres we obtain upper limits for the total mass loss in these hot jupiters
|
[['magnetic', 'stellar', 'activity', 'of', 'exoplanet', 'hosts', 'can', 'lead', 'to', 'the', 'production', 'of', 'large', 'amounts', 'of', 'highenergy', 'emission', 'which', 'irradiates', 'extrasolar', 'planets', 'located', 'in', 'the', 'immediate', 'vicinity', 'of', 'such', 'stars', 'this', 'radiation', 'is', 'absorbed', 'in', 'the', 'planets', 'upper', 'atmospheres', 'which', 'consequently', 'heat', 'up', 'and', 'evaporate', 'possibly', 'leading', 'to', 'an', 'irradiationinduced', 'massloss', 'we', 'present', 'a', 'study', 'of', 'the', 'highenergy', 'emission', 'in', 'the', 'four', 'magnetically', 'active', 'planetbearing', 'host', 'stars', 'kepler63', 'kepler210', 'wasp19', 'and', 'hatp11', 'based', 'on', 'new', 'xmmnewton', 'observations', 'we', 'find', 'that', 'the', 'xray', 'luminosities', 'of', 'these', 'stars', 'are', 'rather', 'high', 'with', 'orders', 'of', 'magnitude', 'above', 'the', 'level', 'of', 'the', 'active', 'sun', 'the', 'total', 'xuv', 'irradiation', 'of', 'these', 'planets', 'is', 'expected', 'to', 'be', 'stronger', 'than', 'that', 'of', 'well', 'studied', 'hot', 'jupiters', 'using', 'the', 'estimated', 'xuv', 'luminosities', 'as', 'the', 'energy', 'input', 'to', 'the', 'planetary', 'atmospheres', 'we', 'obtain', 'upper', 'limits', 'for', 'the', 'total', 'mass', 'loss', 'in', 'these', 'hot', 'jupiters']]
|
[-0.05915997516098691, 0.2198051618156064, -0.01581284028897143, 0.11733696818393785, -0.08556598374464859, 0.0044908789600918275, 0.0965605149912234, 0.3843738439803322, -0.13153520142400843, -0.39558400746641886, 0.0685696429767025, -0.32556348433718085, -0.000703269821113079, 0.23189763457695436, -0.06669514891756181, -0.007324681884104696, 0.06687056907079143, -0.03659202931642843, -0.015513222228037193, -0.2569385498516365, 0.27881026654116187, 0.07849058023162393, 0.057496249514062785, 0.03689360332727018, 0.0063162664356342345, -0.10916460651626242, -0.009603892813174753, -0.08606818487815973, -0.1562414937609194, 0.08623935166461807, 0.23855917804919752, 0.09668788045787045, 0.16799876428275537, -0.40195965840636444, -0.23877572943294784, 0.05994783042923599, 0.1670845416342167, -0.011619604821640274, -0.06363781621540612, -0.22934047102979901, 0.04148088973670383, -0.19408673267915016, -0.17203113860159647, 0.04079654516923862, 0.04667036353041314, 0.03314412925748103, -0.26889946214699495, 0.07257959558935706, 0.058465529348824125, 0.09539489116084748, -0.14517765986480904, -0.12257205054629594, -0.10461301115477302, 0.07833337883413252, 0.05922591704681205, 0.01621043269086739, 0.20981257661090544, -0.11955687403840581, -0.032267809483326144, 0.393031519320276, -0.11917433840234379, 0.04086668440140784, 0.2643347298677933, -0.2603511459827941, -0.13062225507908604, 0.2135442137821681, 0.20393826915662633, 0.19400433003021236, -0.17878622993885074, -0.03556414625927573, -0.03062353198442401, 0.17067181645769677, 0.07931689263770952, 0.11298544040700007, 0.3858238014314945, 0.14701297798455926, 0.0540680355948603, 0.12077876114360858, -0.23891774074258543, -0.015939315502894007, -0.18272549589811307, -0.11133215794203959, -0.12465101539661798, 0.09963119822754783, -0.10587277766878994, -0.15358527842585723, 0.3287556313734967, 0.16691082086051917, 0.18197740265956477, -0.008347239774593618, 0.32989417518385583, 0.15199733580892724, 0.1030318188034774, 0.1514033669502371, 0.37339395317313673, 0.16860123661657175, 0.07365944966618877, -0.26991386162505177, 0.07000213597914101, -0.002385785133810714]
|
1,803.08685
|
Width of a two-body coupled-channel resonance
|
We study the width of a two-body resonance in a coupled-channel system. We
demonstrate how the width does not come only determined by the available phase
space for its decay to the detection channel, but it greatly depends on the
relative position of the mass of the resonance with respect to the masses of
the coupled-channels generating the state. Our results are consistent with the
experimental observation of narrow hadrons lying well above their lowest decay
threshold.
|
hep-ph nucl-th
|
we study the width of a twobody resonance in a coupledchannel system we demonstrate how the width does not come only determined by the available phase space for its decay to the detection channel but it greatly depends on the relative position of the mass of the resonance with respect to the masses of the coupledchannels generating the state our results are consistent with the experimental observation of narrow hadrons lying well above their lowest decay threshold
|
[['we', 'study', 'the', 'width', 'of', 'a', 'twobody', 'resonance', 'in', 'a', 'coupledchannel', 'system', 'we', 'demonstrate', 'how', 'the', 'width', 'does', 'not', 'come', 'only', 'determined', 'by', 'the', 'available', 'phase', 'space', 'for', 'its', 'decay', 'to', 'the', 'detection', 'channel', 'but', 'it', 'greatly', 'depends', 'on', 'the', 'relative', 'position', 'of', 'the', 'mass', 'of', 'the', 'resonance', 'with', 'respect', 'to', 'the', 'masses', 'of', 'the', 'coupledchannels', 'generating', 'the', 'state', 'our', 'results', 'are', 'consistent', 'with', 'the', 'experimental', 'observation', 'of', 'narrow', 'hadrons', 'lying', 'well', 'above', 'their', 'lowest', 'decay', 'threshold']]
|
[-0.1068820696136636, 0.16589038055873923, -0.053888107807218255, 0.052139314411619266, -0.0455865585608045, -0.08982680292267885, 0.0790518372222878, 0.37029594205344074, -0.2346651290736899, -0.2808575586139152, 0.06153266165592986, -0.2781467848856534, -0.026751228608191013, 0.16837556198142567, 0.03024204138835723, 0.08936378362138042, 0.1059778036380356, 0.11189812940980803, -0.07739250579026419, -0.17193765103720227, 0.35063394618843524, 0.050785909431031, 0.2307670340576971, 0.13056646292884047, 0.03243387198414315, 0.013438440293871931, 0.0072129619634383685, -0.06076726444442031, -0.1472896203314039, 0.09446051876459803, 0.14738128202447257, 0.10739040595944971, 0.18019459709863772, -0.32369032436860845, -0.1563914706809567, 0.09068425599630776, 0.19309074225436365, 0.1330270625941165, -0.015714318390222047, -0.35957936692208825, 0.07770829222032002, -0.14150091184472496, -0.14751869322151526, -0.048076064906433805, -0.024790533225644718, 0.004891212893553175, -0.23875150476981485, 0.08599945193446883, 0.025030737871764523, 0.000934722095534399, -0.0928774087178799, -0.17367185445883396, -0.045377620804280816, 0.11841142505963707, 0.05930106339117439, 0.020303838181781112, 0.17499029608564332, -0.14526743390489208, -0.07860340063336196, 0.3868090133847935, -0.06643979664734721, -0.16633360537922603, 0.18287458763739045, -0.22430500585900306, -0.07525710985911163, 0.19371948434741465, 0.1557673358285872, 0.09797050107826853, -0.11577692783328813, 0.06621846035364773, -0.041996224517268796, 0.228141127517084, 0.029024175870195998, 0.0655432631043935, 0.1647763577132643, 0.1817353032408403, 0.007036321566669972, 0.07582400526621609, -0.12658578139584656, -0.11709401017514529, -0.339061609820112, -0.10168973315740004, -0.18517608742241737, -0.008578825682853711, 0.0031253071622802065, -0.1468703696963849, 0.4357310170126329, 0.12377535396969164, 0.2969612476700167, 0.06596029817138786, 0.292734063000648, 0.1542122972019428, 0.09393901148411844, 0.03828155852902632, 0.34676864544873115, 0.1742376951693917, 0.05797943855672107, -0.31652562786498434, 0.06285348348924286, -0.030993934451638686]
|
1,803.08686
|
Uplink Achievable Rate in One-bit Quantized Massive MIMO with
Superimposed Pilots
|
In this work, we consider a 1-bit quantized massive MIMO channel with
superimposed pilot (SP) scheme, dubbed QSP. With linear minimum mean square
error (LMMSE) channel estimator and maximum ratio combining (MRC) receiver at
the BS, we derive an approximate lower bound on the achievable rate. When
optimizing pilot and data powers, the optimal power allocation maximizing the
data rate is obtained in a closed-form solution. Although there is a
performance gap between the quantized and unquantized systems, it is shown that
this gap diminishes as the number of BS antennas is asymptotically large.
Moreover, we show that pilot removal from the received signal by using the
channel estimate doesn't result in a significant increase in information,
especially in the cases of low signal-to-noise ratio (SNR) and a large number
of users. We present some numerical results to corroborate our analytical
findings and insights are provided for further exploration of the quantized
systems with SP.
|
cs.IT math.IT
|
in this work we consider a 1bit quantized massive mimo channel with superimposed pilot sp scheme dubbed qsp with linear minimum mean square error lmmse channel estimator and maximum ratio combining mrc receiver at the bs we derive an approximate lower bound on the achievable rate when optimizing pilot and data powers the optimal power allocation maximizing the data rate is obtained in a closedform solution although there is a performance gap between the quantized and unquantized systems it is shown that this gap diminishes as the number of bs antennas is asymptotically large moreover we show that pilot removal from the received signal by using the channel estimate doesnt result in a significant increase in information especially in the cases of low signaltonoise ratio snr and a large number of users we present some numerical results to corroborate our analytical findings and insights are provided for further exploration of the quantized systems with sp
|
[['in', 'this', 'work', 'we', 'consider', 'a', '1bit', 'quantized', 'massive', 'mimo', 'channel', 'with', 'superimposed', 'pilot', 'sp', 'scheme', 'dubbed', 'qsp', 'with', 'linear', 'minimum', 'mean', 'square', 'error', 'lmmse', 'channel', 'estimator', 'and', 'maximum', 'ratio', 'combining', 'mrc', 'receiver', 'at', 'the', 'bs', 'we', 'derive', 'an', 'approximate', 'lower', 'bound', 'on', 'the', 'achievable', 'rate', 'when', 'optimizing', 'pilot', 'and', 'data', 'powers', 'the', 'optimal', 'power', 'allocation', 'maximizing', 'the', 'data', 'rate', 'is', 'obtained', 'in', 'a', 'closedform', 'solution', 'although', 'there', 'is', 'a', 'performance', 'gap', 'between', 'the', 'quantized', 'and', 'unquantized', 'systems', 'it', 'is', 'shown', 'that', 'this', 'gap', 'diminishes', 'as', 'the', 'number', 'of', 'bs', 'antennas', 'is', 'asymptotically', 'large', 'moreover', 'we', 'show', 'that', 'pilot', 'removal', 'from', 'the', 'received', 'signal', 'by', 'using', 'the', 'channel', 'estimate', 'doesnt', 'result', 'in', 'a', 'significant', 'increase', 'in', 'information', 'especially', 'in', 'the', 'cases', 'of', 'low', 'signaltonoise', 'ratio', 'snr', 'and', 'a', 'large', 'number', 'of', 'users', 'we', 'present', 'some', 'numerical', 'results', 'to', 'corroborate', 'our', 'analytical', 'findings', 'and', 'insights', 'are', 'provided', 'for', 'further', 'exploration', 'of', 'the', 'quantized', 'systems', 'with', 'sp']]
|
[-0.22300573896181078, 0.023109586470133264, -0.037988014456125034, 0.02214576214882395, -0.04825880048616279, -0.20420979884783588, 0.14476280345040704, 0.35834089506026956, -0.2285414604755539, -0.3044200922813146, 0.12059068977757688, -0.27414516361971053, -0.19674413710599764, 0.17588127245225252, -0.08814088889067212, 0.045736163211686, 0.08350378437147986, 0.05467094835494795, -0.06578228479071009, -0.2696246701548056, 0.24839865609838238, 0.16056396087571498, 0.3515439295059731, 0.018944119275247136, 0.09204988480665752, -0.0005224349142442788, -0.02961666052259745, -0.006737990858281621, -0.13495242583702483, 0.06938952502133625, 0.29234893725614153, 0.16991230191422566, 0.2703824475647942, -0.3717533130318888, -0.19682747915447238, 0.09006115669504769, 0.17618629184866985, 0.11163182211889615, -0.09015569895836374, -0.22625870816409588, 0.15169881455029452, -0.19245240745405034, -0.032405034681188785, 0.03139306313448375, -0.04933831630154483, 0.044749653885282306, -0.37554547945938765, 0.0849929487843427, 0.005846834675438942, 0.04567752402696398, -0.061717700026929376, -0.20744562347629858, 0.040848921643449894, 0.122335218588048, 0.06971091132746228, 0.007620471162391045, 0.05288407489236805, -0.12935561051051464, -0.06409400490623328, 0.2961204255690738, -0.07972905348475662, -0.22513145899940884, 0.12523835383528362, -0.1555637389331335, -0.060686584254125917, 0.1906826906026371, 0.22401689948634274, 0.0674157093699661, -0.11739249724130552, 0.025519092695509654, -0.05323979393128426, 0.20318350369230875, 0.043193586843629034, 0.1152158729341482, 0.16124323025015333, 0.16490667455739552, 0.12620514843597888, 0.16942994561076405, -0.15045959293962485, -0.0829962278295669, -0.24617088273648294, -0.12266051983047697, -0.2616814155837581, 0.027617168758485106, -0.11693642824961459, -0.04585627728468558, 0.315369797157825, 0.12174257737914881, 0.17198946412592644, 0.15264195272879255, 0.3585967264949314, 0.18212238598029099, 0.017475088654206165, 0.14277092212991369, 0.25984904992829766, 0.13431155134232775, 0.08045804230496287, -0.2557079801288989, 0.00995037390384823, -0.027278888165470094]
|
1,803.08687
|
Region-filtering Correlation Tracking
|
Recently, correlation filters have demonstrated the excellent performance in
visual tracking. However, the base training sample region is larger than the
object region,including the Interference Region(IR). The IRs in training
samples from cyclic shifts of the base training sample severely degrade the
quality of a tracking model. In this paper, we propose the novel
Region-filtering Correlation Tracking (RFCT) to address this problem. We
immediately filter training samples by introducing a spatial map into the
standard CF formulation. Compared with existing correlation filter trackers,
our proposed tracker has the following advantages: (1) The correlation filter
can be learned on a larger search region without the interference of the IR by
a spatial map. (2) Due to processing training samples by a spatial map, it is
more general way to control background information and target information in
training samples. The values of the spatial map are not restricted, then a
better spatial map can be explored. (3) The weight proportions of accurate
filters are increased to alleviate model corruption. Experiments are performed
on two benchmark datasets: OTB-2013 and OTB-2015. Quantitative evaluations on
these benchmarks demonstrate that the proposed RFCT algorithm performs
favorably against several state-of-the-art methods.
|
cs.CV
|
recently correlation filters have demonstrated the excellent performance in visual tracking however the base training sample region is larger than the object regionincluding the interference regionir the irs in training samples from cyclic shifts of the base training sample severely degrade the quality of a tracking model in this paper we propose the novel regionfiltering correlation tracking rfct to address this problem we immediately filter training samples by introducing a spatial map into the standard cf formulation compared with existing correlation filter trackers our proposed tracker has the following advantages 1 the correlation filter can be learned on a larger search region without the interference of the ir by a spatial map 2 due to processing training samples by a spatial map it is more general way to control background information and target information in training samples the values of the spatial map are not restricted then a better spatial map can be explored 3 the weight proportions of accurate filters are increased to alleviate model corruption experiments are performed on two benchmark datasets otb2013 and otb2015 quantitative evaluations on these benchmarks demonstrate that the proposed rfct algorithm performs favorably against several stateoftheart methods
|
[['recently', 'correlation', 'filters', 'have', 'demonstrated', 'the', 'excellent', 'performance', 'in', 'visual', 'tracking', 'however', 'the', 'base', 'training', 'sample', 'region', 'is', 'larger', 'than', 'the', 'object', 'regionincluding', 'the', 'interference', 'regionir', 'the', 'irs', 'in', 'training', 'samples', 'from', 'cyclic', 'shifts', 'of', 'the', 'base', 'training', 'sample', 'severely', 'degrade', 'the', 'quality', 'of', 'a', 'tracking', 'model', 'in', 'this', 'paper', 'we', 'propose', 'the', 'novel', 'regionfiltering', 'correlation', 'tracking', 'rfct', 'to', 'address', 'this', 'problem', 'we', 'immediately', 'filter', 'training', 'samples', 'by', 'introducing', 'a', 'spatial', 'map', 'into', 'the', 'standard', 'cf', 'formulation', 'compared', 'with', 'existing', 'correlation', 'filter', 'trackers', 'our', 'proposed', 'tracker', 'has', 'the', 'following', 'advantages', '1', 'the', 'correlation', 'filter', 'can', 'be', 'learned', 'on', 'a', 'larger', 'search', 'region', 'without', 'the', 'interference', 'of', 'the', 'ir', 'by', 'a', 'spatial', 'map', '2', 'due', 'to', 'processing', 'training', 'samples', 'by', 'a', 'spatial', 'map', 'it', 'is', 'more', 'general', 'way', 'to', 'control', 'background', 'information', 'and', 'target', 'information', 'in', 'training', 'samples', 'the', 'values', 'of', 'the', 'spatial', 'map', 'are', 'not', 'restricted', 'then', 'a', 'better', 'spatial', 'map', 'can', 'be', 'explored', '3', 'the', 'weight', 'proportions', 'of', 'accurate', 'filters', 'are', 'increased', 'to', 'alleviate', 'model', 'corruption', 'experiments', 'are', 'performed', 'on', 'two', 'benchmark', 'datasets', 'otb2013', 'and', 'otb2015', 'quantitative', 'evaluations', 'on', 'these', 'benchmarks', 'demonstrate', 'that', 'the', 'proposed', 'rfct', 'algorithm', 'performs', 'favorably', 'against', 'several', 'stateoftheart', 'methods']]
|
[-0.03999106837966277, 0.005763687503834565, -0.07433069225957509, 0.06581023924370548, -0.05491491924311039, -0.17410827260562983, 0.025044359981880655, 0.457861483491287, -0.24414710155022995, -0.36029816966346173, 0.09727742116671627, -0.2957389477379226, -0.13564524182892113, 0.17296192704985736, -0.12750123697240645, 0.07576965263937833, 0.13386281945856002, 0.01309391144643385, -0.1035759155798664, -0.2863425395251917, 0.2810407231995067, 0.09073280309765507, 0.3596105755617221, -0.02791827862648658, 0.11462534703166476, -0.0353335566109135, -0.0732063613240681, 0.02845159336509092, -0.05165982289165388, 0.1181525354250211, 0.2502317180926049, 0.16294630738554236, 0.2982946174445922, -0.36146542419044725, -0.24725726367068038, 0.10298277909507748, 0.16394316533022368, 0.09090981265431745, -0.04834444533207234, -0.3464902606398537, 0.08711230038374505, -0.13170728169223933, 0.018166851097097, -0.10099375061567617, -0.049065871760446245, -0.0035248226301360223, -0.3200907010718116, 0.052582587335978155, 0.046993870362048114, 0.05827776768747422, -0.0337455330660478, -0.1407955080355769, 0.007140248953537257, 0.15313830553854585, 0.012834956840533152, 0.0556723564018116, 0.13981147132636534, -0.15794355854534953, -0.11206279240583104, 0.32438005857839786, -0.060196327515301865, -0.22931966166105613, 0.19810140194253079, -0.10665979922352428, -0.08064872792320789, 0.17011687153132346, 0.20348543101286012, 0.11220946089517345, -0.16017478361489282, 0.02971697277106128, -0.04246348782230622, 0.2240805323161776, 0.05684990508644472, 0.024062070317095806, 0.1426680900760749, 0.22833132461297312, 0.0660317898814187, 0.15571995378901846, -0.1829486598258237, -0.052729144531656946, -0.21718597841798945, -0.09880020055313479, -0.19342990304841093, -0.060069203296618995, -0.1189684850832376, -0.09106873185989797, 0.3937854814027786, 0.2423976863187457, 0.2187050306065767, 0.08258380505340125, 0.3758148186736637, 0.03728148642565227, 0.14248153465928107, 0.05561363930252218, 0.21575613225263263, 0.022974252625659265, 0.09507109660645405, -0.19653244785565352, 0.06492052694105681, 0.025160442190195517]
|
1,803.08688
|
On the similarity between Nakagami-m Fading distribution and the
Gaussian ensembles of random matrix theory
|
We report the similarity between the Nakagami-m fading distribution and the
three Gaussian ensembles of random matrix theory. We provide a brief review of
random matrix theory and wireless fading. We show that the Nakagami-m
distribution serves as mapping between the three ensembles. The statistics of
the wireless fading amplitude, as modeled by Nakagami-m distribution, provide a
rare example of a classically chaotic system that exhibits a transition between
the Gaussian orthogonal, Gaussian unitary, and Gaussian symplectic ensembles of
random matrix theory.
|
cs.IT math-ph math.IT math.MP
|
we report the similarity between the nakagamim fading distribution and the three gaussian ensembles of random matrix theory we provide a brief review of random matrix theory and wireless fading we show that the nakagamim distribution serves as mapping between the three ensembles the statistics of the wireless fading amplitude as modeled by nakagamim distribution provide a rare example of a classically chaotic system that exhibits a transition between the gaussian orthogonal gaussian unitary and gaussian symplectic ensembles of random matrix theory
|
[['we', 'report', 'the', 'similarity', 'between', 'the', 'nakagamim', 'fading', 'distribution', 'and', 'the', 'three', 'gaussian', 'ensembles', 'of', 'random', 'matrix', 'theory', 'we', 'provide', 'a', 'brief', 'review', 'of', 'random', 'matrix', 'theory', 'and', 'wireless', 'fading', 'we', 'show', 'that', 'the', 'nakagamim', 'distribution', 'serves', 'as', 'mapping', 'between', 'the', 'three', 'ensembles', 'the', 'statistics', 'of', 'the', 'wireless', 'fading', 'amplitude', 'as', 'modeled', 'by', 'nakagamim', 'distribution', 'provide', 'a', 'rare', 'example', 'of', 'a', 'classically', 'chaotic', 'system', 'that', 'exhibits', 'a', 'transition', 'between', 'the', 'gaussian', 'orthogonal', 'gaussian', 'unitary', 'and', 'gaussian', 'symplectic', 'ensembles', 'of', 'random', 'matrix', 'theory']]
|
[-0.2039608494889718, 0.17779393604297827, -0.11201406643930369, 0.05729662445260257, 0.06405908416774941, -0.207540105733021, 0.06466721505545671, 0.42118939727817367, -0.2361564376823059, -0.18291182911432372, 0.04255089105288612, -0.23972886339647742, -0.2925910709153225, 0.11862919425092093, -0.04061206293905654, 0.09459954734164767, 0.02427766547629201, 0.027186562554916457, -0.12132132928619706, -0.21455013511202684, 0.3175671675594569, 0.06415061675943434, 0.32981982768127105, -0.04899163395393549, 0.08618384753864985, 0.0946096443803981, -0.07827880708273591, -0.10237101757211792, -0.05837044841698626, 0.044783856796396036, 0.2127626565421318, 0.17274791867722097, 0.23877803436139736, -0.37641457748803786, -0.293939205587887, 0.11949886535805446, 0.13681908742320248, 0.04092050917310322, -0.02774931685771884, -0.31144051821675245, 0.026300525082638714, -0.25955379725910904, -0.09399333575785887, -0.021758247970421685, -0.04839320828365844, 0.09255114945060597, -0.36207213289127116, 0.09369947305857772, 0.058032840354050076, 0.07691178169873793, 0.025029281010885338, -0.13015322761309175, 0.09484811490628778, 0.14894500158999752, 0.0054222369884572375, -0.06965914068789017, 0.13608971351144336, -0.0630359959493323, -0.09587232855989075, 0.35832380903203315, -0.1023753966082728, -0.23863789042821382, 0.1178305944521548, -0.13693225219073454, -0.10123588181123501, 0.10927724072187231, 0.20174783032114912, 0.03631193845010385, -0.20414388478483733, 0.05492883398007352, -0.09065403055581378, 0.11587965683784426, 0.035565768700751774, 0.09503684288299666, 0.19893789677823917, 0.11391602628353256, 0.0361294774338603, 0.19188676244102237, -0.1442741668760413, -0.2106820249237211, -0.3245524298399687, -0.07480176147527812, -0.2717908258300002, 0.10506700949243657, -0.16997271188390697, -0.23319055954357837, 0.37672555028665355, 0.10163670805532758, 0.2128983871875013, 0.1398201423878895, 0.278282118376299, 0.0931635687110673, -0.09390046078393735, 0.09184503236149506, 0.1122464538302, 0.30352174529589987, 0.07164837538105685, -0.14259031213388393, 0.03269334254990809, -0.006274790752951692]
|
1,803.08689
|
Soft thermal contributions to 3-loop gauge coupling
|
We analyze 3-loop contributions to the gauge coupling felt by ultrasoft
("magnetostatic") modes in hot Yang-Mills theory. So-called soft/hard terms,
originating from dimension-six operators within the soft effective theory, are
shown to cancel 1097/1098 of the IR divergence found in a recent determination
of the hard 3-loop contribution to the soft gauge coupling. The remaining
1/1098 originates from ultrasoft/hard contributions, induced by dimension-six
operators in the ultrasoft effective theory. Soft 3-loop contributions are
likewise computed, and are found to be IR divergent, rendering the ultrasoft
gauge coupling non-perturbative at relative order O(alphas^{3/2}). We elaborate
on the implications of these findings for effective theory studies of physical
observables in thermal QCD.
|
hep-ph
|
we analyze 3loop contributions to the gauge coupling felt by ultrasoft magnetostatic modes in hot yangmills theory socalled softhard terms originating from dimensionsix operators within the soft effective theory are shown to cancel 10971098 of the ir divergence found in a recent determination of the hard 3loop contribution to the soft gauge coupling the remaining 11098 originates from ultrasofthard contributions induced by dimensionsix operators in the ultrasoft effective theory soft 3loop contributions are likewise computed and are found to be ir divergent rendering the ultrasoft gauge coupling nonperturbative at relative order oalphas32 we elaborate on the implications of these findings for effective theory studies of physical observables in thermal qcd
|
[['we', 'analyze', '3loop', 'contributions', 'to', 'the', 'gauge', 'coupling', 'felt', 'by', 'ultrasoft', 'magnetostatic', 'modes', 'in', 'hot', 'yangmills', 'theory', 'socalled', 'softhard', 'terms', 'originating', 'from', 'dimensionsix', 'operators', 'within', 'the', 'soft', 'effective', 'theory', 'are', 'shown', 'to', 'cancel', '10971098', 'of', 'the', 'ir', 'divergence', 'found', 'in', 'a', 'recent', 'determination', 'of', 'the', 'hard', '3loop', 'contribution', 'to', 'the', 'soft', 'gauge', 'coupling', 'the', 'remaining', '11098', 'originates', 'from', 'ultrasofthard', 'contributions', 'induced', 'by', 'dimensionsix', 'operators', 'in', 'the', 'ultrasoft', 'effective', 'theory', 'soft', '3loop', 'contributions', 'are', 'likewise', 'computed', 'and', 'are', 'found', 'to', 'be', 'ir', 'divergent', 'rendering', 'the', 'ultrasoft', 'gauge', 'coupling', 'nonperturbative', 'at', 'relative', 'order', 'oalphas32', 'we', 'elaborate', 'on', 'the', 'implications', 'of', 'these', 'findings', 'for', 'effective', 'theory', 'studies', 'of', 'physical', 'observables', 'in', 'thermal', 'qcd']]
|
[-0.10555915805875798, 0.2623444150623707, -0.08709216713993195, 0.12068615478292143, -0.06663458479375069, -0.07033205420253272, 0.00974004975309209, 0.31755748609045764, -0.19080554266056082, -0.2848421583250868, 0.010500954868236803, -0.38421022029207, -0.1441357098344081, 0.08083139080554247, 0.03383343204425402, 0.022553494033175258, -0.05295359681114414, -0.0041694036214876004, -0.07195320996490992, -0.1829589101187182, 0.31763818471710076, -0.007595159618605701, 0.20674355348290982, 0.18553153984687942, 0.0141044353257935, 0.022977769000341517, -0.13290060410838364, -0.008342630265034595, -0.0767019427522033, 0.1369355264523963, 0.23195171491506528, -0.08016025881669572, 0.1471839981347999, -0.424181932970038, -0.17566710157442908, 0.0067809383244306414, 0.16286585525222966, 0.12084701836530892, 0.024424353046650242, -0.2260021406647591, 0.006908594898633518, -0.2001002873821219, -0.1656079942103528, -0.16696511981745232, -0.03728213347933905, -0.1294225419334461, -0.30623613109917575, 0.08642443028780553, -0.05623713685912113, 0.00395698299991705, -0.041962930304437596, -0.15224500490739099, -0.03779960484771093, 0.10300544605981383, 0.163014324592813, 0.0688553874442389, 0.17545730377248717, -0.22147140303134638, -0.15797983114563702, 0.3812700466621878, -0.09904360726260457, -0.1330903373342359, 0.17919380993160577, -0.1353210463701475, -0.17501630753120584, 0.1609973895906049, 0.15219192892392078, 0.1357791680842089, -0.20979772976441485, 0.1963819582888391, 0.07909934615874488, 0.1613318091774588, 0.0688267569556321, 0.11087182945273114, 0.21657727783510708, 0.039869835310316876, -0.054549972834241275, 0.13314341170216892, -0.007475597439070215, -0.15291282594344527, -0.402297052519642, 0.009335757338635202, -0.11558045277741018, 0.06823357502174265, -0.11152276598817103, -0.1842087098308905, 0.336877212833332, 0.18231312105682557, 0.14615287847667582, -0.013890475913319947, 0.2830463583704154, 0.14020256767266887, 0.14456261738581266, 0.027572782784876116, 0.38859513152461006, 0.169074553209972, 0.07357375895305765, -0.31680095755881715, -0.0780050469164842, 0.1795661689247936]
|
1,803.0869
|
Polariton hyperspectral imaging of two-dimensional semiconductor
crystals
|
Atomically thin crystals of transition metal dichalcogenides (TMDs) host
excitons with strong binding energies and sizable light-matter interactions.
Coupled to optical cavities, monolayer TMDs routinely reach the regime of
strong light-matter coupling, where excitons and photons admix coherently to
form quasiparticles known as polaritons up to room temperature. Here, we
explore the two-dimensional nature of TMD polaritons with cavity-assisted
hyperspectral imaging. Using extended WS$_2$ monolayers, we establish the
regime of strong coupling with a scanning microcavity to map out polariton
properties and correlate their spatial features with intrinsic and extrinsic
effects. We find a high level of homogeneity, and show that polariton splitting
variations are correlated with intrinsic exciton properties such as oscillator
strength and linewidth. Moreover, we observe a deviation from thermal
equilibrium in the resonant polariton population, which we ascribe to
non-perturbative polariton-phonon coupling. Our measurements reveal a
promisingly consistent polariton landscape, and highlight the importance of
phonons for future polaritonic devices.
|
physics.optics cond-mat.mes-hall
|
atomically thin crystals of transition metal dichalcogenides tmds host excitons with strong binding energies and sizable lightmatter interactions coupled to optical cavities monolayer tmds routinely reach the regime of strong lightmatter coupling where excitons and photons admix coherently to form quasiparticles known as polaritons up to room temperature here we explore the twodimensional nature of tmd polaritons with cavityassisted hyperspectral imaging using extended ws_2 monolayers we establish the regime of strong coupling with a scanning microcavity to map out polariton properties and correlate their spatial features with intrinsic and extrinsic effects we find a high level of homogeneity and show that polariton splitting variations are correlated with intrinsic exciton properties such as oscillator strength and linewidth moreover we observe a deviation from thermal equilibrium in the resonant polariton population which we ascribe to nonperturbative polaritonphonon coupling our measurements reveal a promisingly consistent polariton landscape and highlight the importance of phonons for future polaritonic devices
|
[['atomically', 'thin', 'crystals', 'of', 'transition', 'metal', 'dichalcogenides', 'tmds', 'host', 'excitons', 'with', 'strong', 'binding', 'energies', 'and', 'sizable', 'lightmatter', 'interactions', 'coupled', 'to', 'optical', 'cavities', 'monolayer', 'tmds', 'routinely', 'reach', 'the', 'regime', 'of', 'strong', 'lightmatter', 'coupling', 'where', 'excitons', 'and', 'photons', 'admix', 'coherently', 'to', 'form', 'quasiparticles', 'known', 'as', 'polaritons', 'up', 'to', 'room', 'temperature', 'here', 'we', 'explore', 'the', 'twodimensional', 'nature', 'of', 'tmd', 'polaritons', 'with', 'cavityassisted', 'hyperspectral', 'imaging', 'using', 'extended', 'ws_2', 'monolayers', 'we', 'establish', 'the', 'regime', 'of', 'strong', 'coupling', 'with', 'a', 'scanning', 'microcavity', 'to', 'map', 'out', 'polariton', 'properties', 'and', 'correlate', 'their', 'spatial', 'features', 'with', 'intrinsic', 'and', 'extrinsic', 'effects', 'we', 'find', 'a', 'high', 'level', 'of', 'homogeneity', 'and', 'show', 'that', 'polariton', 'splitting', 'variations', 'are', 'correlated', 'with', 'intrinsic', 'exciton', 'properties', 'such', 'as', 'oscillator', 'strength', 'and', 'linewidth', 'moreover', 'we', 'observe', 'a', 'deviation', 'from', 'thermal', 'equilibrium', 'in', 'the', 'resonant', 'polariton', 'population', 'which', 'we', 'ascribe', 'to', 'nonperturbative', 'polaritonphonon', 'coupling', 'our', 'measurements', 'reveal', 'a', 'promisingly', 'consistent', 'polariton', 'landscape', 'and', 'highlight', 'the', 'importance', 'of', 'phonons', 'for', 'future', 'polaritonic', 'devices']]
|
[-0.10809112436670278, 0.2176757709594903, -0.03468595259080568, 0.04203927764282018, -0.03544391609740431, -0.18102665123372497, 0.101476636209885, 0.4939747099498553, -0.23719476484058594, -0.27490026612959606, -0.08635633605662371, -0.3338230135911084, -0.12467375525512261, 0.17432863887417577, 0.09318165548218342, 0.02228577813177442, 0.007455962412240734, -0.16772608089641752, -0.021492060173723192, -0.12760183131888278, 0.2769204925431253, 0.007878730515042296, 0.3460809384478716, 0.16229926279062623, 0.09154983582096053, -0.030371561249591072, 0.14231438047325165, -0.035080582090931664, -0.16617432706721932, 0.0884313979851348, 0.28823507574005897, -0.15600776928250207, 0.23516659664788417, -0.4259778421081893, -0.22284973456445695, 0.025144849108628832, 0.18965776051566996, 0.18867906437832982, -0.1046629950567451, -0.3263101251795888, -0.0362100920843281, -0.10173282708198607, -0.11083623005352028, -0.1255692706394989, -0.030616611783549963, 0.024390385445364593, -0.2269869827980617, 0.0820799966935407, 0.01688993374768693, 0.04197293821746459, -0.049755248506935225, -0.06445478544968888, -0.10826125374334478, 0.04573161029196405, 0.0029084811541977545, -0.002740176033807689, 0.21374234050367172, -0.1735564642532898, -0.10960658611548314, 0.3746738417184452, -0.14496154138552292, -0.06682627722500013, 0.21472369926957438, -0.21015948499250528, -0.01766954517323076, 0.15003735508902796, 0.17606615197584757, 0.10356720995653856, -0.11582223438149826, 0.04986511296388548, 0.010783919976123112, 0.2232980221168247, 0.05998296400096703, 0.26216500657444286, 0.29132949761659294, 0.19810335700552875, 0.00036664857142060605, 0.12777813158735826, -0.08972796329369696, -0.03151493834017159, -0.19864799683405596, -0.1627126136460559, -0.20498699962173578, 0.12432335579447303, -0.06862092620397195, -0.18262666868130592, 0.39728089480195194, 0.14108413452087515, 0.17739911714278453, -0.00043508562171686585, 0.24468575234074363, 0.12986667643682184, 0.08992444433410979, -0.013176657310868431, 0.3509112475107291, 0.2017366101348458, 0.06715066832130814, -0.3171767549658823, -0.005450498249968393, -0.05351104773429839]
|
1,803.08691
|
Deep learning and its application to medical image segmentation
|
One of the most common tasks in medical imaging is semantic segmentation.
Achieving this segmentation automatically has been an active area of research,
but the task has been proven very challenging due to the large variation of
anatomy across different patients. However, recent advances in deep learning
have made it possible to significantly improve the performance of image
recognition and semantic segmentation methods in the field of computer vision.
Due to the data driven approaches of hierarchical feature learning in deep
learning frameworks, these advances can be translated to medical images without
much difficulty. Several variations of deep convolutional neural networks have
been successfully applied to medical images. Especially fully convolutional
architectures have been proven efficient for segmentation of 3D medical images.
In this article, we describe how to build a 3D fully convolutional network
(FCN) that can process 3D images in order to produce automatic semantic
segmentations. The model is trained and evaluated on a clinical computed
tomography (CT) dataset and shows state-of-the-art performance in multi-organ
segmentation.
|
cs.CV
|
one of the most common tasks in medical imaging is semantic segmentation achieving this segmentation automatically has been an active area of research but the task has been proven very challenging due to the large variation of anatomy across different patients however recent advances in deep learning have made it possible to significantly improve the performance of image recognition and semantic segmentation methods in the field of computer vision due to the data driven approaches of hierarchical feature learning in deep learning frameworks these advances can be translated to medical images without much difficulty several variations of deep convolutional neural networks have been successfully applied to medical images especially fully convolutional architectures have been proven efficient for segmentation of 3d medical images in this article we describe how to build a 3d fully convolutional network fcn that can process 3d images in order to produce automatic semantic segmentations the model is trained and evaluated on a clinical computed tomography ct dataset and shows stateoftheart performance in multiorgan segmentation
|
[['one', 'of', 'the', 'most', 'common', 'tasks', 'in', 'medical', 'imaging', 'is', 'semantic', 'segmentation', 'achieving', 'this', 'segmentation', 'automatically', 'has', 'been', 'an', 'active', 'area', 'of', 'research', 'but', 'the', 'task', 'has', 'been', 'proven', 'very', 'challenging', 'due', 'to', 'the', 'large', 'variation', 'of', 'anatomy', 'across', 'different', 'patients', 'however', 'recent', 'advances', 'in', 'deep', 'learning', 'have', 'made', 'it', 'possible', 'to', 'significantly', 'improve', 'the', 'performance', 'of', 'image', 'recognition', 'and', 'semantic', 'segmentation', 'methods', 'in', 'the', 'field', 'of', 'computer', 'vision', 'due', 'to', 'the', 'data', 'driven', 'approaches', 'of', 'hierarchical', 'feature', 'learning', 'in', 'deep', 'learning', 'frameworks', 'these', 'advances', 'can', 'be', 'translated', 'to', 'medical', 'images', 'without', 'much', 'difficulty', 'several', 'variations', 'of', 'deep', 'convolutional', 'neural', 'networks', 'have', 'been', 'successfully', 'applied', 'to', 'medical', 'images', 'especially', 'fully', 'convolutional', 'architectures', 'have', 'been', 'proven', 'efficient', 'for', 'segmentation', 'of', '3d', 'medical', 'images', 'in', 'this', 'article', 'we', 'describe', 'how', 'to', 'build', 'a', '3d', 'fully', 'convolutional', 'network', 'fcn', 'that', 'can', 'process', '3d', 'images', 'in', 'order', 'to', 'produce', 'automatic', 'semantic', 'segmentations', 'the', 'model', 'is', 'trained', 'and', 'evaluated', 'on', 'a', 'clinical', 'computed', 'tomography', 'ct', 'dataset', 'and', 'shows', 'stateoftheart', 'performance', 'in', 'multiorgan', 'segmentation']]
|
[0.019574696509932567, -0.05155502992515505, -0.05635182928693082, 0.06234030299887785, -0.10826489329199485, -0.16109362467458205, -0.07358844069919239, 0.5216524710080453, -0.2568706418643983, -0.37172533713635947, 0.0976412894954029, -0.24086729109486832, -0.19198257343461073, 0.21278724701204782, -0.21258078761110527, 0.14806571803984253, 0.190956559766727, 0.05306148419289717, -0.055290125813847964, -0.3092339471151631, 0.24933903884015135, 0.024378491522102627, 0.4235986234132378, 0.049984193899685385, 0.11972807530504984, -0.09065777112707674, -0.04639297331838558, 0.010470694833895237, -0.03020022958822838, 0.2238996030798825, 0.42571575171037, 0.21046945222908453, 0.34254842060839846, -0.4696164866247619, -0.30132585453629007, 0.09027092352542761, 0.19122478138056717, 0.11368277912870758, -0.055077018047865876, -0.3765911004018216, 0.08745964324251483, -0.14981987274118833, 0.07230247248783901, -0.16872488535037042, 0.004994288780532467, -0.08893328341392112, -0.250384005666655, 0.025309125008615888, 0.05631831756355019, 0.1062421434090495, -0.05568690773881307, -0.09614222721124645, 0.03678678177848702, 0.24472583590042113, 0.023361291908735267, 0.1425389079016722, 0.13710560636432742, -0.2978727851378998, -0.14212637241386497, 0.333990492625162, 0.0064616205657200354, -0.19594272863607676, 0.22196070683033517, -0.0340004561252759, -0.19526046561631596, 0.1523070586734407, 0.254095616229322, 0.1298778027661943, -0.20967598164653672, 0.012341790174624683, -0.01704707590951806, 0.17537091686418058, 0.0487349074322819, -0.05196121147240601, 0.1820601355547773, 0.31424758612688275, -0.044139704535718055, 0.13899172881515587, -0.2352467521601024, -0.025139187357646215, -0.08850029518362135, -0.09760383101716538, -0.19479051674716175, -0.03952536579093985, -0.05002451152791937, -0.1725512439997623, 0.40255659703897045, 0.2698803281638816, 0.18170590605863945, 0.0312902782279707, 0.37605187056830064, -0.0038011816795915365, 0.2156039590010464, 0.036452421535657434, 0.22824671950573766, 0.034184358368206415, 0.1772173945126789, -0.13209910201562924, 0.10008477322671319, 0.06245261088423874]
|
1,803.08692
|
A model of a tidally synchronized solar dynamo
|
We discuss a solar dynamo model of Tayler-Spruit type whose Omega-effect is
conventionally produced by a solar-like differential rotation but whose
alpha-effect is assumed to be periodically modulated by planetary tidal
forcing. This resonance-like effect has its rationale in the tendency of the
current-driven Tayler instability to undergo intrinsic helicity oscillations
which, in turn, can be synchronized by periodic tidal perturbations.
Specifically, we focus on the 11.07 years alignment periodicity of the tidally
dominant planets Venus, Earth, and Jupiter, whose persistent synchronization
with the solar dynamo is briefly touched upon. The typically emerging dynamo
modes are dipolar fields, oscillating with a 22.14 years period or pulsating
with a 11.07 years period, but also quadrupolar fields with corresponding
periodicities. In the absence of any constant part of alpha, we prove the
subcritical nature of this Tayler-Spruit type dynamo. The resulting amplitude
of the alpha oscillation that is required for dynamo action turns out to lie in
the order of 1 m/s, which seems not implausible for the sun. When starting with
a more classical, non-periodic part of alpha, even less of the oscillatory
alpha part is needed to synchronize the entire dynamo. Typically, the dipole
solutions show butterfly diagrams, although their shapes are not convincing
yet. Phase coherent transitions between dipoles and quadrupoles, which are
reminiscent of the observed behaviour during the Maunder minimum, can be easily
triggered by long-term variations of dynamo parameters, but may also occur
spontaneously even for fixed parameters. Further interesting features of the
model are the typical second intensity peak and the intermittent appearance of
reversed helicities in both hemispheres.
|
astro-ph.SR
|
we discuss a solar dynamo model of taylerspruit type whose omegaeffect is conventionally produced by a solarlike differential rotation but whose alphaeffect is assumed to be periodically modulated by planetary tidal forcing this resonancelike effect has its rationale in the tendency of the currentdriven tayler instability to undergo intrinsic helicity oscillations which in turn can be synchronized by periodic tidal perturbations specifically we focus on the 1107 years alignment periodicity of the tidally dominant planets venus earth and jupiter whose persistent synchronization with the solar dynamo is briefly touched upon the typically emerging dynamo modes are dipolar fields oscillating with a 2214 years period or pulsating with a 1107 years period but also quadrupolar fields with corresponding periodicities in the absence of any constant part of alpha we prove the subcritical nature of this taylerspruit type dynamo the resulting amplitude of the alpha oscillation that is required for dynamo action turns out to lie in the order of 1 ms which seems not implausible for the sun when starting with a more classical nonperiodic part of alpha even less of the oscillatory alpha part is needed to synchronize the entire dynamo typically the dipole solutions show butterfly diagrams although their shapes are not convincing yet phase coherent transitions between dipoles and quadrupoles which are reminiscent of the observed behaviour during the maunder minimum can be easily triggered by longterm variations of dynamo parameters but may also occur spontaneously even for fixed parameters further interesting features of the model are the typical second intensity peak and the intermittent appearance of reversed helicities in both hemispheres
|
[['we', 'discuss', 'a', 'solar', 'dynamo', 'model', 'of', 'taylerspruit', 'type', 'whose', 'omegaeffect', 'is', 'conventionally', 'produced', 'by', 'a', 'solarlike', 'differential', 'rotation', 'but', 'whose', 'alphaeffect', 'is', 'assumed', 'to', 'be', 'periodically', 'modulated', 'by', 'planetary', 'tidal', 'forcing', 'this', 'resonancelike', 'effect', 'has', 'its', 'rationale', 'in', 'the', 'tendency', 'of', 'the', 'currentdriven', 'tayler', 'instability', 'to', 'undergo', 'intrinsic', 'helicity', 'oscillations', 'which', 'in', 'turn', 'can', 'be', 'synchronized', 'by', 'periodic', 'tidal', 'perturbations', 'specifically', 'we', 'focus', 'on', 'the', '1107', 'years', 'alignment', 'periodicity', 'of', 'the', 'tidally', 'dominant', 'planets', 'venus', 'earth', 'and', 'jupiter', 'whose', 'persistent', 'synchronization', 'with', 'the', 'solar', 'dynamo', 'is', 'briefly', 'touched', 'upon', 'the', 'typically', 'emerging', 'dynamo', 'modes', 'are', 'dipolar', 'fields', 'oscillating', 'with', 'a', '2214', 'years', 'period', 'or', 'pulsating', 'with', 'a', '1107', 'years', 'period', 'but', 'also', 'quadrupolar', 'fields', 'with', 'corresponding', 'periodicities', 'in', 'the', 'absence', 'of', 'any', 'constant', 'part', 'of', 'alpha', 'we', 'prove', 'the', 'subcritical', 'nature', 'of', 'this', 'taylerspruit', 'type', 'dynamo', 'the', 'resulting', 'amplitude', 'of', 'the', 'alpha', 'oscillation', 'that', 'is', 'required', 'for', 'dynamo', 'action', 'turns', 'out', 'to', 'lie', 'in', 'the', 'order', 'of', '1', 'ms', 'which', 'seems', 'not', 'implausible', 'for', 'the', 'sun', 'when', 'starting', 'with', 'a', 'more', 'classical', 'nonperiodic', 'part', 'of', 'alpha', 'even', 'less', 'of', 'the', 'oscillatory', 'alpha', 'part', 'is', 'needed', 'to', 'synchronize', 'the', 'entire', 'dynamo', 'typically', 'the', 'dipole', 'solutions', 'show', 'butterfly', 'diagrams', 'although', 'their', 'shapes', 'are', 'not', 'convincing', 'yet', 'phase', 'coherent', 'transitions', 'between', 'dipoles', 'and', 'quadrupoles', 'which', 'are', 'reminiscent', 'of', 'the', 'observed', 'behaviour', 'during', 'the', 'maunder', 'minimum', 'can', 'be', 'easily', 'triggered', 'by', 'longterm', 'variations', 'of', 'dynamo', 'parameters', 'but', 'may', 'also', 'occur', 'spontaneously', 'even', 'for', 'fixed', 'parameters', 'further', 'interesting', 'features', 'of', 'the', 'model', 'are', 'the', 'typical', 'second', 'intensity', 'peak', 'and', 'the', 'intermittent', 'appearance', 'of', 'reversed', 'helicities', 'in', 'both', 'hemispheres']]
|
[-0.19114007813208667, 0.257846533007978, -0.04508842313927199, 0.10374108781979885, -0.10906611435436361, -0.08803653310645711, 0.013910411548832517, 0.3365931302779989, -0.2530156275447966, -0.3145735969671726, 0.10992189934062702, -0.199165304627968, -0.17681332456149076, 0.2091502568192399, -0.054429999365697077, -0.03531847172835666, 0.06559161222442829, 0.05112093941054561, -0.012954517505766655, -0.20725858274663828, 0.2687249331749185, 0.04684003579578447, 0.18248636356932393, -0.06004493548861126, 0.028817502711194033, -0.09268967520487918, -0.007702224349266158, -0.005216429805538307, -0.11978371324659581, 0.027273681926696252, 0.19249119735903866, 0.03097582183396629, 0.21319746761847372, -0.450410131375644, -0.21070509416368263, 0.10877614053915198, 0.18831777188229767, 0.09177483208380484, -0.01360892309706039, -0.26021166551844077, 0.0824039106267843, -0.13770824974000623, -0.15755126961845567, -0.036297226229869535, 0.10053660469764675, 0.04980954530853496, -0.2850012891100381, 0.1098923131390951, 0.11661408195879741, 0.12105413560251084, -0.10067688891881103, -0.06571943710106566, -0.08118395484449469, 0.09093200071649997, 0.13165054907210905, 0.05242144685436153, 0.15110397934525585, -0.11953972859279902, -0.07856931987220322, 0.3812689199447491, -0.06973485984417493, -0.11924828978777496, 0.16633502248353607, -0.21995892826618563, -0.11359540519091145, 0.18161172835574357, 0.13149673406521536, 0.09165107220531243, -0.11015724443027328, 0.018022547360680728, -0.007230431511715958, 0.1751552812312377, 0.09155855357653997, 0.0045993193123263845, 0.30218263692751696, 0.14898292978107225, 0.05876533382847397, 0.08984808186042673, -0.13881872071766393, -0.09922482120137746, -0.2641435870856653, -0.029726378532359377, -0.10496740044927168, 0.05789633307601131, -0.05404771598538597, -0.17878868570198503, 0.4164799230965207, 0.12051298068399774, 0.14902888972232398, -0.020095098983746895, 0.2674525509196842, 0.1350430137050959, 0.09282191611429991, 0.10026058097454635, 0.3334687342007369, 0.15326065435268296, 0.14427891342590252, -0.2604164815972829, 0.08104711226064176, 0.034799998654334835]
|
1,803.08693
|
Low lying eigenmodes and meson propagator symmetries
|
In situations where the low lying eigenmodes of the Dirac operator are
suppressed one observed degeneracies of some meson masses. Based on these
results a hidden symmetry was conjectured, which is not a symmetry of the
Lagrangian but emerges in the quantization process. We show here how the
difference between classes of meson propagators is governed by the low modes
and shrinks when they disappear.
|
hep-ph hep-lat hep-th nucl-th
|
in situations where the low lying eigenmodes of the dirac operator are suppressed one observed degeneracies of some meson masses based on these results a hidden symmetry was conjectured which is not a symmetry of the lagrangian but emerges in the quantization process we show here how the difference between classes of meson propagators is governed by the low modes and shrinks when they disappear
|
[['in', 'situations', 'where', 'the', 'low', 'lying', 'eigenmodes', 'of', 'the', 'dirac', 'operator', 'are', 'suppressed', 'one', 'observed', 'degeneracies', 'of', 'some', 'meson', 'masses', 'based', 'on', 'these', 'results', 'a', 'hidden', 'symmetry', 'was', 'conjectured', 'which', 'is', 'not', 'a', 'symmetry', 'of', 'the', 'lagrangian', 'but', 'emerges', 'in', 'the', 'quantization', 'process', 'we', 'show', 'here', 'how', 'the', 'difference', 'between', 'classes', 'of', 'meson', 'propagators', 'is', 'governed', 'by', 'the', 'low', 'modes', 'and', 'shrinks', 'when', 'they', 'disappear']]
|
[-0.16238437065353187, 0.2895669267083017, -0.08323701158739054, 0.11461987711162902, -0.07139392205728934, -0.134330225091141, 0.058860105362076025, 0.3241923778102948, -0.24213879769667984, -0.2656781028669614, 0.06284248525491701, -0.30941388758902366, -0.1553733290674595, 0.1034148179854338, -0.00541235485758919, 0.0049068218920953, 0.015202420613226983, 0.06396698971780447, -0.1165334593388252, -0.2105170755718763, 0.37595650593821817, -0.018971047091942566, 0.2568486742746945, 0.09856908614389025, 0.06907195316341061, -0.05013786592305853, 0.03330110774303858, -0.02083485242552482, -0.07544725200591179, 0.04483408460823389, 0.2234045469560302, 0.04448369053693918, 0.1983783204968159, -0.39332345721240225, -0.15946449622010384, 0.09130300280566399, 0.19643058930881896, 0.11069180101980097, -0.02918283590652908, -0.2812153509316536, 0.07700540225666302, -0.0925622016334763, -0.15132101837975476, -0.08360513248122656, -0.03599463882139669, -0.05865205883836517, -0.258478470497693, 0.117940571746574, 0.0600085194939031, 0.043611909993566, -0.05219463723568389, -0.11331792526627676, -0.11437064358391441, 0.08356550820037507, 0.12237689292300134, -0.0039918842223974375, 0.1078851740126713, -0.15087617912258094, -0.08152374979108572, 0.42572442470834804, -0.013764133884643133, -0.22440005732127108, 0.16264362416516703, -0.18181857937373794, -0.13718968460049766, 0.11378506490817437, 0.11857744600050725, 0.12326195629027027, -0.0707357485252522, 0.12475673438121493, -0.02881508496804879, 0.13665363338704292, 0.08471901159590253, 0.07538269348442554, 0.20602639277394003, 0.12769613877798502, 0.015685499946658427, 0.08160240861157385, -0.05578451860481157, -0.13150432620537825, -0.3351817655878571, -0.09211042728991463, -0.1962088815867901, 0.04059114558286427, -0.05378693895965206, -0.13962833035307434, 0.39962834221525834, 0.08624673611842669, 0.2681216920940922, 0.002951668645255268, 0.2479000792766993, 0.19016173808083225, 0.10531899536458346, 0.10007225250682006, 0.29473953342575654, 0.15618157003146524, 0.07858588551887526, -0.2593315755088742, -0.013497570945093264, 0.060266620909365326]
|
1,803.08694
|
SENATE: A Permissionless Byzantine Consensus Protocol in Wireless
Networks
|
The blockchain technology has achieved tremendous success in open
(permissionless) decentralized consensus by employing proof-of-work (PoW) or
its variants, whereby unauthorized nodes cannot gain disproportionate impact on
consensus beyond their computational power. However, PoW-based systems incur a
high delay and low throughput, making them ineffective in dealing with
real-time applications. On the other hand, byzantine fault-tolerant (BFT)
consensus algorithms with better delay and throughput performance have been
employed in closed (permissioned) settings to avoid Sybil attacks. In this
paper, we present Sybil-proof wirelEss Network coordinAte based byzanTine
consEnsus (SENATE), which is based on the conventional BFT consensus framework
yet works in open systems of wireless devices where faulty nodes may launch
Sybil attacks. As in a Senate in the legislature where the quota of senators
per state (district) is a constant irrespective with the population of the
state, "senators" in SENATE are selected from participating distributed nodes
based on their wireless network coordinates (WNC) with a fixed number of nodes
per district in the WNC space. Elected senators then participate in the
subsequent consensus reaching process and broadcast the result. Thereby, SENATE
is proof against Sybil attacks since pseudonyms of a faulty node are likely to
be adjacent in the WNC space and hence fail to be elected.
|
cs.IT cs.CR cs.CY cs.DC math.IT
|
the blockchain technology has achieved tremendous success in open permissionless decentralized consensus by employing proofofwork pow or its variants whereby unauthorized nodes cannot gain disproportionate impact on consensus beyond their computational power however powbased systems incur a high delay and low throughput making them ineffective in dealing with realtime applications on the other hand byzantine faulttolerant bft consensus algorithms with better delay and throughput performance have been employed in closed permissioned settings to avoid sybil attacks in this paper we present sybilproof wireless network coordinate based byzantine consensus senate which is based on the conventional bft consensus framework yet works in open systems of wireless devices where faulty nodes may launch sybil attacks as in a senate in the legislature where the quota of senators per state district is a constant irrespective with the population of the state senators in senate are selected from participating distributed nodes based on their wireless network coordinates wnc with a fixed number of nodes per district in the wnc space elected senators then participate in the subsequent consensus reaching process and broadcast the result thereby senate is proof against sybil attacks since pseudonyms of a faulty node are likely to be adjacent in the wnc space and hence fail to be elected
|
[['the', 'blockchain', 'technology', 'has', 'achieved', 'tremendous', 'success', 'in', 'open', 'permissionless', 'decentralized', 'consensus', 'by', 'employing', 'proofofwork', 'pow', 'or', 'its', 'variants', 'whereby', 'unauthorized', 'nodes', 'can', 'not', 'gain', 'disproportionate', 'impact', 'on', 'consensus', 'beyond', 'their', 'computational', 'power', 'however', 'powbased', 'systems', 'incur', 'a', 'high', 'delay', 'and', 'low', 'throughput', 'making', 'them', 'ineffective', 'in', 'dealing', 'with', 'realtime', 'applications', 'on', 'the', 'other', 'hand', 'byzantine', 'faulttolerant', 'bft', 'consensus', 'algorithms', 'with', 'better', 'delay', 'and', 'throughput', 'performance', 'have', 'been', 'employed', 'in', 'closed', 'permissioned', 'settings', 'to', 'avoid', 'sybil', 'attacks', 'in', 'this', 'paper', 'we', 'present', 'sybilproof', 'wireless', 'network', 'coordinate', 'based', 'byzantine', 'consensus', 'senate', 'which', 'is', 'based', 'on', 'the', 'conventional', 'bft', 'consensus', 'framework', 'yet', 'works', 'in', 'open', 'systems', 'of', 'wireless', 'devices', 'where', 'faulty', 'nodes', 'may', 'launch', 'sybil', 'attacks', 'as', 'in', 'a', 'senate', 'in', 'the', 'legislature', 'where', 'the', 'quota', 'of', 'senators', 'per', 'state', 'district', 'is', 'a', 'constant', 'irrespective', 'with', 'the', 'population', 'of', 'the', 'state', 'senators', 'in', 'senate', 'are', 'selected', 'from', 'participating', 'distributed', 'nodes', 'based', 'on', 'their', 'wireless', 'network', 'coordinates', 'wnc', 'with', 'a', 'fixed', 'number', 'of', 'nodes', 'per', 'district', 'in', 'the', 'wnc', 'space', 'elected', 'senators', 'then', 'participate', 'in', 'the', 'subsequent', 'consensus', 'reaching', 'process', 'and', 'broadcast', 'the', 'result', 'thereby', 'senate', 'is', 'proof', 'against', 'sybil', 'attacks', 'since', 'pseudonyms', 'of', 'a', 'faulty', 'node', 'are', 'likely', 'to', 'be', 'adjacent', 'in', 'the', 'wnc', 'space', 'and', 'hence', 'fail', 'to', 'be', 'elected']]
|
[-0.23000901424588913, 0.019361243038505102, -0.005119871089689469, -0.001145761976650129, -0.09358557598870337, -0.2536049632569463, 0.18439608933078236, 0.35300828169131176, -0.2212734135791312, -0.33048631699586456, 0.11601695061202326, -0.2845440771626799, -0.12966530413464888, 0.11548027305854885, -0.18399323359506126, 0.06704739517499983, 0.06121727108006236, 0.08309308238412169, 0.050076708166401064, -0.356924233650655, 0.2638377478690461, 0.09524557583923028, 0.3354675884472215, 0.028662374967254663, 0.058234876351493395, 0.005688191037268587, 0.007117848297465219, -0.023018562274207427, -0.03154084221938955, 0.08408698210777919, 0.3536516395575728, 0.21066535048021903, 0.3769945108184689, -0.47222422884162246, -0.17475186989522365, 0.1281013486508066, 0.16508552340264812, 0.10073768229136894, -0.02623327274619642, -0.3378372669540809, 0.13390786555020862, -0.2632721021524118, -0.05548326778285479, -0.02717174611468777, -0.010894777523977548, 0.0731098721311851, -0.22590710113769727, 0.023595124672492297, -0.026022426301666922, 0.040822425661118406, -0.0046738285005831215, -0.06966631616461291, -0.003846448644523344, 0.16994448505123658, -0.0022651913733740723, 0.016525981448697703, 0.1657596735961058, -0.12587378836575558, -0.18709239221075505, 0.36277023307159184, 0.06661295962551136, -0.1503075896781807, 0.1496384997014402, -0.007149826707407547, -0.1853483416163474, 0.09492638617816368, 0.24310309994234994, 0.08214893222242843, -0.16552905651905606, 0.010417827692592481, 0.0032751716954107775, 0.1646402498437582, 0.06534842634796384, 0.08707153530229934, 0.15038872812874615, 0.19148448456199083, 0.15163121776294372, 0.0678566947490819, -0.04760828802184398, -0.15101035330533696, -0.16543622427780413, -0.11392319482042673, -0.1822151913459114, 0.0323994322123622, -0.06882360729062484, -0.12414543430374392, 0.36051217991520057, 0.1679463292250374, 0.14487719870702714, 0.06325081477897536, 0.360359829658883, -0.0008701806421208966, 0.094273706034726, 0.20142144590179528, 0.22457520020836028, 0.015159472057809742, 0.15415459100834347, -0.15875905364335172, 0.20842991394556737, -0.004670794817070926]
|
1,803.08695
|
Self propulsion of droplets driven by an active permeating gel
|
We discuss the flow field and propulsion velocity of active droplets, which
are driven by body forces residing on a rigid gel. The latter is modelled as a
porous medium which gives rise to permeation forces. In the simplest model, the
Brinkman equation, the porous medium is characterised by a single length scale
$\ell$ --the square root of the permeability. We compute the flow fields inside
and outside of the droplet as well as the energy dissipation as a function of
$\ell$. We furthermore show that there are optimal gel fractions, giving rise
to maximal linear and rotational velocities. In the limit $\ell\to\infty$,
corresponding to a very dilute gel, we recover Stokes flow. The opposite limit,
$\ell\to 0$, corresponding to a space filling gel, is singular and not
equivalent to Darcy's equation, which cannot account for self-propulsion.
|
cond-mat.soft physics.bio-ph physics.flu-dyn
|
we discuss the flow field and propulsion velocity of active droplets which are driven by body forces residing on a rigid gel the latter is modelled as a porous medium which gives rise to permeation forces in the simplest model the brinkman equation the porous medium is characterised by a single length scale ell the square root of the permeability we compute the flow fields inside and outside of the droplet as well as the energy dissipation as a function of ell we furthermore show that there are optimal gel fractions giving rise to maximal linear and rotational velocities in the limit elltoinfty corresponding to a very dilute gel we recover stokes flow the opposite limit ellto 0 corresponding to a space filling gel is singular and not equivalent to darcys equation which cannot account for selfpropulsion
|
[['we', 'discuss', 'the', 'flow', 'field', 'and', 'propulsion', 'velocity', 'of', 'active', 'droplets', 'which', 'are', 'driven', 'by', 'body', 'forces', 'residing', 'on', 'a', 'rigid', 'gel', 'the', 'latter', 'is', 'modelled', 'as', 'a', 'porous', 'medium', 'which', 'gives', 'rise', 'to', 'permeation', 'forces', 'in', 'the', 'simplest', 'model', 'the', 'brinkman', 'equation', 'the', 'porous', 'medium', 'is', 'characterised', 'by', 'a', 'single', 'length', 'scale', 'ell', 'the', 'square', 'root', 'of', 'the', 'permeability', 'we', 'compute', 'the', 'flow', 'fields', 'inside', 'and', 'outside', 'of', 'the', 'droplet', 'as', 'well', 'as', 'the', 'energy', 'dissipation', 'as', 'a', 'function', 'of', 'ell', 'we', 'furthermore', 'show', 'that', 'there', 'are', 'optimal', 'gel', 'fractions', 'giving', 'rise', 'to', 'maximal', 'linear', 'and', 'rotational', 'velocities', 'in', 'the', 'limit', 'elltoinfty', 'corresponding', 'to', 'a', 'very', 'dilute', 'gel', 'we', 'recover', 'stokes', 'flow', 'the', 'opposite', 'limit', 'ellto', '0', 'corresponding', 'to', 'a', 'space', 'filling', 'gel', 'is', 'singular', 'and', 'not', 'equivalent', 'to', 'darcys', 'equation', 'which', 'can', 'not', 'account', 'for', 'selfpropulsion']]
|
[-0.13005817036036457, 0.20923518535066937, -0.09135995433071925, 0.011521583307446723, -0.06382831801876318, -0.13395616122811654, -0.013489188960469935, 0.32803723782948824, -0.3044015648504854, -0.24401536493889475, 0.07838916814838792, -0.24945137014045662, -0.11278329889350773, 0.15572852255823766, -0.02843989642755385, 0.014711804640735838, -0.012017229538194943, 0.0277187200465604, -0.005993318109308282, -0.16331156392824714, 0.2547034309414364, -0.0011981836304176545, 0.2376315191698571, 0.07634519101154275, 0.15778221151170632, -0.0380536725654341, 0.04060463797624992, 0.11792738964773573, -0.21047301668247953, 0.048144239750083376, 0.19622857917768313, -0.024710631892220048, 0.21812956109373033, -0.4261241742423263, -0.21869534025967552, 0.08684382395164204, 0.1769605258334617, 0.11918080894468838, -0.003698378397266556, -0.24121475420163377, 0.04087961608193059, -0.15350746149087555, -0.18778466907383848, -0.03914504693449893, 0.05992208000194902, 0.0699807621633121, -0.2594932562712094, 0.14681430746112828, 0.0651645254617071, 0.030600095734648083, -0.1132537415318623, -0.07168649595932684, -0.05342226599484844, 0.1157060854383272, 0.06843627649241303, 0.017104328399105674, 0.22085124969759118, -0.1784853628175198, 0.006260769347241823, 0.43585848174753017, -0.08463491973858597, -0.2238452609380002, 0.1814800280524229, -0.14687289027969583, -0.010381644083848358, 0.2093687495385445, 0.19463063416111728, 0.07287814639731431, -0.1213939734802082, 0.04740611592938691, -0.09758273964963746, 0.16014787706629158, 0.10153043138511154, -0.03660479688382559, 0.18921283935534133, 0.17562184540851825, 0.0786730124162969, 0.15650413637015753, -0.08664051152637525, -0.09797655591957163, -0.3191859741464082, -0.1684811292047464, -0.18093254441729464, 0.07933587705454134, -0.10742813247497247, -0.18770597985122298, 0.3224302673327696, 0.05793473219998397, 0.2252847884133782, 0.0586663766779289, 0.2681193289185024, 0.10556553848479214, 0.05141025946300099, 0.10318322461840791, 0.2645927131972343, 0.1898365602229614, 0.11855195729615356, -0.2386190448988877, 0.03324987417410897, 0.11346021069945983]
|
1,803.08696
|
An Incremental Boolean Tensor Factorization approach to model Change
Patterns of Objects in Images
|
Change detection process has recently progressed from a post-classification
method to an expert knowledge interpretation process of the time-series data.
The technique finds applications mainly in remote sensing images and can be
utilized to analyze urbanization and monitor forest regions. In this paper, a
framework to perform a knowledge based interpretation of the changes/no changes
observed in a spatiotemporal domain using tensor based approaches is presented.
An incremental approach to Boolean Tensor Factorization method is proposed in
this work, which is adopted to model the change patterns of objects/classes as
well as their associated features. The framework is evaluated under different
datasets to visualize the performance for the dependency factors. The algorithm
is also validated in comparison with the tradition Boolean Tensor Factorization
method and the results are substantial.
|
cs.CV
|
change detection process has recently progressed from a postclassification method to an expert knowledge interpretation process of the timeseries data the technique finds applications mainly in remote sensing images and can be utilized to analyze urbanization and monitor forest regions in this paper a framework to perform a knowledge based interpretation of the changesno changes observed in a spatiotemporal domain using tensor based approaches is presented an incremental approach to boolean tensor factorization method is proposed in this work which is adopted to model the change patterns of objectsclasses as well as their associated features the framework is evaluated under different datasets to visualize the performance for the dependency factors the algorithm is also validated in comparison with the tradition boolean tensor factorization method and the results are substantial
|
[['change', 'detection', 'process', 'has', 'recently', 'progressed', 'from', 'a', 'postclassification', 'method', 'to', 'an', 'expert', 'knowledge', 'interpretation', 'process', 'of', 'the', 'timeseries', 'data', 'the', 'technique', 'finds', 'applications', 'mainly', 'in', 'remote', 'sensing', 'images', 'and', 'can', 'be', 'utilized', 'to', 'analyze', 'urbanization', 'and', 'monitor', 'forest', 'regions', 'in', 'this', 'paper', 'a', 'framework', 'to', 'perform', 'a', 'knowledge', 'based', 'interpretation', 'of', 'the', 'changesno', 'changes', 'observed', 'in', 'a', 'spatiotemporal', 'domain', 'using', 'tensor', 'based', 'approaches', 'is', 'presented', 'an', 'incremental', 'approach', 'to', 'boolean', 'tensor', 'factorization', 'method', 'is', 'proposed', 'in', 'this', 'work', 'which', 'is', 'adopted', 'to', 'model', 'the', 'change', 'patterns', 'of', 'objectsclasses', 'as', 'well', 'as', 'their', 'associated', 'features', 'the', 'framework', 'is', 'evaluated', 'under', 'different', 'datasets', 'to', 'visualize', 'the', 'performance', 'for', 'the', 'dependency', 'factors', 'the', 'algorithm', 'is', 'also', 'validated', 'in', 'comparison', 'with', 'the', 'tradition', 'boolean', 'tensor', 'factorization', 'method', 'and', 'the', 'results', 'are', 'substantial']]
|
[-0.02908817319910768, 0.0008383823843309875, -0.13728611542445454, 0.03574542866990096, -0.10864864218628079, -0.09091133071388316, 0.026005653692886058, 0.418279692677297, -0.28620064360507597, -0.3153791135015685, 0.1100472715916112, -0.2448996973781311, -0.21229218992983967, 0.18600528836286973, -0.08406620436370021, 0.08504298041706655, 0.0794453436662773, 0.04660759284573526, -0.04641797442326513, -0.21567430382403802, 0.2991239527335728, 0.07709408305424052, 0.3746469779981403, 0.050585221225582795, 0.1044666455246464, -0.023677704530845094, -0.08863170914843267, 0.02976186704037227, -0.053390171521849286, 0.15546683184982427, 0.281191765548896, 0.2106871345689095, 0.26957017911495423, -0.4116273699988296, -0.23068329199092594, 0.080848644670891, 0.1330945490342455, 0.10811605934050451, -0.02086170959400057, -0.3052131464690205, 0.10184749706527292, -0.19029859998300086, -0.0654583738852791, -0.12935357402247472, 0.004706640314406122, -0.038754766660295134, -0.3082602037718212, 0.04410018483346409, 0.04662787304974828, 0.06382163776832772, -0.0692611313645002, -0.10456020306927834, 0.05434739365843748, 0.15559878905751104, 0.05323224681783394, 0.049268350606476226, 0.14616282446691253, -0.12285366207067891, -0.1722413610270995, 0.3655616144840349, -0.0733453525215622, -0.19640069374242636, 0.18297924969242665, -0.05478000327739425, -0.1484384031262337, 0.11581406272273129, 0.21599009411600162, 0.1447659017532829, -0.18855262338733814, 0.05740413927944289, -0.021576197919670463, 0.16572624113865372, 0.023116480694775742, -0.012390312445386657, 0.13707227856800783, 0.2244279879313989, 0.01447552031338743, 0.15071842543813804, -0.10340161016623409, -0.0857196832057382, -0.2042436635196869, -0.13139165634670713, -0.20579500180324467, -0.0533454988993279, -0.0657347539495026, -0.15895426433944093, 0.40576113062346075, 0.19459482047002852, 0.2118394394459269, 0.021229688421911082, 0.35321846620480374, 0.09727942338763318, 0.10197741092974687, 0.037844952456213124, 0.1822520074320913, 0.11459979533830174, 0.14475374621903803, -0.17074993111039183, 0.11553729461381344, 0.04812442672651584]
|
1,803.08697
|
Future X-ray Polarimetry of Relativistic Accelerators: PWNe and SNRs
|
Supernova Remnants and Pulsar Wind Nebulae are among the most significant
sources of non-thermal X-rays in the sky, and the closest laboratories where
relativistic plasma dynamics and particle acceleration can be investigated.
Being strong synchrotron emitters, they are ideal candidates for X-ray
polarimetry, and indeed the Crab nebula is up to present the only object where
X-ray polarization has been detected with a high level of significance. Future
polarimetric measures will likely provide us crucial informations on the level
of turbulence that is expected at the particle acceleration sites, together
with the spacial and temporal coherence of the magnetic field geometry,
enabling us to set stronger constraints on our acceleration models. In PWNe it
will also allow us to estimate the level of internal dissipation. I will
briefly review the current knowledge on the polarization signatures in SNR/PWNe
and I will illustrate what can we hope to achieve with future missions like
IXPE/XIPE.
|
astro-ph.HE
|
supernova remnants and pulsar wind nebulae are among the most significant sources of nonthermal xrays in the sky and the closest laboratories where relativistic plasma dynamics and particle acceleration can be investigated being strong synchrotron emitters they are ideal candidates for xray polarimetry and indeed the crab nebula is up to present the only object where xray polarization has been detected with a high level of significance future polarimetric measures will likely provide us crucial informations on the level of turbulence that is expected at the particle acceleration sites together with the spacial and temporal coherence of the magnetic field geometry enabling us to set stronger constraints on our acceleration models in pwne it will also allow us to estimate the level of internal dissipation i will briefly review the current knowledge on the polarization signatures in snrpwne and i will illustrate what can we hope to achieve with future missions like ixpexipe
|
[['supernova', 'remnants', 'and', 'pulsar', 'wind', 'nebulae', 'are', 'among', 'the', 'most', 'significant', 'sources', 'of', 'nonthermal', 'xrays', 'in', 'the', 'sky', 'and', 'the', 'closest', 'laboratories', 'where', 'relativistic', 'plasma', 'dynamics', 'and', 'particle', 'acceleration', 'can', 'be', 'investigated', 'being', 'strong', 'synchrotron', 'emitters', 'they', 'are', 'ideal', 'candidates', 'for', 'xray', 'polarimetry', 'and', 'indeed', 'the', 'crab', 'nebula', 'is', 'up', 'to', 'present', 'the', 'only', 'object', 'where', 'xray', 'polarization', 'has', 'been', 'detected', 'with', 'a', 'high', 'level', 'of', 'significance', 'future', 'polarimetric', 'measures', 'will', 'likely', 'provide', 'us', 'crucial', 'informations', 'on', 'the', 'level', 'of', 'turbulence', 'that', 'is', 'expected', 'at', 'the', 'particle', 'acceleration', 'sites', 'together', 'with', 'the', 'spacial', 'and', 'temporal', 'coherence', 'of', 'the', 'magnetic', 'field', 'geometry', 'enabling', 'us', 'to', 'set', 'stronger', 'constraints', 'on', 'our', 'acceleration', 'models', 'in', 'pwne', 'it', 'will', 'also', 'allow', 'us', 'to', 'estimate', 'the', 'level', 'of', 'internal', 'dissipation', 'i', 'will', 'briefly', 'review', 'the', 'current', 'knowledge', 'on', 'the', 'polarization', 'signatures', 'in', 'snrpwne', 'and', 'i', 'will', 'illustrate', 'what', 'can', 'we', 'hope', 'to', 'achieve', 'with', 'future', 'missions', 'like', 'ixpexipe']]
|
[-0.06787345424103274, 0.13859006790259223, -0.06377103699013492, 0.12214396963596023, -0.13594480316210167, -0.10964407411940544, 0.0007951869305519276, 0.4329244795791953, -0.22891899718307823, -0.3358074317020148, 0.07802924643107227, -0.3073482106822167, -0.015552065112020525, 0.25098791873446413, -0.014612461853501024, -0.024988676744377523, 0.08334496562424677, -0.01111700910352485, -0.006290509654609918, -0.22398714833830818, 0.2696245092164651, 0.1927981166606954, 0.19730111209688006, 0.06257210391579776, 0.08887790281954684, -0.08524186541989372, -0.03935103861665945, 0.005286048104776847, -0.09384757434556666, 0.09519198335564945, 0.2308158109462845, 0.15978471305073294, 0.2013395300369389, -0.4497665746865288, -0.2136497645290408, 0.08722657326066138, 0.16703489900794843, 0.05609767597295122, -0.023922995244775782, -0.27942430384654476, 0.03129351777733853, -0.1583414646328137, -0.17144937741428318, -0.03563921144602216, 0.01982426117035554, 0.07219523358596674, -0.22429038066184148, 0.03259043898630042, 0.006013448936062933, 0.03232445332702767, -0.09190436767565321, -0.07648018117075082, 0.0041913203309160586, 0.08906900283528973, 0.044565530055948835, 0.050456841250947855, 0.14197345275049475, -0.16208138836035813, -0.1221309279813277, 0.4114562406987939, -0.02088708229461648, -0.09539117004771698, 0.24212587651001005, -0.2906115375249492, -0.18610156968926753, 0.13021533181952522, 0.17711380180218164, 0.05450028218236437, -0.15554066765467506, 0.02017118651126912, 0.013823643613557349, 0.1698377330745848, 0.03751640950348105, 0.09612298214605536, 0.326322993473304, 0.1489546682168298, 0.0476355087351276, 0.11288852040387616, -0.2301085175227818, -0.010349945495188828, -0.29172458105862437, -0.13217269727306452, -0.1252236195503802, 0.08457514834867803, -0.08638088383102044, -0.07229784666676235, 0.3883591855086682, 0.21907811366416366, 0.09800574913546166, -0.048618342778306234, 0.30201282122770684, 0.09488326336717039, 0.04097699120468059, 0.10498569792118047, 0.33031738388185566, 0.12703421426048836, 0.11684529794170367, -0.19676666439739088, 0.0861409293018923, -0.02778870243708671]
|
1,803.08698
|
Measurement of the evolution of technology: A new perspective
|
A fundamental problem in technological studies is how to measure the
evolution of technology. The literature has suggested several approaches to
measuring the level of technology (or state-of-the-art) and changes in
technology. However, the measurement of technological advances and
technological evolution is often a complex and elusive topic in science. The
study here starts by establishing a conceptual framework of technological
evolution based on the theory of technological parasitism, in broad analogy
with biology. Then, the measurement of the evolution of technology is modelled
in terms of morphological changes within complex systems considering the
interaction between a host technology and its subsystems of technology. The
coefficient of evolutionary growth of the model here indicates the grade and
type of the evolutionary route of a technology. This coefficient is quantified
in real instances using historical data of farm tractor, freight locomotive and
electricity generation technology in steam-powered plants and
internal-combustion plants. Overall, then, it seems that the approach here is
appropriate in grasping the typology of evolution of complex systems of
technology and in predicting which technologies are likeliest to evolve
rapidly.
|
q-fin.EC
|
a fundamental problem in technological studies is how to measure the evolution of technology the literature has suggested several approaches to measuring the level of technology or stateoftheart and changes in technology however the measurement of technological advances and technological evolution is often a complex and elusive topic in science the study here starts by establishing a conceptual framework of technological evolution based on the theory of technological parasitism in broad analogy with biology then the measurement of the evolution of technology is modelled in terms of morphological changes within complex systems considering the interaction between a host technology and its subsystems of technology the coefficient of evolutionary growth of the model here indicates the grade and type of the evolutionary route of a technology this coefficient is quantified in real instances using historical data of farm tractor freight locomotive and electricity generation technology in steampowered plants and internalcombustion plants overall then it seems that the approach here is appropriate in grasping the typology of evolution of complex systems of technology and in predicting which technologies are likeliest to evolve rapidly
|
[['a', 'fundamental', 'problem', 'in', 'technological', 'studies', 'is', 'how', 'to', 'measure', 'the', 'evolution', 'of', 'technology', 'the', 'literature', 'has', 'suggested', 'several', 'approaches', 'to', 'measuring', 'the', 'level', 'of', 'technology', 'or', 'stateoftheart', 'and', 'changes', 'in', 'technology', 'however', 'the', 'measurement', 'of', 'technological', 'advances', 'and', 'technological', 'evolution', 'is', 'often', 'a', 'complex', 'and', 'elusive', 'topic', 'in', 'science', 'the', 'study', 'here', 'starts', 'by', 'establishing', 'a', 'conceptual', 'framework', 'of', 'technological', 'evolution', 'based', 'on', 'the', 'theory', 'of', 'technological', 'parasitism', 'in', 'broad', 'analogy', 'with', 'biology', 'then', 'the', 'measurement', 'of', 'the', 'evolution', 'of', 'technology', 'is', 'modelled', 'in', 'terms', 'of', 'morphological', 'changes', 'within', 'complex', 'systems', 'considering', 'the', 'interaction', 'between', 'a', 'host', 'technology', 'and', 'its', 'subsystems', 'of', 'technology', 'the', 'coefficient', 'of', 'evolutionary', 'growth', 'of', 'the', 'model', 'here', 'indicates', 'the', 'grade', 'and', 'type', 'of', 'the', 'evolutionary', 'route', 'of', 'a', 'technology', 'this', 'coefficient', 'is', 'quantified', 'in', 'real', 'instances', 'using', 'historical', 'data', 'of', 'farm', 'tractor', 'freight', 'locomotive', 'and', 'electricity', 'generation', 'technology', 'in', 'steampowered', 'plants', 'and', 'internalcombustion', 'plants', 'overall', 'then', 'it', 'seems', 'that', 'the', 'approach', 'here', 'is', 'appropriate', 'in', 'grasping', 'the', 'typology', 'of', 'evolution', 'of', 'complex', 'systems', 'of', 'technology', 'and', 'in', 'predicting', 'which', 'technologies', 'are', 'likeliest', 'to', 'evolve', 'rapidly']]
|
[-0.10221468294091397, 0.09940739483416455, -0.0708263606904855, 0.009926328550004426, -0.050457302002267466, -0.11023096020421919, 0.02390055996222765, 0.3590267894701127, -0.2880751852299914, -0.3386660888062676, 0.12716707144408648, -0.26177831882787816, -0.2047958920251932, 0.22364762589054485, -0.07947579988892393, 0.031812459284728443, 0.0457241370202193, 0.0030632455671965745, -0.0405325467279441, -0.20514264823894884, 0.29736530044449067, 0.06137640840847399, 0.34054807297151807, 0.06795436509900503, 0.10939958621162463, -0.050724282532971995, -0.06991371728074035, -0.008436136551242967, -0.10407713913332245, 0.197489575108376, 0.2888704110343431, 0.19468168598761024, 0.3377584080164992, -0.42564916139333275, -0.23302282202942037, 0.06834127021401955, 0.11106753352686097, 0.07979904162221427, -0.06108353566443391, -0.24814575968840935, 0.03236050527496003, -0.1892930053086046, -0.14616665278701893, -0.01484179008211004, 0.0718783914793137, 0.03442808834272671, -0.20163559264766168, 0.03610887007486054, 0.01734909648335846, 0.08610831926623619, -0.07092939842396088, -0.06808938062619731, -0.012152173094628326, 0.17333201134925988, 0.014452735307124345, 0.010589206024292887, 0.1653637185874239, -0.1925115282400173, -0.14151340862736106, 0.40028858359632546, -0.029355543114078446, -0.1385690865091272, 0.20349626874878962, -0.15096462656634563, -0.14336377567242228, 0.04736156793123933, 0.21022324208378293, 0.0755953459048321, -0.17735293520062995, 0.06847681514346483, 0.06319406029102315, 0.14185281097953983, 0.01069503726942371, 0.025798130725827796, 0.2490861692840452, 0.2891261296388407, 0.03304863906876501, 0.06795056502519477, -0.026165024559507824, -0.1490528241876908, -0.21048968710400706, -0.18047712186569942, -0.16262417836062734, 0.05125928896885136, -0.04135333297074403, -0.150006197183523, 0.39186263674422683, 0.17272284120716697, 0.12594391052044054, -0.03596628356241106, 0.31276233877216636, 0.06604710903198213, 0.08134999539112599, -0.017512782258319787, 0.23371985753706798, 0.11337493068549012, 0.1822376921955059, -0.2043102074326042, 0.13735530290404055, -0.012567746819793012]
|
1,803.08699
|
Double Character Sums with Intervals and Arbitrary Sets in Finite Fields
|
We obtain a new bound on certain double sums of multiplicative characters
improving the range of several previous results. This improvement comes from
new bounds on the number of collinear triples in finite fields, which is a
classical object of study of additive combinatorics.
|
math.NT math.CO
|
we obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results this improvement comes from new bounds on the number of collinear triples in finite fields which is a classical object of study of additive combinatorics
|
[['we', 'obtain', 'a', 'new', 'bound', 'on', 'certain', 'double', 'sums', 'of', 'multiplicative', 'characters', 'improving', 'the', 'range', 'of', 'several', 'previous', 'results', 'this', 'improvement', 'comes', 'from', 'new', 'bounds', 'on', 'the', 'number', 'of', 'collinear', 'triples', 'in', 'finite', 'fields', 'which', 'is', 'a', 'classical', 'object', 'of', 'study', 'of', 'additive', 'combinatorics']]
|
[-0.1749720560884188, 0.08300942857319817, -0.08876382432539355, 0.04342767888606018, -0.10005728686651723, -0.03827753301117231, 0.1035851240158081, 0.2713126068172807, -0.2809588683938438, -0.3286950422281569, 0.07041031061883339, -0.2486322810661725, -0.11719484542581168, 0.3047067540570755, -0.12798538768071344, 0.028238322543488306, 0.07008449047465216, 0.0786226018839939, -0.11426385394720869, -0.3170478245751424, 0.35760120931081474, -0.017659098671918564, 0.21753236422823233, 0.06949424002827569, 0.07223129739180546, 0.04386192132634195, -0.06853182093155655, -0.043716480786150154, -0.15069649698720736, 0.2045273793310943, 0.21818471962416713, 0.06393819275862453, 0.25987692827104847, -0.34114117569036106, -0.17867307741702956, 0.1056710012595762, 0.11920240362682803, 0.09026545737817121, -0.0397906920036555, -0.2538749349557541, 0.1273765075840691, -0.19773368282370607, -0.06715487256984819, -0.06518418638204987, -0.03709873052271591, 0.06866783923363652, -0.26901841104369273, 0.021437295924194834, 0.15673405657236633, 0.0700404926742935, -0.01941948680376465, -0.22382929117884487, 0.10772398018426346, 0.13553145818877965, 0.043255354420662945, 0.03469735446692952, 0.06719480829567394, -0.1794200915028341, -0.19748986226675863, 0.3177245571701364, -0.08595341779767875, -0.1734166560186581, 0.16547524404119363, -0.1691692435732958, -0.1818474825281142, 0.16333968852731315, 0.1774860730352388, 0.162808935073289, -0.09883275856687264, 0.17378750195811418, -0.15568855692717162, 0.1245144814337519, 0.11640537371435626, 0.08393867677924308, 0.1317655433138663, 0.11882568298923699, 0.07951502288183705, 0.20189278477019715, -0.059416297505694354, -0.10142837502908977, -0.31901885247365996, -0.12666119170105297, -0.16103327231989664, 0.07318265501155773, -0.16750353292181072, -0.2529824309987651, 0.38804238742556085, 0.11205083036938132, 0.19537342026491056, 0.10657141332525168, 0.2491853739219633, 0.11916899571025913, 0.026500543325462124, -0.011588766088772734, 0.1767587698996067, 0.19572348463539543, -0.03026309167034924, -0.12256538546749983, -0.010729801830496977, 0.11087896463207224]
|
1,803.087
|
Determinantal Point Processes for Coresets
|
When faced with a data set too large to be processed all at once, an obvious
solution is to retain only part of it. In practice this takes a wide variety of
different forms, and among them "coresets" are especially appealing. A coreset
is a (small) weighted sample of the original data that comes with the following
guarantee: a cost function can be evaluated on the smaller set instead of the
larger one, with low relative error. For some classes of problems, and via a
careful choice of sampling distribution (based on the so-called "sensitivity"
metric), iid random sampling has turned to be one of the most successful
methods for building coresets efficiently. However, independent samples are
sometimes overly redundant, and one could hope that enforcing diversity would
lead to better performance. The difficulty lies in proving coreset properties
in non-iid samples. We show that the coreset property holds for samples formed
with determinantal point processes (DPP). DPPs are interesting because they are
a rare example of repulsive point processes with tractable theoretical
properties, enabling us to prove general coreset theorems. We apply our results
to both the k-means and the linear regression problems, and give extensive
empirical evidence that the small additional computational cost of DPP sampling
comes with superior performance over its iid counterpart. Of independent
interest, we also provide analytical formulas for the sensitivity in the linear
regression and 1-means cases.
|
stat.ML cs.DS cs.LG
|
when faced with a data set too large to be processed all at once an obvious solution is to retain only part of it in practice this takes a wide variety of different forms and among them coresets are especially appealing a coreset is a small weighted sample of the original data that comes with the following guarantee a cost function can be evaluated on the smaller set instead of the larger one with low relative error for some classes of problems and via a careful choice of sampling distribution based on the socalled sensitivity metric iid random sampling has turned to be one of the most successful methods for building coresets efficiently however independent samples are sometimes overly redundant and one could hope that enforcing diversity would lead to better performance the difficulty lies in proving coreset properties in noniid samples we show that the coreset property holds for samples formed with determinantal point processes dpp dpps are interesting because they are a rare example of repulsive point processes with tractable theoretical properties enabling us to prove general coreset theorems we apply our results to both the kmeans and the linear regression problems and give extensive empirical evidence that the small additional computational cost of dpp sampling comes with superior performance over its iid counterpart of independent interest we also provide analytical formulas for the sensitivity in the linear regression and 1means cases
|
[['when', 'faced', 'with', 'a', 'data', 'set', 'too', 'large', 'to', 'be', 'processed', 'all', 'at', 'once', 'an', 'obvious', 'solution', 'is', 'to', 'retain', 'only', 'part', 'of', 'it', 'in', 'practice', 'this', 'takes', 'a', 'wide', 'variety', 'of', 'different', 'forms', 'and', 'among', 'them', 'coresets', 'are', 'especially', 'appealing', 'a', 'coreset', 'is', 'a', 'small', 'weighted', 'sample', 'of', 'the', 'original', 'data', 'that', 'comes', 'with', 'the', 'following', 'guarantee', 'a', 'cost', 'function', 'can', 'be', 'evaluated', 'on', 'the', 'smaller', 'set', 'instead', 'of', 'the', 'larger', 'one', 'with', 'low', 'relative', 'error', 'for', 'some', 'classes', 'of', 'problems', 'and', 'via', 'a', 'careful', 'choice', 'of', 'sampling', 'distribution', 'based', 'on', 'the', 'socalled', 'sensitivity', 'metric', 'iid', 'random', 'sampling', 'has', 'turned', 'to', 'be', 'one', 'of', 'the', 'most', 'successful', 'methods', 'for', 'building', 'coresets', 'efficiently', 'however', 'independent', 'samples', 'are', 'sometimes', 'overly', 'redundant', 'and', 'one', 'could', 'hope', 'that', 'enforcing', 'diversity', 'would', 'lead', 'to', 'better', 'performance', 'the', 'difficulty', 'lies', 'in', 'proving', 'coreset', 'properties', 'in', 'noniid', 'samples', 'we', 'show', 'that', 'the', 'coreset', 'property', 'holds', 'for', 'samples', 'formed', 'with', 'determinantal', 'point', 'processes', 'dpp', 'dpps', 'are', 'interesting', 'because', 'they', 'are', 'a', 'rare', 'example', 'of', 'repulsive', 'point', 'processes', 'with', 'tractable', 'theoretical', 'properties', 'enabling', 'us', 'to', 'prove', 'general', 'coreset', 'theorems', 'we', 'apply', 'our', 'results', 'to', 'both', 'the', 'kmeans', 'and', 'the', 'linear', 'regression', 'problems', 'and', 'give', 'extensive', 'empirical', 'evidence', 'that', 'the', 'small', 'additional', 'computational', 'cost', 'of', 'dpp', 'sampling', 'comes', 'with', 'superior', 'performance', 'over', 'its', 'iid', 'counterpart', 'of', 'independent', 'interest', 'we', 'also', 'provide', 'analytical', 'formulas', 'for', 'the', 'sensitivity', 'in', 'the', 'linear', 'regression', 'and', '1means', 'cases']]
|
[-0.0664537754629303, 0.04390083728344409, -0.10386843531484448, 0.1054661343930401, -0.1066849680373629, -0.15930233169107222, 0.08914551314949798, 0.39949431820360887, -0.27581913028633853, -0.2917245772675723, 0.13209033618749083, -0.2778364329422972, -0.1253725033994892, 0.23223830190739023, -0.09572950946215826, 0.07977983288995547, 0.1153239576348859, 0.002465782936511545, -0.07482314480532584, -0.31045562760952394, 0.2962918729679219, 0.05388379572838737, 0.2740618807929188, 0.006984892047446045, 0.09886743739355243, 0.006248863004227948, -0.015912784617234325, 0.04092168964000384, -0.06842036605245522, 0.13413123431732446, 0.298568861272242, 0.16430233670502267, 0.3241432990295245, -0.40086054649835934, -0.18557381788778315, 0.1597391592864299, 0.1221261954878341, 0.10321074006719266, -0.06601809773418268, -0.23129218558295203, 0.12045994554666299, -0.10977186593916587, -0.09965182493888981, -0.11387566221945883, -0.0024882352755049267, 0.033873741937673334, -0.33036603264174874, 0.04094838801970757, 0.08665011681595947, 0.02468743941173569, -0.008226917078818471, -0.18924299502783243, 0.03046135424412467, 0.10662688991585006, 0.069004805932469, 0.013755009211340015, 0.10919626885245638, -0.11368239070029026, -0.09278982599883424, 0.3744950771207877, -0.022265589939902013, -0.22023824066355377, 0.2268959849137541, -0.11297315071324934, -0.16712533502515742, 0.16209263693093615, 0.1718495834509886, 0.10145268018673226, -0.13988899645754566, 0.08515631290746736, -0.04762306763633662, 0.144984110399667, 0.03702758285796565, 0.06221262441349491, 0.1604785794480164, 0.1865989885194519, 0.09526865663508537, 0.15507164871861734, -0.05688138955980719, -0.1026024402363042, -0.27778681530317395, -0.11624330783521661, -0.2182517035613476, 0.027939190164752017, -0.18129354197286618, -0.17115911110524137, 0.3399435108359663, 0.18127962219720714, 0.22644112086475152, 0.11691127316186868, 0.28556119236903255, 0.10816717395809271, 0.07185757516602517, 0.0753743441789431, 0.1999704333657025, 0.08213495773107389, 0.031662338422791224, -0.11640590884674804, 0.11635028318474029, 0.014406782702858612]
|
1,803.08701
|
The relationship of generalized manifolds to Poincar\'{e} duality
complexes and topological manifolds
|
The primary purpose of this paper concerns the relation of (compact)
generalized manifolds to finite Poincar\'{e} duality complexes (PD complexes).
The problem is that an arbitrary generalized manifold $X$ is always an ENR
space, but it is not necessarily a complex. Moreover, finite PD complexes
require the Poincar\'{e} duality with coefficients in the group ring $\Lambda$
($\Lambda$-complexes). Standard homology theory implies that $X$ is a
$\mathbb{Z}$-PD complex. Therefore by Browder's theorem, $X$ has a Spivak
normal fibration which in turn, determines a Thom class of the pair
$(N,\partial N)$ of a mapping cylinder neighborhood of $X$ in some Euclidean
space. Then $X$ satisfies the $\Lambda$-Poincar\'{e} duality if this class
induces an isomorphism with $\Lambda$-coefficients. Unfortunately, the proof of
Browder's theorem gives only isomorphisms with $\mathbb{Z}$-coefficients. It is
also not very helpful that $X$ is homotopy equivalent to a finite complex $K$,
because $K$ is not automatically a $\Lambda$-PD complex. Therefore it is
convenient to introduce $\Lambda$-PD structures. To prove their existence on
$X$, we use the construction of $2$-patch spaces and some fundamental results
of Bryant, Ferry, Mio, and Weinberger. Since the class of all $\Lambda$-PD
complexes does not contain all generalized manifolds, we appropriately enlarge
this class and then describe (i.e. recognize) generalized manifolds within this
enlarged class in terms of the Gromov-Hausdorff metric
|
math.GT math.AT
|
the primary purpose of this paper concerns the relation of compact generalized manifolds to finite poincare duality complexes pd complexes the problem is that an arbitrary generalized manifold x is always an enr space but it is not necessarily a complex moreover finite pd complexes require the poincare duality with coefficients in the group ring lambda lambdacomplexes standard homology theory implies that x is a mathbbzpd complex therefore by browders theorem x has a spivak normal fibration which in turn determines a thom class of the pair npartial n of a mapping cylinder neighborhood of x in some euclidean space then x satisfies the lambdapoincare duality if this class induces an isomorphism with lambdacoefficients unfortunately the proof of browders theorem gives only isomorphisms with mathbbzcoefficients it is also not very helpful that x is homotopy equivalent to a finite complex k because k is not automatically a lambdapd complex therefore it is convenient to introduce lambdapd structures to prove their existence on x we use the construction of 2patch spaces and some fundamental results of bryant ferry mio and weinberger since the class of all lambdapd complexes does not contain all generalized manifolds we appropriately enlarge this class and then describe ie recognize generalized manifolds within this enlarged class in terms of the gromovhausdorff metric
|
[['the', 'primary', 'purpose', 'of', 'this', 'paper', 'concerns', 'the', 'relation', 'of', 'compact', 'generalized', 'manifolds', 'to', 'finite', 'poincare', 'duality', 'complexes', 'pd', 'complexes', 'the', 'problem', 'is', 'that', 'an', 'arbitrary', 'generalized', 'manifold', 'x', 'is', 'always', 'an', 'enr', 'space', 'but', 'it', 'is', 'not', 'necessarily', 'a', 'complex', 'moreover', 'finite', 'pd', 'complexes', 'require', 'the', 'poincare', 'duality', 'with', 'coefficients', 'in', 'the', 'group', 'ring', 'lambda', 'lambdacomplexes', 'standard', 'homology', 'theory', 'implies', 'that', 'x', 'is', 'a', 'mathbbzpd', 'complex', 'therefore', 'by', 'browders', 'theorem', 'x', 'has', 'a', 'spivak', 'normal', 'fibration', 'which', 'in', 'turn', 'determines', 'a', 'thom', 'class', 'of', 'the', 'pair', 'npartial', 'n', 'of', 'a', 'mapping', 'cylinder', 'neighborhood', 'of', 'x', 'in', 'some', 'euclidean', 'space', 'then', 'x', 'satisfies', 'the', 'lambdapoincare', 'duality', 'if', 'this', 'class', 'induces', 'an', 'isomorphism', 'with', 'lambdacoefficients', 'unfortunately', 'the', 'proof', 'of', 'browders', 'theorem', 'gives', 'only', 'isomorphisms', 'with', 'mathbbzcoefficients', 'it', 'is', 'also', 'not', 'very', 'helpful', 'that', 'x', 'is', 'homotopy', 'equivalent', 'to', 'a', 'finite', 'complex', 'k', 'because', 'k', 'is', 'not', 'automatically', 'a', 'lambdapd', 'complex', 'therefore', 'it', 'is', 'convenient', 'to', 'introduce', 'lambdapd', 'structures', 'to', 'prove', 'their', 'existence', 'on', 'x', 'we', 'use', 'the', 'construction', 'of', '2patch', 'spaces', 'and', 'some', 'fundamental', 'results', 'of', 'bryant', 'ferry', 'mio', 'and', 'weinberger', 'since', 'the', 'class', 'of', 'all', 'lambdapd', 'complexes', 'does', 'not', 'contain', 'all', 'generalized', 'manifolds', 'we', 'appropriately', 'enlarge', 'this', 'class', 'and', 'then', 'describe', 'ie', 'recognize', 'generalized', 'manifolds', 'within', 'this', 'enlarged', 'class', 'in', 'terms', 'of', 'the', 'gromovhausdorff', 'metric']]
|
[-0.1548673762769937, 0.09416411407764999, -0.09814542053726401, 0.10119812111745442, -0.11013039651821187, -0.15880787424893247, 0.001052332594019683, 0.3548932355989689, -0.3189685025574613, -0.1951026884481417, 0.08514828804849484, -0.2182987278197137, -0.17185250068937485, 0.16169562150605057, -0.15102853155992838, -0.05510841236312949, 0.043276351783866, 0.08940797485190474, -0.10034350493660206, -0.26378312390143166, 0.39468655517872125, -0.02328971655756871, 0.2503771368461647, 0.07577663541978923, 0.138187887184035, 0.015736816470815814, 0.016869254004192577, 0.03215489865990214, -0.1318252243270082, 0.1464867027124977, 0.2990475255539155, 0.09074262778221749, 0.22004304707968406, -0.325390283522771, -0.1676605002963154, 0.2071387387825379, 0.11025540367203601, 0.01634173113709289, 0.005887414698413975, -0.25534840142221954, 0.15221210484176662, -0.1263221552511633, -0.16297357211494157, -0.08192070195163376, 0.06180883949772583, 0.0006635953700920276, -0.23493803689207757, -0.016768670306674546, 0.14272548245063044, 0.04138180543061663, -0.03519429094202251, -0.0413073550543408, -0.05431908525976736, 0.07644866835888722, -0.018360732339534433, 0.08738804683618918, 0.0759677678765674, -0.04122629264254847, -0.0723317587567202, 0.3706824246758675, -0.03655565911859839, -0.2592828857769828, 0.15261619876693908, -0.15178853760791228, -0.18413534935705045, 0.15796930405147974, 0.06265202129835713, 0.19560164488384155, -0.08825154691135678, 0.20818482581619835, -0.125884627365569, 0.13697204403844065, 0.07799854900211237, 0.021179366422049102, 0.12625033990811044, 0.09857699076614179, 0.12312321770747006, 0.10625653592450324, 0.0036290719690269205, -0.06927127753118477, -0.33189031437438826, -0.21463642269938465, -0.1413264220604735, 0.15339322487842424, -0.0952150648726968, -0.19124335604741888, 0.31451491524699315, 0.038165623004331975, 0.1869852821965, 0.09624105821677012, 0.19260437789282617, 0.047512822469996545, 0.0560267052814029, 0.05275201847141176, 0.1485320225159938, 0.20428704912774265, 0.03811562741125638, -0.11951006519480198, 0.007651362415862169, 0.18691621776515732]
|
1,803.08702
|
Fiber mode scrambler for the Subaru infrared Doppler instrument (IRD)
|
We report the results of fiber mode scrambler experiments for the Infra-Red
Doppler instrument (IRD) on the Subaru 8.2-m telescope. IRD is a fiber-fed,
high precision radial velocity (RV) instrument to search for exoplanets around
nearby M dwarfs at near-infrared wavelengths. It is a high-resolution
spectrograph with an Echelle grating. The expected RV measurement precision is
1 m s-1 with a state of the art laser frequency comb for the wavelength
calibration. In IRD observations, one of the most significant instrumental
noise is a change of intensity distribution of multi-mode fiber exit, which
degrades RV measurement precision. To stabilize the intensity distribution of
fiber exit an introduction of fiber mode scrambler is mandatory. Several kinds
of mode scramblers have been suggested in previous research, though it is
necessary to determine the most appropriate mode scrambler system for IRD.
Thus, we conducted systematic measurements of performance for a variety of mode
scramblers, both static and dynamic. We tested various length multi-mode
fibers, an octagonal fiber, a double fiber scrambler, and two kinds of dynamic
scramblers, and their combinations. We report the performances of these mode
scramblers and propose candidate mode scrambler systems for IRD.
|
astro-ph.IM astro-ph.EP
|
we report the results of fiber mode scrambler experiments for the infrared doppler instrument ird on the subaru 82m telescope ird is a fiberfed high precision radial velocity rv instrument to search for exoplanets around nearby m dwarfs at nearinfrared wavelengths it is a highresolution spectrograph with an echelle grating the expected rv measurement precision is 1 m s1 with a state of the art laser frequency comb for the wavelength calibration in ird observations one of the most significant instrumental noise is a change of intensity distribution of multimode fiber exit which degrades rv measurement precision to stabilize the intensity distribution of fiber exit an introduction of fiber mode scrambler is mandatory several kinds of mode scramblers have been suggested in previous research though it is necessary to determine the most appropriate mode scrambler system for ird thus we conducted systematic measurements of performance for a variety of mode scramblers both static and dynamic we tested various length multimode fibers an octagonal fiber a double fiber scrambler and two kinds of dynamic scramblers and their combinations we report the performances of these mode scramblers and propose candidate mode scrambler systems for ird
|
[['we', 'report', 'the', 'results', 'of', 'fiber', 'mode', 'scrambler', 'experiments', 'for', 'the', 'infrared', 'doppler', 'instrument', 'ird', 'on', 'the', 'subaru', '82m', 'telescope', 'ird', 'is', 'a', 'fiberfed', 'high', 'precision', 'radial', 'velocity', 'rv', 'instrument', 'to', 'search', 'for', 'exoplanets', 'around', 'nearby', 'm', 'dwarfs', 'at', 'nearinfrared', 'wavelengths', 'it', 'is', 'a', 'highresolution', 'spectrograph', 'with', 'an', 'echelle', 'grating', 'the', 'expected', 'rv', 'measurement', 'precision', 'is', '1', 'm', 's1', 'with', 'a', 'state', 'of', 'the', 'art', 'laser', 'frequency', 'comb', 'for', 'the', 'wavelength', 'calibration', 'in', 'ird', 'observations', 'one', 'of', 'the', 'most', 'significant', 'instrumental', 'noise', 'is', 'a', 'change', 'of', 'intensity', 'distribution', 'of', 'multimode', 'fiber', 'exit', 'which', 'degrades', 'rv', 'measurement', 'precision', 'to', 'stabilize', 'the', 'intensity', 'distribution', 'of', 'fiber', 'exit', 'an', 'introduction', 'of', 'fiber', 'mode', 'scrambler', 'is', 'mandatory', 'several', 'kinds', 'of', 'mode', 'scramblers', 'have', 'been', 'suggested', 'in', 'previous', 'research', 'though', 'it', 'is', 'necessary', 'to', 'determine', 'the', 'most', 'appropriate', 'mode', 'scrambler', 'system', 'for', 'ird', 'thus', 'we', 'conducted', 'systematic', 'measurements', 'of', 'performance', 'for', 'a', 'variety', 'of', 'mode', 'scramblers', 'both', 'static', 'and', 'dynamic', 'we', 'tested', 'various', 'length', 'multimode', 'fibers', 'an', 'octagonal', 'fiber', 'a', 'double', 'fiber', 'scrambler', 'and', 'two', 'kinds', 'of', 'dynamic', 'scramblers', 'and', 'their', 'combinations', 'we', 'report', 'the', 'performances', 'of', 'these', 'mode', 'scramblers', 'and', 'propose', 'candidate', 'mode', 'scrambler', 'systems', 'for', 'ird']]
|
[-0.15746669670074714, 0.12337471326350757, -0.105900520034173, -0.043670135109873554, -0.11470263332630377, -0.1692206789425772, 0.017246444119680963, 0.4661595549415121, -0.18687432885309924, -0.26993095125626637, 0.1429095419179262, -0.25638788728115214, -0.08288025019034126, 0.2739416366259669, -0.07424637717508513, 0.11168238600846284, 0.13377549936826016, -0.04804583437562259, 0.01827754249670808, -0.22258970821807111, 0.24685876584524974, 0.1183052730934762, 0.2891338837472963, -0.0686155595512665, 0.13321654886547765, 0.0054231971041468294, -0.07434256806115529, -0.03814063471298028, -0.14674996366299728, 0.058031357783785605, 0.25265956749184143, 0.09104696930949503, 0.24818180749672972, -0.30396131727448783, -0.16486891807138998, 0.07448758801609433, 0.12316146450011069, 0.04319846934163605, -0.015692944793450438, -0.27050428925844516, 0.06166055930749431, -0.11529784827551037, -0.1731289287635796, -0.041066987883936555, 0.01219065019310756, 0.027268256849749255, -0.27314778819796026, -0.03632719295191062, -0.0071794665889052065, 0.15016874223175444, -0.061356385075155444, -0.11093712241178948, 0.016176777441836314, 0.09970064718671953, -0.0487919945651038, 0.0026471498126008457, 0.11556034648086431, -0.12689610887946165, -0.0677056604455867, 0.3547342718419633, -0.1461577886230568, -0.07682745346625774, 0.136182000966733, -0.19031402696565836, -0.10406717442222171, 0.16737135424076005, 0.17169162570233482, 0.11692616829667916, -0.10806487194428925, -0.0021732594212275865, 0.024898341660257527, 0.2506386408813954, 0.12255718499552362, 0.1493821015793811, 0.23718031317386487, 0.19745212290291264, 0.05963292680656624, 0.09057380537589327, -0.27856050512676217, -0.002681650918030175, -0.25517420211509523, -0.16361326503523968, -0.13828428658862463, 0.030148310647430527, -0.09169328095206818, -0.12064948655336787, 0.3821161463796378, 0.09807375969649944, 0.13331258542102237, 0.02554645960115456, 0.35596045015929895, 0.0833294756747927, 0.10170737663350295, -0.030677547412948595, 0.3323764688687621, 0.14667218554236594, 0.1172535209916532, -0.25890944367805446, -0.026016563317048425, -0.009538271791787838]
|
1,803.08703
|
Exploring the physics of the accretion and jet in nearby narrow-line
Seyfert 1 galaxies
|
In this paper, we explore the physics of the accretion and jet in narrow-line
Seyfert 1 galaxies (NLS1). Specifically, we compile a sample composed of 16
nearby NLS1 with $L_{\rm bol}/L_{\rm Edd} \gtrsim 0.1$. We investigate the
mutual correlation between their radio luminosity $L_{\rm R}$, X-ray luminosity
$L_{\rm X}$, optical luminosity $L_{\rm 5100}$ and black hole mass $M_{\rm
BH}$. By adopting partial correlation analysis: (1) we find a positive
correlation between $L_{\rm X}$ and $M_{\rm BH}$, and (2) we find a weak
positive correlation between $L_{\rm R}$ and $L_{5100}$. However, we don't find
significant correlations between $L_{\rm R}$ and $L_{\rm X}$ or between $L_{\rm
X}$ and $L_{5100}$ after considering the effect of the black hole mass, which
leads to a finding of the independence of $L_{\rm X}/L_{\rm Edd}$ on
$L_{5100}/L_{\rm Edd}$. Interestingly, the findings that $L_{\rm X}$ is
correlated with $M_{\rm BH}$ and $L_{\rm X}/L_{\rm Edd}$ is not correlated with
$L_{5100}/L_{\rm Edd}$ support that the X-ray emission is saturated with
increasing $\dot{M}$ for $L_{\rm bol}/L_{\rm Edd} \gtrsim 0.1$ in NLS1s, which
may be understood in the framework of slim disc scenario. Finally, we suggest
that a larger NLS1 sample with high quality radio and X-ray data is needed to
further confirm this result in the future.
|
astro-ph.HE astro-ph.GA
|
in this paper we explore the physics of the accretion and jet in narrowline seyfert 1 galaxies nls1 specifically we compile a sample composed of 16 nearby nls1 with l_rm boll_rm edd gtrsim 01 we investigate the mutual correlation between their radio luminosity l_rm r xray luminosity l_rm x optical luminosity l_rm 5100 and black hole mass m_rm bh by adopting partial correlation analysis 1 we find a positive correlation between l_rm x and m_rm bh and 2 we find a weak positive correlation between l_rm r and l_5100 however we dont find significant correlations between l_rm r and l_rm x or between l_rm x and l_5100 after considering the effect of the black hole mass which leads to a finding of the independence of l_rm xl_rm edd on l_5100l_rm edd interestingly the findings that l_rm x is correlated with m_rm bh and l_rm xl_rm edd is not correlated with l_5100l_rm edd support that the xray emission is saturated with increasing dotm for l_rm boll_rm edd gtrsim 01 in nls1s which may be understood in the framework of slim disc scenario finally we suggest that a larger nls1 sample with high quality radio and xray data is needed to further confirm this result in the future
|
[['in', 'this', 'paper', 'we', 'explore', 'the', 'physics', 'of', 'the', 'accretion', 'and', 'jet', 'in', 'narrowline', 'seyfert', '1', 'galaxies', 'nls1', 'specifically', 'we', 'compile', 'a', 'sample', 'composed', 'of', '16', 'nearby', 'nls1', 'with', 'l_rm', 'boll_rm', 'edd', 'gtrsim', '01', 'we', 'investigate', 'the', 'mutual', 'correlation', 'between', 'their', 'radio', 'luminosity', 'l_rm', 'r', 'xray', 'luminosity', 'l_rm', 'x', 'optical', 'luminosity', 'l_rm', '5100', 'and', 'black', 'hole', 'mass', 'm_rm', 'bh', 'by', 'adopting', 'partial', 'correlation', 'analysis', '1', 'we', 'find', 'a', 'positive', 'correlation', 'between', 'l_rm', 'x', 'and', 'm_rm', 'bh', 'and', '2', 'we', 'find', 'a', 'weak', 'positive', 'correlation', 'between', 'l_rm', 'r', 'and', 'l_5100', 'however', 'we', 'dont', 'find', 'significant', 'correlations', 'between', 'l_rm', 'r', 'and', 'l_rm', 'x', 'or', 'between', 'l_rm', 'x', 'and', 'l_5100', 'after', 'considering', 'the', 'effect', 'of', 'the', 'black', 'hole', 'mass', 'which', 'leads', 'to', 'a', 'finding', 'of', 'the', 'independence', 'of', 'l_rm', 'xl_rm', 'edd', 'on', 'l_5100l_rm', 'edd', 'interestingly', 'the', 'findings', 'that', 'l_rm', 'x', 'is', 'correlated', 'with', 'm_rm', 'bh', 'and', 'l_rm', 'xl_rm', 'edd', 'is', 'not', 'correlated', 'with', 'l_5100l_rm', 'edd', 'support', 'that', 'the', 'xray', 'emission', 'is', 'saturated', 'with', 'increasing', 'dotm', 'for', 'l_rm', 'boll_rm', 'edd', 'gtrsim', '01', 'in', 'nls1s', 'which', 'may', 'be', 'understood', 'in', 'the', 'framework', 'of', 'slim', 'disc', 'scenario', 'finally', 'we', 'suggest', 'that', 'a', 'larger', 'nls1', 'sample', 'with', 'high', 'quality', 'radio', 'and', 'xray', 'data', 'is', 'needed', 'to', 'further', 'confirm', 'this', 'result', 'in', 'the', 'future']]
|
[-0.0965187999804495, 0.08633195544483468, 0.061538399251944875, 0.2044473772231654, -0.03985534516259042, -0.16251415603419803, 0.05627142676801704, 0.505332046991908, -0.08853030249969486, -0.30945089692021627, 0.030474095529415553, -0.3939228478417385, 0.028326888170376346, 0.23487613414152864, -0.003184977560914715, -0.017308081447731192, -0.07021260062830668, -0.1674870141580993, -0.15019420048737825, -0.18760113838567016, 0.3110953793477486, 0.07573595250427138, 0.17784962399552265, 0.032902671904166174, 0.05582787458101224, -0.05495161692356216, -0.0037940442630582873, 0.007058907318495068, -0.17629004102901472, -0.001596644269667712, 0.27987445473976835, 0.15438346898950198, 0.237663318440729, -0.2973511168825544, -0.09146850806085721, 0.08604790337210265, 0.1766669719717374, -0.12289315093806305, 0.007084135543788993, -0.16478550206303744, 0.05736257412639793, -0.28360699224924923, -0.07176411683972486, 0.11882768515451793, 0.1616752167624951, 0.022809575567220342, -0.28408007248699685, 0.22339261023272924, 0.06354741427725565, -0.0007273757124922293, -0.06196343022291366, -0.0076282647468021835, -0.09255496972222246, -0.028597794029195153, 0.09454130824637033, 0.17221577633879895, 0.17897698523102365, -0.11211544159096758, -0.052946716092193646, 0.343450234435937, -0.022488961143786654, 0.014529303024413394, 0.2035092358915683, -0.2787599029480571, -0.18471078024081447, 0.092579386464101, 0.13940489247033838, 0.13120626443860067, -0.08171763036493669, 0.03548426205473815, -0.030947548975282367, 0.3456163441981463, -0.04600829011121509, 0.11832923998579145, 0.33570499801962617, 0.11334098542198155, -0.021861319106035663, 0.09027871767494955, -0.2073082604888352, 0.051267938729485166, -0.24817873584106565, -0.10162653444450709, -0.12832001005482002, 0.24572988241112292, -0.20279665051181356, -0.05594867395748403, 0.21651835798733302, 0.15063267573543057, 0.3234143445574149, 0.14589157796067678, 0.23626730684190989, 0.14442490180497805, 0.04594912493656225, 0.20277244716942056, 0.3373415835804361, 0.1384011662266144, 0.06469124683245159, -0.2768988341398939, 0.037755297354249026, 0.021004407397270494]
|
1,803.08704
|
On the Picard numbers of abelian varieties in positive characteristic
|
In this paper, we study the set $R_g^{(p)}$ of possible Picard numbers of
abelian varieties of dimension $g$ over algebraically closed fields of
characteristic $p>0$. We show that many of the results for complex abelian
varieties have analogues in positive characteristic: non-completeness in
dimension $g \geq 2$, asymptotic completeness as $g \rightarrow +\infty$,
structure results for abelian varieties of large Picard number. On the way, we
highlight and discuss new characteristic $p>0$ features and pathologies:
non-additivity of the range of Picard numbers, supersingularity index of an
abelian variety, dependence of $R_g^{(p)}$ on $p$, relation to the $p$-rank and
the Newton polygon.
|
math.AG
|
in this paper we study the set r_gp of possible picard numbers of abelian varieties of dimension g over algebraically closed fields of characteristic p0 we show that many of the results for complex abelian varieties have analogues in positive characteristic noncompleteness in dimension g geq 2 asymptotic completeness as g rightarrow infty structure results for abelian varieties of large picard number on the way we highlight and discuss new characteristic p0 features and pathologies nonadditivity of the range of picard numbers supersingularity index of an abelian variety dependence of r_gp on p relation to the prank and the newton polygon
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'set', 'r_gp', 'of', 'possible', 'picard', 'numbers', 'of', 'abelian', 'varieties', 'of', 'dimension', 'g', 'over', 'algebraically', 'closed', 'fields', 'of', 'characteristic', 'p0', 'we', 'show', 'that', 'many', 'of', 'the', 'results', 'for', 'complex', 'abelian', 'varieties', 'have', 'analogues', 'in', 'positive', 'characteristic', 'noncompleteness', 'in', 'dimension', 'g', 'geq', '2', 'asymptotic', 'completeness', 'as', 'g', 'rightarrow', 'infty', 'structure', 'results', 'for', 'abelian', 'varieties', 'of', 'large', 'picard', 'number', 'on', 'the', 'way', 'we', 'highlight', 'and', 'discuss', 'new', 'characteristic', 'p0', 'features', 'and', 'pathologies', 'nonadditivity', 'of', 'the', 'range', 'of', 'picard', 'numbers', 'supersingularity', 'index', 'of', 'an', 'abelian', 'variety', 'dependence', 'of', 'r_gp', 'on', 'p', 'relation', 'to', 'the', 'prank', 'and', 'the', 'newton', 'polygon']]
|
[-0.21475968418073738, 0.08635059853420696, -0.08997940309722015, 0.07502264124364827, -0.07509157146242532, -0.11964730798934746, -0.006998386637382962, 0.3204322150071161, -0.30386019760808636, -0.25849301031216826, 0.01996488983606487, -0.23240298415167313, -0.1334550805352252, 0.25902178305944407, -0.13005988785263264, -0.030613005331498713, -0.03260526345746422, 0.1203762879642197, -0.05072156695068127, -0.34748678560124124, 0.42317427707967736, -0.09899832710924775, 0.22560229026853587, 0.05919128628165433, 0.08822437348502754, 0.0030342514316240945, 0.0314894655832287, 0.02019972269037607, -0.17964664927833404, 0.08171950769845886, 0.3273764101017003, 0.08008593659038947, 0.20937706507751813, -0.33360274151118113, -0.16316078959804292, 0.24084833700849553, 0.15435852132022682, -0.0015062280939986007, -0.0015295813203497668, -0.20928923856241233, 0.15790543848215932, -0.15663016750242073, -0.21379883511514036, -0.11030793221046527, 0.15172886314585504, 0.036159017845292137, -0.21804562745077272, -0.017193171332091695, 0.08059085316302236, 0.22684882442946686, -0.04300882637905277, -0.18181678209679597, -0.016704615269025617, 0.03362663148789469, 0.05085559324784712, -0.009974012644067783, 0.07228119973789411, -0.16516721641851795, -0.107894544593162, 0.33122373942398664, -0.08586256068689052, -0.1524789189411835, 0.15607914267427692, -0.20589158295493837, -0.14923572758532533, 0.16319621879268775, 0.16036842341036206, 0.20297292105364378, 0.08728094876807352, 0.2121702141270766, -0.12727435293485118, 0.0818301820186804, 0.101980572848609, 0.013814756952489566, 0.09977806875990196, 0.06989820667711849, 0.04191095519027757, 0.12099220653563136, -0.04864919077454492, 0.03010304521879821, -0.4002404337128003, -0.20649010649496558, -0.11339683570155892, 0.1907848178343189, -0.15677967241855287, -0.13749978694161683, 0.4070148981279797, 0.0968162726770823, 0.17935183971668733, 0.1346528681484286, 0.20488345410411407, 0.014727849943823219, 0.0056285663282103614, 0.03896835244100804, 0.08259577684650066, 0.25656220055364, -0.07978812811280027, -0.1838401902391754, -0.04874848189171065, 0.17289584793733678]
|
1,803.08705
|
Suppression of the critical collapse for one-dimensional solitons by
saturable quintic nonlinear lattices
|
The stabilization of one-dimensional solitons by a nonlinear lattice against
the critical collapse in the focusing quintic medium is a challenging issue. We
demonstrate that this purpose can be achieved by combining a
nonlinearlatticeandsaturationofthequinticnonlinearity.
Thesystemsupportsthreespeciesofsolitons, namely, fundamental (even-parity) ones
and dipole (odd-parity) modes of on- and off-site-centered types. Very narrow
fundamental solitons are found in an approximate analytical form, and
systematic results for very broad unstable and moderately broad partly stable
solitons, including their existence and stability areas, are produced by means
of numerical methods. Stability regions of the solitons are identified by means
of systematic simulations. The stability of all the soliton species obeys the
Vakhitov-Kolokolov criterion.
|
physics.optics nlin.PS
|
the stabilization of onedimensional solitons by a nonlinear lattice against the critical collapse in the focusing quintic medium is a challenging issue we demonstrate that this purpose can be achieved by combining a nonlinearlatticeandsaturationofthequinticnonlinearity thesystemsupportsthreespeciesofsolitons namely fundamental evenparity ones and dipole oddparity modes of on and offsitecentered types very narrow fundamental solitons are found in an approximate analytical form and systematic results for very broad unstable and moderately broad partly stable solitons including their existence and stability areas are produced by means of numerical methods stability regions of the solitons are identified by means of systematic simulations the stability of all the soliton species obeys the vakhitovkolokolov criterion
|
[['the', 'stabilization', 'of', 'onedimensional', 'solitons', 'by', 'a', 'nonlinear', 'lattice', 'against', 'the', 'critical', 'collapse', 'in', 'the', 'focusing', 'quintic', 'medium', 'is', 'a', 'challenging', 'issue', 'we', 'demonstrate', 'that', 'this', 'purpose', 'can', 'be', 'achieved', 'by', 'combining', 'a', 'nonlinearlatticeandsaturationofthequinticnonlinearity', 'thesystemsupportsthreespeciesofsolitons', 'namely', 'fundamental', 'evenparity', 'ones', 'and', 'dipole', 'oddparity', 'modes', 'of', 'on', 'and', 'offsitecentered', 'types', 'very', 'narrow', 'fundamental', 'solitons', 'are', 'found', 'in', 'an', 'approximate', 'analytical', 'form', 'and', 'systematic', 'results', 'for', 'very', 'broad', 'unstable', 'and', 'moderately', 'broad', 'partly', 'stable', 'solitons', 'including', 'their', 'existence', 'and', 'stability', 'areas', 'are', 'produced', 'by', 'means', 'of', 'numerical', 'methods', 'stability', 'regions', 'of', 'the', 'solitons', 'are', 'identified', 'by', 'means', 'of', 'systematic', 'simulations', 'the', 'stability', 'of', 'all', 'the', 'soliton', 'species', 'obeys', 'the', 'vakhitovkolokolov', 'criterion']]
|
[-0.17863803043937362, 0.11664941468188772, -0.06049344938178108, 0.08744338664604034, -0.028780962002270344, -0.1373287221408045, 0.021034357296127192, 0.364161504151405, -0.2008688850152605, -0.2479582497639195, 0.12408120120339587, -0.24781971090947683, -0.13433900239156946, 0.21537749653787547, 0.021990030670081668, 0.0648346783874451, 0.04979609210650384, -0.04114576469105229, -0.022824996648540825, -0.2002908351165594, 0.3592988502866817, 0.010260575732659935, 0.29313648794338387, 0.050556166422606075, 0.021289615988451877, -0.05892451169443721, -0.009510094752394647, 0.04612423714584196, -0.1649438983188719, 0.10979335886241763, 0.23103111512291263, 0.0351036418150267, 0.265598826532094, -0.4062532129047333, -0.2299880994119207, 0.07886201461320216, 0.19547622465915135, 0.16227660194601654, -0.08925891739128483, -0.3277555459073551, 0.11514347774978236, -0.11442439349473647, -0.19110090482347417, -0.15089407996801696, 0.010447441775984358, 0.09990143728495207, -0.22552661726005235, 0.1277694920218497, 0.06844762216579116, 0.06495747561478671, -0.08630901254397237, -0.07170411650495569, -0.060202993303185924, 0.04845882940461929, 0.04719382337127584, -0.06915827985097356, 0.06473321624469223, -0.167946748613947, -0.0847798332238113, 0.4150507942694327, -0.07992564724266248, -0.1844724478498804, 0.1969207905777642, -0.06795722727426591, -0.0730608513376693, 0.17926317302264133, 0.12615921336032873, 0.1546138935186461, -0.08574207609888378, 0.03446914865536492, -0.019515223123510984, 0.1625703904261035, 0.10183243299307267, 0.04107086947802806, 0.254202493202855, 0.18029625463422458, 0.04609147519013792, 0.14474764988067965, -0.04716604575734445, -0.1320619580757646, -0.2862135866340601, -0.06032721635024502, -0.13380570733537547, -0.0032336464962254294, -0.07754486983898426, -0.1329980359384175, 0.41610177075446425, 0.04122264764002878, 0.1653115563248372, -0.020825873304791045, 0.26429230222513656, 0.12526657955088424, 0.012385572471550473, 0.050327339231581336, 0.3243025019413458, 0.16574320972036077, 0.06419167782505096, -0.2328508142601558, -0.0015100251843731076, 0.05323895941629022]
|
1,803.08706
|
Alarm-Based Prescriptive Process Monitoring
|
Predictive process monitoring is concerned with the analysis of events
produced during the execution of a process in order to predict the future state
of ongoing cases thereof. Existing techniques in this field are able to
predict, at each step of a case, the likelihood that the case will end up in an
undesired outcome. These techniques, however, do not take into account what
process workers may do with the generated predictions in order to decrease the
likelihood of undesired outcomes. This paper proposes a framework for
prescriptive process monitoring, which extends predictive process monitoring
approaches with the concepts of alarms, interventions, compensations, and
mitigation effects. The framework incorporates a parameterized cost model to
assess the cost-benefit tradeoffs of applying prescriptive process monitoring
in a given setting. The paper also outlines an approach to optimize the
generation of alarms given a dataset and a set of cost model parameters. The
proposed approach is empirically evaluated using a range of real-life event
logs.
|
cs.LG cs.AI
|
predictive process monitoring is concerned with the analysis of events produced during the execution of a process in order to predict the future state of ongoing cases thereof existing techniques in this field are able to predict at each step of a case the likelihood that the case will end up in an undesired outcome these techniques however do not take into account what process workers may do with the generated predictions in order to decrease the likelihood of undesired outcomes this paper proposes a framework for prescriptive process monitoring which extends predictive process monitoring approaches with the concepts of alarms interventions compensations and mitigation effects the framework incorporates a parameterized cost model to assess the costbenefit tradeoffs of applying prescriptive process monitoring in a given setting the paper also outlines an approach to optimize the generation of alarms given a dataset and a set of cost model parameters the proposed approach is empirically evaluated using a range of reallife event logs
|
[['predictive', 'process', 'monitoring', 'is', 'concerned', 'with', 'the', 'analysis', 'of', 'events', 'produced', 'during', 'the', 'execution', 'of', 'a', 'process', 'in', 'order', 'to', 'predict', 'the', 'future', 'state', 'of', 'ongoing', 'cases', 'thereof', 'existing', 'techniques', 'in', 'this', 'field', 'are', 'able', 'to', 'predict', 'at', 'each', 'step', 'of', 'a', 'case', 'the', 'likelihood', 'that', 'the', 'case', 'will', 'end', 'up', 'in', 'an', 'undesired', 'outcome', 'these', 'techniques', 'however', 'do', 'not', 'take', 'into', 'account', 'what', 'process', 'workers', 'may', 'do', 'with', 'the', 'generated', 'predictions', 'in', 'order', 'to', 'decrease', 'the', 'likelihood', 'of', 'undesired', 'outcomes', 'this', 'paper', 'proposes', 'a', 'framework', 'for', 'prescriptive', 'process', 'monitoring', 'which', 'extends', 'predictive', 'process', 'monitoring', 'approaches', 'with', 'the', 'concepts', 'of', 'alarms', 'interventions', 'compensations', 'and', 'mitigation', 'effects', 'the', 'framework', 'incorporates', 'a', 'parameterized', 'cost', 'model', 'to', 'assess', 'the', 'costbenefit', 'tradeoffs', 'of', 'applying', 'prescriptive', 'process', 'monitoring', 'in', 'a', 'given', 'setting', 'the', 'paper', 'also', 'outlines', 'an', 'approach', 'to', 'optimize', 'the', 'generation', 'of', 'alarms', 'given', 'a', 'dataset', 'and', 'a', 'set', 'of', 'cost', 'model', 'parameters', 'the', 'proposed', 'approach', 'is', 'empirically', 'evaluated', 'using', 'a', 'range', 'of', 'reallife', 'event', 'logs']]
|
[-0.07532590176956153, 0.02773835704921325, -0.08413592244808872, 0.061667534556823896, -0.08293997846474802, -0.11780411628920033, 0.10927785919938972, 0.3774257672513709, -0.2513731837094428, -0.3376144519805862, 0.11817628840278449, -0.2737439940582938, -0.14472983896956537, 0.18475410854875077, -0.12659727403158208, 0.08831371101090846, 0.10849200829469749, 0.017223260297876908, -0.023932675976898337, -0.2733297660762881, 0.2835228070343649, 0.09707455792935726, 0.2989619505062791, 0.03491160403477189, 0.09652751607153519, 0.012082032378932553, -0.07292511204493313, 0.006948350679443665, -0.09200688002040548, 0.10634062827829226, 0.30426736189667597, 0.21458954937514607, 0.34692067303694785, -0.42468697570816233, -0.22850670160173817, 0.13422773392112167, 0.12346461848901975, 0.08533107573407225, -0.00966314495437675, -0.27163398925525445, 0.07024345641135077, -0.2164978224174752, -0.10866866272552238, -0.08843985674787819, -0.03461982805589444, -0.022177738273361076, -0.3458908435077993, 0.029514048140557816, 0.059685786015765144, 0.03881849948155843, -0.04484970925410313, -0.07481224864094668, 0.026041054064810366, 0.15065402569778172, 0.08474546978516033, 0.008509340259120052, 0.16721735922670003, -0.13468927543115927, -0.18403894196114975, 0.3691534020845997, -0.0229305519455078, -0.1751447716773844, 0.16290595897338295, -0.08117693785669995, -0.1510557609238018, 0.12003940386973598, 0.2626762558982052, 0.12279629733781387, -0.20632006259876545, 0.00038982549736874157, 0.06481371842968611, 0.1739219529784204, -0.004758672442367691, -0.023264703605278037, 0.18703290261471944, 0.23889749156840054, 0.03457977459837832, 0.13802400403972256, -0.07539827225120439, -0.08238711183384796, -0.3056835281794868, -0.12971103622543592, -0.11552292393681443, -0.01903351961286885, -0.05050060751737975, -0.1357787384732086, 0.40485578977767334, 0.25513242181450885, 0.1769345390357445, 0.07610778133657957, 0.3348038484123938, 0.09690885538356393, 0.0545809299952385, 0.033268443320268466, 0.19290206108363, 0.0013205209965415207, 0.11558911507880246, -0.18705837555764313, 0.15242579291189481, 0.0017158776538929454]
|
1,803.08707
|
Optimizing the Trade-off between Single-Stage and Two-Stage Object
Detectors using Image Difficulty Prediction
|
There are mainly two types of state-of-the-art object detectors. On one hand,
we have two-stage detectors, such as Faster R-CNN (Region-based Convolutional
Neural Networks) or Mask R-CNN, that (i) use a Region Proposal Network to
generate regions of interests in the first stage and (ii) send the region
proposals down the pipeline for object classification and bounding-box
regression. Such models reach the highest accuracy rates, but are typically
slower. On the other hand, we have single-stage detectors, such as YOLO (You
Only Look Once) and SSD (Singe Shot MultiBox Detector), that treat object
detection as a simple regression problem by taking an input image and learning
the class probabilities and bounding box coordinates. Such models reach lower
accuracy rates, but are much faster than two-stage object detectors. In this
paper, we propose to use an image difficulty predictor to achieve an optimal
trade-off between accuracy and speed in object detection. The image difficulty
predictor is applied on the test images to split them into easy versus hard
images. Once separated, the easy images are sent to the faster single-stage
detector, while the hard images are sent to the more accurate two-stage
detector. Our experiments on PASCAL VOC 2007 show that using image difficulty
compares favorably to a random split of the images. Our method is flexible, in
that it allows to choose a desired threshold for splitting the images into easy
versus hard.
|
cs.CV
|
there are mainly two types of stateoftheart object detectors on one hand we have twostage detectors such as faster rcnn regionbased convolutional neural networks or mask rcnn that i use a region proposal network to generate regions of interests in the first stage and ii send the region proposals down the pipeline for object classification and boundingbox regression such models reach the highest accuracy rates but are typically slower on the other hand we have singlestage detectors such as yolo you only look once and ssd singe shot multibox detector that treat object detection as a simple regression problem by taking an input image and learning the class probabilities and bounding box coordinates such models reach lower accuracy rates but are much faster than twostage object detectors in this paper we propose to use an image difficulty predictor to achieve an optimal tradeoff between accuracy and speed in object detection the image difficulty predictor is applied on the test images to split them into easy versus hard images once separated the easy images are sent to the faster singlestage detector while the hard images are sent to the more accurate twostage detector our experiments on pascal voc 2007 show that using image difficulty compares favorably to a random split of the images our method is flexible in that it allows to choose a desired threshold for splitting the images into easy versus hard
|
[['there', 'are', 'mainly', 'two', 'types', 'of', 'stateoftheart', 'object', 'detectors', 'on', 'one', 'hand', 'we', 'have', 'twostage', 'detectors', 'such', 'as', 'faster', 'rcnn', 'regionbased', 'convolutional', 'neural', 'networks', 'or', 'mask', 'rcnn', 'that', 'i', 'use', 'a', 'region', 'proposal', 'network', 'to', 'generate', 'regions', 'of', 'interests', 'in', 'the', 'first', 'stage', 'and', 'ii', 'send', 'the', 'region', 'proposals', 'down', 'the', 'pipeline', 'for', 'object', 'classification', 'and', 'boundingbox', 'regression', 'such', 'models', 'reach', 'the', 'highest', 'accuracy', 'rates', 'but', 'are', 'typically', 'slower', 'on', 'the', 'other', 'hand', 'we', 'have', 'singlestage', 'detectors', 'such', 'as', 'yolo', 'you', 'only', 'look', 'once', 'and', 'ssd', 'singe', 'shot', 'multibox', 'detector', 'that', 'treat', 'object', 'detection', 'as', 'a', 'simple', 'regression', 'problem', 'by', 'taking', 'an', 'input', 'image', 'and', 'learning', 'the', 'class', 'probabilities', 'and', 'bounding', 'box', 'coordinates', 'such', 'models', 'reach', 'lower', 'accuracy', 'rates', 'but', 'are', 'much', 'faster', 'than', 'twostage', 'object', 'detectors', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'an', 'image', 'difficulty', 'predictor', 'to', 'achieve', 'an', 'optimal', 'tradeoff', 'between', 'accuracy', 'and', 'speed', 'in', 'object', 'detection', 'the', 'image', 'difficulty', 'predictor', 'is', 'applied', 'on', 'the', 'test', 'images', 'to', 'split', 'them', 'into', 'easy', 'versus', 'hard', 'images', 'once', 'separated', 'the', 'easy', 'images', 'are', 'sent', 'to', 'the', 'faster', 'singlestage', 'detector', 'while', 'the', 'hard', 'images', 'are', 'sent', 'to', 'the', 'more', 'accurate', 'twostage', 'detector', 'our', 'experiments', 'on', 'pascal', 'voc', '2007', 'show', 'that', 'using', 'image', 'difficulty', 'compares', 'favorably', 'to', 'a', 'random', 'split', 'of', 'the', 'images', 'our', 'method', 'is', 'flexible', 'in', 'that', 'it', 'allows', 'to', 'choose', 'a', 'desired', 'threshold', 'for', 'splitting', 'the', 'images', 'into', 'easy', 'versus', 'hard']]
|
[-0.010097467811686255, 0.001222080221515081, -0.045812494189442485, 0.08432186950225974, -0.0883784575883475, -0.23792546890803928, 0.02071246587548429, 0.48615395929264665, -0.21962254076182858, -0.3473702474345369, 0.10825938541070426, -0.3088620467333931, -0.11249231683742855, 0.21237733880859347, -0.13404115988366314, 0.08269832752667, 0.14014420867672733, 0.0506428954023628, -0.07457058259401902, -0.2863275513233809, 0.24338312173969723, 0.07228238067225964, 0.3270818874911433, -0.028280362806107066, 0.16632300573141343, -0.03615562224521076, -0.009579834846036245, -0.010632344689959652, -0.029828366809129883, 0.09894039681682947, 0.2960072928851797, 0.16902378361568238, 0.263275643730688, -0.43025664345645087, -0.17384586570776456, 0.073610773104215, 0.13936370997909506, 0.09008602568452034, -0.019227501002248765, -0.33327187574268696, 0.09065998492306777, -0.17989851578134772, 0.021977723544151742, -0.09366774710910515, -0.008025923021369546, -0.040647405754178245, -0.27237964633356604, 0.029638538495817345, 0.07903004976043422, -0.020882682088370807, -0.01064081388138946, -0.1060982753218915, 0.046858130616451665, 0.15929163938244334, 0.005839329196915606, 0.08134296517059719, 0.16782862009468605, -0.22014307634392352, -0.09852491162493505, 0.3382952123992305, -0.03763490520966541, -0.21161563061737323, 0.23992235002946308, -0.0830972437534977, -0.10191841971912609, 0.1629527964681195, 0.22499935719476366, 0.17217884327648728, -0.118577307835621, -0.042953344980802374, -0.011379528514912968, 0.2047151333518534, 0.09495822969092607, -0.02169411065448635, 0.18313874193375268, 0.229202887976678, 0.08950163269727271, 0.16265031959698636, -0.22764157535532759, -0.034959698841375474, -0.23280116847352536, -0.11785763567941845, -0.17619145675982018, -0.045231395174725214, -0.07154097666630678, -0.1360412436975126, 0.3943542423358291, 0.23699634656402013, 0.2376537197469354, 0.09485225696836162, 0.38258417867136074, 0.033571239784180064, 0.12587519978320968, 0.06689891789424285, 0.23476575001626568, -0.0024000230023453546, 0.07473773467794156, -0.13037060058172073, 0.07129697183990459, 0.08869493196722392]
|
1,803.08708
|
Understanding Stellar Contamination in Exoplanet Transmission Spectra as
an Essential Step in Small Planet Characterization
|
Transmission spectroscopy during planetary transits is expected to be a major
source of information on the atmospheres of small (approximately Earth-sized)
exoplanets in the next two decades. This technique, however, is intrinsically
affected by stellar spectral contamination caused by the fact that stellar
photo- and chromospheres are not perfectly homogeneous. Such stellar
contamination will often reach or exceed the signal introduced by the planetary
spectral features. Finding effective methods to correct stellar contamination
-- or at least to quantify its possible range -- for the most important
exoplanets is a necessary step for our understanding of exoplanet atmospheres.
This will require significantly deepening our understanding of stellar
heterogeneity, which is currently limited by the available data.
|
astro-ph.EP astro-ph.SR
|
transmission spectroscopy during planetary transits is expected to be a major source of information on the atmospheres of small approximately earthsized exoplanets in the next two decades this technique however is intrinsically affected by stellar spectral contamination caused by the fact that stellar photo and chromospheres are not perfectly homogeneous such stellar contamination will often reach or exceed the signal introduced by the planetary spectral features finding effective methods to correct stellar contamination or at least to quantify its possible range for the most important exoplanets is a necessary step for our understanding of exoplanet atmospheres this will require significantly deepening our understanding of stellar heterogeneity which is currently limited by the available data
|
[['transmission', 'spectroscopy', 'during', 'planetary', 'transits', 'is', 'expected', 'to', 'be', 'a', 'major', 'source', 'of', 'information', 'on', 'the', 'atmospheres', 'of', 'small', 'approximately', 'earthsized', 'exoplanets', 'in', 'the', 'next', 'two', 'decades', 'this', 'technique', 'however', 'is', 'intrinsically', 'affected', 'by', 'stellar', 'spectral', 'contamination', 'caused', 'by', 'the', 'fact', 'that', 'stellar', 'photo', 'and', 'chromospheres', 'are', 'not', 'perfectly', 'homogeneous', 'such', 'stellar', 'contamination', 'will', 'often', 'reach', 'or', 'exceed', 'the', 'signal', 'introduced', 'by', 'the', 'planetary', 'spectral', 'features', 'finding', 'effective', 'methods', 'to', 'correct', 'stellar', 'contamination', 'or', 'at', 'least', 'to', 'quantify', 'its', 'possible', 'range', 'for', 'the', 'most', 'important', 'exoplanets', 'is', 'a', 'necessary', 'step', 'for', 'our', 'understanding', 'of', 'exoplanet', 'atmospheres', 'this', 'will', 'require', 'significantly', 'deepening', 'our', 'understanding', 'of', 'stellar', 'heterogeneity', 'which', 'is', 'currently', 'limited', 'by', 'the', 'available', 'data']]
|
[-0.03880559407805681, 0.14665094579226876, -0.04301208431072729, 0.10870045005331601, -0.12962620309145564, -0.08587377852956324, 0.05519043142997186, 0.36962053773663284, -0.20647446131190741, -0.388336834056597, 0.12939082448709788, -0.2623736725041741, -0.10962450506958064, 0.22574544068540267, -0.10875001697997122, 0.05219296742232696, 0.1436333558358775, -0.054640038412783226, 0.0015045846786897368, -0.2989913220272252, 0.3217205453619132, 0.11755876754933413, 0.12723765634367928, 0.05069689982848471, 0.02618648214041043, -0.04485767393111529, -0.1258262111846227, -0.04473556852552288, -0.12887623384340896, 0.08142648156519913, 0.31602134245137375, 0.16885687611392586, 0.24841127102671748, -0.3809391887972883, -0.28550035354534264, 0.09948103307141808, 0.19395840662049554, 0.07618376671789999, -0.04242865503112083, -0.22585590356928215, 0.09791405635412063, -0.13406070120828717, -0.14886649116350895, 0.007432103573687766, 0.021304645060904716, -0.017310114545755807, -0.2597782740368418, 0.04369193726303995, 0.0761479099951031, 0.12919598905238927, -0.0707623895386381, -0.13333397437083094, -0.043965075357016506, 0.14996912029343085, 0.006893421229171126, 0.016457248045123395, 0.15846314441960044, -0.13727212072301068, 0.0026625420391690312, 0.4322329793909663, -0.06256867663959335, -0.08404759118096544, 0.23705644252007468, -0.18456222528689786, -0.10615851889821913, 0.18390210774286012, 0.15107507348875515, 0.13288820226137577, -0.2060266539797579, -0.026789008297144614, 0.028789233677742773, 0.21298014521272035, 0.05037721807725335, 0.061647029078908656, 0.353874801997128, 0.15491571829637937, 0.09624821685761083, 0.04291261782310086, -0.18803577066864818, -0.023459352063231596, -0.1762124713542953, -0.09885170539890073, -0.19463538453227988, 0.04948221334358861, -0.07430152356481126, -0.14396944169053122, 0.3735039995415463, 0.18732633183530548, 0.13232626842351206, -0.012170553386105192, 0.3872233653745385, 0.08970802478091955, 0.11854147520978331, 0.05586711578724677, 0.3224789584218933, 0.12198039941824645, 0.06504185380528502, -0.24411495784787754, 0.16724561234597085, -0.038967818479266086]
|
1,803.08709
|
Pose-Driven Deep Models for Person Re-Identification
|
Person re-identification (re-id) is the task of recognizing and matching
persons at different locations recorded by cameras with non-overlapping views.
One of the main challenges of re-id is the large variance in person poses and
camera angles since neither of them can be influenced by the re-id system. In
this work, an effective approach to integrate coarse camera view information as
well as fine-grained pose information into a convolutional neural network (CNN)
model for learning discriminative re-id embeddings is introduced. In most
recent work pose information is either explicitly modeled within the re-id
system or explicitly used for pre-processing, for example by pose-normalizing
person images. In contrast, the proposed approach shows that a direct use of
camera view as well as the detected body joint locations into a standard CNN
can be used to significantly improve the robustness of learned re-id
embeddings. On four challenging surveillance and video re-id datasets
significant improvements over the current state of the art have been achieved.
Furthermore, a novel reordering of the MARS dataset, called X-MARS is
introduced to allow cross-validation of models trained for single-image re-id
on tracklet data.
|
cs.CV
|
person reidentification reid is the task of recognizing and matching persons at different locations recorded by cameras with nonoverlapping views one of the main challenges of reid is the large variance in person poses and camera angles since neither of them can be influenced by the reid system in this work an effective approach to integrate coarse camera view information as well as finegrained pose information into a convolutional neural network cnn model for learning discriminative reid embeddings is introduced in most recent work pose information is either explicitly modeled within the reid system or explicitly used for preprocessing for example by posenormalizing person images in contrast the proposed approach shows that a direct use of camera view as well as the detected body joint locations into a standard cnn can be used to significantly improve the robustness of learned reid embeddings on four challenging surveillance and video reid datasets significant improvements over the current state of the art have been achieved furthermore a novel reordering of the mars dataset called xmars is introduced to allow crossvalidation of models trained for singleimage reid on tracklet data
|
[['person', 'reidentification', 'reid', 'is', 'the', 'task', 'of', 'recognizing', 'and', 'matching', 'persons', 'at', 'different', 'locations', 'recorded', 'by', 'cameras', 'with', 'nonoverlapping', 'views', 'one', 'of', 'the', 'main', 'challenges', 'of', 'reid', 'is', 'the', 'large', 'variance', 'in', 'person', 'poses', 'and', 'camera', 'angles', 'since', 'neither', 'of', 'them', 'can', 'be', 'influenced', 'by', 'the', 'reid', 'system', 'in', 'this', 'work', 'an', 'effective', 'approach', 'to', 'integrate', 'coarse', 'camera', 'view', 'information', 'as', 'well', 'as', 'finegrained', 'pose', 'information', 'into', 'a', 'convolutional', 'neural', 'network', 'cnn', 'model', 'for', 'learning', 'discriminative', 'reid', 'embeddings', 'is', 'introduced', 'in', 'most', 'recent', 'work', 'pose', 'information', 'is', 'either', 'explicitly', 'modeled', 'within', 'the', 'reid', 'system', 'or', 'explicitly', 'used', 'for', 'preprocessing', 'for', 'example', 'by', 'posenormalizing', 'person', 'images', 'in', 'contrast', 'the', 'proposed', 'approach', 'shows', 'that', 'a', 'direct', 'use', 'of', 'camera', 'view', 'as', 'well', 'as', 'the', 'detected', 'body', 'joint', 'locations', 'into', 'a', 'standard', 'cnn', 'can', 'be', 'used', 'to', 'significantly', 'improve', 'the', 'robustness', 'of', 'learned', 'reid', 'embeddings', 'on', 'four', 'challenging', 'surveillance', 'and', 'video', 'reid', 'datasets', 'significant', 'improvements', 'over', 'the', 'current', 'state', 'of', 'the', 'art', 'have', 'been', 'achieved', 'furthermore', 'a', 'novel', 'reordering', 'of', 'the', 'mars', 'dataset', 'called', 'xmars', 'is', 'introduced', 'to', 'allow', 'crossvalidation', 'of', 'models', 'trained', 'for', 'singleimage', 'reid', 'on', 'tracklet', 'data']]
|
[-0.03551117663965155, -0.03749991282395216, -0.06170805176699777, 0.03600396443431711, -0.09521521757225222, -0.22437222691571704, -0.03831152735928418, 0.42327003314605227, -0.23478969903321148, -0.39944455640026083, 0.06431982079622052, -0.2709885637336613, -0.15838039318813293, 0.19094842575419613, -0.2187619367576427, 0.09423163789134655, 0.17012629515754626, 0.03578332602679122, -0.03953790165146727, -0.31038987567223125, 0.3143725786914887, 0.013944377176180158, 0.33790331829400005, 0.03905029749021987, 0.18067674608913797, 0.008683033364713598, -0.05095809554863397, 0.023560486196757942, -0.03495265006072061, 0.1548013031740835, 0.333766518657621, 0.2064101409594751, 0.29231626740859257, -0.3899198147599869, -0.24643224298209965, 0.06762740892641571, 0.16144439109737743, 0.10758674611995798, -0.015574028142272373, -0.4311750381754752, 0.056846696979609194, -0.17880718143778326, 0.027116945890314957, -0.10252380558623649, -0.004707783411899784, -0.0654812766664216, -0.2779362282270323, 0.02717317020664189, 0.052523254237198475, 0.07542250558490986, -0.055761902255218716, -0.09653742127272341, 0.032051914234888616, 0.23550773575603354, 0.04633641098410843, 0.08993345986654395, 0.12843655277823057, -0.2515148357956407, -0.10778076326254371, 0.38595373614731693, -0.05446329088147689, -0.22498866749178295, 0.18192801721464924, -0.0073596647366091774, -0.12342144659993684, 0.09642399151293236, 0.2257695448568721, 0.14094716054513928, -0.17851349338382969, -0.002354893249107788, -0.09739457485620337, 0.16021770728833, 0.0845366823702099, -0.01973883328837869, 0.21384276576788144, 0.24794735437583015, 0.05905371551710667, 0.09129280931570659, -0.20566668850005954, -0.053262806836637144, -0.1600839840906227, -0.07147752986107346, -0.23819819504126866, -0.04624937391504911, -0.07432578617614205, -0.08872592632795441, 0.43775432284556975, 0.23933021269951257, 0.2371598614060887, 0.06940789613366613, 0.3616809810375106, -0.015493040365349178, 0.1533394526391614, 0.06010894272596646, 0.19627792411989978, -0.03782941084026116, 0.12058047587039333, -0.14336912297522245, 0.09109931630930236, 0.08752421546381337]
|
1,803.0871
|
Twisted Massive Non-Compact Models
|
We study interacting massive N=(2,2) supersymmetric field theories in two
dimensions which arise from deforming conformal field theories with a
continuous spectrum. Firstly, we deform N=2 superconformal Liouville theory
with relevant operators, and twist the theory into a topological quantum field
theory. These theories can be thought of as twisted Landau-Ginzburg models with
negative power superpotential. We determine the structure constants of the
chiral ring and therefore all correlators of these topological quantum field
theories. We provide general formulas for the deformed operators of given
charge as well as explicit solutions to the WDVV equations. Secondly, we
analyze the topological anti-topological sector of the theory. We compute the
metric at the conformal point through localization. Moreover, we show that the
topological-anti-topological fusion differential equations on the metric in a
family of non-compact theories takes the affine Toda form. The metric as a
function of the family of theories is identical to the metric in certain
deformed compact models. For a negative cubic power Landau-Ginzburg
superpotential, for instance, it is governed by the Painlev\'e III differential
equation.
|
hep-th
|
we study interacting massive n22 supersymmetric field theories in two dimensions which arise from deforming conformal field theories with a continuous spectrum firstly we deform n2 superconformal liouville theory with relevant operators and twist the theory into a topological quantum field theory these theories can be thought of as twisted landauginzburg models with negative power superpotential we determine the structure constants of the chiral ring and therefore all correlators of these topological quantum field theories we provide general formulas for the deformed operators of given charge as well as explicit solutions to the wdvv equations secondly we analyze the topological antitopological sector of the theory we compute the metric at the conformal point through localization moreover we show that the topologicalantitopological fusion differential equations on the metric in a family of noncompact theories takes the affine toda form the metric as a function of the family of theories is identical to the metric in certain deformed compact models for a negative cubic power landauginzburg superpotential for instance it is governed by the painleve iii differential equation
|
[['we', 'study', 'interacting', 'massive', 'n22', 'supersymmetric', 'field', 'theories', 'in', 'two', 'dimensions', 'which', 'arise', 'from', 'deforming', 'conformal', 'field', 'theories', 'with', 'a', 'continuous', 'spectrum', 'firstly', 'we', 'deform', 'n2', 'superconformal', 'liouville', 'theory', 'with', 'relevant', 'operators', 'and', 'twist', 'the', 'theory', 'into', 'a', 'topological', 'quantum', 'field', 'theory', 'these', 'theories', 'can', 'be', 'thought', 'of', 'as', 'twisted', 'landauginzburg', 'models', 'with', 'negative', 'power', 'superpotential', 'we', 'determine', 'the', 'structure', 'constants', 'of', 'the', 'chiral', 'ring', 'and', 'therefore', 'all', 'correlators', 'of', 'these', 'topological', 'quantum', 'field', 'theories', 'we', 'provide', 'general', 'formulas', 'for', 'the', 'deformed', 'operators', 'of', 'given', 'charge', 'as', 'well', 'as', 'explicit', 'solutions', 'to', 'the', 'wdvv', 'equations', 'secondly', 'we', 'analyze', 'the', 'topological', 'antitopological', 'sector', 'of', 'the', 'theory', 'we', 'compute', 'the', 'metric', 'at', 'the', 'conformal', 'point', 'through', 'localization', 'moreover', 'we', 'show', 'that', 'the', 'topologicalantitopological', 'fusion', 'differential', 'equations', 'on', 'the', 'metric', 'in', 'a', 'family', 'of', 'noncompact', 'theories', 'takes', 'the', 'affine', 'toda', 'form', 'the', 'metric', 'as', 'a', 'function', 'of', 'the', 'family', 'of', 'theories', 'is', 'identical', 'to', 'the', 'metric', 'in', 'certain', 'deformed', 'compact', 'models', 'for', 'a', 'negative', 'cubic', 'power', 'landauginzburg', 'superpotential', 'for', 'instance', 'it', 'is', 'governed', 'by', 'the', 'painleve', 'iii', 'differential', 'equation']]
|
[-0.1432285754768444, 0.14821793154414212, -0.06959444106689522, 0.09794862085820309, -0.07935172796216128, -0.1778815788961947, -0.06556508686925684, 0.2950936537555286, -0.24471504193331514, -0.2273117164708674, 0.0659648479354967, -0.2832250174986465, -0.23371365248358675, 0.12730579436623624, -0.040647754491406625, 0.06153368955078934, -0.05010692275927535, 0.08160556563192846, -0.13360269067409847, -0.24799776267127266, 0.40286665450781584, -0.03207791287585029, 0.24315301783915078, 0.03901917821328555, 0.10666612124868802, -0.013934146695371186, 0.03220545984272446, 0.04715407211333513, -0.15275629940629837, 0.14002717017063074, 0.24359820489559622, 0.06364979537203908, 0.1309501077806843, -0.4379914603595223, -0.2380924192177398, 0.08827537421137094, 0.13497992651270968, 0.1370316766776211, -0.027903730061038263, -0.2912108384525137, 0.07612068741981472, -0.18451657206352268, -0.19731566379378948, -0.10810058256744275, -0.0036724942470235484, -0.032733156377715726, -0.24611763850020776, 0.04900352603356753, 0.025836781993109202, 0.05582901962633644, -0.10504456653126648, -0.03590468136128038, -0.08136900383846037, 0.07640644250171526, 0.0600868919997343, 0.03276452857335763, 0.10126482199079224, -0.20747314191822494, -0.13589510830119253, 0.37656751638211844, -0.08994782329536974, -0.25627032695604224, 0.10892947426797556, -0.13932584952829138, -0.17929276367649435, 0.07414659222621205, 0.13405690145811863, 0.18700272692234388, -0.0965290605493023, 0.21384294149000196, -0.04033555278820651, 0.0871914073201229, 0.0712254962431533, 0.030013280467329814, 0.2465397443409477, 0.06245279360961701, 0.04874169631212551, 0.15006811356637628, 0.023699546638610108, -0.17020587274006435, -0.4146712838645492, -0.1795866956082838, -0.10291674759305482, 0.15216415181622975, -0.1482337865684115, -0.20437608915780273, 0.4048216725712908, 0.08613937088870444, 0.1641439871037645, 0.07717488051325615, 0.18124865409518992, 0.18859099866822363, 0.10310836586302945, 0.010254811245124854, 0.2023433921526053, 0.20178931084328464, 0.05242029719453837, -0.20036832301079163, -0.125367878329541, 0.21168584821080522]
|
1,803.08711
|
The Price of Uncertainty: Chance-constrained OPF vs. In-hindsight OPF
|
The operation of power systems has become more challenging due to feed-in of
volatile renewable energy sources. Chance-constrained optimal power flow
(ccOPF) is one possibility to explicitly consider volatility via probabilistic
uncertainties resulting in mean-optimal feedback policies. These policies are
computed before knowledge of the realization of the uncertainty is available.
On the other hand, the hypothetical case of computing the power injections
knowing every realization beforehand---called in-hindsight OPF(hOPF)---cannot
be outperformed w.r.t. costs and constraint satisfaction. In this paper, we
investigate how ccOPF feedback relates to the full-information hOPF. To this
end, we introduce different dimensions of the price of uncertainty. Using mild
assumptions on the uncertainty we present sufficient conditions when ccOPF is
identical to hOPF. We suggest using the total variational distance of
probability densities to quantify the performance gap of hOPF and ccOPF.
Finally, we draw upon a tutorial example to illustrate our results.
|
math.OC cs.SY
|
the operation of power systems has become more challenging due to feedin of volatile renewable energy sources chanceconstrained optimal power flow ccopf is one possibility to explicitly consider volatility via probabilistic uncertainties resulting in meanoptimal feedback policies these policies are computed before knowledge of the realization of the uncertainty is available on the other hand the hypothetical case of computing the power injections knowing every realization beforehandcalled inhindsight opfhopfcannot be outperformed wrt costs and constraint satisfaction in this paper we investigate how ccopf feedback relates to the fullinformation hopf to this end we introduce different dimensions of the price of uncertainty using mild assumptions on the uncertainty we present sufficient conditions when ccopf is identical to hopf we suggest using the total variational distance of probability densities to quantify the performance gap of hopf and ccopf finally we draw upon a tutorial example to illustrate our results
|
[['the', 'operation', 'of', 'power', 'systems', 'has', 'become', 'more', 'challenging', 'due', 'to', 'feedin', 'of', 'volatile', 'renewable', 'energy', 'sources', 'chanceconstrained', 'optimal', 'power', 'flow', 'ccopf', 'is', 'one', 'possibility', 'to', 'explicitly', 'consider', 'volatility', 'via', 'probabilistic', 'uncertainties', 'resulting', 'in', 'meanoptimal', 'feedback', 'policies', 'these', 'policies', 'are', 'computed', 'before', 'knowledge', 'of', 'the', 'realization', 'of', 'the', 'uncertainty', 'is', 'available', 'on', 'the', 'other', 'hand', 'the', 'hypothetical', 'case', 'of', 'computing', 'the', 'power', 'injections', 'knowing', 'every', 'realization', 'beforehandcalled', 'inhindsight', 'opfhopfcannot', 'be', 'outperformed', 'wrt', 'costs', 'and', 'constraint', 'satisfaction', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'ccopf', 'feedback', 'relates', 'to', 'the', 'fullinformation', 'hopf', 'to', 'this', 'end', 'we', 'introduce', 'different', 'dimensions', 'of', 'the', 'price', 'of', 'uncertainty', 'using', 'mild', 'assumptions', 'on', 'the', 'uncertainty', 'we', 'present', 'sufficient', 'conditions', 'when', 'ccopf', 'is', 'identical', 'to', 'hopf', 'we', 'suggest', 'using', 'the', 'total', 'variational', 'distance', 'of', 'probability', 'densities', 'to', 'quantify', 'the', 'performance', 'gap', 'of', 'hopf', 'and', 'ccopf', 'finally', 'we', 'draw', 'upon', 'a', 'tutorial', 'example', 'to', 'illustrate', 'our', 'results']]
|
[-0.1261450225980692, 0.04943510931607179, -0.048410431061825764, 0.08137927359780883, -0.12209932032445042, -0.13545196981761942, 0.09533905351804765, 0.3899887472169695, -0.2930243090837152, -0.3015129951812275, 0.13862322622721274, -0.24463887782311522, -0.12951689164017463, 0.20722027454961586, -0.16017826469582538, 0.051571176503784955, 0.06441354084681798, 0.04044653614006051, -0.06001144712725719, -0.25942450184765814, 0.35280594662144465, 0.09504899668500766, 0.28447467075022576, 0.05413037547646286, 0.12139940408458999, -0.037036298742433166, -0.019256672742157862, 0.0166190453443572, -0.15915078986468692, 0.14090834384689668, 0.2546569688076323, 0.15853848479610014, 0.30210686562960587, -0.4211020285637733, -0.1862327517905774, 0.13708668681255615, 0.053076998985183615, 0.08734910470967579, -0.0001666625067990573, -0.23268164858267598, 0.07521323596047551, -0.23030474134623172, -0.07816099246045562, -0.07854217972111452, -0.020477981835773044, 0.028548407250649166, -0.29472639748396784, 0.056447132285423834, 0.03308411247350953, 0.026214100775623146, -0.05684478962924201, -0.10753750187423002, -0.03723964743866501, 0.13535906764181246, 0.05906163284089416, -0.0570429207177481, 0.14338521244471658, -0.11902663510917992, -0.14022936837111072, 0.37758987415191175, -1.5061073920240143e-05, -0.20613185244684035, 0.13943307227666743, -0.1108196424222649, -0.16686914063065306, 0.08806330760960447, 0.2143477920078106, 0.07577474374923256, -0.15995597438546877, 0.05595114594895288, -0.015692586198097446, 0.1771914707643299, 0.04402210243319819, 0.025989187532918644, 0.1486692065128835, 0.17876432845824874, 0.12877657022522568, 0.18018624266907507, -0.0480269463692134, -0.13997582191197605, -0.28012542140676633, -0.11233314623001155, -0.13051641538352865, 0.07050932493464618, -0.07426488165026433, -0.09178019186825381, 0.3717612683369251, 0.22281038073067377, 0.1493366176455438, 0.10832710441208437, 0.3346073268489404, 0.16349945763668203, 0.0038395139707864583, 0.10384746703117356, 0.2198877408892939, 0.08927682614429379, 0.09189694365030611, -0.21331897238025221, 0.09140128382136459, 0.03464885240655158]
|
1,803.08712
|
Large-Scale and Global Maximization of the Distance to Instability
|
The larger the distance to instability from a matrix is, the more robustly
stable the associated autonomous dynamical system is in the presence of
uncertainties and typically the less severe transient behavior its solution
exhibits. Motivated by these issues, we consider the maximization of the
distance to instability of a matrix dependent on several parameters, a
nonconvex optimization problem that is likely to be nonsmooth. In the first
part we propose a globally convergent algorithm when the matrix is of small
size and depends on a few parameters. In the second part we deal with the
problems involving large matrices. We tailor a subspace framework that reduces
the size of the matrix drastically. The strength of the tailored subspace
framework is proven with a global convergence result as the subspaces grow and
a superlinear rate-of-convergence result with respect to the subspace
dimension.
|
math.NA
|
the larger the distance to instability from a matrix is the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits motivated by these issues we consider the maximization of the distance to instability of a matrix dependent on several parameters a nonconvex optimization problem that is likely to be nonsmooth in the first part we propose a globally convergent algorithm when the matrix is of small size and depends on a few parameters in the second part we deal with the problems involving large matrices we tailor a subspace framework that reduces the size of the matrix drastically the strength of the tailored subspace framework is proven with a global convergence result as the subspaces grow and a superlinear rateofconvergence result with respect to the subspace dimension
|
[['the', 'larger', 'the', 'distance', 'to', 'instability', 'from', 'a', 'matrix', 'is', 'the', 'more', 'robustly', 'stable', 'the', 'associated', 'autonomous', 'dynamical', 'system', 'is', 'in', 'the', 'presence', 'of', 'uncertainties', 'and', 'typically', 'the', 'less', 'severe', 'transient', 'behavior', 'its', 'solution', 'exhibits', 'motivated', 'by', 'these', 'issues', 'we', 'consider', 'the', 'maximization', 'of', 'the', 'distance', 'to', 'instability', 'of', 'a', 'matrix', 'dependent', 'on', 'several', 'parameters', 'a', 'nonconvex', 'optimization', 'problem', 'that', 'is', 'likely', 'to', 'be', 'nonsmooth', 'in', 'the', 'first', 'part', 'we', 'propose', 'a', 'globally', 'convergent', 'algorithm', 'when', 'the', 'matrix', 'is', 'of', 'small', 'size', 'and', 'depends', 'on', 'a', 'few', 'parameters', 'in', 'the', 'second', 'part', 'we', 'deal', 'with', 'the', 'problems', 'involving', 'large', 'matrices', 'we', 'tailor', 'a', 'subspace', 'framework', 'that', 'reduces', 'the', 'size', 'of', 'the', 'matrix', 'drastically', 'the', 'strength', 'of', 'the', 'tailored', 'subspace', 'framework', 'is', 'proven', 'with', 'a', 'global', 'convergence', 'result', 'as', 'the', 'subspaces', 'grow', 'and', 'a', 'superlinear', 'rateofconvergence', 'result', 'with', 'respect', 'to', 'the', 'subspace', 'dimension']]
|
[-0.14115867018945594, 0.07601905946884613, -0.04938390512924484, 0.04809998014604043, -0.05942892533412177, -0.11004906358987644, 0.013666492292262338, 0.3250640785177304, -0.3208463962885066, -0.2536740270480153, 0.16702791964913993, -0.26395542348216905, -0.1775566730517107, 0.1767256738991857, -0.08821857931800711, 0.07538889665902644, 0.0735456149526675, 0.026340960838149866, -0.11594881532831826, -0.23293189153658936, 0.3550705850865482, 0.05306062513870567, 0.23996687594073182, 0.025944753969744057, 0.09933304210508269, -0.01326633072097484, 0.007850222587978966, 0.04956687935037722, -0.07726275704649005, 0.12706578271643876, 0.2104606629647708, 0.14022181298367312, 0.3441388592530619, -0.38939550152363284, -0.18554559913398305, 0.1384898981958313, 0.12980360355602028, 0.11794506642855966, -0.016363840613003434, -0.24886518136703106, 0.11652988246412502, -0.1476978611817557, -0.145138753633815, -0.047690332624536584, 0.006323971834794526, 0.009983967410885848, -0.31218572842403197, 0.08155304666700393, 0.039065762766281105, -0.012822786254257383, -0.06640661151794403, -0.08934496996291376, 0.02609054177251815, 0.07806252798497591, 0.07774554166293532, 0.040095984765236646, 0.12278287028762656, -0.104767761291595, -0.04655841514992882, 0.3812180470222686, -0.0459223664996975, -0.24162393168900426, 0.18804724323628863, -0.11243559489302127, -0.12487418075013433, 0.15688353373577268, 0.21497469872537947, 0.1544676592514496, -0.11596732736045813, 0.1010462263599858, -0.032990934635499417, 0.19536017952814802, -0.010366665112497416, 0.024201572511974776, 0.1192712669939616, 0.19093236208665448, 0.16965754785038806, 0.15826806581405345, -0.053316335570113074, -0.09821070077448664, -0.2567784384247178, -0.10333932543330838, -0.21194797691652997, 0.02241309731542854, -0.1338648914756511, -0.17789417468208138, 0.4214579915024445, 0.12800885015495225, 0.2666751912230967, 0.05771194159997706, 0.2793956522069032, 0.14660332019975356, 0.07480141049755973, 0.08689109465553307, 0.23573959292679972, 0.13148251124067414, 0.06578699351799949, -0.2531142293618628, 0.09551471105283192, 0.07628638749699515]
|
1,803.08713
|
On essentially 4-edge-connected cubic bricks
|
Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely
decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let
$b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also
matching covered; furthermore, $e$ is $b$-invariant if $b(G-e)=1$, and $e$ is
quasi-$b$-invariant if $b(G-e)=2$. (Each edge of the Petersen graph is
quasi-$b$-invariant.)
A brick $G$ is near-bipartite if it has a pair of edges $\{e,f\}$ so that
$G-e-f$ is matching covered and bipartite; such a pair $\{e,f\}$ is a removable
doubleton. (Each of $K_4$ and the triangular prism $\overline{C_6}$ has three
removable doubletons.) Carvalho, Lucchesi and Murty (2002) proved a conjecture
of Lov\'asz which states that every brick, distinct from $K_4$,
$\overline{C_6}$ and the Petersen graph, has a $b$-invariant edge.
A cubic graph is essentially $4$-edge-connected if it is $2$-edge-connected
and if its only $3$-cuts are the trivial ones; it is well-known that each such
graph is either a brick or a brace; we provide a graph-theoretical proof of
this fact.
We prove that if $G$ is any essentially $4$-edge-connected cubic brick then
its edge-set may be partitioned into three (possibly empty) sets: (i) edges
that participate in a removable doubleton, (ii) $b$-invariant edges, and (iii)
quasi-$b$-invariant edges; our Main Theorem states that if $G$ has two adjacent
quasi-$b$-invariant edges, say $e_1$ and $e_2$, then either $G$ is the Petersen
graph or the (near-bipartite) Cubeplex graph, or otherwise, each edge of $G$
(distinct from $e_1$ and $e_2$) is $b$-invariant. As a corollary, we deduce
that each essentially $4$-edge-connected cubic non-near-bipartite brick $G$,
distinct from the Petersen graph, has at least $|V(G)|$ $b$-invariant edges.
|
math.CO
|
lovasz 1987 proved that every matching covered graph g may be uniquely decomposed into a list of bricks nonbipartite and braces bipartite we let bg denote the number of bricks an edge e is removable if ge is also matching covered furthermore e is binvariant if bge1 and e is quasibinvariant if bge2 each edge of the petersen graph is quasibinvariant a brick g is nearbipartite if it has a pair of edges ef so that gef is matching covered and bipartite such a pair ef is a removable doubleton each of k_4 and the triangular prism overlinec_6 has three removable doubletons carvalho lucchesi and murty 2002 proved a conjecture of lovasz which states that every brick distinct from k_4 overlinec_6 and the petersen graph has a binvariant edge a cubic graph is essentially 4edgeconnected if it is 2edgeconnected and if its only 3cuts are the trivial ones it is wellknown that each such graph is either a brick or a brace we provide a graphtheoretical proof of this fact we prove that if g is any essentially 4edgeconnected cubic brick then its edgeset may be partitioned into three possibly empty sets i edges that participate in a removable doubleton ii binvariant edges and iii quasibinvariant edges our main theorem states that if g has two adjacent quasibinvariant edges say e_1 and e_2 then either g is the petersen graph or the nearbipartite cubeplex graph or otherwise each edge of g distinct from e_1 and e_2 is binvariant as a corollary we deduce that each essentially 4edgeconnected cubic nonnearbipartite brick g distinct from the petersen graph has at least vg binvariant edges
|
[['lovasz', '1987', 'proved', 'that', 'every', 'matching', 'covered', 'graph', 'g', 'may', 'be', 'uniquely', 'decomposed', 'into', 'a', 'list', 'of', 'bricks', 'nonbipartite', 'and', 'braces', 'bipartite', 'we', 'let', 'bg', 'denote', 'the', 'number', 'of', 'bricks', 'an', 'edge', 'e', 'is', 'removable', 'if', 'ge', 'is', 'also', 'matching', 'covered', 'furthermore', 'e', 'is', 'binvariant', 'if', 'bge1', 'and', 'e', 'is', 'quasibinvariant', 'if', 'bge2', 'each', 'edge', 'of', 'the', 'petersen', 'graph', 'is', 'quasibinvariant', 'a', 'brick', 'g', 'is', 'nearbipartite', 'if', 'it', 'has', 'a', 'pair', 'of', 'edges', 'ef', 'so', 'that', 'gef', 'is', 'matching', 'covered', 'and', 'bipartite', 'such', 'a', 'pair', 'ef', 'is', 'a', 'removable', 'doubleton', 'each', 'of', 'k_4', 'and', 'the', 'triangular', 'prism', 'overlinec_6', 'has', 'three', 'removable', 'doubletons', 'carvalho', 'lucchesi', 'and', 'murty', '2002', 'proved', 'a', 'conjecture', 'of', 'lovasz', 'which', 'states', 'that', 'every', 'brick', 'distinct', 'from', 'k_4', 'overlinec_6', 'and', 'the', 'petersen', 'graph', 'has', 'a', 'binvariant', 'edge', 'a', 'cubic', 'graph', 'is', 'essentially', '4edgeconnected', 'if', 'it', 'is', '2edgeconnected', 'and', 'if', 'its', 'only', '3cuts', 'are', 'the', 'trivial', 'ones', 'it', 'is', 'wellknown', 'that', 'each', 'such', 'graph', 'is', 'either', 'a', 'brick', 'or', 'a', 'brace', 'we', 'provide', 'a', 'graphtheoretical', 'proof', 'of', 'this', 'fact', 'we', 'prove', 'that', 'if', 'g', 'is', 'any', 'essentially', '4edgeconnected', 'cubic', 'brick', 'then', 'its', 'edgeset', 'may', 'be', 'partitioned', 'into', 'three', 'possibly', 'empty', 'sets', 'i', 'edges', 'that', 'participate', 'in', 'a', 'removable', 'doubleton', 'ii', 'binvariant', 'edges', 'and', 'iii', 'quasibinvariant', 'edges', 'our', 'main', 'theorem', 'states', 'that', 'if', 'g', 'has', 'two', 'adjacent', 'quasibinvariant', 'edges', 'say', 'e_1', 'and', 'e_2', 'then', 'either', 'g', 'is', 'the', 'petersen', 'graph', 'or', 'the', 'nearbipartite', 'cubeplex', 'graph', 'or', 'otherwise', 'each', 'edge', 'of', 'g', 'distinct', 'from', 'e_1', 'and', 'e_2', 'is', 'binvariant', 'as', 'a', 'corollary', 'we', 'deduce', 'that', 'each', 'essentially', '4edgeconnected', 'cubic', 'nonnearbipartite', 'brick', 'g', 'distinct', 'from', 'the', 'petersen', 'graph', 'has', 'at', 'least', 'vg', 'binvariant', 'edges']]
|
[-0.18252226798258528, 0.14695659516080273, -0.10894289962795033, -0.0014778276616326607, -0.13664663391755583, -0.2097047343668372, 0.015685194755340044, 0.37972296376930736, -0.3035848059779774, -0.2620553910046544, 0.08128419553049145, -0.3731416921818553, -0.15494589181313964, 0.05130538781741322, -0.12611281499093516, -0.08660947378131052, 0.14810883671176867, 0.10139547732191724, 0.08125831905819933, -0.2689286328126853, 0.2531922613703351, -0.128717568770508, 0.13587185987539685, 0.1180686237027377, 0.056677404245392846, 0.04544126200333903, 0.06156248078754234, 0.11240797490011346, -0.18977068943429398, 0.04187000228557736, 0.2546536756599786, 0.14355300570843346, 0.22823127136534585, -0.3550938581206081, -0.13848127344394706, 0.21709717382749605, 0.1182832784905725, -0.01027297141371454, 0.020737793350563694, -0.20315089923873644, 0.16595840446138582, -0.13230220368910983, -0.07198636690899038, 0.03332059379653195, 0.15431639938494088, -0.041273521577946316, -0.2637357662559996, -0.03473761470563845, 0.16711756171914835, -0.00303718694883873, 0.08678438440294153, -0.1814041983225421, -0.18524741356738852, 0.07016055208118459, -0.11738670814598887, 0.11264218993789644, 0.0071768881848296604, -0.062052712317895435, -0.16651519391076383, 0.3676140074476212, -0.007970914862648372, -0.12263447663237836, 0.11509385511805355, -0.12495768937666564, -0.18849925643359364, 0.1103600794812976, 0.001471460609935695, 0.141707483654821, -0.06067733147846306, 0.18909239227975266, -0.16890140480959534, 0.1066254040262693, 0.19539203473841113, -0.05305872779304065, 0.15713251214024357, 0.0836427652625, 0.1535046184400865, 0.16247653502185022, 0.012879880622971013, 0.10647064398067092, -0.3037121352557003, -0.12902649285247528, -0.2892572478682052, 0.1050819828794736, -0.14212243421620785, -0.20716880963635753, 0.42226477665999784, -0.002568422439317721, 0.18016116015334374, 0.020593891427488686, 0.22708768835014292, 0.06446663849228876, 0.050422658701513835, 0.19967443915776437, 0.10644308208976093, 0.1691929759011088, -0.1094806515525154, -0.10307076907903648, 0.03475032509287272, 0.18040902418652238]
|
1,803.08714
|
Caratheodory completeness on the complex plane
|
In 1975 N. Sibony and, independently, M. A. Selby proved that on the complex
plane $c$-completeness is equivalent to $c$-finitely compactness. In the paper
we give a local version of their results. We also simplify the proofs.
|
math.CV
|
in 1975 n sibony and independently m a selby proved that on the complex plane ccompleteness is equivalent to cfinitely compactness in the paper we give a local version of their results we also simplify the proofs
|
[['in', '1975', 'n', 'sibony', 'and', 'independently', 'm', 'a', 'selby', 'proved', 'that', 'on', 'the', 'complex', 'plane', 'ccompleteness', 'is', 'equivalent', 'to', 'cfinitely', 'compactness', 'in', 'the', 'paper', 'we', 'give', 'a', 'local', 'version', 'of', 'their', 'results', 'we', 'also', 'simplify', 'the', 'proofs']]
|
[-0.11453763610250982, 0.035925535684717555, -0.12349287936730044, 0.07376594843143332, -0.08693406062998942, -0.07042620009077447, 0.06915144766348282, 0.3343034450496946, -0.20935472707663264, -0.2725442741731448, 0.11773207584795142, -0.23097375844206128, -0.16232086548448674, 0.2176612576669348, -0.15543216280639172, -0.023008801282516547, 0.04220900812319347, 0.011430234408804349, -0.06409010189319296, -0.3123930993356875, 0.3240085160093648, -0.0009018904396465847, 0.18980853552264826, 0.07811373951179641, 0.06100681605083602, 0.05639924703698073, -0.050714865486536705, 0.03777986791517053, -0.20295917647994688, 0.1537491947678583, 0.20705077068081923, 0.10860628501645156, 0.22078227996826172, -0.37674388848245144, -0.11301411144169314, 0.10497461504169874, 0.14314231341704725, 0.0752302596611636, -0.003096098023732858, -0.2784884814172983, 0.15997235415769476, -0.07763858823371785, -0.1697279100173286, -0.04402593257171767, 0.0672321800674711, 0.04324802559401308, -0.24639609418809413, -0.002302055148174986, 0.1958837352959173, 0.03051630066308592, -0.04456364597593035, -0.09358898536967379, -0.009258715276207244, 0.07321542022483689, -0.013404751429334283, 0.06346885754859873, 0.04617552546385143, -0.037838250345417435, -0.08311940897256136, 0.3150049758808953, -0.07222298620534795, -0.2356300946923771, 0.18531434812716074, -0.09994218227054391, -0.18811104074120522, 0.053208560310304166, 0.12763170426977533, 0.16059316428644316, -0.09933396585817848, 0.16423281925963237, -0.13300047301288162, 0.13158839706863676, 0.1201143226187144, 0.003547105366098029, 0.07018260309206588, 0.07640987828906093, 0.11645091875855412, 0.15944795520710095, 0.00825950841951583, -0.03236976281872817, -0.2976219539131437, -0.20689539089798928, -0.16913460914511233, 0.10106358490884304, -0.06642263530978068, -0.11592958884845887, 0.3700720048376492, 0.14241191340344292, 0.20552743763795922, 0.1026984343039138, 0.21765901712434632, 0.09349743997944253, -0.028706443795402135, 0.08972133870369621, 0.20142108643693582, 0.2090784635926996, 0.1359692613594234, -0.1298203100716429, 0.015508085475968464, 0.16654642639415604]
|
1,803.08715
|
A density result for homogeneous Sobolev spaces
|
We show that in a bounded Gromov hyperbolic domain $\Omega$ smooth functions
with bounded derivatives $C^\infty(\Omega)\cap W^{k,\infty}(\Omega)$ are dense
in the homogeneous Sobolev spaces $L^{k,p}(\Omega)$.
|
math.FA math.CA
|
we show that in a bounded gromov hyperbolic domain omega smooth functions with bounded derivatives cinftyomegacap wkinftyomega are dense in the homogeneous sobolev spaces lkpomega
|
[['we', 'show', 'that', 'in', 'a', 'bounded', 'gromov', 'hyperbolic', 'domain', 'omega', 'smooth', 'functions', 'with', 'bounded', 'derivatives', 'cinftyomegacap', 'wkinftyomega', 'are', 'dense', 'in', 'the', 'homogeneous', 'sobolev', 'spaces', 'lkpomega']]
|
[-0.1766218487173319, 0.1534387740645219, -0.028981873553923586, 0.0882126245309006, -0.15252444461326709, -0.006944485326212915, -0.07413271171125499, 0.4644958864558827, -0.3552770082923499, -0.059915202923796394, 0.14185647379649294, -0.2804478822614659, -0.11777318506078287, 0.1760483365876346, -0.18893237976061011, 0.11637970606203783, 0.03958596589721062, 0.02636751668019728, -0.1538576084845276, -0.28042519752952183, 0.5043181045488878, -0.2851385798897933, 0.17389513484456323, 0.13744326714764943, 0.105475153520026, -0.15727463104254144, 0.0012853613588958979, 0.03146398169073192, -0.22994755070017578, 0.1612575865265998, 0.31292523934759875, 0.016609117219393902, 0.31648885199419136, -0.37804197012023494, -0.2957973778247833, 0.2127709991552613, 0.13125305967828768, -0.11633024872703986, -0.03878313515187157, -0.40745750518346374, 0.12190896945751527, -0.03100034264339642, -0.22158092154528608, -0.07935028844936327, 0.05651414004916495, 0.13987541406161405, -0.2771533382209865, 0.08803227645429698, 0.12298060801218856, 0.039983670100231065, -0.18869633051905443, -0.034237130248749796, -0.05677255109714514, 0.04745254032737152, -0.0959426924078302, 0.18246530697003685, 0.0451540289319713, -0.06382665753533895, -0.019378646192225544, 0.32794222265312617, -0.17428122020580553, -0.4289729811081832, 0.12045705813745206, -0.324175121685998, -0.101398213703016, 0.09989725798368454, 0.17763755591162902, 0.22469908371567726, 0.017444453286853703, 0.28518565303900023, -0.0949515470049598, 0.12700333789160306, 0.19186521505682982, 0.018579092405905776, -0.04810118886896155, 0.07856328908184712, 0.23027213438498703, 0.1733776325021278, 0.10797388648444955, -0.12316855187898247, -0.4088044578040188, -0.11624517829411408, -0.22464781961488453, 0.07311579144813797, -0.19119352707639337, -0.284241427667439, 0.24388471254232255, -0.07798432622274215, 0.1955555940724232, 0.18715884439139205, 0.20455988378010012, 0.08212724200248803, -0.005582381632517685, 0.1887510111555457, 0.11752264768901197, 0.11213851635428992, 0.08200682081620801, -0.07668844662310387, -0.023598235735500402, 0.16613147217669227]
|
1,803.08716
|
CSfM: Community-based Structure from Motion
|
Structure-from-Motion approaches could be broadly divided into two classes:
incremental and global. While incremental manner is robust to outliers, it
suffers from error accumulation and heavy computation load. The global manner
has the advantage of simultaneously estimating all camera poses, but it is
usually sensitive to epipolar geometry outliers. In this paper, we propose an
adaptive community-based SfM (CSfM) method which takes both robustness and
efficiency into consideration. First, the epipolar geometry graph is
partitioned into separate communities. Then, the reconstruction problem is
solved for each community in parallel. Finally, the reconstruction results are
merged by a novel global similarity averaging method, which solves three convex
$L1$ optimization problems. Experimental results show that our method performs
better than many of the state-of-the-art global SfM approaches in terms of
computational efficiency, while achieves similar or better reconstruction
accuracy and robustness than many of the state-of-the-art incremental SfM
approaches.
|
cs.CV
|
structurefrommotion approaches could be broadly divided into two classes incremental and global while incremental manner is robust to outliers it suffers from error accumulation and heavy computation load the global manner has the advantage of simultaneously estimating all camera poses but it is usually sensitive to epipolar geometry outliers in this paper we propose an adaptive communitybased sfm csfm method which takes both robustness and efficiency into consideration first the epipolar geometry graph is partitioned into separate communities then the reconstruction problem is solved for each community in parallel finally the reconstruction results are merged by a novel global similarity averaging method which solves three convex l1 optimization problems experimental results show that our method performs better than many of the stateoftheart global sfm approaches in terms of computational efficiency while achieves similar or better reconstruction accuracy and robustness than many of the stateoftheart incremental sfm approaches
|
[['structurefrommotion', 'approaches', 'could', 'be', 'broadly', 'divided', 'into', 'two', 'classes', 'incremental', 'and', 'global', 'while', 'incremental', 'manner', 'is', 'robust', 'to', 'outliers', 'it', 'suffers', 'from', 'error', 'accumulation', 'and', 'heavy', 'computation', 'load', 'the', 'global', 'manner', 'has', 'the', 'advantage', 'of', 'simultaneously', 'estimating', 'all', 'camera', 'poses', 'but', 'it', 'is', 'usually', 'sensitive', 'to', 'epipolar', 'geometry', 'outliers', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adaptive', 'communitybased', 'sfm', 'csfm', 'method', 'which', 'takes', 'both', 'robustness', 'and', 'efficiency', 'into', 'consideration', 'first', 'the', 'epipolar', 'geometry', 'graph', 'is', 'partitioned', 'into', 'separate', 'communities', 'then', 'the', 'reconstruction', 'problem', 'is', 'solved', 'for', 'each', 'community', 'in', 'parallel', 'finally', 'the', 'reconstruction', 'results', 'are', 'merged', 'by', 'a', 'novel', 'global', 'similarity', 'averaging', 'method', 'which', 'solves', 'three', 'convex', 'l1', 'optimization', 'problems', 'experimental', 'results', 'show', 'that', 'our', 'method', 'performs', 'better', 'than', 'many', 'of', 'the', 'stateoftheart', 'global', 'sfm', 'approaches', 'in', 'terms', 'of', 'computational', 'efficiency', 'while', 'achieves', 'similar', 'or', 'better', 'reconstruction', 'accuracy', 'and', 'robustness', 'than', 'many', 'of', 'the', 'stateoftheart', 'incremental', 'sfm', 'approaches']]
|
[-0.06716107385877315, -0.030416405117773125, -0.09812602288032282, 0.06056615550705704, -0.07910600748257585, -0.18196678995774748, -0.009792406967528521, 0.41573583876254827, -0.30712777492271304, -0.35970375507636226, 0.10469918044472164, -0.2532117848955525, -0.1524176244920579, 0.18434801732017722, -0.15701722966531795, 0.08847454396831606, 0.15565029103851125, -0.011354634299482002, -0.11985493908566104, -0.28920140481742945, 0.25141218883521244, 0.026546116548347962, 0.3472438362452572, 0.004653893586579864, 0.1278478882007607, 0.003027667037102917, -0.04905048302535848, 0.10971890638059337, -0.03125604007367008, 0.16324396269341726, 0.2858814023282022, 0.2126646158604385, 0.3122780111503519, -0.414014588529563, -0.21537495330486395, 0.09372526964759581, 0.2039386426475001, 0.11058555659678548, -0.041048796753373556, -0.28974939572739683, 0.12020564888131945, -0.10599272536139374, 0.0142719598123421, -0.1420298070257708, -0.061656750075212895, -0.03978059993186098, -0.2973370649660491, 0.08885141672592049, 0.08427050489970572, 0.00025317884267192996, -0.08660689337108897, -0.15147518421433967, 0.04012276316444351, 0.1269571108070572, 0.046399966450025365, 0.07625007376151338, 0.14470938952601425, -0.10674972104208467, -0.12369824929341469, 0.39938541643372544, -0.004663306613546822, -0.22703282080896914, 0.20163044235860444, -0.020783309596718275, -0.15018266297028438, 0.16407789043724946, 0.19980317356594365, 0.12418874687425895, -0.1590660749105354, 0.04103502984101284, -0.020825040048268968, 0.1544961764745108, 0.032113861630683485, -0.008142562107859205, 0.13040611637941218, 0.22161768232025716, 0.1657939335229258, 0.13077074023918886, -0.11716589085559986, -0.10235294763139155, -0.19176211012192454, -0.10766920054886388, -0.16574899953461494, -0.06886665798621634, -0.1379552212291021, -0.1343368591855548, 0.4320236776177197, 0.19725293565656327, 0.18872957948391159, 0.08408470397132564, 0.456209901426855, 0.07047626238287592, 0.07108129495757828, 0.12320136320011767, 0.21491701654732637, 0.024277950184936444, 0.0743965227033286, -0.20709632013203602, 0.08730237082935462, 0.1046201004750376]
|
1,803.08717
|
Weak lensing by voids in weak lensing maps
|
Cosmic voids are an important probe of large-scale structure that can
constrain cosmological parameters and test cosmological models. We present a
new paradigm for void studies: void detection in weak lensing convergence maps.
This approach identifies objects that relate directly to our theoretical
understanding of voids as underdensities in the total matter field and presents
several advantages compared to the customary method of finding voids in the
galaxy distribution. We exemplify this approach by identifying voids using the
weak lensing peaks as tracers of the large-scale structure. We find
self-similarity in the void abundance across a range of peak signal-to-noise
selection thresholds. The voids obtained via this approach give a tangential
shear signal up to $\sim40$ times larger than voids identified in the galaxy
distribution.
|
astro-ph.CO
|
cosmic voids are an important probe of largescale structure that can constrain cosmological parameters and test cosmological models we present a new paradigm for void studies void detection in weak lensing convergence maps this approach identifies objects that relate directly to our theoretical understanding of voids as underdensities in the total matter field and presents several advantages compared to the customary method of finding voids in the galaxy distribution we exemplify this approach by identifying voids using the weak lensing peaks as tracers of the largescale structure we find selfsimilarity in the void abundance across a range of peak signaltonoise selection thresholds the voids obtained via this approach give a tangential shear signal up to sim40 times larger than voids identified in the galaxy distribution
|
[['cosmic', 'voids', 'are', 'an', 'important', 'probe', 'of', 'largescale', 'structure', 'that', 'can', 'constrain', 'cosmological', 'parameters', 'and', 'test', 'cosmological', 'models', 'we', 'present', 'a', 'new', 'paradigm', 'for', 'void', 'studies', 'void', 'detection', 'in', 'weak', 'lensing', 'convergence', 'maps', 'this', 'approach', 'identifies', 'objects', 'that', 'relate', 'directly', 'to', 'our', 'theoretical', 'understanding', 'of', 'voids', 'as', 'underdensities', 'in', 'the', 'total', 'matter', 'field', 'and', 'presents', 'several', 'advantages', 'compared', 'to', 'the', 'customary', 'method', 'of', 'finding', 'voids', 'in', 'the', 'galaxy', 'distribution', 'we', 'exemplify', 'this', 'approach', 'by', 'identifying', 'voids', 'using', 'the', 'weak', 'lensing', 'peaks', 'as', 'tracers', 'of', 'the', 'largescale', 'structure', 'we', 'find', 'selfsimilarity', 'in', 'the', 'void', 'abundance', 'across', 'a', 'range', 'of', 'peak', 'signaltonoise', 'selection', 'thresholds', 'the', 'voids', 'obtained', 'via', 'this', 'approach', 'give', 'a', 'tangential', 'shear', 'signal', 'up', 'to', 'sim40', 'times', 'larger', 'than', 'voids', 'identified', 'in', 'the', 'galaxy', 'distribution']]
|
[-0.08001759721338748, 0.019403673608438112, -0.10911554763466119, 0.12072584213782102, -0.08535094063449651, 0.0031918433047831056, -0.012714333375915885, 0.3883521379083395, -0.220752405654639, -0.3700537121593952, -0.0021201129527762532, -0.2384509834414348, -0.09675388930365443, 0.17624581754393875, 0.03702071051672101, 0.008834892409853638, 0.030159892729483544, -0.07065521744266152, -0.054086720760911706, -0.2748663003304973, 0.29355984097346666, 0.11517119685560465, 0.30213015354424716, -0.023050195714458824, 0.06797399737872184, -0.10188190050050616, -0.12644999739527701, 0.08696364428848029, -0.20821128111763393, 0.07369836598448455, 0.24046839757767158, 0.14596556305699052, 0.2398786938227713, -0.36493127059936525, -0.24667418174166234, 0.1107069668690674, 0.2144460413493216, 0.14313051004707814, -0.0932777972072363, -0.33005066749453543, 0.11360620916890912, -0.13072735853143969, -0.13548099831119179, -0.04149450428038835, -0.019062074317596853, 0.034929791334085164, -0.21064816678781062, 0.21822383774444462, -0.0008421499095857143, 0.015044314928352833, -0.05814737458154559, -0.08449748511984945, 0.015081158826127648, 0.06304349639825522, 0.046825605653226375, 0.023250912178307773, 0.22553976539894938, -0.1813044453356415, -0.03526694754883647, 0.4375967338979244, -0.08251937283447477, -0.09710070161800831, 0.16275412277132273, -0.17155652774125338, -0.19358833575062454, 0.09248001385852694, 0.18967696204967796, 0.08094771795300768, -0.16274853229615838, 0.037070964920334515, -0.019539751134812832, 0.16101061043888332, 0.07115620965370908, -0.006609841808443889, 0.2942195060923696, 0.15172141558676958, 0.12480998216569424, 0.1097847940325737, -0.1871810037624091, -0.00953573676943779, -0.27654146270081403, -0.10651398017629982, -0.162823105879128, 0.03364208262786269, -0.20019887156388722, -0.1934849606398493, 0.37730622651427986, 0.1898717267177999, 0.25077715317253024, 0.08531643343507313, 0.30795156833343207, 0.011543597186915576, 0.08085027424246073, 0.02561066384986043, 0.2957991891950369, 0.16092637793906034, 0.06348654179461301, -0.17880791888572276, 0.05299458106979728, 0.006500303998589516]
|
1,803.08718
|
Learning protein constitutive motifs from sequence data
|
Statistical analysis of evolutionary-related protein sequences provides
insights about their structure, function, and history. We show that Restricted
Boltzmann Machines (RBM), designed to learn complex high-dimensional data and
their statistical features, can efficiently model protein families from
sequence information. We here apply RBM to twenty protein families, and present
detailed results for two short protein domains, Kunitz and WW, one long
chaperone protein, Hsp70, and synthetic lattice proteins for benchmarking. The
features inferred by the RBM are biologically interpretable: they are related
to structure (such as residue-residue tertiary contacts, extended secondary
motifs ($\alpha$-helix and $\beta$-sheet) and intrinsically disordered
regions), to function (such as activity and ligand specificity), or to
phylogenetic identity. In addition, we use RBM to design new protein sequences
with putative properties by composing and turning up or down the different
modes at will. Our work therefore shows that RBM are a versatile and practical
tool to unveil and exploit the genotype-phenotype relationship for protein
families.
|
q-bio.QM q-bio.BM
|
statistical analysis of evolutionaryrelated protein sequences provides insights about their structure function and history we show that restricted boltzmann machines rbm designed to learn complex highdimensional data and their statistical features can efficiently model protein families from sequence information we here apply rbm to twenty protein families and present detailed results for two short protein domains kunitz and ww one long chaperone protein hsp70 and synthetic lattice proteins for benchmarking the features inferred by the rbm are biologically interpretable they are related to structure such as residueresidue tertiary contacts extended secondary motifs alphahelix and betasheet and intrinsically disordered regions to function such as activity and ligand specificity or to phylogenetic identity in addition we use rbm to design new protein sequences with putative properties by composing and turning up or down the different modes at will our work therefore shows that rbm are a versatile and practical tool to unveil and exploit the genotypephenotype relationship for protein families
|
[['statistical', 'analysis', 'of', 'evolutionaryrelated', 'protein', 'sequences', 'provides', 'insights', 'about', 'their', 'structure', 'function', 'and', 'history', 'we', 'show', 'that', 'restricted', 'boltzmann', 'machines', 'rbm', 'designed', 'to', 'learn', 'complex', 'highdimensional', 'data', 'and', 'their', 'statistical', 'features', 'can', 'efficiently', 'model', 'protein', 'families', 'from', 'sequence', 'information', 'we', 'here', 'apply', 'rbm', 'to', 'twenty', 'protein', 'families', 'and', 'present', 'detailed', 'results', 'for', 'two', 'short', 'protein', 'domains', 'kunitz', 'and', 'ww', 'one', 'long', 'chaperone', 'protein', 'hsp70', 'and', 'synthetic', 'lattice', 'proteins', 'for', 'benchmarking', 'the', 'features', 'inferred', 'by', 'the', 'rbm', 'are', 'biologically', 'interpretable', 'they', 'are', 'related', 'to', 'structure', 'such', 'as', 'residueresidue', 'tertiary', 'contacts', 'extended', 'secondary', 'motifs', 'alphahelix', 'and', 'betasheet', 'and', 'intrinsically', 'disordered', 'regions', 'to', 'function', 'such', 'as', 'activity', 'and', 'ligand', 'specificity', 'or', 'to', 'phylogenetic', 'identity', 'in', 'addition', 'we', 'use', 'rbm', 'to', 'design', 'new', 'protein', 'sequences', 'with', 'putative', 'properties', 'by', 'composing', 'and', 'turning', 'up', 'or', 'down', 'the', 'different', 'modes', 'at', 'will', 'our', 'work', 'therefore', 'shows', 'that', 'rbm', 'are', 'a', 'versatile', 'and', 'practical', 'tool', 'to', 'unveil', 'and', 'exploit', 'the', 'genotypephenotype', 'relationship', 'for', 'protein', 'families']]
|
[-0.04121444943713215, 0.10902300293300635, -0.0709996971492775, 0.1443889482328907, -0.11987704095036651, -0.18385334766935557, 0.07068990785494232, 0.4519466831921958, -0.34770088046860065, -0.2965585554842479, 0.048257111569490425, -0.2703935955292903, -0.23041122107324788, 0.1698048532871792, -0.008901722224739691, 0.04524785044785135, 0.12978790290892506, 0.009607403179427657, 0.028069287243758876, -0.18935760534040105, 0.26483300430938983, 0.058053314490303494, 0.26970424439507323, 0.019823854121242244, 0.0647967430189825, -0.014078897612097744, 0.00956154940649867, -0.03640606986860243, -0.16346987010659247, 0.21569387294734135, 0.29617918599158144, 0.1607178915083074, 0.24762765819338176, -0.4264451842277478, -0.22713336324056563, 0.08321994567935083, 0.18148801151292923, 0.15142601490534174, -0.006310617469866067, -0.2509549413270389, 0.13215122626234704, -0.09207673843738097, -0.05771085005462504, -0.19939893157555696, -0.003392080015216309, 0.06099243113138259, -0.22466406282164358, 0.09434614837011442, 0.06254465958306518, 0.10300278191705449, -0.08609945930966671, -0.13679693232421788, -0.038948428920076154, 0.19181309732942817, 0.031156001384937182, 0.012499835260827333, 0.19049629378311622, -0.09785343548402381, -0.1264163855506549, 0.3540845748413211, -0.016916657388299845, -0.21330916829025134, 0.25216953670053793, -0.062469410978687495, -0.19717415262204716, 0.11912507414280508, 0.17675358003665073, 0.08462762009973328, -0.1914100251533688, -0.011407436833952745, 0.03387772973077611, 0.21131086007405359, 0.07462497611488335, 0.022814039627496056, 0.22629178224843388, 0.19910141716872415, -0.02487633537869745, 0.1719551745455903, -0.10637376801922727, -0.09173619790444484, -0.15108596505477834, -0.1400936311954119, -0.16309765330665052, 0.032653390167979524, -0.09491695008639511, -0.18730391475541042, 0.41265264578396454, 0.08336570732092533, 0.2032129176480409, 0.10104277635960338, 0.20286534337374645, -0.03359993407875896, 0.0896884136675045, 0.014938640763433889, 0.12297802752231618, 0.1090640943013848, 0.05802347623998335, -0.19320769706973806, 0.10313001828445778, 0.02493209090346518]
|
1,803.08719
|
$\mathcal{O}(k)$-robust spanners in one dimension
|
A geometric $t$-spanner on a set of points in Euclidean space is a graph
containing for every pair of points a path of length at most $t$ times the
Euclidean distance between the points. Informally, a spanner is
$\mathcal{O}(k)$-robust if deleting $k$ vertices only harms $\mathcal{O}(k)$
other vertices. We show that on any one-dimensional set of $n$ points, for any
$\varepsilon>0$, there exists an $\mathcal{O}(k)$-robust $1$-spanner with
$\mathcal{O}(n^{1+\varepsilon})$ edges. Previously it was only known that
$\mathcal{O}(k)$-robust spanners with $\mathcal{O}(n^2)$ edges exists and that
there are point sets on which any $\mathcal{O}(k)$-robust spanner has
$\Omega(n\log{n})$ edges.
|
cs.CG
|
a geometric tspanner on a set of points in euclidean space is a graph containing for every pair of points a path of length at most t times the euclidean distance between the points informally a spanner is mathcalokrobust if deleting k vertices only harms mathcalok other vertices we show that on any onedimensional set of n points for any varepsilon0 there exists an mathcalokrobust 1spanner with mathcalon1varepsilon edges previously it was only known that mathcalokrobust spanners with mathcalon2 edges exists and that there are point sets on which any mathcalokrobust spanner has omeganlogn edges
|
[['a', 'geometric', 'tspanner', 'on', 'a', 'set', 'of', 'points', 'in', 'euclidean', 'space', 'is', 'a', 'graph', 'containing', 'for', 'every', 'pair', 'of', 'points', 'a', 'path', 'of', 'length', 'at', 'most', 't', 'times', 'the', 'euclidean', 'distance', 'between', 'the', 'points', 'informally', 'a', 'spanner', 'is', 'mathcalokrobust', 'if', 'deleting', 'k', 'vertices', 'only', 'harms', 'mathcalok', 'other', 'vertices', 'we', 'show', 'that', 'on', 'any', 'onedimensional', 'set', 'of', 'n', 'points', 'for', 'any', 'varepsilon0', 'there', 'exists', 'an', 'mathcalokrobust', '1spanner', 'with', 'mathcalon1varepsilon', 'edges', 'previously', 'it', 'was', 'only', 'known', 'that', 'mathcalokrobust', 'spanners', 'with', 'mathcalon2', 'edges', 'exists', 'and', 'that', 'there', 'are', 'point', 'sets', 'on', 'which', 'any', 'mathcalokrobust', 'spanner', 'has', 'omeganlogn', 'edges']]
|
[-0.21866622778476888, 0.11895285649566226, -0.04251375015805005, -0.026644443139253605, -0.06313377720434019, -0.182770467638689, 0.13232455938373522, 0.41934251725192995, -0.25559054360780065, -0.2544897663687426, 0.052348966829188326, -0.41067944309844445, -0.1636270124450206, 0.13683000858622774, -0.09553930941488474, 0.008961141376095194, 0.1429637718334874, 0.13414465285517196, 0.004603866577869461, -0.29407833486210844, 0.2954685972472753, -0.08494296221322911, 0.1349842141192126, 0.031854698215410995, 0.1405554900486623, 0.03329311710937569, 0.06852502030131447, 0.0883894475944896, -0.1587921777746849, 0.027896785808186376, 0.25106176696918026, 0.15036427662757937, 0.24661967328559325, -0.35639177014774603, -0.18451473683679617, 0.24702430601727457, 0.09384479768253783, 0.04503391350754687, -0.012310456007628912, -0.18915852565839086, 0.16737631518113358, 0.013969597128790713, -0.07096635154198094, 0.021115539164873222, 0.18438450897473, -0.05455059237698073, -0.2567999411013819, -0.07185326809043525, 0.08461421089226841, 0.05634709324197022, 0.07711958677147425, -0.16354251736574757, -0.0706161819798972, 0.08202020828461935, -0.06402815990550544, 0.19120043787544452, 0.02885504755359243, -0.06629823491738368, -0.18344575419060646, 0.3715957933736424, 0.008457571218010558, -0.18907865643581395, 0.17156630109554977, -0.11659684684878636, -0.13195867029829852, 0.1373330174134143, 0.07436895099598714, 0.14730988059353123, -0.08273373117610332, 0.20309836756856112, -0.15725764932651673, 0.18114913765576376, 0.18368753401802912, 0.02993120673182671, 0.12579873895940122, 0.12971700802044842, 0.22706158870771045, 0.08524860071221126, -0.02436190706136967, -0.0018770690726977522, -0.3602617357567113, -0.11910288913115379, -0.29771617392418526, 0.07270333170640453, -0.22099247241317, -0.22675902277271273, 0.3223619089281607, 0.08073525261434336, 0.28743027558209755, 0.09224914475869868, 0.24875142848649892, 0.06491956861110114, 0.09171385883343636, 0.26407496225569516, 0.10677519664969495, 0.012416105042712422, -0.07713537238368023, -0.09780291441868069, 0.0899886681663213, 0.15631148556587837]
|
1,803.0872
|
A Unified and Strengthened Framework for the Uncertainty Relation
|
We provide a unified and strengthened framework for the product form and the
sum form variance-based uncertainty relations by constructing a unified
uncertainty relation. In the unified framework, we deduce that the
uncertainties of the incompatible observables are bounded by not only the
commutator of themselves, but also the quantities related with the other
operator. This operator can provide information so that we can capture the
uncertainty of the measurement result more accurately, and thus is named as the
information operator. The introduction of the information operator can fix the
deficiencies in both the product form and the sum form uncertainty relations,
and provides a more accurate description of the quantum uncertainty relation.
The unified framework also proposes a new interpretation of the uncertainty
relation for non-Hermitian operators; i.e., the "observable" second-order
origin moments of the non-Hermitian operators cannot be arbitrarily small at
the same time when they are generalized-incompatible on the new definition of
the generalized commutator.
|
quant-ph
|
we provide a unified and strengthened framework for the product form and the sum form variancebased uncertainty relations by constructing a unified uncertainty relation in the unified framework we deduce that the uncertainties of the incompatible observables are bounded by not only the commutator of themselves but also the quantities related with the other operator this operator can provide information so that we can capture the uncertainty of the measurement result more accurately and thus is named as the information operator the introduction of the information operator can fix the deficiencies in both the product form and the sum form uncertainty relations and provides a more accurate description of the quantum uncertainty relation the unified framework also proposes a new interpretation of the uncertainty relation for nonhermitian operators ie the observable secondorder origin moments of the nonhermitian operators cannot be arbitrarily small at the same time when they are generalizedincompatible on the new definition of the generalized commutator
|
[['we', 'provide', 'a', 'unified', 'and', 'strengthened', 'framework', 'for', 'the', 'product', 'form', 'and', 'the', 'sum', 'form', 'variancebased', 'uncertainty', 'relations', 'by', 'constructing', 'a', 'unified', 'uncertainty', 'relation', 'in', 'the', 'unified', 'framework', 'we', 'deduce', 'that', 'the', 'uncertainties', 'of', 'the', 'incompatible', 'observables', 'are', 'bounded', 'by', 'not', 'only', 'the', 'commutator', 'of', 'themselves', 'but', 'also', 'the', 'quantities', 'related', 'with', 'the', 'other', 'operator', 'this', 'operator', 'can', 'provide', 'information', 'so', 'that', 'we', 'can', 'capture', 'the', 'uncertainty', 'of', 'the', 'measurement', 'result', 'more', 'accurately', 'and', 'thus', 'is', 'named', 'as', 'the', 'information', 'operator', 'the', 'introduction', 'of', 'the', 'information', 'operator', 'can', 'fix', 'the', 'deficiencies', 'in', 'both', 'the', 'product', 'form', 'and', 'the', 'sum', 'form', 'uncertainty', 'relations', 'and', 'provides', 'a', 'more', 'accurate', 'description', 'of', 'the', 'quantum', 'uncertainty', 'relation', 'the', 'unified', 'framework', 'also', 'proposes', 'a', 'new', 'interpretation', 'of', 'the', 'uncertainty', 'relation', 'for', 'nonhermitian', 'operators', 'ie', 'the', 'observable', 'secondorder', 'origin', 'moments', 'of', 'the', 'nonhermitian', 'operators', 'can', 'not', 'be', 'arbitrarily', 'small', 'at', 'the', 'same', 'time', 'when', 'they', 'are', 'generalizedincompatible', 'on', 'the', 'new', 'definition', 'of', 'the', 'generalized', 'commutator']]
|
[-0.1034673058834587, 0.1263317383127287, -0.11545172346390406, 0.13586768835393973, -0.10591576768592283, -0.09655231087692553, 0.04421228469390705, 0.3085737562255014, -0.30449605396288576, -0.2920316415308397, 0.1022195683311836, -0.2788702227069136, -0.13691304811081978, 0.1744636889146287, -0.06872558199079955, 0.044707925035323524, 0.05585989873868095, 0.06797353149711484, -0.13643677055738465, -0.1541938532933687, 0.3583305784607235, 0.03169592370756583, 0.26207550532549995, 0.08165824051785778, 0.09472269039377099, 0.008879332184272854, -0.044759856923070704, 0.025644935920976008, -0.10219032143854574, 0.19454602061113627, 0.23304394637882897, 0.15839206503079378, 0.24187116343174367, -0.4104258348057164, -0.18637834565973357, 0.11127587942601051, 0.1431062181046987, 0.08504399072520341, -0.002042179358047374, -0.2867368409952408, 0.030749319940569658, -0.20912340841745322, -0.1012108702672339, -0.1265178054255799, -0.012329128806632532, -0.014560392751252349, -0.28688909948355507, 0.11627778163602681, 0.10487308187551703, 0.013778196767033696, -0.05727233143639014, -0.09318195551315535, 0.010238196291147342, 0.1506093154873926, -0.010477157136502003, -0.006361446393465128, 0.08942494289419037, -0.07506842868766582, -0.08756780677439668, 0.39542721006783504, -0.052208140143193305, -0.26079137891507415, 0.0768874810597435, -0.1492747712314506, -0.14131596567598467, 0.03197092683307968, 0.1375936405273461, 0.10025479150287618, -0.209006698848256, 0.07321073089046934, -0.043149346672882664, 0.12548680247479602, 0.005731896242374389, 0.10811434884237338, 0.1923853627662469, 0.09492835175994595, 0.07580748658341391, 0.09301177532776093, -0.004061804472798882, -0.11330092967269777, -0.3758690565311692, -0.1695987440775925, -0.1475045302635224, 0.02434422580036777, -0.12358988119137129, -0.13015859514545602, 0.3793036674762357, 0.15372742315212004, 0.21362043756555435, 0.08531596995241751, 0.2817189780511905, 0.19534663217587256, 0.10131718328073798, 0.0553079752319292, 0.23445110741260025, 0.15075186415151046, 0.041057295780452085, -0.1778910274829574, 0.10179108256898538, 0.09681196543533588]
|
1,803.08721
|
Unsupervised Keyphrase Extraction with Multipartite Graphs
|
We propose an unsupervised keyphrase extraction model that encodes topical
information within a multipartite graph structure. Our model represents
keyphrase candidates and topics in a single graph and exploits their mutually
reinforcing relationship to improve candidate ranking. We further introduce a
novel mechanism to incorporate keyphrase selection preferences into the model.
Experiments conducted on three widely used datasets show significant
improvements over state-of-the-art graph-based models.
|
cs.IR cs.CL
|
we propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking we further introduce a novel mechanism to incorporate keyphrase selection preferences into the model experiments conducted on three widely used datasets show significant improvements over stateoftheart graphbased models
|
[['we', 'propose', 'an', 'unsupervised', 'keyphrase', 'extraction', 'model', 'that', 'encodes', 'topical', 'information', 'within', 'a', 'multipartite', 'graph', 'structure', 'our', 'model', 'represents', 'keyphrase', 'candidates', 'and', 'topics', 'in', 'a', 'single', 'graph', 'and', 'exploits', 'their', 'mutually', 'reinforcing', 'relationship', 'to', 'improve', 'candidate', 'ranking', 'we', 'further', 'introduce', 'a', 'novel', 'mechanism', 'to', 'incorporate', 'keyphrase', 'selection', 'preferences', 'into', 'the', 'model', 'experiments', 'conducted', 'on', 'three', 'widely', 'used', 'datasets', 'show', 'significant', 'improvements', 'over', 'stateoftheart', 'graphbased', 'models']]
|
[-0.04502955831658955, -0.05163885027756735, -0.09191544965769236, 0.07465443765887847, -0.18709529190539168, -0.17419633721359648, 0.07902736182396229, 0.46110936394677715, -0.27018800938072113, -0.33754218097489613, -0.03356453146821318, -0.3251753462048677, -0.1903158715961931, 0.14031660656014888, -0.09361469496686298, 0.036286134659670864, 0.130625374734742, 0.055774121552419204, -0.04051865897714518, -0.2770263886876189, 0.2988684855079135, 0.04794134963303805, 0.4063783668554746, 0.07012192328961996, 0.15924533940493488, 0.02711919480934739, -0.13363293293648615, -0.017390832405250807, -0.11934703729314676, 0.18717514713509725, 0.3239381284979642, 0.25118397923472985, 0.32736153280577407, -0.3573502082377672, -0.2715204425442677, 0.10402836628401509, 0.15256453028235298, 0.11204895580460568, -0.08306399825423096, -0.3348293149987092, 0.05743334108533767, -0.21756341690242362, 0.07735428870655596, -0.18840191829949618, -0.04689423479139805, -0.08205186870808785, -0.301856112448821, 0.06426092099326734, 0.08813759612206083, 0.0002461647901397485, -0.04511443771278629, -0.1487005132322128, 0.04811260925534253, 0.13373152545581643, -0.03077921362128109, 0.044713507196865974, 0.10802172722133736, -0.16589068592740938, -0.28356498628854754, 0.38528878539800643, -0.08658407421854253, -0.21546530405489298, 0.1753784823159759, 0.048963287415412754, -0.2055707755426948, 0.03946765395096288, 0.2756723252053444, 0.1320474003477452, -0.2017415214768754, -0.033629196346737444, -0.08794564164888401, 0.2489459894740811, -0.028544988117825527, 0.02533799076739412, 0.25645886761799025, 0.31081881935779865, -0.011363450452112234, 0.182861421085321, -0.10936186401388392, -0.08656363250830999, -0.19276931294454977, -0.09076880652529117, -0.11993724361348611, -0.08421465957161182, -0.13543725965786368, -0.1444782025538958, 0.47254396986502867, 0.2826331763886488, 0.20437559943216352, 0.019471597252413632, 0.297364427951666, -0.04225837758993013, 0.12346433061175048, 0.07791393161393129, 0.15346504090210566, 0.04139450195317085, 0.040675693852468754, -0.1276644150225016, 0.10034991386212194, 0.05961369675799058]
|
1,803.08722
|
The neutrino mass hierarchy from oscillation
|
The ordering of the neutrino mass eigenstates, also addressed as Mass
Hierarchy (MH), is one of the most relevant issues in neutrino physics,
currently under investigation by many proposals and experiments. In this short
note focus will be given to the different ways to determine MH from neutrino
oscillation data in the near future. A pragmatic strategy is suggested and two
recent new methods of analysis are recalled. Statistical issues and concerns
are also addressed, envisaging the necessity of more accurate studies and
analyses.
|
hep-ph
|
the ordering of the neutrino mass eigenstates also addressed as mass hierarchy mh is one of the most relevant issues in neutrino physics currently under investigation by many proposals and experiments in this short note focus will be given to the different ways to determine mh from neutrino oscillation data in the near future a pragmatic strategy is suggested and two recent new methods of analysis are recalled statistical issues and concerns are also addressed envisaging the necessity of more accurate studies and analyses
|
[['the', 'ordering', 'of', 'the', 'neutrino', 'mass', 'eigenstates', 'also', 'addressed', 'as', 'mass', 'hierarchy', 'mh', 'is', 'one', 'of', 'the', 'most', 'relevant', 'issues', 'in', 'neutrino', 'physics', 'currently', 'under', 'investigation', 'by', 'many', 'proposals', 'and', 'experiments', 'in', 'this', 'short', 'note', 'focus', 'will', 'be', 'given', 'to', 'the', 'different', 'ways', 'to', 'determine', 'mh', 'from', 'neutrino', 'oscillation', 'data', 'in', 'the', 'near', 'future', 'a', 'pragmatic', 'strategy', 'is', 'suggested', 'and', 'two', 'recent', 'new', 'methods', 'of', 'analysis', 'are', 'recalled', 'statistical', 'issues', 'and', 'concerns', 'are', 'also', 'addressed', 'envisaging', 'the', 'necessity', 'of', 'more', 'accurate', 'studies', 'and', 'analyses']]
|
[-0.08547771426466559, 0.17575886616084194, -0.0358346733708112, 0.1657782782138037, -0.08879145574090737, -0.1339342242406149, 0.05450409159640826, 0.35453625999036287, -0.21556613574475272, -0.329182232148014, 0.150288410186823, -0.28978742676831426, -0.10238831950534534, 0.26641542511060834, -0.04025657271545026, 0.07611307190936281, 0.09948403543482225, 0.0042041258753410405, -0.11963476695209033, -0.255716372414359, 0.3348793618026234, 0.09425755172213983, 0.2766638848642331, 0.09074627470233411, 0.024397433576052122, -0.04838917138321059, -0.11819324370784064, -0.0223955391085751, -0.14711852780774712, 0.09637474835783776, 0.2802162482403219, 0.17526567106999988, 0.26856010997047025, -0.3886831297228734, -0.20250531450091375, 0.10380535499591913, 0.15606526604720525, 0.11168435667475153, -0.07855220087835083, -0.26807658601596596, 0.05434735748747785, -0.14201862912713772, -0.1355835301080896, -0.08092313588574707, -0.027182788000486437, -0.009310407985356591, -0.218648723681413, 0.05710620227632933, 0.024252763733134737, 0.036567266176765166, -0.01059622647118799, -0.1883460113423921, 0.0467047820178171, 0.10632765718314442, 0.14579261581613018, -0.021097497670866903, 0.0940850781681504, -0.12385237089169789, -0.12281599160771639, 0.3990637879552586, -0.0019614708781730207, -0.1579958001994306, 0.1616088420962028, -0.1392275941990582, -0.20402095375383006, 0.059746644869890245, 0.13499659152945415, 0.09511116115997235, -0.23325740967300676, 0.04873963163533647, -0.03489782998804003, 0.12826359429995396, 0.021624755588293607, 0.025031690973611104, 0.27930530903506134, 0.24173609616367944, 0.07769470349705357, 0.008661597732931287, -0.073276611607677, -0.08360455930233002, -0.2960987115012748, -0.09202238469550225, -0.11925064111571937, -0.004794457676498929, -0.006150762411943149, -0.07154774646984324, 0.4065007673399079, 0.22285510444392762, 0.2098449484910816, -0.052002020698550734, 0.31056684373124016, 0.06484781581370737, 0.0520134506902347, 0.014368309437053367, 0.25333504356066916, 0.10432950726300035, 0.1373530356435194, -0.20027218404547534, 0.04304668821333464, 0.013650225547497116]
|
1,803.08723
|
Very degenerate elliptic equations under almost critical Sobolev
regularity
|
We prove the local Lipschitz continuity and the higher differentiability of
local minimizers of integral functionals with non autonomous integrand which is
degenerate convex with respect to the gradient variable. The main novelty here
is that the results are obtained assuming that the coefficients have weak
derivative in an almost critical Zygmund class and the datum f is assumed to
belong to the same Zygmund class.
|
math.AP
|
we prove the local lipschitz continuity and the higher differentiability of local minimizers of integral functionals with non autonomous integrand which is degenerate convex with respect to the gradient variable the main novelty here is that the results are obtained assuming that the coefficients have weak derivative in an almost critical zygmund class and the datum f is assumed to belong to the same zygmund class
|
[['we', 'prove', 'the', 'local', 'lipschitz', 'continuity', 'and', 'the', 'higher', 'differentiability', 'of', 'local', 'minimizers', 'of', 'integral', 'functionals', 'with', 'non', 'autonomous', 'integrand', 'which', 'is', 'degenerate', 'convex', 'with', 'respect', 'to', 'the', 'gradient', 'variable', 'the', 'main', 'novelty', 'here', 'is', 'that', 'the', 'results', 'are', 'obtained', 'assuming', 'that', 'the', 'coefficients', 'have', 'weak', 'derivative', 'in', 'an', 'almost', 'critical', 'zygmund', 'class', 'and', 'the', 'datum', 'f', 'is', 'assumed', 'to', 'belong', 'to', 'the', 'same', 'zygmund', 'class']]
|
[-0.13374209024407196, 0.03899841535343457, -0.08258963797319059, 0.06835167835092623, -0.10974225178925377, -0.08651399708381205, -0.044766448494611366, 0.35382098659421457, -0.3375788640061563, -0.19499095965081573, 0.12149130600102415, -0.29050907772034407, -0.10185468170058096, 0.1650778939947486, -0.11601172951332321, 0.1011008579763725, 0.004082816194347812, 0.0710775214670734, -0.10288149215083456, -0.2911408919784607, 0.41519919887297985, -0.0633460717781969, 0.2255186781668189, 0.018534863339454838, 0.12200697423946677, -0.03894148237128375, 0.013412702842756655, -0.0070810905784707175, -0.1426004602965832, 0.1417089291340248, 0.21284729050415935, 0.005218161030136274, 0.33846625397828495, -0.35930946097836236, -0.1767953107923721, 0.1964594333108063, 0.04488647513966443, -0.01174016613477954, 0.011556493326541826, -0.2781799290837212, 0.13470058838808627, -0.07016287533792132, -0.22016347989185966, -0.08247285807561694, 0.008065471037601432, 0.1318686843574555, -0.32734605980416137, 0.12398371072203825, 0.11105246765708382, 0.03037013490261002, -0.16199523706525337, -0.10489059106983019, -0.07231688982750656, 0.06041996522496144, 0.08211658276603416, 0.11881129303947091, 0.08934750923689341, -0.09376920020264207, -0.052858247880287694, 0.32849133466229297, -0.1318699777210978, -0.264800788164421, 0.2020400335278475, -0.21879224601963704, -0.17179019000578785, 0.11779852851194653, 0.09065391791448223, 0.16873720849892407, -0.15496280368869053, 0.17043415532327455, -0.04526257562578063, 0.10156318312510848, 0.05002436822872947, 0.038147567926595606, 0.0519234448791284, 0.046101967437249244, 0.22299368469623115, 0.12870067773231617, -0.00546677808531306, -0.11321111517309239, -0.398566756863147, -0.16291743745519358, -0.2025338639646317, 0.06612820354657191, -0.1026681577923503, -0.22067380116575144, 0.3340506527950338, 0.08578225778359355, 0.13806143623184075, 0.14095486958941558, 0.18461438482909492, 0.20754964144505333, 0.06506118828882322, 0.09431015221211551, 0.2475318771956319, 0.14817666977813299, 0.07760643526544851, -0.1629895675278297, 0.08956585847067111, 0.15556526096594153]
|
1,803.08724
|
Quantum and thermal fluctuations in two-component Bose gases
|
We study the effects of quantum and thermal fluctuations on Bose-Bose
mixtures at finite temperature employing the time-dependent
Hartree-Fock-Bogoliubov (TDHFB) theory. The theory governs selfconsistently the
motion of the condensates, the noncondensates and of the anomalous components
on an equal footing. The finite temperature criterion for the phase separation
is established. We numerically analyze the temperature dependence of different
densities for both miscible and immiscible mixtures. We show that the degree of
the overlap between the two condensates and the thermal clouds is lowered and
the relative motion of the centers-of-mass of the condensed and thermal
components is strongly damped due to the presence of the pair anomalous
fluctuations. Our results are compared with previous theoretical and
experimental findings. On the other hand, starting from our TDHFB equations, we
develop a random-phase theory for the elementary excitations in a homogeneous
mixture. We find that the normal and anomalous fluctuations may lead to enhance
the excitations and the thermodynamics of the system.
|
cond-mat.quant-gas
|
we study the effects of quantum and thermal fluctuations on bosebose mixtures at finite temperature employing the timedependent hartreefockbogoliubov tdhfb theory the theory governs selfconsistently the motion of the condensates the noncondensates and of the anomalous components on an equal footing the finite temperature criterion for the phase separation is established we numerically analyze the temperature dependence of different densities for both miscible and immiscible mixtures we show that the degree of the overlap between the two condensates and the thermal clouds is lowered and the relative motion of the centersofmass of the condensed and thermal components is strongly damped due to the presence of the pair anomalous fluctuations our results are compared with previous theoretical and experimental findings on the other hand starting from our tdhfb equations we develop a randomphase theory for the elementary excitations in a homogeneous mixture we find that the normal and anomalous fluctuations may lead to enhance the excitations and the thermodynamics of the system
|
[['we', 'study', 'the', 'effects', 'of', 'quantum', 'and', 'thermal', 'fluctuations', 'on', 'bosebose', 'mixtures', 'at', 'finite', 'temperature', 'employing', 'the', 'timedependent', 'hartreefockbogoliubov', 'tdhfb', 'theory', 'the', 'theory', 'governs', 'selfconsistently', 'the', 'motion', 'of', 'the', 'condensates', 'the', 'noncondensates', 'and', 'of', 'the', 'anomalous', 'components', 'on', 'an', 'equal', 'footing', 'the', 'finite', 'temperature', 'criterion', 'for', 'the', 'phase', 'separation', 'is', 'established', 'we', 'numerically', 'analyze', 'the', 'temperature', 'dependence', 'of', 'different', 'densities', 'for', 'both', 'miscible', 'and', 'immiscible', 'mixtures', 'we', 'show', 'that', 'the', 'degree', 'of', 'the', 'overlap', 'between', 'the', 'two', 'condensates', 'and', 'the', 'thermal', 'clouds', 'is', 'lowered', 'and', 'the', 'relative', 'motion', 'of', 'the', 'centersofmass', 'of', 'the', 'condensed', 'and', 'thermal', 'components', 'is', 'strongly', 'damped', 'due', 'to', 'the', 'presence', 'of', 'the', 'pair', 'anomalous', 'fluctuations', 'our', 'results', 'are', 'compared', 'with', 'previous', 'theoretical', 'and', 'experimental', 'findings', 'on', 'the', 'other', 'hand', 'starting', 'from', 'our', 'tdhfb', 'equations', 'we', 'develop', 'a', 'randomphase', 'theory', 'for', 'the', 'elementary', 'excitations', 'in', 'a', 'homogeneous', 'mixture', 'we', 'find', 'that', 'the', 'normal', 'and', 'anomalous', 'fluctuations', 'may', 'lead', 'to', 'enhance', 'the', 'excitations', 'and', 'the', 'thermodynamics', 'of', 'the', 'system']]
|
[-0.12333001962106209, 0.22135286085040207, -0.12099871011741925, 0.039612441020290136, 0.013246574658842292, -0.075830681133084, 0.03370388680123142, 0.30706033546011896, -0.23559629979426971, -0.2538086480461061, 0.04444138022590778, -0.3265406131395139, -0.10181891406136856, 0.14347134869312866, 0.040481802745489404, 0.026189954005531035, -0.024547768310003448, 0.01984931140759727, -0.08514036953347386, -0.2100541419320507, 0.34322308994305784, 0.01295280856647878, 0.3214153971057385, 0.10902354662539437, 0.09493590835477335, -0.000916362444695551, 0.004263542307307943, 0.04386269142269157, -0.1448171434397409, 0.08026392412430142, 0.18211145155364647, -0.018215795347350648, 0.19224773633759468, -0.4444143250468187, -0.22783106986316853, 0.07775002442358528, 0.12924889359273947, 0.16772340659081236, -0.014745004477299517, -0.2782168382080272, 0.008613861110643484, -0.15452732608764563, -0.16482675530060079, -0.09505537538934732, 0.0029407136811641977, 0.04241835663742677, -0.25041550792520867, 0.1391114121535793, 0.06642701353871416, 0.04468780020833947, -0.1177585847035516, -0.1452185616210045, -0.02714255385217257, 0.08910834202251863, 0.030367815063800662, -0.019692880169895944, 0.141889032204017, -0.14473590811248868, -0.07171336375176907, 0.3783138836210128, -0.10968817091925302, -0.18064313957002015, 0.24541777889535296, -0.14981556468992493, -0.08342204867512919, 0.12073303539364133, 0.1576273778664472, 0.11542390091926791, -0.10978628546290566, 0.06282046017695393, -0.011467922769952565, 0.15628118041931885, 0.010260282395574905, 0.03237646246852819, 0.23032352556474506, 0.14654205145488958, -0.017041180519390763, 0.15495325447009237, -0.10781092043762328, -0.16051815682440065, -0.29212675226735885, -0.1302073269660468, -0.17721182949026115, -0.007273811957566068, -0.0956902964818255, -0.17102065754006618, 0.37801558800856583, 0.1788128726220748, 0.160918233031407, 0.02603266703808913, 0.286781201188569, 0.1572208633660921, -0.005009903269819915, 0.05392757451336365, 0.26995127664413304, 0.19796289719524793, 0.07390430593804923, -0.34805694291280814, 0.021711194841191172, 0.054193844815017655]
|
1,803.08725
|
Fully Automated HTML and Javascript Rewriting for Constructing a
Self-healing Web Proxy
|
Over the last few years, the complexity of web applications has increased to
provide more dynamic web applications to users. The drawback of this complexity
is the growing number of errors in the front-end applications. In this paper,
we present an approach to provide self-healing for the web. We implemented this
approach in two different tools: 1) BikiniProxy, an HTTP repair proxy, and 2)
BugBlock, a browser extension. They use five self-healing strategies to rewrite
the buggy HTML and Javascript code to handle errors in web pages. We evaluate
BikiniProxy and BugBlock with a new benchmark of 555 reproducible Javascript
errors of which 31.76% can be automatically self-healed by BikiniProxy and
15.67% by BugBlock.
|
cs.SE
|
over the last few years the complexity of web applications has increased to provide more dynamic web applications to users the drawback of this complexity is the growing number of errors in the frontend applications in this paper we present an approach to provide selfhealing for the web we implemented this approach in two different tools 1 bikiniproxy an http repair proxy and 2 bugblock a browser extension they use five selfhealing strategies to rewrite the buggy html and javascript code to handle errors in web pages we evaluate bikiniproxy and bugblock with a new benchmark of 555 reproducible javascript errors of which 3176 can be automatically selfhealed by bikiniproxy and 1567 by bugblock
|
[['over', 'the', 'last', 'few', 'years', 'the', 'complexity', 'of', 'web', 'applications', 'has', 'increased', 'to', 'provide', 'more', 'dynamic', 'web', 'applications', 'to', 'users', 'the', 'drawback', 'of', 'this', 'complexity', 'is', 'the', 'growing', 'number', 'of', 'errors', 'in', 'the', 'frontend', 'applications', 'in', 'this', 'paper', 'we', 'present', 'an', 'approach', 'to', 'provide', 'selfhealing', 'for', 'the', 'web', 'we', 'implemented', 'this', 'approach', 'in', 'two', 'different', 'tools', '1', 'bikiniproxy', 'an', 'http', 'repair', 'proxy', 'and', '2', 'bugblock', 'a', 'browser', 'extension', 'they', 'use', 'five', 'selfhealing', 'strategies', 'to', 'rewrite', 'the', 'buggy', 'html', 'and', 'javascript', 'code', 'to', 'handle', 'errors', 'in', 'web', 'pages', 'we', 'evaluate', 'bikiniproxy', 'and', 'bugblock', 'with', 'a', 'new', 'benchmark', 'of', '555', 'reproducible', 'javascript', 'errors', 'of', 'which', '3176', 'can', 'be', 'automatically', 'selfhealed', 'by', 'bikiniproxy', 'and', '1567', 'by', 'bugblock']]
|
[-0.09936447602601936, 0.012631756288825692, -0.04612384472182433, 0.05917626631083544, -0.1104248793944057, -0.14934011073206113, 0.05811675004887733, 0.3953861906005181, -0.2712788206599323, -0.36616121875369445, 0.11790608819079611, -0.2717755056456127, -0.12434634797077264, 0.23879359580939058, -0.14070967513762941, 0.04453504109029881, 0.04618747801050148, -0.013529119777711587, -0.029180281577411364, -0.33021270416149523, 0.2341722778448489, 0.07109771367673458, 0.25391740537355695, 0.07800412556337835, 0.045454640979919816, 0.00432198688973038, -0.07240473850119232, -0.007673332121519916, -0.100770552024509, 0.1634706698679489, 0.32277179410499807, 0.24864230474737364, 0.2985088555636791, -0.3932043653294708, -0.16373177851443138, 0.025518533748994886, 0.155167077694797, 0.11495548971636073, -0.05517007307568256, -0.2938236244377243, 0.15715315219620654, -0.279858140526257, -0.053797852214986244, -0.08056970507800744, 0.02984111580948255, 0.0014338229857055486, -0.21147332084983322, -0.051226488846164625, 0.004729260888313298, 0.09404963634669188, 0.020966588676107668, -0.05711432866982918, 0.030182247478679744, 0.15566398902689066, 0.04846884003341759, 0.03186917809802478, 0.15591334718057012, -0.10324693381299824, -0.15631174380206955, 0.3550440310541771, -0.0348698351845409, -0.13965370853027675, 0.19245141223114215, 0.01689939750605716, -0.1710508414585374, 0.12823524406031434, 0.22794487675965097, 0.10384261060868745, -0.20967490737845676, 0.06538655565829074, 0.014393812581171504, 0.22627687640488148, 0.07654536066708707, 0.007705927984989908, 0.1503946942656375, 0.19639601819866245, 0.03493887767920979, 0.15773542963722473, -0.052499140893002, -0.023028293258018084, -0.23967153921031056, -0.19279758721606527, -0.1169030657615018, -0.016496779773161805, -0.1022459137932381, -0.1910059755272438, 0.38934132123811055, 0.24449254285989214, 0.10877982988557984, 0.07248474140878174, 0.33417175901410856, -0.020427225701576842, 0.13158536842736762, 0.13852052478350502, 0.11034790363855067, -0.0022897707933016054, 0.18895538201848194, -0.10553262706236106, 0.07180947730466064, 0.013395921184487673]
|
1,803.08726
|
Robustness of Yu-Shiba-Rusinov resonances in presence of a complex
superconducting order parameter
|
Robust quantum systems rely on having a protective environment with minimized
relaxation channels. Superconducting gaps play an important role in the design
of such environments. The interaction of localized single spins with a
conventional superconductor generally leads to intrinsically extremely narrow
Yu-Shiba-Rusinov (YSR) resonances protected inside the superconducting gap.
However, this may not apply to superconductors with nontrivial, energy
dependent order parameters. Exploiting the Fe-doped two-band superconductor
NbSe$_2$, we show that due to the nontrivial relation between its complex
valued and energy dependent order parameters, YSR states are no longer
restricted to be inside the gap. They can appear outside the gap (i. e. inside
the coherence peaks), where they can also acquire a substantial intrinsic
lifetime broadening. T-matrix scattering calculations show excellent agreement
with the experimental data and relate the intrinsic YSR state broadening to the
imaginary part of the host's order parameters. Our results suggest that
non-thermal relaxation mechanisms contribute to the finite lifetime of the YSR
states, even within the superconducting gap, making them less protected against
residual interactions than previously assumed. YSR states may serve as valuable
probes for nontrivial order parameters promoting a judicious selection of
protective superconductors.
|
cond-mat.supr-con
|
robust quantum systems rely on having a protective environment with minimized relaxation channels superconducting gaps play an important role in the design of such environments the interaction of localized single spins with a conventional superconductor generally leads to intrinsically extremely narrow yushibarusinov ysr resonances protected inside the superconducting gap however this may not apply to superconductors with nontrivial energy dependent order parameters exploiting the fedoped twoband superconductor nbse_2 we show that due to the nontrivial relation between its complex valued and energy dependent order parameters ysr states are no longer restricted to be inside the gap they can appear outside the gap i e inside the coherence peaks where they can also acquire a substantial intrinsic lifetime broadening tmatrix scattering calculations show excellent agreement with the experimental data and relate the intrinsic ysr state broadening to the imaginary part of the hosts order parameters our results suggest that nonthermal relaxation mechanisms contribute to the finite lifetime of the ysr states even within the superconducting gap making them less protected against residual interactions than previously assumed ysr states may serve as valuable probes for nontrivial order parameters promoting a judicious selection of protective superconductors
|
[['robust', 'quantum', 'systems', 'rely', 'on', 'having', 'a', 'protective', 'environment', 'with', 'minimized', 'relaxation', 'channels', 'superconducting', 'gaps', 'play', 'an', 'important', 'role', 'in', 'the', 'design', 'of', 'such', 'environments', 'the', 'interaction', 'of', 'localized', 'single', 'spins', 'with', 'a', 'conventional', 'superconductor', 'generally', 'leads', 'to', 'intrinsically', 'extremely', 'narrow', 'yushibarusinov', 'ysr', 'resonances', 'protected', 'inside', 'the', 'superconducting', 'gap', 'however', 'this', 'may', 'not', 'apply', 'to', 'superconductors', 'with', 'nontrivial', 'energy', 'dependent', 'order', 'parameters', 'exploiting', 'the', 'fedoped', 'twoband', 'superconductor', 'nbse_2', 'we', 'show', 'that', 'due', 'to', 'the', 'nontrivial', 'relation', 'between', 'its', 'complex', 'valued', 'and', 'energy', 'dependent', 'order', 'parameters', 'ysr', 'states', 'are', 'no', 'longer', 'restricted', 'to', 'be', 'inside', 'the', 'gap', 'they', 'can', 'appear', 'outside', 'the', 'gap', 'i', 'e', 'inside', 'the', 'coherence', 'peaks', 'where', 'they', 'can', 'also', 'acquire', 'a', 'substantial', 'intrinsic', 'lifetime', 'broadening', 'tmatrix', 'scattering', 'calculations', 'show', 'excellent', 'agreement', 'with', 'the', 'experimental', 'data', 'and', 'relate', 'the', 'intrinsic', 'ysr', 'state', 'broadening', 'to', 'the', 'imaginary', 'part', 'of', 'the', 'hosts', 'order', 'parameters', 'our', 'results', 'suggest', 'that', 'nonthermal', 'relaxation', 'mechanisms', 'contribute', 'to', 'the', 'finite', 'lifetime', 'of', 'the', 'ysr', 'states', 'even', 'within', 'the', 'superconducting', 'gap', 'making', 'them', 'less', 'protected', 'against', 'residual', 'interactions', 'than', 'previously', 'assumed', 'ysr', 'states', 'may', 'serve', 'as', 'valuable', 'probes', 'for', 'nontrivial', 'order', 'parameters', 'promoting', 'a', 'judicious', 'selection', 'of', 'protective', 'superconductors']]
|
[-0.1962724342589976, 0.21101779432147272, -0.07029496620371793, 0.1079675001659252, -0.08944576297563361, -0.16651467075137122, 0.10390120386351093, 0.39379637865011863, -0.23825782409584428, -0.32004057985146583, 0.006567928263883787, -0.29714913894012185, -0.08495603526889352, 0.1537487195416262, 0.018516528995591818, 0.01940745527830718, 0.02557546739500267, -0.00781837516884112, -0.09868657585580887, -0.2007281473027108, 0.31698372640875905, 0.04850750743264304, 0.32202937155165784, 0.10278767378219052, -0.02922725590691453, 0.0014203744132187546, 0.08890170045920835, -0.004672653833162908, -0.1143378411662322, 0.07449676502294539, 0.2932783524976884, -0.06685470921407247, 0.2179018126684844, -0.4781335910367224, -0.21661039619402564, 0.07930368361294926, 0.18503458569926534, 0.1258018248632473, -0.036470702692499586, -0.3016661765160029, 0.040756858289639895, -0.14572643113960126, -0.1400281453488269, -0.1012699580823742, -0.012741242323090067, -0.042871744697069065, -0.24423643948065135, 0.10372785381701959, 0.05301400026127966, 0.00406218105965563, -0.08530042901058522, -0.12860961690776707, -0.0632142277007411, 0.09696844645891667, 0.02537579046456153, 0.00822647676653581, 0.15717565914533954, -0.10238168496001833, -0.09028081159671972, 0.32472713668034486, -0.028721325718716315, -0.14022975732992196, 0.2189228468082382, -0.12834728061380782, -0.05731773860704328, 0.1575418195875429, 0.11516437389357968, 0.06800237683087124, -0.08465872347503273, 0.05143322179834672, 0.0017833844567057941, 0.2252816619991489, 0.005363439260728638, 0.18435674700840018, 0.2558386999057543, 0.16417444389255553, 0.056669379905387375, 0.1130664051140036, -0.0863283182196669, -0.07892550896718094, -0.28167805653258465, -0.12016694333978538, -0.2069086230678455, 0.060310991360535096, -0.03585160344732332, -0.18505640638934284, 0.38835661571202656, 0.1385138449982928, 0.2145725367494275, -0.0470989627167679, 0.24543610043881625, 0.11616522751005434, 0.1330323516116164, 0.07311508578243496, 0.24784366407195213, 0.14427889510868552, 0.05782293585741921, -0.3108141524331171, 0.10991282287925974, -0.0675473842025527]
|
1,803.08727
|
Equivariant ZFA with Choice: a position paper
|
We propose Equivariant ZFA with Choice as a foundation for nominal techniques
that is stronger than ZFC and weaker than FM, and why this may be particularly
helpful in the context of automated reasoning.
|
cs.LO math.LO
|
we propose equivariant zfa with choice as a foundation for nominal techniques that is stronger than zfc and weaker than fm and why this may be particularly helpful in the context of automated reasoning
|
[['we', 'propose', 'equivariant', 'zfa', 'with', 'choice', 'as', 'a', 'foundation', 'for', 'nominal', 'techniques', 'that', 'is', 'stronger', 'than', 'zfc', 'and', 'weaker', 'than', 'fm', 'and', 'why', 'this', 'may', 'be', 'particularly', 'helpful', 'in', 'the', 'context', 'of', 'automated', 'reasoning']]
|
[-0.04882981611744446, 0.12115163610809866, -0.10801918725209202, 0.19825941280407064, -0.1574962786398828, -0.2049035334493965, 0.05026461923604503, 0.38899798406397595, -0.19315358547165112, -0.2806910995517255, 0.1216127131757436, -0.16956891481052427, -0.12931004352867603, 0.24843098803916397, -0.13228805453571327, -0.022137274363023395, 0.04064596104709541, 0.04587574286715073, -0.10672289483002662, -0.1833809204493745, 0.3100957122412236, 0.06878995079108897, 0.30436559015994563, 0.050983150653979355, 0.011154183487900916, 0.057224967503262794, 0.04643451701849699, 0.09154644440037801, -0.10704182663025943, 0.1965057555729907, 0.33103579600505967, 0.1331345571533722, 0.3224835846134845, -0.4275237452786635, -0.18385496368522153, 0.10405123795327895, 0.14882738025420728, 0.09752485427238486, 0.013009656412417398, -0.24776567852891543, 0.16931662766043754, -0.14191280628609307, -0.12206399788641754, -0.15008625374449527, 0.03580351606668795, -0.05121874054619933, -0.2758295552476364, 0.040034204584491605, 0.19361745778416448, 0.16587485972901478, -0.019320863298215793, -0.1486892985892208, 0.02320006854065201, 0.05699487845413387, 0.038678591365597266, 0.10338991528431721, 0.11284249071853564, -0.07548855249906945, -0.1212658164474894, 0.407070128562148, -0.09834222632943078, -0.14634110975791426, 0.19034865035620682, -0.08827514653368031, -0.18009815981392474, 0.04880462236264173, 0.07680964195991263, 0.14113952887847142, -0.1271533042069196, 0.00029540694359799516, -0.037788025225060716, 0.22637059816214092, 0.028596906183177933, 0.05669960389187669, 0.21184163740562165, 0.22770971963729927, 0.10430680752238806, 0.1368133348159437, -0.023490949533879757, -0.06554772463791511, -0.2851511763737482, -0.14556325644062942, -0.039052109672304464, 0.060688552090569454, -0.06136183091353707, -0.0841192371376297, 0.28841704004170265, 0.25189154347582887, 0.14872602317807512, 0.07484938376857077, 0.3023635090383537, 0.08457933609743658, 0.08596099787117804, 0.043554672437226945, 0.23933387748034232, 0.09061444726060419, 0.11405759184237789, -0.11104380423956386, 0.15744761589859776, 0.056166109841262156]
|
1,803.08728
|
Preferential attachment graphs with co-existing types of different
fitnesses
|
We extend the work of Antunovi\'{c}, Mossel and R\'{a}cz on competing types
in preferential attachment models to include cases where the types have
different fitnesses, which may be either multiplicative or additive. We will
show that, depending on the values of the parameters of the models, there are
different possible limiting behaviours depending on the zeros of a certain
function. In particular we will show the existence of choices of the parameters
where one type is favoured both by having higher fitness and by the type
attachment mechanism, but the other type has a positive probability of
dominating the network in the limit.
|
math.PR
|
we extend the work of antunovic mossel and racz on competing types in preferential attachment models to include cases where the types have different fitnesses which may be either multiplicative or additive we will show that depending on the values of the parameters of the models there are different possible limiting behaviours depending on the zeros of a certain function in particular we will show the existence of choices of the parameters where one type is favoured both by having higher fitness and by the type attachment mechanism but the other type has a positive probability of dominating the network in the limit
|
[['we', 'extend', 'the', 'work', 'of', 'antunovic', 'mossel', 'and', 'racz', 'on', 'competing', 'types', 'in', 'preferential', 'attachment', 'models', 'to', 'include', 'cases', 'where', 'the', 'types', 'have', 'different', 'fitnesses', 'which', 'may', 'be', 'either', 'multiplicative', 'or', 'additive', 'we', 'will', 'show', 'that', 'depending', 'on', 'the', 'values', 'of', 'the', 'parameters', 'of', 'the', 'models', 'there', 'are', 'different', 'possible', 'limiting', 'behaviours', 'depending', 'on', 'the', 'zeros', 'of', 'a', 'certain', 'function', 'in', 'particular', 'we', 'will', 'show', 'the', 'existence', 'of', 'choices', 'of', 'the', 'parameters', 'where', 'one', 'type', 'is', 'favoured', 'both', 'by', 'having', 'higher', 'fitness', 'and', 'by', 'the', 'type', 'attachment', 'mechanism', 'but', 'the', 'other', 'type', 'has', 'a', 'positive', 'probability', 'of', 'dominating', 'the', 'network', 'in', 'the', 'limit']]
|
[-0.11207223752992752, 0.13471670227703972, -0.03680377402026387, 0.04729229740423232, -0.059121697824629185, -0.1492861777959952, 0.06407863007478633, 0.3445066135394776, -0.23686740376525423, -0.2784740728895786, 0.09197255993121783, -0.2544563443951526, -0.16047095598029062, 0.17393457274477098, -0.06278709144539481, -0.03773485667180175, 0.009357032393222874, 0.06395067217606075, -0.039483576238232225, -0.28931021852219857, 0.3959430514030086, 0.01632341692784747, 0.2514948830171262, 0.046620238730593504, 0.06560608801811717, -0.015671240238165393, -0.024332323059602416, 0.030711566141107344, -0.17329584943048387, 0.07477303533543589, 0.1773759520201389, 0.11439958288451856, 0.2835552948843507, -0.4065985705124811, -0.23878455434183282, 0.17841666061612008, 0.10812584262395512, 0.08400054111764811, 0.002587130760041617, -0.22088139578338387, 0.09236785903283694, -0.15554310378699915, -0.09746344345034037, -0.026691827190660156, 0.032966813131335, 0.1375199072029062, -0.290773692387111, 0.06240143004841017, 0.10622618111863154, 0.0008602484210746959, -0.05947059913068214, -0.16960425927638284, -0.04833359406239272, 0.12048631305896758, 0.07710143434815109, -0.04350711709765482, 0.08663283793924792, -0.15240794630920135, -0.1556807219240706, 0.3438655415694546, -0.06344485343479127, -0.24136362056410646, 0.2474770551881961, -0.13968435002183452, -0.14834808185244502, 0.06242024400881808, 0.14990258135028112, 0.11206752083544592, -0.09907402980674818, 0.10252953024956317, -0.046115116487501315, 0.12824260080414054, 0.08868140709649736, 0.019512909107380412, 0.1638726192544603, 0.13471089673988088, 0.06577557082699377, 0.11468923206664892, -0.07656035307586843, -0.10677233694213922, -0.281372285637896, -0.09756852233854746, -0.14354082150836883, 0.05935460574093085, -0.12628145769065544, -0.16906254536029205, 0.4362991988224891, 0.1374160383785035, 0.22814843073053268, 0.046391396309719286, 0.2047350328524136, 0.12903391573469616, 0.05812887699135299, 0.024042770347910598, 0.22724462814122728, 0.046827694335590725, 0.01760740038821275, -0.16577457492375403, 0.16131364081271934, 0.042506470824184926]
|
1,803.08729
|
Normal and anomalous random walks of 2-d solitons
|
Solitons, which describe the propagation of concentrated beams of light
through nonlinear media, can exhibit a variety of behaviors as a result of the
intrinsic dissipation, diffraction, and the nonlinear effects. One of these
phenomena, modeled by the complex Ginzburg-Landau equation, are chaotic
explosions, transient enlargements of the soliton that may induce random
transversal displacements, which in the long run lead to a random walk of the
soliton center. As we show in this work, the transition from non-moving to
moving solitons is not a simple bifurcation but includes a sequence of normal
and anomalous random walks. We analyze their statistics with the distribution
of generalized diffusivities, a novel approach that has been used successfully
for characterizing anomalous diffusion.
|
nlin.PS
|
solitons which describe the propagation of concentrated beams of light through nonlinear media can exhibit a variety of behaviors as a result of the intrinsic dissipation diffraction and the nonlinear effects one of these phenomena modeled by the complex ginzburglandau equation are chaotic explosions transient enlargements of the soliton that may induce random transversal displacements which in the long run lead to a random walk of the soliton center as we show in this work the transition from nonmoving to moving solitons is not a simple bifurcation but includes a sequence of normal and anomalous random walks we analyze their statistics with the distribution of generalized diffusivities a novel approach that has been used successfully for characterizing anomalous diffusion
|
[['solitons', 'which', 'describe', 'the', 'propagation', 'of', 'concentrated', 'beams', 'of', 'light', 'through', 'nonlinear', 'media', 'can', 'exhibit', 'a', 'variety', 'of', 'behaviors', 'as', 'a', 'result', 'of', 'the', 'intrinsic', 'dissipation', 'diffraction', 'and', 'the', 'nonlinear', 'effects', 'one', 'of', 'these', 'phenomena', 'modeled', 'by', 'the', 'complex', 'ginzburglandau', 'equation', 'are', 'chaotic', 'explosions', 'transient', 'enlargements', 'of', 'the', 'soliton', 'that', 'may', 'induce', 'random', 'transversal', 'displacements', 'which', 'in', 'the', 'long', 'run', 'lead', 'to', 'a', 'random', 'walk', 'of', 'the', 'soliton', 'center', 'as', 'we', 'show', 'in', 'this', 'work', 'the', 'transition', 'from', 'nonmoving', 'to', 'moving', 'solitons', 'is', 'not', 'a', 'simple', 'bifurcation', 'but', 'includes', 'a', 'sequence', 'of', 'normal', 'and', 'anomalous', 'random', 'walks', 'we', 'analyze', 'their', 'statistics', 'with', 'the', 'distribution', 'of', 'generalized', 'diffusivities', 'a', 'novel', 'approach', 'that', 'has', 'been', 'used', 'successfully', 'for', 'characterizing', 'anomalous', 'diffusion']]
|
[-0.14083736908559477, 0.18750715482306957, -0.14216986063773893, 0.07476799491941616, -0.08279924946171897, -0.13771492508905275, 0.0023499148554939524, 0.37092783823296305, -0.28481173663627074, -0.238307892816423, 0.09298152453853052, -0.2605976850937019, -0.1998184008989483, 0.20459423011888853, -0.016569113750167255, 0.05374460432291062, 0.016449659327123344, 0.020844111485140666, -0.013133250683655633, -0.1876406717591551, 0.3078879205150013, -0.022574354842610406, 0.28459141273521077, 0.009817011826554266, 0.12037092570739821, -0.014673697061742805, 0.007081232061061789, 0.04322543468799818, -0.12097177831047633, 0.06944824910933982, 0.18455829035428142, 0.02845284830047084, 0.2372857570929938, -0.42776351548856545, -0.3013325912815307, 0.11974436176369484, 0.18563952417105062, 0.16742544793993422, -0.06237003205641478, -0.3003018176214409, 0.0555595577217075, -0.12998629452468938, -0.18425191190297238, -0.06467272160465226, 0.02493353931335028, 0.12509604833801002, -0.22900204186351233, 0.09653949245571808, 0.10926185441086021, 0.02841713435227881, -0.014983564182849867, -0.026048899377782306, -0.03272077638045454, 0.10877661998266307, 0.04070568455582751, -0.020876181628868107, 0.11670966533735637, -0.12397825132327608, -0.14006952428798966, 0.4201039285125101, -0.09810174756268618, -0.1887798303436926, 0.18389321464121716, -0.15709711659475653, -0.07972691728569128, 0.1781778956622574, 0.23266680447087318, 0.12159271931526165, -0.1511496891142378, 0.014756875894298511, -0.03511681284915906, 0.09570353836439424, 0.07054897405778472, 0.03349106747093571, 0.19865974607415685, 0.17798413105794236, 0.04156728143688338, 0.14343718182639914, -0.09852175872397273, -0.10834652433140564, -0.28220778790756496, -0.11469335161431246, -0.17897910762288677, 0.09068866096781332, -0.09067794667657644, -0.22862767379637025, 0.4126289569373642, 0.12359810410118309, 0.21764942323554212, 0.004849206047727405, 0.22531551395801186, 0.13776826707278417, 0.03938620520497383, 0.057315071199496255, 0.22319746321896797, 0.15585251971335784, 0.13132673757495122, -0.21744724724465245, 0.057119619089546575, 0.04194196935414391]
|
1,803.0873
|
Particle accretion onto planets in discs with hydrodynamic turbulence
|
The growth process of proto-planets can be sped-up by accreting a large
number of solid, pebble-sized objects that are still present in the
protoplanetary disc. It is still an open question on how efficient this process
works in realistic turbulent discs. Here, we investigate the accretion of
pebbles in turbulent discs that are driven by the purely hydrodynamical
vertical shear instability (VSI). For this purpose, we perform global
three-dimensional simulations of locally isothermal, VSI turbulent discs with
embedded protoplanetary cores from 5 to 100 $M_\oplus$ that are placed at 5.2
au distance from the star. In addition, we follow the evolution of a swarm of
embedded pebbles of different size under the action of drag forces between gas
and particles in this turbulent flow. Simultaneously, we perform a set of
comparison simulations for laminar viscous discs where the particles experience
stochastic kicks. For both cases, we measure the accretion rate onto the cores
as a function of core mass and Stokes number ($\tau_s$) of the particles and
compare it to recent MRI turbulence simulations. Overall the dynamic is very
similar for the particles in the VSI turbulent disc and the laminar case with
stochastic kicks. For the small mass planets (i.e. 5 and 10 $M_\oplus$),
well-coupled particles with $\tau_s = 1$, which have a size of about one meter
at this location, we find an accretion efficiency (rate of particles accreted
over drifting inward) of about 1.6-3%. For smaller and larger particles this
efficiency is higher. However, the fast inward drift for $\tau_s = 1$ particles
makes them the most effective for rapid growth, leading to mass doubling times
of about 20,000 yr. For masses between 10 and 30 $M_\oplus$ the core reaches
the pebble isolation mass and the particles are trapped at the pressure maximum
just outside of the planet, shutting off further particle accretion.
|
astro-ph.EP astro-ph.IM
|
the growth process of protoplanets can be spedup by accreting a large number of solid pebblesized objects that are still present in the protoplanetary disc it is still an open question on how efficient this process works in realistic turbulent discs here we investigate the accretion of pebbles in turbulent discs that are driven by the purely hydrodynamical vertical shear instability vsi for this purpose we perform global threedimensional simulations of locally isothermal vsi turbulent discs with embedded protoplanetary cores from 5 to 100 m_oplus that are placed at 52 au distance from the star in addition we follow the evolution of a swarm of embedded pebbles of different size under the action of drag forces between gas and particles in this turbulent flow simultaneously we perform a set of comparison simulations for laminar viscous discs where the particles experience stochastic kicks for both cases we measure the accretion rate onto the cores as a function of core mass and stokes number tau_s of the particles and compare it to recent mri turbulence simulations overall the dynamic is very similar for the particles in the vsi turbulent disc and the laminar case with stochastic kicks for the small mass planets ie 5 and 10 m_oplus wellcoupled particles with tau_s 1 which have a size of about one meter at this location we find an accretion efficiency rate of particles accreted over drifting inward of about 163 for smaller and larger particles this efficiency is higher however the fast inward drift for tau_s 1 particles makes them the most effective for rapid growth leading to mass doubling times of about 20000 yr for masses between 10 and 30 m_oplus the core reaches the pebble isolation mass and the particles are trapped at the pressure maximum just outside of the planet shutting off further particle accretion
|
[['the', 'growth', 'process', 'of', 'protoplanets', 'can', 'be', 'spedup', 'by', 'accreting', 'a', 'large', 'number', 'of', 'solid', 'pebblesized', 'objects', 'that', 'are', 'still', 'present', 'in', 'the', 'protoplanetary', 'disc', 'it', 'is', 'still', 'an', 'open', 'question', 'on', 'how', 'efficient', 'this', 'process', 'works', 'in', 'realistic', 'turbulent', 'discs', 'here', 'we', 'investigate', 'the', 'accretion', 'of', 'pebbles', 'in', 'turbulent', 'discs', 'that', 'are', 'driven', 'by', 'the', 'purely', 'hydrodynamical', 'vertical', 'shear', 'instability', 'vsi', 'for', 'this', 'purpose', 'we', 'perform', 'global', 'threedimensional', 'simulations', 'of', 'locally', 'isothermal', 'vsi', 'turbulent', 'discs', 'with', 'embedded', 'protoplanetary', 'cores', 'from', '5', 'to', '100', 'm_oplus', 'that', 'are', 'placed', 'at', '52', 'au', 'distance', 'from', 'the', 'star', 'in', 'addition', 'we', 'follow', 'the', 'evolution', 'of', 'a', 'swarm', 'of', 'embedded', 'pebbles', 'of', 'different', 'size', 'under', 'the', 'action', 'of', 'drag', 'forces', 'between', 'gas', 'and', 'particles', 'in', 'this', 'turbulent', 'flow', 'simultaneously', 'we', 'perform', 'a', 'set', 'of', 'comparison', 'simulations', 'for', 'laminar', 'viscous', 'discs', 'where', 'the', 'particles', 'experience', 'stochastic', 'kicks', 'for', 'both', 'cases', 'we', 'measure', 'the', 'accretion', 'rate', 'onto', 'the', 'cores', 'as', 'a', 'function', 'of', 'core', 'mass', 'and', 'stokes', 'number', 'tau_s', 'of', 'the', 'particles', 'and', 'compare', 'it', 'to', 'recent', 'mri', 'turbulence', 'simulations', 'overall', 'the', 'dynamic', 'is', 'very', 'similar', 'for', 'the', 'particles', 'in', 'the', 'vsi', 'turbulent', 'disc', 'and', 'the', 'laminar', 'case', 'with', 'stochastic', 'kicks', 'for', 'the', 'small', 'mass', 'planets', 'ie', '5', 'and', '10', 'm_oplus', 'wellcoupled', 'particles', 'with', 'tau_s', '1', 'which', 'have', 'a', 'size', 'of', 'about', 'one', 'meter', 'at', 'this', 'location', 'we', 'find', 'an', 'accretion', 'efficiency', 'rate', 'of', 'particles', 'accreted', 'over', 'drifting', 'inward', 'of', 'about', '163', 'for', 'smaller', 'and', 'larger', 'particles', 'this', 'efficiency', 'is', 'higher', 'however', 'the', 'fast', 'inward', 'drift', 'for', 'tau_s', '1', 'particles', 'makes', 'them', 'the', 'most', 'effective', 'for', 'rapid', 'growth', 'leading', 'to', 'mass', 'doubling', 'times', 'of', 'about', '20000', 'yr', 'for', 'masses', 'between', '10', 'and', '30', 'm_oplus', 'the', 'core', 'reaches', 'the', 'pebble', 'isolation', 'mass', 'and', 'the', 'particles', 'are', 'trapped', 'at', 'the', 'pressure', 'maximum', 'just', 'outside', 'of', 'the', 'planet', 'shutting', 'off', 'further', 'particle', 'accretion']]
|
[-0.11225143151224122, 0.22313705040228102, -0.02585136575630474, 0.046595663129102446, -0.02616594323511603, -0.05082079233436257, 0.00837493450518722, 0.3382245173802642, -0.23559197817667155, -0.3459577283356339, 0.09506689030738351, -0.2518322385577975, -0.009029622254035386, 0.1898750335833603, -0.034724944658304786, 0.04224339539934207, 0.08817693091029803, -0.05522542598344827, -0.02002849867322335, -0.22954755051729367, 0.30476447879980123, 0.08604782058070046, 0.1267372254101486, 0.00612812746208204, 0.06870233912961435, -0.09985470058803146, -0.005834938818895209, -0.0124307833481345, -0.22705152495202702, 0.021842376068985016, 0.16214618357097557, 0.07324330555581439, 0.2574405609430917, -0.47171250837977585, -0.20304353345502596, 0.06012923959918369, 0.19022454997531513, 0.07595125619761682, -0.07030025305185088, -0.18440294505853672, 0.11786203859350951, -0.2029287938203197, -0.15024521636721483, 0.037915460279021464, 0.112823672019754, 0.00483142040167494, -0.2716775532830262, 0.14422565007991675, 0.09863626473969289, 0.060946215903018845, -0.09890094279437203, -0.07108499032543286, -0.06652681433862247, 0.0770920731948105, 0.06404196942055837, 0.037751241804615254, 0.2630526745357967, -0.14482410021867653, -0.017806894593951784, 0.3984042748864005, -0.06372534507720143, -0.15374224614214127, 0.279488242701566, -0.2241629435532224, -0.07370818852551135, 0.20183674881302163, 0.22769995660239242, 0.15029193373457497, -0.11481980688021347, -0.01427135522642761, -0.05098236810590606, 0.17378447418186146, 0.10008911341624059, -0.029586125326061034, 0.32188839857362356, 0.2013218955728103, 0.0687412906405179, 0.09855212866846398, -0.16570595692643875, -0.10528194665522805, -0.2182742791578915, -0.17023535857228317, -0.15369858476103554, 0.0816759932173514, -0.1435355071210468, -0.11111239974056125, 0.3038350290199129, 0.1380460050055071, 0.2102603497957094, 0.06892190743995966, 0.3072059841100494, 0.07441579499884124, 0.09867716711175346, 0.1725850183781739, 0.2915383411546875, 0.14698358988588503, 0.1292218165303654, -0.24164132068108302, 0.041628483814221046, 0.007536406284902784]
|
1,803.08731
|
Topology of photonic time-crystals
|
We introduce topological phases in Photonic Time-Crystals. Photonic
Time-Crystals are materials in which the refractive index varies periodically
and abruptly in time. When the refractive index changes abruptly, the light
propagating in the material experiences time-refraction and time-reflection,
analogous to refraction and reflection in photonic crystals. Interference
between time-refracted and time-reflected waves gives rise to Floquet-Bloch
states and dispersion bands, which are gapped in the momentum. We show that
photonic time-crystals can be in a topologically non-trivial phase, and
calculate the topological invariant associated with the momentum bands of the
Photonic Time-Crystal. The topological invariants are related to the phase
between the forward and backward-propagating waves of the time-crystal, and to
localized edge states in time.
|
physics.optics
|
we introduce topological phases in photonic timecrystals photonic timecrystals are materials in which the refractive index varies periodically and abruptly in time when the refractive index changes abruptly the light propagating in the material experiences timerefraction and timereflection analogous to refraction and reflection in photonic crystals interference between timerefracted and timereflected waves gives rise to floquetbloch states and dispersion bands which are gapped in the momentum we show that photonic timecrystals can be in a topologically nontrivial phase and calculate the topological invariant associated with the momentum bands of the photonic timecrystal the topological invariants are related to the phase between the forward and backwardpropagating waves of the timecrystal and to localized edge states in time
|
[['we', 'introduce', 'topological', 'phases', 'in', 'photonic', 'timecrystals', 'photonic', 'timecrystals', 'are', 'materials', 'in', 'which', 'the', 'refractive', 'index', 'varies', 'periodically', 'and', 'abruptly', 'in', 'time', 'when', 'the', 'refractive', 'index', 'changes', 'abruptly', 'the', 'light', 'propagating', 'in', 'the', 'material', 'experiences', 'timerefraction', 'and', 'timereflection', 'analogous', 'to', 'refraction', 'and', 'reflection', 'in', 'photonic', 'crystals', 'interference', 'between', 'timerefracted', 'and', 'timereflected', 'waves', 'gives', 'rise', 'to', 'floquetbloch', 'states', 'and', 'dispersion', 'bands', 'which', 'are', 'gapped', 'in', 'the', 'momentum', 'we', 'show', 'that', 'photonic', 'timecrystals', 'can', 'be', 'in', 'a', 'topologically', 'nontrivial', 'phase', 'and', 'calculate', 'the', 'topological', 'invariant', 'associated', 'with', 'the', 'momentum', 'bands', 'of', 'the', 'photonic', 'timecrystal', 'the', 'topological', 'invariants', 'are', 'related', 'to', 'the', 'phase', 'between', 'the', 'forward', 'and', 'backwardpropagating', 'waves', 'of', 'the', 'timecrystal', 'and', 'to', 'localized', 'edge', 'states', 'in', 'time']]
|
[-0.2230209665397693, 0.31991166415607836, -0.09906736749793048, -0.008069814817435973, -0.060570411515974365, -0.16226791601578613, 0.046464703270374275, 0.43576877794962016, -0.29030105728754957, -0.2762136184404382, 0.039573142247323966, -0.32292908232296463, -0.19031780886884153, 0.1535563215580398, -0.0213165253306022, 0.06873927528318842, -0.06680351691897464, -0.0642647766549371, -0.09229642937198874, -0.09210308659533285, 0.3075284155835686, -0.03778268397472535, 0.30884950637685515, 0.07501328101925618, 0.009121961405385385, -0.0028848983841923484, 0.024405506713546615, -0.016921135885393724, -0.11799741229198232, 0.05562448849860606, 0.28119487824759126, -0.08717612496090937, 0.13653759514929448, -0.4514882906084567, -0.19991894999304705, 0.05526840886249479, 0.11776605206778669, 0.12317064602702724, -0.05946335976168645, -0.3308299628078146, 0.017202667677692608, -0.11414182416484815, -0.14644857637988057, -0.05197449400402869, 0.018068930385551886, -0.03616092352410861, -0.15454791979946658, 0.07911096555317353, 0.011687837079562972, -0.011399771743124367, -0.07969659070723352, 0.004073719077834249, -0.15459311568277137, 0.06306465158771633, 0.025905560800987007, -0.012108001231619743, 0.06466182591228754, -0.12317674402848083, -0.14628821515799623, 0.41712440582470295, -0.04540491927590528, -0.16924858851094557, 0.15770585807408638, -0.17970663362475775, -0.03184532973734019, 0.17992470609601094, 0.20599703437162448, 0.025986418733785373, 0.001046641008486452, 0.04882543067142895, 0.011601329995401664, 0.18120403373531535, 0.10095797651818236, 0.1550294792123007, 0.2535380706421833, 0.07511244840977664, 0.05608572652233781, 0.18350164171419545, -0.07932374684142146, -0.04063810379269112, -0.2575718705847332, -0.24676714233633756, -0.20132170945191674, 0.010545878778252981, -0.08035867379883518, -0.21102628125026163, 0.5030649064718622, 0.09518670386210315, 0.16357382329230288, -0.03545209804170691, 0.22869773426678328, 0.17331771078054378, 0.057551232273731615, 0.09275298196393832, 0.2872466278752823, 0.16140005020095052, 0.10757572366649994, -0.21296617246142266, -0.016275983938403363, 0.017549095609414894]
|
1,803.08732
|
New physics searches in nuclear and neutron $\beta$ decay
|
The status of tests of the standard electroweak model and of searches for new
physics in allowed nuclear $\beta$ decay and neutron decay is reviewed
including both theoretical and experimental developments. The sensitivity and
complementarity of recent and ongoing experiments are discussed with emphasis
on their potential to look for new physics. Measurements are interpreted using
a model-independent effective field theory approach enabling to recast the
outcome of the analysis in many specific new physics models. Special attention
is given to the connection that this approach establishes with high-energy
physics. A new global fit of available $\beta$-decay data is performed
incorporating, for the first time in a consistent way, superallowed $0^+\to
0^+$ transitions, neutron decay and nuclear decays. The constraints on exotic
scalar and tensor couplings involving left- or right-handed neutrinos are
determined while a constraint on the pseudoscalar coupling from neutron decay
data is obtained for the first time as well. The values of the vector and
axial-vector couplings, which are associated within the standard model to
$V_{ud}$ and $g_A$ respectively, are also updated. The ratio between the axial
and vector couplings obtained from the fit under standard model assumptions is
$C_A/C_V = -1.27510(66)$. The relevance of the various experimental inputs and
error sources is critically discussed and the impact of ongoing measurements is
studied. The complementarity of the obtained bounds with other low- and
high-energy probes is presented including ongoing searches at the Large Hadron
Collider.
|
hep-ph nucl-ex nucl-th
|
the status of tests of the standard electroweak model and of searches for new physics in allowed nuclear beta decay and neutron decay is reviewed including both theoretical and experimental developments the sensitivity and complementarity of recent and ongoing experiments are discussed with emphasis on their potential to look for new physics measurements are interpreted using a modelindependent effective field theory approach enabling to recast the outcome of the analysis in many specific new physics models special attention is given to the connection that this approach establishes with highenergy physics a new global fit of available betadecay data is performed incorporating for the first time in a consistent way superallowed 0to 0 transitions neutron decay and nuclear decays the constraints on exotic scalar and tensor couplings involving left or righthanded neutrinos are determined while a constraint on the pseudoscalar coupling from neutron decay data is obtained for the first time as well the values of the vector and axialvector couplings which are associated within the standard model to v_ud and g_a respectively are also updated the ratio between the axial and vector couplings obtained from the fit under standard model assumptions is c_ac_v 12751066 the relevance of the various experimental inputs and error sources is critically discussed and the impact of ongoing measurements is studied the complementarity of the obtained bounds with other low and highenergy probes is presented including ongoing searches at the large hadron collider
|
[['the', 'status', 'of', 'tests', 'of', 'the', 'standard', 'electroweak', 'model', 'and', 'of', 'searches', 'for', 'new', 'physics', 'in', 'allowed', 'nuclear', 'beta', 'decay', 'and', 'neutron', 'decay', 'is', 'reviewed', 'including', 'both', 'theoretical', 'and', 'experimental', 'developments', 'the', 'sensitivity', 'and', 'complementarity', 'of', 'recent', 'and', 'ongoing', 'experiments', 'are', 'discussed', 'with', 'emphasis', 'on', 'their', 'potential', 'to', 'look', 'for', 'new', 'physics', 'measurements', 'are', 'interpreted', 'using', 'a', 'modelindependent', 'effective', 'field', 'theory', 'approach', 'enabling', 'to', 'recast', 'the', 'outcome', 'of', 'the', 'analysis', 'in', 'many', 'specific', 'new', 'physics', 'models', 'special', 'attention', 'is', 'given', 'to', 'the', 'connection', 'that', 'this', 'approach', 'establishes', 'with', 'highenergy', 'physics', 'a', 'new', 'global', 'fit', 'of', 'available', 'betadecay', 'data', 'is', 'performed', 'incorporating', 'for', 'the', 'first', 'time', 'in', 'a', 'consistent', 'way', 'superallowed', '0to', '0', 'transitions', 'neutron', 'decay', 'and', 'nuclear', 'decays', 'the', 'constraints', 'on', 'exotic', 'scalar', 'and', 'tensor', 'couplings', 'involving', 'left', 'or', 'righthanded', 'neutrinos', 'are', 'determined', 'while', 'a', 'constraint', 'on', 'the', 'pseudoscalar', 'coupling', 'from', 'neutron', 'decay', 'data', 'is', 'obtained', 'for', 'the', 'first', 'time', 'as', 'well', 'the', 'values', 'of', 'the', 'vector', 'and', 'axialvector', 'couplings', 'which', 'are', 'associated', 'within', 'the', 'standard', 'model', 'to', 'v_ud', 'and', 'g_a', 'respectively', 'are', 'also', 'updated', 'the', 'ratio', 'between', 'the', 'axial', 'and', 'vector', 'couplings', 'obtained', 'from', 'the', 'fit', 'under', 'standard', 'model', 'assumptions', 'is', 'c_ac_v', '12751066', 'the', 'relevance', 'of', 'the', 'various', 'experimental', 'inputs', 'and', 'error', 'sources', 'is', 'critically', 'discussed', 'and', 'the', 'impact', 'of', 'ongoing', 'measurements', 'is', 'studied', 'the', 'complementarity', 'of', 'the', 'obtained', 'bounds', 'with', 'other', 'low', 'and', 'highenergy', 'probes', 'is', 'presented', 'including', 'ongoing', 'searches', 'at', 'the', 'large', 'hadron', 'collider']]
|
[-0.06638391864030285, 0.17809114204917817, -0.04639751183344646, 0.11651372506649808, -0.08810740245525983, -0.1569984077892088, 0.04568472493519174, 0.3142310206956686, -0.2307644695162456, -0.30378191026641016, 0.10220335283901226, -0.308712381323641, -0.04360920427307645, 0.21424708170618148, 0.07939358936484031, 0.09552191895131824, 0.06540592667854768, 0.052291948100591595, -0.0931280784160295, -0.1919665103050028, 0.29245619606127604, 0.09089709209238594, 0.23328319712272014, 0.10226370261144883, 0.0494070271961391, -0.0003801979632315008, -0.09667481870013983, -0.03359306615163037, -0.1393920591647521, 0.10565005943892485, 0.19672581659442004, 0.13675514940925418, 0.1578151071880092, -0.41072138300205163, -0.16110487536804632, 0.10542670362628996, 0.09579674579956113, 0.08373535062889866, -0.11022595542809985, -0.3344809696514239, 0.05279379210811346, -0.16318291567781187, -0.09174712375400865, -0.10364177245052254, -0.007258326680637262, 0.01429350590853496, -0.3217846035778998, 0.09037298945477232, -0.025633300366771822, 0.02302471753606137, -0.07493844188829052, -0.21097077936766312, 0.026205508655155117, 0.08789525028575766, 0.13657534171126168, 0.047354967159001116, 0.12786903169917616, -0.1745787247212881, -0.14359978286480096, 0.4021604390458224, -0.0756056856643904, -0.15686630210579136, 0.16884678226519137, -0.16639750127858938, -0.16551909127490635, 0.07183041823482973, 0.18768904064354694, 0.08785192857080318, -0.1579926057099464, 0.13450853509340494, -0.006446856341542716, 0.13146321838325326, -0.004251569059449545, 0.06518824970191146, 0.2295613494404453, 0.2211096623516146, -0.015283617121910557, 0.06095542160303708, -0.10136724181542608, -0.09630612335068749, -0.3915196842870655, -0.0837523405142921, -0.11645910231981109, 0.020965379564725654, -0.04914095262777645, -0.07609326925371436, 0.39358850352941677, 0.11240267387518234, 0.21045945377133668, 0.017630955976424143, 0.29772644320383984, 0.07694733124077717, 0.06274781334473989, -0.002186171488373223, 0.3385595738749079, 0.1900691891049451, 0.08479513218329149, -0.22455810013603658, 0.05338162258316941, 0.022767036265515267]
|
1,803.08733
|
Dimension groups for self-similar maps and matrix representations of the
core of the associated C*-algebras
|
We introduce a dimension group for a self-similar map as the ${\rm
K}_0$-group of the core of the $C^*$-algebra associated with the self-similar
map together with the canonical endomorphism. The key step for the computation
is an explicit description of the core as the inductive limit using their
matrix representations over the coefficient algebra, which can be described
explicitly by the singularity structure of branched points. We compute that the
dimension group for the tent map is isomorphic to the countably generated free
abelian group ${\mathbb Z}^{\infty}\cong {\mathbb Z}[t]$ together with the
unilatral shift, i.e. the multiplication map by $t$ as an abstract group. Thus
the canonical endomorphisms on the ${\rm K}_0$-groups are not automorphisms in
geneal. This is a different point compared with dimension groups for
topological Markov shifts. We can count the singularity structure in the
dimension groups.
|
math.OA
|
we introduce a dimension group for a selfsimilar map as the rm k_0group of the core of the calgebra associated with the selfsimilar map together with the canonical endomorphism the key step for the computation is an explicit description of the core as the inductive limit using their matrix representations over the coefficient algebra which can be described explicitly by the singularity structure of branched points we compute that the dimension group for the tent map is isomorphic to the countably generated free abelian group mathbb zinftycong mathbb zt together with the unilatral shift ie the multiplication map by t as an abstract group thus the canonical endomorphisms on the rm k_0groups are not automorphisms in geneal this is a different point compared with dimension groups for topological markov shifts we can count the singularity structure in the dimension groups
|
[['we', 'introduce', 'a', 'dimension', 'group', 'for', 'a', 'selfsimilar', 'map', 'as', 'the', 'rm', 'k_0group', 'of', 'the', 'core', 'of', 'the', 'calgebra', 'associated', 'with', 'the', 'selfsimilar', 'map', 'together', 'with', 'the', 'canonical', 'endomorphism', 'the', 'key', 'step', 'for', 'the', 'computation', 'is', 'an', 'explicit', 'description', 'of', 'the', 'core', 'as', 'the', 'inductive', 'limit', 'using', 'their', 'matrix', 'representations', 'over', 'the', 'coefficient', 'algebra', 'which', 'can', 'be', 'described', 'explicitly', 'by', 'the', 'singularity', 'structure', 'of', 'branched', 'points', 'we', 'compute', 'that', 'the', 'dimension', 'group', 'for', 'the', 'tent', 'map', 'is', 'isomorphic', 'to', 'the', 'countably', 'generated', 'free', 'abelian', 'group', 'mathbb', 'zinftycong', 'mathbb', 'zt', 'together', 'with', 'the', 'unilatral', 'shift', 'ie', 'the', 'multiplication', 'map', 'by', 't', 'as', 'an', 'abstract', 'group', 'thus', 'the', 'canonical', 'endomorphisms', 'on', 'the', 'rm', 'k_0groups', 'are', 'not', 'automorphisms', 'in', 'geneal', 'this', 'is', 'a', 'different', 'point', 'compared', 'with', 'dimension', 'groups', 'for', 'topological', 'markov', 'shifts', 'we', 'can', 'count', 'the', 'singularity', 'structure', 'in', 'the', 'dimension', 'groups']]
|
[-0.13239514805294955, 0.10758891457162396, -0.08359187636796357, 0.029998059581241222, -0.06795012142490528, -0.08580986921927028, -0.0141196156117766, 0.3673384274172522, -0.3755037274218443, -0.18053857242538981, 0.1287922442764941, -0.2800984758301426, -0.11013008493260501, 0.18699786003787805, -0.07942496816501068, -0.009005159329976479, 0.00426803518045884, 0.1366809155778402, -0.12175676747000892, -0.2232022599952744, 0.41638995867467277, 0.028138048878877702, 0.2343595931102542, -0.0013893000130629997, 0.12141544898006602, -0.01027821275884843, -0.007814755860416994, 0.004512705728003796, -0.12935204728342717, 0.11352067269694169, 0.27454100155448335, 0.049639568630143675, 0.17602075438140927, -0.3450615291286559, -0.19128600100096124, 0.1860859710587202, 0.15635281354936698, 0.014418737270298285, -0.024593220038822153, -0.2902337080207619, 0.11111439163197533, -0.19242068964573317, -0.12471751066053925, -0.09060837998119503, 0.05406179150267348, -0.00995504283040327, -0.22685271568586166, 0.013553550235763953, 0.08524515592989369, 0.11176191946070124, -0.04169591863292956, -0.064997420438912, -0.08014249991979042, 0.13255700765748638, -0.04198068359452062, 0.05721472857866681, 0.14278136957844678, -0.08879222411383624, -0.12287648674143124, 0.39459306458487126, -0.07763803302290014, -0.22269609464454826, 0.13475617052592936, -0.15524035980449105, -0.15911275881553327, 0.1449073542004628, 0.07578152527923893, 0.1066576771669253, -0.027421316880576422, 0.20104673826378935, -0.11415297083937338, 0.1201226313967669, 0.04770987235811831, -0.033425702907172214, 0.13280606862619845, 0.0951684705613956, 0.10840998565859712, 0.14394850800762185, 0.005419584131803037, -0.04047012869710524, -0.3540678041694808, -0.19535628630079493, -0.12840012901965664, 0.12543179877079008, -0.14408676085626557, -0.16808518089853688, 0.3987715306902563, 0.08078629229163384, 0.24116219372155456, 0.1054510158141667, 0.2215331785489608, 0.12772699907493446, 0.11292016886711718, 0.06847433784747595, 0.08251579862468651, 0.1967657965057305, -0.04592314564170873, -0.18268378735961813, 0.006247187719891106, 0.2158247776139174]
|
1,803.08734
|
Spinorial classification of Spin(7) structures
|
We describe the different classes of $\mathrm{Spin(7)}$ structures in terms
of spinorial equations. We relate them to the spinorial description of
$\mathrm{G}_2$ structures in some geometrical situations. Our approach enables
us to analyze invariant $\mathrm{Spin(7)}$ structures on quasi abelian Lie
algebras.
|
math.DG
|
we describe the different classes of mathrmspin7 structures in terms of spinorial equations we relate them to the spinorial description of mathrmg_2 structures in some geometrical situations our approach enables us to analyze invariant mathrmspin7 structures on quasi abelian lie algebras
|
[['we', 'describe', 'the', 'different', 'classes', 'of', 'mathrmspin7', 'structures', 'in', 'terms', 'of', 'spinorial', 'equations', 'we', 'relate', 'them', 'to', 'the', 'spinorial', 'description', 'of', 'mathrmg_2', 'structures', 'in', 'some', 'geometrical', 'situations', 'our', 'approach', 'enables', 'us', 'to', 'analyze', 'invariant', 'mathrmspin7', 'structures', 'on', 'quasi', 'abelian', 'lie', 'algebras']]
|
[-0.16303395838817444, 0.058393642715201144, -0.1270781169622773, 0.1498434073518871, -0.17251597671973995, -0.08251769577221173, -0.06383423275518708, 0.39184392975052684, -0.2747520152138682, -0.24316986627513315, 0.01592629504526352, -0.21137275810285314, -0.1972566710489734, 0.1895087332033166, -0.12780561339019275, -0.018464946165317443, 0.0038429349092993794, 0.06660184236924822, -0.17859313578668573, -0.23712848953721, 0.40457562339015124, -0.04989745593402625, 0.2944992158289363, -0.007002038903897855, 0.13245127468210896, -0.012847943617621572, -0.046838861890137196, 0.00048045073522300254, -0.2179196029220049, 0.16921572445142197, 0.2852490262650862, 0.03442210403112013, 0.10936166564138924, -0.43039404982473795, -0.15973893752912197, 0.09306352806459295, 0.1212884220862534, 0.10365765959751315, 0.07446975445817793, -0.3024291002486901, 0.07988250287385976, -0.16824994018165076, -0.18539676919761228, -0.19912897722750175, -0.010993081940020003, -0.023929433033960622, -0.14984884979657648, 0.011938681053679163, 0.06466039563188465, 0.06762830520094168, -0.14923297676893815, -0.04545255899202169, 0.0024030616154848802, 0.08237239896751396, -0.030131530431212812, -0.10612087582079012, 0.10339730539892959, -0.08527933074752005, -0.1650774216324818, 0.3933355901844618, -0.003232083010782556, -0.27812450395033855, 0.21891738422124124, -0.15876417025560285, -0.21215819215356577, 0.10847632627843357, 0.17091747106439092, 0.14014829435135898, -0.08789643009261387, 0.16621102138263424, -0.09879839065961721, 0.007809133200747211, 0.11398247051870496, 0.05269932069974702, 0.13225770148834803, 0.08283994255996333, 0.018429004973391207, 0.1625849383587881, 0.037698126113377285, -0.11056898875025714, -0.34756994874375624, -0.18086213255073966, -0.002702313799002185, 0.11134821721693365, -0.10706711133442275, -0.20019090359621658, 0.4897879603795889, 0.1552917105713632, 0.190823292882159, 0.01765021000330041, 0.17861170373947882, 0.028834476186780304, 0.09297614894443895, 0.014594051509913875, 0.12503914318470535, 0.2735763280766039, -0.00745583943477491, -0.16180992537041808, -0.08564012244389188, 0.17112858831973338]
|
1,803.08735
|
Robust index bounds for minimal hypersurfaces of isoparametric
submanifolds and symmetric spaces
|
We find many examples of compact Riemannian manifolds $(M,g)$ whose closed
minimal hypersurfaces satisfy a lower bound on their index that is linear in
their first Betti number. Moreover, we show that these bounds remain valid when
the metric $g$ is replaced with $g'$ in a neighbourhood of $g$. Our examples
$(M,g)$ consist of certain minimal isoparametric hypersurfaces of spheres;
their focal manifolds; the Lie groups $SU(n)$ for $n\leq 17$, and $Sp(n)$ for
all $n$; and all quaternionic Grassmannians.
|
math.DG
|
we find many examples of compact riemannian manifolds mg whose closed minimal hypersurfaces satisfy a lower bound on their index that is linear in their first betti number moreover we show that these bounds remain valid when the metric g is replaced with g in a neighbourhood of g our examples mg consist of certain minimal isoparametric hypersurfaces of spheres their focal manifolds the lie groups sun for nleq 17 and spn for all n and all quaternionic grassmannians
|
[['we', 'find', 'many', 'examples', 'of', 'compact', 'riemannian', 'manifolds', 'mg', 'whose', 'closed', 'minimal', 'hypersurfaces', 'satisfy', 'a', 'lower', 'bound', 'on', 'their', 'index', 'that', 'is', 'linear', 'in', 'their', 'first', 'betti', 'number', 'moreover', 'we', 'show', 'that', 'these', 'bounds', 'remain', 'valid', 'when', 'the', 'metric', 'g', 'is', 'replaced', 'with', 'g', 'in', 'a', 'neighbourhood', 'of', 'g', 'our', 'examples', 'mg', 'consist', 'of', 'certain', 'minimal', 'isoparametric', 'hypersurfaces', 'of', 'spheres', 'their', 'focal', 'manifolds', 'the', 'lie', 'groups', 'sun', 'for', 'nleq', '17', 'and', 'spn', 'for', 'all', 'n', 'and', 'all', 'quaternionic', 'grassmannians']]
|
[-0.217292047612652, 0.1309873471478637, 0.006300296033754697, 0.08715536257641131, -0.07875563849140949, -0.16419255500069901, -0.03287430003409191, 0.4017904299087351, -0.17121792309976455, -0.3001275050300586, 0.10633967820661072, -0.29485656266819826, -0.16897608321808466, 0.22229804964500327, -0.13720885296411153, -0.010404787839779371, 0.0613131551779335, 0.14346643145891685, -0.08564388133066742, -0.3662028169330162, 0.4291895918925352, -0.08226533706854039, 0.16878332681010796, 0.05198815993115872, 0.09474256991326244, -0.0529592743178806, 0.027286605449699904, 0.05648857801769495, -0.15130721946940257, 0.16411345437923563, 0.28001983053510704, 0.09328417989272106, 0.16539364674753404, -0.39611412551772746, -0.1804200303446077, 0.22818421873063605, 0.11682410184529764, -0.02748824975488684, -0.024773331272085728, -0.24820913682114096, 0.1260838799320067, -0.06411338239411611, -0.18545841511716193, -0.055618781879355636, 0.04476035294370561, 0.0065905211428534, -0.18756919064193586, -0.003890952897034114, 0.133277150059614, 0.11502870040226586, -0.07228724747495371, -0.15757052332186436, -0.09418045166184348, 0.10367868347808165, -0.03728928052101143, -0.0054318994236520575, 0.09101650611014117, -0.02730867603817318, -0.07373500249902659, 0.3673608009055068, -0.07113391330135585, -0.2655064507705879, 0.11150622953766887, -0.1802617081358463, -0.1873915618421109, 0.13243274823349865, 0.13982776755207701, 0.23513862260181126, -0.032388414484131905, 0.19756722142713593, -0.10404418707129699, 0.04512775177725508, 0.12304934954765855, 0.018733715915557326, 0.12192306269691149, 0.07348451344885781, 0.1636686849259017, 0.06326041727244289, 0.0018478157853448315, 0.006748300750115061, -0.38716807881299453, -0.2220911785468011, -0.15666049751276268, 0.13621049554712034, -0.22300517712270287, -0.1957639043080868, 0.33297020126181315, -0.004237739286750932, 0.19924031806331646, 0.1862281899710622, 0.18643975388011866, -0.024474628819329547, 0.019132190345656833, 0.176488947135078, 0.1781228198198295, 0.2451539781368986, -0.04981335750898889, -0.10316956798322027, -0.0948317140470483, 0.14975882924008596]
|
1,803.08736
|
Characteristic-free bases and BGG resolutions of unitary simple modules
for quiver Hecke and Cherednik algebras
|
We construct characteristic-free bases and BGG resolutions of unitary simple
modules of quiver Hecke algebras and Cherednik algebras. We hence solve and
vastly generalise Berkesch-Griffeth-Sam's conjecture, calculate the
Castelnuovo-Mumford regularity of ideals of of certain highly symmetric linear
subspace arrangements, and compute Dirac homology of Cherednik algebras.
|
math.RT
|
we construct characteristicfree bases and bgg resolutions of unitary simple modules of quiver hecke algebras and cherednik algebras we hence solve and vastly generalise berkeschgriffethsams conjecture calculate the castelnuovomumford regularity of ideals of of certain highly symmetric linear subspace arrangements and compute dirac homology of cherednik algebras
|
[['we', 'construct', 'characteristicfree', 'bases', 'and', 'bgg', 'resolutions', 'of', 'unitary', 'simple', 'modules', 'of', 'quiver', 'hecke', 'algebras', 'and', 'cherednik', 'algebras', 'we', 'hence', 'solve', 'and', 'vastly', 'generalise', 'berkeschgriffethsams', 'conjecture', 'calculate', 'the', 'castelnuovomumford', 'regularity', 'of', 'ideals', 'of', 'of', 'certain', 'highly', 'symmetric', 'linear', 'subspace', 'arrangements', 'and', 'compute', 'dirac', 'homology', 'of', 'cherednik', 'algebras']]
|
[-0.20449365525627913, -0.0037460617478127065, -0.041792897750502045, 0.10412131120329318, -0.14076210009743986, -0.2517238858601321, -0.11976794377171798, 0.33356786697455076, -0.4391931343580718, -0.11869664616002094, 0.08271671995601576, -0.15928017444726403, -0.14358871472675516, 0.12412175044174427, -0.2210397136843075, -0.042730210814625025, 0.11189277104668967, 0.02583317630721823, -0.20247563529435708, -0.352118370183946, 0.5107734209817388, 0.0231814668159527, 0.22686780665231787, 0.001994594233110547, 0.13184312137309462, 0.06670402282970431, -0.04410459512196805, -0.1394079463030009, -0.23094166386062684, 0.21311871756030165, 0.4349983808503527, 0.05265183066544325, 0.10613262264624886, -0.3806456148462451, 0.051266518963055445, 0.23741819733834785, 0.2226182867610908, 0.06949192668695975, 0.014092861553249151, -0.23021429785243844, 0.04872176130605942, -0.3010946645846833, -0.21746968427349045, -0.1525567195418736, 0.0631692497788564, 0.01680396398043503, -0.24223143020239862, 0.019421310746110976, 0.06358911706458616, 0.24830503360894712, -0.16452737246214857, -0.11646813766666404, -0.11292679504106712, 0.007918522814693659, -0.16612656354782698, -0.12393978194576567, 0.13678050497749253, -0.1371909524111644, -0.2773052271779465, 0.3269944179641164, 0.07419826527652533, -0.2129993058903062, 0.12535790803477817, -0.26790771888488013, -0.16569267644081265, 0.10585294858269069, -0.008007866006506525, 0.18753642827758324, 0.049338564560141254, 0.2698078197983863, -0.18459728048385485, -0.07244947499281768, 0.2192978363727098, 0.010420778148767093, 0.10472007766467235, -0.02394945338955554, 0.0645279248609491, 0.13244638138491174, 0.09253545879872273, 0.01964136321887212, -0.3024629247172371, -0.23583862681508713, -0.050034391820309276, 0.1513544477056712, -0.14978323767402046, -0.22752600616988036, 0.46718755688356317, 0.16129424139533355, 0.17826613170378233, 0.2626057964061265, 0.08392175066325328, 0.043630215177393475, 0.13350274382062946, 0.01209859722091452, 0.0498551478933381, 0.4202012784941041, -0.07023447760097358, -0.11839899615101192, -0.12493479687153645, 0.3819189769944743]
|
1,803.08737
|
N=2 Supercomplexification of the Korteweg-de Vries, Sawada-Kotera and
Kaup-Kupershmidt Equations
|
The supercomplexification is a special method of N=2 supersymmetrization of
the integrable equations in which the bosonic sector could be reduced to the
complex version of these equations. The N=2 supercomplex Korteweg de Vries,
Sawada-Kotera and Kaup-Kupershmidt equations are defined and investigated. The
common attribute of the supercomplex equations is appearance of the odd
hamiltonian structures and superfermionic conservation laws. The odd
bi-hamiltonian structure, Lax representation and superfermionic conserved
currents for new N=2 supersymmetric Korteweg de Vries equation and for
Sawada-Kotera, are given. The N=2 supercomplex Kaup-Kupershmidt equation is
defined for which the odd bi-hamiltonian structure is presented with its
superfermionic conserved currents.
|
nlin.SI
|
the supercomplexification is a special method of n2 supersymmetrization of the integrable equations in which the bosonic sector could be reduced to the complex version of these equations the n2 supercomplex korteweg de vries sawadakotera and kaupkupershmidt equations are defined and investigated the common attribute of the supercomplex equations is appearance of the odd hamiltonian structures and superfermionic conservation laws the odd bihamiltonian structure lax representation and superfermionic conserved currents for new n2 supersymmetric korteweg de vries equation and for sawadakotera are given the n2 supercomplex kaupkupershmidt equation is defined for which the odd bihamiltonian structure is presented with its superfermionic conserved currents
|
[['the', 'supercomplexification', 'is', 'a', 'special', 'method', 'of', 'n2', 'supersymmetrization', 'of', 'the', 'integrable', 'equations', 'in', 'which', 'the', 'bosonic', 'sector', 'could', 'be', 'reduced', 'to', 'the', 'complex', 'version', 'of', 'these', 'equations', 'the', 'n2', 'supercomplex', 'korteweg', 'de', 'vries', 'sawadakotera', 'and', 'kaupkupershmidt', 'equations', 'are', 'defined', 'and', 'investigated', 'the', 'common', 'attribute', 'of', 'the', 'supercomplex', 'equations', 'is', 'appearance', 'of', 'the', 'odd', 'hamiltonian', 'structures', 'and', 'superfermionic', 'conservation', 'laws', 'the', 'odd', 'bihamiltonian', 'structure', 'lax', 'representation', 'and', 'superfermionic', 'conserved', 'currents', 'for', 'new', 'n2', 'supersymmetric', 'korteweg', 'de', 'vries', 'equation', 'and', 'for', 'sawadakotera', 'are', 'given', 'the', 'n2', 'supercomplex', 'kaupkupershmidt', 'equation', 'is', 'defined', 'for', 'which', 'the', 'odd', 'bihamiltonian', 'structure', 'is', 'presented', 'with', 'its', 'superfermionic', 'conserved', 'currents']]
|
[-0.20464782966483458, 0.13075193547296757, -0.040551280742950745, 0.12214764310320948, -0.11475602241561693, -0.20823590851881923, -0.18614050153387235, 0.1806072918241661, -0.2544459497154343, -0.24983432458019725, 0.09435745730982437, -0.2927780352628735, -0.18084866848920345, 0.08629842854890168, -0.014682639691540423, 0.06909175611537077, 0.011866907113204327, 0.02968729698263547, -0.08054348822756141, -0.24376370430029198, 0.3337451190340753, -0.03596993233533759, 0.21128697702706808, -0.009281711798964762, 0.181674437195647, -0.02578638295423897, 0.023314173232910095, -0.06871550101512934, -0.1406929003549557, 0.07563452973194859, 0.2706789802029437, 0.05211737771035176, 0.09677572205534898, -0.42472536533194427, -0.17492955408113844, 0.08628676338555, 0.17686116758062886, 0.12917547049137817, 0.02349605494379705, -0.33025355562659015, 0.03916910410585914, -0.15000809729099274, -0.2559685704900938, -0.07136061740011963, 0.06968185847953838, 0.043679001832417415, -0.2222448499295769, 0.16940154365318663, 0.06391614430364878, 0.00393968564914722, -0.15701668112488537, -0.11643936845483076, -0.1958198262716406, -0.015905175326099873, -0.004500295629030934, -0.03469763582517557, 0.015772618727722003, -0.1414835865371952, -0.11248151022100858, 0.4080544573747936, -0.059417779687518144, -0.33971140615861206, 0.11656185139116704, -0.062262401614776426, -0.19890100586538514, 0.11985800311759151, 0.058528016608975386, 0.1482156100591608, -0.14842481857425915, 0.19840862289899686, -0.07125921124665469, 0.09394353343283429, 0.13629264285897508, -0.017974885815740835, 0.13554298263225778, 0.10391636225668822, 0.030527759567085727, 0.07641628456151332, 0.05837016318029925, -0.17843679395988218, -0.3309252742020523, -0.20077542890338043, -0.08611452692033102, 0.12038872454899784, -0.09988305469282661, -0.15060186514393517, 0.36844345934542955, 0.06446352292436595, 0.07849255778173934, 0.049581610819087456, 0.14557737183264075, 0.2335617641425308, 0.06364364611149273, 0.04116744416772716, 0.13143923058740647, 0.22461143256548574, 0.14571145150865264, -0.2914507323510799, -0.1055648350134017, 0.24952784520756527]
|
1,803.08738
|
Generalized AdS-Lorentz deformed supergravity on a manifold with
boundary
|
The purpose of this paper is to explore the supersymmetry invariance of a
particular supergravity theory, which we refer to as D=4 generalized
AdS-Lorentz deformed supergravity, in the presence of a non-trivial boundary.
In particular, we show that the so-called generalized minimal AdS-Lorentz
superalgebra can be interpreted as a peculiar torsion deformation of osp(4|1),
and we present the construction of a bulk Lagrangian based on the
aforementioned generalized AdS-Lorentz superalgebra. In the presence of a
non-trivial boundary of space-time, that is when the boundary is not thought of
as set at infinity, the fields do not asymptotically vanish, and this has some
consequences on the invariances of the theory, in particular on supersymmetry
invariance. In this work, we adopt the so-called rheonomic (geometric) approach
in superspace and show that a supersymmetric extension of a Gauss-Bonnet like
term is required in order to restore the supersymmetry invariance of the
theory. The action we end up with can be recast as a MacDowell-Mansouri type
action, namely as a sum of quadratic terms in the generalized AdS-Lorentz
covariant super field-strengths.
|
hep-th
|
the purpose of this paper is to explore the supersymmetry invariance of a particular supergravity theory which we refer to as d4 generalized adslorentz deformed supergravity in the presence of a nontrivial boundary in particular we show that the socalled generalized minimal adslorentz superalgebra can be interpreted as a peculiar torsion deformation of osp41 and we present the construction of a bulk lagrangian based on the aforementioned generalized adslorentz superalgebra in the presence of a nontrivial boundary of spacetime that is when the boundary is not thought of as set at infinity the fields do not asymptotically vanish and this has some consequences on the invariances of the theory in particular on supersymmetry invariance in this work we adopt the socalled rheonomic geometric approach in superspace and show that a supersymmetric extension of a gaussbonnet like term is required in order to restore the supersymmetry invariance of the theory the action we end up with can be recast as a macdowellmansouri type action namely as a sum of quadratic terms in the generalized adslorentz covariant super fieldstrengths
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'explore', 'the', 'supersymmetry', 'invariance', 'of', 'a', 'particular', 'supergravity', 'theory', 'which', 'we', 'refer', 'to', 'as', 'd4', 'generalized', 'adslorentz', 'deformed', 'supergravity', 'in', 'the', 'presence', 'of', 'a', 'nontrivial', 'boundary', 'in', 'particular', 'we', 'show', 'that', 'the', 'socalled', 'generalized', 'minimal', 'adslorentz', 'superalgebra', 'can', 'be', 'interpreted', 'as', 'a', 'peculiar', 'torsion', 'deformation', 'of', 'osp41', 'and', 'we', 'present', 'the', 'construction', 'of', 'a', 'bulk', 'lagrangian', 'based', 'on', 'the', 'aforementioned', 'generalized', 'adslorentz', 'superalgebra', 'in', 'the', 'presence', 'of', 'a', 'nontrivial', 'boundary', 'of', 'spacetime', 'that', 'is', 'when', 'the', 'boundary', 'is', 'not', 'thought', 'of', 'as', 'set', 'at', 'infinity', 'the', 'fields', 'do', 'not', 'asymptotically', 'vanish', 'and', 'this', 'has', 'some', 'consequences', 'on', 'the', 'invariances', 'of', 'the', 'theory', 'in', 'particular', 'on', 'supersymmetry', 'invariance', 'in', 'this', 'work', 'we', 'adopt', 'the', 'socalled', 'rheonomic', 'geometric', 'approach', 'in', 'superspace', 'and', 'show', 'that', 'a', 'supersymmetric', 'extension', 'of', 'a', 'gaussbonnet', 'like', 'term', 'is', 'required', 'in', 'order', 'to', 'restore', 'the', 'supersymmetry', 'invariance', 'of', 'the', 'theory', 'the', 'action', 'we', 'end', 'up', 'with', 'can', 'be', 'recast', 'as', 'a', 'macdowellmansouri', 'type', 'action', 'namely', 'as', 'a', 'sum', 'of', 'quadratic', 'terms', 'in', 'the', 'generalized', 'adslorentz', 'covariant', 'super', 'fieldstrengths']]
|
[-0.13621173134747114, 0.12359616656045792, -0.08432910460610427, 0.07943526011468095, -0.12192665976518238, -0.10876480114020112, -0.03742032697934678, 0.2775261725383248, -0.23288275015712742, -0.2419430884272176, 0.12804993721432878, -0.2087710202950458, -0.22797901981436558, 0.09465953401003117, -0.1375562169360218, -0.00193654169396913, -0.025544524298044248, 0.1179302334285599, -0.12846814123597944, -0.2330191595806072, 0.3517281835462035, 0.01620523715628532, 0.23843368515372276, 0.0464840233700855, 0.13078132598157077, -0.004548671957905178, 0.030042091755480584, 0.04645179361624559, -0.10651126107930878, 0.11990193595273137, 0.2034931366337137, 0.06481286319364704, 0.17311807458767783, -0.41718786162466315, -0.22424764461709465, 0.11252289117671718, 0.1666009349190751, 0.13254652723951507, 0.0029946544049287973, -0.2648866336692735, 0.09199729838637415, -0.19854970623628568, -0.17519924311903912, -0.09440138964192932, -0.035349227722186995, -0.09777446668910778, -0.23752373196500337, 0.06761533837886474, 0.08097940303140588, 0.03250605430411922, -0.07288266601314568, -0.04651564006735755, -0.05186269397184379, 0.03898767186121589, 0.09876331952245943, 0.04934702039233246, 0.08309069947776317, -0.14705774716711945, -0.1323933016540388, 0.40662210084245365, -0.09574008287170029, -0.26810484373215904, 0.14488407708099374, -0.1264061693688802, -0.21378542138210965, 0.038096351567445334, 0.1372710332053445, 0.17299904031705343, -0.14512511553141844, 0.22423777275877915, -0.07367433791540795, 0.08328008477833901, 0.1078055998741907, 0.04614445299836202, 0.19106435875203145, 0.09749990664185736, 0.07092498084543389, 0.16653563064476343, -0.010576171420993399, -0.09324616896472661, -0.46553827181858365, -0.18356828864201466, -0.13762062443367673, 0.10913312288825294, -0.10016712496600753, -0.17364562893980892, 0.3837111864007462, 0.11913476857530364, 0.17620725923817668, 0.0746623513513734, 0.1972348629944237, 0.1300310344359802, 0.12123113799193022, 0.03066193210592462, 0.25441559497480765, 0.14431456101816253, 0.05817974934789831, -0.22865376148983246, -0.080327524954853, 0.16493142766241342]
|
1,803.08739
|
Periodic solutions for the one-dimensional fractional Laplacian
|
In this paper we are concerned with the construction of periodic solutions of
the nonlocal problem $(-\Delta)^s u= f(u)$ in $\mathbb{R}$, where $(-\Delta)^s$
stands for the $s$-Laplacian, $s\in (0,1)$. We introduce a suitable framework
which allows to reduce the search for such solutions to the resolution of a
boundary value problem in a suitable Hilbert space, thereby making it possible
to reach for the usual tools of nonlinear analysis, like bifurcation theory or
variational methods. We obtain some existence theorems which are lately
enlightened with the analysis of some examples.
|
math.AP
|
in this paper we are concerned with the construction of periodic solutions of the nonlocal problem deltas u fu in mathbbr where deltas stands for the slaplacian sin 01 we introduce a suitable framework which allows to reduce the search for such solutions to the resolution of a boundary value problem in a suitable hilbert space thereby making it possible to reach for the usual tools of nonlinear analysis like bifurcation theory or variational methods we obtain some existence theorems which are lately enlightened with the analysis of some examples
|
[['in', 'this', 'paper', 'we', 'are', 'concerned', 'with', 'the', 'construction', 'of', 'periodic', 'solutions', 'of', 'the', 'nonlocal', 'problem', 'deltas', 'u', 'fu', 'in', 'mathbbr', 'where', 'deltas', 'stands', 'for', 'the', 'slaplacian', 'sin', '01', 'we', 'introduce', 'a', 'suitable', 'framework', 'which', 'allows', 'to', 'reduce', 'the', 'search', 'for', 'such', 'solutions', 'to', 'the', 'resolution', 'of', 'a', 'boundary', 'value', 'problem', 'in', 'a', 'suitable', 'hilbert', 'space', 'thereby', 'making', 'it', 'possible', 'to', 'reach', 'for', 'the', 'usual', 'tools', 'of', 'nonlinear', 'analysis', 'like', 'bifurcation', 'theory', 'or', 'variational', 'methods', 'we', 'obtain', 'some', 'existence', 'theorems', 'which', 'are', 'lately', 'enlightened', 'with', 'the', 'analysis', 'of', 'some', 'examples']]
|
[-0.10275866337017053, 0.03125459790333278, -0.04009908622958594, 0.058476474147755655, -0.11755067179910839, -0.14562753342195517, 0.04313109220885154, 0.31978820839689837, -0.30595627017319205, -0.25739483471131985, 0.17176716759826782, -0.3017146725545495, -0.15239659806247802, 0.19351992873578436, -0.0682470531978955, 0.12288284500439962, 0.058508403619958294, 0.047371826062185894, -0.09980840593020225, -0.16671626288185104, 0.3693028206885275, -0.060308460435933534, 0.19064137121248576, 0.03176460491182904, 0.0718769040890038, -0.012510762570632829, -0.022151154707211795, 0.01343355994742726, -0.21352752218954266, 0.13793404256769767, 0.2566319900047448, 0.1310140288163287, 0.3557893513391415, -0.39380469367735915, -0.20997149775341514, 0.1554261679554151, 0.11406978419464496, 0.08367679330468591, -0.02105675405408773, -0.28232865449455047, 0.11079563867921631, -0.11175069325965725, -0.19108383227398412, -0.10724735288984245, 0.026365445802609126, 0.02169728647503588, -0.32083038778768647, 0.07028521628946893, 0.07783478951314464, 0.007743882087783681, -0.0915689316274236, -0.09518177941855457, 0.028997202107631084, 0.06502624284217341, 0.04857476123660389, 0.04547489206177286, 0.014302619903658827, -0.13201019290265523, -0.07779787616907723, 0.38954537632978625, -0.057205984745976615, -0.2564464673322315, 0.17292502373974356, -0.09621575801736779, -0.1590231029678964, 0.07727964318667849, 0.12394564537842395, 0.18503175950867848, -0.13109547791795598, 0.14452946315416032, -0.029358506889548153, 0.11735497452318669, 0.08931083929621511, 0.0537151235052281, 0.10330821195255137, 0.18388698593609862, 0.13098952697020852, 0.11979350458002752, -0.05696233896176434, -0.10482535074374431, -0.3296970946817762, -0.16698652364397681, -0.09464599940822356, 0.07380374932092511, -0.06844013123773038, -0.2066818996798247, 0.3695057247610142, 0.16949823088426558, 0.18928503288577, 0.03954802801470376, 0.22903541440739192, 0.16422166688781645, 0.015243730916538172, 0.044185791061156325, 0.1787499240088639, 0.11673091800831673, 0.13948651539782683, -0.17114567331090155, -0.02007702318434086, 0.1116240635410779]
|
1,803.0874
|
Speeding-up Object Detection Training for Robotics with FALKON
|
Latest deep learning methods for object detection provide remarkable
performance, but have limits when used in robotic applications. One of the most
relevant issues is the long training time, which is due to the large size and
imbalance of the associated training sets, characterized by few positive and a
large number of negative examples (i.e. background). Proposed approaches are
based on end-to-end learning by back-propagation [22] or kernel methods trained
with Hard Negatives Mining on top of deep features [8]. These solutions are
effective, but prohibitively slow for on-line applications. In this paper we
propose a novel pipeline for object detection that overcomes this problem and
provides comparable performance, with a 60x training speedup. Our pipeline
combines (i) the Region Proposal Network and the deep feature extractor from
[22] to efficiently select candidate RoIs and encode them into powerful
representations, with (ii) the FALKON [23] algorithm, a novel kernel-based
method that allows fast training on large scale problems (millions of points).
We address the size and imbalance of training data by exploiting the stochastic
subsampling intrinsic into the method and a novel, fast, bootstrapping
approach. We assess the effectiveness of the approach on a standard Computer
Vision dataset (PASCAL VOC 2007 [5]) and demonstrate its applicability to a
real robotic scenario with the iCubWorld Transformations [18] dataset.
|
cs.RO cs.AI cs.CV cs.LG
|
latest deep learning methods for object detection provide remarkable performance but have limits when used in robotic applications one of the most relevant issues is the long training time which is due to the large size and imbalance of the associated training sets characterized by few positive and a large number of negative examples ie background proposed approaches are based on endtoend learning by backpropagation 22 or kernel methods trained with hard negatives mining on top of deep features 8 these solutions are effective but prohibitively slow for online applications in this paper we propose a novel pipeline for object detection that overcomes this problem and provides comparable performance with a 60x training speedup our pipeline combines i the region proposal network and the deep feature extractor from 22 to efficiently select candidate rois and encode them into powerful representations with ii the falkon 23 algorithm a novel kernelbased method that allows fast training on large scale problems millions of points we address the size and imbalance of training data by exploiting the stochastic subsampling intrinsic into the method and a novel fast bootstrapping approach we assess the effectiveness of the approach on a standard computer vision dataset pascal voc 2007 5 and demonstrate its applicability to a real robotic scenario with the icubworld transformations 18 dataset
|
[['latest', 'deep', 'learning', 'methods', 'for', 'object', 'detection', 'provide', 'remarkable', 'performance', 'but', 'have', 'limits', 'when', 'used', 'in', 'robotic', 'applications', 'one', 'of', 'the', 'most', 'relevant', 'issues', 'is', 'the', 'long', 'training', 'time', 'which', 'is', 'due', 'to', 'the', 'large', 'size', 'and', 'imbalance', 'of', 'the', 'associated', 'training', 'sets', 'characterized', 'by', 'few', 'positive', 'and', 'a', 'large', 'number', 'of', 'negative', 'examples', 'ie', 'background', 'proposed', 'approaches', 'are', 'based', 'on', 'endtoend', 'learning', 'by', 'backpropagation', '22', 'or', 'kernel', 'methods', 'trained', 'with', 'hard', 'negatives', 'mining', 'on', 'top', 'of', 'deep', 'features', '8', 'these', 'solutions', 'are', 'effective', 'but', 'prohibitively', 'slow', 'for', 'online', 'applications', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'pipeline', 'for', 'object', 'detection', 'that', 'overcomes', 'this', 'problem', 'and', 'provides', 'comparable', 'performance', 'with', 'a', '60x', 'training', 'speedup', 'our', 'pipeline', 'combines', 'i', 'the', 'region', 'proposal', 'network', 'and', 'the', 'deep', 'feature', 'extractor', 'from', '22', 'to', 'efficiently', 'select', 'candidate', 'rois', 'and', 'encode', 'them', 'into', 'powerful', 'representations', 'with', 'ii', 'the', 'falkon', '23', 'algorithm', 'a', 'novel', 'kernelbased', 'method', 'that', 'allows', 'fast', 'training', 'on', 'large', 'scale', 'problems', 'millions', 'of', 'points', 'we', 'address', 'the', 'size', 'and', 'imbalance', 'of', 'training', 'data', 'by', 'exploiting', 'the', 'stochastic', 'subsampling', 'intrinsic', 'into', 'the', 'method', 'and', 'a', 'novel', 'fast', 'bootstrapping', 'approach', 'we', 'assess', 'the', 'effectiveness', 'of', 'the', 'approach', 'on', 'a', 'standard', 'computer', 'vision', 'dataset', 'pascal', 'voc', '2007', '5', 'and', 'demonstrate', 'its', 'applicability', 'to', 'a', 'real', 'robotic', 'scenario', 'with', 'the', 'icubworld', 'transformations', '18', 'dataset']]
|
[-0.03925525142026513, 0.0056321119880993606, -0.03286429426279264, 0.06515436419566092, -0.11055026952763675, -0.18267223488483406, 0.05782381099696202, 0.415302360240646, -0.25559127423427225, -0.3887513721064251, 0.10859803985524061, -0.2600809319378809, -0.17636205052285395, 0.2310034195554046, -0.11735465791746348, 0.10593171631383787, 0.1646051947307704, -0.002727511227729135, -0.061776836541765884, -0.30610035346708847, 0.2933569368561385, 0.02732981565148091, 0.3437820576116253, 0.02323906806500249, 0.16646100984103718, -0.04156826640246436, -0.060963187601710496, -0.0013942256471771678, -0.03036926221041843, 0.182481382908278, 0.2733885401437335, 0.20457176003751723, 0.34820643411755253, -0.38289737327162315, -0.17515214373607133, 0.09038290603267443, 0.14063266089552026, 0.107743214910173, -0.05995815807815503, -0.33771781115232175, 0.09795950944492317, -0.16822387331760386, -0.007872901516276653, -0.15399215648843287, 0.0007816834970273905, -0.006864706047862355, -0.2796832093369664, 0.039426363212206286, 0.049790116493736776, 0.054653258616949814, -0.02903225915307067, -0.11597137543786731, 0.08091701204992002, 0.11214181807614902, 0.030296259268652648, 0.04229950302019629, 0.12304610608434477, -0.1848695449858766, -0.13970920457763392, 0.3403279849940359, -0.057317377475555986, -0.17910705791587975, 0.23415929056742849, -0.0200259246458127, -0.15560684855747106, 0.15302005131444377, 0.2594410538392064, 0.1447462022274353, -0.1512224162507428, 0.05059038553305005, -0.0032137074007618205, 0.173236885506345, 0.024382952527419007, -0.029898215003346128, 0.17180420042185923, 0.2783870812089407, 0.04497777478644383, 0.15311867985831298, -0.19705451792685413, -0.052612350113189744, -0.24030432381766365, -0.09854142242423862, -0.20460255497083482, -0.010333154242457735, -0.13930829901720346, -0.14074789706932347, 0.3934687802835402, 0.2297753496060506, 0.24484160413784492, 0.10042022177960327, 0.33680767345099916, 0.029536209582821122, 0.15338735974445525, 0.12070991517329174, 0.18917515210557245, 0.018440738383947906, 0.13517291412723284, -0.17597965723878048, 0.05204096986778529, 0.05795715280638197]
|
1,803.08741
|
MultiMesh Finite Element Methods: Solving PDEs on Multiple Intersecting
Meshes
|
We present a new framework for expressing finite element methods on multiple
intersecting meshes: multimesh finite element methods. The framework enables
the use of separate meshes to discretize parts of a computational domain that
are naturally separate; such as the components of an engine, the domains of a
multiphysics problem, or solid bodies interacting under the influence of forces
from surrounding fluids or other physical fields. Such multimesh finite element
methods are particularly well suited to problems in which the computational
domain undergoes large deformations as a result of the relative motion of the
separate components of a multi-body system. In the present paper, we formulate
the multimesh finite element method for the Poisson equation. Numerical
examples demonstrate the optimal order convergence, the numerical robustness of
the formulation and implementation in the face of thin intersections and
rounding errors, as well as the applicability of the methodology.
In the accompanying paper~\cite{mmfem-2}, we analyze the proposed method and
prove optimal order convergence and stability.
|
math.NA
|
we present a new framework for expressing finite element methods on multiple intersecting meshes multimesh finite element methods the framework enables the use of separate meshes to discretize parts of a computational domain that are naturally separate such as the components of an engine the domains of a multiphysics problem or solid bodies interacting under the influence of forces from surrounding fluids or other physical fields such multimesh finite element methods are particularly well suited to problems in which the computational domain undergoes large deformations as a result of the relative motion of the separate components of a multibody system in the present paper we formulate the multimesh finite element method for the poisson equation numerical examples demonstrate the optimal order convergence the numerical robustness of the formulation and implementation in the face of thin intersections and rounding errors as well as the applicability of the methodology in the accompanying papercitemmfem2 we analyze the proposed method and prove optimal order convergence and stability
|
[['we', 'present', 'a', 'new', 'framework', 'for', 'expressing', 'finite', 'element', 'methods', 'on', 'multiple', 'intersecting', 'meshes', 'multimesh', 'finite', 'element', 'methods', 'the', 'framework', 'enables', 'the', 'use', 'of', 'separate', 'meshes', 'to', 'discretize', 'parts', 'of', 'a', 'computational', 'domain', 'that', 'are', 'naturally', 'separate', 'such', 'as', 'the', 'components', 'of', 'an', 'engine', 'the', 'domains', 'of', 'a', 'multiphysics', 'problem', 'or', 'solid', 'bodies', 'interacting', 'under', 'the', 'influence', 'of', 'forces', 'from', 'surrounding', 'fluids', 'or', 'other', 'physical', 'fields', 'such', 'multimesh', 'finite', 'element', 'methods', 'are', 'particularly', 'well', 'suited', 'to', 'problems', 'in', 'which', 'the', 'computational', 'domain', 'undergoes', 'large', 'deformations', 'as', 'a', 'result', 'of', 'the', 'relative', 'motion', 'of', 'the', 'separate', 'components', 'of', 'a', 'multibody', 'system', 'in', 'the', 'present', 'paper', 'we', 'formulate', 'the', 'multimesh', 'finite', 'element', 'method', 'for', 'the', 'poisson', 'equation', 'numerical', 'examples', 'demonstrate', 'the', 'optimal', 'order', 'convergence', 'the', 'numerical', 'robustness', 'of', 'the', 'formulation', 'and', 'implementation', 'in', 'the', 'face', 'of', 'thin', 'intersections', 'and', 'rounding', 'errors', 'as', 'well', 'as', 'the', 'applicability', 'of', 'the', 'methodology', 'in', 'the', 'accompanying', 'papercitemmfem2', 'we', 'analyze', 'the', 'proposed', 'method', 'and', 'prove', 'optimal', 'order', 'convergence', 'and', 'stability']]
|
[-0.09813069043979969, 0.022211022747707133, -0.08660134073507822, 0.01241619872895104, -0.056215269640547995, -0.08309592162603857, 0.013013753386783518, 0.35290641480924584, -0.31520628840605047, -0.2843359137632321, 0.1388102022609041, -0.2467007279585771, -0.13074764035596156, 0.19309650014016638, -0.07611481872398729, 0.09404114192857603, 0.07599093266590326, -0.01574736676339842, -0.08081374729460358, -0.20178869173195166, 0.3206023632514256, -0.025826142419612518, 0.2798855902374159, 0.05904605046574337, 0.13927261592866277, -0.03515045733190534, -0.030091815081965408, 0.0736908026005107, -0.0901398247478039, 0.13160340531001924, 0.25191247241318593, 0.08142215216009199, 0.28619117763491325, -0.4474395810752923, -0.22567305417248495, 0.06343153118835705, 0.1456856850899733, 0.12886793600082005, -0.058389433384384314, -0.25421846100922535, 0.08640828856301529, -0.175322734768054, -0.15248377676938235, -0.10574945007209424, -0.02174675041510735, 0.06808772786623901, -0.28901422963611334, 0.05653999778327107, 0.07976918024059283, 0.05977414417896926, -0.07270192265522057, -0.11774649698054418, 0.037754521538851275, 0.1381708970796432, 0.025568590197643196, -0.03193957165866676, 0.11054789622164803, -0.08983754482189263, -0.11291076022740683, 0.4440074771941628, -0.02958061598258576, -0.28028020194881126, 0.22592729571516867, -0.0758746226352674, -0.09621506007273256, 0.11508510844425562, 0.2284562130153961, 0.19283835677843955, -0.1106661143137809, 0.10370679460264697, -0.0026293338368428344, 0.12988435748941551, 0.026524410167720492, -0.016979948672132542, 0.13708678074037356, 0.19851350897842626, 0.09417166404724682, 0.16780023542153763, -0.07794864054476083, -0.11051209823136436, -0.3544245088666269, -0.17866211774454302, -0.16784525533022795, -0.04708773886531959, -0.1311099213935337, -0.23056540759249783, 0.38440662621302, 0.15877629945595048, 0.14697950873179016, 0.028648915724328684, 0.33118376696919216, 0.06842596584034187, 0.03526542087970876, 0.0629368151112655, 0.1846685456658173, 0.13964351443976256, 0.08196052377276412, -0.25434277387462373, 0.03341842354505242, 0.1301435312848354]
|
1,803.08742
|
Software-based discharge suppressor using an EPICS data acquisition
system as a rapid prototype at the LIPAc beam extraction system
|
Internal continuous discharge can rapidly damage high-current ion sources and
their extraction systems composed of several electrodes at high voltage. To
prevent this continuous discharge inside the extraction system, a rapid
prototype using an Experimental Physics and Industrial Control System (EPICS)
software system for data acquisition has been implemented. During commissioning
of the 140 mA deuterium electron cyclotron resonance ion source of the Linear
IFMIF Prototype Accelerator (LIPAc), discharges were often observed during
plasma tuning of the ion source and beam optics tuning of the extraction
system. If such continuous discharge can be avoided, discharge-related damage
such as melting electrode edges and holes in the boron nitride disk in the ion
source can be minimized and thus an efficient machine operation can be
achieved. A veto signal is output to the machine protection system, which is
then in charge of the RF power shutdown of the ion source for a pre-determined
time. The average reaction time of this system has been measured and is about
10 ms from discharge detection to RF power shutdown of the ion source with a 50
Hz sampling frequency. This is hundreds of times slower than hardware-based
implementation. However, it prevents almost all continuous discharges at the
LIPAc ion source and extraction system, and is still much faster than an
operator's reaction time.
|
physics.acc-ph
|
internal continuous discharge can rapidly damage highcurrent ion sources and their extraction systems composed of several electrodes at high voltage to prevent this continuous discharge inside the extraction system a rapid prototype using an experimental physics and industrial control system epics software system for data acquisition has been implemented during commissioning of the 140 ma deuterium electron cyclotron resonance ion source of the linear ifmif prototype accelerator lipac discharges were often observed during plasma tuning of the ion source and beam optics tuning of the extraction system if such continuous discharge can be avoided dischargerelated damage such as melting electrode edges and holes in the boron nitride disk in the ion source can be minimized and thus an efficient machine operation can be achieved a veto signal is output to the machine protection system which is then in charge of the rf power shutdown of the ion source for a predetermined time the average reaction time of this system has been measured and is about 10 ms from discharge detection to rf power shutdown of the ion source with a 50 hz sampling frequency this is hundreds of times slower than hardwarebased implementation however it prevents almost all continuous discharges at the lipac ion source and extraction system and is still much faster than an operators reaction time
|
[['internal', 'continuous', 'discharge', 'can', 'rapidly', 'damage', 'highcurrent', 'ion', 'sources', 'and', 'their', 'extraction', 'systems', 'composed', 'of', 'several', 'electrodes', 'at', 'high', 'voltage', 'to', 'prevent', 'this', 'continuous', 'discharge', 'inside', 'the', 'extraction', 'system', 'a', 'rapid', 'prototype', 'using', 'an', 'experimental', 'physics', 'and', 'industrial', 'control', 'system', 'epics', 'software', 'system', 'for', 'data', 'acquisition', 'has', 'been', 'implemented', 'during', 'commissioning', 'of', 'the', '140', 'ma', 'deuterium', 'electron', 'cyclotron', 'resonance', 'ion', 'source', 'of', 'the', 'linear', 'ifmif', 'prototype', 'accelerator', 'lipac', 'discharges', 'were', 'often', 'observed', 'during', 'plasma', 'tuning', 'of', 'the', 'ion', 'source', 'and', 'beam', 'optics', 'tuning', 'of', 'the', 'extraction', 'system', 'if', 'such', 'continuous', 'discharge', 'can', 'be', 'avoided', 'dischargerelated', 'damage', 'such', 'as', 'melting', 'electrode', 'edges', 'and', 'holes', 'in', 'the', 'boron', 'nitride', 'disk', 'in', 'the', 'ion', 'source', 'can', 'be', 'minimized', 'and', 'thus', 'an', 'efficient', 'machine', 'operation', 'can', 'be', 'achieved', 'a', 'veto', 'signal', 'is', 'output', 'to', 'the', 'machine', 'protection', 'system', 'which', 'is', 'then', 'in', 'charge', 'of', 'the', 'rf', 'power', 'shutdown', 'of', 'the', 'ion', 'source', 'for', 'a', 'predetermined', 'time', 'the', 'average', 'reaction', 'time', 'of', 'this', 'system', 'has', 'been', 'measured', 'and', 'is', 'about', '10', 'ms', 'from', 'discharge', 'detection', 'to', 'rf', 'power', 'shutdown', 'of', 'the', 'ion', 'source', 'with', 'a', '50', 'hz', 'sampling', 'frequency', 'this', 'is', 'hundreds', 'of', 'times', 'slower', 'than', 'hardwarebased', 'implementation', 'however', 'it', 'prevents', 'almost', 'all', 'continuous', 'discharges', 'at', 'the', 'lipac', 'ion', 'source', 'and', 'extraction', 'system', 'and', 'is', 'still', 'much', 'faster', 'than', 'an', 'operators', 'reaction', 'time']]
|
[-0.09840384366229003, 0.1748862261642285, -0.01640802275763045, -0.01843635179535594, -0.0022791539871155524, -0.1968776592248401, 0.018731869843810103, 0.4040459386831106, -0.2535730963551201, -0.3405369311701073, 0.13766757046294853, -0.29069693390886453, 0.03369664803071511, 0.26009908551566824, -0.031246146453587816, 0.11870299864527878, 0.08918674140302248, 0.006639031477835636, -0.02909612757503055, -0.16499191212662778, 0.1990541515958517, 0.17198346666883418, 0.3088183120347906, 0.09298633744420354, 0.12568626624564533, -0.04975901309801482, 0.03175407643105055, -0.06341759311251863, -0.012740072521562472, 0.03280075968400207, 0.28294129676705354, 0.12675639161363592, 0.2688761268569113, -0.4636279153296464, -0.23094044010653053, 0.06336445183395734, 0.139981121582461, 0.10526767592433146, -0.07945254483195238, -0.2311244212610777, 0.07863042407160148, -0.2175401141293087, -0.09463124354911405, -0.0017064183560568233, 0.029468008419931975, 0.05004306816723371, -0.27717563540479817, 0.02282720316677939, 0.05158745179949112, 0.0874796019000716, -0.06749712336635173, -0.08664756528112691, -0.017077979571077713, 0.07281549417448967, -0.0009150868649919365, 0.08802627374466812, 0.2747606693702035, -0.08415611551879623, -0.08433851462918832, 0.34148536042072053, -0.028040286564663442, -0.10624715276062488, 0.1898776406525136, -0.1671861339577062, -0.07149573208136094, 0.19048029861012258, 0.19912696174389227, 0.07093847876815342, -0.21191055941189704, -0.019883985360299214, 0.06708086659308783, 0.227215589454914, 0.1417929728385494, 0.007689265692389982, 0.22628149206555168, 0.2495478058791568, 0.04743973132531527, 0.14676442386218358, -0.12717624614001685, -0.00365514064824945, -0.2565360497975679, -0.13176280340006533, -0.15873610046638045, 0.039614329131883244, -0.022907690252827177, -0.12893586198144139, 0.432829685555771, 0.11902478154488774, 0.11215862629307044, -0.06241875753662181, 0.3496667803858906, 0.11515478739287531, 0.10786124064890278, 0.06596701786052002, 0.21957617941052587, 0.0799631162644039, 0.18244522259419046, -0.24477392931815323, 0.09997817299783576, -0.01986662088568474]
|
1,803.08743
|
Type-II Dirac photons at the metasurfaces
|
Topological characteristics of energy bands, such as Dirac/Weyl nodes, have
attracted substantial interest in condensed matter systems as well as in
classical wave systems. Among these energy bands, the type-II Dirac point is a
nodal degeneracy with tilted conical dispersion, leading to a peculiar crossing
dispersion in the constant energy plane. Such nodal points have recently been
found in electronic materials. The analogous topological feature in photonic
systems remains a theoretical curiosity, with experimental realization expected
to be challenging. Here, we experimentally realize the type-II Dirac point
using a planar metasurface architecture, where the band degeneracy point is
protected by the underlying mirror symmetry of the metasurface. Gapless edge
modes are found and measured at the boundary between the different domains of
the symmetry-broken metasurface. Our work shows that metasurfaces are simple
and practical platforms for realizing electromagnetic type-II Dirac points, and
their planar structure is a distinct advantage that facilitates applications in
two-dimensional topological photonics.
|
physics.app-ph cond-mat.mes-hall physics.optics
|
topological characteristics of energy bands such as diracweyl nodes have attracted substantial interest in condensed matter systems as well as in classical wave systems among these energy bands the typeii dirac point is a nodal degeneracy with tilted conical dispersion leading to a peculiar crossing dispersion in the constant energy plane such nodal points have recently been found in electronic materials the analogous topological feature in photonic systems remains a theoretical curiosity with experimental realization expected to be challenging here we experimentally realize the typeii dirac point using a planar metasurface architecture where the band degeneracy point is protected by the underlying mirror symmetry of the metasurface gapless edge modes are found and measured at the boundary between the different domains of the symmetrybroken metasurface our work shows that metasurfaces are simple and practical platforms for realizing electromagnetic typeii dirac points and their planar structure is a distinct advantage that facilitates applications in twodimensional topological photonics
|
[['topological', 'characteristics', 'of', 'energy', 'bands', 'such', 'as', 'diracweyl', 'nodes', 'have', 'attracted', 'substantial', 'interest', 'in', 'condensed', 'matter', 'systems', 'as', 'well', 'as', 'in', 'classical', 'wave', 'systems', 'among', 'these', 'energy', 'bands', 'the', 'typeii', 'dirac', 'point', 'is', 'a', 'nodal', 'degeneracy', 'with', 'tilted', 'conical', 'dispersion', 'leading', 'to', 'a', 'peculiar', 'crossing', 'dispersion', 'in', 'the', 'constant', 'energy', 'plane', 'such', 'nodal', 'points', 'have', 'recently', 'been', 'found', 'in', 'electronic', 'materials', 'the', 'analogous', 'topological', 'feature', 'in', 'photonic', 'systems', 'remains', 'a', 'theoretical', 'curiosity', 'with', 'experimental', 'realization', 'expected', 'to', 'be', 'challenging', 'here', 'we', 'experimentally', 'realize', 'the', 'typeii', 'dirac', 'point', 'using', 'a', 'planar', 'metasurface', 'architecture', 'where', 'the', 'band', 'degeneracy', 'point', 'is', 'protected', 'by', 'the', 'underlying', 'mirror', 'symmetry', 'of', 'the', 'metasurface', 'gapless', 'edge', 'modes', 'are', 'found', 'and', 'measured', 'at', 'the', 'boundary', 'between', 'the', 'different', 'domains', 'of', 'the', 'symmetrybroken', 'metasurface', 'our', 'work', 'shows', 'that', 'metasurfaces', 'are', 'simple', 'and', 'practical', 'platforms', 'for', 'realizing', 'electromagnetic', 'typeii', 'dirac', 'points', 'and', 'their', 'planar', 'structure', 'is', 'a', 'distinct', 'advantage', 'that', 'facilitates', 'applications', 'in', 'twodimensional', 'topological', 'photonics']]
|
[-0.214713154369607, 0.16195323609878334, -0.04364970094190003, 0.01937842406653381, -0.12114976030977395, -0.19499268043989268, 0.04370575667454455, 0.4179176600748458, -0.261686600646219, -0.29391010378439647, 0.02444410239546321, -0.31806479864873183, -0.21704874418747538, 0.1885839245007493, -0.008721445793082986, 0.11237805811927104, -0.02226162807514461, -0.059506581663392864, -0.0967196826524555, -0.14620709921478126, 0.32226402345949257, -0.029051382214021988, 0.3707316048317947, 0.059474597476088464, 0.030138991214931965, -0.04526425602708537, 0.11146925411258753, 0.011504185487492343, -0.09917771754809133, 0.08887561493797992, 0.29500936929775307, -0.07362403525397755, 0.19867342080807504, -0.41776740177271837, -0.26717759255851165, 0.05573025038943459, 0.15362368359302098, 0.13009024080700982, -0.12672243682810894, -0.3046681620598508, 0.06141640457850045, -0.12108317117254512, -0.18842224422424364, -0.06643721038768163, -0.014827689487272156, -0.027284032226396866, -0.15516836348904642, 0.043529391718598515, 0.0159187005893984, 0.06994078443564761, -0.03040916327154264, -0.10510167305041343, -0.1264105606615209, 0.0633068897922595, 0.01483001125504812, -0.01383413317410323, 0.07034514907475871, -0.1295807282649315, -0.17464388529053673, 0.4490580207023483, 0.021329188994012583, -0.15307668116516793, 0.18502777728672998, -0.12675248892703214, -0.08103747728268783, 0.1479964473953423, 0.1619567880138325, 0.03859579138038381, -0.08196332878886982, 0.12645625891440057, -0.045868899451493354, 0.08704508611173459, 0.053369485767176136, 0.12598314066119015, 0.33390236909811694, 0.17398241638632803, 0.08841972127153824, 0.1207451940057441, -0.09763356160748607, -0.06768431891955864, -0.26640038094363916, -0.1911682969538304, -0.276503642208319, 0.02528471020317132, -0.045374706477256645, -0.21616691451233166, 0.4504292012813191, 0.09604307004505805, 0.18988358612673786, -0.07111338285269597, 0.26822314595278257, 0.13613889682948446, 0.0861550112350438, 0.07786148257153587, 0.3019215275163356, 0.10439568193396553, 0.08541188940804344, -0.20450707263229653, -0.02855955122131257, -0.007951422152706446]
|
1,803.08744
|
Restricting open surjections
|
We show that any continuous open surjection from a complete metric space to
another metric space can be restricted to a surjection for which the domain has
the same density character as the target. This improves a recent result of
Aron, Jaramillo and Le Donne.
|
math.FA math.GN math.MG
|
we show that any continuous open surjection from a complete metric space to another metric space can be restricted to a surjection for which the domain has the same density character as the target this improves a recent result of aron jaramillo and le donne
|
[['we', 'show', 'that', 'any', 'continuous', 'open', 'surjection', 'from', 'a', 'complete', 'metric', 'space', 'to', 'another', 'metric', 'space', 'can', 'be', 'restricted', 'to', 'a', 'surjection', 'for', 'which', 'the', 'domain', 'has', 'the', 'same', 'density', 'character', 'as', 'the', 'target', 'this', 'improves', 'a', 'recent', 'result', 'of', 'aron', 'jaramillo', 'and', 'le', 'donne']]
|
[-0.0992529271170497, 0.09374954724270436, -0.134039488222657, 0.029116335198179716, -0.13210903502379853, -0.08946987408109837, 0.0486408074075977, 0.3573436809082826, -0.3157950120460656, -0.2198579545236296, 0.10602568461456233, -0.25655263029038905, -0.1346906744150652, 0.1956470319794284, -0.15188270509243013, 0.019103698825670614, 0.06265581122909983, 0.06885689915054374, -0.10196920917369426, -0.24690329883661535, 0.3549283564918571, -0.006514588691708114, 0.24516785188267629, 0.06841066092407952, 0.14211817343408864, 0.006374922322316302, 0.04175605604218112, 0.017277472330412515, -0.1556954935873768, 0.10114627596404817, 0.2532068460972773, 0.1866095296624634, 0.25986990773429475, -0.27975380470355354, -0.25275913483152784, 0.16125591612524456, 0.10610985652440125, 0.06852530101055486, -0.014859492499898706, -0.3421054424924983, 0.11767899572021431, -0.15171328588492342, -0.07734775005115403, -0.06001971196383238, 0.06487378653966719, -0.01845614065726598, -0.2899066521061791, -0.017957901520033678, 0.14092454229378037, -0.007414502298666371, -0.08710405110485024, -0.061878339108079675, -0.0464353629698356, 0.1502814307808876, -0.03401830670320326, 0.23312933470846878, 0.06711058153046502, -0.06468300403923624, -0.10416911190582646, 0.34876080776254337, -0.12288807611912489, -0.2252263707118497, 0.1641930630999721, -0.16868143590788046, -0.15183226144872605, 0.09187887983086208, 0.10479629894511568, 0.14255323341737192, -0.06464135036286381, 0.2155867560236301, -0.10953403565670466, 0.17461538688124467, 0.10546588262336122, -0.017022959505104355, 0.10486675849210264, 0.12478402889230185, 0.12268838916465433, 0.12244873309456226, -0.00580230847828918, 0.00871347039937973, -0.28942355654305885, -0.22174913895626863, -0.2134715262800455, 0.1046735879033804, -0.07335567218219188, -0.17451112953325112, 0.3361551497338547, 0.06459511337387892, 0.24314171485085453, 0.07273304110858589, 0.21793817542493343, 0.03643810192071315, 0.04247360813121001, 0.07667088411334488, 0.1567093054453532, 0.08167152518613471, 0.041896276155279744, -0.12072858346315722, -0.0011411912196005384, 0.10279773701913655]
|
1,803.08745
|
SPIRou: a nIR spectropolarimeter / high-precision velocimeter for the
CFHT
|
SPIRou is a near-infrared (nIR) spectropolarimeter / velocimeter for the
Canada-France-Hawaii Telescope (CFHT), that will focus on two forefront science
topics, (i) the quest for habitable Earth-like planets around nearby M stars,
and (ii) the study of low-mass star/planet formation in the presence of
magnetic fields. SPIRou will also efficiently tackle many key programmes beyond
these two main goals, from weather patterns on brown dwarfs to Solar-System
planet and exoplanet atmospheres. SPIRou will cover a wide spectral domain in a
single exposure (0.98-2.44um at a resolving power of 70K, yielding unpolarized
and polarized spectra of low-mass stars with a 15% average throughput at a
radial velocity (RV) precision of 1 m/s. It consists of a Cassegrain unit
mounted at the Cassegrain focus of CFHT and featuring an achromatic
polarimeter, coupled to a cryogenic spectrograph cooled down at 80K through a
fluoride fiber link. SPIRou is currently integrated at IRAP/OMP and will be
mounted at CFHT in 2017 Q4 for a first light scheduled in late 2017. Science
operation is predicted to begin in 2018 S2, allowing many fruitful synergies
with major ground and space instruments such as the JWST, TESS, ALMA and
later-on PLATO and the ELT.
|
astro-ph.IM astro-ph.SR
|
spirou is a nearinfrared nir spectropolarimeter velocimeter for the canadafrancehawaii telescope cfht that will focus on two forefront science topics i the quest for habitable earthlike planets around nearby m stars and ii the study of lowmass starplanet formation in the presence of magnetic fields spirou will also efficiently tackle many key programmes beyond these two main goals from weather patterns on brown dwarfs to solarsystem planet and exoplanet atmospheres spirou will cover a wide spectral domain in a single exposure 098244um at a resolving power of 70k yielding unpolarized and polarized spectra of lowmass stars with a 15 average throughput at a radial velocity rv precision of 1 ms it consists of a cassegrain unit mounted at the cassegrain focus of cfht and featuring an achromatic polarimeter coupled to a cryogenic spectrograph cooled down at 80k through a fluoride fiber link spirou is currently integrated at irapomp and will be mounted at cfht in 2017 q4 for a first light scheduled in late 2017 science operation is predicted to begin in 2018 s2 allowing many fruitful synergies with major ground and space instruments such as the jwst tess alma and lateron plato and the elt
|
[['spirou', 'is', 'a', 'nearinfrared', 'nir', 'spectropolarimeter', 'velocimeter', 'for', 'the', 'canadafrancehawaii', 'telescope', 'cfht', 'that', 'will', 'focus', 'on', 'two', 'forefront', 'science', 'topics', 'i', 'the', 'quest', 'for', 'habitable', 'earthlike', 'planets', 'around', 'nearby', 'm', 'stars', 'and', 'ii', 'the', 'study', 'of', 'lowmass', 'starplanet', 'formation', 'in', 'the', 'presence', 'of', 'magnetic', 'fields', 'spirou', 'will', 'also', 'efficiently', 'tackle', 'many', 'key', 'programmes', 'beyond', 'these', 'two', 'main', 'goals', 'from', 'weather', 'patterns', 'on', 'brown', 'dwarfs', 'to', 'solarsystem', 'planet', 'and', 'exoplanet', 'atmospheres', 'spirou', 'will', 'cover', 'a', 'wide', 'spectral', 'domain', 'in', 'a', 'single', 'exposure', '098244um', 'at', 'a', 'resolving', 'power', 'of', '70k', 'yielding', 'unpolarized', 'and', 'polarized', 'spectra', 'of', 'lowmass', 'stars', 'with', 'a', '15', 'average', 'throughput', 'at', 'a', 'radial', 'velocity', 'rv', 'precision', 'of', '1', 'ms', 'it', 'consists', 'of', 'a', 'cassegrain', 'unit', 'mounted', 'at', 'the', 'cassegrain', 'focus', 'of', 'cfht', 'and', 'featuring', 'an', 'achromatic', 'polarimeter', 'coupled', 'to', 'a', 'cryogenic', 'spectrograph', 'cooled', 'down', 'at', '80k', 'through', 'a', 'fluoride', 'fiber', 'link', 'spirou', 'is', 'currently', 'integrated', 'at', 'irapomp', 'and', 'will', 'be', 'mounted', 'at', 'cfht', 'in', '2017', 'q4', 'for', 'a', 'first', 'light', 'scheduled', 'in', 'late', '2017', 'science', 'operation', 'is', 'predicted', 'to', 'begin', 'in', '2018', 's2', 'allowing', 'many', 'fruitful', 'synergies', 'with', 'major', 'ground', 'and', 'space', 'instruments', 'such', 'as', 'the', 'jwst', 'tess', 'alma', 'and', 'lateron', 'plato', 'and', 'the', 'elt']]
|
[-0.10102527680778012, 0.17053416237475402, -0.0840269861696048, 0.012120685635552233, -0.15064870445633827, -0.1324236455767118, 0.03360944823962012, 0.38175066424168874, -0.15798779135838764, -0.3594307804014534, 0.1298898327051537, -0.31927427370101213, -0.045982460732590984, 0.2528958759623455, -0.08468692359087278, 0.026516314999190802, 0.15526697150378765, -0.0842186790535745, -0.003523732579946902, -0.3047121073192552, 0.23480593676249178, 0.10739077048222583, 0.14477213878021336, -0.04144458689477256, 0.08130857858089154, -0.06017059060629726, -0.05397646476216998, -0.04924891831142679, -0.15680072884473345, 0.026478300447162893, 0.34149503471214593, 0.11021761781027176, 0.2731041979721565, -0.3584393599963526, -0.14669229696533576, 0.03849410808335548, 0.09967380388532303, -0.045558962121260226, -0.016221265133935958, -0.30437072807654125, 0.05797847763445593, -0.1206912604989016, -0.17498442380852305, 0.03751938924020559, 0.022253743087219977, 0.024677184751238097, -0.24944728972707136, -0.07418646063363377, -0.029127804588252853, 0.17816900871886113, -0.1175558837322691, -0.14613266548708312, -0.0391252378137427, 0.11310897846139137, -0.09687514406942148, 0.0849904569996144, 0.08714585974644486, -0.1479165480909005, -0.016477923054180887, 0.3995536765845471, -0.15650672579637834, 0.05171258940683082, 0.19833174462852635, -0.2438598497285863, -0.18859042567152953, 0.11745980241787188, 0.227298633493099, 0.13510889894828276, -0.16129285312190497, 0.053222222818954626, 0.03645398069206702, 0.20054492485090206, 0.10368163879365497, 0.07028825727012969, 0.41035967266436707, 0.21263309447505852, 0.09607213718238161, 0.050681934060082416, -0.3019521431877403, 0.018979009394485925, -0.22636137370226578, -0.17241001224637958, -0.13362279995560608, 0.03262945494648146, -0.026879418138762667, -0.055762422227867176, 0.3551999971573001, 0.12533471594233372, 0.09917638156342215, -0.0009537801082298812, 0.3496177844347951, -0.012432235735348551, 0.12324767705225914, 0.04157343873641329, 0.31037059207158835, 0.12520145958279902, 0.19625397870729955, -0.2041253354550416, -0.032134466864571894, -0.01075431006149264]
|
1,803.08746
|
Study of EIT resonances in an anti-relaxation coated Rb vapor cell
|
We demonstrate---experimentally and theoretically---that resonances obtained
in electromagnetically induced transparency (EIT) can be both bright and dark.
The experiments are done using magnetic sublevels of a hyperfine transition in
the D$_1$ line of $^{87}$Rb. The degeneracy of the sublevels is removed by
having a magnetic field of value 27 G. The atoms are contained in a
room-temperature vapor cell with anti-relaxation coating on the walls.
Theoretical analysis based on a two-region model reproduces the experimental
spectrum quite well. This ability to have both bright and dark resonances
promises applications in sub- and super-luminal propagation of light, and
sensitive magnetometry.
|
physics.atom-ph
|
we demonstrateexperimentally and theoreticallythat resonances obtained in electromagnetically induced transparency eit can be both bright and dark the experiments are done using magnetic sublevels of a hyperfine transition in the d_1 line of 87rb the degeneracy of the sublevels is removed by having a magnetic field of value 27 g the atoms are contained in a roomtemperature vapor cell with antirelaxation coating on the walls theoretical analysis based on a tworegion model reproduces the experimental spectrum quite well this ability to have both bright and dark resonances promises applications in sub and superluminal propagation of light and sensitive magnetometry
|
[['we', 'demonstrateexperimentally', 'and', 'theoreticallythat', 'resonances', 'obtained', 'in', 'electromagnetically', 'induced', 'transparency', 'eit', 'can', 'be', 'both', 'bright', 'and', 'dark', 'the', 'experiments', 'are', 'done', 'using', 'magnetic', 'sublevels', 'of', 'a', 'hyperfine', 'transition', 'in', 'the', 'd_1', 'line', 'of', '87rb', 'the', 'degeneracy', 'of', 'the', 'sublevels', 'is', 'removed', 'by', 'having', 'a', 'magnetic', 'field', 'of', 'value', '27', 'g', 'the', 'atoms', 'are', 'contained', 'in', 'a', 'roomtemperature', 'vapor', 'cell', 'with', 'antirelaxation', 'coating', 'on', 'the', 'walls', 'theoretical', 'analysis', 'based', 'on', 'a', 'tworegion', 'model', 'reproduces', 'the', 'experimental', 'spectrum', 'quite', 'well', 'this', 'ability', 'to', 'have', 'both', 'bright', 'and', 'dark', 'resonances', 'promises', 'applications', 'in', 'sub', 'and', 'superluminal', 'propagation', 'of', 'light', 'and', 'sensitive', 'magnetometry']]
|
[-0.12194240498884591, 0.20005002795219345, -0.02390655796475632, 0.013877040159302889, -0.03314678132841267, -0.11089368075247585, 0.05885670296753308, 0.4483159081914376, -0.17788073512696728, -0.340093500931392, 0.03022374882910055, -0.2812732208289744, -0.04451098904666519, 0.19746904988465927, 0.009278213317246781, 0.026305755581130685, 0.05115323167140644, 0.006206272367973687, 0.012453599568917272, -0.14330187900779173, 0.2777252715829875, 0.005698722163119267, 0.2762636865498786, 0.10574200663946032, 0.06856230895764664, -0.06462402376298283, 0.07226387327824979, -0.015152511417328082, -0.11661877141144492, 0.10012013751283749, 0.20103063335229365, 0.036801624515084265, 0.17825817531358795, -0.428653645972462, -0.21949654569028465, 0.09293532136050005, 0.1581369026338432, 0.14393457867800422, -0.08463116965890315, -0.37363055482813995, 0.011900769359403356, -0.0695645737668173, -0.12170076396642733, -0.08714836548783422, -0.04587035336439887, 0.022006491948034345, -0.26076233297701656, 0.0632197569561258, 0.017543250720074267, 0.1021463652549446, -0.0839053156627246, -0.11257428922162381, -0.012116887222629847, 0.04132178398425278, -0.023511933992117567, 0.0017803411081087652, 0.19863112981805636, -0.1367777761806417, -0.10896762464550737, 0.41369286183383047, -0.16238668340932788, -0.08990596134945289, 0.15735577947709747, -0.1749391585823086, -0.0430629577046049, 0.1668052889368276, 0.11444540203731392, 0.1102523965636249, -0.10292194558057896, 0.07729006538914095, -0.03542432480386084, 0.16735819619648235, 0.13125295071747423, 0.07849560127372748, 0.23135356917094016, 0.17532127420417964, 0.0005977010311193994, 0.1198858689533585, -0.15701082348343484, -0.03958330778693108, -0.24979066746981488, -0.12676628713841676, -0.18256416358053684, 0.056496741534594795, -0.04565982641481204, -0.12529427348156028, 0.4071744093383403, 0.11583842761987417, 0.2105880112281626, -0.10557046406854366, 0.3455040511751989, 0.09053236386287458, 0.0613225099016173, 0.01646180443475311, 0.30720357200342047, 0.23426690299457573, 0.09279799598662816, -0.30048408089013595, 0.00419189551960408, -0.04991551340298401]
|
1,803.08747
|
Convolutions of Liouvillian Sequences
|
While Liouvillian sequences are closed under many operations, simple examples
show that they are not closed under convolution, and the same goes for
d'Alembertian sequences. Nevertheless, we show that d'Alembertian sequences are
closed under convolution with rationally d'Alembertian sequences, and that
Liouvillian sequences are closed under convolution with rationally Liouvillian
sequences.
|
cs.SC
|
while liouvillian sequences are closed under many operations simple examples show that they are not closed under convolution and the same goes for dalembertian sequences nevertheless we show that dalembertian sequences are closed under convolution with rationally dalembertian sequences and that liouvillian sequences are closed under convolution with rationally liouvillian sequences
|
[['while', 'liouvillian', 'sequences', 'are', 'closed', 'under', 'many', 'operations', 'simple', 'examples', 'show', 'that', 'they', 'are', 'not', 'closed', 'under', 'convolution', 'and', 'the', 'same', 'goes', 'for', 'dalembertian', 'sequences', 'nevertheless', 'we', 'show', 'that', 'dalembertian', 'sequences', 'are', 'closed', 'under', 'convolution', 'with', 'rationally', 'dalembertian', 'sequences', 'and', 'that', 'liouvillian', 'sequences', 'are', 'closed', 'under', 'convolution', 'with', 'rationally', 'liouvillian', 'sequences']]
|
[-0.18805201757041848, 0.16932715733042536, -0.06105979159474373, 0.16517845519325314, -0.022602783954318834, -0.17954538490477145, -0.0742491500306071, 0.5113025871562022, -0.3659603392668799, -0.13417023265113434, 0.09077971944512397, -0.26302399882571953, -0.24180286494540235, 0.3087202252856657, -0.1845944157125903, 0.07555476802529074, 0.1918662497317236, 0.1389723560754575, -0.10178152466074143, -0.2840751351459938, 0.3939992792027838, -0.12106859030238554, 0.19854189901083125, -0.06349542745681223, 0.10040678244595434, -0.015089895521454951, 0.057631763556570396, -0.018521052511299357, -0.06919332248299707, 0.032806389216406676, 0.23590382625001902, 0.1178901064045289, 0.24200330117680863, -0.46510205403262495, -0.1683373000545829, 0.14220719195573644, 0.20413463500638804, 0.013032567609722415, -0.011892621168026737, -0.2661232266794233, 0.151440650169902, -0.08336982855061982, -0.07621885312027206, -0.20734851747093833, 0.03579136678108982, 0.1398945204975248, -0.3110430783446075, -0.015714658387735777, 0.14176967845974014, 0.09052320180789512, -0.07027966532783181, -0.042097509856901916, 0.013620230971890338, 0.1625894553247182, 0.0667164507778544, -0.019151345890599723, 0.11536830980513318, -0.012449623542089089, -0.0750306058382871, 0.3068064808772475, -0.06218609706882168, -0.3559485428473529, 0.14082240634689144, -0.15743391193887768, -0.1749570076992991, 0.1893113381731525, -0.04523418540609818, 0.13727464977944015, -0.1879139217529811, 0.17727358248221742, -0.09087572444011183, 0.12009437623269417, 0.1776789292035734, 0.09125395100015928, 0.16132702652876282, -0.008954993230016792, 0.08688669770330593, 0.15247525183447436, 0.07196064841221361, -0.10064708544671827, -0.3465502431944889, -0.13060295195592678, -0.14637290284621948, 0.11306278977809045, -0.06935182930479356, -0.2635258594710453, 0.35829302332564894, -0.01404674121123903, 0.11505200684654947, 0.23184603640773133, 0.24645669305441426, 0.16513042734004557, 0.0768731044304064, 0.12783799461070813, 0.03356226733611787, 0.1374757572570268, -0.012408377817265835, -0.11698286447162722, -0.0105516490818677, 0.14215200704832873]
|
1,803.08748
|
Causality in Nonlocal Gravity
|
We study the causal structure of a class of weakly nonlocal gravitational
theories (eventually coupled to matter) that are compatible with perturbative
unitarity and finiteness at quantum level. In particular, we show that in
nonlocal quantum gravity a Shapiro's time advance never occurs. Moreover, we
provide a recipe to construct a general ultraviolet complete gravitational
theory coupled to matter (with or without supersymmetry) compatible with
causality. Therefore, nonlocal gravity is consistent with causality, as well as
string theory.
|
hep-th gr-qc
|
we study the causal structure of a class of weakly nonlocal gravitational theories eventually coupled to matter that are compatible with perturbative unitarity and finiteness at quantum level in particular we show that in nonlocal quantum gravity a shapiros time advance never occurs moreover we provide a recipe to construct a general ultraviolet complete gravitational theory coupled to matter with or without supersymmetry compatible with causality therefore nonlocal gravity is consistent with causality as well as string theory
|
[['we', 'study', 'the', 'causal', 'structure', 'of', 'a', 'class', 'of', 'weakly', 'nonlocal', 'gravitational', 'theories', 'eventually', 'coupled', 'to', 'matter', 'that', 'are', 'compatible', 'with', 'perturbative', 'unitarity', 'and', 'finiteness', 'at', 'quantum', 'level', 'in', 'particular', 'we', 'show', 'that', 'in', 'nonlocal', 'quantum', 'gravity', 'a', 'shapiros', 'time', 'advance', 'never', 'occurs', 'moreover', 'we', 'provide', 'a', 'recipe', 'to', 'construct', 'a', 'general', 'ultraviolet', 'complete', 'gravitational', 'theory', 'coupled', 'to', 'matter', 'with', 'or', 'without', 'supersymmetry', 'compatible', 'with', 'causality', 'therefore', 'nonlocal', 'gravity', 'is', 'consistent', 'with', 'causality', 'as', 'well', 'as', 'string', 'theory']]
|
[-0.12247832458561812, 0.16897418566095906, -0.11567079338531655, 0.11934977469410604, -0.12155966518016961, -0.19688589113931626, -0.017520074263955347, 0.3166425679929746, -0.2123639689376339, -0.26178541909216735, 0.04788686929700466, -0.26010632316749066, -0.16307823821150053, 0.13896433903704372, -0.05800401452833261, 0.059267872192252144, 0.011498711603239942, 0.0983595150580349, -0.09538694080084753, -0.2192269679493247, 0.3699801564574815, 0.05983947029707428, 0.1954180232535761, 0.04645564062640262, 0.09505233876645947, 0.005182146276824941, -0.00599203618744818, 0.10409843920467374, -0.1427135692906748, 0.0723703835008051, 0.23510342473403, 0.087772720039655, 0.20619076817857626, -0.4910952604781741, -0.2777551239541469, 0.08345733234324516, 0.06695359450382873, 0.19674408733725357, -0.04338377433417078, -0.2904399239147703, 0.08732547200261018, -0.17816796831977674, -0.16935446907957205, -0.09355970108523391, -0.032252611234211005, -0.09967692690985039, -0.2414489756793512, 0.1357546888011245, 0.01998158333112653, -0.002406824057778487, -0.022539238033529658, 0.036673475500160396, -0.024047085224316478, 0.018553802925639618, 0.03015783396609223, 0.050511997681520045, 0.09493459361748627, -0.1754008672821025, -0.14984019193798304, 0.39771564753773886, -0.1329643256866779, -0.1831636905628376, 0.2110521582982097, -0.16293263452079815, -0.19165089563466609, 0.060597153284992926, 0.10094841503394911, 0.12790714385352123, -0.15112173877349003, 0.16372393420225798, -0.02798957347822113, 0.16353703960059926, 0.081984537289454, 0.12794238471393235, 0.30067272971455866, 0.1149734002448475, 0.07423468201588361, 0.07786185305135754, 0.03824197775564897, -0.14015706418416438, -0.448163791344716, -0.1315641207381701, -0.09771406851061142, 0.10762603380657637, -0.0773550301836132, -0.20264475635037973, 0.2886170176311563, 0.142530652646644, 0.12374230913925342, 0.10953741021549855, 0.2260524036649328, 0.11981793485868436, 0.057840286097369895, 0.05818081831631179, 0.29195599068696493, 0.16889938222578701, 0.054213120572221205, -0.23300126185103393, -0.052366595540661365, 0.08396598563577311]
|
1,803.08749
|
Spherical 3-manifolds bounding rational homology balls
|
We give a complete classification of the spherical 3-manifolds that bound
smooth rational homology 4-balls. Furthermore, we determine the order of
spherical 3-manifolds in the rational homology cobordism group of rational
homology 3-spheres. To this end, we use constraints for 3-manifolds to bound
rational homology balls induced from Donaldson's diagonalization theorem and
Heegaard Floer correction terms.
|
math.GT
|
we give a complete classification of the spherical 3manifolds that bound smooth rational homology 4balls furthermore we determine the order of spherical 3manifolds in the rational homology cobordism group of rational homology 3spheres to this end we use constraints for 3manifolds to bound rational homology balls induced from donaldsons diagonalization theorem and heegaard floer correction terms
|
[['we', 'give', 'a', 'complete', 'classification', 'of', 'the', 'spherical', '3manifolds', 'that', 'bound', 'smooth', 'rational', 'homology', '4balls', 'furthermore', 'we', 'determine', 'the', 'order', 'of', 'spherical', '3manifolds', 'in', 'the', 'rational', 'homology', 'cobordism', 'group', 'of', 'rational', 'homology', '3spheres', 'to', 'this', 'end', 'we', 'use', 'constraints', 'for', '3manifolds', 'to', 'bound', 'rational', 'homology', 'balls', 'induced', 'from', 'donaldsons', 'diagonalization', 'theorem', 'and', 'heegaard', 'floer', 'correction', 'terms']]
|
[-0.2941049939254299, 0.013442438627992357, -0.20074510083733393, 0.17290215026878286, -0.13042120934863174, -0.19748152176284098, 0.021967928249588504, 0.2857413492997044, -0.31237808854452204, -0.28849694072934134, 0.05896545671982624, -0.2447656742297113, -0.21026743051437993, 0.12630239987213696, -0.26131497746142224, 0.005747156084648201, 0.10023848388144481, 0.08124440594942176, -0.15493801531764412, -0.3068646572729839, 0.4567646791360208, -0.08340463055563825, 0.12050822410466415, 0.22134198717373824, 0.09199216966018346, -0.026519304773371135, -0.011909256922081113, -0.03138451171772821, -0.3374870973520956, 0.1568806513096206, 0.3830334938996072, -0.08614780264906585, 0.04168880757476602, -0.4042798538825342, -0.04392393178672397, 0.2653312596459208, 0.15360867490692595, 0.00021152587890225862, -0.028847524447233548, -0.29271099543465035, 0.0909443749114871, -0.2102373351974945, -0.19110101262672938, -0.12672236751365876, -0.005991303910767394, 0.02116169181785413, -0.12870723930453615, -0.05538986094429025, 0.10311340916502688, 0.15467357620530361, -0.05559725350966411, -0.0820315567211115, -0.040227265330031514, 0.19627807155484334, 0.006654940345989806, 0.1051610137552156, 0.13765272114791774, -0.0724240579500994, -0.14599954590084963, 0.342713177071086, -0.08276286253281537, -0.30362109447430286, 0.057610053602339964, -0.09347988830995746, -0.29971331297253656, 0.24285592705876166, 0.04238173924386501, 0.19281116956179695, 0.0397030389867723, 0.2007949847019128, -0.10986633612109083, 0.08659603282077503, 0.12272701789957605, -0.09890102963462206, 0.12878537226268755, -0.0018782984864498889, 0.15921714063733816, 0.18028806366159447, -0.013385254889726639, -0.08741253709220993, -0.3013386359172208, -0.24327852729350394, -0.16600022168963083, 0.1958307741193234, -0.16263227194654714, -0.25632516011994866, 0.36956179344893564, -0.054125795199070126, 0.0740492535488946, 0.3183902137347364, 0.3303472928569785, -0.053202262231414874, 0.011787522101907857, 0.0402852712681384, 0.10459506766138864, 0.2300773757742718, -0.1197319118572133, -0.0904372380381184, -0.12479598022764549, 0.4200261624563219]
|
1,803.0875
|
Homogeneous symplectic 4-manifolds and finite dimensional Lie algebras
of symplectic vector fields on the symplectic 4-space
|
We classify the finite type (in the sense of E. Cartan theory of
prolongations) subalgebras $\mathfrak{h}\subset\mathfrak{sp}(V)$, where $V$ is
the symplectic 4-dimensional space, and show that they satisfy
$\mathfrak{h}^{(k)}=0$ for all $k>0$. Using this result, we reduce the problem
of classification of graded transitive finite-dimensional Lie algebras
$\mathfrak{g}$ of symplectic vector fields on $V$ to the description of graded
transitive finite-dimensional subalgebras of the full prolongations
$\mathfrak{p}_1^{(\infty)}$ and $\mathfrak{p}_2^{(\infty)}$, where
$\mathfrak{p}_1$ and $\mathfrak{p}_2$ are the maximal parabolic subalgebras of
$\mathfrak{sp}(V)$. We then classify all such
$\mathfrak{g}\subset\mathfrak{p}_i^{(\infty)}$, $i=1,2$, under some assumptions
and describe the associated homogeneous symplectic 4-manifolds
$(M=G/K,\omega)$. We prove that any reductive homogeneous symplectic manifold
(of any dimension) admits an invariant torsion free symplectic connection,
i.e., it is a homogeneous Fedosov manifold, and give conditions for uniqueness
of the Fedosov structure. Finally, we show that any nilpotent symplectic Lie
group (of any dimension) admits a natural invariant Fedosov structure which is
Ricci-flat.
|
math.DG hep-th math.SG
|
we classify the finite type in the sense of e cartan theory of prolongations subalgebras mathfrakhsubsetmathfrakspv where v is the symplectic 4dimensional space and show that they satisfy mathfrakhk0 for all k0 using this result we reduce the problem of classification of graded transitive finitedimensional lie algebras mathfrakg of symplectic vector fields on v to the description of graded transitive finitedimensional subalgebras of the full prolongations mathfrakp_1infty and mathfrakp_2infty where mathfrakp_1 and mathfrakp_2 are the maximal parabolic subalgebras of mathfrakspv we then classify all such mathfrakgsubsetmathfrakp_iinfty i12 under some assumptions and describe the associated homogeneous symplectic 4manifolds mgkomega we prove that any reductive homogeneous symplectic manifold of any dimension admits an invariant torsion free symplectic connection ie it is a homogeneous fedosov manifold and give conditions for uniqueness of the fedosov structure finally we show that any nilpotent symplectic lie group of any dimension admits a natural invariant fedosov structure which is ricciflat
|
[['we', 'classify', 'the', 'finite', 'type', 'in', 'the', 'sense', 'of', 'e', 'cartan', 'theory', 'of', 'prolongations', 'subalgebras', 'mathfrakhsubsetmathfrakspv', 'where', 'v', 'is', 'the', 'symplectic', '4dimensional', 'space', 'and', 'show', 'that', 'they', 'satisfy', 'mathfrakhk0', 'for', 'all', 'k0', 'using', 'this', 'result', 'we', 'reduce', 'the', 'problem', 'of', 'classification', 'of', 'graded', 'transitive', 'finitedimensional', 'lie', 'algebras', 'mathfrakg', 'of', 'symplectic', 'vector', 'fields', 'on', 'v', 'to', 'the', 'description', 'of', 'graded', 'transitive', 'finitedimensional', 'subalgebras', 'of', 'the', 'full', 'prolongations', 'mathfrakp_1infty', 'and', 'mathfrakp_2infty', 'where', 'mathfrakp_1', 'and', 'mathfrakp_2', 'are', 'the', 'maximal', 'parabolic', 'subalgebras', 'of', 'mathfrakspv', 'we', 'then', 'classify', 'all', 'such', 'mathfrakgsubsetmathfrakp_iinfty', 'i12', 'under', 'some', 'assumptions', 'and', 'describe', 'the', 'associated', 'homogeneous', 'symplectic', '4manifolds', 'mgkomega', 'we', 'prove', 'that', 'any', 'reductive', 'homogeneous', 'symplectic', 'manifold', 'of', 'any', 'dimension', 'admits', 'an', 'invariant', 'torsion', 'free', 'symplectic', 'connection', 'ie', 'it', 'is', 'a', 'homogeneous', 'fedosov', 'manifold', 'and', 'give', 'conditions', 'for', 'uniqueness', 'of', 'the', 'fedosov', 'structure', 'finally', 'we', 'show', 'that', 'any', 'nilpotent', 'symplectic', 'lie', 'group', 'of', 'any', 'dimension', 'admits', 'a', 'natural', 'invariant', 'fedosov', 'structure', 'which', 'is', 'ricciflat']]
|
[-0.22173763525400622, 0.0740599058894481, -0.05396863514518676, 0.06097101697135562, -0.19147496174264234, -0.1676522559654485, -0.060985061259998474, 0.363920854776451, -0.3377569757641241, -0.14292127317619613, 0.09490980397984256, -0.20213897468703282, -0.1764552404315004, 0.1484651200201673, -0.16737010532152555, -0.050564645094305485, 0.10392416221778451, 0.17848512171379602, -0.1741167015012858, -0.29135678747035043, 0.5046213017938297, -0.0813459092702639, 0.22812279928863669, 0.014582670133273091, 0.21442011764480007, -0.0018750691233435646, -0.0058202231464545345, 0.007589367881034074, -0.18070454987410914, 0.06775820380830232, 0.31146172237964087, 0.05727033567543711, 0.143957761798649, -0.35408396751800963, -0.12886231018476085, 0.25029272314148127, 0.1326019345595139, 0.012150730610301252, 0.009967910844554555, -0.3212205189888159, 0.14780165376012316, -0.16155069258982419, -0.19355655698260912, -0.1343440969455211, 0.07170990399511841, -0.03109264333680686, -0.21445611361155492, 0.017156927734807443, 0.16204076208668994, 0.13012008367352085, -0.12617304186763553, -0.06350115283698364, -0.10576019669598383, 0.05333407663177544, -0.06872821466499267, 0.012791253238295516, 0.09982402276040779, -0.03265246800179335, -0.15920771959402677, 0.4068353800943846, -0.043491333666881675, -0.32915155429186094, 0.10951046828672083, -0.1639559295015513, -0.19852862353501324, 0.10080488393497136, 0.0774015183657563, 0.14149130988516845, -0.0491532355752295, 0.26522601937621304, -0.14846649143287827, -0.012679224206496857, 0.0944119185911, -0.010950533566453183, 0.0668965060774806, 0.101689836598881, 0.1285578507102198, 0.04483349939174433, 0.06273509750988321, -0.0059349028678197, -0.39353765125593376, -0.2309485042044091, -0.05995308950433456, 0.2232318629895518, -0.1488444131289523, -0.18938163321905044, 0.39174618014173274, 0.03870477698122462, 0.17361002118559554, 0.12837977593961922, 0.17489882592215306, 0.0416815277260159, 0.05888609121191419, 0.11851106330767733, 0.1279163155262116, 0.2871125046480706, -0.08746016828647246, -0.15862468167647925, -0.12155374992936333, 0.20255750631784192]
|
1,803.08751
|
On a generalization of restricted sum formula for multiple zeta values
and finite multiple zeta values
|
We prove a new linear relation for multiple zeta values. This is a natural
generalization of the restricted sum formula proved by Eie, Liaw and Ong. We
also present an analogous result for finite multiple zeta values.
|
math.NT
|
we prove a new linear relation for multiple zeta values this is a natural generalization of the restricted sum formula proved by eie liaw and ong we also present an analogous result for finite multiple zeta values
|
[['we', 'prove', 'a', 'new', 'linear', 'relation', 'for', 'multiple', 'zeta', 'values', 'this', 'is', 'a', 'natural', 'generalization', 'of', 'the', 'restricted', 'sum', 'formula', 'proved', 'by', 'eie', 'liaw', 'and', 'ong', 'we', 'also', 'present', 'an', 'analogous', 'result', 'for', 'finite', 'multiple', 'zeta', 'values']]
|
[-0.17454370121295387, 0.07213204937107622, -0.11710219734625237, 0.11497621644741378, -0.10413974463134199, -0.13778457098413963, 0.08382408504021933, 0.27445256820804365, -0.2827996868526915, -0.22198903344168858, 0.03671614112131096, -0.17969307504795692, -0.20329672178706606, 0.26542579651986425, -0.09640825147161612, 0.07088532260496395, 0.034143757572196225, 0.029328456198846973, -0.06222713300706567, -0.23796748752529556, 0.3122520080037616, -0.018549881145559454, 0.22452162460398836, 0.09891873212984285, 0.09659806924645563, 0.08743967708653293, -0.04278928549909914, 0.0034905059414135444, -0.20091542898601777, 0.09682215790490846, 0.2488319496750026, 0.07356390781776123, 0.287734138760464, -0.3024481869478886, -0.18558839655707818, 0.11815949920816599, 0.11136277216310436, 0.03084699633355076, -0.012322982779477496, -0.21027127215387048, 0.14294279204379465, -0.24135513180816495, -0.12413878760275406, -0.07486376121036105, 0.06993538936650431, 0.01623384269407472, -0.3602201250960698, 0.062186227840012744, 0.09110438189393766, 0.10408448611859647, -0.10605552822124918, -0.18778191674248995, 0.08470723674808806, 0.06461301249628132, 0.0058042704744415505, 0.0223733113852103, -0.06815515575628425, -0.0533523462347787, -0.11100025142769555, 0.30775866274898117, -0.10940232518053539, -0.21839528762408206, 0.12159127354420521, -0.09347900039692586, -0.18774771158633805, 0.03333478629891131, 0.04092743580003042, 0.21909118156779456, -0.11954726593417896, 0.10444468870047934, -0.1854079020134098, 0.0816028925615388, 0.1729487821308745, -0.030430116451571922, 0.15464587913152786, 0.02230966671344799, 0.038772935047745705, 0.22357516650211168, -0.015143849056314778, -0.049289363549669854, -0.30564845039043576, -0.23257864004856832, -0.1812997693195939, 0.08936055535073015, -0.12729569404925584, -0.15765836512720263, 0.31486635635028015, 0.07967609469149564, 0.24257513066451694, 0.20900193319932833, 0.24010258359280792, 0.21578819848395683, 0.03969194075545749, 0.03740355275521005, 0.12196211973079354, 0.19482210410028897, 0.060027444231751804, -0.14304558112525154, 0.02547514741938259, 0.1873474620106454]
|
1,803.08752
|
On Weierstrass gaps at several points
|
We consider the problem of determining Weierstrass gaps and pure Weierstrass
gaps at several points. Using the notion of relative maximality in generalized
Weierstrass semigroups due to Delgado \cite{D}, we present a description of
these elements which generalizes the approach of Homma and Kim \cite{HK} given
for pairs. Through this description, we study the gaps and pure gaps at several
points on a certain family of curves with separated variables.
|
math.AG
|
we consider the problem of determining weierstrass gaps and pure weierstrass gaps at several points using the notion of relative maximality in generalized weierstrass semigroups due to delgado cited we present a description of these elements which generalizes the approach of homma and kim citehk given for pairs through this description we study the gaps and pure gaps at several points on a certain family of curves with separated variables
|
[['we', 'consider', 'the', 'problem', 'of', 'determining', 'weierstrass', 'gaps', 'and', 'pure', 'weierstrass', 'gaps', 'at', 'several', 'points', 'using', 'the', 'notion', 'of', 'relative', 'maximality', 'in', 'generalized', 'weierstrass', 'semigroups', 'due', 'to', 'delgado', 'cited', 'we', 'present', 'a', 'description', 'of', 'these', 'elements', 'which', 'generalizes', 'the', 'approach', 'of', 'homma', 'and', 'kim', 'citehk', 'given', 'for', 'pairs', 'through', 'this', 'description', 'we', 'study', 'the', 'gaps', 'and', 'pure', 'gaps', 'at', 'several', 'points', 'on', 'a', 'certain', 'family', 'of', 'curves', 'with', 'separated', 'variables']]
|
[-0.1379728170948616, 0.061870095711471375, -0.08623663523652847, 0.08658343267228887, -0.026000837538985237, -0.05893716025773598, 0.10008508294645319, 0.3126500272124574, -0.30824133684138255, -0.30655094280677, 0.05165852469803792, -0.31379656019904045, -0.11043244334396676, 0.21585112067776313, -0.0973026208255602, 0.052692150022240654, 0.043949431927393416, -0.025594953636544338, -0.1408903954712593, -0.24883923389226792, 0.4162336556051952, -0.022851168348426945, 0.2181493047138919, 0.05153996502791626, 0.053213101386538016, 0.04225911428153083, -0.06223893311360608, -0.014319290987391403, -0.20167869644280037, 0.16668107566268495, 0.28987951531830797, 0.051060434748027204, 0.22379863178492457, -0.35967680898265564, -0.1692067530627052, 0.16899557008097568, 0.06530418992042542, 0.060902615190834564, -0.009030189157625578, -0.23535496412196022, 0.09722303800568309, -0.14936365737863208, -0.16468525667121445, -0.06872228421000899, 0.018668016756250374, 0.04287223035699107, -0.2155164721813323, 0.0371309629223053, 0.10780845290487312, 0.1352324372805331, -0.0401006152421452, -0.14530465160698994, -0.005502233676531393, 0.048500005641709205, 0.013765167557985347, -0.02954696117144456, 0.002897973698766335, -0.0849504613324298, -0.14471277134304028, 0.34491734583507816, -0.050214682896773374, -0.18857570902268955, 0.17042627011466285, -0.11854184828648019, -0.10267077779154414, 0.10326562068708565, 0.12619537426887648, 0.163185460364743, -0.09032411683026863, 0.10655803484859053, -0.09577267851842486, 0.07744159416187608, 0.17541263278141833, 0.018358244250218075, 0.18988295833485713, 0.08914524183163176, 0.015118052676805983, 0.1413870283783805, -0.017570669914636274, -0.09837125286297954, -0.3568819761276245, -0.17300552648046744, -0.1604995324505844, 0.04694603082548449, -0.03370070741853535, -0.20577706130680398, 0.4828193698456322, 0.08986510131238164, 0.22105360066221244, 0.04213125028046847, 0.15815684631250906, 0.08896481782953808, 0.006086777052099722, 0.08955980007253263, 0.1343446204141862, 0.13947299292877965, 0.01713959577128939, -0.1635048007727533, 0.0022634955568482046, 0.14623941782106092]
|
1,803.08753
|
A violation of the Harris-Barghathi-Vojta criterion
|
In 1974, Harris proposed his celebrated criterion: Continuous phase
transitions in $d$-dimensional systems are stable against quenched spatial
randomness whenever $d\nu>2$, where $\nu$ is the clean critical exponent of the
correlation length. Forty years later, motivated by violations of the Harris
criterion for certain lattices such as Voronoi-Delaunay triangulations of
random point clouds, Barghathi and Vojta put forth a modified criterion for
topologically disordered systems: $a\nu >1$, where $a$ is the disorder decay
exponent, which measures how fast coordination number fluctuations decay with
increasing length scale. Here we present a topologically disordered lattice
with coordination number fluctuations that decay as slowly as those of
conventional uncorrelated randomness, but for which the universal behaviour is
preserved, hence violating even the modified criterion.
|
cond-mat.dis-nn
|
in 1974 harris proposed his celebrated criterion continuous phase transitions in ddimensional systems are stable against quenched spatial randomness whenever dnu2 where nu is the clean critical exponent of the correlation length forty years later motivated by violations of the harris criterion for certain lattices such as voronoidelaunay triangulations of random point clouds barghathi and vojta put forth a modified criterion for topologically disordered systems anu 1 where a is the disorder decay exponent which measures how fast coordination number fluctuations decay with increasing length scale here we present a topologically disordered lattice with coordination number fluctuations that decay as slowly as those of conventional uncorrelated randomness but for which the universal behaviour is preserved hence violating even the modified criterion
|
[['in', '1974', 'harris', 'proposed', 'his', 'celebrated', 'criterion', 'continuous', 'phase', 'transitions', 'in', 'ddimensional', 'systems', 'are', 'stable', 'against', 'quenched', 'spatial', 'randomness', 'whenever', 'dnu2', 'where', 'nu', 'is', 'the', 'clean', 'critical', 'exponent', 'of', 'the', 'correlation', 'length', 'forty', 'years', 'later', 'motivated', 'by', 'violations', 'of', 'the', 'harris', 'criterion', 'for', 'certain', 'lattices', 'such', 'as', 'voronoidelaunay', 'triangulations', 'of', 'random', 'point', 'clouds', 'barghathi', 'and', 'vojta', 'put', 'forth', 'a', 'modified', 'criterion', 'for', 'topologically', 'disordered', 'systems', 'anu', '1', 'where', 'a', 'is', 'the', 'disorder', 'decay', 'exponent', 'which', 'measures', 'how', 'fast', 'coordination', 'number', 'fluctuations', 'decay', 'with', 'increasing', 'length', 'scale', 'here', 'we', 'present', 'a', 'topologically', 'disordered', 'lattice', 'with', 'coordination', 'number', 'fluctuations', 'that', 'decay', 'as', 'slowly', 'as', 'those', 'of', 'conventional', 'uncorrelated', 'randomness', 'but', 'for', 'which', 'the', 'universal', 'behaviour', 'is', 'preserved', 'hence', 'violating', 'even', 'the', 'modified', 'criterion']]
|
[-0.17484862874496823, 0.2665049712087552, -0.08758303419365979, 0.10741992564793645, -0.01729875972529701, -0.2447056700729867, 0.09125463613465491, 0.27911859103126313, -0.2634531115533925, -0.21790817818220923, 0.09333856156518479, -0.27223352147188007, -0.14825091866909393, 0.15146722284560443, -0.02028029569729912, 0.09089350818799213, -0.020651067564060457, -0.0007734848264636112, -0.04777911123271812, -0.29065739194385143, 0.28987263091409404, 0.060521888558385, 0.31724235234281223, 0.02053586925387758, 0.003319529111902112, 0.03724044179074278, 0.010454249321512425, 0.05182212369297357, -0.18333635832792777, 0.004605521174038158, 0.17726293215606392, 0.04086041796713786, 0.23661654690640563, -0.36685261869130015, -0.22819515407484556, 0.1425939297749653, 0.14162300345135712, 0.09008412040230043, -0.019893198258423506, -0.3173092032015762, 0.09588338988011375, -0.12950173553721117, -0.16234034890731594, -0.05878940932237457, 0.10667105790759836, 0.02778601973168865, -0.28507177473609374, 0.11083582166519736, 0.10018539344187544, 0.11891999772256788, 0.015176697375894594, -0.06213975081439404, -0.005120193382271198, 0.08990149950107731, 0.05400105559623197, 0.05482468572484345, 0.12562488836819352, -0.08988282266596309, -0.11679497408874318, 0.3634831228204455, -0.02619611721548463, -0.17546944137067855, 0.18556420302738538, -0.13311897690540977, -0.15394266242916627, 0.1433156291883783, 0.10872958746089154, 0.07136932290902659, -0.10467142800550062, 0.07140015704633605, -0.054272055445912, 0.16500655104755424, 0.06712597288473063, 0.0971716268422442, 0.1801209762582884, 0.12550239386076123, 0.07827932238304879, 0.14050528291464165, -0.05302741550331732, -0.1593288831733668, -0.2704435683661649, -0.13254582982885987, -0.22538779867703423, 0.11989962794434499, -0.09957813396411576, -0.20162685800093313, 0.3215090441869713, 0.10403872977848314, 0.18329757822192266, 0.10002319751690854, 0.22361370246513051, 0.09648615704602836, 0.01954445817719112, 0.07918011799587735, 0.1961668296188836, 0.13121251994743943, 0.08944488251425263, -0.17511841102636286, 0.0691868608715717, 0.13515272746332177]
|
1,803.08754
|
Chance Constraints for Improving the Security of AC Optimal Power Flow
|
This paper presents a scalable method for improving the solutions of AC
Optimal Power Flow (AC OPF) with respect to deviations in predicted power
injections from wind and other uncertain generation resources. The focus of the
paper is on providing solutions that are more robust to short-term deviations,
and which optimize both the initial operating point and a parametrized response
policy for control during fluctuations. We formulate this as a
chance-constrained optimization problem. To obtain a tractable representation
of the chance constraints, we introduce a number of modelling assumptions and
leverage recent theoretical results to reformulate the problem as a convex,
second-order cone program, which is efficiently solvable even for large
instances. Our experiments demonstrate that the proposed procedure improves the
feasibility and cost performance of the OPF solution, while the additional
computation time is on the same magnitude as a single deterministic AC OPF
calculation.
|
cs.SY
|
this paper presents a scalable method for improving the solutions of ac optimal power flow ac opf with respect to deviations in predicted power injections from wind and other uncertain generation resources the focus of the paper is on providing solutions that are more robust to shortterm deviations and which optimize both the initial operating point and a parametrized response policy for control during fluctuations we formulate this as a chanceconstrained optimization problem to obtain a tractable representation of the chance constraints we introduce a number of modelling assumptions and leverage recent theoretical results to reformulate the problem as a convex secondorder cone program which is efficiently solvable even for large instances our experiments demonstrate that the proposed procedure improves the feasibility and cost performance of the opf solution while the additional computation time is on the same magnitude as a single deterministic ac opf calculation
|
[['this', 'paper', 'presents', 'a', 'scalable', 'method', 'for', 'improving', 'the', 'solutions', 'of', 'ac', 'optimal', 'power', 'flow', 'ac', 'opf', 'with', 'respect', 'to', 'deviations', 'in', 'predicted', 'power', 'injections', 'from', 'wind', 'and', 'other', 'uncertain', 'generation', 'resources', 'the', 'focus', 'of', 'the', 'paper', 'is', 'on', 'providing', 'solutions', 'that', 'are', 'more', 'robust', 'to', 'shortterm', 'deviations', 'and', 'which', 'optimize', 'both', 'the', 'initial', 'operating', 'point', 'and', 'a', 'parametrized', 'response', 'policy', 'for', 'control', 'during', 'fluctuations', 'we', 'formulate', 'this', 'as', 'a', 'chanceconstrained', 'optimization', 'problem', 'to', 'obtain', 'a', 'tractable', 'representation', 'of', 'the', 'chance', 'constraints', 'we', 'introduce', 'a', 'number', 'of', 'modelling', 'assumptions', 'and', 'leverage', 'recent', 'theoretical', 'results', 'to', 'reformulate', 'the', 'problem', 'as', 'a', 'convex', 'secondorder', 'cone', 'program', 'which', 'is', 'efficiently', 'solvable', 'even', 'for', 'large', 'instances', 'our', 'experiments', 'demonstrate', 'that', 'the', 'proposed', 'procedure', 'improves', 'the', 'feasibility', 'and', 'cost', 'performance', 'of', 'the', 'opf', 'solution', 'while', 'the', 'additional', 'computation', 'time', 'is', 'on', 'the', 'same', 'magnitude', 'as', 'a', 'single', 'deterministic', 'ac', 'opf', 'calculation']]
|
[-0.13028006122546423, -0.010480226231228611, -0.06488612187669089, 0.04689386791999337, -0.10814212473134881, -0.15909829480917997, 0.09070626568616917, 0.34244716719864576, -0.30359767117754444, -0.3290448303909315, 0.14431763163126674, -0.2632345441881924, -0.12247843441054264, 0.23524875143440824, -0.09133983645823382, 0.12635829393777434, 0.07689933752487987, -0.026153674393841257, -0.07219547837971046, -0.22519603686260492, 0.25671552214851245, 0.06176208307303182, 0.3012314647283048, 0.037592477834949345, 0.12120665731673984, -0.01001790436207993, 0.014901737465638004, 0.08460062086161176, -0.07563800241669388, 0.15618929926031716, 0.28011060478357114, 0.15880461115619704, 0.3209196213148024, -0.42996945917249135, -0.2110168428657806, 0.1150504911178085, 0.07953500532392055, 0.10732416695857752, -0.05661458633443395, -0.20589888752884652, 0.09774191472488009, -0.15449114459445573, -0.0742896830396765, -0.11619882484776772, -0.015211920142301346, 0.019882847375973216, -0.35106932122438944, 0.04508518491878034, 0.055649192579575395, 0.008106412409563758, -0.08397701877641352, -0.10374373125473726, 0.031016802429604307, 0.0885947480038676, 0.059841742788518025, 0.025551114173937742, 0.13035104225974925, -0.13502643500735395, -0.13897222079247337, 0.4033525127356183, -0.043219556540812124, -0.21238681585575797, 0.11770892113587525, -0.07605855634487042, -0.13298374369153626, 0.11733805709550386, 0.23957091982138332, 0.16053078162534903, -0.16037124607310158, 0.06296151590155603, -0.053739185381221445, 0.16514361939613853, 0.024797457440960388, 0.012476370819806033, 0.16616947461901974, 0.20325984712690115, 0.16929900305575296, 0.1860423190188307, -0.04614829044782697, -0.11050472687291976, -0.26997881834012494, -0.08264465491791345, -0.15812816725699358, 0.022414678258004868, -0.0758393717707854, -0.13706772084258598, 0.4336009454811375, 0.18891339973954815, 0.16755890214739189, 0.16926573592314675, 0.3809071049279189, 0.16844011853889193, 0.005731795847492471, 0.11891447647143003, 0.23484639505766433, 0.06417073855138294, 0.12443425566793662, -0.27219937653886794, 0.08675120878655285, 0.03583134722270786]
|
1,803.08755
|
Counting decomposable polynomials with integer coefficients
|
A polynomial over a ring is called decomposable if it is a composition of two
nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds
for the number of decomposable polynomials with integer coefficients of fixed
degree and bounded height. Moreover, we obtain asymptotic formulas for the
number of decomposable monic polynomials of even degree. For example, the
number of monic sextic integer polynomials which are decomposable and of height
at most $H$ is asymptotic to $(16\zeta(3)-5/4)H^3$ as $H \to \infty$.
|
math.NT
|
a polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials in this paper we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height moreover we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree for example the number of monic sextic integer polynomials which are decomposable and of height at most h is asymptotic to 16zeta354h3 as h to infty
|
[['a', 'polynomial', 'over', 'a', 'ring', 'is', 'called', 'decomposable', 'if', 'it', 'is', 'a', 'composition', 'of', 'two', 'nonlinear', 'polynomials', 'in', 'this', 'paper', 'we', 'obtain', 'sharp', 'lower', 'and', 'upper', 'bounds', 'for', 'the', 'number', 'of', 'decomposable', 'polynomials', 'with', 'integer', 'coefficients', 'of', 'fixed', 'degree', 'and', 'bounded', 'height', 'moreover', 'we', 'obtain', 'asymptotic', 'formulas', 'for', 'the', 'number', 'of', 'decomposable', 'monic', 'polynomials', 'of', 'even', 'degree', 'for', 'example', 'the', 'number', 'of', 'monic', 'sextic', 'integer', 'polynomials', 'which', 'are', 'decomposable', 'and', 'of', 'height', 'at', 'most', 'h', 'is', 'asymptotic', 'to', '16zeta354h3', 'as', 'h', 'to', 'infty']]
|
[-0.19158449569410393, 0.13290365801260964, -0.0331167667513577, -0.00584680341161424, -0.10784381586297347, -0.19810700398960673, -0.016550359553259956, 0.30582379687168615, -0.3313859890785818, -0.22226960281841457, 0.10548553633270785, -0.2430644088265736, -0.16805017044449724, 0.21669873976852835, -0.054948050669847315, 0.04079620163779842, -0.010368703739581311, 0.11392096682201798, -0.05710941340444928, -0.35724581532725475, 0.30885266714797516, -0.010312966604876081, 0.10555660530425064, 0.06107694948114818, 0.1198857682075624, -0.02144646820634967, 0.02558877959665729, -0.008476799285811623, -0.18538541961234153, 0.09330989587370579, 0.3022056316911447, 0.12820752003661742, 0.24408466931114473, -0.3267127251161671, -0.06255239815019616, 0.28067761805567254, 0.17397193430650343, 0.0025355792306250005, 0.02991106664398458, -0.14334205660696436, 0.11918367066125317, -0.12224037987045183, -0.22335096437302304, -0.06441701714676328, 0.07396064821358134, 0.0675589827616222, -0.3783690939407523, 0.013060979664371145, 0.1265487330397818, 0.16438186744749034, 0.02691601989961161, -0.22296708164361828, -0.03804437932558358, 0.024400047679636175, -0.03113943585705739, 0.0016870078383717777, -0.016697921619818704, -0.1261039960181068, -0.053027008580634506, 0.2932601450011134, -0.07019287550526603, -0.25592214355199805, 0.1044302470527771, -0.19865730394631986, -0.16740852709655174, 0.14913970306969998, 0.15314747842891915, 0.16793938324127983, -0.028214990695166153, 0.17558489412583253, -0.17210929561974253, 0.10818443170226202, 0.1708254714825804, 0.057181864443076096, 0.113961443543525, 0.01468618287954752, 0.11984798533127859, 0.22551739816099586, -0.0009689295732575218, -0.023393965099097754, -0.3262685951322499, -0.1752926639008631, -0.21694341102024403, 0.0829095224673837, -0.19956590699705595, -0.20401929095018337, 0.4220462472337048, 0.046026760405610975, 0.17948976784899104, 0.2032179972284655, 0.23609586886879874, 0.176269132290433, 0.009115594825366648, 0.08514708452630879, 0.09726902215582568, 0.22255751831320728, -0.03071968314925027, -0.139588278599038, 0.0955664006618374, 0.19588906455997282]
|
1,803.08756
|
On H\"{o}lder exponents of the self-similar functions
|
We study the class of affine self-similar and continuous on interval $[0;1]$
functions. Formulas for the H\"{o}lder exponents are obtained in terms of
self-similarity parameters.
|
math.FA
|
we study the class of affine selfsimilar and continuous on interval 01 functions formulas for the holder exponents are obtained in terms of selfsimilarity parameters
|
[['we', 'study', 'the', 'class', 'of', 'affine', 'selfsimilar', 'and', 'continuous', 'on', 'interval', '01', 'functions', 'formulas', 'for', 'the', 'holder', 'exponents', 'are', 'obtained', 'in', 'terms', 'of', 'selfsimilarity', 'parameters']]
|
[-0.11393735833466052, 0.10778975132852793, -0.023564428891986608, 0.1039929336309433, -0.046195523738861086, -0.06282493487000465, 0.026183521822094918, 0.40696120834443716, -0.297856485247612, -0.17074350953102113, 0.14428675311151892, -0.25727302446961403, -0.11563199123367668, 0.30612540647387504, -0.02141812452755403, 0.15849423673003912, -0.040354018695652485, 0.010000336244702339, -0.17874721232801677, -0.1809386361390352, 0.3751270841062069, -0.08757482022047043, 0.21453285604715347, -0.009437508136034011, 0.11986889682710171, -0.02701230052858591, -0.08097396586090326, 0.02478574391454458, -0.3064556720852852, 0.08314703464508057, 0.21848632097244264, 0.061632077731192114, 0.23624009236693383, -0.2880666469037533, -0.21694019373506307, 0.17229326896369457, 0.08975605389103293, -0.04679861605167389, 0.025639402135275303, -0.29245132088661197, 0.1298898023366928, -0.10787210877984763, -0.19321366719901562, -0.06261996306478977, 0.08206472778692842, 0.15614518775604666, -0.3226242311298847, 0.13140721801668406, 0.09064347289502621, 0.11680563379079104, -0.15754911137744784, -0.10741529226303101, -0.022372776437550784, 0.11345946546643973, 0.017388849928975107, -0.0023495232779532672, 0.10256188714876771, -0.08965694600716233, -0.12834059327840805, 0.31712547834962607, -0.04875230422243476, -0.2932284379005432, 0.129226288869977, -0.23677872352302073, -0.18473477927967907, 0.10095674246549606, 0.1842370154557284, 0.11612028583884239, -0.11833001639693976, 0.18160360291367397, -0.059954227823764084, 0.09881543941795826, 0.09542249714955688, 0.06021203457377851, 0.058059729635715485, 0.024157682564109564, 0.058946190178394316, 0.19481054842472076, 0.013238856131210923, -0.14015564743429423, -0.3958000457286835, -0.11054652318358421, -0.14420769572257996, 0.06602804079651832, -0.22979304924549068, -0.2301206003688276, 0.4365219334512949, 0.06639518536627292, 0.18073333885520695, 0.2355292447283864, 0.09995029300451279, 0.22805990811437368, -0.01836785726249218, 0.036289723273366686, 0.13998857853934168, 0.09075038962066173, 0.07323533965274692, -0.10849511794745922, 0.10661126483231782, 0.2011636260524392]
|
1,803.08757
|
Dissipative structures in magnetorotational turbulence
|
Via the process of accretion, magnetorotational turbulence removes energy
from a disk's orbital motion and transforms it into heat. Turbulent heating is
far from uniform and is usually concentrated in small regions of intense
dissipation, characterised by abrupt magnetic reconnection and higher
temperatures. These regions are of interest because they might generate
non-thermal emission, in the form of flares and energetic particles, or
thermally process solids in protoplanetary disks. Moreover, the nature of the
dissipation bears on the fundamental dynamics of the magnetorotational
instability (MRI) itself: local simulations indicate that the large-scale
properties of the turbulence (e.g. saturation levels, the stress-pressure
relationship) depend on the short dissipative scales. In this paper we
undertake a numerical study of how the MRI dissipates and the small-scale
dissipative structures it employs to do so. We use the Godunov code RAMSES and
unstratified compressible shearing boxes. Our simulations reveal that
dissipation is concentrated in ribbons of strong magnetic reconnection that are
significantly elongated in azimuth, up to a scale height. Dissipative
structures are hence meso-scale objects, and potentially provide a route by
which large scales and small scales interact. We go on to show how these
ribbons evolve over time --- forming, merging, breaking apart, and
disappearing. Finally, we reveal important couplings between the large-scale
density waves generated by the MRI and the small-scale structures, which may
illuminate the stress-pressure relationship in MRI turbulence.
|
astro-ph.HE
|
via the process of accretion magnetorotational turbulence removes energy from a disks orbital motion and transforms it into heat turbulent heating is far from uniform and is usually concentrated in small regions of intense dissipation characterised by abrupt magnetic reconnection and higher temperatures these regions are of interest because they might generate nonthermal emission in the form of flares and energetic particles or thermally process solids in protoplanetary disks moreover the nature of the dissipation bears on the fundamental dynamics of the magnetorotational instability mri itself local simulations indicate that the largescale properties of the turbulence eg saturation levels the stresspressure relationship depend on the short dissipative scales in this paper we undertake a numerical study of how the mri dissipates and the smallscale dissipative structures it employs to do so we use the godunov code ramses and unstratified compressible shearing boxes our simulations reveal that dissipation is concentrated in ribbons of strong magnetic reconnection that are significantly elongated in azimuth up to a scale height dissipative structures are hence mesoscale objects and potentially provide a route by which large scales and small scales interact we go on to show how these ribbons evolve over time forming merging breaking apart and disappearing finally we reveal important couplings between the largescale density waves generated by the mri and the smallscale structures which may illuminate the stresspressure relationship in mri turbulence
|
[['via', 'the', 'process', 'of', 'accretion', 'magnetorotational', 'turbulence', 'removes', 'energy', 'from', 'a', 'disks', 'orbital', 'motion', 'and', 'transforms', 'it', 'into', 'heat', 'turbulent', 'heating', 'is', 'far', 'from', 'uniform', 'and', 'is', 'usually', 'concentrated', 'in', 'small', 'regions', 'of', 'intense', 'dissipation', 'characterised', 'by', 'abrupt', 'magnetic', 'reconnection', 'and', 'higher', 'temperatures', 'these', 'regions', 'are', 'of', 'interest', 'because', 'they', 'might', 'generate', 'nonthermal', 'emission', 'in', 'the', 'form', 'of', 'flares', 'and', 'energetic', 'particles', 'or', 'thermally', 'process', 'solids', 'in', 'protoplanetary', 'disks', 'moreover', 'the', 'nature', 'of', 'the', 'dissipation', 'bears', 'on', 'the', 'fundamental', 'dynamics', 'of', 'the', 'magnetorotational', 'instability', 'mri', 'itself', 'local', 'simulations', 'indicate', 'that', 'the', 'largescale', 'properties', 'of', 'the', 'turbulence', 'eg', 'saturation', 'levels', 'the', 'stresspressure', 'relationship', 'depend', 'on', 'the', 'short', 'dissipative', 'scales', 'in', 'this', 'paper', 'we', 'undertake', 'a', 'numerical', 'study', 'of', 'how', 'the', 'mri', 'dissipates', 'and', 'the', 'smallscale', 'dissipative', 'structures', 'it', 'employs', 'to', 'do', 'so', 'we', 'use', 'the', 'godunov', 'code', 'ramses', 'and', 'unstratified', 'compressible', 'shearing', 'boxes', 'our', 'simulations', 'reveal', 'that', 'dissipation', 'is', 'concentrated', 'in', 'ribbons', 'of', 'strong', 'magnetic', 'reconnection', 'that', 'are', 'significantly', 'elongated', 'in', 'azimuth', 'up', 'to', 'a', 'scale', 'height', 'dissipative', 'structures', 'are', 'hence', 'mesoscale', 'objects', 'and', 'potentially', 'provide', 'a', 'route', 'by', 'which', 'large', 'scales', 'and', 'small', 'scales', 'interact', 'we', 'go', 'on', 'to', 'show', 'how', 'these', 'ribbons', 'evolve', 'over', 'time', 'forming', 'merging', 'breaking', 'apart', 'and', 'disappearing', 'finally', 'we', 'reveal', 'important', 'couplings', 'between', 'the', 'largescale', 'density', 'waves', 'generated', 'by', 'the', 'mri', 'and', 'the', 'smallscale', 'structures', 'which', 'may', 'illuminate', 'the', 'stresspressure', 'relationship', 'in', 'mri', 'turbulence']]
|
[-0.16027192317567537, 0.21484512041473364, -0.05732471908861568, 0.1150474445457962, -0.06763417994416437, -0.045707054748342225, -0.05277051165645055, 0.3639458158870907, -0.308038391430118, -0.3114638403718925, 0.07370380393186722, -0.23341953595968037, -0.10735151799310275, 0.21122159936930984, 0.032978273685167515, -0.0023988631135056114, 0.07454780517267999, -0.07852236349270354, 0.004267949092608071, -0.16830613616035234, 0.321152227137677, 0.12041562534340018, 0.22942374393701814, 0.01517071252750786, 0.05287637801914106, -0.13196017933240786, -0.033440933892234966, 0.036352248805448996, -0.17115139806391869, 0.0379216163195507, 0.1773498001545017, 0.03373258120246134, 0.2747049129763252, -0.5296503883993912, -0.2623481438307124, 0.018856975203176644, 0.20142477333074685, 0.08984164339612243, -0.04978649351465227, -0.2425641247648827, 0.07312879439516554, -0.12043336657481878, -0.06897898394142696, -0.07342078534715431, 0.02164274608252741, 0.04952416793157562, -0.2685577077567415, 0.158643378587399, 0.11477410139294349, 0.07160439755051808, -0.0904354279551769, -0.000501153054220122, -0.08152381504487295, 0.08863166019759715, 0.08148168839385131, 0.016938290019889717, 0.2307599954252176, -0.1762779488441266, -0.05852575973387986, 0.3678670789168001, -0.002193317235524102, -0.1502775328943514, 0.2773709195558242, -0.2139001407571072, -0.10234378959666368, 0.21411775774627467, 0.19747390131431522, 0.11119716519217401, -0.06573005575751764, 0.01763765451419025, -0.030629884173552707, 0.1586203758968813, 0.06160190935942088, 0.028742589666528474, 0.2910923298192109, 0.16281294289622536, 0.03517894785928512, 0.14828356861606581, -0.15355271720083422, -0.10843999501761033, -0.2591128875765803, -0.12908926310412194, -0.15028109448437282, 0.06678111678778344, -0.06254519666832319, -0.18684356434445618, 0.3575692262274811, 0.2018473412578226, 0.1924530015851668, -0.0195276710391858, 0.30505718212924476, 0.0731425298480561, 0.09468916076231407, 0.14873358473287465, 0.27268705871688226, 0.1469726411546438, 0.12934363869834267, -0.2454601358866327, 0.05648051980907284, 0.024235710104130306]
|
1,803.08758
|
Nilspace factors for general uniformity seminorms, cubic exchangeability
and limits
|
We study a class of measure-theoretic objects that we call cubic couplings,
on which there is a common generalization of the Gowers norms and the Host-Kra
seminorms. Our main result yields a complete structural description of cubic
couplings, using nilspaces. We give three applications. Firstly, we describe
the characteristic factors of Host-Kra type seminorms for measure-preserving
actions of countable nilpotent groups. This yields an extension of the
structure theorem of Host and Kra. Secondly, we characterize sequences of
random variables with a property that we call cubic exchangeability. These are
sequences indexed by the infinite discrete cube, such that for every integer
$k\geq 0$ the joint distribution's marginals on affine subcubes of dimension
$k$ are all equal. In particular, our result gives a description, in terms of
compact nilspaces, of a related exchangeability property considered by Austin,
inspired by a problem of Aldous. Finally, using nilspaces we obtain limit
objects for sequences of functions on compact abelian groups (more generally on
compact nilspaces) such that the densities of certain patterns in these
functions converge. The paper thus proposes a measure-theoretic framework on
which the area of higher-order Fourier analysis can be based, and which yields
new applications of this area in a unified way in ergodic theory and arithmetic
combinatorics.
|
math.DS math.CO math.PR
|
we study a class of measuretheoretic objects that we call cubic couplings on which there is a common generalization of the gowers norms and the hostkra seminorms our main result yields a complete structural description of cubic couplings using nilspaces we give three applications firstly we describe the characteristic factors of hostkra type seminorms for measurepreserving actions of countable nilpotent groups this yields an extension of the structure theorem of host and kra secondly we characterize sequences of random variables with a property that we call cubic exchangeability these are sequences indexed by the infinite discrete cube such that for every integer kgeq 0 the joint distributions marginals on affine subcubes of dimension k are all equal in particular our result gives a description in terms of compact nilspaces of a related exchangeability property considered by austin inspired by a problem of aldous finally using nilspaces we obtain limit objects for sequences of functions on compact abelian groups more generally on compact nilspaces such that the densities of certain patterns in these functions converge the paper thus proposes a measuretheoretic framework on which the area of higherorder fourier analysis can be based and which yields new applications of this area in a unified way in ergodic theory and arithmetic combinatorics
|
[['we', 'study', 'a', 'class', 'of', 'measuretheoretic', 'objects', 'that', 'we', 'call', 'cubic', 'couplings', 'on', 'which', 'there', 'is', 'a', 'common', 'generalization', 'of', 'the', 'gowers', 'norms', 'and', 'the', 'hostkra', 'seminorms', 'our', 'main', 'result', 'yields', 'a', 'complete', 'structural', 'description', 'of', 'cubic', 'couplings', 'using', 'nilspaces', 'we', 'give', 'three', 'applications', 'firstly', 'we', 'describe', 'the', 'characteristic', 'factors', 'of', 'hostkra', 'type', 'seminorms', 'for', 'measurepreserving', 'actions', 'of', 'countable', 'nilpotent', 'groups', 'this', 'yields', 'an', 'extension', 'of', 'the', 'structure', 'theorem', 'of', 'host', 'and', 'kra', 'secondly', 'we', 'characterize', 'sequences', 'of', 'random', 'variables', 'with', 'a', 'property', 'that', 'we', 'call', 'cubic', 'exchangeability', 'these', 'are', 'sequences', 'indexed', 'by', 'the', 'infinite', 'discrete', 'cube', 'such', 'that', 'for', 'every', 'integer', 'kgeq', '0', 'the', 'joint', 'distributions', 'marginals', 'on', 'affine', 'subcubes', 'of', 'dimension', 'k', 'are', 'all', 'equal', 'in', 'particular', 'our', 'result', 'gives', 'a', 'description', 'in', 'terms', 'of', 'compact', 'nilspaces', 'of', 'a', 'related', 'exchangeability', 'property', 'considered', 'by', 'austin', 'inspired', 'by', 'a', 'problem', 'of', 'aldous', 'finally', 'using', 'nilspaces', 'we', 'obtain', 'limit', 'objects', 'for', 'sequences', 'of', 'functions', 'on', 'compact', 'abelian', 'groups', 'more', 'generally', 'on', 'compact', 'nilspaces', 'such', 'that', 'the', 'densities', 'of', 'certain', 'patterns', 'in', 'these', 'functions', 'converge', 'the', 'paper', 'thus', 'proposes', 'a', 'measuretheoretic', 'framework', 'on', 'which', 'the', 'area', 'of', 'higherorder', 'fourier', 'analysis', 'can', 'be', 'based', 'and', 'which', 'yields', 'new', 'applications', 'of', 'this', 'area', 'in', 'a', 'unified', 'way', 'in', 'ergodic', 'theory', 'and', 'arithmetic', 'combinatorics']]
|
[-0.1315315532880569, 0.10984048247843194, -0.11758866402364912, 0.09244334947794587, -0.07226275529135906, -0.08732495327879275, 0.05167157248859959, 0.35308315353911546, -0.275932052256983, -0.21578632831750882, 0.10660255519906059, -0.2429896088272688, -0.18629346093539859, 0.20433586885670332, -0.13958155089057983, 0.008438988322658198, 0.02908625445367458, 0.056790795336876594, -0.0751550300390504, -0.268169706158473, 0.3803677974069225, -0.05045445470937661, 0.22770139280750992, 0.03529341443486157, 0.11282807578155328, 0.04944663388166754, -0.037664322025098264, 0.03577070315590217, -0.16915792403479352, 0.17664929731233445, 0.26235969891062094, 0.12042440423143229, 0.25124458929945137, -0.34733502372276104, -0.18883928247128745, 0.15771254871617116, 0.09273953332809642, 0.04301916238064656, -0.05543824895486025, -0.28332493391686253, 0.11810880963956671, -0.15043201281888677, -0.138471335161566, -0.11049143273072938, 0.03253963209599966, 0.05965857712906741, -0.26836604678787157, 0.044528483397637805, 0.16694611463074882, 0.09198937555809694, -0.06239831587964935, -0.1152252338092824, 0.021816414405059603, 0.09294064395029895, -0.0043021483313558356, 0.01187786848528222, 0.06428003218218994, -0.050114963336714675, -0.1638916353861402, 0.3668261552695185, -0.05500641569101607, -0.22814548884163655, 0.17972042372095443, -0.13855869944118673, -0.23490123323031833, 0.10170837119914636, 0.15771534217610245, 0.15831026813192736, -0.11043693489821939, 0.15941587235179863, -0.1340906268961373, 0.12171843098920015, 0.10144638321473308, 0.07326709551381923, 0.13919454715658156, 0.12172955033435885, 0.1022546421492561, 0.16650271764014005, 0.01735718608889285, -0.06594315117025482, -0.328177266228678, -0.15529991092736878, -0.16611357305941749, 0.10403680950347778, -0.13688095198650402, -0.20898418081702574, 0.38850379196838253, 0.09627830684739387, 0.16215224768744693, 0.14984742737474985, 0.1951111034706368, 0.08986608452784518, 0.037485103683346614, 0.05411089419697722, 0.09068801638758964, 0.18151353236199136, -0.012109789542765134, -0.11028038422699042, 0.029769774419920784, 0.17976386088966614]
|
1,803.08759
|
Lower bounds for the first eigenvalue of the Steklov problem on graphs
|
We give lower bounds for the first non-zero Steklov eigenvalue on connected
graphs. These bounds depend on the extrinsic diameter of the boundary and not
on the diameter of the graph. We obtain a lower bound which is sharp when the
cardinal of the boundary is 2, and asymptotically sharp as the diameter of the
boundary tends to infinity in the other cases. We also investigate the case of
weigthed graphs and compare our result to the Cheeger inequality.
|
math.SP
|
we give lower bounds for the first nonzero steklov eigenvalue on connected graphs these bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph we obtain a lower bound which is sharp when the cardinal of the boundary is 2 and asymptotically sharp as the diameter of the boundary tends to infinity in the other cases we also investigate the case of weigthed graphs and compare our result to the cheeger inequality
|
[['we', 'give', 'lower', 'bounds', 'for', 'the', 'first', 'nonzero', 'steklov', 'eigenvalue', 'on', 'connected', 'graphs', 'these', 'bounds', 'depend', 'on', 'the', 'extrinsic', 'diameter', 'of', 'the', 'boundary', 'and', 'not', 'on', 'the', 'diameter', 'of', 'the', 'graph', 'we', 'obtain', 'a', 'lower', 'bound', 'which', 'is', 'sharp', 'when', 'the', 'cardinal', 'of', 'the', 'boundary', 'is', '2', 'and', 'asymptotically', 'sharp', 'as', 'the', 'diameter', 'of', 'the', 'boundary', 'tends', 'to', 'infinity', 'in', 'the', 'other', 'cases', 'we', 'also', 'investigate', 'the', 'case', 'of', 'weigthed', 'graphs', 'and', 'compare', 'our', 'result', 'to', 'the', 'cheeger', 'inequality']]
|
[-0.12943522879099356, 0.10012545857484205, -0.05793685673535624, 0.06668536034059015, -0.09559650933723661, -0.13327709158080853, 0.035802895116289674, 0.3182787148965688, -0.22295023204428674, -0.305086006068542, 0.18038776153963815, -0.310463135731937, -0.12092040803377764, 0.19081130132220592, -0.10673678513097612, 0.04388156290390069, 0.043070297487834586, 0.13844765755760519, -0.025460098369807428, -0.2544251250982125, 0.3729163342261616, 0.0009736731159206056, 0.22566916256011288, 0.19908778890495812, 0.02119383146718168, -0.056027020492791374, 0.02728274441029452, 0.03317861777563676, -0.2841108459271962, 0.15201784437522292, 0.16860729427654533, 0.06610179905296315, 0.1963315098251723, -0.39889647828155683, -0.1373788097790808, 0.14773961718347442, 0.10923402087432862, 0.05951808389906972, 0.055075463993604516, -0.26225960747150207, 0.10013174140660823, -0.033873074416872824, -0.1447746344146472, 0.01052325928607319, 0.011999474070624365, 0.01656102252346051, -0.2533510462852501, 0.07496908105153861, 0.1354134494933901, -0.009204257904445822, -0.07562562528573259, -0.18838747293700145, -0.0032750333503148033, 0.1456636866732188, 0.03204287987650384, -0.018068159715260698, 0.035256686585047575, -0.09124082121762293, -0.08583911981056386, 0.2932514965333799, -0.08662876260431507, -0.22219442814305612, 0.17163680485579408, -0.19919650102199254, -0.1254760540338068, 0.05247380539975306, 0.18997595456865016, 0.18852262697005762, -0.030909577783387262, 0.12761103253166156, -0.0823255322764545, 0.11125905844795553, 0.13356058852440572, 0.03244629139198533, 0.045391317893149735, 0.11927925166084513, 0.24965175188771344, 0.22253598314135253, -0.07748397570574962, -0.022158622647388073, -0.3677356390258934, -0.15700002021489287, -0.2597006339626976, 0.07534163025862838, -0.22541160543122818, -0.22703112722846056, 0.36523540176545516, 0.1005647931648772, 0.22710471206545074, 0.15594533003448166, 0.2556817164715332, 0.12014648430874642, 0.038316300020942204, 0.14825040129708905, 0.2590125784266127, 0.1966579485731789, 0.036984072921538276, -0.18883320930873668, 0.06238315316046812, 0.12458279784886708]
|
1,803.0876
|
Role of maximally entangled states in the context of linear steering
inequalities
|
Linear steering inequalities are useful to check whether a bipartite state is
steerable when both the parties are allowed to perform $n$ dichotomic
measurements on their parts. In the present study we propose the necessary and
sufficient condition under which $2$-settings linear steering inequality will
be violated for any given set of spin-$\frac{1}{2}$ observables at trusted and
untrusted parties' sides. The important result revealed by the present paper is
that maximally entangled two-qubit states give the largest quantum violations
of $2$-settings as well as $3$-settings linear steering inequalities attainable
for any given set of spin-$\frac{1}{2}$ observables at trusted and untrusted
parties' sides (if any violation exists for that given set of
spin-$\frac{1}{2}$ observables).
|
quant-ph
|
linear steering inequalities are useful to check whether a bipartite state is steerable when both the parties are allowed to perform n dichotomic measurements on their parts in the present study we propose the necessary and sufficient condition under which 2settings linear steering inequality will be violated for any given set of spinfrac12 observables at trusted and untrusted parties sides the important result revealed by the present paper is that maximally entangled twoqubit states give the largest quantum violations of 2settings as well as 3settings linear steering inequalities attainable for any given set of spinfrac12 observables at trusted and untrusted parties sides if any violation exists for that given set of spinfrac12 observables
|
[['linear', 'steering', 'inequalities', 'are', 'useful', 'to', 'check', 'whether', 'a', 'bipartite', 'state', 'is', 'steerable', 'when', 'both', 'the', 'parties', 'are', 'allowed', 'to', 'perform', 'n', 'dichotomic', 'measurements', 'on', 'their', 'parts', 'in', 'the', 'present', 'study', 'we', 'propose', 'the', 'necessary', 'and', 'sufficient', 'condition', 'under', 'which', '2settings', 'linear', 'steering', 'inequality', 'will', 'be', 'violated', 'for', 'any', 'given', 'set', 'of', 'spinfrac12', 'observables', 'at', 'trusted', 'and', 'untrusted', 'parties', 'sides', 'the', 'important', 'result', 'revealed', 'by', 'the', 'present', 'paper', 'is', 'that', 'maximally', 'entangled', 'twoqubit', 'states', 'give', 'the', 'largest', 'quantum', 'violations', 'of', '2settings', 'as', 'well', 'as', '3settings', 'linear', 'steering', 'inequalities', 'attainable', 'for', 'any', 'given', 'set', 'of', 'spinfrac12', 'observables', 'at', 'trusted', 'and', 'untrusted', 'parties', 'sides', 'if', 'any', 'violation', 'exists', 'for', 'that', 'given', 'set', 'of', 'spinfrac12', 'observables']]
|
[-0.170693005002769, 0.15896233017390063, -0.02326233160316146, 0.05775039103588954, -0.04742689200377624, -0.3384525094172984, 0.05767741398241404, 0.3020841027942619, -0.21754032285285316, -0.2586814806064857, 0.08854899949905562, -0.29769714419879684, -0.040814999792408865, 0.18289557249850727, -0.014412348424749715, 0.13186838345180668, 0.08260354841019892, 0.05736802746209183, -0.045695954291399436, -0.2778141946099432, 0.35158597705386846, -0.014756805368441357, 0.2405433985155209, 0.06785246236488872, 0.10945053568658684, 0.06929946126183495, 0.06742841087439697, 0.024503717207283313, -0.11767738493407316, 0.07320941165328675, 0.3025627890185985, 0.20064065713086165, 0.23742526605825073, -0.4280677559852068, -0.07917241032451525, 0.202614776012654, 0.0770393494208942, 0.12110101755388314, 0.0055630374772590585, -0.35326907316422357, 0.020226115294333016, -0.14520925823931716, -0.13914925452887214, -0.1455767439495373, 0.008151758940324985, -0.03850396146507202, -0.348239489648092, 0.12247042709038526, 0.031322070171362223, 0.06151626211898734, 0.04363829338191343, -0.0443592973460909, 0.0007214476811766092, 0.14650145146385643, -0.058989854824696, -0.027704690980109654, 0.11127422762053486, -0.050454698311763684, -0.19394867117391965, 0.3472555162193852, 0.03697273955497492, -0.25568907697951154, 0.11989499584784166, -0.17413918899754727, -0.17718443951369928, -0.03866312860295044, 0.16026765298530726, 0.09112263240487144, -0.15543583291439841, 0.05009116943568058, -0.1373360997531563, 0.22178579813667706, 0.07307733960416433, 0.1428739183174912, 0.18970021095135184, 0.014975968600733072, 0.16766824088075996, 0.20858821404336986, 0.005132504522667399, -0.0627710995738328, -0.4205255719467199, -0.16471924043227254, -0.26148131978698075, 0.08231037423580087, -0.08332302486983931, -0.07521228279386248, 0.3285309074729282, 0.0917007588369805, 0.12794386020894827, 0.03336198063646277, 0.2919252668871195, 0.059153803303940676, 0.02122518683609087, 0.1439281945183341, 0.2557751990264348, 0.13119411913586582, 0.043122907115113254, -0.18951238757082528, 0.1675395238188295, 0.019044739071562487]
|
1,803.08761
|
Front evolution of the Fredrickson-Andersen one spin facilitated model
|
The Fredrickson-Andersen one spin facilitated model (FA-1f) on Z belongs to
the class of kinetically constrained spin models (KCM). Each site refreshes
with rate one its occupation variable to empty (respectively occupied) with
probability q (respectively $p = 1 - q$), provided at least one nearest
neighbor is empty. Here, we study the non equilibrium dynamics of FA-1f started
from a configuration entirely occupied on the left half-line and focus on the
evolution of the front, namely the position of the leftmost zero. We prove, for
q larger than a threshold $\bar{q} < 1$, a law of large numbers and a central
limit theorem for the front, as well as the convergence to an invariant measure
of the law of the process seen from the front.
|
math.PR
|
the fredricksonandersen one spin facilitated model fa1f on z belongs to the class of kinetically constrained spin models kcm each site refreshes with rate one its occupation variable to empty respectively occupied with probability q respectively p 1 q provided at least one nearest neighbor is empty here we study the non equilibrium dynamics of fa1f started from a configuration entirely occupied on the left halfline and focus on the evolution of the front namely the position of the leftmost zero we prove for q larger than a threshold barq 1 a law of large numbers and a central limit theorem for the front as well as the convergence to an invariant measure of the law of the process seen from the front
|
[['the', 'fredricksonandersen', 'one', 'spin', 'facilitated', 'model', 'fa1f', 'on', 'z', 'belongs', 'to', 'the', 'class', 'of', 'kinetically', 'constrained', 'spin', 'models', 'kcm', 'each', 'site', 'refreshes', 'with', 'rate', 'one', 'its', 'occupation', 'variable', 'to', 'empty', 'respectively', 'occupied', 'with', 'probability', 'q', 'respectively', 'p', '1', 'q', 'provided', 'at', 'least', 'one', 'nearest', 'neighbor', 'is', 'empty', 'here', 'we', 'study', 'the', 'non', 'equilibrium', 'dynamics', 'of', 'fa1f', 'started', 'from', 'a', 'configuration', 'entirely', 'occupied', 'on', 'the', 'left', 'halfline', 'and', 'focus', 'on', 'the', 'evolution', 'of', 'the', 'front', 'namely', 'the', 'position', 'of', 'the', 'leftmost', 'zero', 'we', 'prove', 'for', 'q', 'larger', 'than', 'a', 'threshold', 'barq', '1', 'a', 'law', 'of', 'large', 'numbers', 'and', 'a', 'central', 'limit', 'theorem', 'for', 'the', 'front', 'as', 'well', 'as', 'the', 'convergence', 'to', 'an', 'invariant', 'measure', 'of', 'the', 'law', 'of', 'the', 'process', 'seen', 'from', 'the', 'front']]
|
[-0.11523513275584797, 0.15432266950357906, -0.04367730370533418, 0.057486151076825, -0.007600557944941811, -0.18735744462280376, 0.10143582817598633, 0.3062309561887892, -0.28422399545542715, -0.22217125563723286, 0.0999789028371707, -0.31199716912900527, -0.038355443668286734, 0.12328366354312294, 0.03082649055035497, -0.00017291693654804816, -0.006537902914744809, 0.10717571951539778, -0.017029915160189073, -0.20690240427128576, 0.31226552565150506, 0.02188727321582127, 0.21674277189536004, -0.0022791451017364736, 0.1257929735158275, 0.03595489978873572, 0.017149436893320182, -0.011204543334197223, -0.15921982467113957, 0.06479743874169946, 0.13504673429610178, 0.07518262344382219, 0.29296359162383934, -0.35488399500746615, -0.1298971170184725, 0.1160010315508135, 0.14603570134689411, 0.06157210697154931, -0.006632414397052906, -0.25484041946871977, 0.07875332446784024, -0.18104252096538137, -0.20599176533277927, 0.04928145331531248, 0.06016961077788496, 0.043641331179703514, -0.26213574182333016, 0.09495658562916172, 0.08867213784289221, 0.007270247902630306, -0.036038128601394714, -0.15077369189177586, -0.09430467039233119, 0.10918415380202658, 0.028232503766373814, 0.07210365594061834, 0.12558682641105318, -0.1287689334031467, -0.11339245450860874, 0.3723231464760696, -0.06228860407725556, -0.17885198473657776, 0.17819154828908, -0.22916890867196432, -0.12995966515935412, 0.142962969809286, 0.1396395432785517, 0.15301480956200028, -0.06728014833392287, 0.1162783786554147, -0.021032069515383885, 0.15078115661636116, 0.05335004263504491, -0.012803901755440284, 0.21135463575431243, 0.16365617410302524, 0.10775028888469304, 0.13715332348990003, -0.11251996330182423, -0.13631447131283642, -0.2990044489998855, -0.13157029158806777, -0.2230849603391669, 0.08367302844478802, -0.08027414733338609, -0.1518417615140599, 0.3710504674572286, 0.08899303199344777, 0.2320409601069684, 0.07291245231086887, 0.23750638866388216, 0.1331331602059214, 0.028792329561306028, 0.07864086046375758, 0.17712875395044078, 0.12803969611754504, 0.06105498126821547, -0.19378395444274374, 0.05270885306266629, 0.09903679663936298]
|
1,803.08762
|
Analysis of Wallace's Proof of the Born Rule in Everettian Quantum
Mechanics II: Concepts and Axioms
|
Having analyzed the formal aspects of Wallace's proof of the Born rule, we
now discuss the concepts and axioms upon which it is built. Justification for
most axioms is shown to be problematic, and at times contradictory. Some of the
problems are caused by ambiguities in the concepts used. We conclude the axioms
are not reasonable enough to be taken as mandates of rationality in Everettian
Quantum Mechanics. This invalidates the interpretation of Wallace's result as
meaning it would be rational for Everettian agents to decide using the Born
rule.
|
quant-ph
|
having analyzed the formal aspects of wallaces proof of the born rule we now discuss the concepts and axioms upon which it is built justification for most axioms is shown to be problematic and at times contradictory some of the problems are caused by ambiguities in the concepts used we conclude the axioms are not reasonable enough to be taken as mandates of rationality in everettian quantum mechanics this invalidates the interpretation of wallaces result as meaning it would be rational for everettian agents to decide using the born rule
|
[['having', 'analyzed', 'the', 'formal', 'aspects', 'of', 'wallaces', 'proof', 'of', 'the', 'born', 'rule', 'we', 'now', 'discuss', 'the', 'concepts', 'and', 'axioms', 'upon', 'which', 'it', 'is', 'built', 'justification', 'for', 'most', 'axioms', 'is', 'shown', 'to', 'be', 'problematic', 'and', 'at', 'times', 'contradictory', 'some', 'of', 'the', 'problems', 'are', 'caused', 'by', 'ambiguities', 'in', 'the', 'concepts', 'used', 'we', 'conclude', 'the', 'axioms', 'are', 'not', 'reasonable', 'enough', 'to', 'be', 'taken', 'as', 'mandates', 'of', 'rationality', 'in', 'everettian', 'quantum', 'mechanics', 'this', 'invalidates', 'the', 'interpretation', 'of', 'wallaces', 'result', 'as', 'meaning', 'it', 'would', 'be', 'rational', 'for', 'everettian', 'agents', 'to', 'decide', 'using', 'the', 'born', 'rule']]
|
[-0.058815657718676244, 0.07365304907369945, -0.1597945848117686, 0.16113108604137474, -0.13723315993944804, -0.15201388102852637, 0.10151437339631633, 0.3158719717214505, -0.2729286659677099, -0.28040923511402477, 0.10282384655567714, -0.22809596909210086, -0.13500249650743273, 0.1826636793402334, -0.14163059837495287, 0.014565805454427998, 0.03755908548418019, 0.06082878811802301, -0.03705752204793195, -0.2722256381685535, 0.3240698105487455, 0.06150917266366175, 0.2330400424492028, 0.09304779117099113, 0.09929492545003692, 0.008408958366554644, -0.05226278032641858, 0.06088978144883488, -0.09435801020202537, 0.07942193705174658, 0.3107179099512804, 0.21618831437081099, 0.2867281179047293, -0.4783173784199688, -0.15014899461012748, 0.07461185902874502, 0.08514752809682655, 0.10540440424423043, 0.06860500865926346, -0.28294841113189856, 0.09410026776475004, -0.16653168144532376, -0.17860880608463453, -0.11028498051067194, 0.019424414867535232, -0.023926065634522174, -0.21238236266395283, 0.02363468593814307, 0.12247546220605728, 0.058684899875273304, -0.04814104595894201, -0.12163115209485921, 0.0550466690147813, 0.09550215114011533, 0.0825480610352113, 0.00349022442371481, 0.116178533848789, -0.09686041011526766, -0.15531671760189864, 0.43123020343482493, 0.051804074893395106, -0.20064394881741868, 0.17320296271807617, -0.0866022384673771, -0.18334693965605564, 0.08111191432431547, 0.008108423215647538, 0.0805769561479489, -0.1639941835569011, 0.0571551713355196, -0.039404903714441594, 0.13484031719595402, 0.10856867387062974, 0.0707282868731353, 0.24764939653169776, 0.10871079224420505, -0.031313663508950006, 0.05303141406038776, 0.04289579864901801, -0.14990140372990735, -0.36455534330258765, -0.14659731589361197, -0.1646089666005638, 0.06954378225184175, -0.016309928772130257, -0.15157692586686203, 0.2758075208700676, 0.20424169989095795, 0.14484625943005086, 0.041436419595912516, 0.24452361399307848, 0.16223730578139012, 0.10913572453686761, 0.02244490189736502, 0.28101386754521324, 0.1447188854864281, 0.08051317205859555, -0.10928211151104834, 0.11452721514118215, 0.07974383228768905]
|
1,803.08763
|
A Deep Error Correction Network for Compressed Sensing MRI
|
Compressed sensing for magnetic resonance imaging (CS-MRI) exploits image
sparsity properties to reconstruct MRI from very few Fourier k-space
measurements. The goal is to minimize any structural errors in the
reconstruction that could have a negative impact on its diagnostic quality. To
this end, we propose a deep error correction network (DECN) for CS-MRI. The
DECN model consists of three parts, which we refer to as modules: a guide, or
template, module, an error correction module, and a data fidelity module.
Existing CS-MRI algorithms can serve as the template module for guiding the
reconstruction. Using this template as a guide, the error correction module
learns a convolutional neural network (CNN) to map the k-space data in a way
that adjusts for the reconstruction error of the template image. Our
experimental results show the proposed DECN CS-MRI reconstruction framework can
considerably improve upon existing inversion algorithms by supplementing with
an error-correcting CNN.
|
cs.CV
|
compressed sensing for magnetic resonance imaging csmri exploits image sparsity properties to reconstruct mri from very few fourier kspace measurements the goal is to minimize any structural errors in the reconstruction that could have a negative impact on its diagnostic quality to this end we propose a deep error correction network decn for csmri the decn model consists of three parts which we refer to as modules a guide or template module an error correction module and a data fidelity module existing csmri algorithms can serve as the template module for guiding the reconstruction using this template as a guide the error correction module learns a convolutional neural network cnn to map the kspace data in a way that adjusts for the reconstruction error of the template image our experimental results show the proposed decn csmri reconstruction framework can considerably improve upon existing inversion algorithms by supplementing with an errorcorrecting cnn
|
[['compressed', 'sensing', 'for', 'magnetic', 'resonance', 'imaging', 'csmri', 'exploits', 'image', 'sparsity', 'properties', 'to', 'reconstruct', 'mri', 'from', 'very', 'few', 'fourier', 'kspace', 'measurements', 'the', 'goal', 'is', 'to', 'minimize', 'any', 'structural', 'errors', 'in', 'the', 'reconstruction', 'that', 'could', 'have', 'a', 'negative', 'impact', 'on', 'its', 'diagnostic', 'quality', 'to', 'this', 'end', 'we', 'propose', 'a', 'deep', 'error', 'correction', 'network', 'decn', 'for', 'csmri', 'the', 'decn', 'model', 'consists', 'of', 'three', 'parts', 'which', 'we', 'refer', 'to', 'as', 'modules', 'a', 'guide', 'or', 'template', 'module', 'an', 'error', 'correction', 'module', 'and', 'a', 'data', 'fidelity', 'module', 'existing', 'csmri', 'algorithms', 'can', 'serve', 'as', 'the', 'template', 'module', 'for', 'guiding', 'the', 'reconstruction', 'using', 'this', 'template', 'as', 'a', 'guide', 'the', 'error', 'correction', 'module', 'learns', 'a', 'convolutional', 'neural', 'network', 'cnn', 'to', 'map', 'the', 'kspace', 'data', 'in', 'a', 'way', 'that', 'adjusts', 'for', 'the', 'reconstruction', 'error', 'of', 'the', 'template', 'image', 'our', 'experimental', 'results', 'show', 'the', 'proposed', 'decn', 'csmri', 'reconstruction', 'framework', 'can', 'considerably', 'improve', 'upon', 'existing', 'inversion', 'algorithms', 'by', 'supplementing', 'with', 'an', 'errorcorrecting', 'cnn']]
|
[-0.04456396160696614, -0.048195110521216056, -0.08954120720952552, 0.06455799135447338, -0.08349567517292815, -0.17062076978040058, 0.008138970475002432, 0.4338861181345207, -0.3288116385999894, -0.3272544685381138, 0.10403964963174173, -0.22967522136793034, -0.18455176463270473, 0.19384461308564274, -0.15889875729420277, 0.11911787094574558, 0.1434911741367819, 0.034742817242586654, -0.11285421952592913, -0.1925203422530067, 0.2620120549833538, 0.1324778260855507, 0.3306083950038309, -0.034068796558564665, 0.12416483528005416, 0.011318190396448831, -0.022586647023305, -0.029278627672349875, -0.0771303460654758, 0.1444150979772506, 0.2922705132313788, 0.1828669311065498, 0.28350988931534504, -0.4116875003918848, -0.23513773051614792, 0.04600670295366586, 0.16875484917815528, 0.1474749231672482, -0.08692985934140593, -0.2992888383369967, 0.09979308407062924, -0.1594643898043066, 0.03311720117772405, -0.13287582576570922, -0.09991881625097714, -0.045046311871006786, -0.3669894511028137, 0.021211083261419506, 0.042455236772877096, 0.03666143679362259, -0.08963405184481688, -0.11633812790329488, 0.03358907998070762, 0.1557273739680574, -0.051823154809601014, 0.12834887160913439, 0.17152005762157851, -0.1549892537712138, -0.12325014495938424, 0.3203972171720685, -0.06192661300671614, -0.2270951731352518, 0.12139948961072114, -0.0427515884022543, -0.11334778913312178, 0.14737567085069636, 0.2021955209306213, 0.05827125377138916, -0.1331280357241384, 0.02481562385778097, -0.00629091447231588, 0.1994824150318144, 0.0158796560525006, 0.016746044627680683, 0.1410142168748063, 0.21697911711422024, 0.05878783205049174, 0.1527558834776159, -0.21782665506517207, 0.051888054298446666, -0.2500535188218122, -0.14791200040463384, -0.21985598676992174, -0.04779626701539074, -0.09148506479773791, -0.17001052170572495, 0.464478679766126, 0.20345352270597258, 0.2189230292323138, 0.0871275932480279, 0.394693764443941, 0.013522616131940474, 0.16945970674671407, 0.04883261743180503, 0.22682672320858926, 0.09149244480260604, 0.08513785570024186, -0.16818316702249872, 0.0649990313840623, 0.10281843052165496]
|
1,803.08764
|
Robust semiparametric inference with missing data
|
Classical semiparametric inference with missing outcome data is not robust to
contamination of the observed data and a single observation can have
arbitrarily large influence on estimation of a parameter of interest. This
sensitivity is exacerbated when inverse probability weighting methods are used,
which may overweight contaminated observations. We introduce inverse
probability weighted, double robust and outcome regression estimators of
location and scale parameters, which are robust to contamination in the sense
that their influence function is bounded. We give asymptotic properties and
study finite sample behaviour. Our simulated experiments show that
contamination can be more serious a threat to the quality of inference than
model misspecification. An interesting aspect of our results is that the
auxiliary outcome model used to adjust for ignorable missingness by some of the
estimators, is also useful to protect against contamination. We also illustrate
through a case study how both adjustment to ignorable missingness and
protection against contamination are achieved through weighting schemes, which
can be contrasted to gain further insights.
|
stat.ME
|
classical semiparametric inference with missing outcome data is not robust to contamination of the observed data and a single observation can have arbitrarily large influence on estimation of a parameter of interest this sensitivity is exacerbated when inverse probability weighting methods are used which may overweight contaminated observations we introduce inverse probability weighted double robust and outcome regression estimators of location and scale parameters which are robust to contamination in the sense that their influence function is bounded we give asymptotic properties and study finite sample behaviour our simulated experiments show that contamination can be more serious a threat to the quality of inference than model misspecification an interesting aspect of our results is that the auxiliary outcome model used to adjust for ignorable missingness by some of the estimators is also useful to protect against contamination we also illustrate through a case study how both adjustment to ignorable missingness and protection against contamination are achieved through weighting schemes which can be contrasted to gain further insights
|
[['classical', 'semiparametric', 'inference', 'with', 'missing', 'outcome', 'data', 'is', 'not', 'robust', 'to', 'contamination', 'of', 'the', 'observed', 'data', 'and', 'a', 'single', 'observation', 'can', 'have', 'arbitrarily', 'large', 'influence', 'on', 'estimation', 'of', 'a', 'parameter', 'of', 'interest', 'this', 'sensitivity', 'is', 'exacerbated', 'when', 'inverse', 'probability', 'weighting', 'methods', 'are', 'used', 'which', 'may', 'overweight', 'contaminated', 'observations', 'we', 'introduce', 'inverse', 'probability', 'weighted', 'double', 'robust', 'and', 'outcome', 'regression', 'estimators', 'of', 'location', 'and', 'scale', 'parameters', 'which', 'are', 'robust', 'to', 'contamination', 'in', 'the', 'sense', 'that', 'their', 'influence', 'function', 'is', 'bounded', 'we', 'give', 'asymptotic', 'properties', 'and', 'study', 'finite', 'sample', 'behaviour', 'our', 'simulated', 'experiments', 'show', 'that', 'contamination', 'can', 'be', 'more', 'serious', 'a', 'threat', 'to', 'the', 'quality', 'of', 'inference', 'than', 'model', 'misspecification', 'an', 'interesting', 'aspect', 'of', 'our', 'results', 'is', 'that', 'the', 'auxiliary', 'outcome', 'model', 'used', 'to', 'adjust', 'for', 'ignorable', 'missingness', 'by', 'some', 'of', 'the', 'estimators', 'is', 'also', 'useful', 'to', 'protect', 'against', 'contamination', 'we', 'also', 'illustrate', 'through', 'a', 'case', 'study', 'how', 'both', 'adjustment', 'to', 'ignorable', 'missingness', 'and', 'protection', 'against', 'contamination', 'are', 'achieved', 'through', 'weighting', 'schemes', 'which', 'can', 'be', 'contrasted', 'to', 'gain', 'further', 'insights']]
|
[-0.04577458367897699, 0.06309831261847093, -0.1149753772508643, 0.13841192405266564, -0.1170010467556244, -0.17803780527779844, 0.07725862873450456, 0.41020064517677185, -0.2610824076447658, -0.31260329598705927, 0.14395612553263942, -0.26195882294957196, -0.1488300012452472, 0.19924215329141765, -0.14935040925413337, 0.06236930878018726, 0.092143906149344, -0.02445425738965323, -0.0444645161007135, -0.3144677050208149, 0.29093317761194676, 0.11351225441210196, 0.3121617825389533, 0.005256090257428363, 0.04843540808386699, -0.002912325576828893, -0.057583647727140946, 0.07013859722657341, -0.09908944858487488, 0.09144829541394588, 0.2781117916062564, 0.15234183803867146, 0.3342300721076122, -0.35259171066683553, -0.2384961149487979, 0.1495626075750964, 0.14593146545087507, 0.10881469668025809, -0.06208550688522397, -0.2839424473827448, 0.10720153163956801, -0.1579169417831846, -0.10440361439417713, -0.1247217767491301, -0.04777972600813174, -0.015069541178398324, -0.3642352156502803, 0.09338529335863296, 0.03482981050396784, 0.0252869090756881, -0.03031149368613267, -0.13788256496414095, -0.01864496945029872, 0.1032184582131477, 0.10895010379204403, -0.01873244829043679, 0.15889038992655313, -0.11997873527430065, -0.09718672738586201, 0.33629429029735797, -0.05025898945327182, -0.276092490560548, 0.15627115595079177, -0.11473389795540782, -0.12583789876020865, 0.11691580288123317, 0.22654603875080448, 0.08136506985683373, -0.15875533533125383, 0.0032402219952775645, -0.010058321426817757, 0.18288049084262667, 0.004911970727781425, 0.030561624203591112, 0.17037981710101138, 0.16012281700160108, 0.07257461525405015, 0.14707116061029676, -0.15032309605070798, -0.06628301869910545, -0.28044924581657626, -0.07406023556602181, -0.1621810174770207, 0.03530718705731564, -0.10316561133428936, -0.16491481264172023, 0.3532642823627252, 0.23506368434476294, 0.20096714165435356, 0.041396113202494464, 0.32375994943149256, 0.1084320273453894, 0.02783431535346913, 0.019044540356844664, 0.2218730894015324, 0.09361670332163305, -0.03369746045181583, -0.21595625003833258, 0.19057673820877213, -0.038640470741456795]
|
1,803.08765
|
On the weak uniqueness of "viscous incompressible fluid + rigid body"
system with Navier slip-with-friction conditions in a 2D bounded domain
|
The existence of weak solutions to the "viscous incompressible fluid + rigid
body" system with Navier slip-with-friction conditions in a 3D bounded domain
has been recently proved by G\'{e}rard-Varet and Hillairet in \cite{exi:GeH}.
In 2D for a fluid alone (without any rigid body) it is well-known since Leray
that weak solutions are unique, continuous in time with $ L^{2} $ regularity in
space and satisfy the energy equality.In this paper we prove that these
properties also hold for the 2D "viscous incompressible fluid + rigid body"
system.
|
math.AP
|
the existence of weak solutions to the viscous incompressible fluid rigid body system with navier slipwithfriction conditions in a 3d bounded domain has been recently proved by gerardvaret and hillairet in citeexigeh in 2d for a fluid alone without any rigid body it is wellknown since leray that weak solutions are unique continuous in time with l2 regularity in space and satisfy the energy equalityin this paper we prove that these properties also hold for the 2d viscous incompressible fluid rigid body system
|
[['the', 'existence', 'of', 'weak', 'solutions', 'to', 'the', 'viscous', 'incompressible', 'fluid', 'rigid', 'body', 'system', 'with', 'navier', 'slipwithfriction', 'conditions', 'in', 'a', '3d', 'bounded', 'domain', 'has', 'been', 'recently', 'proved', 'by', 'gerardvaret', 'and', 'hillairet', 'in', 'citeexigeh', 'in', '2d', 'for', 'a', 'fluid', 'alone', 'without', 'any', 'rigid', 'body', 'it', 'is', 'wellknown', 'since', 'leray', 'that', 'weak', 'solutions', 'are', 'unique', 'continuous', 'in', 'time', 'with', 'l2', 'regularity', 'in', 'space', 'and', 'satisfy', 'the', 'energy', 'equalityin', 'this', 'paper', 'we', 'prove', 'that', 'these', 'properties', 'also', 'hold', 'for', 'the', '2d', 'viscous', 'incompressible', 'fluid', 'rigid', 'body', 'system']]
|
[-0.15058211767241175, 0.07268150111683357, -0.08208593883678134, -0.011862013868435665, -0.0684687060183259, -0.15236328986047962, -0.11266511509534155, 0.30453601095503496, -0.29947586201223325, -0.23060365907997352, 0.150670186947761, -0.2341522674570665, -0.11300948722701934, 0.15692871636538594, -0.12979099973116393, 0.1740606261926048, 0.09943334275373707, -0.013376955057919762, -0.03463294332341096, -0.180334077116079, 0.35547099021021966, -0.08826150137637914, 0.24801064253911193, 0.022508115248961583, 0.13359085617322522, -0.03417976616513858, 0.04838723155244449, 0.09858040502948837, -0.23002913271822178, 0.05424767073795751, 0.21377660995521755, -0.006682522853629457, 0.24854482723009072, -0.48692252751393816, -0.28536247754078586, 0.10155783609751566, 0.10273225529889726, 0.09568334758327698, -0.06277057231133688, -0.2885866441568475, 0.15183290527029722, -0.12988384322976165, -0.18421080502118042, -0.07306912497697789, 0.10058180489404886, 0.06767588696316068, -0.2593293402252006, 0.15471858872973107, 0.1566234399581811, 0.05351344812201497, -0.20088853985416116, -0.02542373003081683, -0.051361540105534474, 0.09732846639199573, 0.0851636839179713, 0.0632050344231826, 0.028244805246315622, -0.17107607501007063, -0.011322120675978101, 0.3965255543043446, -0.057288603834163995, -0.3388892267313268, 0.27096726019639683, -0.15735686615822309, -0.08659101403490813, 0.14607225526929085, 0.1437880331132975, 0.1016494333298509, -0.14761458592989515, 0.15643584353268652, -0.14681958833732356, 0.14520970561806065, 0.10325838451239246, -0.03816540285163088, 0.14067722813306768, 0.14881039603992743, 0.11974375285668137, 0.1285147690501662, -0.03302991344272964, -0.08314232325848238, -0.2922556230519542, -0.21170695596317082, -0.1906279676211538, 0.05242923421808231, -0.06301478888619588, -0.18561991616324694, 0.29627331998774115, 0.08005101529214485, 0.10350950953355174, 0.06782519410329836, 0.2774562402685851, 0.08610715346847787, -0.009464390446535416, 0.13454271838597862, 0.30453742884191465, 0.1013702347179024, 0.173834273085734, -0.1670187231509682, 0.007617437412939322, 0.18388746880669646]
|
1,803.08766
|
Perturbative treatment of the luminosity distance
|
We derive a generalized luminosity distance versus redshift relation for a
linearly perturbed FLRW (Friedmann-Lemaitre-Robertson-Walker) metric with two
scalar mode excitations. We use two equivalent approaches, based on the Jacobi
map and the van Vleck determinant respectively. We apply the resultant formula
to two simple models - an exact FLRW universe and an approximate FLRW universe
perturbed by a single scalar mode sinusoidally varying with time. For both
models we derive a cosmographic expansion for d_L in terms of z. We comment on
the interpretation of our results and their possible application to more
realistic cosmological models.
|
gr-qc astro-ph.CO
|
we derive a generalized luminosity distance versus redshift relation for a linearly perturbed flrw friedmannlemaitrerobertsonwalker metric with two scalar mode excitations we use two equivalent approaches based on the jacobi map and the van vleck determinant respectively we apply the resultant formula to two simple models an exact flrw universe and an approximate flrw universe perturbed by a single scalar mode sinusoidally varying with time for both models we derive a cosmographic expansion for d_l in terms of z we comment on the interpretation of our results and their possible application to more realistic cosmological models
|
[['we', 'derive', 'a', 'generalized', 'luminosity', 'distance', 'versus', 'redshift', 'relation', 'for', 'a', 'linearly', 'perturbed', 'flrw', 'friedmannlemaitrerobertsonwalker', 'metric', 'with', 'two', 'scalar', 'mode', 'excitations', 'we', 'use', 'two', 'equivalent', 'approaches', 'based', 'on', 'the', 'jacobi', 'map', 'and', 'the', 'van', 'vleck', 'determinant', 'respectively', 'we', 'apply', 'the', 'resultant', 'formula', 'to', 'two', 'simple', 'models', 'an', 'exact', 'flrw', 'universe', 'and', 'an', 'approximate', 'flrw', 'universe', 'perturbed', 'by', 'a', 'single', 'scalar', 'mode', 'sinusoidally', 'varying', 'with', 'time', 'for', 'both', 'models', 'we', 'derive', 'a', 'cosmographic', 'expansion', 'for', 'd_l', 'in', 'terms', 'of', 'z', 'we', 'comment', 'on', 'the', 'interpretation', 'of', 'our', 'results', 'and', 'their', 'possible', 'application', 'to', 'more', 'realistic', 'cosmological', 'models']]
|
[-0.1256735401827124, 0.05760519166778977, -0.09490642054879572, 0.11156033339890807, -0.10913763914625936, -0.16673087272405004, -0.010957244609016925, 0.3829725762285913, -0.1995785048493417, -0.25588013178882346, 0.03881386978779725, -0.28279088711133227, -0.12119949488745381, 0.19692442489031237, 0.025817250532175724, 0.026307114923838526, 0.0004202889758744277, 0.010687881357929049, -0.13880570391408278, -0.2750826304157575, 0.38262762886006385, 0.074411221822326, 0.23307725139117488, -0.02438206716518228, 0.14423752353710975, -0.0350840675625174, -0.05287340023157109, 0.008914057378812382, -0.21648282808018848, 0.07130272670959432, 0.1560182059016597, 0.11617945577988091, 0.21590724020400862, -0.38260121810405207, -0.1759736231858066, 0.12212964991340414, 0.18274261406622827, 0.14925599825801328, -0.014428763529849675, -0.29403679311508313, 0.01253426902985666, -0.18059316515912846, -0.15669519300960624, -0.06836686770354088, 0.006430871377233416, -0.032635896265370924, -0.24458909058982195, 0.13940504910230325, -0.004188876851306607, -0.011416032910346985, -0.11644632643340931, -0.08016967769556989, 0.01948200743208872, 0.03967923535795611, 0.053373395199741935, 0.027887443677172996, 0.10475348965943947, -0.10328594229455727, -0.097266454838973, 0.3691327591089551, -0.1900356149781146, -0.23215629338907698, 0.14097874456153173, -0.0986023299677375, -0.09889493003720418, 0.02410704346160249, 0.14253025195709293, 0.1292473900054271, -0.15863236700048824, 0.13604633328516988, 0.029188883083406836, 0.15504722234860915, 0.09570412376585107, -0.009378212770873992, 0.24157658901579757, 0.0746038565703202, 0.00811422757882004, 0.1174902367371639, -0.04101254353008699, -0.1098178489246493, -0.35297541549274075, -0.1253590247615648, -0.14881420579998425, 0.07500079417756449, -0.23904984453550546, -0.21971740558607658, 0.374362888217244, 0.12562659620501412, 0.20567160334030632, 0.14740848955504285, 0.2609820366415079, 0.1267537528729008, -0.03128695790898443, 0.08860711652960163, 0.25858693394305493, 0.17197196079117325, 0.06817761759157293, -0.2143966130922005, -0.0538409206662133, 0.09873082803096622]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.